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

PubMed Central

2014-01-01

Background 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. Results 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. Conclusions 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 large Boolean networks with high average connectivity remains an open problem. PMID:24965213

Synchronization Analysis of Master-Slave Probabilistic Boolean Networks.

PubMed

Lu, Jianquan; Zhong, Jie; Li, Lulu; Ho, Daniel W C; Cao, Jinde

2015-08-28

In this paper, we analyze the synchronization problem of master-slave probabilistic Boolean networks (PBNs). The master Boolean network (BN) is a deterministic BN, while the slave BN is determined by a series of possible logical functions with certain probability at each discrete time point. In this paper, we firstly define the synchronization of master-slave PBNs with probability one, and then we investigate synchronization with probability one. By resorting to new approach called semi-tensor product (STP), the master-slave PBNs are expressed in equivalent algebraic forms. Based on the algebraic form, some necessary and sufficient criteria are derived to guarantee synchronization with probability one. Further, we study the synchronization of master-slave PBNs in probability. Synchronization in probability implies that for any initial states, the master BN can be synchronized by the slave BN with certain probability, while synchronization with probability one implies that master BN can be synchronized by the slave BN with probability one. Based on the equivalent algebraic form, some efficient conditions are derived to guarantee synchronization in probability. Finally, several numerical examples are presented to show the effectiveness of the main results.

Synchronization Analysis of Master-Slave Probabilistic Boolean Networks

PubMed Central

Lu, Jianquan; Zhong, Jie; Li, Lulu; Ho, Daniel W. C.; Cao, Jinde

2015-01-01

In this paper, we analyze the synchronization problem of master-slave probabilistic Boolean networks (PBNs). The master Boolean network (BN) is a deterministic BN, while the slave BN is determined by a series of possible logical functions with certain probability at each discrete time point. In this paper, we firstly define the synchronization of master-slave PBNs with probability one, and then we investigate synchronization with probability one. By resorting to new approach called semi-tensor product (STP), the master-slave PBNs are expressed in equivalent algebraic forms. Based on the algebraic form, some necessary and sufficient criteria are derived to guarantee synchronization with probability one. Further, we study the synchronization of master-slave PBNs in probability. Synchronization in probability implies that for any initial states, the master BN can be synchronized by the slave BN with certain probability, while synchronization with probability one implies that master BN can be synchronized by the slave BN with probability one. Based on the equivalent algebraic form, some efficient conditions are derived to guarantee synchronization in probability. Finally, several numerical examples are presented to show the effectiveness of the main results. PMID:26315380

On the Computation of Comprehensive Boolean Gröbner Bases

NASA Astrophysics Data System (ADS)

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.

Boolean Operations with Prism Algebraic Patches

PubMed Central

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

Polynomial algebra of discrete models in systems biology.

PubMed

Veliz-Cuba, Alan; Jarrah, Abdul Salam; Laubenbacher, Reinhard

2010-07-01

An increasing number of discrete mathematical models are being published in Systems Biology, ranging from Boolean network models to logical models and Petri nets. They are used to model a variety of biochemical networks, such as metabolic networks, gene regulatory networks and signal transduction networks. There is increasing evidence that such models can capture key dynamic features of biological networks and can be used successfully for hypothesis generation. This article provides a unified framework that can aid the mathematical analysis of Boolean network models, logical models and Petri nets. They can be represented as polynomial dynamical systems, which allows the use of a variety of mathematical tools from computer algebra for their analysis. Algorithms are presented for the translation into polynomial dynamical systems. Examples are given of how polynomial algebra can be used for the model analysis. alanavc@vt.edu Supplementary data are available at Bioinformatics online.

Feedback Controller Design for the Synchronization of Boolean Control Networks.

PubMed

Liu, Yang; Sun, Liangjie; Lu, Jianquan; Liang, Jinling

2016-09-01

This brief investigates the partial and complete synchronization of two Boolean control networks (BCNs). Necessary and sufficient conditions for partial and complete synchronization are established by the algebraic representations of logical dynamics. An algorithm is obtained to construct the feedback controller that guarantees the synchronization of master and slave BCNs. Two biological examples are provided to illustrate the effectiveness of the obtained results.

Algebraic grid adaptation method using non-uniform rational B-spline surface modeling

NASA Technical Reports Server (NTRS)

Yang, Jiann-Cherng; Soni, B. K.

1992-01-01

An algebraic adaptive grid system based on equidistribution law and utilized by the Non-Uniform Rational B-Spline (NURBS) surface for redistribution is presented. A weight function, utilizing a properly weighted boolean sum of various flow field characteristics is developed. Computational examples are presented to demonstrate the success of this technique.

A real signal and its states

NASA Astrophysics Data System (ADS)

Basiladze, S. G.

2017-05-01

The paper describes the general physical theory of signals, carriers of information, which supplements Shannon's abstract classical theory and is applicable in much broader fields, including nuclear physics. It is shown that in the absence of classical noise its place should be taken by the physical threshold of signal perception for objects of both macrocosm and microcosm. The signal perception threshold allows the presence of subthreshold (virtual) signal states. For these states, Boolean algebra of logic ( A = 0/1) is transformed into the "algebraic logic" of probabilities (0 ≤ a ≤ 1). The similarity and difference of virtual states of macroand microsignals are elucidated. "Real" and "quantum" information for computers is considered briefly. The maximum information transmission rate is estimated based on physical constants.

Cryptographic Properties of Monotone Boolean Functions

DTIC Science & Technology

2016-01-01

Algebraic attacks on stream ciphers with linear feedback, in: Advances in Cryptology (Eurocrypt 2003), Lecture Notes in Comput. Sci. 2656, Springer, Berlin...spectrum, algebraic immu- nity MSC 2010: 06E30, 94C10, 94A60, 11T71, 05E99 || Communicated by: Carlo Blundo 1 Introduction Let F 2 be the prime eld of...7]. For the reader’s convenience, we recall some basic notions below. Any f ∈ Bn can be expressed in algebraic normal form (ANF) as f(x 1 , x 2

Electrical Circuits in the Mathematics/Computer Science Classroom.

ERIC Educational Resources Information Center

McMillan, Robert D.

1988-01-01

Shows how, with little or no electrical background, students can apply Boolean algebra concepts to design and build integrated electrical circuits in the classroom that will reinforce important ideas in mathematics. (PK)

Cellular Automata Generalized To An Inferential System

NASA Astrophysics Data System (ADS)

Blower, David J.

2007-11-01

Stephen Wolfram popularized elementary one-dimensional cellular automata in his book, A New Kind of Science. Among many remarkable things, he proved that one of these cellular automata was a Universal Turing Machine. Such cellular automata can be interpreted in a different way by viewing them within the context of the formal manipulation rules from probability theory. Bayes's Theorem is the most famous of such formal rules. As a prelude, we recapitulate Jaynes's presentation of how probability theory generalizes classical logic using modus ponens as the canonical example. We emphasize the important conceptual standing of Boolean Algebra for the formal rules of probability manipulation and give an alternative demonstration augmenting and complementing Jaynes's derivation. We show the complementary roles played in arguments of this kind by Bayes's Theorem and joint probability tables. A good explanation for all of this is afforded by the expansion of any particular logic function via the disjunctive normal form (DNF). The DNF expansion is a useful heuristic emphasized in this exposition because such expansions point out where relevant 0s should be placed in the joint probability tables for logic functions involving any number of variables. It then becomes a straightforward exercise to rely on Boolean Algebra, Bayes's Theorem, and joint probability tables in extrapolating to Wolfram's cellular automata. Cellular automata are seen as purely deductive systems, just like classical logic, which probability theory is then able to generalize. Thus, any uncertainties which we might like to introduce into the discussion about cellular automata are handled with ease via the familiar inferential path. Most importantly, the difficult problem of predicting what cellular automata will do in the far future is treated like any inferential prediction problem.

Toward Question-Asking Machines: The Logic of Questions and the Inquiry Calculus

NASA Technical Reports Server (NTRS)

Knuth,Kevin H.

2005-01-01

For over a century, the study of logic has focused on the algebra of logical statements. This work, first performed by George Boole, has led to the development of modern computers, and was shown by Richard T. Cox to be the foundation of Bayesian inference. Meanwhile the logic of questions has been much neglected. For our computing machines to be truly intelligent, they need to be able to ask relevant questions. In this paper I will show how the Boolean lattice of logical statements gives rise to the free distributive lattice of questions thus defining their algebra. Furthermore, there exists a quantity analogous to probability, called relevance, which quantifies the degree to which one question answers another. I will show that relevance is not only a natural generalization of information theory, but also forms its foundation.

Alternative probability theories for cognitive psychology.

PubMed

Narens, Louis

2014-01-01

Various proposals for generalizing event spaces for probability functions have been put forth in the mathematical, scientific, and philosophic literatures. In cognitive psychology such generalizations are used for explaining puzzling results in decision theory and for modeling the influence of context effects. This commentary discusses proposals for generalizing probability theory to event spaces that are not necessarily boolean algebras. Two prominent examples are quantum probability theory, which is based on the set of closed subspaces of a Hilbert space, and topological probability theory, which is based on the set of open sets of a topology. Both have been applied to a variety of cognitive situations. This commentary focuses on how event space properties can influence probability concepts and impact cognitive modeling. Copyright © 2013 Cognitive Science Society, Inc.

Phased-mission system analysis using Boolean algebraic methods

NASA Technical Reports Server (NTRS)

Somani, Arun K.; Trivedi, Kishor S.

1993-01-01

Most reliability analysis techniques and tools assume that a system is used for a mission consisting of a single phase. However, multiple phases are natural in many missions. The failure rates of components, system configuration, and success criteria may vary from phase to phase. In addition, the duration of a phase may be deterministic or random. Recently, several researchers have addressed the problem of reliability analysis of such systems using a variety of methods. A new technique for phased-mission system reliability analysis based on Boolean algebraic methods is described. Our technique is computationally efficient and is applicable to a large class of systems for which the failure criterion in each phase can be expressed as a fault tree (or an equivalent representation). Our technique avoids state space explosion that commonly plague Markov chain-based analysis. A phase algebra to account for the effects of variable configurations and success criteria from phase to phase was developed. Our technique yields exact (as opposed to approximate) results. The use of our technique was demonstrated by means of an example and present numerical results to show the effects of mission phases on the system reliability.

Topics for Mathematics Clubs.

ERIC Educational Resources Information Center

Dalton, LeRoy C., Ed.; Snyder, Henry D., Ed.

The ten chapters in this booklet cover topics not ordinarily discussed in the classroom: Fibonacci sequences, projective geometry, groups, infinity and transfinite numbers, Pascal's Triangle, topology, experiments with natural numbers, non-Euclidean geometries, Boolean algebras, and the imaginary and the infinite in geometry. Each chapter is…

Algebra for Enterprise Ontology: towards analysis and synthesis of enterprise models

NASA Astrophysics Data System (ADS)

Suga, Tetsuya; Iijima, Junichi

2018-03-01

Enterprise modeling methodologies have made enterprises more likely to be the object of systems engineering rather than craftsmanship. However, the current state of research in enterprise modeling methodologies lacks investigations of the mathematical background embedded in these methodologies. Abstract algebra, a broad subfield of mathematics, and the study of algebraic structures may provide interesting implications in both theory and practice. Therefore, this research gives an empirical challenge to establish an algebraic structure for one aspect model proposed in Design & Engineering Methodology for Organizations (DEMO), which is a major enterprise modeling methodology in the spotlight as a modeling principle to capture the skeleton of enterprises for developing enterprise information systems. The results show that the aspect model behaves well in the sense of algebraic operations and indeed constructs a Boolean algebra. This article also discusses comparisons with other modeling languages and suggests future work.

Boolean Approaches in Digital Diagnosis

DTIC Science & Technology

1989-12-04

Automation Conference, pages 64-70, 1983. 16. Barry W. Johnson. Design and A nalysis of Fault-Tolerant Digital Systems. Addison- Wesley Publishing...Mitchell. On a new algebra of logic. In C.S. Peirce, edhitor, Studies in Logic. Little, Brown. Boston. 1883. 2:3. Roger S. Pressman . Softwrare Engineering

Observability of Boolean multiplex control networks

NASA Astrophysics Data System (ADS)

Wu, Yuhu; Xu, Jingxue; Sun, Xi-Ming; Wang, Wei

2017-04-01

Boolean multiplex (multilevel) networks (BMNs) are currently receiving considerable attention as theoretical arguments for modeling of biological systems and system level analysis. Studying control-related problems in BMNs may not only provide new views into the intrinsic control in complex biological systems, but also enable us to develop a method for manipulating biological systems using exogenous inputs. In this article, the observability of the Boolean multiplex control networks (BMCNs) are studied. First, the dynamical model and structure of BMCNs with control inputs and outputs are constructed. By using of Semi-Tensor Product (STP) approach, the logical dynamics of BMCNs is converted into an equivalent algebraic representation. Then, the observability of the BMCNs with two different kinds of control inputs is investigated by giving necessary and sufficient conditions. Finally, examples are given to illustrate the efficiency of the obtained theoretical results.

Probabilistic Relational Structures and Their Applications

ERIC Educational Resources Information Center

Domotor, Zoltan

The principal objects of the investigation reported were, first, to study qualitative probability relations on Boolean algebras, and secondly, to describe applications in the theories of probability logic, information, automata, and probabilistic measurement. The main contribution of this work is stated in 10 definitions and 20 theorems. The basic…

A Module Language for Typing by Contracts

NASA Technical Reports Server (NTRS)

Glouche, Yann; Talpin, Jean-Pierre; LeGuernic, Paul; Gautier, Thierry

2009-01-01

Assume-guarantee reasoning is a popular and expressive paradigm for modular and compositional specification of programs. It is becoming a fundamental concept in some computer-aided design tools for embedded system design. In this paper, we elaborate foundations for contract-based embedded system design by proposing a general-purpose module language based on a Boolean algebra allowing to define contracts. In this framework, contracts are used to negotiate the correctness of assumptions made on the definition of a component at the point where it is used and provides guarantees to its environment. We illustrate this presentation with the specification of a simplified 4-stroke engine model.

Fundamentals of Digital Logic.

ERIC Educational Resources Information Center

Noell, Monica L.

This course is designed to prepare electronics personnel for further training in digital techniques, presenting need to know information that is basic to any maintenance course on digital equipment. It consists of seven study units: (1) binary arithmetic; (2) boolean algebra; (3) logic gates; (4) logic flip-flops; (5) nonlogic circuits; (6)…

Cryptographic Properties of the Hidden Weighted Bit Function

DTIC Science & Technology

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

Questions Revisited: A Close Examination of Calculus of Inference and Inquiry

NASA Technical Reports Server (NTRS)

Knuth, Kevin H.; Koga, Dennis (Technical Monitor)

2003-01-01

In this paper I examine more closely the way in which probability theory, the calculus of inference, is derived from the Boolean lattice structure of logical assertions ordered by implication. I demonstrate how the duality between the logical conjunction and disjunction in Boolean algebra is lost when deriving the probability calculus. In addition, I look more closely at the other lattice identities to verify that they are satisfied by the probability calculus. Last, I look towards developing the calculus of inquiry demonstrating that there is a sum and product rule for the relevance measure as well as a Bayes theorem. Current difficulties in deriving the complete inquiry calculus will also be discussed.

Extending Clause Learning of SAT Solvers with Boolean Gröbner Bases

NASA Astrophysics Data System (ADS)

Zengler, Christoph; Küchlin, Wolfgang

We extend clause learning as performed by most modern SAT Solvers by integrating the computation of Boolean Gröbner bases into the conflict learning process. Instead of learning only one clause per conflict, we compute and learn additional binary clauses from a Gröbner basis of the current conflict. We used the Gröbner basis engine of the logic package Redlog contained in the computer algebra system Reduce to extend the SAT solver MiniSAT with Gröbner basis learning. Our approach shows a significant reduction of conflicts and a reduction of restarts and computation time on many hard problems from the SAT 2009 competition.

GENERAL A Hierarchy of Compatibility and Comeasurability Levels in Quantum Logics with Unique Conditional Probabilities

NASA Astrophysics Data System (ADS)

Gerd, Niestegge

2010-12-01

In the quantum mechanical Hilbert space formalism, the probabilistic interpretation is a later ad-hoc add-on, more or less enforced by the experimental evidence, but not motivated by the mathematical model itself. A model involving a clear probabilistic interpretation from the very beginning is provided by the quantum logics with unique conditional probabilities. It includes the projection lattices in von Neumann algebras and here probability conditionalization becomes identical with the state transition of the Lüders-von Neumann measurement process. This motivates the definition of a hierarchy of five compatibility and comeasurability levels in the abstract setting of the quantum logics with unique conditional probabilities. Their meanings are: the absence of quantum interference or influence, the existence of a joint distribution, simultaneous measurability, and the independence of the final state after two successive measurements from the sequential order of these two measurements. A further level means that two elements of the quantum logic (events) belong to the same Boolean subalgebra. In the general case, the five compatibility and comeasurability levels appear to differ, but they all coincide in the common Hilbert space formalism of quantum mechanics, in von Neumann algebras, and in some other cases.

Crisp Sets and Boolean Algebra: A Research Strategy for Student Affairs

ERIC Educational Resources Information Center

Banning, James; Eversole, Barbara; Most, David; Kuk, Linda

2008-01-01

A review of student affairs journals clearly points out that most, if not all, research strategies within the field fall within traditional approaches based on quantitative methods and, more recently, qualitative methods. The purpose of this article is not to discourage use of these time honored research strategies, but to suggest the inclusion of…

An Investigation of the Mathematical Models of Piaget's Psychological Theory of Cognitive Learning. Final Report.

ERIC Educational Resources Information Center

Kalechofsky, Robert

This research paper proposes several mathematical models which help clarify Piaget's theory of cognition on the concrete and formal operational stages. Some modified lattice models were used for the concrete stage and a combined Boolean Algebra and group theory model was used for the formal stage. The researcher used experiments cited in the…

Discrete interference modeling via boolean algebra.

PubMed

Beckhoff, Gerhard

2011-01-01

Two types of boolean functions are considered, the locus function of n variables, and the interval function of ν = n - 1 variables. A 1-1 mapping is given that takes elements (cells) of the interval function to antidual pairs of elements in the locus function, and vice versa. A set of ν binary codewords representing the intervals are defined and used to generate the codewords of all genomic regions. Next a diallelic three-point system is reviewed in the light of boolean functions, which leads to redefining complete interference by a logic function. Together with the upper bound of noninterference already defined by a boolean function, it confines the region of interference. Extensions of these two functions to any finite number of ν are straightforward, but have been also made in terms of variables taken from the inclusion-exclusion principle (expressing "at least" and "exactly equal to" a decimal integer). Two coefficients of coincidence for systems with more than three loci are defined and discussed, one using the average of several individual coefficients and the other taking as coefficient a real number between zero and one. Finally, by way of a malfunction of the mod-2 addition, it is shown that a four-point system may produce two different functions, one of which exhibiting loss of a class of odd recombinants.

On Various Nonlinearity Measures for Boolean Functions*

PubMed Central

Boyar, Joan; Find, Magnus Gausdal; Peralta, René

2016-01-01

A necessary condition for the security of cryptographic functions is to be “sufficiently distant” from linear, and cryptographers have proposed several measures for this distance. In this paper, we show that six common measures, nonlinearity, algebraic degree, annihilator immunity, algebraic thickness, normality, and multiplicative complexity, are incomparable in the sense that for each pair of measures, μ1, μ2, there exist functions f1, f2 with f1 being more nonlinear than f2 according to μ1, but less nonlinear according to μ2. We also present new connections between two of these measures. Additionally, we give a lower bound on the multiplicative complexity of collision-free functions. PMID:27458499

Cryptographic Boolean Functions with Biased Inputs

DTIC Science & Technology

2015-07-31

theory of random graphs developed by Erdős and Rényi [2]. The graph properties in a random graph expressed as such Boolean functions are used by...distributed Bernoulli variates with the parameter p. Since our scope is within the area of cryptography , we initiate an analysis of cryptographic...Boolean functions with biased inputs, which we refer to as µp-Boolean functions, is a common generalization of Boolean functions which stems from the

Classification scheme and prevention measures for caught-in-between occupational fatalities.

PubMed

Chi, Chia-Fen; Lin, Syuan-Zih

2018-04-01

The current study analyzed 312 caught-in-between fatalities caused by machinery and vehicles. A comprehensive and mutually exclusive coding scheme was developed to analyze and code each caught-in-between fatality in terms of age, gender, experience of the victim, type of industry, source of injury, and causes for these accidents. Boolean algebra analysis was applied on these 312 caught-in-between fatalities to derive minimal cut set (MCS) causes associated with each source of injury. Eventually, contributing factors and common accident patterns associated with (1) special process machinery including textile, printing, packaging machinery, (2) metal, woodworking, and special material machinery, (3) conveyor, (4) vehicle, (5) crane, (6) construction machinery, and (7) elevator can be divided into three major groups through Boolean algebra and MCS analysis. The MCS causes associated with conveyor share the same primary causes as those of the special process machinery including textile, printing, packaging and metal, woodworking, and special material machinery. These fatalities can be eliminated by focusing on the prevention measures associated with lack of safeguards, working on a running machine or process, unintentional activation, unsafe posture or position, unsafe clothing, and defective safeguards. Other precise and effective intervention can be developed based on the identified groups of accident causes associated with each source of injury. Copyright © 2017 Elsevier Ltd. All rights reserved.

The phase topology of a special case of Goryachev integrability in rigid body dynamics

DOE Office of Scientific and Technical Information (OSTI.GOV)

Ryabov, P. E., E-mail: orelryabov@mail.ru

2014-07-31

The phase topology of a special case of Goryachev integrability in the problem of motion of a rigid body in a fluid is investigated using the method of Boolean functions, which was developed by Kharlamov for algebraically separated systems. The bifurcation diagram of the moment map is found and the Fomenko invariant, which classifies the systems up to rough Liouville equivalence, is specified. Bibliography: 15 titles. (paper)

Computing the Algebraic Immunity of Boolean Functions on the SRC-6 Reconfigurable Computer

DTIC Science & Technology

2012-03-01

and Budget, Paperwork Reduction Project (0704-0188) Washington DC 20503. 1. AGENCY USE ONLY (Leave blank) 2 . REPORT DATE March 2012 3. REPORT... CA 93943-5000 8. PERFORMING ORGANIZATION REPORT NUMBER 9. SPONSORING /MONITORING AGENCY NAME(S) AND ADDRESS(ES) N/A 10. SPONSORING...developed for this conversion. This reduced form requires many fewer gates and has ( )n delay versus ( 2 ) n delay for a full transeunt triangle

Anthropomorphic robot for recognition and drawing generalized object images

NASA Astrophysics Data System (ADS)

Ginzburg, Vera M.

1998-10-01

The process of recognition, for instance, understanding the text, written by different fonts, consists in the depriving of the individual attributes of the letters in the particular font. It is shown that such process, in Nature and technique, can be provided by the narrowing the spatial frequency of the object's image by its defocusing. In defocusing images remain only areas, so-called Informative Fragments (IFs), which all together form the generalized (stylized) image of many identical objects. It is shown that the variety of shapes of IFs is restricted and can be presented by `Geometrical alphabet'. The `letters' for this alphabet can be created using two basic `genetic' figures: a stripe and round spot. It is known from physiology that the special cells of visual cortex response to these particular figures. The prototype of such `genetic' alphabet has been made using Boolean algebra (Venn's diagrams). The algorithm for drawing the letter's (`genlet's') shape in this alphabet and generalized images of objects (for example, `sleeping cat'), are given. A scheme of an anthropomorphic robot is shown together with results of model computer experiment of the robot's action--`drawing' the generalized image.

Development of an optical parallel logic device and a half-adder circuit for digital optical processing

NASA Technical Reports Server (NTRS)

Athale, R. A.; Lee, S. H.

1978-01-01

The paper describes the fabrication and operation of an optical parallel logic (OPAL) device which performs Boolean algebraic operations on binary images. Several logic operations on two input binary images were demonstrated using an 8 x 8 device with a CdS photoconductor and a twisted nematic liquid crystal. Two such OPAL devices can be interconnected to form a half-adder circuit which is one of the essential components of a CPU in a digital signal processor.

MONOMIALS AND BASIN CYLINDERS FOR NETWORK DYNAMICS.

PubMed

Austin, Daniel; Dinwoodie, Ian H

We describe methods to identify cylinder sets inside a basin of attraction for Boolean dynamics of biological networks. Such sets are used for designing regulatory interventions that make the system evolve towards a chosen attractor, for example initiating apoptosis in a cancer cell. We describe two algebraic methods for identifying cylinders inside a basin of attraction, one based on the Groebner fan that finds monomials that define cylinders and the other on primary decomposition. Both methods are applied to current examples of gene networks.

MONOMIALS AND BASIN CYLINDERS FOR NETWORK DYNAMICS

PubMed Central

AUSTIN, DANIEL; DINWOODIE, IAN H

2014-01-01

We describe methods to identify cylinder sets inside a basin of attraction for Boolean dynamics of biological networks. Such sets are used for designing regulatory interventions that make the system evolve towards a chosen attractor, for example initiating apoptosis in a cancer cell. We describe two algebraic methods for identifying cylinders inside a basin of attraction, one based on the Groebner fan that finds monomials that define cylinders and the other on primary decomposition. Both methods are applied to current examples of gene networks. PMID:25620893

An improved lambda-scheme for one-dimensional flows

NASA Technical Reports Server (NTRS)

Moretti, G.; Dipiano, M. T.

1983-01-01

A code for the calculation of one-dimensional flows is presented, which combines a simple and efficient version of the lambda-scheme with tracking of discontinuities. The latter is needed to identify points where minor departures from the basic integration scheme are applied to prevent infiltration of numerical errors. Such a tracking is obtained via a systematic application of Boolean algebra. It is, therefore, very efficient. Fifteen examples are presented and discussed in detail. The results are exceptionally good. All discontinuites are captured within one mesh interval.

Smart molecules at work--mimicking advanced logic operations.

PubMed

Andréasson, Joakim; Pischel, Uwe

2010-01-01

Molecular logic is an interdisciplinary research field, which has captured worldwide interest. This tutorial review gives a brief introduction into molecular logic and Boolean algebra. This serves as the basis for a discussion of the state-of-the-art and future challenges in the field. Representative examples from the most recent literature including adders/subtractors, multiplexers/demultiplexers, encoders/decoders, and sequential logic devices (keypad locks) are highlighted. Other horizons, such as the utility of molecular logic in bio-related applications, are discussed as well.

Modeling the Normal and Neoplastic Cell Cycle with 'Realistic Boolean Genetic Networks': Their Application for Understanding Carcinogenesis and Assessing Therapeutic Strategies

NASA Technical Reports Server (NTRS)

Szallasi, Zoltan; Liang, Shoudan

2000-01-01

In this paper we show how Boolean genetic networks could be used to address complex problems in cancer biology. First, we describe a general strategy to generate Boolean genetic networks that incorporate all relevant biochemical and physiological parameters and cover all of their regulatory interactions in a deterministic manner. Second, we introduce 'realistic Boolean genetic networks' that produce time series measurements very similar to those detected in actual biological systems. Third, we outline a series of essential questions related to cancer biology and cancer therapy that could be addressed by the use of 'realistic Boolean genetic network' modeling.

Multilayer neural networks with extensively many hidden units.

PubMed

Rosen-Zvi, M; Engel, A; Kanter, I

2001-08-13

The information processing abilities of a multilayer neural network with a number of hidden units scaling as the input dimension are studied using statistical mechanics methods. The mapping from the input layer to the hidden units is performed by general symmetric Boolean functions, whereas the hidden layer is connected to the output by either discrete or continuous couplings. Introducing an overlap in the space of Boolean functions as order parameter, the storage capacity is found to scale with the logarithm of the number of implementable Boolean functions. The generalization behavior is smooth for continuous couplings and shows a discontinuous transition to perfect generalization for discrete ones.

State feedback control design for Boolean networks.

PubMed

Liu, Rongjie; Qian, Chunjiang; Liu, Shuqian; Jin, Yu-Fang

2016-08-26

Driving Boolean networks to desired states is of paramount significance toward our ultimate goal of controlling the progression of biological pathways and regulatory networks. Despite recent computational development of controllability of general complex networks and structural controllability of Boolean networks, there is still a lack of bridging the mathematical condition on controllability to real boolean operations in a network. Further, no realtime control strategy has been proposed to drive a Boolean network. In this study, we applied semi-tensor product to represent boolean functions in a network and explored controllability of a boolean network based on the transition matrix and time transition diagram. We determined the necessary and sufficient condition for a controllable Boolean network and mapped this requirement in transition matrix to real boolean functions and structure property of a network. An efficient tool is offered to assess controllability of an arbitrary Boolean network and to determine all reachable and non-reachable states. We found six simplest forms of controllable 2-node Boolean networks and explored the consistency of transition matrices while extending these six forms to controllable networks with more nodes. Importantly, we proposed the first state feedback control strategy to drive the network based on the status of all nodes in the network. Finally, we applied our reachability condition to the major switch of P53 pathway to predict the progression of the pathway and validate the prediction with published experimental results. This control strategy allowed us to apply realtime control to drive Boolean networks, which could not be achieved by the current control strategy for Boolean networks. Our results enabled a more comprehensive understanding of the evolution of Boolean networks and might be extended to output feedback control design.

Generalization and capacity of extensively large two-layered perceptrons.

PubMed

Rosen-Zvi, Michal; Engel, Andreas; Kanter, Ido

2002-09-01

The generalization ability and storage capacity of a treelike two-layered neural network with a number of hidden units scaling as the input dimension is examined. The mapping from the input to the hidden layer is via Boolean functions; the mapping from the hidden layer to the output is done by a perceptron. The analysis is within the replica framework where an order parameter characterizing the overlap between two networks in the combined space of Boolean functions and hidden-to-output couplings is introduced. The maximal capacity of such networks is found to scale linearly with the logarithm of the number of Boolean functions per hidden unit. The generalization process exhibits a first-order phase transition from poor to perfect learning for the case of discrete hidden-to-output couplings. The critical number of examples per input dimension, alpha(c), at which the transition occurs, again scales linearly with the logarithm of the number of Boolean functions. In the case of continuous hidden-to-output couplings, the generalization error decreases according to the same power law as for the perceptron, with the prefactor being different.

A general-purpose approach to computer-aided dynamic analysis of a flexible helicopter

NASA Technical Reports Server (NTRS)

Agrawal, Om P.

1988-01-01

A general purpose mathematical formulation is described for dynamic analysis of a helicopter consisting of flexible and/or rigid bodies that undergo large translations and rotations. Rigid body and elastic sets of generalized coordinates are used. The rigid body coordinates define the location and the orientation of a body coordinate frame (global frame) with respect to an inertial frame. The elastic coordinates are introduced using a finite element approach in order to model flexible components. The compatibility conditions between two adjacent elements in a flexible body are imposed using a Boolean matrix, whereas the compatibility conditions between two adjacent bodies are imposed using the Lagrange multiplier approach. Since the form of the constraint equations depends upon the type of kinematic joint and involves only the generalized coordinates of the two participating elements, then a library of constraint elements can be developed to impose the kinematic constraint in an automated fashion. For the body constraints, the Lagrange multipliers yield the reaction forces and torques of the bodies at the joints. The virtual work approach is used to derive the equations of motion, which are a system of differential and algebraic equations that are highly nonlinear. The formulation presented is general and is compared with hard-wired formulations commonly used in helicopter analysis.

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

PubMed

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.

The detection and stabilisation of limit cycle for deterministic finite automata

NASA Astrophysics Data System (ADS)

Han, Xiaoguang; Chen, Zengqiang; Liu, Zhongxin; Zhang, Qing

2018-04-01

In this paper, the topological structure properties of deterministic finite automata (DFA), under the framework of the semi-tensor product of matrices, are investigated. First, the dynamics of DFA are converted into a new algebraic form as a discrete-time linear system by means of Boolean algebra. Using this algebraic description, the approach of calculating the limit cycles of different lengths is given. Second, we present two fundamental concepts, namely, domain of attraction of limit cycle and prereachability set. Based on the prereachability set, an explicit solution of calculating domain of attraction of a limit cycle is completely characterised. Third, we define the globally attractive limit cycle, and then the necessary and sufficient condition for verifying whether all state trajectories of a DFA enter a given limit cycle in a finite number of transitions is given. Fourth, the problem of whether a DFA can be stabilised to a limit cycle by the state feedback controller is discussed. Criteria for limit cycle-stabilisation are established. All state feedback controllers which implement the minimal length trajectories from each state to the limit cycle are obtained by using the proposed algorithm. Finally, an illustrative example is presented to show the theoretical results.

Mathematical biology modules based on modern molecular biology and modern discrete mathematics.

PubMed

Robeva, Raina; Davies, Robin; Hodge, Terrell; Enyedi, Alexander

2010-01-01

We describe an ongoing collaborative curriculum materials development project between Sweet Briar College and Western Michigan University, with support from the National Science Foundation. We present a collection of modules under development that can be used in existing mathematics and biology courses, and we address a critical national need to introduce students to mathematical methods beyond the interface of biology with calculus. Based on ongoing research, and designed to use the project-based-learning approach, the modules highlight applications of modern discrete mathematics and algebraic statistics to pressing problems in molecular biology. For the majority of projects, calculus is not a required prerequisite and, due to the modest amount of mathematical background needed for some of the modules, the materials can be used for an early introduction to mathematical modeling. At the same time, most modules are connected with topics in linear and abstract algebra, algebraic geometry, and probability, and they can be used as meaningful applied introductions into the relevant advanced-level mathematics courses. Open-source software is used to facilitate the relevant computations. As a detailed example, we outline a module that focuses on Boolean models of the lac operon network.

Mathematical Biology Modules Based on Modern Molecular Biology and Modern Discrete Mathematics

PubMed Central

Davies, Robin; Hodge, Terrell; Enyedi, Alexander

2010-01-01

We describe an ongoing collaborative curriculum materials development project between Sweet Briar College and Western Michigan University, with support from the National Science Foundation. We present a collection of modules under development that can be used in existing mathematics and biology courses, and we address a critical national need to introduce students to mathematical methods beyond the interface of biology with calculus. Based on ongoing research, and designed to use the project-based-learning approach, the modules highlight applications of modern discrete mathematics and algebraic statistics to pressing problems in molecular biology. For the majority of projects, calculus is not a required prerequisite and, due to the modest amount of mathematical background needed for some of the modules, the materials can be used for an early introduction to mathematical modeling. At the same time, most modules are connected with topics in linear and abstract algebra, algebraic geometry, and probability, and they can be used as meaningful applied introductions into the relevant advanced-level mathematics courses. Open-source software is used to facilitate the relevant computations. As a detailed example, we outline a module that focuses on Boolean models of the lac operon network. PMID:20810955

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

PubMed

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.

An algebra-based method for inferring gene regulatory networks.

PubMed

Vera-Licona, Paola; Jarrah, Abdul; Garcia-Puente, Luis David; McGee, John; Laubenbacher, Reinhard

2014-03-26

The inference of gene regulatory networks (GRNs) from experimental observations is at the heart of systems biology. This includes the inference of both the network topology and its dynamics. While there are many algorithms available to infer the network topology from experimental data, less emphasis has been placed on methods that infer network dynamics. Furthermore, since the network inference problem is typically underdetermined, it is essential to have the option of incorporating into the inference process, prior knowledge about the network, along with an effective description of the search space of dynamic models. Finally, it is also important to have an understanding of how a given inference method is affected by experimental and other noise in the data used. This paper contains a novel inference algorithm using the algebraic framework of Boolean polynomial dynamical systems (BPDS), meeting all these requirements. The algorithm takes as input time series data, including those from network perturbations, such as knock-out mutant strains and RNAi experiments. It allows for the incorporation of prior biological knowledge while being robust to significant levels of noise in the data used for inference. It uses an evolutionary algorithm for local optimization with an encoding of the mathematical models as BPDS. The BPDS framework allows an effective representation of the search space for algebraic dynamic models that improves computational performance. The algorithm is validated with both simulated and experimental microarray expression profile data. Robustness to noise is tested using a published mathematical model of the segment polarity gene network in Drosophila melanogaster. Benchmarking of the algorithm is done by comparison with a spectrum of state-of-the-art network inference methods on data from the synthetic IRMA network to demonstrate that our method has good precision and recall for the network reconstruction task, while also predicting several of the dynamic patterns present in the network. Boolean polynomial dynamical systems provide a powerful modeling framework for the reverse engineering of gene regulatory networks, that enables a rich mathematical structure on the model search space. A C++ implementation of the method, distributed under LPGL license, is available, together with the source code, at http://www.paola-vera-licona.net/Software/EARevEng/REACT.html.

Identification of Boolean Network Models From Time Series Data Incorporating Prior Knowledge.

PubMed

Leifeld, Thomas; Zhang, Zhihua; Zhang, Ping

2018-01-01

Motivation: Mathematical models take an important place in science and engineering. A model can help scientists to explain dynamic behavior of a system and to understand the functionality of system components. Since length of a time series and number of replicates is limited by the cost of experiments, Boolean networks as a structurally simple and parameter-free logical model for gene regulatory networks have attracted interests of many scientists. In order to fit into the biological contexts and to lower the data requirements, biological prior knowledge is taken into consideration during the inference procedure. In the literature, the existing identification approaches can only deal with a subset of possible types of prior knowledge. Results: We propose a new approach to identify Boolean networks from time series data incorporating prior knowledge, such as partial network structure, canalizing property, positive and negative unateness. Using vector form of Boolean variables and applying a generalized matrix multiplication called the semi-tensor product (STP), each Boolean function can be equivalently converted into a matrix expression. Based on this, the identification problem is reformulated as an integer linear programming problem to reveal the system matrix of Boolean model in a computationally efficient way, whose dynamics are consistent with the important dynamics captured in the data. By using prior knowledge the number of candidate functions can be reduced during the inference. Hence, identification incorporating prior knowledge is especially suitable for the case of small size time series data and data without sufficient stimuli. The proposed approach is illustrated with the help of a biological model of the network of oxidative stress response. Conclusions: The combination of efficient reformulation of the identification problem with the possibility to incorporate various types of prior knowledge enables the application of computational model inference to systems with limited amount of time series data. The general applicability of this methodological approach makes it suitable for a variety of biological systems and of general interest for biological and medical research.

Random Boolean networks for autoassociative memory: Optimization and sequential learning

NASA Astrophysics Data System (ADS)

Sherrington, D.; Wong, K. Y. M.

Conventional neural networks are based on synaptic storage of information, even when the neural states are discrete and bounded. In general, the set of potential local operations is much greater. Here we discuss some aspects of the properties of networks of binary neurons with more general Boolean functions controlling the local dynamics. Two specific aspects are emphasised; (i) optimization in the presence of noise and (ii) a simple model for short-term memory exhibiting primacy and recency in the recall of sequentially taught patterns.

Bell-Boole Inequality: Nonlocality or Probabilistic Incompatibility of Random Variables?

NASA Astrophysics Data System (ADS)

Khrennikov, Andrei

2008-06-01

The main aim of this report is to inform the quantum information community about investigations on the problem of probabilistic compatibility of a family of random variables: a possibility to realize such a family on the basis of a single probability measure (to construct a single Kolmogorov probability space). These investigations were started hundred of years ago by J. Boole (who invented Boolean algebras). The complete solution of the problem was obtained by Soviet mathematician Vorobjev in 60th. Surprisingly probabilists and statisticians obtained inequalities for probabilities and correlations among which one can find the famous Bell’s inequality and its generalizations. Such inequalities appeared simply as constraints for probabilistic compatibility. In this framework one can not see a priori any link to such problems as nonlocality and “death of reality” which are typically linked to Bell’s type inequalities in physical literature. We analyze the difference between positions of mathematicians and quantum physicists. In particular, we found that one of the most reasonable explanations of probabilistic incompatibility is mixing in Bell’s type inequalities statistical data from a number of experiments performed under different experimental contexts.

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

PubMed

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.

The general symmetry algebra structure of the underdetermined equation ux=(vxx)2

NASA Astrophysics Data System (ADS)

Kersten, Paul H. M.

1991-08-01

In a recent paper, Anderson, Kamran, and Olver [``Interior, exterior, and generalized symmetries,'' preprint (1990)] obtained the first- and second-order generalized symmetry algebra for the system ux=(vxx)2, leading to the noncompact real form of the exceptional Lie algebra G2. Here, the structure of the general higher-order symmetry algebra is obtained. Moreover, the Lie algebra G2 is obtained as ordinary symmetry algebra of the associated first-order system. The general symmetry algebra for ux=f(u,v,vx,...,) is established also.

Generalized Galilean algebras and Newtonian gravity

NASA Astrophysics Data System (ADS)

González, N.; Rubio, G.; Salgado, P.; Salgado, S.

2016-04-01

The non-relativistic versions of the generalized Poincaré algebras and generalized AdS-Lorentz algebras are obtained. These non-relativistic algebras are called, generalized Galilean algebras of type I and type II and denoted by GBn and GLn respectively. Using a generalized Inönü-Wigner contraction procedure we find that the generalized Galilean algebras of type I can be obtained from the generalized Galilean algebras type II. The S-expansion procedure allows us to find the GB5 algebra from the Newton Hooke algebra with central extension. The procedure developed in Ref. [1] allows us to show that the nonrelativistic limit of the five dimensional Einstein-Chern-Simons gravity is given by a modified version of the Poisson equation. The modification could be compatible with the effects of Dark Matter, which leads us to think that Dark Matter can be interpreted as a non-relativistic limit of Dark Energy.

Generalized Clifford Algebras as Algebras in Suitable Symmetric Linear Gr-Categories

NASA Astrophysics Data System (ADS)

Cheng, Tao; Huang, Hua-Lin; Yang, Yuping

2016-01-01

By viewing Clifford algebras as algebras in some suitable symmetric Gr-categories, Albuquerque and Majid were able to give a new derivation of some well known results about Clifford algebras and to generalize them. Along the same line, Bulacu observed that Clifford algebras are weak Hopf algebras in the aforementioned categories and obtained other interesting properties. The aim of this paper is to study generalized Clifford algebras in a similar manner and extend the results of Albuquerque, Majid and Bulacu to the generalized setting. In particular, by taking full advantage of the gauge transformations in symmetric linear Gr-categories, we derive the decomposition theorem and provide categorical weak Hopf structures for generalized Clifford algebras in a conceptual and simpler manner.

Continuum analogues of contragredient Lie algebras (Lie algebras with a Cartan operator and nonlinear dynamical systems)

NASA Astrophysics Data System (ADS)

Saveliev, M. V.; Vershik, A. M.

1989-12-01

We present an axiomatic formulation of a new class of infinitedimensional Lie algebras-the generalizations of Z-graded Lie algebras with, generally speaking, an infinite-dimensional Cartan subalgebra and a contiguous set of roots. We call such algebras “continuum Lie algebras.” The simple Lie algebras of constant growth are encapsulated in our formulation. We pay particular attention to the case when the local algebra is parametrized by a commutative algebra while the Cartan operator (the generalization of the Cartan matrix) is a linear operator. Special examples of these algebras are the Kac-Moody algebras, algebras of Poisson brackets, algebras of vector fields on a manifold, current algebras, and algebras with differential or integro-differential cartan operator. The nonlinear dynamical systems associated with the continuum contragredient Lie algebras are also considered.

An algebra-based method for inferring gene regulatory networks

PubMed Central

2014-01-01

Background The inference of gene regulatory networks (GRNs) from experimental observations is at the heart of systems biology. This includes the inference of both the network topology and its dynamics. While there are many algorithms available to infer the network topology from experimental data, less emphasis has been placed on methods that infer network dynamics. Furthermore, since the network inference problem is typically underdetermined, it is essential to have the option of incorporating into the inference process, prior knowledge about the network, along with an effective description of the search space of dynamic models. Finally, it is also important to have an understanding of how a given inference method is affected by experimental and other noise in the data used. Results This paper contains a novel inference algorithm using the algebraic framework of Boolean polynomial dynamical systems (BPDS), meeting all these requirements. The algorithm takes as input time series data, including those from network perturbations, such as knock-out mutant strains and RNAi experiments. It allows for the incorporation of prior biological knowledge while being robust to significant levels of noise in the data used for inference. It uses an evolutionary algorithm for local optimization with an encoding of the mathematical models as BPDS. The BPDS framework allows an effective representation of the search space for algebraic dynamic models that improves computational performance. The algorithm is validated with both simulated and experimental microarray expression profile data. Robustness to noise is tested using a published mathematical model of the segment polarity gene network in Drosophila melanogaster. Benchmarking of the algorithm is done by comparison with a spectrum of state-of-the-art network inference methods on data from the synthetic IRMA network to demonstrate that our method has good precision and recall for the network reconstruction task, while also predicting several of the dynamic patterns present in the network. Conclusions Boolean polynomial dynamical systems provide a powerful modeling framework for the reverse engineering of gene regulatory networks, that enables a rich mathematical structure on the model search space. A C++ implementation of the method, distributed under LPGL license, is available, together with the source code, at http://www.paola-vera-licona.net/Software/EARevEng/REACT.html. PMID:24669835

Adaptiveness in monotone pseudo-Boolean optimization and stochastic neural computation.

PubMed

Grossi, Giuliano

2009-08-01

Hopfield neural network (HNN) is a nonlinear computational model successfully applied in finding near-optimal solutions of several difficult combinatorial problems. In many cases, the network energy function is obtained through a learning procedure so that its minima are states falling into a proper subspace (feasible region) of the search space. However, because of the network nonlinearity, a number of undesirable local energy minima emerge from the learning procedure, significantly effecting the network performance. In the neural model analyzed here, we combine both a penalty and a stochastic process in order to enhance the performance of a binary HNN. The penalty strategy allows us to gradually lead the search towards states representing feasible solutions, so avoiding oscillatory behaviors or asymptotically instable convergence. Presence of stochastic dynamics potentially prevents the network to fall into shallow local minima of the energy function, i.e., quite far from global optimum. Hence, for a given fixed network topology, the desired final distribution on the states can be reached by carefully modulating such process. The model uses pseudo-Boolean functions both to express problem constraints and cost function; a combination of these two functions is then interpreted as energy of the neural network. A wide variety of NP-hard problems fall in the class of problems that can be solved by the model at hand, particularly those having a monotonic quadratic pseudo-Boolean function as constraint function. That is, functions easily derived by closed algebraic expressions representing the constraint structure and easy (polynomial time) to maximize. We show the asymptotic convergence properties of this model characterizing its state space distribution at thermal equilibrium in terms of Markov chain and give evidence of its ability to find high quality solutions on benchmarks and randomly generated instances of two specific problems taken from the computational graph theory.

Phase diagram of restricted Boltzmann machines and generalized Hopfield networks with arbitrary priors.

PubMed

Barra, Adriano; Genovese, Giuseppe; Sollich, Peter; Tantari, Daniele

2018-02-01

Restricted Boltzmann machines are described by the Gibbs measure of a bipartite spin glass, which in turn can be seen as a generalized Hopfield network. This equivalence allows us to characterize the state of these systems in terms of their retrieval capabilities, both at low and high load, of pure states. We study the paramagnetic-spin glass and the spin glass-retrieval phase transitions, as the pattern (i.e., weight) distribution and spin (i.e., unit) priors vary smoothly from Gaussian real variables to Boolean discrete variables. Our analysis shows that the presence of a retrieval phase is robust and not peculiar to the standard Hopfield model with Boolean patterns. The retrieval region becomes larger when the pattern entries and retrieval units get more peaked and, conversely, when the hidden units acquire a broader prior and therefore have a stronger response to high fields. Moreover, at low load retrieval always exists below some critical temperature, for every pattern distribution ranging from the Boolean to the Gaussian case.

Generalized derivation extensions of 3-Lie algebras and corresponding Nambu-Poisson structures

NASA Astrophysics Data System (ADS)

Song, Lina; Jiang, Jun

2018-01-01

In this paper, we introduce the notion of a generalized derivation on a 3-Lie algebra. We construct a new 3-Lie algebra using a generalized derivation and call it the generalized derivation extension. We show that the corresponding Leibniz algebra on the space of fundamental objects is the double of a matched pair of Leibniz algebras. We also determine the corresponding Nambu-Poisson structures under some conditions.

ADAM: analysis of discrete models of biological systems using computer algebra.

PubMed

Hinkelmann, Franziska; Brandon, Madison; Guang, Bonny; McNeill, Rustin; Blekherman, Grigoriy; Veliz-Cuba, Alan; Laubenbacher, Reinhard

2011-07-20

Many biological systems are modeled qualitatively with discrete models, such as probabilistic Boolean networks, logical models, Petri nets, and agent-based models, to gain a better understanding of them. The computational complexity to analyze the complete dynamics of these models grows exponentially in the number of variables, which impedes working with complex models. There exist software tools to analyze discrete models, but they either lack the algorithmic functionality to analyze complex models deterministically or they are inaccessible to many users as they require understanding the underlying algorithm and implementation, do not have a graphical user interface, or are hard to install. Efficient analysis methods that are accessible to modelers and easy to use are needed. We propose a method for efficiently identifying attractors and introduce the web-based tool Analysis of Dynamic Algebraic Models (ADAM), which provides this and other analysis methods for discrete models. ADAM converts several discrete model types automatically into polynomial dynamical systems and analyzes their dynamics using tools from computer algebra. Specifically, we propose a method to identify attractors of a discrete model that is equivalent to solving a system of polynomial equations, a long-studied problem in computer algebra. Based on extensive experimentation with both discrete models arising in systems biology and randomly generated networks, we found that the algebraic algorithms presented in this manuscript are fast for systems with the structure maintained by most biological systems, namely sparseness and robustness. For a large set of published complex discrete models, ADAM identified the attractors in less than one second. Discrete modeling techniques are a useful tool for analyzing complex biological systems and there is a need in the biological community for accessible efficient analysis tools. ADAM provides analysis methods based on mathematical algorithms as a web-based tool for several different input formats, and it makes analysis of complex models accessible to a larger community, as it is platform independent as a web-service and does not require understanding of the underlying mathematics.

Generalized conformal realizations of Kac-Moody algebras

DOE Office of Scientific and Technical Information (OSTI.GOV)

Palmkvist, Jakob

2009-01-15

We present a construction which associates an infinite sequence of Kac-Moody algebras, labeled by a positive integer n, to one single Jordan algebra. For n=1, this reduces to the well known Kantor-Koecher-Tits construction. Our generalization utilizes a new relation between different generalized Jordan triple systems, together with their known connections to Jordan and Lie algebras. Applied to the Jordan algebra of Hermitian 3x3 matrices over the division algebras R, C, H, O, the construction gives the exceptional Lie algebras f{sub 4}, e{sub 6}, e{sub 7}, e{sub 8} for n=2. Moreover, we obtain their infinite-dimensional extensions for n{>=}3. In the casemore » of 2x2 matrices, the resulting Lie algebras are of the form so(p+n,q+n) and the concomitant nonlinear realization generalizes the conformal transformations in a spacetime of signature (p,q)« less

Highest-weight representations of Brocherd`s algebras

DOE Office of Scientific and Technical Information (OSTI.GOV)

Slansky, R.

1997-01-01

General features of highest-weight representations of Borcherd`s algebras are described. to show their typical features, several representations of Borcherd`s extensions of finite-dimensional algebras are analyzed. Then the example of the extension of affine- su(2) to a Borcherd`s algebra is examined. These algebras provide a natural way to extend a Kac-Moody algebra to include the hamiltonian and number-changing operators in a generalized symmetry structure.

Relationships between probabilistic Boolean networks and dynamic Bayesian networks as models of gene regulatory networks

PubMed Central

Lähdesmäki, Harri; Hautaniemi, Sampsa; Shmulevich, Ilya; Yli-Harja, Olli

2006-01-01

A significant amount of attention has recently been focused on modeling of gene regulatory networks. Two frequently used large-scale modeling frameworks are Bayesian networks (BNs) and Boolean networks, the latter one being a special case of its recent stochastic extension, probabilistic Boolean networks (PBNs). PBN is a promising model class that generalizes the standard rule-based interactions of Boolean networks into the stochastic setting. Dynamic Bayesian networks (DBNs) is a general and versatile model class that is able to represent complex temporal stochastic processes and has also been proposed as a model for gene regulatory systems. In this paper, we concentrate on these two model classes and demonstrate that PBNs and a certain subclass of DBNs can represent the same joint probability distribution over their common variables. The major benefit of introducing the relationships between the models is that it opens up the possibility of applying the standard tools of DBNs to PBNs and vice versa. Hence, the standard learning tools of DBNs can be applied in the context of PBNs, and the inference methods give a natural way of handling the missing values in PBNs which are often present in gene expression measurements. Conversely, the tools for controlling the stationary behavior of the networks, tools for projecting networks onto sub-networks, and efficient learning schemes can be used for DBNs. In other words, the introduced relationships between the models extend the collection of analysis tools for both model classes. PMID:17415411

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

NASA Astrophysics Data System (ADS)

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.

Modeling and simulation of reliability of unmanned intelligent vehicles

NASA Astrophysics Data System (ADS)

Singh, Harpreet; Dixit, Arati M.; Mustapha, Adam; Singh, Kuldip; Aggarwal, K. K.; Gerhart, Grant R.

2008-04-01

Unmanned ground vehicles have a large number of scientific, military and commercial applications. A convoy of such vehicles can have collaboration and coordination. For the movement of such a convoy, it is important to predict the reliability of the system. A number of approaches are available in literature which describes the techniques for determining the reliability of the system. Graph theoretic approaches are popular in determining terminal reliability and system reliability. In this paper we propose to exploit Fuzzy and Neuro-Fuzzy approaches for predicting the node and branch reliability of the system while Boolean algebra approaches are used to determine terminal reliability and system reliability. Hence a combination of intelligent approaches like Fuzzy, Neuro-Fuzzy and Boolean approaches is used to predict the overall system reliability of a convoy of vehicles. The node reliabilities may correspond to the collaboration of vehicles while branch reliabilities will determine the terminal reliabilities between different nodes. An algorithm is proposed for determining the system reliabilities of a convoy of vehicles. The simulation of the overall system is proposed. Such simulation should be helpful to the commander to take an appropriate action depending on the predicted reliability in different terrain and environmental conditions. It is hoped that results of this paper will lead to more important techniques to have a reliable convoy of vehicles in a battlefield.

Students’ Algebraic Thinking Process in Context of Point and Line Properties

NASA Astrophysics Data System (ADS)

Nurrahmi, H.; Suryadi, D.; Fatimah, S.

2017-09-01

Learning of schools algebra is limited to symbols and operating procedures, so students are able to work on problems that only require the ability to operate symbols but unable to generalize a pattern as one of part of algebraic thinking. The purpose of this study is to create a didactic design that facilitates students to do algebraic thinking process through the generalization of patterns, especially in the context of the property of point and line. This study used qualitative method and includes Didactical Design Research (DDR). The result is students are able to make factual, contextual, and symbolic generalization. This happen because the generalization arises based on facts on local terms, then the generalization produced an algebraic formula that was described in the context and perspective of each student. After that, the formula uses the algebraic letter symbol from the symbol t hat uses the students’ language. It can be concluded that the design has facilitated students to do algebraic thinking process through the generalization of patterns, especially in the context of property of the point and line. The impact of this study is this design can use as one of material teaching alternative in learning of school algebra.

Modeling formalisms in Systems Biology

PubMed Central

2011-01-01

Systems Biology has taken advantage of computational tools and high-throughput experimental data to model several biological processes. These include signaling, gene regulatory, and metabolic networks. However, most of these models are specific to each kind of network. Their interconnection demands a whole-cell modeling framework for a complete understanding of cellular systems. We describe the features required by an integrated framework for modeling, analyzing and simulating biological processes, and review several modeling formalisms that have been used in Systems Biology including Boolean networks, Bayesian networks, Petri nets, process algebras, constraint-based models, differential equations, rule-based models, interacting state machines, cellular automata, and agent-based models. We compare the features provided by different formalisms, and discuss recent approaches in the integration of these formalisms, as well as possible directions for the future. PMID:22141422

Mathematical Modeling for Inherited Diseases.

PubMed

Anis, Saima; Khan, Madad; Khan, Saqib

2017-01-01

We introduced a new nonassociative algebra, namely, left almost algebra, and discussed some of its genetic properties. We discussed the relation of this algebra with flexible algebra, Jordan algebra, and generalized Jordan algebra.

Mathematical Modeling for Inherited Diseases

PubMed Central

Khan, Saqib

2017-01-01

We introduced a new nonassociative algebra, namely, left almost algebra, and discussed some of its genetic properties. We discussed the relation of this algebra with flexible algebra, Jordan algebra, and generalized Jordan algebra. PMID:28781606

Boolean Networks in Inference and Dynamic Modeling of Biological Systems at the Molecular and Physiological Level

NASA Astrophysics Data System (ADS)

Thakar, Juilee; Albert, Réka

The following sections are included: * Introduction * Boolean Network Concepts and History * Extensions of the Classical Boolean Framework * Boolean Inference Methods and Examples in Biology * Dynamic Boolean Models: Examples in Plant Biology, Developmental Biology and Immunology * Conclusions * References

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

NASA Astrophysics Data System (ADS)

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.

PubMed

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.

Algebraic Thinking through Koch Snowflake Constructions

ERIC Educational Resources Information Center

Ghosh, Jonaki B.

2016-01-01

Generalizing is a foundational mathematical practice for the algebra classroom. It entails an act of abstraction and forms the core of algebraic thinking. Kinach (2014) describes two kinds of generalization--by analogy and by extension. This article illustrates how exploration of fractals provides ample opportunity for generalizations of both…

The Boolean Is Dead, Long Live the Boolean! Natural Language versus Boolean Searching in Introductory Undergraduate Instruction

ERIC Educational Resources Information Center

Lowe, M. Sara; Maxson, Bronwen K.; Stone, Sean M.; Miller, Willie; Snajdr, Eric; Hanna, Kathleen

2018-01-01

Boolean logic can be a difficult concept for first-year, introductory students to grasp. This paper compares the results of Boolean and natural language searching across several databases with searches created from student research questions. Performance differences between databases varied. Overall, natural search language is at least as good as…

Discrimination in a General Algebraic Setting

PubMed Central

Fine, Benjamin; Lipschutz, Seymour; Spellman, Dennis

2015-01-01

Discriminating groups were introduced by G. Baumslag, A. Myasnikov, and V. Remeslennikov as an outgrowth of their theory of algebraic geometry over groups. Algebraic geometry over groups became the main method of attack on the solution of the celebrated Tarski conjectures. In this paper we explore the notion of discrimination in a general universal algebra context. As an application we provide a different proof of a theorem of Malcev on axiomatic classes of Ω-algebras. PMID:26171421

Information processing in dendrites I. Input pattern generalisation.

PubMed

Gurney, K N

2001-10-01

In this paper and its companion, we address the question as to whether there are any general principles underlying information processing in the dendritic trees of biological neurons. In order to address this question, we make two assumptions. First, the key architectural feature of dendrites responsible for many of their information processing abilities is the existence of independent sub-units performing local non-linear processing. Second, any general functional principles operate at a level of abstraction in which neurons are modelled by Boolean functions. To accommodate these assumptions, we therefore define a Boolean model neuron-the multi-cube unit (MCU)-which instantiates the notion of the discrete functional sub-unit. We then use this model unit to explore two aspects of neural functionality: generalisation (in this paper) and processing complexity (in its companion). Generalisation is dealt with from a geometric viewpoint and is quantified using a new metric-the set of order parameters. These parameters are computed for threshold logic units (TLUs), a class of random Boolean functions, and MCUs. Our interpretation of the order parameters is consistent with our knowledge of generalisation in TLUs and with the lack of generalisation in randomly chosen functions. Crucially, the order parameters for MCUs imply that these functions possess a range of generalisation behaviour. We argue that this supports the general thesis that dendrites facilitate input pattern generalisation despite any local non-linear processing within functionally isolated sub-units.

ADAM: Analysis of Discrete Models of Biological Systems Using Computer Algebra

PubMed Central

2011-01-01

Background Many biological systems are modeled qualitatively with discrete models, such as probabilistic Boolean networks, logical models, Petri nets, and agent-based models, to gain a better understanding of them. The computational complexity to analyze the complete dynamics of these models grows exponentially in the number of variables, which impedes working with complex models. There exist software tools to analyze discrete models, but they either lack the algorithmic functionality to analyze complex models deterministically or they are inaccessible to many users as they require understanding the underlying algorithm and implementation, do not have a graphical user interface, or are hard to install. Efficient analysis methods that are accessible to modelers and easy to use are needed. Results We propose a method for efficiently identifying attractors and introduce the web-based tool Analysis of Dynamic Algebraic Models (ADAM), which provides this and other analysis methods for discrete models. ADAM converts several discrete model types automatically into polynomial dynamical systems and analyzes their dynamics using tools from computer algebra. Specifically, we propose a method to identify attractors of a discrete model that is equivalent to solving a system of polynomial equations, a long-studied problem in computer algebra. Based on extensive experimentation with both discrete models arising in systems biology and randomly generated networks, we found that the algebraic algorithms presented in this manuscript are fast for systems with the structure maintained by most biological systems, namely sparseness and robustness. For a large set of published complex discrete models, ADAM identified the attractors in less than one second. Conclusions Discrete modeling techniques are a useful tool for analyzing complex biological systems and there is a need in the biological community for accessible efficient analysis tools. ADAM provides analysis methods based on mathematical algorithms as a web-based tool for several different input formats, and it makes analysis of complex models accessible to a larger community, as it is platform independent as a web-service and does not require understanding of the underlying mathematics. PMID:21774817

Risk assessment techniques with applicability in marine engineering

NASA Astrophysics Data System (ADS)

Rudenko, E.; Panaitescu, F. V.; Panaitescu, M.

2015-11-01

Nowadays risk management is a carefully planned process. The task of risk management is organically woven into the general problem of increasing the efficiency of business. Passive attitude to risk and awareness of its existence are replaced by active management techniques. Risk assessment is one of the most important stages of risk management, since for risk management it is necessary first to analyze and evaluate risk. There are many definitions of this notion but in general case risk assessment refers to the systematic process of identifying the factors and types of risk and their quantitative assessment, i.e. risk analysis methodology combines mutually complementary quantitative and qualitative approaches. Purpose of the work: In this paper we will consider as risk assessment technique Fault Tree analysis (FTA). The objectives are: understand purpose of FTA, understand and apply rules of Boolean algebra, analyse a simple system using FTA, FTA advantages and disadvantages. Research and methodology: The main purpose is to help identify potential causes of system failures before the failures actually occur. We can evaluate the probability of the Top event.The steps of this analize are: the system's examination from Top to Down, the use of symbols to represent events, the use of mathematical tools for critical areas, the use of Fault tree logic diagrams to identify the cause of the Top event. Results: In the finally of study it will be obtained: critical areas, Fault tree logical diagrams and the probability of the Top event. These results can be used for the risk assessment analyses.

Algebraic Generalization Strategies Used by Kuwaiti Pre-Service Teachers

ERIC Educational Resources Information Center

Alajmi, Amal Hussain

2016-01-01

This study reports on the algebraic generalization strategies used by elementary and middle/high school pre-service mathematics teachers in Kuwait. They were presented with 9 tasks that involved linear, exponential, and quadratic situations. The results showed that these pre-service teachers had difficulty in generalizing algebraic rules in all 3…

Computational complexity of Boolean functions

NASA Astrophysics Data System (ADS)

Korshunov, Aleksei D.

2012-02-01

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.

Quiver W-algebras

NASA Astrophysics Data System (ADS)

Kimura, Taro; Pestun, Vasily

2018-06-01

For a quiver with weighted arrows, we define gauge-theory K-theoretic W-algebra generalizing the definition of Shiraishi et al. and Frenkel and Reshetikhin. In particular, we show that the qq-character construction of gauge theory presented by Nekrasov is isomorphic to the definition of the W-algebra in the operator formalism as a commutant of screening charges in the free field representation. Besides, we allow arbitrary quiver and expect interesting applications to representation theory of generalized Borcherds-Kac-Moody Lie algebras, their quantum affinizations and associated W-algebras.

Algebra: A Challenge at the Crossroads of Policy and Practice

ERIC Educational Resources Information Center

Stein, Mary Kay; Kaufman, Julia Heath; Sherman, Milan; Hillen, Amy F.

2011-01-01

The authors review what is known about early and universal algebra, including who is getting access to algebra and student outcomes associated with algebra course taking in general and specifically with universal algebra policies. The findings indicate that increasing numbers of students, some of whom are underprepared, are taking algebra earlier.…

Evolutionary Algorithms for Boolean Functions in Diverse Domains of Cryptography.

PubMed

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.

A Loomis-Sikorski theorem and functional calculus for a generalized Hermitian algebra

NASA Astrophysics Data System (ADS)

Foulis, David J.; Jenčová, Anna; Pulmannová, Sylvia

2017-10-01

A generalized Hermitian (GH-) algebra is a generalization of the partially ordered Jordan algebra of all Hermitian operators on a Hilbert space. We introduce the notion of a gh-tribe, which is a commutative GH-algebra of functions on a nonempty set X with pointwise partial order and operations, and we prove that every commutative GH-algebra is the image of a gh-tribe under a surjective GH-morphism. Using this result, we prove that each element a of a GH-algebra A corresponds to a real observable ξa on the σ-orthomodular lattice of projections in A and that ξa determines the spectral resolution of a. Also, if f is a continuous function defined on the spectrum of a, we formulate a definition of f (a), thus obtaining a continuous functional calculus for A.

General Algebraic Modeling System Tutorial | High-Performance Computing |

Science.gov Websites

power generation from two different fuels. The goal is to minimize the cost for one of the fuels while Here's a basic tutorial for modeling optimization problems with the General Algebraic Modeling System (GAMS). Overview The GAMS (General Algebraic Modeling System) package is essentially a compiler for a

The Unitality of Quantum B-algebras

NASA Astrophysics Data System (ADS)

Han, Shengwei; Xu, Xiaoting; Qin, Feng

2018-02-01

Quantum B-algebras as a generalization of quantales were introduced by Rump and Yang, which cover the majority of implicational algebras and provide a unified semantic for a wide class of substructural logics. Unital quantum B-algebras play an important role in the classification of implicational algebras. The main purpose of this paper is to construct unital quantum B-algebras from non-unital quantum B-algebras.

A Simple Blueprint for Automatic Boolean Query Processing.

ERIC Educational Resources Information Center

Salton, G.

1988-01-01

Describes a new Boolean retrieval environment in which an extended soft Boolean logic is used to automatically construct queries from original natural language formulations provided by users. Experimental results that compare the retrieval effectiveness of this method to conventional Boolean and vector processing are discussed. (27 references)…

Algebraic features of some generalizations of the Lotka-Volterra system

NASA Astrophysics Data System (ADS)

Bibik, Yu. V.; Sarancha, D. A.

2010-10-01

For generalizations of the Lotka-Volterra system, an integration method is proposed based on the nontrivial algebraic structure of these generalizations. The method makes use of an auxiliary first-order differential equation derived from the phase curve equation with the help of this algebraic structure. Based on this equation, a Hamiltonian approach can be developed and canonical variables (moreover, action-angle variables) can be constructed.

Optimal stabilization of Boolean networks through collective influence

NASA Astrophysics Data System (ADS)

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.

Effect of memory in non-Markovian Boolean networks illustrated with a case study: A cell cycling process

NASA Astrophysics Data System (ADS)

Ebadi, H.; Saeedian, M.; Ausloos, M.; Jafari, G. R.

2016-11-01

The Boolean network is one successful model to investigate discrete complex systems such as the gene interacting phenomenon. The dynamics of a Boolean network, controlled with Boolean functions, is usually considered to be a Markovian (memory-less) process. However, both self-organizing features of biological phenomena and their intelligent nature should raise some doubt about ignoring the history of their time evolution. Here, we extend the Boolean network Markovian approach: we involve the effect of memory on the dynamics. This can be explored by modifying Boolean functions into non-Markovian functions, for example, by investigating the usual non-Markovian threshold function —one of the most applied Boolean functions. By applying the non-Markovian threshold function on the dynamical process of the yeast cell cycle network, we discover a power-law-like memory with a more robust dynamics than the Markovian dynamics.

Mining TCGA Data Using Boolean Implications

PubMed Central

Sinha, Subarna; Tsang, Emily K.; Zeng, Haoyang; Meister, Michela; Dill, David L.

2014-01-01

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/. PMID:25054200

An algorithmic approach to solving polynomial equations associated with quantum circuits

NASA Astrophysics Data System (ADS)

Gerdt, V. P.; Zinin, M. V.

2009-12-01

In this paper we present two algorithms for reducing systems of multivariate polynomial equations over the finite field F 2 to the canonical triangular form called lexicographical Gröbner basis. This triangular form is the most appropriate for finding solutions of the system. On the other hand, the system of polynomials over F 2 whose variables also take values in F 2 (Boolean polynomials) completely describes the unitary matrix generated by a quantum circuit. In particular, the matrix itself can be computed by counting the number of solutions (roots) of the associated polynomial system. Thereby, efficient construction of the lexicographical Gröbner bases over F 2 associated with quantum circuits gives a method for computing their circuit matrices that is alternative to the direct numerical method based on linear algebra. We compare our implementation of both algorithms with some other software packages available for computing Gröbner bases over F 2.

Exploring hurdles to transfer : student experiences of applying knowledge across disciplines

NASA Astrophysics Data System (ADS)

Lappalainen, Jouni; Rosqvist, Juho

2015-04-01

This paper explores the ways students perceive the transfer of learned knowledge to new situations - often a surprisingly difficult prospect. The novel aspect compared to the traditional transfer studies is that the learning phase is not a part of the experiment itself. The intention was only to activate acquired knowledge relevant to the transfer target using a short primer immediately prior to the situation where the knowledge was to be applied. Eight volunteer students from either mathematics or computer science curricula were given a task of designing an adder circuit using logic gates: a new context in which to apply knowledge of binary arithmetic and Boolean algebra. The results of a phenomenographic classification of the views presented by the students in their post-experiment interviews are reported. The degree to which the students were conscious of the acquired knowledge they employed and how they applied it in a new context emerged as the differentiating factors.

Banach Synaptic Algebras

NASA Astrophysics Data System (ADS)

Foulis, David J.; Pulmannov, Sylvia

2018-04-01

Using a representation theorem of Erik Alfsen, Frederic Schultz, and Erling Størmer for special JB-algebras, we prove that a synaptic algebra is norm complete (i.e., Banach) if and only if it is isomorphic to the self-adjoint part of a Rickart C∗-algebra. Also, we give conditions on a Banach synaptic algebra that are equivalent to the condition that it is isomorphic to the self-adjoint part of an AW∗-algebra. Moreover, we study some relationships between synaptic algebras and so-called generalized Hermitian algebras.

Synchronization of coupled large-scale Boolean networks

DOE Office of Scientific and Technical Information (OSTI.GOV)

Li, Fangfei, E-mail: li-fangfei@163.com

2014-03-15

This paper investigates the complete synchronization and partial synchronization of two large-scale Boolean networks. First, the aggregation algorithm towards large-scale Boolean network is reviewed. Second, the aggregation algorithm is applied to study the complete synchronization and partial synchronization of large-scale Boolean networks. Finally, an illustrative example is presented to show the efficiency of the proposed results.

Using Common Table Expressions to Build a Scalable Boolean Query Generator for Clinical Data Warehouses

PubMed Central

Harris, Daniel R.; Henderson, Darren W.; Kavuluru, Ramakanth; Stromberg, Arnold J.; Johnson, Todd R.

2015-01-01

We present a custom, Boolean query generator utilizing common-table expressions (CTEs) that is capable of scaling with big datasets. The generator maps user-defined Boolean queries, such as those interactively created in clinical-research and general-purpose healthcare tools, into SQL. We demonstrate the effectiveness of this generator by integrating our work into the Informatics for Integrating Biology and the Bedside (i2b2) query tool and show that it is capable of scaling. Our custom generator replaces and outperforms the default query generator found within the Clinical Research Chart (CRC) cell of i2b2. In our experiments, sixteen different types of i2b2 queries were identified by varying four constraints: date, frequency, exclusion criteria, and whether selected concepts occurred in the same encounter. We generated non-trivial, random Boolean queries based on these 16 types; the corresponding SQL queries produced by both generators were compared by execution times. The CTE-based solution significantly outperformed the default query generator and provided a much more consistent response time across all query types (M=2.03, SD=6.64 vs. M=75.82, SD=238.88 seconds). Without costly hardware upgrades, we provide a scalable solution based on CTEs with very promising empirical results centered on performance gains. The evaluation methodology used for this provides a means of profiling clinical data warehouse performance. PMID:25192572

A Computer Algebra Approach to Solving Chemical Equilibria in General Chemistry

ERIC Educational Resources Information Center

Kalainoff, Melinda; Lachance, Russ; Riegner, Dawn; Biaglow, Andrew

2012-01-01

In this article, we report on a semester-long study of the incorporation into our general chemistry course, of advanced algebraic and computer algebra techniques for solving chemical equilibrium problems. The method presented here is an alternative to the commonly used concentration table method for describing chemical equilibria in general…

Integrability and superintegrability of the generalized n-level many-mode Jaynes-Cummings and Dicke models

DOE Office of Scientific and Technical Information (OSTI.GOV)

Skrypnyk, T.

2009-10-15

We analyze symmetries of the integrable generalizations of Jaynes-Cummings and Dicke models associated with simple Lie algebras g and their reductive subalgebras g{sub K}[T. Skrypnyk, 'Generalized n-level Jaynes-Cummings and Dicke models, classical rational r-matrices and nested Bethe ansatz', J. Phys. A: Math. Theor. 41, 475202 (2008)]. We show that their symmetry algebras contain commutative subalgebras isomorphic to the Cartan subalgebras of g, which can be added to the commutative algebras of quantum integrals generated with the help of the quantum Lax operators. We diagonalize additional commuting integrals and constructed with their help the most general integrable quantum Hamiltonian of themore » generalized n-level many-mode Jaynes-Cummings and Dicke-type models using nested algebraic Bethe ansatz.« less

Towards classical spectrum generating algebras for f-deformations

NASA Astrophysics Data System (ADS)

Kullock, Ricardo; Latini, Danilo

2016-01-01

In this paper we revise the classical analog of f-oscillators, a generalization of q-oscillators given in Man'ko et al. (1997) [8], in the framework of classical spectrum generating algebras (SGA) introduced in Kuru and Negro (2008) [9]. We write down the deformed Poisson algebra characterizing the entire family of non-linear oscillators and construct its general solution algebraically. The latter, covering the full range of f-deformations, shows an energy dependence both in the amplitude and the frequency of the motion.

Z2×Z2 generalizations of 𝒩 =2 super Schrödinger algebras and their representations

NASA Astrophysics Data System (ADS)

Aizawa, N.; Segar, J.

2017-11-01

We generalize the real and chiral N =2 super Schrödinger algebras to Z2×Z2-graded Lie superalgebras. This is done by D-module presentation, and as a consequence, the D-module presentations of Z2×Z2-graded superalgebras are identical to the ones of super Schrödinger algebras. We then generalize the calculus over the Grassmann number to Z2×Z2 setting. Using it and the standard technique of Lie theory, we obtain a vector field realization of Z2×Z2-graded superalgebras. A vector field realization of the Z2×Z2 generalization of N =1 super Schrödinger algebra is also presented.

Teachers' Understanding of Algebraic Generalization

NASA Astrophysics Data System (ADS)

Hawthorne, Casey Wayne

Generalization has been identified as a cornerstone of algebraic thinking (e.g., Lee, 1996; Sfard, 1995) and is at the center of a rich conceptualization of K-8 algebra (Kaput, 2008; Smith, 2003). Moreover, mathematics teachers are being encouraged to use figural-pattern generalizing tasks as a basis of student-centered instruction, whereby teachers respond to and build upon the ideas that arise from students' explorations of these activities. Although more and more teachers are engaging their students in such generalizing tasks, little is known about teachers' understanding of generalization and their understanding of students' mathematical thinking in this domain. In this work, I addressed this gap, exploring the understanding of algebraic generalization of 4 exemplary 8th-grade teachers from multiple perspectives. A significant feature of this investigation is an examination of teachers' understanding of the generalization process, including the use of algebraic symbols. The research consisted of two phases. Phase I was an examination of the teachers' understandings of the underlying quantities and quantitative relationships represented by algebraic notation. In Phase II, I observed the instruction of 2 of these teachers. Using the lens of professional noticing of students' mathematical thinking, I explored the teachers' enacted knowledge of algebraic generalization, characterizing how it supported them to effectively respond to the needs and queries of their students. Results indicated that teachers predominantly see these figural patterns as enrichment activities, disconnected from course content. Furthermore, in my analysis, I identified conceptual difficulties teachers experienced when solving generalization tasks, in particular, connecting multiple symbolic representations with the quantities in the figures. Moreover, while the teachers strived to overcome the challenges of connecting different representations, they invoked both productive and unproductive conceptualizations of the symbols. Finally, by comparing two teachers' understandings of student thinking in the classroom, I developed an instructional trajectory to describe steps along students' generalization processes. This emergent framework serves as an instructional tool for teachers' use in identifying significant connections in supporting students to develop understanding of algebraic symbols as representations that communicate the quantities perceived in the figure.

Classical Affine W-Algebras and the Associated Integrable Hamiltonian Hierarchies for Classical Lie Algebras

NASA Astrophysics Data System (ADS)

De Sole, Alberto; Kac, Victor G.; Valeri, Daniele

2018-06-01

We prove that any classical affine W-algebra W (g, f), where g is a classical Lie algebra and f is an arbitrary nilpotent element of g, carries an integrable Hamiltonian hierarchy of Lax type equations. This is based on the theories of generalized Adler type operators and of generalized quasideterminants, which we develop in the paper. Moreover, we show that under certain conditions, the product of two generalized Adler type operators is a Lax type operator. We use this fact to construct a large number of integrable Hamiltonian systems, recovering, as a special case, all KdV type hierarchies constructed by Drinfeld and Sokolov.

State feedback controller design for the synchronization of Boolean networks with time delays

NASA Astrophysics Data System (ADS)

Li, Fangfei; Li, Jianning; Shen, Lijuan

2018-01-01

State feedback control design to make the response Boolean network synchronize with the drive Boolean network is far from being solved in the literature. Motivated by this, this paper studies the feedback control design for the complete synchronization of two coupled Boolean networks with time delays. A necessary condition for the existence of a state feedback controller is derived first. Then the feedback control design procedure for the complete synchronization of two coupled Boolean networks is provided based on the necessary condition. Finally, an example is given to illustrate the proposed design procedure.

The mathematics of a quantum Hamiltonian computing half adder Boolean logic gate.

PubMed

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.

Symmetry algebra of a generalized anisotropic harmonic oscillator

NASA Technical Reports Server (NTRS)

Castanos, O.; Lopez-Pena, R.

1993-01-01

It is shown that the symmetry Lie algebra of a quantum system with accidental degeneracy can be obtained by means of the Noether's theorem. The procedure is illustrated by considering a generalized anisotropic two dimensional harmonic oscillator, which can have an infinite set of states with the same energy characterized by an u(1,1) Lie algebra.

Sowing the Seeds of Algebraic Generalization: Designing Epistemic Affordances for an Intelligent Microworld

ERIC Educational Resources Information Center

Mavrikis, M.; Noss, R.; Hoyles, C.; Geraniou, E.

2013-01-01

This paper describes the design of a mathematical microworld to tackle the persistent difficulties that secondary school students have with the idea of algebraic generalization, which is a key stumbling block in secondary-school mathematics classrooms. Our focus is to characterize algebraic ways of thinking and to design both affordances of the…

Contributions of Domain-General Cognitive Resources and Different Forms of Arithmetic Development to Pre-Algebraic Knowledge

PubMed Central

Fuchs, Lynn S.; Compton, Donald L.; Fuchs, Douglas; Powell, Sarah R.; Schumacher, Robin F.; Hamlett, Carol L.; Vernier, Emily; Namkung, Jessica M.; Vukovic, Rose K.

2012-01-01

The purpose of this study was to investigate the contributions of domain-general cognitive resources and different forms of arithmetic development to individual differences in pre-algebraic knowledge. Children (n=279; mean age=7.59 yrs) were assessed on 7 domain-general cognitive resources as well as arithmetic calculations and word problems at start of 2nd grade and on calculations, word problems, and pre-algebraic knowledge at end of 3rd grade. Multilevel path analysis, controlling for instructional effects associated with the sequence of classrooms in which students were nested across grades 2–3, indicated arithmetic calculations and word problems are foundational to pre-algebraic knowledge. Also, results revealed direct contributions of nonverbal reasoning and oral language to pre-algebraic knowledge, beyond indirect effects that are mediated via arithmetic calculations and word problems. By contrast, attentive behavior, phonological processing, and processing speed contributed to pre-algebraic knowledge only indirectly via arithmetic calculations and word problems. PMID:22409764

On Maximal Subalgebras and the Hypercentre of Lie Algebras.

ERIC Educational Resources Information Center

Honda, Masanobu

1997-01-01

Derives two sufficient conditions for a finitely generated Lie algebra to have the nilpotent hypercenter. Presents a relatively large class of generalized soluble Lie algebras. Proves that if a finitely generated Lie algebra has a nilpotent maximal subalgebra, the Fitting radical is nilpotent. (DDR)

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

PubMed

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 technologies such as cDNA microarrays, RNA-Seq, and cell imaging-based assays.

On Correspondence of BRST-BFV, Dirac, and Refined Algebraic Quantizations of Constrained Systems

NASA Astrophysics Data System (ADS)

Shvedov, O. Yu.

2002-11-01

The correspondence between BRST-BFV, Dirac, and refined algebraic (group averaging, projection operator) approaches to quantizing constrained systems is analyzed. For the closed-algebra case, it is shown that the component of the BFV wave function corresponding to maximal (minimal) value of number of ghosts and antighosts in the Schrodinger representation may be viewed as a wave function in the refined algebraic (Dirac) quantization approach. The Giulini-Marolf group averaging formula for the inner product in the refined algebraic quantization approach is obtained from the Batalin-Marnelius prescription for the BRST-BFV inner product, which should be generally modified due to topological problems. The considered prescription for the correspondence of states is observed to be applicable to the open-algebra case. The refined algebraic quantization approach is generalized then to the case of nontrivial structure functions. A simple example is discussed. The correspondence of observables for different quantization methods is also investigated.

Asymptotic aspect of derivations in Banach algebras.

PubMed

Roh, Jaiok; Chang, Ick-Soon

2017-01-01

We prove that every approximate linear left derivation on a semisimple Banach algebra is continuous. Also, we consider linear derivations on Banach algebras and we first study the conditions for a linear derivation on a Banach algebra. Then we examine the functional inequalities related to a linear derivation and their stability. We finally take central linear derivations with radical ranges on semiprime Banach algebras and a continuous linear generalized left derivation on a semisimple Banach algebra.

Development of Boolean calculus and its application

NASA Technical Reports Server (NTRS)

Tapia, M. A.

1979-01-01

Formal procedures for synthesis of asynchronous sequential system using commercially available edge-sensitive flip-flops are developed. Boolean differential is defined. The exact number of compatible integrals of a Boolean differential were calculated.

Boolean integral calculus

NASA Technical Reports Server (NTRS)

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.

Quiver elliptic W-algebras

NASA Astrophysics Data System (ADS)

Kimura, Taro; Pestun, Vasily

2018-06-01

We define elliptic generalization of W-algebras associated with arbitrary quiver using our construction (Kimura and Pestun in Quiver W-algebras, 2015. arXiv:1512.08533 [hep-th]) with six-dimensional gauge theory.

Generalizing the bms3 and 2D-conformal algebras by expanding the Virasoro algebra

NASA Astrophysics Data System (ADS)

Caroca, Ricardo; Concha, Patrick; Rodríguez, Evelyn; Salgado-Rebolledo, Patricio

2018-03-01

By means of the Lie algebra expansion method, the centrally extended conformal algebra in two dimensions and the bms3 algebra are obtained from the Virasoro algebra. We extend this result to construct new families of expanded Virasoro algebras that turn out to be infinite-dimensional lifts of the so-called Bk, Ck and Dk algebras recently introduced in the literature in the context of (super)gravity. We also show how some of these new infinite-dimensional symmetries can be obtained from expanded Kač-Moody algebras using modified Sugawara constructions. Applications in the context of three-dimensional gravity are briefly discussed.

Enhanced asymptotic BMS3 algebra of the flat spacetime solutions of generalized minimal massive gravity

NASA Astrophysics Data System (ADS)

Setare, M. R.; Adami, H.

2018-01-01

We apply the new fall of conditions presented in the paper [1] on asymptotically flat spacetime solutions of Chern-Simons-like theories of gravity. We show that the considered fall of conditions asymptotically solve equations of motion of generalized minimal massive gravity. We demonstrate that there exist two type of solutions, one of those is trivial and the others are non-trivial. By looking at non-trivial solutions, for asymptotically flat spacetimes in the generalized minimal massive gravity, in contrast to Einstein gravity, cosmological parameter can be non-zero. We obtain the conserved charges of the asymptotically flat spacetimes in generalized minimal massive gravity, and by introducing Fourier modes we show that the asymptotic symmetry algebra is a semidirect product of a BMS3 algebra and two U (1) current algebras. Also we verify that the BMS3 algebra can be obtained by a contraction of the AdS3 asymptotic symmetry algebra when the AdS3 radius tends to infinity in the flat-space limit. Finally we find energy, angular momentum and entropy for a particular case and deduce that these quantities satisfy the first law of flat space cosmologies.

Automatic query formulations in information retrieval.

PubMed

Salton, G; Buckley, C; Fox, E A

1983-07-01

Modern information retrieval systems are designed to supply relevant information in response to requests received from the user population. In most retrieval environments the search requests consist of keywords, or index terms, interrelated by appropriate Boolean operators. Since it is difficult for untrained users to generate effective Boolean search requests, trained search intermediaries are normally used to translate original statements of user need into useful Boolean search formulations. Methods are introduced in this study which reduce the role of the search intermediaries by making it possible to generate Boolean search formulations completely automatically from natural language statements provided by the system patrons. Frequency considerations are used automatically to generate appropriate term combinations as well as Boolean connectives relating the terms. Methods are covered to produce automatic query formulations both in a standard Boolean logic system, as well as in an extended Boolean system in which the strict interpretation of the connectives is relaxed. Experimental results are supplied to evaluate the effectiveness of the automatic query formulation process, and methods are described for applying the automatic query formulation process in practice.

An Attractor-Based Complexity Measurement for Boolean Recurrent Neural Networks

PubMed Central

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

Developing Pre-Algebraic Thinking in Generalizing Repeating Pattern Using SOLO Model

ERIC Educational Resources Information Center

Lian, Lim Hooi; Yew, Wun Thiam

2011-01-01

In this paper, researchers discussed the application of the generalization perspective in helping the primary school pupils to develop their pre-algebraic thinking in generalizing repeating pattern. There are two main stages of the generalization perspective had been adapted, namely investigating and generalizing the pattern. Since the Biggs and…

Abstract Numeric Relations and the Visual Structure of Algebra

ERIC Educational Resources Information Center

Landy, David; Brookes, David; Smout, Ryan

2014-01-01

Formal algebras are among the most powerful and general mechanisms for expressing quantitative relational statements; yet, even university engineering students, who are relatively proficient with algebraic manipulation, struggle with and often fail to correctly deploy basic aspects of algebraic notation (Clement, 1982). In the cognitive tradition,…

Quantum processes: A Whiteheadian interpretation of quantum field theory

NASA Astrophysics Data System (ADS)

Bain, Jonathan

Quantum processes: A Whiteheadian interpretation of quantum field theory is an ambitious and thought-provoking exercise in physics and metaphysics, combining an erudite study of the very complex metaphysics of A.N. Whitehead with a well-informed discussion of contemporary issues in the philosophy of algebraic quantum field theory. Hättich's overall goal is to construct an interpretation of quantum field theory. He does this by translating key concepts in Whitehead's metaphysics into the language of algebraic quantum field theory. In brief, this Hättich-Whitehead (H-W, hereafter) interpretation takes "actual occasions" as the fundamental ontological entities of quantum field theory. An actual occasion is the result of two types of processes: a "transition process" in which a set of initial possibly-possessed properties for the occasion (in the form of "eternal objects") is localized to a space-time region; and a "concrescence process" in which a subset of these initial possibly-possessed properties is selected and actualized to produce the occasion. Essential to these processes is the "underlying activity", which conditions the way in which properties are initially selected and subsequently actualized. In short, under the H-W interpretation of quantum field theory, an initial set of possibly-possessed eternal objects is represented by a Boolean sublattice of the lattice of projection operators determined by a von Neumann algebra R (O) associated with a region O of Minkowski space-time, and the underlying activity is represented by a state on R (O) obtained by conditionalizing off of the vacuum state. The details associated with the H-W interpretation involve imposing constraints on these representations motivated by principles found in Whitehead's metaphysics. These details are spelled out in the three sections of the book. The first section is a summary and critique of Whitehead's metaphysics, the second section introduces the formalism of algebraic quantum field theory, and the third section consists of a translation between the first two sections. This review will concentrate on the first and third sections, with an eye on making explicit the essential characteristics of the H-W interpretation.

Students’ Algebraic Reasonsing In Solving Mathematical Problems With Adversity Quotient

NASA Astrophysics Data System (ADS)

Aryani, F.; Amin, S. M.; Sulaiman, R.

2018-01-01

Algebraic reasoning is a process in which students generalize mathematical ideas from a set of particular instances and express them in increasingly formal and age-appropriate ways. Using problem solving approach to develop algebraic reasoning of mathematics may enhace the long-term learning trajectory of the majority students. The purpose of this research was to describe the algebraic reasoning of quitter, camper, and climber junior high school students in solving mathematical problems. This research used qualitative descriptive method. Subjects were determined by purposive sampling. The technique of collecting data was done by task-based interviews.The results showed that the algebraic reasoning of three students in the process of pattern seeking by identifying the things that are known and asked in a similar way. But three students found the elements of pattern recognition in different ways or method. So, they are generalize the problem of pattern formation with different ways. The study of algebraic reasoning and problem solving can be a learning paradigm in the improve students’ knowledge and skills in algebra work. The goal is to help students’ improve academic competence, develop algebraic reasoning in problem solving.

Dynamical Correspondence in a Generalized Quantum Theory

NASA Astrophysics Data System (ADS)

Niestegge, Gerd

2015-05-01

In order to figure out why quantum physics needs the complex Hilbert space, many attempts have been made to distinguish the C*-algebras and von Neumann algebras in more general classes of abstractly defined Jordan algebras (JB- and JBW-algebras). One particularly important distinguishing property was identified by Alfsen and Shultz and is the existence of a dynamical correspondence. It reproduces the dual role of the selfadjoint operators as observables and generators of dynamical groups in quantum mechanics. In the paper, this concept is extended to another class of nonassociative algebras, arising from recent studies of the quantum logics with a conditional probability calculus and particularly of those that rule out third-order interference. The conditional probability calculus is a mathematical model of the Lüders-von Neumann quantum measurement process, and third-order interference is a property of the conditional probabilities which was discovered by Sorkin (Mod Phys Lett A 9:3119-3127, 1994) and which is ruled out by quantum mechanics. It is shown then that the postulates that a dynamical correspondence exists and that the square of any algebra element is positive still characterize, in the class considered, those algebras that emerge from the selfadjoint parts of C*-algebras equipped with the Jordan product. Within this class, the two postulates thus result in ordinary quantum mechanics using the complex Hilbert space or, vice versa, a genuine generalization of quantum theory must omit at least one of them.

Algebras Generated by Geometric Scalar Forms and their Applications in Physics and Social Sciences

DOE Office of Scientific and Technical Information (OSTI.GOV)

Keller, Jaime

2008-09-17

The present paper analyzes the consequences of defining that the geometric scalar form is not necessarily quadratic, but in general K-atic, that is obtained from the K{sup th} power of the linear form, requiring {l_brace}e{sub i};i = 1,...,N;(e{sub i}){sup K} = 1{r_brace} and d-vector {sigma}{sub i}x{sub i}e{sub i}. We consider the algebras which are thus generated, for positive integer K, a generalization of the geometric algebras we know under the names of Clifford or Grassmann algebras. We then obtain a set of geometric K-algebras. We also consider the generalization of special functions of geometry which corresponds to the K-order scalarmore » forms (as trigonometric functions and other related geometric functions which are based on the use of quadratic forms). We present an overview of the use of quadratic forms in physics as in our general theory, we have called START. And, in order to give an introduction to the use of the more general K-algebras and to the possible application to sciences other than physics, the application to social sciences is considered.For the applications to physics we show that quadratic spaces are a fundamental clue to understand the structure of theoretical physics (see, for example, Keller in ICNAAM 2005 and 2006)« less

General method to find the attractors of discrete dynamic models of biological systems.

PubMed

Gan, Xiao; Albert, Réka

2018-04-01

Analyzing the long-term behaviors (attractors) of dynamic models of biological networks can provide valuable insight. We propose a general method that can find the attractors of multilevel discrete dynamical systems by extending a method that finds the attractors of a Boolean network model. The previous method is based on finding stable motifs, subgraphs whose nodes' states can stabilize on their own. We extend the framework from binary states to any finite discrete levels by creating a virtual node for each level of a multilevel node, and describing each virtual node with a quasi-Boolean function. We then create an expanded representation of the multilevel network, find multilevel stable motifs and oscillating motifs, and identify attractors by successive network reduction. In this way, we find both fixed point attractors and complex attractors. We implemented an algorithm, which we test and validate on representative synthetic networks and on published multilevel models of biological networks. Despite its primary motivation to analyze biological networks, our motif-based method is general and can be applied to any finite discrete dynamical system.

General method to find the attractors of discrete dynamic models of biological systems

NASA Astrophysics Data System (ADS)

Gan, Xiao; Albert, Réka

2018-04-01

Analyzing the long-term behaviors (attractors) of dynamic models of biological networks can provide valuable insight. We propose a general method that can find the attractors of multilevel discrete dynamical systems by extending a method that finds the attractors of a Boolean network model. The previous method is based on finding stable motifs, subgraphs whose nodes' states can stabilize on their own. We extend the framework from binary states to any finite discrete levels by creating a virtual node for each level of a multilevel node, and describing each virtual node with a quasi-Boolean function. We then create an expanded representation of the multilevel network, find multilevel stable motifs and oscillating motifs, and identify attractors by successive network reduction. In this way, we find both fixed point attractors and complex attractors. We implemented an algorithm, which we test and validate on representative synthetic networks and on published multilevel models of biological networks. Despite its primary motivation to analyze biological networks, our motif-based method is general and can be applied to any finite discrete dynamical system.

Lie algebra of conformal Killing-Yano forms

NASA Astrophysics Data System (ADS)

Ertem, Ümit

2016-06-01

We provide a generalization of the Lie algebra of conformal Killing vector fields to conformal Killing-Yano forms. A new Lie bracket for conformal Killing-Yano forms that corresponds to slightly modified Schouten-Nijenhuis bracket of differential forms is proposed. We show that conformal Killing-Yano forms satisfy a graded Lie algebra in constant curvature manifolds. It is also proven that normal conformal Killing-Yano forms in Einstein manifolds also satisfy a graded Lie algebra. The constructed graded Lie algebras reduce to the graded Lie algebra of Killing-Yano forms and the Lie algebras of conformal Killing and Killing vector fields in special cases.

Capelli bitableaux and Z-forms of general linear Lie superalgebras.

PubMed Central

Brini, A; Teolis, A G

1990-01-01

The combinatorics of the enveloping algebra UQ(pl(L)) of the general linear Lie superalgebra of a finite dimensional Z2-graded Q-vector space is studied. Three non-equivalent Z-forms of UQ(pl(L)) are introduced: one of these Z-forms is a version of the Kostant Z-form and the others are Lie algebra analogs of Rota and Stein's straightening formulae for the supersymmetric algebra Super[L P] and for its dual Super[L* P*]. The method is based on an extension of Capelli's technique of variabili ausiliarie to algebras containing positively and negatively signed elements. PMID:11607048

A procedure concept for local reflex control of grasping

NASA Technical Reports Server (NTRS)

Fiorini, Paolo; Chang, Jeffrey

1989-01-01

An architecture is proposed for the control of robotic devices, and in particular of anthropomorphic hands, characterized by a hierarchical structure in which every level of the architecture contains data and control function with varying degree of abstraction. Bottom levels of the hierarchy interface directly with sensors and actuators, and process raw data and motor commands. Higher levels perform more symbolic types of tasks, such as application of boolean rules and general planning operations. Layers implementation has to be consistent with the type of operation and its requirements for real time control. It is proposed to implement the rule level with a Boolean Artificial Neural Network characterized by a response time sufficient for producing reflex corrective action at the actuator level.

To Boolean or Not To Boolean.

ERIC Educational Resources Information Center

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)

Minimum energy control and optimal-satisfactory control of Boolean control network

NASA Astrophysics Data System (ADS)

Li, Fangfei; Lu, Xiwen

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

Using Visualization to Generalize on Quadratic Patterning Tasks

ERIC Educational Resources Information Center

Kirwan, J. Vince

2017-01-01

Patterning tasks engage students in a core aspect of algebraic thinking-generalization (Kaput 2008). The National Council of Teachers of Mathematics (NCTM) Algebra Standard states that students in grades 9-12 should "generalize patterns using explicitly defined and recursively defined functions" (NCTM 2000, p. 296). Although educators…

Operator algebra as an application of logarithmic representation of infinitesimal generators

NASA Astrophysics Data System (ADS)

Iwata, Yoritaka

2018-02-01

The operator algebra is introduced based on the framework of logarithmic representation of infinitesimal generators. In conclusion a set of generally-unbounded infinitesimal generators is characterized as a module over the Banach algebra.

On the intersection of irreducible components of the space of finite-dimensional Lie algebras

DOE Office of Scientific and Technical Information (OSTI.GOV)

Gorbatsevich, Vladimir V

2012-07-31

The irreducible components of the space of n-dimensional Lie algebras are investigated. The properties of Lie algebras belonging to the intersection of all the irreducible components of this kind are studied (these Lie algebras are said to be basic or founding Lie algebras). It is proved that all Lie algebras of this kind are nilpotent and each of these Lie algebras has an Abelian ideal of codimension one. Specific examples of founding Lie algebras of arbitrary dimension are described and, to describe the Lie algebras in general, we state a conjecture. The concept of spectrum of a Lie algebra ismore » considered and some of the most elementary properties of the spectrum are studied. Bibliography: 6 titles.« less

Hom Gel'fand-Dorfman bialgebras and Hom-Lie conformal algebras

DOE Office of Scientific and Technical Information (OSTI.GOV)

Yuan, Lamei, E-mail: lmyuan@hit.edu.cn

2014-04-15

The aim of this paper is to introduce the notions of Hom Gel'fand-Dorfman bialgebra and Hom-Lie conformal algebra. In this paper, we give four constructions of Hom Gel'fand-Dorfman bialgebras. Also, we provide a general construction of Hom-Lie conformal algebras from Hom-Lie algebras. Finally, we prove that a Hom Gel'fand-Dorfman bialgebra is equivalent to a Hom-Lie conformal algebra of degree 2.

Identifying a Probabilistic Boolean Threshold Network From Samples.

PubMed

Melkman, Avraham A; Cheng, Xiaoqing; Ching, Wai-Ki; Akutsu, Tatsuya

2018-04-01

This paper studies the problem of exactly identifying the structure of a probabilistic Boolean network (PBN) from a given set of samples, where PBNs are probabilistic extensions of Boolean networks. Cheng et al. studied the problem while focusing on PBNs consisting of pairs of AND/OR functions. This paper considers PBNs consisting of Boolean threshold functions while focusing on those threshold functions that have unit coefficients. The treatment of Boolean threshold functions, and triplets and -tuplets of such functions, necessitates a deepening of the theoretical analyses. It is shown that wide classes of PBNs with such threshold functions can be exactly identified from samples under reasonable constraints, which include: 1) PBNs in which any number of threshold functions can be assigned provided that all have the same number of input variables and 2) PBNs consisting of pairs of threshold functions with different numbers of input variables. It is also shown that the problem of deciding the equivalence of two Boolean threshold functions is solvable in pseudopolynomial time but remains co-NP complete.

Griffin: A Tool for Symbolic Inference of Synchronous Boolean Molecular Networks.

PubMed

Muñoz, Stalin; Carrillo, Miguel; Azpeitia, Eugenio; Rosenblueth, David A

2018-01-01

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.

A calculus based on a q-deformed Heisenberg algebra

DOE PAGES

Cerchiai, B. L.; Hinterding, R.; Madore, J.; ...

1999-04-27

We show how one can construct a differential calculus over an algebra where position variables $x$ and momentum variables p have be defined. As the simplest example we consider the one-dimensional q-deformed Heisenberg algebra. This algebra has a subalgebra generated by cursive Greek chi and its inverse which we call the coordinate algebra. A physical field is considered to be an element of the completion of this algebra. We can construct a derivative which leaves invariant the coordinate algebra and so takes physical fields into physical fields. A generalized Leibniz rule for this algebra can be found. Based on thismore » derivative differential forms and an exterior differential calculus can be constructed.« less

On the Run-Time Optimization of the Boolean Logic of a Program.

ERIC Educational Resources Information Center

Cadolino, C.; Guazzo, M.

1982-01-01

Considers problem of optimal scheduling of Boolean expression (each Boolean variable represents binary outcome of program module) on single-processor system. Optimization discussed consists of finding operand arrangement that minimizes average execution costs representing consumption of resources (elapsed time, main memory, number of…

Boolean integral calculus for digital systems

NASA Technical Reports Server (NTRS)

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.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Suh, Uhi Rinn, E-mail: uhrisu1@math.snu.ac.kr

We introduce a classical BRST complex (See Definition 3.2.) and show that one can construct a classical affine W-algebra via the complex. This definition clarifies that classical affine W-algebras can be considered as quasi-classical limits of quantum affine W-algebras. We also give a definition of a classical affine fractional W-algebra as a Poisson vertex algebra. As in the classical affine case, a classical affine fractional W-algebra has two compatible λ-brackets and is isomorphic to an algebra of differential polynomials as a differential algebra. When a classical affine fractional W-algebra is associated to a minimal nilpotent, we describe explicit forms ofmore » free generators and compute λ-brackets between them. Provided some assumptions on a classical affine fractional W-algebra, we find an infinite sequence of integrable systems related to the algebra, using the generalized Drinfel’d and Sokolov reduction.« less

The Feigin Tetrahedron

NASA Astrophysics Data System (ADS)

Rupel, Dylan

2015-03-01

The first goal of this note is to extend the well-known Feigin homomorphisms taking quantum groups to quantum polynomial algebras. More precisely, we define generalized Feigin homomorphisms from a quantum shuffle algebra to quantum polynomial algebras which extend the classical Feigin homomorphisms along the embedding of the quantum group into said quantum shuffle algebra. In a recent work of Berenstein and the author, analogous extensions of Feigin homomorphisms from the dual Hall-Ringel algebra of a valued quiver to quantum polynomial algebras were defined. To relate these constructions, we establish a homomorphism, dubbed the quantum shuffle character, from the dual Hall-Ringel algebra to the quantum shuffle algebra which relates the generalized Feigin homomorphisms. These constructions can be compactly described by a commuting tetrahedron of maps beginning with the quantum group and terminating in a quantum polynomial algebra. The second goal in this project is to better understand the dual canonical basis conjecture for skew-symmetrizable quantum cluster algebras. In the symmetrizable types it is known that dual canonical basis elements need not have positive multiplicative structure constants, while this is still suspected to hold for skew-symmetrizable quantum cluster algebras. We propose an alternate conjecture for the symmetrizable types: the cluster monomials should correspond to irreducible characters of a KLR algebra. Indeed, the main conjecture of this note would establish this ''KLR conjecture'' for acyclic skew-symmetrizable quantum cluster algebras: that is, we conjecture that the images of rigid representations under the quantum shuffle character give irreducible characters for KLR algebras. We sketch a proof in the symmetric case giving an alternative to the proof of Kimura-Qin that all non-initial cluster variables in an acyclic skew-symmetric quantum cluster algebra are contained in the dual canonical basis. With these results in mind we interpret the cluster mutations directly in terms of the representation theory of the KLR algebra.

A Comparison of Two Methods for Boolean Query Relevancy Feedback.

ERIC Educational Resources Information Center

Salton, G.; And Others

1984-01-01

Evaluates and compares two recently proposed automatic methods for relevance feedback of Boolean queries (Dillon method, which uses probabilistic approach as basis, and disjunctive normal form method). Conclusions are drawn concerning the use of effective feedback methods in a Boolean query environment. Nineteen references are included. (EJS)

FAST TRACK COMMUNICATION Algebraic classification of the Weyl tensor in higher dimensions based on its 'superenergy' tensor

NASA Astrophysics Data System (ADS)

Senovilla, José M. M.

2010-11-01

The algebraic classification of the Weyl tensor in the arbitrary dimension n is recovered by means of the principal directions of its 'superenergy' tensor. This point of view can be helpful in order to compute the Weyl aligned null directions explicitly, and permits one to obtain the algebraic type of the Weyl tensor by computing the principal eigenvalue of rank-2 symmetric future tensors. The algebraic types compatible with states of intrinsic gravitational radiation can then be explored. The underlying ideas are general, so that a classification of arbitrary tensors in the general dimension can be achieved.

Non-AdS holography in 3-dimensional higher spin gravity — General recipe and example

NASA Astrophysics Data System (ADS)

Afshar, H.; Gary, M.; Grumiller, D.; Rashkov, R.; Riegler, M.

2012-11-01

We present the general algorithm to establish the classical and quantum asymptotic symmetry algebra for non-AdS higher spin gravity and implement it for the specific example of spin-3 gravity in the non-principal embedding with Lobachevsky ( {{{{H}}^2}× {R}} ) boundary conditions. The asymptotic symmetry algebra for this example consists of a quantum W_3^{(2) } (Polyakov-Bershadsky) and an affine û(1) algebra. We show that unitary representations of the quantum W_3^{(2) } algebra exist only for two values of its central charge, the trivial c = 0 "theory" and the simple c = 1 theory.

Health literacy and patient web portals.

PubMed

Coughlin, Steven S; Stewart, Jessica L; Young, Lufei; Heboyan, Vahé; De Leo, Gianluca

2018-05-01

There is limited evidence about the association between health literacy and use of patient web portals in patients with chronic illnesses. The objective of this review was to learn more about health literacy and use of patient web portals. Bibliographic searches were conducted in PubMed and CINAHL using relevant MeSH search terms and Boolean algebra commands. Qualitative studies and studies with a cross-sectional, cohort, or pre-/post-test design have shown that persons with limited health literacy are less likely to use patient web portals, although there is inconsistency in the association across studies. The conflicting findings may be partially due to racial and ethnic differences in health literacy or level of comfort in sharing private health information using mobile technologies. Several opportunities exist to improve the usability and acceptability of web portals for patients with limited health literacy including enhancements in the design of the portals, patient and provider education and training, and engagement of proxies such as caregivers and close family members. Copyright © 2018 Elsevier B.V. All rights reserved.

Application of fuzzy fault tree analysis based on modified fuzzy AHP and fuzzy TOPSIS for fire and explosion in the process industry.

PubMed

Yazdi, Mohammad; Korhan, Orhan; Daneshvar, Sahand

2018-05-09

This study aimed at establishing fault tree analysis (FTA) using expert opinion to compute the probability of an event. To find the probability of the top event (TE), all probabilities of the basic events (BEs) should be available when the FTA is drawn. In this case, employing expert judgment can be used as an alternative to failure data in an awkward situation. The fuzzy analytical hierarchy process as a standard technique is used to give a specific weight to each expert, and fuzzy set theory is engaged for aggregating expert opinion. In this regard, the probability of BEs will be computed and, consequently, the probability of the TE obtained using Boolean algebra. Additionally, to reduce the probability of the TE in terms of three parameters (safety consequences, cost and benefit), the importance measurement technique and modified TOPSIS was employed. The effectiveness of the proposed approach is demonstrated with a real-life case study.

A biochemical logic gate using an enzyme and its inhibitor. Part II: The logic gate.

PubMed

Sivan, Sarit; Tuchman, Samuel; Lotan, Noah

2003-06-01

Enzyme-Based Logic Gates (ENLOGs) are key components in bio-molecular systems for information processing. This report and the previous one in this series address the characterization of two bio-molecular switching elements, namely the alpha-chymotrypsin (alphaCT) derivative p-phenylazobenzoyl-alpha-chymotrypsin (PABalphaCT) and its inhibitor (proflavine), as well as their assembly into a logic gate. The experimental output of the proposed system is expressed in terms of enzymic activity and this was translated into logic output (i.e. "1" or "0") relative to a predetermined threshold value. We have found that an univalent link exists between the dominant isomers of PABalphaCT (cis or trans), the dominant form of either acridine (proflavine) or acridan and the logic output of the system. Thus, of all possible combinations, only the trans-PABalphaCT and the acridan lead to an enzymic activity that can be defined as logic output "1". The system operates under the rules of Boolean algebra and performs as an "AND" logic gate.

Yang-Baxter algebras, integrable theories and Bethe Ansatz

DOE Office of Scientific and Technical Information (OSTI.GOV)

De Vega, H.J.

1990-03-10

This paper presents the Yang-Baxter algebras (YBA) in a general framework stressing their power to exactly solve the lattice models associated to them. The algebraic Behe Ansatz is developed as an eigenvector construction based on the YBA. The six-vertex model solution is given explicitly. The generalization of YB algebras to face language is considered. The algebraic BA for the SOS model of Andrews, Baxter and Forrester is described using these face YB algebras. It is explained how these lattice models yield both solvable massive QFT and conformal models in appropriated scaling (continuous) limits within the lattice light-cone approach. This approachmore » permit to define and solve rigorously massive QFT as an appropriate continuum limit of gapless vertex models. The deep links between the YBA and Lie algebras are analyzed including the quantum groups that underlay the trigonometric/hyperbolic YBA. Braid and quantum groups are derived from trigonometric/hyperbolic YBA in the limit of infinite spectral parameter. To conclude, some recent developments in the domain of integrable theories are summarized.« less

Modular operads and the quantum open-closed homotopy algebra

NASA Astrophysics Data System (ADS)

Doubek, Martin; Jurčo, Branislav; Münster, Korbinian

2015-12-01

We verify that certain algebras appearing in string field theory are algebras over Feynman transform of modular operads which we describe explicitly. Equivalent description in terms of solutions of generalized BV master equations are explained from the operadic point of view.

Elementary maps on nest algebras

NASA Astrophysics Data System (ADS)

Li, Pengtong

2006-08-01

Let , be algebras and let , be maps. An elementary map of is an ordered pair (M,M*) such that for all , . In this paper, the general form of surjective elementary maps on standard subalgebras of nest algebras is described. In particular, such maps are automatically additive.

Boolean Classes and Qualitative Inquiry. WCER Working Paper No. 2006-3

ERIC Educational Resources Information Center

Nathan, Mitchell J.; Jackson, Kristi

2006-01-01

The prominent role of Boolean classes in qualitative data analysis software is viewed by some as an encroachment of logical positivism on qualitative research methodology. The authors articulate an embodiment perspective, in which Boolean classes are viewed as conceptual metaphors for apprehending and manipulating data, concepts, and categories in…

Celestial mechanics with geometric algebra

NASA Technical Reports Server (NTRS)

Hestenes, D.

1983-01-01

Geometric algebra is introduced as a general tool for Celestial Mechanics. A general method for handling finite rotations and rotational kinematics is presented. The constants of Kepler motion are derived and manipulated in a new way. A new spinor formulation of perturbation theory is developed.

Pathways from marine protected area design and management to ecological success

PubMed Central

2015-01-01

Using an international dataset compiled from 121 sites in 87 marine protected areas (MPAs) globally (Edgar et al., 2014), I assessed how various configurations of design and management conditions affected MPA ecological performance, measured in terms of fish species richness and biomass. The set-theoretic approach used Boolean algebra to identify pathways that combined up to five ‘NEOLI’ (No-take, Enforced, Old, Large, Isolated) conditions and that were sufficient for achieving positive, and negative, ecological outcomes. Ecological isolation was overwhelming the most important condition affecting ecological outcomes but Old and Large were also conditions important for achieving high levels of biomass among large fishes (jacks, groupers, sharks). Solution coverage was uniformly low (<0.35) for all models of positive ecological performance suggesting the presence of numerous other conditions and pathways to ecological success that did not involve the NEOLI conditions. Solution coverage was higher (>0.50) for negative results (i.e., the absence of high biomass) among the large commercially-exploited fishes, implying asymmetries in how MPAs may rebuild populations on the one hand and, on the other, protect against further decline. The results revealed complex interactions involving MPA design, implementation, and management conditions that affect MPA ecological performance. In general terms, the presence of no-take regulations and effective enforcement were insufficient to ensure MPA effectiveness on their own. Given the central role of ecological isolation in securing ecological benefits from MPAs, site selection in the design phase appears critical for success. PMID:26644975

Representations for the Generalized Drazin Inverse of the Sum in a Banach Algebra and Its Application for Some Operator Matrices

PubMed Central

Liu, Xiaoji; Qin, Xiaolan

2015-01-01

We investigate additive properties of the generalized Drazin inverse in a Banach algebra A. We find explicit expressions for the generalized Drazin inverse of the sum a + b, under new conditions on a, b ∈ A. As an application we give some new representations for the generalized Drazin inverse of an operator matrix. PMID:25729767

Representations for the generalized Drazin inverse of the sum in a Banach algebra and its application for some operator matrices.

PubMed

Liu, Xiaoji; Qin, Xiaolan

2015-01-01

We investigate additive properties of the generalized Drazin inverse in a Banach algebra A. We find explicit expressions for the generalized Drazin inverse of the sum a + b, under new conditions on a, b ∈ A. As an application we give some new representations for the generalized Drazin inverse of an operator matrix.

Bisimulation equivalence of differential-algebraic systems

NASA Astrophysics Data System (ADS)

Megawati, Noorma Yulia; Schaft, Arjan van der

2018-01-01

In this paper, the notion of bisimulation relation for linear input-state-output systems is extended to general linear differential-algebraic (DAE) systems. Geometric control theory is used to derive a linear-algebraic characterisation of bisimulation relations, and an algorithm for computing the maximal bisimulation relation between two linear DAE systems. The general definition is specialised to the case where the matrix pencil sE - A is regular. Furthermore, by developing a one-sided version of bisimulation, characterisations of simulation and abstraction are obtained.

E-Referencer: Transforming Boolean OPACs to Web Search Engines.

ERIC Educational Resources Information Center

Khoo, Christopher S. G.; Poo, Danny C. C.; Toh, Teck-Kang; Hong, Glenn

E-Referencer is an expert intermediary system for searching library online public access catalogs (OPACs) on the World Wide Web. It is implemented as a proxy server that mediates the interaction between the user and Boolean OPACs. It transforms a Boolean OPAC into a retrieval system with many of the search capabilities of Web search engines.…

Regular Gleason Measures and Generalized Effect Algebras

NASA Astrophysics Data System (ADS)

Dvurečenskij, Anatolij; Janda, Jiří

2015-12-01

We study measures, finitely additive measures, regular measures, and σ-additive measures that can attain even infinite values on the quantum logic of a Hilbert space. We show when particular classes of non-negative measures can be studied in the frame of generalized effect algebras.

Students' Perceptions about the Symbols, Letters and Signs in Algebra and How Do These Affect Their Learning of Algebra: A Case Study in a Government Girls Secondary School Karachi

ERIC Educational Resources Information Center

Samo, Mashooque Ali

2009-01-01

Algebra uses symbols for generalizing arithmetic. These symbols have different meanings and interpretations in different situations. Students have different perceptions about these symbols, letters and signs. Despite the vast research by on the students' difficulties in understanding letters in Algebra, the overall image that emerges from the…

Working memory, worry, and algebraic ability.

PubMed

Trezise, Kelly; Reeve, Robert A

2014-05-01

Math anxiety (MA)-working memory (WM) relationships have typically been examined in the context of arithmetic problem solving, and little research has examined the relationship in other math domains (e.g., algebra). Moreover, researchers have tended to examine MA/worry separate from math problem solving activities and have used general WM tasks rather than domain-relevant WM measures. Furthermore, it seems to have been assumed that MA affects all areas of math. It is possible, however, that MA is restricted to particular math domains. To examine these issues, the current research assessed claims about the impact on algebraic problem solving of differences in WM and algebraic worry. A sample of 80 14-year-old female students completed algebraic worry, algebraic WM, algebraic problem solving, nonverbal IQ, and general math ability tasks. Latent profile analysis of worry and WM measures identified four performance profiles (subgroups) that differed in worry level and WM capacity. Consistent with expectations, subgroup membership was associated with algebraic problem solving performance: high WM/low worry>moderate WM/low worry=moderate WM/high worry>low WM/high worry. Findings are discussed in terms of the conceptual relationship between emotion and cognition in mathematics and implications for the MA-WM-performance relationship. Copyright © 2013 Elsevier Inc. All rights reserved.

Generalized Quantum Field Theory Based on a Nonlinear Deformed Heisenberg Algebra

NASA Astrophysics Data System (ADS)

Ribeiro-Silva, C. I.; Oliveira-Neto, N. M.

We consider a quantum field theory based on a nonlinear Heisenberg algebra which describes phenomenologically a composite particle. Perturbative computation, considering the λϕ4 interaction was done and we also performed some comparison with a quantum field theory based on the q-oscillator algebra.

Ten-Year-Old Students Solving Linear Equations

ERIC Educational Resources Information Center

Brizuela, Barbara; Schliemann, Analucia

2004-01-01

In this article, the authors seek to re-conceptualize the perspective regarding students' difficulties with algebra. While acknowledging that students "do" have difficulties when learning algebra, they also argue that the generally espoused criteria for algebra as the ability to work with the syntactical rules for solving equations is…

Promoting Quantitative Literacy in an Online College Algebra Course

ERIC Educational Resources Information Center

Tunstall, Luke; Bossé, Michael J.

2016-01-01

College algebra (a university freshman level algebra course) fulfills the quantitative literacy requirement of many college's general education programs and is a terminal course for most who take it. An online problem-based learning environment provides a unique means of engaging students in quantitative discussions and research. This article…

Literal algebra for satellite dynamics. [perturbation analysis

NASA Technical Reports Server (NTRS)

Gaposchkin, E. M.

1975-01-01

A description of the rather general class of operations available is given and the operations are related to problems in satellite dynamics. The implementation of an algebra processor is discussed. The four main categories of symbol processors are related to list processing, string manipulation, symbol manipulation, and formula manipulation. Fundamental required operations for an algebra processor are considered. It is pointed out that algebra programs have been used for a number of problems in celestial mechanics with great success. The advantage of computer algebra is its accuracy and speed.

Contractions from grading

NASA Astrophysics Data System (ADS)

Krishnan, Chethan; Raju, Avinash

2018-04-01

We note that large classes of contractions of algebras that arise in physics can be understood purely algebraically via identifying appropriate Zm-gradings (and their generalizations) on the parent algebra. This includes various types of flat space/Carroll limits of finite and infinite dimensional (A)dS algebras, as well as Galilean and Galilean conformal algebras. Our observations can be regarded as providing a natural context for the Grassmann approach of Krishnan et al. [J. High Energy Phys. 2014(3), 36]. We also introduce a related notion, which we call partial grading, that arises naturally in this context.

On the structure of quantum L∞ algebras

NASA Astrophysics Data System (ADS)

Blumenhagen, Ralph; Fuchs, Michael; Traube, Matthias

2017-10-01

It is believed that any classical gauge symmetry gives rise to an L∞ algebra. Based on the recently realized relation between classical W algebras and L∞ algebras, we analyze how this generalizes to the quantum case. Guided by the existence of quantum W algebras, we provide a physically well motivated definition of quantum L∞ algebras describing the consistency of global symmetries in quantum field theories. In this case we are restricted to only two non-trivial graded vector spaces X 0 and X -1 containing the symmetry variations and the symmetry generators. This quantum L∞ algebra structure is explicitly exemplified for the quantum W_3 algebra. The natural quantum product between fields is the normal ordered one so that, due to contractions between quantum fields, the higher L∞ relations receive off-diagonal quantum corrections. Curiously, these are not present in the loop L∞ algebra of closed string field theory.

Individual Differences in Algebraic Cognition: Relation to the Approximate Number and Sematic Memory Systems

PubMed Central

Geary, David C.; Hoard, Mary K.; Nugent, Lara; Rouder, Jeffrey N.

2015-01-01

The relation between performance on measures of algebraic cognition and acuity of the approximate number system (ANS) and memory for addition facts was assessed for 171 (92 girls) 9th graders, controlling parental education, sex, reading achievement, speed of numeral processing, fluency of symbolic number processing, intelligence, and the central executive component of working memory. The algebraic tasks assessed accuracy in placing x,y pairs in the coordinate plane, speed and accuracy of expression evaluation, and schema memory for algebra equations. ANS acuity was related to accuracy of placements in the coordinate plane and expression evaluation, but not schema memory. Frequency of fact-retrieval errors was related to schema memory but not coordinate plane or expression evaluation accuracy. The results suggest the ANS may contribute to or is influenced by spatial-numerical and numerical only quantity judgments in algebraic contexts, whereas difficulties in committing addition facts to long-term memory may presage slow formation of memories for the basic structure of algebra equations. More generally, the results suggest different brain and cognitive systems are engaged during the learning of different components of algebraic competence, controlling demographic and domain general abilities. PMID:26255604

Variations on a theme of Heisenberg, Pauli and Weyl

NASA Astrophysics Data System (ADS)

Kibler, Maurice R.

2008-09-01

The parentage between Weyl pairs, the generalized Pauli group and the unitary group is investigated in detail. We start from an abstract definition of the Heisenberg-Weyl group on the field {\\bb R} and then switch to the discrete Heisenberg-Weyl group or generalized Pauli group on a finite ring {\\bb Z}_d . The main characteristics of the latter group, an abstract group of order d3 noted Pd, are given (conjugacy classes and irreducible representation classes or equivalently Lie algebra of dimension d3 associated with Pd). Leaving the abstract sector, a set of Weyl pairs in dimension d is derived from a polar decomposition of SU(2) closely connected to angular momentum theory. Then, a realization of the generalized Pauli group Pd and the construction of generalized Pauli matrices in dimension d are revisited in terms of Weyl pairs. Finally, the Lie algebra of the unitary group U(d) is obtained as a subalgebra of the Lie algebra associated with Pd. This leads to a development of the Lie algebra of U(d) in a basis consisting of d2 generalized Pauli matrices. In the case where d is a power of a prime integer, the Lie algebra of SU(d) can be decomposed into d - 1 Cartan subalgebras. Dedicated to the memory of my teacher and friend Moshé Flato on the occasion of the tenth anniversary of his death.

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

ERIC Educational Resources Information Center

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…

SETS. Set Equation Transformation System

DOE Office of Scientific and Technical Information (OSTI.GOV)

Worrell, R.B.

1992-01-13

SETS is used for symbolic manipulation of Boolean equations, particularly the reduction of equations by the application of Boolean 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 noncoherent 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 throughmore » nullification of sensors in its protection system.« less

Monotone Boolean approximation

DOE Office of Scientific and Technical Information (OSTI.GOV)

Hulme, B.L.

1982-12-01

This report presents a theory of approximation of arbitrary Boolean functions by simpler, monotone functions. Monotone increasing functions can be expressed without the use of complements. Nonconstant monotone increasing functions are important in their own right since they model a special class of systems known as coherent systems. It is shown here that when Boolean expressions for noncoherent systems become too large to treat exactly, then monotone approximations are easily defined. The algorithms proposed here not only provide simpler formulas but also produce best possible upper and lower monotone bounds for any Boolean function. This theory has practical application formore » the analysis of noncoherent fault trees and event tree sequences.« less

On spectral techniques in analysis of Boolean networks

NASA Astrophysics Data System (ADS)

Kesseli, Juha; Rämö, Pauli; Yli-Harja, Olli

2005-06-01

In this work we present results that can be used for analysis of Boolean networks. The results utilize Fourier spectra of the functions in the network. An accurate formula is given for Derrida plots of networks of finite size N based on a result on Boolean functions presented in another context. Derrida plots are widely used to examine the stability issues of Boolean networks. For the limit N→∞, we give a computationally simple form that can be used as a good approximation for rather small networks as well. A formula for Derrida plots of random Boolean networks (RBNs) presented earlier in the literature is given an alternative derivation. It is shown that the information contained in the Derrida plot is equal to the average Fourier spectrum of the functions in the network. In the case of random networks the mean Derrida plot can be obtained from the mean spectrum of the functions. The method is applied to real data by using the Boolean functions found in genetic regulatory networks of eukaryotic cells in an earlier study. Conventionally, Derrida plots and stability analysis have been computed with statistical sampling resulting in poorer accuracy.

Automatic Screening for Perturbations in Boolean Networks.

PubMed

Schwab, Julian D; Kestler, Hans A

2018-01-01

A common approach to address biological questions in systems biology is to simulate regulatory mechanisms using dynamic models. Among others, Boolean networks can be used to model the dynamics of regulatory processes in biology. Boolean network models allow simulating the qualitative behavior of the modeled processes. A central objective in the simulation of Boolean networks is the computation of their long-term behavior-so-called attractors. These attractors are of special interest as they can often be linked to biologically relevant behaviors. Changing internal and external conditions can influence the long-term behavior of the Boolean network model. Perturbation of a Boolean network by stripping a component of the system or simulating a surplus of another element can lead to different attractors. Apparently, the number of possible perturbations and combinations of perturbations increases exponentially with the size of the network. Manually screening a set of possible components for combinations that have a desired effect on the long-term behavior can be very time consuming if not impossible. We developed a method to automatically screen for perturbations that lead to a user-specified change in the network's functioning. This method is implemented in the visual simulation framework ViSiBool utilizing satisfiability (SAT) solvers for fast exhaustive attractor search.

Contributions of Domain-General Cognitive Resources and Different Forms of Arithmetic Development to Pre-Algebraic Knowledge

ERIC Educational Resources Information Center

Fuchs, Lynn S.; Compton, Donald L.; Fuchs, Douglas; Powell, Sarah R.; Schumacher, Robin F.; Hamlett, Carol L.; Vernier, Emily; Namkung, Jessica M.; Vukovic, Rose K.

2012-01-01

The purpose of this study was to investigate the contributions of domain-general cognitive resources and different forms of arithmetic development to individual differences in pre-algebraic knowledge. Children (n = 279, mean age = 7.59 years) were assessed on 7 domain-general cognitive resources as well as arithmetic calculations and word problems…

Transforming Boolean models to continuous models: methodology and application to T-cell receptor signaling

PubMed Central

Wittmann, Dominik M; Krumsiek, Jan; Saez-Rodriguez, Julio; Lauffenburger, Douglas A; Klamt, Steffen; Theis, Fabian J

2009-01-01

Background The understanding of regulatory and signaling networks has long been a core objective in Systems Biology. Knowledge about these networks is mainly of qualitative nature, which allows the construction of Boolean models, where the state of a component is either 'off' or 'on'. While often able to capture the essential behavior of a network, these models can never reproduce detailed time courses of concentration levels. Nowadays however, experiments yield more and more quantitative data. An obvious question therefore is how qualitative models can be used to explain and predict the outcome of these experiments. Results In this contribution we present a canonical way of transforming Boolean into continuous models, where the use of multivariate polynomial interpolation allows transformation of logic operations into a system of ordinary differential equations (ODE). The method is standardized and can readily be applied to large networks. Other, more limited approaches to this task are briefly reviewed and compared. Moreover, we discuss and generalize existing theoretical results on the relation between Boolean and continuous models. As a test case a logical model is transformed into an extensive continuous ODE model describing the activation of T-cells. We discuss how parameters for this model can be determined such that quantitative experimental results are explained and predicted, including time-courses for multiple ligand concentrations and binding affinities of different ligands. This shows that from the continuous model we may obtain biological insights not evident from the discrete one. Conclusion The presented approach will facilitate the interaction between modeling and experiments. Moreover, it provides a straightforward way to apply quantitative analysis methods to qualitatively described systems. PMID:19785753

Algebra. A Guidebook for Teaching.

ERIC Educational Resources Information Center

Goodman, Terry A.; And Others

This book provides a general framework for organizing the instructional program in algebra. For each topic, a general approach for instruction, together with specific strategies, activities, and resources that can be used daily, are provided. Also included are worksheet pages that can be used with students. Most activities provide for student…

Generalized Heisenberg algebra and (non linear) pseudo-bosons

NASA Astrophysics Data System (ADS)

Bagarello, F.; Curado, E. M. F.; Gazeau, J. P.

2018-04-01

We propose a deformed version of the generalized Heisenberg algebra by using techniques borrowed from the theory of pseudo-bosons. In particular, this analysis is relevant when non self-adjoint Hamiltonians are needed to describe a given physical system. We also discuss relations with nonlinear pseudo-bosons. Several examples are discussed.

An Analysis of the Algebraic Method for Balancing Chemical Reactions.

ERIC Educational Resources Information Center

Olson, John A.

1997-01-01

Analyzes the algebraic method for balancing chemical reactions. Introduces a third general condition that involves a balance between the total amount of oxidation and reduction. Requires the specification of oxidation states for all elements throughout the reaction. Describes the general conditions, the mathematical treatment, redox reactions, and…

Staircases, Towers, and Castles

ERIC Educational Resources Information Center

Kara, Melike; Eames, Cheryl L.; Miller, Amanda L.; Chieu, Annie

2015-01-01

The very nature of algebra concerns the generalization of patterns (Lee 1996). Patterning activities that are geometric in nature can serve as powerful contexts that engage students in algebraic thinking and visually support them in constructing a variety of generalizations and justifications (e.g., Healy and Hoyles 1999; Lannin 2005). In this…

A Electro-Optical Image Algebra Processing System for Automatic Target Recognition

NASA Astrophysics Data System (ADS)

Coffield, Patrick Cyrus

The proposed electro-optical image algebra processing system is designed specifically for image processing and other related computations. The design is a hybridization of an optical correlator and a massively paralleled, single instruction multiple data processor. The architecture of the design consists of three tightly coupled components: a spatial configuration processor (the optical analog portion), a weighting processor (digital), and an accumulation processor (digital). The systolic flow of data and image processing operations are directed by a control buffer and pipelined to each of the three processing components. The image processing operations are defined in terms of basic operations of an image algebra developed by the University of Florida. The algebra is capable of describing all common image-to-image transformations. The merit of this architectural design is how it implements the natural decomposition of algebraic functions into spatially distributed, point use operations. The effect of this particular decomposition allows convolution type operations to be computed strictly as a function of the number of elements in the template (mask, filter, etc.) instead of the number of picture elements in the image. Thus, a substantial increase in throughput is realized. The implementation of the proposed design may be accomplished in many ways. While a hybrid electro-optical implementation is of primary interest, the benefits and design issues of an all digital implementation are also discussed. The potential utility of this architectural design lies in its ability to control a large variety of the arithmetic and logic operations of the image algebra's generalized matrix product. The generalized matrix product is the most powerful fundamental operation in the algebra, thus allowing a wide range of applications. No other known device or design has made this claim of processing speed and general implementation of a heterogeneous image algebra.

Duncan F. Gregory, William Walton and the development of British algebra: 'algebraical geometry', 'geometrical algebra', abstraction.

PubMed

Verburgt, Lukas M

2016-01-01

This paper provides a detailed account of the period of the complex history of British algebra and geometry between the publication of George Peacock's Treatise on Algebra in 1830 and William Rowan Hamilton's paper on quaternions of 1843. During these years, Duncan Farquharson Gregory and William Walton published several contributions on 'algebraical geometry' and 'geometrical algebra' in the Cambridge Mathematical Journal. These contributions enabled them not only to generalize Peacock's symbolical algebra on the basis of geometrical considerations, but also to initiate the attempts to question the status of Euclidean space as the arbiter of valid geometrical interpretations. At the same time, Gregory and Walton were bound by the limits of symbolical algebra that they themselves made explicit; their work was not and could not be the 'abstract algebra' and 'abstract geometry' of figures such as Hamilton and Cayley. The central argument of the paper is that an understanding of the contributions to 'algebraical geometry' and 'geometrical algebra' of the second generation of 'scientific' symbolical algebraists is essential for a satisfactory explanation of the radical transition from symbolical to abstract algebra that took place in British mathematics in the 1830s-1840s.

Analysis of Secondary School Students’ Algebraic Thinking and Math-Talk Learning Community to Help Students Learn

NASA Astrophysics Data System (ADS)

Nurhayati, D. M.; Herman, T.; Suhendra, S.

2017-09-01

This study aims to determine the difficulties of algebraic thinking ability of students in one of secondary school on quadrilateral subject and to describe Math-Talk Learning Community as the alternative way that can be done to overcome the difficulties of the students’ algebraic thinking ability. Research conducted by using quantitative approach with descriptive method. The population in this research was all students of that school and twenty three students as the sample that was chosen by purposive sampling technique. Data of algebraic thinking were collected through essay test. The results showed the percentage of achievement of students’ algebraic thinking’s indicators on three aspects: a) algebra as generalized arithmetic with the indicators (conceptually based computational strategies and estimation); b) algebra as the language of mathematics (meaning of variables, variable expressions and meaning of solution); c) algebra as a tool for functions and mathematical modelling (representing mathematical ideas using equations, tables, or words and generalizing patterns and rules in real-world contexts) is still low. It is predicted that because the secondary school students was not familiar with the abstract problem and they are still at a semi-concrete stage where the stage of cognitive development is between concrete and abstract. Based on the percentage achievement of each indicators, it can be concluded that the level of achievement of student’s mathematical communication using conventional learning is still low, so students’ algebraic thinking ability need to be improved.

Quantization of set theory and generalization of the fermion algebra

NASA Astrophysics Data System (ADS)

Arik, M.; Tekin, S. C.

2002-05-01

The quantum states of a d-dimensional fermion algebra are in one to one correspondence with the subsets of a d-element universal set. In this paper we use this set theoretical motivation to construct a one-parameter deformation of the fermion algebra and extend it to a d-dimensional generalization which is invariant under the group U(d). This discrete fermionic oscillator system is extended to the continuous case. We also show that the q-deformation of these systems is related to supercovariant q-oscillators.

Type II superstring field theory: geometric approach and operadic description

NASA Astrophysics Data System (ADS)

Jurčo, Branislav; Münster, Korbinian

2013-04-01

We outline the construction of type II superstring field theory leading to a geometric and algebraic BV master equation, analogous to Zwiebach's construction for the bosonic string. The construction uses the small Hilbert space. Elementary vertices of the non-polynomial action are described with the help of a properly formulated minimal area problem. They give rise to an infinite tower of superstring field products defining a {N} = 1 generalization of a loop homotopy Lie algebra, the genus zero part generalizing a homotopy Lie algebra. Finally, we give an operadic interpretation of the construction.

Multi-loop Integrand Reduction with Computational Algebraic Geometry

NASA Astrophysics Data System (ADS)

Badger, Simon; Frellesvig, Hjalte; Zhang, Yang

2014-06-01

We discuss recent progress in multi-loop integrand reduction methods. Motivated by the possibility of an automated construction of multi-loop amplitudes via generalized unitarity cuts we describe a procedure to obtain a general parameterisation of any multi-loop integrand in a renormalizable gauge theory. The method relies on computational algebraic geometry techniques such as Gröbner bases and primary decomposition of ideals. We present some results for two and three loop amplitudes obtained with the help of the MACAULAY2 computer algebra system and the Mathematica package BASISDET.

N  =  2 and N  =  4 subalgebras of super vertex operator algebras

NASA Astrophysics Data System (ADS)

Mason, Geoffrey; Tuite, Michael; Yamskulna, Gaywalee

2018-02-01

We develop criteria to decide if an N  =  2 or N  =  4 superconformal algebra is a subalgebra of a super vertex operator algebra in general, and of a super lattice theory in particular. We give some specific examples.

A Comparison of Web-Based and Paper-and-Pencil Homework on Student Performance in College Algebra

ERIC Educational Resources Information Center

Hauk, Shandy; Powers, Robert A.; Segalla, Angelo

2015-01-01

College algebra fulfills general education requirements at many colleges in the United States. The study reported here investigated differences in mathematics achievement between undergraduates in college algebra classes using one of two homework methods: "WeBWorK," an open-source system for web-based homework, or traditional…

Commentary on A General Curriculum in Mathematics for Colleges.

ERIC Educational Resources Information Center

Committee on the Undergraduate Program in Mathematics, Berkeley, CA.

This document constitutes a complete revision of the report of the same name first published in 1965. A new list of basic courses is described, consisting of Calculus I, Calculus II, Elementary Linear Algebra, Multivariable Calculus I, Linear Algebra, and Introductory Modern Algebra. Commentaries outline the content and spirit of these courses in…

Kac determinant and singular vector of the level N representation of Ding-Iohara-Miki algebra

NASA Astrophysics Data System (ADS)

Ohkubo, Yusuke

2018-05-01

In this paper, we obtain the formula for the Kac determinant of the algebra arising from the level N representation of the Ding-Iohara-Miki algebra. It is also discovered that its singular vectors correspond to generalized Macdonald functions (the q-deformed version of the AFLT basis).

Capitalising on Inherent Ambiguities in Symbolic Expressions of Generality

ERIC Educational Resources Information Center

Samson, Duncan

2011-01-01

The exploration of number patterns as a pedagogical approach to introducing algebra has been advocated by many mathematics educators. French (2002) comments that the introduction of algebra through what is potentially a wide range of pattern generalisation activities may be effective in assisting pupils to see algebra as both meaningful and…

DOE Office of Scientific and Technical Information (OSTI.GOV)

Schlichenmaier, M

Recently, Lax operator algebras appeared as a new class of higher genus current-type algebras. Introduced by Krichever and Sheinman, they were based on Krichever's theory of Lax operators on algebraic curves. These algebras are almost-graded Lie algebras of currents on Riemann surfaces with marked points (in-points, out-points and Tyurin points). In a previous joint article with Sheinman, the author classified the local cocycles and associated almost-graded central extensions in the case of one in-point and one out-point. It was shown that the almost-graded extension is essentially unique. In this article the general case of Lax operator algebras corresponding to several in- andmore » out-points is considered. As a first step they are shown to be almost-graded. The grading is given by splitting the marked points which are non-Tyurin points into in- and out-points. Next, classification results both for local and bounded cocycles are proved. The uniqueness theorem for almost-graded central extensions follows. To obtain this generalization additional techniques are needed which are presented in this article. Bibliography: 30 titles.« less

Color is processed less efficiently than orientation in change detection but more efficiently in visual search.

PubMed

Huang, Liqiang

2015-05-01

Basic visual features (e.g., color, orientation) are assumed to be processed in the same general way across different visual tasks. Here, a significant deviation from this assumption was predicted on the basis of the analysis of stimulus spatial structure, as characterized by the Boolean-map notion. If a task requires memorizing the orientations of a set of bars, then the map consisting of those bars can be readily used to hold the overall structure in memory and will thus be especially useful. If the task requires visual search for a target, then the map, which contains only an overall structure, will be of little use. Supporting these predictions, the present study demonstrated that in comparison to stimulus colors, bar orientations were processed more efficiently in change-detection tasks but less efficiently in visual search tasks (Cohen's d = 4.24). In addition to offering support for the role of the Boolean map in conscious access, the present work also throws doubts on the generality of processing visual features. © The Author(s) 2015.

A Algebraic Approach to the Quantization of Constrained Systems: Finite Dimensional Examples.

NASA Astrophysics Data System (ADS)

Tate, Ranjeet Shekhar

1992-01-01

General relativity has two features in particular, which make it difficult to apply to it existing schemes for the quantization of constrained systems. First, there is no background structure in the theory, which could be used, e.g., to regularize constraint operators, to identify a "time" or to define an inner product on physical states. Second, in the Ashtekar formulation of general relativity, which is a promising avenue to quantum gravity, the natural variables for quantization are not canonical; and, classically, there are algebraic identities between them. Existing schemes are usually not concerned with such identities. Thus, from the point of view of canonical quantum gravity, it has become imperative to find a framework for quantization which provides a general prescription to find the physical inner product, and is flexible enough to accommodate non -canonical variables. In this dissertation I present an algebraic formulation of the Dirac approach to the quantization of constrained systems. The Dirac quantization program is augmented by a general principle to find the inner product on physical states. Essentially, the Hermiticity conditions on physical operators determine this inner product. I also clarify the role in quantum theory of possible algebraic identities between the elementary variables. I use this approach to quantize various finite dimensional systems. Some of these models test the new aspects of the algebraic framework. Others bear qualitative similarities to general relativity, and may give some insight into the pitfalls lurking in quantum gravity. The previous quantizations of one such model had many surprising features. When this model is quantized using the algebraic program, there is no longer any unexpected behaviour. I also construct the complete quantum theory for a previously unsolved relativistic cosmology. All these models indicate that the algebraic formulation provides powerful new tools for quantization. In (spatially compact) general relativity, the Hamiltonian is constrained to vanish. I present various approaches one can take to obtain an interpretation of the quantum theory of such "dynamically constrained" systems. I apply some of these ideas to the Bianchi I cosmology, and analyze the issue of the initial singularity in quantum theory.

Algebraic Algorithm Design and Local Search

DTIC Science & Technology

1996-12-01

method for performing algorithm design that is more purely algebraic than that of KIDS. This method is then applied to local search. Local search is a...synthesis. Our approach was to follow KIDS in spirit, but to adopt a pure algebraic formalism, supported by Kestrel’s SPECWARE environment (79), that...design was developed that is more purely algebraic than that of KIDS. This method was then applied to local search. A general theory of local search was

Graph C ∗-algebras and Z2-quotients of quantum spheres

NASA Astrophysics Data System (ADS)

Hajac, Piotr M.; Matthes, Rainer; Szymański, Wojciech

2003-06-01

We consider two Z2-actions on the Podleś generic quantum spheres. They yield, as noncommutative quotient spaces, the Klimek-Lesmewski q-disc and the quantum real projective space, respectively. The C ∗-algebas of all these quantum spaces are described as graph C ∗-algebras. The K-groups of the thus presented C ∗-algebras are then easily determined from the general theory of graph C ∗-algebas. For the quantum real projective space, we also recall the classification of the classes of irreducible ∗-representations of its algebra and give a linear basis for this algebra.

Filiform Lie algebras of order 3

DOE Office of Scientific and Technical Information (OSTI.GOV)

Navarro, R. M., E-mail: rnavarro@unex.es

2014-04-15

The aim of this work is to generalize a very important type of Lie algebras and superalgebras, i.e., filiform Lie (super)algebras, into the theory of Lie algebras of order F. Thus, the concept of filiform Lie algebras of order F is obtained. In particular, for F = 3 it has been proved that by using infinitesimal deformations of the associated model elementary Lie algebra it can be obtained families of filiform elementary lie algebras of order 3, analogously as that occurs into the theory of Lie algebras [M. Vergne, “Cohomologie des algèbres de Lie nilpotentes. Application à l’étude de lamore » variété des algèbres de Lie nilpotentes,” Bull. Soc. Math. France 98, 81–116 (1970)]. Also we give the dimension, using an adaptation of the sl(2,C)-module Method, and a basis of such infinitesimal deformations in some generic cases.« less

Topics in elementary particle physics

NASA Astrophysics Data System (ADS)

Jin, Xiang

The author of this thesis discusses two topics in elementary particle physics: n-ary algebras and their applications to M-theory (Part I), and functional evolution and Renormalization Group flows (Part II). In part I, Lie algebra is extended to four different n-ary algebraic structure: generalized Lie algebra, Filippov algebra, Nambu algebra and Nambu-Poisson tensor; though there are still many other n-ary algebras. A natural property of Generalized Lie algebras — the Bremner identity, is studied, and proved with a totally different method from its original version. We extend Bremner identity to n-bracket cases, where n is an arbitrary odd integer. Filippov algebras do not focus on associativity, and are defined by the Fundamental identity. We add associativity to Filippov algebras, and give examples of how to construct Filippov algebras from su(2), bosonic oscillator, Virasoro algebra. We try to include fermionic charges into the ternary Virasoro-Witt algebra, but the attempt fails because fermionic charges keep generating new charges that make the algebra not closed. We also study the Bremner identity restriction on Nambu algebras and Nambu-Poisson tensors. So far, the only example 3-algebra being used in physics is the BLG model with 3-algebra A4, describing two M2-branes interactions. Its extension with Nambu algebra, BLG-NB model, is believed to describe infinite M2-branes condensation. Also, there is another propose for M2-brane interactions, the ABJM model, which is constructed by ordinary Lie algebra. We compare the symmetry properties between them, and discuss the possible approaches to include these three models into a grand unification theory. In Part II, we give an approximate solution for Schroeder's equations, based on series and conjugation methods. We use the logistic map as an example, and demonstrate that this approximate solution converges to known analytical solutions around the fixed point, around which the approximate solution is constructed. Although the closed-form solutions for Schroeder's equations can not always be approached analytically, by fitting the approximation solutions, one can still obtain closed-form solutions sometimes. Based on Schroeder's theory, approximate solutions for trajectories, velocities and potentials can also be constructed. The approximate solution is significantly useful to calculate the beta function in renormalization group trajectory. By "wrapping" the series solutions with the conjugations from different inverse functions, we generate different branches of the trajectory, and construct a counterexample for a folk theorem about limited cycles.

Inference of combinatorial Boolean rules of synergistic gene sets from cancer microarray datasets.

PubMed

Park, Inho; Lee, Kwang H; Lee, Doheon

2010-06-15

Gene set analysis has become an important tool for the functional interpretation of high-throughput gene expression datasets. Moreover, pattern analyses based on inferred gene set activities of individual samples have shown the ability to identify more robust disease signatures than individual gene-based pattern analyses. Although a number of approaches have been proposed for gene set-based pattern analysis, the combinatorial influence of deregulated gene sets on disease phenotype classification has not been studied sufficiently. We propose a new approach for inferring combinatorial Boolean rules of gene sets for a better understanding of cancer transcriptome and cancer classification. To reduce the search space of the possible Boolean rules, we identify small groups of gene sets that synergistically contribute to the classification of samples into their corresponding phenotypic groups (such as normal and cancer). We then measure the significance of the candidate Boolean rules derived from each group of gene sets; the level of significance is based on the class entropy of the samples selected in accordance with the rules. By applying the present approach to publicly available prostate cancer datasets, we identified 72 significant Boolean rules. Finally, we discuss several identified Boolean rules, such as the rule of glutathione metabolism (down) and prostaglandin synthesis regulation (down), which are consistent with known prostate cancer biology. Scripts written in Python and R are available at http://biosoft.kaist.ac.kr/~ihpark/. The refined gene sets and the full list of the identified Boolean rules are provided in the Supplementary Material. Supplementary data are available at Bioinformatics online.

Generalized Cartan Calculus in general dimension

DOE PAGES

Wang, Yi -Nan

2015-07-22

We develop the generalized Cartan Calculus for the groups G = SL(2,R) × R +, SL(5,R) and SO(5,5). They are the underlying algebraic structures of d=9,7,6 exceptional field theory, respectively. These algebraic identities are needed for the "tensor hierarchy" structure in exceptional field theory. The validity of Poincar\\'e lemmas in this new differential geometry is also discussed. Lastly, we explore some possible extension of the generalized Cartan calculus beyond the exceptional series.

Individual differences in algebraic cognition: Relation to the approximate number and semantic memory systems.

PubMed

Geary, David C; Hoard, Mary K; Nugent, Lara; Rouder, Jeffrey N

2015-12-01

The relation between performance on measures of algebraic cognition and acuity of the approximate number system (ANS) and memory for addition facts was assessed for 171 ninth graders (92 girls) while controlling for parental education, sex, reading achievement, speed of numeral processing, fluency of symbolic number processing, intelligence, and the central executive component of working memory. The algebraic tasks assessed accuracy in placing x,y pairs in the coordinate plane, speed and accuracy of expression evaluation, and schema memory for algebra equations. ANS acuity was related to accuracy of placements in the coordinate plane and expression evaluation but not to schema memory. Frequency of fact retrieval errors was related to schema memory but not to coordinate plane or expression evaluation accuracy. The results suggest that the ANS may contribute to or be influenced by spatial-numerical and numerical-only quantity judgments in algebraic contexts, whereas difficulties in committing addition facts to long-term memory may presage slow formation of memories for the basic structure of algebra equations. More generally, the results suggest that different brain and cognitive systems are engaged during the learning of different components of algebraic competence while controlling for demographic and domain general abilities. Copyright © 2015 Elsevier Inc. All rights reserved.

Constraints and Superspin for SuperPoincare Algebras in Diverse Dimensions

DOE Office of Scientific and Technical Information (OSTI.GOV)

Pasqua, Andrea; Zumino, Bruno

2004-04-27

We generalize to arbitrary dimension the construction of a covariant and supersymmetric constraint for the massless superPoincare algebra, which was given for the eleven-dimensional case in a previous work. We also contrast it with a similar construction appropriate to the massive case. Finally we show that the constraint uniquely fixes the representation of the algebra.

Geometry of quantum state manifolds generated by the Lie algebra operators

NASA Astrophysics Data System (ADS)

Kuzmak, A. R.

2018-03-01

The Fubini-Study metric of quantum state manifold generated by the operators which satisfy the Heisenberg Lie algebra is calculated. The similar problem is studied for the manifold generated by the so(3) Lie algebra operators. Using these results, we calculate the Fubini-Study metrics of state manifolds generated by the position and momentum operators. Also the metrics of quantum state manifolds generated by some spin systems are obtained. Finally, we generalize this problem for operators of an arbitrary Lie algebra.

Topology-preserving quantum deformation with non-numerical parameter

NASA Astrophysics Data System (ADS)

Aukhadiev, Marat; Grigoryan, Suren; Lipacheva, Ekaterina

2013-11-01

We introduce a class of compact quantum semigroups, that we call semigroup deformations of compact Abelian qroups. These objects arise from reduced semigroup -algebras, the generalization of the Toeplitz algebra. We study quantum subgroups, quantum projective spaces and quantum quotient groups for such objects, and show that the group is contained as a compact quantum subgroup in the deformation of itself. The connection with the weak Hopf algebra notion is described. We give a grading on the -algebra of the compact quantum semigroups constructed.

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

NASA Astrophysics Data System (ADS)

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 complexity values for networks in the ordered and critical phases and for highly disordered networks, peaking somewhere in the disordered phase. Individual nodes with high complexity have, on average, a larger influence on the system dynamics. Lastly, a semi-annealed approximation that preserves the correlation between states at neighboring nodes is introduced to study a social game-inspired network model in which all links are bidirectional and all nodes have a self-input. The technique developed here is shown to yield accurate predictions of distribution of players' states, and accounts for some nontrivial collective behavior of game theoretic interest.

The algebra of two dimensional generalized Chebyshev-Koornwinder oscillator

NASA Astrophysics Data System (ADS)

Borzov, V. V.; Damaskinsky, E. V.

2014-10-01

In the previous works of Borzov and Damaskinsky ["Chebyshev-Koornwinder oscillator," Theor. Math. Phys. 175(3), 765-772 (2013)] and ["Ladder operators for Chebyshev-Koornwinder oscillator," in Proceedings of the Days on Diffraction, 2013], the authors have defined the oscillator-like system that is associated with the two variable Chebyshev-Koornwinder polynomials. We call this system the generalized Chebyshev-Koornwinder oscillator. In this paper, we study the properties of infinite-dimensional Lie algebra that is analogous to the Heisenberg algebra for the Chebyshev-Koornwinder oscillator. We construct the exact irreducible representation of this algebra in a Hilbert space H of functions that are defined on a region which is bounded by the Steiner hypocycloid. The functions are square-integrable with respect to the orthogonality measure for the Chebyshev-Koornwinder polynomials and these polynomials form an orthonormalized basis in the space H. The generalized oscillator which is studied in the work can be considered as the simplest nontrivial example of multiboson quantum system that is composed of three interacting oscillators.

A Cohomological Perspective on Algebraic Quantum Field Theory

NASA Astrophysics Data System (ADS)

Hawkins, Eli

2018-05-01

Algebraic quantum field theory is considered from the perspective of the Hochschild cohomology bicomplex. This is a framework for studying deformations and symmetries. Deformation is a possible approach to the fundamental challenge of constructing interacting QFT models. Symmetry is the primary tool for understanding the structure and properties of a QFT model. This perspective leads to a generalization of the algebraic quantum field theory framework, as well as a more general definition of symmetry. This means that some models may have symmetries that were not previously recognized or exploited. To first order, a deformation of a QFT model is described by a Hochschild cohomology class. A deformation could, for example, correspond to adding an interaction term to a Lagrangian. The cohomology class for such an interaction is computed here. However, the result is more general and does not require the undeformed model to be constructed from a Lagrangian. This computation leads to a more concrete version of the construction of perturbative algebraic quantum field theory.

Quantum incompatibility of channels with general outcome operator algebras

NASA Astrophysics Data System (ADS)

Kuramochi, Yui

2018-04-01

A pair of quantum channels is said to be incompatible if they cannot be realized as marginals of a single channel. This paper addresses the general structure of the incompatibility of completely positive channels with a fixed quantum input space and with general outcome operator algebras. We define a compatibility relation for such channels by identifying the composite outcome space as the maximal (projective) C*-tensor product of outcome algebras. We show theorems that characterize this compatibility relation in terms of the concatenation and conjugation of channels, generalizing the recent result for channels with quantum outcome spaces. These results are applied to the positive operator valued measures (POVMs) by identifying each of them with the corresponding quantum-classical (QC) channel. We also give a characterization of the maximality of a POVM with respect to the post-processing preorder in terms of the conjugate channel of the QC channel. We consider another definition of compatibility of normal channels by identifying the composite outcome space with the normal tensor product of the outcome von Neumann algebras. We prove that for a given normal channel, the class of normally compatible channels is upper bounded by a special class of channels called tensor conjugate channels. We show the inequivalence of the C*- and normal compatibility relations for QC channels, which originates from the possibility and impossibility of copying operations for commutative von Neumann algebras in C*- and normal compatibility relations, respectively.

Construction of general colored R matrices for the Yang-Baxter equation and q-boson realization of quantum algebra SL[sub q](2) when q is a root of unity

DOE Office of Scientific and Technical Information (OSTI.GOV)

Ge, M.L.; Sun, C.P.; Xue, K.

1992-10-20

In this paper, through a general q-boson realization of quantum algebra sl[sub q](2) and its universal R matrix an operator R matrix with many parameters is obtained in terms of q-boson operators. Building finite-dimensional representations of q-boson algebra, the authors construct various colored R matrices associated with nongeneric representations of sl[sub q](2) with dimension-independent parameters. The nonstandard R matrices obtained by Lee-Couture and Murakami are their special examples.

Computing preimages of Boolean networks.

PubMed

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.

Design of Teacher Assistance Tools in an Exploratory Learning Environment for Algebraic Generalization

ERIC Educational Resources Information Center

Gutierrez-Santos, S.; Geraniou, E.; Pearce-Lazard, D.; Poulovassilis, A.

2012-01-01

The MiGen project is designing and developing an intelligent exploratory environment to support 11-14-year-old students in their learning of algebraic generalization. Deployed within the classroom, the system also provides tools to assist teachers in monitoring students' activities and progress. This paper describes the design of these Teacher…

Lie algebraic approach to the time-dependent quantum general harmonic oscillator and the bi-dimensional charged particle in time-dependent electromagnetic fields

DOE Office of Scientific and Technical Information (OSTI.GOV)

Ibarra-Sierra, V.G.; Sandoval-Santana, J.C.; Cardoso, J.L.

We discuss the one-dimensional, time-dependent general quadratic Hamiltonian and the bi-dimensional charged particle in time-dependent electromagnetic fields through the Lie algebraic approach. Such method consists in finding a set of generators that form a closed Lie algebra in terms of which it is possible to express a quantum Hamiltonian and therefore the evolution operator. The evolution operator is then the starting point to obtain the propagator as well as the explicit form of the Heisenberg picture position and momentum operators. First, the set of generators forming a closed Lie algebra is identified for the general quadratic Hamiltonian. This algebra ismore » later extended to study the Hamiltonian of a charged particle in electromagnetic fields exploiting the similarities between the terms of these two Hamiltonians. These results are applied to the solution of five different examples: the linear potential which is used to introduce the Lie algebraic method, a radio frequency ion trap, a Kanai–Caldirola-like forced harmonic oscillator, a charged particle in a time dependent magnetic field, and a charged particle in constant magnetic field and oscillating electric field. In particular we present exact analytical expressions that are fitting for the study of a rotating quadrupole field ion trap and magneto-transport in two-dimensional semiconductor heterostructures illuminated by microwave radiation. In these examples we show that this powerful method is suitable to treat quadratic Hamiltonians with time dependent coefficients quite efficiently yielding closed analytical expressions for the propagator and the Heisenberg picture position and momentum operators. -- Highlights: •We deal with the general quadratic Hamiltonian and a particle in electromagnetic fields. •The evolution operator is worked out through the Lie algebraic approach. •We also obtain the propagator and Heisenberg picture position and momentum operators. •Analytical expressions for a rotating quadrupole field ion trap are presented. •Exact solutions for magneto-transport in variable electromagnetic fields are shown.« less

A solution to the surface intersection problem. [Boolean functions in geometric modeling

NASA Technical Reports Server (NTRS)

Timer, H. G.

1977-01-01

An application-independent geometric model within a data base framework should support the use of Boolean operators which allow the user to construct a complex model by appropriately combining a series of simple models. The use of these operators leads to the concept of implicitly and explicitly defined surfaces. With an explicitly defined model, the surface area may be computed by simply summing the surface areas of the bounding surfaces. For an implicitly defined model, the surface area computation must deal with active and inactive regions. Because the surface intersection problem involves four unknowns and its solution is a space curve, the parametric coordinates of each surface must be determined as a function of the arc length. Various subproblems involved in the general intersection problem are discussed, and the mathematical basis for their solution is presented along with a program written in FORTRAN IV for implementation on the IBM 370 TSO system.

Nearly associative deformation quantization

NASA Astrophysics Data System (ADS)

Vassilevich, Dmitri; Oliveira, Fernando Martins Costa

2018-04-01

We study several classes of non-associative algebras as possible candidates for deformation quantization in the direction of a Poisson bracket that does not satisfy Jacobi identities. We show that in fact alternative deformation quantization algebras require the Jacobi identities on the Poisson bracket and, under very general assumptions, are associative. At the same time, flexible deformation quantization algebras exist for any Poisson bracket.

Covariant deformed oscillator algebras

NASA Technical Reports Server (NTRS)

Quesne, Christiane

1995-01-01

The general form and associativity conditions of deformed oscillator algebras are reviewed. It is shown how the latter can be fulfilled in terms of a solution of the Yang-Baxter equation when this solution has three distinct eigenvalues and satisfies a Birman-Wenzl-Murakami condition. As an example, an SU(sub q)(n) x SU(sub q)(m)-covariant q-bosonic algebra is discussed in some detail.

Combinatorial Formulas for Characteristic Classes, and Localization of Secondary Topological Invariants.

NASA Astrophysics Data System (ADS)

Smirnov, Mikhail

1995-01-01

The problems solved in this thesis originated from combinatorial formulas for characteristic classes. This thesis deals with Chern-Simons classes, their generalizations and related algebraic and analytic problems. (1) In this thesis, I describe a new class of algebras whose elements contain Chern and generalized Chern -Simons classes. There is a Poisson bracket in these algebras, similar to the bracket in Kontsevich's noncommutative symplectic geometry (Kon). I prove that the Poisson bracket gives rise to a graded Lie algebra containing differential forms representing Chern and Chern-Simons classes. This is a new result. I describe algebraic analogs of the dilogarithm and higher polylogarithms in the algebra corresponding to Chern-Simons classes. (2) I study the properties of this bracket. It is possible to write the exterior differential and other operations in the algebra using this bracket. The bracket of any two Chern classes is zero and the bracket of a Chern class and a Chern-Simons class is d-closed. The construction developed here easily gives explicit formulas for known secondary classes and makes it possible to construct new ones. (3) I develop an algebraic model for the action of the gauge group and describe how elements of algebra corresponding to the secondary characteristic classes change under this action (see theorem 3 page xi). (4) It is possible give new explicit formulas for cocycles on a gauge group of a bundle and for the corresponding cocycles on the Lie algebra of the gauge group. I use formulas for secondary characteristic classes and an algebraic approach developed in chapter 1. I also use the work of Faddeev, Reiman and Semyonov-Tian-Shanskii (FRS) on cocycles as quantum anomalies. (5) I apply the methods of differential geometry of formal power series to construct universal characteristic and secondary characteristic classes. Given a pair of gauge equivalent connections using local formulas I obtain dilogarithmic and trilogarithmic analogs of Chern-Simons classes.

Quantum cluster algebras and quantum nilpotent algebras.

PubMed

Goodearl, Kenneth R; Yakimov, Milen T

2014-07-08

A major direction in the theory of cluster algebras is to construct (quantum) cluster algebra structures on the (quantized) coordinate rings of various families of varieties arising in Lie theory. We prove that all algebras in a very large axiomatically defined class of noncommutative algebras possess canonical quantum cluster algebra structures. Furthermore, they coincide with the corresponding upper quantum cluster algebras. We also establish analogs of these results for a large class of Poisson nilpotent algebras. Many important families of coordinate rings are subsumed in the class we are covering, which leads to a broad range of applications of the general results to the above-mentioned types of problems. As a consequence, we prove the Berenstein-Zelevinsky conjecture [Berenstein A, Zelevinsky A (2005) Adv Math 195:405-455] for the quantized coordinate rings of double Bruhat cells and construct quantum cluster algebra structures on all quantum unipotent groups, extending the theorem of Geiß et al. [Geiß C, et al. (2013) Selecta Math 19:337-397] for the case of symmetric Kac-Moody groups. Moreover, we prove that the upper cluster algebras of Berenstein et al. [Berenstein A, et al. (2005) Duke Math J 126:1-52] associated with double Bruhat cells coincide with the corresponding cluster algebras.

Quantum cluster algebras and quantum nilpotent algebras

PubMed Central

Goodearl, Kenneth R.; Yakimov, Milen T.

2014-01-01

A major direction in the theory of cluster algebras is to construct (quantum) cluster algebra structures on the (quantized) coordinate rings of various families of varieties arising in Lie theory. We prove that all algebras in a very large axiomatically defined class of noncommutative algebras possess canonical quantum cluster algebra structures. Furthermore, they coincide with the corresponding upper quantum cluster algebras. We also establish analogs of these results for a large class of Poisson nilpotent algebras. Many important families of coordinate rings are subsumed in the class we are covering, which leads to a broad range of applications of the general results to the above-mentioned types of problems. As a consequence, we prove the Berenstein–Zelevinsky conjecture [Berenstein A, Zelevinsky A (2005) Adv Math 195:405–455] for the quantized coordinate rings of double Bruhat cells and construct quantum cluster algebra structures on all quantum unipotent groups, extending the theorem of Geiß et al. [Geiß C, et al. (2013) Selecta Math 19:337–397] for the case of symmetric Kac–Moody groups. Moreover, we prove that the upper cluster algebras of Berenstein et al. [Berenstein A, et al. (2005) Duke Math J 126:1–52] associated with double Bruhat cells coincide with the corresponding cluster algebras. PMID:24982197

Hidden symmetries and Lie algebra structures from geometric and supergravity Killing spinors

NASA Astrophysics Data System (ADS)

Açık, Özgür; Ertem, Ümit

2016-08-01

We consider geometric and supergravity Killing spinors and the spinor bilinears constructed out of them. The spinor bilinears of geometric Killing spinors correspond to the antisymmetric generalizations of Killing vector fields which are called Killing-Yano forms. They constitute a Lie superalgebra structure in constant curvature spacetimes. We show that the Dirac currents of geometric Killing spinors satisfy a Lie algebra structure up to a condition on 2-form spinor bilinears. We propose that the spinor bilinears of supergravity Killing spinors give way to different generalizations of Killing vector fields to higher degree forms. It is also shown that those supergravity Killing forms constitute a Lie algebra structure in six- and ten-dimensional cases. For five- and eleven-dimensional cases, the Lie algebra structure depends on an extra condition on supergravity Killing forms.

Cyclotomic Gaudin Models: Construction and Bethe Ansatz

NASA Astrophysics Data System (ADS)

Vicedo, Benoît; Young, Charles

2016-05-01

To any finite-dimensional simple Lie algebra g and automorphism {σ: gto g we associate a cyclotomic Gaudin algebra. This is a large commutative subalgebra of {U(g)^{⊗ N}} generated by a hierarchy of cyclotomic Gaudin Hamiltonians. It reduces to the Gaudin algebra in the special case {σ =id}. We go on to construct joint eigenvectors and their eigenvalues for this hierarchy of cyclotomic Gaudin Hamiltonians, in the case of a spin chain consisting of a tensor product of Verma modules. To do so we generalize an approach to the Bethe ansatz due to Feigin, Frenkel and Reshetikhin involving vertex algebras and the Wakimoto construction. As part of this construction, we make use of a theorem concerning cyclotomic coinvariants, which we prove in a companion paper. As a byproduct, we obtain a cyclotomic generalization of the Schechtman-Varchenko formula for the weight function.

Reliability analysis of the solar array based on Fault Tree Analysis

NASA Astrophysics Data System (ADS)

Jianing, Wu; Shaoze, Yan

2011-07-01

The solar array is an important device used in the spacecraft, which influences the quality of in-orbit operation of the spacecraft and even the launches. This paper analyzes the reliability of the mechanical system and certifies the most vital subsystem of the solar array. The fault tree analysis (FTA) model is established according to the operating process of the mechanical system based on DFH-3 satellite; the logical expression of the top event is obtained by Boolean algebra and the reliability of the solar array is calculated. The conclusion shows that the hinges are the most vital links between the solar arrays. By analyzing the structure importance(SI) of the hinge's FTA model, some fatal causes, including faults of the seal, insufficient torque of the locking spring, temperature in space, and friction force, can be identified. Damage is the initial stage of the fault, so limiting damage is significant to prevent faults. Furthermore, recommendations for improving reliability associated with damage limitation are discussed, which can be used for the redesigning of the solar array and the reliability growth planning.

The use of mobile learning application to the fundament of digital electronics course

NASA Astrophysics Data System (ADS)

Rakhmawati, L.; Firdha, A.

2018-01-01

A new trend in e-learning is known as Mobile Learning. Learning through mobile phones have become part of the educative process. Thus, the purposes of this study are to develop a mobile application for the Fundament of Digital Electronics course that consists of number systems operation, logic gates, and Boolean Algebra, and to assess the readiness, perceptions, and effectiveness of students in the use of mobile devices for learning in the classroom. This research uses Research and Development (R&D) method. The design used in this research, by doing treatment in one class and observing by using Android-based mobile application instructional media. The result obtained from this research shows that the test has 80 % validity aspect, 82 % of the user from senior high school students gives a positive response in using the application of mobile learning, and based on the result of post-test, 90, 90% students passed the exam. At last, it can be concluded that the use of the mobile learning application makes the learning process more effective when it is used in the teaching-learning process.

Fuzzy tree automata and syntactic pattern recognition.

PubMed

Lee, E T

1982-04-01

An approach of representing patterns by trees and processing these trees by fuzzy tree automata is described. Fuzzy tree automata are defined and investigated. The results include that the class of fuzzy root-to-frontier recognizable ¿-trees is closed under intersection, union, and complementation. Thus, the class of fuzzy root-to-frontier recognizable ¿-trees forms a Boolean algebra. Fuzzy tree automata are applied to processing fuzzy tree representation of patterns based on syntactic pattern recognition. The grade of acceptance is defined and investigated. Quantitative measures of ``approximate isosceles triangle,'' ``approximate elongated isosceles triangle,'' ``approximate rectangle,'' and ``approximate cross'' are defined and used in the illustrative examples of this approach. By using these quantitative measures, a house, a house with high roof, and a church are also presented as illustrative examples. In addition, three fuzzy tree automata are constructed which have the capability of processing the fuzzy tree representations of ``fuzzy houses,'' ``houses with high roofs,'' and ``fuzzy churches,'' respectively. The results may have useful applications in pattern recognition, image processing, artificial intelligence, pattern database design and processing, image science, and pictorial information systems.

A network model for biofilm development in Escherichia coli K-12.

PubMed

Shalá, Andrew A; Restrepo, Silvia; González Barrios, Andrés F

2011-09-22

In nature, bacteria often exist as biofilms. Biofilms are communities of microorganisms attached to a surface. It is clear that biofilm-grown cells harbor properties remarkably distinct from planktonic cells. Biofilms frequently complicate treatments of infections by protecting bacteria from the immune system, decreasing antibiotic efficacy and dispersing planktonic cells to distant body sites. In this work, we employed enhanced Boolean algebra to model biofilm formation. The network obtained describes biofilm formation successfully, assuming - in accordance with the literature - that when the negative regulators (RscCD and EnvZ/OmpR) are off, the positive regulator (FlhDC) is on. The network was modeled under three different conditions through time with satisfactory outcomes. Each cluster was constructed using the K-means/medians Clustering Support algorithm on the basis of published Affymetrix microarray gene expression data from biofilm-forming bacteria and the planktonic state over four time points for Escherichia coli K-12. The different phenotypes obtained demonstrate that the network model of biofilm formation can simulate the formation or repression of biofilm efficiently in E. coli K-12.

Cybernetic systems based on inductive logic

NASA Astrophysics Data System (ADS)

Fry, Robert L.

2001-05-01

Recent work in the area of inductive logic suggests that cybernetics might be quantified and reduced to engineering practice. If so, then there are considerable implications for engineering, science, and other fields. This paper attempts to capture the essential ideas of cybernetics cast in the light of inductive logic. The described inductive logic extends conventional logic by adding a conjugate logical domain of questions to the logical domain of assertions intrinsic to Boolean Algebra with which most are familiar. This was first posited and developed by Richard Cox. Interestingly enough, these two logical domains, one of questions and the other of assertions, only exist relative to one another with each possessing natural measures of entropy and probability, respectively. Examples are given that highlight the utility of cybernetic approaches to neuroscience, algorithm design, system engineering, and the design and understanding of defensive and offensive systems. For example, the application of cybernetic approaches to defense systems suggests that these systems possess a wavefunction which like quantum mechanics, collapses when we ``look'' through the eyes of the system sensors such as radars and optical sensors. .

Nonlinear secret image sharing scheme.

PubMed

Shin, Sang-Ho; Lee, Gil-Je; Yoo, Kee-Young

2014-01-01

Over the past decade, most of secret image sharing schemes have been proposed by using Shamir's technique. It is based on a linear combination polynomial arithmetic. Although Shamir's technique based secret image sharing schemes are efficient and scalable for various environments, there exists a security threat such as Tompa-Woll attack. Renvall and Ding proposed a new secret sharing technique based on nonlinear combination polynomial arithmetic in order to solve this threat. It is hard to apply to the secret image sharing. In this paper, we propose a (t, n)-threshold nonlinear secret image sharing scheme with steganography concept. In order to achieve a suitable and secure secret image sharing scheme, we adapt a modified LSB embedding technique with XOR Boolean algebra operation, define a new variable m, and change a range of prime p in sharing procedure. In order to evaluate efficiency and security of proposed scheme, we use the embedding capacity and PSNR. As a result of it, average value of PSNR and embedding capacity are 44.78 (dB) and 1.74t⌈log2 m⌉ bit-per-pixel (bpp), respectively.

Nonlinear Secret Image Sharing Scheme

PubMed Central

Shin, Sang-Ho; Yoo, Kee-Young

2014-01-01

Over the past decade, most of secret image sharing schemes have been proposed by using Shamir's technique. It is based on a linear combination polynomial arithmetic. Although Shamir's technique based secret image sharing schemes are efficient and scalable for various environments, there exists a security threat such as Tompa-Woll attack. Renvall and Ding proposed a new secret sharing technique based on nonlinear combination polynomial arithmetic in order to solve this threat. It is hard to apply to the secret image sharing. In this paper, we propose a (t, n)-threshold nonlinear secret image sharing scheme with steganography concept. In order to achieve a suitable and secure secret image sharing scheme, we adapt a modified LSB embedding technique with XOR Boolean algebra operation, define a new variable m, and change a range of prime p in sharing procedure. In order to evaluate efficiency and security of proposed scheme, we use the embedding capacity and PSNR. As a result of it, average value of PSNR and embedding capacity are 44.78 (dB) and 1.74t⌈log2⁡m⌉ bit-per-pixel (bpp), respectively. PMID:25140334

Graphical fault tree analysis for fatal falls in the construction industry.

PubMed

Chi, Chia-Fen; Lin, Syuan-Zih; Dewi, Ratna Sari

2014-11-01

The current study applied a fault tree analysis to represent the causal relationships among events and causes that contributed to fatal falls in the construction industry. Four hundred and eleven work-related fatalities in the Taiwanese construction industry were analyzed in terms of age, gender, experience, falling site, falling height, company size, and the causes for each fatality. Given that most fatal accidents involve multiple events, the current study coded up to a maximum of three causes for each fall fatality. After the Boolean algebra and minimal cut set analyses, accident causes associated with each falling site can be presented as a fault tree to provide an overview of the basic causes, which could trigger fall fatalities in the construction industry. Graphical icons were designed for each falling site along with the associated accident causes to illustrate the fault tree in a graphical manner. A graphical fault tree can improve inter-disciplinary discussion of risk management and the communication of accident causation to first line supervisors. Copyright © 2014 Elsevier Ltd. All rights reserved.

A Boolean Consistent Fuzzy Inference System for Diagnosing Diseases and Its Application for Determining Peritonitis Likelihood

PubMed Central

Dragović, Ivana; Turajlić, Nina; Pilčević, Dejan; Petrović, Bratislav; Radojević, Dragan

2015-01-01

Fuzzy inference systems (FIS) enable automated assessment and reasoning in a logically consistent manner akin to the way in which humans reason. However, since no conventional fuzzy set theory is in the Boolean frame, it is proposed that Boolean consistent fuzzy logic should be used in the evaluation of rules. The main distinction of this approach is that it requires the execution of a set of structural transformations before the actual values can be introduced, which can, in certain cases, lead to different results. While a Boolean consistent FIS could be used for establishing the diagnostic criteria for any given disease, in this paper it is applied for determining the likelihood of peritonitis, as the leading complication of peritoneal dialysis (PD). Given that patients could be located far away from healthcare institutions (as peritoneal dialysis is a form of home dialysis) the proposed Boolean consistent FIS would enable patients to easily estimate the likelihood of them having peritonitis (where a high likelihood would suggest that prompt treatment is indicated), when medical experts are not close at hand. PMID:27069500

Surface-confined assemblies and polymers for molecular logic.

PubMed

de Ruiter, Graham; van der Boom, Milko E

2011-08-16

Stimuli responsive materials are capable of mimicking the operation characteristics of logic gates such as AND, OR, NOR, and even flip-flops. Since the development of molecular sensors and the introduction of the first AND gate in solution by de Silva in 1993, Molecular (Boolean) Logic and Computing (MBLC) has become increasingly popular. In this Account, we present recent research activities that focus on MBLC with electrochromic polymers and metal polypyridyl complexes on a solid support. Metal polypyridyl complexes act as useful sensors to a variety of analytes in solution (i.e., H(2)O, Fe(2+/3+), Cr(6+), NO(+)) and in the gas phase (NO(x) in air). This information transfer, whether the analyte is present, is based on the reversible redox chemistry of the metal complexes, which are stable up to 200 °C in air. The concurrent changes in the optical properties are nondestructive and fast. In such a setup, the input is directly related to the output and, therefore, can be represented by one-input logic gates. These input-output relationships are extendable for mimicking the diverse functions of essential molecular logic gates and circuits within a set of Boolean algebraic operations. Such a molecular approach towards Boolean logic has yielded a series of proof-of-concept devices: logic gates, multiplexers, half-adders, and flip-flop logic circuits. MBLC is a versatile and, potentially, a parallel approach to silicon circuits: assemblies of these molecular gates can perform a wide variety of logic tasks through reconfiguration of their inputs. Although these developments do not require a semiconductor blueprint, similar guidelines such as signal propagation, gate-to-gate communication, propagation delay, and combinatorial and sequential logic will play a critical role in allowing this field to mature. For instance, gate-to-gate communication by chemical wiring of the gates with metal ions as electron carriers results in the integration of stand-alone systems: the output of one gate is used as the input for another gate. Using the same setup, we were able to display both combinatorial and sequential logic. We have demonstrated MBLC by coupling electrochemical inputs with optical readout, which resulted in various logic architectures built on a redox-active, functionalized surface. Electrochemically operated sequential logic systems such as flip-flops, multivalued logic, and multistate memory could enhance computational power without increasing spatial requirements. Applying multivalued digits in data storage could exponentially increase memory capacity. Furthermore, we evaluate the pros and cons of MBLC and identify targets for future research in this Account. © 2011 American Chemical Society

Exploiting Surroundedness for Saliency Detection: A Boolean Map Approach.

PubMed

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.

Network dynamics and systems biology

NASA Astrophysics Data System (ADS)

Norrell, Johannes A.

The physics of complex systems has grown considerably as a field in recent decades, largely due to improved computational technology and increased availability of systems level data. One area in which physics is of growing relevance is molecular biology. A new field, systems biology, investigates features of biological systems as a whole, a strategy of particular importance for understanding emergent properties that result from a complex network of interactions. Due to the complicated nature of the systems under study, the physics of complex systems has a significant role to play in elucidating the collective behavior. In this dissertation, we explore three problems in the physics of complex systems, motivated in part by systems biology. The first of these concerns the applicability of Boolean models as an approximation of continuous systems. Studies of gene regulatory networks have employed both continuous and Boolean models to analyze the system dynamics, and the two have been found produce similar results in the cases analyzed. We ask whether or not Boolean models can generically reproduce the qualitative attractor dynamics of networks of continuously valued elements. Using a combination of analytical techniques and numerical simulations, we find that continuous networks exhibit two effects---an asymmetry between on and off states, and a decaying memory of events in each element's inputs---that are absent from synchronously updated Boolean models. We show that in simple loops these effects produce exactly the attractors that one would predict with an analysis of the stability of Boolean attractors, but in slightly more complicated topologies, they can destabilize solutions that are stable in the Boolean approximation, and can stabilize new attractors. Second, we investigate ensembles of large, random networks. Of particular interest is the transition between ordered and disordered dynamics, which is well characterized in Boolean systems. Networks at the transition point, called critical, exhibit many of the features of regulatory networks, and recent studies suggest that some specific regulatory networks are indeed near-critical. We ask whether certain statistical measures of the ensemble behavior of large continuous networks are reproduced by Boolean models. We find that, in spite of the lack of correspondence between attractors observed in smaller systems, the statistical characterization given by the continuous and Boolean models show close agreement, and the transition between order and disorder known in Boolean systems can occur in continuous systems as well. One effect that is not present in Boolean systems, the failure of information to propagate down chains of elements of arbitrary length, is present in a class of continuous networks. In these systems, a modified Boolean theory that takes into account the collective effect of propagation failure on chains throughout the network gives a good description of the observed behavior. We find that propagation failure pushes the system toward greater order, resulting in a partial or complete suppression of the disordered phase. Finally, we explore a dynamical process of direct biological relevance: asymmetric cell division in A. thaliana. The long term goal is to develop a model for the process that accurately accounts for both wild type and mutant behavior. To contribute to this endeavor, we use confocal microscopy to image roots in a SHORT-ROOT inducible mutant. We compute correlation functions between the locations of asymmetrically divided cells, and we construct stochastic models based on a few simple assumptions that accurately predict the non-zero correlations. Our result shows that intracellular processes alone cannot be responsible for the observed divisions, and that an intercell signaling mechanism could account for the measured correlations.

Algebraic Reasoning in Solving Mathematical Problem Based on Learning Style

NASA Astrophysics Data System (ADS)

Indraswari, N. F.; Budayasa, I. K.; Ekawati, R.

2018-01-01

This study aimed to describe algebraic reasoning of secondary school’s pupils with different learning styles in solving mathematical problem. This study begins by giving the questionnaire to find out the learning styles and followed by mathematical ability test to get three subjects of 8th-grade whereas the learning styles of each pupil is visual, auditory, kinesthetic and had similar mathematical abilities. Then it continued with given algebraic problems and interviews. The data is validated using triangulation of time. The result showed that in the pattern of seeking indicator, subjects identified the things that were known and asked based on them observations. The visual and kinesthetic learners represented the known information in a chart, whereas the auditory learner in a table. In addition, they found the elements which makes the pattern and made a relationship between two quantities. In the pattern recognition indicator, they created conjectures on the relationship between two quantities and proved it. In the generalization indicator, they were determining the general rule of pattern found on each element of pattern using algebraic symbols and created a mathematical model. Visual and kinesthetic learners determined the general rule of equations which was used to solve problems using algebraic symbols, but auditory learner in a sentence.

Using Technology to Optimize and Generalize: The Least-Squares Line

ERIC Educational Resources Information Center

Burke, Maurice J.; Hodgson, Ted R.

2007-01-01

With the help of technology and a basic high school algebra method for finding the vertex of a quadratic polynomial, students can develop and prove the formula for least-squares lines. Students are exposed to the power of a computer algebra system to generalize processes they understand and to see deeper patterns in those processes. (Contains 4…

DOE Office of Scientific and Technical Information (OSTI.GOV)

Agarwala, Susama; Delaney, Colleen

This paper defines a generalization of the Connes-Moscovici Hopf algebra, H(1), that contains the entire Hopf algebra of rooted trees. A relationship between the former, a much studied object in non-commutative geometry, and the latter, a much studied object in perturbative quantum field theory, has been established by Connes and Kreimer. The results of this paper open the door to study the cohomology of the Hopf algebra of rooted trees.

Paving the Way To Algebraic Thought Using Residue Designs.

ERIC Educational Resources Information Center

Johnson, Iris DeLoach

1998-01-01

Presents a brief definition and examples of residue designs while sharing some of the algebraic thought that a student used to form generalizations about the patterns discovered during the investigations of residue designs. (ASK)

Shapes and stability of algebraic nuclear models

NASA Technical Reports Server (NTRS)

Lopez-Moreno, Enrique; Castanos, Octavio

1995-01-01

A generalization of the procedure to study shapes and stability of algebraic nuclear models introduced by Gilmore is presented. One calculates the expectation value of the Hamiltonian with respect to the coherent states of the algebraic structure of the system. Then equilibrium configurations of the resulting energy surface, which depends in general on state variables and a set of parameters, are classified through the Catastrophe theory. For one- and two-body interactions in the Hamiltonian of the interacting Boson model-1, the critical points are organized through the Cusp catastrophe. As an example, we apply this Separatrix to describe the energy surfaces associated to the Rutenium and Samarium isotopes.

Category-theoretic models of algebraic computer systems

NASA Astrophysics Data System (ADS)

Kovalyov, S. P.

2016-01-01

A computer system is said to be algebraic if it contains nodes that implement unconventional computation paradigms based on universal algebra. A category-based approach to modeling such systems that provides a theoretical basis for mapping tasks to these systems' architecture is proposed. The construction of algebraic models of general-purpose computations involving conditional statements and overflow control is formally described by a reflector in an appropriate category of algebras. It is proved that this reflector takes the modulo ring whose operations are implemented in the conventional arithmetic processors to the Łukasiewicz logic matrix. Enrichments of the set of ring operations that form bases in the Łukasiewicz logic matrix are found.

Private algebras in quantum information and infinite-dimensional complementarity

DOE Office of Scientific and Technical Information (OSTI.GOV)

Crann, Jason, E-mail: jason-crann@carleton.ca; Laboratoire de Mathématiques Paul Painlevé–UMR CNRS 8524, UFR de Mathématiques, Université Lille 1–Sciences et Technologies, 59655 Villeneuve d’Ascq Cédex; Kribs, David W., E-mail: dkribs@uoguelph.ca

We introduce a generalized framework for private quantum codes using von Neumann algebras and the structure of commutants. This leads naturally to a more general notion of complementary channel, which we use to establish a generalized complementarity theorem between private and correctable subalgebras that applies to both the finite and infinite-dimensional settings. Linear bosonic channels are considered and specific examples of Gaussian quantum channels are given to illustrate the new framework together with the complementarity theorem.

(q,{mu}) and (p,q,{zeta})-exponential functions: Rogers-Szego'' polynomials and Fourier-Gauss transform

DOE Office of Scientific and Technical Information (OSTI.GOV)

Hounkonnou, Mahouton Norbert; Nkouankam, Elvis Benzo Ngompe

2010-10-15

From the realization of q-oscillator algebra in terms of generalized derivative, we compute the matrix elements from deformed exponential functions and deduce generating functions associated with Rogers-Szego polynomials as well as their relevant properties. We also compute the matrix elements associated with the (p,q)-oscillator algebra (a generalization of the q-one) and perform the Fourier-Gauss transform of a generalization of the deformed exponential functions.

"Antelope": a hybrid-logic model checker for branching-time Boolean GRN analysis

PubMed Central

2011-01-01

Background In Thomas' formalism for modeling gene regulatory networks (GRNs), branching time, where a state can have more than one possible future, plays a prominent role. By representing a certain degree of unpredictability, branching time can model several important phenomena, such as (a) asynchrony, (b) incompletely specified behavior, and (c) interaction with the environment. Introducing more than one possible future for a state, however, creates a difficulty for ordinary simulators, because infinitely many paths may appear, limiting ordinary simulators to statistical conclusions. Model checkers for branching time, by contrast, are able to prove properties in the presence of infinitely many paths. Results We have developed Antelope ("Analysis of Networks through TEmporal-LOgic sPEcifications", http://turing.iimas.unam.mx:8080/AntelopeWEB/), a model checker for analyzing and constructing Boolean GRNs. Currently, software systems for Boolean GRNs use branching time almost exclusively for asynchrony. Antelope, by contrast, also uses branching time for incompletely specified behavior and environment interaction. We show the usefulness of modeling these two phenomena in the development of a Boolean GRN of the Arabidopsis thaliana root stem cell niche. There are two obstacles to a direct approach when applying model checking to Boolean GRN analysis. First, ordinary model checkers normally only verify whether or not a given set of model states has a given property. In comparison, a model checker for Boolean GRNs is preferable if it reports the set of states having a desired property. Second, for efficiency, the expressiveness of many model checkers is limited, resulting in the inability to express some interesting properties of Boolean GRNs. Antelope tries to overcome these two drawbacks: Apart from reporting the set of all states having a given property, our model checker can express, at the expense of efficiency, some properties that ordinary model checkers (e.g., NuSMV) cannot. This additional expressiveness is achieved by employing a logic extending the standard Computation-Tree Logic (CTL) with hybrid-logic operators. Conclusions We illustrate the advantages of Antelope when (a) modeling incomplete networks and environment interaction, (b) exhibiting the set of all states having a given property, and (c) representing Boolean GRN properties with hybrid CTL. PMID:22192526

Unification of the general non-linear sigma model and the Virasoro master equation

DOE Office of Scientific and Technical Information (OSTI.GOV)

Boer, J. de; Halpern, M.B.

1997-06-01

The Virasoro master equation describes a large set of conformal field theories known as the affine-Virasoro constructions, in the operator algebra (affinie Lie algebra) of the WZW model, while the einstein equations of the general non-linear sigma model describe another large set of conformal field theories. This talk summarizes recent work which unifies these two sets of conformal field theories, together with a presumable large class of new conformal field theories. The basic idea is to consider spin-two operators of the form L{sub ij}{partial_derivative}x{sup i}{partial_derivative}x{sup j} in the background of a general sigma model. The requirement that these operators satisfymore » the Virasoro algebra leads to a set of equations called the unified Einstein-Virasoro master equation, in which the spin-two spacetime field L{sub ij} cuples to the usual spacetime fields of the sigma model. The one-loop form of this unified system is presented, and some of its algebraic and geometric properties are discussed.« less

Theory and calculus of cubical complexes

NASA Technical Reports Server (NTRS)

Perlman, M.

1973-01-01

Combination switching networks with multiple outputs may be represented by Boolean functions. Report has been prepared which describes derivation and use of extraction algorithm that may be adapted to simplification of such simultaneous Boolean functions.

Total Parenteral Nutrition

MedlinePlus

... Boolean useRights, FileShare share, Int32 bufferSize, FileOptions options, SECURITY_ATTRIBUTES secAttrs, String msgPath, Boolean bFromProxy) at System.IO.FileStream..ctor(String path, FileMode mode, FileAccess ...

The value of less connected agents in Boolean networks

NASA Astrophysics Data System (ADS)

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 that help to see how agents are organized.

Parallel Algorithms for Least Squares and Related Computations.

DTIC Science & Technology

1991-03-22

for dense computations in linear algebra . The work has recently been published in a general reference book on parallel algorithms by SIAM. AFO SR...written his Ph.D. dissertation with the principal investigator. (See publication 6.) • Parallel Algorithms for Dense Linear Algebra Computations. Our...and describe and to put into perspective a selection of the more important parallel algorithms for numerical linear algebra . We give a major new

Quantum Torus Algebras and B(C)-Type Toda Systems

NASA Astrophysics Data System (ADS)

Wang, Na; Li, Chuanzhong

2017-12-01

In this paper, we construct a new even constrained B(C)-type Toda hierarchy and derive its B(C)-type Block-type additional symmetry. Also we generalize the B(C)-type Toda hierarchy to the N-component B(C)-type Toda hierarchy which is proved to have symmetries of a coupled \\bigotimes ^NQT_+ algebra ( N-fold direct product of the positive half of the quantum torus algebra QT).

Tensor models, Kronecker coefficients and permutation centralizer algebras

NASA Astrophysics Data System (ADS)

Geloun, Joseph Ben; Ramgoolam, Sanjaye

2017-11-01

We show that the counting of observables and correlators for a 3-index tensor model are organized by the structure of a family of permutation centralizer algebras. These algebras are shown to be semi-simple and their Wedderburn-Artin decompositions into matrix blocks are given in terms of Clebsch-Gordan coefficients of symmetric groups. The matrix basis for the algebras also gives an orthogonal basis for the tensor observables which diagonalizes the Gaussian two-point functions. The centres of the algebras are associated with correlators which are expressible in terms of Kronecker coefficients (Clebsch-Gordan multiplicities of symmetric groups). The color-exchange symmetry present in the Gaussian model, as well as a large class of interacting models, is used to refine the description of the permutation centralizer algebras. This discussion is extended to a general number of colors d: it is used to prove the integrality of an infinite family of number sequences related to color-symmetrizations of colored graphs, and expressible in terms of symmetric group representation theory data. Generalizing a connection between matrix models and Belyi maps, correlators in Gaussian tensor models are interpreted in terms of covers of singular 2-complexes. There is an intriguing difference, between matrix and higher rank tensor models, in the computational complexity of superficially comparable correlators of observables parametrized by Young diagrams.

A genetic code Boolean structure. II. The genetic information system as a Boolean information system.

PubMed

Sanchez, Robersy; Grau, Ricardo

2005-09-01

A Boolean structure of the genetic code where Boolean deductions have biological and physicochemical meanings was discussed in a previous paper. Now, from these Boolean deductions we propose to define the value of amino acid information in order to consider the genetic information system as a communication system and to introduce the semantic content of information ignored by the conventional information theory. In this proposal, the value of amino acid information is proportional to the molecular weight of amino acids with a proportional constant of about 1.96 x 10(25) bits per kg. In addition to this, for the experimental estimations of the minimum energy dissipation in genetic logic operations, we present two postulates: (1) the energy Ei (i=1,2,...,20) of amino acids in the messages conveyed by proteins is proportional to the value of information, and (2) amino acids are distributed according to their energy Ei so the amino acid population in proteins follows a Boltzmann distribution. Specifically, in the genetic message carried by the DNA from the genomes of living organisms, we found that the minimum energy dissipation in genetic logic operations was close to kTLn(2) joules per bit.

A tensor Banach algebra approach to abstract kinetic equations

NASA Astrophysics Data System (ADS)

Greenberg, W.; van der Mee, C. V. M.

The study deals with a concrete algebraic construction providing the existence theory for abstract kinetic equation boundary-value problems, when the collision operator A is an accretive finite-rank perturbation of the identity operator in a Hilbert space H. An algebraic generalization of the Bochner-Phillips theorem is utilized to study solvability of the abstract boundary-value problem without any regulatory condition. A Banach algebra in which the convolution kernel acts is obtained explicitly, and this result is used to prove a perturbation theorem for bisemigroups, which then plays a vital role in solving the initial equations.

Block algebra in two-component BKP and D type Drinfeld-Sokolov hierarchies

DOE Office of Scientific and Technical Information (OSTI.GOV)

Li, Chuanzhong, E-mail: lichuanzhong@nbu.edu.cn; He, Jingsong, E-mail: hejingsong@nbu.edu.cn

We construct generalized additional symmetries of a two-component BKP hierarchy defined by two pseudo-differential Lax operators. These additional symmetry flows form a Block type algebra with some modified (or additional) terms because of a B type reduction condition of this integrable hierarchy. Further we show that the D type Drinfeld-Sokolov hierarchy, which is a reduction of the two-component BKP hierarchy, possess a complete Block type additional symmetry algebra. That D type Drinfeld-Sokolov hierarchy has a similar algebraic structure as the bigraded Toda hierarchy which is a differential-discrete integrable system.

Field-antifield and BFV formalisms for quadratic systems with open gauge algebras

DOE Office of Scientific and Technical Information (OSTI.GOV)

Nirov, K.S.; Razumov, A.V.

1992-09-20

In this paper the Lagrangian field-antifield (BV) and Hamiltonian (BFV) BRST formalisms for the general quadratic systems with open gauge algebra are considered. The equivalence between the Lagrangian and Hamiltonian formalisms is proven.

A Mathematics Software Database Update.

ERIC Educational Resources Information Center

Cunningham, R. S.; Smith, David A.

1987-01-01

Contains an update of an earlier listing of software for mathematics instruction at the college level. Topics are: advanced mathematics, algebra, calculus, differential equations, discrete mathematics, equation solving, general mathematics, geometry, linear and matrix algebra, logic, statistics and probability, and trigonometry. (PK)

Classification of digital affine noncommutative geometries

NASA Astrophysics Data System (ADS)

Majid, Shahn; Pachoł, Anna

2018-03-01

It is known that connected translation invariant n-dimensional noncommutative differentials dxi on the algebra k[x1, …, xn] of polynomials in n-variables over a field k are classified by commutative algebras V on the vector space spanned by the coordinates. These data also apply to construct differentials on the Heisenberg algebra "spacetime" with relations [xμ, xν] = λΘμν, where Θ is an antisymmetric matrix, as well as to Lie algebras with pre-Lie algebra structures. We specialise the general theory to the field k =F2 of two elements, in which case translation invariant metrics (i.e., with constant coefficients) are equivalent to making V a Frobenius algebra. We classify all of these and their quantum Levi-Civita bimodule connections for n = 2, 3, with partial results for n = 4. For n = 2, we find 3 inequivalent differential structures admitting 1, 2, and 3 invariant metrics, respectively. For n = 3, we find 6 differential structures admitting 0, 1, 2, 3, 4, 7 invariant metrics, respectively. We give some examples for n = 4 and general n. Surprisingly, not all our geometries for n ≥ 2 have zero quantum Riemann curvature. Quantum gravity is normally seen as a weighted "sum" over all possible metrics but our results are a step towards a deeper approach in which we must also "sum" over differential structures. Over F2 we construct some of our algebras and associated structures by digital gates, opening up the possibility of "digital geometry."

Improving the quantum cost of reversible Boolean functions using reorder algorithm

NASA Astrophysics Data System (ADS)

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.

Volumetric T-spline Construction Using Boolean Operations

DTIC Science & Technology

2013-07-01

SUBTITLE Volumetric T-spline Construction Using Boolean Operations 5a. CONTRACT NUMBER 5b. GRANT NUMBER 5c. PROGRAM ELEMENT NUMBER 6. AUTHOR(S) 5d...Acknowledgements The work of L. Liu and Y. Zhang was supported by ONR-YIP award N00014- 10-1-0698 and an ONR Grant N00014-08-1-0653. T. J.R. Hughes was sup- 16...T-spline Construction Using Boolean Operations 17 ported by ONR Grant N00014-08-1-0992, NSF GOALI CMI-0700807/0700204, NSF CMMI-1101007 and a SINTEF

On the homotopy equivalence of simple AI-algebras

DOE Office of Scientific and Technical Information (OSTI.GOV)

Aristov, O Yu

1999-02-28

Let A and B be simple unital AI-algebras (an AI-algebra is an inductive limit of C*-algebras of the form BigOplus{sub i}{sup k}C([0,1],M{sub N{sub i}}). It is proved that two arbitrary unital homomorphisms from A into B such that the corresponding maps K{sub 0}A{yields}K{sub 0}B coincide are homotopic. Necessary and sufficient conditions on the Elliott invariant for A and B to be homotopy equivalent are indicated. Moreover, two algebras in the above class having the same K-theory but not homotopy equivalent are constructed. A theorem on the homotopy of approximately unitarily equivalent homomorphisms between AI-algebras is used in the proof, whichmore » is deduced in its turn from a generalization to the case of AI-algebras of a theorem of Manuilov stating that a unitary matrix almost commuting with a self-adjoint matrix h can be joined to 1 by a continuous path consisting of unitary matrices almost commuting with h.« less

On the quantum symmetry of the chiral Ising model

NASA Astrophysics Data System (ADS)

Vecsernyés, Peter

1994-03-01

We introduce the notion of rational Hopf algebras that we think are able to describe the superselection symmetries of rational quantum field theories. As an example we show that a six-dimensional rational Hopf algebra H can reproduce the fusion rules, the conformal weights, the quantum dimensions and the representation of the modular group of the chiral Ising model. H plays the role of the global symmetry algebra of the chiral Ising model in the following sense: (1) a simple field algebra F and a representation π on Hπ of it is given, which contains the c = {1}/{2} unitary representations of the Virasoro algebra as subrepresentations; (2) the embedding U: H → B( Hπ) is such that the observable algebra π( A) - is the invariant subalgebra of B( Hπ) with respect to the left adjoint action of H and U(H) is the commutant of π( A); (3) there exist H-covariant primary fields in B( Hπ), which obey generalized Cuntz algebra properties and intertwine between the inequivalent sectors of the observables.

Lattice Duality: The Origin of Probability and Entropy

NASA Technical Reports Server (NTRS)

Knuth, Kevin H.

2004-01-01

Bayesian probability theory is an inference calculus, which originates from a generalization of inclusion on the Boolean lattice of logical assertions to a degree of inclusion represented by a real number. Dual to this lattice is the distributive lattice of questions constructed from the ordered set of down-sets of assertions, which forms the foundation of the calculus of inquiry-a generalization of information theory. In this paper we introduce this novel perspective on these spaces in which machine learning is performed and discuss the relationship between these results and several proposed generalizations of information theory in the literature.

Algebra of implicitly defined constraints for gravity as the general form of embedding theory

NASA Astrophysics Data System (ADS)

Paston, S. A.; Semenova, E. N.; Franke, V. A.; Sheykin, A. A.

2017-01-01

We consider the embedding theory, the approach to gravity proposed by Regge and Teitelboim, in which 4D space-time is treated as a surface in high-dimensional flat ambient space. In its general form, which does not contain artificially imposed constraints, this theory can be viewed as an extension of GR. In the present paper we study the canonical description of the embedding theory in this general form. In this case, one of the natural constraints cannot be written explicitly, in contrast to the case where additional Einsteinian constraints are imposed. Nevertheless, it is possible to calculate all Poisson brackets with this constraint. We prove that the algebra of four emerging constraints is closed, i.e., all of them are first-class constraints. The explicit form of this algebra is also obtained.

Dynamic Network-Based Epistasis Analysis: Boolean Examples

PubMed Central

Azpeitia, Eugenio; Benítez, Mariana; Padilla-Longoria, Pablo; Espinosa-Soto, Carlos; Alvarez-Buylla, Elena R.

2011-01-01

In this article we focus on how the hierarchical and single-path assumptions of epistasis analysis can bias the inference of gene regulatory networks. Here we emphasize the critical importance of dynamic analyses, and specifically illustrate the use of Boolean network models. Epistasis in a broad sense refers to gene interactions, however, as originally proposed by Bateson, epistasis is defined as the blocking of a particular allelic effect due to the effect of another allele at a different locus (herein, classical epistasis). Classical epistasis analysis has proven powerful and useful, allowing researchers to infer and assign directionality to gene interactions. As larger data sets are becoming available, the analysis of classical epistasis is being complemented with computer science tools and system biology approaches. We show that when the hierarchical and single-path assumptions are not met in classical epistasis analysis, the access to relevant information and the correct inference of gene interaction topologies is hindered, and it becomes necessary to consider the temporal dynamics of gene interactions. The use of dynamical networks can overcome these limitations. We particularly focus on the use of Boolean networks that, like classical epistasis analysis, relies on logical formalisms, and hence can complement classical epistasis analysis and relax its assumptions. We develop a couple of theoretical examples and analyze them from a dynamic Boolean network model perspective. Boolean networks could help to guide additional experiments and discern among alternative regulatory schemes that would be impossible or difficult to infer without the elimination of these assumption from the classical epistasis analysis. We also use examples from the literature to show how a Boolean network-based approach has resolved ambiguities and guided epistasis analysis. Our article complements previous accounts, not only by focusing on the implications of the hierarchical and single-path assumption, but also by demonstrating the importance of considering temporal dynamics, and specifically introducing the usefulness of Boolean network models and also reviewing some key properties of network approaches. PMID:22645556

Novel algebraic aspects of Liouvillian integrability for two-dimensional polynomial dynamical systems

NASA Astrophysics Data System (ADS)

Demina, Maria V.

2018-05-01

The general structure of irreducible invariant algebraic curves for a polynomial dynamical system in C2 is found. Necessary conditions for existence of exponential factors related to an invariant algebraic curve are derived. As a consequence, all the cases when the classical force-free Duffing and Duffing-van der Pol oscillators possess Liouvillian first integrals are obtained. New exact solutions for the force-free Duffing-van der Pol system are constructed.

New phases of D ge 2 current and diffeomorphism algebras in particle physics

DOE Office of Scientific and Technical Information (OSTI.GOV)

Tze, Chia-Hsiung.

We survey some global results and open issues of current algebras and their canonical field theoretical realization in D {ge} 2 dimensional spacetime. We assess the status of the representation theory of their generalized Kac-Moody and diffeomorphism algebras. Particular emphasis is put on higher dimensional analogs of fermi-bose correspondence, complex analyticity and the phase entanglements of anyonic solitons with exotic spin and statistics. 101 refs.

Pawlak Algebra and Approximate Structure on Fuzzy Lattice

PubMed Central

Zhuang, Ying; Liu, Wenqi; Wu, Chin-Chia; Li, Jinhai

2014-01-01

The aim of this paper is to investigate the general approximation structure, weak approximation operators, and Pawlak algebra in the framework of fuzzy lattice, lattice topology, and auxiliary ordering. First, we prove that the weak approximation operator space forms a complete distributive lattice. Then we study the properties of transitive closure of approximation operators and apply them to rough set theory. We also investigate molecule Pawlak algebra and obtain some related properties. PMID:25152922

Pawlak algebra and approximate structure on fuzzy lattice.

PubMed

Zhuang, Ying; Liu, Wenqi; Wu, Chin-Chia; Li, Jinhai

2014-01-01

The aim of this paper is to investigate the general approximation structure, weak approximation operators, and Pawlak algebra in the framework of fuzzy lattice, lattice topology, and auxiliary ordering. First, we prove that the weak approximation operator space forms a complete distributive lattice. Then we study the properties of transitive closure of approximation operators and apply them to rough set theory. We also investigate molecule Pawlak algebra and obtain some related properties.

Acoustic logic gates and Boolean operation based on self-collimating acoustic beams

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zhang, Ting; Xu, Jian-yi; Cheng, Ying, E-mail: chengying@nju.edu.cn

2015-03-16

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 logicmore » 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.« less

Boolean networks with veto functions

NASA Astrophysics Data System (ADS)

Ebadi, Haleh; Klemm, Konstantin

2014-08-01

Boolean networks are discrete dynamical systems for modeling regulation and signaling in living cells. We investigate a particular class of Boolean functions with inhibiting inputs exerting a veto (forced zero) on the output. We give analytical expressions for the sensitivity of these functions and provide evidence for their role in natural systems. In an intracellular signal transduction network [Helikar et al., Proc. Natl. Acad. Sci. USA 105, 1913 (2008), 10.1073/pnas.0705088105], the functions with veto are over-represented by a factor exceeding the over-representation of threshold functions and canalyzing functions in the same system. In Boolean networks for control of the yeast cell cycle [Li et al., Proc. Natl. Acad. Sci. USA 101, 4781 (2004), 10.1073/pnas.0305937101; Davidich et al., PLoS ONE 3, e1672 (2008), 10.1371/journal.pone.0001672], no or minimal changes to the wiring diagrams are necessary to formulate their dynamics in terms of the veto functions introduced here.

Data-Driven Sampling Matrix Boolean Optimization for Energy-Efficient Biomedical Signal Acquisition by Compressive Sensing.

PubMed

Wang, Yuhao; Li, Xin; Xu, Kai; Ren, Fengbo; Yu, Hao

2017-04-01

Compressive sensing is widely used in biomedical applications, and the sampling matrix plays a critical role on both quality and power consumption of signal acquisition. It projects a high-dimensional vector of data into a low-dimensional subspace by matrix-vector multiplication. An optimal sampling matrix can ensure accurate data reconstruction and/or high compression ratio. Most existing optimization methods can only produce real-valued embedding matrices that result in large energy consumption during data acquisition. In this paper, we propose an efficient method that finds an optimal Boolean sampling matrix in order to reduce the energy consumption. Compared to random Boolean embedding, our data-driven Boolean sampling matrix can improve the image recovery quality by 9 dB. Moreover, in terms of sampling hardware complexity, it reduces the energy consumption by 4.6× and the silicon area by 1.9× over the data-driven real-valued embedding.

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

PubMed

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.

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

PubMed

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.

Quantum teleportation and Birman-Murakami-Wenzl algebra

NASA Astrophysics Data System (ADS)

Zhang, Kun; Zhang, Yong

2017-02-01

In this paper, we investigate the relationship of quantum teleportation in quantum information science and the Birman-Murakami-Wenzl (BMW) algebra in low-dimensional topology. For simplicity, we focus on the two spin-1/2 representation of the BMW algebra, which is generated by both the Temperley-Lieb projector and the Yang-Baxter gate. We describe quantum teleportation using the Temperley-Lieb projector and the Yang-Baxter gate, respectively, and study teleportation-based quantum computation using the Yang-Baxter gate. On the other hand, we exploit the extended Temperley-Lieb diagrammatical approach to clearly show that the tangle relations of the BMW algebra have a natural interpretation of quantum teleportation. Inspired by this interpretation, we construct a general representation of the tangle relations of the BMW algebra and obtain interesting representations of the BMW algebra. Therefore, our research sheds a light on a link between quantum information science and low-dimensional topology.

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

DTIC Science & Technology

2017-09-01

information is estimated to average 1 hour per response, including the time for reviewing instruction, searching existing data sources, gathering and...maintaining the data needed, and completing and reviewing the collection of information . Send comments regarding this burden estimate or any other aspect...of this collection of information , including suggestions for reducing this burden to Washington headquarters Services, Directorate for Information

Further Results on Constructions of Generalized Bent Boolean Functions

DTIC Science & Technology

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

Generalized Boolean Functions as Combiners

DTIC Science & Technology

2017-06-01

unable to find an analytically way of calculating a number for the complexity. Given the data we presented, there is not a obvious way to predict what...including the time for reviewing instruction, searching existing data sources, gathering and maintaining the data needed, and completing and reviewing the...backbone of many computer functions. Cryptography drives online commerce and allows privileged information safe transit between two parties as well as many

A Semiquantitative Framework for Gene Regulatory Networks: Increasing the Time and Quantitative Resolution of Boolean Networks

PubMed Central

Kerkhofs, Johan; Geris, Liesbet

2015-01-01

Boolean models have been instrumental in predicting general features of gene networks and more recently also as explorative tools in specific biological applications. In this study we introduce a basic quantitative and a limited time resolution to a discrete (Boolean) framework. Quantitative resolution is improved through the employ of normalized variables in unison with an additive approach. Increased time resolution stems from the introduction of two distinct priority classes. Through the implementation of a previously published chondrocyte network and T helper cell network, we show that this addition of quantitative and time resolution broadens the scope of biological behaviour that can be captured by the models. Specifically, the quantitative resolution readily allows models to discern qualitative differences in dosage response to growth factors. The limited time resolution, in turn, can influence the reachability of attractors, delineating the likely long term system behaviour. Importantly, the information required for implementation of these features, such as the nature of an interaction, is typically obtainable from the literature. Nonetheless, a trade-off is always present between additional computational cost of this approach and the likelihood of extending the model’s scope. Indeed, in some cases the inclusion of these features does not yield additional insight. This framework, incorporating increased and readily available time and semi-quantitative resolution, can help in substantiating the litmus test of dynamics for gene networks, firstly by excluding unlikely dynamics and secondly by refining falsifiable predictions on qualitative behaviour. PMID:26067297

A transition calculus for Boolean functions. [logic circuit analysis

NASA Technical Reports Server (NTRS)

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.

Coherent orthogonal polynomials

DOE Office of Scientific and Technical Information (OSTI.GOV)

Celeghini, E., E-mail: celeghini@fi.infn.it; Olmo, M.A. del, E-mail: olmo@fta.uva.es

2013-08-15

We discuss a fundamental characteristic of orthogonal polynomials, like the existence of a Lie algebra behind them, which can be added to their other relevant aspects. At the basis of the complete framework for orthogonal polynomials we include thus–in addition to differential equations, recurrence relations, Hilbert spaces and square integrable functions–Lie algebra theory. We start here from the square integrable functions on the open connected subset of the real line whose bases are related to orthogonal polynomials. All these one-dimensional continuous spaces allow, besides the standard uncountable basis (|x〉), for an alternative countable basis (|n〉). The matrix elements that relatemore » these two bases are essentially the orthogonal polynomials: Hermite polynomials for the line and Laguerre and Legendre polynomials for the half-line and the line interval, respectively. Differential recurrence relations of orthogonal polynomials allow us to realize that they determine an infinite-dimensional irreducible representation of a non-compact Lie algebra, whose second order Casimir C gives rise to the second order differential equation that defines the corresponding family of orthogonal polynomials. Thus, the Weyl–Heisenberg algebra h(1) with C=0 for Hermite polynomials and su(1,1) with C=−1/4 for Laguerre and Legendre polynomials are obtained. Starting from the orthogonal polynomials the Lie algebra is extended both to the whole space of the L{sup 2} functions and to the corresponding Universal Enveloping Algebra and transformation group. Generalized coherent states from each vector in the space L{sup 2} and, in particular, generalized coherent polynomials are thus obtained. -- Highlights: •Fundamental characteristic of orthogonal polynomials (OP): existence of a Lie algebra. •Differential recurrence relations of OP determine a unitary representation of a non-compact Lie group. •2nd order Casimir originates a 2nd order differential equation that defines the corresponding OP family. •Generalized coherent polynomials are obtained from OP.« less

Teacher's Guide to Secondary Mathematics.

ERIC Educational Resources Information Center

Duval County Schools, Jacksonville, FL.

This is a teacher's guide to secondary school mathematics. Developed for use in the Duval County Public Schools, Jacksonville, Florida. Areas of mathematics covered are algebra, analysis, calculus, computer literacy, computer science, geometry, analytic geometry, general mathematics, consumer mathematics, pre-algebra, probability and statistics,…

Enhanced asymptotic symmetry algebra of (2 +1 ) -dimensional flat space

NASA Astrophysics Data System (ADS)

Detournay, Stéphane; Riegler, Max

2017-02-01

In this paper we present a new set of asymptotic boundary conditions for Einstein gravity in (2 +1 ) -dimensions with a vanishing cosmological constant that are a generalization of the Barnich-Compère boundary conditions [G. Barnich and G. Compere, Classical Quantum Gravity 24, F15 (2007), 10.1088/0264-9381/24/5/F01]. These new boundary conditions lead to an asymptotic symmetry algebra that is generated by a bms3 algebra and two affine u ^(1 ) current algebras. We then apply these boundary conditions to topologically massive gravity (TMG) and determine how the presence of the gravitational Chern-Simons term affects the central extensions of the asymptotic symmetry algebra. We furthermore determine the thermal entropy of solutions obeying our new boundary conditions for both Einstein gravity and TMG.

Tensor Algebra Library for NVidia Graphics Processing Units

DOE Office of Scientific and Technical Information (OSTI.GOV)

Liakh, Dmitry

This is a general purpose math library implementing basic tensor algebra operations on NVidia GPU accelerators. This software is a tensor algebra library that can perform basic tensor algebra operations, including tensor contractions, tensor products, tensor additions, etc., on NVidia GPU accelerators, asynchronously with respect to the CPU host. It supports a simultaneous use of multiple NVidia GPUs. Each asynchronous API function returns a handle which can later be used for querying the completion of the corresponding tensor algebra operation on a specific GPU. The tensors participating in a particular tensor operation are assumed to be stored in local RAMmore » of a node or GPU RAM. The main research area where this library can be utilized is the quantum many-body theory (e.g., in electronic structure theory).« less

Semiclassical states on Lie algebras

DOE Office of Scientific and Technical Information (OSTI.GOV)

Tsobanjan, Artur, E-mail: artur.tsobanjan@gmail.com

2015-03-15

The effective technique for analyzing representation-independent features of quantum systems based on the semiclassical approximation (developed elsewhere) has been successfully used in the context of the canonical (Weyl) algebra of the basic quantum observables. Here, we perform the important step of extending this effective technique to the quantization of a more general class of finite-dimensional Lie algebras. The case of a Lie algebra with a single central element (the Casimir element) is treated in detail by considering semiclassical states on the corresponding universal enveloping algebra. Restriction to an irreducible representation is performed by “effectively” fixing the Casimir condition, following themore » methods previously used for constrained quantum systems. We explicitly determine the conditions under which this restriction can be consistently performed alongside the semiclassical truncation.« less

Dolan Grady relations and noncommutative quasi-exactly solvable systems

NASA Astrophysics Data System (ADS)

Klishevich, Sergey M.; Plyushchay, Mikhail S.

2003-11-01

We investigate a U(1) gauge invariant quantum mechanical system on a 2D noncommutative space with coordinates generating a generalized deformed oscillator algebra. The Hamiltonian is taken as a quadratic form in gauge covariant derivatives obeying the nonlinear Dolan-Grady relations. This restricts the structure function of the deformed oscillator algebra to a quadratic polynomial. The cases when the coordinates form the {\\mathfrak{su}}(2) and {\\mathfrak{sl}}(2,{\\bb {R}}) algebras are investigated in detail. Reducing the Hamiltonian to 1D finite-difference quasi-exactly solvable operators, we demonstrate partial algebraization of the spectrum of the corresponding systems on the fuzzy sphere and noncommutative hyperbolic plane. A completely covariant method based on the notion of intrinsic algebra is proposed to deal with the spectral problem of such systems.

Algebraic approach to small-world network models

NASA Astrophysics Data System (ADS)

Rudolph-Lilith, Michelle; Muller, Lyle E.

2014-01-01

We introduce an analytic model for directed Watts-Strogatz small-world graphs and deduce an algebraic expression of its defining adjacency matrix. The latter is then used to calculate the small-world digraph's asymmetry index and clustering coefficient in an analytically exact fashion, valid nonasymptotically for all graph sizes. The proposed approach is general and can be applied to all algebraically well-defined graph-theoretical measures, thus allowing for an analytical investigation of finite-size small-world graphs.

On alphabetic presentations of Clifford algebras and their possible applications

NASA Astrophysics Data System (ADS)

Toppan, Francesco; Verbeek, Piet W.

2009-12-01

In this paper, we address the problem of constructing a class of representations of Clifford algebras that can be named "alphabetic (re)presentations." The Clifford algebra generators are expressed as m-letter words written with a three-character or a four-character alphabet. We formulate the problem of the alphabetic presentations, deriving the main properties and some general results. At the end, we briefly discuss the motivations of this work and outline some possible applications.

Nonrelativistic limits of colored gravity in three dimensions

NASA Astrophysics Data System (ADS)

Joung, Euihun; Li, Wenliang

2018-05-01

The three-dimensional nonrelativistic isometry algebras, namely Galilei and Newton-Hooke algebras, are known to admit double central extensions, which allows for nondegenerate bilinear forms hence for action principles through Chern-Simons formulation. In three-dimensional colored gravity, the same central extension helps the theory evade the multigraviton no-go theorems by enlarging the color-decorated isometry algebra. We investigate the nonrelativistic limits of three-dimensional colored gravity in terms of generalized İnönü-Wigner contractions.

Schwinger-Keldysh formalism. Part II: thermal equivariant cohomology

NASA Astrophysics Data System (ADS)

Haehl, Felix M.; Loganayagam, R.; Rangamani, Mukund

2017-06-01

Causally ordered correlation functions of local operators in near-thermal quantum systems computed using the Schwinger-Keldysh formalism obey a set of Ward identities. These can be understood rather simply as the consequence of a topological (BRST) algebra, called the universal Schwinger-Keldysh superalgebra, as explained in our compan-ion paper [1]. In the present paper we provide a mathematical discussion of this topological algebra. In particular, we argue that the structures can be understood in the language of extended equivariant cohomology. To keep the discussion self-contained, we provide a ba-sic review of the algebraic construction of equivariant cohomology and explain how it can be understood in familiar terms as a superspace gauge algebra. We demonstrate how the Schwinger-Keldysh construction can be succinctly encoded in terms a thermal equivariant cohomology algebra which naturally acts on the operator (super)-algebra of the quantum system. The main rationale behind this exploration is to extract symmetry statements which are robust under renormalization group flow and can hence be used to understand low-energy effective field theory of near-thermal physics. To illustrate the general prin-ciples, we focus on Langevin dynamics of a Brownian particle, rephrasing some known results in terms of thermal equivariant cohomology. As described elsewhere, the general framework enables construction of effective actions for dissipative hydrodynamics and could potentially illumine our understanding of black holes.

Analysis of endomorphisms

NASA Astrophysics Data System (ADS)

Conti, Roberto; Hong, Jeong Hee; Szymański, Wojciech

2012-02-01

In this expository article, we discuss the recent progress in the study of endomorphisms and automorphisms of the Cuntz algebras and, more generally graph C* -algebras (or Cuntz-Krieger algebras). In particular, we discuss the definition and properties of both the full and the restricted Weyl group of such an algebra. Then we outline a powerful combinatorial approach to analysis of endomorphisms arising from permutation unitaries. The restricted Weyl group consists of automorphisms of this type. We also discuss the action of the restricted Weyl group on the diagonal MASA and its relationship with the automorphism group of the full two-sided n-shift. Finally, several open problems are presented.

Two classes of ODE models with switch-like behavior.

PubMed

Just, Winfried; Korb, Mason; Elbert, Ben; Young, Todd

2013-12-01

In cases where the same real-world system can be modeled both by an ODE system ⅅ and a Boolean system , it is of interest to identify conditions under which the two systems will be consistent, that is, will make qualitatively equivalent predictions. In this note we introduce two broad classes of relatively simple models that provide a convenient framework for studying such questions. In contrast to the widely known class of Glass networks, the right-hand sides of our ODEs are Lipschitz-continuous. We prove that if has certain structures, consistency between ⅅ and is implied by sufficient separation of time scales in one class of our models. Namely, if the trajectories of are "one-stepping" then we prove a strong form of consistency and if has a certain monotonicity property then there is a weaker consistency between ⅅ and . These results appear to point to more general structure properties that favor consistency between ODE and Boolean models.

Characterizing short-term stability for Boolean networks over any distribution of transfer functions

DOE PAGES

Seshadhri, C.; Smith, Andrew M.; Vorobeychik, Yevgeniy; ...

2016-07-05

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.

Inferring Boolean network states from partial information

PubMed Central

2013-01-01

Networks of molecular interactions regulate key processes in living cells. Therefore, understanding their functionality is a high priority in advancing biological knowledge. Boolean networks are often used to describe cellular networks mathematically and are fitted to experimental datasets. The fitting often results in ambiguities since the interpretation of the measurements is not straightforward and since the data contain noise. In order to facilitate a more reliable mapping between datasets and Boolean networks, we develop an algorithm that infers network trajectories from a dataset distorted by noise. We analyze our algorithm theoretically and demonstrate its accuracy using simulation and microarray expression data. PMID:24006954

Generalizations of the classical Yang-Baxter equation and O-operators

NASA Astrophysics Data System (ADS)

Bai, Chengming; Guo, Li; Ni, Xiang

2011-06-01

Tensor solutions (r-matrices) of the classical Yang-Baxter equation (CYBE) in a Lie algebra, obtained as the classical limit of the R-matrix solution of the quantum Yang-Baxter equation, is an important structure appearing in different areas such as integrable systems, symplectic geometry, quantum groups, and quantum field theory. Further study of CYBE led to its interpretation as certain operators, giving rise to the concept of {O}-operators. The O-operators were in turn interpreted as tensor solutions of CYBE by enlarging the Lie algebra [Bai, C., "A unified algebraic approach to the classical Yang-Baxter equation," J. Phys. A: Math. Theor. 40, 11073 (2007)], 10.1088/1751-8113/40/36/007. The purpose of this paper is to extend this study to a more general class of operators that were recently introduced [Bai, C., Guo, L., and Ni, X., "Nonabelian generalized Lax pairs, the classical Yang-Baxter equation and PostLie algebras," Commun. Math. Phys. 297, 553 (2010)], 10.1007/s00220-010-0998-7 in the study of Lax pairs in integrable systems. Relations between O-operators, relative differential operators, and Rota-Baxter operators are also discussed.

Topological defects in open string field theory

NASA Astrophysics Data System (ADS)

Kojita, Toshiko; Maccaferri, Carlo; Masuda, Toru; Schnabl, Martin

2018-04-01

We show how conformal field theory topological defects can relate solutions of open string field theory for different boundary conditions. To this end we generalize the results of Graham and Watts to include the action of defects on boundary condition changing fields. Special care is devoted to the general case when nontrivial multiplicities arise upon defect action. Surprisingly the fusion algebra of defects is realized on open string fields only up to a (star algebra) isomorphism.

C-semiring Frameworks for Minimum Spanning Tree Problems

NASA Astrophysics Data System (ADS)

Bistarelli, Stefano; Santini, Francesco

In this paper we define general algebraic frameworks for the Minimum Spanning Tree problem based on the structure of c-semirings. We propose general algorithms that can compute such trees by following different cost criteria, which must be all specific instantiation of c-semirings. Our algorithms are extensions of well-known procedures, as Prim or Kruskal, and show the expressivity of these algebraic structures. They can deal also with partially-ordered costs on the edges.

Bi-orthogonal approach to non-Hermitian Hamiltonians with the oscillator spectrum: Generalized coherent states for nonlinear algebras

NASA Astrophysics Data System (ADS)

Rosas-Ortiz, Oscar; Zelaya, Kevin

2018-01-01

A set of Hamiltonians that are not self-adjoint but have the spectrum of the harmonic oscillator is studied. The eigenvectors of these operators and those of their Hermitian conjugates form a bi-orthogonal system that provides a mathematical procedure to satisfy the superposition principle. In this form the non-Hermitian oscillators can be studied in much the same way as in the Hermitian approaches. Two different nonlinear algebras generated by properly constructed ladder operators are found and the corresponding generalized coherent states are obtained. The non-Hermitian oscillators can be steered to the conventional one by the appropriate selection of parameters. In such limit, the generators of the nonlinear algebras converge to generalized ladder operators that would represent either intensity-dependent interactions or multi-photon processes if the oscillator is associated with single mode photon fields in nonlinear media.

Continual Lie algebras and noncommutative counterparts of exactly solvable models

NASA Astrophysics Data System (ADS)

Zuevsky, A.

2004-01-01

Noncommutative counterparts of exactly solvable models are introduced on the basis of a generalization of Saveliev-Vershik continual Lie algebras. Examples of noncommutative Liouville and sin/h-Gordon equations are given. The simplest soliton solution to the noncommutative sine-Gordon equation is found.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Pramanik, Souvik, E-mail: souvick.in@gmail.com; Moussa, Mohamed, E-mail: mohamed.ibrahim@fsc.bu.edu.eg; Faizal, Mir, E-mail: f2mir@uwaterloo.ca

In this paper, the deformation of the Heisenberg algebra, consistent with both the generalized uncertainty principle and doubly special relativity, has been analyzed. It has been observed that, though this algebra can give rise to fractional derivative terms in the corresponding quantum mechanical Hamiltonian, a formal meaning can be given to them by using the theory of harmonic extensions of function. Depending on this argument, the expression of the propagator of the path integral corresponding to the deformed Heisenberg algebra, has been obtained. In particular, the consistent expression of the one dimensional free particle propagator has been evaluated explicitly. Withmore » this propagator in hand, it has been shown that, even in free particle case, normal generalized uncertainty principle and doubly special relativity show very much different result.« less

Plethystic vertex operators and boson-fermion correspondences

NASA Astrophysics Data System (ADS)

Fauser, Bertfried; Jarvis, Peter D.; King, Ronald C.

2016-10-01

We study the algebraic properties of plethystic vertex operators, introduced in (2010 J. Phys. A: Math. Theor. 43 405202), underlying the structure of symmetric functions associated with certain generalized universal character rings of subgroups of the general linear group, defined to stabilize tensors of Young symmetry type characterized by a partition of arbitrary shape π. Here we establish an extension of the well-known boson-fermion correspondence involving Schur functions and their associated (Bernstein) vertex operators: for each π, the modes generated by the plethystic vertex operators and their suitably constructed duals, satisfy the anticommutation relations of a complex Clifford algebra. The combinatorial manipulations underlying the results involve exchange identities exploiting the Hopf-algebraic structure of certain symmetric function series and their plethysms.

Algebraic special functions and SO(3,2)

DOE Office of Scientific and Technical Information (OSTI.GOV)

Celeghini, E., E-mail: celeghini@fi.infn.it; Olmo, M.A. del, E-mail: olmo@fta.uva.es

2013-06-15

A ladder structure of operators is presented for the associated Legendre polynomials and the sphericas harmonics. In both cases these operators belong to the irreducible representation of the Lie algebra so(3,2) with quadratic Casimir equals to −5/4. As both are also bases of square-integrable functions, the universal enveloping algebra of so(3,2) is thus shown to be homomorphic to the space of linear operators acting on the L{sup 2} functions defined on (−1,1)×Z and on the sphere S{sup 2}, respectively. The presence of a ladder structure is suggested to be the general condition to obtain a Lie algebra representation defining inmore » this way the “algebraic special functions” that are proposed to be the connection between Lie algebras and square-integrable functions so that the space of linear operators on the L{sup 2} functions is homomorphic to the universal enveloping algebra. The passage to the group, by means of the exponential map, shows that the associated Legendre polynomials and the spherical harmonics support the corresponding unitary irreducible representation of the group SO(3,2). -- Highlights: •The algebraic ladder structure is constructed for the associated Legendre polynomials (ALP). •ALP and spherical harmonics support a unitary irreducible SO(3,2)-representation. •A ladder structure is the condition to get a Lie group representation defining “algebraic special functions”. •The “algebraic special functions” connect Lie algebras and L{sup 2} functions.« less

Deformed oscillator algebra approach of some quantum superintegrable Lissajous systems on the sphere and of their rational extensions

DOE Office of Scientific and Technical Information (OSTI.GOV)

Marquette, Ian, E-mail: i.marquette@uq.edu.au; Quesne, Christiane, E-mail: cquesne@ulb.ac.be

2015-06-15

We extend the construction of 2D superintegrable Hamiltonians with separation of variables in spherical coordinates using combinations of shift, ladder, and supercharge operators to models involving rational extensions of the two-parameter Lissajous systems on the sphere. These new families of superintegrable systems with integrals of arbitrary order are connected with Jacobi exceptional orthogonal polynomials of type I (or II) and supersymmetric quantum mechanics. Moreover, we present an algebraic derivation of the degenerate energy spectrum for the one- and two-parameter Lissajous systems and the rationally extended models. These results are based on finitely generated polynomial algebras, Casimir operators, realizations as deformedmore » oscillator algebras, and finite-dimensional unitary representations. Such results have only been established so far for 2D superintegrable systems separable in Cartesian coordinates, which are related to a class of polynomial algebras that display a simpler structure. We also point out how the structure function of these deformed oscillator algebras is directly related with the generalized Heisenberg algebras spanned by the nonpolynomial integrals.« less

Linear {GLP}-algebras and their elementary theories

NASA Astrophysics Data System (ADS)

Pakhomov, F. N.

2016-12-01

The polymodal provability logic {GLP} was introduced by Japaridze in 1986. It is the provability logic of certain chains of provability predicates of increasing strength. Every polymodal logic corresponds to a variety of polymodal algebras. Beklemishev and Visser asked whether the elementary theory of the free {GLP}-algebra generated by the constants \\mathbf{0}, \\mathbf{1} is decidable [1]. For every positive integer n we solve the corresponding question for the logics {GLP}_n that are the fragments of {GLP} with n modalities. We prove that the elementary theory of the free {GLP}_n-algebra generated by the constants \\mathbf{0}, \\mathbf{1} is decidable for all n. We introduce the notion of a linear {GLP}_n-algebra and prove that all free {GLP}_n-algebras generated by the constants \\mathbf{0}, \\mathbf{1} are linear. We also consider the more general case of the logics {GLP}_α whose modalities are indexed by the elements of a linearly ordered set α: we define the notion of a linear algebra and prove the latter result in this case.

Quantum algorithms on Walsh transform and Hamming distance for Boolean functions

NASA Astrophysics Data System (ADS)

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.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Chung, Won Sang, E-mail: mimip4444@hanmail.net; Hounkonnou, Mahouton Norbert, E-mail: norbert.hounkonnou@cipma.uac.bj; Arjika, Sama, E-mail: rjksama2008@gmail.com

In this paper, we propose a full characterization of a generalized q-deformed Tamm-Dancoff oscillator algebra and investigate its main mathematical and physical properties. Specifically, we study its various representations and find the condition satisfied by the deformed q-number to define the algebra structure function. Particular Fock spaces involving finite and infinite dimensions are examined. A deformed calculus is performed as well as a coordinate realization for this algebra. A relevant example is exhibited. Associated coherent states are constructed. Finally, some thermodynamics aspects are computed and discussed.

Visualization of Dietary Patterns and Their Associations With Age-Related Macular Degeneration.

PubMed

Chiu, Chung-Jung; Chang, Min-Lee; Li, Tricia; Gensler, Gary; Taylor, Allen

2017-03-01

We aimed to visualize the relationship of predominant dietary patterns and their associations with AMD. A total of 8103 eyes from 4088 participants in the baseline Age-Related Eye Disease Study (AREDS) were classified into three groups: control (n = 2739), early AMD (n = 4599), and advanced AMD (n = 765). Using principle component analysis, two major dietary patterns and eight minor dietary patterns were characterized. Applying logistic regression in our analysis, we related dietary patterns to the prevalence of AMD. Qualitative comparative analysis by operating Boolean algebra and drawing Venn diagrams was used to visualize our findings. In general, the eight minor patterns were subsets or extensions of either one of the two major dietary patterns (Oriental and Western patterns) and consisted of fewer characteristic foods than the two major dietary patterns. Unlike the two major patterns, which were more strongly associated with both early and advanced AMD, none of the eight minors were associated with early AMD and only four minor patterns, including the Steak pattern (odds ratio comparing the highest to lowest quintile of the pattern score = 1.73 [95% confidence interval: 1.24 to 2.41; Ptrend = 0.02]), the Breakfast pattern (0.60 [0.44 to 0.82]; Ptrend = 0.004]), the Caribbean pattern (0.64 [0.47 to 0.89; Ptrend = 0.009]), and the Peanut pattern (0.64 [0.46 to 0.89; Ptrend = 0.03]), were significantly associated with advanced AMD. Our data also suggested several potential beneficial (peanuts, pizza, coffee, and tea) and harmful (salad dressing) foods for AMD. Our data indicate that a diet of various healthy foods may be optimal for reducing AMD risk. The effects of some specific foods in the context of overall diet warrant further study.

Problems Relating Mathematics and Science in the High School.

ERIC Educational Resources Information Center

Morrow, Richard; Beard, Earl

This document contains various science problems which require a mathematical solution. The problems are arranged under two general areas. The first (algebra I) contains biology, chemistry, and physics problems which require solutions related to linear equations, exponentials, and nonlinear equations. The second (algebra II) contains physics…

Implementing Linear Algebra Related Algorithms on the TI-92+ Calculator.

ERIC Educational Resources Information Center

Alexopoulos, John; Abraham, Paul

2001-01-01

Demonstrates a less utilized feature of the TI-92+: its natural and powerful programming language. Shows how to implement several linear algebra related algorithms including the Gram-Schmidt process, Least Squares Approximations, Wronskians, Cholesky Decompositions, and Generalized Linear Least Square Approximations with QR Decompositions.…

A Learning Progression for Elementary Students' Functional Thinking

ERIC Educational Resources Information Center

Stephens, Ana C.; Fonger, Nicole; Strachota, Susanne; Isler, Isil; Blanton, Maria; Knuth, Eric; Murphy Gardiner, Angela

2017-01-01

In this article we advance characterizations of and supports for elementary students' progress in generalizing and representing functional relationships as part of a comprehensive approach to early algebra. Our learning progressions approach to early algebra research involves the coordination of a curricular framework and progression, an…

Noise limitations in optical linear algebra processors.

PubMed

Batsell, S G; Jong, T L; Walkup, J F; Krile, T F

1990-05-10

A general statistical noise model is presented for optical linear algebra processors. A statistical analysis which includes device noise, the multiplication process, and the addition operation is undertaken. We focus on those processes which are architecturally independent. Finally, experimental results which verify the analytical predictions are also presented.

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

PubMed

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 equations on probability distributions. We developed a C++ software, MaBoSS, that is able to simulate such a system by applying Kinetic Monte-Carlo (or Gillespie algorithm) on the Boolean state space. This software, parallelized and optimized, computes the temporal evolution of probability distributions and estimates stationary distributions. Applications of the Boolean Kinetic Monte-Carlo are demonstrated for three qualitative models: a toy model, a published model of p53/Mdm2 interaction and a published model of the mammalian cell cycle. Our approach allows to describe kinetic phenomena which were difficult to handle in the original models. In particular, transient effects are represented by time dependent probability distributions, interpretable in terms of cell populations.

Development of Boolean calculus and its applications. [digital systems design

NASA Technical Reports Server (NTRS)

Tapia, M. A.

1980-01-01

The development of Boolean calculus for its application to developing digital system design methodologies that would reduce system complexity, size, cost, speed, power requirements, etc., is discussed. Synthesis procedures for logic circuits are examined particularly asynchronous circuits using clock triggered flip flops.

Advanced Feedback Methods in Information Retrieval.

ERIC Educational Resources Information Center

Salton, G.; And Others

1985-01-01

In this study, automatic feedback techniques are applied to Boolean query statements in online information retrieval to generate improved query statements based on information contained in previously retrieved documents. Feedback operations are carried out using conventional Boolean logic and extended logic. Experimental output is included to…

Classical affine W-algebras associated to Lie superalgebras

NASA Astrophysics Data System (ADS)

Suh, Uhi Rinn

2016-02-01

In this paper, we prove classical affine W-algebras associated to Lie superalgebras (W-superalgebras), which can be constructed in two different ways: via affine classical Hamiltonian reductions and via taking quasi-classical limits of quantum affine W-superalgebras. Also, we show that a classical finite W-superalgebra can be obtained by a Zhu algebra of a classical affine W-superalgebra. Using the definition by Hamiltonian reductions, we find free generators of a classical W-superalgebra associated to a minimal nilpotent. Moreover, we compute generators of the classical W-algebra associated to spo(2|3) and its principal nilpotent. In the last part of this paper, we introduce a generalization of classical affine W-superalgebras called classical affine fractional W-superalgebras. We show these have Poisson vertex algebra structures and find generators of a fractional W-superalgebra associated to a minimal nilpotent.

On explicit algebraic stress models for complex turbulent flows

NASA Technical Reports Server (NTRS)

Gatski, T. B.; Speziale, C. G.

1992-01-01

Explicit algebraic stress models that are valid for three-dimensional turbulent flows in noninertial frames are systematically derived from a hierarchy of second-order closure models. This represents a generalization of the model derived by Pope who based his analysis on the Launder, Reece, and Rodi model restricted to two-dimensional turbulent flows in an inertial frame. The relationship between the new models and traditional algebraic stress models -- as well as anistropic eddy visosity models -- is theoretically established. The need for regularization is demonstrated in an effort to explain why traditional algebraic stress models have failed in complex flows. It is also shown that these explicit algebraic stress models can shed new light on what second-order closure models predict for the equilibrium states of homogeneous turbulent flows and can serve as a useful alternative in practical computations.

Algebraic integrability: a survey.

PubMed

Vanhaecke, Pol

2008-03-28

We give a concise introduction to the notion of algebraic integrability. Our exposition is based on examples and phenomena, rather than on detailed proofs of abstract theorems. We mainly focus on algebraic integrability in the sense of Adler-van Moerbeke, where the fibres of the momentum map are affine parts of Abelian varieties; as it turns out, most examples from classical mechanics are of this form. Two criteria are given for such systems (Kowalevski-Painlevé and Lyapunov) and each is illustrated in one example. We show in the case of a relatively simple example how one proves algebraic integrability, starting from the differential equations for the integrable vector field. For Hamiltonian systems that are algebraically integrable in the generalized sense, two examples are given, which illustrate the non-compact analogues of Abelian varieties which typically appear in such systems.

A spatial operator algebra for manipulator modeling and control

NASA Technical Reports Server (NTRS)

Rodriguez, G.; Kreutz, K.; Milman, M.

1988-01-01

A powerful new spatial operator algebra for modeling, control, and trajectory design of manipulators is discussed along with its implementation in the Ada programming language. Applications of this algebra to robotics include an operator representation of the manipulator Jacobian matrix; the robot dynamical equations formulated in terms of the spatial algebra, showing the complete equivalence between the recursive Newton-Euler formulations to robot dynamics; the operator factorization and inversion of the manipulator mass matrix which immediately results in O(N) recursive forward dynamics algorithms; the joint accelerations of a manipulator due to a tip contact force; the recursive computation of the equivalent mass matrix as seen at the tip of a manipulator; and recursive forward dynamics of a closed chain system. Finally, additional applications and current research involving the use of the spatial operator algebra are discussed in general terms.

Compact universal logic gates realized using quantization of current in nanodevices.

PubMed

Zhang, Wancheng; Wu, Nan-Jian; Yang, Fuhua

2007-12-12

This paper proposes novel universal logic gates using the current quantization characteristics of nanodevices. In nanodevices like the electron waveguide (EW) and single-electron (SE) turnstile, the channel current is a staircase quantized function of its control voltage. We use this unique characteristic to compactly realize Boolean functions. First we present the concept of the periodic-threshold threshold logic gate (PTTG), and we build a compact PTTG using EW and SE turnstiles. We show that an arbitrary three-input Boolean function can be realized with a single PTTG, and an arbitrary four-input Boolean function can be realized by using two PTTGs. We then use one PTTG to build a universal programmable two-input logic gate which can be used to realize all two-input Boolean functions. We also build a programmable three-input logic gate by using one PTTG. Compared with linear threshold logic gates, with the PTTG one can build digital circuits more compactly. The proposed PTTGs are promising for future smart nanoscale digital system use.

Phase transition in NK-Kauffman networks and its correction for Boolean irreducibility

NASA Astrophysics Data System (ADS)

Zertuche, Federico

2014-05-01

In a series of articles published in 1986, Derrida and his colleagues studied two mean field treatments (the quenched and the annealed) for NK-Kauffman networks. Their main results lead to a phase transition curve Kc 2 pc(1-pc)=1 (0

Controllability and observability of Boolean networks arising from biology

NASA Astrophysics Data System (ADS)

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.

Solving a discrete model of the lac operon using Z3

NASA Astrophysics Data System (ADS)

Gutierrez, Natalia A.

2014-05-01

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

Phase transitions in restricted Boltzmann machines with generic priors

NASA Astrophysics Data System (ADS)

Barra, Adriano; Genovese, Giuseppe; Sollich, Peter; Tantari, Daniele

2017-10-01

We study generalized restricted Boltzmann machines with generic priors for units and weights, interpolating between Boolean and Gaussian variables. We present a complete analysis of the replica symmetric phase diagram of these systems, which can be regarded as generalized Hopfield models. We underline the role of the retrieval phase for both inference and learning processes and we show that retrieval is robust for a large class of weight and unit priors, beyond the standard Hopfield scenario. Furthermore, we show how the paramagnetic phase boundary is directly related to the optimal size of the training set necessary for good generalization in a teacher-student scenario of unsupervised learning.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Genest, Vincent X.; Vinet, Luc; Zhedanov, Alexei

The algebra H of the dual -1 Hahn polynomials is derived and shown to arise in the Clebsch-Gordan problem of sl{sub -1}(2). The dual -1 Hahn polynomials are the bispectral polynomials of a discrete argument obtained from the q{yields}-1 limit of the dual q-Hahn polynomials. The Hopf algebra sl{sub -1}(2) has four generators including an involution, it is also a q{yields}-1 limit of the quantum algebra sl{sub q}(2) and furthermore, the dynamical algebra of the parabose oscillator. The algebra H, a two-parameter generalization of u(2) with an involution as additional generator, is first derived from the recurrence relation of themore » -1 Hahn polynomials. It is then shown that H can be realized in terms of the generators of two added sl{sub -1}(2) algebras, so that the Clebsch-Gordan coefficients of sl{sub -1}(2) are dual -1 Hahn polynomials. An irreducible representation of H involving five-diagonal matrices and connected to the difference equation of the dual -1 Hahn polynomials is constructed.« less

Soft hairy warped black hole entropy

NASA Astrophysics Data System (ADS)

Grumiller, Daniel; Hacker, Philip; Merbis, Wout

2018-02-01

We reconsider warped black hole solutions in topologically massive gravity and find novel boundary conditions that allow for soft hairy excitations on the horizon. To compute the associated symmetry algebra we develop a general framework to compute asymptotic symmetries in any Chern-Simons-like theory of gravity. We use this to show that the near horizon symmetry algebra consists of two u (1) current algebras and recover the surprisingly simple entropy formula S = 2 π( J 0 + + J 0 - ), where J 0 ± are zero mode charges of the current algebras. This provides the first example of a locally non-maximally symmetric configuration exhibiting this entropy law and thus non-trivial evidence for its universality.

Mathematical models for space shuttle ground systems

NASA Technical Reports Server (NTRS)

Tory, E. G.

1985-01-01

Math models are a series of algorithms, comprised of algebraic equations and Boolean Logic. At Kennedy Space Center, math models for the Space Shuttle Systems are performed utilizing the Honeywell 66/80 digital computers, Modcomp II/45 Minicomputers and special purpose hardware simulators (MicroComputers). The Shuttle Ground Operations Simulator operating system provides the language formats, subroutines, queueing schemes, execution modes and support software to write, maintain and execute the models. The ground systems presented consist primarily of the Liquid Oxygen and Liquid Hydrogen Cryogenic Propellant Systems, as well as liquid oxygen External Tank Gaseous Oxygen Vent Hood/Arm and the Vehicle Assembly Building (VAB) High Bay Cells. The purpose of math modeling is to simulate the ground hardware systems and to provide an environment for testing in a benign mode. This capability allows the engineers to check out application software for loading and launching the vehicle, and to verify the Checkout, Control, & Monitor Subsystem within the Launch Processing System. It is also used to train operators and to predict system response and status in various configurations (normal operations, emergency and contingent operations), including untried configurations or those too dangerous to try under real conditions, i.e., failure modes.

Application of fault tree approach for the causation mechanism of urban haze in Beijing--Considering the risk events related with exhausts of coal combustion.

PubMed

Huang, Weiqing; Fan, Hongbo; Qiu, Yongfu; Cheng, Zhiyu; Qian, Yu

2016-02-15

Haze weather has become a serious environmental pollution problem which occurs in many Chinese cities. One of the most critical factors for the formation of haze weather is the exhausts of coal combustion, thus it is meaningful to figure out the causation mechanism between urban haze and the exhausts of coal combustion. Based on above considerations, the fault tree analysis (FAT) approach was employed for the causation mechanism of urban haze in Beijing by considering the risk events related with the exhausts of coal combustion for the first time. Using this approach, firstly the fault tree of the urban haze causation system connecting with coal combustion exhausts was established; consequently the risk events were discussed and identified; then, the minimal cut sets were successfully determined using Boolean algebra; finally, the structure, probability and critical importance degree analysis of the risk events were completed for the qualitative and quantitative assessment. The study results proved that the FTA was an effective and simple tool for the causation mechanism analysis and risk management of urban haze in China. Copyright © 2015 Elsevier B.V. All rights reserved.

History, Applications, and Philosophy in Mathematics Education: HAPh—A Use of Primary Sources

NASA Astrophysics Data System (ADS)

Jankvist, Uffe Thomas

2013-03-01

The article first investigates the basis for designing teaching activities dealing with aspects of history, applications, and philosophy of mathematics in unison by discussing and analyzing the different `whys' and `hows' of including these three dimensions in mathematics education. Based on the observation that a use of history, applications, and philosophy as a `goal' is best realized through a modules approach, the article goes on to discuss how to actually design such teaching modules. It is argued that a use of primary original sources through a so-called guided reading along with a use of student essay assignments, which are suitable for bringing out relevant meta-issues of mathematics, is a sensible way of realizing a design encompassing the three dimensions. Two concrete teaching modules on aspects of the history, applications, and philosophy of mathematics—HAPh-modules—are outlined and the mathematical cases of these, graph theory and Boolean algebra, are described. Excerpts of student groups' essays from actual implementations of these modules are displayed as illustrative examples of the possible effect such HAPh-modules may have on students' development of an awareness regarding history, applications, and philosophy in relation to mathematics as a (scientific) discipline.

Perturbation propagation in random and evolved Boolean networks

NASA Astrophysics Data System (ADS)

Fretter, Christoph; Szejka, Agnes; Drossel, Barbara

2009-03-01

In this paper, we investigate the propagation of perturbations in Boolean networks by evaluating the Derrida plot and its modifications. We show that even small random Boolean networks agree well with the predictions of the annealed approximation, but nonrandom networks show a very different behaviour. We focus on networks that were evolved for high dynamical robustness. The most important conclusion is that the simple distinction between frozen, critical and chaotic networks is no longer useful, since such evolved networks can display the properties of all three types of networks. Furthermore, we evaluate a simplified empirical network and show how its specific state space properties are reflected in the modified Derrida plots.

Optical linear algebra processors: noise and error-source modeling.

PubMed

Casasent, D; Ghosh, A

1985-06-01

The modeling of system and component noise and error sources in optical linear algebra processors (OLAP's) are considered, with attention to the frequency-multiplexed OLAP. General expressions are obtained for the output produced as a function of various component errors and noise. A digital simulator for this model is discussed.

Optical linear algebra processors - Noise and error-source modeling

NASA Technical Reports Server (NTRS)

Casasent, D.; Ghosh, A.

1985-01-01

The modeling of system and component noise and error sources in optical linear algebra processors (OLAPs) are considered, with attention to the frequency-multiplexed OLAP. General expressions are obtained for the output produced as a function of various component errors and noise. A digital simulator for this model is discussed.

Toxicological Tipping Points: Learning Boolean Networks from High-Content Imaging Data. (BOSC meeting)

EPA Science Inventory

The objective of this work is to elucidate biological networks underlying cellular tipping points using time-course data. We discretized the high-content imaging (HCI) data and inferred Boolean networks (BNs) that could accurately predict dynamic cellular trajectories. We found t...

Boolean linear differential operators on elementary cellular automata

NASA Astrophysics Data System (ADS)

Martín Del Rey, Ángel

2014-12-01

In this paper, the notion of boolean linear differential operator (BLDO) on elementary cellular automata (ECA) is introduced and some of their more important properties are studied. Special attention is paid to those differential operators whose coefficients are the ECA with rule numbers 90 and 150.

The Dixmier Map for Nilpotent Super Lie Algebras

NASA Astrophysics Data System (ADS)

Herscovich, Estanislao

2012-07-01

In this article we prove that there exists a Dixmier map for nilpotent super Lie algebras. In other words, if we denote by {Prim({U}({g}))} the set of (graded) primitive ideals of the enveloping algebra {{U}({g})} of a nilpotent Lie superalgebra {{g}} and {{A}d0} the adjoint group of {{g}0}, we prove that the usual Dixmier map for nilpotent Lie algebras can be naturally extended to the context of nilpotent super Lie algebras, i.e. there exists a bijective map I : {g}0^{*}/{A}d0 rightarrow Prim({U}({g})) defined by sending the equivalence class [ λ] of a functional λ to a primitive ideal I( λ) of {{U}({g})}, and which coincides with the Dixmier map in the case of nilpotent Lie algebras. Moreover, the construction of the previous map is explicit, and more or less parallel to the one for Lie algebras, a major difference with a previous approach ( cf. [18]). One key fact in the construction is the existence of polarizations for super Lie algebras, generalizing the concept defined for Lie algebras. As a corollary of the previous description, we obtain the isomorphism {{U}({g})/I(λ) ˜eq Cliffq(k) ⊗ Ap(k)}, where {(p,q) = (dim({g}0/{g}0^{λ})/2,dim({g}1/{g}1^{λ}))}, we get a direct construction of the maximal ideals of the underlying algebra of {{U}({g})} and also some properties of the stabilizers of the primitive ideals of {{U}({g})}.

Reflection Functor in the Representation Theory of Preprojective Algebras for Quivers and Integrable Systems

NASA Astrophysics Data System (ADS)

Silantyev, A. V.

2018-05-01

A brief overview of the representation theory of quivers and the associated (deformed) preprojective algebras, as well as of the theories of moduli spaces of these algebras, quiver varieties and a reflection functor, is given. It is proven that a bijection between moduli spaces (in particular, between quiver varieties), which is induced by a reflection function, is the isomorphism of symplectic affine varieties. The Hamiltonian systems on quiver varieties are defined, and the application of a reflection functor to them is described. The review of [1], concerning the case of a cyclic quiver is given, and a role of the reflection functor in this case is clarified. The "spin" integrable generalizations of Calogero-Moser systems and their application to the KP hierarchy generalizations are described.

A Family of Finite-Dimensional Representations of Generalized Double Affine Hecke Algebras of Higher Rank

NASA Astrophysics Data System (ADS)

Fu, Yuchen; Shelley-Abrahamson, Seth

2016-06-01

We give explicit constructions of some finite-dimensional representations of generalized double affine Hecke algebras (GDAHA) of higher rank using R-matrices for U_q(sl_N). Our construction is motivated by an analogous construction of Silvia Montarani in the rational case. Using the Drinfeld-Kohno theorem for Knizhnik-Zamolodchikov differential equations, we prove that the explicit representations we produce correspond to Montarani's representations under a monodromy functor introduced by Etingof, Gan, and Oblomkov.

A non-commutative *-algebra of Borel functions

NASA Astrophysics Data System (ADS)

Hart, Robert

To the pair (E, sigma), where E is a countable Borel equivalence relation on a standard Borel space ( X, A ) and sigma a normalized Borel T -valued 2-cocycle on E, we associate a sequentially weakly closed Borel *-algebra B*r (E, sigma), contained in the bounded linear operators on ℓ2(E). Associated to B*r (E, sigma) is a natural (Borel) Cartan subalgebra (Definition 6.4.10) L( Bo (X)) isomorphic to the bounded Borel functions on X. Then L( Bo (X)) and its normalizer (the set of the unitaries u ∈ B*r (E, sigma) such that u* fu ∈ L( Bo (X)), f ∈ L( Bo (X))) countably generates the Borel *-algebra B*r (E, sigma). In this thesis, we study B*r (E, sigma) and in particular prove that: i) If E is smooth, then B*r (E, sigma) is a type I Borel *-algebra (Definition 6.3.10). ii) If E is a hyperfinite, then B*r (E, sigma) is a Borel AF-algebra (Definition 7.5.1). iii) Generalizing Kumjian's definition, we define a Borel twist Gamma over E and its associated sequentially closed Borel *-algebra B*r (Gamma). iv) Let a Borel Cartan pair ( B,B0 ) denote a sequentially closed Borel *-algebra B with a Borel Cartan subalgebra B0 , where B is countably B0 -generated. Generalizing Feldman-Moore's result, we prove that any pair ( B,B0 ) can be realized uniquely as a pair ( B*r (E, sigma), L( Bo (X))). Moreover, we show that the pair ( B*r (E), L( Bo (X))) is a complete invariant of the countable Borel equivalence relation E. v) We prove a Krieger type theorem, by showing that two aperiodic hyperfinite countable equivalence relations are isomorphic if and only if their associated Borel *-algebras B*r (E1) and B*r (E2) are isomorphic.

Exceptional quantum geometry and particle physics

NASA Astrophysics Data System (ADS)

Dubois-Violette, Michel

2016-11-01

Based on an interpretation of the quark-lepton symmetry in terms of the unimodularity of the color group SU (3) and on the existence of 3 generations, we develop an argumentation suggesting that the "finite quantum space" corresponding to the exceptional real Jordan algebra of dimension 27 (the Euclidean Albert algebra) is relevant for the description of internal spaces in the theory of particles. In particular, the triality which corresponds to the 3 off-diagonal octonionic elements of the exceptional algebra is associated to the 3 generations of the Standard Model while the representation of the octonions as a complex 4-dimensional space C ⊕C3 is associated to the quark-lepton symmetry (one complex for the lepton and 3 for the corresponding quark). More generally it is suggested that the replacement of the algebra of real functions on spacetime by the algebra of functions on spacetime with values in a finite-dimensional Euclidean Jordan algebra which plays the role of "the algebra of real functions" on the corresponding almost classical quantum spacetime is relevant in particle physics. This leads us to study the theory of Jordan modules and to develop the differential calculus over Jordan algebras (i.e. to introduce the appropriate notion of differential forms). We formulate the corresponding definition of connections on Jordan modules.

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

ERIC Educational Resources Information Center

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…

From Quantum Fields to Local Von Neumann Algebras

NASA Astrophysics Data System (ADS)

Borchers, H. J.; Yngvason, Jakob

The subject of the paper is an old problem of the general theory of quantized fields: When can the unbounded operators of a Wightman field theory be associated with local algebras of bounded operators in the sense of Haag? The paper reviews and extends previous work on this question, stressing its connections with a noncommutive generalization of the classical Hamburger moment problem. Necessary and sufficient conditions for the existence of a local net of von Neumann algebras corresponding to a given Wightman field are formulated in terms of strengthened versions of the usual positivity property of Wightman functionals. The possibility that the local net has to be defined in an enlarged Hilbert space cannot be ruled out in general. Under additional hypotheses, e.g., if the field operators obey certain energy bounds, such an extension of the Hilbert space is not necessary, however. In these cases a fairly simple condition for the existence of a local net can be given involving the concept of “central positivity” introduced by Powers. The analysis presented here applies to translationally covariant fields with an arbitrary number of components, whereas Lorentz covariance is not needed. The paper contains also a brief discussion of an approach to noncommutative moment problems due to Dubois-Violette, and concludes with some remarks on modular theory for algebras of unbounded operators.

Braided Categories of Endomorphisms as Invariants for Local Quantum Field Theories

NASA Astrophysics Data System (ADS)

Giorgetti, Luca; Rehren, Karl-Henning

2018-01-01

We want to establish the "braided action" (defined in the paper) of the DHR category on a universal environment algebra as a complete invariant for completely rational chiral conformal quantum field theories. The environment algebra can either be a single local algebra, or the quasilocal algebra, both of which are model-independent up to isomorphism. The DHR category as an abstract structure is captured by finitely many data (superselection sectors, fusion, and braiding), whereas its braided action encodes the full dynamical information that distinguishes models with isomorphic DHR categories. We show some geometric properties of the "duality pairing" between local algebras and the DHR category that are valid in general (completely rational) chiral CFTs. Under some additional assumptions whose status remains to be settled, the braided action of its DHR category completely classifies a (prime) CFT. The approach does not refer to the vacuum representation, or the knowledge of the vacuum state.

Recurrence approach and higher order polynomial algebras for superintegrable monopole systems

NASA Astrophysics Data System (ADS)

Hoque, Md Fazlul; Marquette, Ian; Zhang, Yao-Zhong

2018-05-01

We revisit the MIC-harmonic oscillator in flat space with monopole interaction and derive the polynomial algebra satisfied by the integrals of motion and its energy spectrum using the ad hoc recurrence approach. We introduce a superintegrable monopole system in a generalized Taub-Newman-Unti-Tamburino (NUT) space. The Schrödinger equation of this model is solved in spherical coordinates in the framework of Stäckel transformation. It is shown that wave functions of the quantum system can be expressed in terms of the product of Laguerre and Jacobi polynomials. We construct ladder and shift operators based on the corresponding wave functions and obtain the recurrence formulas. By applying these recurrence relations, we construct higher order algebraically independent integrals of motion. We show that the integrals form a polynomial algebra. We construct the structure functions of the polynomial algebra and obtain the degenerate energy spectra of the model.

Classical integrable many-body systems disconnected with semi-simple Lie algebras

NASA Astrophysics Data System (ADS)

Inozemtsev, V. I.

2017-05-01

The review of the results in the theory of integrable many-body systems disconnected with semisimple Lie algebras is done. The one-dimensional systems of light Calogero-Sutherland-Moser particles interacting with one particle of infinite mass located at the origin are described in detail. In some cases the exact solutions of the equations of motion are obtained. The general theory of integration of the equations of motion needs the methods of algebraic geometry. The Lax pairs with spectral parameter are constructed for this purpose. The theory still contains many unsolved problems.

Generalized Browder's and Weyl's theorems for Banach space operators

NASA Astrophysics Data System (ADS)

Curto, Raúl E.; Han, Young Min

2007-12-01

We find necessary and sufficient conditions for a Banach space operator T to satisfy the generalized Browder's theorem. We also prove that the spectral mapping theorem holds for the Drazin spectrum and for analytic functions on an open neighborhood of [sigma](T). As applications, we show that if T is algebraically M-hyponormal, or if T is algebraically paranormal, then the generalized Weyl's theorem holds for f(T), where f[set membership, variant]H((T)), the space of functions analytic on an open neighborhood of [sigma](T). We also show that if T is reduced by each of its eigenspaces, then the generalized Browder's theorem holds for f(T), for each f[set membership, variant]H([sigma](T)).

Exploring Concepts from Abstract Algebra Using Variations of Generalized Woven Figure Eights

ERIC Educational Resources Information Center

Taylor, Tara; Knoll, Eva; Landry, Wendy

2016-01-01

Students often struggle with concepts from abstract algebra. Typical classes incorporate few ways to make the concepts concrete. Using a set of woven paper artifacts, this paper proposes a way to visualize and explore concepts (symmetries, groups, permutations, subgroups, etc.). The set of artifacts used to illustrate these concepts is derived…

Quasi-generalized variables

NASA Technical Reports Server (NTRS)

Baumgarten, J.; Ostermeyer, G. P.

1986-01-01

The numerical solution of a system of differential and algebraic equations is difficult, due to the appearance of numerical instabilities. A method is presented here which permits numerical solutions of such a system to be obtained which satisfy the algebraic constraint equations exactly without reducing the order of the differential equations. The method is demonstrated using examples from mechanics.

Hidden algebra method (quasi-exact-solvability in quantum mechanics)

DOE Office of Scientific and Technical Information (OSTI.GOV)

Turbiner, Alexander; Instituto de Ciencias Nucleares, Universidad Nacional Autonoma de Mexico, Apartado, Postal 70-543, 04510 Mexico, D. F.

1996-02-20

A general introduction to quasi-exactly-solvable problems of quantum mechanics is presented. Main attention is given to multidimensional quasi-exactly-solvable and exactly-solvable Schroedinger operators. Exact-solvability of the Calogero and Sutherland N-body problems ass ociated with an existence of the hidden algebra slN is discussed extensively.

A Method for the Microanalysis of Pre-Algebra Transfer

ERIC Educational Resources Information Center

Pavlik, Philip I., Jr.; Yudelson, Michael; Koedinger, Kenneth R.

2011-01-01

The objective of this research was to better understand the transfer of learning between different variations of pre-algebra problems. While the authors could have addressed a specific variation that might address transfer, they were interested in developing a general model of transfer, so we gathered data from multiple problem types and their…

Bethe vectors for XXX-spin chain

NASA Astrophysics Data System (ADS)

Burdík, Čestmír; Fuksa, Jan; Isaev, Alexei

2014-11-01

The paper deals with algebraic Bethe ansatz for XXX-spin chain. Generators of Yang-Baxter algebra are expressed in basis of free fermions and used to calculate explicit form of Bethe vectors. Their relation to N-component models is used to prove conjecture about their form in general. Some remarks on inhomogeneous XXX-spin chain are included.

Importance of Grades and Placement for Math Attainment

ERIC Educational Resources Information Center

Tyson, Will; Roksa, Josipa

2017-01-01

Research on high school math course taking documents the advantages of starting high school at or beyond Algebra 1. Fewer studies examine differentiation into remedial, general, and honors Algebra 1 course types by course rigor. This study examines how course grades and course rigor are associated with math attainment among students with similar…

Proposing and Testing a Model to Explain Traits of Algebra Preparedness

ERIC Educational Resources Information Center

Venenciano, Linda; Heck, Ronald

2016-01-01

Early experiences with theoretical thinking and generalization in measurement are hypothesized to develop constructs we name here as logical reasoning and preparedness for algebra. Based on work of V. V. Davydov (1975), the Measure Up (MU) elementary grades experimental mathematics curriculum uses quantities of area, length, volume, and mass to…

Mathematics: Algebra and Geometry. GED Scoreboost.

ERIC Educational Resources Information Center

Hoyt, Cathy

GED "Scoreboost" materials target exactly the skills one needs to pass the General Educational Development (GED) tests. This book focuses on the GED Mathematics test. To prepare for the test, the test taker needs to learn skills in number and operation sense, data and statistics, geometry and measurement, and algebra. To pass the test,…

Filtrations on Springer fiber cohomology and Kostka polynomials

NASA Astrophysics Data System (ADS)

Bellamy, Gwyn; Schedler, Travis

2018-03-01

We prove a conjecture which expresses the bigraded Poisson-de Rham homology of the nilpotent cone of a semisimple Lie algebra in terms of the generalized (one-variable) Kostka polynomials, via a formula suggested by Lusztig. This allows us to construct a canonical family of filtrations on the flag variety cohomology, and hence on irreducible representations of the Weyl group, whose Hilbert series are given by the generalized Kostka polynomials. We deduce consequences for the cohomology of all Springer fibers. In particular, this computes the grading on the zeroth Poisson homology of all classical finite W-algebras, as well as the filtration on the zeroth Hochschild homology of all quantum finite W-algebras, and we generalize to all homology degrees. As a consequence, we deduce a conjecture of Proudfoot on symplectic duality, relating in type A the Poisson homology of Slodowy slices to the intersection cohomology of nilpotent orbit closures. In the last section, we give an analogue of our main theorem in the setting of mirabolic D-modules.

Learning coefficient of generalization error in Bayesian estimation and vandermonde matrix-type singularity.

PubMed

Aoyagi, Miki; Nagata, Kenji

2012-06-01

The term algebraic statistics arises from the study of probabilistic models and techniques for statistical inference using methods from algebra and geometry (Sturmfels, 2009 ). The purpose of our study is to consider the generalization error and stochastic complexity in learning theory by using the log-canonical threshold in algebraic geometry. Such thresholds correspond to the main term of the generalization error in Bayesian estimation, which is called a learning coefficient (Watanabe, 2001a , 2001b ). The learning coefficient serves to measure the learning efficiencies in hierarchical learning models. In this letter, we consider learning coefficients for Vandermonde matrix-type singularities, by using a new approach: focusing on the generators of the ideal, which defines singularities. We give tight new bound values of learning coefficients for the Vandermonde matrix-type singularities and the explicit values with certain conditions. By applying our results, we can show the learning coefficients of three-layered neural networks and normal mixture models.

Fuglede–Kadison determinant: theme and variations

PubMed Central

de la Harpe, Pierre

2013-01-01

We review the definition of determinants for finite von Neumann algebras, due to Fuglede and Kadison [Fuglede B, Kadison R (1952) Ann Math 55:520–530], and a generalization for appropriate groups of invertible elements in Banach algebras, from a paper by Skandalis and the author (1984). After some discussion of K-theory and Whitehead torsion, we indicate the relevance of these determinants to the study of -torsion in topology. Contents are as follows:1. The classical setting.2. On von Neumann algebras and traces.3. Fuglede–Kadison determinant for finite von Neumann algebras.4. Motivating question.5. Brief reminder of , , , and Bott periodicity.6. Revisiting the Fuglede–Kadison and other determinants.7. On Whitehead torsion.8. A few lines on -torsion. PMID:24082099

DOE Office of Scientific and Technical Information (OSTI.GOV)

Vourdas, A.

The finite set of subsystems of a finite quantum system with variables in Z(n), is studied as a Heyting algebra. The physical meaning of the logical connectives is discussed. It is shown that disjunction of subsystems is more general concept than superposition. Consequently, the quantum probabilities related to commuting projectors in the subsystems, are incompatible with associativity of the join in the Heyting algebra, unless if the variables belong to the same chain. This leads to contextuality, which in the present formalism has as contexts, the chains in the Heyting algebra. Logical Bell inequalities, which contain “Heyting factors,” are discussed.more » The formalism is also applied to the infinite set of all finite quantum systems, which is appropriately enlarged in order to become a complete Heyting algebra.« less

Evolution of canalizing Boolean networks

NASA Astrophysics Data System (ADS)

Szejka, A.; Drossel, B.

2007-04-01

Boolean networks with canalizing functions are used to model gene regulatory networks. In order to learn how such networks may behave under evolutionary forces, we simulate the evolution of a single Boolean network by means of an adaptive walk, which allows us to explore the fitness landscape. Mutations change the connections and the functions of the nodes. Our fitness criterion is the robustness of the dynamical attractors against small perturbations. We find that with this fitness criterion the global maximum is always reached and that there is a huge neutral space of 100% fitness. Furthermore, in spite of having such a high degree of robustness, the evolved networks still share many features with “chaotic” networks.

Circulant Matrices and Affine Equivalence of Monomial Rotation Symmetric Boolean Functions

DTIC Science & Technology

2015-01-01

definitions , including monomial rotation symmetric (MRS) Boolean functions and affine equivalence, and a known result for such quadratic functions...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

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

ERIC Educational Resources Information Center

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…

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

ERIC Educational Resources Information Center

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…

A Construction of Boolean Functions with Good Cryptographic Properties

DTIC Science & Technology

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

Therapeutic target discovery using Boolean network attractors: improvements of kali

PubMed Central

Guziolowski, Carito

2018-01-01

In a previous article, an algorithm for identifying therapeutic targets in Boolean networks modelling pathological mechanisms was introduced. In the present article, the improvements made on this algorithm, named kali, are described. These improvements are (i) the possibility to work on asynchronous Boolean networks, (ii) a finer assessment of therapeutic targets and (iii) the possibility to use multivalued logic. kali assumes that the attractors of a dynamical system, such as a Boolean network, are associated with the phenotypes of the modelled biological system. Given a logic-based model of pathological mechanisms, kali searches for therapeutic targets able to reduce the reachability of the attractors associated with pathological phenotypes, thus reducing their likeliness. kali is illustrated on an example network and used on a biological case study. The case study is a published logic-based model of bladder tumorigenesis from which kali returns consistent results. However, like any computational tool, kali can predict but cannot replace human expertise: it is a supporting tool for coping with the complexity of biological systems in the field of drug discovery. PMID:29515890

3D Boolean operations in virtual surgical planning.

PubMed

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.

Global identifiability of linear compartmental models--a computer algebra algorithm.

PubMed

Audoly, S; D'Angiò, L; Saccomani, M P; Cobelli, C

1998-01-01

A priori global identifiability deals with the uniqueness of the solution for the unknown parameters of a model and is, thus, a prerequisite for parameter estimation of biological dynamic models. Global identifiability is however difficult to test, since it requires solving a system of algebraic nonlinear equations which increases both in nonlinearity degree and number of terms and unknowns with increasing model order. In this paper, a computer algebra tool, GLOBI (GLOBal Identifiability) is presented, which combines the topological transfer function method with the Buchberger algorithm, to test global identifiability of linear compartmental models. GLOBI allows for the automatic testing of a priori global identifiability of general structure compartmental models from general multi input-multi output experiments. Examples of usage of GLOBI to analyze a priori global identifiability of some complex biological compartmental models are provided.

Real-Time Algebraic Derivative Estimations Using a Novel Low-Cost Architecture Based on Reconfigurable Logic

PubMed Central

Morales, Rafael; Rincón, Fernando; Gazzano, Julio Dondo; López, Juan Carlos

2014-01-01

Time derivative estimation of signals plays a very important role in several fields, such as signal processing and control engineering, just to name a few of them. For that purpose, a non-asymptotic algebraic procedure for the approximate estimation of the system states is used in this work. The method is based on results from differential algebra and furnishes some general formulae for the time derivatives of a measurable signal in which two algebraic derivative estimators run simultaneously, but in an overlapping fashion. The algebraic derivative algorithm presented in this paper is computed online and in real-time, offering high robustness properties with regard to corrupting noises, versatility and ease of implementation. Besides, in this work, we introduce a novel architecture to accelerate this algebraic derivative estimator using reconfigurable logic. The core of the algorithm is implemented in an FPGA, improving the speed of the system and achieving real-time performance. Finally, this work proposes a low-cost platform for the integration of hardware in the loop in MATLAB. PMID:24859033

Global exponential stability of octonion-valued neural networks with leakage delay and mixed delays.

PubMed

Popa, Călin-Adrian

2018-06-08

This paper discusses octonion-valued neural networks (OVNNs) with leakage delay, time-varying delays, and distributed delays, for which the states, weights, and activation functions belong to the normed division algebra of octonions. The octonion algebra is a nonassociative and noncommutative generalization of the complex and quaternion algebras, but does not belong to the category of Clifford algebras, which are associative. In order to avoid the nonassociativity of the octonion algebra and also the noncommutativity of the quaternion algebra, the Cayley-Dickson construction is used to decompose the OVNNs into 4 complex-valued systems. By using appropriate Lyapunov-Krasovskii functionals, with double and triple integral terms, the free weighting matrix method, and simple and double integral Jensen inequalities, delay-dependent criteria are established for the exponential stability of the considered OVNNs. The criteria are given in terms of complex-valued linear matrix inequalities, for two types of Lipschitz conditions which are assumed to be satisfied by the octonion-valued activation functions. Finally, two numerical examples illustrate the feasibility, effectiveness, and correctness of the theoretical results. Copyright © 2018 Elsevier Ltd. All rights reserved.

Symmetries and integrability of a fourth-order Euler-Bernoulli beam equation

NASA Astrophysics Data System (ADS)

Bokhari, Ashfaque H.; Mahomed, F. M.; Zaman, F. D.

2010-05-01

The complete symmetry group classification of the fourth-order Euler-Bernoulli ordinary differential equation, where the elastic modulus and the area moment of inertia are constants and the applied load is a function of the normal displacement, is obtained. We perform the Lie and Noether symmetry analysis of this problem. In the Lie analysis, the principal Lie algebra which is one dimensional extends in four cases, viz. the linear, exponential, general power law, and a negative fractional power law. It is further shown that two cases arise in the Noether classification with respect to the standard Lagrangian. That is, the linear case for which the Noether algebra dimension is one less than the Lie algebra dimension as well as the negative fractional power law. In the latter case the Noether algebra is three dimensional and is isomorphic to the Lie algebra which is sl(2,R). This exceptional case, although admitting the nonsolvable algebra sl(2,R), remarkably allows for a two-parameter family of exact solutions via the Noether integrals. The Lie reduction gives a second-order ordinary differential equation which has nonlocal symmetry.

Linear maps preserving maximal deviation and the Jordan structure of quantum systems

DOE Office of Scientific and Technical Information (OSTI.GOV)

Hamhalter, Jan

2012-12-15

In the algebraic approach to quantum theory, a quantum observable is given by an element of a Jordan algebra and a state of the system is modelled by a normalized positive functional on the underlying algebra. Maximal deviation of a quantum observable is the largest statistical deviation one can obtain in a particular state of the system. The main result of the paper shows that each linear bijective transformation between JBW algebras preserving maximal deviations is formed by a Jordan isomorphism or a minus Jordan isomorphism perturbed by a linear functional multiple of an identity. It shows that only onemore » numerical statistical characteristic has the power to determine the Jordan algebraic structure completely. As a consequence, we obtain that only very special maps can preserve the diameter of the spectra of elements. Nonlinear maps preserving the pseudometric given by maximal deviation are also described. The results generalize hitherto known theorems on preservers of maximal deviation in the case of self-adjoint parts of von Neumann algebras proved by Molnar.« less

Affine.m—Mathematica package for computations in representation theory of finite-dimensional and affine Lie algebras

NASA Astrophysics Data System (ADS)

Nazarov, Anton

2012-11-01

In this paper we present Affine.m-a program for computations in representation theory of finite-dimensional and affine Lie algebras and describe implemented algorithms. The algorithms are based on the properties of weights and Weyl symmetry. Computation of weight multiplicities in irreducible and Verma modules, branching of representations and tensor product decomposition are the most important problems for us. These problems have numerous applications in physics and we provide some examples of these applications. The program is implemented in the popular computer algebra system Mathematica and works with finite-dimensional and affine Lie algebras. Catalogue identifier: AENA_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AENB_v1_0.html Program obtainable from: CPC Program Library, Queen’s University, Belfast, UK Licensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.html No. of lines in distributed program, including test data, etc.: 24 844 No. of bytes in distributed program, including test data, etc.: 1 045 908 Distribution format: tar.gz Programming language: Mathematica. Computer: i386-i686, x86_64. Operating system: Linux, Windows, Mac OS, Solaris. RAM: 5-500 Mb Classification: 4.2, 5. Nature of problem: Representation theory of finite-dimensional Lie algebras has many applications in different branches of physics, including elementary particle physics, molecular physics, nuclear physics. Representations of affine Lie algebras appear in string theories and two-dimensional conformal field theory used for the description of critical phenomena in two-dimensional systems. Also Lie symmetries play a major role in a study of quantum integrable systems. Solution method: We work with weights and roots of finite-dimensional and affine Lie algebras and use Weyl symmetry extensively. Central problems which are the computations of weight multiplicities, branching and fusion coefficients are solved using one general recurrent algorithm based on generalization of Weyl character formula. We also offer alternative implementation based on the Freudenthal multiplicity formula which can be faster in some cases. Restrictions: Computational complexity grows fast with the rank of an algebra, so computations for algebras of ranks greater than 8 are not practical. Unusual features: We offer the possibility of using a traditional mathematical notation for the objects in representation theory of Lie algebras in computations if Affine.m is used in the Mathematica notebook interface. Running time: From seconds to days depending on the rank of the algebra and the complexity of the representation.

The structure and Gel'fand patterns inherent in the Heisenberg supergenerator algebra of dual Liouville-space ||kq{K-tilde.}(k1 - kn)[lambda- tilde],scriptn>> tensors and the Cayley algebra of scalar invariants over a (k1 - kn) field

NASA Astrophysics Data System (ADS)

Temme, F. P.

1991-06-01

For many-body spin cluster problems, dual-symmetry recoupled tensors over Liouville space provide suitable bases for a generalized torque formalism using the Sn-adapted density operator in which to discuss NMR and related techniques. The explicit structure of such tensors is considered in the context of the Cayley algebra of scalar invariants over a field, specified by the inner ki rank labels of the Tkq(kl-kn)s. The pertinence of both lexical combinatorial architectures over inner rank sets and SU2 propagative topologies in specifying the structure of dual recoupling tensors is considered in the context of the Sn partitional aspects of spin clusters. The form of Heisenberg superoperator generators whose algebra underlies the Gel'fand pattern algebra of SU(2) and SU(2)×Sn tensor bases over Liouville space is presented together with both the related s-boson algebras and a description of the associated {||2k 0>>} pattern sets of CF29H carrier space under the appropriate symmetry. These concepts are correlated with recent work on SU(2)×Sn induced symmetry hierarchies over Liouville spin space. The pertinence of this theoretical work to an understanding of multiquantum NMR in Liouville space formalisms is stressed in a discussion of the nature of pathways for intracluster J coupling, which also gives a valuable physical insight into the nature of coherence transfer in more general spin-1/2 systems.

Generalized Heisenberg Algebras, SUSYQM and Degeneracies: Infinite Well and Morse Potential

NASA Astrophysics Data System (ADS)

Hussin, Véronique; Marquette, Ian

2011-03-01

We consider classical and quantum one and two-dimensional systems with ladder operators that satisfy generalized Heisenberg algebras. In the classical case, this construction is related to the existence of closed trajectories. In particular, we apply these results to the infinite well and Morse potentials. We discuss how the degeneracies of the permutation symmetry of quantum two-dimensional systems can be explained using products of ladder operators. These products satisfy interesting commutation relations. The two-dimensional Morse quantum system is also related to a generalized two-dimensional Morse supersymmetric model. Arithmetical or accidental degeneracies of such system are shown to be associated to additional supersymmetry.

The logical primitives of thought: Empirical foundations for compositional cognitive models.

PubMed

Piantadosi, Steven T; Tenenbaum, Joshua B; Goodman, Noah D

2016-07-01

The notion of a compositional language of thought (LOT) has been central in computational accounts of cognition from earliest attempts (Boole, 1854; Fodor, 1975) to the present day (Feldman, 2000; Penn, Holyoak, & Povinelli, 2008; Fodor, 2008; Kemp, 2012; Goodman, Tenenbaum, & Gerstenberg, 2015). Recent modeling work shows how statistical inferences over compositionally structured hypothesis spaces might explain learning and development across a variety of domains. However, the primitive components of such representations are typically assumed a priori by modelers and theoreticians rather than determined empirically. We show how different sets of LOT primitives, embedded in a psychologically realistic approximate Bayesian inference framework, systematically predict distinct learning curves in rule-based concept learning experiments. We use this feature of LOT models to design a set of large-scale concept learning experiments that can determine the most likely primitives for psychological concepts involving Boolean connectives and quantification. Subjects' inferences are most consistent with a rich (nonminimal) set of Boolean operations, including first-order, but not second-order, quantification. Our results more generally show how specific LOT theories can be distinguished empirically. (PsycINFO Database Record (c) 2016 APA, all rights reserved).

Stability Depends on Positive Autoregulation in Boolean Gene Regulatory Networks

PubMed Central

Pinho, Ricardo; Garcia, Victor; Irimia, Manuel; Feldman, Marcus W.

2014-01-01

Network motifs have been identified as building blocks of regulatory networks, including gene regulatory networks (GRNs). The most basic motif, autoregulation, has been associated with bistability (when positive) and with homeostasis and robustness to noise (when negative), but its general importance in network behavior is poorly understood. Moreover, how specific autoregulatory motifs are selected during evolution and how this relates to robustness is largely unknown. Here, we used a class of GRN models, Boolean networks, to investigate the relationship between autoregulation and network stability and robustness under various conditions. We ran evolutionary simulation experiments for different models of selection, including mutation and recombination. Each generation simulated the development of a population of organisms modeled by GRNs. We found that stability and robustness positively correlate with autoregulation; in all investigated scenarios, stable networks had mostly positive autoregulation. Assuming biological networks correspond to stable networks, these results suggest that biological networks should often be dominated by positive autoregulatory loops. This seems to be the case for most studied eukaryotic transcription factor networks, including those in yeast, flies and mammals. PMID:25375153

Two classes of ODE models with switch-like behavior

PubMed Central

Just, Winfried; Korb, Mason; Elbert, Ben; Young, Todd

2013-01-01

In cases where the same real-world system can be modeled both by an ODE system ⅅ and a Boolean system 𝔹, it is of interest to identify conditions under which the two systems will be consistent, that is, will make qualitatively equivalent predictions. In this note we introduce two broad classes of relatively simple models that provide a convenient framework for studying such questions. In contrast to the widely known class of Glass networks, the right-hand sides of our ODEs are Lipschitz-continuous. We prove that if 𝔹 has certain structures, consistency between ⅅ and 𝔹 is implied by sufficient separation of time scales in one class of our models. Namely, if the trajectories of 𝔹 are “one-stepping” then we prove a strong form of consistency and if 𝔹 has a certain monotonicity property then there is a weaker consistency between ⅅ and 𝔹. These results appear to point to more general structure properties that favor consistency between ODE and Boolean models. PMID:24244061

Measuring Questions: Relevance and its Relation to Entropy

NASA Technical Reports Server (NTRS)

Knuth, Kevin H.

2004-01-01

The Boolean lattice of logical statements induces the free distributive lattice of questions. Inclusion on this lattice is based on whether one question answers another. Generalizing the zeta function of the question lattice leads to a valuation called relevance or bearing, which is a measure of the degree to which one question answers another. Richard Cox conjectured that this degree can be expressed as a generalized entropy. With the assistance of yet another important result from Janos Acz6l, I show that this is indeed the case; and that the resulting inquiry calculus is a natural generalization of information theory. This approach provides a new perspective of the Principle of Maximum Entropy.

Students' Use of Variables and Multiple Representations in Generalizing Functional Relationships Prior to Secondary School

ERIC Educational Resources Information Center

Wilkie, Karina J.

2016-01-01

Algebra has been explicit in many school curriculum programs from the early years but there are competing views on what content and approaches are appropriate for different levels of schooling. This study investigated 12-13-year-old Australian students' algebraic thinking in a hybrid environment of functional and equation-based approaches to…

Algebra: Level II, Unit 8, Lesson 1; Powers and Roots: Lesson 2; Geometry: Lesson 3; Number Series: Lesson 4. Advanced General Education Program. A High School Self-Study Program.

ERIC Educational Resources Information Center

Manpower Administration (DOL), Washington, DC. Job Corps.

This self-study program for high-school level contains lessons on: Algebra, Powers and Roots, Geometry, and Number Series. Each of the lessons concludes with a Mastery Test to be completed by the student. (DB)

Algebraic classification of Weyl anomalies in arbitrary dimensions.

PubMed

Boulanger, Nicolas

2007-06-29

Conformally invariant systems involving only dimensionless parameters are known to describe particle physics at very high energy. In the presence of an external gravitational field, the conformal symmetry may generalize to the Weyl invariance of classical massless field systems in interaction with gravity. In the quantum theory, the latter symmetry no longer survives: A Weyl anomaly appears. Anomalies are a cornerstone of quantum field theory, and, for the first time, a general, purely algebraic understanding of the universal structure of the Weyl anomalies is obtained, in arbitrary dimensions and independently of any regularization scheme.

Dual-scale topology optoelectronic processor.

PubMed

Marsden, G C; Krishnamoorthy, A V; Esener, S C; Lee, S H

1991-12-15

The dual-scale topology optoelectronic processor (D-STOP) is a parallel optoelectronic architecture for matrix algebraic processing. The architecture can be used for matrix-vector multiplication and two types of vector outer product. The computations are performed electronically, which allows multiplication and summation concepts in linear algebra to be generalized to various nonlinear or symbolic operations. This generalization permits the application of D-STOP to many computational problems. The architecture uses a minimum number of optical transmitters, which thereby reduces fabrication requirements while maintaining area-efficient electronics. The necessary optical interconnections are space invariant, minimizing space-bandwidth requirements.

Towards A Topological Framework for Integrating Semantic Information Sources

DOE Office of Scientific and Technical Information (OSTI.GOV)

Joslyn, Cliff A.; Hogan, Emilie A.; Robinson, Michael

2014-09-07

In this position paper we argue for the role that topological modeling principles can play in providing a framework for sensor integration. While used successfully in standard (quantitative) sensors, we are developing this methodology in new directions to make it appropriate specifically for semantic information sources, including keyterms, ontology terms, and other general Boolean, categorical, ordinal, and partially-ordered data types. We illustrate the basics of the methodology in an extended use case/example, and discuss path forward.

Interpolation of the Extended Boolean Retrieval Model.

ERIC Educational Resources Information Center

Zanger, Daniel Z.

2002-01-01

Presents an interpolation theorem for an extended Boolean information retrieval model. Results show that whenever two or more documents are similarly ranked at any two points for a query containing exactly two terms, then they are similarly ranked at all points in between; and that results can fail for queries with more than two terms. (Author/LRW)

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

ERIC Educational Resources Information Center

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…

Energy and criticality in random Boolean networks

NASA Astrophysics Data System (ADS)

Andrecut, M.; Kauffman, S. A.

2008-06-01

The central issue of the research on the Random Boolean Networks (RBNs) model is the characterization of the critical transition between ordered and chaotic phases. Here, we discuss an approach based on the ‘energy’ associated with the unsatisfiability of the Boolean functions in the RBNs model, which provides an upper bound estimation for the energy used in computation. We show that in the ordered phase the RBNs are in a ‘dissipative’ regime, performing mostly ‘downhill’ moves on the ‘energy’ landscape. Also, we show that in the disordered phase the RBNs have to ‘hillclimb’ on the ‘energy’ landscape in order to perform computation. The analytical results, obtained using Derrida's approximation method, are in complete agreement with numerical simulations.

Optical programmable Boolean logic unit.

PubMed

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 Dynamic Modeling Approaches to Study Plant Gene Regulatory Networks: Integration, Validation, and Prediction.

PubMed

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.

Analysis Tools for Interconnected Boolean Networks With Biological Applications.

PubMed

Chaves, Madalena; Tournier, Laurent

2018-01-01

Boolean networks with asynchronous updates are a class of logical models particularly well adapted to describe the dynamics of biological networks with uncertain measures. The state space of these models can be described by an asynchronous state transition graph, which represents all the possible exits from every single state, and gives a global image of all the possible trajectories of the system. In addition, the asynchronous state transition graph can be associated with an absorbing Markov chain, further providing a semi-quantitative framework where it becomes possible to compute probabilities for the different trajectories. For large networks, however, such direct analyses become computationally untractable, given the exponential dimension of the graph. Exploiting the general modularity of biological systems, we have introduced the novel concept of asymptotic graph , computed as an interconnection of several asynchronous transition graphs and recovering all asymptotic behaviors of a large interconnected system from the behavior of its smaller modules. From a modeling point of view, the interconnection of networks is very useful to address for instance the interplay between known biological modules and to test different hypotheses on the nature of their mutual regulatory links. This paper develops two new features of this general methodology: a quantitative dimension is added to the asymptotic graph, through the computation of relative probabilities for each final attractor and a companion cross-graph is introduced to complement the method on a theoretical point of view.

On superintegrable monopole systems

NASA Astrophysics Data System (ADS)

Fazlul Hoque, Md; Marquette, Ian; Zhang, Yao-Zhong

2018-02-01

Superintegrable systems with monopole interactions in flat and curved spaces have attracted much attention. For example, models in spaces with a Taub-NUT metric are well-known to admit the Kepler-type symmetries and provide non-trivial generalizations of the usual Kepler problems. In this paper, we overview new families of superintegrable Kepler, MIC-harmonic oscillator and deformed Kepler systems interacting with Yang-Coulomb monopoles in the flat and curved Taub-NUT spaces. We present their higher-order, algebraically independent integrals of motion via the direct and constructive approaches which prove the superintegrability of the models. The integrals form symmetry polynomial algebras of the systems with structure constants involving Casimir operators of certain Lie algebras. Such algebraic approaches provide a deeper understanding to the degeneracies of the energy spectra and connection between wave functions and differential equations and geometry.

Generic, Type-Safe and Object Oriented Computer Algebra Software

NASA Astrophysics Data System (ADS)

Kredel, Heinz; Jolly, Raphael

Advances in computer science, in particular object oriented programming, and software engineering have had little practical impact on computer algebra systems in the last 30 years. The software design of existing systems is still dominated by ad-hoc memory management, weakly typed algorithm libraries and proprietary domain specific interactive expression interpreters. We discuss a modular approach to computer algebra software: usage of state-of-the-art memory management and run-time systems (e.g. JVM) usage of strongly typed, generic, object oriented programming languages (e.g. Java) and usage of general purpose, dynamic interactive expression interpreters (e.g. Python) To illustrate the workability of this approach, we have implemented and studied computer algebra systems in Java and Scala. In this paper we report on the current state of this work by presenting new examples.

Optical systolic solutions of linear algebraic equations

NASA Technical Reports Server (NTRS)

Neuman, C. P.; Casasent, D.

1984-01-01

The philosophy and data encoding possible in systolic array optical processor (SAOP) were reviewed. The multitude of linear algebraic operations achievable on this architecture is examined. These operations include such linear algebraic algorithms as: matrix-decomposition, direct and indirect solutions, implicit and explicit methods for partial differential equations, eigenvalue and eigenvector calculations, and singular value decomposition. This architecture can be utilized to realize general techniques for solving matrix linear and nonlinear algebraic equations, least mean square error solutions, FIR filters, and nested-loop algorithms for control engineering applications. The data flow and pipelining of operations, design of parallel algorithms and flexible architectures, application of these architectures to computationally intensive physical problems, error source modeling of optical processors, and matching of the computational needs of practical engineering problems to the capabilities of optical processors are emphasized.

Diffeomorphism invariance and black hole entropy

NASA Astrophysics Data System (ADS)

Huang, Chao-Guang; Guo, Han-Ying; Wu, Xiaoning

2003-11-01

The Noether-charge and the Hamiltonian realizations for the diff(M) algebra in diffeomorphism-invariant gravitational theories without a cosmological constant in any dimension are studied in a covariant formalism. We analyze how the Hamiltonian functionals form the diff(M) algebra under the Poisson brackets and show how the Noether charges with respect to the diffeomorphism generated by the vector fields and their variations in n-dimensional general relativity form this algebra. The asymptotic behaviors of vector fields generating diffeomorphism of the manifold with boundaries are discussed. It is shown that the “central extension” for a large class of vector fields is always zero on the Killing horizon. We also check whether choosing the vector fields near the horizon may pick up the Virasoro algebra. The conclusion is unfortunately negative in any dimension.

Generalized -deformed correlation functions as spectral functions of hyperbolic geometry

NASA Astrophysics Data System (ADS)

Bonora, L.; Bytsenko, A. A.; Guimarães, M. E. X.

2014-08-01

We analyze the role of vertex operator algebra and 2d amplitudes from the point of view of the representation theory of infinite-dimensional Lie algebras, MacMahon and Ruelle functions. By definition p-dimensional MacMahon function, with , is the generating function of p-dimensional partitions of integers. These functions can be represented as amplitudes of a two-dimensional c = 1 CFT, and, as such, they can be generalized to . With some abuse of language we call the latter amplitudes generalized MacMahon functions. In this paper we show that generalized p-dimensional MacMahon functions can be rewritten in terms of Ruelle spectral functions, whose spectrum is encoded in the Patterson-Selberg function of three-dimensional hyperbolic geometry.

The smooth entropy formalism for von Neumann algebras

NASA Astrophysics Data System (ADS)

Berta, Mario; Furrer, Fabian; Scholz, Volkher B.

2016-01-01

We discuss information-theoretic concepts on infinite-dimensional quantum systems. In particular, we lift the smooth entropy formalism as introduced by Renner and collaborators for finite-dimensional systems to von Neumann algebras. For the smooth conditional min- and max-entropy, we recover similar characterizing properties and information-theoretic operational interpretations as in the finite-dimensional case. We generalize the entropic uncertainty relation with quantum side information of Tomamichel and Renner and discuss applications to quantum cryptography. In particular, we prove the possibility to perform privacy amplification and classical data compression with quantum side information modeled by a von Neumann algebra.

Weak Lie symmetry and extended Lie algebra

DOE Office of Scientific and Technical Information (OSTI.GOV)

Goenner, Hubert

2013-04-15

The concept of weak Lie motion (weak Lie symmetry) is introduced. Applications given exhibit a reduction of the usual symmetry, e.g., in the case of the rotation group. In this context, a particular generalization of Lie algebras is found ('extended Lie algebras') which turns out to be an involutive distribution or a simple example for a tangent Lie algebroid. Riemannian and Lorentz metrics can be introduced on such an algebroid through an extended Cartan-Killing form. Transformation groups from non-relativistic mechanics and quantum mechanics lead to such tangent Lie algebroids and to Lorentz geometries constructed on them (1-dimensional gravitational fields).

New Turaev braided group categories and weak (co)quasi-Turaev group coalgebras

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zhang, Xiaohui, E-mail: zxhhhhh@gmail.com; Wang, Shuanhong, E-mail: shuanhwang2002@yahoo.com

In order to construct a class of new braided crossed G-categories with nontrivial associativity and unit constraints, we study the G-graded monoidal category over a family of algebras (H{sub α}){sub α∈G} and introduce the notion of a weak (co)quasi-Turaev G-(co)algebra. Then we prove that the category of (co)representations of (co)quasitriangular weak (co)quasi-Turaev π-(co)algebras is exactly a braided crossed G-category. In fact, this (co)quasitriangular structure provides a solution to a generalized quantum Yang-Baxter type equation.

The smooth entropy formalism for von Neumann algebras

DOE Office of Scientific and Technical Information (OSTI.GOV)

Berta, Mario, E-mail: berta@caltech.edu; Furrer, Fabian, E-mail: furrer@eve.phys.s.u-tokyo.ac.jp; Scholz, Volkher B., E-mail: scholz@phys.ethz.ch

2016-01-15

We discuss information-theoretic concepts on infinite-dimensional quantum systems. In particular, we lift the smooth entropy formalism as introduced by Renner and collaborators for finite-dimensional systems to von Neumann algebras. For the smooth conditional min- and max-entropy, we recover similar characterizing properties and information-theoretic operational interpretations as in the finite-dimensional case. We generalize the entropic uncertainty relation with quantum side information of Tomamichel and Renner and discuss applications to quantum cryptography. In particular, we prove the possibility to perform privacy amplification and classical data compression with quantum side information modeled by a von Neumann algebra.

Complementary Reliability-Based Decodings of Binary Linear Block Codes

NASA Technical Reports Server (NTRS)

Fossorier, Marc P. C.; Lin, Shu

1997-01-01

This correspondence presents a hybrid reliability-based decoding algorithm which combines the reprocessing method based on the most reliable basis and a generalized Chase-type algebraic decoder based on the least reliable positions. It is shown that reprocessing with a simple additional algebraic decoding effort achieves significant coding gain. For long codes, the order of reprocessing required to achieve asymptotic optimum error performance is reduced by approximately 1/3. This significantly reduces the computational complexity, especially for long codes. Also, a more efficient criterion for stopping the decoding process is derived based on the knowledge of the algebraic decoding solution.

A systematic investigation of the link between rational number processing and algebra ability.

PubMed

Hurst, Michelle; Cordes, Sara

2018-02-01

Recent research suggests that fraction understanding is predictive of algebra ability; however, the relative contributions of various aspects of rational number knowledge are unclear. Furthermore, whether this relationship is notation-dependent or rather relies upon a general understanding of rational numbers (independent of notation) is an open question. In this study, college students completed a rational number magnitude task, procedural arithmetic tasks in fraction and decimal notation, and an algebra assessment. Using these tasks, we measured three different aspects of rational number ability in both fraction and decimal notation: (1) acuity of underlying magnitude representations, (2) fluency with which symbols are mapped to the underlying magnitudes, and (3) fluency with arithmetic procedures. Analyses reveal that when looking at the measures of magnitude understanding, the relationship between adults' rational number magnitude performance and algebra ability is dependent upon notation. However, once performance on arithmetic measures is included in the relationship, individual measures of magnitude understanding are no longer unique predictors of algebra performance. Furthermore, when including all measures simultaneously, results revealed that arithmetic fluency in both fraction and decimal notation each uniquely predicted algebra ability. Findings are the first to demonstrate a relationship between rational number understanding and algebra ability in adults while providing a clearer picture of the nature of this relationship. © 2017 The British Psychological Society.

Quantum Superalgebras at Roots of Unity and Topological Invariants of Three-manifolds

NASA Astrophysics Data System (ADS)

Blumen, Sacha C.

2006-01-01

The general method of Reshetikhin and Turaev is followed to develop topological invariants of closed, connected, orientable 3-manifolds from a new class of algebras called pseudo-modular Hopf algebras. Pseudo-modular Hopf algebras are a class of Z_2-graded ribbon Hopf algebras that generalise the concept of a modular Hopf algebra. The quantum superalgebra U_q(osp(1|2n)) over C is considered with q a primitive N^th root of unity for all integers N >= 3. For such a q, a certain left ideal I of U_q(osp(1|2n)) is also a two-sided Hopf ideal, and the quotient algebra U_q^(N)(osp(1|2n)) = U_q(osp(1|2n)) / I is a Z_2-graded ribbon Hopf algebra. For all n and all N >= 3, a finite collection of finite dimensional representations of U_q^(N)(osp(1|2n)) is defined. Each such representation of U_q^(N)(osp(1|2n)) is labelled by an integral dominant weight belonging to the truncated dominant Weyl chamber. Properties of these representations are considered: the quantum superdimension of each representation is calculated, each representation is shown to be self-dual, and more importantly, the decomposition of the tensor product of an arbitrary number of such representations is obtained for even N. It is proved that the quotient algebra U_q^(N)(osp(1|2n)), together with the set of finite dimensional representations discussed above, form a pseudo-modular Hopf algebra when N >= 6 is twice an odd number. Using this pseudo-modular Hopf algebra, we construct a topological invariant of 3-manifolds. This invariant is shown to be different to the topological invariants of 3-manifolds arising from quantum so(2n+1) at roots of unity.

Horizon fluffs: In the context of generalized minimal massive gravity

NASA Astrophysics Data System (ADS)

Setare, Mohammad Reza; Adami, Hamed

2018-02-01

We consider a metric which describes Bañados geometries and show that the considered metric is a solution of the generalized minimal massive gravity (GMMG) model. We consider the Killing vector field which preserves the form of the considered metric. Using the off-shell quasi-local approach we obtain the asymptotic conserved charges of the given solution. Similar to the Einstein gravity in the presence of negative cosmological constant, for the GMMG model, we also show that the algebra among the asymptotic conserved charges is isomorphic to two copies of the Virasoro algebra. Eventually, we find a relation between the algebra of the near-horizon and the asymptotic conserved charges. This relation shows that the main part of the horizon fluffs proposed by Afshar et al., Sheikh-Jabbari and Yavartanoo appear for generic black holes in the class of Bañados geometries in the context of the GMMG model.

Partition functions for heterotic WZW conformal field theories

NASA Astrophysics Data System (ADS)

Gannon, Terry

1993-08-01

Thus far in the search for, and classification of, "physical" modular invariant partition functions ΣN LRχ Lχ R∗ the attention has been focused on the symmetric case where the holomorphic and anti-holomorphic sectors, and hence the characters χLand χR, are associated with the same Kac-Moody algebras ĝL = ĝR and levels κ L = κ R. In this paper we consider the more general possibility where ( ĝL, κ L) may not equal ( ĝR, κ R). We discuss which choices of algebras and levels may correspond to well-defined conformal field theories, we find the "smallest" such heterotic (i.e. asymmetric) partition functions, and we give a method, generalizing the Roberts-Terao-Warner lattice method, for explicitly constructing many other modular invariants. We conclude the paper by proving that this new lattice method will succeed in generating all the heterotic partition functions, for all choices of algebras and levels.

Generating a New Higher-Dimensional Coupled Integrable Dispersionless System: Algebraic Structures, Bäcklund Transformation and Hidden Structural Symmetries

NASA Astrophysics Data System (ADS)

Souleymanou, Abbagari; Thomas, B. Bouetou; Timoleon, C. Kofane

2013-08-01

The prolongation structure methodologies of Wahlquist—Estabrook [H.D. Wahlquist and F.B. Estabrook, J. Math. Phys. 16 (1975) 1] for nonlinear differential equations are applied to a more general set of coupled integrable dispersionless system. Based on the obtained prolongation structure, a Lie-Algebra valued connection of a closed ideal of exterior differential forms related to the above system is constructed. A Lie-Algebra representation of some hidden structural symmetries of the previous system, its Bäcklund transformation using the Riccati form of the linear eigenvalue problem and their general corresponding Lax-representation are derived. In the wake of the previous results, we extend the above prolongation scheme to higher-dimensional systems from which a new (2 + 1)-dimensional coupled integrable dispersionless system is unveiled along with its inverse scattering formulation, which applications are straightforward in nonlinear optics where additional propagating dimension deserves some attention.

Affine q-deformed symmetry and the classical Yang-Baxter σ-model

NASA Astrophysics Data System (ADS)

Delduc, F.; Kameyama, T.; Magro, M.; Vicedo, B.

2017-03-01

The Yang-Baxter σ-model is an integrable deformation of the principal chiral model on a Lie group G. The deformation breaks the G × G symmetry to U(1)rank( G) × G. It is known that there exist non-local conserved charges which, together with the unbroken U(1)rank( G) local charges, form a Poisson algebra [InlineMediaObject not available: see fulltext.], which is the semiclassical limit of the quantum group {U}_q(g) , with g the Lie algebra of G. For a general Lie group G with rank( G) > 1, we extend the previous result by constructing local and non-local conserved charges satisfying all the defining relations of the infinite-dimensional Poisson algebra [InlineMediaObject not available: see fulltext.], the classical analogue of the quantum loop algebra {U}_q(Lg) , where Lg is the loop algebra of g. Quite unexpectedly, these defining relations are proved without encountering any ambiguity related to the non-ultralocality of this integrable σ-model.

Frobenius manifolds and Frobenius algebra-valued integrable systems

NASA Astrophysics Data System (ADS)

Strachan, Ian A. B.; Zuo, Dafeng

2017-06-01

The notion of integrability will often extend from systems with scalar-valued fields to systems with algebra-valued fields. In such extensions the properties of, and structures on, the algebra play a central role in ensuring integrability is preserved. In this paper, a new theory of Frobenius algebra-valued integrable systems is developed. This is achieved for systems derived from Frobenius manifolds by utilizing the theory of tensor products for such manifolds, as developed by Kaufmann (Int Math Res Not 19:929-952, 1996), Kontsevich and Manin (Inv Math 124: 313-339, 1996). By specializing this construction, using a fixed Frobenius algebra A, one can arrive at such a theory. More generally, one can apply the same idea to construct an A-valued topological quantum field theory. The Hamiltonian properties of two classes of integrable evolution equations are then studied: dispersionless and dispersive evolution equations. Application of these ideas are discussed, and as an example, an A-valued modified Camassa-Holm equation is constructed.

Does Watching "Do the Math" Affect Self-Efficacy and Achievement in Mathematics?

ERIC Educational Resources Information Center

Cavazos, Blanca Guadalupe

2014-01-01

"Do The Math," a 1-hour, live, educational television program provides on-air instruction in general math, geometry, pre-algebra and algebra to a target audience of 4th-12th graders. A team of math teachers also provides tutoring to students who call in for help with homework. The purpose of this study was to investigate whether watching…

Research on numerical algorithms for large space structures

NASA Technical Reports Server (NTRS)

Denman, E. D.

1982-01-01

Numerical algorithms for large space structures were investigated with particular emphasis on decoupling method for analysis and design. Numerous aspects of the analysis of large systems ranging from the algebraic theory to lambda matrices to identification algorithms were considered. A general treatment of the algebraic theory of lambda matrices is presented and the theory is applied to second order lambda matrices.

Math Ties: Problem Solving, Logic Teasers, and Math Puzzles All "Tied" To the Math Curriculum. Book B1.

ERIC Educational Resources Information Center

Santi, Terri

This book contains a classroom-tested approach to the teaching of problem solving to all students in Grades 6-8, regardless of ability. Information on problem solving in general is provided, then mathematical problems on logic, exponents, fractions, pre-algebra, algebra, geometry, number theory, set theory, ratio, proportion, percent, probability,…

Hidden algebra method (quasi-exact-solvability in quantum mechanics)

DOE Office of Scientific and Technical Information (OSTI.GOV)

Turbiner, A.

1996-02-01

A general introduction to quasi-exactly-solvable problems of quantum mechanics is presented. Main attention is given to multidimensional quasi-exactly-solvable and exactly-solvable Schroedinger operators. Exact-solvability of the Calogero and Sutherland {ital N}-body problems ass ociated with an existence of the hidden algebra {ital sl}{sub {ital N}} is discussed extensively. {copyright} {ital 1996 American Institute of Physics.}

Programmed First Course in Algebra, Revised Form H, Student's Text, Part I, Unit 60.

ERIC Educational Resources Information Center

Buck, R. Creighton; And Others

This is part one of a two-part SMSG Programed Algebra Text for high school students. The general plan of the course is to build upon the student's experience with arithmetic. The student is initially led to extract from his or her experience the fundamental properties of addition and multiplication. The text then introduces negative real numbers…

A site model for Pyrenean oak (Quercus pyrenaica) stands using a dynamic algebraic difference equation

Treesearch

Joao P. Carvalho; Bernard R. Parresol

2005-01-01

This paper presents a growth model for dominant-height and site-quality estimations for Pyrenean oak (Quercus pyrenaica Willd.) stands. The Bertalanffy–Richards function is used with the generalized algebraic difference approach to derive a dynamic site equation. This allows dominant-height and site-index estimations in a compatible way, using any...

Designing Networks that are Capable of Self-Healing and Adapting

DTIC Science & Technology

2017-04-01

from statistical mechanics, combinatorics, boolean networks, and numerical simulations, and inspired by design principles from biological networks, we... principles for self-healing networks, and applications, and construct an all-possible-paths model for network adaptation. 2015-11-16 UNIT CONVERSION...combinatorics, boolean networks, and numerical simulations, and inspired by design principles from biological networks, we will undertake the fol

Continuum limit and symmetries of the periodic gℓ(1|1) spin chain

NASA Astrophysics Data System (ADS)

Gainutdinov, A. M.; Read, N.; Saleur, H.

2013-06-01

This paper is the first in a series devoted to the study of logarithmic conformal field theories (LCFT) in the bulk. Building on earlier work in the boundary case, our general strategy consists in analyzing the algebraic properties of lattice regularizations (quantum spin chains) of these theories. In the boundary case, a crucial step was the identification of the space of states as a bimodule over the Temperley-Lieb (TL) algebra and the quantum group Uqsℓ(2). The extension of this analysis in the bulk case involves considerable difficulties, since the Uqsℓ(2) symmetry is partly lost, while the TL algebra is replaced by a much richer version (the Jones-Temperley-Lieb — JTL — algebra). Even the simplest case of the gℓ(1|1) spin chain — corresponding to the c=-2 symplectic fermions theory in the continuum limit — presents very rich aspects, which we will discuss in several papers. In this first work, we focus on the symmetries of the spin chain, that is, the centralizer of the JTL algebra in the alternating tensor product of the gℓ(1|1) fundamental representation and its dual. We prove that this centralizer is only a subalgebra of Uqsℓ(2) at q=i that we dub Uqoddsℓ(2). We then begin the analysis of the continuum limit of the JTL algebra: using general arguments about the regularization of the stress-energy tensor, we identify families of JTL elements going over to the Virasoro generators Ln,L in the continuum limit. We then discuss the sℓ(2) symmetry of the (continuum limit) symplectic fermions theory from the lattice and JTL point of view. The analysis of the spin chain as a bimodule over Uqoddsℓ(2) and JTLN is discussed in the second paper of this series.

Quantum theory of the generalised uncertainty principle

NASA Astrophysics Data System (ADS)

Bruneton, Jean-Philippe; Larena, Julien

2017-04-01

We extend significantly previous works on the Hilbert space representations of the generalized uncertainty principle (GUP) in 3 + 1 dimensions of the form [X_i,P_j] = i F_{ij} where F_{ij} = f({{P}}^2) δ _{ij} + g({{P}}^2) P_i P_j for any functions f. However, we restrict our study to the case of commuting X's. We focus in particular on the symmetries of the theory, and the minimal length that emerge in some cases. We first show that, at the algebraic level, there exists an unambiguous mapping between the GUP with a deformed quantum algebra and a quadratic Hamiltonian into a standard, Heisenberg algebra of operators and an aquadratic Hamiltonian, provided the boost sector of the symmetries is modified accordingly. The theory can also be mapped to a completely standard Quantum Mechanics with standard symmetries, but with momentum dependent position operators. Next, we investigate the Hilbert space representations of these algebraically equivalent models, and focus specifically on whether they exhibit a minimal length. We carry the functional analysis of the various operators involved, and show that the appearance of a minimal length critically depends on the relationship between the generators of translations and the physical momenta. In particular, because this relationship is preserved by the algebraic mapping presented in this paper, when a minimal length is present in the standard GUP, it is also present in the corresponding Aquadratic Hamiltonian formulation, despite the perfectly standard algebra of this model. In general, a minimal length requires bounded generators of translations, i.e. a specific kind of quantization of space, and this depends on the precise shape of the function f defined previously. This result provides an elegant and unambiguous classification of which universal quantum gravity corrections lead to the emergence of a minimal length.

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

NASA Astrophysics Data System (ADS)

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.

On the symmetries of integrability

DOE Office of Scientific and Technical Information (OSTI.GOV)

Bellon, M.; Maillard, J.M.; Viallet, C.

1992-06-01

In this paper the authors show that the Yang-Baxter equations for two-dimensional models admit as a group of symmetry the infinite discrete group A{sub 2}{sup (1)}. The existence of this symmetry explains the presence of a spectral parameter in the solutions of the equations. The authors show that similarly, for three-dimensional vertex models and the associated tetrahedron equations, there also exists an infinite discrete group of symmetry. Although generalizing naturally the previous one, it is a much bigger hyperbolic Coxeter group. The authors indicate how this symmetry can help to resolve the Yang-Baxter equations and their higher-dimensional generalizations and initiatemore » the study of three-dimensional vertex models. These symmetries are naturally represented as birational projective transformations. They may preserve non-trivial algebraic varieties, and lead to proper parametrizations of the models, be they integrable or not. The authors mention the relation existing between spin models and the Bose-Messner algebras of algebraic combinatorics. The authors' results also yield the generalization of the condition q{sup n} = 1 so often mentioned in the theory of quantum groups, when no q parameter is available.« less

Noncommutative Differential Geometry of Generalized Weyl Algebras

NASA Astrophysics Data System (ADS)

Brzeziński, Tomasz

2016-06-01

Elements of noncommutative differential geometry of Z-graded generalized Weyl algebras A(p;q) over the ring of polynomials in two variables and their zero-degree subalgebras B(p;q), which themselves are generalized Weyl algebras over the ring of polynomials in one variable, are discussed. In particular, three classes of skew derivations of A(p;q) are constructed, and three-dimensional first-order differential calculi induced by these derivations are described. The associated integrals are computed and it is shown that the dimension of the integral space coincides with the order of the defining polynomial p(z). It is proven that the restriction of these first-order differential calculi to the calculi on B(p;q) is isomorphic to the direct sum of degree 2 and degree -2 components of A(p;q). A Dirac operator for B(p;q) is constructed from a (strong) connection with respect to this differential calculus on the (free) spinor bimodule defined as the direct sum of degree 1 and degree -1 components of A(p;q). The real structure of KO-dimension two for this Dirac operator is also described.

Yang-Baxter maps, discrete integrable equations and quantum groups

NASA Astrophysics Data System (ADS)

Bazhanov, Vladimir V.; Sergeev, Sergey M.

2018-01-01

For every quantized Lie algebra there exists a map from the tensor square of the algebra to itself, which by construction satisfies the set-theoretic Yang-Baxter equation. This map allows one to define an integrable discrete quantum evolution system on quadrilateral lattices, where local degrees of freedom (dynamical variables) take values in a tensor power of the quantized Lie algebra. The corresponding equations of motion admit the zero curvature representation. The commuting Integrals of Motion are defined in the standard way via the Quantum Inverse Problem Method, utilizing Baxter's famous commuting transfer matrix approach. All elements of the above construction have a meaningful quasi-classical limit. As a result one obtains an integrable discrete Hamiltonian evolution system, where the local equation of motion are determined by a classical Yang-Baxter map and the action functional is determined by the quasi-classical asymptotics of the universal R-matrix of the underlying quantum algebra. In this paper we present detailed considerations of the above scheme on the example of the algebra Uq (sl (2)) leading to discrete Liouville equations, however the approach is rather general and can be applied to any quantized Lie algebra.

Implementing neural nets with programmable logic

NASA Technical Reports Server (NTRS)

Vidal, Jacques J.

1988-01-01

Networks of Boolean programmable logic modules are presented as one purely digital class of artificial neural nets. The approach contrasts with the continuous analog framework usually suggested. Programmable logic networks are capable of handling many neural-net applications. They avoid some of the limitations of threshold logic networks and present distinct opportunities. The network nodes are called dynamically programmable logic modules. They can be implemented with digitally controlled demultiplexers. Each node performs a Boolean function of its inputs which can be dynamically assigned. The overall network is therefore a combinational circuit and its outputs are Boolean global functions of the network's input variables. The approach offers definite advantages for VLSI implementation, namely, a regular architecture with limited connectivity, simplicity of the control machinery, natural modularity, and the support of a mature technology.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Rivera-Durón, R. R., E-mail: roberto.rivera@ipicyt.edu.mx; Campos-Cantón, E., E-mail: eric.campos@ipicyt.edu.mx; Campos-Cantón, I.

We present the design of an autonomous time-delay Boolean network realized with readily available electronic components. Through simulations and experiments that account for the detailed nonlinear response of each circuit element, we demonstrate that a network with five Boolean nodes displays complex behavior. Furthermore, we show that the dynamics of two identical networks display near-instantaneous synchronization to a periodic state when forced by a common periodic Boolean signal. A theoretical analysis of the network reveals the conditions under which complex behavior is expected in an individual network and the occurrence of synchronization in the forced networks. This research will enablemore » future experiments on autonomous time-delay networks using readily available electronic components with dynamics on a slow enough time-scale so that inexpensive data collection systems can faithfully record the dynamics.« less

Stabilizing Motifs in Autonomous Boolean Networks and the Yeast Cell Cycle Oscillator

NASA Astrophysics Data System (ADS)

Sevim, Volkan; Gong, Xinwei; Socolar, Joshua

2009-03-01

Synchronously updated Boolean networks are widely used to model gene regulation. Some properties of these model networks are known to be artifacts of the clocking in the update scheme. Autonomous updating is a less artificial scheme that allows one to introduce small timing perturbations and study stability of the attractors. We argue that the stabilization of a limit cycle in an autonomous Boolean network requires a combination of motifs such as feed-forward loops and auto-repressive links that can correct small fluctuations in the timing of switching events. A recently published model of the transcriptional cell-cycle oscillator in yeast contains the motifs necessary for stability under autonomous updating [1]. [1] D. A. Orlando, et al. Nature (London), 4530 (7197):0 944--947, 2008.

Modular invariant representations of infinite-dimensional Lie algebras and superalgebras

PubMed Central

Kac, Victor G.; Wakimoto, Minoru

1988-01-01

In this paper, we launch a program to describe and classify modular invariant representations of infinite-dimensional Lie algebras and superalgebras. We prove a character formula for a large class of highest weight representations L(λ) of a Kac-Moody algebra [unk] with a symmetrizable Cartan matrix, generalizing the Weyl-Kac character formula [Kac, V. G. (1974) Funct. Anal. Appl. 8, 68-70]. In the case of an affine [unk], this class includes modular invariant representations of arbitrary rational level m = t/u, where t [unk] Z and u [unk] N are relatively prime and m + g ≥ g/u (g is the dual Coxeter number). We write the characters of these representations in terms of theta functions and calculate their asymptotics, generalizing the results of Kac and Peterson [Kac, V. G. & Peterson, D. H. (1984) Adv. Math. 53, 125-264] and of Kac and Wakimoto [Kac, V. G. & Wakimoto, M. (1988) Adv. Math. 70, 156-234] for the u = 1 (integrable) case. We work out in detail the case [unk] = A1(1), in particular classifying all its modular invariant representations. Furthermore, we show that the modular invariant representations of the Virasoro algebra Vir are precisely the “minimal series” of Belavin et al. [Belavin, A. A., Polyakov, A. M. & Zamolodchikov, A. B. (1984) Nucl. Phys. B 241, 333-380] using the character formulas of Feigin and Fuchs [Feigin, B. L. & Fuchs, D. B. (1984) Lect. Notes Math. 1060, 230-245]. We show that tensoring the basic representation and modular invariant representations of A1(1) produces all modular invariant representations of Vir generalizing the results of Goddard et al. [Goddard P., Kent, A. & Olive, D. (1986) Commun. Math. Phys. 103, 105-119] and of Kac and Wakimoto [Kac, V. G. & Wakimoto, M. (1986) Lect. Notes Phys. 261, 345-371] in the unitary case. We study the general branching functions as well. All these results are generalized to the Kac-Moody superalgebras introduced by Kac [Kac, V. G. (1978) Adv. Math. 30, 85-136] and to N = 1 super Virasoro algebras. We work out in detail the case of the superalgebra B(0, 1)(1), showing, in particular, that restricting to its even part produces again all modular invariant representations of Vir. These results lead to general conjectures about asymptotic behavior of positive energy representations and classification of modular invariant representations. PMID:16593954

Elucidation of covariant proofs in general relativity: example of the use of algebraic software in the shear-free conjecture in MAPLE

NASA Astrophysics Data System (ADS)

Huf, P. A.; Carminati, J.

2018-01-01

In this paper we explore the use of a new algebraic software package in providing independent covariant proof of a conjecture in general relativity. We examine the proof of two sub-cases of the shear-free conjecture σ =0 => ω Θ =0 by Senovilla et al. (Gen. Relativ. Gravit 30:389-411, 1998): case 1: for dust; case 2: for acceleration parallel to vorticity. We use TensorPack, a software package recently released for the Maple environment. In this paper, we briefly summarise the key features of the software and then demonstrate its use by providing and discussing examples of independent proofs of the paper in question. A full set of our completed proofs is available online at http://www.bach2roq.com/science/maths/GR/ShearFreeProofs.html. We are in agreeance with the equations provided in the original paper, noting that the proofs often require many steps. Furthermore, in our proofs we provide fully worked algebraic steps in such a way that the proofs can be examined systematically, and avoiding hand calculation. It is hoped that the elucidated proofs may be of use to other researchers in verifying the algebraic consistency of the expressions in the paper in question, as well as related literature. Furthermore we suggest that the appropriate use of algebraic software in covariant formalism could be useful for developing research and teaching in GR theory.

Perturbative computation in a generalized quantum field theory

NASA Astrophysics Data System (ADS)

Bezerra, V. B.; Curado, E. M.; Rego-Monteiro, M. A.

2002-10-01

We consider a quantum field theory that creates at any point of the space-time particles described by a q-deformed Heisenberg algebra which is interpreted as a phenomenological quantum theory describing the scattering of spin-0 composed particles. We discuss the generalization of Wick's expansion for this case and we compute perturbatively the scattering 1+2-->1'+2' to second order in the coupling constant. The result we find shows that the structure of a composed particle, described here phenomenologically by the deformed algebraic structure, can modify in a simple but nontrivial way the perturbation expansion for the process under consideration.

D=10 Chiral Tensionless Super p-BRANES

NASA Astrophysics Data System (ADS)

Bozhilov, P.

We consider a model for tensionless (null) super-p-branes with N chiral supersymmetries in ten-dimensional flat space-time. After establishing the symmetries of the action, we give the general solution of the classical equations of motion in a particular gauge. In the case of a null superstring (p=1) we find the general solution in an arbitrary gauge. Then, using a harmonic superspace approach, the initial algebra of first- and second-class constraints is converted into an algebra of Lorentz-covariant, BFV-irreducible, first-class constraints only. The corresponding BRST charge is as for a first rank dynamical system.

Reducing Communication in Algebraic Multigrid Using Additive Variants

DOE Office of Scientific and Technical Information (OSTI.GOV)

Vassilevski, Panayot S.; Yang, Ulrike Meier

Algebraic multigrid (AMG) has proven to be an effective scalable solver on many high performance computers. However, its increasing communication complexity on coarser levels has shown to seriously impact its performance on computers with high communication cost. Moreover, additive AMG variants provide not only increased parallelism as well as decreased numbers of messages per cycle but also generally exhibit slower convergence. Here we present various new additive variants with convergence rates that are significantly improved compared to the classical additive algebraic multigrid method and investigate their potential for decreased communication, and improved communication-computation overlap, features that are essential for goodmore » performance on future exascale architectures.« less

Reducing Communication in Algebraic Multigrid Using Additive Variants

DOE PAGES

Vassilevski, Panayot S.; Yang, Ulrike Meier

2014-02-12

Algebraic multigrid (AMG) has proven to be an effective scalable solver on many high performance computers. However, its increasing communication complexity on coarser levels has shown to seriously impact its performance on computers with high communication cost. Moreover, additive AMG variants provide not only increased parallelism as well as decreased numbers of messages per cycle but also generally exhibit slower convergence. Here we present various new additive variants with convergence rates that are significantly improved compared to the classical additive algebraic multigrid method and investigate their potential for decreased communication, and improved communication-computation overlap, features that are essential for goodmore » performance on future exascale architectures.« less

Bv and Bfv Formulation of a Gauge Theory of Quadratic Lie Algebras in 2d and a Construction of W3 Topological Gravity

NASA Astrophysics Data System (ADS)

Dayi, Ömer F.

The recently proposed generalized field method for solving the master equation of Batalin and Vilkovisky is applied to a gauge theory of quadratic Lie algebras in two dimensions. The charge corresponding to BRST symmetry derived from this solution in terms of the phase space variables by using the Noether procedure, and the one found due to the BFV-method are compared and found to coincide. W3-algebra, formulated in terms of a continuous variable is exploit in the mentioned gauge theory to construct a W3 topological gravity. Moreover, its gauge fixing is briefly discussed.

Interactive Web-based tutorials for teaching digital electronics

NASA Astrophysics Data System (ADS)

Bailey, Donald G.

2000-10-01

With a wide range of student abilities in a class, it is difficult to effectively teach and stimulate all students. A series of web based tutorials was designed to help weaker students and stretch the stronger students. The tutorials consist of a series of HTML web pages with embedded Java applets. This combination is particularly powerful for providing interactive demonstrations because any textual content may be easily provided within the web page. The applet is able to be a compete working program that dynamically illustrates the concept, or provides a working environment for the student to experiment and work through their solution. The applet is dynamic, and responds to the student through both mouse clicks and keyboard entry. These allow the student to adjust parameters, make selections, and affect the way the program is run or information is displayed. Such interaction allows each applet to provide a mini demonstration or experiment to help the student understand a particular concept or technique. The approach taken is illustrated with a tutorial that dynamically shows the relationships between a truth table, Karnaugh amp, logic circuit and Boolean algebra representations of a logic function, and dramatically illustrates the effect of minimization on the resultant circuit. Use of the tutorial has resulted in significant benefits, particularly with weaker students.

Topological methods for the comparison of structures using LDR-brachytherapy of the prostate as an example.

PubMed

Schiefer, H; von Toggenburg, F; Seelentag, W W; Plasswilm, L; Ries, G; Schmid, H-P; Leippold, T; Krusche, B; Roth, J; Engeler, D

2009-08-21

The dose coverage of low dose rate (LDR)-brachytherapy for localized prostate cancer is monitored 4-6 weeks after intervention by contouring the prostate on computed tomography and/or magnetic resonance imaging sets. Dose parameters for the prostate (V100, D90 and D80) provide information on the treatment quality. Those depend strongly on the delineation of the prostate contours. We therefore systematically investigated the contouring process for 21 patients with five examiners. The prostate structures were compared with one another using topological procedures based on Boolean algebra. The coincidence number C(V) measures the agreement between a set of structures. The mutual coincidence C(i, j) measures the agreement between two structures i and j, and the mean coincidence C(i) compares a selected structure i with the remaining structures in a set. All coincidence parameters have a value of 1 for complete coincidence of contouring and 0 for complete absence. The five patients with the lowest C(V) values were discussed, and rules for contouring the prostate have been formulated. The contouring and assessment were repeated after 3 months for the same five patients. All coincidence parameters have been improved after instruction. This shows objectively that training resulted in more consistent contouring across examiners.

Contribution of sublinear and supralinear dendritic integration to neuronal computations

PubMed Central

Tran-Van-Minh, Alexandra; Cazé, Romain D.; Abrahamsson, Therése; Cathala, Laurence; Gutkin, Boris S.; DiGregorio, David A.

2015-01-01

Nonlinear dendritic integration is thought to increase the computational ability of neurons. Most studies focus on how supralinear summation of excitatory synaptic responses arising from clustered inputs within single dendrites result in the enhancement of neuronal firing, enabling simple computations such as feature detection. Recent reports have shown that sublinear summation is also a prominent dendritic operation, extending the range of subthreshold input-output (sI/O) transformations conferred by dendrites. Like supralinear operations, sublinear dendritic operations also increase the repertoire of neuronal computations, but feature extraction requires different synaptic connectivity strategies for each of these operations. In this article we will review the experimental and theoretical findings describing the biophysical determinants of the three primary classes of dendritic operations: linear, sublinear, and supralinear. We then review a Boolean algebra-based analysis of simplified neuron models, which provides insight into how dendritic operations influence neuronal computations. We highlight how neuronal computations are critically dependent on the interplay of dendritic properties (morphology and voltage-gated channel expression), spiking threshold and distribution of synaptic inputs carrying particular sensory features. Finally, we describe how global (scattered) and local (clustered) integration strategies permit the implementation of similar classes of computations, one example being the object feature binding problem. PMID:25852470

Derailment-based Fault Tree Analysis on Risk Management of Railway Turnout Systems

NASA Astrophysics Data System (ADS)

Dindar, Serdar; Kaewunruen, Sakdirat; An, Min; Gigante-Barrera, Ángel

2017-10-01

Railway turnouts are fundamental mechanical infrastructures, which allow a rolling stock to divert one direction to another. As those are of a large number of engineering subsystems, e.g. track, signalling, earthworks, these particular sub-systems are expected to induce high potential through various kind of failure mechanisms. This could be a cause of any catastrophic event. A derailment, one of undesirable events in railway operation, often results, albeit rare occurs, in damaging to rolling stock, railway infrastructure and disrupt service, and has the potential to cause casualties and even loss of lives. As a result, it is quite significant that a well-designed risk analysis is performed to create awareness of hazards and to identify what parts of the systems may be at risk. This study will focus on all types of environment based failures as a result of numerous contributing factors noted officially as accident reports. This risk analysis is designed to help industry to minimise the occurrence of accidents at railway turnouts. The methodology of the study relies on accurate assessment of derailment likelihood, and is based on statistical multiple factors-integrated accident rate analysis. The study is prepared in the way of establishing product risks and faults, and showing the impact of potential process by Boolean algebra.

Symmetry-preserving perturbations of the Bateman Lagrangian and dissipative systems

NASA Astrophysics Data System (ADS)

Campoamor-Stursberg, Rutwig

2017-03-01

Perturbations of the classical Bateman Lagrangian preserving a certain subalgebra of Noether symmetries are studied, and conservative perturbations are characterized by the Lie algebra sl(2, ℝ) ⊕ so(2). Non-conservative albeit integrable perturbations are determined by the simple Lie algebra sl(2,ℝ), showing further the relation of the corresponding non-linear systems with the notion of generalized Ermakov systems.

Gordan—Capelli series in superalgebras

PubMed Central

Brini, Andrea; Palareti, Aldopaolo; Teolis, Antonio G. B.

1988-01-01

We derive two Gordan—Capelli series for the supersymmetric algebra of the tensor product of two [unk]2-graded [unk]-vector spaces U and V, being [unk] a field of characteristic zero. These expansions yield complete decompositions of the supersymmetric algebra regarded as a pl(U)- and a pl(V)- module, where pl(U) and pl(V) are the general linear Lie superalgebras of U and V, respectively. PMID:16593911

Fast multipole method using Cartesian tensor in beam dynamic simulation

DOE PAGES

Zhang, He; Huang, He; Li, Rui; ...

2017-03-06

Here, the fast multipole method (FMM) using traceless totally symmetric Cartesian tensor to calculate the Coulomb interaction between charged particles will be presented. The Cartesian tensor-based FMM can be generalized to treat other non-oscillating interactions with the help of the differential algebra or the truncated power series algebra. Issues on implementation of the FMM in beam dynamic simulations are also discussed.

Parallel Element Agglomeration Algebraic Multigrid and Upscaling Library

DOE Office of Scientific and Technical Information (OSTI.GOV)

Barker, Andrew T.; Benson, Thomas R.; Lee, Chak Shing

ParELAG is a parallel C++ library for numerical upscaling of finite element discretizations and element-based algebraic multigrid solvers. It provides optimal complexity algorithms to build multilevel hierarchies and solvers that can be used for solving a wide class of partial differential equations (elliptic, hyperbolic, saddle point problems) on general unstructured meshes. Additionally, a novel multilevel solver for saddle point problems with divergence constraint is implemented.

Symmetry-preserving perturbations of the Bateman Lagrangian and dissipative systems

DOE Office of Scientific and Technical Information (OSTI.GOV)

Campoamor-Stursberg, Rutwig, E-mail: rutwig@ucm.es

Perturbations of the classical Bateman Lagrangian preserving a certain subalgebra of Noether symmetries are studied, and conservative perturbations are characterized by the Lie algebra sl(2, ℝ) ⊕ so(2). Non-conservative albeit integrable perturbations are determined by the simple Lie algebra sl(2,ℝ), showing further the relation of the corresponding non-linear systems with the notion of generalized Ermakov systems.

The Effect of Using the TI-92 on Basic College Algebra Students' Ability To Solve Word Problems.

ERIC Educational Resources Information Center

Runde, Dennis C.

As part of an effort to improve community college algebra students' ability to solve word problems, a study was undertaken at Florida's Manatee Community College to determine the effects of using heuristic instruction (i.e., providing general rules for solving different types of math problems) in combination with the TI-92 calculator. The TI-92…

Towards Symbolic Model Checking for Multi-Agent Systems via OBDDs

NASA Technical Reports Server (NTRS)

Raimondi, Franco; Lomunscio, Alessio

2004-01-01

We present an algorithm for model checking temporal-epistemic properties of multi-agent systems, expressed in the formalism of interpreted systems. We first introduce a technique for the translation of interpreted systems into boolean formulae, and then present a model-checking algorithm based on this translation. The algorithm is based on OBDD's, as they offer a compact and efficient representation for boolean formulae.

Algebraic reasoning and bat-and-ball problem variants: Solving isomorphic algebra first facilitates problem solving later.

PubMed

Hoover, Jerome D; Healy, Alice F

2017-12-01

The classic bat-and-ball problem is used widely to measure biased and correct reasoning in decision-making. University students overwhelmingly tend to provide the biased answer to this problem. To what extent might reasoners be led to modify their judgement, and, more specifically, is it possible to facilitate problem solution by prompting participants to consider the problem from an algebraic perspective? One hundred ninety-seven participants were recruited to investigate the effect of algebraic cueing as a debiasing strategy on variants of the bat-and-ball problem. Participants who were cued to consider the problem algebraically were significantly more likely to answer correctly relative to control participants. Most of this cueing effect was confined to a condition that required participants to solve isomorphic algebra equations corresponding to the structure of bat-and-ball question types. On a subsequent critical question with differing item and dollar amounts presented without a cue, participants were able to generalize the learned information to significantly reduce overall bias. Math anxiety was also found to be significantly related to bat-and-ball problem accuracy. These results suggest that, under specific conditions, algebraic reasoning is an effective debiasing strategy on bat-and-ball problem variants, and provide the first documented evidence for the influence of math anxiety on Cognitive Reflection Test performance.

A novel technique to solve nonlinear higher-index Hessenberg differential-algebraic equations by Adomian decomposition method.

PubMed

Benhammouda, Brahim

2016-01-01

Since 1980, the Adomian decomposition method (ADM) has been extensively used as a simple powerful tool that applies directly to solve different kinds of nonlinear equations including functional, differential, integro-differential and algebraic equations. However, for differential-algebraic equations (DAEs) the ADM is applied only in four earlier works. There, the DAEs are first pre-processed by some transformations like index reductions before applying the ADM. The drawback of such transformations is that they can involve complex algorithms, can be computationally expensive and may lead to non-physical solutions. The purpose of this paper is to propose a novel technique that applies the ADM directly to solve a class of nonlinear higher-index Hessenberg DAEs systems efficiently. The main advantage of this technique is that; firstly it avoids complex transformations like index reductions and leads to a simple general algorithm. Secondly, it reduces the computational work by solving only linear algebraic systems with a constant coefficient matrix at each iteration, except for the first iteration where the algebraic system is nonlinear (if the DAE is nonlinear with respect to the algebraic variable). To demonstrate the effectiveness of the proposed technique, we apply it to a nonlinear index-three Hessenberg DAEs system with nonlinear algebraic constraints. This technique is straightforward and can be programmed in Maple or Mathematica to simulate real application problems.

Finding Coefficients of the Full Array of Motion-Independent N-Body Potentials of Metric Gravity from Gravity's Exterior and Interior Effacement Algebra

NASA Astrophysics Data System (ADS)

Nordtvedt, Kenneth

2018-01-01

In the author's previous publications, a recursive linear algebraic method was introduced for obtaining (without gravitational radiation) the full potential expansions for the gravitational metric field components and the Lagrangian for a general N-body system. Two apparent properties of gravity— Exterior Effacement and Interior Effacement—were defined and fully enforced to obtain the recursive algebra, especially for the motion-independent potential expansions of the general N-body situation. The linear algebraic equations of this method determine the potential coefficients at any order n of the expansions in terms of the lower-order coefficients. Then, enforcing Exterior and Interior Effacement on a selecedt few potential series of the full motion-independent potential expansions, the complete exterior metric field for a single, spherically-symmetric mass source was obtained, producing the Schwarzschild metric field of general relativity. In this fourth paper of this series, the complete spatial metric's motion-independent potentials for N bodies are obtained using enforcement of Interior Effacement and knowledge of the Schwarzschild potentials. From the full spatial metric, the complete set of temporal metric potentials and Lagrangian potentials in the motion-independent case can then be found by transfer equations among the coefficients κ( n, α) → λ( n, ɛ) → ξ( n, α) with κ( n, α), λ( n, ɛ), ξ( n, α) being the numerical coefficients in the spatial metric, the Lagrangian, and the temporal metric potential expansions, respectively.

The computational core and fixed point organization in Boolean networks

NASA Astrophysics Data System (ADS)

Correale, L.; Leone, M.; Pagnani, A.; Weigt, M.; Zecchina, R.

2006-03-01

In this paper, we analyse large random Boolean networks in terms of a constraint satisfaction problem. We first develop an algorithmic scheme which allows us to prune simple logical cascades and underdetermined variables, returning thereby the computational core of the network. Second, we apply the cavity method to analyse the number and organization of fixed points. We find in particular a phase transition between an easy and a complex regulatory phase, the latter being characterized by the existence of an exponential number of macroscopically separated fixed point clusters. The different techniques developed are reinterpreted as algorithms for the analysis of single Boolean networks, and they are applied in the analysis of and in silico experiments on the gene regulatory networks of baker's yeast (Saccharomyces cerevisiae) and the segment-polarity genes of the fruitfly Drosophila melanogaster.

Boolean network representation of contagion dynamics during a financial crisis

NASA Astrophysics Data System (ADS)

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.

Reformulation of the symmetries of first-order general relativity

NASA Astrophysics Data System (ADS)

Montesinos, Merced; González, Diego; Celada, Mariano; Díaz, Bogar

2017-10-01

We report a new internal gauge symmetry of the n-dimensional Palatini action with cosmological term (n>3 ) that is the generalization of three-dimensional local translations. This symmetry is obtained through the direct application of the converse of Noether’s second theorem on the theory under consideration. We show that diffeomorphisms can be expressed as linear combinations of it and local Lorentz transformations with field-dependent parameters up to terms involving the variational derivatives of the action. As a result, the new internal symmetry together with local Lorentz transformations can be adopted as the fundamental gauge symmetries of general relativity. Although their gauge algebra is open in general, it allows us to recover, without resorting to the equations of motion, the very well-known Lie algebra satisfied by translations and Lorentz transformations in three dimensions. We also report the analog of the new gauge symmetry for the Holst action with cosmological term, finding that it explicitly depends on the Immirzi parameter. The same result concerning its relation to diffeomorphisms and the open character of the gauge algebra also hold in this case. Finally, we consider the non-minimal coupling of a scalar field to gravity in n dimensions and establish that the new gauge symmetry is affected by this matter field. Our results indicate that general relativity in dimension greater than three can be thought of as a gauge theory.

Connections between Kac-Moody algebras and M-theory

NASA Astrophysics Data System (ADS)

Cook, Paul P.

2007-11-01

We investigate some of the motivations and consequences of the conjecture that the Kac-Moody algebra E11 is the symmetry algebra of M-theory, and we develop methods to aid the further investigation of this idea. The definitions required to work with abstract root systems of Lie algebras are given in review leading up to the definition of a Kac-Moody algebra. The motivations for the E11 conjecture are presented and the nonlinear realisation of gravity relevant to the conjecture is described. We give a beginner's guide to producing the algebras of E11, relevant to M-theory, and K27, relevant to the bosonic string theory, along with their l1 representations are constructed. Reference tables of low level roots are produced for both the adjoint and l1 representations of these algebras. In addition a particular group element, having a generic form for all G+++ algebras, is shown to encode all the half-BPS brane solutions of the maximally oxidised supergravities. Special analysis is given to the role of space-time signature in the context of this group element and subsequent to this analysis spacelike brane solutions are derived from the same solution generating group element. Finally the appearance of U-duality charge multiplets from E11 is reviewed. General formulae for finding the content of arbitrary brane charge multiplets are given and the content of the particle and string multiplets in dimensions 4,5,6,7 and 8 is shown to be contained in the l1 representation of E11.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Guedes, Carlos; Oriti, Daniele; Raasakka, Matti

The phase space given by the cotangent bundle of a Lie group appears in the context of several models for physical systems. A representation for the quantum system in terms of non-commutative functions on the (dual) Lie algebra, and a generalized notion of (non-commutative) Fourier transform, different from standard harmonic analysis, has been recently developed, and found several applications, especially in the quantum gravity literature. We show that this algebra representation can be defined on the sole basis of a quantization map of the classical Poisson algebra, and identify the conditions for its existence. In particular, the corresponding non-commutative star-productmore » carried by this representation is obtained directly from the quantization map via deformation quantization. We then clarify under which conditions a unitary intertwiner between such algebra representation and the usual group representation can be constructed giving rise to the non-commutative plane waves and consequently, the non-commutative Fourier transform. The compact groups U(1) and SU(2) are considered for different choices of quantization maps, such as the symmetric and the Duflo map, and we exhibit the corresponding star-products, algebra representations, and non-commutative plane waves.« less

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

NASA Astrophysics Data System (ADS)

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

2010-10-01

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

Modeling stochasticity and robustness in gene regulatory networks.

PubMed

Garg, Abhishek; Mohanram, Kartik; Di Cara, Alessandro; De Micheli, Giovanni; Xenarios, Ioannis

2009-06-15

Understanding gene regulation in biological processes and modeling the robustness of underlying regulatory networks is an important problem that is currently being addressed by computational systems biologists. Lately, there has been a renewed interest in Boolean modeling techniques for gene regulatory networks (GRNs). However, due to their deterministic nature, it is often difficult to identify whether these modeling approaches are robust to the addition of stochastic noise that is widespread in gene regulatory processes. Stochasticity in Boolean models of GRNs has been addressed relatively sparingly in the past, mainly by flipping the expression of genes between different expression levels with a predefined probability. This stochasticity in nodes (SIN) model leads to over representation of noise in GRNs and hence non-correspondence with biological observations. In this article, we introduce the stochasticity in functions (SIF) model for simulating stochasticity in Boolean models of GRNs. By providing biological motivation behind the use of the SIF model and applying it to the T-helper and T-cell activation networks, we show that the SIF model provides more biologically robust results than the existing SIN model of stochasticity in GRNs. Algorithms are made available under our Boolean modeling toolbox, GenYsis. The software binaries can be downloaded from http://si2.epfl.ch/ approximately garg/genysis.html.

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

NASA Astrophysics Data System (ADS)

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.

FAST TRACK COMMUNICATION: On the structure of k-Lie algebras

NASA Astrophysics Data System (ADS)

Papadopoulos, G.

2008-07-01

We show that the structure constants of k-Lie algebras, k > 3, with a positive definite metric are the sum of the volume forms of orthogonal k-planes. This generalizes the result for k = 3 in Papadopoulos (2008 Preprint arXiv:0804.2662) and Gauntlett and Gutowski (2008 Preprint arXiv:0804.3078), and confirms a conjecture in Figueroa-O'Farrill and Papadopoulos (2002 Preprint math/0211170).

Cuntz-Krieger algebras representations from orbits of interval maps

NASA Astrophysics Data System (ADS)

Correia Ramos, C.; Martins, Nuno; Pinto, Paulo R.; Sousa Ramos, J.

2008-05-01

Let f be an expansive Markov interval map with finite transition matrix Af. Then for every point, we yield an irreducible representation of the Cuntz-Krieger algebra and show that two such representations are unitarily equivalent if and only if the points belong to the same generalized orbit. The restriction of each representation to the gauge part of is decomposed into irreducible representations, according to the decomposition of the orbit.

Kleene Algebra and Bytecode Verification

DTIC Science & Technology

2016-04-27

computing the star (Kleene closure) of a matrix of transfer functions. In this paper we show how this general framework applies to the problem of Java ...bytecode verification. We show how to specify transfer functions arising in Java bytecode verification in such a way that the Kleene algebra operations...potentially improve the performance over the standard worklist algorithm when a small cutset can be found. Key words: Java , bytecode, verification, static

Short Round Sub-Linear Zero-Knowledge Argument for Linear Algebraic Relations

NASA Astrophysics Data System (ADS)

Seo, Jae Hong

Zero-knowledge arguments allows one party to prove that a statement is true, without leaking any other information than the truth of the statement. In many applications such as verifiable shuffle (as a practical application) and circuit satisfiability (as a theoretical application), zero-knowledge arguments for mathematical statements related to linear algebra are essentially used. Groth proposed (at CRYPTO 2009) an elegant methodology for zero-knowledge arguments for linear algebraic relations over finite fields. He obtained zero-knowledge arguments of the sub-linear size for linear algebra using reductions from linear algebraic relations to equations of the form z = x *' y, where x, y ∈ Fnp are committed vectors, z ∈ Fp is a committed element, and *' : Fnp × Fnp → Fp is a bilinear map. These reductions impose additional rounds on zero-knowledge arguments of the sub-linear size. The round complexity of interactive zero-knowledge arguments is an important measure along with communication and computational complexities. We focus on minimizing the round complexity of sub-linear zero-knowledge arguments for linear algebra. To reduce round complexity, we propose a general transformation from a t-round zero-knowledge argument, satisfying mild conditions, to a (t - 2)-round zero-knowledge argument; this transformation is of independent interest.

Hilbert space structure in quantum gravity: an algebraic perspective

DOE PAGES

Giddings, Steven B.

2015-12-16

If quantum gravity respects the principles of quantum mechanics, suitably generalized, it may be that a more viable approach to the theory is through identifying the relevant quantum structures rather than by quantizing classical spacetime. Here, this viewpoint is supported by difficulties of such quantization, and by the apparent lack of a fundamental role for locality. In finite or discrete quantum systems, important structure is provided by tensor factorizations of the Hilbert space. However, even in local quantum field theory properties of the generic type III von Neumann algebras and of long range gauge fields indicate that factorization of themore » Hilbert space is problematic. Instead it is better to focus on the structure of the algebra of observables, and in particular on its subalgebras corresponding to regions. This paper suggests that study of analogous algebraic structure in gravity gives an important perspective on the nature of the quantum theory. Significant departures from the subalgebra structure of local quantum field theory are found, working in the correspondence limit of long-distances/low-energies. Particularly, there are obstacles to identifying commuting algebras of localized operators. In addition to suggesting important properties of the algebraic structure, this and related observations pose challenges to proposals of a fundamental role for entanglement.« less

Hilbert space structure in quantum gravity: an algebraic perspective

DOE Office of Scientific and Technical Information (OSTI.GOV)

Giddings, Steven B.

If quantum gravity respects the principles of quantum mechanics, suitably generalized, it may be that a more viable approach to the theory is through identifying the relevant quantum structures rather than by quantizing classical spacetime. Here, this viewpoint is supported by difficulties of such quantization, and by the apparent lack of a fundamental role for locality. In finite or discrete quantum systems, important structure is provided by tensor factorizations of the Hilbert space. However, even in local quantum field theory properties of the generic type III von Neumann algebras and of long range gauge fields indicate that factorization of themore » Hilbert space is problematic. Instead it is better to focus on the structure of the algebra of observables, and in particular on its subalgebras corresponding to regions. This paper suggests that study of analogous algebraic structure in gravity gives an important perspective on the nature of the quantum theory. Significant departures from the subalgebra structure of local quantum field theory are found, working in the correspondence limit of long-distances/low-energies. Particularly, there are obstacles to identifying commuting algebras of localized operators. In addition to suggesting important properties of the algebraic structure, this and related observations pose challenges to proposals of a fundamental role for entanglement.« less

Birth of the GUP and its effect on the entropy of the universe in Lie-N-algebra

NASA Astrophysics Data System (ADS)

Sepehri, Alireza; Pradhan, Anirudh; Pincak, Richard; Rahaman, Farook; Beesham, A.; Ghaffary, Tooraj

In this paper, the origin of the generalized uncertainty principle (GUP) in an M-dimensional theory with Lie-N-algebra is considered. This theory which we name Generalized Lie-N-Algebra (GLNA)-theory can be reduced to M-theory with M = 11 and N = 3. In this theory, at the beginning, two energies with positive and negative signs are created from nothing and produce two types of branes with opposite quantum numbers and different numbers of timing dimensions. Coincidence with the birth of these branes, various derivatives of bosonic fields emerge in the action of the system which produce the r GUP for bosons. These branes interact with each other, compact and various derivatives of spinor fields appear in the action of the system which leads to the creation of the GUP for fermions. The previous predicted entropy of branes in the GUP is corrected as due to the emergence of higher orders of derivatives and different number of timing dimensions.

A Construction of Rigid Analytic Cohomology Classes for Split Reductive Algebraic Groups

NASA Astrophysics Data System (ADS)

Graham, Bonita Lynn

The cohomology groups H1(Gamma 0(N), Vk) completely describe the space of classical cusp forms of weight k and level N. We study a generalization, Hn(Gamma, Vlambda), where some algebraic group G plays a role analogous to that of GL2 in the classical case. Ash and Stevens proved that certain classes in Hn(Gamma, Vlambda) may be lifted through the natural map rho lambda : Hn(Gamma, D lambda) → Hn(Gamma, Vlambda) to overconvergent classes in H n(Gamma, Dlambda). Pollack and Pollack were able to prove this result constructively in the case of G = GL3, by providing a filtration on the distribution space D?. We construct a general filtration FilN D lambda, for a split reductive algebraic group G. Using this filtration, we are able to lift classes in Hn(Gamma, Vlambda) to the finite dimensional spaces H n(Gamma, Dlambda / FilN Dlambda). These lifts approximate the lifts into Hn(Gamma, Dlambda ) and improve as N → infinity.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Borzov, V. V., E-mail: borzov.vadim@yandex.ru; Damaskinsky, E. V., E-mail: evd@pdmi.ras.ru

In the previous works of Borzov and Damaskinsky [“Chebyshev-Koornwinder oscillator,” Theor. Math. Phys. 175(3), 765–772 (2013)] and [“Ladder operators for Chebyshev-Koornwinder oscillator,” in Proceedings of the Days on Diffraction, 2013], the authors have defined the oscillator-like system that is associated with the two variable Chebyshev-Koornwinder polynomials. We call this system the generalized Chebyshev-Koornwinder oscillator. In this paper, we study the properties of infinite-dimensional Lie algebra that is analogous to the Heisenberg algebra for the Chebyshev-Koornwinder oscillator. We construct the exact irreducible representation of this algebra in a Hilbert space H of functions that are defined on a region which ismore » bounded by the Steiner hypocycloid. The functions are square-integrable with respect to the orthogonality measure for the Chebyshev-Koornwinder polynomials and these polynomials form an orthonormalized basis in the space H. The generalized oscillator which is studied in the work can be considered as the simplest nontrivial example of multiboson quantum system that is composed of three interacting oscillators.« less

Equations of motion for a spectrum-generating algebra: Lipkin Meshkov Glick model

NASA Astrophysics Data System (ADS)

Rosensteel, G.; Rowe, D. J.; Ho, S. Y.

2008-01-01

For a spectrum-generating Lie algebra, a generalized equations-of-motion scheme determines numerical values of excitation energies and algebra matrix elements. In the approach to the infinite particle number limit or, more generally, whenever the dimension of the quantum state space is very large, the equations-of-motion method may achieve results that are impractical to obtain by diagonalization of the Hamiltonian matrix. To test the method's effectiveness, we apply it to the well-known Lipkin-Meshkov-Glick (LMG) model to find its low-energy spectrum and associated generator matrix elements in the eigenenergy basis. When the dimension of the LMG representation space is 106, computation time on a notebook computer is a few minutes. For a large particle number in the LMG model, the low-energy spectrum makes a quantum phase transition from a nondegenerate harmonic vibrator to a twofold degenerate harmonic oscillator. The equations-of-motion method computes critical exponents at the transition point.

On the correspondence between boundary and bulk lattice models and (logarithmic) conformal field theories

NASA Astrophysics Data System (ADS)

Belletête, J.; Gainutdinov, A. M.; Jacobsen, J. L.; Saleur, H.; Vasseur, R.

2017-12-01

The relationship between bulk and boundary properties is one of the founding features of (rational) conformal field theory (CFT). Our goal in this paper is to explore the possibility of having an equivalent relationship in the context of lattice models. We focus on models based on the Temperley-Lieb algebra, and use the concept of ‘braid translation’, which is a natural way, in physical terms, to ‘close’ an open spin chain by adding an interaction between the first and last spins using braiding to ‘bring’ them next to each other. The interaction thus obtained is in general non-local, but has the key feature that it is expressed solely in terms of the algebra for the open spin chain—the ‘ordinary’ Temperley-Lieb algebra and its blob algebra generalization. This is in contrast with the usual periodic spin chains which involve only local interactions, and are described by the periodic Temperley-Lieb algebra. We show that for the restricted solid-on-solid models, which are known to be described by minimal unitary CFTs (with central charge c<1 ) in the continuum limit, the braid translation in fact does provide the ordinary periodic model starting from the open model with fixed (identical) boundary conditions on the two sides of the strip. This statement has a precise mathematical formulation, which is a pull-back map between irreducible modules of, respectively, the blob algebra and the affine Temperley-Lieb algebra. We then turn to the same kind of analysis for two models whose continuum limits are logarithmic CFTs (LCFTs)—the alternating gl(1\\vert 1) and sl(2\\vert 1) spin chains. We find that the result for minimal models does not hold any longer: braid translation of the relevant (in that case, indecomposable but not irreducible) modules of the Temperley-Lieb algebra does not give rise to the modules known to be present in the periodic chains. In the gl(1\\vert 1) case, the content in terms of the irreducibles is the same, as well as the spectrum, but the detailed structure (like logarithmic coupling) is profoundly different. This carries over to the continuum limit. The situation is similar for the sl(2\\vert 1) case. The problem of relating bulk and boundary lattice models for LCFTs thus remains open.

Wick Product for Commutation Relations Connected with Yang-Baxter Operators and New Constructions of Factors

NASA Astrophysics Data System (ADS)

Krsolarlak, Ilona

We analyze a certain class of von Neumann algebras generated by selfadjoint elements , for satisfying the general commutation relations: Such algebras can be continuously embedded into some closure of the set of finite linear combinations of vectors , where is an orthonormal basis of a Hilbert space . The operator which represents the vector is denoted by and called the ``Wick product'' of the operators . We describe explicitly the form of this product. Also, we estimate the operator norm of for . Finally we apply these two results and prove that under the assumption all the von Neumann algebras considered are II1 factors.

Rota-Baxter operators on sl (2,C) and solutions of the classical Yang-Baxter equation

DOE Office of Scientific and Technical Information (OSTI.GOV)

Pei, Jun, E-mail: peitsun@163.com; Bai, Chengming, E-mail: baicm@nankai.edu.cn; Guo, Li, E-mail: liguo@rutgers.edu

2014-02-15

We explicitly determine all Rota-Baxter operators (of weight zero) on sl (2,C) under the Cartan-Weyl basis. For the skew-symmetric operators, we give the corresponding skew-symmetric solutions of the classical Yang-Baxter equation in sl (2,C), confirming the related study by Semenov-Tian-Shansky. In general, these Rota-Baxter operators give a family of solutions of the classical Yang-Baxter equation in the six-dimensional Lie algebra sl (2,C)⋉{sub ad{sup *}} sl (2,C){sup *}. They also give rise to three-dimensional pre-Lie algebras which in turn yield solutions of the classical Yang-Baxter equation in other six-dimensional Lie algebras.

Laplace-Runge-Lenz vector for arbitrary spin

DOE Office of Scientific and Technical Information (OSTI.GOV)

Nikitin, A. G.

2013-12-15

A countable set of superintegrable quantum mechanical systems is presented which admit the dynamical symmetry with respect to algebra so(4). This algebra is generated by the Laplace-Runge-Lenz vector generalized to the case of arbitrary spin. The presented systems describe neutral particles with non-trivial multipole momenta. Their spectra can be found algebraically like in the case of hydrogen atom. Solutions for the systems with spins 1/2 and 1 are presented explicitly, solutions for spin 3/2 can be expressed via solutions of an ordinary differential equation of first order. A more extended version of this paper including detailed calculations is published asmore » an e-print arXiv:1308.4279.« less

On Max-Plus Algebra and Its Application on Image Steganography

PubMed Central

Santoso, Kiswara Agung

2018-01-01

We propose a new steganography method to hide an image into another image using matrix multiplication operations on max-plus algebra. This is especially interesting because the matrix used in encoding or information disguises generally has an inverse, whereas matrix multiplication operations in max-plus algebra do not have an inverse. The advantages of this method are the size of the image that can be hidden into the cover image, larger than the previous method. The proposed method has been tested on many secret images, and the results are satisfactory which have a high level of strength and a high level of security and can be used in various operating systems. PMID:29887761

On Max-Plus Algebra and Its Application on Image Steganography.

PubMed

Santoso, Kiswara Agung; Fatmawati; Suprajitno, Herry

2018-01-01

We propose a new steganography method to hide an image into another image using matrix multiplication operations on max-plus algebra. This is especially interesting because the matrix used in encoding or information disguises generally has an inverse, whereas matrix multiplication operations in max-plus algebra do not have an inverse. The advantages of this method are the size of the image that can be hidden into the cover image, larger than the previous method. The proposed method has been tested on many secret images, and the results are satisfactory which have a high level of strength and a high level of security and can be used in various operating systems.

A discussion on the origin of quantum probabilities

DOE Office of Scientific and Technical Information (OSTI.GOV)

Holik, Federico, E-mail: olentiev2@gmail.com; Departamento de Matemática - Ciclo Básico Común, Universidad de Buenos Aires - Pabellón III, Ciudad Universitaria, Buenos Aires; Sáenz, Manuel

We study the origin of quantum probabilities as arising from non-Boolean propositional-operational structures. We apply the method developed by Cox to non distributive lattices and develop an alternative formulation of non-Kolmogorovian probability measures for quantum mechanics. By generalizing the method presented in previous works, we outline a general framework for the deduction of probabilities in general propositional structures represented by lattices (including the non-distributive case). -- Highlights: •Several recent works use a derivation similar to that of R.T. Cox to obtain quantum probabilities. •We apply Cox’s method to the lattice of subspaces of the Hilbert space. •We obtain a derivationmore » of quantum probabilities which includes mixed states. •The method presented in this work is susceptible to generalization. •It includes quantum mechanics and classical mechanics as particular cases.« less

Hamiltonian structure and Darboux theorem for families of generalized Lotka-Volterra systems

NASA Astrophysics Data System (ADS)

Hernández-Bermejo, Benito; Fairén, Víctor

1998-11-01

This work is devoted to the establishment of a Poisson structure for a format of equations known as generalized Lotka-Volterra systems. These equations, which include the classical Lotka-Volterra systems as a particular case, have been deeply studied in the literature. They have been shown to constitute a whole hierarchy of systems, the characterization of which is made in the context of simple algebra. Our main result is to show that this algebraic structure is completely translatable into the Poisson domain. Important Poisson structures features, such as the symplectic foliation and the Darboux canonical representation, rise as a result of rather simple matrix manipulations.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Stoilova, N. I.

Generalized quantum statistics, such as paraboson and parafermion statistics, are characterized by triple relations which are related to Lie (super)algebras of type B. The correspondence of the Fock spaces of parabosons, parafermions as well as the Fock space of a system of parafermions and parabosons to irreducible representations of (super)algebras of type B will be pointed out. Example of generalized quantum statistics connected to the basic classical Lie superalgebra B(1|1) ≡ osp(3|2) with interesting physical properties, such as noncommutative coordinates, will be given. Therefore the article focuses on the question, addressed already in 1950 by Wigner: do the equation ofmore » motion determine the quantum mechanical commutation relation?.« less

Algebraic solutions of shape-invariant position-dependent effective mass systems

DOE Office of Scientific and Technical Information (OSTI.GOV)

Amir, Naila, E-mail: naila.amir@live.com, E-mail: naila.amir@seecs.edu.pk; Iqbal, Shahid, E-mail: sic80@hotmail.com, E-mail: siqbal@sns.nust.edu.pk

2016-06-15

Keeping in view the ordering ambiguity that arises due to the presence of position-dependent effective mass in the kinetic energy term of the Hamiltonian, a general scheme for obtaining algebraic solutions of quantum mechanical systems with position-dependent effective mass is discussed. We quantize the Hamiltonian of the pertaining system by using symmetric ordering of the operators concerning momentum and the spatially varying mass, initially proposed by von Roos and Lévy-Leblond. The algebraic method, used to obtain the solutions, is based on the concepts of supersymmetric quantum mechanics and shape invariance. In order to exemplify the general formalism a class ofmore » non-linear oscillators has been considered. This class includes the particular example of a one-dimensional oscillator with different position-dependent effective mass profiles. Explicit expressions for the eigenenergies and eigenfunctions in terms of generalized Hermite polynomials are presented. Moreover, properties of these modified Hermite polynomials, like existence of generating function and recurrence relations among the polynomials have also been studied. Furthermore, it has been shown that in the harmonic limit, all the results for the linear harmonic oscillator are recovered.« less

Phonological reduplication in sign language: Rules rule

PubMed Central

Berent, Iris; Dupuis, Amanda; Brentari, Diane

2014-01-01

Productivity—the hallmark of linguistic competence—is typically attributed to algebraic rules that support broad generalizations. Past research on spoken language has documented such generalizations in both adults and infants. But whether algebraic rules form part of the linguistic competence of signers remains unknown. To address this question, here we gauge the generalization afforded by American Sign Language (ASL). As a case study, we examine reduplication (X→XX)—a rule that, inter alia, generates ASL nouns from verbs. If signers encode this rule, then they should freely extend it to novel syllables, including ones with features that are unattested in ASL. And since reduplicated disyllables are preferred in ASL, such a rule should favor novel reduplicated signs. Novel reduplicated signs should thus be preferred to nonreduplicative controls (in rating), and consequently, such stimuli should also be harder to classify as nonsigns (in the lexical decision task). The results of four experiments support this prediction. These findings suggest that the phonological knowledge of signers includes powerful algebraic rules. The convergence between these conclusions and previous evidence for phonological rules in spoken language suggests that the architecture of the phonological mind is partly amodal. PMID:24959158

Balance point characterization of interstitial fluid volume regulation.

PubMed

Dongaonkar, R M; Laine, G A; Stewart, R H; Quick, C M

2009-07-01

The individual processes involved in interstitial fluid volume and protein regulation (microvascular filtration, lymphatic return, and interstitial storage) are relatively simple, yet their interaction is exceedingly complex. There is a notable lack of a first-order, algebraic formula that relates interstitial fluid pressure and protein to critical parameters commonly used to characterize the movement of interstitial fluid and protein. Therefore, the purpose of the present study is to develop a simple, transparent, and general algebraic approach that predicts interstitial fluid pressure (P(i)) and protein concentrations (C(i)) that takes into consideration all three processes. Eight standard equations characterizing fluid and protein flux were solved simultaneously to yield algebraic equations for P(i) and C(i) as functions of parameters characterizing microvascular, interstitial, and lymphatic function. Equilibrium values of P(i) and C(i) arise as balance points from the graphical intersection of transmicrovascular and lymph flows (analogous to Guyton's classical cardiac output-venous return curves). This approach goes beyond describing interstitial fluid balance in terms of conservation of mass by introducing the concept of inflow and outflow resistances. Algebraic solutions demonstrate that P(i) and C(i) result from a ratio of the microvascular filtration coefficient (1/inflow resistance) and effective lymphatic resistance (outflow resistance), and P(i) is unaffected by interstitial compliance. These simple algebraic solutions predict P(i) and C(i) that are consistent with reported measurements. The present work therefore presents a simple, transparent, and general balance point characterization of interstitial fluid balance resulting from the interaction of microvascular, interstitial, and lymphatic function.

Image Algebra Matlab language version 2.3 for image processing and compression research

NASA Astrophysics Data System (ADS)

Schmalz, Mark S.; Ritter, Gerhard X.; Hayden, Eric

2010-08-01

Image algebra is a rigorous, concise notation that unifies linear and nonlinear mathematics in the image domain. Image algebra was developed under DARPA and US Air Force sponsorship at University of Florida for over 15 years beginning in 1984. Image algebra has been implemented in a variety of programming languages designed specifically to support the development of image processing and computer vision algorithms and software. The University of Florida has been associated with development of the languages FORTRAN, Ada, Lisp, and C++. The latter implementation involved a class library, iac++, that supported image algebra programming in C++. Since image processing and computer vision are generally performed with operands that are array-based, the Matlab™ programming language is ideal for implementing the common subset of image algebra. Objects include sets and set operations, images and operations on images, as well as templates and image-template convolution operations. This implementation, called Image Algebra Matlab (IAM), has been found to be useful for research in data, image, and video compression, as described herein. Due to the widespread acceptance of the Matlab programming language in the computing community, IAM offers exciting possibilities for supporting a large group of users. The control over an object's computational resources provided to the algorithm designer by Matlab means that IAM programs can employ versatile representations for the operands and operations of the algebra, which are supported by the underlying libraries written in Matlab. In a previous publication, we showed how the functionality of IAC++ could be carried forth into a Matlab implementation, and provided practical details of a prototype implementation called IAM Version 1. In this paper, we further elaborate the purpose and structure of image algebra, then present a maturing implementation of Image Algebra Matlab called IAM Version 2.3, which extends the previous implementation of IAM to include polymorphic operations over different point sets, as well as recursive convolution operations and functional composition. We also show how image algebra and IAM can be employed in image processing and compression research, as well as algorithm development and analysis.

Exact Algorithms for Output Encoding, State Assignment and Four-Level Boolean Minimization

DTIC Science & Technology

1989-10-01

APPROVED FOR PUBLIC DISTRIBUTION • DTIC MASSACHUSETTS INTITUTE OF TECHNOLOGY M VLSI PUBLICATIONSJAN 17 1990 VLSI Memo No. 89-569 JN. 9October 1989...nunijize large funclions exacly within reasonable amocunt. of CPt targeting twro-level logic imnplemientations involve finding ap- time. However, thle ,, m ...0(NV!) m ~iimizations . n5 10 The inptut encoding problemt can be exactly solved using mrultiple-valued Boolean nimuization. We present an exact (a) (b

Boolean logic tree of graphene-based chemical system for molecular computation and intelligent molecular search query.

PubMed

Huang, Wei Tao; Luo, Hong Qun; Li, Nian Bing

2014-05-06

The most serious, and yet unsolved, problem of constructing molecular computing devices consists in connecting all of these molecular events into a usable device. This report demonstrates the use of Boolean logic tree for analyzing the chemical event network based on graphene, organic dye, thrombin aptamer, and Fenton reaction, organizing and connecting these basic chemical events. And this chemical event network can be utilized to implement fluorescent combinatorial logic (including basic logic gates and complex integrated logic circuits) and fuzzy logic computing. On the basis of the Boolean logic tree analysis and logic computing, these basic chemical events can be considered as programmable "words" and chemical interactions as "syntax" logic rules to construct molecular search engine for performing intelligent molecular search query. Our approach is helpful in developing the advanced logic program based on molecules for application in biosensing, nanotechnology, and drug delivery.

A single-layer platform for Boolean logic and arithmetic through DNA excision in mammalian cells

PubMed Central

Weinberg, Benjamin H.; Hang Pham, N. T.; Caraballo, Leidy D.; Lozanoski, Thomas; Engel, Adrien; Bhatia, Swapnil; Wong, Wilson W.

2017-01-01

Genetic circuits engineered for mammalian cells often require extensive fine-tuning to perform their intended functions. To overcome this problem, we present a generalizable biocomputing platform that can engineer genetic circuits which function in human cells with minimal optimization. We used our Boolean Logic and Arithmetic through DNA Excision (BLADE) platform to build more than 100 multi-input-multi-output circuits. We devised a quantitative metric to evaluate the performance of the circuits in human embryonic kidney and Jurkat T cells. Of 113 circuits analysed, 109 functioned (96.5%) with the correct specified behavior without any optimization. We used our platform to build a three-input, two-output Full Adder and six-input, one-output Boolean Logic Look Up Table. We also used BLADE to design circuits with temporal small molecule-mediated inducible control and circuits that incorporate CRISPR/Cas9 to regulate endogenous mammalian genes. PMID:28346402

An Automated Design Framework for Multicellular Recombinase Logic.

PubMed

Guiziou, Sarah; Ulliana, Federico; Moreau, Violaine; Leclere, Michel; Bonnet, Jerome

2018-05-18

Tools to systematically reprogram cellular behavior are crucial to address pressing challenges in manufacturing, environment, or healthcare. Recombinases can very efficiently encode Boolean and history-dependent logic in many species, yet current designs are performed on a case-by-case basis, limiting their scalability and requiring time-consuming optimization. Here we present an automated workflow for designing recombinase logic devices executing Boolean functions. Our theoretical framework uses a reduced library of computational devices distributed into different cellular subpopulations, which are then composed in various manners to implement all desired logic functions at the multicellular level. Our design platform called CALIN (Composable Asynchronous Logic using Integrase Networks) is broadly accessible via a web server, taking truth tables as inputs and providing corresponding DNA designs and sequences as outputs (available at http://synbio.cbs.cnrs.fr/calin ). We anticipate that this automated design workflow will streamline the implementation of Boolean functions in many organisms and for various applications.

Tracking perturbations in Boolean networks with spectral methods

NASA Astrophysics Data System (ADS)

Kesseli, Juha; Rämö, Pauli; Yli-Harja, Olli

2005-08-01

In this paper we present a method for predicting the spread of perturbations in Boolean networks. The method is applicable to networks that have no regular topology. The prediction of perturbations can be performed easily by using a presented result which enables the efficient computation of the required iterative formulas. This result is based on abstract Fourier transform of the functions in the network. In this paper the method is applied to show the spread of perturbations in networks containing a distribution of functions found from biological data. The advances in the study of the spread of perturbations can directly be applied to enable ways of quantifying chaos in Boolean networks. Derrida plots over an arbitrary number of time steps can be computed and thus distributions of functions compared with each other with respect to the amount of order they create in random networks.

Residus de 2-formes differentielles sur les surfaces algebriques et applications aux codes correcteurs d'erreurs

NASA Astrophysics Data System (ADS)

Couvreur, A.

2009-05-01

The theory of algebraic-geometric codes has been developed in the beginning of the 80's after a paper of V.D. Goppa. Given a smooth projective algebraic curve X over a finite field, there are two different constructions of error-correcting codes. The first one, called "functional", uses some rational functions on X and the second one, called "differential", involves some rational 1-forms on this curve. Hundreds of papers are devoted to the study of such codes. In addition, a generalization of the functional construction for algebraic varieties of arbitrary dimension is given by Y. Manin in an article of 1984. A few papers about such codes has been published, but nothing has been done concerning a generalization of the differential construction to the higher-dimensional case. In this thesis, we propose a differential construction of codes on algebraic surfaces. Afterwards, we study the properties of these codes and particularly their relations with functional codes. A pretty surprising fact is that a main difference with the case of curves appears. Indeed, if in the case of curves, a differential code is always the orthogonal of a functional one, this assertion generally fails for surfaces. Last observation motivates the study of codes which are the orthogonal of some functional code on a surface. Therefore, we prove that, under some condition on the surface, these codes can be realized as sums of differential codes. Moreover, we show that some answers to some open problems "a la Bertini" could give very interesting informations on the parameters of these codes.

GENERAL: Application of Symplectic Algebraic Dynamics Algorithm to Circular Restricted Three-Body Problem

NASA Astrophysics Data System (ADS)

Lu, Wei-Tao; Zhang, Hua; Wang, Shun-Jin

2008-07-01

Symplectic algebraic dynamics algorithm (SADA) for ordinary differential equations is applied to solve numerically the circular restricted three-body problem (CR3BP) in dynamical astronomy for both stable motion and chaotic motion. The result is compared with those of Runge-Kutta algorithm and symplectic algorithm under the fourth order, which shows that SADA has higher accuracy than the others in the long-term calculations of the CR3BP.

Adler-Kostant-Symes scheme for face and Calogero-Moser-Sutherland-type models

NASA Astrophysics Data System (ADS)

Jurčo, Branislav; Schupp, Peter

1998-07-01

We give the construction of quantum Lax equations for IRF models and the difference version of the Calogero-Moser-Sutherland model introduced by Ruijsenaars. We solve the equations using factorization properties of the underlying face Hopf algebras/elliptic quantum groups. This construction is in the spirit of the Adler-Kostant-Symes method and generalizes our previous work to the case of face Hopf algebras/elliptic quantum groups with dynamical R matrices.

Spacetime from locality of interactions in deformations of special relativity: The example of κ -Poincaré Hopf algebra

NASA Astrophysics Data System (ADS)

Carmona, J. M.; Cortés, J. L.; Relancio, J. J.

2018-03-01

A new proposal for the notion of spacetime in a relativistic generalization of special relativity based on a modification of the composition law of momenta is presented. Locality of interactions is the principle which defines the spacetime structure for a system of particles. The formulation based on κ -Poincaré Hopf algebra is shown to be contained in this framework as a particular example.