Science.gov

Sample records for algebra graph theory

  1. Fusion rule algebras from graph theory

    NASA Astrophysics Data System (ADS)

    Caselle, M.; Ponzano, G.

    1989-06-01

    We describe a new class of fusion algebras related to graph theory which bear intriguing connections with group algebras. The structure constants and the matrix S, which diagonalizes the fusion rules, are explicitly computed in terms of SU(2) coupling coefficients.

  2. Pattern vectors from algebraic graph theory.

    PubMed

    Wilson, Richard C; Hancock, Edwin R; Luo, Bin

    2005-07-01

    Graph structures have proven computationally cumbersome for pattern analysis. The reason for this is that, before graphs can be converted to pattern vectors, correspondences must be established between the nodes of structures which are potentially of different size. To overcome this problem, in this paper, we turn to the spectral decomposition of the Laplacian matrix. We show how the elements of the spectral matrix for the Laplacian can be used to construct symmetric polynomials that are permutation invariants. The coefficients of these polynomials can be used as graph features which can be encoded in a vectorial manner. We extend this representation to graphs in which there are unary attributes on the nodes and binary attributes on the edges by using the spectral decomposition of a Hermitian property matrix that can be viewed as a complex analogue of the Laplacian. To embed the graphs in a pattern space, we explore whether the vectors of invariants can be embedded in a low-dimensional space using a number of alternative strategies, including principal components analysis (PCA), multidimensional scaling (MDS), and locality preserving projection (LPP). Experimentally, we demonstrate that the embeddings result in well-defined graph clusters. Our experiments with the spectral representation involve both synthetic and real-world data. The experiments with synthetic data demonstrate that the distances between spectral feature vectors can be used to discriminate between graphs on the basis of their structure. The real-world experiments show that the method can be used to locate clusters of graphs. PMID:16013758

  3. K-theory of locally finite graph C∗-algebras

    NASA Astrophysics Data System (ADS)

    Iyudu, Natalia

    2013-09-01

    We calculate the K-theory of the Cuntz-Krieger algebra OE associated with an infinite, locally finite graph, via the Bass-Hashimoto operator. The formulae we get express the Grothendieck group and the Whitehead group in purely graph theoretic terms. We consider the category of finite (black-and-white, bi-directed) subgraphs with certain graph homomorphisms and construct a continuous functor to abelian groups. In this category K0 is an inductive limit of K-groups of finite graphs, which were calculated in Cornelissen et al. (2008) [3]. In the case of an infinite graph with the finite Betti number we obtain the formula for the Grothendieck group K0(OE)=Z, where β(E) is the first Betti number and γ(E) is the valency number of the graph E. We note that in the infinite case the torsion part of K0, which is present in the case of a finite graph, vanishes. The Whitehead group depends only on the first Betti number: K1(OE)=Z. These allow us to provide a counterexample to the fact, which holds for finite graphs, that K1(OE) is the torsion free part of K0(OE).

  4. Hard-core lattice bosons: new insights from algebraic graph theory

    NASA Astrophysics Data System (ADS)

    Squires, Randall W.; Feder, David L.

    2014-03-01

    Determining the characteristics of hard-core lattice bosons is a problem of long-standing interest in condensed matter physics. While in one-dimensional systems the ground state can be formally obtained via a mapping to free fermions, various properties (such as correlation functions) are often difficult to calculate. In this work we discuss the application of techniques from algebraic graph theory to hard-core lattice bosons in one dimension. Graphs are natural representations of many-body Hamiltonians, with vertices representing Fock basis states and edges representing matrix elements. We prove that the graphs for hard-core bosons and non-interacting bosons have identical connectivity; the only difference is the existence of edge weights. A formal mapping between the two is therefore possible by manipulating the graph incidence matrices. We explore the implications of these insights, in particular the intriguing possibility that ground-state properties of hard-core bosons can be calculated directly from those of non-interacting bosons.

  5. Algebraic distance on graphs.

    SciTech Connect

    Chen, J.; Safro, I.

    2011-01-01

    Measuring the connection strength between a pair of vertices in a graph is one of the most important concerns in many graph applications. Simple measures such as edge weights may not be sufficient for capturing the effects associated with short paths of lengths greater than one. In this paper, we consider an iterative process that smooths an associated value for nearby vertices, and we present a measure of the local connection strength (called the algebraic distance; see [D. Ron, I. Safro, and A. Brandt, Multiscale Model. Simul., 9 (2011), pp. 407-423]) based on this process. The proposed measure is attractive in that the process is simple, linear, and easily parallelized. An analysis of the convergence property of the process reveals that the local neighborhoods play an important role in determining the connectivity between vertices. We demonstrate the practical effectiveness of the proposed measure through several combinatorial optimization problems on graphs and hypergraphs.

  6. On Algebraic Singularities, Finite Graphs and D-Brane Gauge Theories: A String Theoretic Perspective

    NASA Astrophysics Data System (ADS)

    He, Yang-Hui

    2002-09-01

    In this writing we shall address certain beautiful inter-relations between the construction of 4-dimensional supersymmetric gauge theories and resolution of algebraic singularities, from the perspective of String Theory. We review in some detail the requisite background in both the mathematics, such as orbifolds, symplectic quotients and quiver representations, as well as the physics, such as gauged linear sigma models, geometrical engineering, Hanany-Witten setups and D-brane probes. We investigate aspects of world-volume gauge dynamics using D-brane resolutions of various Calabi-Yau singularities, notably Gorenstein quotients and toric singularities. Attention will be paid to the general methodology of constructing gauge theories for these singular backgrounds, with and without the presence of the NS-NS B-field, as well as the T-duals to brane setups and branes wrapping cycles in the mirror geometry. Applications of such diverse and elegant mathematics as crepant resolution of algebraic singularities, representation of finite groups and finite graphs, modular invariants of affine Lie algebras, etc. will naturally arise. Various viewpoints and generalisations of McKay's Correspondence will also be considered. The present work is a transcription of excerpts from the first three volumes of the author's PhD thesis which was written under the direction of Prof. A. Hanany - to whom he is much indebted - at the Centre for Theoretical Physics of MIT, and which, at the suggestion of friends, he posts to the ArXiv pro hac vice; it is his sincerest wish that the ensuing pages might be of some small use to the beginning student.

  7. Algebraic connectivity and graph robustness.

    SciTech Connect

    Feddema, John Todd; Byrne, Raymond Harry; Abdallah, Chaouki T.

    2009-07-01

    Recent papers have used Fiedler's definition of algebraic connectivity to show that network robustness, as measured by node-connectivity and edge-connectivity, can be increased by increasing the algebraic connectivity of the network. By the definition of algebraic connectivity, the second smallest eigenvalue of the graph Laplacian is a lower bound on the node-connectivity. In this paper we show that for circular random lattice graphs and mesh graphs algebraic connectivity is a conservative lower bound, and that increases in algebraic connectivity actually correspond to a decrease in node-connectivity. This means that the networks are actually less robust with respect to node-connectivity as the algebraic connectivity increases. However, an increase in algebraic connectivity seems to correlate well with a decrease in the characteristic path length of these networks - which would result in quicker communication through the network. Applications of these results are then discussed for perimeter security.

  8. Graph Theory

    SciTech Connect

    Sanfilippo, Antonio P.

    2005-12-27

    Graph theory is a branch of discrete combinatorial mathematics that studies the properties of graphs. The theory was pioneered by the Swiss mathematician Leonhard Euler in the 18th century, commenced its formal development during the second half of the 19th century, and has witnessed substantial growth during the last seventy years, with applications in areas as diverse as engineering, computer science, physics, sociology, chemistry and biology. Graph theory has also had a strong impact in computational linguistics by providing the foundations for the theory of features structures that has emerged as one of the most widely used frameworks for the representation of grammar formalisms.

  9. Feynman graph generation and calculations in the Hopf algebra of Feynman graphs

    NASA Astrophysics Data System (ADS)

    Borinsky, Michael

    2014-12-01

    Two programs for the computation of perturbative expansions of quantum field theory amplitudes are provided. feyngen can be used to generate Feynman graphs for Yang-Mills, QED and φk theories. Using dedicated graph theoretic tools feyngen can generate graphs of comparatively high loop orders. feyncop implements the Hopf algebra of those Feynman graphs which incorporates the renormalization procedure necessary to calculate finite results in perturbation theory of the underlying quantum field theory. feyngen is validated by comparison to explicit calculations of zero dimensional quantum field theories and feyncop is validated using a combinatorial identity on the Hopf algebra of graphs.

  10. Renormalization in Quantum Field Theory and the Riemann-Hilbert Problem I: The Hopf Algebra Structure of Graphs and the Main Theorem

    NASA Astrophysics Data System (ADS)

    Connes, Alain; Kreimer, Dirk

    This paper gives a complete selfcontained proof of our result announced in [6] showing that renormalization in quantum field theory is a special instance of a general mathematical procedure of extraction of finite values based on the Riemann-Hilbert problem. We shall first show that for any quantum field theory, the combinatorics of Feynman graphs gives rise to a Hopf algebra which is commutative as an algebra. It is the dual Hopf algebra of the enveloping algebra of a Lie algebra whose basis is labelled by the one particle irreducible Feynman graphs. The Lie bracket of two such graphs is computed from insertions of one graph in the other and vice versa. The corresponding Lie group G is the group of characters of . We shall then show that, using dimensional regularization, the bare (unrenormalized) theory gives rise to a loop where C is a small circle of complex dimensions around the integer dimension D of space-time. Our main result is that the renormalized theory is just the evaluation at z=D of the holomorphic part γ+ of the Birkhoff decomposition of γ. We begin to analyse the group G and show that it is a semi-direct product of an easily understood abelian group by a highly non-trivial group closely tied up with groups of diffeomorphisms. The analysis of this latter group as well as the interpretation of the renormalization group and of anomalous dimensions are the content of our second paper with the same overall title.

  11. Graphing Calculator Use in Algebra Teaching

    ERIC Educational Resources Information Center

    Dewey, Brenda L.; Singletary, Ted J.; Kinzel, Margaret T.

    2009-01-01

    This study examines graphing calculator technology availability, characteristics of teachers who use it, teacher attitudes, and how use reflects changes to algebra curriculum and instructional practices. Algebra I and Algebra II teachers in 75 high school and junior high/middle schools in a diverse region of a northwestern state were surveyed.…

  12. Complex Kumjian-Pask algebras of 2-graphs

    NASA Astrophysics Data System (ADS)

    Yusnitha, Isnie; Rosjanuardi, Rizky

    2016-02-01

    Let Λ be a row-finitek-graph without sources and R be any field. The Kumjian-Pask algebras KPR(Λ) is an algebraic analog of k-graph algebrasC*(Λ). When the field R is the complex field ℂ, there is a special relationship between the complex Kumjian-Pask algebras KP𝕔(Λ) and k-graph algebrasC*(Λ). We examine this relationship particularly to the case 2-graph 𝔽θ+, 2-graph on single vertex generated by m blue edges and n red edges with θ respect to some commutation relations, by analyzing the associated C*-algebras of 𝔽θ+ . As the presence of cycles on 2-graph 𝔽θ+, we can imply that 2-graph algebras C*(𝔽F+ ) is infinite-dimensional. Hence, the complex Kumjian-Pask algebras KP𝕔 (𝔽θ+ ) is also infinite dimensional.

  13. Algebraic Mean Field Theory

    NASA Astrophysics Data System (ADS)

    Dankova, T. S.; Rosensteel, G.

    1998-10-01

    Mean field theory has an unexpected group theoretic mathematical foundation. Instead of representation theory which applies to most group theoretic quantum models, Hartree-Fock and Hartree-Fock-Bogoliubov have been formulated in terms of coadjoint orbits for the groups U(n) and O(2n). The general theory of mean fields is formulated for an arbitrary Lie algebra L of fermion operators. The moment map provides the correspondence between the Hilbert space of microscopic wave functions and the dual space L^* of densities. The coadjoint orbits of the group in the dual space are phase spaces on which time-dependent mean field theory is equivalent to a classical Hamiltonian dynamical system. Indeed it forms a finite-dimensional Lax system. The mean field theories for the Elliott SU(3) and symplectic Sp(3,R) algebras are constructed explicitly in the coadjoint orbit framework.

  14. Ideas in Practice: Graphing Calculators in Beginning Algebra

    ERIC Educational Resources Information Center

    Martin, Aimee

    2008-01-01

    This paper reports on a project to improve Beginning Algebra students' understanding of basic algebraic concepts through fully integrated use of the TI-83 graphing calculator. The methodology incorporated an intervention case study including approximately 700 Beginning Algebra students at an open-door community college of 8,500 students in the…

  15. Graph theory and the Virasoro master equation

    SciTech Connect

    Obers, N.A.J.

    1991-01-01

    A brief history of affine Lie algebra, the Virasoro algebra and its culmination in the Virasoro master equation is given. By studying ansaetze of the master equation, the author obtains exact solutions and gains insight in the structure of large slices of affine-Virasoro space. He finds an isomorphism between the constructions in the ansatz SO(n){sub diag}, which is a set of unitary, generically irrational affine-Virasoro constructions on SO(n), and the unlabeled graphs of order n. On the one hand, the conformal constructions, are classified by the graphs, while, conversely, a group-theoretic and conformal field-theoretic identification is obtained for every graph of graph theory. He also defines a class of magic Lie group bases in which the Virasoro master equation admits a simple metric ansatz {l brace}g{sub metric}{r brace}, whose structure is visible in the high-level expansion. When a magic basis is real on compact g, the corresponding g{sub metric} is a large system of unitary, generically irrational conformal field theories. Examples in this class include the graph-theory ansatz SO(n){sub diag} in the Cartesian basis of SO(n), and the ansatz SU(n){sub metric} in the Pauli-like basis of SU(n). Finally, he defines the sine-area graphs' of SU(n), which label the conformal field theories of SU(n){sub metric}, and he notes that, in similar fashion, each magic basis of g defines a generalized graph theory on g which labels the conformal field theories of g{sub metric}.

  16. Slower Algebra Students Meet Faster Tools: Solving Algebra Word Problems with Graphing Software

    ERIC Educational Resources Information Center

    Yerushalmy, Michal

    2006-01-01

    The article discusses the ways that less successful mathematics students used graphing software with capabilities similar to a basic graphing calculator to solve algebra problems in context. The study is based on interviewing students who learned algebra for 3 years in an environment where software tools were always present. We found differences…

  17. Kevin Bacon and Graph Theory

    ERIC Educational Resources Information Center

    Hopkins, Brian

    2004-01-01

    The interconnected world of actors and movies is a familiar, rich example for graph theory. This paper gives the history of the "Kevin Bacon Game" and makes extensive use of a Web site to analyze the underlying graph. The main content is the classroom development of the weighted average to determine the best choice of "center" for the graph. The…

  18. Graph theory and the Virasoro master equation

    SciTech Connect

    Obers, N.A.J.

    1991-04-01

    A brief history of affine Lie algebra, the Virasoro algebra and its culmination in the Virasoro master equations is given. By studying ansaetze of the master equation, we obtain exact solutions and gain insight in the structure of large slices of affine-Virasoro space. We find an isomorphism between the constructions in the ansatz SO(n){sub diag}, which is a set of unitary, generically irrational affine-Virasoro constructions on SO(n), and the unlabelled graphs, while, conversely, a group-theoretic and conformal field-theoretic identification is obtained for every graph of graph theory. We also define a class of magic'' Lie group bases in which the Virasoro master equation admits a simple metric ansatz (gmetric), whose structure is visible in the high-level expansion. When a magic basis is real on compact g, the corresponding g{sub metric} is a large system of unitary, generically irrational conformal field theories. Examples in this class include the graph-theory ansatz SO(n){sub diag} in the Cartesian basis of SO(n), and the ansatz SU(n){sub metric} in the Pauli-like basis of SU(n). Finally, we define the sine-area graphs'' of SU(n), which label the conformal field theories of SU(n){sub metric}, and we note that, in similar fashion, each magic basis of g defines a generalized graph theory on g which labels the conformal field theories of g{sub metric}. 24 figs., 4 tabs.

  19. Applications of optical Boolean matrix operations to graph theory.

    PubMed

    Gibson, P M; Caulfield, H J

    1991-09-10

    The transition from optical numerical matrix algebra to optical Boolean matrix algebra is explored in detail. All important Boolean matrix algebra tasks can be performed optically. Quantitative measurement is replaced by a simple light-or-no-light decision, something optics can do well. The parallelism advantage of optics becomes greater as the matrix size increases. As an illustration of utility, we consider graph theory. PMID:20706446

  20. Algebraic theory of molecules

    NASA Technical Reports Server (NTRS)

    Iachello, Franco

    1995-01-01

    An algebraic formulation of quantum mechanics is presented. In this formulation, operators of interest are expanded onto elements of an algebra, G. For bound state problems in nu dimensions the algebra G is taken to be U(nu + 1). Applications to the structure of molecules are presented.

  1. A PVS Graph Theory Library

    NASA Technical Reports Server (NTRS)

    Butler, Ricky W.; Sjogren, Jon A.

    1998-01-01

    This paper documents the NASA Langley PVS graph theory library. The library provides fundamental definitions for graphs, subgraphs, walks, paths, subgraphs generated by walks, trees, cycles, degree, separating sets, and four notions of connectedness. Theorems provided include Ramsey's and Menger's and the equivalence of all four notions of connectedness.

  2. Using graph theory for automated electric circuit solving

    NASA Astrophysics Data System (ADS)

    Toscano, L.; Stella, S.; Milotti, E.

    2015-05-01

    Graph theory plays many important roles in modern physics and in many different contexts, spanning diverse topics such as the description of scale-free networks and the structure of the universe as a complex directed graph in causal set theory. Graph theory is also ideally suited to describe many concepts in computer science. Therefore it is increasingly important for physics students to master the basic concepts of graph theory. Here we describe a student project where we develop a computational approach to electric circuit solving which is based on graph theoretic concepts. This highly multidisciplinary approach combines abstract mathematics, linear algebra, the physics of circuits, and computer programming to reach the ambitious goal of implementing automated circuit solving.

  3. Graphs and matroids weighted in a bounded incline algebra.

    PubMed

    Lu, Ling-Xia; Zhang, Bei

    2014-01-01

    Firstly, for a graph weighted in a bounded incline algebra (or called a dioid), a longest path problem (LPP, for short) is presented, which can be considered the uniform approach to the famous shortest path problem, the widest path problem, and the most reliable path problem. The solutions for LPP and related algorithms are given. Secondly, for a matroid weighted in a linear matroid, the maximum independent set problem is studied. PMID:25126607

  4. Discrete Signal Processing on Graphs: Sampling Theory

    NASA Astrophysics Data System (ADS)

    Chen, Siheng; Varma, Rohan; Sandryhaila, Aliaksei; Kovacevic, Jelena

    2015-12-01

    We propose a sampling theory for signals that are supported on either directed or undirected graphs. The theory follows the same paradigm as classical sampling theory. We show that perfect recovery is possible for graph signals bandlimited under the graph Fourier transform. The sampled signal coefficients form a new graph signal, whose corresponding graph structure preserves the first-order difference of the original graph signal. For general graphs, an optimal sampling operator based on experimentally designed sampling is proposed to guarantee perfect recovery and robustness to noise; for graphs whose graph Fourier transforms are frames with maximal robustness to erasures as well as for Erd\\H{o}s-R\\'enyi graphs, random sampling leads to perfect recovery with high probability. We further establish the connection to the sampling theory of finite discrete-time signal processing and previous work on signal recovery on graphs. To handle full-band graph signals, we propose a graph filter bank based on sampling theory on graphs. Finally, we apply the proposed sampling theory to semi-supervised classification on online blogs and digit images, where we achieve similar or better performance with fewer labeled samples compared to previous work.

  5. Chemical Applications of Graph Theory: Part II. Isomer Enumeration.

    ERIC Educational Resources Information Center

    Hansen, Peter J.; Jurs, Peter C.

    1988-01-01

    Discusses the use of graph theory to aid in the depiction of organic molecular structures. Gives a historical perspective of graph theory and explains graph theory terminology with organic examples. Lists applications of graph theory to current research projects. (ML)

  6. Some Applications of Graph Theory to Clustering

    ERIC Educational Resources Information Center

    Hubert, Lawrence J.

    1974-01-01

    The connection between graph theory and clustering is reviewed and extended. Major emphasis is on restating, in a graph-theoretic context, selected past work in clustering, and conversely, developing alternative strategies from several standard concepts used in graph theory per se. (Author/RC)

  7. The Relationship between Graphing Calculator Use and Teachers' Beliefs about Learning Algebra.

    ERIC Educational Resources Information Center

    Yoder, Arnita J.

    The purpose of this study was to determine teachers' views of learning algebra and to investigate if any relationship exists between their views of learning algebra and the ways that they use graphing calculators in their algebra classes. The 48 algebra teachers who participated in the study were from Allen, Putnam, and Van Wert counties in…

  8. Computational Genomics Using Graph Theory

    NASA Astrophysics Data System (ADS)

    Schlick, Tamar

    2005-03-01

    With exciting new discoveries concerning RNA's regulatory cellular roles in gene expression, structural and functional problems associated with DNA's venerable cousin have come to the forefront. RNA folding, for example, is analogous to the well-known protein folding problem, and seeks to link RNA's primary sequence with secondary and tertiary structures. As a single-stranded polynucleotide, RNA's secondary structures are defined by a network of hydrogen bonds, which lead to a variety of stems, loops, junctions, bulges, and other motifs. Supersecondary pseudoknot structures can also occur and, together, lead to RNA's complex tertiary interactions stabilized by salt and solvent ions in the natural cellular milieu. Besides folding, challenges in RNA research include identifying locations and functions of RNA genes, discovering RNA's structural repertoire (folding motifs), designing novel RNAs, and developing new antiviral and antibiotic compounds composed of, or targeting, RNAs. In this talk, I will describe some of these new biological findings concerning RNA and present an approach using graph theory (network theory) to represent RNA secondary structures. Because the RNA motif space using graphs is vastly smaller than RNA's sequence space, many problems related to analyzing and discovering new RNAs can be simplified and studied systematically. Some preliminary applications to designing novel RNAs will also be described.Related ReadingH. H. Gan, S. Pasquali, and T. Schlick, ``A Survey of Existing RNAs using Graph Theory with Implications to RNA Analysis and Design,'' Nuc. Acids Res. 31: 2926--2943 (2003). J. Zorn, H. H. Gan, N. Shiffeldrim, and T. Schlick, ``Structural Motifs in Ribosomal RNAs: Implications for RNA Design and Genomics,'' Biopolymers 73: 340--347 (2004). H. H. Gan, D. Fera, J. Zorn, M. Tang, N. Shiffeldrim, U. Laserson, N. Kim, and T. Schlick,``RAG: RNA-As-Graphs Database -- Concepts, Analysis, and Features,'' Bioinformatics 20: 1285--1291 (2004). U

  9. Flying through Graphs: An Introduction to Graph Theory.

    ERIC Educational Resources Information Center

    McDuffie, Amy Roth

    2001-01-01

    Presents an activity incorporating basic terminology, concepts, and solution methods of graph theory in the context of solving problems related to air travel. Discusses prerequisite knowledge and resources and includes a teacher's guide with a student worksheet. (KHR)

  10. Computer algebra and transport theory.

    SciTech Connect

    Warsa, J. S.

    2004-01-01

    Modern symbolic algebra computer software augments and complements more traditional approaches to transport theory applications in several ways. The first area is in the development and enhancement of numerical solution methods for solving the Boltzmann transport equation. Typically, special purpose computer codes are designed and written to solve specific transport problems in particular ways. Different aspects of the code are often written from scratch and the pitfalls of developing complex computer codes are numerous and well known. Software such as MAPLE and MATLAB can be used to prototype, analyze, verify and determine the suitability of numerical solution methods before a full-scale transport application is written. Once it is written, the relevant pieces of the full-scale code can be verified using the same tools I that were developed for prototyping. Another area is in the analysis of numerical solution methods or the calculation of theoretical results that might otherwise be difficult or intractable. Algebraic manipulations are done easily and without error and the software also provides a framework for any additional numerical calculations that might be needed to complete the analysis. We will discuss several applications in which we have extensively used MAPLE and MATLAB in our work. All of them involve numerical solutions of the S{sub N} transport equation. These applications encompass both of the two main areas in which we have found computer algebra software essential.

  11. The graph representation approach to topological field theory in 2 + 1 dimensions

    SciTech Connect

    Martin, S.P.

    1991-02-01

    An alternative definition of topological quantum field theory in 2+1 dimensions is discussed. The fundamental objects in this approach are not gauge fields as in the usual approach, but non-local observables associated with graphs. The classical theory of graphs is defined by postulating a simple diagrammatic rule for computing the Poisson bracket of any two graphs. The theory is quantized by exhibiting a quantum deformation of the classical Poisson bracket algebra, which is realized as a commutator algebra on a Hilbert space of states. The wavefunctions in this graph representation'' approach are functionals on an appropriate set of graphs. This is in contrast to the usual connection representation'' approach in which the theory is defined in terms of a gauge field and the wavefunctions are functionals on the space of flat spatial connections modulo gauge transformations.

  12. Graph Theory and the High School Student.

    ERIC Educational Resources Information Center

    Chartrand, Gary; Wall, Curtiss E.

    1980-01-01

    Graph theory is presented as a tool to instruct high school mathematics students. A variety of real world problems can be modeled which help students recognize the importance and difficulty of applying mathematics. (MP)

  13. Application of Computer Graphics to Graphing in Algebra and Trigonometry. Final Report.

    ERIC Educational Resources Information Center

    Morris, J. Richard

    This project was designed to improve the graphing competency of students in elementary algebra, intermediate algebra, and trigonometry courses at Virginia Commonwealth University. Computer graphics programs were designed using an Apple II Plus computer and implemented using Pascal. The software package is interactive and gives students control…

  14. Quantum graphs and random-matrix theory

    NASA Astrophysics Data System (ADS)

    Pluhař, Z.; Weidenmüller, H. A.

    2015-07-01

    For simple connected graphs with incommensurate bond lengths and with unitary symmetry we prove the Bohigas-Giannoni-Schmit (BGS) conjecture in its most general form. Using supersymmetry and taking the limit of infinite graph size, we show that the generating function for every (P,Q) correlation function for both closed and open graphs coincides with the corresponding expression of random-matrix theory. We show that the classical Perron-Frobenius operator is bistochastic and possesses a single eigenvalue +1. In the quantum case that implies the existence of a zero (or massless) mode of the effective action. That mode causes universal fluctuation properties. Avoiding the saddle-point approximation we show that for graphs that are classically mixing (i.e. for which the spectrum of the classical Perron-Frobenius operator possesses a finite gap) and that do not carry a special class of bound states, the zero mode dominates in the limit of infinite graph size.

  15. Vertex operator algebras and conformal field theory

    SciTech Connect

    Huang, Y.Z. )

    1992-04-20

    This paper discusses conformal field theory, an important physical theory, describing both two-dimensional critical phenomena in condensed matter physics and classical motions of strings in string theory. The study of conformal field theory will deepen the understanding of these theories and will help to understand string theory conceptually. Besides its importance in physics, the beautiful and rich mathematical structure of conformal field theory has interested many mathematicians. New relations between different branches of mathematics, such as representations of infinite-dimensional Lie algebras and Lie groups, Riemann surfaces and algebraic curves, the Monster sporadic group, modular functions and modular forms, elliptic genera and elliptic cohomology, Calabi-Yau manifolds, tensor categories, and knot theory, are revealed in the study of conformal field theory. It is therefore believed that the study of the mathematics involved in conformal field theory will ultimately lead to new mathematical structures which would be important to both mathematics and physics.

  16. Imperfect Cloning Operations in Algebraic Quantum Theory

    NASA Astrophysics Data System (ADS)

    Kitajima, Yuichiro

    2015-01-01

    No-cloning theorem says that there is no unitary operation that makes perfect clones of non-orthogonal quantum states. The objective of the present paper is to examine whether an imperfect cloning operation exists or not in a C*-algebraic framework. We define a universal -imperfect cloning operation which tolerates a finite loss of fidelity in the cloned state, and show that an individual system's algebra of observables is abelian if and only if there is a universal -imperfect cloning operation in the case where the loss of fidelity is less than . Therefore in this case no universal -imperfect cloning operation is possible in algebraic quantum theory.

  17. Algebraic methods in system theory

    NASA Technical Reports Server (NTRS)

    Brockett, R. W.; Willems, J. C.; Willsky, A. S.

    1975-01-01

    Investigations on problems of the type which arise in the control of switched electrical networks are reported. The main results concern the algebraic structure and stochastic aspects of these systems. Future reports will contain more detailed applications of these results to engineering studies.

  18. Many-core graph analytics using accelerated sparse linear algebra routines

    NASA Astrophysics Data System (ADS)

    Kozacik, Stephen; Paolini, Aaron L.; Fox, Paul; Kelmelis, Eric

    2016-05-01

    Graph analytics is a key component in identifying emerging trends and threats in many real-world applications. Largescale graph analytics frameworks provide a convenient and highly-scalable platform for developing algorithms to analyze large datasets. Although conceptually scalable, these techniques exhibit poor performance on modern computational hardware. Another model of graph computation has emerged that promises improved performance and scalability by using abstract linear algebra operations as the basis for graph analysis as laid out by the GraphBLAS standard. By using sparse linear algebra as the basis, existing highly efficient algorithms can be adapted to perform computations on the graph. This approach, however, is often less intuitive to graph analytics experts, who are accustomed to vertex-centric APIs such as Giraph, GraphX, and Tinkerpop. We are developing an implementation of the high-level operations supported by these APIs in terms of linear algebra operations. This implementation is be backed by many-core implementations of the fundamental GraphBLAS operations required, and offers the advantages of both the intuitive programming model of a vertex-centric API and the performance of a sparse linear algebra implementation. This technology can reduce the number of nodes required, as well as the run-time for a graph analysis problem, enabling customers to perform more complex analysis with less hardware at lower cost. All of this can be accomplished without the requirement for the customer to make any changes to their analytics code, thanks to the compatibility with existing graph APIs.

  19. Excision in algebraic K-theory and Karoubi's conjecture.

    PubMed

    Suslin, A A; Wodzicki, M

    1990-12-15

    We prove that the property of excision in algebraic K-theory is for a Q-algebra A equivalent to the H-unitality of the latter. Our excision theorem, in particular, implies Karoubi's conjecture on the equality of algebraic and topological K-theory groups of stable C*-algebras. It also allows us to identify the algebraic K-theory of the symbol map in the theory of pseudodifferential operators. PMID:11607130

  20. Excision in algebraic K-theory and Karoubi's conjecture.

    PubMed Central

    Suslin, A A; Wodzicki, M

    1990-01-01

    We prove that the property of excision in algebraic K-theory is for a Q-algebra A equivalent to the H-unitality of the latter. Our excision theorem, in particular, implies Karoubi's conjecture on the equality of algebraic and topological K-theory groups of stable C*-algebras. It also allows us to identify the algebraic K-theory of the symbol map in the theory of pseudodifferential operators. PMID:11607130

  1. The conceptual basis of mathematics in cardiology: (I) algebra, functions and graphs.

    PubMed

    Bates, Jason H T; Sobel, Burton E

    2003-02-01

    This is the first in a series of four articles developed for the readers of. Without language ideas cannot be articulated. What may not be so immediately obvious is that they cannot be formulated either. One of the essential languages of cardiology is mathematics. Unfortunately, medical education does not emphasize, and in fact, often neglects empowering physicians to think mathematically. Reference to statistics, conditional probability, multicompartmental modeling, algebra, calculus and transforms is common but often without provision of genuine conceptual understanding. At the University of Vermont College of Medicine, Professor Bates developed a course designed to address these deficiencies. The course covered mathematical principles pertinent to clinical cardiovascular and pulmonary medicine and research. It focused on fundamental concepts to facilitate formulation and grasp of ideas. This series of four articles was developed to make the material available for a wider audience. The articles will be published sequentially in Coronary Artery Disease. Beginning with fundamental axioms and basic algebraic manipulations they address algebra, function and graph theory, real and complex numbers, calculus and differential equations, mathematical modeling, linear system theory and integral transforms and statistical theory. The principles and concepts they address provide the foundation needed for in-depth study of any of these topics. Perhaps of even more importance, they should empower cardiologists and cardiovascular researchers to utilize the language of mathematics in assessing the phenomena of immediate pertinence to diagnosis, pathophysiology and therapeutics. The presentations are interposed with queries (by Coronary Artery Disease, abbreviated as CAD) simulating the nature of interactions that occurred during the course itself. Each article concludes with one or more examples illustrating application of the concepts covered to cardiovascular medicine and

  2. Identification and description of coverage holes in a wireless sensor network using graph theory and homology

    NASA Astrophysics Data System (ADS)

    Uribe Peláez, Simon

    2010-04-01

    Identifying coverage holes makes an important topic for optimization of quality service for wireless sensor network hosts. This paper introduces a new way to identify and describe how is the network's structure, its number of holes and its components, assuming there's a sensor covering an area where a network communication exists. The simplicial complex method and algebraic graph theory will be applied. Betti numbers and Euler characteristics will be used for a sensor network represented by a simplicial complex, and the Tutte polynomial will be used for describing visual graphs algebraically, for a complete identification.

  3. Reducing Abstraction When Learning Graph Theory

    ERIC Educational Resources Information Center

    Hazzan, Orit; Hadar, Irit

    2005-01-01

    This article presents research on students' understanding of basic concepts in Graph Theory. Students' understanding is analyzed through the lens of the theoretical framework of reducing abstraction (Hazzan, 1999). As it turns out, in spite of the relative simplicity of the concepts that are introduced in the introductory part of a traditional…

  4. Algebraic theory of recombination spaces.

    PubMed

    Stadler, P F; Wagner, G P

    1997-01-01

    A new mathematical representation is proposed for the configuration space structure induced by recombination, which we call "P-structure." It consists of a mapping of pairs of objects to the power set of all objects in the search space. The mapping assigns to each pair of parental "genotypes" the set of all recombinant genotypes obtainable from the parental ones. It is shown that this construction allows a Fourier decomposition of fitness landscapes into a superposition of "elementary landscapes." This decomposition is analogous to the Fourier decomposition of fitness landscapes on mutation spaces. The elementary landscapes are obtained as eigenfunctions of a Laplacian operator defined for P-structures. For binary string recombination, the elementary landscapes are exactly the p-spin functions (Walsh functions), that is, the same as the elementary landscapes of the string point mutation spaces (i.e., the hypercube). This supports the notion of a strong homomorphism between string mutation and recombination spaces. However, the effective nearest neighbor correlations on these elementary landscapes differ between mutation and recombination and among different recombination operators. On average, the nearest neighbor correlation is higher for one-point recombination than for uniform recombination. For one-point recombination, the correlations are higher for elementary landscapes with fewer interacting sites as well as for sites that have closer linkage, confirming the qualitative predictions of the Schema Theorem. We conclude that the algebraic approach to fitness landscape analysis can be extended to recombination spaces and provides an effective way to analyze the relative hardness of a landscape for a given recombination operator. PMID:10021760

  5. Implementation of Graphing Calculator in Intermediate Algebra with Function Approach in Community College

    ERIC Educational Resources Information Center

    Reznichenko, Nataliya

    2006-01-01

    A major goal of this paper is to document changes that occurred in developmental mathematics classrooms in the community college setting when the graphing calculator (GC) Texas Instruments (TI)-83 was introduced to students. The six-week intervention was conducted during the section of Intermediate Algebra in the Community College Baltimore County…

  6. Algebraic Theories and (Infinity,1)-Categories

    NASA Astrophysics Data System (ADS)

    Cranch, James

    2010-11-01

    We adapt the classical framework of algebraic theories to work in the setting of (infinity,1)-categories developed by Joyal and Lurie. This gives a suitable approach for describing highly structured objects from homotopy theory. A central example, treated at length, is the theory of E_infinity spaces: this has a tidy combinatorial description in terms of span diagrams of finite sets. We introduce a theory of distributive laws, allowing us to describe objects with two distributing E_infinity stuctures. From this we produce a theory of E_infinity ring spaces. We also study grouplike objects, and produce theories modelling infinite loop spaces (or connective spectra), and infinite loop spaces with coherent multiplicative structure (or connective ring spectra). We use this to construct the units of a grouplike E_infinity ring space in a natural manner. Lastly we provide a speculative pleasant description of the K-theory of monoidal quasicategories and quasicategories with ring-like structures.

  7. Role of division algebra in seven-dimensional gauge theory

    NASA Astrophysics Data System (ADS)

    Kalauni, Pushpa; Barata, J. C. A.

    2015-03-01

    The algebra of octonions 𝕆 forms the largest normed division algebra over the real numbers ℝ, complex numbers ℂ and quaternions ℍ. The usual three-dimensional vector product is given by quaternions, while octonions produce seven-dimensional vector product. Thus, octonionic algebra is closely related to the seven-dimensional algebra, therefore one can extend generalization of rotations in three dimensions to seven dimensions using octonions. An explicit algebraic description of octonions has been given to describe rotational transformation in seven-dimensional space. We have also constructed a gauge theory based on non-associative algebra to discuss Yang-Mills theory and field equation in seven-dimensional space.

  8. Algebraic K-theory, K-regularity, and -duality of -stable C ∗-algebras

    NASA Astrophysics Data System (ADS)

    Mahanta, Snigdhayan

    2015-12-01

    We develop an algebraic formalism for topological -duality. More precisely, we show that topological -duality actually induces an isomorphism between noncommutative motives that in turn implements the well-known isomorphism between twisted K-theories (up to a shift). In order to establish this result we model topological K-theory by algebraic K-theory. We also construct an E ∞ -operad starting from any strongly self-absorbing C ∗-algebra . Then we show that there is a functorial topological K-theory symmetric spectrum construction on the category of separable C ∗-algebras, such that is an algebra over this operad; moreover, is a module over this algebra. Along the way we obtain a new symmetric spectra valued functorial model for the (connective) topological K-theory of C ∗-algebras. We also show that -stable C ∗-algebras are K-regular providing evidence for a conjecture of Rosenberg. We conclude with an explicit description of the algebraic K-theory of a x+ b-semigroup C ∗-algebras coming from number theory and that of -stabilized noncommutative tori.

  9. Quantum field theories on algebraic curves. I. Additive bosons

    NASA Astrophysics Data System (ADS)

    Takhtajan, Leon A.

    2013-04-01

    Using Serre's adelic interpretation of cohomology, we develop a `differential and integral calculus' on an algebraic curve X over an algebraically closed field k of constants of characteristic zero, define algebraic analogues of additive multi-valued functions on X and prove the corresponding generalized residue theorem. Using the representation theory of the global Heisenberg algebra and lattice Lie algebra, we formulate quantum field theories of additive and charged bosons on an algebraic curve X. These theories are naturally connected with the algebraic de Rham theorem. We prove that an extension of global symmetries (Witten's additive Ward identities) from the k-vector space of rational functions on X to the vector space of additive multi-valued functions uniquely determines these quantum theories of additive and charged bosons.

  10. Learning Intermediate Algebra with Graphing Calculator in Community College: A Study of Graphing Calculator Implementation

    ERIC Educational Resources Information Center

    Reznichenko, Nataliya

    2012-01-01

    Since technology has taken its place in almost all classrooms in schools and colleges across the country, there is a need to know how technology influences the mathematics that is taught and how students learn. In this study, the graphing calculator (GC) (namely the Texas Instruments TI-83) was implemented as a tool to enhance learning of function…

  11. Chemical Graph Theory--The Mathematical Connection

    NASA Astrophysics Data System (ADS)

    Gutman, Ivan

    The impact that research done in chemical graph theory (CGT) had and has on "serious" or "pure" mathematics is examined. Although this impact is minor, it is not fully negligible. By means of two case studies we intend to demonstrate the following general features of the CGT --> Mathematics connection: (a) Scholars familiar with chemistry design a mathematical model of the examined chemical phenomena; (b) such a model may require the usage of non-trivial mathematical objects and methods, and may lead to difficult and interesting mathematical problems; (c) in order to grasp the significance of a particular mathematical object/method/problem of CGT, mathematicians need a very long time, sometimes as much as 20-30 years; (d) once this significance is recognized, a vigorous mathematical research begins; (e) mathematicians usually generalize and extend the original object/method/problem of CGT, and the results they obtain may be lacking value for CGT. The two case studies pertain to the graph energy and the connectivity (or Randic) index.

  12. Metric Lie 3-algebras in Bagger-Lambert theory

    NASA Astrophysics Data System (ADS)

    de Medeiros, Paul; Figueroa-O'Farrill, José; Méndez-Escobar, Elena

    2008-08-01

    We recast physical properties of the Bagger-Lambert theory, such as shift-symmetry and decoupling of ghosts, the absence of scale and parity invariance, in Lie 3-algebraic terms, thus motivating the study of metric Lie 3-algebras and their Lie algebras of derivations. We prove a structure theorem for metric Lie 3-algebras in arbitrary signature showing that they can be constructed out of the simple and one-dimensional Lie 3-algebras iterating two constructions: orthogonal direct sum and a new construction called a double extension, by analogy with the similar construction for Lie algebras. We classify metric Lie 3-algebras of signature (2, p) and study their Lie algebras of derivations, including those which preserve the conformal class of the inner product. We revisit the 3-algebraic criteria spelt out at the start of the paper and select those algebras with signature (2, p) which satisfy them, as well as indicate the construction of more general metric Lie 3-algebras satisfying the ghost-decoupling criterion.

  13. Orders on Intervals Over Partially Ordered Sets: Extending Allen's Algebra and Interval Graph Results

    SciTech Connect

    Zapata, Francisco; Kreinovich, Vladik; Joslyn, Cliff A.; Hogan, Emilie A.

    2013-08-01

    To make a decision, we need to compare the values of quantities. In many practical situations, we know the values with interval uncertainty. In such situations, we need to compare intervals. Allen’s algebra describes all possible relations between intervals on the real line, and ordering relations between such intervals are well studied. In this paper, we extend this description to intervals in an arbitrary partially ordered set (poset). In particular, we explicitly describe ordering relations between intervals that generalize relation between points. As auxiliary results, we provide a logical interpretation of the relation between intervals, and extend the results about interval graphs to intervals over posets.

  14. Generative Graph Prototypes from Information Theory.

    PubMed

    Han, Lin; Wilson, Richard C; Hancock, Edwin R

    2015-10-01

    In this paper we present a method for constructing a generative prototype for a set of graphs by adopting a minimum description length approach. The method is posed in terms of learning a generative supergraph model from which the new samples can be obtained by an appropriate sampling mechanism. We commence by constructing a probability distribution for the occurrence of nodes and edges over the supergraph. We encode the complexity of the supergraph using an approximate Von Neumann entropy. A variant of the EM algorithm is developed to minimize the description length criterion in which the structure of the supergraph and the node correspondences between the sample graphs and the supergraph are treated as missing data. To generate new graphs, we assume that the nodes and edges of graphs arise under independent Bernoulli distributions and sample new graphs according to their node and edge occurrence probabilities. Empirical evaluations on real-world databases demonstrate the practical utility of the proposed algorithm and show the effectiveness of the generative model for the tasks of graph classification, graph clustering and generating new sample graphs. PMID:26340255

  15. Graph-based linear scaling electronic structure theory

    NASA Astrophysics Data System (ADS)

    Niklasson, Anders M. N.; Mniszewski, Susan M.; Negre, Christian F. A.; Cawkwell, Marc J.; Swart, Pieter J.; Mohd-Yusof, Jamal; Germann, Timothy C.; Wall, Michael E.; Bock, Nicolas; Rubensson, Emanuel H.; Djidjev, Hristo

    2016-06-01

    We show how graph theory can be combined with quantum theory to calculate the electronic structure of large complex systems. The graph formalism is general and applicable to a broad range of electronic structure methods and materials, including challenging systems such as biomolecules. The methodology combines well-controlled accuracy, low computational cost, and natural low-communication parallelism. This combination addresses substantial shortcomings of linear scaling electronic structure theory, in particular with respect to quantum-based molecular dynamics simulations.

  16. Graph-based linear scaling electronic structure theory.

    PubMed

    Niklasson, Anders M N; Mniszewski, Susan M; Negre, Christian F A; Cawkwell, Marc J; Swart, Pieter J; Mohd-Yusof, Jamal; Germann, Timothy C; Wall, Michael E; Bock, Nicolas; Rubensson, Emanuel H; Djidjev, Hristo

    2016-06-21

    We show how graph theory can be combined with quantum theory to calculate the electronic structure of large complex systems. The graph formalism is general and applicable to a broad range of electronic structure methods and materials, including challenging systems such as biomolecules. The methodology combines well-controlled accuracy, low computational cost, and natural low-communication parallelism. This combination addresses substantial shortcomings of linear scaling electronic structure theory, in particular with respect to quantum-based molecular dynamics simulations. PMID:27334148

  17. Applications of graph theory to landscape genetics

    PubMed Central

    Garroway, Colin J; Bowman, Jeff; Carr, Denis; Wilson, Paul J

    2008-01-01

    We investigated the relationships among landscape quality, gene flow, and population genetic structure of fishers (Martes pennanti) in ON, Canada. We used graph theory as an analytical framework considering each landscape as a network node. The 34 nodes were connected by 93 edges. Network structure was characterized by a higher level of clustering than expected by chance, a short mean path length connecting all pairs of nodes, and a resiliency to the loss of highly connected nodes. This suggests that alleles can be efficiently spread through the system and that extirpations and conservative harvest are not likely to affect their spread. Two measures of node centrality were negatively related to both the proportion of immigrants in a node and node snow depth. This suggests that central nodes are producers of emigrants, contain high-quality habitat (i.e., deep snow can make locomotion energetically costly) and that fishers were migrating from high to low quality habitat. A method of community detection on networks delineated five genetic clusters of nodes suggesting cryptic population structure. Our analyses showed that network models can provide system-level insight into the process of gene flow with implications for understanding how landscape alterations might affect population fitness and evolutionary potential. PMID:25567802

  18. Guidelines for the CSMP K-6 Curriculum in Graph Theory.

    ERIC Educational Resources Information Center

    Deskins, W. E.; And Others

    This volume is designed for teachers preparing to teach upper elementary students using the Comprehensive School Mathematics Program (CSMP) curriculum. It begins with a discussion of the importance of graph theory in mathematics and science. A mathematical development of graph-theoretic concepts and theorems is presented, followed by a set of…

  19. Fourier theory and C∗-algebras

    NASA Astrophysics Data System (ADS)

    Bédos, Erik; Conti, Roberto

    2016-07-01

    We discuss a number of results concerning the Fourier series of elements in reduced twisted group C∗-algebras of discrete groups, and, more generally, in reduced crossed products associated to twisted actions of discrete groups on unital C∗-algebras. A major part of the article gives a review of our previous work on this topic, but some new results are also included.

  20. A theory for graph-based language specification, analysis, and mapping with application to the development of parallel software

    SciTech Connect

    Bailor, P.D.

    1989-01-01

    This investigation develops a generalized formal language theory model and associated theorems for the specification, analysis, and mapping of graphs and graph-based languages. The developed model is defined as a graph generative system, and the model is analyzed from a set theoretic, formal language, algebraic, and abstract automata perspective. As a result of the analysis, numerous theorems pertaining to the properties of the model, graphs, and graph-based languages are derived. Additionally, the graph generative system model serves as the basis for applying graph-based languages to areas such as the specification and design of software and visual programming. The specific application area emphasized is the use of graph-based languages as user friendly interfaces for wide-spectrum languages that include structures for representing parallelism. The goal of this approach is to provide an effective, efficient, and formal method for the specification, design, and rapid prototyping of parallel software. To demonstrate the utility of the theory and the feasibility of the application, two models of parallel computation are chosen. The widely used Petri net model of parallel computation is formalized as a graph-based language. The Petri net syntax is formally mapped into the corresponding syntax of a Communicating Sequential Processes (CSP) model of parallel computation where CSP is used as the formalism for extended wide-spectrum languages. Finally, the Petri net to CSP mapping is analyzed from a behavioral perspective to demonstrate that the CSP specification formally behaves in a manner equivalent to the Petri net model.

  1. Theory for graph-based language specification, analysis, and mapping with application to the development of parallel software. Doctoral thesis

    SciTech Connect

    Bailor, P.D.

    1989-09-01

    Ageneralized formal language theory model and associated theorems were developed for the specification, analysis, and mapping of graphs and graph-based languages. The developed model, defined as a graph-generative system, is analyzed from a set theoretic, formal language, algebraic, and abstract automata perspective. As a result of the analysis, numerous theorems pertaining to the properties of the model, graphs, and graph-based languages are derived. The graph generative system model also serves as the basis for applying graph based languages to areas such as the specification and design of software and visual programming. The specific application area emphasized is the use of graph-based languages as user-friendly interfaces for wide-spectrum languages that include structures for representing parallelism. The goal of this approach is to provide an effective, efficient, and formal method for the specification, design, and rapid prototyping of parallel software. To demonstrate the theory's utility and the feasibility of the application, two models of parallel computation are chosen. The widely used Petri net model of parallel computation is formalized as a graph-based language. The Petri net syntax is formally mapped into the corresponding syntax of a Communicating Sequential Processes(CSP) model of parallel computation where CSP is used as the formalism for extended wide-spectrum languages. Finally, the Petri net to CSP mapping is analyzed to demonstrate that the CSP specification formally behaves in a manner equivalent to the Petri net model.

  2. Graph Theory In Protein Sequence Clustering And Tertiary Structural Matching

    NASA Astrophysics Data System (ADS)

    Abdullah, Rosni; Rashid, Nur'Aini Abdul; Othman, Fazilah

    2008-01-01

    The principle of graph theory which has been widely used in computer networks is now being adopted for work in protein clustering, protein structural matching, and protein folding and modeling. In this work, we present two case studies on the use of graph theory for protein clustering and tertiary structural matching. In protein clustering, we extended a clustering algorithm based on a maximal clique while in the protein tertiary structural matching we explored the bipartite graph matching algorithm. The results obtained in both the case studies will be presented.

  3. Symmetric linear systems - An application of algebraic systems theory

    NASA Technical Reports Server (NTRS)

    Hazewinkel, M.; Martin, C.

    1983-01-01

    Dynamical systems which contain several identical subsystems occur in a variety of applications ranging from command and control systems and discretization of partial differential equations, to the stability augmentation of pairs of helicopters lifting a large mass. Linear models for such systems display certain obvious symmetries. In this paper, we discuss how these symmetries can be incorporated into a mathematical model that utilizes the modern theory of algebraic systems. Such systems are inherently related to the representation theory of algebras over fields. We will show that any control scheme which respects the dynamical structure either implicitly or explicitly uses the underlying algebra.

  4. Rasch Measurement Theory, the Method of Paired Comparisons, and Graph Theory.

    ERIC Educational Resources Information Center

    Garner, Mary; Engelhard, George, Jr.

    This paper considers the following questions: (1) what is the relationship between the method of paired comparisons and Rasch measurement theory? (2) what is the relationship between the method of paired comparisons and graph theory? and (3) what can graph theory contribute to the understanding of Rasch measurement theory? It is specifically shown…

  5. The arithmetic theory of algebraic groups

    NASA Astrophysics Data System (ADS)

    Platonov, V. P.

    1982-06-01

    CONTENTS Introduction § 1. Arithmetic groups § 2. Adèle groups § 3. Tamagawa numbers § 4. Approximations in algebraic groups § 5. Class numbers and class groups of algebraic groups § 6. The genus problem in arithmetic groups § 7. Classification of maximal arithmetic subgroups § 8. The congruence problem § 9. Groups of rational points over global fields § 10. Galois cohomology and the Hasse principle § 11. Cohomology of arithmetic groups References

  6. Entanglement witnesses for graph states: General theory and examples

    SciTech Connect

    Jungnitsch, Bastian; Moroder, Tobias; Guehne, Otfried

    2011-09-15

    We present a general theory for the construction of witnesses that detect genuine multipartite entanglement in graph states. First, we present explicit witnesses for all graph states of up to six qubits which are better than all criteria so far. Therefore, lower fidelities are required in experiments that aim at the preparation of graph states. Building on these results, we develop analytical methods to construct two different types of entanglement witnesses for general graph states. For many classes of states, these operators exhibit white noise tolerances that converge to 1 when increasing the number of particles. We illustrate our approach for states such as the linear and the 2D cluster state. Finally, we study an entanglement monotone motivated by our approach for graph states.

  7. Applications of graph theory in protein structure identification.

    PubMed

    Yan, Yan; Zhang, Shenggui; Wu, Fang-Xiang

    2011-01-01

    There is a growing interest in the identification of proteins on the proteome wide scale. Among different kinds of protein structure identification methods, graph-theoretic methods are very sharp ones. Due to their lower costs, higher effectiveness and many other advantages, they have drawn more and more researchers' attention nowadays. Specifically, graph-theoretic methods have been widely used in homology identification, side-chain cluster identification, peptide sequencing and so on. This paper reviews several methods in solving protein structure identification problems using graph theory. We mainly introduce classical methods and mathematical models including homology modeling based on clique finding, identification of side-chain clusters in protein structures upon graph spectrum, and de novo peptide sequencing via tandem mass spectrometry using the spectrum graph model. In addition, concluding remarks and future priorities of each method are given. PMID:22165974

  8. Graph theory in structure-property correlations

    NASA Astrophysics Data System (ADS)

    Vinogradova, M. G.; Fedina, Yu. A.; Papulov, Yu. G.

    2016-02-01

    The possibilities of the theoretical graph approach to the construction and interpretation of additive schemes for calculation and prediction are discussed. Working formulas are derived for calculating the thermodynamic properties of alkanes and their substitutes. The obtained algorithms are used to calculate thermodynamic properties of chloroalkanes that correspond to experimental values.

  9. The Effect of Graphing Calculators on Student Achievement in College Algebra and Pre-Calculus Mathematics Courses

    ERIC Educational Resources Information Center

    Hatem, Neil

    2010-01-01

    This study investigates the relationship between the use of graphing calculators employed as Type II technology and student achievement, as determined by assessing students' problem solving skills associated with the concept of function, at the college algebra and pre-calculus level. In addition, this study explores the integration of graphing…

  10. Using Graphing Software to Teach about Algebraic Forms: A Study of Technology-Supported Practice in Secondary-School Mathematics

    ERIC Educational Resources Information Center

    Ruthven, Kenneth; Deaney, Rosemary; Hennessy, Sara

    2009-01-01

    From preliminary analysis of teacher-nominated examples of successful technology-supported practice in secondary-school mathematics, the use of graphing software to teach about algebraic forms was identified as being an important archetype. Employing evidence from lesson observation and teacher interview, such practice was investigated in greater…

  11. Quantifying Riverscape Connectivity with Graph Theory

    NASA Astrophysics Data System (ADS)

    Carbonneau, P.; Milledge, D.; Sinha, R.; Tandon, S. K.

    2013-12-01

    Fluvial catchments convey fluxes of water, sediment, nutrients and aquatic biota. At continental scales, crustal topography defines the overall path of channels whilst at local scales depositional and/or erosional features generally determine the exact path of a channel. Furthermore, constructions such as dams, for either water abstraction or hydropower, often have a significant impact on channel networks.The concept of ';connectivity' is commonly invoked when conceptualising the structure of a river network.This concept is easy to grasp but there have been uneven efforts across the environmental sciences to actually quantify connectivity. Currently there have only been a few studies reporting quantitative indices of connectivity in river sciences, notably, in the study of avulsion processes. However, the majority of current work describing some form of environmental connectivity in a quantitative manner is in the field of landscape ecology. Driven by the need to quantify habitat fragmentation, landscape ecologists have returned to graph theory. Within this formal setting, landscape ecologists have successfully developed a range of indices which can model connectivity loss. Such formal connectivity metrics are currently needed for a range of applications in fluvial sciences. One of the most urgent needs relates to dam construction. In the developed world, hydropower development has generally slowed and in many countries, dams are actually being removed. However, this is not the case in the developing world where hydropower is seen as a key element to low-emissions power-security. For example, several dam projects are envisaged in Himalayan catchments in the next 2 decades. This region is already under severe pressure from climate change and urbanisation, and a better understanding of the network fragmentation which can be expected in this system is urgently needed. In this paper, we apply and adapt connectivity metrics from landscape ecology. We then examine the

  12. Three-Dimensional Algebraic Models of the tRNA Code and 12 Graphs for Representing the Amino Acids.

    PubMed

    José, Marco V; Morgado, Eberto R; Guimarães, Romeu Cardoso; Zamudio, Gabriel S; de Farías, Sávio Torres; Bobadilla, Juan R; Sosa, Daniela

    2014-01-01

    Three-dimensional algebraic models, also called Genetic Hotels, are developed to represent the Standard Genetic Code, the Standard tRNA Code (S-tRNA-C), and the Human tRNA code (H-tRNA-C). New algebraic concepts are introduced to be able to describe these models, to wit, the generalization of the 2n-Klein Group and the concept of a subgroup coset with a tail. We found that the H-tRNA-C displayed broken symmetries in regard to the S-tRNA-C, which is highly symmetric. We also show that there are only 12 ways to represent each of the corresponding phenotypic graphs of amino acids. The averages of statistical centrality measures of the 12 graphs for each of the three codes are carried out and they are statistically compared. The phenotypic graphs of the S-tRNA-C display a common triangular prism of amino acids in 10 out of the 12 graphs, whilst the corresponding graphs for the H-tRNA-C display only two triangular prisms. The graphs exhibit disjoint clusters of amino acids when their polar requirement values are used. We contend that the S-tRNA-C is in a frozen-like state, whereas the H-tRNA-C may be in an evolving state. PMID:25370377

  13. Three-Dimensional Algebraic Models of the tRNA Code and 12 Graphs for Representing the Amino Acids

    PubMed Central

    José, Marco V.; Morgado, Eberto R.; Guimarães, Romeu Cardoso; Zamudio, Gabriel S.; de Farías, Sávio Torres; Bobadilla, Juan R.; Sosa, Daniela

    2014-01-01

    Three-dimensional algebraic models, also called Genetic Hotels, are developed to represent the Standard Genetic Code, the Standard tRNA Code (S-tRNA-C), and the Human tRNA code (H-tRNA-C). New algebraic concepts are introduced to be able to describe these models, to wit, the generalization of the 2n-Klein Group and the concept of a subgroup coset with a tail. We found that the H-tRNA-C displayed broken symmetries in regard to the S-tRNA-C, which is highly symmetric. We also show that there are only 12 ways to represent each of the corresponding phenotypic graphs of amino acids. The averages of statistical centrality measures of the 12 graphs for each of the three codes are carried out and they are statistically compared. The phenotypic graphs of the S-tRNA-C display a common triangular prism of amino acids in 10 out of the 12 graphs, whilst the corresponding graphs for the H-tRNA-C display only two triangular prisms. The graphs exhibit disjoint clusters of amino acids when their polar requirement values are used. We contend that the S-tRNA-C is in a frozen-like state, whereas the H-tRNA-C may be in an evolving state. PMID:25370377

  14. From string theory to algebraic geometry and back

    SciTech Connect

    Brinzanescu, Vasile

    2011-02-10

    We describe some facts in physics which go up to the modern string theory and the related concepts in algebraic geometry. Then we present some recent results on moduli-spaces of vector bundles on non-Kaehler Calabi-Yau 3-folds and their consequences for heterotic string theory.

  15. Equity trees and graphs via information theory

    NASA Astrophysics Data System (ADS)

    Harré, M.; Bossomaier, T.

    2010-01-01

    We investigate the similarities and differences between two measures of the relationship between equities traded in financial markets. Our measures are the correlation coefficients and the mutual information. In the context of financial markets correlation coefficients are well established whereas mutual information has not previously been as well studied despite its theoretically appealing properties. We show that asset trees which are derived from either the correlation coefficients or the mutual information have a mixture of both similarities and differences at the individual equity level and at the macroscopic level. We then extend our consideration from trees to graphs using the "genus 0" condition recently introduced in order to study the networks of equities.

  16. A Cohomology Theory of Grading-Restricted Vertex Algebras

    NASA Astrophysics Data System (ADS)

    Huang, Yi-Zhi

    2014-04-01

    We introduce a cohomology theory of grading-restricted vertex algebras. To construct the correct cohomologies, we consider linear maps from tensor powers of a grading-restricted vertex algebra to "rational functions valued in the algebraic completion of a module for the algebra," instead of linear maps from tensor powers of the algebra to a module for the algebra. One subtle complication arising from such functions is that we have to carefully address the issue of convergence when we compose these linear maps with vertex operators. In particular, for each , we have an inverse system of nth cohomologies and an additional nth cohomology of a grading-restricted vertex algebra V with coefficients in a V-module W such that is isomorphic to the inverse limit of the inverse system . In the case of n = 2, there is an additional second cohomology denoted by which will be shown in a sequel to the present paper to correspond to what we call square-zero extensions of V and to first order deformations of V when W = V.

  17. Algebraic isomorphism in two-dimensional anomalous gauge theories

    SciTech Connect

    Carvalhaes, C.G.; Natividade, C.P.

    1997-08-01

    The operator solution of the anomalous chiral Schwinger model is discussed on the basis of the general principles of Wightman field theory. Some basic structural properties of the model are analyzed taking a careful control on the Hilbert space associated with the Wightman functions. The isomorphism between gauge noninvariant and gauge invariant descriptions of the anomalous theory is established in terms of the corresponding field algebras. We show that (i) the {Theta}-vacuum representation and (ii) the suggested equivalence of vector Schwinger model and chiral Schwinger model cannot be established in terms of the intrinsic field algebra. {copyright} 1997 Academic Press, Inc.

  18. Graph theory findings in the pathophysiology of temporal lobe epilepsy

    PubMed Central

    Chiang, Sharon; Haneef, Zulfi

    2014-01-01

    Temporal lobe epilepsy (TLE) is the most common form of adult epilepsy. Accumulating evidence has shown that TLE is a disorder of abnormal epileptogenic networks, rather than focal sources. Graph theory allows for a network-based representation of TLE brain networks, and has potential to illuminate characteristics of brain topology conducive to TLE pathophysiology, including seizure initiation and spread. We review basic concepts which we believe will prove helpful in interpreting results rapidly emerging from graph theory research in TLE. In addition, we summarize the current state of graph theory findings in TLE as they pertain its pathophysiology. Several common findings have emerged from the many modalities which have been used to study TLE using graph theory, including structural MRI, diffusion tensor imaging, surface EEG, intracranial EEG, magnetoencephalography, functional MRI, cell cultures, simulated models, and mouse models, involving increased regularity of the interictal network configuration, altered local segregation and global integration of the TLE network, and network reorganization of temporal lobe and limbic structures. As different modalities provide different views of the same phenomenon, future studies integrating data from multiple modalities are needed to clarify findings and contribute to the formation of a coherent theory on the pathophysiology of TLE. PMID:24831083

  19. Graph theory findings in the pathophysiology of temporal lobe epilepsy.

    PubMed

    Chiang, Sharon; Haneef, Zulfi

    2014-07-01

    Temporal lobe epilepsy (TLE) is the most common form of adult epilepsy. Accumulating evidence has shown that TLE is a disorder of abnormal epileptogenic networks, rather than focal sources. Graph theory allows for a network-based representation of TLE brain networks, and has potential to illuminate characteristics of brain topology conducive to TLE pathophysiology, including seizure initiation and spread. We review basic concepts which we believe will prove helpful in interpreting results rapidly emerging from graph theory research in TLE. In addition, we summarize the current state of graph theory findings in TLE as they pertain its pathophysiology. Several common findings have emerged from the many modalities which have been used to study TLE using graph theory, including structural MRI, diffusion tensor imaging, surface EEG, intracranial EEG, magnetoencephalography, functional MRI, cell cultures, simulated models, and mouse models, involving increased regularity of the interictal network configuration, altered local segregation and global integration of the TLE network, and network reorganization of temporal lobe and limbic structures. As different modalities provide different views of the same phenomenon, future studies integrating data from multiple modalities are needed to clarify findings and contribute to the formation of a coherent theory on the pathophysiology of TLE. PMID:24831083

  20. Applying Directed Graph Theory to Faculty Contact Structure.

    ERIC Educational Resources Information Center

    House, Ernest R.; Long, John M.

    Although recent writings indicate the importance of personal contact structures in diffusing innovations and in determining perceptions, the internal contact structure of the school faculty remains unexamined. This study applies directed graph theory, a new branch of mathematics, to analyzing school contact structure. Sociometric data and…

  1. Category of trees in representation theory of quantum algebras

    SciTech Connect

    Moskaliuk, N. M.; Moskaliuk, S. S.

    2013-10-15

    New applications of categorical methods are connected with new additional structures on categories. One of such structures in representation theory of quantum algebras, the category of Kuznetsov-Smorodinsky-Vilenkin-Smirnov (KSVS) trees, is constructed, whose objects are finite rooted KSVS trees and morphisms generated by the transition from a KSVS tree to another one.

  2. Algebraic K-theory of discrete subgroups of Lie groups.

    PubMed

    Farrell, F T; Jones, L E

    1987-05-01

    Let G be a Lie group (with finitely many connected components) and Gamma be a discrete, cocompact, torsion-free subgroup of G. We rationally calculate the algebraic K-theory of the integral group ring ZGamma in terms of the homology of Gamma with trivial rational coefficients. PMID:16593834

  3. Algebraic K-theory of discrete subgroups of Lie groups

    PubMed Central

    Farrell, F. T.; Jones, L. E.

    1987-01-01

    Let G be a Lie group (with finitely many connected components) and Γ be a discrete, cocompact, torsion-free subgroup of G. We rationally calculate the algebraic K-theory of the integral group ring ZΓ in terms of the homology of Γ with trivial rational coefficients. PMID:16593834

  4. Partial Fractions in Calculus, Number Theory, and Algebra

    ERIC Educational Resources Information Center

    Yackel, C. A.; Denny, J. K.

    2007-01-01

    This paper explores the development of the method of partial fraction decomposition from elementary number theory through calculus to its abstraction in modern algebra. This unusual perspective makes the topic accessible and relevant to readers from high school through seasoned calculus instructors.

  5. Dynamic modeling of electrochemical systems using linear graph theory

    NASA Astrophysics Data System (ADS)

    Dao, Thanh-Son; McPhee, John

    An electrochemical cell is a multidisciplinary system which involves complex chemical, electrical, and thermodynamical processes. The primary objective of this paper is to develop a linear graph-theoretical modeling for the dynamic description of electrochemical systems through the representation of the system topologies. After a brief introduction to the topic and a review of linear graphs, an approach to develop linear graphs for electrochemical systems using a circuitry representation is discussed, followed in turn by the use of the branch and chord transformation techniques to generate final dynamic equations governing the system. As an example, the application of linear graph theory to modeling a nickel metal hydride (NiMH) battery will be presented. Results show that not only the number of equations are reduced significantly, but also the linear graph model simulates faster compared to the original lumped parameter model. The approach presented in this paper can be extended to modeling complex systems such as an electric or hybrid electric vehicle where a battery pack is interconnected with other components in many different domains.

  6. Forms and algebras in (half-)maximal supergravity theories

    NASA Astrophysics Data System (ADS)

    Howe, Paul; Palmkvist, Jakob

    2015-05-01

    The forms in D-dimensional (half-)maximal supergravity theories are discussed for 3 ≤ D ≤ 11. Superspace methods are used to derive consistent sets of Bianchi identities for all the forms for all degrees, and to show that they are soluble and fully compatible with supersymmetry. The Bianchi identities determine Lie superalgebras that can be extended to Borcherds superalgebras of a special type. It is shown that any Borcherds superalgebra of this type gives the same form spectrum, up to an arbitrary degree, as an associated Kac-Moody algebra. For maximal supergravity up to D-form potentials, this is the very extended Kac-Moody algebra E 11. It is also shown how gauging can be carried out in a simple fashion by deforming the Bianchi identities by means of a new algebraic element related to the embedding tensor. In this case the appropriate extension of the form algebra is a truncated version of the so-called tensor hierarchy algebra.

  7. Edge covers and independence: Algebraic approach

    NASA Astrophysics Data System (ADS)

    Kalinina, E. A.; Khitrov, G. M.; Pogozhev, S. V.

    2016-06-01

    In this paper, linear algebra methods are applied to solve some problems of graph theory. For ordinary connected graphs, edge coverings and independent sets are considered. Some results concerning minimum edge covers and maximum matchings are proved with the help of linear algebraic approach. The problem of finding a maximum matching of a graph is fundamental both practically and theoretically, and has numerous applications, e.g., in computational chemistry and mathematical chemistry.

  8. How to teach mono-unary algebras and functional graphs with the use of computers in secondary schools

    NASA Astrophysics Data System (ADS)

    Binterová, Helena; Fuchs, Eduard

    2014-07-01

    In this paper, alternative descriptions of functions are demonstrated with the use of a computer. If we understand functions as mono-unary algebraic functions or functional graphs, it is possible, even at the school level, to suitably present many of their characteristics. First, we describe cyclic graphs of constant and linear functions, which are a part of the upper-secondary level educational curriculum. Students are usually surprised by the unexpected characteristics of such simple functions which cannot be revealed using the traditional Cartesian graphing. The next part of the paper deals with the characteristics of functional graphs of quadratic functions, which play an important role in school mathematics and in applications, for instance, in the description of non-linear processes. We show that their description is much more complicated. In contrast to functional graphs of linear functions, it is necessary to use computers. Students can find space for their own individual exploration to reveal lines of interesting characteristics of quadratic functions, which give students a new view on this part of school mathematics.

  9. Stationary waves on nonlinear quantum graphs: General framework and canonical perturbation theory

    NASA Astrophysics Data System (ADS)

    Gnutzmann, Sven; Waltner, Daniel

    2016-03-01

    In this paper we present a general framework for solving the stationary nonlinear Schrödinger equation (NLSE) on a network of one-dimensional wires modeled by a metric graph with suitable matching conditions at the vertices. A formal solution is given that expresses the wave function and its derivative at one end of an edge (wire) nonlinearly in terms of the values at the other end. For the cubic NLSE this nonlinear transfer operation can be expressed explicitly in terms of Jacobi elliptic functions. Its application reduces the problem of solving the corresponding set of coupled ordinary nonlinear differential equations to a finite set of nonlinear algebraic equations. For sufficiently small amplitudes we use canonical perturbation theory, which makes it possible to extract the leading nonlinear corrections over large distances.

  10. Stationary waves on nonlinear quantum graphs: General framework and canonical perturbation theory.

    PubMed

    Gnutzmann, Sven; Waltner, Daniel

    2016-03-01

    In this paper we present a general framework for solving the stationary nonlinear Schrödinger equation (NLSE) on a network of one-dimensional wires modeled by a metric graph with suitable matching conditions at the vertices. A formal solution is given that expresses the wave function and its derivative at one end of an edge (wire) nonlinearly in terms of the values at the other end. For the cubic NLSE this nonlinear transfer operation can be expressed explicitly in terms of Jacobi elliptic functions. Its application reduces the problem of solving the corresponding set of coupled ordinary nonlinear differential equations to a finite set of nonlinear algebraic equations. For sufficiently small amplitudes we use canonical perturbation theory, which makes it possible to extract the leading nonlinear corrections over large distances. PMID:27078341

  11. Infinite Dimensional Algebras and 2+1 Dimensional Field Theory:. yet another View of gl(∞) Some New Algebras

    NASA Astrophysics Data System (ADS)

    Hoppe, Jens

    Over the past years, associative algebras have come to play a major role in several areas of theoretical physics. Firstly, it has been realized that Yang Baxter algebras [1] constitute the relevant structure underlying 1+1 dimensional integrable models; in addition, their relation to braid groups, the theory of knots and links, and the exchange algebras of 1+1 dimensional conformal field theories [2] has been quite well understood by now. Secondly, deformations of Poisson structures that appeared in 2+1 dimensional field theories as infinite dimensional symmetry algebras possess underlying associative structures, which have also been studied in some detail (concerning higher spin theories see, e.g., [3, 4] and references therein, concerning the enveloping algebra of sl(2, C) see, e.g., [5], concerning deformations of diffAT2 — the Lie algebra of infinitesimal area preserving diffeomorphisms of the Torus — see [6, 7, 8, 9]). Ideas on how both investigations could eventually converge (i.e., a relation between 2+1 and 1+1 dimensions) have, e.g., been expressed in [10]. As indicated by the two subtitles there will be two parts to my paper: the first one presents a view on something I met long ago [11], and recently got interested in again [5, 7, 9, 12], while the second part introduces some algebraic structures that seem to be interesting, and possibly new.

  12. Non-simply laced Lie algebras via F theory strings

    NASA Astrophysics Data System (ADS)

    Bonora, L.; Savelli, R.

    2010-11-01

    In order to describe the appearance in F theory of the non-simply-laced Lie algebras, we use the representation of symmetry enhancements by means of string junctions. After an introduction to the techniques used to describe symmetry enhancement, that is algebraic geometry, BPS states analysis and string junctions, we concentrate on the latter. We give an explicit description of the folding of D 2n to B n , of the folding of E 6 to F 4 and that of D 4 to G 2 in terms of junctions and Jordan strings. We also discuss the case of C n , but we are unable in this case to provide a string interpretation.

  13. Do malaria parasites follow the algebra of sex ratio theory?

    PubMed

    Schall, Jos J

    2009-03-01

    The ratio of male to female gametocytes seen in infections of Plasmodium and related haemosporidian parasites varies substantially, both within and among parasite species. Sex ratio theory, a mainstay of evolutionary biology, accounts for this variation. The theory provides an algebraic solution for the optimal sex ratio that will maximize parasite fitness. A crucial term in this solution is the probability of selfing by clone-mates within the vector (based on the clone number and their relative abundance). Definitive tests of the theory have proven elusive because of technical challenges in measuring clonal diversity within infections. Newly developed molecular methods now provide opportunities to test the theory with an exquisite precision. PMID:19201653

  14. Functional connectivity and graph theory in preclinical Alzheimer's disease.

    PubMed

    Brier, Matthew R; Thomas, Jewell B; Fagan, Anne M; Hassenstab, Jason; Holtzman, David M; Benzinger, Tammie L; Morris, John C; Ances, Beau M

    2014-04-01

    Alzheimer's disease (AD) has a long preclinical phase in which amyloid and tau cerebral pathology accumulate without producing cognitive symptoms. Resting state functional connectivity magnetic resonance imaging has demonstrated that brain networks degrade during symptomatic AD. It is unclear to what extent these degradations exist before symptomatic onset. In this study, we investigated graph theory metrics of functional integration (path length), functional segregation (clustering coefficient), and functional distinctness (modularity) as a function of disease severity. Further, we assessed whether these graph metrics were affected in cognitively normal participants with cerebrospinal fluid evidence of preclinical AD. Clustering coefficient and modularity, but not path length, were reduced in AD. Cognitively normal participants who harbored AD biomarker pathology also showed reduced values in these graph measures, demonstrating brain changes similar to, but smaller than, symptomatic AD. Only modularity was significantly affected by age. We also demonstrate that AD has a particular effect on hub-like regions in the brain. We conclude that AD causes large-scale disconnection that is present before onset of symptoms. PMID:24216223

  15. The Effect of Instruction with Graphing Calculators on How General Mathematics Students Naturalistically Solve Algebraic Problems.

    ERIC Educational Resources Information Center

    Merriweather, Michelle; Tharp, Marcia L.

    1999-01-01

    Focuses on changes in attitude toward mathematics and calculator use and changes in how general mathematics students naturalistically solve algebraic problems. Uses a survey to determine whether a student is rule-based. Concludes that the rule-based students used an equation to solve the algebraic word problem whereas the non-rule-based students…

  16. Graph Theory Roots of Spatial Operators for Kinematics and Dynamics

    NASA Technical Reports Server (NTRS)

    Jain, Abhinandan

    2011-01-01

    Spatial operators have been used to analyze the dynamics of robotic multibody systems and to develop novel computational dynamics algorithms. Mass matrix factorization, inversion, diagonalization, and linearization are among several new insights obtained using such operators. While initially developed for serial rigid body manipulators, the spatial operators and the related mathematical analysis have been shown to extend very broadly including to tree and closed topology systems, to systems with flexible joints, links, etc. This work uses concepts from graph theory to explore the mathematical foundations of spatial operators. The goal is to study and characterize the properties of the spatial operators at an abstract level so that they can be applied to a broader range of dynamics problems. The rich mathematical properties of the kinematics and dynamics of robotic multibody systems has been an area of strong research interest for several decades. These properties are important to understand the inherent physical behavior of systems, for stability and control analysis, for the development of computational algorithms, and for model development of faithful models. Recurring patterns in spatial operators leads one to ask the more abstract question about the properties and characteristics of spatial operators that make them so broadly applicable. The idea is to step back from the specific application systems, and understand more deeply the generic requirements and properties of spatial operators, so that the insights and techniques are readily available across different kinematics and dynamics problems. In this work, techniques from graph theory were used to explore the abstract basis for the spatial operators. The close relationship between the mathematical properties of adjacency matrices for graphs and those of spatial operators and their kernels were established. The connections hold across very basic requirements on the system topology, the nature of the component

  17. Using Combinatorica/Mathematica for Student Projects in Random Graph Theory

    ERIC Educational Resources Information Center

    Pfaff, Thomas J.; Zaret, Michele

    2006-01-01

    We give an example of a student project that experimentally explores a topic in random graph theory. We use the "Combinatorica" package in "Mathematica" to estimate the minimum number of edges needed in a random graph to have a 50 percent chance that the graph is connected. We provide the "Mathematica" code and compare it to the known theoretical…

  18. n-Nucleotide circular codes in graph theory.

    PubMed

    Fimmel, Elena; Michel, Christian J; Strüngmann, Lutz

    2016-03-13

    The circular code theory proposes that genes are constituted of two trinucleotide codes: the classical genetic code with 61 trinucleotides for coding the 20 amino acids (except the three stop codons {TAA,TAG,TGA}) and a circular code based on 20 trinucleotides for retrieving, maintaining and synchronizing the reading frame. It relies on two main results: the identification of a maximal C(3) self-complementary trinucleotide circular code X in genes of bacteria, eukaryotes, plasmids and viruses (Michel 2015 J. Theor. Biol. 380, 156-177. (doi:10.1016/j.jtbi.2015.04.009); Arquès & Michel 1996 J. Theor. Biol. 182, 45-58. (doi:10.1006/jtbi.1996.0142)) and the finding of X circular code motifs in tRNAs and rRNAs, in particular in the ribosome decoding centre (Michel 2012 Comput. Biol. Chem. 37, 24-37. (doi:10.1016/j.compbiolchem.2011.10.002); El Soufi & Michel 2014 Comput. Biol. Chem. 52, 9-17. (doi:10.1016/j.compbiolchem.2014.08.001)). The univerally conserved nucleotides A1492 and A1493 and the conserved nucleotide G530 are included in X circular code motifs. Recently, dinucleotide circular codes were also investigated (Michel & Pirillo 2013 ISRN Biomath. 2013, 538631. (doi:10.1155/2013/538631); Fimmel et al. 2015 J. Theor. Biol. 386, 159-165. (doi:10.1016/j.jtbi.2015.08.034)). As the genetic motifs of different lengths are ubiquitous in genes and genomes, we introduce a new approach based on graph theory to study in full generality n-nucleotide circular codes X, i.e. of length 2 (dinucleotide), 3 (trinucleotide), 4 (tetranucleotide), etc. Indeed, we prove that an n-nucleotide code X is circular if and only if the corresponding graph [Formula: see text] is acyclic. Moreover, the maximal length of a path in [Formula: see text] corresponds to the window of nucleotides in a sequence for detecting the correct reading frame. Finally, the graph theory of tournaments is applied to the study of dinucleotide circular codes. It has full equivalence between the combinatorics

  19. On the algebraic K-theory of the complex K-theory spectrum

    NASA Astrophysics Data System (ADS)

    Ausoni, Christian

    2010-03-01

    Let p>3 be a prime, let ku be the connective complex K-theory spectrum, and let K(ku) be the algebraic K-theory spectrum of ku. We study the p-primary homotopy type of the spectrum K(ku) by computing its mod (p,v_1) homotopy groups. We show that up to a finite summand, these groups form a finitely generated free module over a polynomial algebra F_p[b], where b is a class of degree 2p+2 defined as a higher Bott element.

  20. Topological insulators and C*-algebras: Theory and numerical practice

    SciTech Connect

    Hastings, Matthew B.; Loring, Terry A.

    2011-07-15

    Research Highlights: > We classify topological insulators using C* algebras. > We present new K-theory invariants. > We develop efficient numerical algorithms based on this technique. > We observe unexpected quantum phase transitions using our algorithm. - Abstract: We apply ideas from C*-algebra to the study of disordered topological insulators. We extract certain almost commuting matrices from the free Fermi Hamiltonian, describing band projected coordinate matrices. By considering topological obstructions to approximating these matrices by exactly commuting matrices, we are able to compute invariants quantifying different topological phases. We generalize previous two dimensional results to higher dimensions; we give a general expression for the topological invariants for arbitrary dimension and several symmetry classes, including chiral symmetry classes, and we present a detailed K-theory treatment of this expression for time reversal invariant three dimensional systems. We can use these results to show non-existence of localized Wannier functions for these systems. We use this approach to calculate the index for time-reversal invariant systems with spin-orbit scattering in three dimensions, on sizes up to 12{sup 3}, averaging over a large number of samples. The results show an interesting separation between the localization transition and the point at which the average index (which can be viewed as an 'order parameter' for the topological insulator) begins to fluctuate from sample to sample, implying the existence of an unsuspected quantum phase transition separating two different delocalized phases in this system. One of the particular advantages of the C*-algebraic technique that we present is that it is significantly faster in practice than other methods of computing the index, allowing the study of larger systems. In this paper, we present a detailed discussion of numerical implementation of our method.

  1. Calculation of exchange energies using algebraic perturbation theory

    SciTech Connect

    Burrows, B. L.; Dalgarno, A.; Cohen, M.

    2010-04-15

    An algebraic perturbation theory is presented for efficient calculations of localized states and hence of exchange energies, which are the differences between low-lying states of the valence electron of a molecule, formed by the collision of an ion Y{sup +} with an atom X. For the case of a homonuclear molecule these are the gerade and ungerade states and the exchange energy is an exponentially decreasing function of the internuclear distance. For such homonuclear systems the theory is used in conjunction with the Herring-Holstein technique to give accurate exchange energies for a range of intermolecular separations R. Since the perturbation parameter is essentially 1/R, this method is suitable for large R. In particular, exchange energies are calculated for X{sub 2}{sup +} systems, where X is H, Li, Na, K, Rb, or Cs.

  2. COMMENT: Comment on `Dirac theory in spacetime algebra'

    NASA Astrophysics Data System (ADS)

    Baylis, William E.

    2002-06-01

    In contrast to formulations of the Dirac theory by Hestenes and by the present author, the formulation recently presented by Joyce (Joyce W P 2001 J. Phys. A: Math. Gen. 34 1991-2005) is equivalent to the usual Dirac equation only in the case of vanishing mass. For nonzero mass, solutions to Joyce's equation can be solutions either of the Dirac equation in the Hestenes form or of the same equation with the sign of the mass reversed, and in general they are mixtures of the two possibilities. Because of this relationship, Joyce obtains twice as many linearly independent plane-wave solutions for a given momentum eigenvalue as exist in the conventional theory. A misconception about the symmetry of the Hestenes equation and the geometric significance of the algebraic spinors is also briefly discussed.

  3. Graph theory approach for match reduction in image mosaicing.

    PubMed

    Elibol, Armagan; Gracias, Nuno; Garcia, Rafael; Kim, Jinwhan

    2014-04-01

    One of the crucial steps in image mosaicing is global alignment, which requires finding the best image registration parameters by employing nonlinear minimization methods over correspondences between overlapping image pairs for a dataset. Based on graph theory, we propose a simple but efficient method to reduce the number of overlapping image pairs without any noticeable effect on the final mosaic quality. This reduction significantly lowers the computational cost of the image mosaicing process. The proposed method can be applied in a topology estimation process to reduce the number of image matching attempts. The method has been validated through experiments on challenging underwater image sequences obtained during sea trials with different unmanned underwater vehicles. PMID:24695139

  4. Automatic cone photoreceptor segmentation using graph theory and dynamic programming

    PubMed Central

    Chiu, Stephanie J.; Lokhnygina, Yuliya; Dubis, Adam M.; Dubra, Alfredo; Carroll, Joseph; Izatt, Joseph A.; Farsiu, Sina

    2013-01-01

    Geometrical analysis of the photoreceptor mosaic can reveal subclinical ocular pathologies. In this paper, we describe a fully automatic algorithm to identify and segment photoreceptors in adaptive optics ophthalmoscope images of the photoreceptor mosaic. This method is an extension of our previously described closed contour segmentation framework based on graph theory and dynamic programming (GTDP). We validated the performance of the proposed algorithm by comparing it to the state-of-the-art technique on a large data set consisting of over 200,000 cones and posted the results online. We found that the GTDP method achieved a higher detection rate, decreasing the cone miss rate by over a factor of five. PMID:23761854

  5. Topological insulators and C∗-algebras: Theory and numerical practice

    NASA Astrophysics Data System (ADS)

    Hastings, Matthew B.; Loring, Terry A.

    2011-07-01

    We apply ideas from C∗-algebra to the study of disordered topological insulators. We extract certain almost commuting matrices from the free Fermi Hamiltonian, describing band projected coordinate matrices. By considering topological obstructions to approximating these matrices by exactly commuting matrices, we are able to compute invariants quantifying different topological phases. We generalize previous two dimensional results to higher dimensions; we give a general expression for the topological invariants for arbitrary dimension and several symmetry classes, including chiral symmetry classes, and we present a detailed K-theory treatment of this expression for time reversal invariant three dimensional systems. We can use these results to show non-existence of localized Wannier functions for these systems. We use this approach to calculate the index for time-reversal invariant systems with spin-orbit scattering in three dimensions, on sizes up to 12 3, averaging over a large number of samples. The results show an interesting separation between the localization transition and the point at which the average index (which can be viewed as an "order parameter" for the topological insulator) begins to fluctuate from sample to sample, implying the existence of an unsuspected quantum phase transition separating two different delocalized phases in this system. One of the particular advantages of the C∗-algebraic technique that we present is that it is significantly faster in practice than other methods of computing the index, allowing the study of larger systems. In this paper, we present a detailed discussion of numerical implementation of our method.

  6. K-theory of the chair tiling via AF-algebras

    NASA Astrophysics Data System (ADS)

    Julien, Antoine; Savinien, Jean

    2016-08-01

    We compute the K-theory groups of the groupoid C∗-algebra of the chair tiling, using a new method. We use exact sequences of Putnam to compute these groups from the K-theory groups of the AF-algebras of the substitution and the induced lower dimensional substitutions on edges and vertices.

  7. Graph Theory and Its Application in Educational Research: A Review and Integration.

    ERIC Educational Resources Information Center

    Tatsuoka, Maurice M.

    1986-01-01

    A nontechnical exposition of graph theory is presented, followed by survey of the literature on applications of graph theory in research in education and related disciplines. Applications include order-theoretic studies of the dimensionality of data sets, the investigation of hierarchical structures in various domains, and cluster analysis.…

  8. Alternative Representations for Algebraic Problem Solving: When Are Graphs Better than Equations?

    ERIC Educational Resources Information Center

    Mielicki, Marta K.; Wiley, Jennifer

    2016-01-01

    Successful algebraic problem solving entails adaptability of solution methods using different representations. Prior research has suggested that students are more likely to prefer symbolic solution methods (equations) over graphical ones, even when graphical methods should be more efficient. However, this research has not tested how representation…

  9. On a programming language for graph algorithms

    NASA Technical Reports Server (NTRS)

    Rheinboldt, W. C.; Basili, V. R.; Mesztenyi, C. K.

    1971-01-01

    An algorithmic language, GRAAL, is presented for describing and implementing graph algorithms of the type primarily arising in applications. The language is based on a set algebraic model of graph theory which defines the graph structure in terms of morphisms between certain set algebraic structures over the node set and arc set. GRAAL is modular in the sense that the user specifies which of these mappings are available with any graph. This allows flexibility in the selection of the storage representation for different graph structures. In line with its set theoretic foundation, the language introduces sets as a basic data type and provides for the efficient execution of all set and graph operators. At present, GRAAL is defined as an extension of ALGOL 60 (revised) and its formal description is given as a supplement to the syntactic and semantic definition of ALGOL. Several typical graph algorithms are written in GRAAL to illustrate various features of the language and to show its applicability.

  10. Solutions in bosonic string field theory and higher spin algebras in AdS

    NASA Astrophysics Data System (ADS)

    Polyakov, Dimitri

    2015-11-01

    We find a class of analytic solutions in open bosonic string field theory, parametrized by the chiral copy of higher spin algebra in AdS3. The solutions are expressed in terms of the generating function for the products of Bell polynomials in derivatives of bosonic space-time coordinates Xm(z ) of the open string, the form of which is determined in this work. The products of these polynomials form a natural operator algebra realizations of w∞ (area-preserving diffeomorphisms), enveloping algebra of SU(2) and higher spin algebra in AdS3. The class of string field theory solutions found can, in turn, be interpreted as the "enveloping of enveloping," or the enveloping of AdS3 higher spin algebra. We also discuss the extensions of this class of solutions to superstring theory and their relations to higher spin algebras in higher space-time dimensions.

  11. The Clifford algebra of physical space and Dirac theory

    NASA Astrophysics Data System (ADS)

    Vaz, Jayme, Jr.

    2016-09-01

    The claim found in many textbooks that the Dirac equation cannot be written solely in terms of Pauli matrices is shown to not be completely true. It is only true as long as the term β \\psi in the usual Dirac factorization of the Klein–Gordon equation is assumed to be the product of a square matrix β and a column matrix ψ. In this paper we show that there is another possibility besides this matrix product, in fact a possibility involving a matrix operation, and show that it leads to another possible expression for the Dirac equation. We show that, behind this other possible factorization is the formalism of the Clifford algebra of physical space. We exploit this fact, and discuss several different aspects of Dirac theory using this formalism. In particular, we show that there are four different possible sets of definitions for the parity, time reversal, and charge conjugation operations for the Dirac equation.

  12. Quantization of gauge fields, graph polynomials and graph homology

    SciTech Connect

    Kreimer, Dirk; Sars, Matthias; Suijlekom, Walter D. van

    2013-09-15

    We review quantization of gauge fields using algebraic properties of 3-regular graphs. We derive the Feynman integrand at n loops for a non-abelian gauge theory quantized in a covariant gauge from scalar integrands for connected 3-regular graphs, obtained from the two Symanzik polynomials. The transition to the full gauge theory amplitude is obtained by the use of a third, new, graph polynomial, the corolla polynomial. This implies effectively a covariant quantization without ghosts, where all the relevant signs of the ghost sector are incorporated in a double complex furnished by the corolla polynomial–we call it cycle homology–and by graph homology. -- Highlights: •We derive gauge theory Feynman from scalar field theory with 3-valent vertices. •We clarify the role of graph homology and cycle homology. •We use parametric renormalization and the new corolla polynomial.

  13. Graph theory as a proxy for spatially explicit population models in conservation planning.

    PubMed

    Minor, Emily S; Urban, Dean L

    2007-09-01

    Spatially explicit population models (SEPMs) are often considered the best way to predict and manage species distributions in spatially heterogeneous landscapes. However, they are computationally intensive and require extensive knowledge of species' biology and behavior, limiting their application in many cases. An alternative to SEPMs is graph theory, which has minimal data requirements and efficient algorithms. Although only recently introduced to landscape ecology, graph theory is well suited to ecological applications concerned with connectivity or movement. This paper compares the performance of graph theory to a SEPM in selecting important habitat patches for Wood Thrush (Hylocichla mustelina) conservation. We use both models to identify habitat patches that act as population sources and persistent patches and also use graph theory to identify patches that act as stepping stones for dispersal. Correlations of patch rankings were very high between the two models. In addition, graph theory offers the ability to identify patches that are very important to habitat connectivity and thus long-term population persistence across the landscape. We show that graph theory makes very similar predictions in most cases and in other cases offers insight not available from the SEPM, and we conclude that graph theory is a suitable and possibly preferable alternative to SEPMs for species conservation in heterogeneous landscapes. PMID:17913139

  14. Coupling graph perturbation theory with scalable parallel algorithms for large-scale enumeration of maximal cliques in biological graphs

    NASA Astrophysics Data System (ADS)

    Samatova, N. F.; Schmidt, M. C.; Hendrix, W.; Breimyer, P.; Thomas, K.; Park, B.-H.

    2008-07-01

    Data-driven construction of predictive models for biological systems faces challenges from data intensity, uncertainty, and computational complexity. Data-driven model inference is often considered a combinatorial graph problem where an enumeration of all feasible models is sought. The data-intensive and the NP-hard nature of such problems, however, challenges existing methods to meet the required scale of data size and uncertainty, even on modern supercomputers. Maximal clique enumeration (MCE) in a graph derived from such biological data is often a rate-limiting step in detecting protein complexes in protein interaction data, finding clusters of co-expressed genes in microarray data, or identifying clusters of orthologous genes in protein sequence data. We report two key advances that address this challenge. We designed and implemented the first (to the best of our knowledge) parallel MCE algorithm that scales linearly on thousands of processors running MCE on real-world biological networks with thousands and hundreds of thousands of vertices. In addition, we proposed and developed the Graph Perturbation Theory (GPT) that establishes a foundation for efficiently solving the MCE problem in perturbed graphs, which model the uncertainty in the data. GPT formulates necessary and sufficient conditions for detecting the differences between the sets of maximal cliques in the original and perturbed graphs and reduces the enumeration time by more than 80% compared to complete recomputation.

  15. A Theory of Graphs for Reading Comprehension and Writing Communication.

    ERIC Educational Resources Information Center

    Fry, Edward

    Graphs are increasingly being used in written communication and writers expect readers to understand them. One definition of graphs--information transmitted by position of point, line or area on a two dimensional surface--excludes displays composed chiefly of numbers or words such as tables or outlines. However, it does include time lines, flow…

  16. Hopf algebras and topological recursion

    NASA Astrophysics Data System (ADS)

    Esteves, João N.

    2015-11-01

    We consider a model for topological recursion based on the Hopf algebra of planar binary trees defined by Loday and Ronco (1998 Adv. Math. 139 293-309 We show that extending this Hopf algebra by identifying pairs of nearest neighbor leaves, and thus producing graphs with loops, we obtain the full recursion formula discovered by Eynard and Orantin (2007 Commun. Number Theory Phys. 1 347-452).

  17. Scheduling for indoor visible light communication based on graph theory.

    PubMed

    Tao, Yuyang; Liang, Xiao; Wang, Jiaheng; Zhao, Chunming

    2015-02-01

    Visible light communication (VLC) has drawn much attention in the field of high-rate indoor wireless communication. While most existing works focused on point-to-point VLC technologies, few studies have concerned multiuser VLC, where multiple optical access points (APs) transmit data to multiple user receivers. In such scenarios, inter-user interference constitutes the major factor limiting the system performance. Therefore, a proper scheduling scheme has to be proposed to coordinate the interference and optimize the whole system performance. In this work, we aim to maximize the sum rate of the system while taking into account user fairness by appropriately assigning LED lamps to multiple users. The formulated scheduling problem turns out to be a maximum weighted independent set problem. We then propose a novel and efficient resource allocation method based on graph theory to achieve high sum rates. Moreover, we also introduce proportional fairness into our scheduling scheme to ensure the user fairness. Our proposed scheduling scheme can, with low complexity, achieve more multiplexing gains, higher sum rate, and better fairness than the existing works. PMID:25836136

  18. Fragmentation network of doubly charged methionine: Interpretation using graph theory.

    PubMed

    Ha, D T; Yamazaki, K; Wang, Y; Alcamí, M; Maeda, S; Kono, H; Martín, F; Kukk, E

    2016-09-01

    The fragmentation of doubly charged gas-phase methionine (HO2CCH(NH2)CH2CH2SCH3) is systematically studied using the self-consistent charge density functional tight-binding molecular dynamics (MD) simulation method. We applied graph theory to analyze the large number of the calculated MD trajectories, which appears to be a highly effective and convenient means of extracting versatile information from the large data. The present theoretical results strongly concur with the earlier studied experimental ones. Essentially, the dication dissociates into acidic group CO2H and basic group C4NSH10. The former may carry a single or no charge and stays intact in most cases, whereas the latter may hold either a single or a double charge and tends to dissociate into smaller fragments. The decay of the basic group is observed to follow the Arrhenius law. The dissociation pathways to CO2H and C4NSH10 and subsequent fragmentations are also supported by ab initio calculations. PMID:27608997

  19. A Brief Historical Introduction to Euler's Formula for Polyhedra, Topology, Graph Theory and Networks

    ERIC Educational Resources Information Center

    Debnath, Lokenath

    2010-01-01

    This article is essentially devoted to a brief historical introduction to Euler's formula for polyhedra, topology, theory of graphs and networks with many examples from the real-world. Celebrated Konigsberg seven-bridge problem and some of the basic properties of graphs and networks for some understanding of the macroscopic behaviour of real…

  20. Clifford Algebra Cℓ 3(ℂ) for Applications to Field Theories

    NASA Astrophysics Data System (ADS)

    Panicaud, B.

    2011-10-01

    The multivectorial algebras present yet both an academic and a technological interest. Difficulties can occur for their use. Indeed, in all applications care is taken to distinguish between polar and axial vectors and between scalars and pseudo scalars. Then a total of eight elements are often considered even if they are not given the correct name of multivectors. Eventually because of their simplicity, only the vectorial algebra or the quaternions algebra are explicitly used for physical applications. Nevertheless, it should be more convenient to use directly more complex algebras in order to have a wider range of application. The aim of this paper is to inquire into one particular Clifford algebra which could solve this problem. The present study is both didactic concerning its construction and pragmatic because of the introduced applications. The construction method is not an original one. But this latter allows to build up the associated real algebra as well as a peculiar formalism that enables a formal analogy with the classical vectorial algebra. Finally several fields of the theoretical physics will be described thanks to this algebra, as well as a more applied case in general relativity emphasizing simultaneously its relative validity in this particular domain and the easiness of modeling some physical problems.

  1. Fibonacci Identities, Matrices, and Graphs

    ERIC Educational Resources Information Center

    Huang, Danrun

    2005-01-01

    General strategies used to help discover, prove, and generalize identities for Fibonacci numbers are described along with some properties about the determinants of square matrices. A matrix proof for identity (2) that has received immense attention from many branches of mathematics, like linear algebra, dynamical systems, graph theory and others…

  2. Chemical Applications of Graph Theory: Part I. Fundamentals and Topological Indices.

    ERIC Educational Resources Information Center

    Hansen, Peter J.; Jurs, Peter C.

    1988-01-01

    Explores graph theory and use of topological indices to predict boiling points. Lists three indices: Wiener Number, Randic Branching Index and Molecular Connectivity, and Molecular Identification numbers. Warns of inadequacies with stereochemistry. (ML)

  3. Perturbative quantization of Yang-Mills theory with classical double as gauge algebra

    NASA Astrophysics Data System (ADS)

    Ruiz Ruiz, F.

    2016-02-01

    Perturbative quantization of Yang-Mills theory with a gauge algebra given by the classical double of a semisimple Lie algebra is considered. The classical double of a real Lie algebra is a nonsemisimple real Lie algebra that admits a nonpositive definite invariant metric, the indefiniteness of the metric suggesting an apparent lack of unitarity. It is shown that the theory is UV divergent at one loop and that there are no radiative corrections at higher loops. One-loop UV divergences are removed through renormalization of the coupling constant, thus introducing a renormalization scale. The terms in the classical action that would spoil unitarity are proved to be cohomologically trivial with respect to the Slavnov-Taylor operator that controls gauge invariance for the quantum theory. Hence they do not contribute gauge invariant radiative corrections to the quantum effective action and the theory is unitary.

  4. Algebraic methods for diagonalization of a quaternion matrix in quaternionic quantum theory

    SciTech Connect

    Jiang Tongsong

    2005-05-01

    By means of complex representation and real representation of a quaternion matrix, this paper studies the problem of diagonalization of a quaternion matrix, gives two algebraic methods for diagonalization of quaternion matrices in quaternionic quantum theory.

  5. Realization theory and quadratic optimal controllers for systems defined over Banach and Frechet algebras

    NASA Technical Reports Server (NTRS)

    Byrnes, C. I.

    1980-01-01

    It is noted that recent work by Kamen (1979) on the stability of half-plane digital filters shows that the problem of the existence of a feedback law also arises for other Banach algebras in applications. This situation calls for a realization theory and stabilizability criteria for systems defined over Banach for Frechet algebra A. Such a theory is developed here, with special emphasis placed on the construction of finitely generated realizations, the existence of coprime factorizations for T(s) defined over A, and the solvability of the quadratic optimal control problem and the associated algebraic Riccati equation over A.

  6. A brief historical introduction to Euler's formula for polyhedra, topology, graph theory and networks

    NASA Astrophysics Data System (ADS)

    Debnath, Lokenath

    2010-09-01

    This article is essentially devoted to a brief historical introduction to Euler's formula for polyhedra, topology, theory of graphs and networks with many examples from the real-world. Celebrated Königsberg seven-bridge problem and some of the basic properties of graphs and networks for some understanding of the macroscopic behaviour of real physical systems are included. We also mention some important and modern applications of graph theory or network problems from transportation to telecommunications. Graphs or networks are effectively used as powerful tools in industrial, electrical and civil engineering, communication networks in the planning of business and industry. Graph theory and combinatorics can be used to understand the changes that occur in many large and complex scientific, technical and medical systems. With the advent of fast large computers and the ubiquitous Internet consisting of a very large network of computers, large-scale complex optimization problems can be modelled in terms of graphs or networks and then solved by algorithms available in graph theory. Many large and more complex combinatorial problems dealing with the possible arrangements of situations of various kinds, and computing the number and properties of such arrangements can be formulated in terms of networks. The Knight's tour problem, Hamilton's tour problem, problem of magic squares, the Euler Graeco-Latin squares problem and their modern developments in the twentieth century are also included.

  7. Detecting labor using graph theory on connectivity matrices of uterine EMG.

    PubMed

    Al-Omar, S; Diab, A; Nader, N; Khalil, M; Karlsson, B; Marque, C

    2015-08-01

    Premature labor is one of the most serious health problems in the developed world. One of the main reasons for this is that no good way exists to distinguish true labor from normal pregnancy contractions. The aim of this paper is to investigate if the application of graph theory techniques to multi-electrode uterine EMG signals can improve the discrimination between pregnancy contractions and labor. To test our methods we first applied them to synthetic graphs where we detected some differences in the parameters results and changes in the graph model from pregnancy-like graphs to labor-like graphs. Then, we applied the same methods to real signals. We obtained the best differentiation between pregnancy and labor through the same parameters. Major improvements in differentiating between pregnancy and labor were obtained using a low pass windowing preprocessing step. Results show that real graphs generally became more organized when moving from pregnancy, where the graph showed random characteristics, to labor where the graph became a more small-world like graph. PMID:26736726

  8. Time-dependence of graph theory metrics in functional connectivity analysis.

    PubMed

    Chiang, Sharon; Cassese, Alberto; Guindani, Michele; Vannucci, Marina; Yeh, Hsiang J; Haneef, Zulfi; Stern, John M

    2016-01-15

    Brain graphs provide a useful way to computationally model the network structure of the connectome, and this has led to increasing interest in the use of graph theory to quantitate and investigate the topological characteristics of the healthy brain and brain disorders on the network level. The majority of graph theory investigations of functional connectivity have relied on the assumption of temporal stationarity. However, recent evidence increasingly suggests that functional connectivity fluctuates over the length of the scan. In this study, we investigate the stationarity of brain network topology using a Bayesian hidden Markov model (HMM) approach that estimates the dynamic structure of graph theoretical measures of whole-brain functional connectivity. In addition to extracting the stationary distribution and transition probabilities of commonly employed graph theory measures, we propose two estimators of temporal stationarity: the S-index and N-index. These indexes can be used to quantify different aspects of the temporal stationarity of graph theory measures. We apply the method and proposed estimators to resting-state functional MRI data from healthy controls and patients with temporal lobe epilepsy. Our analysis shows that several graph theory measures, including small-world index, global integration measures, and betweenness centrality, may exhibit greater stationarity over time and therefore be more robust. Additionally, we demonstrate that accounting for subject-level differences in the level of temporal stationarity of network topology may increase discriminatory power in discriminating between disease states. Our results confirm and extend findings from other studies regarding the dynamic nature of functional connectivity, and suggest that using statistical models which explicitly account for the dynamic nature of functional connectivity in graph theory analyses may improve the sensitivity of investigations and consistency across investigations. PMID

  9. Towards a classification of modular invariant partition functions for theories based on N=4 superconformal algebras

    NASA Astrophysics Data System (ADS)

    Taormina, Anne

    1993-05-01

    The representation theory of the doubly extended N=4 superconformal algebra is reviewed. The modular properties of the corresponding characters can be derived, using characters sumrules for coset realizations of these N=4 algebras. Some particular combinations of massless characters are shown to transform as affine SU(2) characters under S and T, a fact used to completely classify the massless sector of the partition function.

  10. Poor Textural Image Matching Based on Graph Theory

    NASA Astrophysics Data System (ADS)

    Chen, Shiyu; Yuan, Xiuxiao; Yuan, Wei; Cai, Yang

    2016-06-01

    Image matching lies at the heart of photogrammetry and computer vision. For poor textural images, the matching result is affected by low contrast, repetitive patterns, discontinuity or occlusion, few or homogeneous textures. Recently, graph matching became popular for its integration of geometric and radiometric information. Focused on poor textural image matching problem, it is proposed an edge-weight strategy to improve graph matching algorithm. A series of experiments have been conducted including 4 typical landscapes: Forest, desert, farmland, and urban areas. And it is experimentally found that our new algorithm achieves better performance. Compared to SIFT, doubled corresponding points were acquired, and the overall recall rate reached up to 68%, which verifies the feasibility and effectiveness of the algorithm.

  11. Higher gauge theories from Lie n-algebras and off-shell covariantization

    NASA Astrophysics Data System (ADS)

    Carow-Watamura, Ursula; Heller, Marc Andre; Ikeda, Noriaki; Kaneko, Yukio; Watamura, Satoshi

    2016-07-01

    We analyze higher gauge theories in various dimensions using a supergeometric method based on a differential graded symplectic manifold, called a QP-manifold, which is closely related to the BRST-BV formalism in gauge theories. Extensions of the Lie 2-algebra gauge structure are formulated within the Lie n-algebra induced by the QP-structure. We find that in 5 and 6 dimensions there are special extensions of the gauge algebra. In these cases, a restriction of the gauge symmetry by imposing constraints on the auxiliary gauge fields leads to a covariantized theory. As an example we show that we can obtain an off-shell covariantized higher gauge theory in 5 dimensions, which is similar to the one proposed in [1].

  12. Cluster Algebras from Dualities of 2d = (2, 2) Quiver Gauge Theories

    NASA Astrophysics Data System (ADS)

    Benini, Francesco; Park, Daniel S.; Zhao, Peng

    2015-11-01

    We interpret certain Seiberg-like dualities of two-dimensional = (2,2) quiver gauge theories with unitary groups as cluster mutations in cluster algebras, originally formulated by Fomin and Zelevinsky. In particular, we show how the complexified Fayet-Iliopoulos parameters of the gauge group factors transform under those dualities and observe that they are in fact related to the dual cluster variables of cluster algebras. This implies that there is an underlying cluster algebra structure in the quantum Kähler moduli space of manifolds constructed from the corresponding Kähler quotients. We study the S 2 partition function of the gauge theories, showing that it is invariant under dualities/mutations, up to an overall normalization factor, whose physical origin and consequences we spell out in detail. We also present similar dualities in = (2,2)* quiver gauge theories, which are related to dualities of quantum integrable spin chains.

  13. Matched signal detection on graphs: Theory and application to brain imaging data classification.

    PubMed

    Hu, Chenhui; Sepulcre, Jorge; Johnson, Keith A; Fakhri, Georges E; Lu, Yue M; Li, Quanzheng

    2016-01-15

    Motivated by recent progress in signal processing on graphs, we have developed a matched signal detection (MSD) theory for signals with intrinsic structures described by weighted graphs. First, we regard graph Laplacian eigenvalues as frequencies of graph-signals and assume that the signal is in a subspace spanned by the first few graph Laplacian eigenvectors associated with lower eigenvalues. The conventional matched subspace detector can be applied to this case. Furthermore, we study signals that may not merely live in a subspace. Concretely, we consider signals with bounded variation on graphs and more general signals that are randomly drawn from a prior distribution. For bounded variation signals, the test is a weighted energy detector. For the random signals, the test statistic is the difference of signal variations on associated graphs, if a degenerate Gaussian distribution specified by the graph Laplacian is adopted. We evaluate the effectiveness of the MSD on graphs both with simulated and real data sets. Specifically, we apply MSD to the brain imaging data classification problem of Alzheimer's disease (AD) based on two independent data sets: 1) positron emission tomography data with Pittsburgh compound-B tracer of 30 AD and 40 normal control (NC) subjects, and 2) resting-state functional magnetic resonance imaging (R-fMRI) data of 30 early mild cognitive impairment and 20 NC subjects. Our results demonstrate that the MSD approach is able to outperform the traditional methods and help detect AD at an early stage, probably due to the success of exploiting the manifold structure of the data. PMID:26481679

  14. Revealing Long-Range Interconnected Hubs in Human Chromatin Interaction Data Using Graph Theory

    NASA Astrophysics Data System (ADS)

    Boulos, R. E.; Arneodo, A.; Jensen, P.; Audit, B.

    2013-09-01

    We use graph theory to analyze chromatin interaction (Hi-C) data in the human genome. We show that a key functional feature of the genome—“master” replication origins—corresponds to DNA loci of maximal network centrality. These loci form a set of interconnected hubs both within chromosomes and between different chromosomes. Our results open the way to a fruitful use of graph theory concepts to decipher DNA structural organization in relation to genome functions such as replication and transcription. This quantitative information should prove useful to discriminate between possible polymer models of nuclear organization.

  15. Wigner-Racah Algebra Approach to Caselle-Ponzano Fusion Rules

    NASA Astrophysics Data System (ADS)

    Nomura, Masao

    1991-07-01

    Caselle-Ponzano fusion rules, based on graph theory, are investigated in the framework of Wigner-Racah algebras. While in the graph theory parameters of fusion rules are taken over specific values, the restriction of parameters is removed in the present formalism. Formal extension to q-analogs is also given.

  16. Classification of operator algebraic conformal field theories in dimensions one and two

    NASA Astrophysics Data System (ADS)

    Kawahigashi, Yasuyuki

    2006-03-01

    We formulate conformal field theory in the setting of algebraic quantum field theory as Haag-Kastler nets of local observable algebras with diffeomorphism covariance on the two-dimensional Minkowski space. We then obtain a decomposition of a two-dimensional theory into two chiral theories. We give the first classification result of such chiral theories with representation theoretic invariants. That is, we use the central charge as the first invariant, and if it is less than 1, we obtain a complete classification. Our classification list contains a new net which does not seem to arise from the known constructions such as the coset or orbifold constructions. We also present a classification of full two-dimensional conformal theories. These are joint works with Roberto Longo.

  17. Insights into the organization of biochemical regulatory networks using graph theory analyses.

    PubMed

    Ma'ayan, Avi

    2009-02-27

    Graph theory has been a valuable mathematical modeling tool to gain insights into the topological organization of biochemical networks. There are two types of insights that may be obtained by graph theory analyses. The first provides an overview of the global organization of biochemical networks; the second uses prior knowledge to place results from multivariate experiments, such as microarray data sets, in the context of known pathways and networks to infer regulation. Using graph analyses, biochemical networks are found to be scale-free and small-world, indicating that these networks contain hubs, which are proteins that interact with many other molecules. These hubs may interact with many different types of proteins at the same time and location or at different times and locations, resulting in diverse biological responses. Groups of components in networks are organized in recurring patterns termed network motifs such as feedback and feed-forward loops. Graph analysis revealed that negative feedback loops are less common and are present mostly in proximity to the membrane, whereas positive feedback loops are highly nested in an architecture that promotes dynamical stability. Cell signaling networks have multiple pathways from some input receptors and few from others. Such topology is reminiscent of a classification system. Signaling networks display a bow-tie structure indicative of funneling information from extracellular signals and then dispatching information from a few specific central intracellular signaling nexuses. These insights show that graph theory is a valuable tool for gaining an understanding of global regulatory features of biochemical networks. PMID:18940806

  18. Equivariant algebraic vector bundles over representations of reductive groups: theory.

    PubMed Central

    Masuda, M; Petrie, T

    1991-01-01

    Let G be a reductive algebraic group and let B be an affine variety with an algebraic action of G. Everything is defined over the field C of complex numbers. Consider the trivial G-vector bundle B x S = S over B where S is a G-module. From the endomorphism ring R of the G-vector bundle S a construction of G-vector bundles over B is given. The bundles constructed this way have the property that when added to S they are isomorphic to F + S for a fixed G-module F. For such a bundle E an invariant rho(E) is defined that lies in a quotient of R. This invariant allows us to distinguish nonisomorphic G-vector bundles. This is applied to the case where B is a G-module and, in that case, an invariant of the underlying equivariant variety is given too. These constructions and invariants are used to produce families of inequivalent G-vector bundles over G-modules and families of inequivalent G actions on affine spaces for some finite and some connected semisimple groups. PMID:11607220

  19. Topics in Computational Learning Theory and Graph Algorithms.

    ERIC Educational Resources Information Center

    Board, Raymond Acton

    This thesis addresses problems from two areas of theoretical computer science. The first area is that of computational learning theory, which is the study of the phenomenon of concept learning using formal mathematical models. The goal of computational learning theory is to investigate learning in a rigorous manner through the use of techniques…

  20. Comparing Brain Networks of Different Size and Connectivity Density Using Graph Theory

    PubMed Central

    van Wijk, Bernadette C. M.; Stam, Cornelis J.; Daffertshofer, Andreas

    2010-01-01

    Graph theory is a valuable framework to study the organization of functional and anatomical connections in the brain. Its use for comparing network topologies, however, is not without difficulties. Graph measures may be influenced by the number of nodes (N) and the average degree (k) of the network. The explicit form of that influence depends on the type of network topology, which is usually unknown for experimental data. Direct comparisons of graph measures between empirical networks with different N and/or k can therefore yield spurious results. We list benefits and pitfalls of various approaches that intend to overcome these difficulties. We discuss the initial graph definition of unweighted graphs via fixed thresholds, average degrees or edge densities, and the use of weighted graphs. For instance, choosing a threshold to fix N and k does eliminate size and density effects but may lead to modifications of the network by enforcing (ignoring) non-significant (significant) connections. Opposed to fixing N and k, graph measures are often normalized via random surrogates but, in fact, this may even increase the sensitivity to differences in N and k for the commonly used clustering coefficient and small-world index. To avoid such a bias we tried to estimate the N,k-dependence for empirical networks, which can serve to correct for size effects, if successful. We also add a number of methods used in social sciences that build on statistics of local network structures including exponential random graph models and motif counting. We show that none of the here-investigated methods allows for a reliable and fully unbiased comparison, but some perform better than others. PMID:21060892

  1. What Can Graph Theory Tell Us about Word Learning and Lexical Retrieval?

    ERIC Educational Resources Information Center

    Vitevitch, Michael S.

    2008-01-01

    Purpose: Graph theory and the new science of networks provide a mathematically rigorous approach to examine the development and organization of complex systems. These tools were applied to the mental lexicon to examine the organization of words in the lexicon and to explore how that structure might influence the acquisition and retrieval of…

  2. Untangling Word Webs: Graph Theory and the Notion of Density in Second Language Word Association Networks.

    ERIC Educational Resources Information Center

    Wilks, Clarissa; Meara, Paul

    2002-01-01

    Examines the implications of the metaphor of the vocabulary network. Takes a formal approach to the exploration of this metaphor by applying the principles of graph theory to word association data to compare the relative densities of the first language and second language lexical networks. (Author/VWL)

  3. A Qualitative Analysis Framework Using Natural Language Processing and Graph Theory

    ERIC Educational Resources Information Center

    Tierney, Patrick J.

    2012-01-01

    This paper introduces a method of extending natural language-based processing of qualitative data analysis with the use of a very quantitative tool--graph theory. It is not an attempt to convert qualitative research to a positivist approach with a mathematical black box, nor is it a "graphical solution". Rather, it is a method to help qualitative…

  4. Superspace formulation in a three-algebra approach to D=3, N=4, 5 superconformal Chern-Simons matter theories

    SciTech Connect

    Chen Famin; Wu Yongshi

    2010-11-15

    We present a superspace formulation of the D=3, N=4, 5 superconformal Chern-Simons Matter theories, with matter supermultiplets valued in a symplectic 3-algebra. We first construct an N=1 superconformal action and then generalize a method used by Gaitto and Witten to enhance the supersymmetry from N=1 to N=5. By decomposing the N=5 supermultiplets and the symplectic 3-algebra properly and proposing a new superpotential term, we construct the N=4 superconformal Chern-Simons matter theories in terms of two sets of generators of a (quaternion) symplectic 3-algebra. The N=4 theories can also be derived by requiring that the supersymmetry transformations are closed on-shell. The relationship between the 3-algebras, Lie superalgebras, Lie algebras, and embedding tensors (proposed in [E. A. Bergshoeff, O. Hohm, D. Roest, H. Samtleben, and E. Sezgin, J. High Energy Phys. 09 (2008) 101.]) is also clarified. The general N=4, 5 superconformal Chern-Simons matter theories in terms of ordinary Lie algebras can be re-derived in our 3-algebra approach. All known N=4, 5 superconformal Chern-Simons matter theories can be recovered in the present superspace formulation for super-Lie algebra realization of symplectic 3-algebras.

  5. Regular perturbation theory of relativistic corrections: II. Algebraic approximation

    NASA Astrophysics Data System (ADS)

    Rutkowski, A.; Kozłowski, R.; Rutkowska, D.

    2001-01-01

    A four-component equivalent of the Schrödinger equation, describing both the nonrelativistic electron and the nonrelativistic positron, is introduced. The difference between this equation and the Dirac equation is treated as a perturbation. The relevant perturbation equations and formulas for corrections to the energy are derived. Owing to the semibounded character of the Schrödinger Hamiltonian of the unperturbed equation the variational perturbation method is formulated. The Hylleraas functionals become then either upper or lower bounds to the respective exact corrections to the energy. In order to demonstrate the usefulness of this approach to the problem of the variational optimization of nonlinear parameters, the perturbation corrections to wave functions for the of hydrogenlike atoms have been approximated in terms of exponential basis functions. The Dirac equation in this algebraic approximation is solved iteratively starting with the solution of the Schrödinger equation.

  6. Graph theory and stability analysis of protein complex interaction networks.

    PubMed

    Huang, Chien-Hung; Chen, Teng-Hung; Ng, Ka-Lok

    2016-04-01

    Protein complexes play an essential role in many biological processes. Complexes can interact with other complexes to form protein complex interaction network (PCIN) that involves in important cellular processes. There are relatively few studies on examining the interaction topology among protein complexes; and little is known about the stability of PCIN under perturbations. We employed graph theoretical approach to reveal hidden properties and features of four species PCINs. Two main issues are addressed, (i) the global and local network topological properties, and (ii) the stability of the networks under 12 types of perturbations. According to the topological parameter classification, we identified some critical protein complexes and validated that the topological analysis approach could provide meaningful biological interpretations of the protein complex systems. Through the Kolmogorov-Smimov test, we showed that local topological parameters are good indicators to characterise the structure of PCINs. We further demonstrated the effectiveness of the current approach by performing the scalability and data normalization tests. To measure the robustness of PCINs, we proposed to consider eight topological-based perturbations, which are specifically applicable in scenarios of targeted, sustained attacks. We found that the degree-based, betweenness-based and brokering-coefficient-based perturbations have the largest effect on network stability. PMID:26997661

  7. Graph theory-based measures as predictors of gene morbidity.

    PubMed

    Massanet-Vila, Raimon; Caminal, Pere; Perera, Alexandre

    2010-01-01

    Previous studies have suggested that some graph properties of protein interaction networks might be related with gene morbidity. In particular, it has been suggested that when a polymorphism affects a gene, it is more likely to produce a disease if the node degree in the interaction network is higher than for other genes. However, these results do not take into account the possible bias introduced by the variance in the amount of information available for different genes. This work models the relationship between the morbidity associated with a gene and the degrees of the nodes in the protein interaction network controlling the amount of information available in the literature. A set of 7461 genes and 3665 disease identifiers reported in the Online Mendelian Inheritance in Man (OMIM) was mined jointly with 9630 nodes and 38756 interactions of the Human Proteome Resource Database (HPRD). The information available from a gene was measured through PubMed mining. Results suggest that the correlation between the degree of a node in the protein interaction network and its morbidity is largely contributed by the information available from the gene. Even though the results suggest a positive correlation between the degree of a node and its morbidity while controlling the information factor, we believe this correlation has to be taken with caution for it can be affected by other factors not taken into account in this study. PMID:21096114

  8. Impaired functional integration in multiple sclerosis: a graph theory study.

    PubMed

    Rocca, Maria A; Valsasina, Paola; Meani, Alessandro; Falini, Andrea; Comi, Giancarlo; Filippi, Massimo

    2016-01-01

    Aim of this study was to explore the topological organization of functional brain network connectivity in a large cohort of multiple sclerosis (MS) patients and to assess whether its disruption contributes to disease clinical manifestations. Graph theoretical analysis was applied to resting state fMRI data from 246 MS patients and 55 matched healthy controls (HC). Functional connectivity between 116 cortical and subcortical brain regions was estimated using a bivariate correlation analysis. Global network properties (network degree, global efficiency, hierarchy, path length and assortativity) were abnormal in MS patients vs HC, and contributed to distinguish cognitively impaired MS patients (34%) from HC, but not the main MS clinical phenotypes. Compared to HC, MS patients also showed: (1) a loss of hubs in the superior frontal gyrus, precuneus and anterior cingulum in the left hemisphere; (2) a different lateralization of basal ganglia hubs (mostly located in the left hemisphere in HC, and in the right hemisphere in MS patients); and (3) a formation of hubs, not seen in HC, in the left temporal pole and cerebellum. MS patients also experienced a decreased nodal degree in the bilateral caudate nucleus and right cerebellum. Such a modification of regional network properties contributed to cognitive impairment and phenotypic variability of MS. An impairment of global integration (likely to reflect a reduced competence in information exchange between distant brain areas) occurs in MS and is associated with cognitive deficits. A regional redistribution of network properties contributes to cognitive status and phenotypic variability of these patients. PMID:25257603

  9. Towards a loop representation of connection theories defined over a super Lie algebra

    SciTech Connect

    Urrutia, L.F. |

    1996-02-01

    The purpose of this contribution is to review some aspects of the loop space formulation of pure gauge theories having the connection defined over a Lie algebra. The emphasis is focused on the discussion of the Mandelstam identities, which provide the basic constraints upon both the classical and the quantum degrees of freedom of the theory. In the case where the connection is extended to be valued on a super Lie algebra, some new results are presented which can be considered as first steps towards the construction of the Mandelstam identities in this situation, which encompasses such interesting cases as supergravity in 3+1 dimensions together with 2+1 super Chern-Simons theories, for example. Also, these ideas could be useful in the loop space formulation of fully supersymmetric theories. {copyright} {ital 1996 American Institute of Physics.}

  10. Towards a loop representation of connection theories defined over a super Lie algebra

    SciTech Connect

    Urrutia, Luis F.

    1996-02-20

    The purpose of this contribution is to review some aspects of the loop space formulation of pure gauge theories having the connection defined over a Lie algebra. The emphasis is focused on the discussion of the Mandelstam identities, which provide the basic constraints upon both the classical and the quantum degrees of freedom of the theory. In the case where the connection is extended to be valued on a super Lie algebra, some new results are presented which can be considered as first steps towards the construction of the Mandelstam identities in this situation, which encompasses such interesting cases as supergravity in 3+1 dimensions together with 2+1 super Chern-Simons theories, for example. Also, these ideas could be useful in the loop space formulation of fully supersymmetric theories.

  11. An algebraic PT-symmetric quantum theory with a maximal mass

    NASA Astrophysics Data System (ADS)

    Rodionov, V. N.; Kravtsova, G. A.

    2016-03-01

    In this paper, we draw attention to the fact that the studies by V.G. Kadyshevsky devoted to the creation of the geometric quantum field theory with a fundamental mass have had great development recently, as regards a non-Hermitian algebraic approach to construction of the quantum theory. The central idea of such theories is to construct a new scalar product in which the average values of non-Hermitian Hamiltonians are real. Many studies in this field include both purely mathematical ones and those containing the discussion of experimental results. We consider the development of an algebraic relativistic pseudo-Hermitian quantum theory with a maximal mass and discuss its experimentally important corollaries.

  12. Experimental demonstration of the connection between quantum contextuality and graph theory

    NASA Astrophysics Data System (ADS)

    Cañas, Gustavo; Acuña, Evelyn; Cariñe, Jaime; Barra, Johanna F.; Gómez, Esteban S.; Xavier, Guilherme B.; Lima, Gustavo; Cabello, Adán

    2016-07-01

    We report a method that exploits a connection between quantum contextuality and graph theory to reveal any form of quantum contextuality in high-precision experiments. We use this technique to identify a graph which corresponds to an extreme form of quantum contextuality unnoticed before and test it using high-dimensional quantum states encoded in the linear transverse momentum of single photons. Our results open the door to the experimental exploration of quantum contextuality in all its forms, including those needed for quantum computation.

  13. Magic bases, metric ansaetze and generalized graph theories in the Virasoro master equation

    SciTech Connect

    Halpern, M.B.; Obers, N.A. )

    1991-11-15

    The authors define a class of magic Lie group bases in which the Virasoro master equation admits a class of simple metric ansaetze (g{sub metric}), whose structure is visible in the high-level expansion. When a magic basis is real on compact g, the corresponding g{sub metric} is a large system of unitary, generically irrational conformal field theories. Examples in this class include the graph-theory ansatz SO(n){sub diag} in the Cartesian basis of So(n) and the ansatz SU(n){sub metric} in the Pauli-like basis of SU(n). A new phenomenon is observed in the high-level comparison of SU(n){sub metric}: Due to the trigonometric structure constants of the Pauli-like basis, irrational central charge is clearly visible at finite order of the expansion. They also define the sine-area graphs of SU(n), which label the conformal field theories of SU(n){sub metric} and note that, in a similar fashion, each magic basis of g defines a generalize graph theory on g which labels the conformal field theories of g{sub metric}.

  14. From matrix models' topological expansion to topological string theories: counting surfaces with algebraic geometry

    NASA Astrophysics Data System (ADS)

    Orantin, N.

    2007-09-01

    The 2-matrix model has been introduced to study Ising model on random surfaces. Since then, the link between matrix models and combinatorics of discrete surfaces has strongly tightened. This manuscript aims to investigate these deep links and extend them beyond the matrix models, following my work's evolution. First, I take care to define properly the hermitian 2 matrix model which gives rise to generating functions of discrete surfaces equipped with a spin structure. Then, I show how to compute all the terms in the topological expansion of any observable by using algebraic geometry tools. They are obtained as differential forms on an algebraic curve associated to the model: the spectral curve. In a second part, I show how to define such differentials on any algebraic curve even if it does not come from a matrix model. I then study their numerous symmetry properties under deformations of the algebraic curve. In particular, I show that these objects coincide with the topological expansion of the observable of a matrix model if the algebraic curve is the spectral curve of this model. Finally, I show that fine tuning the parameters ensure that these objects can be promoted to modular invariants and satisfy the holomorphic anomaly equation of the Kodaira-Spencer theory. This gives a new hint that the Dijkgraaf-Vafa conjecture is correct.

  15. K-Theory of Crossed Products of Tiling C*-Algebras by Rotation Groups

    NASA Astrophysics Data System (ADS)

    Starling, Charles

    2015-02-01

    Let Ω be a tiling space and let G be the maximal group of rotations which fixes Ω. Then the cohomology of Ω and Ω/ G are both invariants which give useful geometric information about the tilings in Ω. The noncommutative analog of the cohomology of Ω is the K-theory of a C*-algebra associated to Ω, and for translationally finite tilings of dimension 2 or less, the K-theory is isomorphic to the direct sum of cohomology groups. In this paper we give a prescription for calculating the noncommutative analog of the cohomology of Ω/ G, that is, the K-theory of the crossed product of the tiling C*-algebra by G. We also provide a table with some calculated K-groups for many common examples, including the Penrose and pinwheel tilings.

  16. Algebraic Characterization of the Vacuum in Light-Front Field Theory

    NASA Astrophysics Data System (ADS)

    Herrmann, Marc; Polyzou, Wayne

    2016-03-01

    In the light-front formulation of quantum field theory, the vacuum vector of an interacting field theory has a relatively simple relationship to the vacuum of a free field theory. This is a benefit over the usual equal-time formulation where the interacting vacuum vector has infinite norm with respect to the Hilbert space of the free field theory. By describing the vacuum as a positive linear functional on an operator algebra constructed from free fields with two distinct masses, it can be demonstrated that the complications associated with adding dynamics to the vacuum of a free theory are not present in the construction of the light-front vacuum. Instead, the complications are moved into defining a subalgebra of the light-front algebra which corresponds to the physically relevant algebra of local fields. These results can then be applied to interacting fields by first describing them in terms of asymptotic in or out fields. However, in order to treat local operators products, the vacuum functional may need to be modified to include states with zero eigenvalue of the generator of translations in the direction along the light front, x- =1/√(2) >x0-x3. This work supported by DOE contract No. DE-FG02-86ER40286.

  17. Lamplighter groups, de Brujin graphs, spider-web graphs and their spectra

    NASA Astrophysics Data System (ADS)

    Grigorchuk, R.; Leemann, P.-H.; Nagnibeda, T.

    2016-05-01

    We study the infinite family of spider-web graphs \\{{{ S }}k,N,M\\}, k≥slant 2, N≥slant 0 and M≥slant 1, initiated in the 50s in the context of network theory. It was later shown in physical literature that these graphs have remarkable percolation and spectral properties. We provide a mathematical explanation of these properties by putting the spider-web graphs in the context of group theory and algebraic graph theory. Namely, we realize them as tensor products of the well-known de Bruijn graphs \\{{{ B }}k,N\\} with cyclic graphs \\{{C}M\\} and show that these graphs are described by the action of the lamplighter group {{ L }}k={Z}/k{Z}\\wr {Z} on the infinite binary tree. Our main result is the identification of the infinite limit of \\{{{ S }}k,N,M\\}, as N,M\\to ∞ , with the Cayley graph of the lamplighter group {{ L }}k which, in turn, is one of the famous Diestel–Leader graphs {{DL}}k,k. As an application we compute the spectra of all spider-web graphs and show their convergence to the discrete spectral distribution associated with the Laplacian on the lamplighter group.

  18. LieART-A Mathematica application for Lie algebras and representation theory

    NASA Astrophysics Data System (ADS)

    Feger, Robert; Kephart, Thomas W.

    2015-07-01

    We present the Mathematica application "LieART" (Lie Algebras and Representation Theory) for computations frequently encountered in Lie algebras and representation theory, such as tensor product decomposition and subalgebra branching of irreducible representations. LieART can handle all classical and exceptional Lie algebras. It computes root systems of Lie algebras, weight systems and several other properties of irreducible representations. LieART's user interface has been created with a strong focus on usability and thus allows the input of irreducible representations via their dimensional name, while the output is in the textbook style used in most particle-physics publications. The unique Dynkin labels of irreducible representations are used internally and can also be used for input and output. LieART exploits the Weyl reflection group for most of the calculations, resulting in fast computations and a low memory consumption. Extensive tables of properties, tensor products and branching rules of irreducible representations are included as online supplementary material (see Appendix A).

  19. Visibility graph analysis on quarterly macroeconomic series of China based on complex network theory

    NASA Astrophysics Data System (ADS)

    Wang, Na; Li, Dong; Wang, Qiwen

    2012-12-01

    The visibility graph approach and complex network theory provide a new insight into time series analysis. The inheritance of the visibility graph from the original time series was further explored in the paper. We found that degree distributions of visibility graphs extracted from Pseudo Brownian Motion series obtained by the Frequency Domain algorithm exhibit exponential behaviors, in which the exponential exponent is a binomial function of the Hurst index inherited in the time series. Our simulations presented that the quantitative relations between the Hurst indexes and the exponents of degree distribution function are different for different series and the visibility graph inherits some important features of the original time series. Further, we convert some quarterly macroeconomic series including the growth rates of value-added of three industry series and the growth rates of Gross Domestic Product series of China to graphs by the visibility algorithm and explore the topological properties of graphs associated from the four macroeconomic series, namely, the degree distribution and correlations, the clustering coefficient, the average path length, and community structure. Based on complex network analysis we find degree distributions of associated networks from the growth rates of value-added of three industry series are almost exponential and the degree distributions of associated networks from the growth rates of GDP series are scale free. We also discussed the assortativity and disassortativity of the four associated networks as they are related to the evolutionary process of the original macroeconomic series. All the constructed networks have “small-world” features. The community structures of associated networks suggest dynamic changes of the original macroeconomic series. We also detected the relationship among government policy changes, community structures of associated networks and macroeconomic dynamics. We find great influences of government

  20. Scale-adaptive tensor algebra for local many-body methods of electronic structure theory

    SciTech Connect

    Liakh, Dmitry I

    2014-01-01

    While the formalism of multiresolution analysis (MRA), based on wavelets and adaptive integral representations of operators, is actively progressing in electronic structure theory (mostly on the independent-particle level and, recently, second-order perturbation theory), the concepts of multiresolution and adaptivity can also be utilized within the traditional formulation of correlated (many-particle) theory which is based on second quantization and the corresponding (generally nonorthogonal) tensor algebra. In this paper, we present a formalism called scale-adaptive tensor algebra (SATA) which exploits an adaptive representation of tensors of many-body operators via the local adjustment of the basis set quality. Given a series of locally supported fragment bases of a progressively lower quality, we formulate the explicit rules for tensor algebra operations dealing with adaptively resolved tensor operands. The formalism suggested is expected to enhance the applicability and reliability of local correlated many-body methods of electronic structure theory, especially those directly based on atomic orbitals (or any other localized basis functions).

  1. The Casimir Effect from the Point of View of Algebraic Quantum Field Theory

    NASA Astrophysics Data System (ADS)

    Dappiaggi, Claudio; Nosari, Gabriele; Pinamonti, Nicola

    2016-06-01

    We consider a region of Minkowski spacetime bounded either by one or by two parallel, infinitely extended plates orthogonal to a spatial direction and a real Klein-Gordon field satisfying Dirichlet boundary conditions. We quantize these two systems within the algebraic approach to quantum field theory using the so-called functional formalism. As a first step we construct a suitable unital ∗-algebra of observables whose generating functionals are characterized by a labelling space which is at the same time optimal and separating and fulfils the F-locality property. Subsequently we give a definition for these systems of Hadamard states and we investigate explicit examples. In the case of a single plate, it turns out that one can build algebraic states via a pull-back of those on the whole Minkowski spacetime, moreover inheriting from them the Hadamard property. When we consider instead two plates, algebraic states can be put in correspondence with those on flat spacetime via the so-called method of images, which we translate to the algebraic setting. For a massless scalar field we show that this procedure works perfectly for a large class of quasi-free states including the Poincaré vacuum and KMS states. Eventually Wick polynomials are introduced. Contrary to the Minkowski case, the extended algebras, built in globally hyperbolic subregions can be collected in a global counterpart only after a suitable deformation which is expressed locally in terms of a *-isomorphism. As a last step, we construct explicitly the two-point function and the regularized energy density, showing, moreover, that the outcome is consistent with the standard results of the Casimir effect.

  2. On the Algebraic K Theory of the Massive D8 and M9-Branes

    NASA Astrophysics Data System (ADS)

    Vancea, Ion V.

    In this paper we review some basic relations of algebraic K theory and we formulate them in the language of D-branes. Then we study the relation between the D8-branes wrapped on an orientable compact manifold W in a massive Type IIA supergravity background and the M9-branes wrapped on a compact manifold Z in a massive d=11 supergravity background from the K-theoretic point of view. By interpreting the D8-brane charges as elements of K0(C(W)) and the (inequivalent classes of) spaces of gauge fields on the M9-branes as the elements of K0(C(Z)x{¯ {k}*}G) where G is a one-dimensional compact group, a connection between charges and gauge fields is argued to exists. This connection could be realized as a composition map between the corresponding algebraic K theory groups.

  3. The theory of Enceladus and Dione: An application of computerized algebra in dynamical astronomy

    NASA Technical Reports Server (NTRS)

    Jefferys, W. H.; Ries, L. M.

    1974-01-01

    A theory of Saturn's satellites Enceladus and Dione is discussed which is literal (all constants of integration appear explicitly), canonically invariant (the Hori-Lie method is used), and which correctly handles the eccentricity-type resonance between the two satellites. Algebraic manipulations are designed to be performed using the TRIGMAN formula manipulation language, and computer programs were developed so that, with minor modifications, they can be used on the Mimas-Tethys and Titan-Hyperion systems.

  4. Applications of Vertex Coloring Problems for Graphs. Applications of Graph Theory in Model Construction. Modules and Monographs in Undergraduate Mathematics and Its Applications Project. UMAP Unit 442.

    ERIC Educational Resources Information Center

    Malkevitch, Joseph

    One of the great strengths of mathematics is viewed as the fact that apparently diverse real-world questions translate into that same mathematical question. It is felt that studying a mathematical problem can often bring about a tool of surprisingly diverse usability. The module is geared to help users know how to use graph theory to model simple…

  5. Sparsified-dynamics modeling of discrete point vortices with graph theory

    NASA Astrophysics Data System (ADS)

    Taira, Kunihiko; Nair, Aditya

    2014-11-01

    We utilize graph theory to derive a sparsified interaction-based model that captures unsteady point vortex dynamics. The present model builds upon the Biot-Savart law and keeps the number of vortices (graph nodes) intact and reduces the number of inter-vortex interactions (graph edges). We achieve this reduction in vortex interactions by spectral sparsification of graphs. This approach drastically reduces the computational cost to predict the dynamical behavior, sharing characteristics of reduced-order models. Sparse vortex dynamics are illustrated through an example of point vortex clusters interacting amongst themselves. We track the centroids of the individual vortex clusters to evaluate the error in bulk motion of the point vortices in the sparsified setup. To further improve the accuracy in predicting the nonlinear behavior of the vortices, resparsification strategies are employed for the sparsified interaction-based models. The model retains the nonlinearity of the interaction and also conserves the invariants of discrete vortex dynamics; namely the Hamiltonian, linear impulse, and angular impulse as well as circulation. Work supported by US Army Research Office (W911NF-14-1-0386) and US Air Force Office of Scientific Research (YIP: FA9550-13-1-0183).

  6. Quantification of Spatial Parameters in 3D Cellular Constructs Using Graph Theory

    PubMed Central

    Lund, A. W.; Bilgin, C. C.; Hasan, M. A.; McKeen, L. M.; Stegemann, J. P.; Yener, B.; Zaki, M. J.; Plopper, G. E.

    2009-01-01

    Multispectral three-dimensional (3D) imaging provides spatial information for biological structures that cannot be measured by traditional methods. This work presents a method of tracking 3D biological structures to quantify changes over time using graph theory. Cell-graphs were generated based on the pairwise distances, in 3D-Euclidean space, between nuclei during collagen I gel compaction. From these graphs quantitative features are extracted that measure both the global topography and the frequently occurring local structures of the “tissue constructs.” The feature trends can be controlled by manipulating compaction through cell density and are significant when compared to random graphs. This work presents a novel methodology to track a simple 3D biological event and quantitatively analyze the underlying structural change. Further application of this method will allow for the study of complex biological problems that require the quantification of temporal-spatial information in 3D and establish a new paradigm in understanding structure-function relationships. PMID:19920859

  7. Energy Minimization of Discrete Protein Titration State Models Using Graph Theory.

    PubMed

    Purvine, Emilie; Monson, Kyle; Jurrus, Elizabeth; Star, Keith; Baker, Nathan A

    2016-08-25

    There are several applications in computational biophysics that require the optimization of discrete interacting states, for example, amino acid titration states, ligand oxidation states, or discrete rotamer angles. Such optimization can be very time-consuming as it scales exponentially in the number of sites to be optimized. In this paper, we describe a new polynomial time algorithm for optimization of discrete states in macromolecular systems. This algorithm was adapted from image processing and uses techniques from discrete mathematics and graph theory to restate the optimization problem in terms of "maximum flow-minimum cut" graph analysis. The interaction energy graph, a graph in which vertices (amino acids) and edges (interactions) are weighted with their respective energies, is transformed into a flow network in which the value of the minimum cut in the network equals the minimum free energy of the protein and the cut itself encodes the state that achieves the minimum free energy. Because of its deterministic nature and polynomial time performance, this algorithm has the potential to allow for the ionization state of larger proteins to be discovered. PMID:27089174

  8. Mathematic Modeling of Complex Hydraulic Machinery Systems When Evaluating Reliability Using Graph Theory

    NASA Astrophysics Data System (ADS)

    Zemenkova, M. Yu; Shipovalov, A. N.; Zemenkov, Yu D.

    2016-04-01

    The main technological equipment of pipeline transport of hydrocarbons are hydraulic machines. During transportation of oil mainly used of centrifugal pumps, designed to work in the “pumping station-pipeline” system. Composition of a standard pumping station consists of several pumps, complex hydraulic piping. The authors have developed a set of models and algorithms for calculating system reliability of pumps. It is based on the theory of reliability. As an example, considered one of the estimation methods with the application of graph theory.

  9. Functional Organization of the Action Observation Network in Autism: A Graph Theory Approach

    PubMed Central

    Alaerts, Kaat; Geerlings, Franca; Herremans, Lynn; Swinnen, Stephan P.; Verhoeven, Judith; Sunaert, Stefan; Wenderoth, Nicole

    2015-01-01

    Background The ability to recognize, understand and interpret other’s actions and emotions has been linked to the mirror system or action-observation-network (AON). Although variations in these abilities are prevalent in the neuro-typical population, persons diagnosed with autism spectrum disorders (ASD) have deficits in the social domain and exhibit alterations in this neural network. Method Here, we examined functional network properties of the AON using graph theory measures and region-to-region functional connectivity analyses of resting-state fMRI-data from adolescents and young adults with ASD and typical controls (TC). Results Overall, our graph theory analyses provided convergent evidence that the network integrity of the AON is altered in ASD, and that reductions in network efficiency relate to reductions in overall network density (i.e., decreased overall connection strength). Compared to TC, individuals with ASD showed significant reductions in network efficiency and increased shortest path lengths and centrality. Importantly, when adjusting for overall differences in network density between ASD and TC groups, participants with ASD continued to display reductions in network integrity, suggesting that also network-level organizational properties of the AON are altered in ASD. Conclusion While differences in empirical connectivity contributed to reductions in network integrity, graph theoretical analyses provided indications that also changes in the high-level network organization reduced integrity of the AON. PMID:26317222

  10. A graph-theory framework for evaluating landscape connectivity and conservation planning.

    PubMed

    Minor, Emily S; Urban, Dean L

    2008-04-01

    Connectivity of habitat patches is thought to be important for movement of genes, individuals, populations, and species over multiple temporal and spatial scales. We used graph theory to characterize multiple aspects of landscape connectivity in a habitat network in the North Carolina Piedmont (U.S.A). We compared this landscape with simulated networks with known topology, resistance to disturbance, and rate of movement. We introduced graph measures such as compartmentalization and clustering, which can be used to identify locations on the landscape that may be especially resilient to human development or areas that may be most suitable for conservation. Our analyses indicated that for songbirds the Piedmont habitat network was well connected. Furthermore, the habitat network had commonalities with planar networks, which exhibit slow movement, and scale-free networks, which are resistant to random disturbances. These results suggest that connectivity in the habitat network was high enough to prevent the negative consequences of isolation but not so high as to allow rapid spread of disease. Our graph-theory framework provided insight into regional and emergent global network properties in an intuitive and visual way and allowed us to make inferences about rates and paths of species movements and vulnerability to disturbance. This approach can be applied easily to assessing habitat connectivity in any fragmented or patchy landscape. PMID:18241238

  11. Application of Graph Theory to unsupervised classification of materials by Laser-Induced Breakdown Spectroscopy

    NASA Astrophysics Data System (ADS)

    Grifoni, E.; Legnaioli, S.; Lorenzetti, G.; Pagnotta, S.; Palleschi, V.

    2016-04-01

    In this paper we present a new approach for unsupervised classification of materials from the spectra obtained using the Laser-Induced Breakdown Spectroscopy technique. The method is based on the calculation of the correlation matrix between the LIBS spectra, which is interpreted as an Adjacency matrix in the framework of Graph theory. A threshold is applied on the edge values, which is determined through maximization of the Modularity of the Graph. The classification of the spectra is done automatically after the calculation of the Modularity parameter. An example of the application of the proposed method is given, based on the study of six bronze standards of known composition. The advantages of the proposed approach with respect to Principal Component Analysis are also discussed.

  12. Representations of Conformal Nets, Universal C*-Algebras and K-Theory

    NASA Astrophysics Data System (ADS)

    Carpi, Sebastiano; Conti, Roberto; Hillier, Robin; Weiner, Mihály

    2013-05-01

    We study the representation theory of a conformal net {{A}} on S 1 from a K-theoretical point of view using its universal C*-algebra {C^*({A})}. We prove that if {{A}} satisfies the split property then, for every representation π of {{A}} with finite statistical dimension, {π(C^*({A}))} is weakly closed and hence a finite direct sum of type I∞ factors. We define the more manageable locally normal universal C*-algebra {C_ln^*({A})} as the quotient of {C^*({A})} by its largest ideal vanishing in all locally normal representations and we investigate its structure. In particular, if {{A}} is completely rational with n sectors, then {C_ln^*({A})} is a direct sum of n type I∞ factors. Its ideal {{K}_{A}} of compact operators has nontrivial K-theory, and we prove that the DHR endomorphisms of {C^*({A})} with finite statistical dimension act on {{K}_{A}}, giving rise to an action of the fusion semiring of DHR sectors on {K_0({K}_{A})}. Moreover, we show that this action corresponds to the regular representation of the associated fusion algebra.

  13. Random partitions and asymptotic theory of symmetric groups, Hecke algebras and finite Chevalley groups

    NASA Astrophysics Data System (ADS)

    Méliot, Pierre-Loïc

    2010-12-01

    In this thesis, we investigate the asymptotics of random partitions chosen according to probability measures coming from the representation theory of the symmetric groups S_n and of the finite Chevalley groups GL(n,F_q) and Sp(2n,F_q). More precisely, we prove laws of large numbers and central limit theorems for the q-Plancherel measures of type A and B, the Schur-Weyl measures and the Gelfand measures. Using the RSK algorithm, it also gives results on longest increasing subsequences in random words. We develop a technique of moments (and cumulants) for random partitions, thereby using the polynomial functions on Young diagrams in the sense of Kerov and Olshanski. The algebra of polynomial functions, or observables of Young diagrams is isomorphic to the algebra of partial permutations; in the last part of the thesis, we try to generalize this beautiful construction.

  14. Sharing Teaching Ideas: Graphing Families of Curves Using Transformations of Reference Graphs

    ERIC Educational Resources Information Center

    Kukla, David

    2007-01-01

    This article provides for a fast extremely accurate approach to graphing functions that is based on learning function reference graphs and then applying algebraic transformations to these reference graphs.

  15. High resolution remote sensing image segmentation based on graph theory and fractal net evolution approach

    NASA Astrophysics Data System (ADS)

    Yang, Y.; Li, H. T.; Han, Y. S.; Gu, H. Y.

    2015-06-01

    Image segmentation is the foundation of further object-oriented image analysis, understanding and recognition. It is one of the key technologies in high resolution remote sensing applications. In this paper, a new fast image segmentation algorithm for high resolution remote sensing imagery is proposed, which is based on graph theory and fractal net evolution approach (FNEA). Firstly, an image is modelled as a weighted undirected graph, where nodes correspond to pixels, and edges connect adjacent pixels. An initial object layer can be obtained efficiently from graph-based segmentation, which runs in time nearly linear in the number of image pixels. Then FNEA starts with the initial object layer and a pairwise merge of its neighbour object with the aim to minimize the resulting summed heterogeneity. Furthermore, according to the character of different features in high resolution remote sensing image, three different merging criterions for image objects based on spectral and spatial information are adopted. Finally, compared with the commercial remote sensing software eCognition, the experimental results demonstrate that the efficiency of the algorithm has significantly improved, and the result can maintain good feature boundaries.

  16. A graph theory practice on transformed image: a random image steganography.

    PubMed

    Thanikaiselvan, V; Arulmozhivarman, P; Subashanthini, S; Amirtharajan, Rengarajan

    2013-01-01

    Modern day information age is enriched with the advanced network communication expertise but unfortunately at the same time encounters infinite security issues when dealing with secret and/or private information. The storage and transmission of the secret information become highly essential and have led to a deluge of research in this field. In this paper, an optimistic effort has been taken to combine graceful graph along with integer wavelet transform (IWT) to implement random image steganography for secure communication. The implementation part begins with the conversion of cover image into wavelet coefficients through IWT and is followed by embedding secret image in the randomly selected coefficients through graph theory. Finally stegoimage is obtained by applying inverse IWT. This method provides a maximum of 44 dB peak signal to noise ratio (PSNR) for 266646 bits. Thus, the proposed method gives high imperceptibility through high PSNR value and high embedding capacity in the cover image due to adaptive embedding scheme and high robustness against blind attack through graph theoretic random selection of coefficients. PMID:24453857

  17. A Graph Theory Practice on Transformed Image: A Random Image Steganography

    PubMed Central

    Thanikaiselvan, V.; Arulmozhivarman, P.; Subashanthini, S.; Amirtharajan, Rengarajan

    2013-01-01

    Modern day information age is enriched with the advanced network communication expertise but unfortunately at the same time encounters infinite security issues when dealing with secret and/or private information. The storage and transmission of the secret information become highly essential and have led to a deluge of research in this field. In this paper, an optimistic effort has been taken to combine graceful graph along with integer wavelet transform (IWT) to implement random image steganography for secure communication. The implementation part begins with the conversion of cover image into wavelet coefficients through IWT and is followed by embedding secret image in the randomly selected coefficients through graph theory. Finally stegoimage is obtained by applying inverse IWT. This method provides a maximum of 44 dB peak signal to noise ratio (PSNR) for 266646 bits. Thus, the proposed method gives high imperceptibility through high PSNR value and high embedding capacity in the cover image due to adaptive embedding scheme and high robustness against blind attack through graph theoretic random selection of coefficients. PMID:24453857

  18. Supersymmetric correspondence in spectra on a graph and its line graph: From circuit theory to spoof plasmons on metallic lattices

    NASA Astrophysics Data System (ADS)

    Nakata, Yosuke; Urade, Yoshiro; Nakanishi, Toshihiro; Miyamaru, Fumiaki; Takeda, Mitsuo Wada; Kitano, Masao

    2016-04-01

    We investigate the supersymmetry (SUSY) structures for inductor-capacitor circuit networks on a simple regular graph and its line graph. We show that their eigenspectra must coincide (except, possibly, for the highest eigenfrequency) due to SUSY, which is derived from the topological nature of the circuits. To observe this spectra correspondence in the high-frequency range, we study spoof plasmons on metallic hexagonal and kagomé lattices. The band correspondence between them is predicted by a simulation. Using terahertz time-domain spectroscopy, we demonstrate the band correspondence of fabricated metallic hexagonal and kagomé lattices.

  19. Multiscale connectivity and graph theory highlight critical areas for conservation under climate change.

    PubMed

    Dilt, Thomas E; Weisberg, Peter J; Leitner, Philip; Matocq, Marjorie D; Inman, Richard D; Nussear, Kenneth E; Esque, Todd C

    2016-06-01

    Conservation planning and biodiversity management require information on landscape connectivity across a range of spatial scales from individual home ranges to large regions. Reduction in landscape connectivity due changes in land use or development is expected to act synergistically with alterations to habitat mosaic configuration arising from climate change. We illustrate a multiscale connectivity framework to aid habitat conservation prioritization in the context of changing land use and climate. Our approach, which builds upon the strengths of multiple landscape connectivity methods, including graph theory, circuit theory, and least-cost path analysis, is here applied to the conservation planning requirements of the Mohave ground squirrel. The distribution of this threatened Californian species, as for numerous other desert species, overlaps with the proposed placement of several utility-scale renewable energy developments in the American southwest. Our approach uses information derived at three spatial scales to forecast potential changes in habitat connectivity under various scenarios of energy development and climate change. By disentangling the potential effects of habitat loss and fragmentation across multiple scales, we identify priority conservation areas for both core habitat and critical corridor or stepping stone habitats. This approach is a first step toward applying graph theory to analyze habitat connectivity for species with continuously distributed habitat and should be applicable across a broad range of taxa. PMID:27509760

  20. Multi-scale connectivity and graph theory highlight critical areas for conservation under climate change

    USGS Publications Warehouse

    Dilts, Thomas E.; Weisberg, Peter J.; Leitner, Phillip; Matocq, Marjorie D.; Inman, Richard D.; Nussear, Ken E.; Esque, Todd

    2016-01-01

    Conservation planning and biodiversity management require information on landscape connectivity across a range of spatial scales from individual home ranges to large regions. Reduction in landscape connectivity due changes in land-use or development is expected to act synergistically with alterations to habitat mosaic configuration arising from climate change. We illustrate a multi-scale connectivity framework to aid habitat conservation prioritization in the context of changing land use and climate. Our approach, which builds upon the strengths of multiple landscape connectivity methods including graph theory, circuit theory and least-cost path analysis, is here applied to the conservation planning requirements of the Mohave ground squirrel. The distribution of this California threatened species, as for numerous other desert species, overlaps with the proposed placement of several utility-scale renewable energy developments in the American Southwest. Our approach uses information derived at three spatial scales to forecast potential changes in habitat connectivity under various scenarios of energy development and climate change. By disentangling the potential effects of habitat loss and fragmentation across multiple scales, we identify priority conservation areas for both core habitat and critical corridor or stepping stone habitats. This approach is a first step toward applying graph theory to analyze habitat connectivity for species with continuously-distributed habitat, and should be applicable across a broad range of taxa.

  1. Modeling spatial decisions with graph theory: logging roads and forest fragmentation in the Brazilian Amazon.

    PubMed

    Walker, Robert; Arima, Eugenio; Messina, Joe; Soares-Filho, Britaldo; Perz, Stephen; Vergara, Dante; Sales, Marcio; Pereira, Ritaumaria; Castro, Williams

    2013-01-01

    This article addresses the spatial decision-making of loggers and implications for forest fragmentation in the Amazon basin. It provides a behavioral explanation for fragmentation by modeling how loggers build road networks, typically abandoned upon removal of hardwoods. Logging road networks provide access to land, and the settlers who take advantage of them clear fields and pastures that accentuate their spatial signatures. In shaping agricultural activities, these networks organize emergent patterns of forest fragmentation, even though the loggers move elsewhere. The goal of the article is to explicate how loggers shape their road networks, in order to theoretically explain an important type of forest fragmentation found in the Amazon basin, particularly in Brazil. This is accomplished by adapting graph theory to represent the spatial decision-making of loggers, and by implementing computational algorithms that build graphs interpretable as logging road networks. The economic behavior of loggers is conceptualized as a profit maximization problem, and translated into spatial decision-making by establishing a formal correspondence between mathematical graphs and road networks. New computational approaches, adapted from operations research, are used to construct graphs and simulate spatial decision-making as a function of discount rates, land tenure, and topographic constraints. The algorithms employed bracket a range of behavioral settings appropriate for areas of terras de volutas, public lands that have not been set aside for environmental protection, indigenous peoples, or colonization. The simulation target sites are located in or near so-called Terra do Meio, once a major logging frontier in the lower Amazon Basin. Simulation networks are compared to empirical ones identified by remote sensing and then used to draw inferences about factors influencing the spatial behavior of loggers. Results overall suggest that Amazonia's logging road networks induce more

  2. An Automated Method to Identify Mesoscale Convective Complexes (MCCs) Implementing Graph Theory

    NASA Astrophysics Data System (ADS)

    Whitehall, K. D.; Mattmann, C. A.; Jenkins, G. S.; Waliser, D. E.; Rwebangira, R.; Demoz, B.; Kim, J.; Goodale, C. E.; Hart, A. F.; Ramirez, P.; Joyce, M. J.; Loikith, P.; Lee, H.; Khudikyan, S.; Boustani, M.; Goodman, A.; Zimdars, P. A.; Whittell, J.

    2013-12-01

    Mesoscale convective complexes (MCCs) are convectively-driven weather systems with a duration of ~10 - 12 hours and contributions of large amounts to the rainfall daily and monthly totals. More than 400 MCCs occur annually over various locations on the globe. In West Africa, ~170 MCCs occur annually during the 180 days representing the summer months (June - November), and contribute ~75% of the annual wet season rainfall. The main objective of this study is to improve automatic identification of MCC over West Africa. The spatial expanse of MCCs and the spatio-temporal variability in their convective characteristics make them difficult to characterize even in dense networks of radars and/or surface gauges. As such there exist criteria for identifying MCCs with satellite images - mostly using infrared (IR) data. Automated MCC identification methods are based on forward and/or backward in time spatial-temporal analysis of the IR satellite data and characteristically incorporate a manual component as these algorithms routinely falter with merging and splitting cloud systems between satellite images. However, these algorithms are not readily transferable to voluminous data or other satellite-derived datasets (e.g. TRMM), thus hindering comprehensive studies of these features both at weather and climate timescales. Recognizing the existing limitations of automated methods, this study explores the applicability of graph theory to creating a fully automated method for deriving a West African MCC dataset from hourly infrared satellite images between 2001- 2012. Graph theory, though not heavily implemented in the atmospheric sciences, has been used for the predicting (nowcasting) of thunderstorms from radar and satellite data by considering the relationship between atmospheric variables at a given time, or for the spatial-temporal analysis of cloud volumes. From these few studies, graph theory appears to be innately applicable to the complexity, non-linearity and inherent

  3. Genetic Algorithm and Graph Theory Based Matrix Factorization Method for Online Friend Recommendation

    PubMed Central

    Li, Qu; Yang, Jianhua; Xu, Ning

    2014-01-01

    Online friend recommendation is a fast developing topic in web mining. In this paper, we used SVD matrix factorization to model user and item feature vector and used stochastic gradient descent to amend parameter and improve accuracy. To tackle cold start problem and data sparsity, we used KNN model to influence user feature vector. At the same time, we used graph theory to partition communities with fairly low time and space complexity. What is more, matrix factorization can combine online and offline recommendation. Experiments showed that the hybrid recommendation algorithm is able to recommend online friends with good accuracy. PMID:24757410

  4. Fractal analysis and graph theory applied to the spatial and temporal variability of soil water content

    NASA Astrophysics Data System (ADS)

    Vieira, Sidney R.; Vidal Vázquez, Eva; Miranda, José G. V.; Paz Ferreiro, Jorge; Topp, George C.

    2010-05-01

    Spatial and temporal variability of soil moisture content has been frequently evaluated using statistical and geostatistical methods for several issues. For example, the statistical study of the temporal persistence or temporal stability in spatial patterns of soil moisture content has found interest to improve soil water monitoring strategies and to correct the average soil water content for missing data. Fractal analysis and graph theory are additional tools that can provide information and further insight to assess and to model indirect or hidden interactions in soil moisture content. In fractal analysis the fractal dimension (D) is an indicator of the pattern and extent of spatial and/or temporal variability. Large D values indicate the importance of short-range variation, while small D values reflect the importance of long-range variation when spatial and temporal data sets are analyzed. Moreover, for spatial and temporal variability, D can range from 1 to 2 for a profile and from 2 to 3 for a two dimensional network. Moreover, as the fractal dimension value increases the degree of roughness also increases. Graph theory tools take into account network structure by modelling pair wise relations between objects, which allow considering explicitly spatial-temporal connectivity of a given data set. The objective of this study was to use fractal analysis and graph theory to characterize the pattern of spatial and temporal variability of soil moisture content. The experimental field was located at Ottawa, Canada. Volumetric water content was monitored using Time Domain Reflectometry (TDR) during 34 dates at 164 locations per date. The depth of the TDR probes was 20 cm. The first and last measurements were 21 month apart and no data were taken in winter when the soil was covered by snow. The fractal dimension, D, was estimated from the slope of the regression line of log semivariogram versus distance for each of studied data sets. Using graph theory various

  5. The theory of Enceladus and Dione - An application of computerized algebra in dynamical astronomy

    NASA Technical Reports Server (NTRS)

    Jefferys, W. H.; Ries, L. M.

    1975-01-01

    The orbits of the satellites of the outer planets are poorly known, due to lack of attention over the past half century. We have been developing a new theory of Saturn's satellites Enceladus and Dione which is literal (all constants of integration appear explicitly), canonically invariant (the Hori-Lie method is used), and which correctly handles the eccentricity-type resonance between the two satellites. The algebraic manipulations are being performed using the TRIGMAN formula manipulation language, and the programs have been developed so that with minor modifications they can be used on the Mimas-Tethys and Titan-Hyperion systems.

  6. Discovering Authorities and Hubs in Different Topological Web Graph Structures.

    ERIC Educational Resources Information Center

    Meghabghab, George

    2002-01-01

    Discussion of citation analysis on the Web considers Web hyperlinks as a source to analyze citations. Topics include basic graph theory applied to Web pages, including matrices, linear algebra, and Web topology; and hubs and authorities, including a search technique called HITS (Hyperlink Induced Topic Search). (Author/LRW)

  7. Graphs and Zero-Divisors

    ERIC Educational Resources Information Center

    Axtell, M.; Stickles, J.

    2010-01-01

    The last ten years have seen an explosion of research in the zero-divisor graphs of commutative rings--by professional mathematicians "and" undergraduates. The objective is to find algebraic information within the geometry of these graphs. This topic is approachable by anyone with one or two semesters of abstract algebra. This article gives the…

  8. Caveats: numerical requirements in graph theory based quantitation of tissue architecture.

    PubMed

    Sudbø, J; Marcelpoil, R; Reith, A

    2000-01-01

    Graph theory based methods represent one approach to an objective and reproducible structural analysis of tissue architecture. By these methods, neighborhood relations between a number of objects (e.g., cells) are explored and inherent to these methods are therefore certain requirements as to the number of objects to be included in the analysis. However, the question of how many objects are required to achieve reproducible values in repeated computations of proposed structural features, has previously not been adressed specifically. After digitising HE stained slides and storing them as grey level images, cell nuclei were segmented and their geometrical centre of gravity were computed, serving as the basis for construction of the Voronoi diagram (VD) and its subgraphs. Variations in repeated computations of structural features derived from these graphs were related to the number of cell nuclei included in the analysis. We demonstrate a large variation in the values of the structural features from one computation to another in one and the same section when only a limited number of cells (100-500) are included in the analysis. This variation decreased with increasing number of cells analyzed. The exact number of cells required to achieve reproducible values differ significantly between tissues, but not between separate cases of similar lesions. There are no significant differences between normal and malignantly changed tissues in oral mucosa with respect to how many cells must be included. For graph theory based analysis of tissue architecture, care must be taken to include an adequate number of objects; for some of the structural features we have tested, more than 3000 cells. PMID:11310642

  9. Differences in graph theory functional connectivity in left and right temporal lobe epilepsy

    PubMed Central

    Chiang, Sharon; Stern, John M.; Engel, Jerome; Levin, Harvey S.; Haneef, Zulfi

    2016-01-01

    Summary Purpose To investigate lateralized differences in limbic system functional connectivity between left and right temporal lobe epilepsy (TLE) using graph theory. Methods Interictal resting state fMRI was performed in 14 left TLE patients, 11 right TLE patients, and 12 controls. Graph theory analysis of 10 bilateral limbic regions of interest was conducted. Changes in edgewise functional connectivity, network topology, and regional topology were quantified, and then left and right TLE were compared. Results Limbic edgewise functional connectivity was predominantly reduced in both left and right TLE. More regional connections were reduced in right TLE, most prominently involving reduced interhemispheric connectivity between the bilateral insula and bilateral hippocampi. A smaller number of limbic connections were increased in TLE, more so in left than in right TLE. Topologically, the most pronounced change was a reduction in average network betweenness centrality and concurrent increase in left hippocampal betweenness centrality in right TLE. In contrast, left TLE exhibited a weak trend toward increased right hippocampal betweenness centrality, with no change in average network betweenness centrality. Conclusion Limbic functional connectivity is predominantly reduced in both left and right TLE, with more pronounced reductions in right TLE. In contrast, left TLE exhibits both edgewise and topological changes that suggest a tendency toward reorganization. Network changes in TLE and lateralized differences thereof may have important diagnostic and prognostic implications. PMID:25445238

  10. Conceptualizing Routines of Practice That Support Algebraic Reasoning in Elementary Schools: A Constructivist Grounded Theory

    ERIC Educational Resources Information Center

    Store, Jessie Chitsanzo

    2012-01-01

    There is ample literature documenting that, for many decades, high school students view algebra as difficult and do not demonstrate understanding of algebraic concepts. Algebraic reasoning in elementary school aims at meaningfully introducing algebra to elementary school students in preparation for higher-level mathematics. While there is research…

  11. Rule-based graph theory to enable exploration of the space system architecture design space

    NASA Astrophysics Data System (ADS)

    Arney, Dale Curtis

    The primary goal of this research is to improve upon system architecture modeling in order to enable the exploration of design space options. A system architecture is the description of the functional and physical allocation of elements and the relationships, interactions, and interfaces between those elements necessary to satisfy a set of constraints and requirements. The functional allocation defines the functions that each system (element) performs, and the physical allocation defines the systems required to meet those functions. Trading the functionality between systems leads to the architecture-level design space that is available to the system architect. The research presents a methodology that enables the modeling of complex space system architectures using a mathematical framework. To accomplish the goal of improved architecture modeling, the framework meets five goals: technical credibility, adaptability, flexibility, intuitiveness, and exhaustiveness. The framework is technically credible, in that it produces an accurate and complete representation of the system architecture under consideration. The framework is adaptable, in that it provides the ability to create user-specified locations, steady states, and functions. The framework is flexible, in that it allows the user to model system architectures to multiple destinations without changing the underlying framework. The framework is intuitive for user input while still creating a comprehensive mathematical representation that maintains the necessary information to completely model complex system architectures. Finally, the framework is exhaustive, in that it provides the ability to explore the entire system architecture design space. After an extensive search of the literature, graph theory presents a valuable mechanism for representing the flow of information or vehicles within a simple mathematical framework. Graph theory has been used in developing mathematical models of many transportation and

  12. Review of uses of network and graph theory concepts within proteomics.

    PubMed

    Grindrod, Peter; Kibble, Milla

    2004-08-01

    The size and nature of data collected on gene and protein interactions has led to a rapid growth of interest in graph theory and modern techniques for describing, characterizing and comparing networks. Simultaneously, this is a field of growth within mathematics and theoretical physics, where the global properties, and emergent behavior of networks, as a function of the local properties has long been studied. In this review, a number of approaches for exploiting modern network theory to help describe and analyze different data sets and problems associated with proteomic data are considered. This review aims to help biologists find their way towards useful ideas and references, yet may also help scientists from a mathematics and physics background to understand where they may apply their expertise. PMID:15966817

  13. Deformations of 3-algebras

    SciTech Connect

    Figueroa-O'Farrill, Jose Miguel

    2009-11-15

    We phrase deformations of n-Leibniz algebras in terms of the cohomology theory of the associated Leibniz algebra. We do the same for n-Lie algebras and for the metric versions of n-Leibniz and n-Lie algebras. We place particular emphasis on the case of n=3 and explore the deformations of 3-algebras of relevance to three-dimensional superconformal Chern-Simons theories with matter.

  14. PDB2Graph: A toolbox for identifying critical amino acids map in proteins based on graph theory.

    PubMed

    Niknam, Niloofar; Khakzad, Hamed; Arab, Seyed Shahriar; Naderi-Manesh, Hossein

    2016-05-01

    The integrative and cooperative nature of protein structure involves the assessment of topological and global features of constituent parts. Network concept takes complete advantage of both of these properties in the analysis concomitantly. High compatibility to structural concepts or physicochemical properties in addition to exploiting a remarkable simplification in the system has made network an ideal tool to explore biological systems. There are numerous examples in which different protein structural and functional characteristics have been clarified by the network approach. Here, we present an interactive and user-friendly Matlab-based toolbox, PDB2Graph, devoted to protein structure network construction, visualization, and analysis. Moreover, PDB2Graph is an appropriate tool for identifying critical nodes involved in protein structural robustness and function based on centrality indices. It maps critical amino acids in protein networks and can greatly aid structural biologists in selecting proper amino acid candidates for manipulating protein structures in a more reasonable and rational manner. To introduce the capability and efficiency of PDB2Graph in detail, the structural modification of Calmodulin through allosteric binding of Ca(2+) is considered. In addition, a mutational analysis for three well-identified model proteins including Phage T4 lysozyme, Barnase and Ribonuclease HI, was performed to inspect the influence of mutating important central residues on protein activity. PMID:27043857

  15. Algebraic vs physical N = 6 3-algebras

    SciTech Connect

    Cantarini, Nicoletta; Kac, Victor G.

    2014-01-15

    In our previous paper, we classified linearly compact algebraic simple N = 6 3-algebras. In the present paper, we classify their “physical” counterparts, which actually appear in the N = 6 supersymmetric 3-dimensional Chern-Simons theories.

  16. Graphing Electric Potential.

    ERIC Educational Resources Information Center

    De Jong, Marvin L.

    1993-01-01

    Describes the powerful graphing ability of computer algebra systems (CAS) to create three-dimensional graphs or surface graphics of electric potentials. Provides equations along with examples of the printouts. Lists the programs Mathematica, Maple, Derive, Theorist, MathCad, and MATLAB as promising CAS systems. (MVL)

  17. SPECTRAL GRAPH THEORY AND GRAPH ENERGY METRICS SHOW EVIDENCE FOR THE ALZHEIMER’S DISEASE DISCONNECTION SYNDROME IN APOE-4 RISK GENE CARRIERS

    PubMed Central

    Daianu, Madelaine; Mezher, Adam; Jahanshad, Neda; Hibar, Derrek P.; Nir, Talia M.; Jack, Clifford R.; Weiner, Michael W.; Bernstein, Matt A.; Thompson, Paul M.

    2015-01-01

    Our understanding of network breakdown in Alzheimer’s disease (AD) is likely to be enhanced through advanced mathematical descriptors. Here, we applied spectral graph theory to provide novel metrics of structural connectivity based on 3-Tesla diffusion weighted images in 42 AD patients and 50 healthy controls. We reconstructed connectivity networks using whole-brain tractography and examined, for the first time here, cortical disconnection based on the graph energy and spectrum. We further assessed supporting metrics - link density and nodal strength - to better interpret our results. Metrics were analyzed in relation to the well-known APOE-4 genetic risk factor for late-onset AD. The number of disconnected cortical regions increased with the number of copies of the APOE-4 risk gene in people with AD. Each additional copy of the APOE-4 risk gene may lead to more dysfunctional networks with weakened or abnormal connections, providing evidence for the previously hypothesized “disconnection syndrome”. PMID:26413205

  18. Network Reconstruction Based on Proteomic Data and Prior Knowledge of Protein Connectivity Using Graph Theory

    PubMed Central

    Stavrakas, Vassilis; Alexopoulos, Leonidas G.

    2015-01-01

    Modeling of signal transduction pathways is instrumental for understanding cells’ function. People have been tackling modeling of signaling pathways in order to accurately represent the signaling events inside cells’ biochemical microenvironment in a way meaningful for scientists in a biological field. In this article, we propose a method to interrogate such pathways in order to produce cell-specific signaling models. We integrate available prior knowledge of protein connectivity, in a form of a Prior Knowledge Network (PKN) with phosphoproteomic data to construct predictive models of the protein connectivity of the interrogated cell type. Several computational methodologies focusing on pathways’ logic modeling using optimization formulations or machine learning algorithms have been published on this front over the past few years. Here, we introduce a light and fast approach that uses a breadth-first traversal of the graph to identify the shortest pathways and score proteins in the PKN, fitting the dependencies extracted from the experimental design. The pathways are then combined through a heuristic formulation to produce a final topology handling inconsistencies between the PKN and the experimental scenarios. Our results show that the algorithm we developed is efficient and accurate for the construction of medium and large scale signaling networks. We demonstrate the applicability of the proposed approach by interrogating a manually curated interaction graph model of EGF/TNFA stimulation against made up experimental data. To avoid the possibility of erroneous predictions, we performed a cross-validation analysis. Finally, we validate that the introduced approach generates predictive topologies, comparable to the ILP formulation. Overall, an efficient approach based on graph theory is presented herein to interrogate protein–protein interaction networks and to provide meaningful biological insights. PMID:26020784

  19. Network reconstruction based on proteomic data and prior knowledge of protein connectivity using graph theory.

    PubMed

    Stavrakas, Vassilis; Melas, Ioannis N; Sakellaropoulos, Theodore; Alexopoulos, Leonidas G

    2015-01-01

    Modeling of signal transduction pathways is instrumental for understanding cells' function. People have been tackling modeling of signaling pathways in order to accurately represent the signaling events inside cells' biochemical microenvironment in a way meaningful for scientists in a biological field. In this article, we propose a method to interrogate such pathways in order to produce cell-specific signaling models. We integrate available prior knowledge of protein connectivity, in a form of a Prior Knowledge Network (PKN) with phosphoproteomic data to construct predictive models of the protein connectivity of the interrogated cell type. Several computational methodologies focusing on pathways' logic modeling using optimization formulations or machine learning algorithms have been published on this front over the past few years. Here, we introduce a light and fast approach that uses a breadth-first traversal of the graph to identify the shortest pathways and score proteins in the PKN, fitting the dependencies extracted from the experimental design. The pathways are then combined through a heuristic formulation to produce a final topology handling inconsistencies between the PKN and the experimental scenarios. Our results show that the algorithm we developed is efficient and accurate for the construction of medium and large scale signaling networks. We demonstrate the applicability of the proposed approach by interrogating a manually curated interaction graph model of EGF/TNFA stimulation against made up experimental data. To avoid the possibility of erroneous predictions, we performed a cross-validation analysis. Finally, we validate that the introduced approach generates predictive topologies, comparable to the ILP formulation. Overall, an efficient approach based on graph theory is presented herein to interrogate protein-protein interaction networks and to provide meaningful biological insights. PMID:26020784

  20. Quantification of Three-Dimensional Cell-Mediated Collagen Remodeling Using Graph Theory

    PubMed Central

    Bilgin, Cemal Cagatay; Lund, Amanda W.; Can, Ali; Plopper, George E.; Yener, Bülent

    2010-01-01

    Background Cell cooperation is a critical event during tissue development. We present the first precise metrics to quantify the interaction between mesenchymal stem cells (MSCs) and extra cellular matrix (ECM). In particular, we describe cooperative collagen alignment process with respect to the spatio-temporal organization and function of mesenchymal stem cells in three dimensions. Methodology/Principal Findings We defined two precise metrics: Collagen Alignment Index and Cell Dissatisfaction Level, for quantitatively tracking type I collagen and fibrillogenesis remodeling by mesenchymal stem cells over time. Computation of these metrics was based on graph theory and vector calculus. The cells and their three dimensional type I collagen microenvironment were modeled by three dimensional cell-graphs and collagen fiber organization was calculated from gradient vectors. With the enhancement of mesenchymal stem cell differentiation, acceleration through different phases was quantitatively demonstrated. The phases were clustered in a statistically significant manner based on collagen organization, with late phases of remodeling by untreated cells clustering strongly with early phases of remodeling by differentiating cells. The experiments were repeated three times to conclude that the metrics could successfully identify critical phases of collagen remodeling that were dependent upon cooperativity within the cell population. Conclusions/Significance Definition of early metrics that are able to predict long-term functionality by linking engineered tissue structure to function is an important step toward optimizing biomaterials for the purposes of regenerative medicine. PMID:20927339

  1. Dual algebraic formulation of differential GPS

    NASA Astrophysics Data System (ADS)

    Lannes, A.; Dur, S.

    2003-05-01

    A new approach to differential GPS is presented. The corresponding theoretical framework calls on elementary concepts of algebraic graph theory. The notion of double difference, which is related to that of closure in the sense of Kirchhoff, is revisited in this context. The Moore-Penrose pseudo-inverse of the closure operator plays a key role in the corresponding dual formulation. This approach, which is very attractive from a conceptual point of view, sheds a new light on the Teunissen formulation.

  2. Graph theory analysis of complex brain networks: new concepts in brain mapping applied to neurosurgery.

    PubMed

    Hart, Michael G; Ypma, Rolf J F; Romero-Garcia, Rafael; Price, Stephen J; Suckling, John

    2016-06-01

    Neuroanatomy has entered a new era, culminating in the search for the connectome, otherwise known as the brain's wiring diagram. While this approach has led to landmark discoveries in neuroscience, potential neurosurgical applications and collaborations have been lagging. In this article, the authors describe the ideas and concepts behind the connectome and its analysis with graph theory. Following this they then describe how to form a connectome using resting state functional MRI data as an example. Next they highlight selected insights into healthy brain function that have been derived from connectome analysis and illustrate how studies into normal development, cognitive function, and the effects of synthetic lesioning can be relevant to neurosurgery. Finally, they provide a précis of early applications of the connectome and related techniques to traumatic brain injury, functional neurosurgery, and neurooncology. PMID:26544769

  3. Graph theory approach to the eigenvalue problem of large space structures

    NASA Technical Reports Server (NTRS)

    Reddy, A. S. S. R.; Bainum, P. M.

    1981-01-01

    Graph theory is used to obtain numerical solutions to eigenvalue problems of large space structures (LSS) characterized by a state vector of large dimensions. The LSS are considered as large, flexible systems requiring both orientation and surface shape control. Graphic interpretation of the determinant of a matrix is employed to reduce a higher dimensional matrix into combinations of smaller dimensional sub-matrices. The reduction is implemented by means of a Boolean equivalent of the original matrices formulated to obtain smaller dimensional equivalents of the original numerical matrix. Computation time becomes less and more accurate solutions are possible. An example is provided in the form of a free-free square plate. Linearized system equations and numerical values of a stiffness matrix are presented, featuring a state vector with 16 components.

  4. HBNG: Graph theory based visualization of hydrogen bond networks in protein structures

    PubMed Central

    Tiwari, Abhishek; Tiwari, Vivek

    2007-01-01

    HBNG is a graph theory based tool for visualization of hydrogen bond network in 2D. Digraphs generated by HBNG facilitate visualization of cooperativity and anticooperativity chains and rings in protein structures. HBNG takes hydrogen bonds list files (output from HBAT, HBEXPLORE, HBPLUS and STRIDE) as input and generates a DOT language script and constructs digraphs using freeware AT and T Graphviz tool. HBNG is useful in the enumeration of favorable topologies of hydrogen bond networks in protein structures and determining the effect of cooperativity and anticooperativity on protein stability and folding. HBNG can be applied to protein structure comparison and in the identification of secondary structural regions in protein structures. Availability Program is available from the authors for non-commercial purposes. PMID:18084648

  5. Morphological brain network assessed using graph theory and network filtration in deaf adults.

    PubMed

    Kim, Eunkyung; Kang, Hyejin; Lee, Hyekyoung; Lee, Hyo-Jeong; Suh, Myung-Whan; Song, Jae-Jin; Oh, Seung-Ha; Lee, Dong Soo

    2014-09-01

    Prolonged deprivation of auditory input can change brain networks in pre- and postlingual deaf adults by brain-wide reorganization. To investigate morphological changes in these brains voxel-based morphometry, voxel-wise correlation with the primary auditory cortex, and whole brain network analyses using morphological covariance were performed in eight prelingual deaf, eleven postlingual deaf, and eleven hearing adults. Network characteristics based on graph theory and network filtration based on persistent homology were examined. Gray matter density in the primary auditor cortex was preserved in prelingual deafness, while it tended to decrease in postlingual deafness. Unlike postlingual, prelingual deafness showed increased bilateral temporal connectivity of the primary auditory cortex compared to the hearing adults. Of the graph theory-based characteristics, clustering coefficient, betweenness centrality, and nodal efficiency all increased in prelingual deafness, while all the parameters of postlingual deafness were similar to the hearing adults. Patterns of connected components changing during network filtration were different between prelingual deafness and hearing adults according to the barcode, dendrogram, and single linkage matrix representations, while these were the same in postlingual deafness. Nodes in fronto-limbic and left temporal components were closely coupled, and nodes in the temporo-parietal component were loosely coupled, in prelingual deafness. Patterns of connected components changing in postlingual deafness were the same as hearing adults. We propose that the preserved density of auditory cortex associated with increased connectivity in prelingual deafness, and closer coupling between certain brain areas, represent distinctive reorganization of auditory and related cortices compared with hearing or postlingual deaf adults. The differential network reorganization in the prelingual deaf adults could be related to the absence of auditory speech

  6. What graph theory actually tells us about resting state interictal MEG epileptic activity

    PubMed Central

    Niso, Guiomar; Carrasco, Sira; Gudín, María; Maestú, Fernando; del-Pozo, Francisco; Pereda, Ernesto

    2015-01-01

    Graph theory provides a useful framework to study functional brain networks from neuroimaging data. In epilepsy research, recent findings suggest that it offers unique insight into the fingerprints of this pathology on brain dynamics. Most studies hitherto have focused on seizure activity during focal epilepsy, but less is known about functional epileptic brain networks during interictal activity in frontal focal and generalized epilepsy. Besides, it is not clear yet which measures are most suitable to characterize these networks. To address these issues, we recorded magnetoencephalographic (MEG) data using two orthogonal planar gradiometers from 45 subjects from three groups (15 healthy controls (7 males, 24 ± 6 years), 15 frontal focal (8 male, 32 ± 16 years) and 15 generalized epileptic (6 male, 27 ± 7 years) patients) during interictal resting state with closed eyes. Then, we estimated the total and relative spectral power of the largest principal component of the gradiometers, and the degree of phase synchronization between each sensor site in the frequency range [0.5–40 Hz]. We further calculated a comprehensive battery of 15 graph-theoretic measures and used the affinity propagation clustering algorithm to elucidate the minimum set of them that fully describe these functional brain networks. The results show that differences in spectral power between the control and the other two groups have a distinctive pattern: generalized epilepsy presents higher total power for all frequencies except the alpha band over a widespread set of sensors; frontal focal epilepsy shows higher relative power in the beta band bilaterally in the fronto-central sensors. Moreover, all network indices can be clustered into three groups, whose exemplars are the global network efficiency, the eccentricity and the synchronizability. Again, the patterns of differences were clear: the brain network of the generalized epilepsy patients presented greater efficiency and lower

  7. What graph theory actually tells us about resting state interictal MEG epileptic activity.

    PubMed

    Niso, Guiomar; Carrasco, Sira; Gudín, María; Maestú, Fernando; Del-Pozo, Francisco; Pereda, Ernesto

    2015-01-01

    Graph theory provides a useful framework to study functional brain networks from neuroimaging data. In epilepsy research, recent findings suggest that it offers unique insight into the fingerprints of this pathology on brain dynamics. Most studies hitherto have focused on seizure activity during focal epilepsy, but less is known about functional epileptic brain networks during interictal activity in frontal focal and generalized epilepsy. Besides, it is not clear yet which measures are most suitable to characterize these networks. To address these issues, we recorded magnetoencephalographic (MEG) data using two orthogonal planar gradiometers from 45 subjects from three groups (15 healthy controls (7 males, 24 ± 6 years), 15 frontal focal (8 male, 32 ± 16 years) and 15 generalized epileptic (6 male, 27 ± 7 years) patients) during interictal resting state with closed eyes. Then, we estimated the total and relative spectral power of the largest principal component of the gradiometers, and the degree of phase synchronization between each sensor site in the frequency range [0.5-40 Hz]. We further calculated a comprehensive battery of 15 graph-theoretic measures and used the affinity propagation clustering algorithm to elucidate the minimum set of them that fully describe these functional brain networks. The results show that differences in spectral power between the control and the other two groups have a distinctive pattern: generalized epilepsy presents higher total power for all frequencies except the alpha band over a widespread set of sensors; frontal focal epilepsy shows higher relative power in the beta band bilaterally in the fronto-central sensors. Moreover, all network indices can be clustered into three groups, whose exemplars are the global network efficiency, the eccentricity and the synchronizability. Again, the patterns of differences were clear: the brain network of the generalized epilepsy patients presented greater efficiency and lower

  8. Application of graph theory to the statistical thermodynamics of lattice polymers. I. Elements of theory and test for dimers

    NASA Astrophysics Data System (ADS)

    Brazhnik, Olga D.; Freed, Karl F.

    1996-07-01

    The lattice cluster theory (LCT) is extended to enable inclusion of longer range correlation contributions to the partition function of lattice model polymers in the athermal limit. A diagrammatic technique represents the expansion of the partition function in powers of the inverse lattice coordination number. Graph theory is applied to sort, classify, and evaluate the numerous diagrams appearing in higher orders. New general theorems are proven that provide a significant reduction in the computational labor required to evaluate the contributions from higher order correlations. The new algorithm efficiently generates the correction to the Flory mean field approximation from as many as eight sterically interacting bonds. While the new results contain the essential ingredients for treating a system of flexible chains with arbitrary lengths and concentrations, the complexity of our new algorithm motivates us to test the theory here for the simplest case of a system of lattice dimers by comparison to the dimer packing entropies from the work of Gaunt. This comparison demonstrates that the eight bond LCT is exact through order φ5 for dimers in one through three dimensions, where φ is the volume fraction of dimers. A subsequent work will use the contracted diagrams, derived and tested here, to treat the packing entropy for a system of flexible N-mers at a volume fraction of φ on hypercubic lattices.

  9. The kinematic algebras from the scattering equations

    NASA Astrophysics Data System (ADS)

    Monteiro, Ricardo; O'Connell, Donal

    2014-03-01

    We study kinematic algebras associated to the recently proposed scattering equations, which arise in the description of the scattering of massless particles. In particular, we describe the role that these algebras play in the BCJ duality between colour and kinematics in gauge theory, and its relation to gravity. We find that the scattering equations are a consistency condition for a self-dual-type vertex which is associated to each solution of those equations. We also identify an extension of the anti-self-dual vertex, such that the two vertices are not conjugate in general. Both vertices correspond to the structure constants of Lie algebras. We give a prescription for the use of the generators of these Lie algebras in trivalent graphs that leads to a natural set of BCJ numerators. In particular, we write BCJ numerators for each contribution to the amplitude associated to a solution of the scattering equations. This leads to a decomposition of the determinant of a certain kinematic matrix, which appears naturally in the amplitudes, in terms of trivalent graphs. We also present the kinematic analogues of colour traces, according to these algebras, and the associated decomposition of that determinant.

  10. Prognostic value of graph theory-based tissue architecture analysis in carcinomas of the tongue.

    PubMed

    Sudbø, J; Bankfalvi, A; Bryne, M; Marcelpoil, R; Boysen, M; Piffko, J; Hemmer, J; Kraft, K; Reith, A

    2000-12-01

    Several studies on oral squamous cell carcinomas (OSCC) suggest that the clinical value of traditional histologic grading is limited both by poor reproducibility and by low prognostic impact. However, the prognostic potential of a strictly quantitative and highly reproducible assessment of the tissue architecture in OSCC has not been evaluated. Using image analysis, in 193 cases of T1-2 (Stage I-II) OSCC we retrospectively investigated the prognostic impact of two graph theory-derived structural features: the average Delaunay Edge Length (DEL_av) and the average homogeneity of the Ulam Tree (ELH_av). Both structural features were derived from subgraphs of the Voronoi Diagram. The geometric centers of the cell nuclei were computed, generating a two-dimensional swarm of point-like seeds from which graphs could be constructed. The impact on survival of the computed values of ELH_av and DEL_av was estimated by the method of Kaplan and Meier, with relapse-free survival and overall survival as end-points. The prognostic values of DEL_av and ELH_av as computed for the invasive front, the superficial part of the carcinoma, the total carcinoma, and the normal-appearing oral mucosa were compared. For DEL_av, significant prognostic information was found in the invasive front (p < 0.001). No significant prognostic information was found in superficial part of the carcinoma (p = 0.34), in the carcinoma as a whole (p = 0.35), or in the normal-appearing mucosa (p = 0.27). For ELH_av, significant prognostic information was found in the invasive front (p = 0.01) and, surprisingly, in putatively normal mucosa (p = 0.03). No significant prognostic information was found in superficial parts of the carcinoma (p = 0.34) or in the total carcinoma (p = 0.11). In conclusion, strictly quantitative assessment of tissue architecture in the invasive front of OSCC yields highly prognostic information. PMID:11140700

  11. Radiation Induced Chromatin Conformation Changes Analysed by Fluorescent Localization Microscopy, Statistical Physics, and Graph Theory

    PubMed Central

    Müller, Patrick; Hillebrandt, Sabina; Krufczik, Matthias; Bach, Margund; Kaufmann, Rainer; Hausmann, Michael; Heermann, Dieter W.

    2015-01-01

    It has been well established that the architecture of chromatin in cell nuclei is not random but functionally correlated. Chromatin damage caused by ionizing radiation raises complex repair machineries. This is accompanied by local chromatin rearrangements and structural changes which may for instance improve the accessibility of damaged sites for repair protein complexes. Using stably transfected HeLa cells expressing either green fluorescent protein (GFP) labelled histone H2B or yellow fluorescent protein (YFP) labelled histone H2A, we investigated the positioning of individual histone proteins in cell nuclei by means of high resolution localization microscopy (Spectral Position Determination Microscopy = SPDM). The cells were exposed to ionizing radiation of different doses and aliquots were fixed after different repair times for SPDM imaging. In addition to the repair dependent histone protein pattern, the positioning of antibodies specific for heterochromatin and euchromatin was separately recorded by SPDM. The present paper aims to provide a quantitative description of structural changes of chromatin after irradiation and during repair. It introduces a novel approach to analyse SPDM images by means of statistical physics and graph theory. The method is based on the calculation of the radial distribution functions as well as edge length distributions for graphs defined by a triangulation of the marker positions. The obtained results show that through the cell nucleus the different chromatin re-arrangements as detected by the fluorescent nucleosomal pattern average themselves. In contrast heterochromatic regions alone indicate a relaxation after radiation exposure and re-condensation during repair whereas euchromatin seemed to be unaffected or behave contrarily. SPDM in combination with the analysis techniques applied allows the systematic elucidation of chromatin re-arrangements after irradiation and during repair, if selected sub-regions of nuclei are

  12. Computer Algebra Systems in Undergraduate Instruction.

    ERIC Educational Resources Information Center

    Small, Don; And Others

    1986-01-01

    Computer algebra systems (such as MACSYMA and muMath) can carry out many of the operations of calculus, linear algebra, and differential equations. Use of them with sketching graphs of rational functions and with other topics is discussed. (MNS)

  13. Derivatives in discrete mathematics: a novel graph-theoretical invariant for generating new 2/3D molecular descriptors. I. Theory and QSPR application.

    PubMed

    Marrero-Ponce, Yovani; Santiago, Oscar Martínez; López, Yoan Martínez; Barigye, Stephen J; Torrens, Francisco

    2012-11-01

    In this report, we present a new mathematical approach for describing chemical structures of organic molecules at atomic-molecular level, proposing for the first time the use of the concept of the derivative ([Formula: see text]) of a molecular graph (MG) with respect to a given event (E), to obtain a new family of molecular descriptors (MDs). With this purpose, a new matrix representation of the MG, which generalizes graph's theory's traditional incidence matrix, is introduced. This matrix, denominated the generalized incidence matrix, Q, arises from the Boolean representation of molecular sub-graphs that participate in the formation of the graph molecular skeleton MG and could be complete (representing all possible connected sub-graphs) or constitute sub-graphs of determined orders or types as well as a combination of these. The Q matrix is a non-quadratic and unsymmetrical in nature, its columns (n) and rows (m) are conditions (letters) and collection of conditions (words) with which the event occurs. This non-quadratic and unsymmetrical matrix is transformed, by algebraic manipulation, to a quadratic and symmetric matrix known as relations frequency matrix, F, which characterizes the participation intensity of the conditions (letters) in the events (words). With F, we calculate the derivative over a pair of atomic nuclei. The local index for the atomic nuclei i, Δ(i), can therefore be obtained as a linear combination of all the pair derivatives of the atomic nuclei i with all the rest of the j's atomic nuclei. Here, we also define new strategies that generalize the present form of obtaining global or local (group or atom-type) invariants from atomic contributions (local vertex invariants, LOVIs). In respect to this, metric (norms), means and statistical invariants are introduced. These invariants are applied to a vector whose components are the values Δ(i) for the atomic nuclei of the molecule or its fragments. Moreover, with the purpose of differentiating

  14. Non-Commutative Methods for the K-Theory of C*-Algebras of Aperiodic Patterns from Cut-and-Project Systems

    NASA Astrophysics Data System (ADS)

    Putnam, Ian F.

    2010-03-01

    We investigate the C*-algebras associated to aperiodic structures called model sets obtained by the cut-and-project method. These C*-algebras are Morita equivalent to crossed product C*-algebras obtained from dynamics on a disconnected version of the internal space. This construction may be made from more general data, which we call a hyperplane system. From a hyperplane system, others may be constructed by a process of reduction and we show how the C*-algebras involved are related to each other. In particular, there are natural elements in the Kasparov KK-groups for the C*-algebra of a hyperplane system and that of its reduction. The induced map on K-theory fits in a six-term exact sequence. This provides a new method of the computation of the K-theory of such C*-algebras which is done completely in the setting of non-commutative geometry.

  15. The three-dimensional origin of the classifying algebra

    NASA Astrophysics Data System (ADS)

    Fuchs, Jürgen; Schweigert, Christoph; Stigner, Carl

    2010-01-01

    It is known that reflection coefficients for bulk fields of a rational conformal field theory in the presence of an elementary boundary condition can be obtained as representation matrices of irreducible representations of the classifying algebra, a semisimple commutative associative complex algebra. We show how this algebra arises naturally from the three-dimensional geometry of factorization of correlators of bulk fields on the disk. This allows us to derive explicit expressions for the structure constants of the classifying algebra as invariants of ribbon graphs in the three-manifold S×S. Our result unravels a precise relation between intertwiners of the action of the mapping class group on spaces of conformal blocks and boundary conditions in rational conformal field theories.

  16. Anticipation-related brain connectivity in bipolar and unipolar depression: a graph theory approach.

    PubMed

    Manelis, Anna; Almeida, Jorge R C; Stiffler, Richelle; Lockovich, Jeanette C; Aslam, Haris A; Phillips, Mary L

    2016-09-01

    Bipolar disorder is often misdiagnosed as major depressive disorder, which leads to inadequate treatment. Depressed individuals versus healthy control subjects, show increased expectation of negative outcomes. Due to increased impulsivity and risk for mania, however, depressed individuals with bipolar disorder may differ from those with major depressive disorder in neural mechanisms underlying anticipation processes. Graph theory methods for neuroimaging data analysis allow the identification of connectivity between multiple brain regions without prior model specification, and may help to identify neurobiological markers differentiating these disorders, thereby facilitating development of better therapeutic interventions. This study aimed to compare brain connectivity among regions involved in win/loss anticipation in depressed individuals with bipolar disorder (BDD) versus depressed individuals with major depressive disorder (MDD) versus healthy control subjects using graph theory methods. The study was conducted at the University of Pittsburgh Medical Center and included 31 BDD, 39 MDD, and 36 healthy control subjects. Participants were scanned while performing a number guessing reward task that included the periods of win and loss anticipation. We first identified the anticipatory network across all 106 participants by contrasting brain activation during all anticipation periods (win anticipation + loss anticipation) versus baseline, and win anticipation versus loss anticipation. Brain connectivity within the identified network was determined using the Independent Multiple sample Greedy Equivalence Search (IMaGES) and Linear non-Gaussian Orientation, Fixed Structure (LOFS) algorithms. Density of connections (the number of connections in the network), path length, and the global connectivity direction ('top-down' versus 'bottom-up') were compared across groups (BDD/MDD/healthy control subjects) and conditions (win/loss anticipation). These analyses showed that

  17. A Graph Theory Method For Determination Of Cryo-EM Image Focuses

    PubMed Central

    Jiang, Wen; Guo, Fei; Liu, Zheng

    2012-01-01

    Accurate determination of micrograph focuses is essential for averaging multiple images to reach high-resolution 3-D reconstructions in electron cryo-microscopy (cryo-EM). Current methods use iterative fitting of focus-dependent simulated power spectra to the power spectra of experimental images, with the fitting performed independently for different images. Here we have developed a novel graph theory based method in which the rotational average focus and individual angular sector focuses of all images are determined simultaneously in closed form using the least square solution of overdetermined linear equations. The new method was shown to be fast, accurate, and robust in tests with large datasets of experimental low dose cryo-EM images. Its integration with three classic power spectra fitting methods also allows cross validation of the results by these vastly different methods. The new integrated focus determination method will improve reliability of automated focus determination for large-scale data processing that is increasingly common in the cryo-EM field. PMID:22842112

  18. Morphology and Performance of Polymer Solar Cell Characterized by DPD Simulation and Graph Theory

    NASA Astrophysics Data System (ADS)

    Du, Chunmiao; Ji, Yujin; Xue, Junwei; Hou, Tingjun; Tang, Jianxin; Lee, Shuit-Tong; Li, Youyong

    2015-11-01

    The morphology of active layers in the bulk heterojunction (BHJ) solar cells is critical to the performance of organic photovoltaics (OPV). Currently, there is limited information for the morphology from transmission electron microscopy (TEM) techniques. Meanwhile, there are limited approaches to predict the morphology /efficiency of OPV. Here we use Dissipative Particle Dynamics (DPD) to determine 3D morphology of BHJ solar cells and show DPD to be an efficient approach to predict the 3D morphology. Based on the 3D morphology, we estimate the performance indicator of BHJ solar cells by using graph theory. Specifically, we study poly (3-hexylthiophene)/[6, 6]-phenyl-C61butyric acid methyl ester (P3HT/PCBM) BHJ solar cells. We find that, when the volume fraction of PCBM is in the region 0.4 ∼ 0.5, P3HT/PCBM will show bi-continuous morphology and optimum performance, consistent with experimental results. Further, the optimum temperature (413 K) for the morphology and performance of P3HT/PCBM is in accord with annealing results. We find that solvent additive plays a critical role in the desolvation process of P3HT/PCBM BHJ solar cell. Our approach provides a direct method to predict dynamic 3D morphology and performance indicator for BHJ solar cells.

  19. Morphology and Performance of Polymer Solar Cell Characterized by DPD Simulation and Graph Theory

    PubMed Central

    Du, Chunmiao; Ji, Yujin; Xue, Junwei; Hou, Tingjun; Tang, Jianxin; Lee, Shuit-Tong; Li, Youyong

    2015-01-01

    The morphology of active layers in the bulk heterojunction (BHJ) solar cells is critical to the performance of organic photovoltaics (OPV). Currently, there is limited information for the morphology from transmission electron microscopy (TEM) techniques. Meanwhile, there are limited approaches to predict the morphology /efficiency of OPV. Here we use Dissipative Particle Dynamics (DPD) to determine 3D morphology of BHJ solar cells and show DPD to be an efficient approach to predict the 3D morphology. Based on the 3D morphology, we estimate the performance indicator of BHJ solar cells by using graph theory. Specifically, we study poly (3-hexylthiophene)/[6, 6]-phenyl-C61butyric acid methyl ester (P3HT/PCBM) BHJ solar cells. We find that, when the volume fraction of PCBM is in the region 0.4 ∼ 0.5, P3HT/PCBM will show bi-continuous morphology and optimum performance, consistent with experimental results. Further, the optimum temperature (413 K) for the morphology and performance of P3HT/PCBM is in accord with annealing results. We find that solvent additive plays a critical role in the desolvation process of P3HT/PCBM BHJ solar cell. Our approach provides a direct method to predict dynamic 3D morphology and performance indicator for BHJ solar cells. PMID:26581407

  20. Morphology and Performance of Polymer Solar Cell Characterized by DPD Simulation and Graph Theory.

    PubMed

    Du, Chunmiao; Ji, Yujin; Xue, Junwei; Hou, Tingjun; Tang, Jianxin; Lee, Shuit-Tong; Li, Youyong

    2015-01-01

    The morphology of active layers in the bulk heterojunction (BHJ) solar cells is critical to the performance of organic photovoltaics (OPV). Currently, there is limited information for the morphology from transmission electron microscopy (TEM) techniques. Meanwhile, there are limited approaches to predict the morphology /efficiency of OPV. Here we use Dissipative Particle Dynamics (DPD) to determine 3D morphology of BHJ solar cells and show DPD to be an efficient approach to predict the 3D morphology. Based on the 3D morphology, we estimate the performance indicator of BHJ solar cells by using graph theory. Specifically, we study poly (3-hexylthiophene)/[6, 6]-phenyl-C61butyric acid methyl ester (P3HT/PCBM) BHJ solar cells. We find that, when the volume fraction of PCBM is in the region 0.4 ∼ 0.5, P3HT/PCBM will show bi-continuous morphology and optimum performance, consistent with experimental results. Further, the optimum temperature (413 K) for the morphology and performance of P3HT/PCBM is in accord with annealing results. We find that solvent additive plays a critical role in the desolvation process of P3HT/PCBM BHJ solar cell. Our approach provides a direct method to predict dynamic 3D morphology and performance indicator for BHJ solar cells. PMID:26581407

  1. Utilizing graph theory to select the largest set of unrelated individuals for genetic analysis.

    PubMed

    Staples, Jeffrey; Nickerson, Deborah A; Below, Jennifer E

    2013-02-01

    Many statistical analyses of genetic data rely on the assumption of independence among samples. Consequently, relatedness is either modeled in the analysis or samples are removed to "clean" the data of any pairwise relatedness above a tolerated threshold. Current methods do not maximize the number of unrelated individuals retained for further analysis, and this is a needless loss of resources. We report a novel application of graph theory that identifies the maximum set of unrelated samples in any dataset given a user-defined threshold of relatedness as well as all networks of related samples. We have implemented this method into an open source program called Pedigree Reconstruction and Identification of a Maximum Unrelated Set, PRIMUS. We show that PRIMUS outperforms the three existing methods, allowing researchers to retain up to 50% more unrelated samples. A unique strength of PRIMUS is its ability to weight the maximum clique selection using additional criteria (e.g. affected status and data missingness). PRIMUS is a permanent solution to identifying the maximum number of unrelated samples for a genetic analysis. PMID:22996348

  2. Development of a Computerized Adaptive Testing for Diagnosing the Cognitive Process of Grade 7 Students in Learning Algebra, Using Multidimensional Item Response Theory

    ERIC Educational Resources Information Center

    Senarat, Somprasong; Tayraukham, Sombat; Piyapimonsit, Chatsiri; Tongkhambanjong, Sakesan

    2013-01-01

    The purpose of this research is to develop a multidimensional computerized adaptive test for diagnosing the cognitive process of grade 7 students in learning algebra by applying multidimensional item response theory. The research is divided into 4 steps: 1) the development of item bank of algebra, 2) the development of the multidimensional…

  3. Algebraic K-theory of spaces stratified fibered over hyperbolic orbifolds.

    PubMed

    Farrell, F T; Jones, L E

    1986-08-01

    Among other results, we rationally calculate the algebraic K-theory of any discrete cocompact subgroup of a Lie group G, where G is either O(n, 1), U(n, 1), Sp(n, 1), or F(4), in terms of the homology of the double coset space Gamma\\G/K, where K is a maximal cocompact subgroup of G. We obtain the formula K(n)(ZGamma) [unk] [unk] congruent with [unk](i=0) (infinity)H(i)(Gamma\\G/K; [unk](n-i)), where [unk](j) is a stratified system of Q vector spaces over Gamma\\G/K and the vector space [unk](j)(GammagK) corresponding to the double coset GammagK is isomorphic to K(J)(Z(Gamma [unk] gKg(-1))) [unk] Q. Note Gamma [unk] gKg(-1) is a finite subgroup of Gamma. Earlier, a similar formula for discrete cocompact subgroups Gamma of the group of rigid motions of Euclidean space was conjectured by F. T. Farrell and W. C. Hsiang and proven by F. Quinn. PMID:16593733

  4. Algebraic K-theory of spaces stratified fibered over hyperbolic orbifolds

    PubMed Central

    Farrell, F. T.; Jones, L. E.

    1986-01-01

    Among other results, we rationally calculate the algebraic K-theory of any discrete cocompact subgroup of a Lie group G, where G is either O(n, 1), U(n, 1), Sp(n, 1), or F4, in terms of the homology of the double coset space Γ\\G/K, where K is a maximal cocompact subgroup of G. We obtain the formula Kn(ZΓ) [unk] [unk] ≅ [unk]i=0∞Hi(Γ\\G/K; [unk]n-i), where [unk]j is a stratified system of Q vector spaces over Γ\\G/K and the vector space [unk]j(ΓgK) corresponding to the double coset ΓgK is isomorphic to KJ(Z(Γ [unk] gKg-1)) [unk] Q. Note Γ [unk] gKg-1 is a finite subgroup of Γ. Earlier, a similar formula for discrete cocompact subgroups Γ of the group of rigid motions of Euclidean space was conjectured by F. T. Farrell and W. C. Hsiang and proven by F. Quinn. PMID:16593733

  5. Cytoscape.js: a graph theory library for visualisation and analysis

    PubMed Central

    Franz, Max; Lopes, Christian T.; Huck, Gerardo; Dong, Yue; Sumer, Onur; Bader, Gary D.

    2016-01-01

    Summary: Cytoscape.js is an open-source JavaScript-based graph library. Its most common use case is as a visualization software component, so it can be used to render interactive graphs in a web browser. It also can be used in a headless manner, useful for graph operations on a server, such as Node.js. Availability and implementation: Cytoscape.js is implemented in JavaScript. Documentation, downloads and source code are available at http://js.cytoscape.org. Contact: gary.bader@utoronto.ca PMID:26415722

  6. Applications of automata and graphs: Labeling operators in Hilbert space. II

    SciTech Connect

    Cho, Ilwoo; Jorgensen, Palle E. T.

    2009-06-15

    We introduced a family of infinite graphs directly associated with a class of von Neumann automaton model A{sub G}. These are finite state models used in symbolic dynamics: stimuli models and in control theory. In the context of groupoid von Neumann algebras, and an associated fractal group, we prove a classification theorem for representations of automata.

  7. S-duality and the prepotential of N={2}^{star } theories (II): the non-simply laced algebras

    NASA Astrophysics Data System (ADS)

    Billó, M.; Frau, M.; Fucito, F.; Lerda, A.; Morales, J. F.

    2015-11-01

    We derive a modular anomaly equation satisfied by the prepotential of the N={2}^{star } supersymmetric theories with non-simply laced gauge algebras, including the classical B r and C r infinite series and the exceptional F 4 and G 2 cases. This equation determines the exact prepotential recursively in an expansion for small mass in terms of quasi-modular forms of the S-duality group. We also discuss the behaviour of these theories under S-duality and show that the prepotential of the SO(2 r + 1) theory is mapped to that of the Sp(2 r) theory and viceversa, while the exceptional F 4 and G 2 theories are mapped into themselves (up to a rotation of the roots) in analogy with what happens for the N=4 supersymmetric theories. These results extend the analysis for the simply laced groups presented in a companion paper.

  8. Orientation in operator algebras

    PubMed Central

    Alfsen, Erik M.; Shultz, Frederic W.

    1998-01-01

    A concept of orientation is relevant for the passage from Jordan structure to associative structure in operator algebras. The research reported in this paper bridges the approach of Connes for von Neumann algebras and ourselves for C*-algebras in a general theory of orientation that is of geometric nature and is related to dynamics. PMID:9618457

  9. Graph Theory Enables Drug Repurposing – How a Mathematical Model Can Drive the Discovery of Hidden Mechanisms of Action

    PubMed Central

    Gramatica, Ruggero; Di Matteo, T.; Giorgetti, Stefano; Barbiani, Massimo; Bevec, Dorian; Aste, Tomaso

    2014-01-01

    We introduce a methodology to efficiently exploit natural-language expressed biomedical knowledge for repurposing existing drugs towards diseases for which they were not initially intended. Leveraging on developments in Computational Linguistics and Graph Theory, a methodology is defined to build a graph representation of knowledge, which is automatically analysed to discover hidden relations between any drug and any disease: these relations are specific paths among the biomedical entities of the graph, representing possible Modes of Action for any given pharmacological compound. We propose a measure for the likeliness of these paths based on a stochastic process on the graph. This measure depends on the abundance of indirect paths between a peptide and a disease, rather than solely on the strength of the shortest path connecting them. We provide real-world examples, showing how the method successfully retrieves known pathophysiological Mode of Action and finds new ones by meaningfully selecting and aggregating contributions from known bio-molecular interactions. Applications of this methodology are presented, and prove the efficacy of the method for selecting drugs as treatment options for rare diseases. PMID:24416311

  10. Kaluza-Klein theory revisited: projective structures and differential operators on algebra of densities

    NASA Astrophysics Data System (ADS)

    Khudaverdian, H. M.

    2014-03-01

    We consider differential operators acting on densities of arbitrary weights on manifold M identifying pencils of such operators with operators on algebra of densities of all weights. This algebra can be identified with the special subalgebra of functions on extended manifold . On one hand there is a canonical lift of projective structures on M to affine structures on extended manifold . On the other hand the restriction of algebra of all functions on extended manifold to this special subalgebra of functions implies the canonical scalar product. This leads in particular to classification of second order operators with use of Kaluza-Klein-like mechanisms.

  11. Enhancing multiple-point geostatistical modeling: 1. Graph theory and pattern adjustment

    NASA Astrophysics Data System (ADS)

    Tahmasebi, Pejman; Sahimi, Muhammad

    2016-03-01

    In recent years, higher-order geostatistical methods have been used for modeling of a wide variety of large-scale porous media, such as groundwater aquifers and oil reservoirs. Their popularity stems from their ability to account for qualitative data and the great flexibility that they offer for conditioning the models to hard (quantitative) data, which endow them with the capability for generating realistic realizations of porous formations with very complex channels, as well as features that are mainly a barrier to fluid flow. One group of such models consists of pattern-based methods that use a set of data points for generating stochastic realizations by which the large-scale structure and highly-connected features are reproduced accurately. The cross correlation-based simulation (CCSIM) algorithm, proposed previously by the authors, is a member of this group that has been shown to be capable of simulating multimillion cell models in a matter of a few CPU seconds. The method is, however, sensitive to pattern's specifications, such as boundaries and the number of replicates. In this paper the original CCSIM algorithm is reconsidered and two significant improvements are proposed for accurately reproducing large-scale patterns of heterogeneities in porous media. First, an effective boundary-correction method based on the graph theory is presented by which one identifies the optimal cutting path/surface for removing the patchiness and discontinuities in the realization of a porous medium. Next, a new pattern adjustment method is proposed that automatically transfers the features in a pattern to one that seamlessly matches the surrounding patterns. The original CCSIM algorithm is then combined with the two methods and is tested using various complex two- and three-dimensional examples. It should, however, be emphasized that the methods that we propose in this paper are applicable to other pattern-based geostatistical simulation methods.

  12. Open-Closed Homotopy Algebras and Strong Homotopy Leibniz Pairs Through Koszul Operad Theory

    NASA Astrophysics Data System (ADS)

    Hoefel, Eduardo; Livernet, Muriel

    2012-08-01

    Open-closed homotopy algebras (OCHA) and strong homotopy Leibniz pairs (SHLP) were introduced by Kajiura and Stasheff in 2004. In an appendix to their paper, Markl observed that an SHLP is equivalent to an algebra over the minimal model of a certain operad, without showing that the operad is Koszul. In the present paper, we show that both OCHA and SHLP are algebras over the minimal model of the zeroth homology of two versions of the Swiss-cheese operad and prove that these two operads are Koszul. As an application, we show that the OCHA operad is non-formal as a 2-colored operad but is formal as an algebra in the category of 2-collections.

  13. Lie algebra extensions of current algebras on S3

    NASA Astrophysics Data System (ADS)

    Kori, Tosiaki; Imai, Yuto

    2015-06-01

    An affine Kac-Moody algebra is a central extension of the Lie algebra of smooth mappings from S1 to the complexification of a Lie algebra. In this paper, we shall introduce a central extension of the Lie algebra of smooth mappings from S3 to the quaternization of a Lie algebra and investigate its root space decomposition. We think this extension of current algebra might give a mathematical tool for four-dimensional conformal field theory as Kac-Moody algebras give it for two-dimensional conformal field theory.

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

  15. The Algebra of the Arches

    ERIC Educational Resources Information Center

    Buerman, Margaret

    2007-01-01

    Finding real-world examples for middle school algebra classes can be difficult but not impossible. As we strive to accomplish teaching our students how to solve and graph equations, we neglect to teach the big ideas of algebra. One of those big ideas is functions. This article gives three examples of functions that are found in Arches National…

  16. Abnormal functional resting-state networks in ADHD: graph theory and pattern recognition analysis of fMRI data.

    PubMed

    dos Santos Siqueira, Anderson; Biazoli Junior, Claudinei Eduardo; Comfort, William Edgar; Rohde, Luis Augusto; Sato, João Ricardo

    2014-01-01

    The framework of graph theory provides useful tools for investigating the neural substrates of neuropsychiatric disorders. Graph description measures may be useful as predictor variables in classification procedures. Here, we consider several centrality measures as predictor features in a classification algorithm to identify nodes of resting-state networks containing predictive information that can discriminate between typical developing children and patients with attention-deficit/hyperactivity disorder (ADHD). The prediction was based on a support vector machines classifier. The analyses were performed in a multisite and publicly available resting-state fMRI dataset of healthy children and ADHD patients: the ADHD-200 database. Network centrality measures contained little predictive information for the discrimination between ADHD patients and healthy subjects. However, the classification between inattentive and combined ADHD subtypes was more promising, achieving accuracies higher than 65% (balance between sensitivity and specificity) in some sites. Finally, brain regions were ranked according to the amount of discriminant information and the most relevant were mapped. As hypothesized, we found that brain regions in motor, frontoparietal, and default mode networks contained the most predictive information. We concluded that the functional connectivity estimations are strongly dependent on the sample characteristics. Thus different acquisition protocols and clinical heterogeneity decrease the predictive values of the graph descriptors. PMID:25309910

  17. Permutation centralizer algebras and multimatrix invariants

    NASA Astrophysics Data System (ADS)

    Mattioli, Paolo; Ramgoolam, Sanjaye

    2016-03-01

    We introduce a class of permutation centralizer algebras which underly the combinatorics of multimatrix gauge-invariant observables. One family of such noncommutative algebras is parametrized by two integers. Its Wedderburn-Artin decomposition explains the counting of restricted Schur operators, which were introduced in the physics literature to describe open strings attached to giant gravitons and were subsequently used to diagonalize the Gaussian inner product for gauge invariants of two-matrix models. The structure of the algebra, notably its dimension, its center and its maximally commuting subalgebra, is related to Littlewood-Richardson numbers for composing Young diagrams. It gives a precise characterization of the minimal set of charges needed to distinguish arbitrary matrix gauge invariants, which are related to enhanced symmetries in gauge theory. The algebra also gives a star product for matrix invariants. The center of the algebra allows efficient computation of a sector of multimatrix correlators. These generate the counting of a certain class of bicoloured ribbon graphs with arbitrary genus.

  18. A self-adaptive mean-shift segmentation approach based on graph theory for high-resolution remote sensing images

    NASA Astrophysics Data System (ADS)

    Chen, Luwan; Han, Ling; Ning, Xiaohong

    2015-12-01

    An auto new segmentation approach based on graph theory which named self-adaptive mean-shift for high-resolution remote sensing images was proposed in this paper. This approach could overcome some defects that classic Mean-Shift must determine the fixed bandwidth through trial many times, and could effectively distinguish the difference between different features in the texture rich region. Segmentation experiments were processed with WorldView satellite image. The results show that the presented method is adaptive, and its speed and precision can satisfy application, so it is a robust automatic segmentation algorithm.

  19. Anatomy of a gauge theory

    SciTech Connect

    Kreimer, Dirk . E-mail: kreimer@ihes.fr

    2006-12-15

    We exhibit the role of Hochschild cohomology in quantum field theory with particular emphasis on gauge theory and Dyson-Schwinger equations, the quantum equations of motion. These equations emerge from Hopf- and Lie algebra theory and free quantum field theory only. In the course of our analysis, we exhibit an intimate relation between the Slavnov-Taylor identities for the couplings and the existence of Hopf sub-algebras defined on the sum of all graphs at a given loop order, surpassing the need to work on single diagrams.

  20. Characterizing the Development of Specialized Mathematical Content Knowledge for Teaching in Algebraic Reasoning and Number Theory

    ERIC Educational Resources Information Center

    Bair, Sherry L.; Rich, Beverly S.

    2011-01-01

    This article characterizes the development of a deep and connected body of mathematical knowledge categorized by Ball and Bass' (2003b) model of Mathematical Knowledge for Teaching (MKT), as Specialized Content Knowledge for Teaching (SCK) in algebraic reasoning and number sense. The research employed multiple cases across three years from two…

  1. An Application of Cartesian Graphing to Seismic Exploration.

    ERIC Educational Resources Information Center

    Robertson, Douglas Frederick

    1992-01-01

    Describes how college students enrolled in a course in elementary algebra apply graphing and algebra to data collected from a seismic profile to uncover the structure of a subterranean rock formation. Includes steps guiding the activity. (MDH)

  2. Replica theory for learning curves for Gaussian processes on random graphs

    NASA Astrophysics Data System (ADS)

    Urry, M. J.; Sollich, P.

    2012-10-01

    We use a statistical physics approach to derive accurate predictions for the challenging problem of predicting the performance of Gaussian process regression. Performance is quantified by the learning curve, defined as the average error versus number of training examples. We assume the Gaussian process prior is defined by a random walk kernel, inputs are vertices on a random graph and the outputs are noisy function values. We show that replica techniques can be used to obtain exact performance predictions in the limit of large graphs, after first rewriting the average error in terms of a graphical model. Conventionally, the Gaussian process kernel is only globally normalized, so that the prior variance can differ between vertices. As a more principled alternative we also consider local normalization, where the prior variance is uniform. The normalization constants for the prior then have to be defined as thermal averages in an unnormalized model and this requires the introduction of a second, auxiliary set of replicas. Our results for both types of kernel normalization apply generically to all random graph ensembles constrained by a fixed but arbitrary degree distribution. We compare with numerically simulated learning curves and find excellent agreement, a significant improvement over existing approximations.

  3. Box graphs and resolutions II: From Coulomb phases to fiber faces

    NASA Astrophysics Data System (ADS)

    Braun, Andreas P.; Schäfer-Nameki, Sakura

    2016-04-01

    Box graphs, or equivalently Coulomb phases of three-dimensional N = 2 supersymmetric gauge theories with matter, give a succinct, comprehensive and elegant characterization of crepant resolutions of singular elliptically fibered varieties. Furthermore, the box graphs predict that the phases are organized in terms of a network of flop transitions. The geometric construction of the resolutions associated to the phases is, however, a difficult problem. Here, we identify a correspondence between box graphs for the gauge algebras su (2 k + 1) with resolutions obtained using toric tops and generalizations thereof. Moreover, flop transitions between different such resolutions agree with those predicted by the box graphs. Our results thereby provide explicit realizations of the box graph resolutions.

  4. Tracing retinal blood vessels by matrix-forest theorem of directed graphs.

    PubMed

    Cheng, Li; De, Jaydeep; Zhang, Xiaowei; Lin, Feng; Li, Huiqi

    2014-01-01

    This paper aims to trace retinal blood vessel trees in fundus images. This task is far from being trivial as the crossover of vessels are commonly encountered in image-based vessel networks. Meanwhile it is often crucial to separate the vessel tree structures in applications such as diabetic retinopathy analysis. In this work, a novel directed graph based approach is proposed to cast the task as label propagation over directed graphs, such that the graph is to be partitioned into disjoint sub-graphs, or equivalently, each of the vessel trees is traced and separated from the rest of the vessel network. Then the tracing problem is addressed by making novel usage of the matrix-forest theorem in algebraic graph theory. Empirical experiments on synthetic as well as publicly available fundus image datasets demonstrate the applicability of our approach. PMID:25333171

  5. Perfect quantum state transfer of hard-core bosons on weighted path graphs

    NASA Astrophysics Data System (ADS)

    Large, Steven J.; Underwood, Michael S.; Feder, David L.

    2015-03-01

    The ability to accurately transfer quantum information through networks is an important primitive in distributed quantum systems. While perfect quantum state transfer (PST) can be effected by a single particle undergoing continuous-time quantum walks on a variety of graphs, it is not known if PST persists for many particles in the presence of interactions. We show that if single-particle PST occurs on one-dimensional weighted path graphs, then systems of hard-core bosons undergoing quantum walks on these paths also undergo PST. The analysis extends the Tonks-Girardeau ansatz to weighted graphs using techniques in algebraic graph theory. The results suggest that hard-core bosons do not generically undergo PST, even on graphs which exhibit single-particle PST.

  6. Graph theory in brain-to-brain connectivity: A simulation study and an application to an EEG hyperscanning experiment.

    PubMed

    Toppi, J; Ciaramidaro, A; Vogel, P; Mattia, D; Babiloni, F; Siniatchkin, M; Astolfi, L

    2015-08-01

    Hyperscanning consists in the simultaneous recording of hemodynamic or neuroelectrical signals from two or more subjects acting in a social context. Well-established methodologies for connectivity estimation have already been adapted to hyperscanning purposes. The extension of graph theory approach to multi-subjects case is still a challenging issue. In the present work we aim to test the ability of the currently used graph theory global indices in describing the properties of a network given by two interacting subjects. The testing was conducted first on surrogate brain-to-brain networks reproducing typical social scenarios and then on real EEG hyperscanning data recorded during a Joint Action task. The results of the simulation study highlighted the ability of all the investigated indexes in modulating their values according to the level of interaction between subjects. However, only global efficiency and path length indexes demonstrated to be sensitive to an asymmetry in the communication between the two subjects. Such results were, then, confirmed by the application on real EEG data. Global efficiency modulated, in fact, their values according to the inter-brain density, assuming higher values in the social condition with respect to the non-social condition. PMID:26736730

  7. Cluster Consensus of Nonlinearly Coupled Multi-Agent Systems in Directed Graphs

    NASA Astrophysics Data System (ADS)

    Lu, Xiao-Qing; Francis, Austin; Chen, Shi-Hua

    2010-05-01

    We investigate the cluster consensus problem in directed networks of nonlinearly coupled multi-agent systems by using pinning control. Depending on the community structure generated by the group partition of the underlying digraph, various clusters can be made coherently independent by applying feedback injections to a fraction of the agents. Sufficient conditions for cluster consensus are obtained using algebraic graph theory and matrix theory and some simulations results are included to illustrate the method.

  8. Pseudorational Impulse Responses — Algebraic System Theory for Distributed Parameter Systems

    NASA Astrophysics Data System (ADS)

    Yamamoto, Yutaka

    This paper gives a comprehensive account on a class of distributed parameter systems, whose impulse response is called pseudorational. This notion was introduced by the author in 1980's, and is particularly amenable for the study of systems with bounded-time memory. We emphasize algebraic structures induced by this class of systems. Some recent results on coprimeness issues and H∞ control are discussed and illustrated.

  9. Teaching Algebra without Algebra

    ERIC Educational Resources Information Center

    Kalman, Richard S.

    2008-01-01

    Algebra is, among other things, a shorthand way to express quantitative reasoning. This article illustrates ways for the classroom teacher to convert algebraic solutions to verbal problems into conversational solutions that can be understood by students in the lower grades. Three reasonably typical verbal problems that either appeared as or…

  10. Handling context-sensitivity in protein structures using graph theory: bona fide prediction.

    PubMed

    Samudrala, R; Moult, J

    1997-01-01

    We constructed five comparative models in a blind manner for the second meeting on the Critical Assessment of protein Structure Prediction methods (CASP2). The method used is based on a novel graph-theoretic clique-finding approach, and attempts to address the problem of interconnected structural changes in the comparative modeling of protein structures. We discuss briefly how the method is used for protein structure prediction, and detail how it performs in the blind tests. We find that compared to CASP1, significant improvements in building insertions and deletions and sidechain conformations have been achieved. PMID:9485494

  11. Prospective Teachers' Views on the Use of Calculators with Computer Algebra System in Algebra Instruction

    ERIC Educational Resources Information Center

    Ozgun-Koca, S. Ash

    2010-01-01

    Although growing numbers of secondary school mathematics teachers and students use calculators to study graphs, they mainly rely on paper-and-pencil when manipulating algebraic symbols. However, the Computer Algebra Systems (CAS) on computers or handheld calculators create new possibilities for teaching and learning algebraic manipulation. This…

  12. Hyperspectral target detection using graph theory models and manifold geometry via an adaptive implementation of locally linear embedding

    NASA Astrophysics Data System (ADS)

    Ziemann, Amanda K.; Messinger, David W.

    2014-06-01

    Hyperspectral images comprise, by design, high dimensional image data. However, research has shown that for a d-dimensional hyperspectral image, it is typical for the data to inherently occupy an m-dimensional space, with m << d. In the remote sensing community, this has led to a recent increase in the use of non-linear manifold learning, which aims to characterize the embedded lower-dimensional, non-linear manifold upon which the hyperspectral data inherently lie. Classic hyperspectral data models include statistical, linear subspace, and linear mixture models, but these can place restrictive assumptions on the distribution of the data. With graph theory and manifold learning based models, the only assumption is that the data reside on an underlying manifold. In previous publications, we have shown that manifold coordinate approximation using locally linear embedding (LLE) is a viable pre-processing step for target detection with the Adaptive Cosine/Coherence Estimator (ACE) algorithm. Here, we improve upon that methodology using a more rigorous, data-driven implementation of LLE that incorporates the injection of a cloud" of target pixels and the Spectral Angle Mapper (SAM) detector. The LLE algorithm, which holds that the data is locally linear, is typically governed by a user defined parameter k, indicating the number of nearest neighbors to use in the initial graph model. We use an adaptive approach to building the graph that is governed by the data itself and does not rely upon user input. This implementation of LLE can yield greater separation between the target pixels and the background pixels in the manifold space. We present an analysis of target detection performance in the manifold coordinates using scene-derived target spectra and laboratory-measured target spectra across two different data sets.

  13. Impossible Graphs.

    ERIC Educational Resources Information Center

    Noble, Tracy; And Others

    Graphs without a time axis, such as velocity-versus-position graphs, offer interesting possibilities for exploring graphing and motion. Relations depicted by these graphs are not limited to functions. Interviews with a high school student named Olivia, who uses a motion detector to create such graphs, indicate that she uses thought experiments as…

  14. Network representation of protein interactions: Theory of graph description and analysis.

    PubMed

    Kurzbach, Dennis

    2016-09-01

    A methodological framework is presented for the graph theoretical interpretation of NMR data of protein interactions. The proposed analysis generalizes the idea of network representations of protein structures by expanding it to protein interactions. This approach is based on regularization of residue-resolved NMR relaxation times and chemical shift data and subsequent construction of an adjacency matrix that represents the underlying protein interaction as a graph or network. The network nodes represent protein residues. Two nodes are connected if two residues are functionally correlated during the protein interaction event. The analysis of the resulting network enables the quantification of the importance of each amino acid of a protein for its interactions. Furthermore, the determination of the pattern of correlations between residues yields insights into the functional architecture of an interaction. This is of special interest for intrinsically disordered proteins, since the structural (three-dimensional) architecture of these proteins and their complexes is difficult to determine. The power of the proposed methodology is demonstrated at the example of the interaction between the intrinsically disordered protein osteopontin and its natural ligand heparin. PMID:27272236

  15. Network analysis for a network disorder: The emerging role of graph theory in the study of epilepsy.

    PubMed

    Bernhardt, Boris C; Bonilha, Leonardo; Gross, Donald W

    2015-09-01

    Recent years have witnessed a paradigm shift in the study and conceptualization of epilepsy, which is increasingly understood as a network-level disorder. An emblematic case is temporal lobe epilepsy (TLE), the most common drug-resistant epilepsy that is electroclinically defined as a focal epilepsy and pathologically associated with hippocampal sclerosis. In this review, we will summarize histopathological, electrophysiological, and neuroimaging evidence supporting the concept that the substrate of TLE is not limited to the hippocampus alone, but rather is broadly distributed across multiple brain regions and interconnecting white matter pathways. We will introduce basic concepts of graph theory, a formalism to quantify topological properties of complex systems that has recently been widely applied to study networks derived from brain imaging and electrophysiology. We will discuss converging graph theoretical evidence indicating that networks in TLE show marked shifts in their overall topology, providing insight into the neurobiology of TLE as a network-level disorder. Our review will conclude by discussing methodological challenges and future clinical applications of this powerful analytical approach. PMID:26159729

  16. An approach based on two-dimensional graph theory for structural cluster detection and its histopathological application.

    PubMed

    Kayser, K; Sandau, K; Paul, J; Weisse, G

    1992-02-01

    An approach based on graph theory is described for detecting clusters of cells in tissue specimens (two-dimensional space). With a set of discrete basic elements (cell nuclei) having several measurable features (area, surface, main and minor axis of best-fitting ellipses) a graph is defined as having attributes associated with edges. Different minimum spanning trees (MSTs) can be constructed using different weight functions on the attributes (attributed MST). Analysis of the MST and of an attributed MST by use of a decomposition function allows detection of image areas with similar local properties. These clusters, which are then clusters of the tree, describe, for example, partial growth in different directions in a case of a human fibrosarcoma assuming that tumour cell nuclei are homogeneous with respect to their configuration and size. The model allows the separation of clusters of tumour cells growing in different directions and the approximation of the different growth angles. This decomposition also allows us to create new (higher) orders of structure (cluster tree). PMID:1564724

  17. Dynamical basis sets for algebraic variational calculations in quantum-mechanical scattering theory

    NASA Technical Reports Server (NTRS)

    Sun, Yan; Kouri, Donald J.; Truhlar, Donald G.; Schwenke, David W.

    1990-01-01

    New basis sets are proposed for linear algebraic variational calculations of transition amplitudes in quantum-mechanical scattering problems. These basis sets are hybrids of those that yield the Kohn variational principle (KVP) and those that yield the generalized Newton variational principle (GNVP) when substituted in Schlessinger's stationary expression for the T operator. Trial calculations show that efficiencies almost as great as that of the GNVP and much greater than the KVP can be obtained, even for basis sets with the majority of the members independent of energy.

  18. A conceptual model for quantifying connectivity using graph theory and cellular (per-pixel) approach

    NASA Astrophysics Data System (ADS)

    Singh, Manudeo; Sinha, Rajiv; Tandon, Sampat K.

    2016-04-01

    pathways will show changes under different LULC conditions even if the slope remains the same. The graphical approach provides the statistics of connected and disconnected graph elements (edges, nodes) and graph components, thereby allowing the quantification of structural connectivity. This approach also quantifies the dynamic connectivity by allowing the measurement of the fluxes (e.g. via hydrographs or sedimentographs) at any node as well as at any system outlet. The contribution of any sub-system can be understood by removing the remaining sub-systems which can be conveniently achieved by masking associated graph elements.

  19. Geometric Algebra for Physicists

    NASA Astrophysics Data System (ADS)

    Doran, Chris; Lasenby, Anthony

    2007-11-01

    Preface; Notation; 1. Introduction; 2. Geometric algebra in two and three dimensions; 3. Classical mechanics; 4. Foundations of geometric algebra; 5. Relativity and spacetime; 6. Geometric calculus; 7. Classical electrodynamics; 8. Quantum theory and spinors; 9. Multiparticle states and quantum entanglement; 10. Geometry; 11. Further topics in calculus and group theory; 12. Lagrangian and Hamiltonian techniques; 13. Symmetry and gauge theory; 14. Gravitation; Bibliography; Index.

  20. Toward an Integration of Item-Response Theory and Cognitive Error Diagnoses.

    ERIC Educational Resources Information Center

    Tatsuoka, Kikumi K.

    The Rule Space Model, a cognitive error diagnostic methodology, is discussed, and the philosophy behind it is related to the question of what really determines item response curves. The Rule Space approach integrates Item Response Theory and the algebraic theory of databases. An application of Graph Theory is introduced as a way to acquire a list…

  1. Maximising the size of non-redundant protein datasets using graph theory.

    PubMed

    Bull, Simon C; Muldoon, Mark R; Doig, Andrew J

    2013-01-01

    Analysis of protein data sets often requires prior removal of redundancy, so that data is not biased by containing similar proteins. This is usually achieved by pairwise comparison of sequences, followed by purging so that no two pairs have similarities above a chosen threshold. From a starting set, such as the PDB or a genome, one should remove as few sequences as possible, to give the largest possible non-redundant set for subsequent analysis. Protein redundancy can be represented as a graph, with proteins as nodes connected by undirected edges, if they have a pairwise similarity above the chosen threshold. The problem is then equivalent to finding the maximum independent set (MIS), where as few nodes are removed as possible to remove all edges. We tested seven MIS algorithms, three of which are new. We applied the methods to the PDB, subsets of the PDB, various genomes and the BHOLSIB benchmark datasets. For PDB subsets of up to 1000 proteins, we could compare to the exact MIS, found by the Cliquer algorithm. The best algorithm was the new method, Leaf. This works by adding clique members that have no edges to nodes outside the clique to the MIS, starting with the smallest cliques. For PDB subsets of up to 1000 members, it usually finds the MIS and is fast enough to apply to data sets of tens of thousands of proteins. Leaf gives sets that are around 10% larger than the commonly used PISCES algorithm, that are of identical quality. We therefore suggest that Leaf should be the method of choice for generating non-redundant protein data sets, though it is ineffective on dense graphs, such as the BHOLSIB benchmarks. The Leaf algorithm is available at: https://github.com/SimonCB765/Leaf, and sets from genomes and the PDB are available at: http://www.bioinf.manchester.ac.uk/leaf/. PMID:23393584

  2. Computing highly correlated positions using mutual information and graph theory for G protein-coupled receptors.

    PubMed

    Fatakia, Sarosh N; Costanzi, Stefano; Chow, Carson C

    2009-01-01

    G protein-coupled receptors (GPCRs) are a superfamily of seven transmembrane-spanning proteins involved in a wide array of physiological functions and are the most common targets of pharmaceuticals. This study aims to identify a cohort or clique of positions that share high mutual information. Using a multiple sequence alignment of the transmembrane (TM) domains, we calculated the mutual information between all inter-TM pairs of aligned positions and ranked the pairs by mutual information. A mutual information graph was constructed with vertices that corresponded to TM positions and edges between vertices were drawn if the mutual information exceeded a threshold of statistical significance. Positions with high degree (i.e. had significant mutual information with a large number of other positions) were found to line a well defined inter-TM ligand binding cavity for class A as well as class C GPCRs. Although the natural ligands of class C receptors bind to their extracellular N-terminal domains, the possibility of modulating their activity through ligands that bind to their helical bundle has been reported. Such positions were not found for class B GPCRs, in agreement with the observation that there are not known ligands that bind within their TM helical bundle. All identified key positions formed a clique within the MI graph of interest. For a subset of class A receptors we also considered the alignment of a portion of the second extracellular loop, and found that the two positions adjacent to the conserved Cys that bridges the loop with the TM3 qualified as key positions. Our algorithm may be useful for localizing topologically conserved regions in other protein families. PMID:19262747

  3. A New Method for Sperm Characterization for Infertility Treatment: Hypothesis Testing by Using Combination of Watershed Segmentation and Graph Theory

    PubMed Central

    Shojaedini, Seyed Vahab; Heydari, Masoud

    2014-01-01

    Shape and movement features of sperms are important parameters for infertility study and treatment. In this article, a new method is introduced for characterization sperms in microscopic videos. In this method, first a hypothesis framework is defined to distinguish sperms from other particles in captured video. Then decision about each hypothesis is done in following steps: Selecting some primary regions as candidates for sperms by watershed-based segmentation, pruning of some false candidates during successive frames using graph theory concept and finally confirming correct sperms by using their movement trajectories. Performance of the proposed method is evaluated on real captured images belongs to semen with high density of sperms. The obtained results show the proposed method may detect 97% of sperms in presence of 5% false detections and track 91% of moving sperms. Furthermore, it can be shown that better characterization of sperms in proposed algorithm doesn’t lead to extracting more false sperms compared to some present approaches. PMID:25426431

  4. Teaching and Learning about Graphing through Computer-Assisted Problem Solving: Issues in the Design and Interpretation of Graphs, the Design and Use of Educational Software, and Classroom Research Methodology.

    ERIC Educational Resources Information Center

    Jackson, David F.; And Others

    Recent research has demonstrated the promise of graphing software as an aid to teaching graphs in two content areas: line graphs of aspects of motion and graphs of algebraic functions. This study attempted to generalize the idea of computer-assisted graphing to include the use of several kinds of graphs to solve a wider range of problems. A unit…

  5. An extension of the classical theory of algebraic invariants to pseudo-Riemannian geometry and Hamiltonian mechanics

    NASA Astrophysics Data System (ADS)

    McLenaghan, Raymond G.; Smirnov, Roman G.; The, Dennis

    2004-03-01

    We develop a new approach to the study of Killing tensors defined in pseudo-Riemannian spaces of constant curvature that is ideologically close to the classical theory of invariants. The main idea, which provides the foundation of the new approach, is to treat a Killing tensor as an algebraic object determined by a set of parameters of the corresponding vector space of Killing tensors under the action of the isometry group. The spaces of group invariants and conformal group invariants of valence two Killing tensors defined in the Minkowski plane are described. The group invariants, which are the generators of the space of invariants, are applied to the problem of classification of orthogonally separable Hamiltonian systems defined in the Minkowski plane. Transformation formulas to separable coordinates expressed in terms of the parameters of the corresponding space of Killing tensors are presented. The results are applied to the problem of orthogonal separability of the Drach superintegrable potentials.

  6. Box graphs and resolutions I

    NASA Astrophysics Data System (ADS)

    Braun, Andreas P.; Schäfer-Nameki, Sakura

    2016-04-01

    Box graphs succinctly and comprehensively characterize singular fibers of elliptic fibrations in codimension two and three, as well as flop transitions connecting these, in terms of representation theoretic data. We develop a framework that provides a systematic map between a box graph and a crepant algebraic resolution of the singular elliptic fibration, thus allowing an explicit construction of the fibers from a singular Weierstrass or Tate model. The key tool is what we call a fiber face diagram, which shows the relevant information of a (partial) toric triangulation and allows the inclusion of more general algebraic blowups. We shown that each such diagram defines a sequence of weighted algebraic blowups, thus providing a realization of the fiber defined by the box graph in terms of an explicit resolution. We show this correspondence explicitly for the case of SU (5) by providing a map between box graphs and fiber faces, and thereby a sequence of algebraic resolutions of the Tate model, which realizes each of the box graphs.

  7. Rees algebras, Monomial Subrings and Linear Optimization Problems

    NASA Astrophysics Data System (ADS)

    Dupont, Luis A.

    2010-06-01

    In this thesis we are interested in studying algebraic properties of monomial algebras, that can be linked to combinatorial structures, such as graphs and clutters, and to optimization problems. A goal here is to establish bridges between commutative algebra, combinatorics and optimization. We study the normality and the Gorenstein property-as well as the canonical module and the a-invariant-of Rees algebras and subrings arising from linear optimization problems. In particular, we study algebraic properties of edge ideals and algebras associated to uniform clutters with the max-flow min-cut property or the packing property. We also study algebraic properties of symbolic Rees algebras of edge ideals of graphs, edge ideals of clique clutters of comparability graphs, and Stanley-Reisner rings.

  8. A Systematic Composite Service Design Modeling Method Using Graph-Based Theory

    PubMed Central

    Elhag, Arafat Abdulgader Mohammed; Mohamad, Radziah; Aziz, Muhammad Waqar; Zeshan, Furkh

    2015-01-01

    The composite service design modeling is an essential process of the service-oriented software development life cycle, where the candidate services, composite services, operations and their dependencies are required to be identified and specified before their design. However, a systematic service-oriented design modeling method for composite services is still in its infancy as most of the existing approaches provide the modeling of atomic services only. For these reasons, a new method (ComSDM) is proposed in this work for modeling the concept of service-oriented design to increase the reusability and decrease the complexity of system while keeping the service composition considerations in mind. Furthermore, the ComSDM method provides the mathematical representation of the components of service-oriented design using the graph-based theoryto facilitate the design quality measurement. To demonstrate that the ComSDM method is also suitable for composite service design modeling of distributed embedded real-time systems along with enterprise software development, it is implemented in the case study of a smart home. The results of the case study not only check the applicability of ComSDM, but can also be used to validate the complexity and reusability of ComSDM. This also guides the future research towards the design quality measurement such as using the ComSDM method to measure the quality of composite service design in service-oriented software system. PMID:25928358

  9. Highlighting the Structure-Function Relationship of the Brain with the Ising Model and Graph Theory

    PubMed Central

    Das, T. K.; Abeyasinghe, P. M.; Crone, J. S.; Sosnowski, A.; Laureys, S.; Owen, A. M.; Soddu, A.

    2014-01-01

    With the advent of neuroimaging techniques, it becomes feasible to explore the structure-function relationships in the brain. When the brain is not involved in any cognitive task or stimulated by any external output, it preserves important activities which follow well-defined spatial distribution patterns. Understanding the self-organization of the brain from its anatomical structure, it has been recently suggested to model the observed functional pattern from the structure of white matter fiber bundles. Different models which study synchronization (e.g., the Kuramoto model) or global dynamics (e.g., the Ising model) have shown success in capturing fundamental properties of the brain. In particular, these models can explain the competition between modularity and specialization and the need for integration in the brain. Graphing the functional and structural brain organization supports the model and can also highlight the strategy used to process and organize large amount of information traveling between the different modules. How the flow of information can be prevented or partially destroyed in pathological states, like in severe brain injured patients with disorders of consciousness or by pharmacological induction like in anaesthesia, will also help us to better understand how global or integrated behavior can emerge from local and modular interactions. PMID:25276772

  10. Cortical connectivity and memory performance in cognitive decline: A study via graph theory from EEG data.

    PubMed

    Vecchio, F; Miraglia, F; Quaranta, D; Granata, G; Romanello, R; Marra, C; Bramanti, P; Rossini, P M

    2016-03-01

    Functional brain abnormalities including memory loss are found to be associated with pathological changes in connectivity and network neural structures. Alzheimer's disease (AD) interferes with memory formation from the molecular level, to synaptic functions and neural networks organization. Here, we determined whether brain connectivity of resting-state networks correlate with memory in patients affected by AD and in subjects with mild cognitive impairment (MCI). One hundred and forty-four subjects were recruited: 70 AD (MMSE Mini Mental State Evaluation 21.4), 50 MCI (MMSE 25.2) and 24 healthy subjects (MMSE 29.8). Undirected and weighted cortical brain network was built to evaluate graph core measures to obtain Small World parameters. eLORETA lagged linear connectivity as extracted by electroencephalogram (EEG) signals was used to weight the network. A high statistical correlation between Small World and memory performance was found. Namely, higher Small World characteristic in EEG gamma frequency band during the resting state, better performance in short-term memory as evaluated by the digit span tests. Such Small World pattern might represent a biomarker of working memory impairment in older people both in physiological and pathological conditions. PMID:26724581

  11. Highlighting the structure-function relationship of the brain with the Ising model and graph theory.

    PubMed

    Das, T K; Abeyasinghe, P M; Crone, J S; Sosnowski, A; Laureys, S; Owen, A M; Soddu, A

    2014-01-01

    With the advent of neuroimaging techniques, it becomes feasible to explore the structure-function relationships in the brain. When the brain is not involved in any cognitive task or stimulated by any external output, it preserves important activities which follow well-defined spatial distribution patterns. Understanding the self-organization of the brain from its anatomical structure, it has been recently suggested to model the observed functional pattern from the structure of white matter fiber bundles. Different models which study synchronization (e.g., the Kuramoto model) or global dynamics (e.g., the Ising model) have shown success in capturing fundamental properties of the brain. In particular, these models can explain the competition between modularity and specialization and the need for integration in the brain. Graphing the functional and structural brain organization supports the model and can also highlight the strategy used to process and organize large amount of information traveling between the different modules. How the flow of information can be prevented or partially destroyed in pathological states, like in severe brain injured patients with disorders of consciousness or by pharmacological induction like in anaesthesia, will also help us to better understand how global or integrated behavior can emerge from local and modular interactions. PMID:25276772

  12. A systematic composite service design modeling method using graph-based theory.

    PubMed

    Elhag, Arafat Abdulgader Mohammed; Mohamad, Radziah; Aziz, Muhammad Waqar; Zeshan, Furkh

    2015-01-01

    The composite service design modeling is an essential process of the service-oriented software development life cycle, where the candidate services, composite services, operations and their dependencies are required to be identified and specified before their design. However, a systematic service-oriented design modeling method for composite services is still in its infancy as most of the existing approaches provide the modeling of atomic services only. For these reasons, a new method (ComSDM) is proposed in this work for modeling the concept of service-oriented design to increase the reusability and decrease the complexity of system while keeping the service composition considerations in mind. Furthermore, the ComSDM method provides the mathematical representation of the components of service-oriented design using the graph-based theoryto facilitate the design quality measurement. To demonstrate that the ComSDM method is also suitable for composite service design modeling of distributed embedded real-time systems along with enterprise software development, it is implemented in the case study of a smart home. The results of the case study not only check the applicability of ComSDM, but can also be used to validate the complexity and reusability of ComSDM. This also guides the future research towards the design quality measurement such as using the ComSDM method to measure the quality of composite service design in service-oriented software system. PMID:25928358

  13. A Study towards Building An Optimal Graph Theory Based Model For The Design of Tourism Website

    NASA Astrophysics Data System (ADS)

    Panigrahi, Goutam; Das, Anirban; Basu, Kajla

    2010-10-01

    Effective tourism website is a key to attract tourists from different parts of the world. Here we identify the factors of improving the effectiveness of website by considering it as a graph, where web pages including homepage are the nodes and hyperlinks are the edges between the nodes. In this model, the design constraints for building a tourism website are taken into consideration. Our objectives are to build a framework of an effective tourism website providing adequate level of information, service and also to enable the users to reach to the desired page by spending minimal loading time. In this paper an information hierarchy specifying the upper limit of outgoing link of a page has also been proposed. Following the hierarchy, the web developer can prepare an effective tourism website. Here loading time depends on page size and network traffic. We have assumed network traffic as uniform and the loading time is directly proportional with page size. This approach is done by quantifying the link structure of a tourism website. In this approach we also propose a page size distribution pattern of a tourism website.

  14. A Note on Hamiltonian Graphs

    ERIC Educational Resources Information Center

    Skurnick, Ronald; Davi, Charles; Skurnick, Mia

    2005-01-01

    Since 1952, several well-known graph theorists have proven numerous results regarding Hamiltonian graphs. In fact, many elementary graph theory textbooks contain the theorems of Ore, Bondy and Chvatal, Chvatal and Erdos, Posa, and Dirac, to name a few. In this note, the authors state and prove some propositions of their own concerning Hamiltonian…

  15. Algebraic Semantics for Narrative

    ERIC Educational Resources Information Center

    Kahn, E.

    1974-01-01

    This paper uses discussion of Edmund Spenser's "The Faerie Queene" to present a theoretical framework for explaining the semantics of narrative discourse. The algebraic theory of finite automata is used. (CK)

  16. Altered Brain Network in Amyotrophic Lateral Sclerosis: A Resting Graph Theory-Based Network Study at Voxel-Wise Level.

    PubMed

    Zhou, Chaoyang; Hu, Xiaofei; Hu, Jun; Liang, Minglong; Yin, Xuntao; Chen, Lin; Zhang, Jiuquan; Wang, Jian

    2016-01-01

    Amyotrophic lateral sclerosis (ALS) is a rare degenerative disorder characterized by loss of upper and lower motor neurons. Neuroimaging has provided noticeable evidence that ALS is a complex disease, and shown that anatomical and functional lesions extend beyond precentral cortices and corticospinal tracts, to include the corpus callosum; frontal, sensory, and premotor cortices; thalamus; and midbrain. The aim of this study is to investigate graph theory-based functional network abnormalities at voxel-wise level in ALS patients on a whole brain scale. Forty-three ALS patients and 44 age- and sex-matched healthy volunteers were enrolled. The voxel-wise network degree centrality (DC), a commonly employed graph-based measure of network organization, was used to characterize the alteration of whole brain functional network. Compared with the controls, the ALS patients showed significant increase of DC in the left cerebellum posterior lobes, bilateral cerebellum crus, bilateral occipital poles, right orbital frontal lobe, and bilateral prefrontal lobes; significant decrease of DC in the bilateral primary motor cortex, bilateral sensory motor region, right prefrontal lobe, left bilateral precuneus, bilateral lateral temporal lobes, left cingulate cortex, and bilateral visual processing cortex. The DC's z-scores of right inferior occipital gyrus were significant negative correlated with the ALSFRS-r scores. Our findings confirm that the regions with abnormal network DC in ALS patients were located in multiple brain regions including primary motor, somatosensory and extra-motor areas, supporting the concept that ALS is a multisystem disorder. Specifically, our study found that DC in the visual areas was altered and ALS patients with higher DC in right inferior occipital gyrus have more severity of disease. The result demonstrated that the altered DC value in this region can probably be used to assess severity of ALS. PMID:27242409

  17. Altered Brain Network in Amyotrophic Lateral Sclerosis: A Resting Graph Theory-Based Network Study at Voxel-Wise Level

    PubMed Central

    Zhou, Chaoyang; Hu, Xiaofei; Hu, Jun; Liang, Minglong; Yin, Xuntao; Chen, Lin; Zhang, Jiuquan; Wang, Jian

    2016-01-01

    Amyotrophic lateral sclerosis (ALS) is a rare degenerative disorder characterized by loss of upper and lower motor neurons. Neuroimaging has provided noticeable evidence that ALS is a complex disease, and shown that anatomical and functional lesions extend beyond precentral cortices and corticospinal tracts, to include the corpus callosum; frontal, sensory, and premotor cortices; thalamus; and midbrain. The aim of this study is to investigate graph theory-based functional network abnormalities at voxel-wise level in ALS patients on a whole brain scale. Forty-three ALS patients and 44 age- and sex-matched healthy volunteers were enrolled. The voxel-wise network degree centrality (DC), a commonly employed graph-based measure of network organization, was used to characterize the alteration of whole brain functional network. Compared with the controls, the ALS patients showed significant increase of DC in the left cerebellum posterior lobes, bilateral cerebellum crus, bilateral occipital poles, right orbital frontal lobe, and bilateral prefrontal lobes; significant decrease of DC in the bilateral primary motor cortex, bilateral sensory motor region, right prefrontal lobe, left bilateral precuneus, bilateral lateral temporal lobes, left cingulate cortex, and bilateral visual processing cortex. The DC's z-scores of right inferior occipital gyrus were significant negative correlated with the ALSFRS-r scores. Our findings confirm that the regions with abnormal network DC in ALS patients were located in multiple brain regions including primary motor, somatosensory and extra-motor areas, supporting the concept that ALS is a multisystem disorder. Specifically, our study found that DC in the visual areas was altered and ALS patients with higher DC in right inferior occipital gyrus have more severity of disease. The result demonstrated that the altered DC value in this region can probably be used to assess severity of ALS. PMID:27242409

  18. Graph Theory Analysis of Functional Brain Networks and Mobility Disability in Older Adults

    PubMed Central

    Burdette, Jonathan H.; Morgan, Ashley R.; Williamson, Jeff D.; Kritchevsky, Stephen B.; Laurienti, Paul J.

    2014-01-01

    Background. The brain’s structural integrity is associated with mobility function in older adults. Changes in function may be evident earlier than changes in structure and may be more directly related to mobility. Therefore, we assessed whether functional brain networks varied with mobility function in older adults. Methods. Short Physical Performance Battery (SPPB) and resting state functional magnetic resonance imaging were collected on 24 young (mean age = 26.4±5.1) and 48 older (mean age = 72.04±5.1) participants. Older participants were divided into three groups by SPPB score: Low SPPB (score = 7–9), Mid SPPB (score = 10), High SPPB (score = 11–12).Graph theory–based methods were used to characterize and compare brain network organization. Results. Connectivity in the somatomotor cortex distinguished between groups based on SPPB score. The community structure of the somatomotor cortex was significantly less consistent in the Low SPPB group (mean = 0.097±0.05) compared with Young (mean = 0.163±0.09, p = .03) SPPB group. Striking differences were evident in second-order connections between somatomotor cortex and superior temporal gyrus and insula that reached statistical significance. The Low SPPB group (mean = 140.87±109.30) had a significantly higher number of connections than Young (mean = 45.05±33.79, p = .0003) or High (mean = 49.61±35.31, p = .002) SPPB group. Conclusions. Older adults with poorer mobility function exhibited reduced consistency of somatomotor community structure and a greater number of secondary connections with vestibular and multisensory regions of the brain. Further study is needed to fully interpret these effects, but analysis of functional brain networks adds new insights to the contribution of the brain to mobility. PMID:24717331

  19. Higher-order graph wavelets and sparsity on circulant graphs

    NASA Astrophysics Data System (ADS)

    Kotzagiannidis, Madeleine S.; Dragotti, Pier Luigi

    2015-08-01

    The notion of a graph wavelet gives rise to more advanced processing of data on graphs due to its ability to operate in a localized manner, across newly arising data-dependency structures, with respect to the graph signal and underlying graph structure, thereby taking into consideration the inherent geometry of the data. In this work, we tackle the problem of creating graph wavelet filterbanks on circulant graphs for a sparse representation of certain classes of graph signals. The underlying graph can hereby be data-driven as well as fixed, for applications including image processing and social network theory, whereby clusters can be modelled as circulant graphs, respectively. We present a set of novel graph wavelet filter-bank constructions, which annihilate higher-order polynomial graph signals (up to a border effect) defined on the vertices of undirected, circulant graphs, and are localised in the vertex domain. We give preliminary results on their performance for non-linear graph signal approximation and denoising. Furthermore, we provide extensions to our previously developed segmentation-inspired graph wavelet framework for non-linear image approximation, by incorporating notions of smoothness and vanishing moments, which further improve performance compared to traditional methods.

  20. Generator algebra of the asymptotic Poincare group in the general theory of relativity

    SciTech Connect

    Solovev, V.O.

    1986-06-01

    This paper obtains the Poisson brackets of the generators of the Hamiltonian formalism for general relativity with allowance for surface terms of aritrary form. For Minkowski space, there exists the asymptotic Poincare group, which is the semi-direct product of the Poincare group and an infinite subgroup for which the algebra of generators with surface terms closes. A criterion invariant with respect to the choice of the coordinate system on the hypersurfaces is obtained for realization of the Poincare group in asymptotically flat space-time. The ''background'' flat metric on the hypersurfaces and Poincare group that preserve it are determined nonuniquely; however, the numerical values of the generators do not depend on the freedom of this choice on solutions of the constraint equations. For an asymptotically Galilean metric, the widely used boundary cnoditins are determined more accurately. A prescription is given for application of the Arnowitt-Deser-Misner decomposition in the case of a slowly decreasing contribution from coordinate and time transformations.

  1. Semi-Markov Graph Dynamics

    PubMed Central

    Raberto, Marco; Rapallo, Fabio; Scalas, Enrico

    2011-01-01

    In this paper, we outline a model of graph (or network) dynamics based on two ingredients. The first ingredient is a Markov chain on the space of possible graphs. The second ingredient is a semi-Markov counting process of renewal type. The model consists in subordinating the Markov chain to the semi-Markov counting process. In simple words, this means that the chain transitions occur at random time instants called epochs. The model is quite rich and its possible connections with algebraic geometry are briefly discussed. Moreover, for the sake of simplicity, we focus on the space of undirected graphs with a fixed number of nodes. However, in an example, we present an interbank market model where it is meaningful to use directed graphs or even weighted graphs. PMID:21887245

  2. I Teach Economics, Not Algebra and Calculus

    ERIC Educational Resources Information Center

    Hey, John D.

    2005-01-01

    Most people learn to drive without knowing how the engine works. In a similar vein, the author believes that students can learn economics without knowing the algebra and calculus underlying the results. If instructors follow the philosophy of other economics courses in using graphs to illustrate the results, and draw the graphs accurately, then…

  3. Evolutionary stability on graphs

    PubMed Central

    Ohtsuki, Hisashi; Nowak, Martin A.

    2008-01-01

    Evolutionary stability is a fundamental concept in evolutionary game theory. A strategy is called an evolutionarily stable strategy (ESS), if its monomorphic population rejects the invasion of any other mutant strategy. Recent studies have revealed that population structure can considerably affect evolutionary dynamics. Here we derive the conditions of evolutionary stability for games on graphs. We obtain analytical conditions for regular graphs of degree k > 2. Those theoretical predictions are compared with computer simulations for random regular graphs and for lattices. We study three different update rules: birth-death (BD), death-birth (DB), and imitation (IM) updating. Evolutionary stability on sparse graphs does not imply evolutionary stability in a well-mixed population, nor vice versa. We provide a geometrical interpretation of the ESS condition on graphs. PMID:18295801

  4. Acoustic emission source location and damage detection in a metallic structure using a graph-theory-based geodesic approach

    NASA Astrophysics Data System (ADS)

    Gangadharan, R.; Prasanna, G.; Bhat, M. R.; Murthy, C. R. L.; Gopalakrishnan, S.

    2009-11-01

    A geodesic-based approach using Lamb waves is proposed to locate the acoustic emission (AE) source and damage in an isotropic metallic structure. In the case of the AE (passive) technique, the elastic waves take the shortest path from the source to the sensor array distributed in the structure. The geodesics are computed on the meshed surface of the structure using graph theory based on Dijkstra's algorithm. By propagating the waves in reverse virtually from these sensors along the geodesic path and by locating the first intersection point of these waves, one can get the AE source location. The same approach is extended for detection of damage in a structure. The wave response matrix of the given sensor configuration for the healthy and the damaged structure is obtained experimentally. The healthy and damage response matrix is compared and their difference gives the information about the reflection of waves from the damage. These waves are backpropagated from the sensors and the above method is used to locate the damage by finding the point where intersection of geodesics occurs. In this work, the geodesic approach is shown to be suitable to obtain a practicable source location solution in a more general set-up on any arbitrary surface containing finite discontinuities. Experiments were conducted on aluminum specimens of simple and complex geometry to validate this new method.

  5. On computational complexity of Clifford algebra

    NASA Astrophysics Data System (ADS)

    Budinich, Marco

    2009-05-01

    After a brief discussion of the computational complexity of Clifford algebras, we present a new basis for even Clifford algebra Cl(2m) that simplifies greatly the actual calculations and, without resorting to the conventional matrix isomorphism formulation, obtains the same complexity. In the last part we apply these results to the Clifford algebra formulation of the NP-complete problem of the maximum clique of a graph introduced by Budinich and Budinich ["A spinorial formulation of the maximum clique problem of a graph," J. Math. Phys. 47, 043502 (2006)].

  6. Algebraic Activities Aid Discovery Lessons

    ERIC Educational Resources Information Center

    Wallace-Gomez, Patricia

    2013-01-01

    After a unit on the rules for positive and negative numbers and the order of operations for evaluating algebraic expressions, many students believe that they understand these principles well enough, but they really do not. They clearly need more practice, but not more of the same kind of drill. Wallace-Gomez provides three graphing activities that…

  7. Spectral fluctuations of quantum graphs

    SciTech Connect

    Pluhař, Z.; Weidenmüller, H. A.

    2014-10-15

    We prove the Bohigas-Giannoni-Schmit conjecture in its most general form for completely connected simple graphs with incommensurate bond lengths. We show that for graphs that are classically mixing (i.e., graphs for which the spectrum of the classical Perron-Frobenius operator possesses a finite gap), the generating functions for all (P,Q) correlation functions for both closed and open graphs coincide (in the limit of infinite graph size) with the corresponding expressions of random-matrix theory, both for orthogonal and for unitary symmetry.

  8. Higher-order M-theory corrections and the Kac Moody algebra E10

    NASA Astrophysics Data System (ADS)

    Damour, Thibault; Nicolai, Hermann

    2005-07-01

    It has been conjectured that the classical dynamics of M-theory is equivalent to a null geodesic motion in the infinite-dimensional coset space E10/K(E10), where K(E10) is the maximal compact subgroup of the hyperbolic Kac Moody group E10. We here provide further evidence for this conjecture by showing that the leading higher-order corrections, quartic in the curvature and related 3-form-dependent terms, correspond to negative imaginary roots of E10. The conjecture entails certain predictions for which higher-order corrections are allowed: in particular corrections of type RM(DF)N are compatible with E10 only for M + N = 3k + 1. Furthermore, the leading parts of the R4, R7, ... terms are predicted to be associated with singlets under the {\\mathfrak{sl}}_{10} decomposition of E10. Although singlets are extremely rare among the 4400 752 653 representations of {\\mathfrak{sl}}_{10} appearing in E10 up to level ell <= 28, there are indeed singlets at levels ell = 10 and ell = 20 which do match with the R4 and the expected R7 corrections. Our analysis indicates a far more complicated behaviour of the theory near the cosmological singularity than suggested by the standard homogeneous ansätze.

  9. Network science and the human brain: Using graph theory to understand the brain and one of its hubs, the amygdala, in health and disease.

    PubMed

    Mears, David; Pollard, Harvey B

    2016-06-01

    Over the past 15 years, the emerging field of network science has revealed the key features of brain networks, which include small-world topology, the presence of highly connected hubs, and hierarchical modularity. The value of network studies of the brain is underscored by the range of network alterations that have been identified in neurological and psychiatric disorders, including epilepsy, depression, Alzheimer's disease, schizophrenia, and many others. Here we briefly summarize the concepts of graph theory that are used to quantify network properties and describe common experimental approaches for analysis of brain networks of structural and functional connectivity. These range from tract tracing to functional magnetic resonance imaging, diffusion tensor imaging, electroencephalography, and magnetoencephalography. We then summarize the major findings from the application of graph theory to nervous systems ranging from Caenorhabditis elegans to more complex primate brains, including man. Focusing, then, on studies involving the amygdala, a brain region that has attracted intense interest as a center for emotional processing, fear, and motivation, we discuss the features of the amygdala in brain networks for fear conditioning and emotional perception. Finally, to highlight the utility of graph theory for studying dysfunction of the amygdala in mental illness, we review data with regard to changes in the hub properties of the amygdala in brain networks of patients with depression. We suggest that network studies of the human brain may serve to focus attention on regions and connections that act as principal drivers and controllers of brain function in health and disease. PMID:26771046

  10. Some functional metrics in algebraic and combinatorial coding

    NASA Astrophysics Data System (ADS)

    Choen, G.

    1980-06-01

    Three approaches to coding problems can be systematically distinguished: probabilistic (essentially existential), algebraic, and combinatorial. This last approach searches for optimal configurations and relegates to the second order, the problems of complexity related to decoding. Enumeration, graphs, designs, and the extreme theory of groups are used. The optimization of a functional metric was used with the combinatorial approach in order to define the space considered and the distance. The codes then become particular groups of the metric space, which is defined by parameters such as length, number of words, and capacity for correction. Some of these parameters are imposed.

  11. Theory of the Decoherence Effect in Finite and Infinite Open Quantum Systems Using the Algebraic Approach

    NASA Astrophysics Data System (ADS)

    Blanchard, Philippe; Hellmich, Mario; Ługiewicz, Piotr; Olkiewicz, Robert

    Quantum mechanics is the greatest revision of our conception of the character of the physical world since Newton. Consequently, David Hilbert was very interested in quantum mechanics. He and John von Neumann discussed it frequently during von Neumann's residence in Göttingen. He published in 1932 his book Mathematical Foundations of Quantum Mechanics. In Hilbert's opinion it was the first exposition of quantum mechanics in a mathematically rigorous way. The pioneers of quantum mechanics, Heisenberg and Dirac, neither had use for rigorous mathematics nor much interest in it. Conceptually, quantum theory as developed by Bohr and Heisenberg is based on the positivism of Mach as it describes only observable quantities. It first emerged as a result of experimental data in the form of statistical observations of quantum noise, the basic concept of quantum probability.

  12. Informatic system for a global tissue-fluid biorepository with a graph theory-oriented graphical user interface.

    PubMed

    Butler, William E; Atai, Nadia; Carter, Bob; Hochberg, Fred

    2014-01-01

    The Richard Floor Biorepository supports collaborative studies of extracellular vesicles (EVs) found in human fluids and tissue specimens. The current emphasis is on biomarkers for central nervous system neoplasms but its structure may serve as a template for collaborative EV translational studies in other fields. The informatic system provides specimen inventory tracking with bar codes assigned to specimens and containers and projects, is hosted on globalized cloud computing resources, and embeds a suite of shared documents, calendars, and video-conferencing features. Clinical data are recorded in relation to molecular EV attributes and may be tagged with terms drawn from a network of externally maintained ontologies thus offering expansion of the system as the field matures. We fashioned the graphical user interface (GUI) around a web-based data visualization package. This system is now in an early stage of deployment, mainly focused on specimen tracking and clinical, laboratory, and imaging data capture in support of studies to optimize detection and analysis of brain tumour-specific mutations. It currently includes 4,392 specimens drawn from 611 subjects, the majority with brain tumours. As EV science evolves, we plan biorepository changes which may reflect multi-institutional collaborations, proteomic interfaces, additional biofluids, changes in operating procedures and kits for specimen handling, novel procedures for detection of tumour-specific EVs, and for RNA extraction and changes in the taxonomy of EVs. We have used an ontology-driven data model and web-based architecture with a graph theory-driven GUI to accommodate and stimulate the semantic web of EV science. PMID:25317275

  13. Relationship between molecular connectivity and carcinogenic activity: a confirmation with a new software program based on graph theory.

    PubMed Central

    Malacarne, D; Pesenti, R; Paolucci, M; Parodi, S

    1993-01-01

    For a database of 826 chemicals tested for carcinogenicity, we fragmented the structural formula of the chemicals into all possible contiguous-atom fragments with size between two and eight (nonhydrogen) atoms. The fragmentation was obtained using a new software program based on graph theory. We used 80% of the chemicals as a training set and 20% as a test set. The two sets were obtained by random sorting. From the training sets, an average (8 computer runs with independently sorted chemicals) of 315 different fragments were significantly (p < 0.125) associated with carcinogenicity or lack thereof. Even using this relatively low level of statistical significance, 23% of the molecules of the test sets lacked significant fragments. For 77% of the molecules of the test sets, we used the presence of significant fragments to predict carcinogenicity. The average level of accuracy of the predictions in the test sets was 67.5%. Chemicals containing only positive fragments were predicted with an accuracy of 78.7%. The level of accuracy was around 60% for chemicals characterized by contradictory fragments or only negative fragments. In a parallel manner, we performed eight paired runs in which carcinogenicity was attributed randomly to the molecules of the training sets. The fragments generated by these pseudo-training sets were devoid of any predictivity in the corresponding test sets. Using an independent software program, we confirmed (for the complex biological endpoint of carcinogenicity) the validity of a structure-activity relationship approach of the type proposed by Klopman and Rosenkranz with their CASE program. Images Figure 1. Figure 2. Figure 3. Figure 4. Figure 5. Figure 6. PMID:8275991

  14. An impatient evolutionary algorithm with probabilistic tabu search for unified solution of some NP-hard problems in graph and set theory via clique finding.

    PubMed

    Guturu, Parthasarathy; Dantu, Ram

    2008-06-01

    Many graph- and set-theoretic problems, because of their tremendous application potential and theoretical appeal, have been well investigated by the researchers in complexity theory and were found to be NP-hard. Since the combinatorial complexity of these problems does not permit exhaustive searches for optimal solutions, only near-optimal solutions can be explored using either various problem-specific heuristic strategies or metaheuristic global-optimization methods, such as simulated annealing, genetic algorithms, etc. In this paper, we propose a unified evolutionary algorithm (EA) to the problems of maximum clique finding, maximum independent set, minimum vertex cover, subgraph and double subgraph isomorphism, set packing, set partitioning, and set cover. In the proposed approach, we first map these problems onto the maximum clique-finding problem (MCP), which is later solved using an evolutionary strategy. The proposed impatient EA with probabilistic tabu search (IEA-PTS) for the MCP integrates the best features of earlier successful approaches with a number of new heuristics that we developed to yield a performance that advances the state of the art in EAs for the exploration of the maximum cliques in a graph. Results of experimentation with the 37 DIMACS benchmark graphs and comparative analyses with six state-of-the-art algorithms, including two from the smaller EA community and four from the larger metaheuristics community, indicate that the IEA-PTS outperforms the EAs with respect to a Pareto-lexicographic ranking criterion and offers competitive performance on some graph instances when individually compared to the other heuristic algorithms. It has also successfully set a new benchmark on one graph instance. On another benchmark suite called Benchmarks with Hidden Optimal Solutions, IEA-PTS ranks second, after a very recent algorithm called COVER, among its peers that have experimented with this suite. PMID:18558530

  15. Lorentz-diffeomorphism quasi-local conserved charges and Virasoro algebra in Chern-Simons-like theories of gravity

    NASA Astrophysics Data System (ADS)

    Setare, M. R.; Adami, H.

    2016-08-01

    The Chern-Simons-like theories of gravity (CSLTG) are formulated at first order formalism. In this formalism, the derivation of the entropy of a black hole on bifurcation surface, as a quasi-local conserved charge is problematic. In this paper we overcome these problems by considering the concept of total variation and the Lorentz-Lie derivative. We firstly find an expression for the ADT conserved current in the context of the CSLTG which is based on the concept of the Killing vector fields. Then, we generalize it to be conserved for all diffeomorphism generators. Thus, we can extract an off-shell conserved charge for any vector field which generates a diffeomorphism. The formalism presented here is based on the concept of quasi-local conserved charges which are off-shell. The charges can be calculated on any codimension two space-like surface surrounding a black hole and the results are independent of the chosen surface. By using the off-shell quasi-local conserved charge, we investigate the Virasoro algebra and find a formula to calculate the central extension term. We apply the formalism to the BTZ black hole solution in the context of the Einstein gravity and the Generalized massive gravity, then we find the eigenvalues of their Virasoro generators as well as the corresponding central charges. Eventually, we calculate the entropy of the BTZ black hole by the Cardy formula and we show that the result exactly matches the one obtained by the concept of the off-shell conserved charges.

  16. GNSS algebraic structures

    NASA Astrophysics Data System (ADS)

    Lannes, A.; Teunissen, P. J. G.

    2011-05-01

    The first objective of this paper is to show that some basic concepts used in global navigation satellite systems (GNSS) are similar to those introduced in Fourier synthesis for handling some phase calibration problems. In experimental astronomy, the latter are at the heart of what is called `phase closure imaging.' In both cases, the analysis of the related structures appeals to the algebraic graph theory and the algebraic number theory. For example, the estimable functions of carrier-phase ambiguities, which were introduced in GNSS to correct some rank defects of the undifferenced equations, prove to be `closure-phase ambiguities:' the so-called `closure-delay' (CD) ambiguities. The notion of closure delay thus generalizes that of double difference (DD). The other estimable functional variables involved in the phase and code undifferenced equations are the receiver and satellite pseudo-clock biases. A related application, which corresponds to the second objective of this paper, concerns the definition of the clock information to be broadcasted to the network users for their precise point positioning (PPP). It is shown that this positioning can be achieved by simply having access to the satellite pseudo-clock biases. For simplicity, the study is restricted to relatively small networks. Concerning the phase for example, these biases then include five components: a frequency-dependent satellite-clock error, a tropospheric satellite delay, an ionospheric satellite delay, an initial satellite phase, and an integer satellite ambiguity. The form of the PPP equations to be solved by the network user is then similar to that of the traditional PPP equations. As soon as the CD ambiguities are fixed and validated, an operation which can be performed in real time via appropriate decorrelation techniques, estimates of these float biases can be immediately obtained. No other ambiguity is to be fixed. The satellite pseudo-clock biases can thus be obtained in real time. This is

  17. Quantum entanglement in states generated by bilocal group algebras

    SciTech Connect

    Hamma, Alioscia; Ionicioiu, Radu; Zanardi, Paolo

    2005-07-15

    Given a finite group G with a bilocal representation, we investigate the bipartite entanglement in the state constructed from the group algebra of G acting on a separable reference state. We find an upper bound for the von Neumann entropy for a bipartition (A,B) of a quantum system and conditions to saturate it. We show that these states can be interpreted as ground states of generic Hamiltonians or as the physical states in a quantum gauge theory and that under specific conditions their geometric entropy satisfies the entropic area law. If G is a group of spin flips acting on a set of qubits, these states are locally equivalent to 2-colorable (i.e., bipartite) graph states and they include Greenberger-Horne-Zeilinger, cluster states, etc. Examples include an application to qudits and a calculation of the n-tangle for 2-colorable graph states.

  18. Algebraic analysis of social networks for bio-surveillance: the cases of SARS-Beijing-2003 and AH1N1 influenza-México-2009.

    PubMed

    Hincapié, Doracelly; Ospina, Juan

    2011-01-01

    Algebraic analysis of social networks exhibited by SARS-Beijing-2003 and AH1N1 flu-México-2009 was realized. The main tools were the Tutte polynomials and Maple package Graph-Theory. The topological structures like graphs and networks were represented by invariant polynomials. The evolution of a given social network was represented like an evolution of the algebraic complexity of the corresponding Tutte polynomial. The reduction of a given social network was described like an involution of the algebraic complexity of the associated Tutte polynomial. The outbreaks of SARS and AH1N1 Flu were considered like represented by a reduction of previously existing contact networks via the control measures executed by health authorities. From Tutte polynomials were derived numerical indicators about efficiency of control measures. PMID:21431617

  19. Array algebra estimation in signal processing

    NASA Astrophysics Data System (ADS)

    Rauhala, U. A.

    A general theory of linear estimators called array algebra estimation is interpreted in some terms of multidimensional digital signal processing, mathematical statistics, and numerical analysis. The theory has emerged during the past decade from the new field of a unified vector, matrix and tensor algebra called array algebra. The broad concepts of array algebra and its estimation theory cover several modern computerized sciences and technologies converting their established notations and terminology into one common language. Some concepts of digital signal processing are adopted into this language after a review of the principles of array algebra estimation and its predecessors in mathematical surveying sciences.

  20. Graphing Predictions

    ERIC Educational Resources Information Center

    Connery, Keely Flynn

    2007-01-01

    Graphing predictions is especially important in classes where relationships between variables need to be explored and derived. In this article, the author describes how his students sketch the graphs of their predictions before they begin their investigations on two laboratory activities: Distance Versus Time Cart Race Lab and Resistance; and…

  1. [Feature extraction for breast cancer data based on geometric algebra theory and feature selection using differential evolution].

    PubMed

    Li, Jing; Hong, Wenxue

    2014-12-01

    The feature extraction and feature selection are the important issues in pattern recognition. Based on the geometric algebra representation of vector, a new feature extraction method using blade coefficient of geometric algebra was proposed in this study. At the same time, an improved differential evolution (DE) feature selection method was proposed to solve the elevated high dimension issue. The simple linear discriminant analysis was used as the classifier. The result of the 10-fold cross-validation (10 CV) classification of public breast cancer biomedical dataset was more than 96% and proved superior to that of the original features and traditional feature extraction method. PMID:25868233

  2. Accelerating sparse linear algebra using graphics processing units

    NASA Astrophysics Data System (ADS)

    Spagnoli, Kyle E.; Humphrey, John R.; Price, Daniel K.; Kelmelis, Eric J.

    2011-06-01

    The modern graphics processing unit (GPU) found in many standard personal computers is a highly parallel math processor capable of over 1 TFLOPS of peak computational throughput at a cost similar to a high-end CPU with excellent FLOPS-to-watt ratio. High-level sparse linear algebra operations are computationally intense, often requiring large amounts of parallel operations and would seem a natural fit for the processing power of the GPU. Our work is on a GPU accelerated implementation of sparse linear algebra routines. We present results from both direct and iterative sparse system solvers. The GPU execution model featured by NVIDIA GPUs based on CUDA demands very strong parallelism, requiring between hundreds and thousands of simultaneous operations to achieve high performance. Some constructs from linear algebra map extremely well to the GPU and others map poorly. CPUs, on the other hand, do well at smaller order parallelism and perform acceptably during low-parallelism code segments. Our work addresses this via hybrid a processing model, in which the CPU and GPU work simultaneously to produce results. In many cases, this is accomplished by allowing each platform to do the work it performs most naturally. For example, the CPU is responsible for graph theory portion of the direct solvers while the GPU simultaneously performs the low level linear algebra routines.

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

  4. Discriminating micropathogen lineages and their reticulate evolution through graph theory-based network analysis: the case of Trypanosoma cruzi, the agent of Chagas disease.

    PubMed

    Arnaud-Haond, Sophie; Moalic, Yann; Barnabé, Christian; Ayala, Francisco José; Tibayrenc, Michel

    2014-01-01

    Micropathogens (viruses, bacteria, fungi, parasitic protozoa) share a common trait, which is partial clonality, with wide variance in the respective influence of clonality and sexual recombination on the dynamics and evolution of taxa. The discrimination of distinct lineages and the reconstruction of their phylogenetic history are key information to infer their biomedical properties. However, the phylogenetic picture is often clouded by occasional events of recombination across divergent lineages, limiting the relevance of classical phylogenetic analysis and dichotomic trees. We have applied a network analysis based on graph theory to illustrate the relationships among genotypes of Trypanosoma cruzi, the parasitic protozoan responsible for Chagas disease, to identify major lineages and to unravel their past history of divergence and possible recombination events. At the scale of T. cruzi subspecific diversity, graph theory-based networks applied to 22 isoenzyme loci (262 distinct Multi-Locus-Enzyme-Electrophoresis -MLEE) and 19 microsatellite loci (66 Multi-Locus-Genotypes -MLG) fully confirms the high clustering of genotypes into major lineages or "near-clades". The release of the dichotomic constraint associated with phylogenetic reconstruction usually applied to Multilocus data allows identifying putative hybrids and their parental lineages. Reticulate topology suggests a slightly different history for some of the main "near-clades", and a possibly more complex origin for the putative hybrids than hitherto proposed. Finally the sub-network of the near-clade T. cruzi I (28 MLG) shows a clustering subdivision into three differentiated lesser near-clades ("Russian doll pattern"), which confirms the hypothesis recently proposed by other investigators. The present study broadens and clarifies the hypotheses previously obtained from classical markers on the same sets of data, which demonstrates the added value of this approach. This underlines the potential of graph

  5. Quantum Ergodicity on Graphs

    NASA Astrophysics Data System (ADS)

    Gnutzmann, S.; Keating, J. P.; Piotet, F.

    2008-12-01

    We investigate the equidistribution of the eigenfunctions on quantum graphs in the high-energy limit. Our main result is an estimate of the deviations from equidistribution for large well-connected graphs. We use an exact field-theoretic expression in terms of a variant of the supersymmetric nonlinear σ model. Our estimate is based on a saddle-point analysis of this expression and leads to a criterion for when equidistribution emerges asymptotically in the limit of large graphs. Our theory predicts a rate of convergence that is a significant refinement of previous estimates, long assumed to be valid for quantum chaotic systems, agreeing with them in some situations but not all. We discuss specific examples for which the theory is tested numerically.

  6. Graph theory for analyzing pair-wise data: application to geophysical model parameters estimated from interferometric synthetic aperture radar data at Okmok volcano, Alaska

    NASA Astrophysics Data System (ADS)

    Reinisch, Elena C.; Cardiff, Michael; Feigl, Kurt L.

    2016-07-01

    Graph theory is useful for analyzing time-dependent model parameters estimated from interferometric synthetic aperture radar (InSAR) data in the temporal domain. Plotting acquisition dates (epochs) as vertices and pair-wise interferometric combinations as edges defines an incidence graph. The edge-vertex incidence matrix and the normalized edge Laplacian matrix are factors in the covariance matrix for the pair-wise data. Using empirical measures of residual scatter in the pair-wise observations, we estimate the relative variance at each epoch by inverting the covariance of the pair-wise data. We evaluate the rank deficiency of the corresponding least-squares problem via the edge-vertex incidence matrix. We implement our method in a MATLAB software package called GraphTreeTA available on GitHub (https://github.com/feigl/gipht). We apply temporal adjustment to the data set described in Lu et al. (Geophys Res Solid Earth 110, 2005) at Okmok volcano, Alaska, which erupted most recently in 1997 and 2008. The data set contains 44 differential volumetric changes and uncertainties estimated from interferograms between 1997 and 2004. Estimates show that approximately half of the magma volume lost during the 1997 eruption was recovered by the summer of 2003. Between June 2002 and September 2003, the estimated rate of volumetric increase is (6.2 ± 0.6) × 10^6~m^3/year . Our preferred model provides a reasonable fit that is compatible with viscoelastic relaxation in the five years following the 1997 eruption. Although we demonstrate the approach using volumetric rates of change, our formulation in terms of incidence graphs applies to any quantity derived from pair-wise differences, such as range change, range gradient, or atmospheric delay.

  7. Earth Algebra.

    ERIC Educational Resources Information Center

    Schaufele, Christopher; Zumoff, Nancy

    Earth Algebra is an entry level college algebra course that incorporates the spirit of the National Council of Teachers of Mathematics (NCTM) Curriculum and Evaluation Standards for School Mathematics at the college level. The context of the course places mathematics at the center of one of the major current concerns of the world. Through…

  8. Kiddie Algebra

    ERIC Educational Resources Information Center

    Cavanagh, Sean

    2009-01-01

    As educators and policymakers search for ways to prepare students for the rigors of algebra, teachers in the Helena, Montana, school system are starting early by attempting to nurture students' algebraic-reasoning ability, as well as their basic number skills, in early elementary school, rather than waiting until middle or early high school.…

  9. Redesigning College Algebra: Combining Educational Theory and Web-Based Learning to Improve Student Attitudes and Performance

    ERIC Educational Resources Information Center

    Hagerty, Gary; Smith, Stanley; Goodwin, Danielle

    2010-01-01

    In 2001, Black Hills State University (BHSU) redesigned college algebra to use the computer-based mastery learning program, Assessment and Learning in Knowledge Spaces [1], historical development of concepts modules, whole class discussions, cooperative activities, relevant applications problems, and many fewer lectures. This resulted in a 21%…

  10. Relativity on Rotated Graph Paper

    NASA Astrophysics Data System (ADS)

    Salgado, Roberto

    2011-11-01

    We present visual calculations in special relativity using spacetime diagrams drawn on graph paper that has been rotated by 45 degrees. The rotated lines represent lightlike directions in Minkowski spacetime, and the boxes in the grid (called light-clock diamonds) represent ticks of an inertial observer's lightclock. We show that many quantitative results can be read off a spacetime diagram by counting boxes, using a minimal amount of algebra.

  11. New family of Maxwell like algebras

    NASA Astrophysics Data System (ADS)

    Concha, P. K.; Durka, R.; Merino, N.; Rodríguez, E. K.

    2016-08-01

    We introduce an alternative way of closing Maxwell like algebras. We show, through a suitable change of basis, that resulting algebras are given by the direct sums of the AdS and the Maxwell algebras already known in the literature. Casting the result into the S-expansion method framework ensures the straightaway construction of the gravity theories based on a found enlargement.

  12. Topology and graph theory applied to cortical anatomy may help explain working memory capacity for three or four simultaneous items.

    PubMed

    Glassman, Robert B

    2003-04-15

    Cognitive experimentation suggests that at any single instant only three or four items ("chunks") are simultaneously prominent as a working memory (WM) trace, if we disregard the rehearsal component of WM. The reason for small WM capacity may concern combinatorial manageability. How might the neural representations of these few coactive chunks occupy a spatially distributed set of areas of the sheet-like cortex, while providing both order and flexibility to associate items in WM? Each attribute of each simultaneously active WM item must have broad access to the representational facilities of the cortical sheet, comprising tens of thousands of modular "cortical columns." The two hypothesized neural levels of WM during any moment of cognition comprise (a) "binding" together of many distributed attribute representations within each respective WM chunk, and (b) combinatorial play among three or four WM chunk-representations. Anatomical and functional evidence of cortical unity through its depth suggests that cortex may be viewed as essentially planar in its distribution of activations. Thus, a moment's WM is hypothesized here to reside in myriad activated cortical planar "patches," each subdivided into up to four amoeboid "subpatches." Two different lines of topological reasoning suggest orderly associations of such representations. (1) The four-color principle of map topology, and the related K(4) is planar theorem of graph theory, imply that if a small cortical area is dynamically subdivided into no more than four, discretely bounded planar subareas, then each such segment has ample free access to each of the others. (2) A hypothetical alternative to such associative adjacency of simultaneously active cortical representations of chunk-attributes is associative overlap, whereby, in dense cortical neuropil, activated subpatches behave like Venn diagrams of intersecting sets. As the number of Venn-like coactive subpatches within a patch increases, maintaining ad hoc

  13. Graph models of habitat mosaics.

    PubMed

    Urban, Dean L; Minor, Emily S; Treml, Eric A; Schick, Robert S

    2009-03-01

    Graph theory is a body of mathematics dealing with problems of connectivity, flow, and routing in networks ranging from social groups to computer networks. Recently, network applications have erupted in many fields, and graph models are now being applied in landscape ecology and conservation biology, particularly for applications couched in metapopulation theory. In these applications, graph nodes represent habitat patches or local populations and links indicate functional connections among populations (i.e. via dispersal). Graphs are models of more complicated real systems, and so it is appropriate to review these applications from the perspective of modelling in general. Here we review recent applications of network theory to habitat patches in landscape mosaics. We consider (1) the conceptual model underlying these applications; (2) formalization and implementation of the graph model; (3) model parameterization; (4) model testing, insights, and predictions available through graph analyses; and (5) potential implications for conservation biology and related applications. In general, and for a variety of ecological systems, we find the graph model a remarkably robust framework for applications concerned with habitat connectivity. We close with suggestions for further work on the parameterization and validation of graph models, and point to some promising analytic insights. PMID:19161432

  14. Semigroups and computer algebra in algebraic structures

    NASA Astrophysics Data System (ADS)

    Bijev, G.

    2012-11-01

    Some concepts in semigroup theory can be interpreted in several algebraic structures. A generalization fA,B,fA,B(X) = A(X')B of the complement operator (') on Boolean matrices is made, where A and B denote any rectangular Boolean matrices. While (') is an isomorphism between Boolean semilattices, the generalized complement operator is homomorphism in the general case. The map fA,B and its general inverse (fA,B)+ have quite similar properties to those in the linear algebra and are useful for solving linear equations in Boolean matrix algebras. For binary relations on a finite set, necessary and sufficient conditions for the equation αξβ = γ to have a solution ξ are proved. A generalization of Green's equivalence relations in semigroups for rectangular matrices is proposed. Relationships between them and the Moore-Penrose inverses are investigated. It is shown how any generalized Green's H-class could be constructed by given its corresponding linear subspaces and converted into a group isomorphic to a linear group. Some information about using computer algebra methods concerning this paper is given.

  15. Bethe Ansatz and the Spectral Theory of Affine Lie Algebra-Valued Connections I. The simply-laced Case

    NASA Astrophysics Data System (ADS)

    Masoero, Davide; Raimondo, Andrea; Valeri, Daniele

    2016-06-01

    We study the ODE/IM correspondence for ODE associated to {widehat{mathfrak{g}}}-valued connections, for a simply-laced Lie algebra {mathfrak{g}}. We prove that subdominant solutions to the ODE defined in different fundamental representations satisfy a set of quadratic equations called {Ψ}-system. This allows us to show that the generalized spectral determinants satisfy the Bethe Ansatz equations.

  16. Realizations of conformal current-type Lie algebras

    SciTech Connect

    Pei Yufeng; Bai Chengming

    2010-05-15

    In this paper we obtain the realizations of some infinite-dimensional Lie algebras, named 'conformal current-type Lie algebras', in terms of a two-dimensional Novikov algebra and its deformations. Furthermore, Ovsienko and Roger's loop cotangent Virasoro algebra, which can be regarded as a nice generalization of the Virasoro algebra with two space variables, is naturally realized as an affinization of the tensor product of a deformation of the two-dimensional Novikov algebra and the Laurent polynomial algebra. These realizations shed new light on various aspects of the structure and representation theory of the corresponding infinite-dimensional Lie algebras.

  17. Higher level twisted Zhu algebras

    SciTech Connect

    Ekeren, Jethro van

    2011-05-15

    The study of twisted representations of graded vertex algebras is important for understanding orbifold models in conformal field theory. In this paper, we consider the general setup of a vertex algebra V, graded by {Gamma}/Z for some subgroup {Gamma} of R containing Z, and with a Hamiltonian operator H having real (but not necessarily integer) eigenvalues. We construct the directed system of twisted level p Zhu algebras Zhu{sub p,{Gamma}}(V), and we prove the following theorems: For each p, there is a bijection between the irreducible Zhu{sub p,{Gamma}}(V)-modules and the irreducible {Gamma}-twisted positive energy V-modules, and V is ({Gamma}, H)-rational if and only if all its Zhu algebras Zhu{sub p,{Gamma}}(V) are finite dimensional and semisimple. The main novelty is the removal of the assumption of integer eigenvalues for H. We provide an explicit description of the level p Zhu algebras of a universal enveloping vertex algebra, in particular of the Virasoro vertex algebra Vir{sup c} and the universal affine Kac-Moody vertex algebra V{sup k}(g) at non-critical level. We also compute the inverse limits of these directed systems of algebras.

  18. A graph-theory method for pattern identification in geographical epidemiology – a preliminary application to deprivation and mortality

    PubMed Central

    Maheswaran, Ravi; Craigs, Cheryl; Read, Simon; Bath, Peter A; Willett, Peter

    2009-01-01

    Background Graph theoretical methods are extensively used in the field of computational chemistry to search datasets of compounds to see if they contain particular molecular sub-structures or patterns. We describe a preliminary application of a graph theoretical method, developed in computational chemistry, to geographical epidemiology in relation to testing a prior hypothesis. We tested the methodology on the hypothesis that if a socioeconomically deprived neighbourhood is situated in a wider deprived area, then that neighbourhood would experience greater adverse effects on mortality compared with a similarly deprived neighbourhood which is situated in a wider area with generally less deprivation. Methods We used the Trent Region Health Authority area for this study, which contained 10,665 census enumeration districts (CED). Graphs are mathematical representations of objects and their relationships and within the context of this study, nodes represented CEDs and edges were determined by whether or not CEDs were neighbours (shared a common boundary). The overall area in this study was represented by one large graph comprising all CEDs in the region, along with their adjacency information. We used mortality data from 1988–1998, CED level population estimates and the Townsend Material Deprivation Index as an indicator of neighbourhood level deprivation. We defined deprived CEDs as those in the top 20% most deprived in the Region. We then set out to classify these deprived CEDs into seven groups defined by increasing deprivation levels in the neighbouring CEDs. 506 (24.2%) of the deprived CEDs had five adjacent CEDs and we limited pattern development and searching to these CEDs. We developed seven query patterns and used the RASCAL (Rapid Similarity Calculator) program to carry out the search for each of the query patterns. This program used a maximum common subgraph isomorphism method which was modified to handle geographical data. Results Of the 506 deprived CEDs

  19. Looking for complexity in quantitative semiology of frontal and temporal lobe seizures using neuroethology and graph theory.

    PubMed

    Bertti, Poliana; Tejada, Julian; Martins, Ana Paula Pinheiro; Dal-Cól, Maria Luiza Cleto; Terra, Vera Cristina; de Oliveira, José Antônio Cortes; Velasco, Tonicarlo Rodrigues; Sakamoto, Américo Ceiki; Garcia-Cairasco, Norberto

    2014-09-01

    Epileptic syndromes and seizures are the expression of complex brain systems. Because no analysis of complexity has been applied to epileptic seizure semiology, our goal was to apply neuroethology and graph analysis to the study of the complexity of behavioral manifestations of epileptic seizures in human frontal lobe epilepsy (FLE) and temporal lobe epilepsy (TLE). We analyzed the video recordings of 120 seizures of 18 patients with FLE and 28 seizures of 28 patients with TLE. All patients were seizure-free >1 year after surgery (Engel Class I). All patients' behavioral sequences were analyzed by means of a glossary containing all behaviors and analyzed for neuroethology (Ethomatic software). The same series were used for graph analysis (CYTOSCAPE). Behaviors, displayed as nodes, were connected by edges to other nodes according to their temporal sequence of appearance. Using neuroethology analysis, we confirmed data in the literature such as in FLE: brief/frequent seizures, complex motor behaviors, head and eye version, unilateral/bilateral tonic posturing, speech arrest, vocalization, and rapid postictal recovery and in the case of TLE: presence of epigastric aura, lateralized dystonias, impairment of consciousness/speech during ictal and postictal periods, and development of secondary generalization. Using graph analysis metrics of FLE and TLE confirmed data from flowcharts. However, because of the algorithms we used, they highlighted more powerfully the connectivity and complex associations among behaviors in a quite selective manner, depending on the origin of the seizures. The algorithms we used are commonly employed to track brain connectivity from EEG and MRI sources, which makes our study very promising for future studies of complexity in this field. PMID:25216767

  20. Constructing Graphs over with Small Prescribed Mean-Curvature

    NASA Astrophysics Data System (ADS)

    Carley, Holly; Kiessling, Michael K.-H.

    2015-12-01

    In this paper nonlinear Hodge theory and Banach algebra estimates are employed to construct a convergent series expansion which solves the prescribed mean curvature equation for n-dimensional hypersurfaces in (+ sign) and (- sign) which are graphs of a smooth function , and whose mean curvature function H is α-Hölder continuous and integrable, with small norm. The radius of convergence is estimated explicitly from below. Our approach is inspired by, and applied to, the Maxwell-Born-Infeld theory of electromagnetism in , for which our method yields the first systematic way of explicitly computing the electrostatic potential for regular charge densities and small Born parameter, with explicit error estimates at any order of truncation of the series. In particular, our results level the ground for a controlled computation of Born-Infeld effects on the Hydrogen spectrum.

  1. Graph Mining Meets the Semantic Web

    SciTech Connect

    Lee, Sangkeun; Sukumar, Sreenivas R; Lim, Seung-Hwan

    2015-01-01

    The Resource Description Framework (RDF) and SPARQL Protocol and RDF Query Language (SPARQL) were introduced about a decade ago to enable flexible schema-free data interchange on the Semantic Web. Today, data scientists use the framework as a scalable graph representation for integrating, querying, exploring and analyzing data sets hosted at different sources. With increasing adoption, the need for graph mining capabilities for the Semantic Web has emerged. We address that need through implementation of three popular iterative Graph Mining algorithms (Triangle count, Connected component analysis, and PageRank). We implement these algorithms as SPARQL queries, wrapped within Python scripts. We evaluate the performance of our implementation on 6 real world data sets and show graph mining algorithms (that have a linear-algebra formulation) can indeed be unleashed on data represented as RDF graphs using the SPARQL query interface.

  2. Linear game non-contextuality and Bell inequalities—a graph-theoretic approach

    NASA Astrophysics Data System (ADS)

    Rosicka, M.; Ramanathan, R.; Gnaciński, P.; Horodecki, K.; Horodecki, M.; Horodecki, P.; Severini, S.

    2016-04-01

    We study the classical and quantum values of a class of one- and two-party unique games, that generalizes the well-known XOR games to the case of non-binary outcomes. In the bipartite case the generalized XOR (XOR-d) games we study are a subclass of the well-known linear games. We introduce a ‘constraint graph’ associated to such a game, with the constraints defining the game represented by an edge-coloring of the graph. We use the graph-theoretic characterization to relate the task of finding equivalent games to the notion of signed graphs and switching equivalence from graph theory. We relate the problem of computing the classical value of single-party anti-correlation XOR games to finding the edge bipartization number of a graph, which is known to be MaxSNP hard, and connect the computation of the classical value of XOR-d games to the identification of specific cycles in the graph. We construct an orthogonality graph of the game from the constraint graph and study its Lovász theta number as a general upper bound on the quantum value even in the case of single-party contextual XOR-d games. XOR-d games possess appealing properties for use in device-independent applications such as randomness of the local correlated outcomes in the optimal quantum strategy. We study the possibility of obtaining quantum algebraic violation of these games, and show that no finite XOR-d game possesses the property of pseudo-telepathy leaving the frequently used chained Bell inequalities as the natural candidates for such applications. We also show this lack of pseudo-telepathy for multi-party XOR-type inequalities involving two-body correlation functions.

  3. Graphing Reality

    NASA Astrophysics Data System (ADS)

    Beeken, Paul

    2014-11-01

    Graphing is an essential skill that forms the foundation of any physical science.1 Understanding the relationships between measurements ultimately determines which modeling equations are successful in predicting observations.2 Over the years, science and math teachers have approached teaching this skill with a variety of techniques. For secondary school instruction, the job of graphing skills falls heavily on physics teachers. By virtue of the nature of the topics we cover, it is our mission to develop this skill to the fine art that it is.

  4. The Multi-State Perfect Phylogeny Problem with missing and removable data: solutions via integer-programming and chordal graph theory.

    PubMed

    Gusfield, Dan

    2010-03-01

    The Multi-State Perfect Phylogeny Problem is an extension of the Binary Perfect Phylogeny Problem, allowing characters to take on more than two states. In this article, we consider three problems that extend the utility of the multi-state perfect phylogeny model: (1) the Missing Data (MD) Problem, where some entries in the input are missing and the question is whether (bounded) values for the missing data can be imputed so that the resulting data has a multi-state perfect phylogeny; (2) the Character-Removal (CR) Problem, where we want to minimize the number of characters to remove from the data so that the resulting data has a multi-state perfect phylogeny; and (3) the Missing-Data Character-Removal (MDCR) Problem, where the input has missing data and we want to impute values for the missing data to minimize the solution to the resulting Character-Removal Problem. We discuss Integer Linear Programming (ILP) solutions to these problems for the special case of three, four, and five permitted states per character, and we report on extensive empirical testing of these solutions. Then we develop a general theory to solve the MD problem for an arbitrary number of permitted states, using chordal graph theory and results on minimal triangulation of non-chordal graphs. This establishes new necessary and sufficient conditions for the existence of a perfect phylogeny with (or without) missing data. We implement the general theory using integer linear programming, although other optimization methods are possible. We extensively explore the empirical behavior of the general solution, showing that the methods are very practical for data of size and complexity that is characteristic of many current applications in phylogenetics. Some of the empirical results for the MD problem with an arbitrary number of permitted states are very surprising, suggesting the existence of additional combinatorial structure in multi-state perfect phylogenies. Finally, we note some relationships

  5. On N = 2 compactifications of M-theory to AdS{sub 3} using geometric algebra techniques

    SciTech Connect

    Babalic, E. M.; Coman, I. A.; Condeescu, C.; Micu, A.; Lazaroiu, C. I.

    2013-11-13

    We investigate the most general warped compactification of eleven-dimensional supergravity on eight-dimensional manifolds to AdS{sub 3} spaces (in the presence of non-vanishing four-form flux) which preserves N = 2 supersymmetry in three dimensions. Without imposing any restrictions on the chirality of the internal part of the supersymmetry generators, we use geometric algebra techniques to study some implications of the supersymmetry constraints. In particular, we discuss the Lie bracket of certain vector fields constructed as pinor bilinears on the compactification manifold.

  6. A Hybrid Parallel Strategy Based on String Graph Theory to Improve De Novo DNA Assembly on the TianHe-2 Supercomputer.

    PubMed

    Zhang, Feng; Liao, Xiangke; Peng, Shaoliang; Cui, Yingbo; Wang, Bingqiang; Zhu, Xiaoqian; Liu, Jie

    2016-06-01

    ' The de novo assembly of DNA sequences is increasingly important for biological researches in the genomic era. After more than one decade since the Human Genome Project, some challenges still exist and new solutions are being explored to improve de novo assembly of genomes. String graph assembler (SGA), based on the string graph theory, is a new method/tool developed to address the challenges. In this paper, based on an in-depth analysis of SGA we prove that the SGA-based sequence de novo assembly is an NP-complete problem. According to our analysis, SGA outperforms other similar methods/tools in memory consumption, but costs much more time, of which 60-70 % is spent on the index construction. Upon this analysis, we introduce a hybrid parallel optimization algorithm and implement this algorithm in the TianHe-2's parallel framework. Simulations are performed with different datasets. For data of small size the optimized solution is 3.06 times faster than before, and for data of middle size it's 1.60 times. The results demonstrate an evident performance improvement, with the linear scalability for parallel FM-index construction. This results thus contribute significantly to improving the efficiency of de novo assembly of DNA sequences. PMID:26403255

  7. Insights into Intrinsic Brain Networks based on Graph Theory and PET in right- compared to left-sided Temporal Lobe Epilepsy

    PubMed Central

    Vanicek, Thomas; Hahn, Andreas; Traub-Weidinger, Tatjana; Hilger, Eva; Spies, Marie; Wadsak, Wolfgang; Lanzenberger, Rupert; Pataraia, Ekaterina; Asenbaum-Nan, Susanne

    2016-01-01

    The human brain exhibits marked hemispheric differences, though it is not fully understood to what extent lateralization of the epileptic focus is relevant. Preoperative [18F]FDG-PET depicts lateralization of seizure focus in patients with temporal lobe epilepsy and reveals dysfunctional metabolic brain connectivity. The aim of the present study was to compare metabolic connectivity, inferred from inter-regional [18F]FDG PET uptake correlations, in right-sided (RTLE; n = 30) and left-sided TLE (LTLE; n = 32) with healthy controls (HC; n = 31) using graph theory based network analysis. Comparing LTLE and RTLE and patient groups separately to HC, we observed higher lobar connectivity weights in RTLE compared to LTLE for connections of the temporal and the parietal lobe of the contralateral hemisphere (CH). Moreover, especially in RTLE compared to LTLE higher local efficiency were found in the temporal cortices and other brain regions of the CH. The results of this investigation implicate altered metabolic networks in patients with TLE specific to the lateralization of seizure focus, and describe compensatory mechanisms especially in the CH of patients with RTLE. We propose that graph theoretical analysis of metabolic connectivity using [18F]FDG-PET offers an important additional modality to explore brain networks. PMID:27349503

  8. Filiform Lie algebras of order 3

    SciTech Connect

    Navarro, R. M.

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

  9. Coverings of topological semi-abelian algebras

    NASA Astrophysics Data System (ADS)

    Mucuk, Osman; Demir, Serap

    2016-08-01

    In this work, we study on a category of topological semi-abelian algebras which are topological models of given an algebraic theory T whose category of models is semi-abelian; and investigate some results on the coverings of topological models of such theories yielding semi-abelian categories. We also consider the internal groupoid structure in the semi-abelian category of T-algebras, and give a criteria for the lifting of internal groupoid structure to the covering groupoids.

  10. Graph theoretic analysis of structural connectivity across the spectrum of Alzheimer's disease: The importance of graph creation methods

    PubMed Central

    Phillips, David J.; McGlaughlin, Alec; Ruth, David; Jager, Leah R.; Soldan, Anja

    2015-01-01

    Graph theory is increasingly being used to study brain connectivity across the spectrum of Alzheimer's disease (AD), but prior findings have been inconsistent, likely reflecting methodological differences. We systematically investigated how methods of graph creation (i.e., type of correlation matrix and edge weighting) affect structural network properties and group differences. We estimated the structural connectivity of brain networks based on correlation maps of cortical thickness obtained from MRI. Four groups were compared: 126 cognitively normal older adults, 103 individuals with Mild Cognitive Impairment (MCI) who retained MCI status for at least 3 years (stable MCI), 108 individuals with MCI who progressed to AD-dementia within 3 years (progressive MCI), and 105 individuals with AD-dementia. Small-world measures of connectivity (characteristic path length and clustering coefficient) differed across groups, consistent with prior studies. Groups were best discriminated by the Randić index, which measures the degree to which highly connected nodes connect to other highly connected nodes. The Randić index differentiated the stable and progressive MCI groups, suggesting that it might be useful for tracking and predicting the progression of AD. Notably, however, the magnitude and direction of group differences in all three measures were dependent on the method of graph creation, indicating that it is crucial to take into account how graphs are constructed when interpreting differences across diagnostic groups and studies. The algebraic connectivity measures showed few group differences, independent of the method of graph construction, suggesting that global connectivity as it relates to node degree is not altered in early AD. PMID:25984446

  11. Graph theoretic analysis of structural connectivity across the spectrum of Alzheimer's disease: The importance of graph creation methods.

    PubMed

    Phillips, David J; McGlaughlin, Alec; Ruth, David; Jager, Leah R; Soldan, Anja

    2015-01-01

    Graph theory is increasingly being used to study brain connectivity across the spectrum of Alzheimer's disease (AD), but prior findings have been inconsistent, likely reflecting methodological differences. We systematically investigated how methods of graph creation (i.e., type of correlation matrix and edge weighting) affect structural network properties and group differences. We estimated the structural connectivity of brain networks based on correlation maps of cortical thickness obtained from MRI. Four groups were compared: 126 cognitively normal older adults, 103 individuals with Mild Cognitive Impairment (MCI) who retained MCI status for at least 3 years (stable MCI), 108 individuals with MCI who progressed to AD-dementia within 3 years (progressive MCI), and 105 individuals with AD-dementia. Small-world measures of connectivity (characteristic path length and clustering coefficient) differed across groups, consistent with prior studies. Groups were best discriminated by the Randić index, which measures the degree to which highly connected nodes connect to other highly connected nodes. The Randić index differentiated the stable and progressive MCI groups, suggesting that it might be useful for tracking and predicting the progression of AD. Notably, however, the magnitude and direction of group differences in all three measures were dependent on the method of graph creation, indicating that it is crucial to take into account how graphs are constructed when interpreting differences across diagnostic groups and studies. The algebraic connectivity measures showed few group differences, independent of the method of graph construction, suggesting that global connectivity as it relates to node degree is not altered in early AD. PMID:25984446

  12. Graphing Reality

    ERIC Educational Resources Information Center

    Beeken, Paul

    2014-01-01

    Graphing is an essential skill that forms the foundation of any physical science. Understanding the relationships between measurements ultimately determines which modeling equations are successful in predicting observations. Over the years, science and math teachers have approached teaching this skill with a variety of techniques. For secondary…

  13. A Graph-Theoretical Approach for Tracing Filamentary Structures in Neuronal and Retinal Images.

    PubMed

    De, Jaydeep; Cheng, Li; Zhang, Xiaowei; Lin, Feng; Li, Huiqi; Ong, Kok Haur; Yu, Weimiao; Yu, Yuanhong; Ahmed, Sohail

    2016-01-01

    The aim of this study is about tracing filamentary structures in both neuronal and retinal images. It is often crucial to identify single neurons in neuronal networks, or separate vessel tree structures in retinal blood vessel networks, in applications such as drug screening for neurological disorders or computer-aided diagnosis of diabetic retinopathy. Both tasks are challenging as the same bottleneck issue of filament crossovers is commonly encountered, which essentially hinders the ability of existing systems to conduct large-scale drug screening or practical clinical usage. To address the filament crossovers' problem, a two-step graph-theoretical approach is proposed in this paper. The first step focuses on segmenting filamentary pixels out of the background. This produces a filament segmentation map used as input for the second step, where they are further separated into disjointed filaments. Key to our approach is the idea that the problem can be reformulated as label propagation over directed graphs, such that the graph is to be partitioned into disjoint sub-graphs, or equivalently, each of the neurons (vessel trees) is separated from the rest of the neuronal (vessel) network. This enables us to make the interesting connection between the tracing problem and the digraph matrix-forest theorem in algebraic graph theory for the first time. Empirical experiments on neuronal and retinal image datasets demonstrate the superior performance of our approach over existing methods. PMID:26316029

  14. Learning Activity Package, Algebra-Trigonometry.

    ERIC Educational Resources Information Center

    Holland, Bill

    A series of ten teacher-prepared Learning Activity Packages (LAPs) in advanced algebra and trigonometry, the units cover logic; absolute value, inequalities, exponents, and complex numbers; functions; higher degree equations and the derivative; the trigonometric function; graphs and applications of the trigonometric functions; sequences and…

  15. Aspects of Performance on Line Graph Description Tasks: Influenced by Graph Familiarity and Different Task Features

    ERIC Educational Resources Information Center

    Xi, Xiaoming

    2010-01-01

    Motivated by cognitive theories of graph comprehension, this study systematically manipulated characteristics of a line graph description task in a speaking test in ways to mitigate the influence of graph familiarity, a potential source of construct-irrelevant variance. It extends Xi (2005), which found that the differences in holistic scores on…

  16. A Ring Construction Using Finite Directed Graphs

    ERIC Educational Resources Information Center

    Bardzell, Michael

    2012-01-01

    In this paper we discuss an interesting class of noncommutative rings which can be constructed using finite directed graphs. This construction also creates a vector space. These structures provide undergraduate students connections between ring theory and graph theory and, among other things, allow them to see a ring unity element that looks quite…

  17. Comparative Effectiveness of TI-84 Graphing Calculators on Algebra I and Geometry Outcomes: A Report of Randomized Experiments in the East Side Union High School District and San Diego Unified School District. Research Report

    ERIC Educational Resources Information Center

    Miller, Gloria I.; Jaciw, Andrew; Hoshiko, Brandon; Wei, Xin

    2007-01-01

    Texas Instruments has undertaken a research program with the goal of producing scientifically-based evidence of the effectiveness of graphing calculators and the "TI-Navigator"[TM] classroom networking system in the context of a professional development and curriculum framework. The program includes a two-year longitudinal study. The research is…

  18. The algebras of large N matrix mechanics

    SciTech Connect

    Halpern, M.B.; Schwartz, C.

    1999-09-16

    Extending early work, we formulate the large N matrix mechanics of general bosonic, fermionic and supersymmetric matrix models, including Matrix theory: The Hamiltonian framework of large N matrix mechanics provides a natural setting in which to study the algebras of the large N limit, including (reduced) Lie algebras, (reduced) supersymmetry algebras and free algebras. We find in particular a broad array of new free algebras which we call symmetric Cuntz algebras, interacting symmetric Cuntz algebras, symmetric Bose/Fermi/Cuntz algebras and symmetric Cuntz superalgebras, and we discuss the role of these algebras in solving the large N theory. Most important, the interacting Cuntz algebras are associated to a set of new (hidden!) local quantities which are generically conserved only at large N. A number of other new large N phenomena are also observed, including the intrinsic nonlocality of the (reduced) trace class operators of the theory and a closely related large N field identification phenomenon which is associated to another set (this time nonlocal) of new conserved quantities at large N.

  19. Generalized graph states based on Hadamard matrices

    SciTech Connect

    Cui, Shawn X.; Yu, Nengkun; Zeng, Bei

    2015-07-15

    Graph states are widely used in quantum information theory, including entanglement theory, quantum error correction, and one-way quantum computing. Graph states have a nice structure related to a certain graph, which is given by either a stabilizer group or an encoding circuit, both can be directly given by the graph. To generalize graph states, whose stabilizer groups are abelian subgroups of the Pauli group, one approach taken is to study non-abelian stabilizers. In this work, we propose to generalize graph states based on the encoding circuit, which is completely determined by the graph and a Hadamard matrix. We study the entanglement structures of these generalized graph states and show that they are all maximally mixed locally. We also explore the relationship between the equivalence of Hadamard matrices and local equivalence of the corresponding generalized graph states. This leads to a natural generalization of the Pauli (X, Z) pairs, which characterizes the local symmetries of these generalized graph states. Our approach is also naturally generalized to construct graph quantum codes which are beyond stabilizer codes.

  20. Algebra Aerobics

    ERIC Educational Resources Information Center

    Barnes, Julie; Jaqua, Kathy

    2011-01-01

    A kinesthetic approach to developing ideas of function transformations can get students physically and intellectually involved. This article presents low- or no-cost activities which use kinesthetics to support high school students' mathematical understanding of transformations of function graphs. The important point of these activities is to help…

  1. Cortical brain connectivity evaluated by graph theory in dementia: a correlation study between functional and structural data.

    PubMed

    Vecchio, Fabrizio; Miraglia, Francesca; Curcio, Giuseppe; Altavilla, Riccardo; Scrascia, Federica; Giambattistelli, Federica; Quattrocchi, Carlo Cosimo; Bramanti, Placido; Vernieri, Fabrizio; Rossini, Paolo Maria

    2015-01-01

    A relatively new approach to brain function in neuroscience is the "functional connectivity", namely the synchrony in time of activity in anatomically-distinct but functionally-collaborating brain regions. On the other hand, diffusion tensor imaging (DTI) is a recently developed magnetic resonance imaging (MRI)-based technique with the capability to detect brain structural connection with fractional anisotropy (FA) identification. FA decrease has been observed in the corpus callosum of subjects with Alzheimer's disease (AD) and mild cognitive impairment (MCI, an AD prodromal stage). Corpus callosum splenium DTI abnormalities are thought to be associated with functional disconnections among cortical areas. This study aimed to investigate possible correlations between structural damage, measured by MRI-DTI, and functional abnormalities of brain integration, measured by characteristic path length detected in resting state EEG source activity (40 participants: 9 healthy controls, 10 MCI, 10 mild AD, 11 moderate AD). For each subject, undirected and weighted brain network was built to evaluate graph core measures. eLORETA lagged linear connectivity values were used as weight of the edges of the network. Results showed that callosal FA reduction is associated to a loss of brain interhemispheric functional connectivity characterized by increased delta and decreased alpha path length. These findings suggest that "global" (average network shortest path length representing an index of how efficient is the information transfer between two parts of the network) functional measure can reflect the reduction of fiber connecting the two hemispheres as revealed by DTI analysis and also anticipate in time this structural loss. PMID:25613102

  2. Teichmüller Theory of Bordered Surfaces

    NASA Astrophysics Data System (ADS)

    Chekhov, Leonid O.

    2007-05-01

    We propose the graph description of Teichmüller theory of surfaces with marked points on boundary components (bordered surfaces). Introducing new parameters, we formulate this theory in terms of hyperbolic geometry. We can then describe both classical and quantum theories having the proper number of Thurston variables (foliation-shear coordinates), mapping-class group invariance (both classical and quantum), Poisson and quantum algebra of geodesic functions, and classical and quantum braid-group relations. These new algebras can be defined on the double of the corresponding graph related (in a novel way) to a double of the Riemann surface (which is a Riemann surface with holes, not a smooth Riemann surface). We enlarge the mapping class group allowing transformations relating different Teichmüller spaces of bordered surfaces of the same genus, same number of boundary components, and same total number of marked points but with arbitrary distributions of marked po! ints among the boundary components. We describe the classical and quantum algebras and braid group relations for particular sets of geodesic functions corresponding to An and Dn algebras and discuss briefly the relation to the Thurston theory.

  3. A note on derivations of Murray–von Neumann algebras

    PubMed Central

    Kadison, Richard V.; Liu, Zhe

    2014-01-01

    A Murray–von Neumann algebra is the algebra of operators affiliated with a finite von Neumann algebra. In this article, we first present a brief introduction to the theory of derivations of operator algebras from both the physical and mathematical points of view. We then describe our recent work on derivations of Murray–von Neumann algebras. We show that the “extended derivations” of a Murray–von Neumann algebra, those that map the associated finite von Neumann algebra into itself, are inner. In particular, we prove that the only derivation that maps a Murray–von Neumann algebra associated with a factor of type II1 into that factor is 0. Those results are extensions of Singer’s seminal result answering a question of Kaplansky, as applied to von Neumann algebras: The algebra may be noncommutative and may even contain unbounded elements. PMID:24469831

  4. Fast Approximate Quadratic Programming for Graph Matching

    PubMed Central

    Vogelstein, Joshua T.; Conroy, John M.; Lyzinski, Vince; Podrazik, Louis J.; Kratzer, Steven G.; Harley, Eric T.; Fishkind, Donniell E.; Vogelstein, R. Jacob; Priebe, Carey E.

    2015-01-01

    Quadratic assignment problems arise in a wide variety of domains, spanning operations research, graph theory, computer vision, and neuroscience, to name a few. The graph matching problem is a special case of the quadratic assignment problem, and graph matching is increasingly important as graph-valued data is becoming more prominent. With the aim of efficiently and accurately matching the large graphs common in big data, we present our graph matching algorithm, the Fast Approximate Quadratic assignment algorithm. We empirically demonstrate that our algorithm is faster and achieves a lower objective value on over 80% of the QAPLIB benchmark library, compared with the previous state-of-the-art. Applying our algorithm to our motivating example, matching C. elegans connectomes (brain-graphs), we find that it efficiently achieves performance. PMID:25886624

  5. Fast approximate quadratic programming for graph matching.

    PubMed

    Vogelstein, Joshua T; Conroy, John M; Lyzinski, Vince; Podrazik, Louis J; Kratzer, Steven G; Harley, Eric T; Fishkind, Donniell E; Vogelstein, R Jacob; Priebe, Carey E

    2015-01-01

    Quadratic assignment problems arise in a wide variety of domains, spanning operations research, graph theory, computer vision, and neuroscience, to name a few. The graph matching problem is a special case of the quadratic assignment problem, and graph matching is increasingly important as graph-valued data is becoming more prominent. With the aim of efficiently and accurately matching the large graphs common in big data, we present our graph matching algorithm, the Fast Approximate Quadratic assignment algorithm. We empirically demonstrate that our algorithm is faster and achieves a lower objective value on over 80% of the QAPLIB benchmark library, compared with the previous state-of-the-art. Applying our algorithm to our motivating example, matching C. elegans connectomes (brain-graphs), we find that it efficiently achieves performance. PMID:25886624

  6. Hom-Lie algebras with symmetric invariant nondegenerate bilinear forms

    NASA Astrophysics Data System (ADS)

    Benayadi, Saïd; Makhlouf, Abdenacer

    2014-02-01

    The aim of this paper is to introduce and study quadratic Hom-Lie algebras, which are Hom-Lie algebras equipped with symmetric invariant nondegenerate bilinear forms. We provide several constructions leading to examples and extend the Double Extension Theory to this class of nonassociative algebras. Elements of Representation Theory for Hom-Lie algebras, including adjoint and coadjoint representations, are supplied with application to quadratic Hom-Lie algebras. Centerless involutive quadratic Hom-Lie algebras are characterized. We reduce the case where the twist map is invertible to the study of involutive quadratic Lie algebras. Also, we establish a correspondence between the class of involutive quadratic Hom-Lie algebras and quadratic simple Lie algebras with symmetric involution.

  7. Representations and module-extensions of 3-hom-Lie algebras

    NASA Astrophysics Data System (ADS)

    Liu, Yan; Chen, Liangyun; Ma, Yao

    2015-12-01

    In this paper, we study the representations and module-extensions of 3-hom-Lie algebras. We show that a linear map between 3-hom-Lie algebras is a morphism if and only if its graph is a hom subalgebra and show that the set of derivations of a 3-hom-Lie algebra is a Lie algebra. Moreover, we introduce the definition of Tθ-extensions and Tθ∗ -extensions of 3-hom-Lie algebras in terms of modules, providing the necessary and sufficient conditions for a 2 k-dimensional metric 3-hom-Lie algebra to be isometric to a Tθ∗ -extension.

  8. Representations of Super Yang-Mills Algebras

    NASA Astrophysics Data System (ADS)

    Herscovich, Estanislao

    2013-06-01

    We study in this article the representation theory of a family of super algebras, called the super Yang-Mills algebras, by exploiting the Kirillov orbit method à la Dixmier for nilpotent super Lie algebras. These super algebras are an extension of the so-called Yang-Mills algebras, introduced by A. Connes and M. Dubois-Violette in (Lett Math Phys 61(2):149-158, 2002), and in fact they appear as a "background independent" formulation of supersymmetric gauge theory considered in physics, in a similar way as Yang-Mills algebras do the same for the usual gauge theory. Our main result states that, under certain hypotheses, all Clifford-Weyl super algebras {{Cliff}q(k) ⊗ Ap(k)}, for p ≥ 3, or p = 2 and q ≥ 2, appear as a quotient of all super Yang-Mills algebras, for n ≥ 3 and s ≥ 1. This provides thus a family of representations of the super Yang-Mills algebras.

  9. Twisted Logarithmic Modules of Vertex Algebras

    NASA Astrophysics Data System (ADS)

    Bakalov, Bojko

    2016-07-01

    Motivated by logarithmic conformal field theory and Gromov-Witten theory, we introduce a notion of a twisted module of a vertex algebra under an arbitrary (not necessarily semisimple) automorphism. Its main feature is that the twisted fields involve the logarithm of the formal variable. We develop the theory of such twisted modules and, in particular, derive a Borcherds identity and commutator formula for them. We investigate in detail the examples of affine and Heisenberg vertex algebras.

  10. Partitioning sparse matrices with eigenvectors of graphs

    NASA Technical Reports Server (NTRS)

    Pothen, Alex; Simon, Horst D.; Liou, Kang-Pu

    1990-01-01

    The problem of computing a small vertex separator in a graph arises in the context of computing a good ordering for the parallel factorization of sparse, symmetric matrices. An algebraic approach for computing vertex separators is considered in this paper. It is shown that lower bounds on separator sizes can be obtained in terms of the eigenvalues of the Laplacian matrix associated with a graph. The Laplacian eigenvectors of grid graphs can be computed from Kronecker products involving the eigenvectors of path graphs, and these eigenvectors can be used to compute good separators in grid graphs. A heuristic algorithm is designed to compute a vertex separator in a general graph by first computing an edge separator in the graph from an eigenvector of the Laplacian matrix, and then using a maximum matching in a subgraph to compute the vertex separator. Results on the quality of the separators computed by the spectral algorithm are presented, and these are compared with separators obtained from other algorithms for computing separators. Finally, the time required to compute the Laplacian eigenvector is reported, and the accuracy with which the eigenvector must be computed to obtain good separators is considered. The spectral algorithm has the advantage that it can be implemented on a medium-size multiprocessor in a straightforward manner.

  11. Multi-Matrix Models and Noncommutative Frobenius Algebras Obtained from Symmetric Groups and Brauer Algebras

    NASA Astrophysics Data System (ADS)

    Kimura, Yusuke

    2015-07-01

    It has been understood that correlation functions of multi-trace operators in SYM can be neatly computed using the group algebra of symmetric groups or walled Brauer algebras. On the other hand, such algebras have been known to construct 2D topological field theories (TFTs). After reviewing the construction of 2D TFTs based on symmetric groups, we construct 2D TFTs based on walled Brauer algebras. In the construction, the introduction of a dual basis manifests a similarity between the two theories. We next construct a class of 2D field theories whose physical operators have the same symmetry as multi-trace operators constructed from some matrices. Such field theories correspond to non-commutative Frobenius algebras. A matrix structure arises as a consequence of the noncommutativity. Correlation functions of the Gaussian complex multi-matrix models can be translated into correlation functions of the two-dimensional field theories.

  12. Alteration of cortical functional connectivity as a result of traumatic brain injury revealed by graph theory, ICA, and sLORETA analyses of EEG signals.

    PubMed

    Cao, C; Slobounov, S

    2010-02-01

    In this paper, a novel approach to examine the cortical functional connectivity using multichannel electroencephalographic (EEG) signals is proposed. First we utilized independent component analysis (ICA) to transform multichannel EEG recordings into independent processes and then applied source reconstruction algorithm [i.e., standardize low resolution brain electromagnetic (sLORETA)] to identify the cortical regions of interest (ROIs). Second, we performed a graph theory analysis of the bipartite network composite of ROIs and independent processes to assess the connectivity between ROIs. We applied this proposed algorithm and compared the functional connectivity network properties under resting state condition using 29 student-athletes prior to and shortly after sport-related mild traumatic brain injury (MTBI). The major findings of interest are the following. There was 1) alterations in vertex degree at frontal and occipital regions in subjects suffering from MTBI, ( p < 0.05); 2) a significant decrease in the long-distance connectivity and significant increase in the short-distance connectivity as a result of MTBI, ( p < 0.05); 3) a departure from small-world network configuration in MTBI subjects. These major findings are discussed in relation to current debates regarding the brain functional connectivity within and between local and distal regions both in normal controls in pathological subjects. PMID:20064767

  13. Fragment Assembly Approach Based on Graph/Network Theory with Quantum Chemistry Verifications for Assigning Multidimensional NMR Signals in Metabolite Mixtures.

    PubMed

    Ito, Kengo; Tsutsumi, Yu; Date, Yasuhiro; Kikuchi, Jun

    2016-04-15

    The abundant observation of chemical fragment information for molecular complexities is a major advantage of biological NMR analysis. Thus, the development of a novel technique for NMR signal assignment and metabolite identification may offer new possibilities for exploring molecular complexities. We propose a new signal assignment approach for metabolite mixtures by assembling H-H, H-C, C-C, and Q-C fragmental information obtained by multidimensional NMR, followed by the application of graph and network theory. High-speed experiments and complete automatic signal assignments were achieved for 12 combined mixtures of (13)C-labeled standards. Application to a (13)C-labeled seaweed extract showed 66 H-C, 60 H-H, 326 C-C, and 28 Q-C correlations, which were successfully assembled to 18 metabolites by the automatic assignment. The validity of automatic assignment was supported by quantum chemical calculations. This new approach can predict entire metabolite structures from peak networks of biological extracts. PMID:26789380

  14. A note on probabilistic models over strings: the linear algebra approach.

    PubMed

    Bouchard-Côté, Alexandre

    2013-12-01

    Probabilistic models over strings have played a key role in developing methods that take into consideration indels as phylogenetically informative events. There is an extensive literature on using automata and transducers on phylogenies to do inference on these probabilistic models, in which an important theoretical question is the complexity of computing the normalization of a class of string-valued graphical models. This question has been investigated using tools from combinatorics, dynamic programming, and graph theory, and has practical applications in Bayesian phylogenetics. In this work, we revisit this theoretical question from a different point of view, based on linear algebra. The main contribution is a set of results based on this linear algebra view that facilitate the analysis and design of inference algorithms on string-valued graphical models. As an illustration, we use this method to give a new elementary proof of a known result on the complexity of inference on the "TKF91" model, a well-known probabilistic model over strings. Compared to previous work, our proving method is easier to extend to other models, since it relies on a novel weak condition, triangular transducers, which is easy to establish in practice. The linear algebra view provides a concise way of describing transducer algorithms and their compositions, opens the possibility of transferring fast linear algebra libraries (for example, based on GPUs), as well as low rank matrix approximation methods, to string-valued inference problems. PMID:24135792

  15. Some Applications of Algebraic System Solving

    ERIC Educational Resources Information Center

    Roanes-Lozano, Eugenio

    2011-01-01

    Technology and, in particular, computer algebra systems, allows us to change both the way we teach mathematics and the mathematical curriculum. Curiously enough, unlike what happens with linear system solving, algebraic system solving is not widely known. The aim of this paper is to show that, although the theory lying behind the "exact solve"…

  16. Classical and quantum Kummer shape algebras

    NASA Astrophysics Data System (ADS)

    Odzijewicz, A.; Wawreniuk, E.

    2016-07-01

    We study a family of integrable systems of nonlinearly coupled harmonic oscillators on the classical and quantum levels. We show that the integrability of these systems follows from their symmetry characterized by algebras, here called Kummer shape algebras. The resolution of identity for a wide class of reproducing kernels is found. A number of examples, illustrating this theory, are also presented.

  17. Twisted Quantum Toroidal Algebras

    NASA Astrophysics Data System (ADS)

    Jing, Naihuan; Liu, Rongjia

    2014-09-01

    We construct a principally graded quantum loop algebra for the Kac-Moody algebra. As a special case a twisted analog of the quantum toroidal algebra is obtained together with the quantum Serre relations.

  18. Fish gotta swim, Birds gotta fly, I gotta do Feynmann Graphs 'til I die: A continuum Theory of Flocking

    NASA Astrophysics Data System (ADS)

    Toner, John; Tu, Yu-Hai

    2002-05-01

    We have developed a new continuum dynamical model for the collective motion of large "flocks" of biological organisms (e.g., flocks of birds, schools of fish, herds of wildebeest, hordes of bacteria, slime molds, etc.) . This model does for flocks what the Navier-Stokes equation does for fluids. The model predicts that, unlike simple fluids, flocks show huge fluctuation effects in spatial dimensions d < 4 that radically change their behavior. In d=2, it is only these effects that make it possible for the flock to move coherently at all. This explains why a million wildebeest can march together across the Serengeti plain, despite the fact that a million physicists gathered on the same plane could NOT all POINT in the same direction. Detailed quantitative predictions of this theory agree beautifully with computer simulations of flock motion.

  19. Type-Decomposition of an Effect Algebra

    NASA Astrophysics Data System (ADS)

    Foulis, David J.; Pulmannová, Sylvia

    2010-10-01

    Effect algebras (EAs), play a significant role in quantum logic, are featured in the theory of partially ordered Abelian groups, and generalize orthoalgebras, MV-algebras, orthomodular posets, orthomodular lattices, modular ortholattices, and boolean algebras. We study centrally orthocomplete effect algebras (COEAs), i.e., EAs satisfying the condition that every family of elements that is dominated by an orthogonal family of central elements has a supremum. For COEAs, we introduce a general notion of decomposition into types; prove that a COEA factors uniquely as a direct sum of types I, II, and III; and obtain a generalization for COEAs of Ramsay’s fourfold decomposition of a complete orthomodular lattice.

  20. Sequential visibility-graph motifs

    NASA Astrophysics Data System (ADS)

    Iacovacci, Jacopo; Lacasa, Lucas

    2016-04-01

    Visibility algorithms transform time series into graphs and encode dynamical information in their topology, paving the way for graph-theoretical time series analysis as well as building a bridge between nonlinear dynamics and network science. In this work we introduce and study the concept of sequential visibility-graph motifs, smaller substructures of n consecutive nodes that appear with characteristic frequencies. We develop a theory to compute in an exact way the motif profiles associated with general classes of deterministic and stochastic dynamics. We find that this simple property is indeed a highly informative and computationally efficient feature capable of distinguishing among different dynamics and robust against noise contamination. We finally confirm that it can be used in practice to perform unsupervised learning, by extracting motif profiles from experimental heart-rate series and being able, accordingly, to disentangle meditative from other relaxation states. Applications of this general theory include the automatic classification and description of physical, biological, and financial time series.

  1. Critiquing the Culture of Computer Graphing Practices.

    ERIC Educational Resources Information Center

    Brasseur, Lee

    2001-01-01

    Argues that current approaches to computer graphing practices are ill suited to meet the complex needs of real users. Offers an overview of work in two major areas of graphing theory and research: the sociology of science and the educational research of mathematics and scientific students. Suggests what technical communicators can do to improve…

  2. ON CLUSTERING TECHNIQUES OF CITATION GRAPHS.

    ERIC Educational Resources Information Center

    CHIEN, R.T.; PREPARATA, F.P.

    ONE OF THE PROBLEMS ENCOUNTERED IN CLUSTERING TECHNIQUES AS APPLIED TO DOCUMENT RETRIEVAL SYSTEMS USING BIBLIOGRAPHIC COUPLING DEVICES IS THAT THE COMPUTATIONAL EFFORT REQUIRED GROWS ROUGHLY AS THE SQUARE OF THE COLLECTION SIZE. IN THIS STUDY GRAPH THEORY IS APPLIED TO THIS PROBLEM BY FIRST MAPPING THE CITATION GRAPH OF THE DOCUMENT COLLECTION…

  3. Algebraic Lattices in QFT Renormalization

    NASA Astrophysics Data System (ADS)

    Borinsky, Michael

    2016-04-01

    The structure of overlapping subdivergences, which appear in the perturbative expansions of quantum field theory, is analyzed using algebraic lattice theory. It is shown that for specific QFTs the sets of subdivergences of Feynman diagrams form algebraic lattices. This class of QFTs includes the standard model. In kinematic renormalization schemes, in which tadpole diagrams vanish, these lattices are semimodular. This implies that the Hopf algebra of Feynman diagrams is graded by the coradical degree or equivalently that every maximal forest has the same length in the scope of BPHZ renormalization. As an application of this framework, a formula for the counter terms in zero-dimensional QFT is given together with some examples of the enumeration of primitive or skeleton diagrams.

  4. Algebraic Lattices in QFT Renormalization

    NASA Astrophysics Data System (ADS)

    Borinsky, Michael

    2016-07-01

    The structure of overlapping subdivergences, which appear in the perturbative expansions of quantum field theory, is analyzed using algebraic lattice theory. It is shown that for specific QFTs the sets of subdivergences of Feynman diagrams form algebraic lattices. This class of QFTs includes the standard model. In kinematic renormalization schemes, in which tadpole diagrams vanish, these lattices are semimodular. This implies that the Hopf algebra of Feynman diagrams is graded by the coradical degree or equivalently that every maximal forest has the same length in the scope of BPHZ renormalization. As an application of this framework, a formula for the counter terms in zero-dimensional QFT is given together with some examples of the enumeration of primitive or skeleton diagrams.

  5. Laplacian Estrada and normalized Laplacian Estrada indices of evolving graphs.

    PubMed

    Shang, Yilun

    2015-01-01

    Large-scale time-evolving networks have been generated by many natural and technological applications, posing challenges for computation and modeling. Thus, it is of theoretical and practical significance to probe mathematical tools tailored for evolving networks. In this paper, on top of the dynamic Estrada index, we study the dynamic Laplacian Estrada index and the dynamic normalized Laplacian Estrada index of evolving graphs. Using linear algebra techniques, we established general upper and lower bounds for these graph-spectrum-based invariants through a couple of intuitive graph-theoretic measures, including the number of vertices or edges. Synthetic random evolving small-world networks are employed to show the relevance of the proposed dynamic Estrada indices. It is found that neither the static snapshot graphs nor the aggregated graph can approximate the evolving graph itself, indicating the fundamental difference between the static and dynamic Estrada indices. PMID:25822506

  6. Laplacian Estrada and Normalized Laplacian Estrada Indices of Evolving Graphs

    PubMed Central

    Shang, Yilun

    2015-01-01

    Large-scale time-evolving networks have been generated by many natural and technological applications, posing challenges for computation and modeling. Thus, it is of theoretical and practical significance to probe mathematical tools tailored for evolving networks. In this paper, on top of the dynamic Estrada index, we study the dynamic Laplacian Estrada index and the dynamic normalized Laplacian Estrada index of evolving graphs. Using linear algebra techniques, we established general upper and lower bounds for these graph-spectrum-based invariants through a couple of intuitive graph-theoretic measures, including the number of vertices or edges. Synthetic random evolving small-world networks are employed to show the relevance of the proposed dynamic Estrada indices. It is found that neither the static snapshot graphs nor the aggregated graph can approximate the evolving graph itself, indicating the fundamental difference between the static and dynamic Estrada indices. PMID:25822506

  7. Classification of central extensions of Lax operator algebras

    SciTech Connect

    Schlichenmaier, Martin

    2008-11-18

    Lax operator algebras were introduced by Krichever and Sheinman as further developments of Krichever's theory of Lax operators on algebraic curves. They are infinite dimensional Lie algebras of current type with meromorphic objects on compact Riemann surfaces (resp. algebraic curves) as elements. Here we report on joint work with Oleg Sheinman on the classification of their almost-graded central extensions. It turns out that in case that the finite-dimensional Lie algebra on which the Lax operator algebra is based on is simple there is a unique almost-graded central extension up to equivalence and rescaling of the central element.

  8. Banach Algebras Associated to Lax Pairs

    NASA Astrophysics Data System (ADS)

    Glazebrook, James F.

    2015-04-01

    Lax pairs featuring in the theory of integrable systems are known to be constructed from a commutative algebra of formal pseudodifferential operators known as the Burchnall- Chaundy algebra. Such pairs induce the well known KP flows on a restricted infinite-dimensional Grassmannian. The latter can be exhibited as a Banach homogeneous space constructed from a Banach *-algebra. It is shown that this commutative algebra of operators generating Lax pairs can be associated with a commutative C*-subalgebra in the C*-norm completion of the *-algebra. In relationship to the Bose-Fermi correspondence and the theory of vertex operators, this C*-algebra has an association with the CAR algebra of operators as represented on Fermionic Fock space by the Gelfand-Naimark-Segal construction. Instrumental is the Plücker embedding of the restricted Grassmannian into the projective space of the associated Hilbert space. The related Baker and tau-functions provide a connection between these two C*-algebras, following which their respective state spaces and Jordan-Lie-Banach algebras structures can be compared.

  9. Lax operator algebras and integrable systems

    NASA Astrophysics Data System (ADS)

    Sheinman, O. K.

    2016-02-01

    A new class of infinite-dimensional Lie algebras, called Lax operator algebras, is presented, along with a related unifying approach to finite-dimensional integrable systems with a spectral parameter on a Riemann surface such as the Calogero-Moser and Hitchin systems. In particular, the approach includes (non-twisted) Kac-Moody algebras and integrable systems with a rational spectral parameter. The presentation is based on quite simple ideas about the use of gradings of semisimple Lie algebras and their interaction with the Riemann-Roch theorem. The basic properties of Lax operator algebras and the basic facts about the theory of the integrable systems in question are treated (and proved) from this general point of view. In particular, the existence of commutative hierarchies and their Hamiltonian properties are considered. The paper concludes with an application of Lax operator algebras to prequantization of finite-dimensional integrable systems. Bibliography: 51 titles.

  10. The tensor hierarchy algebra

    NASA Astrophysics Data System (ADS)

    Palmkvist, Jakob

    2014-01-01

    We introduce an infinite-dimensional Lie superalgebra which is an extension of the U-duality Lie algebra of maximal supergravity in D dimensions, for 3 ⩽ D ⩽ 7. The level decomposition with respect to the U-duality Lie algebra gives exactly the tensor hierarchy of representations that arises in gauge deformations of the theory described by an embedding tensor, for all positive levels p. We prove that these representations are always contained in those coming from the associated Borcherds-Kac-Moody superalgebra, and we explain why some of the latter representations are not included in the tensor hierarchy. The most remarkable feature of our Lie superalgebra is that it does not admit a triangular decomposition like a (Borcherds-)Kac-Moody (super)algebra. Instead the Hodge duality relations between level p and D - 2 - p extend to negative p, relating the representations at the first two negative levels to the supersymmetry and closure constraints of the embedding tensor.

  11. Priority in Process Algebras

    NASA Technical Reports Server (NTRS)

    Cleaveland, Rance; Luettgen, Gerald; Natarajan, V.

    1999-01-01

    This paper surveys the semantic ramifications of extending traditional process algebras with notions of priority that allow for some transitions to be given precedence over others. These enriched formalisms allow one to model system features such as interrupts, prioritized choice, or real-time behavior. Approaches to priority in process algebras can be classified according to whether the induced notion of preemption on transitions is global or local and whether priorities are static or dynamic. Early work in the area concentrated on global pre-emption and static priorities and led to formalisms for modeling interrupts and aspects of real-time, such as maximal progress, in centralized computing environments. More recent research has investigated localized notions of pre-emption in which the distribution of systems is taken into account, as well as dynamic priority approaches, i.e., those where priority values may change as systems evolve. The latter allows one to model behavioral phenomena such as scheduling algorithms and also enables the efficient encoding of real-time semantics. Technically, this paper studies the different models of priorities by presenting extensions of Milner's Calculus of Communicating Systems (CCS) with static and dynamic priority as well as with notions of global and local pre- emption. In each case the operational semantics of CCS is modified appropriately, behavioral theories based on strong and weak bisimulation are given, and related approaches for different process-algebraic settings are discussed.

  12. The tensor hierarchy algebra

    SciTech Connect

    Palmkvist, Jakob

    2014-01-15

    We introduce an infinite-dimensional Lie superalgebra which is an extension of the U-duality Lie algebra of maximal supergravity in D dimensions, for 3 ⩽ D ⩽ 7. The level decomposition with respect to the U-duality Lie algebra gives exactly the tensor hierarchy of representations that arises in gauge deformations of the theory described by an embedding tensor, for all positive levels p. We prove that these representations are always contained in those coming from the associated Borcherds-Kac-Moody superalgebra, and we explain why some of the latter representations are not included in the tensor hierarchy. The most remarkable feature of our Lie superalgebra is that it does not admit a triangular decomposition like a (Borcherds-)Kac-Moody (super)algebra. Instead the Hodge duality relations between level p and D − 2 − p extend to negative p, relating the representations at the first two negative levels to the supersymmetry and closure constraints of the embedding tensor.

  13. C∗-completions and the DFR-algebra

    NASA Astrophysics Data System (ADS)

    Forger, Michael; Paulino, Daniel V.

    2016-02-01

    The aim of this paper is to present the construction of a general family of C∗-algebras which includes, as a special case, the "quantum spacetime algebra" introduced by Doplicher, Fredenhagen, and Roberts. It is based on an extension of the notion of C∗-completion from algebras to bundles of algebras, compatible with the usual C∗-completion of the appropriate algebras of sections, combined with a novel definition for the algebra of the canonical commutation relations using Rieffel's theory of strict deformation quantization. Taking the C∗-algebra of continuous sections vanishing at infinity, we arrive at a functor associating a C∗-algebra to any Poisson vector bundle and recover the original DFR-algebra as a particular example.

  14. Structural features of algebraic quantum notations

    NASA Astrophysics Data System (ADS)

    Gire, Elizabeth; Price, Edward

    2015-12-01

    [This paper is part of the Focused Collection on Upper Division Physics Courses.] The formalism of quantum mechanics includes a rich collection of representations for describing quantum systems, including functions, graphs, matrices, histograms of probabilities, and Dirac notation. The varied features of these representations affect how computations are performed. For example, identifying probabilities of measurement outcomes for a state described in Dirac notation may involve identifying expansion coefficients by inspection, but if the state is described as a function, identifying those expansion coefficients often involves performing integrals. In this study, we focus on three notational systems: Dirac notation, algebraic wave-function notation, and matrix notation. These quantum notations must include information about basis states and their associated complex probability amplitudes. In this theory paper, we identify four structural features of quantum notations, which we term individuation, degree of externalization, compactness, and symbolic support for computational rules. We illustrate how student reasoning interacts with these structural features with episodes from interviews with advanced undergraduate physics majors reasoning about a superposition state of an infinite square well system. We find evidence of the students coordinating different notations through the use of Dirac notation, using an expression in Dirac notation to guide their work in another notation. These uses are supported by the high degree of individuation, compactness, and symbolic support for computation and the moderate degree of externalization provided by Dirac notation.

  15. Eigenfunction statistics on quantum graphs

    SciTech Connect

    Gnutzmann, S.; Keating, J.P.; Piotet, F.

    2010-12-15

    We investigate the spatial statistics of the energy eigenfunctions on large quantum graphs. It has previously been conjectured that these should be described by a Gaussian Random Wave Model, by analogy with quantum chaotic systems, for which such a model was proposed by Berry in 1977. The autocorrelation functions we calculate for an individual quantum graph exhibit a universal component, which completely determines a Gaussian Random Wave Model, and a system-dependent deviation. This deviation depends on the graph only through its underlying classical dynamics. Classical criteria for quantum universality to be met asymptotically in the large graph limit (i.e. for the non-universal deviation to vanish) are then extracted. We use an exact field theoretic expression in terms of a variant of a supersymmetric {sigma} model. A saddle-point analysis of this expression leads to the estimates. In particular, intensity correlations are used to discuss the possible equidistribution of the energy eigenfunctions in the large graph limit. When equidistribution is asymptotically realized, our theory predicts a rate of convergence that is a significant refinement of previous estimates. The universal and system-dependent components of intensity correlation functions are recovered by means of an exact trace formula which we analyse in the diagonal approximation, drawing in this way a parallel between the field theory and semiclassics. Our results provide the first instance where an asymptotic Gaussian Random Wave Model has been established microscopically for eigenfunctions in a system with no disorder.

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

  17. Graphing Polar Curves

    ERIC Educational Resources Information Center

    Lawes, Jonathan F.

    2013-01-01

    Graphing polar curves typically involves a combination of three traditional techniques, all of which can be time-consuming and tedious. However, an alternative method--graphing the polar function on a rectangular plane--simplifies graphing, increases student understanding of the polar coordinate system, and reinforces graphing techniques learned…

  18. Path Separability of Graphs

    NASA Astrophysics Data System (ADS)

    Diot, Emilie; Gavoille, Cyril

    In this paper we investigate the structural properties of k-path separable graphs, that are the graphs that can be separated by a set of k shortest paths. We identify several graph families having such path separability, and we show that this property is closed under minor taking. In particular we establish a list of forbidden minors for 1-path separable graphs.

  19. Graphing for Any Grade.

    ERIC Educational Resources Information Center

    Nibbelink, William

    1982-01-01

    An instructional sequence for teaching graphing that has been extensively field tested in kindergarten through grade six is detailed. The material begins with point graphs, employs a movable y-axis to begin with minimal clutter, and has graphs constructed before reading graphs is required. (MP)

  20. Algebras with convergent star products and their representations in Hilbert spaces

    SciTech Connect

    Soloviev, M. A.

    2013-07-15

    We study star product algebras of analytic functions for which the power series defining the products converge absolutely. Such algebras arise naturally in deformation quantization theory and in noncommutative quantum field theory. We consider different star products in a unifying way and present results on the structure and basic properties of these algebras, which are useful for applications. Special attention is given to the Hilbert space representation of the algebras and to the exact description of their corresponding operator algebras.

  1. Components in time-varying graphs.

    PubMed

    Nicosia, Vincenzo; Tang, John; Musolesi, Mirco; Russo, Giovanni; Mascolo, Cecilia; Latora, Vito

    2012-06-01

    Real complex systems are inherently time-varying. Thanks to new communication systems and novel technologies, today it is possible to produce and analyze social and biological networks with detailed information on the time of occurrence and duration of each link. However, standard graph metrics introduced so far in complex network theory are mainly suited for static graphs, i.e., graphs in which the links do not change over time, or graphs built from time-varying systems by aggregating all the links as if they were concurrent in time. In this paper, we extend the notion of connectedness, and the definitions of node and graph components, to the case of time-varying graphs, which are represented as time-ordered sequences of graphs defined over a fixed set of nodes. We show that the problem of finding strongly connected components in a time-varying graph can be mapped into the problem of discovering the maximal-cliques in an opportunely constructed static graph, which we name the affine graph. It is, therefore, an NP-complete problem. As a practical example, we have performed a temporal component analysis of time-varying graphs constructed from three data sets of human interactions. The results show that taking time into account in the definition of graph components allows to capture important features of real systems. In particular, we observe a large variability in the size of node temporal in- and out-components. This is due to intrinsic fluctuations in the activity patterns of individuals, which cannot be detected by static graph analysis. PMID:22757508

  2. Components in time-varying graphs

    NASA Astrophysics Data System (ADS)

    Nicosia, Vincenzo; Tang, John; Musolesi, Mirco; Russo, Giovanni; Mascolo, Cecilia; Latora, Vito

    2012-06-01

    Real complex systems are inherently time-varying. Thanks to new communication systems and novel technologies, today it is possible to produce and analyze social and biological networks with detailed information on the time of occurrence and duration of each link. However, standard graph metrics introduced so far in complex network theory are mainly suited for static graphs, i.e., graphs in which the links do not change over time, or graphs built from time-varying systems by aggregating all the links as if they were concurrent in time. In this paper, we extend the notion of connectedness, and the definitions of node and graph components, to the case of time-varying graphs, which are represented as time-ordered sequences of graphs defined over a fixed set of nodes. We show that the problem of finding strongly connected components in a time-varying graph can be mapped into the problem of discovering the maximal-cliques in an opportunely constructed static graph, which we name the affine graph. It is, therefore, an NP-complete problem. As a practical example, we have performed a temporal component analysis of time-varying graphs constructed from three data sets of human interactions. The results show that taking time into account in the definition of graph components allows to capture important features of real systems. In particular, we observe a large variability in the size of node temporal in- and out-components. This is due to intrinsic fluctuations in the activity patterns of individuals, which cannot be detected by static graph analysis.

  3. Vortices and superfields on a graph

    SciTech Connect

    Kan, Nahomi; Kobayashi, Koichiro; Shiraishi, Kiyoshi

    2009-08-15

    We extend the dimensional deconstruction by utilizing the knowledge of graph theory. In the dimensional deconstruction, one uses the moose diagram to exhibit the structure of the 'theory space'. We generalize the moose diagram to a general graph with oriented edges. In the present paper, we consider only the U(1) gauge symmetry. We also introduce supersymmetry into our model by use of superfields. We suppose that vector superfields reside at the vertices and chiral superfields at the edges of a given graph. Then we can consider multivector, multi-Higgs models. In our model, [U(1)]{sup p} (where p is the number of vertices) is broken to a single U(1). Therefore, for specific graphs, we get vortexlike classical solutions in our model. We show some examples of the graphs admitting the vortex solutions of simple structure as the Bogomolnyi solution.

  4. Vortices and superfields on a graph

    NASA Astrophysics Data System (ADS)

    Kan, Nahomi; Kobayashi, Koichiro; Shiraishi, Kiyoshi

    2009-08-01

    We extend the dimensional deconstruction by utilizing the knowledge of graph theory. In the dimensional deconstruction, one uses the moose diagram to exhibit the structure of the “theory space.” We generalize the moose diagram to a general graph with oriented edges. In the present paper, we consider only the U(1) gauge symmetry. We also introduce supersymmetry into our model by use of superfields. We suppose that vector superfields reside at the vertices and chiral superfields at the edges of a given graph. Then we can consider multivector, multi-Higgs models. In our model, [U(1)]p (where p is the number of vertices) is broken to a single U(1). Therefore, for specific graphs, we get vortexlike classical solutions in our model. We show some examples of the graphs admitting the vortex solutions of simple structure as the Bogomolnyi solution.

  5. Historical Topics in Algebra.

    ERIC Educational Resources Information Center

    National Council of Teachers of Mathematics, Inc., Reston, VA.

    This is a reprint of the historical capsules dealing with algebra from the 31st Yearbook of NCTM,"Historical Topics for the Mathematics Classroom." Included are such themes as the change from a geometric to an algebraic solution of problems, the development of algebraic symbolism, the algebraic contributions of different countries, the origin and…

  6. On Ramsey (3K2, K3) - minimal graphs

    NASA Astrophysics Data System (ADS)

    Wijaya, Kristiana; Baskoro, Edy Tri; Assiyatun, Hilda; Suprijanto, Djoko

    2016-02-01

    The Ramsey graph theory has many interesting applications, such as in the fields of communications, information retrieval, and decision making. One of growing topics in Ramsey theory is Ramsey minimal graph. For any given graphs G and H, find graphs F such that any red-blue coloring of all edges of F contains either a red copy of G or a blue copy of H. If this condition is not satisfied by the graph F - e, then we call the graph F as a Ramsey (G, H) - minimal. In this paper, we derive the properties of (3K2, K3) - minimal graphs. We, then, characterize all Ramsey (3K2, K3) - minimal graphs.

  7. A combinatorial approach to diffeomorphism invariant quantum gauge theories

    SciTech Connect

    Zapata, J.A.

    1997-11-01

    Quantum gauge theory in the connection representation uses functions of holonomies as configuration observables. Physical observables (gauge and diffeomorphism invariant) are represented in the Hilbert space of physical states; physical states are gauge and diffeomorphism invariant distributions on the space of functions of the holonomies of the edges of a certain family of graphs. Then a family of graphs embedded in the space manifold (satisfying certain properties) induces a representation of the algebra of physical observables. We construct a quantum model from the set of piecewise linear graphs on a piecewise linear manifold, and another manifestly combinatorial model from graphs defined on a sequence of increasingly refined simplicial complexes. Even though the two models are different at the kinematical level, they provide unitarily equivalent representations of the algebra of physical observables in {ital separable} Hilbert spaces of physical states (their s-knot basis is countable). Hence, the combinatorial framework is compatible with the usual interpretation of quantum field theory. {copyright} {ital 1997 American Institute of Physics.}

  8. Some results on the spectra of strongly regular graphs

    NASA Astrophysics Data System (ADS)

    Vieira, Luís António de Almeida; Mano, Vasco Moço

    2016-06-01

    Let G be a strongly regular graph whose adjacency matrix is A. We associate a real finite dimensional Euclidean Jordan algebra 𝒱, of rank three to the strongly regular graph G, spanned by I and the natural powers of A, endowed with the Jordan product of matrices and with the inner product as being the usual trace of matrices. Finally, by the analysis of the binomial Hadamard series of an element of 𝒱, we establish some inequalities on the parameters and on the spectrum of a strongly regular graph like those established in theorems 3 and 4.

  9. Students' Interpretation of a Function Associated with a Real-Life Problem from Its Graph

    ERIC Educational Resources Information Center

    Mahir, Nevin

    2010-01-01

    The properties of a function such as limit, continuity, derivative, growth, or concavity can be determined more easily from its graph than by doing any algebraic operation. For this reason, it is important for students of mathematics to interpret some of the properties of a function from its graph. In this study, we investigated the competence of…

  10. The Algebra of Lexical Semantics

    NASA Astrophysics Data System (ADS)

    Kornai, András

    The current generative theory of the lexicon relies primarily on tools from formal language theory and mathematical logic. Here we describe how a different formal apparatus, taken from algebra and automata theory, resolves many of the known problems with the generative lexicon. We develop a finite state theory of word meaning based on machines in the sense of Eilenberg [11], a formalism capable of describing discrepancies between syntactic type (lexical category) and semantic type (number of arguments). This mechanism is compared both to the standard linguistic approaches and to the formalisms developed in AI/KR.

  11. Constraint algebra in bigravity

    SciTech Connect

    Soloviev, V. O.

    2015-07-15

    The number of degrees of freedom in bigravity theory is found for a potential of general form and also for the potential proposed by de Rham, Gabadadze, and Tolley (dRGT). This aim is pursued via constructing a Hamiltonian formalismand studying the Poisson algebra of constraints. A general potential leads to a theory featuring four first-class constraints generated by general covariance. The vanishing of the respective Hessian is a crucial property of the dRGT potential, and this leads to the appearance of two additional second-class constraints and, hence, to the exclusion of a superfluous degree of freedom—that is, the Boulware—Deser ghost. The use of a method that permits avoiding an explicit expression for the dRGT potential is a distinctive feature of the present study.

  12. Teaching the "Diagonalization Concept" in Linear Algebra with Technology: A Case Study at Galatasaray University

    ERIC Educational Resources Information Center

    Yildiz Ulus, Aysegul

    2013-01-01

    This paper examines experimental and algorithmic contributions of advanced calculators (graphing and computer algebra system, CAS) in teaching the concept of "diagonalization," one of the key topics in Linear Algebra courses taught at the undergraduate level. Specifically, the proposed hypothesis of this study is to assess the effective…

  13. Introducing Algebra through the Graphical Representation of Functions: A Study among LD Students

    ERIC Educational Resources Information Center

    Sauriol, Jennifer

    2013-01-01

    This longitudinal study evaluates the impact of a new Algebra 1 course at a High School for language-based learning-disabled (LD) students. The new course prioritized the teaching of relationship graphs and functions as an introduction to algebra. Across three studies, the dissertation documents and evaluates the progress made by LD high school…

  14. Private quantum subsystems and quasiorthogonal operator algebras

    NASA Astrophysics Data System (ADS)

    Levick, Jeremy; Jochym-O'Connor, Tomas; Kribs, David W.; Laflamme, Raymond; Pereira, Rajesh

    2016-03-01

    We generalize a recently discovered example of a private quantum subsystem to find private subsystems for Abelian subgroups of the n-qubit Pauli group, which exist in the absence of private subspaces. In doing so, we also connect these quantum privacy investigations with the theory of quasiorthogonal operator algebras through the use of tools from group theory and operator theory.

  15. How Graphing Calculators Find Curves of Best Fit

    ERIC Educational Resources Information Center

    Shore, Mark; Shore, JoAnna; Boggs, Stacey

    2004-01-01

    For over a decade mathematics instructors have been using graphing calculators in courses ranging from developmental mathematics (Beginning and Intermediate Algebra) to Calculus and Statistics. One of the key functions that make them so powerful in the teaching and learning process is their ability to find curves of best fit. Instructors may use…

  16. Ecosystem Simulations and Chaos on the Graphing Calculator

    ERIC Educational Resources Information Center

    Sinn, Robb

    2007-01-01

    An eighth grade algebra class used graphing calculators to simulate ecosystems. One simulation introduced mathematical chaos. The activities exposed the students to nonlinear patterns and modeling. The rate-of-change investigations related the ideas of intercept and slope to the changing equilibrium. The chaotic model intrigued them and was useful…

  17. Generalizing a Categorization of Students' Interpretations of Linear Kinematics Graphs

    ERIC Educational Resources Information Center

    Bollen, Laurens; De Cock, Mieke; Zuza, Kristina; Guisasola, Jenaro; van Kampen, Paul

    2016-01-01

    We have investigated whether and how a categorization of responses to questions on linear distance-time graphs, based on a study of Irish students enrolled in an algebra-based course, could be adopted and adapted to responses from students enrolled in calculus-based physics courses at universities in Flanders, Belgium (KU Leuven) and the Basque…

  18. Improving Student Knowledge of the Graphing Calculator's Capabilities.

    ERIC Educational Resources Information Center

    Hubbard, Donna

    This paper describes an intervention in two Algebra II classes in which the graphing calculator was incorporated into the curriculum as often as possible. The targeted population consisted of high school students in a growing middle to upper class community located in a suburb of a large city. The problem of a lack of understanding of the…

  19. The Universal C*-Algebra of the Electromagnetic Field

    NASA Astrophysics Data System (ADS)

    Buchholz, Detlev; Ciolli, Fabio; Ruzzi, Giuseppe; Vasselli, Ezio

    2016-02-01

    A universal C*-algebra of the electromagnetic field is constructed. It is represented in any quantum field theory which incorporates electromagnetism and expresses basic features of the field such as Maxwell's equations, Poincaré covariance and Einstein causality. Moreover, topological properties of the field resulting from Maxwell's equations are encoded in the algebra, leading to commutation relations with values in its center. The representation theory of the algebra is discussed with focus on vacuum representations, fixing the dynamics of the field.

  20. Relativity on rotated graph paper

    NASA Astrophysics Data System (ADS)

    Salgado, Roberto B.

    2016-05-01

    We demonstrate a method for constructing spacetime diagrams for special relativity on graph paper that has been rotated by 45°. The diagonal grid lines represent light-flash worldlines in Minkowski spacetime, and the boxes in the grid (called "clock diamonds") represent units of measurement corresponding to the ticks of an inertial observer's light clock. We show that many quantitative results can be read off a spacetime diagram simply by counting boxes, with very little algebra. In particular, we show that the squared interval between two events is equal to the signed area of the parallelogram on the grid (called the "causal diamond") with opposite vertices corresponding to those events. We use the Doppler effect—without explicit use of the Doppler formula—to motivate the method.

  1. Quantum walk search on Johnson graphs

    NASA Astrophysics Data System (ADS)

    Wong, Thomas G.

    2016-05-01

    The Johnson graph J(n,k) is defined by n symbols, where vertices are k-element subsets of the symbols, and vertices are adjacent if they differ in exactly one symbol. In particular, J(n,1) is the complete graph K n , and J(n,2) is the strongly regular triangular graph T n , both of which are known to support fast spatial search by continuous-time quantum walk. In this paper, we prove that J(n,3), which is the n-tetrahedral graph, also supports fast search. In the process, we show that a change of basis is needed for degenerate perturbation theory to accurately describe the dynamics. This method can also be applied to general Johnson graphs J(n,k) with fixed k.

  2. Three-algebra for supermembrane and two-algebra for superstring

    NASA Astrophysics Data System (ADS)

    Lee, Kanghoon; Park, Jeong-Hyuck

    2009-04-01

    While string or Yang-Mills theories are based on Lie algebra or two-algebra structure, recent studies indicate that Script M-theory may require a one higher, three-algebra structure. Here we construct a covariant action for a supermembrane in eleven dimensions, which is invariant under global supersymmetry, local fermionic symmetry and worldvolume diffeomorphism. Our action is classically on-shell equivalent to the celebrated Bergshoeff-Sezgin-Townsend action. However, the novelty is that we spell the action genuinely in terms of Nambu three-brackets: All the derivatives appear through Nambu brackets and hence it manifests the three-algebra structure. Further the double dimensional reduction of our action gives straightforwardly to a type IIA string action featuring two-algebra. Applying the same method, we also construct a covariant action for type IIB superstring, leading directly to the IKKT matrix model.

  3. Writing to Promote and Assess Conceptual Understanding in College Algebra

    ERIC Educational Resources Information Center

    Gay, A. Susan; Peterson, Ingrid

    2014-01-01

    Concept-focused quiz questions required College Algebra students to write about their understanding. The questions can be viewed in three broad categories: a focus on sense-making, a focus on describing a mathematical object such as a graph or an equation, and a focus on understanding vocabulary. Student responses from 10 classes were analyzed.…

  4. First Course in Algebra, Student's Text, Part II, Unit 10.

    ERIC Educational Resources Information Center

    Allen, Frank B.; And Others

    Unit 10 in the SMSG's secondary school mathematics series is a student text covering the following topics in Algebra I: factors and exponents, radicals, polynomial and rational expressions, truth sets of open sentences, graphs of open sentences in two variables, systems of equations and inequalities, quadratic polynomials, and functions. (DT)

  5. Pre-Algebra 2, Mathematics (Experimental): 5210.12.

    ERIC Educational Resources Information Center

    Strachan, Florence

    This is the second of four guidebooks on minimum content designed to strengthen fundamental concepts which are basic preparation for Algebra I. This booklet covers integers, rational and irrational numbers, real number properties and operations, graphing in one dimension, and open sentences. The overall course goals are stated, then, for each…

  6. Learning Activity Package, Algebra 124, LAPs 46-55.

    ERIC Educational Resources Information Center

    Holland, Bill

    A series of 10 teacher-prepared Learning Activity Packages (LAPs) in advanced algebra and trigonometry, these units cover absolute value, inequalities, exponents, radicals, and complex numbers; functions; higher degree equations and the derivative; the trigonometric functions; graphs and applications of the trigonometric functions; sequences and…

  7. Consensus dynamics on random rectangular graphs

    NASA Astrophysics Data System (ADS)

    Estrada, Ernesto; Sheerin, Matthew

    2016-06-01

    A random rectangular graph (RRG) is a generalization of the random geometric graph (RGG) in which the nodes are embedded into a rectangle with side lengths a and b = 1 / a, instead of on a unit square [ 0 , 1 ] 2. Two nodes are then connected if and only if they are separated at a Euclidean distance smaller than or equal to a certain threshold radius r. When a = 1 the RRG is identical to the RGG. Here we apply the consensus dynamics model to the RRG. Our main result is a lower bound for the time of consensus, i.e., the time at which the network reaches a global consensus state. To prove this result we need first to find an upper bound for the algebraic connectivity of the RRG, i.e., the second smallest eigenvalue of the combinatorial Laplacian of the graph. This bound is based on a tight lower bound found for the graph diameter. Our results prove that as the rectangle in which the nodes are embedded becomes more elongated, the RRG becomes a 'large-world', i.e., the diameter grows to infinity, and a poorly-connected graph, i.e., the algebraic connectivity decays to zero. The main consequence of these findings is the proof that the time of consensus in RRGs grows to infinity as the rectangle becomes more elongated. In closing, consensus dynamics in RRGs strongly depend on the geometric characteristics of the embedding space, and reaching the consensus state becomes more difficult as the rectangle is more elongated.

  8. Are Graphs Finally Surfacing?

    ERIC Educational Resources Information Center

    Beineke, Lowell W.

    1989-01-01

    Explored are various aspects of drawing graphs on surfaces. The Euler's formula, Kuratowski's theorem and the drawing of graphs in the plane with as few crossings as possible are discussed. Some applications including embedding of graphs and coloring of maps are included. (YP)

  9. Graph-Plotting Routine

    NASA Technical Reports Server (NTRS)

    Kantak, Anil V.

    1987-01-01

    Plotter routine for IBM PC (AKPLOT) designed for engineers and scientists who use graphs as integral parts of their documentation. Allows user to generate graph and edit its appearance on cathode-ray tube. Graph may undergo many interactive alterations before finally dumped from screen to be plotted by printer. Written in BASIC.

  10. Graphing Important People

    ERIC Educational Resources Information Center

    Reading Teacher, 2012

    2012-01-01

    The "Toolbox" column features content adapted from ReadWriteThink.org lesson plans and provides practical tools for classroom teachers. This issue's column features a lesson plan adapted from "Graphing Plot and Character in a Novel" by Lisa Storm Fink and "Bio-graph: Graphing Life Events" by Susan Spangler. Students retell biographic events…

  11. Graphing Inequalities, Connecting Meaning

    ERIC Educational Resources Information Center

    Switzer, J. Matt

    2014-01-01

    Students often have difficulty with graphing inequalities (see Filloy, Rojano, and Rubio 2002; Drijvers 2002), and J. Matt Switzer's students were no exception. Although students can produce graphs for simple inequalities, they often struggle when the format of the inequality is unfamiliar. Even when producing a correct graph of an…

  12. Twisted vertex algebras, bicharacter construction and boson-fermion correspondences

    SciTech Connect

    Anguelova, Iana I.

    2013-12-15

    The boson-fermion correspondences are an important phenomena on the intersection of several areas in mathematical physics: representation theory, vertex algebras and conformal field theory, integrable systems, number theory, cohomology. Two such correspondences are well known: the types A and B (and their super extensions). As a main result of this paper we present a new boson-fermion correspondence of type D-A. Further, we define a new concept of twisted vertex algebra of order N, which generalizes super vertex algebra. We develop the bicharacter construction which we use for constructing classes of examples of twisted vertex algebras, as well as for deriving formulas for the operator product expansions, analytic continuations, and normal ordered products. By using the underlying Hopf algebra structure we prove general bicharacter formulas for the vacuum expectation values for two important groups of examples. We show that the correspondences of types B, C, and D-A are isomorphisms of twisted vertex algebras.

  13. Learning Algebra in a Computer Algebra Environment

    ERIC Educational Resources Information Center

    Drijvers, Paul

    2004-01-01

    This article summarises a doctoral thesis entitled "Learning algebra in a computer algebra environment, design research on the understanding of the concept of parameter" (Drijvers, 2003). It describes the research questions, the theoretical framework, the methodology and the results of the study. The focus of the study is on the understanding of…

  14. Phase Boundaries in Algebraic Conformal QFT

    NASA Astrophysics Data System (ADS)

    Bischoff, Marcel; Kawahigashi, Yasuyuki; Longo, Roberto; Rehren, Karl-Henning

    2016-02-01

    We study the structure of local algebras in relativistic conformal quantum field theory with phase boundaries. Phase boundaries are instances of a more general notion of boundaries that give rise to a variety of algebraic structures. These can be formulated in a common framework originating in Algebraic QFT, with the principle of Einstein Causality playing a prominent role. We classify the phase boundary conditions by the centre of a certain universal construction, which produces a reducible representation in which all possible boundary conditions are realized. For a large class of models, the classification reproduces results obtained in a different approach by Fuchs et al. before.

  15. Realizations of Galilei algebras

    NASA Astrophysics Data System (ADS)

    Nesterenko, Maryna; Pošta, Severin; Vaneeva, Olena

    2016-03-01

    All inequivalent realizations of the Galilei algebras of dimensions not greater than five are constructed using the algebraic approach proposed by Shirokov. The varieties of the deformed Galilei algebras are discussed and families of one-parametric deformations are presented in explicit form. It is also shown that a number of well-known and physically interesting equations and systems are invariant with respect to the considered Galilei algebras or their deformations.

  16. Special issue on cluster algebras in mathematical physics

    NASA Astrophysics Data System (ADS)

    Di Francesco, Philippe; Gekhtman, Michael; Kuniba, Atsuo; Yamazaki, Masahito

    2014-02-01

    This is a call for contributions to a special issue of Journal of Physics A: Mathematical and Theoretical dedicated to cluster algebras in mathematical physics. Over the ten years since their introduction by Fomin and Zelevinsky, the theory of cluster algebras has witnessed a spectacular growth, first and foremost due to the many links that have been discovered with a wide range of subjects in mathematics and, increasingly, theoretical and mathematical physics. The main motivation of this special issue is to gather together reviews, recent developments and open problems, mainly from a mathematical physics viewpoint, into a single comprehensive issue. We expect that such a special issue will become a valuable reference for the broad scientific community working in mathematical and theoretical physics. The issue will consist of invited review articles and contributed papers containing new results on the interplays of cluster algebras with mathematical physics. Editorial policy The Guest Editors for this issue are Philippe Di Francesco, Michael Gekhtman, Atsuo Kuniba and Masahito Yamazaki. The areas and topics for this issue include, but are not limited to: discrete integrable systems arising from cluster mutations cluster structure on Poisson varieties cluster algebras and soliton interactions cluster positivity conjecture Y-systems in the thermodynamic Bethe ansatz and Zamolodchikov's periodicity conjecture T-system of transfer matrices of integrable lattice models dilogarithm identities in conformal field theory wall crossing in 4d N = 2 supersymmetric gauge theories 4d N = 1 quiver gauge theories described by networks scattering amplitudes of 4d N = 4 theories 3d N = 2 gauge theories described by flat connections on 3-manifolds integrability of dimer/Ising models on graphs. All contributions will be refereed and processed according to the usual procedure of the journal. Guidelines for preparation of contributions The deadline for contributed papers is 31 March

  17. Special issue on cluster algebras in mathematical physics

    NASA Astrophysics Data System (ADS)

    Di Francesco, Philippe; Gekhtman, Michael; Kuniba, Atsuo; Yamazaki, Masahito

    2013-10-01

    This is a call for contributions to a special issue of Journal of Physics A: Mathematical and Theoretical dedicated to cluster algebras in mathematical physics. Over the ten years since their introduction by Fomin and Zelevinsky, the theory of cluster algebras has witnessed a spectacular growth, first and foremost due to the many links that have been discovered with a wide range of subjects in mathematics and, increasingly, theoretical and mathematical physics. The main motivation of this special issue is to gather together reviews, recent developments and open problems, mainly from a mathematical physics viewpoint, into a single comprehensive issue. We expect that such a special issue will become a valuable reference for the broad scientific community working in mathematical and theoretical physics. The issue will consist of invited review articles and contributed papers containing new results on the interplays of cluster algebras with mathematical physics. Editorial policy The Guest Editors for this issue are Philippe Di Francesco, Michael Gekhtman, Atsuo Kuniba and Masahito Yamazaki. The areas and topics for this issue include, but are not limited to: discrete integrable systems arising from cluster mutations cluster structure on Poisson varieties cluster algebras and soliton interactions cluster positivity conjecture Y-systems in the thermodynamic Bethe ansatz and Zamolodchikov's periodicity conjecture T-system of transfer matrices of integrable lattice models dilogarithm identities in conformal field theory wall crossing in 4d N = 2 supersymmetric gauge theories 4d N = 1 quiver gauge theories described by networks scattering amplitudes of 4d N = 4 theories 3d N = 2 gauge theories described by flat connections on 3-manifolds integrability of dimer/Ising models on graphs. All contributions will be refereed and processed according to the usual procedure of the journal. Guidelines for preparation of contributions The deadline for contributed papers is 31 March

  18. Special issue on cluster algebras in mathematical physics

    NASA Astrophysics Data System (ADS)

    Di Francesco, Philippe; Gekhtman, Michael; Kuniba, Atsuo; Yamazaki, Masahito

    2013-12-01

    This is a call for contributions to a special issue of Journal of Physics A: Mathematical and Theoretical dedicated to cluster algebras in mathematical physics. Over the ten years since their introduction by Fomin and Zelevinsky, the theory of cluster algebras has witnessed a spectacular growth, first and foremost due to the many links that have been discovered with a wide range of subjects in mathematics and, increasingly, theoretical and mathematical physics. The main motivation of this special issue is to gather together reviews, recent developments and open problems, mainly from a mathematical physics viewpoint, into a single comprehensive issue. We expect that such a special issue will become a valuable reference for the broad scientific community working in mathematical and theoretical physics. The issue will consist of invited review articles and contributed papers containing new results on the interplays of cluster algebras with mathematical physics. Editorial policy The Guest Editors for this issue are Philippe Di Francesco, Michael Gekhtman, Atsuo Kuniba and Masahito Yamazaki. The areas and topics for this issue include, but are not limited to: discrete integrable systems arising from cluster mutations cluster structure on Poisson varieties cluster algebras and soliton interactions cluster positivity conjecture Y-systems in the thermodynamic Bethe ansatz and Zamolodchikov's periodicity conjecture T-system of transfer matrices of integrable lattice models dilogarithm identities in conformal field theory wall crossing in 4d N = 2 supersymmetric gauge theories 4d N = 1 quiver gauge theories described by networks scattering amplitudes of 4d N = 4 theories 3d N = 2 gauge theories described by flat connections on 3-manifolds integrability of dimer/Ising models on graphs. All contributions will be refereed and processed according to the usual procedure of the journal. Guidelines for preparation of contributions The deadline for contributed papers is 31 March

  19. Special issue on cluster algebras in mathematical physics

    NASA Astrophysics Data System (ADS)

    Di Francesco, Philippe; Gekhtman, Michael; Kuniba, Atsuo; Yamazaki, Masahito

    2013-11-01

    This is a call for contributions to a special issue of Journal of Physics A: Mathematical and Theoretical dedicated to cluster algebras in mathematical physics. Over the ten years since their introduction by Fomin and Zelevinsky, the theory of cluster algebras has witnessed a spectacular growth, first and foremost due to the many links that have been discovered with a wide range of subjects in mathematics and, increasingly, theoretical and mathematical physics. The main motivation of this special issue is to gather together reviews, recent developments and open problems, mainly from a mathematical physics viewpoint, into a single comprehensive issue. We expect that such a special issue will become a valuable reference for the broad scientific community working in mathematical and theoretical physics. The issue will consist of invited review articles and contributed papers containing new results on the interplays of cluster algebras with mathematical physics. Editorial policy The Guest Editors for this issue are Philippe Di Francesco, Michael Gekhtman, Atsuo Kuniba and Masahito Yamazaki. The areas and topics for this issue include, but are not limited to: discrete integrable systems arising from cluster mutations cluster structure on Poisson varieties cluster algebras and soliton interactions cluster positivity conjecture Y-systems in the thermodynamic Bethe ansatz and Zamolodchikov's periodicity conjecture T-system of transfer matrices of integrable lattice models dilogarithm identities in conformal field theory wall crossing in 4d N = 2 supersymmetric gauge theories 4d N = 1 quiver gauge theories described by networks scattering amplitudes of 4d N = 4 theories 3d N = 2 gauge theories described by flat connections on 3-manifolds integrability of dimer/Ising models on graphs. All contributions will be refereed and processed according to the usual procedure of the journal. Guidelines for preparation of contributions The deadline for contributed papers is 31 March

  20. Developing Thinking in Algebra

    ERIC Educational Resources Information Center

    Mason, John; Graham, Alan; Johnson-Wilder, Sue

    2005-01-01

    This book is for people with an interest in algebra whether as a learner, or as a teacher, or perhaps as both. It is concerned with the "big ideas" of algebra and what it is to understand the process of thinking algebraically. The book has been structured according to a number of pedagogic principles that are exposed and discussed along the way,…

  1. Connecting Arithmetic to Algebra

    ERIC Educational Resources Information Center

    Darley, Joy W.; Leapard, Barbara B.

    2010-01-01

    Algebraic thinking is a top priority in mathematics classrooms today. Because elementary school teachers lay the groundwork to develop students' capacity to think algebraically, it is crucial for teachers to have a conceptual understanding of the connections between arithmetic and algebra and be confident in communicating these connections. Many…

  2. Applied Algebra Curriculum Modules.

    ERIC Educational Resources Information Center

    Texas State Technical Coll., Marshall.

    This collection of 11 applied algebra curriculum modules can be used independently as supplemental modules for an existing algebra curriculum. They represent diverse curriculum styles that should stimulate the teacher's creativity to adapt them to other algebra concepts. The selected topics have been determined to be those most needed by students…

  3. Profiles of Algebraic Competence

    ERIC Educational Resources Information Center

    Humberstone, J.; Reeve, R.A.

    2008-01-01

    The algebraic competence of 72 12-year-old female students was examined to identify profiles of understanding reflecting different algebraic knowledge states. Beginning algebraic competence (mapping abilities: word-to-symbol and vice versa, classifying, and solving equations) was assessed. One week later, the nature of assistance required to map…

  4. Ternary Virasoro - Witt algebra.

    SciTech Connect

    Zachos, C.; Curtright, T.; Fairlie, D.; High Energy Physics; Univ. of Miami; Univ. of Durham

    2008-01-01

    A 3-bracket variant of the Virasoro-Witt algebra is constructed through the use of su(1,1) enveloping algebra techniques. The Leibniz rules for 3-brackets acting on other 3-brackets in the algebra are discussed and verified in various situations.

  5. Vague Congruences and Quotient Lattice Implication Algebras

    PubMed Central

    Qin, Xiaoyan; Xu, Yang

    2014-01-01

    The aim of this paper is to further develop the congruence theory on lattice implication algebras. Firstly, we introduce the notions of vague similarity relations based on vague relations and vague congruence relations. Secondly, the equivalent characterizations of vague congruence relations are investigated. Thirdly, the relation between the set of vague filters and the set of vague congruences is studied. Finally, we construct a new lattice implication algebra induced by a vague congruence, and the homomorphism theorem is given. PMID:25133207

  6. Methods of visualizing graphs

    DOEpatents

    Wong, Pak C.; Mackey, Patrick S.; Perrine, Kenneth A.; Foote, Harlan P.; Thomas, James J.

    2008-12-23

    Methods for visualizing a graph by automatically drawing elements of the graph as labels are disclosed. In one embodiment, the method comprises receiving node information and edge information from an input device and/or communication interface, constructing a graph layout based at least in part on that information, wherein the edges are automatically drawn as labels, and displaying the graph on a display device according to the graph layout. In some embodiments, the nodes are automatically drawn as labels instead of, or in addition to, the label-edges.

  7. Interacting particle systems on graphs

    NASA Astrophysics Data System (ADS)

    Sood, Vishal

    In this dissertation, the dynamics of socially or biologically interacting populations are investigated. The individual members of the population are treated as particles that interact via links on a social or biological network represented as a graph. The effect of the structure of the graph on the properties of the interacting particle system is studied using statistical physics techniques. In the first chapter, the central concepts of graph theory and social and biological networks are presented. Next, interacting particle systems that are drawn from physics, mathematics and biology are discussed in the second chapter. In the third chapter, the random walk on a graph is studied. The mean time for a random walk to traverse between two arbitrary sites of a random graph is evaluated. Using an effective medium approximation it is found that the mean first-passage time between pairs of sites, as well as all moments of this first-passage time, are insensitive to the density of links in the graph. The inverse of the mean-first passage time varies non-monotonically with the density of links near the percolation transition of the random graph. Much of the behavior can be understood by simple heuristic arguments. Evolutionary dynamics, by which mutants overspread an otherwise uniform population on heterogeneous graphs, are studied in the fourth chapter. Such a process underlies' epidemic propagation, emergence of fads, social cooperation or invasion of an ecological niche by a new species. The first part of this chapter is devoted to neutral dynamics, in which the mutant genotype does not have a selective advantage over the resident genotype. The time to extinction of one of the two genotypes is derived. In the second part of this chapter, selective advantage or fitness is introduced such that the mutant genotype has a higher birth rate or a lower death rate. This selective advantage leads to a dynamical competition in which selection dominates for large populations

  8. Hyperbolic graph generator

    NASA Astrophysics Data System (ADS)

    Aldecoa, Rodrigo; Orsini, Chiara; Krioukov, Dmitri

    2015-11-01

    Networks representing many complex systems in nature and society share some common structural properties like heterogeneous degree distributions and strong clustering. Recent research on network geometry has shown that those real networks can be adequately modeled as random geometric graphs in hyperbolic spaces. In this paper, we present a computer program to generate such graphs. Besides real-world-like networks, the program can generate random graphs from other well-known graph ensembles, such as the soft configuration model, random geometric graphs on a circle, or Erdős-Rényi random graphs. The simulations show a good match between the expected values of different network structural properties and the corresponding empirical values measured in generated graphs, confirming the accurate behavior of the program.

  9. Product of bipolar fuzzy graphs and their degree

    NASA Astrophysics Data System (ADS)

    Rashmanlou, Hossein; Samanta, Sovan; Pal, Madhumangal; Borzooei, Rajab Ali

    2016-01-01

    The concepts of graph theory are applied in many areas of computer science including data mining, image segmentation, clustering, image capturing and networking. It is also known that lots of uncertainties occur in these areas. To handle the uncertainty that occurs in graph theory, fuzzy graph theory is successfully used in many problems. A bipolar fuzzy set is a generalization of the fuzzy set. In this paper, two new operations on bipolar fuzzy graphs, viz. normal product and tensor product, are defined. Also, the degrees of the vertices of the resultant graphs which are obtained from two given bipolar fuzzy graphs ? and ? using the operations Cartesian product, composition, tensor and normal product are determined.

  10. FAST TRACK COMMUNICATION: Kac Moody algebras and controlled chaos

    NASA Astrophysics Data System (ADS)

    Wesley, Daniel H.

    2007-02-01

    Compactification can control chaotic Mixmaster behaviour in gravitational systems with p-form matter: we consider this in light of the connection between supergravity models and Kac Moody algebras. We show that different compactifications define 'mutations' of the algebras associated with the noncompact theories. We list the algebras obtained in this way, and find novel examples of wall systems determined by Lorentzian (but not hyperbolic) algebras. Cosmological models with a smooth pre-big bang phase require that chaos is absent: we show that compactification alone cannot eliminate chaos in the simplest compactifications of the heterotic string on a Calabi Yau, or M theory on a manifold of G2 holonomy.

  11. Computer algebra and operators

    NASA Technical Reports Server (NTRS)

    Fateman, Richard; Grossman, Robert

    1989-01-01

    The symbolic computation of operator expansions is discussed. Some of the capabilities that prove useful when performing computer algebra computations involving operators are considered. These capabilities may be broadly divided into three areas: the algebraic manipulation of expressions from the algebra generated by operators; the algebraic manipulation of the actions of the operators upon other mathematical objects; and the development of appropriate normal forms and simplification algorithms for operators and their actions. Brief descriptions are given of the computer algebra computations that arise when working with various operators and their actions.

  12. Lie algebras and linear differential equations.

    NASA Technical Reports Server (NTRS)

    Brockett, R. W.; Rahimi, A.

    1972-01-01

    Certain symmetry properties possessed by the solutions of linear differential equations are examined. For this purpose, some basic ideas from the theory of finite dimensional linear systems are used together with the work of Wei and Norman on the use of Lie algebraic methods in differential equation theory.

  13. Modules as Learning Tools in Linear Algebra

    ERIC Educational Resources Information Center

    Cooley, Laurel; Vidakovic, Draga; Martin, William O.; Dexter, Scott; Suzuki, Jeff; Loch, Sergio

    2014-01-01

    This paper reports on the experience of STEM and mathematics faculty at four different institutions working collaboratively to integrate learning theory with curriculum development in a core undergraduate linear algebra context. The faculty formed a Professional Learning Community (PLC) with a focus on learning theories in mathematics and…

  14. Two's company, three (or more) is a simplex : Algebraic-topological tools for understanding higher-order structure in neural data.

    PubMed

    Giusti, Chad; Ghrist, Robert; Bassett, Danielle S

    2016-08-01

    The language of graph theory, or network science, has proven to be an exceptional tool for addressing myriad problems in neuroscience. Yet, the use of networks is predicated on a critical simplifying assumption: that the quintessential unit of interest in a brain is a dyad - two nodes (neurons or brain regions) connected by an edge. While rarely mentioned, this fundamental assumption inherently limits the types of neural structure and function that graphs can be used to model. Here, we describe a generalization of graphs that overcomes these limitations, thereby offering a broad range of new possibilities in terms of modeling and measuring neural phenomena. Specifically, we explore the use of simplicial complexes: a structure developed in the field of mathematics known as algebraic topology, of increasing applicability to real data due to a rapidly growing computational toolset. We review the underlying mathematical formalism as well as the budding literature applying simplicial complexes to neural data, from electrophysiological recordings in animal models to hemodynamic fluctuations in humans. Based on the exceptional flexibility of the tools and recent ground-breaking insights into neural function, we posit that this framework has the potential to eclipse graph theory in unraveling the fundamental mysteries of cognition. PMID:27287487

  15. C-Graded vertex algebras and conformal flow

    SciTech Connect

    Laber, Rob; Mason, Geoffrey

    2014-01-15

    We consider C-graded vertex algebras, which are vertex algebras V with a C-grading such that V is an admissible V-module generated by “lowest weight vectors.” We show that such vertex algebras have a “good” representation theory in the sense that there is a Zhu algebra A(V) and a bijection between simple admissible V-modules and simple A(V)-modules. We also consider pseudo vertex operator algebras (PVOAs), which are C-graded vertex algebras with a conformal vector such that the homogeneous subspaces of V are generalized eigenspaces for L(0); essentially, these are VOAs that lack any semisimplicity or integrality assumptions on L(0). As a motivating example, we show that deformation of the conformal structure (conformal flow) of a strongly regular VOA (e.g., a lattice theory, or Wess-Zumino-Witten model) is a path in a space whose points are PVOAs.

  16. Evolutionary games on graphs

    NASA Astrophysics Data System (ADS)

    Szabó, György; Fáth, Gábor

    2007-07-01

    Game theory is one of the key paradigms behind many scientific disciplines from biology to behavioral sciences to economics. In its evolutionary form and especially when the interacting agents are linked in a specific social network the underlying solution concepts and methods are very similar to those applied in non-equilibrium statistical physics. This review gives a tutorial-type overview of the field for physicists. The first four sections introduce the necessary background in classical and evolutionary game theory from the basic definitions to the most important results. The fifth section surveys the topological complications implied by non-mean-field-type social network structures in general. The next three sections discuss in detail the dynamic behavior of three prominent classes of models: the Prisoner's Dilemma, the Rock-Scissors-Paper game, and Competing Associations. The major theme of the review is in what sense and how the graph structure of interactions can modify and enrich the picture of long term behavioral patterns emerging in evolutionary games.

  17. Approximate von Neumann entropy for directed graphs.

    PubMed

    Ye, Cheng; Wilson, Richard C; Comin, César H; Costa, Luciano da F; Hancock, Edwin R

    2014-05-01

    In this paper, we develop an entropy measure for assessing the structural complexity of directed graphs. Although there are many existing alternative measures for quantifying the structural properties of undirected graphs, there are relatively few corresponding measures for directed graphs. To fill this gap in the literature, we explore an alternative technique that is applicable to directed graphs. We commence by using Chung's generalization of the Laplacian of a directed graph to extend the computation of von Neumann entropy from undirected to directed graphs. We provide a simplified form of the entropy which can be expressed in terms of simple node in-degree and out-degree statistics. Moreover, we find approximate forms of the von Neumann entropy that apply to both weakly and strongly directed graphs, and that can be used to characterize network structure. We illustrate the usefulness of these simplified entropy forms defined in this paper on both artificial and real-world data sets, including structures from protein databases and high energy physics theory citation networks. PMID:25353841

  18. Object Discovery: Soft Attributed Graph Mining.

    PubMed

    Zhang, Quanshi; Song, Xuan; Shao, Xiaowei; Zhao, Huijing; Shibasaki, Ryosuke

    2016-03-01

    We categorize this research in terms of its contribution to both graph theory and computer vision. From the theoretical perspective, this study can be considered as the first attempt to formulate the idea of mining maximal frequent subgraphs in the challenging domain of messy visual data, and as a conceptual extension to the unsupervised learning of graph matching. We define a soft attributed pattern (SAP) to represent the common subgraph pattern among a set of attributed relational graphs (ARGs), considering both their structure and attributes. Regarding the differences between ARGs with fuzzy attributes and conventional labeled graphs, we propose a new mining strategy that directly extracts the SAP with the maximal graph size without applying node enumeration. Given an initial graph template and a number of ARGs, we develop an unsupervised method to modify the graph template into the maximal-size SAP. From a practical perspective, this research develops a general platform for learning the category model (i.e., the SAP) from cluttered visual data (i.e., the ARGs) without labeling "what is where," thereby opening the possibility for a series of applications in the era of big visual data. Experiments demonstrate the superior performance of the proposed method on RGB/RGB-D images and videos. PMID:27046496

  19. Algebraic independence properties related to certain infinite products

    NASA Astrophysics Data System (ADS)

    Tanaka, Taka-aki

    2011-09-01

    In this paper we establish algebraic independence of the values of a certain infinite product as well as its all successive derivatives at algebraic points other than its zeroes, using the fact that the logarithmic derivative of an infinite product gives a partial fraction expansion. Such an infinite product is generated by a linear recurrence. The method used for proving the algebraic independence is based on the theory of Mahler functions of several variables.

  20. Topologies on directed graphs

    NASA Technical Reports Server (NTRS)

    Lieberman, R. N.

    1972-01-01

    Given a directed graph, a natural topology is defined and relationships between standard topological properties and graph theoretical concepts are studied. In particular, the properties of connectivity and separatedness are investigated. A metric is introduced which is shown to be related to separatedness. The topological notions of continuity and homeomorphism. A class of maps is studied which preserve both graph and topological properties. Applications involving strong maps and contractions are also presented.

  1. Supersymmetric extension of Galilean conformal algebras

    SciTech Connect

    Bagchi, Arjun; Mandal, Ipsita

    2009-10-15

    The Galilean conformal algebra has recently been realized in the study of the nonrelativistic limit of the AdS/CFT conjecture. This was obtained by a systematic parametric group contraction of the parent relativistic conformal field theory. In this paper, we extend the analysis to include supersymmetry. We work at the level of the coordinates in superspace to construct the N=1 super-Galilean conformal algebra. One of the interesting outcomes of the analysis is that one is able to naturally extend the finite algebra to an infinite one. This looks structurally similar to the N=1 superconformal algebra in two dimensions, but is different. We also comment on the extension of our construction to cases of higher N.

  2. Semigroups And Computer Algebra In Discrete Structures

    NASA Astrophysics Data System (ADS)

    Bijev, G.

    2010-10-01

    Some concepts in semigroup theory are interpreted in discrete structures such as finite lattices, binary relations, and finite semilattices. An algebraic approach to the pseudoinverse generalization problem in Boolean vector spaces is used. By analogy with the linear spaces in the linear algebra semilattice homomorphisms, isomorphisms, projections on Boolean vector spaces are defined and some properties of them are investigated in detail. Maps, corresponding to them in the linear algebra, are connected with matrices and their pseudouinverse. Important properties of these maps, which are essential for solving linear systems, remain the same in the Boolean vector spaces. Stochastic experiments using the maps defined and computer algebra methods have been made for solving linear equations Ax = b. The Hamming distance between b and the projection p(b) = Ax of b is equal or close to the least possible one, if the system has no solutions.

  3. Graph Generator Survey

    SciTech Connect

    Lothian, Josh; Powers, Sarah S; Sullivan, Blair D; Baker, Matthew B; Schrock, Jonathan; Poole, Stephen W

    2013-12-01

    The benchmarking effort within the Extreme Scale Systems Center at Oak Ridge National Laboratory seeks to provide High Performance Computing benchmarks and test suites of interest to the DoD sponsor. The work described in this report is a part of the effort focusing on graph generation. A previously developed benchmark, SystemBurn, allowed the emulation of dierent application behavior profiles within a single framework. To complement this effort, similar capabilities are desired for graph-centric problems. This report examines existing synthetic graph generator implementations in preparation for further study on the properties of their generated synthetic graphs.

  4. mpiGraph

    2007-05-22

    MpiGraph consists of an MPI application called mpiGraph written in C to measure message bandwidth and an associated crunch_mpiGraph script written in Perl to process the application output into an HTMO report. The mpiGraph application is designed to inspect the health and scalability of a high-performance interconnect while under heavy load. This is useful to detect hardware and software problems in a system, such as slow nodes, links, switches, or contention in switch routing. Itmore » is also useful to characterize how interconnect performance changes with different settings or how one interconnect type compares to another.« less

  5. Coloring random graphs.

    PubMed

    Mulet, R; Pagnani, A; Weigt, M; Zecchina, R

    2002-12-23

    We study the graph coloring problem over random graphs of finite average connectivity c. Given a number q of available colors, we find that graphs with low connectivity admit almost always a proper coloring, whereas graphs with high connectivity are uncolorable. Depending on q, we find the precise value of the critical average connectivity c(q). Moreover, we show that below c(q) there exists a clustering phase c in [c(d),c(q)] in which ground states spontaneously divide into an exponential number of clusters and where the proliferation of metastable states is responsible for the onset of complexity in local search algorithms. PMID:12484862

  6. mpiGraph

    SciTech Connect

    Moody, Adam

    2007-05-22

    MpiGraph consists of an MPI application called mpiGraph written in C to measure message bandwidth and an associated crunch_mpiGraph script written in Perl to process the application output into an HTMO report. The mpiGraph application is designed to inspect the health and scalability of a high-performance interconnect while under heavy load. This is useful to detect hardware and software problems in a system, such as slow nodes, links, switches, or contention in switch routing. It is also useful to characterize how interconnect performance changes with different settings or how one interconnect type compares to another.

  7. A Richer Understanding of Algebra

    ERIC Educational Resources Information Center

    Foy, Michelle

    2008-01-01

    Algebra is one of those hard-to-teach topics where pupils seem to struggle to see it as more than a set of rules to learn, but this author recently used the software "Grid Algebra" from ATM, which engaged her Year 7 pupils in exploring algebraic concepts for themselves. "Grid Algebra" allows pupils to experience number, pre-algebra, and algebra…

  8. Algebraic analysis of the phase-calibration problem in the self-calibration procedures

    NASA Astrophysics Data System (ADS)

    Lannes, A.; Prieur, J.-L.

    2011-10-01

    This paper presents an analysis of the phase-calibration problem encountered in astronomy when mapping incoherent sources with aperture-synthesis devices. More precisely, this analysis concerns the phase-calibration operation involved in the self-calibration procedures of phase-closure imaging. The paper revisits and completes a previous analysis presented by Lannes in the Journal of the Optical Society of America A in 2005. It also benefits from some recent developments made for solving similar problems encountered in global navigation satellite systems. In radio-astronomy, the related optimization problems have been stated and solved hitherto at the phasor level. We present here an analysis conducted at the phase level, from which we derive a method for diagnosing and solving the difficulties of the phasor approach. In the most general case, the techniques to be implemented appeal to the algebraic graph theory and the algebraic number theory. The minima of the objective functionals to be minimized are identified by raising phase-closure integer ambiguities. We also show that in some configurations, to benefit from all the available information, closure phases of order greater than three are to be introduced. In summary, this study leads to a better understanding of the difficulties related to the very principle of phase-closure imaging. To circumvent these difficulties, we propose a strategy both simple and robust.

  9. Graphs, matrices, and the GraphBLAS: Seven good reasons

    SciTech Connect

    Kepner, Jeremy; Bader, David; Buluç, Aydın; Gilbert, John; Mattson, Timothy; Meyerhenke, Henning

    2015-01-01

    The analysis of graphs has become increasingly important to a wide range of applications. Graph analysis presents a number of unique challenges in the areas of (1) software complexity, (2) data complexity, (3) security, (4) mathematical complexity, (5) theoretical analysis, (6) serial performance, and (7) parallel performance. Implementing graph algorithms using matrix-based approaches provides a number of promising solutions to these challenges. The GraphBLAS standard (istcbigdata.org/GraphBlas) is being developed to bring the potential of matrix based graph algorithms to the broadest possible audience. The GraphBLAS mathematically defines a core set of matrix-based graph operations that can be used to implement a wide class of graph algorithms in a wide range of programming environments. This paper provides an introduction to the GraphBLAS and describes how the GraphBLAS can be used to address many of the challenges associated with analysis of graphs.

  10. Graphs, matrices, and the GraphBLAS: Seven good reasons

    DOE PAGESBeta

    Kepner, Jeremy; Bader, David; Buluç, Aydın; Gilbert, John; Mattson, Timothy; Meyerhenke, Henning

    2015-01-01

    The analysis of graphs has become increasingly important to a wide range of applications. Graph analysis presents a number of unique challenges in the areas of (1) software complexity, (2) data complexity, (3) security, (4) mathematical complexity, (5) theoretical analysis, (6) serial performance, and (7) parallel performance. Implementing graph algorithms using matrix-based approaches provides a number of promising solutions to these challenges. The GraphBLAS standard (istcbigdata.org/GraphBlas) is being developed to bring the potential of matrix based graph algorithms to the broadest possible audience. The GraphBLAS mathematically defines a core set of matrix-based graph operations that can be used to implementmore » a wide class of graph algorithms in a wide range of programming environments. This paper provides an introduction to the GraphBLAS and describes how the GraphBLAS can be used to address many of the challenges associated with analysis of graphs.« less

  11. Encoding the core electrons with graph concepts.

    PubMed

    Pogliani, Lionello

    2004-01-01

    The core electron problem of atoms in chemical graph studies has always been considered as a minor problem. Usually, chemical graphs had to encode just a small set of second row atoms, i.e., C, N, O, and F, thus, graph and, in some cases, pseudograph concepts were enough to "graph" encode the molecules at hand. Molecular connectivity theory, together with its side-branch the electrotopological state, introduced two "ad hoc" algorithms for the core electrons of higher-row atoms based, mainly, on quantum concepts alike. Recently, complete graphs, and, especially, odd complete graphs have been introduced to encode the core electrons of higher-row atoms. By the aid of these types of graphs a double-valued algorithm has been proposed for the valence delta, deltav, of any type of atoms of the periodic table with a principal quantum number n > or =2. The new algorithm is centered on an invariant suggested by the hand-shaking theorem, and the values it gives rise to parallel in some way the values derived by the aid of the two old "quantum" algorithms. A thorough comparative analysis of the newly proposed algorithms has been undertaken for atoms of the group 1A-7A of the periodic table. This comparative study includes the electronegativity, the size of the atoms, the first ionization energy, and the electron affinity. The given algorithm has also been tested with sequential complete graphs, while the even complete graphs give rise to conceptual difficulties. QSAR/QSPR studies do not show a clear-cut preference for any of the two values the algorithm gives rise to, even if recent results seem to prefer one of the two values. PMID:14741009

  12. Hyperspectral image segmentation using spatial-spectral graphs

    NASA Astrophysics Data System (ADS)

    Gillis, David B.; Bowles, Jeffrey H.

    2012-06-01

    Spectral graph theory has proven to be a useful tool in the analysis of high-dimensional data sets. Recall that, mathematically, a graph is a collection of objects (nodes) and connections between them (edges); a weighted graph additionally assigns numerical values (weights) to the edges. Graphs are represented by their adjacency whose elements are the weights between the nodes. Spectral graph theory uses the eigendecomposition of the adjacency matrix (or, more generally, the Laplacian of the graph) to derive information about the underlying graph. In this paper, we develop a spectral method based on the 'normalized cuts' algorithm to segment hyperspectral image data (HSI). In particular, we model an image as a weighted graph whose nodes are the image pixels, and edges defined as connecting spatial neighbors; the edge weights are given by a weighted combination of the spatial and spectral distances between nodes. We then use the Laplacian of the graph to recursively segment the image. The advantages of our approach are that, first, the graph structure naturally incorporates both the spatial and spectral information present in HSI; also, by using only spatial neighbors, the adjacency matrix is highly sparse; as a result, it is possible to apply our technique to much larger images than previous techniques. In the paper, we present the details of our algorithm, and include experimental results from a variety of hyperspectral images.

  13. Efficient Sampling Set Selection for Bandlimited Graph Signals Using Graph Spectral Proxies

    NASA Astrophysics Data System (ADS)

    Anis, Aamir; Gadde, Akshay; Ortega, Antonio

    2016-07-01

    We study the problem of selecting the best sampling set for bandlimited reconstruction of signals on graphs. A frequency domain representation for graph signals can be defined using the eigenvectors and eigenvalues of variation operators that take into account the underlying graph connectivity. Smoothly varying signals defined on the nodes are of particular interest in various applications, and tend to be approximately bandlimited in the frequency basis. Sampling theory for graph signals deals with the problem of choosing the best subset of nodes for reconstructing a bandlimited signal from its samples. Most approaches to this problem require a computation of the frequency basis (i.e., the eigenvectors of the variation operator), followed by a search procedure using the basis elements. This can be impractical, in terms of storage and time complexity, for real datasets involving very large graphs. We circumvent this issue in our formulation by introducing quantities called graph spectral proxies, defined using the powers of the variation operator, in order to approximate the spectral content of graph signals. This allows us to formulate a direct sampling set selection approach that does not require the computation and storage of the basis elements. We show that our approach also provides stable reconstruction when the samples are noisy or when the original signal is only approximately bandlimited. Furthermore, the proposed approach is valid for any choice of the variation operator, thereby covering a wide range of graphs and applications. We demonstrate its effectiveness through various numerical experiments.

  14. Connecting Algebra and Chemistry.

    ERIC Educational Resources Information Center

    O'Connor, Sean

    2003-01-01

    Correlates high school chemistry curriculum with high school algebra curriculum and makes the case for an integrated approach to mathematics and science instruction. Focuses on process integration. (DDR)

  15. The kinematic algebra from the self-dual sector

    NASA Astrophysics Data System (ADS)

    Monteiro, Ricardo; O'Connell, Donal

    2011-07-01

    We identify a diffeomorphism Lie algebra in the self-dual sector of Yang-Mills theory, and show that it determines the kinematic numerators of tree-level MHV amplitudes in the full theory. These amplitudes can be computed off-shell from Feynman diagrams with only cubic vertices, which are dressed with the structure constants of both the Yang-Mills colour algebra and the diffeomorphism algebra. Therefore, the latter algebra is the dual of the colour algebra, in the sense suggested by the work of Bern, Carrasco and Johansson. We further study perturbative gravity, both in the self-dual and in the MHV sectors, finding that the kinematic numerators of the theory are the BCJ squares of the Yang-Mills numerators.

  16. Making "Photo" Graphs

    ERIC Educational Resources Information Center

    Doto, Julianne; Golbeck, Susan

    2007-01-01

    Collecting data and analyzing the results of experiments is difficult for children. The authors found a surprising way to help their third graders make graphs and draw conclusions from their data: digital photographs. The pictures bridged the gap between an abstract graph and the plants it represented. With the support of the photos, students…

  17. Reflections on "The Graph"

    ERIC Educational Resources Information Center

    Petrosino, Anthony

    2012-01-01

    This article responds to arguments by Skidmore and Thompson (this issue of "Educational Researcher") that a graph published more than 10 years ago was erroneously reproduced and "gratuitously damaged" perceptions of the quality of education research. After describing the purpose of the original graph, the author counters assertions that the graph…

  18. Exploring Graphs: WYSIWYG.

    ERIC Educational Resources Information Center

    Johnson, Millie

    1997-01-01

    Graphs from media sources and questions developed from them can be used in the middle school mathematics classroom. Graphs depict storage temperature on a milk carton; air pressure measurements on a package of shock absorbers; sleep-wake patterns of an infant; a dog's breathing patterns; and the angle, velocity, and radius of a leaning bicyclist…

  19. Walking Out Graphs

    ERIC Educational Resources Information Center

    Shen, Ji

    2009-01-01

    In the Walking Out Graphs Lesson described here, students experience several types of representations used to describe motion, including words, sentences, equations, graphs, data tables, and actions. The most important theme of this lesson is that students have to understand the consistency among these representations and form the habit of…

  20. Real World Graph Connectivity

    ERIC Educational Resources Information Center

    Lind, Joy; Narayan, Darren

    2009-01-01

    We present the topic of graph connectivity along with a famous theorem of Menger in the real-world setting of the national computer network infrastructure of "National LambdaRail". We include a set of exercises where students reinforce their understanding of graph connectivity by analysing the "National LambdaRail" network. Finally, we give…

  1. ACTIVITIES: Graphs and Games

    ERIC Educational Resources Information Center

    Hirsch, Christian R.

    1975-01-01

    Using a set of worksheets, students will discover and apply Euler's formula regarding connected planar graphs and play and analyze the game of Sprouts. One sheet leads to the discovery of Euler's formula; another concerns traversability of a graph; another gives an example and a game involving these ideas. (Author/KM)

  2. Linear Algebra Revisited: An Attempt to Understand Students' Conceptual Difficulties

    ERIC Educational Resources Information Center

    Britton, Sandra; Henderson, Jenny

    2009-01-01

    This article looks at some of the conceptual difficulties that students have in a linear algebra course. An overview of previous research in this area is given, and the various theories that have been espoused regarding the reasons that students find linear algebra so difficult are discussed. Student responses to two questions testing the ability…

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

  4. Let's Do It: Making Graphs.

    ERIC Educational Resources Information Center

    Shaw, Jean M.

    1984-01-01

    Reasons for having students make graphs are noted. Then specific graphing topics and materials appropriate for young learners are presented, including life-sized, floor, clothespin, felt-face, block, and magnetic graphs, and polls of pupils. (MNS)

  5. Extended conformal field theories

    NASA Astrophysics Data System (ADS)

    Taormina, Anne

    1990-08-01

    Some extended conformal field theories are briefly reviewed. They illustrate how non minimal models of the Virasoro algebra (c≥1) can become minimal with respect to a larger algebra. The accent is put on N-extended superconformal algebras, which are relevant in superstring compactification.

  6. Utilization of the Graphing Calculator in Student Experiment

    NASA Astrophysics Data System (ADS)

    Kawatani, Ryoji; Takada, Naoto

    Magnetic levitation system is one of the most familiar experimental system in the field of control engineering because it is easy to understand its phenomenon, its differential equation is so simple, it is an unstable system and so on. To synthesize a controller which makes it stable based on the modern control theory and simulate the controlled system, a personal computer has been in common use. In this paper, we propose a new aided system utilizing the graphing calculator Voyage200 instead of the personal computer. Voyage200 is of handheld size and has high portability. Furthermore, it has high performance such that it can do computer algebra and draw the results of simulation and/or experiment on the large display. Since the second semester in 2005, we have been adopting Voyage200 for our student experiment. In this paper, we introduce our experimental system and describe the educational effects of Voyage200 by means of answers of questionnaires to students after experiment.

  7. Infinitesimal deformations of filiform Lie algebras of order 3

    NASA Astrophysics Data System (ADS)

    Navarro, R. M.

    2015-12-01

    The Lie algebras of order F have important applications for the fractional supersymmetry, and on the other hand the filiform Lie (super)algebras have very important properties into the Lie Theory. Thus, the aim of this work is to study filiform Lie algebras of order F which were introduced in Navarro (2014). In this work we obtain new families of filiform Lie algebras of order 3, in which the complexity of the problem rises considerably respecting to the cases considered in Navarro (2014).

  8. Neural Population Dynamics Modeled by Mean-Field Graphs

    NASA Astrophysics Data System (ADS)

    Kozma, Robert; Puljic, Marko

    2011-09-01

    In this work we apply random graph theory approach to describe neural population dynamics. There are important advantages of using random graph theory approach in addition to ordinary and partial differential equations. The mathematical theory of large-scale random graphs provides an efficient tool to describe transitions between high- and low-dimensional spaces. Recent advances in studying neural correlates of higher cognition indicate the significance of sudden changes in space-time neurodynamics, which can be efficiently described as phase transitions in the neuropil medium. Phase transitions are rigorously defined mathematically on random graph sequences and they can be naturally generalized to a class of percolation processes called neuropercolation. In this work we employ mean-field graphs with given vertex degree distribution and edge strength distribution. We demonstrate the emergence of collective oscillations in the style of brains.

  9. An algebra of discrete event processes

    NASA Technical Reports Server (NTRS)

    Heymann, Michael; Meyer, George

    1991-01-01

    This report deals with an algebraic framework for modeling and control of discrete event processes. The report consists of two parts. The first part is introductory, and consists of a tutorial survey of the theory of concurrency in the spirit of Hoare's CSP, and an examination of the suitability of such an algebraic framework for dealing with various aspects of discrete event control. To this end a new concurrency operator is introduced and it is shown how the resulting framework can be applied. It is further shown that a suitable theory that deals with the new concurrency operator must be developed. In the second part of the report the formal algebra of discrete event control is developed. At the present time the second part of the report is still an incomplete and occasionally tentative working paper.

  10. The algebra of Grassmann canonical anticommutation relations and its applications to fermionic systems

    SciTech Connect

    Keyl, Michael; Schlingemann, Dirk-M.

    2010-02-15

    We present an approach to a noncommutativelike phase space which allows to analyze quasifree states on the algebra of canonical anti-commutation relations (CAR) in analogy to quasifree states on the algebra of canonical commutation relations (CCR). The used mathematical tools are based on a new algebraic structure the 'Grassmann algebra of canonical anticommutation relations' (GAR algebra) which is given by the twisted tensor product of a Grassmann and a CAR algebra. As a new application, the corresponding theory provides an elegant tool for calculating the fidelity of two quasifree fermionic states which is needed for the study of entanglement distillation within fermionic systems.

  11. Teaching Structure in Algebra

    ERIC Educational Resources Information Center

    Merlin, Ethan M.

    2013-01-01

    This article describes how the author has developed tasks for students that address the missed "essence of the matter" of algebraic transformations. Specifically, he has found that having students practice "perceiving" algebraic structure--by naming the "glue" in the expressions, drawing expressions using…

  12. Ready, Set, Algebra?

    ERIC Educational Resources Information Center

    Levy, Alissa Beth

    2012-01-01

    The California Department of Education (CDE) has long asserted that success Algebra I by Grade 8 is the goal for all California public school students. In fact, the state's accountability system penalizes schools that do not require all of their students to take the Algebra I end-of-course examination by Grade 8 (CDE, 2009). In this…

  13. Linear-Algebra Programs

    NASA Technical Reports Server (NTRS)

    Lawson, C. L.; Krogh, F. T.; Gold, S. S.; Kincaid, D. R.; Sullivan, J.; Williams, E.; Hanson, R. J.; Haskell, K.; Dongarra, J.; Moler, C. B.

    1982-01-01

    The Basic Linear Algebra Subprograms (BLAS) library is a collection of 38 FORTRAN-callable routines for performing basic operations of numerical linear algebra. BLAS library is portable and efficient source of basic operations for designers of programs involving linear algebriac computations. BLAS library is supplied in portable FORTRAN and Assembler code versions for IBM 370, UNIVAC 1100 and CDC 6000 series computers.

  14. Catching Up on Algebra

    ERIC Educational Resources Information Center

    Cavanagh, Sean

    2008-01-01

    A popular humorist and avowed mathphobe once declared that in real life, there's no such thing as algebra. Kathie Wilson knows better. Most of the students in her 8th grade class will be thrust into algebra, the definitive course that heralds the beginning of high school mathematics, next school year. The problem: Many of them are about three…

  15. Thinking Graphically: Connecting Vision and Cognition during Graph Comprehension

    ERIC Educational Resources Information Center

    Ratwani, Raj M.; Trafton, J. Gregory; Boehm-Davis, Deborah A.

    2008-01-01

    Task analytic theories of graph comprehension account for the perceptual and conceptual processes required to extract specific information from graphs. Comparatively, the processes underlying information integration have received less attention. We propose a new framework for information integration that highlights visual integration and cognitive…

  16. Graph representation of protein free energy landscape

    SciTech Connect

    Li, Minghai; Duan, Mojie; Fan, Jue; Huo, Shuanghong; Han, Li

    2013-11-14

    The thermodynamics and kinetics of protein folding and protein conformational changes are governed by the underlying free energy landscape. However, the multidimensional nature of the free energy landscape makes it difficult to describe. We propose to use a weighted-graph approach to depict the free energy landscape with the nodes on the graph representing the conformational states and the edge weights reflecting the free energy barriers between the states. Our graph is constructed from a molecular dynamics trajectory and does not involve projecting the multi-dimensional free energy landscape onto a low-dimensional space defined by a few order parameters. The calculation of free energy barriers was based on transition-path theory using the MSMBuilder2 package. We compare our graph with the widely used transition disconnectivity graph (TRDG) which is constructed from the same trajectory and show that our approach gives more accurate description of the free energy landscape than the TRDG approach even though the latter can be organized into a simple tree representation. The weighted-graph is a general approach and can be used on any complex system.

  17. Quasiperiodic Graphs: Structural Design, Scaling and Entropic Properties

    NASA Astrophysics Data System (ADS)

    Luque, B.; Ballesteros, F. J.; Núñez, A. M.; Robledo, A.

    2013-04-01

    A novel class of graphs, here named quasiperiodic, are constructed via application of the Horizontal Visibility algorithm to the time series generated along the quasiperiodic route to chaos. We show how the hierarchy of mode-locked regions represented by the Farey tree is inherited by their associated graphs. We are able to establish, via Renormalization Group (RG) theory, the architecture of the quasiperiodic graphs produced by irrational winding numbers with pure periodic continued fraction. Finally, we demonstrate that the RG fixed-point degree distributions are recovered via optimization of a suitably defined graph entropy.

  18. The Effect of Using Graphing Calculators in Complex Function Graphs

    ERIC Educational Resources Information Center

    Ocak, Mehmet Akif

    2008-01-01

    This study investigates the role of graphing calculators in multiple representations for knowledge transfer and the omission of oversimplification in complex function graphs. The main aim is to examine whether graphing calculators were used efficiently to see different cases and multiple perspectives among complex function graphs, or whether…

  19. Horizontal visibility graphs generated by type-I intermittency

    NASA Astrophysics Data System (ADS)

    Núñez, Ángel M.; Luque, Bartolo; Lacasa, Lucas; Gómez, Jose Patricio; Robledo, Alberto

    2013-05-01

    The type-I intermittency route to (or out of) chaos is investigated within the horizontal visibility (HV) graph theory. For that purpose, we address the trajectories generated by unimodal maps close to an inverse tangent bifurcation and construct their associated HV graphs. We show how the alternation of laminar episodes and chaotic bursts imprints a fingerprint in the resulting graph structure. Accordingly, we derive a phenomenological theory that predicts quantitative values for several network parameters. In particular, we predict that the characteristic power-law scaling of the mean length of laminar trend sizes is fully inherited by the variance of the graph degree distribution, in good agreement with the numerics. We also report numerical evidence on how the characteristic power-law scaling of the Lyapunov exponent as a function of the distance to the tangent bifurcation is inherited in the graph by an analogous scaling of block entropy functionals defined on the graph. Furthermore, we are able to recast the full set of HV graphs generated by intermittent dynamics into a renormalization-group framework, where the fixed points of its graph-theoretical renormalization-group flow account for the different types of dynamics. We also establish that the nontrivial fixed point of this flow coincides with the tangency condition and that the corresponding invariant graph exhibits extremal entropic properties.

  20. Horizontal visibility graphs generated by type-I intermittency.

    PubMed

    Núñez, Ángel M; Luque, Bartolo; Lacasa, Lucas; Gómez, Jose Patricio; Robledo, Alberto

    2013-05-01

    The type-I intermittency route to (or out of) chaos is investigated within the horizontal visibility (HV) graph theory. For that purpose, we address the trajectories generated by unimodal maps close to an inverse tangent bifurcation and construct their associated HV graphs. We show how the alternation of laminar episodes and chaotic bursts imprints a fingerprint in the resulting graph structure. Accordingly, we derive a phenomenological theory that predicts quantitative values for several network parameters. In particular, we predict that the characteristic power-law scaling of the mean length of laminar trend sizes is fully inherited by the variance of the graph degree distribution, in good agreement with the numerics. We also report numerical evidence on how the characteristic power-law scaling of the Lyapunov exponent as a function of the distance to the tangent bifurcation is inherited in the graph by an analogous scaling of block entropy functionals defined on the graph. Furthermore, we are able to recast the full set of HV graphs generated by intermittent dynamics into a renormalization-group framework, where the fixed points of its graph-theoretical renormalization-group flow account for the different types of dynamics. We also establish that the nontrivial fixed point of this flow coincides with the tangency condition and that the corresponding invariant graph exhibits extremal entropic properties. PMID:23767578

  1. Learning Activity Package, Pre-Algebra.

    ERIC Educational Resources Information Center

    Evans, Diane

    A set of ten teacher-prepared Learning Activity Packages (LAPs) for individualized instruction in topics in pre-algebra, the units cover the decimal numeration system; number theory; fractions and decimals; ratio, proportion, and percent; sets; properties of operations; rational numbers; real numbers; open expressions; and open rational…

  2. Using Group Explorer in Teaching Abstract Algebra

    ERIC Educational Resources Information Center

    Schubert, Claus; Gfeller, Mary; Donohue, Christopher

    2013-01-01

    This study explores the use of Group Explorer in an undergraduate mathematics course in abstract algebra. The visual nature of Group Explorer in representing concepts in group theory is an attractive incentive to use this software in the classroom. However, little is known about students' perceptions on this technology in learning concepts in…

  3. The geometric semantics of algebraic quantum mechanics.

    PubMed

    Cruz Morales, John Alexander; Zilber, Boris

    2015-08-01

    In this paper, we will present an ongoing project that aims to use model theory as a suitable mathematical setting for studying the formalism of quantum mechanics. We argue that this approach provides a geometric semantics for such a formalism by means of establishing a (non-commutative) duality between certain algebraic and geometric objects. PMID:26124252

  4. Using geometric algebra to study optical aberrations

    SciTech Connect

    Hanlon, J.; Ziock, H.

    1997-05-01

    This paper uses Geometric Algebra (GA) to study vector aberrations in optical systems with square and round pupils. GA is a new way to produce the classical optical aberration spot diagrams on the Gaussian image plane and surfaces near the Gaussian image plane. Spot diagrams of the third, fifth and seventh order aberrations for square and round pupils are developed to illustrate the theory.

  5. A Short Sheffer axiom for Boolean algebra.

    SciTech Connect

    Veroff, R.; McCune, W.

    2000-06-30

    A short Sheffer stroke identity is shown to be a single axiom for Boolean algebra. The axiom has length 15 and 3 variables. The proof shows that it is equivalent to Sheffer's original 3-basis for the theory. Automated deduction techniques were used to find the proof. The shortest single axiom previously known to us has length 105 and 6 variables.

  6. Short single axioms for boolean algebra.

    SciTech Connect

    McCune, W.; Veroff, R.; Fitelson, B.; Harris, K.; Feist, A.; Wos, L.; Mathematics and Computer Science; Univ. of New Mexico; Univ. of Wisconsin at Madison; Duke Univ.

    2002-01-01

    We present short single equational axioms for Boolean algebra in terms of disjunction and negation and in terms of the Sheffer stroke. Previously known single axioms for these theories are much longer than the ones we present. We show that there is no shorter axiom in terms of the Sheffer stroke. Automated deduction techniques were used in several parts of the work.

  7. An Application of Boolean Algebra to Biology

    ERIC Educational Resources Information Center

    McConnell, John W.

    1971-01-01

    Examines the model of interacting nerve systems based on a switching theory, which uses a mathematical structure familiar to many high school students and requires little knowledge of biology. Reviews the basic operation of nerves, and demonstrates how Boolean algebraic statements are applied to synaptic interactions. (PR)

  8. Reasoning about nondeterministic and concurrent actions: A process algebra approach

    SciTech Connect

    De Giacomo, G.; Chen, Xiao Jun

    1996-12-31

    In this paper, we study reasoning about actions following a model checking approach in contrast to the usual validity checking one. Specifically, we model a dynamic system as a transition graph which represents all the possible system evolutions in terms of state changes caused by actions. Such a transition graph is defined by means of a suitable process algebra associated with an explicit global store. To reason about system properties we introduce an extension of modal {mu}-calculus. This setting, although directly applicable only when complete information on the system is available, has several interesting features for reasoning about actions. On one hand, it inherits from the vast literature on process algebras tools for dealing with complex systems, treating suitably important aspects like parallelism, communications, interruptions, coordinations among agents. On the other hand, reasoning by model checking is typically much easier than more general logical services such as validity checking.

  9. Quantitative Literacy: Working with Log Graphs

    NASA Astrophysics Data System (ADS)

    Shawl, S.

    2013-04-01

    The need for working with and understanding different types of graphs is a common occurrence in everyday life. Examples include anything having to do investments, being an educated juror in a case that involves evidence presented graphically, and understanding many aspect of our current political discourse. Within a science class graphs play a crucial role in presenting and interpreting data. In astronomy, where the range of graphed values is many orders of magnitude, log-axes must be used and understood. Experience shows that students do not understand how to read and interpret log-axes or how they differ from linear. Alters (1996), in a study of college students in an algebra-based physics class, found little understanding of log plotting. The purpose of this poster is to show the method and progression I have developed for use in my “ASTRO 101” class, with the goal being to help students better understand the H-R diagram, mass-luminosity relationship, and digital spectra.

  10. The algebra of diffeomorphisms from the world sheet

    NASA Astrophysics Data System (ADS)

    Schulgin, Waldemar; Troost, Jan

    2014-09-01

    The quantum theory of a massless spin two particle is strongly constrained by diffeomorphism invariance, which is in turn implied by unitarity. We explicitly exhibit the space-time diffeomorphism algebra of string theory, realizing it in terms of world sheet vertex operators. Viewing diffeomorphisms as field redefinitions in the two-dimensional conformal field theory renders the calculation of their algebra straightforward. Next, we generalize the analysis to combinations of space-time anti-symmetric tensor gauge transformations and diffeomorphisms. We also point out a left-right split of the algebra combined with a twist that reproduces the C-bracket of double field theory. We further compare our derivation to an analysis in terms of marginal deformations as well as vertex operator algebras.

  11. Leibniz algebras associated with representations of filiform Lie algebras

    NASA Astrophysics Data System (ADS)

    Ayupov, Sh. A.; Camacho, L. M.; Khudoyberdiyev, A. Kh.; Omirov, B. A.

    2015-12-01

    In this paper we investigate Leibniz algebras whose quotient Lie algebra is a naturally graded filiform Lie algebra nn,1. We introduce a Fock module for the algebra nn,1 and provide classification of Leibniz algebras L whose corresponding Lie algebra L / I is the algebra nn,1 with condition that the ideal I is a Fock nn,1-module, where I is the ideal generated by squares of elements from L. We also consider Leibniz algebras with corresponding Lie algebra nn,1 and such that the action I ×nn,1 → I gives rise to a minimal faithful representation of nn,1. The classification up to isomorphism of such Leibniz algebras is given for the case of n = 4.

  12. Change in brain network topology as a function of treatment response in schizophrenia: a longitudinal resting-state fMRI study using graph theory

    PubMed Central

    Hadley, Jennifer Ann; Kraguljac, Nina Vanessa; White, David Matthew; Ver Hoef, Lawrence; Tabora, Janell; Lahti, Adrienne Carol

    2016-01-01

    A number of neuroimaging studies have provided evidence in support of the hypothesis that faulty interactions between spatially disparate brain regions underlie the pathophysiology of schizophrenia, but it remains unclear to what degree antipsychotic medications affect these. We hypothesized that the balance between functional integration and segregation of brain networks is impaired in unmedicated patients with schizophrenia, but that it can be partially restored by antipsychotic medications. We included 32 unmedicated patients with schizophrenia (SZ) and 32 matched healthy controls (HC) in this study. We obtained resting-state scans while unmedicated, and again after 6 weeks of treatment with risperidone to assess functional integration and functional segregation of brain networks using graph theoretical measures. Compared with HC, unmedicated SZ showed reduced global efficiency and increased clustering coefficients. This pattern of aberrant functional network integration and segregation was modulated with antipsychotic medications, but only in those who responded to treatment. Our work lends support to the concept of schizophrenia as a dysconnectivity syndrome, and suggests that faulty brain network topology in schizophrenia is modulated by antipsychotic medication as a function of treatment response. PMID:27336056

  13. Change in brain network topology as a function of treatment response in schizophrenia: a longitudinal resting-state fMRI study using graph theory.

    PubMed

    Hadley, Jennifer Ann; Kraguljac, Nina Vanessa; White, David Matthew; Ver Hoef, Lawrence; Tabora, Janell; Lahti, Adrienne Carol

    2016-01-01

    A number of neuroimaging studies have provided evidence in support of the hypothesis that faulty interactions between spatially disparate brain regions underlie the pathophysiology of schizophrenia, but it remains unclear to what degree antipsychotic medications affect these. We hypothesized that the balance between functional integration and segregation of brain networks is impaired in unmedicated patients with schizophrenia, but that it can be partially restored by antipsychotic medications. We included 32 unmedicated patients with schizophrenia (SZ) and 32 matched healthy controls (HC) in this study. We obtained resting-state scans while unmedicated, and again after 6 weeks of treatment with risperidone to assess functional integration and functional segregation of brain networks using graph theoretical measures. Compared with HC, unmedicated SZ showed reduced global efficiency and increased clustering coefficients. This pattern of aberrant functional network integration and segregation was modulated with antipsychotic medications, but only in those who responded to treatment. Our work lends support to the concept of schizophrenia as a dysconnectivity syndrome, and suggests that faulty brain network topology in schizophrenia is modulated by antipsychotic medication as a function of treatment response. PMID:27336056

  14. A study on vague graphs.

    PubMed

    Rashmanlou, Hossein; Samanta, Sovan; Pal, Madhumangal; Borzooei, R A

    2016-01-01

    The main purpose of this paper is to introduce the notion of vague h-morphism on vague graphs and regular vague graphs. The action of vague h-morphism on vague strong regular graphs are studied. Some elegant results on weak and co weak isomorphism are derived. Also, [Formula: see text]-complement of highly irregular vague graphs are defined. PMID:27536517

  15. A Semantic Graph Query Language

    SciTech Connect

    Kaplan, I L

    2006-10-16

    Semantic graphs can be used to organize large amounts of information from a number of sources into one unified structure. A semantic query language provides a foundation for extracting information from the semantic graph. The graph query language described here provides a simple, powerful method for querying semantic graphs.

  16. Coreflections in Algebraic Quantum Logic

    NASA Astrophysics Data System (ADS)

    Jacobs, Bart; Mandemaker, Jorik

    2012-07-01

    Various generalizations of Boolean algebras are being studied in algebraic quantum logic, including orthomodular lattices, orthomodular po-sets, orthoalgebras and effect algebras. This paper contains a systematic study of the structure in and between categories of such algebras. It does so via a combination of totalization (of partially defined operations) and transfer of structure via coreflections.

  17. Confluences of the Painlevé equations, Cherednik algebras and q-Askey scheme

    NASA Astrophysics Data System (ADS)

    Mazzocco, Marta

    2016-09-01

    In this paper we produce seven new algebras as confluences of the Cherednik algebra of type \\check {{{{C}1}}} {{C}1} and we characterise their spherical-sub-algebras. The limit of the spherical sub-algebra of the Cherednik algebra of type \\check {{{{C}1}}} {{C}1} is the monodromy manifold of the Painlevé VI equation (Oblomkov 2004 Int. Math. Res. Not. 2004 877–912). Here we prove that by considering the limits of the spherical sub-algebras of our new confluent algebras, one obtains the monodromy manifolds of all other Painlevé differential equations. Moreover, we introduce confluent versions of the Zhedanov algebra and prove that each of them (quotiented by their Casimir) is isomorphic to the corresponding spherical sub-algebra of our new confluent Cherednik algebras. We show that in the basic representation our confluent Zhedanov algebras act as symmetries of certain elements of the q-Askey scheme, thus setting a stepping stone towards the solution of the open problem of finding the corresponding quantum algebra for each element of the q-Askey scheme. These results establish a new link between the theory of the Painlevé equations and the theory of the q-Askey scheme making a step towards the construction of a representation theoretic approach for the Painlevé theory.

  18. Direct reciprocity on graphs

    PubMed Central

    Ohtsuki, Hisashi; Nowak, Martin A.

    2008-01-01

    Direct reciprocity is a mechanism for the evolution of cooperation based on the idea of repeated encounters between the same two individuals. Here we examine direct reciprocity in structured populations, where individuals occupy the vertices of a graph. The edges denote who interacts with whom. The graph represents spatial structure or a social network. For birth-death or pairwise comparison updating, we find that evolutionary stability of direct reciprocity is more restrictive on a graph than in a well-mixed population, but the condition for reciprocators to be advantageous is less restrictive on a graph. For death-birth and imitation updating, in contrast, both conditions are easier to fulfill on a graph. Moreover, for all four update mechanisms, reciprocators can dominate defectors on a graph, which is never possible in a well-mixed population. We also study the effect of an error rate, which increases with the number of links per individual; interacting with more people simultaneously enhances the probability of making mistakes. We provide analytic derivations for all results. PMID:17466339

  19. Commuting projections on graphs

    SciTech Connect

    Vassilevski, Panayot S.; Zikatanov, Ludmil T.

    2013-02-19

    For a given (connected) graph, we consider vector spaces of (discrete) functions defined on its vertices and its edges. These two spaces are related by a discrete gradient operator, Grad and its adjoint, ₋Div, referred to as (negative) discrete divergence. We also consider a coarse graph obtained by aggregation of vertices of the original one. Then a coarse vertex space is identified with the subspace of piecewise constant functions over the aggregates. We consider the ℓ2-projection QH onto the space of these piecewise constants. In the present paper, our main result is the construction of a projection π H from the original edge-space onto a properly constructed coarse edge-space associated with the edges of the coarse graph. The projections π H and QH commute with the discrete divergence operator, i.e., we have div π H = QH div. The respective pair of coarse edge-space and coarse vertexspace offer the potential to construct two-level, and by recursion, multilevel methods for the mixed formulation of the graph Laplacian which utilizes the discrete divergence operator. The performance of one two-level method with overlapping Schwarz smoothing and correction based on the constructed coarse spaces for solving such mixed graph Laplacian systems is illustrated on a number of graph examples.

  20. Review and application of group theory to molecular systems biology.

    PubMed

    Rietman, Edward A; Karp, Robert L; Tuszynski, Jack A

    2011-01-01

    In this paper we provide a review of selected mathematical ideas that can help us better understand the boundary between living and non-living systems. We focus on group theory and abstract algebra applied to molecular systems biology. Throughout this paper we briefly describe possible open problems. In connection with the genetic code we propose that it may be possible to use perturbation theory to explore the adjacent possibilities in the 64-dimensional space-time manifold of the evolving genome. With regards to algebraic graph theory, there are several minor open problems we discuss. In relation to network dynamics and groupoid formalism we suggest that the network graph might not be the main focus for understanding the phenotype but rather the phase space of the network dynamics. We show a simple case of a C6 network and its phase space network. We envision that the molecular network of a cell is actually a complex network of hypercycles and feedback circuits that could be better represented in a higher-dimensional space. We conjecture that targeting nodes in the molecular network that have key roles in the phase space, as revealed by analysis of the automorphism decomposition, might be a better way to drug discovery and treatment of cancer. PMID:21696623