WorldWideScience

Sample records for graph theory approach

  1. Graph Theory Approach for Studying Food Webs

    Science.gov (United States)

    Longjas, A.; Tejedor, A.; Foufoula-Georgiou, E.

    2017-12-01

    Food webs are complex networks of feeding interactions among species in ecological communities. Metrics describing food web structure have been proposed to compare and classify food webs ranging from food chain length, connectance, degree distribution, centrality measures, to the presence of motifs (distinct compartments), among others. However, formal methodologies for studying both food web topology and the dynamic processes operating on them are still lacking. Here, we utilize a quantitative framework using graph theory within which a food web is represented by a directed graph, i.e., a collection of vertices (species or trophic species defined as sets of species sharing the same predators and prey) and directed edges (predation links). This framework allows us to identify apex (environmental "source" node) to outlet (top predators) subnetworks and compute the steady-state flux (e.g., carbon, nutrients, energy etc.) in the food web. We use this framework to (1) construct vulnerability maps that quantify the relative change of flux delivery to the top predators in response to perturbations in prey species (2) identify keystone species, whose loss would precipitate further species extinction, and (3) introduce a suite of graph-theoretic metrics to quantify the topologic (imposed by food web connectivity) and dynamic (dictated by the flux partitioning and distribution) components of a food web's complexity. By projecting food webs into a 2D Topodynamic Complexity Space whose coordinates are given by Number of alternative paths (topologic) and Leakage Index (dynamic), we show that this space provides a basis for food web comparison and provide physical insights into their dynamic behavior.

  2. Graph theory

    CERN Document Server

    Gould, Ronald

    2012-01-01

    This introduction to graph theory focuses on well-established topics, covering primary techniques and including both algorithmic and theoretical problems. The algorithms are presented with a minimum of advanced data structures and programming details. This thoroughly corrected 1988 edition provides insights to computer scientists as well as advanced undergraduates and graduate students of topology, algebra, and matrix theory. Fundamental concepts and notation and elementary properties and operations are the first subjects, followed by examinations of paths and searching, trees, and networks. S

  3. Graph theory

    CERN Document Server

    Diestel, Reinhard

    2017-01-01

    This standard textbook of modern graph theory, now in its fifth edition, combines the authority of a classic with the engaging freshness of style that is the hallmark of active mathematics. It covers the core material of the subject with concise yet reliably complete proofs, while offering glimpses of more advanced methods in each field by one or two deeper results, again with proofs given in full detail. The book can be used as a reliable text for an introductory course, as a graduate text, and for self-study. From the reviews: “This outstanding book cannot be substituted with any other book on the present textbook market. It has every chance of becoming the standard textbook for graph theory.”Acta Scientiarum Mathematiciarum “Deep, clear, wonderful. This is a serious book about the heart of graph theory. It has depth and integrity. ”Persi Diaconis & Ron Graham, SIAM Review “The book has received a very enthusiastic reception, which it amply deserves. A masterly elucidation of modern graph theo...

  4. Fractional graph theory a rational approach to the theory of graphs

    CERN Document Server

    Scheinerman, Edward R

    2013-01-01

    A unified treatment of the most important results in the study of fractional graph concepts, this volume explores the various ways in which integer-valued concepts can be modified to derive nonintegral values. It begins with the general fractional theory of hypergraphs and presents in-depth coverage of fundamental and advanced topics. Subjects include fractional matching, fractional coloring, fractional edge coloring, fractional arboricity via matroid methods, and fractional isomorphism. The final chapter examines additional topics such as fractional domination, fractional intersection numbers

  5. Quantitative graph theory mathematical foundations and applications

    CERN Document Server

    Dehmer, Matthias

    2014-01-01

    The first book devoted exclusively to quantitative graph theory, Quantitative Graph Theory: Mathematical Foundations and Applications presents and demonstrates existing and novel methods for analyzing graphs quantitatively. Incorporating interdisciplinary knowledge from graph theory, information theory, measurement theory, and statistical techniques, this book covers a wide range of quantitative-graph theoretical concepts and methods, including those pertaining to real and random graphs such as:Comparative approaches (graph similarity or distance)Graph measures to characterize graphs quantitat

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

    International Nuclear Information System (INIS)

    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

  7. Chromatic graph theory

    CERN Document Server

    Chartrand, Gary; Rosen, Kenneth H

    2008-01-01

    Beginning with the origin of the four color problem in 1852, the field of graph colorings has developed into one of the most popular areas of graph theory. Introducing graph theory with a coloring theme, Chromatic Graph Theory explores connections between major topics in graph theory and graph colorings as well as emerging topics. This self-contained book first presents various fundamentals of graph theory that lie outside of graph colorings, including basic terminology and results, trees and connectivity, Eulerian and Hamiltonian graphs, matchings and factorizations, and graph embeddings. The remainder of the text deals exclusively with graph colorings. It covers vertex colorings and bounds for the chromatic number, vertex colorings of graphs embedded on surfaces, and a variety of restricted vertex colorings. The authors also describe edge colorings, monochromatic and rainbow edge colorings, complete vertex colorings, several distinguishing vertex and edge colorings, and many distance-related vertex coloring...

  8. GRAPH THEORY APPROACH TO QUANTIFY UNCERTAINTY OF PERFORMANCE MEASURES

    Directory of Open Access Journals (Sweden)

    Sérgio D. Sousa

    2015-03-01

    Full Text Available In this work, the performance measurement process is studied to quantify the uncertainty induced in the resulting performance measure (PM. To that end, the causes of uncertainty are identified, analysing the activities undertaken in the three following stages of the performance measurement process: design and implementation, data collection and record, and determination and analysis. A quantitative methodology based on graph theory and on the sources of uncertainty of the performance measurement process is used to calculate an uncertainty index to evaluate the level of uncertainty of a given PM or (key performance indicator. An application example is presented. The quantification of PM uncertainty could contribute to better represent the risk associated with a given decision and also to improve the PM to increase its precision and reliability.

  9. Introductory graph theory

    CERN Document Server

    Chartrand, Gary

    1984-01-01

    Graph theory is used today in the physical sciences, social sciences, computer science, and other areas. Introductory Graph Theory presents a nontechnical introduction to this exciting field in a clear, lively, and informative style. Author Gary Chartrand covers the important elementary topics of graph theory and its applications. In addition, he presents a large variety of proofs designed to strengthen mathematical techniques and offers challenging opportunities to have fun with mathematics. Ten major topics - profusely illustrated - include: Mathematical Models, Elementary Concepts of Grap

  10. Сlassification of methods of production of computer forensic by usage approach of graph theory

    Directory of Open Access Journals (Sweden)

    Anna Ravilyevna Smolina

    2016-06-01

    Full Text Available Сlassification of methods of production of computer forensic by usage approach of graph theory is proposed. If use this classification, it is possible to accelerate and simplify the search of methods of production of computer forensic and this process to automatize.

  11. Сlassification of methods of production of computer forensic by usage approach of graph theory

    OpenAIRE

    Anna Ravilyevna Smolina; Alexander Alexandrovich Shelupanov

    2016-01-01

    Сlassification of methods of production of computer forensic by usage approach of graph theory is proposed. If use this classification, it is possible to accelerate and simplify the search of methods of production of computer forensic and this process to automatize.

  12. Extremal graph theory

    CERN Document Server

    Bollobas, Bela

    2004-01-01

    The ever-expanding field of extremal graph theory encompasses a diverse array of problem-solving methods, including applications to economics, computer science, and optimization theory. This volume, based on a series of lectures delivered to graduate students at the University of Cambridge, presents a concise yet comprehensive treatment of extremal graph theory.Unlike most graph theory treatises, this text features complete proofs for almost all of its results. Further insights into theory are provided by the numerous exercises of varying degrees of difficulty that accompany each chapter. A

  13. Adventures in graph theory

    CERN Document Server

    Joyner, W David

    2017-01-01

    This textbook acts as a pathway to higher mathematics by seeking and illuminating the connections between graph theory and diverse fields of mathematics, such as calculus on manifolds, group theory, algebraic curves, Fourier analysis, cryptography and other areas of combinatorics. An overview of graph theory definitions and polynomial invariants for graphs prepares the reader for the subsequent dive into the applications of graph theory. To pique the reader’s interest in areas of possible exploration, recent results in mathematics appear throughout the book, accompanied with examples of related graphs, how they arise, and what their valuable uses are. The consequences of graph theory covered by the authors are complicated and far-reaching, so topics are always exhibited in a user-friendly manner with copious graphs, exercises, and Sage code for the computation of equations. Samples of the book’s source code can be found at github.com/springer-math/adventures-in-graph-theory. The text is geared towards ad...

  14. Graph theory and its applications

    CERN Document Server

    Gross, Jonathan L

    2006-01-01

    Gross and Yellen take a comprehensive approach to graph theory that integrates careful exposition of classical developments with emerging methods, models, and practical needs. Their unparalleled treatment provides a text ideal for a two-semester course and a variety of one-semester classes, from an introductory one-semester course to courses slanted toward classical graph theory, operations research, data structures and algorithms, or algebra and topology.

  15. Modern graph theory

    CERN Document Server

    Bollobás, Béla

    1998-01-01

    The time has now come when graph theory should be part of the education of every serious student of mathematics and computer science, both for its own sake and to enhance the appreciation of mathematics as a whole. This book is an in-depth account of graph theory, written with such a student in mind; it reflects the current state of the subject and emphasizes connections with other branches of pure mathematics. The volume grew out of the author's earlier book, Graph Theory -- An Introductory Course, but its length is well over twice that of its predecessor, allowing it to reveal many exciting new developments in the subject. Recognizing that graph theory is one of several courses competing for the attention of a student, the book contains extensive descriptive passages designed to convey the flavor of the subject and to arouse interest. In addition to a modern treatment of the classical areas of graph theory such as coloring, matching, extremal theory, and algebraic graph theory, the book presents a detailed ...

  16. Introduction to graph theory

    CERN Document Server

    Wilson, Robin J

    1985-01-01

    Graph Theory has recently emerged as a subject in its own right, as well as being an important mathematical tool in such diverse subjects as operational research, chemistry, sociology and genetics. This book provides a comprehensive introduction to the subject.

  17. An unprecedented multi attribute decision making using graph theory matrix approach

    Directory of Open Access Journals (Sweden)

    N.K. Geetha

    2018-02-01

    Full Text Available A frame work for investigating the best combination of functioning parameters on a variable compression ratio diesel engine is proposed in the present study using a multi attribute optimization methodology, Graph Theory Matrix Approach. The functioning parameters, attributes, sub attributes and functioning variables of sub attributes are chosen based on expert’s opinion and literature review. The directed graphs are developed for attributes and sub attributes. The ‘Parameter Index’ was calculated for all trials to choose the best trial. The experimental results are verified with the theoretical data. Functioning parameters with combination of compression ratio of 17, fuel injection pressure of 20 N/mm2 and fuel injection pressure of 21°bTDC was found to be best. The proposed method allows the decision maker to systematically and logically find the best combination of functioning parameters.

  18. Introduction to graph theory

    CERN Document Server

    Trudeau, Richard J

    1994-01-01

    Preface1. Pure Mathematics Introduction; Euclidean Geometry as Pure Mathematics; Games; Why Study Pure Mathematics?; What's Coming; Suggested Reading2. Graphs Introduction; Sets; Paradox; Graphs; Graph diagrams; Cautions; Common Graphs; Discovery; Complements and Subgraphs; Isomorphism; Recognizing Isomorphic Graphs; Semantics The Number of Graphs Having a Given nu; Exercises; Suggested Reading3. Planar Graphs Introduction; UG, K subscript 5, and the Jordan Curve Theorem; Are there More Nonplanar Graphs?; Expansions; Kuratowski's Theorem; Determining Whether a Graph is Planar or

  19. A Graph Theory Approach for Geovisualization of Anthropogenic Land Use Change: An application to Lisbon

    Directory of Open Access Journals (Sweden)

    Eric Vaz

    2013-12-01

    Full Text Available Urban sprawl and growth has experienced increased concern in geographic and environmental literature. Preceding the existence of robust frameworks found in regional and urban planning, as well as urban geography and economics, the spatial properties of allocation of urban land use are still far from being completely understood. This is largely due to the underlying complexity of the change found at the spatial level of urban land use, merging social, economic and natural drivers. The spatial patterns formed, and the connectivity established among the different subsets of land-use types, becomes a complex network of interactions over time, helping to shape the structure of the city. The possibility to merge the configuration of land-use with complex networks may be assessed elegantly through graph theory. Nodes and edges can become abstract representations of typologies of space and are represented into a topological space of different land use types which traditionally share common spatial boundaries. Within a regional framework, the links between adjacent and neighboring urban land use types become better understood, by means of a KamadaKawai algorithm. This study uses land use in Lisbon over three years, 1990, 2000 and 2006, to develop a Kamada-Kawai graph interpretation of land-use as a result of neighboring power. The rapid change witnessed in Lisbon since the nineties, as well as the availability of CORINE Land Cover data in these three time stamps, permits a reflection on anthropogenic land-use change in urban and semi-urban areas in Portugal’s capital. This paper responds to (1 the structure and connectivity of urban land use over time, demonstrating that most of the agricultural land is stressed to transform to urban, gaining a central role in future. (2 Offer a systemic approach to land-use transitions generating what we call spatial memory, where land use change is often unpredictable over space, but becomes evident in a graph theory

  20. A seminar on graph theory

    CERN Document Server

    Harary, Frank

    2015-01-01

    Presented in 1962-63 by experts at University College, London, these lectures offer a variety of perspectives on graph theory. Although the opening chapters form a coherent body of graph theoretic concepts, this volume is not a text on the subject but rather an introduction to the extensive literature of graph theory. The seminar's topics are geared toward advanced undergraduate students of mathematics.Lectures by this volume's editor, Frank Harary, include ""Some Theorems and Concepts of Graph Theory,"" ""Topological Concepts in Graph Theory,"" ""Graphical Reconstruction,"" and other introduc

  1. The Epstein-Glaser approach to perturbative quantum field theory: graphs and Hopf algebras

    International Nuclear Information System (INIS)

    Lange, Alexander

    2005-01-01

    The paper aims at investigating perturbative quantum field theory in the approach of Epstein and Glaser (EG) and, in particular, its formulation in the language of graphs and Hopf algebras (HAs). Various HAs are encountered, each one associated with a special combination of physical concepts such as normalization, localization, pseudounitarity, causal regularization, and renormalization. The algebraic structures, representing the perturbative expansion of the S-matrix, are imposed on operator-valued distributions equipped with appropriate graph indices. Translation invariance ensures the algebras to be analytically well defined and graded total symmetry allows to formulate bialgebras. The algebraic results are given embedded in the corresponding physical framework, covering the two EG versions by Fredenhagen and Scharf that differ with respect to the concrete recursive implementation of causality. Besides, the ultraviolet divergences occurring in Feynman's representation are mathematically reasoned. As a final result, the change of the renormalization scheme in the context of EG is modeled via a HA and interpreted as the EG analog of Kreimer's HA

  2. A first course in graph theory

    CERN Document Server

    Chartrand, Gary

    2012-01-01

    This comprehensive text offers undergraduates a remarkably student-friendly introduction to graph theory. Written by two of the field's most prominent experts, it takes an engaging approach that emphasizes graph theory's history. Unique examples and lucid proofs provide a sound yet accessible treatment that stimulates interest in an evolving subject and its many applications.Optional sections designated as ""excursion"" and ""exploration"" present interesting sidelights of graph theory and touch upon topics that allow students the opportunity to experiment and use their imaginations. Three app

  3. Identification Of The Epileptogenic Zone From Stereo-EEG Signals: A Connectivity-Graph Theory Approach

    Directory of Open Access Journals (Sweden)

    Ferruccio ePanzica

    2013-11-01

    Full Text Available In the context of focal drug-resistant epilepsies, the surgical resection of the epileptogenic zone (EZ, the cortical region responsible for the onset, early seizures organization and propagation, may be the only therapeutic option for reducing or suppressing seizures. The rather high rate of failure in epilepsy surgery of extra-temporal epilepsies highlights that the precise identification of the EZ, mandatory objective to achieve seizure freedom, is still an unsolved problem that requires more sophisticated methods of investigation.Despite the wide range of non-invasive investigations, intracranial stereo-EEG (SEEG recordings still represent, in many patients, the gold standard for the EZ identification. In this contest, the EZ localization is still based on visual analysis of SEEG, inevitably affected by the drawback of subjectivity and strongly time-consuming. Over the last years, considerable efforts have been made to develop advanced signal analysis techniques able to improve the identification of the EZ. Particular attention has been paid to those methods aimed at quantifying and characterising the interactions and causal relationships between neuronal populations, since is nowadays well assumed that epileptic phenomena are associated with abnormal changes in brain synchronisation mechanisms, and initial evidence has shown the suitability of this approach for the EZ localisation. The aim of this review is to provide an overview of the different EEG signal processing methods applied to study connectivity between distinct brain cortical regions, namely in focal epilepsies. In addition, with the aim of localizing the EZ, the approach based on graph theory will be described, since the study of the topological properties of the networks has strongly improved the study of brain connectivity mechanisms.

  4. Topics in graph theory graphs and their Cartesian product

    CERN Document Server

    Imrich, Wilfried; Rall, Douglas F

    2008-01-01

    From specialists in the field, you will learn about interesting connections and recent developments in the field of graph theory by looking in particular at Cartesian products-arguably the most important of the four standard graph products. Many new results in this area appear for the first time in print in this book. Written in an accessible way, this book can be used for personal study in advanced applications of graph theory or for an advanced graph theory course.

  5. Planar graphs theory and algorithms

    CERN Document Server

    Nishizeki, T

    1988-01-01

    Collected in this volume are most of the important theorems and algorithms currently known for planar graphs, together with constructive proofs for the theorems. Many of the algorithms are written in Pidgin PASCAL, and are the best-known ones; the complexities are linear or 0(nlogn). The first two chapters provide the foundations of graph theoretic notions and algorithmic techniques. The remaining chapters discuss the topics of planarity testing, embedding, drawing, vertex- or edge-coloring, maximum independence set, subgraph listing, planar separator theorem, Hamiltonian cycles, and single- or multicommodity flows. Suitable for a course on algorithms, graph theory, or planar graphs, the volume will also be useful for computer scientists and graph theorists at the research level. An extensive reference section is included.

  6. The fascinating world of graph theory

    CERN Document Server

    Benjamin, Arthur; Zhang, Ping

    2015-01-01

    Graph theory goes back several centuries and revolves around the study of graphs-mathematical structures showing relations between objects. With applications in biology, computer science, transportation science, and other areas, graph theory encompasses some of the most beautiful formulas in mathematics-and some of its most famous problems. The Fascinating World of Graph Theory explores the questions and puzzles that have been studied, and often solved, through graph theory. This book looks at graph theory's development and the vibrant individuals responsible for the field's growth. Introducin

  7. Graph Theory. 1. Fragmentation of Structural Graphs

    Directory of Open Access Journals (Sweden)

    Lorentz JÄNTSCHI

    2002-12-01

    Full Text Available The investigation of structural graphs has many fields of applications in engineering, especially in applied sciences like as applied chemistry and physics, computer sciences and automation, electronics and telecommunication. The main subject of the paper is to express fragmentation criteria in graph using a new method of investigation: terminal paths. Using terminal paths are defined most of the fragmentation criteria that are in use in molecular topology, but the fields of applications are more generally than that, as I mentioned before. Graphical examples of fragmentation are given for every fragmentation criteria. Note that all fragmentation is made with a computer program that implements a routine for every criterion.[1] A web routine for tracing all terminal paths in graph can be found at the address: http://vl.academicdirect.ro/molecular_topology/tpaths/ [1] M. V. Diudea, I. Gutman, L. Jäntschi, Molecular Topology, Nova Science, Commack, New York, 2001, 2002.

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

    Science.gov (United States)

    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

  9. Towards a theory of geometric graphs

    CERN Document Server

    Pach, Janos

    2004-01-01

    The early development of graph theory was heavily motivated and influenced by topological and geometric themes, such as the Konigsberg Bridge Problem, Euler's Polyhedral Formula, or Kuratowski's characterization of planar graphs. In 1936, when Denes Konig published his classical Theory of Finite and Infinite Graphs, the first book ever written on the subject, he stressed this connection by adding the subtitle Combinatorial Topology of Systems of Segments. He wanted to emphasize that the subject of his investigations was very concrete: planar figures consisting of points connected by straight-line segments. However, in the second half of the twentieth century, graph theoretical research took an interesting turn. In the most popular and most rapidly growing areas (the theory of random graphs, Ramsey theory, extremal graph theory, algebraic graph theory, etc.), graphs were considered as abstract binary relations rather than geometric objects. Many of the powerful techniques developed in these fields have been su...

  10. Foodsheds in Virtual Water Flow Networks: A Spectral Graph Theory Approach

    Directory of Open Access Journals (Sweden)

    Nina Kshetry

    2017-06-01

    Full Text Available A foodshed is a geographic area from which a population derives its food supply, but a method to determine boundaries of foodsheds has not been formalized. Drawing on the food–water–energy nexus, we propose a formal network science definition of foodsheds by using data from virtual water flows, i.e., water that is virtually embedded in food. In particular, we use spectral graph partitioning for directed graphs. If foodsheds turn out to be geographically compact, it suggests the food system is local and therefore reduces energy and externality costs of food transport. Using our proposed method we compute foodshed boundaries at the global-scale, and at the national-scale in the case of two of the largest agricultural countries: India and the United States. Based on our determination of foodshed boundaries, we are able to better understand commodity flows and whether foodsheds are contiguous and compact, and other factors that impact environmental sustainability. The formal method we propose may be used more broadly to study commodity flows and their impact on environmental sustainability.

  11. Using graph theory for automated electric circuit solving

    International Nuclear Information System (INIS)

    Toscano, L; Stella, S; Milotti, E

    2015-01-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. (paper)

  12. Three Syntactic Theories for Combinatory Graph Reduction

    DEFF Research Database (Denmark)

    Danvy, Olivier; Zerny, Ian

    2011-01-01

    in a third syntactic theory. The structure of the store-based abstract machine corresponding to this third syntactic theory oincides with that of Turner's original reduction machine. The three syntactic theories presented here The three syntactic heories presented here therefore have the following......We present a purely syntactic theory of graph reduction for the canonical combinators S, K, and I, where graph vertices are represented with evaluation contexts and let expressions. We express this syntactic theory as a reduction semantics, which we refocus into the first storeless abstract machine...... for combinatory graph reduction, which we refunctionalize into the first storeless natural semantics for combinatory graph reduction.We then factor out the introduction of let expressions to denote as many graph vertices as possible upfront instead of on demand, resulting in a second syntactic theory, this one...

  13. Three Syntactic Theories for Combinatory Graph Reduction

    DEFF Research Database (Denmark)

    Danvy, Olivier; Zerny, Ian

    2013-01-01

    , as a store-based reduction semantics of combinatory term graphs. We then refocus this store-based reduction semantics into a store-based abstract machine. The architecture of this store-based abstract machine coincides with that of Turner's original reduction machine. The three syntactic theories presented......We present a purely syntactic theory of graph reduction for the canonical combinators S, K, and I, where graph vertices are represented with evaluation contexts and let expressions. We express this rst syntactic theory as a storeless reduction semantics of combinatory terms. We then factor out...... the introduction of let expressions to denote as many graph vertices as possible upfront instead of on demand . The factored terms can be interpreted as term graphs in the sense of Barendregt et al. We express this second syntactic theory, which we prove equivalent to the rst, as a storeless reduction semantics...

  14. High Dimensional Spectral Graph Theory and Non-backtracking Random Walks on Graphs

    Science.gov (United States)

    Kempton, Mark

    This thesis has two primary areas of focus. First we study connection graphs, which are weighted graphs in which each edge is associated with a d-dimensional rotation matrix for some fixed dimension d, in addition to a scalar weight. Second, we study non-backtracking random walks on graphs, which are random walks with the additional constraint that they cannot return to the immediately previous state at any given step. Our work in connection graphs is centered on the notion of consistency, that is, the product of rotations moving from one vertex to another is independent of the path taken, and a generalization called epsilon-consistency. We present higher dimensional versions of the combinatorial Laplacian matrix and normalized Laplacian matrix from spectral graph theory, and give results characterizing the consistency of a connection graph in terms of the spectra of these matrices. We generalize several tools from classical spectral graph theory, such as PageRank and effective resistance, to apply to connection graphs. We use these tools to give algorithms for sparsification, clustering, and noise reduction on connection graphs. In non-backtracking random walks, we address the question raised by Alon et. al. concerning how the mixing rate of a non-backtracking random walk to its stationary distribution compares to the mixing rate for an ordinary random walk. Alon et. al. address this question for regular graphs. We take a different approach, and use a generalization of Ihara's Theorem to give a new proof of Alon's result for regular graphs, and to extend the result to biregular graphs. Finally, we give a non-backtracking version of Polya's Random Walk Theorem for 2-dimensional grids.

  15. An algebraic approach to graph codes

    DEFF Research Database (Denmark)

    Pinero, Fernando

    This thesis consists of six chapters. The first chapter, contains a short introduction to coding theory in which we explain the coding theory concepts we use. In the second chapter, we present the required theory for evaluation codes and also give an example of some fundamental codes in coding...... theory as evaluation codes. Chapter three consists of the introduction to graph based codes, such as Tanner codes and graph codes. In Chapter four, we compute the dimension of some graph based codes with a result combining graph based codes and subfield subcodes. Moreover, some codes in chapter four...

  16. Graph theory and the Virasoro master equation

    International Nuclear Information System (INIS)

    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) 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 {g metric }, whose structure is visible in the high-level expansion. When a magic basis is real on compact g, the corresponding g metric is a large system of unitary, generically irrational conformal field theories. Examples in this class include the graph-theory ansatz SO(n) diag in the Cartesian basis of SO(n), and the ansatz SU(n) 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) 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 metric

  17. Graph Theory to Pure Mathematics: Some Illustrative Examples

    Indian Academy of Sciences (India)

    Graph Theory to Pure Mathematics: Some. Illustrative Examples v Yegnanarayanan is a. Professor of Mathematics at MNM Jain Engineering. College, Chennai. His research interests include graph theory and its applications to both pure maths and theoretical computer science. Keywords. Graph theory, matching theory,.

  18. Algebraic Graph Theory Morphisms, Monoids and Matrices

    CERN Document Server

    Knauer, Ulrich

    2011-01-01

    This is a highly self-contained book about algebraic graph theory which iswritten with a view to keep the lively and unconventional atmosphere of a spoken text to communicate the enthusiasm the author feels about this subject. The focus is on homomorphisms and endomorphisms, matrices and eigenvalues. Graph models are extremely useful for almost all applications and applicators as they play an important role as structuring tools. They allow to model net structures -like roads, computers, telephones -instances of abstract data structures -likelists, stacks, trees -and functional or object orient

  19. Graphs on Surfaces and the Partition Function of String Theory

    OpenAIRE

    Garcia-Islas, J. Manuel

    2007-01-01

    Graphs on surfaces is an active topic of pure mathematics belonging to graph theory. It has also been applied to physics and relates discrete and continuous mathematics. In this paper we present a formal mathematical description of the relation between graph theory and the mathematical physics of discrete string theory. In this description we present problems of the combinatorial world of real importance for graph theorists. The mathematical details of the paper are as follows: There is a com...

  20. Graph sampling

    OpenAIRE

    Zhang, L.-C.; Patone, M.

    2017-01-01

    We synthesise the existing theory of graph sampling. We propose a formal definition of sampling in finite graphs, and provide a classification of potential graph parameters. We develop a general approach of Horvitz–Thompson estimation to T-stage snowball sampling, and present various reformulations of some common network sampling methods in the literature in terms of the outlined graph sampling theory.

  1. Graph Theory. 2. Vertex Descriptors and Graph Coloring

    Directory of Open Access Journals (Sweden)

    Lorentz JÄNTSCHI

    2002-12-01

    Full Text Available This original work presents the construction of a set of ten sequence matrices and their applications for ordering vertices in graphs. For every sequence matrix three ordering criteria are applied: lexicographic ordering, based on strings of numbers, corresponding to every vertex, extracted as rows from sequence matrices; ordering by the sum of path lengths from a given vertex; and ordering by the sum of paths, starting from a given vertex. We also examine a graph that has different orderings for the above criteria. We then proceed to demonstrate that every criterion induced its own partition of graph vertex. We propose the following theoretical result: both LAVS and LVDS criteria generate identical partitioning of vertices in any graph. Finally, a coloring of graph vertices according to introduced ordering criteria was proposed.

  2. BootGraph: probabilistic fiber tractography using bootstrap algorithms and graph theory.

    Science.gov (United States)

    Vorburger, Robert S; Reischauer, Carolin; Boesiger, Peter

    2013-02-01

    Bootstrap methods have recently been introduced to diffusion-weighted magnetic resonance imaging to estimate the measurement uncertainty of ensuing diffusion parameters directly from the acquired data without the necessity to assume a noise model. These methods have been previously combined with deterministic streamline tractography algorithms to allow for the assessment of connection probabilities in the human brain. Thereby, the local noise induced disturbance in the diffusion data is accumulated additively due to the incremental progression of streamline tractography algorithms. Graph based approaches have been proposed to overcome this drawback of streamline techniques. For this reason, the bootstrap method is in the present work incorporated into a graph setup to derive a new probabilistic fiber tractography method, called BootGraph. The acquired data set is thereby converted into a weighted, undirected graph by defining a vertex in each voxel and edges between adjacent vertices. By means of the cone of uncertainty, which is derived using the wild bootstrap, a weight is thereafter assigned to each edge. Two path finding algorithms are subsequently applied to derive connection probabilities. While the first algorithm is based on the shortest path approach, the second algorithm takes all existing paths between two vertices into consideration. Tracking results are compared to an established algorithm based on the bootstrap method in combination with streamline fiber tractography and to another graph based algorithm. The BootGraph shows a very good performance in crossing situations with respect to false negatives and permits incorporating additional constraints, such as a curvature threshold. By inheriting the advantages of the bootstrap method and graph theory, the BootGraph method provides a computationally efficient and flexible probabilistic tractography setup to compute connection probability maps and virtual fiber pathways without the drawbacks of

  3. Some Results on the Graph Theory for Complex Neutrosophic Sets

    Directory of Open Access Journals (Sweden)

    Shio Gai Quek

    2018-05-01

    Full Text Available Fuzzy graph theory plays an important role in the study of the symmetry and asymmetry properties of fuzzy graphs. With this in mind, in this paper, we introduce new neutrosophic graphs called complex neutrosophic graphs of type 1 (abbr. CNG1. We then present a matrix representation for it and study some properties of this new concept. The concept of CNG1 is an extension of the generalized fuzzy graphs of type 1 (GFG1 and generalized single-valued neutrosophic graphs of type 1 (GSVNG1. The utility of the CNG1 introduced here are applied to a multi-attribute decision making problem related to Internet server selection.

  4. Using graph approach for managing connectivity in integrative landscape modelling

    Science.gov (United States)

    Rabotin, Michael; Fabre, Jean-Christophe; Libres, Aline; Lagacherie, Philippe; Crevoisier, David; Moussa, Roger

    2013-04-01

    In cultivated landscapes, a lot of landscape elements such as field boundaries, ditches or banks strongly impact water flows, mass and energy fluxes. At the watershed scale, these impacts are strongly conditionned by the connectivity of these landscape elements. An accurate representation of these elements and of their complex spatial arrangements is therefore of great importance for modelling and predicting these impacts.We developped in the framework of the OpenFLUID platform (Software Environment for Modelling Fluxes in Landscapes) a digital landscape representation that takes into account the spatial variabilities and connectivities of diverse landscape elements through the application of the graph theory concepts. The proposed landscape representation consider spatial units connected together to represent the flux exchanges or any other information exchanges. Each spatial unit of the landscape is represented as a node of a graph and relations between units as graph connections. The connections are of two types - parent-child connection and up/downstream connection - which allows OpenFLUID to handle hierarchical graphs. Connections can also carry informations and graph evolution during simulation is possible (connections or elements modifications). This graph approach allows a better genericity on landscape representation, a management of complex connections and facilitate development of new landscape representation algorithms. Graph management is fully operational in OpenFLUID for developers or modelers ; and several graph tools are available such as graph traversal algorithms or graph displays. Graph representation can be managed i) manually by the user (for example in simple catchments) through XML-based files in easily editable and readable format or ii) by using methods of the OpenFLUID-landr library which is an OpenFLUID library relying on common open-source spatial libraries (ogr vector, geos topologic vector and gdal raster libraries). Open

  5. Graph Theory and Ion and Molecular Aggregation in Aqueous Solutions

    Science.gov (United States)

    Choi, Jun-Ho; Lee, Hochan; Choi, Hyung Ran; Cho, Minhaeng

    2018-04-01

    In molecular and cellular biology, dissolved ions and molecules have decisive effects on chemical and biological reactions, conformational stabilities, and functions of small to large biomolecules. Despite major efforts, the current state of understanding of the effects of specific ions, osmolytes, and bioprotecting sugars on the structure and dynamics of water H-bonding networks and proteins is not yet satisfactory. Recently, to gain deeper insight into this subject, we studied various aggregation processes of ions and molecules in high-concentration salt, osmolyte, and sugar solutions with time-resolved vibrational spectroscopy and molecular dynamics simulation methods. It turns out that ions (or solute molecules) have a strong propensity to self-assemble into large and polydisperse aggregates that affect both local and long-range water H-bonding structures. In particular, we have shown that graph-theoretical approaches can be used to elucidate morphological characteristics of large aggregates in various aqueous salt, osmolyte, and sugar solutions. When ion and molecular aggregates in such aqueous solutions are treated as graphs, a variety of graph-theoretical properties, such as graph spectrum, degree distribution, clustering coefficient, minimum path length, and graph entropy, can be directly calculated by considering an ensemble of configurations taken from molecular dynamics trajectories. Here we show percolating behavior exhibited by ion and molecular aggregates upon increase in solute concentration in high solute concentrations and discuss compelling evidence of the isomorphic relation between percolation transitions of ion and molecular aggregates and water H-bonding networks. We anticipate that the combination of graph theory and molecular dynamics simulation methods will be of exceptional use in achieving a deeper understanding of the fundamental physical chemistry of dissolution and in describing the interplay between the self-aggregation of solute

  6. Graph Theory and Ion and Molecular Aggregation in Aqueous Solutions.

    Science.gov (United States)

    Choi, Jun-Ho; Lee, Hochan; Choi, Hyung Ran; Cho, Minhaeng

    2018-04-20

    In molecular and cellular biology, dissolved ions and molecules have decisive effects on chemical and biological reactions, conformational stabilities, and functions of small to large biomolecules. Despite major efforts, the current state of understanding of the effects of specific ions, osmolytes, and bioprotecting sugars on the structure and dynamics of water H-bonding networks and proteins is not yet satisfactory. Recently, to gain deeper insight into this subject, we studied various aggregation processes of ions and molecules in high-concentration salt, osmolyte, and sugar solutions with time-resolved vibrational spectroscopy and molecular dynamics simulation methods. It turns out that ions (or solute molecules) have a strong propensity to self-assemble into large and polydisperse aggregates that affect both local and long-range water H-bonding structures. In particular, we have shown that graph-theoretical approaches can be used to elucidate morphological characteristics of large aggregates in various aqueous salt, osmolyte, and sugar solutions. When ion and molecular aggregates in such aqueous solutions are treated as graphs, a variety of graph-theoretical properties, such as graph spectrum, degree distribution, clustering coefficient, minimum path length, and graph entropy, can be directly calculated by considering an ensemble of configurations taken from molecular dynamics trajectories. Here we show percolating behavior exhibited by ion and molecular aggregates upon increase in solute concentration in high solute concentrations and discuss compelling evidence of the isomorphic relation between percolation transitions of ion and molecular aggregates and water H-bonding networks. We anticipate that the combination of graph theory and molecular dynamics simulation methods will be of exceptional use in achieving a deeper understanding of the fundamental physical chemistry of dissolution and in describing the interplay between the self-aggregation of solute

  7. Molecular orbital calculations using chemical graph theory

    CERN Document Server

    Dias, Jerry Ray

    1993-01-01

    Professor John D. Roberts published a highly readable book on Molecular Orbital Calculations directed toward chemists in 1962. That timely book is the model for this book. The audience this book is directed toward are senior undergraduate and beginning graduate students as well as practicing bench chemists who have a desire to develop conceptual tools for understanding chemical phenomena. Although, ab initio and more advanced semi-empirical MO methods are regarded as being more reliable than HMO in an absolute sense, there is good evidence that HMO provides reliable relative answers particularly when comparing related molecular species. Thus, HMO can be used to rationalize electronic structure in 1t-systems, aromaticity, and the shape use HMO to gain insight of simple molecular orbitals. Experimentalists still into subtle electronic interactions for interpretation of UV and photoelectron spectra. Herein, it will be shown that one can use graph theory to streamline their HMO computational efforts and to arrive...

  8. On some interconnections between combinatorial optimization and extremal graph theory

    Directory of Open Access Journals (Sweden)

    Cvetković Dragoš M.

    2004-01-01

    Full Text Available The uniting feature of combinatorial optimization and extremal graph theory is that in both areas one should find extrema of a function defined in most cases on a finite set. While in combinatorial optimization the point is in developing efficient algorithms and heuristics for solving specified types of problems, the extremal graph theory deals with finding bounds for various graph invariants under some constraints and with constructing extremal graphs. We analyze by examples some interconnections and interactions of the two theories and propose some conclusions.

  9. Graph theory for alternating hydrocarbons with attached ports

    NARCIS (Netherlands)

    Hesselink, Wim H.

    Properties of molecules of certain hydrocarbons give rise to difficult questions in graph theory. This paper is primarily devoted to the graph theory, but the physico-chemical motivation, which is somewhat speculative, is also presented. Molecules of unsaturated hydrocarbons exhibit alternating

  10. Graph Theory in Paris : Conference in Memory of Claude Berge

    CERN Document Server

    Fonlupt, Jean; Fouquet, Jean-Luc; Fournier, Jean-Claude; Alfonsín, Jorge

    2007-01-01

    In July 2004, a conference on graph theory was held in Paris in memory of Claude Berge, one of the pioneers of the field. The event brought together many prominent specialists on topics, such as perfect graphs and matching theory, upon which Claude Berge's work has had a major impact. This volume includes contributions to these and other topics from many of the participants.

  11. Quantifying Riverscape Connectivity with Graph Theory

    Science.gov (United States)

    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. The $K$-theory of real graph $C*$-algebras

    OpenAIRE

    Boersema, Jeffrey L.

    2014-01-01

    In this paper, we will introduce real graph algebras and develop the theory to the point of being able to calculate the $K$-theory of such algebras. The $K$-theory situation is significantly more complicated than in the case for complex graph algebras. To develop the long exact sequence to compute the $K$-theory of a real graph algebra, we need to develop a generalized theory of crossed products for real C*-algebras for groups with involution. We also need to deal with the additional algebrai...

  13. A first course in graph theory and combinatorics

    CERN Document Server

    Cioabă, Sebastian M

    2009-01-01

    The concept of a graph is fundamental in mathematics since it conveniently encodes diverse relations and facilitates combinatorial analysis of many complicated counting problems. In this book, the authors have traced the origins of graph theory from its humble beginnings of recreational mathematics to its modern setting for modeling communication networks as is evidenced by the World Wide Web graph used by many Internet search engines. This book is an introduction to graph theory and combinatorial analysis. It is based on courses given by the second author at Queen's University at Kingston, Ontario, Canada between 2002 and 2008. The courses were aimed at students in their final year of their undergraduate program.

  14. Efficient Algorithmic Frameworks via Structural Graph Theory

    Science.gov (United States)

    2016-10-28

    constant. For example, they measured that, on large samples of the entire network, the Amazon graph has average degree 17.7, the Facebook graph has average...department heads’ opinions of departments, and generally lack transparency and well-defined measures . On the other hand, the National Research Council (the...Efficient and practical resource block allocation for LTE -based D2D network via graph coloring. Wireless Networks 20(4): 611-624 (2014) 50. Hossein

  15. Graph-based linear scaling electronic structure theory

    Energy Technology Data Exchange (ETDEWEB)

    Niklasson, Anders M. N., E-mail: amn@lanl.gov; Negre, Christian F. A.; Cawkwell, Marc J.; Swart, Pieter J.; Germann, Timothy C.; Bock, Nicolas [Theoretical Division, Los Alamos National Laboratory, Los Alamos, New Mexico 87545 (United States); Mniszewski, Susan M.; Mohd-Yusof, Jamal; Wall, Michael E.; Djidjev, Hristo [Computer, Computational, and Statistical Sciences Division, Los Alamos National Laboratory, Los Alamos, New Mexico 87545 (United States); Rubensson, Emanuel H. [Division of Scientific Computing, Department of Information Technology, Uppsala University, Box 337, SE-751 05 Uppsala (Sweden)

    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.

  16. Graph-theoretic approach to quantum correlations.

    Science.gov (United States)

    Cabello, Adán; Severini, Simone; Winter, Andreas

    2014-01-31

    Correlations in Bell and noncontextuality inequalities can be expressed as a positive linear combination of probabilities of events. Exclusive events can be represented as adjacent vertices of a graph, so correlations can be associated to a subgraph. We show that the maximum value of the correlations for classical, quantum, and more general theories is the independence number, the Lovász number, and the fractional packing number of this subgraph, respectively. We also show that, for any graph, there is always a correlation experiment such that the set of quantum probabilities is exactly the Grötschel-Lovász-Schrijver theta body. This identifies these combinatorial notions as fundamental physical objects and provides a method for singling out experiments with quantum correlations on demand.

  17. Applying Graph Theory to Problems in Air Traffic Management

    Science.gov (United States)

    Farrahi, Amir H.; Goldberg, Alan T.; Bagasol, Leonard N.; Jung, Jaewoo

    2017-01-01

    Graph theory is used to investigate three different problems arising in air traffic management. First, using a polynomial reduction from a graph partitioning problem, it isshown that both the airspace sectorization problem and its incremental counterpart, the sector combination problem are NP-hard, in general, under several simple workload models. Second, using a polynomial time reduction from maximum independent set in graphs, it is shown that for any fixed e, the problem of finding a solution to the minimum delay scheduling problem in traffic flow management that is guaranteed to be within n1-e of the optimal, where n is the number of aircraft in the problem instance, is NP-hard. Finally, a problem arising in precision arrival scheduling is formulated and solved using graph reachability. These results demonstrate that graph theory provides a powerful framework for modeling, reasoning about, and devising algorithmic solutions to diverse problems arising in air traffic management.

  18. An Association-Oriented Partitioning Approach for Streaming Graph Query

    Directory of Open Access Journals (Sweden)

    Yun Hao

    2017-01-01

    Full Text Available The volumes of real-world graphs like knowledge graph are increasing rapidly, which makes streaming graph processing a hot research area. Processing graphs in streaming setting poses significant challenges from different perspectives, among which graph partitioning method plays a key role. Regarding graph query, a well-designed partitioning method is essential for achieving better performance. Existing offline graph partitioning methods often require full knowledge of the graph, which is not possible during streaming graph processing. In order to handle this problem, we propose an association-oriented streaming graph partitioning method named Assc. This approach first computes the rank values of vertices with a hybrid approximate PageRank algorithm. After splitting these vertices with an adapted variant affinity propagation algorithm, the process order on vertices in the sliding window can be determined. Finally, according to the level of these vertices and their association, the partition where the vertices should be distributed is decided. We compare its performance with a set of streaming graph partition methods and METIS, a widely adopted offline approach. The results show that our solution can partition graphs with hundreds of millions of vertices in streaming setting on a large collection of graph datasets and our approach outperforms other graph partitioning methods.

  19. Comparison of a traditional with a new approach based on Graph Theory to vulnerability assessment to natural hazards: a study case on a socio-economic complex system

    Science.gov (United States)

    Arosio, Marcello; Martina, Mario L. V.

    2017-04-01

    The emergent behaviour of the contemporary complex, socio-technical and interconnected society makes the collective risk greater than the sum of the parts and this requires a holistic, systematic and integrated approach. Although there have been major improvements in recent years, there are still some limitation in term of a holistic approach that is able to include the emergent value hidden in the connections between exposed elements and the interactions between the different spheres of the multi-hazards, vulnerability, exposure and resilience. To deal with these challenges it is necessary to consider the connections between the exposed elements (e.g. populations, schools, hospital, etc.) and to quantify the relative importance of the elements and their interconnections (e.g. the need of injured people to go to hospital or children to school). In a system (e.g. road, hospital and ecological network, etc.), or in a System of System (e.g. socio-technical urban service), there are critical elements that, beyond the intrinsic vulnerability, can be characterized by greater or lower vulnerability because of their physical, geographical, cyber or logical connections. To this aim, we propose in this study a comparative analysis between traditional reductionist approach and a new holistic approach to vulnerability assessment to natural hazards. The analysis considers a study case of a socio-economic complex system through an innovative approach based on the properties of graph G=(N,L). A graph consists of two sets N (nodes) and L (links): the nodes represent the single exposed elements (physical, social, environmental, etc.) to a hazard, while the links (or connections) represent the interaction between the elements. The final goal is to illustrate an application of this innovative approach of integrated collective vulnerability assessment.

  20. Survey of Approaches to Generate Realistic Synthetic Graphs

    Energy Technology Data Exchange (ETDEWEB)

    Lim, Seung-Hwan [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Lee, Sangkeun [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Powers, Sarah S [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Shankar, Mallikarjun [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Imam, Neena [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)

    2016-10-01

    A graph is a flexible data structure that can represent relationships between entities. As with other data analysis tasks, the use of realistic graphs is critical to obtaining valid research results. Unfortunately, using the actual ("real-world") graphs for research and new algorithm development is difficult due to the presence of sensitive information in the data or due to the scale of data. This results in practitioners developing algorithms and systems that employ synthetic graphs instead of real-world graphs. Generating realistic synthetic graphs that provide reliable statistical confidence to algorithmic analysis and system evaluation involves addressing technical hurdles in a broad set of areas. This report surveys the state of the art in approaches to generate realistic graphs that are derived from fitted graph models on real-world graphs.

  1. Solved and unsolved problems of chemical graph theory

    International Nuclear Information System (INIS)

    Trinajstic, N.; Klein, D.J.; Randic, M.

    1986-01-01

    The development of several novel graph theoretical concepts and their applications in different branches of chemistry are reviewed. After a few introductory remarks they follow with an outline of selected important graph theoretical invariants, introducing some new results and indicating some open problems. They continue with discussing the problem of graph characterization and construction of graphs of chemical interest, with a particular emphasis on large systems. Finally they consider various problems and difficulties associated with special subgraphs, including subgraphs representing Kekule valence structures. The paper ends with a brief review of structure-property and structure-activity correlations, the topic which is one of prime motivations for application of graph theory to chemistry

  2. Equity trees and graphs via information theory

    Science.gov (United States)

    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.

  3. Embedded graph invariants in Chern-Simons theory

    International Nuclear Information System (INIS)

    Major, Seth A.

    1999-01-01

    Chern-Simons gauge theory, since its inception as a topological quantum field theory, has proved to be a rich source of understanding for knot invariants. In this work the theory is used to explore the definition of the expectation value of a network of Wilson lines -- an embedded graph invariant. Using a generalization of the variational method, lowest-order results for invariants for graphs of arbitrary valence and general vertex tangent space structure are derived. Gauge invariant operators are introduced. Higher order results are found. The method used here provides a Vassiliev-type definition of graph invariants which depend on both the embedding of the graph and the group structure of the gauge theory. It is found that one need not frame individual vertices. However, without a global projection of the graph there is an ambiguity in the relation of the decomposition of distinct vertices. It is suggested that framing may be seen as arising from this ambiguity -- as a way of relating frames at distinct vertices

  4. Mechanical system reliability analysis using a combination of graph theory and Boolean function

    International Nuclear Information System (INIS)

    Tang, J.

    2001-01-01

    A new method based on graph theory and Boolean function for assessing reliability of mechanical systems is proposed. The procedure for this approach consists of two parts. By using the graph theory, the formula for the reliability of a mechanical system that considers the interrelations of subsystems or components is generated. Use of the Boolean function to examine the failure interactions of two particular elements of the system, followed with demonstrations of how to incorporate such failure dependencies into the analysis of larger systems, a constructive algorithm for quantifying the genuine interconnections between the subsystems or components is provided. The combination of graph theory and Boolean function provides an effective way to evaluate the reliability of a large, complex mechanical system. A numerical example demonstrates that this method an effective approaches in system reliability analysis

  5. Modeling of tethered satellite formations using graph theory

    DEFF Research Database (Denmark)

    Larsen, Martin Birkelund; Smith, Roy S; Blanke, Mogens

    2011-01-01

    satellite formation and proposes a method to deduce the equations of motion for the attitude dynamics of the formation in a compact form. The use of graph theory and Lagrange mechanics together allows a broad class of formations to be described using the same framework. A method is stated for finding...

  6. Vertex maps on graphs -- Perron-Frobenius Theory

    OpenAIRE

    Bernhardt, Chris

    2015-01-01

    The goal of this paper is to describe the connections between Perron-Frobenius theory and vertex maps on graphs. In particular, it is shown how Perron-Frobenius theory gives results about the sets of integers that can arise as periods of periodic orbits, about the concepts of transitivity and topological mixing, and about horseshoes and topological entropy. This is a preprint. The final version will appear in the Journal of Difference Equations and Applications.

  7. ARTICLE Robust Diagnosis of Mechatronics System by Bond Graph Approach

    Directory of Open Access Journals (Sweden)

    Abderrahmene Sellami

    2018-03-01

    Full Text Available This article presents design of a robust diagnostic system based on bond graph model for a mechatronic system. Mechatronics is the synergistic and systemic combination of mechanics, electronics and computer science. The design of a mechatronic system modeled by the bond graph model becomes easier and more generous. The bond graph tool is a unified graphical language for all areas of engineering sciences and confirmed as a structured approach to modeling and simulation of multidisciplinary systems.

  8. Simulating activation propagation in social networks using the graph theory

    Directory of Open Access Journals (Sweden)

    František Dařena

    2010-01-01

    Full Text Available The social-network formation and analysis is nowadays one of objects that are in a focus of intensive research. The objective of the paper is to suggest the perspective of representing social networks as graphs, with the application of the graph theory to problems connected with studying the network-like structures and to study spreading activation algorithm for reasons of analyzing these structures. The paper presents the process of modeling multidimensional networks by means of directed graphs with several characteristics. The paper also demonstrates using Spreading Activation algorithm as a good method for analyzing multidimensional network with the main focus on recommender systems. The experiments showed that the choice of parameters of the algorithm is crucial, that some kind of constraint should be included and that the algorithm is able to provide a stable environment for simulations with networks.

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

    Science.gov (United States)

    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…

  10. Support vector machine classification of Major Depressive Disorder using diffusion-weighted neuroimaging and graph theory

    Directory of Open Access Journals (Sweden)

    Matthew D Sacchet

    2015-02-01

    Full Text Available Recently there has been considerable interest in understanding brain networks in Major Depressive Disorder (MDD. Neural pathways can be tracked in the living brain using diffusion weighted imaging (DWI; graph theory can then be used to study properties of the resulting fiber networks. To date, global abnormalities have not been reported in tractography-based graph metrics in MDD, so we used a machine learning approach based on ‘support vector machines’ to differentiate depressed from healthy individuals based on multiple brain network properties. We also assessed how important specific graph metrics were for this differentiation. Finally, we conducted a local graph analysis to identify abnormal connectivity at specific nodes of the network. We were able to classify depression using whole-brain graph metrics. Small-worldness was the most useful graph metric for classification. The right pars orbitalis, right inferior parietal cortex, and left rostral anterior cingulate all showed abnormal network connectivity in MDD. This is the first use of structural global graph metrics to classify depressed individuals. These findings highlight the importance of future research to understand network properties in depression across imaging modalities, improve classification results, and relate network alterations to psychiatric symptoms, medication, and co-morbidities.

  11. Support vector machine classification of major depressive disorder using diffusion-weighted neuroimaging and graph theory.

    Science.gov (United States)

    Sacchet, Matthew D; Prasad, Gautam; Foland-Ross, Lara C; Thompson, Paul M; Gotlib, Ian H

    2015-01-01

    Recently, there has been considerable interest in understanding brain networks in major depressive disorder (MDD). Neural pathways can be tracked in the living brain using diffusion-weighted imaging (DWI); graph theory can then be used to study properties of the resulting fiber networks. To date, global abnormalities have not been reported in tractography-based graph metrics in MDD, so we used a machine learning approach based on "support vector machines" to differentiate depressed from healthy individuals based on multiple brain network properties. We also assessed how important specific graph metrics were for this differentiation. Finally, we conducted a local graph analysis to identify abnormal connectivity at specific nodes of the network. We were able to classify depression using whole-brain graph metrics. Small-worldness was the most useful graph metric for classification. The right pars orbitalis, right inferior parietal cortex, and left rostral anterior cingulate all showed abnormal network connectivity in MDD. This is the first use of structural global graph metrics to classify depressed individuals. These findings highlight the importance of future research to understand network properties in depression across imaging modalities, improve classification results, and relate network alterations to psychiatric symptoms, medication, and comorbidities.

  12. Semantic Mining based on graph theory and ontologies. Case Study: Cell Signaling Pathways

    Directory of Open Access Journals (Sweden)

    Carlos R. Rangel

    2016-08-01

    Full Text Available In this paper we use concepts from graph theory and cellular biology represented as ontologies, to carry out semantic mining tasks on signaling pathway networks. Specifically, the paper describes the semantic enrichment of signaling pathway networks. A cell signaling network describes the basic cellular activities and their interactions. The main contribution of this paper is in the signaling pathway research area, it proposes a new technique to analyze and understand how changes in these networks may affect the transmission and flow of information, which produce diseases such as cancer and diabetes. Our approach is based on three concepts from graph theory (modularity, clustering and centrality frequently used on social networks analysis. Our approach consists into two phases: the first uses the graph theory concepts to determine the cellular groups in the network, which we will call them communities; the second uses ontologies for the semantic enrichment of the cellular communities. The measures used from the graph theory allow us to determine the set of cells that are close (for example, in a disease, and the main cells in each community. We analyze our approach in two cases: TGF-ß and the Alzheimer Disease.

  13. Augmenting Conceptual Design Trajectory Tradespace Exploration with Graph Theory

    Science.gov (United States)

    Dees, Patrick D.; Zwack, Mathew R.; Steffens, Michael; Edwards, Stephen

    2016-01-01

    Within conceptual design changes occur rapidly due to a combination of uncertainty and shifting requirements. To stay relevant in this fluid time, trade studies must also be performed rapidly. In order to drive down analysis time while improving the information gained by these studies, surrogate models can be created to represent the complex output of a tool or tools within a specified tradespace. In order to create this model however, a large amount of data must be collected in a short amount of time. By this method, the historical approach of relying on subject matter experts to generate the data required is schedule infeasible. However, by implementing automation and distributed analysis the required data can be generated in a fraction of the time. Previous work focused on setting up a tool called multiPOST capable of orchestrating many simultaneous runs of an analysis tool assessing these automated analyses utilizing heuristics gleaned from the best practices of current subject matter experts. In this update to the previous work, elements of graph theory are included to further drive down analysis time by leveraging data previously gathered. It is shown to outperform the previous method in both time required, and the quantity and quality of data produced.

  14. Utilization of graph theory in security analysis of power grid

    Directory of Open Access Journals (Sweden)

    Dalibor Válek

    2014-12-01

    Full Text Available This paper describes way how to use graph theory in security analysis. As an environment is used network of power lines and devices which are included here. Power grid is considered as a system of nodes which make together graph (network. On the simple example is applied Fiedler´s theory which is able to select the most important power lines of whole network. Components related to these lines are logicly ordered and considered by author´s modified analysis. This method has been improved and optimalized for risks related with illegal acts. Each power grid component has been connected with possible kind of attack and every of this device was gradually evaluated by five coefficients which takes values from 1 to 10. On the coefficient basis was assessed the level of risk. In the last phase the most risky power grid components have been selected. On the selected devices have been proposed security measures.

  15. Visibility graph approach to exchange rate series

    Science.gov (United States)

    Yang, Yue; Wang, Jianbo; Yang, Huijie; Mang, Jingshi

    2009-10-01

    By means of a visibility graph, we investigate six important exchange rate series. It is found that the series convert into scale-free and hierarchically structured networks. The relationship between the scaling exponents of the degree distributions and the Hurst exponents obeys the analytical prediction for fractal Brownian motions. The visibility graph can be used to obtain reliable values of Hurst exponents of the series. The characteristics are explained by using the multifractal structures of the series. The exchange rate of EURO to Japanese Yen is widely used to evaluate risk and to estimate trends in speculative investments. Interestingly, the hierarchies of the visibility graphs for the exchange rate series of these two currencies are significantly weak compared with that of the other series.

  16. Comparing brain networks of different size and connectivity density using graph theory.

    Directory of Open Access Journals (Sweden)

    Bernadette C M van Wijk

    Full Text Available 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.

  17. Analyzing Spatial Behavior of Backcountry Skiers in Mountain Protected Areas Combining GPS Tracking and Graph Theory

    Directory of Open Access Journals (Sweden)

    Karolina Taczanowska

    2017-12-01

    Full Text Available Mountain protected areas (PAs aim to preserve vulnerable environments and at the same time encourage numerous outdoor leisure activities. Understanding the way people use natural environments is crucial to balance the needs of visitors and site capacities. This study aims to develop an approach to evaluate the structure and use of designated skiing zones in PAs combining Global Positioning System (GPS tracking and analytical methods based on graph theory. The study is based on empirical data (n = 609 GPS tracks of backcountry skiers collected in Tatra National Park (TNP, Poland. The physical structure of the entire skiing zones system has been simplified into a graph structure (structural network; undirected graph. In a second step, the actual use of the area by skiers (functional network; directed graph was analyzed using a graph-theoretic approach. Network coherence (connectivity indices: β, γ, α, movement directions at path segments, and relative importance of network nodes (node centrality measures: degree, betweenness, closeness, and proximity prestige were calculated. The system of designated backcountry skiing zones was not evenly used by the visitors. Therefore, the calculated parameters differ significantly between the structural and the functional network. In particular, measures related to the actually used trails are of high importance from the management point of view. Information about the most important node locations can be used for planning sign-posts, on-site maps, interpretative boards, or other tourist infrastructure.

  18. Graph theory and binary alloys passivated by nickel

    International Nuclear Information System (INIS)

    McCafferty, E.

    2005-01-01

    The passivity of a nickel binary alloy is considered in terms of a network of -Ni-O-Ni- bridges in the oxide film, where Ni is the component of the binary alloy which produces passivity. The structure of the oxide is represented by a mathematical graph, and graph theory is used to calculate the connectivity of the oxide, given by the product of the number of edges in the graph and the Randic index. A stochastic calculation is employed to insert ions of the second metal into the oxide film so as to disrupt the connectivity of the -Ni-O-Ni- network. This disruption occurs at a critical ionic concentration of the oxide film. Mathematical relationships are developed for the introduction of a general ion B +n into the oxide film, and critical ionic compositions are calculated for oxide films on the nickel binary alloys. The notation B refers to any metal B which produces B +n ions in the oxide film, where +n is the oxidation number of the ion. The results of this analysis for Fe-Ni and Cu-Ni binary alloys are in good agreement with experimental results

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

    Science.gov (United States)

    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

  20. Hadronic equation of state in the statistical bootstrap model and linear graph theory

    International Nuclear Information System (INIS)

    Fre, P.; Page, R.

    1976-01-01

    Taking a statistical mechanical point og view, the statistical bootstrap model is discussed and, from a critical analysis of the bootstrap volume comcept, it is reached a physical ipothesis, which leads immediately to the hadronic equation of state provided by the bootstrap integral equation. In this context also the connection between the statistical bootstrap and the linear graph theory approach to interacting gases is analyzed

  1. A hierarchical approach to reducing communication in parallel graph algorithms

    KAUST Repository

    Harshvardhan,

    2015-01-01

    Large-scale graph computing has become critical due to the ever-increasing size of data. However, distributed graph computations are limited in their scalability and performance due to the heavy communication inherent in such computations. This is exacerbated in scale-free networks, such as social and web graphs, which contain hub vertices that have large degrees and therefore send a large number of messages over the network. Furthermore, many graph algorithms and computations send the same data to each of the neighbors of a vertex. Our proposed approach recognizes this, and reduces communication performed by the algorithm without change to user-code, through a hierarchical machine model imposed upon the input graph. The hierarchical model takes advantage of locale information of the neighboring vertices to reduce communication, both in message volume and total number of bytes sent. It is also able to better exploit the machine hierarchy to further reduce the communication costs, by aggregating traffic between different levels of the machine hierarchy. Results of an implementation in the STAPL GL shows improved scalability and performance over the traditional level-synchronous approach, with 2.5 × - 8× improvement for a variety of graph algorithms at 12, 000+ cores.

  2. Graph theory favorite conjectures and open problems 1

    CERN Document Server

    Hedetniemi, Stephen; Larson, Craig

    2016-01-01

    This is the first in a series of volumes, which provide an extensive overview of conjectures and open problems in graph theory. The readership of each volume is geared toward graduate students who may be searching for research ideas. However, the well-established mathematician will find the overall exposition engaging and enlightening. Each chapter, presented in a story-telling style, includes more than a simple collection of results on a particular topic. Each contribution conveys the history, evolution, and techniques used to solve the authors’ favorite conjectures and open problems, enhancing the reader’s overall comprehension and enthusiasm. The editors were inspired to create these volumes by the popular and well attended special sessions, entitled “My Favorite Graph Theory Conjectures," which were held at the winter AMS/MAA Joint Meeting in Boston (January, 2012), the SIAM Conference on Discrete Mathematics in Halifax (June,2012) and the winter AMS/MAA Joint meeting in Baltimore(January, 2014). In...

  3. Identifying patients with Alzheimer's disease using resting-state fMRI and graph theory.

    Science.gov (United States)

    Khazaee, Ali; Ebrahimzadeh, Ata; Babajani-Feremi, Abbas

    2015-11-01

    Study of brain network on the basis of resting-state functional magnetic resonance imaging (fMRI) has provided promising results to investigate changes in connectivity among different brain regions because of diseases. Graph theory can efficiently characterize different aspects of the brain network by calculating measures of integration and segregation. In this study, we combine graph theoretical approaches with advanced machine learning methods to study functional brain network alteration in patients with Alzheimer's disease (AD). Support vector machine (SVM) was used to explore the ability of graph measures in diagnosis of AD. We applied our method on the resting-state fMRI data of twenty patients with AD and twenty age and gender matched healthy subjects. The data were preprocessed and each subject's graph was constructed by parcellation of the whole brain into 90 distinct regions using the automated anatomical labeling (AAL) atlas. The graph measures were then calculated and used as the discriminating features. Extracted network-based features were fed to different feature selection algorithms to choose most significant features. In addition to the machine learning approach, statistical analysis was performed on connectivity matrices to find altered connectivity patterns in patients with AD. Using the selected features, we were able to accurately classify patients with AD from healthy subjects with accuracy of 100%. Results of this study show that pattern recognition and graph of brain network, on the basis of the resting state fMRI data, can efficiently assist in the diagnosis of AD. Classification based on the resting-state fMRI can be used as a non-invasive and automatic tool to diagnosis of Alzheimer's disease. Copyright © 2015 International Federation of Clinical Neurophysiology. All rights reserved.

  4. GCPSO in cooperation with graph theory to distribution network reconfiguration for energy saving

    International Nuclear Information System (INIS)

    Assadian, Mehdi; Farsangi, Malihe M.; Nezamabadi-pour, Hossein

    2010-01-01

    Network reconfiguration for loss reduction in distribution system is an important way to save energy. This paper investigates the ability of guaranteed convergence particle swarm optimization (GCPSO) and particle swarm optimization (PSO) in cooperation with graph theory for network reconfiguration to reduce the power loss and enhancement of voltage profile of distribution systems. Numerical results of three distribution systems are presented which illustrate the feasibility of the proposed method by GCPSO and PSO using the graph theory. To validate the obtained results, genetic algorithm (GA) using graph theory is also applied and is compared with the proposed GCPSO and PSO using graph theory.

  5. What Would a Graph Look Like in this Layout? A Machine Learning Approach to Large Graph Visualization.

    Science.gov (United States)

    Kwon, Oh-Hyun; Crnovrsanin, Tarik; Ma, Kwan-Liu

    2018-01-01

    Using different methods for laying out a graph can lead to very different visual appearances, with which the viewer perceives different information. Selecting a "good" layout method is thus important for visualizing a graph. The selection can be highly subjective and dependent on the given task. A common approach to selecting a good layout is to use aesthetic criteria and visual inspection. However, fully calculating various layouts and their associated aesthetic metrics is computationally expensive. In this paper, we present a machine learning approach to large graph visualization based on computing the topological similarity of graphs using graph kernels. For a given graph, our approach can show what the graph would look like in different layouts and estimate their corresponding aesthetic metrics. An important contribution of our work is the development of a new framework to design graph kernels. Our experimental study shows that our estimation calculation is considerably faster than computing the actual layouts and their aesthetic metrics. Also, our graph kernels outperform the state-of-the-art ones in both time and accuracy. In addition, we conducted a user study to demonstrate that the topological similarity computed with our graph kernel matches perceptual similarity assessed by human users.

  6. TrajGraph: A Graph-Based Visual Analytics Approach to Studying Urban Network Centralities Using Taxi Trajectory Data.

    Science.gov (United States)

    Huang, Xiaoke; Zhao, Ye; Yang, Jing; Zhang, Chong; Ma, Chao; Ye, Xinyue

    2016-01-01

    We propose TrajGraph, a new visual analytics method, for studying urban mobility patterns by integrating graph modeling and visual analysis with taxi trajectory data. A special graph is created to store and manifest real traffic information recorded by taxi trajectories over city streets. It conveys urban transportation dynamics which can be discovered by applying graph analysis algorithms. To support interactive, multiscale visual analytics, a graph partitioning algorithm is applied to create region-level graphs which have smaller size than the original street-level graph. Graph centralities, including Pagerank and betweenness, are computed to characterize the time-varying importance of different urban regions. The centralities are visualized by three coordinated views including a node-link graph view, a map view and a temporal information view. Users can interactively examine the importance of streets to discover and assess city traffic patterns. We have implemented a fully working prototype of this approach and evaluated it using massive taxi trajectories of Shenzhen, China. TrajGraph's capability in revealing the importance of city streets was evaluated by comparing the calculated centralities with the subjective evaluations from a group of drivers in Shenzhen. Feedback from a domain expert was collected. The effectiveness of the visual interface was evaluated through a formal user study. We also present several examples and a case study to demonstrate the usefulness of TrajGraph in urban transportation analysis.

  7. Poor textural image tie point matching via graph theory

    Science.gov (United States)

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

    2017-07-01

    Feature matching aims to find corresponding points to serve as tie points between images. Robust matching is still a challenging task when input images are characterized by low contrast or contain repetitive patterns, occlusions, or homogeneous textures. In this paper, a novel feature matching algorithm based on graph theory is proposed. This algorithm integrates both geometric and radiometric constraints into an edge-weighted (EW) affinity tensor. Tie points are then obtained by high-order graph matching. Four pairs of poor textural images covering forests, deserts, bare lands, and urban areas are tested. For comparison, three state-of-the-art matching techniques, namely, scale-invariant feature transform (SIFT), speeded up robust features (SURF), and features from accelerated segment test (FAST), are also used. The experimental results show that the matching recall obtained by SIFT, SURF, and FAST varies from 0 to 35% in different types of poor textures. However, through the integration of both geometry and radiometry and the EW strategy, the recall obtained by the proposed algorithm is better than 50% in all four image pairs. The better matching recall improves the number of correct matches, dispersion, and positional accuracy.

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

    Science.gov (United States)

    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

  9. Application of graph theory to the morphological analysis of settlements

    OpenAIRE

    Szmytkie Robert

    2017-01-01

    In the following paper, the analyses of morphology of settlements were conducted using graph methods. The intention of the author was to create a quantifiable and simple measure, which, in a quantitative way, would express the degree of development of a graph (the spatial pattern of settlement). When analysing examples of graphs assigned to a set of small towns and large villages, it was noticed that the graph development index should depend on: a relative number of edges in relation to the n...

  10. Using Zipf-Mandelbrot law and graph theory to evaluate animal welfare

    Science.gov (United States)

    de Oliveira, Caprice G. L.; Miranda, José G. V.; Japyassú, Hilton F.; El-Hani, Charbel N.

    2018-02-01

    This work deals with the construction and testing of metrics of welfare based on behavioral complexity, using assumptions derived from Zipf-Mandelbrot law and graph theory. To test these metrics we compared yellow-breasted capuchins (Sapajus xanthosternos) (Wied-Neuwied, 1826) (PRIMATES CEBIDAE) found in two institutions, subjected to different captive conditions: a Zoobotanical Garden (hereafter, ZOO; n = 14), in good welfare condition, and a Wildlife Rescue Center (hereafter, WRC; n = 8), in poor welfare condition. In the Zipf-Mandelbrot-based analysis, the power law exponent was calculated using behavior frequency values versus behavior rank value. These values allow us to evaluate variations in individual behavioral complexity. For each individual we also constructed a graph using the sequence of behavioral units displayed in each recording (average recording time per individual: 4 h 26 min in the ZOO, 4 h 30 min in the WRC). Then, we calculated the values of the main graph attributes, which allowed us to analyze the complexity of the connectivity of the behaviors displayed in the individuals' behavioral sequences. We found significant differences between the two groups for the slope values in the Zipf-Mandelbrot analysis. The slope values for the ZOO individuals approached -1, with graphs representing a power law, while the values for the WRC individuals diverged from -1, differing from a power law pattern. Likewise, we found significant differences for the graph attributes average degree, weighted average degree, and clustering coefficient when comparing the ZOO and WRC individual graphs. However, no significant difference was found for the attributes modularity and average path length. Both analyses were effective in detecting differences between the patterns of behavioral complexity in the two groups. The slope values for the ZOO individuals indicated a higher behavioral complexity when compared to the WRC individuals. Similarly, graph construction and the

  11. Political Discourse Analysis Through Solving Problems of Graph Theory

    Directory of Open Access Journals (Sweden)

    Monica Patrut

    2010-03-01

    Full Text Available In this article, we show how, using graph theory, we can make a content analysis of political discourse. Assumptions of this analysis are:
    - we have a corpus of speech of each party or candidate;
    - we consider that speech conveys economic, political, socio-cultural values, these taking the form of words or word families;
    - we consider that there are interdependences between the values of a political discourse; they are given by the co-occurrence of two values, as words in the text, within a well defined fragment, or they are determined by the internal logic of political discourse;
    - established links between values in a political speech have associated positive numbers indicating the "power" of those links; these "powers" are defined according to both the number of co-occurrences of values, and the internal logic of the discourse where they occur.
    In this context we intend to highlight the following:
    a which is the dominant value in a political speech;
    b which groups of values have ties between them and have no connection with the rest;
    c which is the order in which political values should be set in order to obtain an equivalent but more synthetic speech compared to the already given one;
    d which are the links between values that form the "core" political speech.
    To solve these problems, we shall use the Political Analyst program. After that, we shall present the concepts necessary to the understanding of the introductory graph theory, useful in understanding the analysis of the software and then the operation of the program. This paper extends the previous paper [6].

  12. Factors and factorizations of graphs proof techniques in factor theory

    CERN Document Server

    Akiyama, Jin

    2011-01-01

    This book chronicles the development of graph factors and factorizations. It pursues a comprehensive approach, addressing most of the important results from hundreds of findings over the last century. One of the main themes is the observation that many theorems can be proved using only a few standard proof techniques. This stands in marked contrast to the seemingly countless, complex proof techniques offered by the extant body of papers and books. In addition to covering the history and development of this area, the book offers conjectures and discusses open problems. It also includes numerous explanatory figures that enable readers to progressively and intuitively understand the most important notions and proofs in the area of factors and factorization.

  13. An Application of Graph Theory in Markov Chains Reliability Analysis

    Directory of Open Access Journals (Sweden)

    Pavel Skalny

    2014-01-01

    Full Text Available The paper presents reliability analysis which was realized for an industrial company. The aim of the paper is to present the usage of discrete time Markov chains and the flow in network approach. Discrete Markov chains a well-known method of stochastic modelling describes the issue. The method is suitable for many systems occurring in practice where we can easily distinguish various amount of states. Markov chains are used to describe transitions between the states of the process. The industrial process is described as a graph network. The maximal flow in the network corresponds to the production. The Ford-Fulkerson algorithm is used to quantify the production for each state. The combination of both methods are utilized to quantify the expected value of the amount of manufactured products for the given time period.

  14. Valued Graphs and the Representation Theory of Lie Algebras

    Directory of Open Access Journals (Sweden)

    Joel Lemay

    2012-07-01

    Full Text Available Quivers (directed graphs, species (a generalization of quivers and their representations play a key role in many areas of mathematics including combinatorics, geometry, and algebra. Their importance is especially apparent in their applications to the representation theory of associative algebras, Lie algebras, and quantum groups. In this paper, we discuss the most important results in the representation theory of species, such as Dlab and Ringel’s extension of Gabriel’s theorem, which classifies all species of finite and tame representation type. We also explain the link between species and K-species (where K is a field. Namely, we show that the category of K -species can be viewed as a subcategory of the category of species. Furthermore, we prove two results about the structure of the tensor ring of a species containing no oriented cycles. Specifically, we prove that two such species have isomorphic tensor rings if and only if they are isomorphic as “crushed” species, and we show that if K is a perfect field, then the tensor algebra of a K -species tensored with the algebraic closure of K is isomorphic to, or Morita equivalent to, the path algebra of a quiver.

  15. Engineering system dynamics a unified graph-centered approach

    CERN Document Server

    Brown, Forbes T

    2006-01-01

    For today's students, learning to model the dynamics of complex systems is increasingly important across nearly all engineering disciplines. First published in 2001, Forbes T. Brown's Engineering System Dynamics: A Unified Graph-Centered Approach introduced students to a unique and highly successful approach to modeling system dynamics using bond graphs. Updated with nearly one-third new material, this second edition expands this approach to an even broader range of topics. What's New in the Second Edition? In addition to new material, this edition was restructured to build students' competence in traditional linear mathematical methods before they have gone too far into the modeling that still plays a pivotal role. New topics include magnetic circuits and motors including simulation with magnetic hysteresis; extensive new material on the modeling, analysis, and simulation of distributed-parameter systems; kinetic energy in thermodynamic systems; and Lagrangian and Hamiltonian methods. MATLAB(R) figures promi...

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

    Science.gov (United States)

    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.

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

    Science.gov (United States)

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

    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.

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

    Science.gov (United States)

    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.

  19. Information Retrieval and Graph Analysis Approaches for Book Recommendation.

    Science.gov (United States)

    Benkoussas, Chahinez; Bellot, Patrice

    2015-01-01

    A combination of multiple information retrieval approaches is proposed for the purpose of book recommendation. In this paper, book recommendation is based on complex user's query. We used different theoretical retrieval models: probabilistic as InL2 (Divergence from Randomness model) and language model and tested their interpolated combination. Graph analysis algorithms such as PageRank have been successful in Web environments. We consider the application of this algorithm in a new retrieval approach to related document network comprised of social links. We called Directed Graph of Documents (DGD) a network constructed with documents and social information provided from each one of them. Specifically, this work tackles the problem of book recommendation in the context of INEX (Initiative for the Evaluation of XML retrieval) Social Book Search track. A series of reranking experiments demonstrate that combining retrieval models yields significant improvements in terms of standard ranked retrieval metrics. These results extend the applicability of link analysis algorithms to different environments.

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

    International Nuclear Information System (INIS)

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

    2008-01-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

  1. Information Retrieval and Graph Analysis Approaches for Book Recommendation

    OpenAIRE

    Chahinez Benkoussas; Patrice Bellot

    2015-01-01

    A combination of multiple information retrieval approaches is proposed for the purpose of book recommendation. In this paper, book recommendation is based on complex user's query. We used different theoretical retrieval models: probabilistic as InL2 (Divergence from Randomness model) and language model and tested their interpolated combination. Graph analysis algorithms such as PageRank have been successful in Web environments. We consider the application of this algorithm in a new retrieval ...

  2. Simplicial complexes of graphs

    CERN Document Server

    Jonsson, Jakob

    2008-01-01

    A graph complex is a finite family of graphs closed under deletion of edges. Graph complexes show up naturally in many different areas of mathematics, including commutative algebra, geometry, and knot theory. Identifying each graph with its edge set, one may view a graph complex as a simplicial complex and hence interpret it as a geometric object. This volume examines topological properties of graph complexes, focusing on homotopy type and homology. Many of the proofs are based on Robin Forman's discrete version of Morse theory. As a byproduct, this volume also provides a loosely defined toolbox for attacking problems in topological combinatorics via discrete Morse theory. In terms of simplicity and power, arguably the most efficient tool is Forman's divide and conquer approach via decision trees; it is successfully applied to a large number of graph and digraph complexes.

  3. Geographic information modeling of Econet of Northwestern Federal District territory on graph theory basis

    Science.gov (United States)

    Kopylova, N. S.; Bykova, A. A.; Beregovoy, D. N.

    2018-05-01

    Based on the landscape-geographical approach, a structural and logical scheme for the Northwestern Federal District Econet has been developed, which can be integrated into the federal and world ecological network in order to improve the environmental infrastructure of the region. The method of Northwestern Federal District Econet organization on the basis of graph theory by means of the Quantum GIS geographic information system is proposed as an effective mean of preserving and recreating the unique biodiversity of landscapes, regulation of the sphere of environmental protection.

  4. Generating loop graphs via Hopf algebra in quantum field theory

    International Nuclear Information System (INIS)

    Mestre, Angela; Oeckl, Robert

    2006-01-01

    We use the Hopf algebra structure of the time-ordered algebra of field operators to generate all connected weighted Feynman graphs in a recursive and efficient manner. The algebraic representation of the graphs is such that they can be evaluated directly as contributions to the connected n-point functions. The recursion proceeds by loop order and vertex number

  5. Application of graph theory to the morphological analysis of settlements

    Directory of Open Access Journals (Sweden)

    Szmytkie Robert

    2017-12-01

    Full Text Available In the following paper, the analyses of morphology of settlements were conducted using graph methods. The intention of the author was to create a quantifiable and simple measure, which, in a quantitative way, would express the degree of development of a graph (the spatial pattern of settlement. When analysing examples of graphs assigned to a set of small towns and large villages, it was noticed that the graph development index should depend on: a relative number of edges in relation to the number of nodes (β index, the number of cycles (urban blocks, which evidences the complexity of the spatial pattern of settlement, and the average rank of nodes of a graph, which expresses the degree of complexity of a street network.

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

    Science.gov (United States)

    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…

  7. Discrete Mathematics - Special Issue: Graph Theory - dedicated to Carsten Thomassen on his 60th birthday

    DEFF Research Database (Denmark)

    2011-01-01

    Carsten Thomassen belongs to the worlds's absolute top graph theorists, and to the world's top mathematicians in general. The special issue is a rather somewhat random collection of good papers in graph theory, by many different authors, dedicated to Carsten Thomassen on his 60th birthday. Guest ...

  8. An approach to multiscale modelling with graph grammars.

    Science.gov (United States)

    Ong, Yongzhi; Streit, Katarína; Henke, Michael; Kurth, Winfried

    2014-09-01

    Functional-structural plant models (FSPMs) simulate biological processes at different spatial scales. Methods exist for multiscale data representation and modification, but the advantages of using multiple scales in the dynamic aspects of FSPMs remain unclear. Results from multiscale models in various other areas of science that share fundamental modelling issues with FSPMs suggest that potential advantages do exist, and this study therefore aims to introduce an approach to multiscale modelling in FSPMs. A three-part graph data structure and grammar is revisited, and presented with a conceptual framework for multiscale modelling. The framework is used for identifying roles, categorizing and describing scale-to-scale interactions, thus allowing alternative approaches to model development as opposed to correlation-based modelling at a single scale. Reverse information flow (from macro- to micro-scale) is catered for in the framework. The methods are implemented within the programming language XL. Three example models are implemented using the proposed multiscale graph model and framework. The first illustrates the fundamental usage of the graph data structure and grammar, the second uses probabilistic modelling for organs at the fine scale in order to derive crown growth, and the third combines multiscale plant topology with ozone trends and metabolic network simulations in order to model juvenile beech stands under exposure to a toxic trace gas. The graph data structure supports data representation and grammar operations at multiple scales. The results demonstrate that multiscale modelling is a viable method in FSPM and an alternative to correlation-based modelling. Advantages and disadvantages of multiscale modelling are illustrated by comparisons with single-scale implementations, leading to motivations for further research in sensitivity analysis and run-time efficiency for these models.

  9. Distributed Cooperative Optimal Control for Multiagent Systems on Directed Graphs: An Inverse Optimal Approach.

    Science.gov (United States)

    Zhang, Huaguang; Feng, Tao; Yang, Guang-Hong; Liang, Hongjing

    2015-07-01

    In this paper, the inverse optimal approach is employed to design distributed consensus protocols that guarantee consensus and global optimality with respect to some quadratic performance indexes for identical linear systems on a directed graph. The inverse optimal theory is developed by introducing the notion of partial stability. As a result, the necessary and sufficient conditions for inverse optimality are proposed. By means of the developed inverse optimal theory, the necessary and sufficient conditions are established for globally optimal cooperative control problems on directed graphs. Basic optimal cooperative design procedures are given based on asymptotic properties of the resulting optimal distributed consensus protocols, and the multiagent systems can reach desired consensus performance (convergence rate and damping rate) asymptotically. Finally, two examples are given to illustrate the effectiveness of the proposed methods.

  10. Artistic image analysis using graph-based learning approaches.

    Science.gov (United States)

    Carneiro, Gustavo

    2013-08-01

    We introduce a new methodology for the problem of artistic image analysis, which among other tasks, involves the automatic identification of visual classes present in an art work. In this paper, we advocate the idea that artistic image analysis must explore a graph that captures the network of artistic influences by computing the similarities in terms of appearance and manual annotation. One of the novelties of our methodology is the proposed formulation that is a principled way of combining these two similarities in a single graph. Using this graph, we show that an efficient random walk algorithm based on an inverted label propagation formulation produces more accurate annotation and retrieval results compared with the following baseline algorithms: bag of visual words, label propagation, matrix completion, and structural learning. We also show that the proposed approach leads to a more efficient inference and training procedures. This experiment is run on a database containing 988 artistic images (with 49 visual classification problems divided into a multiclass problem with 27 classes and 48 binary problems), where we show the inference and training running times, and quantitative comparisons with respect to several retrieval and annotation performance measures.

  11. A Multi-Level Middle-Out Cross-Zooming Approach for Large Graph Analytics

    Energy Technology Data Exchange (ETDEWEB)

    Wong, Pak C.; Mackey, Patrick S.; Cook, Kristin A.; Rohrer, Randall M.; Foote, Harlan P.; Whiting, Mark A.

    2009-10-11

    This paper presents a working graph analytics model that embraces the strengths of the traditional top-down and bottom-up approaches with a resilient crossover concept to exploit the vast middle-ground information overlooked by the two extreme analytical approaches. Our graph analytics model is developed in collaboration with researchers and users, who carefully studied the functional requirements that reflect the critical thinking and interaction pattern of a real-life intelligence analyst. To evaluate the model, we implement a system prototype, known as GreenHornet, which allows our analysts to test the theory in practice, identify the technological and usage-related gaps in the model, and then adapt the new technology in their work space. The paper describes the implementation of GreenHornet and compares its strengths and weaknesses against the other prevailing models and tools.

  12. Quantum entanglement in non-local games, graph parameters and zero-error information theory

    NARCIS (Netherlands)

    Scarpa, G.

    2013-01-01

    We study quantum entanglement and some of its applications in graph theory and zero-error information theory. In Chapter 1 we introduce entanglement and other fundamental concepts of quantum theory. In Chapter 2 we address the question of how much quantum correlations generated by entanglement can

  13. Fundamentals of algebraic graph transformation

    CERN Document Server

    Ehrig, Hartmut; Prange, Ulrike; Taentzer, Gabriele

    2006-01-01

    Graphs are widely used to represent structural information in the form of objects and connections between them. Graph transformation is the rule-based manipulation of graphs, an increasingly important concept in computer science and related fields. This is the first textbook treatment of the algebraic approach to graph transformation, based on algebraic structures and category theory. Part I is an introduction to the classical case of graph and typed graph transformation. In Part II basic and advanced results are first shown for an abstract form of replacement systems, so-called adhesive high-level replacement systems based on category theory, and are then instantiated to several forms of graph and Petri net transformation systems. Part III develops typed attributed graph transformation, a technique of key relevance in the modeling of visual languages and in model transformation. Part IV contains a practical case study on model transformation and a presentation of the AGG (attributed graph grammar) tool envir...

  14. Band connectivity for topological quantum chemistry: Band structures as a graph theory problem

    Science.gov (United States)

    Bradlyn, Barry; Elcoro, L.; Vergniory, M. G.; Cano, Jennifer; Wang, Zhijun; Felser, C.; Aroyo, M. I.; Bernevig, B. Andrei

    2018-01-01

    The conventional theory of solids is well suited to describing band structures locally near isolated points in momentum space, but struggles to capture the full, global picture necessary for understanding topological phenomena. In part of a recent paper [B. Bradlyn et al., Nature (London) 547, 298 (2017), 10.1038/nature23268], we have introduced the way to overcome this difficulty by formulating the problem of sewing together many disconnected local k .p band structures across the Brillouin zone in terms of graph theory. In this paper, we give the details of our full theoretical construction. We show that crystal symmetries strongly constrain the allowed connectivities of energy bands, and we employ graph theoretic techniques such as graph connectivity to enumerate all the solutions to these constraints. The tools of graph theory allow us to identify disconnected groups of bands in these solutions, and so identify topologically distinct insulating phases.

  15. A Hybrid Approach to Processing Big Data Graphs on Memory-Restricted Systems

    KAUST Repository

    Harshvardhan,; West, Brandon; Fidel, Adam; Amato, Nancy M.; Rauchwerger, Lawrence

    2015-01-01

    that sacrifice performance. In this work, we propose a novel RAM-Disk hybrid approach to graph processing that can scale well from a single shared-memory node to large distributed-memory systems. It works by partitioning the graph into sub graphs that fit in RAM

  16. Information Retrieval and Graph Analysis Approaches for Book Recommendation

    Directory of Open Access Journals (Sweden)

    Chahinez Benkoussas

    2015-01-01

    Full Text Available A combination of multiple information retrieval approaches is proposed for the purpose of book recommendation. In this paper, book recommendation is based on complex user's query. We used different theoretical retrieval models: probabilistic as InL2 (Divergence from Randomness model and language model and tested their interpolated combination. Graph analysis algorithms such as PageRank have been successful in Web environments. We consider the application of this algorithm in a new retrieval approach to related document network comprised of social links. We called Directed Graph of Documents (DGD a network constructed with documents and social information provided from each one of them. Specifically, this work tackles the problem of book recommendation in the context of INEX (Initiative for the Evaluation of XML retrieval Social Book Search track. A series of reranking experiments demonstrate that combining retrieval models yields significant improvements in terms of standard ranked retrieval metrics. These results extend the applicability of link analysis algorithms to different environments.

  17. A Community-Aware Approach to Minimizing Dissemination in Graphs

    KAUST Repository

    Zhang, Chuxu

    2017-08-02

    Given a graph, can we minimize the spread of an entity (such as a meme or a virus) while maintaining the graph’s community structure (defined as groups of nodes with denser intra-connectivity than inter-connectivity)? At first glance, these two objectives seem at odds with each other. To minimize dissemination, nodes or links are often deleted to reduce the graph’s connectivity. These deletions can (and often do) destroy the graph’s community structure, which is an important construct in real-world settings (e.g., communities promote trust among their members). We utilize rewiring of links to achieve both objectives. Examples of rewiring in real life are prevalent, such as purchasing products from a new farm since the local farm has signs of mad cow disease; getting information from a new source after a disaster since your usual source is no longer available, etc. Our community-aware approach, called constrCRlink (short for Constraint Community Relink), preserves (on average) 98.6% of the efficacy of the best community-agnostic link-deletion approach (namely, NetMelt+), but changes the original community structure of the graph by only 4.5%. In contrast, NetMelt+ changes 13.6% of the original community structure.

  18. Graph approach to the gradient expansion of density functionals

    International Nuclear Information System (INIS)

    Kozlowski, P.M.; Nalewajski, R.F.

    1986-01-01

    A graph representation of terms in the gradient expansion of the kinetic energy density functional is presented. They briefly discuss the implications of the virial theorem for the graph structure and relations between possible graphs at a given order of expansion

  19. POOR TEXTURAL IMAGE MATCHING BASED ON GRAPH THEORY

    Directory of Open Access Journals (Sweden)

    S. Chen

    2016-06-01

    Full Text Available 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.

  20. Development of a new loss allocation method for a hybrid electricity market using graph theory

    International Nuclear Information System (INIS)

    Lim, Valerie S.C.; McDonald, John D.F.; Saha, Tapan K.

    2009-01-01

    This paper introduces a new method for allocating losses in a power system using a loop-based representation of system behaviour. Using the new method, network behaviour is formulated as a series of presumed power transfers directly between market participants. In contrast to many existing loss allocation methods, this makes it easier to justify the resulting loss distribution. In addition to circumventing the problems of non-unique loss allocations, a formalised process of loop identification, using graph theory concepts, is introduced. The proposed method is applied to both the IEEE 14-bus system and a modified CIGRE Nordic 32-bus system. The results provide a demonstration of the capability of the proposed method to allocate losses in the hybrid market, and demonstrate the approach's capacity to link the technical performance of the network to market instruments. (author)

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

    Science.gov (United States)

    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.

  2. AN EDUCATIONAL THEORY MODEL--(SIGGS), AN INTEGRATION OF SET THEORY, INFORMATION THEORY, AND GRAPH THEORY WITH GENERAL SYSTEMS THEORY.

    Science.gov (United States)

    MACCIA, ELIZABETH S.; AND OTHERS

    AN ANNOTATED BIBLIOGRAPHY OF 20 ITEMS AND A DISCUSSION OF ITS SIGNIFICANCE WAS PRESENTED TO DESCRIBE CURRENT UTILIZATION OF SUBJECT THEORIES IN THE CONSTRUCTION OF AN EDUCATIONAL THEORY. ALSO, A THEORY MODEL WAS USED TO DEMONSTRATE CONSTRUCTION OF A SCIENTIFIC EDUCATIONAL THEORY. THE THEORY MODEL INCORPORATED SET THEORY (S), INFORMATION THEORY…

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

    Science.gov (United States)

    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. Copyright © 2016 Elsevier Ltd. All rights reserved.

  4. Graph spectrum

    NARCIS (Netherlands)

    Brouwer, A.E.; Haemers, W.H.; Brouwer, A.E.; Haemers, W.H.

    2012-01-01

    This chapter presents some simple results on graph spectra.We assume the reader is familiar with elementary linear algebra and graph theory. Throughout, J will denote the all-1 matrix, and 1 is the all-1 vector.

  5. Detectable states, cycle fluxes, and motility scaling of molecular motor kinesin: An integrative kinetic graph theory analysis

    Science.gov (United States)

    Ren, Jie

    2017-12-01

    The process by which a kinesin motor couples its ATPase activity with concerted mechanical hand-over-hand steps is a foremost topic of molecular motor physics. Two major routes toward elucidating kinesin mechanisms are the motility performance characterization of velocity and run length, and single-molecular state detection experiments. However, these two sets of experimental approaches are largely uncoupled to date. Here, we introduce an integrative motility state analysis based on a theorized kinetic graph theory for kinesin, which, on one hand, is validated by a wealth of accumulated motility data, and, on the other hand, allows for rigorous quantification of state occurrences and chemomechanical cycling probabilities. An interesting linear scaling for kinesin motility performance across species is discussed as well. An integrative kinetic graph theory analysis provides a powerful tool to bridge motility and state characterization experiments, so as to forge a unified effort for the elucidation of the working mechanisms of molecular motors.

  6. A Hybrid Approach to Processing Big Data Graphs on Memory-Restricted Systems

    KAUST Repository

    Harshvardhan,

    2015-05-01

    With the advent of big-data, processing large graphs quickly has become increasingly important. Most existing approaches either utilize in-memory processing techniques that can only process graphs that fit completely in RAM, or disk-based techniques that sacrifice performance. In this work, we propose a novel RAM-Disk hybrid approach to graph processing that can scale well from a single shared-memory node to large distributed-memory systems. It works by partitioning the graph into sub graphs that fit in RAM and uses a paging-like technique to load sub graphs. We show that without modifying the algorithms, this approach can scale from small memory-constrained systems (such as tablets) to large-scale distributed machines with 16, 000+ cores.

  7. A hierarchical approach to reducing communication in parallel graph algorithms

    KAUST Repository

    Harshvardhan,; Amato, Nancy M.; Rauchwerger, Lawrence

    2015-01-01

    . This is exacerbated in scale-free networks, such as social and web graphs, which contain hub vertices that have large degrees and therefore send a large number of messages over the network. Furthermore, many graph algorithms and computations send the same data to each

  8. A Qualitative Approach to Sketch the Graph of a Function.

    Science.gov (United States)

    Alson, Pedro

    1992-01-01

    Presents a qualitative and global method of graphing functions that involves transformations of the graph of a known function in the cartesian coordinate system referred to as graphic operators. Explains how the method has been taught to students and some comments about the results obtained. (MDH)

  9. Modal Analysis of In-Wheel Motor-Driven Electric Vehicle Based on Bond Graph Theory

    Directory of Open Access Journals (Sweden)

    Di Tan

    2017-01-01

    Full Text Available A half-car vibration model of an electric vehicle driven by rear in-wheel motors was developed using bond graph theory and the modular modeling method. Based on the bond graph model, modal analysis was carried out to study the vibration characteristics of the electric vehicle. To verify the effectiveness of the established model, the results were compared to ones computed on the ground of modal analysis and Newton equations. The comparison shows that the vibration model of the electric vehicle based on bond graph theory not only is able to better compute the natural frequency but also can easily determine the deformation mode, momentum mode, and other isomorphism modes and describe the dynamic characteristics of an electric vehicle driven by in-wheel motors more comprehensively than other modal analysis methods.

  10. MetricForensics: A Multi-Level Approach for Mining Volatile Graphs

    Energy Technology Data Exchange (ETDEWEB)

    Henderson, Keith [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Eliassi-Rad, Tina [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Faloutsos, Christos [Carnegie Mellon Univ., Pittsburgh, PA (United States); Akoglu, Leman [Carnegie Mellon Univ., Pittsburgh, PA (United States); Li, Lei [Carnegie Mellon Univ., Pittsburgh, PA (United States); Maruhashi, Koji [Fujitsu Laboratories Ltd., Kanagawa (Japan); Prakash, B. Aditya [Carnegie Mellon Univ., Pittsburgh, PA (United States); Tong, H [Carnegie Mellon Univ., Pittsburgh, PA (United States)

    2010-02-08

    Advances in data collection and storage capacity have made it increasingly possible to collect highly volatile graph data for analysis. Existing graph analysis techniques are not appropriate for such data, especially in cases where streaming or near-real-time results are required. An example that has drawn significant research interest is the cyber-security domain, where internet communication traces are collected and real-time discovery of events, behaviors, patterns and anomalies is desired. We propose MetricForensics, a scalable framework for analysis of volatile graphs. MetricForensics combines a multi-level “drill down" approach, a collection of user-selected graph metrics and a collection of analysis techniques. At each successive level, more sophisticated metrics are computed and the graph is viewed at a finer temporal resolution. In this way, MetricForensics scales to highly volatile graphs by only allocating resources for computationally expensive analysis when an interesting event is discovered at a coarser resolution first. We test MetricForensics on three real-world graphs: an enterprise IP trace, a trace of legitimate and malicious network traffic from a research institution, and the MIT Reality Mining proximity sensor data. Our largest graph has »3M vertices and »32M edges, spanning 4:5 days. The results demonstrate the scalability and capability of MetricForensics in analyzing volatile graphs; and highlight four novel phenomena in such graphs: elbows, broken correlations, prolonged spikes, and strange stars.

  11. A Ranking Approach on Large-Scale Graph With Multidimensional Heterogeneous Information.

    Science.gov (United States)

    Wei, Wei; Gao, Bin; Liu, Tie-Yan; Wang, Taifeng; Li, Guohui; Li, Hang

    2016-04-01

    Graph-based ranking has been extensively studied and frequently applied in many applications, such as webpage ranking. It aims at mining potentially valuable information from the raw graph-structured data. Recently, with the proliferation of rich heterogeneous information (e.g., node/edge features and prior knowledge) available in many real-world graphs, how to effectively and efficiently leverage all information to improve the ranking performance becomes a new challenging problem. Previous methods only utilize part of such information and attempt to rank graph nodes according to link-based methods, of which the ranking performances are severely affected by several well-known issues, e.g., over-fitting or high computational complexity, especially when the scale of graph is very large. In this paper, we address the large-scale graph-based ranking problem and focus on how to effectively exploit rich heterogeneous information of the graph to improve the ranking performance. Specifically, we propose an innovative and effective semi-supervised PageRank (SSP) approach to parameterize the derived information within a unified semi-supervised learning framework (SSLF-GR), then simultaneously optimize the parameters and the ranking scores of graph nodes. Experiments on the real-world large-scale graphs demonstrate that our method significantly outperforms the algorithms that consider such graph information only partially.

  12. Dynamical graph theory networks techniques for the analysis of sparse connectivity networks in dementia

    Science.gov (United States)

    Tahmassebi, Amirhessam; Pinker-Domenig, Katja; Wengert, Georg; Lobbes, Marc; Stadlbauer, Andreas; Romero, Francisco J.; Morales, Diego P.; Castillo, Encarnacion; Garcia, Antonio; Botella, Guillermo; Meyer-Bäse, Anke

    2017-05-01

    Graph network models in dementia have become an important computational technique in neuroscience to study fundamental organizational principles of brain structure and function of neurodegenerative diseases such as dementia. The graph connectivity is reflected in the connectome, the complete set of structural and functional connections of the graph network, which is mostly based on simple Pearson correlation links. In contrast to simple Pearson correlation networks, the partial correlations (PC) only identify direct correlations while indirect associations are eliminated. In addition to this, the state-of-the-art techniques in brain research are based on static graph theory, which is unable to capture the dynamic behavior of the brain connectivity, as it alters with disease evolution. We propose a new research avenue in neuroimaging connectomics based on combining dynamic graph network theory and modeling strategies at different time scales. We present the theoretical framework for area aggregation and time-scale modeling in brain networks as they pertain to disease evolution in dementia. This novel paradigm is extremely powerful, since we can derive both static parameters pertaining to node and area parameters, as well as dynamic parameters, such as system's eigenvalues. By implementing and analyzing dynamically both disease driven PC-networks and regular concentration networks, we reveal differences in the structure of these network that play an important role in the temporal evolution of this disease. The described research is key to advance biomedical research on novel disease prediction trajectories and dementia therapies.

  13. PROBLEMS IN TOPOLOGICAL GRAPH THEORY : QUESTIONS I CAN'T ANSWER

    OpenAIRE

    Archdeacon, Dan

    1999-01-01

    This paper describes my Problems in Topological Graph Theory, which can be accessed through the world-wide-web at http: //www.emba .uvm.edu/~arcceack/problems/problems.html This list of problems is constantly being revised; the interested reader is encouraged to submit additions and updates.

  14. Feynman graphs and gauge theories for experimental physicists. 2. rev. ed.

    International Nuclear Information System (INIS)

    Schmueser, P.

    1995-01-01

    This book is an introduction to the foundations of quantum field theory with special regards to gauge theory. After a general introduction to relativistic wave equations the concept of Feynman graphs is introduced. Then after an introduction to the phenomenology of weak interactions and the principle of gauge invariance the standard model of the electroweak interaction is presented. Finally quantum chromodynamics is described. Every chapter contains exercise problems. (HSI)

  15. Routing Planning As An Application Of Graph Theory with Fuzzy Logic

    Directory of Open Access Journals (Sweden)

    Tomasz Neumann

    2016-12-01

    Full Text Available The routing planning one of the classic problems in graph theory. Its application have various practical uses ranging from the transportation, civil engineering and other applications. The resolution of this paper is to find a solution for route planning in a transport networks, where the description of tracks, factor of safety and travel time are ambiguous. In the study the ranking system based on the theory of possibility is proposed.

  16. SIMULATION OF DRIVER’S LOCOMOTIVE-HANDLING ACTIVITY USING THE THEORY OF FUZZY GRAPHS

    Directory of Open Access Journals (Sweden)

    T. V. Butko

    2015-03-01

    Full Text Available Purpose. The efficiency and safety of locomotive control improving is important and relevant scientific and practical problem. Every driver during the trains-handling bases on his experience and knowledge, that is why the compilation and detection the most efficient ways to control the locomotive-handling is one of the stages of measures development to reduce transportation costs. The purpose of this paper is a formalization process description of locomotive-handling and quality parameters determination of this process. Methodology. In order to achieve this goal the theory of fuzzy probabilistic graphs was used. Vertices of the graph correspond to the events start and end operations at train-handling. The graph arcs describe operations on train-handling. Graph consists of thirteen peaks corresponding to the main control actions of the engine-driver. The weighting factors of transitions between vertices are assigned by fuzzy numbers. Their values were obtained by expert estimates. Fuzzy probabilities and transition time are presented as numbers with trapezoidal membership function. Findings. Using successive merging of parallel arcs, loops and vertices elimination, the equivalent fuzzy graph of train-handling and the corresponding L-matrix were obtained. Equivalent graph takes into account separately activity of the driver during normal operation and during emergency situations. Originality. The theoretical foundations of describing process formalization in driver’s locomotive-handling activity were developed using the fuzzy probabilistic graph. The parameters characterizing the decision-making process of engineer were obtained. Practical value. With the resulting model it is possible to estimate the available reserves for the quality improvement of locomotive-handling. Reduction in the time for decision-making will lead to the approximation the current mode of control to the rational one and decrease costs of hauling operations. And reduction

  17. Graph theory applied to noise and vibration control in statistical energy analysis models.

    Science.gov (United States)

    Guasch, Oriol; Cortés, Lluís

    2009-06-01

    A fundamental aspect of noise and vibration control in statistical energy analysis (SEA) models consists in first identifying and then reducing the energy flow paths between subsystems. In this work, it is proposed to make use of some results from graph theory to address both issues. On the one hand, linear and path algebras applied to adjacency matrices of SEA graphs are used to determine the existence of any order paths between subsystems, counting and labeling them, finding extremal paths, or determining the power flow contributions from groups of paths. On the other hand, a strategy is presented that makes use of graph cut algorithms to reduce the energy flow from a source subsystem to a receiver one, modifying as few internal and coupling loss factors as possible.

  18. A semantic graph-based approach to biomedical summarisation.

    Science.gov (United States)

    Plaza, Laura; Díaz, Alberto; Gervás, Pablo

    2011-09-01

    Access to the vast body of research literature that is available in biomedicine and related fields may be improved by automatic summarisation. This paper presents a method for summarising biomedical scientific literature that takes into consideration the characteristics of the domain and the type of documents. To address the problem of identifying salient sentences in biomedical texts, concepts and relations derived from the Unified Medical Language System (UMLS) are arranged to construct a semantic graph that represents the document. A degree-based clustering algorithm is then used to identify different themes or topics within the text. Different heuristics for sentence selection, intended to generate different types of summaries, are tested. A real document case is drawn up to illustrate how the method works. A large-scale evaluation is performed using the recall-oriented understudy for gisting-evaluation (ROUGE) metrics. The results are compared with those achieved by three well-known summarisers (two research prototypes and a commercial application) and two baselines. Our method significantly outperforms all summarisers and baselines. The best of our heuristics achieves an improvement in performance of almost 7.7 percentage units in the ROUGE-1 score over the LexRank summariser (0.7862 versus 0.7302). A qualitative analysis of the summaries also shows that our method succeeds in identifying sentences that cover the main topic of the document and also considers other secondary or "satellite" information that might be relevant to the user. The method proposed is proved to be an efficient approach to biomedical literature summarisation, which confirms that the use of concepts rather than terms can be very useful in automatic summarisation, especially when dealing with highly specialised domains. Copyright © 2011 Elsevier B.V. All rights reserved.

  19. A Practical Approach to Constructing a Knowledge Graph for Cybersecurity

    Directory of Open Access Journals (Sweden)

    Yan Jia

    2018-02-01

    Full Text Available Cyberattack forms are complex and varied, and the detection and prediction of dynamic types of attack are always challenging tasks. Research on knowledge graphs is becoming increasingly mature in many fields. At present, it is very significant that certain scholars have combined the concept of the knowledge graph with cybersecurity in order to construct a cybersecurity knowledge base. This paper presents a cybersecurity knowledge base and deduction rules based on a quintuple model. Using machine learning, we extract entities and build ontology to obtain a cybersecurity knowledge base. New rules are then deduced by calculating formulas and using the path-ranking algorithm. The Stanford named entity recognizer (NER is also used to train an extractor to extract useful information. Experimental results show that the Stanford NER provides many features and the useGazettes parameter may be used to train a recognizer in the cybersecurity domain in preparation for future work. Keywords: Cybersecurity, Knowledge graph, Knowledge deduction

  20. A cluster expansion approach to exponential random graph models

    International Nuclear Information System (INIS)

    Yin, Mei

    2012-01-01

    The exponential family of random graphs are among the most widely studied network models. We show that any exponential random graph model may alternatively be viewed as a lattice gas model with a finite Banach space norm. The system may then be treated using cluster expansion methods from statistical mechanics. In particular, we derive a convergent power series expansion for the limiting free energy in the case of small parameters. Since the free energy is the generating function for the expectations of other random variables, this characterizes the structure and behavior of the limiting network in this parameter region

  1. Connections between the Sznajd model with general confidence rules and graph theory

    Science.gov (United States)

    Timpanaro, André M.; Prado, Carmen P. C.

    2012-10-01

    The Sznajd model is a sociophysics model that is used to model opinion propagation and consensus formation in societies. Its main feature is that its rules favor bigger groups of agreeing people. In a previous work, we generalized the bounded confidence rule in order to model biases and prejudices in discrete opinion models. In that work, we applied this modification to the Sznajd model and presented some preliminary results. The present work extends what we did in that paper. We present results linking many of the properties of the mean-field fixed points, with only a few qualitative aspects of the confidence rule (the biases and prejudices modeled), finding an interesting connection with graph theory problems. More precisely, we link the existence of fixed points with the notion of strongly connected graphs and the stability of fixed points with the problem of finding the maximal independent sets of a graph. We state these results and present comparisons between the mean field and simulations in Barabási-Albert networks, followed by the main mathematical ideas and appendices with the rigorous proofs of our claims and some graph theory concepts, together with examples. We also show that there is no qualitative difference in the mean-field results if we require that a group of size q>2, instead of a pair, of agreeing agents be formed before they attempt to convince other sites (for the mean field, this would coincide with the q-voter model).

  2. A direct mining approach to efficient constrained graph pattern discovery

    DEFF Research Database (Denmark)

    Zhu, Feida; Zhang, Zequn; Qu, Qiang

    2013-01-01

    Despite the wealth of research on frequent graph pattern mining, how to efficiently mine the complete set of those with constraints still poses a huge challenge to the existing algorithms mainly due to the inherent bottleneck in the mining paradigm. In essence, mining requests with explicitly-spe...

  3. A Numerical Approach to Long Cycles in Graphs and Digraphs

    Czech Academy of Sciences Publication Activity Database

    Fiedler, Miroslav

    2001-01-01

    Roč. 235, - (2001), s. 233-236 ISSN 0012-365X R&D Projects: GA ČR GA201/98/0222 Institutional research plan: AV0Z1030915 Keywords : graph * diagraph * cycle * Hamilton cycle Subject RIV: BA - General Mathematics Impact factor: 0.301, year: 2001

  4. Neural networks for link prediction in realistic biomedical graphs: a multi-dimensional evaluation of graph embedding-based approaches.

    Science.gov (United States)

    Crichton, Gamal; Guo, Yufan; Pyysalo, Sampo; Korhonen, Anna

    2018-05-21

    Link prediction in biomedical graphs has several important applications including predicting Drug-Target Interactions (DTI), Protein-Protein Interaction (PPI) prediction and Literature-Based Discovery (LBD). It can be done using a classifier to output the probability of link formation between nodes. Recently several works have used neural networks to create node representations which allow rich inputs to neural classifiers. Preliminary works were done on this and report promising results. However they did not use realistic settings like time-slicing, evaluate performances with comprehensive metrics or explain when or why neural network methods outperform. We investigated how inputs from four node representation algorithms affect performance of a neural link predictor on random- and time-sliced biomedical graphs of real-world sizes (∼ 6 million edges) containing information relevant to DTI, PPI and LBD. We compared the performance of the neural link predictor to those of established baselines and report performance across five metrics. In random- and time-sliced experiments when the neural network methods were able to learn good node representations and there was a negligible amount of disconnected nodes, those approaches outperformed the baselines. In the smallest graph (∼ 15,000 edges) and in larger graphs with approximately 14% disconnected nodes, baselines such as Common Neighbours proved a justifiable choice for link prediction. At low recall levels (∼ 0.3) the approaches were mostly equal, but at higher recall levels across all nodes and average performance at individual nodes, neural network approaches were superior. Analysis showed that neural network methods performed well on links between nodes with no previous common neighbours; potentially the most interesting links. Additionally, while neural network methods benefit from large amounts of data, they require considerable amounts of computational resources to utilise them. Our results indicate

  5. Domain configurations in dislocations embedded hexagonal manganite systems: From the view of graph theory

    Science.gov (United States)

    Cheng, Shaobo; Zhang, Dong; Deng, Shiqing; Li, Xing; Li, Jun; Tan, Guotai; Zhu, Yimei; Zhu, Jing

    2018-04-01

    Topological defects and their interactions often arouse multiple types of emerging phenomena from edge states in Skyrmions to disclination pairs in liquid crystals. In hexagonal manganites, partial edge dislocations, a prototype topological defect, are ubiquitous and they significantly alter the topologically protected domains and their behaviors. Herein, combining electron microscopy experiment and graph theory analysis, we report a systematic study of the connections and configurations of domains in this dislocation embedded system. Rules for domain arrangement are established. The dividing line between domains, which can be attributed by the strain field of dislocations, is accurately described by a genus model from a higher dimension in the graph theory. Our results open a door for the understanding of domain patterns in topologically protected multiferroic systems.

  6. Visibility graph approach to the analysis of ocean tidal records

    International Nuclear Information System (INIS)

    Telesca, Luciano; Lovallo, Michele; Pierini, Jorge O.

    2012-01-01

    By using the recent method of the visibility graph, three time series of oceanic tide level in central Argentina were investigated. The degree distributions show a rich structure; in particular the maximum is due to the main periodic oscillations at 24 hours and 12 hours and higher harmonics. The degree distributions of the residuals (obtained removing from the original signals the cyclic components) suggest that the local effects, linked with the particular coastal conditions of the sites, are discernible for the degree k 100. Although a relationship between the spectral exponent α and the exponent of the degree distribution γ of tidal signals can be recognized, this cannot be simply stated due to the very rich and complex structure of time dynamics of tides. The present study, even if still preliminary, show the importance of the visibility graph method in investigating the complex time dynamics of observational and experimental signals.

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

    Science.gov (United States)

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

    2016-01-01

    There are several applications in computational biophysics which require the optimization of discrete interacting states; e.g., 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. Energy Minimization of Discrete Protein Titration State Models Using Graph Theory.

    Science.gov (United States)

    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.

  9. Summing Feynman graphs by Monte Carlo: Planar φ3-theory and dynamically triangulated random surfaces

    International Nuclear Information System (INIS)

    Boulatov, D.V.

    1988-01-01

    New combinatorial identities are suggested relating the ratio of (n-1)th and nth orders of (planar) perturbation expansion for any quantity to some average over the ensemble of all planar graphs of the nth order. These identities are used for Monte Carlo calculation of critical exponents γ str (string susceptibility) in planar φ 3 -theory and in the dynamically triangulated random surface (DTRS) model near the convergence circle for various dimensions. In the solvable case D=1 the exact critical properties of the theory are reproduced numerically. (orig.)

  10. Graph Sampling for Covariance Estimation

    KAUST Repository

    Chepuri, Sundeep Prabhakar

    2017-04-25

    In this paper the focus is on subsampling as well as reconstructing the second-order statistics of signals residing on nodes of arbitrary undirected graphs. Second-order stationary graph signals may be obtained by graph filtering zero-mean white noise and they admit a well-defined power spectrum whose shape is determined by the frequency response of the graph filter. Estimating the graph power spectrum forms an important component of stationary graph signal processing and related inference tasks such as Wiener prediction or inpainting on graphs. The central result of this paper is that by sampling a significantly smaller subset of vertices and using simple least squares, we can reconstruct the second-order statistics of the graph signal from the subsampled observations, and more importantly, without any spectral priors. To this end, both a nonparametric approach as well as parametric approaches including moving average and autoregressive models for the graph power spectrum are considered. The results specialize for undirected circulant graphs in that the graph nodes leading to the best compression rates are given by the so-called minimal sparse rulers. A near-optimal greedy algorithm is developed to design the subsampling scheme for the non-parametric and the moving average models, whereas a particular subsampling scheme that allows linear estimation for the autoregressive model is proposed. Numerical experiments on synthetic as well as real datasets related to climatology and processing handwritten digits are provided to demonstrate the developed theory.

  11. Assessment of tautomer distribution using the condensed reaction graph approach

    Science.gov (United States)

    Gimadiev, T. R.; Madzhidov, T. I.; Nugmanov, R. I.; Baskin, I. I.; Antipin, I. S.; Varnek, A.

    2018-03-01

    We report the first direct QSPR modeling of equilibrium constants of tautomeric transformations (logK T ) in different solvents and at different temperatures, which do not require intermediate assessment of acidity (basicity) constants for all tautomeric forms. The key step of the modeling consisted in the merging of two tautomers in one sole molecular graph ("condensed reaction graph") which enables to compute molecular descriptors characterizing entire equilibrium. The support vector regression method was used to build the models. The training set consisted of 785 transformations belonging to 11 types of tautomeric reactions with equilibrium constants measured in different solvents and at different temperatures. The models obtained perform well both in cross-validation (Q2 = 0.81 RMSE = 0.7 logK T units) and on two external test sets. Benchmarking studies demonstrate that our models outperform results obtained with DFT B3LYP/6-311 ++ G(d,p) and ChemAxon Tautomerizer applicable only in water at room temperature.

  12. Field theory approach to gravitation

    International Nuclear Information System (INIS)

    Yilmaz, H.

    1978-01-01

    A number of authors considered the possibility of formulating a field-theory approach to gravitation with the claim that such an approach would uniquely lead to Einstein's theory of general relativity. In this article it is shown that the field theory approach is more generally applicable and uniqueness cannot be claimed. Theoretical and experimental reasons are given showing that the Einsteinian limit appears to be unviable

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

    International Nuclear Information System (INIS)

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

    2016-01-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. (paper)

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

    Science.gov (United States)

    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.

  15. A Parallel Approach for Frequent Subgraph Mining in a Single Large Graph Using Spark

    Directory of Open Access Journals (Sweden)

    Fengcai Qiao

    2018-02-01

    Full Text Available Frequent subgraph mining (FSM plays an important role in graph mining, attracting a great deal of attention in many areas, such as bioinformatics, web data mining and social networks. In this paper, we propose SSiGraM (Spark based Single Graph Mining, a Spark based parallel frequent subgraph mining algorithm in a single large graph. Aiming to approach the two computational challenges of FSM, we conduct the subgraph extension and support evaluation parallel across all the distributed cluster worker nodes. In addition, we also employ a heuristic search strategy and three novel optimizations: load balancing, pre-search pruning and top-down pruning in the support evaluation process, which significantly improve the performance. Extensive experiments with four different real-world datasets demonstrate that the proposed algorithm outperforms the existing GraMi (Graph Mining algorithm by an order of magnitude for all datasets and can work with a lower support threshold.

  16. A Graph-Based Approach for 3D Building Model Reconstruction from Airborne LiDAR Point Clouds

    Directory of Open Access Journals (Sweden)

    Bin Wu

    2017-01-01

    Full Text Available 3D building model reconstruction is of great importance for environmental and urban applications. Airborne light detection and ranging (LiDAR is a very useful data source for acquiring detailed geometric and topological information of building objects. In this study, we employed a graph-based method based on hierarchical structure analysis of building contours derived from LiDAR data to reconstruct urban building models. The proposed approach first uses a graph theory-based localized contour tree method to represent the topological structure of buildings, then separates the buildings into different parts by analyzing their topological relationships, and finally reconstructs the building model by integrating all the individual models established through the bipartite graph matching process. Our approach provides a more complete topological and geometrical description of building contours than existing approaches. We evaluated the proposed method by applying it to the Lujiazui region in Shanghai, China, a complex and large urban scene with various types of buildings. The results revealed that complex buildings could be reconstructed successfully with a mean modeling error of 0.32 m. Our proposed method offers a promising solution for 3D building model reconstruction from airborne LiDAR point clouds.

  17. Classification of mini-dimmings associated with extreme ultraviolet eruptions by using graph theory

    Directory of Open Access Journals (Sweden)

    S Bazargan

    2016-09-01

    Full Text Available Coronal dimmings in both micro and macro scales, can be observed by extreme ultraviolet images, recorded from Solar Dynamics Observatory or Atmospheric Imaging Assembly (SDO/AIA. Mini-dimmings are sometimes associated with wave-like brightening, called coronal mass ejections. Here, the sun full disk images with 171 Å wavelenght, cadence of 2.5, and  0.6 arcsec cell size, were taken on 3 March 2012, then the obtained data were analyzed. Using Zernike Moment and Support Vector Machine (SVM, mini dimmings are detected. 538 active region events, 680 coronal hole events and 723 quiet sun events have been recognized using algorithm. The position, time duration and spatial expansion of these events were computed .The eruptive dimmings have a more spatial development than thermal dimmings after eruptions. This is evident in their graph characteristics length. Then, using graph theory, eruptive and thermal mini-dimmings were classified, with 13% error, for 200 dimmings. 68 dimmings were classified as thermal, and 132 as eruptive. To do this, evolution of graph characteristic length were used.

  18. The Stability Analysis Method of the Cohesive Granular Slope on the Basis of Graph Theory.

    Science.gov (United States)

    Guan, Yanpeng; Liu, Xiaoli; Wang, Enzhi; Wang, Sijing

    2017-02-27

    This paper attempted to provide a method to calculate progressive failure of the cohesivefrictional granular geomaterial and the spatial distribution of the stability of the cohesive granular slope. The methodology can be divided into two parts: the characterization method of macro-contact and the analysis of the slope stability. Based on the graph theory, the vertexes, the edges and the edge sequences are abstracted out to characterize the voids, the particle contact and the macro-contact, respectively, bridging the gap between the mesoscopic and macro scales of granular materials. This paper adopts this characterization method to extract a graph from a granular slope and characterize the macro sliding surface, then the weighted graph is analyzed to calculate the slope safety factor. Each edge has three weights representing the sliding moment, the anti-sliding moment and the braking index of contact-bond, respectively, . The safety factor of the slope is calculated by presupposing a certain number of sliding routes and reducing Weight repeatedly and counting the mesoscopic failure of the edge. It is a kind of slope analysis method from mesoscopic perspective so it can present more detail of the mesoscopic property of the granular slope. In the respect of macro scale, the spatial distribution of the stability of the granular slope is in agreement with the theoretical solution.

  19. density functional theory approach

    Indian Academy of Sciences (India)

    YOGESH ERANDE

    2017-07-27

    Jul 27, 2017 ... a key role in all optical switching devices, since their optical properties can be .... optimized in the gas phase using Density Functional Theory. (DFT).39 The ...... The Mediation of Electrostatic Effects by Sol- vents J. Am. Chem.

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

    Directory of Open Access Journals (Sweden)

    Qu Li

    2014-01-01

    Full Text Available 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.

  1. INTEGRATED APPROACH TO GENERATION OF PRECEDENCE RELATIONS AND PRECEDENCE GRAPHS FOR ASSEMBLY SEQUENCE PLANNING

    Institute of Scientific and Technical Information of China (English)

    2002-01-01

    An integrated approach to generation of precedence relations and precedence graphs for assembly sequence planning is presented, which contains more assembly flexibility. The approach involves two stages. Based on the assembly model, the components in the assembly can be divided into partially constrained components and completely constrained components in the first stage, and then geometric precedence relation for every component is generated automatically. According to the result of the first stage, the second stage determines and constructs all precedence graphs. The algorithms of these two stages proposed are verified by two assembly examples.

  2. The Influence of Preprocessing Steps on Graph Theory Measures Derived from Resting State fMRI.

    Science.gov (United States)

    Gargouri, Fatma; Kallel, Fathi; Delphine, Sebastien; Ben Hamida, Ahmed; Lehéricy, Stéphane; Valabregue, Romain

    2018-01-01

    Resting state functional MRI (rs-fMRI) is an imaging technique that allows the spontaneous activity of the brain to be measured. Measures of functional connectivity highly depend on the quality of the BOLD signal data processing. In this study, our aim was to study the influence of preprocessing steps and their order of application on small-world topology and their efficiency in resting state fMRI data analysis using graph theory. We applied the most standard preprocessing steps: slice-timing, realign, smoothing, filtering, and the tCompCor method. In particular, we were interested in how preprocessing can retain the small-world economic properties and how to maximize the local and global efficiency of a network while minimizing the cost. Tests that we conducted in 54 healthy subjects showed that the choice and ordering of preprocessing steps impacted the graph measures. We found that the csr (where we applied realignment, smoothing, and tCompCor as a final step) and the scr (where we applied realignment, tCompCor and smoothing as a final step) strategies had the highest mean values of global efficiency (eg) . Furthermore, we found that the fscr strategy (where we applied realignment, tCompCor, smoothing, and filtering as a final step), had the highest mean local efficiency (el) values. These results confirm that the graph theory measures of functional connectivity depend on the ordering of the processing steps, with the best results being obtained using smoothing and tCompCor as the final steps for global efficiency with additional filtering for local efficiency.

  3. The Influence of Preprocessing Steps on Graph Theory Measures Derived from Resting State fMRI

    Directory of Open Access Journals (Sweden)

    Fatma Gargouri

    2018-02-01

    Full Text Available Resting state functional MRI (rs-fMRI is an imaging technique that allows the spontaneous activity of the brain to be measured. Measures of functional connectivity highly depend on the quality of the BOLD signal data processing. In this study, our aim was to study the influence of preprocessing steps and their order of application on small-world topology and their efficiency in resting state fMRI data analysis using graph theory. We applied the most standard preprocessing steps: slice-timing, realign, smoothing, filtering, and the tCompCor method. In particular, we were interested in how preprocessing can retain the small-world economic properties and how to maximize the local and global efficiency of a network while minimizing the cost. Tests that we conducted in 54 healthy subjects showed that the choice and ordering of preprocessing steps impacted the graph measures. We found that the csr (where we applied realignment, smoothing, and tCompCor as a final step and the scr (where we applied realignment, tCompCor and smoothing as a final step strategies had the highest mean values of global efficiency (eg. Furthermore, we found that the fscr strategy (where we applied realignment, tCompCor, smoothing, and filtering as a final step, had the highest mean local efficiency (el values. These results confirm that the graph theory measures of functional connectivity depend on the ordering of the processing steps, with the best results being obtained using smoothing and tCompCor as the final steps for global efficiency with additional filtering for local efficiency.

  4. The Influence of Preprocessing Steps on Graph Theory Measures Derived from Resting State fMRI

    Science.gov (United States)

    Gargouri, Fatma; Kallel, Fathi; Delphine, Sebastien; Ben Hamida, Ahmed; Lehéricy, Stéphane; Valabregue, Romain

    2018-01-01

    Resting state functional MRI (rs-fMRI) is an imaging technique that allows the spontaneous activity of the brain to be measured. Measures of functional connectivity highly depend on the quality of the BOLD signal data processing. In this study, our aim was to study the influence of preprocessing steps and their order of application on small-world topology and their efficiency in resting state fMRI data analysis using graph theory. We applied the most standard preprocessing steps: slice-timing, realign, smoothing, filtering, and the tCompCor method. In particular, we were interested in how preprocessing can retain the small-world economic properties and how to maximize the local and global efficiency of a network while minimizing the cost. Tests that we conducted in 54 healthy subjects showed that the choice and ordering of preprocessing steps impacted the graph measures. We found that the csr (where we applied realignment, smoothing, and tCompCor as a final step) and the scr (where we applied realignment, tCompCor and smoothing as a final step) strategies had the highest mean values of global efficiency (eg). Furthermore, we found that the fscr strategy (where we applied realignment, tCompCor, smoothing, and filtering as a final step), had the highest mean local efficiency (el) values. These results confirm that the graph theory measures of functional connectivity depend on the ordering of the processing steps, with the best results being obtained using smoothing and tCompCor as the final steps for global efficiency with additional filtering for local efficiency. PMID:29497372

  5. Analysis of the enzyme network involved in cattle milk production using graph theory.

    Science.gov (United States)

    Ghorbani, Sholeh; Tahmoorespur, Mojtaba; Masoudi Nejad, Ali; Nasiri, Mohammad; Asgari, Yazdan

    2015-06-01

    Understanding cattle metabolism and its relationship with milk products is important in bovine breeding. A systemic view could lead to consequences that will result in a better understanding of existing concepts. Topological indices and quantitative characterizations mostly result from the application of graph theory on biological data. In the present work, the enzyme network involved in cattle milk production was reconstructed and analyzed based on available bovine genome information using several public datasets (NCBI, Uniprot, KEGG, and Brenda). The reconstructed network consisted of 3605 reactions named by KEGG compound numbers and 646 enzymes that catalyzed the corresponding reactions. The characteristics of the directed and undirected network were analyzed using Graph Theory. The mean path length was calculated to be4.39 and 5.41 for directed and undirected networks, respectively. The top 11 hub enzymes whose abnormality could harm bovine health and reduce milk production were determined. Therefore, the aim of constructing the enzyme centric network was twofold; first to find out whether such network followed the same properties of other biological networks, and second, to find the key enzymes. The results of the present study can improve our understanding of milk production in cattle. Also, analysis of the enzyme network can help improve the modeling and simulation of biological systems and help design desired phenotypes to increase milk production quality or quantity.

  6. An application of the graph theory which examines the metro networks

    Directory of Open Access Journals (Sweden)

    Svetla STOILOVA

    2015-06-01

    Full Text Available The graph theory gives a mathematical representation of transport networks and allows us to study their characteristics effectively. A research of the structure of metro system has been conducted in the study by using the graph theory. The study includes subway systems of 22 European capitals. New indicators have been defined in the research such as a degree of routing, a connectivity of the route, average length per link (which takes into account the number of routes, intensity of the route, density of the route. The new and the existing indicators have been used to analyze and classify the metro networks. The statistical method cluster analysis has been applied to classify the networks. Ten indicators have been used to carry out an analysis. The metro systems in European capitals have been classified in three clusters. The first cluster includes large metro systems, the second one includes small metro networks whereas the third cluster includes metro networks with only one line. The combination of both two methods has been used for the first time in this research. The methodology could be used to evaluate other existing metro networks as well as for preliminary analysis in the design of subway systems.

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

    Science.gov (United States)

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

    2014-12-01

    To investigate lateralized differences in limbic system functional connectivity between left and right temporal lobe epilepsy (TLE) using graph theory. 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. 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. 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. Published by Elsevier B.V.

  8. A graph-based approach to detect spatiotemporal dynamics in satellite image time series

    Science.gov (United States)

    Guttler, Fabio; Ienco, Dino; Nin, Jordi; Teisseire, Maguelonne; Poncelet, Pascal

    2017-08-01

    Enhancing the frequency of satellite acquisitions represents a key issue for Earth Observation community nowadays. Repeated observations are crucial for monitoring purposes, particularly when intra-annual process should be taken into account. Time series of images constitute a valuable source of information in these cases. The goal of this paper is to propose a new methodological framework to automatically detect and extract spatiotemporal information from satellite image time series (SITS). Existing methods dealing with such kind of data are usually classification-oriented and cannot provide information about evolutions and temporal behaviors. In this paper we propose a graph-based strategy that combines object-based image analysis (OBIA) with data mining techniques. Image objects computed at each individual timestamp are connected across the time series and generates a set of evolution graphs. Each evolution graph is associated to a particular area within the study site and stores information about its temporal evolution. Such information can be deeply explored at the evolution graph scale or used to compare the graphs and supply a general picture at the study site scale. We validated our framework on two study sites located in the South of France and involving different types of natural, semi-natural and agricultural areas. The results obtained from a Landsat SITS support the quality of the methodological approach and illustrate how the framework can be employed to extract and characterize spatiotemporal dynamics.

  9. Functional neural network analysis in frontotemporal dementia and Alzheimer's disease using EEG and graph theory

    Directory of Open Access Journals (Sweden)

    van der Flier Wiesje M

    2009-08-01

    Full Text Available Abstract Background Although a large body of knowledge about both brain structure and function has been gathered over the last decades, we still have a poor understanding of their exact relationship. Graph theory provides a method to study the relation between network structure and function, and its application to neuroscientific data is an emerging research field. We investigated topological changes in large-scale functional brain networks in patients with Alzheimer's disease (AD and frontotemporal lobar degeneration (FTLD by means of graph theoretical analysis of resting-state EEG recordings. EEGs of 20 patients with mild to moderate AD, 15 FTLD patients, and 23 non-demented individuals were recorded in an eyes-closed resting-state. The synchronization likelihood (SL, a measure of functional connectivity, was calculated for each sensor pair in 0.5–4 Hz, 4–8 Hz, 8–10 Hz, 10–13 Hz, 13–30 Hz and 30–45 Hz frequency bands. The resulting connectivity matrices were converted to unweighted graphs, whose structure was characterized with several measures: mean clustering coefficient (local connectivity, characteristic path length (global connectivity and degree correlation (network 'assortativity'. All results were normalized for network size and compared with random control networks. Results In AD, the clustering coefficient decreased in the lower alpha and beta bands (p Conclusion With decreasing local and global connectivity parameters, the large-scale functional brain network organization in AD deviates from the optimal 'small-world' network structure towards a more 'random' type. This is associated with less efficient information exchange between brain areas, supporting the disconnection hypothesis of AD. Surprisingly, FTLD patients show changes in the opposite direction, towards a (perhaps excessively more 'ordered' network structure, possibly reflecting a different underlying pathophysiological process.

  10. iBGP: A Bipartite Graph Propagation Approach for Mobile Advertising Fraud Detection

    Directory of Open Access Journals (Sweden)

    Jinlong Hu

    2017-01-01

    Full Text Available Online mobile advertising plays a vital financial role in supporting free mobile apps, but detecting malicious apps publishers who generate fraudulent actions on the advertisements hosted on their apps is difficult, since fraudulent traffic often mimics behaviors of legitimate users and evolves rapidly. In this paper, we propose a novel bipartite graph-based propagation approach, iBGP, for mobile apps advertising fraud detection in large advertising system. We exploit the characteristics of mobile advertising user’s behavior and identify two persistent patterns: power law distribution and pertinence and propose an automatic initial score learning algorithm to formulate both concepts to learn the initial scores of non-seed nodes. We propose a weighted graph propagation algorithm to propagate the scores of all nodes in the user-app bipartite graphs until convergence. To extend our approach for large-scale settings, we decompose the objective function of the initial score learning model into separate one-dimensional problems and parallelize the whole approach on an Apache Spark cluster. iBGP was applied on a large synthetic dataset and a large real-world mobile advertising dataset; experiment results demonstrate that iBGP significantly outperforms other popular graph-based propagation methods.

  11. A Graph-Algorithmic Approach for the Study of Metastability in Markov Chains

    Science.gov (United States)

    Gan, Tingyue; Cameron, Maria

    2017-06-01

    Large continuous-time Markov chains with exponentially small transition rates arise in modeling complex systems in physics, chemistry, and biology. We propose a constructive graph-algorithmic approach to determine the sequence of critical timescales at which the qualitative behavior of a given Markov chain changes, and give an effective description of the dynamics on each of them. This approach is valid for both time-reversible and time-irreversible Markov processes, with or without symmetry. Central to this approach are two graph algorithms, Algorithm 1 and Algorithm 2, for obtaining the sequences of the critical timescales and the hierarchies of Typical Transition Graphs or T-graphs indicating the most likely transitions in the system without and with symmetry, respectively. The sequence of critical timescales includes the subsequence of the reciprocals of the real parts of eigenvalues. Under a certain assumption, we prove sharp asymptotic estimates for eigenvalues (including pre-factors) and show how one can extract them from the output of Algorithm 1. We discuss the relationship between Algorithms 1 and 2 and explain how one needs to interpret the output of Algorithm 1 if it is applied in the case with symmetry instead of Algorithm 2. Finally, we analyze an example motivated by R. D. Astumian's model of the dynamics of kinesin, a molecular motor, by means of Algorithm 2.

  12. Quantification of three-dimensional cell-mediated collagen remodeling using graph theory.

    Science.gov (United States)

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

    2010-09-30

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

  13. Quantification of three-dimensional cell-mediated collagen remodeling using graph theory.

    Directory of Open Access Journals (Sweden)

    Cemal Cagatay Bilgin

    2010-09-01

    Full Text Available 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.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.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.

  14. Automatic segmentation of closed-contour features in ophthalmic images using graph theory and dynamic programming

    Science.gov (United States)

    Chiu, Stephanie J.; Toth, Cynthia A.; Bowes Rickman, Catherine; Izatt, Joseph A.; Farsiu, Sina

    2012-01-01

    This paper presents a generalized framework for segmenting closed-contour anatomical and pathological features using graph theory and dynamic programming (GTDP). More specifically, the GTDP method previously developed for quantifying retinal and corneal layer thicknesses is extended to segment objects such as cells and cysts. The presented technique relies on a transform that maps closed-contour features in the Cartesian domain into lines in the quasi-polar domain. The features of interest are then segmented as layers via GTDP. Application of this method to segment closed-contour features in several ophthalmic image types is shown. Quantitative validation experiments for retinal pigmented epithelium cell segmentation in confocal fluorescence microscopy images attests to the accuracy of the presented technique. PMID:22567602

  15. Topological quantum field theories in terms of coloured graphs associated to quantum groups

    International Nuclear Information System (INIS)

    Karowski, M.

    1993-01-01

    Apart from obvious mathematical applications the investigation is motivated by the problem of braid group statistics in physics. Statistics is one of the central concepts in many body quantum systems. Consider a system of two identical particles located at x 1 and x 2 in R d with Schroedinger wave function ψ(x 1 , x 2 ). Under the exchange of particles with these coordinates one usually has Bose or Fermi statistics in case ψ(x 2 , x 1 )=±ψ(x-1,x T 2). For a quick access to the problem consider the following classical geometric space-time description of the exchange of position for two identical particles, reflecting itself in two quantum mechanical transformation laws. We briefly review the set-up of topological quantum field theory and present our new formulation in terms of coloured graphs. (orig.)

  16. Independence theory in combinatorics an introductory account with applications to graphs and transversals

    CERN Document Server

    Bryant, Victor

    1980-01-01

    Combinatorics may very loosely be described as that branch of mathematics which is concerned with the problems of arranging objects in accordance with various imposed constraints. It covers a wide range of ideas and because of its fundamental nature it has applications throughout mathematics. Among the well-established areas of combinatorics may now be included the studies of graphs and networks, block designs, games, transversals, and enumeration problem s concerning permutations and combinations, from which the subject earned its title, as weil as the theory of independence spaces (or matroids). Along this broad front,various central themes link together the very diverse ideas. The theme which we introduce in this book is that of the abstract concept of independence. Here the reason for the abstraction is to unify; and, as we sh all see, this unification pays off handsomely with applications and illuminating sidelights in a wide variety of combinatorial situations. The study of combinatorics in general, and...

  17. Evaluation and selection of energy technologies using an integrated graph theory and analytic hierarchy process methods

    Directory of Open Access Journals (Sweden)

    P. B. Lanjewar

    2016-06-01

    Full Text Available The evaluation and selection of energy technologies involve a large number of attributes whose selection and weighting is decided in accordance with the social, environmental, technical and economic framework. In the present work an integrated multiple attribute decision making methodology is developed by combining graph theory and analytic hierarchy process methods to deal with the evaluation and selection of energy technologies. The energy technology selection attributes digraph enables a quick visual appraisal of the energy technology selection attributes and their interrelationships. The preference index provides a total objective score for comparison of energy technologies alternatives. Application of matrix permanent offers a better appreciation of the considered attributes and helps to analyze the different alternatives from combinatorial viewpoint. The AHP is used to assign relative weights to the attributes. Four examples of evaluation and selection of energy technologies are considered in order to demonstrate and validate the proposed method.

  18. State space model extraction of thermohydraulic systems – Part I: A linear graph approach

    International Nuclear Information System (INIS)

    Uren, K.R.; Schoor, G. van

    2013-01-01

    Thermohydraulic simulation codes are increasingly making use of graphical design interfaces. The user can quickly and easily design a thermohydraulic system by placing symbols on the screen resembling system components. These components can then be connected to form a system representation. Such system models may then be used to obtain detailed simulations of the physical system. Usually this kind of simulation models are too complex and not ideal for control system design. Therefore, a need exists for automated techniques to extract lumped parameter models useful for control system design. The goal of this first paper, in a two part series, is to propose a method that utilises a graphical representation of a thermohydraulic system, and a lumped parameter modelling approach, to extract state space models. In this methodology each physical domain of the thermohydraulic system is represented by a linear graph. These linear graphs capture the interaction between all components within and across energy domains – hydraulic, thermal and mechanical. These linear graphs are analysed using a graph-theoretic approach to derive reduced order state space models. These models capture the dominant dynamics of the thermohydraulic system and are ideal for control system design purposes. The proposed state space model extraction method is demonstrated by considering a U-tube system. A non-linear state space model is extracted representing both the hydraulic and thermal domain dynamics of the system. The simulated state space model is compared with a Flownex ® model of the U-tube. Flownex ® is a validated systems thermal-fluid simulation software package. - Highlights: • A state space model extraction methodology based on graph-theoretic concepts. • An energy-based approach to consider multi-domain systems in a common framework. • Allow extraction of transparent (white-box) state space models automatically. • Reduced order models containing only independent state

  19. Graph-based sequence annotation using a data integration approach

    Directory of Open Access Journals (Sweden)

    Pesch Robert

    2008-06-01

    Full Text Available The automated annotation of data from high throughput sequencing and genomics experiments is a significant challenge for bioinformatics. Most current approaches rely on sequential pipelines of gene finding and gene function prediction methods that annotate a gene with information from different reference data sources. Each function prediction method contributes evidence supporting a functional assignment. Such approaches generally ignore the links between the information in the reference datasets. These links, however, are valuable for assessing the plausibility of a function assignment and can be used to evaluate the confidence in a prediction. We are working towards a novel annotation system that uses the network of information supporting the function assignment to enrich the annotation process for use by expert curators and predicting the function of previously unannotated genes. In this paper we describe our success in the first stages of this development. We present the data integration steps that are needed to create the core database of integrated reference databases (UniProt, PFAM, PDB, GO and the pathway database Ara- Cyc which has been established in the ONDEX data integration system. We also present a comparison between different methods for integration of GO terms as part of the function assignment pipeline and discuss the consequences of this analysis for improving the accuracy of gene function annotation.

  20. Graph-based sequence annotation using a data integration approach.

    Science.gov (United States)

    Pesch, Robert; Lysenko, Artem; Hindle, Matthew; Hassani-Pak, Keywan; Thiele, Ralf; Rawlings, Christopher; Köhler, Jacob; Taubert, Jan

    2008-08-25

    The automated annotation of data from high throughput sequencing and genomics experiments is a significant challenge for bioinformatics. Most current approaches rely on sequential pipelines of gene finding and gene function prediction methods that annotate a gene with information from different reference data sources. Each function prediction method contributes evidence supporting a functional assignment. Such approaches generally ignore the links between the information in the reference datasets. These links, however, are valuable for assessing the plausibility of a function assignment and can be used to evaluate the confidence in a prediction. We are working towards a novel annotation system that uses the network of information supporting the function assignment to enrich the annotation process for use by expert curators and predicting the function of previously unannotated genes. In this paper we describe our success in the first stages of this development. We present the data integration steps that are needed to create the core database of integrated reference databases (UniProt, PFAM, PDB, GO and the pathway database Ara-Cyc) which has been established in the ONDEX data integration system. We also present a comparison between different methods for integration of GO terms as part of the function assignment pipeline and discuss the consequences of this analysis for improving the accuracy of gene function annotation. The methods and algorithms presented in this publication are an integral part of the ONDEX system which is freely available from http://ondex.sf.net/.

  1. ESIP's Earth Science Knowledge Graph (ESKG) Testbed Project: An Automatic Approach to Building Interdisciplinary Earth Science Knowledge Graphs to Improve Data Discovery

    Science.gov (United States)

    McGibbney, L. J.; Jiang, Y.; Burgess, A. B.

    2017-12-01

    Big Earth observation data have been produced, archived and made available online, but discovering the right data in a manner that precisely and efficiently satisfies user needs presents a significant challenge to the Earth Science (ES) community. An emerging trend in information retrieval community is to utilize knowledge graphs to assist users in quickly finding desired information from across knowledge sources. This is particularly prevalent within the fields of social media and complex multimodal information processing to name but a few, however building a domain-specific knowledge graph is labour-intensive and hard to keep up-to-date. In this work, we update our progress on the Earth Science Knowledge Graph (ESKG) project; an ESIP-funded testbed project which provides an automatic approach to building a dynamic knowledge graph for ES to improve interdisciplinary data discovery by leveraging implicit, latent existing knowledge present within across several U.S Federal Agencies e.g. NASA, NOAA and USGS. ESKG strengthens ties between observations and user communities by: 1) developing a knowledge graph derived from various sources e.g. Web pages, Web Services, etc. via natural language processing and knowledge extraction techniques; 2) allowing users to traverse, explore, query, reason and navigate ES data via knowledge graph interaction. ESKG has the potential to revolutionize the way in which ES communities interact with ES data in the open world through the entity, spatial and temporal linkages and characteristics that make it up. This project enables the advancement of ESIP collaboration areas including both Discovery and Semantic Technologies by putting graph information right at our fingertips in an interactive, modern manner and reducing the efforts to constructing ontology. To demonstrate the ESKG concept, we will demonstrate use of our framework across NASA JPL's PO.DAAC, NOAA's Earth Observation Requirements Evaluation System (EORES) and various USGS

  2. Predicting conversion from MCI to AD using resting-state fMRI, graph theoretical approach and SVM.

    Science.gov (United States)

    Hojjati, Seyed Hani; Ebrahimzadeh, Ata; Khazaee, Ali; Babajani-Feremi, Abbas

    2017-04-15

    We investigated identifying patients with mild cognitive impairment (MCI) who progress to Alzheimer's disease (AD), MCI converter (MCI-C), from those with MCI who do not progress to AD, MCI non-converter (MCI-NC), based on resting-state fMRI (rs-fMRI). Graph theory and machine learning approach were utilized to predict progress of patients with MCI to AD using rs-fMRI. Eighteen MCI converts (average age 73.6 years; 11 male) and 62 age-matched MCI non-converters (average age 73.0 years, 28 male) were included in this study. We trained and tested a support vector machine (SVM) to classify MCI-C from MCI-NC using features constructed based on the local and global graph measures. A novel feature selection algorithm was developed and utilized to select an optimal subset of features. Using subset of optimal features in SVM, we classified MCI-C from MCI-NC with an accuracy, sensitivity, specificity, and the area under the receiver operating characteristic (ROC) curve of 91.4%, 83.24%, 90.1%, and 0.95, respectively. Furthermore, results of our statistical analyses were used to identify the affected brain regions in AD. To the best of our knowledge, this is the first study that combines the graph measures (constructed based on rs-fMRI) with machine learning approach and accurately classify MCI-C from MCI-NC. Results of this study demonstrate potential of the proposed approach for early AD diagnosis and demonstrate capability of rs-fMRI to predict conversion from MCI to AD by identifying affected brain regions underlying this conversion. Copyright © 2017 Elsevier B.V. All rights reserved.

  3. Location theory a unified approach

    CERN Document Server

    Nickel, Stefan

    2006-01-01

    Although modern location theory is now more than 90 years old, the focus of researchers in this area has been mainly problem oriented. However, a common theory, which keeps the essential characteristics of classical location models, is still missing.This monograph addresses this issue. A flexible location problem called the Ordered Median Problem (OMP) is introduced. For all three main subareas of location theory (continuous, network and discrete location) structural properties of the OMP are presented and solution approaches provided. Numerous illustrations and examples help the reader to bec

  4. Graphs and matrices

    CERN Document Server

    Bapat, Ravindra B

    2014-01-01

    This new edition illustrates the power of linear algebra in the study of graphs. The emphasis on matrix techniques is greater than in other texts on algebraic graph theory. Important matrices associated with graphs (for example, incidence, adjacency and Laplacian matrices) are treated in detail. Presenting a useful overview of selected topics in algebraic graph theory, early chapters of the text focus on regular graphs, algebraic connectivity, the distance matrix of a tree, and its generalized version for arbitrary graphs, known as the resistance matrix. Coverage of later topics include Laplacian eigenvalues of threshold graphs, the positive definite completion problem and matrix games based on a graph. Such an extensive coverage of the subject area provides a welcome prompt for further exploration. The inclusion of exercises enables practical learning throughout the book. In the new edition, a new chapter is added on the line graph of a tree, while some results in Chapter 6 on Perron-Frobenius theory are reo...

  5. iBGP: A Bipartite Graph Propagation Approach for Mobile Advertising Fraud Detection

    OpenAIRE

    Hu, Jinlong; Liang, Junjie; Dong, Shoubin

    2017-01-01

    Online mobile advertising plays a vital financial role in supporting free mobile apps, but detecting malicious apps publishers who generate fraudulent actions on the advertisements hosted on their apps is difficult, since fraudulent traffic often mimics behaviors of legitimate users and evolves rapidly. In this paper, we propose a novel bipartite graph-based propagation approach, iBGP, for mobile apps advertising fraud detection in large advertising system. We exploit the characteristics of m...

  6. Multiscale Analysis of Time Irreversibility Based on Phase-Space Reconstruction and Horizontal Visibility Graph Approach

    Science.gov (United States)

    Zhang, Yongping; Shang, Pengjian; Xiong, Hui; Xia, Jianan

    Time irreversibility is an important property of nonequilibrium dynamic systems. A visibility graph approach was recently proposed, and this approach is generally effective to measure time irreversibility of time series. However, its result may be unreliable when dealing with high-dimensional systems. In this work, we consider the joint concept of time irreversibility and adopt the phase-space reconstruction technique to improve this visibility graph approach. Compared with the previous approach, the improved approach gives a more accurate estimate for the irreversibility of time series, and is more effective to distinguish irreversible and reversible stochastic processes. We also use this approach to extract the multiscale irreversibility to account for the multiple inherent dynamics of time series. Finally, we apply the approach to detect the multiscale irreversibility of financial time series, and succeed to distinguish the time of financial crisis and the plateau. In addition, Asian stock indexes away from other indexes are clearly visible in higher time scales. Simulations and real data support the effectiveness of the improved approach when detecting time irreversibility.

  7. Multilayer Spectral Graph Clustering via Convex Layer Aggregation: Theory and Algorithms

    OpenAIRE

    Chen, Pin-Yu; Hero, Alfred O.

    2017-01-01

    Multilayer graphs are commonly used for representing different relations between entities and handling heterogeneous data processing tasks. Non-standard multilayer graph clustering methods are needed for assigning clusters to a common multilayer node set and for combining information from each layer. This paper presents a multilayer spectral graph clustering (SGC) framework that performs convex layer aggregation. Under a multilayer signal plus noise model, we provide a phase transition analys...

  8. Generating random networks and graphs

    CERN Document Server

    Coolen, Ton; Roberts, Ekaterina

    2017-01-01

    This book supports researchers who need to generate random networks, or who are interested in the theoretical study of random graphs. The coverage includes exponential random graphs (where the targeted probability of each network appearing in the ensemble is specified), growth algorithms (i.e. preferential attachment and the stub-joining configuration model), special constructions (e.g. geometric graphs and Watts Strogatz models) and graphs on structured spaces (e.g. multiplex networks). The presentation aims to be a complete starting point, including details of both theory and implementation, as well as discussions of the main strengths and weaknesses of each approach. It includes extensive references for readers wishing to go further. The material is carefully structured to be accessible to researchers from all disciplines while also containing rigorous mathematical analysis (largely based on the techniques of statistical mechanics) to support those wishing to further develop or implement the theory of rand...

  9. Impaired cerebral blood flow networks in temporal lobe epilepsy with hippocampal sclerosis: A graph theoretical approach.

    Science.gov (United States)

    Sone, Daichi; Matsuda, Hiroshi; Ota, Miho; Maikusa, Norihide; Kimura, Yukio; Sumida, Kaoru; Yokoyama, Kota; Imabayashi, Etsuko; Watanabe, Masako; Watanabe, Yutaka; Okazaki, Mitsutoshi; Sato, Noriko

    2016-09-01

    Graph theory is an emerging method to investigate brain networks. Altered cerebral blood flow (CBF) has frequently been reported in temporal lobe epilepsy (TLE), but graph theoretical findings of CBF are poorly understood. Here, we explored graph theoretical networks of CBF in TLE using arterial spin labeling imaging. We recruited patients with TLE and unilateral hippocampal sclerosis (HS) (19 patients with left TLE, and 21 with right TLE) and 20 gender- and age-matched healthy control subjects. We obtained all participants' CBF maps using pseudo-continuous arterial spin labeling and analyzed them using the Graph Analysis Toolbox (GAT) software program. As a result, compared to the controls, the patients with left TLE showed a significantly low clustering coefficient (p=0.024), local efficiency (p=0.001), global efficiency (p=0.010), and high transitivity (p=0.015), whereas the patients with right TLE showed significantly high assortativity (p=0.046) and transitivity (p=0.011). The group with right TLE also had high characteristic path length values (p=0.085), low global efficiency (p=0.078), and low resilience to targeted attack (p=0.101) at a trend level. Lower normalized clustering coefficient (p=0.081) in the left TLE and higher normalized characteristic path length (p=0.089) in the right TLE were found also at a trend level. Both the patients with left and right TLE showed significantly decreased clustering in similar areas, i.e., the cingulate gyri, precuneus, and occipital lobe. Our findings revealed differing left-right network metrics in which an inefficient CBF network in left TLE and vulnerability to irritation in right TLE are suggested. The left-right common finding of regional decreased clustering might reflect impaired default-mode networks in TLE. Copyright © 2016 Elsevier Inc. All rights reserved.

  10. A Graph Cut Approach to Artery/Vein Classification in Ultra-Widefield Scanning Laser Ophthalmoscopy.

    Science.gov (United States)

    Pellegrini, Enrico; Robertson, Gavin; MacGillivray, Tom; van Hemert, Jano; Houston, Graeme; Trucco, Emanuele

    2018-02-01

    The classification of blood vessels into arterioles and venules is a fundamental step in the automatic investigation of retinal biomarkers for systemic diseases. In this paper, we present a novel technique for vessel classification on ultra-wide-field-of-view images of the retinal fundus acquired with a scanning laser ophthalmoscope. To the best of our knowledge, this is the first time that a fully automated artery/vein classification technique for this type of retinal imaging with no manual intervention has been presented. The proposed method exploits hand-crafted features based on local vessel intensity and vascular morphology to formulate a graph representation from which a globally optimal separation between the arterial and venular networks is computed by graph cut approach. The technique was tested on three different data sets (one publicly available and two local) and achieved an average classification accuracy of 0.883 in the largest data set.

  11. Quantum information processing with graph states

    International Nuclear Information System (INIS)

    Schlingemann, Dirk-Michael

    2005-04-01

    Graph states are multiparticle states which are associated with graphs. Each vertex of the graph corresponds to a single system or particle. The links describe quantum correlations (entanglement) between pairs of connected particles. Graph states were initiated independently by two research groups: On the one hand, graph states were introduced by Briegel and Raussendorf as a resource for a new model of one-way quantum computing, where algorithms are implemented by a sequence of measurements at single particles. On the other hand, graph states were developed by the author of this thesis and ReinhardWerner in Braunschweig, as a tool to build quantum error correcting codes, called graph codes. The connection between the two approaches was fully realized in close cooperation of both research groups. This habilitation thesis provides a survey of the theory of graph codes, focussing mainly, but not exclusively on the author's own research work. We present the theoretical and mathematical background for the analysis of graph codes. The concept of one-way quantum computing for general graph states is discussed. We explicitly show how to realize the encoding and decoding device of a graph code on a one-way quantum computer. This kind of implementation is to be seen as a mathematical description of a quantum memory device. In addition to that, we investigate interaction processes, which enable the creation of graph states on very large systems. Particular graph states can be created, for instance, by an Ising type interaction between next neighbor particles which sits at the points of an infinitely extended cubic lattice. Based on the theory of quantum cellular automata, we give a constructive characterization of general interactions which create a translationally invariant graph state. (orig.)

  12. Studying emotion theories through connectivity analysis: Evidence from generalized psychophysiological interactions and graph theory.

    Science.gov (United States)

    Huang, Yun-An; Jastorff, Jan; Van den Stock, Jan; Van de Vliet, Laura; Dupont, Patrick; Vandenbulcke, Mathieu

    2018-05-15

    Psychological construction models of emotion state that emotions are variable concepts constructed by fundamental psychological processes, whereas according to basic emotion theory, emotions cannot be divided into more fundamental units and each basic emotion is represented by a unique and innate neural circuitry. In a previous study, we found evidence for the psychological construction account by showing that several brain regions were commonly activated when perceiving different emotions (i.e. a general emotion network). Moreover, this set of brain regions included areas associated with core affect, conceptualization and executive control, as predicted by psychological construction models. Here we investigate directed functional brain connectivity in the same dataset to address two questions: 1) is there a common pathway within the general emotion network for the perception of different emotions and 2) if so, does this common pathway contain information to distinguish between different emotions? We used generalized psychophysiological interactions and information flow indices to examine the connectivity within the general emotion network. The results revealed a general emotion pathway that connects neural nodes involved in core affect, conceptualization, language and executive control. Perception of different emotions could not be accurately classified based on the connectivity patterns from the nodes of the general emotion pathway. Successful classification was achieved when connections outside the general emotion pathway were included. We propose that the general emotion pathway functions as a common pathway within the general emotion network and is involved in shared basic psychological processes across emotions. However, additional connections within the general emotion network are required to classify different emotions, consistent with a constructionist account. Copyright © 2018 Elsevier Inc. All rights reserved.

  13. Network organization is globally atypical in autism: A graph theory study of intrinsic functional connectivity.

    Science.gov (United States)

    Keown, Christopher L; Datko, Michael C; Chen, Colleen P; Maximo, José Omar; Jahedi, Afrooz; Müller, Ralph-Axel

    2017-01-01

    Despite abundant evidence of brain network anomalies in autism spectrum disorder (ASD), findings have varied from broad functional underconnectivity to broad overconnectivity. Rather than pursuing overly simplifying general hypotheses ('under' vs. 'over'), we tested the hypothesis of atypical network distribution in ASD (i.e., participation of unusual loci in distributed functional networks). We used a selective high-quality data subset from the ABIDE datashare (including 111 ASD and 174 typically developing [TD] participants) and several graph theory metrics. Resting state functional MRI data were preprocessed and analyzed for detection of low-frequency intrinsic signal correlations. Groups were tightly matched for available demographics and head motion. As hypothesized, the Rand Index (reflecting how similar network organization was to a normative set of networks) was significantly lower in ASD than TD participants. This was accounted for by globally reduced cohesion and density, but increased dispersion of networks. While differences in hub architecture did not survive correction, rich club connectivity (among the hubs) was increased in the ASD group. Our findings support the model of reduced network integration (connectivity with networks) and differentiation (or segregation; based on connectivity outside network boundaries) in ASD. While the findings applied at the global level, they were not equally robust across all networks and in one case (greater cohesion within ventral attention network in ASD) even reversed.

  14. Graphs and Homomorphisms

    CERN Document Server

    Hell, Pavol

    2004-01-01

    This is a book about graph homomorphisms. Graph theory is now an established discipline but the study of graph homomorphisms has only recently begun to gain wide acceptance and interest. The subject gives a useful perspective in areas such as graph reconstruction, products, fractional and circular colourings, and has applications in complexity theory, artificial intelligence, telecommunication, and, most recently, statistical physics.Based on the authors' lecture notes for graduate courses, this book can be used as a textbook for a second course in graph theory at 4th year or master's level an

  15. Mining chemical reactions using neighborhood behavior and condensed graphs of reactions approaches.

    Science.gov (United States)

    de Luca, Aurélie; Horvath, Dragos; Marcou, Gilles; Solov'ev, Vitaly; Varnek, Alexandre

    2012-09-24

    This work addresses the problem of similarity search and classification of chemical reactions using Neighborhood Behavior (NB) and Condensed Graphs of Reaction (CGR) approaches. The CGR formalism represents chemical reactions as a classical molecular graph with dynamic bonds, enabling descriptor calculations on this graph. Different types of the ISIDA fragment descriptors generated for CGRs in combination with two metrics--Tanimoto and Euclidean--were considered as chemical spaces, to serve for reaction dissimilarity scoring. The NB method has been used to select an optimal combination of descriptors which distinguish different types of chemical reactions in a database containing 8544 reactions of 9 classes. Relevance of NB analysis has been validated in generic (multiclass) similarity search and in clustering with Self-Organizing Maps (SOM). NB-compliant sets of descriptors were shown to display enhanced mapping propensities, allowing the construction of better Self-Organizing Maps and similarity searches (NB and classical similarity search criteria--AUC ROC--correlate at a level of 0.7). The analysis of the SOM clusters proved chemically meaningful CGR substructures representing specific reaction signatures.

  16. Key Concept Identification: A Comprehensive Analysis of Frequency and Topical Graph-Based Approaches

    Directory of Open Access Journals (Sweden)

    Muhammad Aman

    2018-05-01

    Full Text Available Automatic key concept extraction from text is the main challenging task in information extraction, information retrieval and digital libraries, ontology learning, and text analysis. The statistical frequency and topical graph-based ranking are the two kinds of potentially powerful and leading unsupervised approaches in this area, devised to address the problem. To utilize the potential of these approaches and improve key concept identification, a comprehensive performance analysis of these approaches on datasets from different domains is needed. The objective of the study presented in this paper is to perform a comprehensive empirical analysis of selected frequency and topical graph-based algorithms for key concept extraction on three different datasets, to identify the major sources of error in these approaches. For experimental analysis, we have selected TF-IDF, KP-Miner and TopicRank. Three major sources of error, i.e., frequency errors, syntactical errors and semantical errors, and the factors that contribute to these errors are identified. Analysis of the results reveals that performance of the selected approaches is significantly degraded by these errors. These findings can help us develop an intelligent solution for key concept extraction in the future.

  17. Monitoring Effective Connectivity in the Preterm Brain: A Graph Approach to Study Maturation

    Directory of Open Access Journals (Sweden)

    M. Lavanga

    2017-01-01

    Full Text Available In recent years, functional connectivity in the developmental science received increasing attention. Although it has been reported that the anatomical connectivity in the preterm brain develops dramatically during the last months of pregnancy, little is known about how functional and effective connectivity change with maturation. The present study investigated how effective connectivity in premature infants evolves. To assess it, we use EEG measurements and graph-theory methodologies. We recorded data from 25 preterm babies, who underwent long-EEG monitoring at least twice during their stay in the NICU. The recordings took place from 27 weeks postmenstrual age (PMA until 42 weeks PMA. Results showed that the EEG-connectivity, assessed using graph-theory indices, moved from a small-world network to a random one, since the clustering coefficient increases and the path length decreases. This shift can be due to the development of the thalamocortical connections and long-range cortical connections. Based on the network indices, we developed different age-prediction models. The best result showed that it is possible to predict the age of the infant with a root mean-squared error (MSE equal to 2.11 weeks. These results are similar to the ones reported in the literature for age prediction in preterm babies.

  18. A signal-flow-graph approach to on-line gradient calculation.

    Science.gov (United States)

    Campolucci, P; Uncini, A; Piazza, F

    2000-08-01

    A large class of nonlinear dynamic adaptive systems such as dynamic recurrent neural networks can be effectively represented by signal flow graphs (SFGs). By this method, complex systems are described as a general connection of many simple components, each of them implementing a simple one-input, one-output transformation, as in an electrical circuit. Even if graph representations are popular in the neural network community, they are often used for qualitative description rather than for rigorous representation and computational purposes. In this article, a method for both on-line and batch-backward gradient computation of a system output or cost function with respect to system parameters is derived by the SFG representation theory and its known properties. The system can be any causal, in general nonlinear and time-variant, dynamic system represented by an SFG, in particular any feedforward, time-delay, or recurrent neural network. In this work, we use discrete-time notation, but the same theory holds for the continuous-time case. The gradient is obtained in a straightforward way by the analysis of two SFGs, the original one and its adjoint (obtained from the first by simple transformations), without the complex chain rule expansions of derivatives usually employed. This method can be used for sensitivity analysis and for learning both off-line and on-line. On-line learning is particularly important since it is required by many real applications, such as digital signal processing, system identification and control, channel equalization, and predistortion.

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

    Science.gov (United States)

    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.

  20. Abnormal brain white matter network in young smokers: a graph theory analysis study.

    Science.gov (United States)

    Zhang, Yajuan; Li, Min; Wang, Ruonan; Bi, Yanzhi; Li, Yangding; Yi, Zhang; Liu, Jixin; Yu, Dahua; Yuan, Kai

    2018-04-01

    Previous diffusion tensor imaging (DTI) studies had investigated the white matter (WM) integrity abnormalities in some specific fiber bundles in smokers. However, little is known about the changes in topological organization of WM structural network in young smokers. In current study, we acquired DTI datasets from 58 male young smokers and 51 matched nonsmokers and constructed the WM networks by the deterministic fiber tracking approach. Graph theoretical analysis was used to compare the topological parameters of WM network (global and nodal) and the inter-regional fractional anisotropy (FA) weighted WM connections between groups. The results demonstrated that both young smokers and nonsmokers had small-world topology in WM network. Further analysis revealed that the young smokers exhibited the abnormal topological organization, i.e., increased network strength, global efficiency, and decreased shortest path length. In addition, the increased nodal efficiency predominately was located in frontal cortex, striatum and anterior cingulate gyrus (ACG) in smokers. Moreover, based on network-based statistic (NBS) approach, the significant increased FA-weighted WM connections were mainly found in the PFC, ACG and supplementary motor area (SMA) regions. Meanwhile, the network parameters were correlated with the nicotine dependence severity (FTND) scores, and the nodal efficiency of orbitofrontal cortex was positive correlation with the cigarette per day (CPD) in young smokers. We revealed the abnormal topological organization of WM network in young smokers, which may improve our understanding of the neural mechanism of young smokers form WM topological organization level.

  1. Development of a new nuclide generation and depletion code using a topological solver based on graph theory

    Energy Technology Data Exchange (ETDEWEB)

    Kasselmann, S., E-mail: s.kasselmann@fz-juelich.de [Forschungszentrum Jülich, 52425 Jülich (Germany); Schitthelm, O. [Forschungszentrum Jülich, 52425 Jülich (Germany); Tantillo, F. [Forschungszentrum Jülich, 52425 Jülich (Germany); Institute for Reactor Safety and Reactor Technology, RWTH-Aachen, 52064 Aachen (Germany); Scholthaus, S.; Rössel, C. [Forschungszentrum Jülich, 52425 Jülich (Germany); Allelein, H.-J. [Forschungszentrum Jülich, 52425 Jülich (Germany); Institute for Reactor Safety and Reactor Technology, RWTH-Aachen, 52064 Aachen (Germany)

    2016-09-15

    The problem of calculating the amounts of a coupled nuclide system varying with time especially when exposed to a neutron flux is a well-known problem and has been addressed by a number of computer codes. These codes cover a broad spectrum of applications, are based on comprehensive validation work and are therefore justifiably renowned among their users. However, due to their long development history, they are lacking a modern interface, which impedes a fast and robust internal coupling to other codes applied in the field of nuclear reactor physics. Therefore a project has been initiated to develop a new object-oriented nuclide transmutation code. It comprises an innovative solver based on graph theory, which exploits the topology of nuclide chains and therefore speeds up the calculation scheme. Highest priority has been given to the existence of a generic software interface well as an easy handling by making use of XML files for the user input. In this paper we report on the status of the code development and present first benchmark results, which prove the applicability of the selected approach.

  2. Development of a new nuclide generation and depletion code using a topological solver based on graph theory

    International Nuclear Information System (INIS)

    Kasselmann, S.; Scholthaus, S.; Rössel, C.; Allelein, H.-J.

    2014-01-01

    The problem of calculating the amounts of a coupled nuclide system varying with time especially when exposed to a neutron flux is a well-known problem and has been addressed by a number of computer codes. These codes cover a broad spectrum of applications, are based on comprehensive validation work and are therefore justifiably renowned among their users. However, due to their long development history, they are lacking a modern interface, which impedes a fast and robust internal coupling to other codes applied in the field of nuclear reactor physics. Therefore a project has been initiated to develop a new object-oriented nuclide transmutation code. It comprises an innovative solver based on graph theory, which exploits the topology of nuclide chains. This allows to always deal with the smallest nuclide system for the problem of interest. Highest priority has been given to the existence of a generic software interfaces well as an easy handling by making use of XML files for input and output. In this paper we report on the status of the code development and present first benchmark results, which prove the applicability of the selected approach. (author)

  3. Subgraph detection using graph signals

    KAUST Repository

    Chepuri, Sundeep Prabhakar

    2017-03-06

    In this paper we develop statistical detection theory for graph signals. In particular, given two graphs, namely, a background graph that represents an usual activity and an alternative graph that represents some unusual activity, we are interested in answering the following question: To which of the two graphs does the observed graph signal fit the best? To begin with, we assume both the graphs are known, and derive an optimal Neyman-Pearson detector. Next, we derive a suboptimal detector for the case when the alternative graph is not known. The developed theory is illustrated with numerical experiments.

  4. Subgraph detection using graph signals

    KAUST Repository

    Chepuri, Sundeep Prabhakar; Leus, Geert

    2017-01-01

    In this paper we develop statistical detection theory for graph signals. In particular, given two graphs, namely, a background graph that represents an usual activity and an alternative graph that represents some unusual activity, we are interested in answering the following question: To which of the two graphs does the observed graph signal fit the best? To begin with, we assume both the graphs are known, and derive an optimal Neyman-Pearson detector. Next, we derive a suboptimal detector for the case when the alternative graph is not known. The developed theory is illustrated with numerical experiments.

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

    Science.gov (United States)

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

    2016-01-15

    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. Cytoscape.js is implemented in JavaScript. Documentation, downloads and source code are available at http://js.cytoscape.org. gary.bader@utoronto.ca. © The Author 2015. Published by Oxford University Press.

  6. On middle cube graphs

    Directory of Open Access Journals (Sweden)

    C. Dalfo

    2015-10-01

    Full Text Available We study a family of graphs related to the $n$-cube. The middle cube graph of parameter k is the subgraph of $Q_{2k-1}$ induced by the set of vertices whose binary representation has either $k-1$ or $k$ number of ones. The middle cube graphs can be obtained from the well-known odd graphs by doubling their vertex set. Here we study some of the properties of the middle cube graphs in the light of the theory of distance-regular graphs. In particular, we completely determine their spectra (eigenvalues and their multiplicities, and associated eigenvectors.

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

    Science.gov (United States)

    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.

  8. Fuzzy Graph Language Recognizability

    OpenAIRE

    Kalampakas , Antonios; Spartalis , Stefanos; Iliadis , Lazaros

    2012-01-01

    Part 5: Fuzzy Logic; International audience; Fuzzy graph language recognizability is introduced along the lines of the established theory of syntactic graph language recognizability by virtue of the algebraic structure of magmoids. The main closure properties of the corresponding class are investigated and several interesting examples of fuzzy graph languages are examined.

  9. Graph theory enables drug repurposing--how a mathematical model can drive the discovery of hidden mechanisms of action.

    Directory of Open Access Journals (Sweden)

    Ruggero Gramatica

    Full Text Available 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.

  10. Graph theory enables drug repurposing--how a mathematical model can drive the discovery of hidden mechanisms of action.

    Science.gov (United States)

    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.

  11. Bond graph modelling of engineering systems: theory, applications and software support

    National Research Council Canada - National Science Library

    Borutzky, Wolfgang; Margolis, Donald L

    2011-01-01

    ... way such that analytical or computer response predictions can be straightforwardly carried out. Bond graphs are a concise pictorial representation of all types of interacting energetic systems. In my experience working with engineers on the development of complex systems it is obvious that these systems suffer from thermal problems, structural problems, vibration and noise problems, and control and stability issues that do not fit into a single discipline. Bond graphs provide the link by which all these different ...

  12. Giant resonances: reaction theory approach

    International Nuclear Information System (INIS)

    Toledo Piza, A.F.R. de; Foglia, G.A.

    1989-09-01

    The study of giant resonances through the use of reaction theory approach is presented and discussed. Measurements of cross-sections to the many available decay channels following excitation of giant multipole resonances (GMR) led one to view these phenomena as complicated dynamical syndromes so that theoretical requirements for their study must be extended beyond the traditional bounds of nuclear structure models. The spectra of decay products following GMR excitation in heavy nuclei are well described by statistical model (Hauser-Feshback, HF) predictions indicated that spreading of the collective modes plays a major role in shaping exclusive cross-sections. (A.C.A.S.) [pt

  13. Using graph theory to analyze the vulnerability of process plants in the context of cascading effects

    International Nuclear Information System (INIS)

    Khakzad, Nima; Reniers, Genserik

    2015-01-01

    Dealing with large quantities of flammable and explosive materials, usually at high-pressure high-temperature conditions, makes process plants very vulnerable to cascading effects compared with other infrastructures. The combination of the extremely low frequency of cascading effects and the high complexity and interdependencies of process plants makes risk assessment and vulnerability analysis of process plants very challenging in the context of such events. In the present study, cascading effects were represented as a directed graph; accordingly, the efficacy of a set of graph metrics and measurements was examined in both unit and plant-wide vulnerability analysis of process plants. We demonstrated that vertex-level closeness and betweenness can be used in the unit vulnerability analysis of process plants for the identification of critical units within a process plant. Furthermore, the graph-level closeness metric can be used in the plant-wide vulnerability analysis for the identification of the most vulnerable plant layout with respect to the escalation of cascading effects. Furthermore, the results from the application of the graph metrics have been verified using a Bayesian network methodology. - Highlights: • Graph metrics can effectively be employed to identify vulnerable units and layouts in process plants. • Units with larger vertex-level closeness result in more probable and severe cascading effects. • Units with larger vertex-level betweenness contribute more to the escalation of cascading effects. • Layouts with larger graph-level closeness are more vulnerable to the escalation of cascading effects

  14. A Bond Graph Approach for the Modeling and Simulation of a Buck Converter

    Directory of Open Access Journals (Sweden)

    Rached Zrafi

    2018-01-01

    Full Text Available This paper deals with the modeling of bond graph buck converter systems. The bond graph formalism, which represents a heterogeneous formalism for physical modeling, is used to design a sub-model of a power MOSFET and PiN diode switchers. These bond graph models are based on the device’s electrical elements. The application of these models to a bond graph buck converter permit us to obtain an invariant causal structure when the switch devices change state. This paper shows the usefulness of the bond graph device’s modeling to simulate an implicit bond graph buck converter.

  15. Introduction to quantum graphs

    CERN Document Server

    Berkolaiko, Gregory

    2012-01-01

    A "quantum graph" is a graph considered as a one-dimensional complex and equipped with a differential operator ("Hamiltonian"). Quantum graphs arise naturally as simplified models in mathematics, physics, chemistry, and engineering when one considers propagation of waves of various nature through a quasi-one-dimensional (e.g., "meso-" or "nano-scale") system that looks like a thin neighborhood of a graph. Works that currently would be classified as discussing quantum graphs have been appearing since at least the 1930s, and since then, quantum graphs techniques have been applied successfully in various areas of mathematical physics, mathematics in general and its applications. One can mention, for instance, dynamical systems theory, control theory, quantum chaos, Anderson localization, microelectronics, photonic crystals, physical chemistry, nano-sciences, superconductivity theory, etc. Quantum graphs present many non-trivial mathematical challenges, which makes them dear to a mathematician's heart. Work on qu...

  16. A study of brain networks associated with swallowing using graph-theoretical approaches.

    Directory of Open Access Journals (Sweden)

    Bo Luan

    Full Text Available Functional connectivity between brain regions during swallowing tasks is still not well understood. Understanding these complex interactions is of great interest from both a scientific and a clinical perspective. In this study, functional magnetic resonance imaging (fMRI was utilized to study brain functional networks during voluntary saliva swallowing in twenty-two adult healthy subjects (all females, [Formula: see text] years of age. To construct these functional connections, we computed mean partial correlation matrices over ninety brain regions for each participant. Two regions were determined to be functionally connected if their correlation was above a certain threshold. These correlation matrices were then analyzed using graph-theoretical approaches. In particular, we considered several network measures for the whole brain and for swallowing-related brain regions. The results have shown that significant pairwise functional connections were, mostly, either local and intra-hemispheric or symmetrically inter-hemispheric. Furthermore, we showed that all human brain functional network, although varying in some degree, had typical small-world properties as compared to regular networks and random networks. These properties allow information transfer within the network at a relatively high efficiency. Swallowing-related brain regions also had higher values for some of the network measures in comparison to when these measures were calculated for the whole brain. The current results warrant further investigation of graph-theoretical approaches as a potential tool for understanding the neural basis of dysphagia.

  17. A Structure-graph Approach to Diagnosis and Control Reconfiguration Design - exemplified by Station-keeping Control

    DEFF Research Database (Denmark)

    Blanke, Mogens

    2005-01-01

    This paper addresses the design process of diagnosis and fault-tolerant control when a system should operate despite multiple failures in sensors or actuators. Graph-theory based analysis of system's structure is demonstrated to be a unique design methodology that can cope with the diagnosis desi...

  18. A statistical mechanics approach to Granovetter theory

    Science.gov (United States)

    Barra, Adriano; Agliari, Elena

    2012-05-01

    In this paper we try to bridge breakthroughs in quantitative sociology/econometrics, pioneered during the last decades by Mac Fadden, Brock-Durlauf, Granovetter and Watts-Strogatz, by introducing a minimal model able to reproduce essentially all the features of social behavior highlighted by these authors. Our model relies on a pairwise Hamiltonian for decision-maker interactions which naturally extends the multi-populations approaches by shifting and biasing the pattern definitions of a Hopfield model of neural networks. Once introduced, the model is investigated through graph theory (to recover Granovetter and Watts-Strogatz results) and statistical mechanics (to recover Mac-Fadden and Brock-Durlauf results). Due to the internal symmetries of our model, the latter is obtained as the relaxation of a proper Markov process, allowing even to study its out-of-equilibrium properties. The method used to solve its equilibrium is an adaptation of the Hamilton-Jacobi technique recently introduced by Guerra in the spin-glass scenario and the picture obtained is the following: shifting the patterns from [-1,+1]→[0.+1] implies that the larger the amount of similarities among decision makers, the stronger their relative influence, and this is enough to explain both the different role of strong and weak ties in the social network as well as its small-world properties. As a result, imitative interaction strengths seem essentially a robust request (enough to break the gauge symmetry in the couplings), furthermore, this naturally leads to a discrete choice modelization when dealing with the external influences and to imitative behavior à la Curie-Weiss as the one introduced by Brock and Durlauf.

  19. A Selectivity based approach to Continuous Pattern Detection in Streaming Graphs

    Energy Technology Data Exchange (ETDEWEB)

    Choudhury, Sutanay; Holder, Larry; Chin, George; Agarwal, Khushbu; Feo, John T.

    2015-05-27

    Cyber security is one of the most significant technical challenges in current times. Detecting adversarial activities, prevention of theft of intellectual properties and customer data is a high priority for corporations and government agencies around the world. Cyber defenders need to analyze massive-scale, high-resolution network flows to identify, categorize, and mitigate attacks involving networks spanning institutional and national boundaries. Many of the cyber attacks can be described as subgraph patterns, with prominent examples being insider infiltrations (path queries), denial of service (parallel paths) and malicious spreads (tree queries). This motivates us to explore subgraph matching on streaming graphs in a continuous setting. The novelty of our work lies in using the subgraph distributional statistics collected from the streaming graph to determine the query processing strategy. We introduce a ``Lazy Search" algorithm where the search strategy is decided on a vertex-to-vertex basis depending on the likelihood of a match in the vertex neighborhood. We also propose a metric named ``Relative Selectivity" that is used to select between different query processing strategies. Our experiments performed on real online news, network traffic stream and a synthetic social network benchmark demonstrate 10-100x speedups over non-incremental, selectivity agnostic approaches.

  20. Intraplate seismicity in Canada: a graph theoretic approach to data analysis and interpretation

    Directory of Open Access Journals (Sweden)

    K. Vasudevan

    2010-10-01

    Full Text Available Intraplate seismicity occurs in central and northern Canada, but the underlying origin and dynamics remain poorly understood. Here, we apply a graph theoretic approach to characterize the statistical structure of spatiotemporal clustering exhibited by intraplate seismicity, a direct consequence of the underlying nonlinear dynamics. Using a recently proposed definition of "recurrences" based on record breaking processes (Davidsen et al., 2006, 2008, we have constructed directed graphs using catalogue data for three selected regions (Region 1: 45°−48° N/74°−80° W; Region 2: 51°−55° N/77°−83° W; and Region 3: 56°−70° N/65°−95° W, with attributes drawn from the location, origin time and the magnitude of the events. Based on comparisons with a null model derived from Poisson distribution or Monte Carlo shuffling of the catalogue data, our results provide strong evidence in support of spatiotemporal correlations of seismicity in all three regions considered. Similar evidence for spatiotemporal clustering has been documented using seismicity catalogues for southern California, suggesting possible similarities in underlying earthquake dynamics of both regions despite huge differences in the variability of seismic activity.

  1. Interaction graphs

    DEFF Research Database (Denmark)

    Seiller, Thomas

    2016-01-01

    Interaction graphs were introduced as a general, uniform, construction of dynamic models of linear logic, encompassing all Geometry of Interaction (GoI) constructions introduced so far. This series of work was inspired from Girard's hyperfinite GoI, and develops a quantitative approach that should...... be understood as a dynamic version of weighted relational models. Until now, the interaction graphs framework has been shown to deal with exponentials for the constrained system ELL (Elementary Linear Logic) while keeping its quantitative aspect. Adapting older constructions by Girard, one can clearly define...... "full" exponentials, but at the cost of these quantitative features. We show here that allowing interpretations of proofs to use continuous (yet finite in a measure-theoretic sense) sets of states, as opposed to earlier Interaction Graphs constructions were these sets of states were discrete (and finite...

  2. Mean Curvature, Threshold Dynamics, and Phase Field Theory on Finite Graphs

    Science.gov (United States)

    2013-06-28

    3380. [DEL12a] Xavier Desquesnes, Abderrahim Elmoataz, and Olivier Lézoray, Eikonal equation adapta- tion on weighted graphs: Fast geometric diffusion...Abderrahim Elmoataz, Olivier Lézoray, and Vinh-Thong Ta, Efficient algorithms for image and high dimensional data processing using eikonal equation on

  3. Presurgery resting-state local graph-theory measures predict neurocognitive outcomes after brain surgery in temporal lobe epilepsy.

    Science.gov (United States)

    Doucet, Gaelle E; Rider, Robert; Taylor, Nathan; Skidmore, Christopher; Sharan, Ashwini; Sperling, Michael; Tracy, Joseph I

    2015-04-01

    This study determined the ability of resting-state functional connectivity (rsFC) graph-theory measures to predict neurocognitive status postsurgery in patients with temporal lobe epilepsy (TLE) who underwent anterior temporal lobectomy (ATL). A presurgical resting-state functional magnetic resonance imaging (fMRI) condition was collected in 16 left and 16 right TLE patients who underwent ATL. In addition, patients received neuropsychological testing pre- and postsurgery in verbal and nonverbal episodic memory, language, working memory, and attention domains. Regarding the functional data, we investigated three graph-theory properties (local efficiency, distance, and participation), measuring segregation, integration and centrality, respectively. These measures were only computed in regions of functional relevance to the ictal pathology, or the cognitive domain. Linear regression analyses were computed to predict the change in each neurocognitive domain. Our analyses revealed that cognitive outcome was successfully predicted with at least 68% of the variance explained in each model, for both TLE groups. The only model not significantly predictive involved nonverbal episodic memory outcome in right TLE. Measures involving the healthy hippocampus were the most common among the predictors, suggesting that enhanced integration of this structure with the rest of the brain may improve cognitive outcomes. Regardless of TLE group, left inferior frontal regions were the best predictors of language outcome. Working memory outcome was predicted mostly by right-sided regions, in both groups. Overall, the results indicated our integration measure was the most predictive of neurocognitive outcome. In contrast, our segregation measure was the least predictive. This study provides evidence that presurgery rsFC measures may help determine neurocognitive outcomes following ATL. The results have implications for refining our understanding of compensatory reorganization and predicting

  4. Forecasting Construction Cost Index based on visibility graph: A network approach

    Science.gov (United States)

    Zhang, Rong; Ashuri, Baabak; Shyr, Yu; Deng, Yong

    2018-03-01

    Engineering News-Record (ENR), a professional magazine in the field of global construction engineering, publishes Construction Cost Index (CCI) every month. Cost estimators and contractors assess projects, arrange budgets and prepare bids by forecasting CCI. However, fluctuations and uncertainties of CCI cause irrational estimations now and then. This paper aims at achieving more accurate predictions of CCI based on a network approach in which time series is firstly converted into a visibility graph and future values are forecasted relied on link prediction. According to the experimental results, the proposed method shows satisfactory performance since the error measures are acceptable. Compared with other methods, the proposed method is easier to implement and is able to forecast CCI with less errors. It is convinced that the proposed method is efficient to provide considerably accurate CCI predictions, which will make contributions to the construction engineering by assisting individuals and organizations in reducing costs and making project schedules.

  5. Time series analysis of S&P 500 index: A horizontal visibility graph approach

    Science.gov (United States)

    Vamvakaris, Michail D.; Pantelous, Athanasios A.; Zuev, Konstantin M.

    2018-05-01

    The behavior of stock prices has been thoroughly studied throughout the last century, and contradictory results have been reported in the corresponding literature. In this paper, a network theoretical approach is provided to investigate how crises affected the behavior of US stock prices. We analyze high frequency data from S&P500 via the Horizontal Visibility Graph method, and find that all major crises that took place worldwide in the last twenty years, affected significantly the behavior of the price-index. Nevertheless, we observe that each of those crises impacted the index in a different way and magnitude. Interestingly, our results suggest that the predictability of the price-index series increases during the periods of crises.

  6. The use of graph theory in the sensitivity analysis of the model output: a second order screening method

    International Nuclear Information System (INIS)

    Campolongo, Francesca; Braddock, Roger

    1999-01-01

    Sensitivity analysis screening methods aim to isolate the most important factors in experiments involving a large number of significant factors and interactions. This paper extends the one-factor-at-a-time screening method proposed by Morris. The new method, in addition to the 'overall' sensitivity measures already provided by the traditional Morris method, offers estimates of the two-factor interaction effects. The number of model evaluations required is O(k 2 ), where k is the number of model input factors. The efficient sampling strategy in the parameter space is based on concepts of graph theory and on the solution of the 'handcuffed prisoner problem'

  7. An original approach to the mathematical concept of graph from braid crafts

    Directory of Open Access Journals (Sweden)

    Albanese Veronica

    2016-01-01

    Full Text Available In previous researches we found that a community of Argentinean artisans models its own practices of braiding using graphs. Inspired by these findings, we designed an educational activity to introduce the concept of graphs. The study of graphs helps students to develop combinatorial and systematic thinking as well as skills to model reality and abstract and generalize patterns from particular situations. The tasks proposed aim to construct the concept of graphs, then identify characteristics that allow some graphs to be models of braids and finally use them to invent more graphs for new braids. The activity performed in a secondary school teachers’ educational course, had quite satisfactory results due to the number of braids invented and the small amount of mistakes made by the participants.

  8. Nonschematic drawing recognition: a new approach based on attributed graph grammar with flexible embedding

    Science.gov (United States)

    Lee, Kyu J.; Kunii, T. L.; Noma, T.

    1993-01-01

    In this paper, we propose a syntactic pattern recognition method for non-schematic drawings, based on a new attributed graph grammar with flexible embedding. In our graph grammar, the embedding rule permits the nodes of a guest graph to be arbitrarily connected with the nodes of a host graph. The ambiguity caused by this flexible embedding is controlled with the evaluation of synthesized attributes and the check of context sensitivity. To integrate parsing with the synthesized attribute evaluation and the context sensitivity check, we also develop a bottom up parsing algorithm.

  9. Graph Theory-Based Brain Connectivity for Automatic Classification of Multiple Sclerosis Clinical Courses

    Directory of Open Access Journals (Sweden)

    Gabriel Kocevar

    2016-10-01

    Full Text Available Purpose: In this work, we introduce a method to classify Multiple Sclerosis (MS patients into four clinical profiles using structural connectivity information. For the first time, we try to solve this question in a fully automated way using a computer-based method. The main goal is to show how the combination of graph-derived metrics with machine learning techniques constitutes a powerful tool for a better characterization and classification of MS clinical profiles.Materials and methods: Sixty-four MS patients (12 Clinical Isolated Syndrome (CIS, 24 Relapsing Remitting (RR, 24 Secondary Progressive (SP, and 17 Primary Progressive (PP along with 26 healthy controls (HC underwent MR examination. T1 and diffusion tensor imaging (DTI were used to obtain structural connectivity matrices for each subject. Global graph metrics, such as density and modularity, were estimated and compared between subjects’ groups. These metrics were further used to classify patients using tuned Support Vector Machine (SVM combined with Radial Basic Function (RBF kernel.Results: When comparing MS patients to HC subjects, a greater assortativity, transitivity and characteristic path length as well as a lower global efficiency were found. Using all graph metrics, the best F-Measures (91.8%, 91.8%, 75.6% and 70.6% were obtained for binary (HC-CIS, CIS-RR, RR-PP and multi-class (CIS-RR-SP classification tasks, respectively. When using only one graph metric, the best F-Measures (83.6%, 88.9% and 70.7% were achieved for modularity with previous binary classification tasks.Conclusion: Based on a simple DTI acquisition associated with structural brain connectivity analysis, this automatic method allowed an accurate classification of different MS patients’ clinical profiles.

  10. Chromatic polynomials of random graphs

    International Nuclear Information System (INIS)

    Van Bussel, Frank; Fliegner, Denny; Timme, Marc; Ehrlich, Christoph; Stolzenberg, Sebastian

    2010-01-01

    Chromatic polynomials and related graph invariants are central objects in both graph theory and statistical physics. Computational difficulties, however, have so far restricted studies of such polynomials to graphs that were either very small, very sparse or highly structured. Recent algorithmic advances (Timme et al 2009 New J. Phys. 11 023001) now make it possible to compute chromatic polynomials for moderately sized graphs of arbitrary structure and number of edges. Here we present chromatic polynomials of ensembles of random graphs with up to 30 vertices, over the entire range of edge density. We specifically focus on the locations of the zeros of the polynomial in the complex plane. The results indicate that the chromatic zeros of random graphs have a very consistent layout. In particular, the crossing point, the point at which the chromatic zeros with non-zero imaginary part approach the real axis, scales linearly with the average degree over most of the density range. While the scaling laws obtained are purely empirical, if they continue to hold in general there are significant implications: the crossing points of chromatic zeros in the thermodynamic limit separate systems with zero ground state entropy from systems with positive ground state entropy, the latter an exception to the third law of thermodynamics.

  11. Designing a graph-based approach to landscape ecological assessment of linear infrastructures

    Energy Technology Data Exchange (ETDEWEB)

    Girardet, Xavier, E-mail: xavier.girardet@univ-fcomte.fr; Foltête, Jean-Christophe, E-mail: jean-christophe.foltete@univ-fcomte.fr; Clauzel, Céline, E-mail: celine.clauzel@univ-fcomte.fr

    2013-09-15

    The development of major linear infrastructures contributes to landscape fragmentation and impacts natural habitats and biodiversity in various ways. To anticipate and minimize such impacts, landscape planning needs to be capable of effective strategic environmental assessment (SEA) and of supporting environmental impact assessment (EIA) decisions. To this end, species distribution models (SDMs) are an effective way of making predictive maps of the presence of a given species. In this paper, we propose to combine SDMs and graph-based representation of landscape networks to integrate the potential long-distance effect of infrastructures on species distribution. A diachronic approach, comparing distribution before and after the linear infrastructure is constructed, leads to the design of a species distribution assessment (SDA), taking into account population isolation. The SDA makes it possible (1) to estimate the local variation in probability of presence and (2) to characterize the impact of the infrastructure in terms of global variation in presence and of distance of disturbance. The method is illustrated by assessing the impact of the construction of a high-speed railway line on the distribution of several virtual species in Franche-Comté (France). The study shows the capacity of the SDA to characterize the impact of a linear infrastructure either as a research concern or as a spatial planning challenge. SDAs could be helpful in deciding among several scenarios for linear infrastructure routes or for the location of mitigation measures. -- Highlights: • Graph connectivity metrics were integrated into a species distribution model. • SDM was performed before and after the implementation of linear infrastructure. • The local variation of presence provides spatial indicators of the impact.

  12. AN INTEGRATED RANSAC AND GRAPH BASED MISMATCH ELIMINATION APPROACH FOR WIDE-BASELINE IMAGE MATCHING

    Directory of Open Access Journals (Sweden)

    M. Hasheminasab

    2015-12-01

    Full Text Available In this paper we propose an integrated approach in order to increase the precision of feature point matching. Many different algorithms have been developed as to optimizing the short-baseline image matching while because of illumination differences and viewpoints changes, wide-baseline image matching is so difficult to handle. Fortunately, the recent developments in the automatic extraction of local invariant features make wide-baseline image matching possible. The matching algorithms which are based on local feature similarity principle, using feature descriptor as to establish correspondence between feature point sets. To date, the most remarkable descriptor is the scale-invariant feature transform (SIFT descriptor , which is invariant to image rotation and scale, and it remains robust across a substantial range of affine distortion, presence of noise, and changes in illumination. The epipolar constraint based on RANSAC (random sample consensus method is a conventional model for mismatch elimination, particularly in computer vision. Because only the distance from the epipolar line is considered, there are a few false matches in the selected matching results based on epipolar geometry and RANSAC. Aguilariu et al. proposed Graph Transformation Matching (GTM algorithm to remove outliers which has some difficulties when the mismatched points surrounded by the same local neighbor structure. In this study to overcome these limitations, which mentioned above, a new three step matching scheme is presented where the SIFT algorithm is used to obtain initial corresponding point sets. In the second step, in order to reduce the outliers, RANSAC algorithm is applied. Finally, to remove the remained mismatches, based on the adjacent K-NN graph, the GTM is implemented. Four different close range image datasets with changes in viewpoint are utilized to evaluate the performance of the proposed method and the experimental results indicate its robustness and

  13. Designing a graph-based approach to landscape ecological assessment of linear infrastructures

    International Nuclear Information System (INIS)

    Girardet, Xavier; Foltête, Jean-Christophe; Clauzel, Céline

    2013-01-01

    The development of major linear infrastructures contributes to landscape fragmentation and impacts natural habitats and biodiversity in various ways. To anticipate and minimize such impacts, landscape planning needs to be capable of effective strategic environmental assessment (SEA) and of supporting environmental impact assessment (EIA) decisions. To this end, species distribution models (SDMs) are an effective way of making predictive maps of the presence of a given species. In this paper, we propose to combine SDMs and graph-based representation of landscape networks to integrate the potential long-distance effect of infrastructures on species distribution. A diachronic approach, comparing distribution before and after the linear infrastructure is constructed, leads to the design of a species distribution assessment (SDA), taking into account population isolation. The SDA makes it possible (1) to estimate the local variation in probability of presence and (2) to characterize the impact of the infrastructure in terms of global variation in presence and of distance of disturbance. The method is illustrated by assessing the impact of the construction of a high-speed railway line on the distribution of several virtual species in Franche-Comté (France). The study shows the capacity of the SDA to characterize the impact of a linear infrastructure either as a research concern or as a spatial planning challenge. SDAs could be helpful in deciding among several scenarios for linear infrastructure routes or for the location of mitigation measures. -- Highlights: • Graph connectivity metrics were integrated into a species distribution model. • SDM was performed before and after the implementation of linear infrastructure. • The local variation of presence provides spatial indicators of the impact

  14. Graphs & digraphs

    CERN Document Server

    Chartrand, Gary; Zhang, Ping

    2010-01-01

    Gary Chartrand has influenced the world of Graph Theory for almost half a century. He has supervised more than a score of Ph.D. dissertations and written several books on the subject. The most widely known of these texts, Graphs and Digraphs, … has much to recommend it, with clear exposition, and numerous challenging examples [that] make it an ideal textbook for the advanced undergraduate or beginning graduate course. The authors have updated their notation to reflect the current practice in this still-growing area of study. By the authors' estimation, the 5th edition is approximately 50% longer than the 4th edition. … the legendary Frank Harary, author of the second graph theory text ever produced, is one of the figures profiled. His book was the standard in the discipline for several decades. Chartrand, Lesniak and Zhang have produced a worthy successor.-John T. Saccoman, MAA Reviews, June 2012 (This book is in the MAA's basic library list.)As with the earlier editions, the current text emphasizes clear...

  15. Expert and Novice Approaches to Using Graphs: Evidence from Eye-Track Experiments

    Science.gov (United States)

    Wirth, K. R.; Lindgren, J. M.

    2015-12-01

    Professionals and students in geology use an array of graphs to study the earth, but relatively little detail is known about how users interact with these graphs. Comprehension of graphical information in the earth sciences is further complicated by the common use of non-traditional formats (e.g., inverted axes, logarithmic scales, normalized plots, ternary diagrams). Many educators consider graph-reading skills an important outcome of general education science curricula, so it is critical that we understand both the development of graph-reading skills and the instructional practices that are most efficacious. Eye-tracking instruments provide quantitative information about eye movements and offer important insights into the development of expertise in graph use. We measured the graph reading skills and eye movements of novices (students with a variety of majors and educational attainment) and experts (faculty and staff from a variety of disciplines) while observing traditional and non-traditional graph formats. Individuals in the expert group consistently demonstrated significantly greater accuracy in responding to questions (e.g., retrieval, interpretation, prediction) about graphs. Among novices, only the number of college math and science courses correlated with response accuracy. Interestingly, novices and experts exhibited similar eye-tracks when they first encountered a new graph; they typically scanned through the title, x and y-axes, and data regions in the first 5-15 seconds. However, experts are readily distinguished from novices by a greater number of eye movements (20-35%) between the data and other graph elements (e.g., title, x-axis, y-axis) both during and after the initial orientation phase. We attribute the greater eye movements between the different graph elements an outcome of the generally better-developed self-regulation skills (goal-setting, monitoring, self-evaluation) that likely characterize individuals in our expert group.

  16. Similarity Measure of Graphs

    Directory of Open Access Journals (Sweden)

    Amine Labriji

    2017-07-01

    Full Text Available The topic of identifying the similarity of graphs was considered as highly recommended research field in the Web semantic, artificial intelligence, the shape recognition and information research. One of the fundamental problems of graph databases is finding similar graphs to a graph query. Existing approaches dealing with this problem are usually based on the nodes and arcs of the two graphs, regardless of parental semantic links. For instance, a common connection is not identified as being part of the similarity of two graphs in cases like two graphs without common concepts, the measure of similarity based on the union of two graphs, or the one based on the notion of maximum common sub-graph (SCM, or the distance of edition of graphs. This leads to an inadequate situation in the context of information research. To overcome this problem, we suggest a new measure of similarity between graphs, based on the similarity measure of Wu and Palmer. We have shown that this new measure satisfies the properties of a measure of similarities and we applied this new measure on examples. The results show that our measure provides a run time with a gain of time compared to existing approaches. In addition, we compared the relevance of the similarity values obtained, it appears that this new graphs measure is advantageous and  offers a contribution to solving the problem mentioned above.

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

    Science.gov (United States)

    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

  18. Graph Aggregation

    NARCIS (Netherlands)

    Endriss, U.; Grandi, U.

    Graph aggregation is the process of computing a single output graph that constitutes a good compromise between several input graphs, each provided by a different source. One needs to perform graph aggregation in a wide variety of situations, e.g., when applying a voting rule (graphs as preference

  19. Matching theory

    CERN Document Server

    Plummer, MD

    1986-01-01

    This study of matching theory deals with bipartite matching, network flows, and presents fundamental results for the non-bipartite case. It goes on to study elementary bipartite graphs and elementary graphs in general. Further discussed are 2-matchings, general matching problems as linear programs, the Edmonds Matching Algorithm (and other algorithmic approaches), f-factors and vertex packing.

  20. A new paradigm for particle tracking velocimetry, based on graph-theory and pulsed neural network

    International Nuclear Information System (INIS)

    Derou, D.; Herault, L.

    1994-01-01

    The Particle Tracking Velocimetry (PTV) technique works by recording, at different instances in time, positions of small tracers particles following a flow and illuminated by a sheet, or pseudo sheet, of light. It aims to recognize each particle trajectory, constituted of n different spots and determine thus each particle velocity vector. In this paper, we devise a new method, taking into account a global consistency of the trajectories to be extracted, in terms of visual perception and physical properties. It is based on a graph-theoretic formulation of the particle tracking problem and the use of an original neural network, called pulsed neural network. (authors). 4 figs

  1. The prediction of candidate genes for cervix related cancer through gene ontology and graph theoretical approach.

    Science.gov (United States)

    Hindumathi, V; Kranthi, T; Rao, S B; Manimaran, P

    2014-06-01

    With rapidly changing technology, prediction of candidate genes has become an indispensable task in recent years mainly in the field of biological research. The empirical methods for candidate gene prioritization that succors to explore the potential pathway between genetic determinants and complex diseases are highly cumbersome and labor intensive. In such a scenario predicting potential targets for a disease state through in silico approaches are of researcher's interest. The prodigious availability of protein interaction data coupled with gene annotation renders an ease in the accurate determination of disease specific candidate genes. In our work we have prioritized the cervix related cancer candidate genes by employing Csaba Ortutay and his co-workers approach of identifying the candidate genes through graph theoretical centrality measures and gene ontology. With the advantage of the human protein interaction data, cervical cancer gene sets and the ontological terms, we were able to predict 15 novel candidates for cervical carcinogenesis. The disease relevance of the anticipated candidate genes was corroborated through a literature survey. Also the presence of the drugs for these candidates was detected through Therapeutic Target Database (TTD) and DrugMap Central (DMC) which affirms that they may be endowed as potential drug targets for cervical cancer.

  2. On the degree distribution of horizontal visibility graphs associated with Markov processes and dynamical systems: diagrammatic and variational approaches

    International Nuclear Information System (INIS)

    Lacasa, Lucas

    2014-01-01

    Dynamical processes can be transformed into graphs through a family of mappings called visibility algorithms, enabling the possibility of (i) making empirical time series analysis and signal processing and (ii) characterizing classes of dynamical systems and stochastic processes using the tools of graph theory. Recent works show that the degree distribution of these graphs encapsulates much information on the signals' variability, and therefore constitutes a fundamental feature for statistical learning purposes. However, exact solutions for the degree distributions are only known in a few cases, such as for uncorrelated random processes. Here we analytically explore these distributions in a list of situations. We present a diagrammatic formalism which computes for all degrees their corresponding probability as a series expansion in a coupling constant which is the number of hidden variables. We offer a constructive solution for general Markovian stochastic processes and deterministic maps. As case tests we focus on Ornstein–Uhlenbeck processes, fully chaotic and quasiperiodic maps. Whereas only for certain degree probabilities can all diagrams be summed exactly, in the general case we show that the perturbation theory converges. In a second part, we make use of a variational technique to predict the complete degree distribution for special classes of Markovian dynamics with fast-decaying correlations. In every case we compare the theory with numerical experiments. (paper)

  3. Uniform Single Valued Neutrosophic Graphs

    Directory of Open Access Journals (Sweden)

    S. Broumi

    2017-09-01

    Full Text Available In this paper, we propose a new concept named the uniform single valued neutrosophic graph. An illustrative example and some properties are examined. Next, we develop an algorithmic approach for computing the complement of the single valued neutrosophic graph. A numerical example is demonstrated for computing the complement of single valued neutrosophic graphs and uniform single valued neutrosophic graph.

  4. ON BIPOLAR SINGLE VALUED NEUTROSOPHIC GRAPHS

    OpenAIRE

    Said Broumi; Mohamed Talea; Assia Bakali; Florentin Smarandache

    2016-01-01

    In this article, we combine the concept of bipolar neutrosophic set and graph theory. We introduce the notions of bipolar single valued neutrosophic graphs, strong bipolar single valued neutrosophic graphs, complete bipolar single valued neutrosophic graphs, regular bipolar single valued neutrosophic graphs and investigate some of their related properties.

  5. Automatic Assignment of Methyl-NMR Spectra of Supramolecular Machines Using Graph Theory.

    Science.gov (United States)

    Pritišanac, Iva; Degiacomi, Matteo T; Alderson, T Reid; Carneiro, Marta G; Ab, Eiso; Siegal, Gregg; Baldwin, Andrew J

    2017-07-19

    Methyl groups are powerful probes for the analysis of structure, dynamics and function of supramolecular assemblies, using both solution- and solid-state NMR. Widespread application of the methodology has been limited due to the challenges associated with assigning spectral resonances to specific locations within a biomolecule. Here, we present Methyl Assignment by Graph Matching (MAGMA), for the automatic assignment of methyl resonances. A graph matching protocol examines all possibilities for each resonance in order to determine an exact assignment that includes a complete description of any ambiguity. MAGMA gives 100% accuracy in confident assignments when tested against both synthetic data, and 9 cross-validated examples using both solution- and solid-state NMR data. We show that this remarkable accuracy enables a user to distinguish between alternative protein structures. In a drug discovery application on HSP90, we show the method can rapidly and efficiently distinguish between possible ligand binding modes. By providing an exact and robust solution to methyl resonance assignment, MAGMA can facilitate significantly accelerated studies of supramolecular machines using methyl-based NMR spectroscopy.

  6. Exploratory graph analysis: A new approach for estimating the number of dimensions in psychological research.

    Science.gov (United States)

    Golino, Hudson F; Epskamp, Sacha

    2017-01-01

    The estimation of the correct number of dimensions is a long-standing problem in psychometrics. Several methods have been proposed, such as parallel analysis (PA), Kaiser-Guttman's eigenvalue-greater-than-one rule, multiple average partial procedure (MAP), the maximum-likelihood approaches that use fit indexes as BIC and EBIC and the less used and studied approach called very simple structure (VSS). In the present paper a new approach to estimate the number of dimensions will be introduced and compared via simulation to the traditional techniques pointed above. The approach proposed in the current paper is called exploratory graph analysis (EGA), since it is based on the graphical lasso with the regularization parameter specified using EBIC. The number of dimensions is verified using the walktrap, a random walk algorithm used to identify communities in networks. In total, 32,000 data sets were simulated to fit known factor structures, with the data sets varying across different criteria: number of factors (2 and 4), number of items (5 and 10), sample size (100, 500, 1000 and 5000) and correlation between factors (orthogonal, .20, .50 and .70), resulting in 64 different conditions. For each condition, 500 data sets were simulated using lavaan. The result shows that the EGA performs comparable to parallel analysis, EBIC, eBIC and to Kaiser-Guttman rule in a number of situations, especially when the number of factors was two. However, EGA was the only technique able to correctly estimate the number of dimensions in the four-factor structure when the correlation between factors were .7, showing an accuracy of 100% for a sample size of 5,000 observations. Finally, the EGA was used to estimate the number of factors in a real dataset, in order to compare its performance with the other six techniques tested in the simulation study.

  7. Equilibrium theory : A salient approach

    NARCIS (Netherlands)

    Schalk, S.

    1999-01-01

    Whereas the neoclassical models in General Equilibrium Theory focus on the existence of separate commodities, this thesis regards 'bundles of trade' as the unit objects of exchange. Apart from commodities and commodity bundles in the neoclassical sense, the term `bundle of trade' includes, for

  8. A quantum annealing approach for fault detection and diagnosis of graph-based systems

    Science.gov (United States)

    Perdomo-Ortiz, A.; Fluegemann, J.; Narasimhan, S.; Biswas, R.; Smelyanskiy, V. N.

    2015-02-01

    Diagnosing the minimal set of faults capable of explaining a set of given observations, e.g., from sensor readouts, is a hard combinatorial optimization problem usually tackled with artificial intelligence techniques. We present the mapping of this combinatorial problem to quadratic unconstrained binary optimization (QUBO), and the experimental results of instances embedded onto a quantum annealing device with 509 quantum bits. Besides being the first time a quantum approach has been proposed for problems in the advanced diagnostics community, to the best of our knowledge this work is also the first research utilizing the route Problem → QUBO → Direct embedding into quantum hardware, where we are able to implement and tackle problem instances with sizes that go beyond previously reported toy-model proof-of-principle quantum annealing implementations; this is a significant leap in the solution of problems via direct-embedding adiabatic quantum optimization. We discuss some of the programmability challenges in the current generation of the quantum device as well as a few possible ways to extend this work to more complex arbitrary network graphs.

  9. The cavity approach to parallel dynamics of Ising spins on a graph

    International Nuclear Information System (INIS)

    Neri, I; Bollé, D

    2009-01-01

    We use the cavity method to study the parallel dynamics of disordered Ising models on a graph. In particular, we derive a set of recursive equations in single-site probabilities of paths propagating along the edges of the graph. These equations are analogous to the cavity equations for equilibrium models and are exact on a tree. On graphs with exclusively directed edges we find an exact expression for the stationary distribution. We present the phase diagrams for an Ising model on an asymmetric Bethe lattice and for a neural network with Hebbian interactions on an asymmetric scale-free graph. For graphs with a nonzero fraction of symmetric edges the equations can be solved for a finite number of time steps. Theoretical predictions are confirmed by simulations. Using a heuristic method the cavity equations are extended to a set of equations that determine the marginals of the stationary distribution of Ising models on graphs with a nonzero fraction of symmetric edges. The results from this method are discussed and compared with simulations

  10. Models construction for acetone-butanol-ethanol fermentations with acetate/butyrate consecutively feeding by graph theory.

    Science.gov (United States)

    Li, Zhigang; Shi, Zhongping; Li, Xin

    2014-05-01

    Several fermentations with consecutively feeding of acetate/butyrate were conducted in a 7 L fermentor and the results indicated that exogenous acetate/butyrate enhanced solvents productivities by 47.1% and 39.2% respectively, and changed butyrate/acetate ratios greatly. Then extracellular butyrate/acetate ratios were utilized for calculation of acids rates and the results revealed that acetate and butyrate formation pathways were almost blocked by corresponding acids feeding. In addition, models for acetate/butyrate feeding fermentations were constructed by graph theory based on calculation results and relevant reports. Solvents concentrations and butanol/acetone ratios of these fermentations were also calculated and the results of models calculation matched fermentation data accurately which demonstrated that models were constructed in a reasonable way. Copyright © 2014 Elsevier Ltd. All rights reserved.

  11. Decision Making in Manufacturing Environment Using Graph Theory and Fuzzy Multiple Attribute Decision Making Methods Volume 2

    CERN Document Server

    Rao, R Venkata

    2013-01-01

    Decision Making in Manufacturing Environment Using Graph Theory and Fuzzy Multiple Attribute Decision Making Methods presents the concepts and details of applications of MADM methods. A range of methods are covered including Analytic Hierarchy Process (AHP), Technique for Order Preference by Similarity to Ideal Solution (TOPSIS), VIšekriterijumsko KOmpromisno Rangiranje (VIKOR), Data Envelopment Analysis (DEA), Preference Ranking METHod for Enrichment Evaluations (PROMETHEE), ELimination Et Choix Traduisant la Realité (ELECTRE), COmplex PRoportional ASsessment (COPRAS), Grey Relational Analysis (GRA), UTility Additive (UTA), and Ordered Weighted Averaging (OWA). The existing MADM methods are improved upon and three novel multiple attribute decision making methods for solving the decision making problems of the manufacturing environment are proposed. The concept of integrated weights is introduced in the proposed subjective and objective integrated weights (SOIW) method and the weighted Euclidean distance ba...

  12. A philosophical approach to quantum field theory

    CERN Document Server

    Öttinger, Hans Christian

    2015-01-01

    This text presents an intuitive and robust mathematical image of fundamental particle physics based on a novel approach to quantum field theory, which is guided by four carefully motivated metaphysical postulates. In particular, the book explores a dissipative approach to quantum field theory, which is illustrated for scalar field theory and quantum electrodynamics, and proposes an attractive explanation of the Planck scale in quantum gravity. Offering a radically new perspective on this topic, the book focuses on the conceptual foundations of quantum field theory and ontological questions. It also suggests a new stochastic simulation technique in quantum field theory which is complementary to existing ones. Encouraging rigor in a field containing many mathematical subtleties and pitfalls this text is a helpful companion for students of physics and philosophers interested in quantum field theory, and it allows readers to gain an intuitive rather than a formal understanding.

  13. A graph signal filtering-based approach for detection of different edge types on airborne lidar data

    Science.gov (United States)

    Bayram, Eda; Vural, Elif; Alatan, Aydin

    2017-10-01

    Airborne Laser Scanning is a well-known remote sensing technology, which provides a dense and highly accurate, yet unorganized point cloud of earth surface. During the last decade, extracting information from the data generated by airborne LiDAR systems has been addressed by many studies in geo-spatial analysis and urban monitoring applications. However, the processing of LiDAR point clouds is challenging due to their irregular structure and 3D geometry. In this study, we propose a novel framework for the detection of the boundaries of an object or scene captured by LiDAR. Our approach is motivated by edge detection techniques in vision research and it is established on graph signal filtering which is an exciting and promising field of signal processing for irregular data types. Due to the convenient applicability of graph signal processing tools on unstructured point clouds, we achieve the detection of the edge points directly on 3D data by using a graph representation that is constructed exclusively to answer the requirements of the application. Moreover, considering the elevation data as the (graph) signal, we leverage aerial characteristic of the airborne LiDAR data. The proposed method can be employed both for discovering the jump edges on a segmentation problem and for exploring the crease edges on a LiDAR object on a reconstruction/modeling problem, by only adjusting the filter characteristics.

  14. International Space Station Centrifuge Rotor Models A Comparison of the Euler-Lagrange and the Bond Graph Modeling Approach

    Science.gov (United States)

    Nguyen, Louis H.; Ramakrishnan, Jayant; Granda, Jose J.

    2006-01-01

    The assembly and operation of the International Space Station (ISS) require extensive testing and engineering analysis to verify that the Space Station system of systems would work together without any adverse interactions. Since the dynamic behavior of an entire Space Station cannot be tested on earth, math models of the Space Station structures and mechanical systems have to be built and integrated in computer simulations and analysis tools to analyze and predict what will happen in space. The ISS Centrifuge Rotor (CR) is one of many mechanical systems that need to be modeled and analyzed to verify the ISS integrated system performance on-orbit. This study investigates using Bond Graph modeling techniques as quick and simplified ways to generate models of the ISS Centrifuge Rotor. This paper outlines the steps used to generate simple and more complex models of the CR using Bond Graph Computer Aided Modeling Program with Graphical Input (CAMP-G). Comparisons of the Bond Graph CR models with those derived from Euler-Lagrange equations in MATLAB and those developed using multibody dynamic simulation at the National Aeronautics and Space Administration (NASA) Johnson Space Center (JSC) are presented to demonstrate the usefulness of the Bond Graph modeling approach for aeronautics and space applications.

  15. Graph Transforming Java Data

    NARCIS (Netherlands)

    de Mol, M.J.; Rensink, Arend; Hunt, James J.

    This paper introduces an approach for adding graph transformation-based functionality to existing JAVA programs. The approach relies on a set of annotations to identify the intended graph structure, as well as on user methods to manipulate that structure, within the user’s own JAVA class

  16. Interpreting quantum theory a therapeutic approach

    CERN Document Server

    Friederich, S

    2014-01-01

    Is it possible to approach quantum theory in a 'therapeutic' vein that sees its foundational problems as arising from mistaken conceptual presuppositions? The book explores the prospects for this project and, in doing so, discusses such fascinating issues as the nature of quantum states, explanation in quantum theory, and 'quantum non-locality'.

  17. RNA graph partitioning for the discovery of RNA modularity: a novel application of graph partition algorithm to biology.

    Directory of Open Access Journals (Sweden)

    Namhee Kim

    Full Text Available Graph representations have been widely used to analyze and design various economic, social, military, political, and biological networks. In systems biology, networks of cells and organs are useful for understanding disease and medical treatments and, in structural biology, structures of molecules can be described, including RNA structures. In our RNA-As-Graphs (RAG framework, we represent RNA structures as tree graphs by translating unpaired regions into vertices and helices into edges. Here we explore the modularity of RNA structures by applying graph partitioning known in graph theory to divide an RNA graph into subgraphs. To our knowledge, this is the first application of graph partitioning to biology, and the results suggest a systematic approach for modular design in general. The graph partitioning algorithms utilize mathematical properties of the Laplacian eigenvector (µ2 corresponding to the second eigenvalues (λ2 associated with the topology matrix defining the graph: λ2 describes the overall topology, and the sum of µ2's components is zero. The three types of algorithms, termed median, sign, and gap cuts, divide a graph by determining nodes of cut by median, zero, and largest gap of µ2's components, respectively. We apply these algorithms to 45 graphs corresponding to all solved RNA structures up through 11 vertices (∼ 220 nucleotides. While we observe that the median cut divides a graph into two similar-sized subgraphs, the sign and gap cuts partition a graph into two topologically-distinct subgraphs. We find that the gap cut produces the best biologically-relevant partitioning for RNA because it divides RNAs at less stable connections while maintaining junctions intact. The iterative gap cuts suggest basic modules and assembly protocols to design large RNA structures. Our graph substructuring thus suggests a systematic approach to explore the modularity of biological networks. In our applications to RNA structures, subgraphs

  18. A comparison of approaches for finding minimum identifying codes on graphs

    Science.gov (United States)

    Horan, Victoria; Adachi, Steve; Bak, Stanley

    2016-05-01

    In order to formulate mathematical conjectures likely to be true, a number of base cases must be determined. However, many combinatorial problems are NP-hard and the computational complexity makes this research approach difficult using a standard brute force approach on a typical computer. One sample problem explored is that of finding a minimum identifying code. To work around the computational issues, a variety of methods are explored and consist of a parallel computing approach using MATLAB, an adiabatic quantum optimization approach using a D-Wave quantum annealing processor, and lastly using satisfiability modulo theory (SMT) and corresponding SMT solvers. Each of these methods requires the problem to be formulated in a unique manner. In this paper, we address the challenges of computing solutions to this NP-hard problem with respect to each of these methods.

  19. An Analysis of the Influence of Graph Theory When Preparing for Programming Contests

    Directory of Open Access Journals (Sweden)

    Cristina Jordán

    2017-01-01

    Full Text Available The subject known as Programming Contests in the Bachelor’s Degree in Computer Engineering course focuses on solving programming problems frequently met within contests such as the Southwest Europe Regional Contest (SWERC. In order to solve these problems one first needs to model the problem correctly, find the ideal solution, and then be able to program it without making any mistakes in a very short period of time. Leading multinationals such as Google, Apple, IBM, Facebook and Microsoft place a very high value on these abilities when selecting candidates for posts in their companies. In this communication we present some preliminary results of an analysis of the interaction between two optional subjects in the Computer Science Degree course: Programming Contests (PC and Graphs, Models and Applications (GMA. The results of this analysis enabled us to make changes to some of the contents in GMA in order to better prepare the students to deal with the challenges they have to face in programming contests.

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

    Directory of Open Access Journals (Sweden)

    T. K. Das

    2014-01-01

    Full Text Available 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.

  1. Renormalization in quantum field theory and the Riemann-Hilbert problem. I. Hopf algebra structure of graphs and the main theorem

    International Nuclear Information System (INIS)

    Connes, A.; Kreimer, D.

    2000-01-01

    This paper gives a complete selfcontained proof of our result (1999) 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 H which is commutative asan algebra. It is the dual Hopf algebra of the enveloping algebra of a Lie algebra G 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 H. We show then that, using dimensional regularization, the bare (unrenormalized) theory gives rise to a loop γ(z) element of G, z element of C, 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. (orig.)

  2. Generalized connectivity of graphs

    CERN Document Server

    Li, Xueliang

    2016-01-01

    Noteworthy results, proof techniques, open problems and conjectures in generalized (edge-) connectivity are discussed in this book. Both theoretical and practical analyses for generalized (edge-) connectivity of graphs are provided. Topics covered in this book include: generalized (edge-) connectivity of graph classes, algorithms, computational complexity, sharp bounds, Nordhaus-Gaddum-type results, maximum generalized local connectivity, extremal problems, random graphs, multigraphs, relations with the Steiner tree packing problem and generalizations of connectivity. This book enables graduate students to understand and master a segment of graph theory and combinatorial optimization. Researchers in graph theory, combinatorics, combinatorial optimization, probability, computer science, discrete algorithms, complexity analysis, network design, and the information transferring models will find this book useful in their studies.

  3. New perturbative approach to renormalizable field theories

    International Nuclear Information System (INIS)

    Dhar, A.; Gupta, V.

    1984-01-01

    A new method for obtaining perturbative predictions in quantum field theory is developed. Our method gives finite predictions, which are free from scheme ambiguities, for any quantity of interest (like a cross section or a Green's function) starting directly from the bare regularized Lagrangian. The central idea in our approach is to incorporate directly the consequences of dimensional transmutation for the predictions of the theory. We thus completely bypass the conventional renormalization procedure and the ambiguities associated with it. The case of massless theories with a single dimensionless coupling constant is treated in detail to illustrate our approach

  4. Variational approach in transport theory

    International Nuclear Information System (INIS)

    Panta Pazos, R.; Tullio de Vilhena, M.

    2004-01-01

    In this work we present a variational approach to some methods to solve transport problems of neutral particles. We consider a convex domain X (for example the geometry of a slab, or a convex set in the plane, or a convex bounded set in the space) and we use discrete ordinates quadrature to get a system of differential equations derived from the neutron transport equation. The boundary conditions are vacuum for a subset of the boundary, and of specular reflection for the complementary subset of the boundary. Recently some different approximation methods have been presented to solve these transport problems. We introduce in this work the adjoint equations and the conjugate functions obtained by means of the variational approach. First we consider the general formulation, and then some numerical methods such as spherical harmonics and spectral collocation method. (authors)

  5. Variational approach in transport theory

    Energy Technology Data Exchange (ETDEWEB)

    Panta Pazos, R. [Nucler Engineering Department, UFRGS, Porto-Alegre (Brazil); Tullio de Vilhena, M. [Institute of Mathematics, UFRGS, Porto-Alegre (Brazil)

    2004-07-01

    In this work we present a variational approach to some methods to solve transport problems of neutral particles. We consider a convex domain X (for example the geometry of a slab, or a convex set in the plane, or a convex bounded set in the space) and we use discrete ordinates quadrature to get a system of differential equations derived from the neutron transport equation. The boundary conditions are vacuum for a subset of the boundary, and of specular reflection for the complementary subset of the boundary. Recently some different approximation methods have been presented to solve these transport problems. We introduce in this work the adjoint equations and the conjugate functions obtained by means of the variational approach. First we consider the general formulation, and then some numerical methods such as spherical harmonics and spectral collocation method. (authors)

  6. Product shipping information using graceful labeling on undirected tree graph approach

    Science.gov (United States)

    Kuan, Yoong Kooi; Ghani, Ahmad Termimi Ab

    2017-08-01

    Product shipping information is the related information of an ordered product that ready to be shipped to the foreign customer's company, where the information represents as an irrefutable proof in black and white to the local manufacturer by E-mails. This messy and unordered list of information is stored in E-mail folders by the people incharge, which do not function in collating the information properly. So, in this paper, an algorithm is proposed on how to rearrange the messy information from the sequence of a path graph structure into a concise version of a caterpillar graph with achieving the concept of graceful labeling. The final graceful caterpillar graph consists of the full listed information together with the numbering, which able to assist people get the information fleetly for shipping arrangement procedure.

  7. Group theory approach to scattering

    International Nuclear Information System (INIS)

    Wu, J.

    1985-01-01

    For certain physical systems, there exists a dynamical group which contains the operators connecting states with the same energy but belonging to potentials with different strengths. This group is called the potential group of that system. The SO(2,1) potential groups structure is introduced to describe physical systems with mixed spectra, such as Morse and Poeschl-teller potentials. The discrete spectrum describes bound states and the continuous spectrum describes bound states and the continuous spectrum describes scattering states. A solvable class of one-dimensional potentials given by Natanzon belongs to this structure with an SO(2,2) potential group. The potential group structure provides us with an algebraic procedure generating the recursion relations for the scattering matrix, which can be formulated in a purely algebraic fashion, divorced from any differential realization. This procedure, when applied to the three-dimensional scattering problem with SO(3,1) symmetry, generates the scattering matrix of the Coulomb problem. Preliminary phenomenological models for elastic scattering in a heavy-ion collision are constructed on the basis. The results obtained here can be regarded as an important extension of the group theory techniques to scattering problems similar to that developed for bound state problems

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

    Science.gov (United States)

    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.

  9. Altered brain network in Amyotrophic Lateral Sclerosis: a resting graph theory-based network study at voxel-wise level

    Directory of Open Access Journals (Sweden)

    Chaoyang eZhou

    2016-05-01

    Full Text Available 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.

  10. Graphing trillions of triangles.

    Science.gov (United States)

    Burkhardt, Paul

    2017-07-01

    The increasing size of Big Data is often heralded but how data are transformed and represented is also profoundly important to knowledge discovery, and this is exemplified in Big Graph analytics. Much attention has been placed on the scale of the input graph but the product of a graph algorithm can be many times larger than the input. This is true for many graph problems, such as listing all triangles in a graph. Enabling scalable graph exploration for Big Graphs requires new approaches to algorithms, architectures, and visual analytics. A brief tutorial is given to aid the argument for thoughtful representation of data in the context of graph analysis. Then a new algebraic method to reduce the arithmetic operations in counting and listing triangles in graphs is introduced. Additionally, a scalable triangle listing algorithm in the MapReduce model will be presented followed by a description of the experiments with that algorithm that led to the current largest and fastest triangle listing benchmarks to date. Finally, a method for identifying triangles in new visual graph exploration technologies is proposed.

  11. Pattern graph rewrite systems

    Directory of Open Access Journals (Sweden)

    Aleks Kissinger

    2014-03-01

    Full Text Available String diagrams are a powerful tool for reasoning about physical processes, logic circuits, tensor networks, and many other compositional structures. Dixon, Duncan and Kissinger introduced string graphs, which are a combinatoric representations of string diagrams, amenable to automated reasoning about diagrammatic theories via graph rewrite systems. In this extended abstract, we show how the power of such rewrite systems can be greatly extended by introducing pattern graphs, which provide a means of expressing infinite families of rewrite rules where certain marked subgraphs, called !-boxes ("bang boxes", on both sides of a rule can be copied any number of times or removed. After reviewing the string graph formalism, we show how string graphs can be extended to pattern graphs and how pattern graphs and pattern rewrite rules can be instantiated to concrete string graphs and rewrite rules. We then provide examples demonstrating the expressive power of pattern graphs and how they can be applied to study interacting algebraic structures that are central to categorical quantum mechanics.

  12. Systems Theory and Systems Approach to Leadership

    Directory of Open Access Journals (Sweden)

    Dr.Sc. Berim Ramosaj

    2014-06-01

    Full Text Available Systems theory is product of the efforts of many researchers to create an intermediate field of coexistence of all sciences. If not for anything else, because of the magnitude that the use of systemic thinking and systemic approach has taken, it has become undisputed among the theories. Systems theory not only provides a glossary of terms with which researchers from different fields can be understood, but provides a framework for the presentation and interpretation of phenomena and realities. This paper addresses a systematic approach to leadership, as an attempt to dredge leadership and systems theory literature to find the meeting point. Systems approach is not an approach to leadership in terms of a manner of leader’s work, but it’s the leader's determination to factorize in his leadership the external environment and relationships with and among elements. Leader without followers is unable to exercise his leadership and to ensure their conviction he should provide a system, a structure, a purpose, despite the alternative chaos. Systems approach clarifies the thought on the complexity and dynamism of the environment and provides a framework for building ideas. If the general system theory is the skeleton of science (Boulding: 1956, this article aims to replenish it with leadership muscles by prominent authors who have written on systems theory and leadership, as well as through original ideas. In this work analytical methods were used (by analyzing approaches individually as well as synthetic methods (by assaying individual approaches in context of entirety. The work is a critical review of literature as well as a deductive analysis mingled with models proposed by authors through inductive analysis. Meta-analysis has been used to dissect the interaction and interdependence between leadership approaches.

  13. Mal-Netminer: Malware Classification Approach Based on Social Network Analysis of System Call Graph

    Directory of Open Access Journals (Sweden)

    Jae-wook Jang

    2015-01-01

    Full Text Available As the security landscape evolves over time, where thousands of species of malicious codes are seen every day, antivirus vendors strive to detect and classify malware families for efficient and effective responses against malware campaigns. To enrich this effort and by capitalizing on ideas from the social network analysis domain, we build a tool that can help classify malware families using features driven from the graph structure of their system calls. To achieve that, we first construct a system call graph that consists of system calls found in the execution of the individual malware families. To explore distinguishing features of various malware species, we study social network properties as applied to the call graph, including the degree distribution, degree centrality, average distance, clustering coefficient, network density, and component ratio. We utilize features driven from those properties to build a classifier for malware families. Our experimental results show that “influence-based” graph metrics such as the degree centrality are effective for classifying malware, whereas the general structural metrics of malware are less effective for classifying malware. Our experiments demonstrate that the proposed system performs well in detecting and classifying malware families within each malware class with accuracy greater than 96%.

  14. Row—column visibility graph approach to two-dimensional landscapes

    International Nuclear Information System (INIS)

    Xiao Qin; Pan Xue; Li Xin-Li; Stephen Mutua; Yang Hui-Jie; Jiang Yan; Wang Jian-Yong; Zhang Qing-Jun

    2014-01-01

    A new concept, called the row—column visibility graph, is proposed to map two-dimensional landscapes to complex networks. A cluster coverage is introduced to describe the extensive property of node clusters on a Euclidean lattice. Graphs mapped from fractals generated with the probability redistribution model behave scale-free. They have pattern-induced hierarchical organizations and comparatively much more extensive structures. The scale-free exponent has a negative correlation with the Hurst exponent, however, there is no deterministic relation between them. Graphs for fractals generated with the midpoint displacement model are exponential networks. When the Hurst exponent is large enough (e.g., H > 0.5), the degree distribution decays much more slowly, the average coverage becomes significant large, and the initially hierarchical structure at H < 0.5 is destroyed completely. Hence, the row—column visibility graph can be used to detect the pattern-related new characteristics of two-dimensional landscapes. (interdisciplinary physics and related areas of science and technology)

  15. A Graph-Based Approach to Action Scheduling in a Parallel Database System

    NARCIS (Netherlands)

    Grefen, P.W.P.J.; Apers, Peter M.G.

    Parallel database machines are meant to obtain high performance in transaction processing, both in terms of response time adn throughput. To obtain high performance, a good scheduling of the execution of the various actions in transactions is crucial. This paper describes a graph-based technique for

  16. An approach for brain-controlled prostheses based on Scene Graph Steady-State Visual Evoked Potentials.

    Science.gov (United States)

    Li, Rui; Zhang, Xiaodong; Li, Hanzhe; Zhang, Liming; Lu, Zhufeng; Chen, Jiangcheng

    2018-08-01

    Brain control technology can restore communication between the brain and a prosthesis, and choosing a Brain-Computer Interface (BCI) paradigm to evoke electroencephalogram (EEG) signals is an essential step for developing this technology. In this paper, the Scene Graph paradigm used for controlling prostheses was proposed; this paradigm is based on Steady-State Visual Evoked Potentials (SSVEPs) regarding the Scene Graph of a subject's intention. A mathematic model was built to predict SSVEPs evoked by the proposed paradigm and a sinusoidal stimulation method was used to present the Scene Graph stimulus to elicit SSVEPs from subjects. Then, a 2-degree of freedom (2-DOF) brain-controlled prosthesis system was constructed to validate the performance of the Scene Graph-SSVEP (SG-SSVEP)-based BCI. The classification of SG-SSVEPs was detected via the Canonical Correlation Analysis (CCA) approach. To assess the efficiency of proposed BCI system, the performances of traditional SSVEP-BCI system were compared. Experimental results from six subjects suggested that the proposed system effectively enhanced the SSVEP responses, decreased the degradation of SSVEP strength and reduced the visual fatigue in comparison with the traditional SSVEP-BCI system. The average signal to noise ratio (SNR) of SG-SSVEP was 6.31 ± 2.64 dB, versus 3.38 ± 0.78 dB of traditional-SSVEP. In addition, the proposed system achieved good performances in prosthesis control. The average accuracy was 94.58% ± 7.05%, and the corresponding high information transfer rate (IRT) was 19.55 ± 3.07 bit/min. The experimental results revealed that the SG-SSVEP based BCI system achieves the good performance and improved the stability relative to the conventional approach. Copyright © 2018 Elsevier B.V. All rights reserved.

  17. Study of a class of photovoltaic systems using a bond graph approach. Modeling, analysis and control; Etude d'une classe de systemes photovoltaiques par une approche bond graph. Modelisation, analyse et commande

    Energy Technology Data Exchange (ETDEWEB)

    Andoulsi, R.

    2001-12-01

    We present in this thesis a study of a class of photovoltaic system by a bond graph approach. This study concerns the modelling, the analysis and the control of some configurations including PV generator, DC/DC converters and DC motor-pumps. The modelling of the different elements of a photovoltaic system is an indispensable stage that must precede all application of sizing, identification or simulation. However, theses PV systems are of hybrid type and their modelling is complex. It is why we use a unified modelling approach based on the bond graph technique. This methodology is completely systematic and has a sufficient flexibility for allowing the introduction of different components in the system. In the first chapter, we recall the principle of functioning of a photovoltaic generator and we treat mainly the MPPT (Maximum Power Point Tracking) working. In the second chapter, we elaborate bond graph models of various photovoltaic system configurations. For the PV source, we elaborate, in a first stage, a complete model taking into account the various physical phenomena influencing the quality of the PV source. In a second stage, we deduce a reduced bond graph model more easy to use for analysis and control purposes. For the DC/DC converters, we recall the bond graph modelling of switching elements and the average bond graph of the DC/DC converters developed in the literature. Thus, we deduce the bond graphs models of the various DC/DC converters to be used. The third chapter presents a dynamic study of some configurations stability in linear procedure. In the fourth chapter, we study the feasibility of non linear controllers by input/output linearization for some configurations of PV systems. In this study, we use the concept of inverse bond graph to determine, by a bond graph approach, the expression of the control input and the nature of the stability of the internal dynamics (dynamics of zeros). The fifth chapter is dedicated for the presentation of some

  18. Proxy Graph: Visual Quality Metrics of Big Graph Sampling.

    Science.gov (United States)

    Nguyen, Quan Hoang; Hong, Seok-Hee; Eades, Peter; Meidiana, Amyra

    2017-06-01

    Data sampling has been extensively studied for large scale graph mining. Many analyses and tasks become more efficient when performed on graph samples of much smaller size. The use of proxy objects is common in software engineering for analysis and interaction with heavy objects or systems. In this paper, we coin the term 'proxy graph' and empirically investigate how well a proxy graph visualization can represent a big graph. Our investigation focuses on proxy graphs obtained by sampling; this is one of the most common proxy approaches. Despite the plethora of data sampling studies, this is the first evaluation of sampling in the context of graph visualization. For an objective evaluation, we propose a new family of quality metrics for visual quality of proxy graphs. Our experiments cover popular sampling techniques. Our experimental results lead to guidelines for using sampling-based proxy graphs in visualization.

  19. The Activity Theory Approach to Learning

    Directory of Open Access Journals (Sweden)

    Ritva Engeström

    2014-12-01

    Full Text Available In this paper the author offers a practical view of the theory-grounded research on education action. She draws on studies carried out at the Center for Research on Activity, Development and Learning (CRADLE at the University of Helsinki in Finland. In its work, the Center draws on cultural-historical activity theory (CHAT and is well-known for the theory of Expansive Learning and its more practical application called Developmental Work Research (DWR. These approaches are widely used to understand professional learning and have served as a theoreticaland methodological foundation for studies examining change and professional development in various human activities.

  20. Introducing graph theory to track for neuroplastic alterations in the resting human brain: a transcranial direct current stimulation study.

    Science.gov (United States)

    Polanía, Rafael; Paulus, Walter; Antal, Andrea; Nitsche, Michael A

    2011-02-01

    Transcranial direct current stimulation (tDCS) is a non-invasive brain stimulation technique that alters cortical excitability and activity in a polarity-dependent way. Stimulation for a few minutes has been shown to induce plastic alterations of cortical excitability and to improve cognitive performance. These effects might be related to stimulation-induced alterations of functional cortical network connectivity. We aimed to investigate the impact of tDCS on cortical network function by functional connectivity and graph theoretical analysis of the BOLD fMRI spontaneous activity. fMRI resting-state datasets were acquired immediately before and after 10-min bipolar tDCS during rest, with the anode placed over the left primary motor cortex (M1) and the cathode over the contralateral frontopolar cortex. For each dataset, grey matter voxel-based synchronization matrices were calculated and thresholded to construct undirected graphs. Nodal connectivity degree and minimum path length maps were calculated and compared before and after tDCS. Nodal minimum path lengths significantly increased in the left somatomotor (SM1) cortex after anodal tDCS, which means that the number of direct functional connections from the left SM1 to topologically distant grey matter voxels significantly decreased. In contrast, functional coupling between premotor and superior parietal areas with the left SM1 significantly increased. Additionally, the nodal connectivity degree in the left posterior cingulate cortex (PCC) area as well as in the right dorsolateral prefrontal cortex (right DLPFC) significantly increased. In summary, we provide initial support that tDCS-induced neuroplastic alterations might be related to functional connectivity changes in the human brain. Additionally, we propose our approach as a powerful method to track for neuroplastic changes in the human brain. Copyright © 2010 Elsevier Inc. All rights reserved.

  1. Information fusion-based approach for studying influence on Twitter using belief theory.

    Science.gov (United States)

    Azaza, Lobna; Kirgizov, Sergey; Savonnet, Marinette; Leclercq, Éric; Gastineau, Nicolas; Faiz, Rim

    2016-01-01

    Influence in Twitter has become recently a hot research topic, since this micro-blogging service is widely used to share and disseminate information. Some users are more able than others to influence and persuade peers. Thus, studying most influential users leads to reach a large-scale information diffusion area, something very useful in marketing or political campaigns. In this study, we propose a new approach for multi-level influence assessment on multi-relational networks, such as Twitter . We define a social graph to model the relationships between users as a multiplex graph where users are represented by nodes, and links model the different relations between them (e.g., retweets , mentions , and replies ). We explore how relations between nodes in this graph could reveal about the influence degree and propose a generic computational model to assess influence degree of a certain node. This is based on the conjunctive combination rule from the belief functions theory to combine different types of relations. We experiment the proposed method on a large amount of data gathered from Twitter during the European Elections 2014 and deduce top influential candidates. The results show that our model is flexible enough to to consider multiple interactions combination according to social scientists needs or requirements and that the numerical results of the belief theory are accurate. We also evaluate the approach over the CLEF RepLab 2014 data set and show that our approach leads to quite interesting results.

  2. A robust approach towards unknown transformation, regional adjacency graphs, multigraph matching, segmentation video frames from unnamed aerial vehicles (UAV)

    Science.gov (United States)

    Gohatre, Umakant Bhaskar; Patil, Venkat P.

    2018-04-01

    In computer vision application, the multiple object detection and tracking, in real-time operation is one of the important research field, that have gained a lot of attentions, in last few years for finding non stationary entities in the field of image sequence. The detection of object is advance towards following the moving object in video and then representation of object is step to track. The multiple object recognition proof is one of the testing assignment from detection multiple objects from video sequence. The picture enrollment has been for quite some time utilized as a reason for the location the detection of moving multiple objects. The technique of registration to discover correspondence between back to back casing sets in view of picture appearance under inflexible and relative change. The picture enrollment is not appropriate to deal with event occasion that can be result in potential missed objects. In this paper, for address such problems, designs propose novel approach. The divided video outlines utilizing area adjancy diagram of visual appearance and geometric properties. Then it performed between graph sequences by using multi graph matching, then getting matching region labeling by a proposed graph coloring algorithms which assign foreground label to respective region. The plan design is robust to unknown transformation with significant improvement in overall existing work which is related to moving multiple objects detection in real time parameters.

  3. A coherent graph-based semantic clustering and summarization approach for biomedical literature and a new summarization evaluation method.

    Science.gov (United States)

    Yoo, Illhoi; Hu, Xiaohua; Song, Il-Yeol

    2007-11-27

    A huge amount of biomedical textual information has been produced and collected in MEDLINE for decades. In order to easily utilize biomedical information in the free text, document clustering and text summarization together are used as a solution for text information overload problem. In this paper, we introduce a coherent graph-based semantic clustering and summarization approach for biomedical literature. Our extensive experimental results show the approach shows 45% cluster quality improvement and 72% clustering reliability improvement, in terms of misclassification index, over Bisecting K-means as a leading document clustering approach. In addition, our approach provides concise but rich text summary in key concepts and sentences. Our coherent biomedical literature clustering and summarization approach that takes advantage of ontology-enriched graphical representations significantly improves the quality of document clusters and understandability of documents through summaries.

  4. Graph-based stochastic control with constraints: A unified approach with perfect and imperfect measurements

    KAUST Repository

    Agha-mohammadi, Ali-akbar

    2013-06-01

    This paper is concerned with the problem of stochastic optimal control (possibly with imperfect measurements) in the presence of constraints. We propose a computationally tractable framework to address this problem. The method lends itself to sampling-based methods where we construct a graph in the state space of the problem, on which a Dynamic Programming (DP) is solved and a closed-loop feedback policy is computed. The constraints are seamlessly incorporated to the control policy selection by including their effect on the transition probabilities of the graph edges. We present a unified framework that is applicable both in the state space (with perfect measurements) and in the information space (with imperfect measurements).

  5. Learning Based Approach for Optimal Clustering of Distributed Program's Call Flow Graph

    Science.gov (United States)

    Abofathi, Yousef; Zarei, Bager; Parsa, Saeed

    Optimal clustering of call flow graph for reaching maximum concurrency in execution of distributable components is one of the NP-Complete problems. Learning automatas (LAs) are search tools which are used for solving many NP-Complete problems. In this paper a learning based algorithm is proposed to optimal clustering of call flow graph and appropriate distributing of programs in network level. The algorithm uses learning feature of LAs to search in state space. It has been shown that the speed of reaching to solution increases remarkably using LA in search process, and it also prevents algorithm from being trapped in local minimums. Experimental results show the superiority of proposed algorithm over others.

  6. Using Graph and Vertex Entropy to Compare Empirical Graphs with Theoretical Graph Models

    Directory of Open Access Journals (Sweden)

    Tomasz Kajdanowicz

    2016-09-01

    Full Text Available Over the years, several theoretical graph generation models have been proposed. Among the most prominent are: the Erdős–Renyi random graph model, Watts–Strogatz small world model, Albert–Barabási preferential attachment model, Price citation model, and many more. Often, researchers working with real-world data are interested in understanding the generative phenomena underlying their empirical graphs. They want to know which of the theoretical graph generation models would most probably generate a particular empirical graph. In other words, they expect some similarity assessment between the empirical graph and graphs artificially created from theoretical graph generation models. Usually, in order to assess the similarity of two graphs, centrality measure distributions are compared. For a theoretical graph model this means comparing the empirical graph to a single realization of a theoretical graph model, where the realization is generated from the given model using an arbitrary set of parameters. The similarity between centrality measure distributions can be measured using standard statistical tests, e.g., the Kolmogorov–Smirnov test of distances between cumulative distributions. However, this approach is both error-prone and leads to incorrect conclusions, as we show in our experiments. Therefore, we propose a new method for graph comparison and type classification by comparing the entropies of centrality measure distributions (degree centrality, betweenness centrality, closeness centrality. We demonstrate that our approach can help assign the empirical graph to the most similar theoretical model using a simple unsupervised learning method.

  7. Construction of basic match schedules for sports competitions by using graph theory

    NARCIS (Netherlands)

    van Weert, Arjan; Schreuder, J.A.M.; Burke, Edmund; Carter, Michael

    1997-01-01

    Basic Match Schedules are important for constructing sports timetables. Firstly these schedules guarantee the fairness of the sports competitions and secondly they reduce the complexity of the problem. This paper presents an approach to the problem of finding Basic Match Schedules for sports

  8. Eulerian Graphs and Related Topics

    CERN Document Server

    Fleischner, Herbert

    1990-01-01

    The two volumes comprising Part 1 of this work embrace the theme of Eulerian trails and covering walks. They should appeal both to researchers and students, as they contain enough material for an undergraduate or graduate graph theory course which emphasizes Eulerian graphs, and thus can be read by any mathematician not yet familiar with graph theory. But they are also of interest to researchers in graph theory because they contain many recent results, some of which are only partial solutions to more general problems. A number of conjectures have been included as well. Various problems (such a

  9. Unified theory in the worldline approach

    Directory of Open Access Journals (Sweden)

    James P. Edwards

    2015-11-01

    Full Text Available We explore unified field theories based on the gauge groups SU(5 and SO(10 using the worldline approach for chiral fermions with a Wilson loop coupling to a background gauge field. Representing path ordering and chiral projection operators with functional integrals has previously reproduced the sum over the chiralities and representations of standard model particles in a compact way. This paper shows that for SU(5 the 5¯ and 10 representations – into which the Georgi–Glashow model places the left-handed fermionic content of the standard model – appear naturally and with the familiar chirality. We carry out the same analysis for flipped SU(5 and uncover a link to SO(10 unified theory. We pursue this by exploring the SO(10 theory in the same framework, the less established unified theory based on SU(6 and briefly consider the Pati–Salam model using SU(4×SU(2×SU(2.

  10. Effective field theory approach to nuclear matter

    International Nuclear Information System (INIS)

    Saviankou, P.; Gruemmer, F.; Epelbaum, E.; Krewald, S.; Meissner, Ulf-G.

    2006-01-01

    Effective field theory provides a systematic approach to hardon physics and few-nucleon systems. It allows one to determine the effective two-, three-, and more-nucleon interactions which are consistent with each other. We present a project to derive bulk properties of nuclei from the effective nucleonic interactions

  11. Integer Flows and Circuit Covers of Graphs and Signed Graphs

    Science.gov (United States)

    Cheng, Jian

    The work in Chapter 2 is motivated by Tutte and Jaeger's pioneering work on converting modulo flows into integer-valued flows for ordinary graphs. For a signed graphs (G, sigma), we first prove that for each k ∈ {2, 3}, if (G, sigma) is (k - 1)-edge-connected and contains an even number of negative edges when k = 2, then every modulo k-flow of (G, sigma) can be converted into an integer-valued ( k + 1)-ow with a larger or the same support. We also prove that if (G, sigma) is odd-(2p+1)-edge-connected, then (G, sigma) admits a modulo circular (2 + 1/ p)-flows if and only if it admits an integer-valued circular (2 + 1/p)-flows, which improves all previous result by Xu and Zhang (DM2005), Schubert and Steffen (EJC2015), and Zhu (JCTB2015). Shortest circuit cover conjecture is one of the major open problems in graph theory. It states that every bridgeless graph G contains a set of circuits F such that each edge is contained in at least one member of F and the length of F is at most 7/5∥E(G)∥. This concept was recently generalized to signed graphs by Macajova et al. (JGT2015). In Chapter 3, we improve their upper bound from 11∥E( G)∥ to 14/3 ∥E(G)∥, and if G is 2-edgeconnected and has even negativeness, then it can be further reduced to 11/3 ∥E(G)∥. Tutte's 3-flow conjecture has been studied by many graph theorists in the last several decades. As a new approach to this conjecture, DeVos and Thomassen considered the vectors as ow values and found that there is a close relation between vector S1-flows and integer 3-NZFs. Motivated by their observation, in Chapter 4, we prove that if a graph G admits a vector S1-flow with rank at most two, then G admits an integer 3-NZF. The concept of even factors is highly related to the famous Four Color Theorem. We conclude this dissertation in Chapter 5 with an improvement of a recent result by Chen and Fan (JCTB2016) on the upperbound of even factors. We show that if a graph G contains an even factor, then it

  12. Spectral fluctuations of quantum graphs

    International Nuclear Information System (INIS)

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

    2014-01-01

    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

  13. On the design of a hierarchical SS7 network: A graph theoretical approach

    Science.gov (United States)

    Krauss, Lutz; Rufa, Gerhard

    1994-04-01

    This contribution is concerned with the design of Signaling System No. 7 networks based on graph theoretical methods. A hierarchical network topology is derived by combining the advantage of the hierarchical network structure with the realization of node disjoint routes between nodes of the network. By using specific features of this topology, we develop an algorithm to construct circle-free routing data and to assure bidirectionality also in case of failure situations. The methods described are based on the requirements that the network topology, as well as the routing data, may be easily changed.

  14. Hyperbolicity in median graphs

    Indian Academy of Sciences (India)

    mic problems in hyperbolic spaces and hyperbolic graphs have been .... that in general the main obstacle is that we do not know the location of ...... [25] Jonckheere E and Lohsoonthorn P, A hyperbolic geometry approach to multipath routing,.

  15. Learning molecular energies using localized graph kernels

    Science.gov (United States)

    Ferré, Grégoire; Haut, Terry; Barros, Kipton

    2017-03-01

    Recent machine learning methods make it possible to model potential energy of atomic configurations with chemical-level accuracy (as calculated from ab initio calculations) and at speeds suitable for molecular dynamics simulation. Best performance is achieved when the known physical constraints are encoded in the machine learning models. For example, the atomic energy is invariant under global translations and rotations; it is also invariant to permutations of same-species atoms. Although simple to state, these symmetries are complicated to encode into machine learning algorithms. In this paper, we present a machine learning approach based on graph theory that naturally incorporates translation, rotation, and permutation symmetries. Specifically, we use a random walk graph kernel to measure the similarity of two adjacency matrices, each of which represents a local atomic environment. This Graph Approximated Energy (GRAPE) approach is flexible and admits many possible extensions. We benchmark a simple version of GRAPE by predicting atomization energies on a standard dataset of organic molecules.

  16. A combinatorial approach to diffeomorphism invariant quantum gauge theories

    International Nuclear Information System (INIS)

    Zapata, J.A.

    1997-01-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 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 1997 American Institute of Physics

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

    Science.gov (United States)

    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.

  18. Bounding the HL-index of a graph: a majorization approach.

    Science.gov (United States)

    Clemente, Gian Paolo; Cornaro, Alessandra

    2016-01-01

    In mathematical chemistry, the median eigenvalues of the adjacency matrix of a molecular graph are strictly related to orbital energies and molecular orbitals. In this regard, the difference between the occupied orbital of highest energy (HOMO) and the unoccupied orbital of lowest energy (LUMO) has been investigated (see Fowler and Pisansky in Acta Chim. Slov. 57:513-517, 2010). Motivated by the HOMO-LUMO separation problem, Jaklič et al. in (Ars Math. Contemp. 5:99-115, 2012) proposed the notion of HL -index that measures how large in absolute value are the median eigenvalues of the adjacency matrix. Several bounds for this index have been provided in the literature. The aim of the paper is to derive alternative inequalities to bound the HL -index. By applying majorization techniques and making use of some known relations, we derive new and sharper upper bounds for this index. Analytical and numerical results show the performance of these bounds on different classes of graphs.

  19. Query optimization for graph analytics on linked data using SPARQL

    Energy Technology Data Exchange (ETDEWEB)

    Hong, Seokyong [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Lee, Sangkeun [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Lim, Seung -Hwan [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Sukumar, Sreenivas R. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Vatsavai, Ranga Raju [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)

    2015-07-01

    Triplestores that support query languages such as SPARQL are emerging as the preferred and scalable solution to represent data and meta-data as massive heterogeneous graphs using Semantic Web standards. With increasing adoption, the desire to conduct graph-theoretic mining and exploratory analysis has also increased. Addressing that desire, this paper presents a solution that is the marriage of Graph Theory and the Semantic Web. We present software that can analyze Linked Data using graph operations such as counting triangles, finding eccentricity, testing connectedness, and computing PageRank directly on triple stores via the SPARQL interface. We describe the process of optimizing performance of the SPARQL-based implementation of such popular graph algorithms by reducing the space-overhead, simplifying iterative complexity and removing redundant computations by understanding query plans. Our optimized approach shows significant performance gains on triplestores hosted on stand-alone workstations as well as hardware-optimized scalable supercomputers such as the Cray XMT.

  20. Interacting electrons theory and computational approaches

    CERN Document Server

    Martin, Richard M; Ceperley, David M

    2016-01-01

    Recent progress in the theory and computation of electronic structure is bringing an unprecedented level of capability for research. Many-body methods are becoming essential tools vital for quantitative calculations and understanding materials phenomena in physics, chemistry, materials science and other fields. This book provides a unified exposition of the most-used tools: many-body perturbation theory, dynamical mean field theory and quantum Monte Carlo simulations. Each topic is introduced with a less technical overview for a broad readership, followed by in-depth descriptions and mathematical formulation. Practical guidelines, illustrations and exercises are chosen to enable readers to appreciate the complementary approaches, their relationships, and the advantages and disadvantages of each method. This book is designed for graduate students and researchers who want to use and understand these advanced computational tools, get a broad overview, and acquire a basis for participating in new developments.

  1. Dynamics of Metropolitan Landscapes and Daily Mobility Flows in the Italian Context. An Analysis Based on the Theory of Graphs

    Directory of Open Access Journals (Sweden)

    Amedeo Ganciu

    2018-02-01

    Full Text Available The distribution of services across a territory generates daily commuting flows, which have a significant influence on the development of the territory and often causes congestion in large areas. This negatively affects the environmental, economic and social components of the metropolitan landscape. Using the graph theory, we constructed and analyzed various (in typologies of transportation and moving time flow networks in the two main Italian metropolitan areas: Rome (MCR and Milan (MCM. The analysis of these networks provided us with strategic information on the dynamics of the two urban macro-systems. In particular, the aim of our study was to: (i identify the characteristics, distribution and direction of the main attractive forces within the regional systems under study; (ii identify the main differences in size and structure of commuter networks between the two metropolitan areas and between the two regional systems that include the two mother cities; and, (iii identify the main differences in the size and structure of the two commuting networks by transport modes (private, public, non-motorized mobility and the travel time. The results highlighted significant differences between the two case studies regarding volume flows, complexity and structure networks, and the spatial extension of the territories that are governed by the two metropolitan areas. MCR is a strongly monocentric urban system with a regional influence centred on the mother city of Rome, while MCM is a diffused polycentric regional metropolitan system centred on multiple mother cities. The findings many have a role in urban planning choices and in the evaluation of policies aimed to favor sustainable mobility.

  2. Graph theory reveals dysconnected hubs in 22q11DS and altered nodal efficiency in patients with hallucinations

    Directory of Open Access Journals (Sweden)

    Marie-Christine eOttet

    2013-09-01

    Full Text Available Schizophrenia is postulated to be the prototypical dysconnection disorder, in which hallucinations are the core symptom. Due to high heterogeneity in methodology across studies and the clinical phenotype, it remains unclear whether the structural brain dysconnection is global or focal and if clinical symptoms result from this dysconnection. In the present work, we attempt to clarify this issue by studying a population considered as a homogeneous genetic sub-type of schizophrenia, namely the 22q11.2 deletion syndrome (22q11.2DS. Cerebral MRIs were acquired for 46 patients and 48 age and gender matched controls (aged 6 to 26, respectively mean age = 15.20 ± 4.53 and 15.28 ± 4.35 years old. Using the Connectome mapper pipeline (connectomics.org that combines structural and diffusion MRI, we created a whole brain network for each individual. The graph theory was used to quantify the global and local properties in the brain network organization for each participant. A global degree loss of 6% was found in patients’ network along with an increased Characteristic Path Length. After identifying and comparing hubs, a significant loss of degree in patients’ hubs was found in 58% of them. Based on Allen’s brain network model for hallucinations, we explored the association between local efficiency and symptom severity. Negative correlations were found in the Broca’s area (p<0.004, the Wernicke area (p<0.023 and a positive correlation was found in the dorsolateral prefrontal cortex (DLPFC (p<0.014. In line with the dysconnection findings in schizophrenia, our results provide preliminary evidence for a targeted alteration in the brain network hubs’organisation in individuals with a genetic risk for schizophrenia. The study of specific disorganization in language, speech and thought regulation networks sharing similar network properties may help to understand their role in the hallucination mechanism.

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

    Science.gov (United States)

    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.

  4. Profinite graphs and groups

    CERN Document Server

    Ribes, Luis

    2017-01-01

    This book offers a detailed introduction to graph theoretic methods in profinite groups and applications to abstract groups. It is the first to provide a comprehensive treatment of the subject. The author begins by carefully developing relevant notions in topology, profinite groups and homology, including free products of profinite groups, cohomological methods in profinite groups, and fixed points of automorphisms of free pro-p groups. The final part of the book is dedicated to applications of the profinite theory to abstract groups, with sections on finitely generated subgroups of free groups, separability conditions in free and amalgamated products, and algorithms in free groups and finite monoids. Profinite Graphs and Groups will appeal to students and researchers interested in profinite groups, geometric group theory, graphs and connections with the theory of formal languages. A complete reference on the subject, the book includes historical and bibliographical notes as well as a discussion of open quest...

  5. The Global Approach to Quantum Field Theory

    International Nuclear Information System (INIS)

    Folacci, Antoine; Jensen, Bruce

    2003-01-01

    Thanks to its impressive success in the second half of the 20th century, both in high-energy physics and in critical phenomena, quantum field theory has enjoyed an abundant literature. We therefore greet yet another book on this subject with caution: what can a monograph on quantum field theory bring now that is new, either conceptually or pedagogically? But when it is written by a physicist such as Bryce DeWitt, who has made his own contribution to the collection of field theory books with The Global Approach to Quantum Field Theory, all suspicion is naturally abandoned. DeWitt has made a formidable contribution to various areas of physics: general relativity, the interpretation of quantum mechanics, and most of all the quantization of non-Abelian gauge theories and quantum gravity. In addition, his pedagogical publications, especially the Les Houches schools of 1963 and 1983, have had a great impact on quantum field theory. We must begin by alerting the potential readers of this book that it cannot be compared to any other book in the field. This uniqueness applies to both the scientific content and the way the ideas are presented. For DeWitt, a central concept of field theory is that of 'space of histories'. For a field varphi i defined on a given spacetime M, the set of all varphi i (x) for all x in all charts of M defines its history. It is the space Phi of all possible histories (dynamically allowed or not) of the fields defined on M which is called the 'pace of histories' by DeWitt. If only bosonic fields are considered, the space of histories is an infinite-dimensional manifold and if fermionic fields are also present, it must be viewed as an infinite-dimensional supermanifold. The fields can then be regarded as coordinates on these structures, and the geometrical notions of differentiation, metric, connections, measure, as well as the geodesics which can be defined on it, are of fundamental importance in the development of the formalism of quantum field

  6. Structural modeling and analysis of an effluent treatment process for electroplating--a graph theoretic approach.

    Science.gov (United States)

    Kumar, Abhishek; Clement, Shibu; Agrawal, V P

    2010-07-15

    An attempt is made to address a few ecological and environment issues by developing different structural models for effluent treatment system for electroplating. The effluent treatment system is defined with the help of different subsystems contributing to waste minimization. Hierarchical tree and block diagram showing all possible interactions among subsystems are proposed. These non-mathematical diagrams are converted into mathematical models for design improvement, analysis, comparison, storage retrieval and commercially off-the-shelf purchases of different subsystems. This is achieved by developing graph theoretic model, matrix models and variable permanent function model. Analysis is carried out by permanent function, hierarchical tree and block diagram methods. Storage and retrieval is done using matrix models. The methodology is illustrated with the help of an example. Benefits to the electroplaters/end user are identified. 2010 Elsevier B.V. All rights reserved.

  7. Abnormalities of functional brain networks in pathological gambling: a graph-theoretical approach

    Science.gov (United States)

    Tschernegg, Melanie; Crone, Julia S.; Eigenberger, Tina; Schwartenbeck, Philipp; Fauth-Bühler, Mira; Lemènager, Tagrid; Mann, Karl; Thon, Natasha; Wurst, Friedrich M.; Kronbichler, Martin

    2013-01-01

    Functional neuroimaging studies of pathological gambling (PG) demonstrate alterations in frontal and subcortical regions of the mesolimbic reward system. However, most investigations were performed using tasks involving reward processing or executive functions. Little is known about brain network abnormalities during task-free resting state in PG. In the present study, graph-theoretical methods were used to investigate network properties of resting state functional magnetic resonance imaging data in PG. We compared 19 patients with PG to 19 healthy controls (HCs) using the Graph Analysis Toolbox (GAT). None of the examined global metrics differed between groups. At the nodal level, pathological gambler showed a reduced clustering coefficient in the left paracingulate cortex and the left juxtapositional lobe (supplementary motor area, SMA), reduced local efficiency in the left SMA, as well as an increased node betweenness for the left and right paracingulate cortex and the left SMA. At an uncorrected threshold level, the node betweenness in the left inferior frontal gyrus was decreased and increased in the caudate. Additionally, increased functional connectivity between fronto-striatal regions and within frontal regions has also been found for the gambling patients. These findings suggest that regions associated with the reward system demonstrate reduced segregation but enhanced integration while regions associated with executive functions demonstrate reduced integration. The present study makes evident that PG is also associated with abnormalities in the topological network structure of the brain during rest. Since alterations in PG cannot be explained by direct effects of abused substances on the brain, these findings will be of relevance for understanding functional connectivity in other addictive disorders. PMID:24098282

  8. Abnormalities of Functional Brain Networks in Pathological Gambling: A Graph-Theoretical Approach

    Directory of Open Access Journals (Sweden)

    Melanie eTschernegg

    2013-09-01

    Full Text Available Functional neuroimaging studies of pathological gambling demonstrate alterations in frontal and subcortical regions of the mesolimbic reward system. However, most investigations were performed using tasks involving reward processing or executive functions. Little is known about brain network abnormalities during task-free resting state in pathological gambling. In the present study, graph-theoretical methods were used to investigate network properties of resting state functional MRI data in pathological gambling. We compared 19 patients with pathological gambling to 19 healthy controls using the Graph Analysis Toolbox (GAT. None of the examined global metrics differed between groups. At the nodal level, pathological gambler showed a reduced clustering coefficient in the left paracingulate cortex and the left juxtapositional lobe (SMA, reduced local efficiency in the left SMA, as well as an increased node betweenness for the left and right paracingulate cortex and the left SMA. At an uncorrected threshold level, the node betweenness in the left inferior frontal gyrus was decreased and increased in the caudate. Additionally, increased functional connectivity between fronto-striatal regions and within frontal regions has also been found for the gambling patients.These findings suggest that regions associated with the reward system demonstrate reduced segregation but enhanced integration while regions associated with executive functions demonstrate reduced integration. The present study makes evident that pathological gambling is also associated with abnormalities in the topological network structure of the brain during rest. Since alterations in pathological gambling cannot be explained by direct effects of abused substances on the brain, these findings will be of relevance for understanding functional connectivity in other addictive disorders.

  9. Combinatorics and graph theory

    CERN Document Server

    Vasudev, C

    2007-01-01

    About the Book: This text has been carefully designed for flexible use for First Semester M.C.A. course of Uttar Pradesh Technical University (U.P.T.U.), and it contains the following features: Precise mathematical language is used without excessive formalism and abstraction. Over 900 exercises (problem sets) in the text with many different types of questions posed. Care has been taken to balance the mix of notation and words in mathematical statements. Problem sets (exercises) are stated clearly and unambiguously and all are carefully graded for various levels of difficulty. Contents:

  10. Graph theory with applications

    CERN Document Server

    Vasudev, C

    2006-01-01

    Salient Features Over 1500 problems are used to illustrate concepts, related to different topics, and introduce applications. Over 1000 exercises in the text with many different types of questions posed. Precise mathematical language is used without excessive formalism and abstraction. Care has been taken to balance the mix of notation and words in mathematical statements. Problem sets are stated clearly and unambiguously, and all are carefully graded for various levels of difficulty. This text has been carefully designed for flexible use.

  11. Graph-based modelling in engineering

    CERN Document Server

    Rysiński, Jacek

    2017-01-01

    This book presents versatile, modern and creative applications of graph theory in mechanical engineering, robotics and computer networks. Topics related to mechanical engineering include e.g. machine and mechanism science, mechatronics, robotics, gearing and transmissions, design theory and production processes. The graphs treated are simple graphs, weighted and mixed graphs, bond graphs, Petri nets, logical trees etc. The authors represent several countries in Europe and America, and their contributions show how different, elegant, useful and fruitful the utilization of graphs in modelling of engineering systems can be. .

  12. An Approach to Stochastic Peridynamic Theory.

    Energy Technology Data Exchange (ETDEWEB)

    Demmie, Paul N.

    2018-04-01

    In many material systems, man-made or natural, we have an incomplete knowledge of geometric or material properties, which leads to uncertainty in predicting their performance under dynamic loading. Given the uncertainty and a high degree of spatial variability in properties of materials subjected to impact, a stochastic theory of continuum mechanics would be useful for modeling dynamic response of such systems. Peridynamic theory is such a theory. It is formulated as an integro- differential equation that does not employ spatial derivatives, and provides for a consistent formulation of both deformation and failure of materials. We discuss an approach to stochastic peridynamic theory and illustrate the formulation with examples of impact loading of geological materials with uncorrelated or correlated material properties. We examine wave propagation and damage to the material. The most salient feature is the absence of spallation, referred to as disorder toughness, which generalizes similar results from earlier quasi-static damage mechanics. Acknowledgements This research was made possible by the support from DTRA grant HDTRA1-08-10-BRCWM. I thank Dr. Martin Ostoja-Starzewski for introducing me to the mechanics of random materials and collaborating with me throughout and after this DTRA project.

  13. Equipackable graphs

    DEFF Research Database (Denmark)

    Vestergaard, Preben Dahl; Hartnell, Bert L.

    2006-01-01

    There are many results dealing with the problem of decomposing a fixed graph into isomorphic subgraphs. There has also been work on characterizing graphs with the property that one can delete the edges of a number of edge disjoint copies of the subgraph and, regardless of how that is done, the gr...

  14. A Modal-Logic Based Graph Abstraction

    NARCIS (Netherlands)

    Bauer, J.; Boneva, I.B.; Kurban, M.E.; Rensink, Arend; Ehrig, H; Heckel, R.; Rozenberg, G.; Taentzer, G.

    2008-01-01

    Infinite or very large state spaces often prohibit the successful verification of graph transformation systems. Abstract graph transformation is an approach that tackles this problem by abstracting graphs to abstract graphs of bounded size and by lifting application of productions to abstract

  15. Renormalization group approach in the turbulence theory

    International Nuclear Information System (INIS)

    Adzhemyan, L.Ts.; Vasil'ev, A.N.; Pis'mak, Yu.M.

    1983-01-01

    In the framework of the renormalization groUp approach in the turbulence theory sUggested in another paper, the problem of renormalization and evaluation of critical dimensions of composite operators is discussed. Renormalization of a system of operators of canonical dimension equal to 4, including the operator F=phiΔphi (where phi is the velocity field), is considered. It is shown that the critical dimension Δsub(F)=0. The appendice includes the brief proofs of two theorems: 1) the theorem on the equivalence between the arbitrary stochastic problem and quantum field theory; 2) the theorem which determines the reduction of Green functions of the stochastic problem to the hypersurface of coinciding times

  16. Worldline approach to noncommutative field theory

    International Nuclear Information System (INIS)

    Bonezzi, R; Corradini, O; Viñas, S A Franchino; Pisani, P A G

    2012-01-01

    The study of the heat-trace expansion in non-commutative field theory has shown the existence of Moyal non-local Seeley–DeWitt coefficients which are related to the UV/IR mixing and manifest, in some cases, the non-renormalizability of the theory. We show that these models can be studied in a worldline approach implemented in phase space and arrive at a master formula for the n-point contribution to the heat-trace expansion. This formulation could be useful in understanding some open problems in this area, as the heat-trace expansion for the non-commutative torus or the introduction of renormalizing terms in the action, as well as for generalizations to other non-local operators. (paper)

  17. Field theory approaches to new media practices

    DEFF Research Database (Denmark)

    Willig, Ida; Waltorp, Karen; Hartley, Jannie Møller

    2015-01-01

    could benefit particularly from Pierre Bourdieu’s research on cultural production. We introduce some of the literature that concerns digital media use and has been significant for field theory’s development in this context. We then present the four thematic articles in this issue and the articles......This special issue of MedieKultur specifically addresses new media practices and asks how field theory approaches can help us understand how culture is (prod)used via various digital platforms. In this article introducing the theme of the special issue, we argue that studies of new media practices...... outside the theme, which include two translations of classic texts within communications and media research. This introductory article concludes by encouraging media scholars to embark on additional studies within a field theory framework: This framework’s comprehensive theoretical basis and ideal...

  18. A graph-based approach to construct target-focused libraries for virtual screening.

    Science.gov (United States)

    Naderi, Misagh; Alvin, Chris; Ding, Yun; Mukhopadhyay, Supratik; Brylinski, Michal

    2016-01-01

    Due to exorbitant costs of high-throughput screening, many drug discovery projects commonly employ inexpensive virtual screening to support experimental efforts. However, the vast majority of compounds in widely used screening libraries, such as the ZINC database, will have a very low probability to exhibit the desired bioactivity for a given protein. Although combinatorial chemistry methods can be used to augment existing compound libraries with novel drug-like compounds, the broad chemical space is often too large to be explored. Consequently, the trend in library design has shifted to produce screening collections specifically tailored to modulate the function of a particular target or a protein family. Assuming that organic compounds are composed of sets of rigid fragments connected by flexible linkers, a molecule can be decomposed into its building blocks tracking their atomic connectivity. On this account, we developed eSynth, an exhaustive graph-based search algorithm to computationally synthesize new compounds by reconnecting these building blocks following their connectivity patterns. We conducted a series of benchmarking calculations against the Directory of Useful Decoys, Enhanced database. First, in a self-benchmarking test, the correctness of the algorithm is validated with the objective to recover a molecule from its building blocks. Encouragingly, eSynth can efficiently rebuild more than 80 % of active molecules from their fragment components. Next, the capability to discover novel scaffolds is assessed in a cross-benchmarking test, where eSynth successfully reconstructed 40 % of the target molecules using fragments extracted from chemically distinct compounds. Despite an enormous chemical space to be explored, eSynth is computationally efficient; half of the molecules are rebuilt in less than a second, whereas 90 % take only about a minute to be generated. eSynth can successfully reconstruct chemically feasible molecules from molecular fragments

  19. The Global Approach to Quantum Field Theory

    Energy Technology Data Exchange (ETDEWEB)

    Folacci, Antoine; Jensen, Bruce [Faculte des Sciences, Universite de Corse (France); Department of Mathematics, University of Southampton (United Kingdom)

    2003-12-12

    Thanks to its impressive success in the second half of the 20th century, both in high-energy physics and in critical phenomena, quantum field theory has enjoyed an abundant literature. We therefore greet yet another book on this subject with caution: what can a monograph on quantum field theory bring now that is new, either conceptually or pedagogically? But when it is written by a physicist such as Bryce DeWitt, who has made his own contribution to the collection of field theory books with The Global Approach to Quantum Field Theory, all suspicion is naturally abandoned. DeWitt has made a formidable contribution to various areas of physics: general relativity, the interpretation of quantum mechanics, and most of all the quantization of non-Abelian gauge theories and quantum gravity. In addition, his pedagogical publications, especially the Les Houches schools of 1963 and 1983, have had a great impact on quantum field theory. We must begin by alerting the potential readers of this book that it cannot be compared to any other book in the field. This uniqueness applies to both the scientific content and the way the ideas are presented. For DeWitt, a central concept of field theory is that of 'space of histories'. For a field varphi{sup i} defined on a given spacetime M, the set of all varphi{sup i}(x) for all x in all charts of M defines its history. It is the space Phi of all possible histories (dynamically allowed or not) of the fields defined on M which is called the 'pace of histories' by DeWitt. If only bosonic fields are considered, the space of histories is an infinite-dimensional manifold and if fermionic fields are also present, it must be viewed as an infinite-dimensional supermanifold. The fields can then be regarded as coordinates on these structures, and the geometrical notions of differentiation, metric, connections, measure, as well as the geodesics which can be defined on it, are of fundamental importance in the development of the

  20. Graph Theory-Based Technique for Isolating Corrupted Boundary Conditions in Continental-Scale River Network Hydrodynamic Simulation

    Science.gov (United States)

    Yu, C. W.; Hodges, B. R.; Liu, F.

    2017-12-01

    Development of continental-scale river network models creates challenges where the massive amount of boundary condition data encounters the sensitivity of a dynamic nu- merical model. The topographic data sets used to define the river channel characteristics may include either corrupt data or complex configurations that cause instabilities in a numerical solution of the Saint-Venant equations. For local-scale river models (e.g. HEC- RAS), modelers typically rely on past experience to make ad hoc boundary condition adjustments that ensure a stable solution - the proof of the adjustment is merely the sta- bility of the solution. To date, there do not exist any formal methodologies or automated procedures for a priori detecting/fixing boundary conditions that cause instabilities in a dynamic model. Formal methodologies for data screening and adjustment are a critical need for simulations with a large number of river reaches that draw their boundary con- dition data from a wide variety of sources. At the continental scale, we simply cannot assume that we will have access to river-channel cross-section data that has been ade- quately analyzed and processed. Herein, we argue that problematic boundary condition data for unsteady dynamic modeling can be identified through numerical modeling with the steady-state Saint-Venant equations. The fragility of numerical stability increases with the complexity of branching in river network system and instabilities (even in an unsteady solution) are typically triggered by the nonlinear advection term in Saint-Venant equations. It follows that the behavior of the simpler steady-state equations (which retain the nonlin- ear term) can be used to screen the boundary condition data for problematic regions. In this research, we propose a graph-theory based method to isolate the location of corrupted boundary condition data in a continental-scale river network and demonstrate its utility with a network of O(10^4) elements. Acknowledgement

  1. Modelling of Non-Linear Pilot Disinfection Water System: A Bond Graph Approach

    Directory of Open Access Journals (Sweden)

    Naoufel ZITOUNI

    2012-08-01

    Full Text Available The ultraviolet (UV irradiations are used to solve the bacteriological problem of the drinking water quality. A discharge-gas lamp is used to produce this type of irradiation. The UV lamp is fed by photovoltaic (PV energy via electronic ballast composed by an inverter, a transformer and resonant circuit (RLC. The aim of this work is to give a useful global model of the system. In particular, we introduce the complicated UV lamp model and the water disinfection kinetics, where the radiant energy flux emitted by the discharge-gas lamp and the arc voltage are a complex functions of the current and time. This system is intended to be mainly used in rural zones, the photovoltaic modules as source of energy is an adequate solution. To optimise the power transfer from the PV array to ballast and UV lamp, a Maximum Power Point Tracking (MPPT device may be located between PV array and the loads. In this paper, we developed a bond-graph model which gives the water quality from UV flow, gas type, pressure, lamp current and geometrical characteristic. Finally reliable simulations are established and compared with experimental tests.

  2. Association of Finite-Time Thermodynamics and a Bond-Graph Approach for Modeling an Endoreversible Heat Engine

    Directory of Open Access Journals (Sweden)

    Michel Feidt

    2012-03-01

    Full Text Available In recent decades, the approach known as Finite-Time Thermodynamics has provided a fruitful theoretical framework for the optimization of heat engines operating between a heat source (at temperature and a heat sink (at temperature . The aim of this paper is to propose a more complete approach based on the association of Finite-Time Thermodynamics and the Bond-Graph approach for modeling endoreversible heat engines. This approach makes it possible for example to find in a simple way the characteristics of the optimal operating point at which the maximum mechanical power of the endoreversible heat engine is obtained with entropy flow rate as control variable. Furthermore it provides the analytical expressions of the optimal operating point of an irreversible heat engine where the energy conversion is accompanied by irreversibilities related to internal heat transfer and heat dissipation phenomena. This original approach, applied to an analysis of the performance of a thermoelectric generator, will be the object of a future publication.

  3. Code-Aided Estimation and Detection on Time-Varying Correlated Mimo Channels: A Factor Graph Approach

    Directory of Open Access Journals (Sweden)

    Simoens Frederik

    2006-01-01

    Full Text Available This paper concerns channel tracking in a multiantenna context for correlated flat-fading channels obeying a Gauss-Markov model. It is known that data-aided tracking of fast-fading channels requires a lot of pilot symbols in order to achieve sufficient accuracy, and hence decreases the spectral efficiency. To overcome this problem, we design a code-aided estimation scheme which exploits information from both the pilot symbols and the unknown coded data symbols. The algorithm is derived based on a factor graph representation of the system and application of the sum-product algorithm. The sum-product algorithm reveals how soft information from the decoder should be exploited for the purpose of estimation and how the information bits can be detected. Simulation results illustrate the effectiveness of our approach.

  4. Mechatronic modeling of a 750kW fixed-speed wind energy conversion system using the Bond Graph Approach.

    Science.gov (United States)

    Khaouch, Zakaria; Zekraoui, Mustapha; Bengourram, Jamaa; Kouider, Nourreeddine; Mabrouki, Mustapha

    2016-11-01

    In this paper, we would like to focus on modeling main parts of the wind turbines (blades, gearbox, tower, generator and pitching system) from a mechatronics viewpoint using the Bond-Graph Approach (BGA). Then, these parts are combined together in order to simulate the complete system. Moreover, the real dynamic behavior of the wind turbine is taken into account and with the new model; final load simulation is more realistic offering benefits and reliable system performance. This model can be used to develop control algorithms to reduce fatigue loads and enhance power production. Different simulations are carried-out in order to validate the proposed wind turbine model, using real data provided in the open literature (blade profile and gearbox parameters for a 750 kW wind turbine). Copyright © 2016 ISA. Published by Elsevier Ltd. All rights reserved.

  5. Practical graph mining with R

    CERN Document Server

    Hendrix, William; Jenkins, John; Padmanabhan, Kanchana; Chakraborty, Arpan

    2014-01-01

    Practical Graph Mining with R presents a "do-it-yourself" approach to extracting interesting patterns from graph data. It covers many basic and advanced techniques for the identification of anomalous or frequently recurring patterns in a graph, the discovery of groups or clusters of nodes that share common patterns of attributes and relationships, the extraction of patterns that distinguish one category of graphs from another, and the use of those patterns to predict the category of new graphs. Hands-On Application of Graph Data Mining Each chapter in the book focuses on a graph mining task, such as link analysis, cluster analysis, and classification. Through applications using real data sets, the book demonstrates how computational techniques can help solve real-world problems. The applications covered include network intrusion detection, tumor cell diagnostics, face recognition, predictive toxicology, mining metabolic and protein-protein interaction networks, and community detection in social networks. De...

  6. Nonrelativistic quantum electrodynamic approach to photoemission theory

    International Nuclear Information System (INIS)

    Fujikawa, Takashi; Arai, Hiroko

    2005-01-01

    A new nonrelativistic many-body theory to analyze X-ray photoelectron spectroscopy (XPS) spectra has been developed on the basis of quantum electrodynamic (QED) Keldysh Green's function approach. To obtain XPS current density we calculate electron Green's function g which partly includes electron-photon interactions. We first separate longitudinal and transverse parts of these Green's functions in the Coulomb gauge. The transverse electron selfenergy describes the electron-photon interaction, whereas the longitudinal electron selfenergy describes the electron-electron interaction. We derive the QED Hedin's equation from which we obtain systematic skeleton expansion in the power series of the screened Coulomb interaction W and the photon Green's function D kl . We show the present theory provides a sound theoretical tool to study complicated many-body processes such as the electron propagation damping, intrinsic, extrinsic losses and their interference, and furthermore, resonant photoemission processes. We have also found the importance of the mixed photon Green's functions D 0k and D k0 which have been supposed to be unimportant for the XPS analyses. They, however, directly describe the radiation field screening. In this work, photon field screening effects are discussed in one-step theory, where the electron-photon interaction operator Δ is proved to be replaced by ε -1 Δ beyond linear approximation. Beyond free photon Green's function approximation, photon scatterings from the electron density are incorporated within the present QED theory. These photon field effects can directly describe the microscopic photon field spatial variation specific to near the surface region and nanoparticle systems

  7. Optimization of the graph model of the water conduit network, based on the approach of search space reducing

    Science.gov (United States)

    Korovin, Iakov S.; Tkachenko, Maxim G.

    2018-03-01

    In this paper we present a heuristic approach, improving the efficiency of methods, used for creation of efficient architecture of water distribution networks. The essence of the approach is a procedure of search space reduction the by limiting the range of available pipe diameters that can be used for each edge of the network graph. In order to proceed the reduction, two opposite boundary scenarios for the distribution of flows are analysed, after which the resulting range is further narrowed by applying a flow rate limitation for each edge of the network. The first boundary scenario provides the most uniform distribution of the flow in the network, the opposite scenario created the net with the highest possible flow level. The parameters of both distributions are calculated by optimizing systems of quadratic functions in a confined space, which can be effectively performed with small time costs. This approach was used to modify the genetic algorithm (GA). The proposed GA provides a variable number of variants of each gene, according to the number of diameters in list, taking into account flow restrictions. The proposed approach was implemented to the evaluation of a well-known test network - the Hanoi water distribution network [1], the results of research were compared with a classical GA with an unlimited search space. On the test data, the proposed trip significantly reduced the search space and provided faster and more obvious convergence in comparison with the classical version of GA.

  8. Optimization Problems on Threshold Graphs

    Directory of Open Access Journals (Sweden)

    Elena Nechita

    2010-06-01

    Full Text Available During the last three decades, different types of decompositions have been processed in the field of graph theory. Among these we mention: decompositions based on the additivity of some characteristics of the graph, decompositions where the adjacency law between the subsets of the partition is known, decompositions where the subgraph induced by every subset of the partition must have predeterminate properties, as well as combinations of such decompositions. In this paper we characterize threshold graphs using the weakly decomposition, determine: density and stability number, Wiener index and Wiener polynomial for threshold graphs.

  9. Left-ventricle segmentation in real-time 3D echocardiography using a hybrid active shape model and optimal graph search approach

    Science.gov (United States)

    Zhang, Honghai; Abiose, Ademola K.; Campbell, Dwayne N.; Sonka, Milan; Martins, James B.; Wahle, Andreas

    2010-03-01

    Quantitative analysis of the left ventricular shape and motion patterns associated with left ventricular mechanical dyssynchrony (LVMD) is essential for diagnosis and treatment planning in congestive heart failure. Real-time 3D echocardiography (RT3DE) used for LVMD analysis is frequently limited by heavy speckle noise or partially incomplete data, thus a segmentation method utilizing learned global shape knowledge is beneficial. In this study, the endocardial surface of the left ventricle (LV) is segmented using a hybrid approach combining active shape model (ASM) with optimal graph search. The latter is used to achieve landmark refinement in the ASM framework. Optimal graph search translates the 3D segmentation into the detection of a minimum-cost closed set in a graph and can produce a globally optimal result. Various information-gradient, intensity distributions, and regional-property terms-are used to define the costs for the graph search. The developed method was tested on 44 RT3DE datasets acquired from 26 LVMD patients. The segmentation accuracy was assessed by surface positioning error and volume overlap measured for the whole LV as well as 16 standard LV regions. The segmentation produced very good results that were not achievable using ASM or graph search alone.

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

    Science.gov (United States)

    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

  11. The field theory approach to percolation processes

    International Nuclear Information System (INIS)

    Janssen, Hans-Karl; Taeuber, Uwe C.

    2005-01-01

    We review the field theory approach to percolation processes. Specifically, we focus on the so-called simple and general epidemic processes that display continuous non-equilibrium active to absorbing state phase transitions whose asymptotic features are governed, respectively, by the directed (DP) and dynamic isotropic percolation (dIP) universality classes. We discuss the construction of a field theory representation for these Markovian stochastic processes based on fundamental phenomenological considerations, as well as from a specific microscopic reaction-diffusion model realization. Subsequently we explain how dynamic renormalization group (RG) methods can be applied to obtain the universal properties near the critical point in an expansion about the upper critical dimensions d c = 4 (DP) and 6 (dIP). We provide a detailed overview of results for critical exponents, scaling functions, crossover phenomena, finite-size scaling, and also briefly comment on the influence of long-range spreading, the presence of a boundary, multispecies generalizations, coupling of the order parameter to other conserved modes, and quenched disorder

  12. Thermospheric dynamics - A system theory approach

    Science.gov (United States)

    Codrescu, M.; Forbes, J. M.; Roble, R. G.

    1990-01-01

    A system theory approach to thermospheric modeling is developed, based upon a linearization method which is capable of preserving nonlinear features of a dynamical system. The method is tested using a large, nonlinear, time-varying system, namely the thermospheric general circulation model (TGCM) of the National Center for Atmospheric Research. In the linearized version an equivalent system, defined for one of the desired TGCM output variables, is characterized by a set of response functions that is constructed from corresponding quasi-steady state and unit sample response functions. The linearized version of the system runs on a personal computer and produces an approximation of the desired TGCM output field height profile at a given geographic location.

  13. Numerical approach of the quantum circuit theory

    International Nuclear Information System (INIS)

    Silva, J.J.B.; Duarte-Filho, G.C.; Almeida, F.A.G.

    2017-01-01

    In this paper we develop a numerical method based on the quantum circuit theory to approach the coherent electronic transport in a network of quantum dots connected with arbitrary topology. The algorithm was employed in a circuit formed by quantum dots connected each other in a shape of a linear chain (associations in series), and of a ring (associations in series, and in parallel). For both systems we compute two current observables: conductance and shot noise power. We find an excellent agreement between our numerical results and the ones found in the literature. Moreover, we analyze the algorithm efficiency for a chain of quantum dots, where the mean processing time exhibits a linear dependence with the number of quantum dots in the array.

  14. Numerical approach of the quantum circuit theory

    Science.gov (United States)

    Silva, J. J. B.; Duarte-Filho, G. C.; Almeida, F. A. G.

    2017-03-01

    In this paper we develop a numerical method based on the quantum circuit theory to approach the coherent electronic transport in a network of quantum dots connected with arbitrary topology. The algorithm was employed in a circuit formed by quantum dots connected each other in a shape of a linear chain (associations in series), and of a ring (associations in series, and in parallel). For both systems we compute two current observables: conductance and shot noise power. We find an excellent agreement between our numerical results and the ones found in the literature. Moreover, we analyze the algorithm efficiency for a chain of quantum dots, where the mean processing time exhibits a linear dependence with the number of quantum dots in the array.

  15. Numerical approach of the quantum circuit theory

    Energy Technology Data Exchange (ETDEWEB)

    Silva, J.J.B., E-mail: jaedsonfisica@hotmail.com; Duarte-Filho, G.C.; Almeida, F.A.G.

    2017-03-15

    In this paper we develop a numerical method based on the quantum circuit theory to approach the coherent electronic transport in a network of quantum dots connected with arbitrary topology. The algorithm was employed in a circuit formed by quantum dots connected each other in a shape of a linear chain (associations in series), and of a ring (associations in series, and in parallel). For both systems we compute two current observables: conductance and shot noise power. We find an excellent agreement between our numerical results and the ones found in the literature. Moreover, we analyze the algorithm efficiency for a chain of quantum dots, where the mean processing time exhibits a linear dependence with the number of quantum dots in the array.

  16. Quantum Lie theory a multilinear approach

    CERN Document Server

    Kharchenko, Vladislav

    2015-01-01

    This is an introduction to the mathematics behind the phrase “quantum Lie algebra”. The numerous attempts over the last 15-20 years to define a quantum Lie algebra as an elegant algebraic object with a binary “quantum” Lie bracket have not been widely accepted. In this book, an alternative approach is developed that includes multivariable operations. Among the problems discussed are the following: a PBW-type theorem; quantum deformations of Kac--Moody algebras; generic and symmetric quantum Lie operations; the Nichols algebras; the Gurevich--Manin  Lie algebras;  and Shestakov--Umirbaev  operations for the Lie theory of nonassociative products.  Opening with an introduction for beginners and continuing as a textbook for graduate students in physics and mathematics, the book can also be used as a reference by more advanced readers. With the exception of the introductory chapter, the content of this monograph has not previously appeared in book form.

  17. Mechatronics by bond graphs an object-oriented approach to modelling and simulation

    CERN Document Server

    Damić, Vjekoslav

    2015-01-01

    This book presents a computer-aided approach to the design of mechatronic systems. Its subject is an integrated modeling and simulation in a visual computer environment. Since the first edition, the simulation software changed enormously, became more user-friendly and easier to use. Therefore, a second edition became necessary taking these improvements into account. The modeling is based on system top-down and bottom-up approach. The mathematical models are generated in a form of differential-algebraic equations and solved using numerical and symbolic algebra methods. The integrated approach developed is applied to mechanical, electrical and control systems, multibody dynamics, and continuous systems. .

  18. The Global Approach to Quantum Field Theory

    Energy Technology Data Exchange (ETDEWEB)

    Fulling, S A [Texas A and M University (United States)

    2006-05-21

    Parts I and II develop the basic classical and quantum kinematics of fields and other dynamical systems. The presentation is conducted in the utmost generality, allowing for dynamical quantities that may be anticommuting (supernumbers) and theories subject to the most general possible gauge symmetry. The basic ingredients are action functionals and the Peierls bracket, a manifestly covariant replacement for the Poisson bracket and equal-time commutation relations. For DeWitt the logical progression is Peierls bracket {yields} Schwinger action principle {yields} Feynman functional integral although he points out that the historical development was in the opposite order. It must be pointed out that the Peierls-Schwinger-DeWitt approach, despite some advantages over initial-value formulations, has some troubles of its own. In particular, it has never completely escaped from the arena of scattering theory, the paradigm of conventional particle physics. One is naturally led to study matrix elements between an 'in-vacuum' and an 'out-vacuum' though such concepts are murky in situations, such as big bangs and black holes, where the ambient geometry is not asymptotically static in the far past and future. The newest material in the treatise appears in two chapters in part II devoted to the interpretation of quantum theory, incorporating some unpublished work of David Deutsch on the meaning of probability in physics. Parts III through V apply the formalism in depth to successively more difficult classes of systems: quantum mechanics, linear (free) fields, and interacting fields. DeWitt's characteristic tools of effective actions, heat kernels, and ghost fields are developed. Chapters 26 and 31 outline new approaches developed in collaboration with DeWitt's recent students C Molina-Paris and C Y Wang, respectively. The most of parts VI and VII consist of special topics, such as anomalies, particle creation by external fields, Unruh acceleration

  19. The Global Approach to Quantum Field Theory

    International Nuclear Information System (INIS)

    Fulling, S A

    2006-01-01

    Parts I and II develop the basic classical and quantum kinematics of fields and other dynamical systems. The presentation is conducted in the utmost generality, allowing for dynamical quantities that may be anticommuting (supernumbers) and theories subject to the most general possible gauge symmetry. The basic ingredients are action functionals and the Peierls bracket, a manifestly covariant replacement for the Poisson bracket and equal-time commutation relations. For DeWitt the logical progression is Peierls bracket → Schwinger action principle → Feynman functional integral although he points out that the historical development was in the opposite order. It must be pointed out that the Peierls-Schwinger-DeWitt approach, despite some advantages over initial-value formulations, has some troubles of its own. In particular, it has never completely escaped from the arena of scattering theory, the paradigm of conventional particle physics. One is naturally led to study matrix elements between an 'in-vacuum' and an 'out-vacuum' though such concepts are murky in situations, such as big bangs and black holes, where the ambient geometry is not asymptotically static in the far past and future. The newest material in the treatise appears in two chapters in part II devoted to the interpretation of quantum theory, incorporating some unpublished work of David Deutsch on the meaning of probability in physics. Parts III through V apply the formalism in depth to successively more difficult classes of systems: quantum mechanics, linear (free) fields, and interacting fields. DeWitt's characteristic tools of effective actions, heat kernels, and ghost fields are developed. Chapters 26 and 31 outline new approaches developed in collaboration with DeWitt's recent students C Molina-Paris and C Y Wang, respectively. The most of parts VI and VII consist of special topics, such as anomalies, particle creation by external fields, Unruh acceleration temperature, black holes, and

  20. Augmented marked graphs

    CERN Document Server

    Cheung, King Sing

    2014-01-01

    Petri nets are a formal and theoretically rich model for the modelling and analysis of systems. A subclass of Petri nets, augmented marked graphs possess a structure that is especially desirable for the modelling and analysis of systems with concurrent processes and shared resources.This monograph consists of three parts: Part I provides the conceptual background for readers who have no prior knowledge on Petri nets; Part II elaborates the theory of augmented marked graphs; finally, Part III discusses the application to system integration. The book is suitable as a first self-contained volume

  1. An Efficient Monte Carlo Approach to Compute PageRank for Large Graphs on a Single PC

    Directory of Open Access Journals (Sweden)

    Sonobe Tomohiro

    2016-03-01

    Full Text Available This paper describes a novel Monte Carlo based random walk to compute PageRanks of nodes in a large graph on a single PC. The target graphs of this paper are ones whose size is larger than the physical memory. In such an environment, memory management is a difficult task for simulating the random walk among the nodes. We propose a novel method that partitions the graph into subgraphs in order to make them fit into the physical memory, and conducts the random walk for each subgraph. By evaluating the walks lazily, we can conduct the walks only in a subgraph and approximate the random walk by rotating the subgraphs. In computational experiments, the proposed method exhibits good performance for existing large graphs with several passes of the graph data.

  2. Building International Business Theory: A Grounded Theory Approach

    OpenAIRE

    Gligor, David; Esmark, Carol; Golgeci, Ismail

    2016-01-01

    The field of international business (IB) is in need of more theory development (Morck & Yeung, 2007). As such, the main focus of our manuscript was to provide guidance on how to build IB specific theory using grounded theory (GT). Moreover, we contribute to future theory development by identifying areas within IB where GT can be applied and the type of research issues that can be addressed using this methodology. Finally, we make a noteworthy contribution by discussing some of GT’s caveats an...

  3. A Comparison of Approaches for Solving Hard Graph-Theoretic Problems

    Science.gov (United States)

    2015-04-29

    and Search”, in Discrete Mathematics and Its Applications, Book 7, CRC Press (1998): Boca Raton. [6] A. Lucas, “Ising Formulations of Many NP Problems...owner. 14. ABSTRACT In order to formulate mathematical conjectures likely to be true, a number of base cases must be determined. However, many... combinatorial problems are NP-hard and the computational complexity makes this research approach difficult using a standard brute force approach on a

  4. Functional integral approach to string theories

    International Nuclear Information System (INIS)

    Sakita, B.

    1987-01-01

    Fermionic string theory can be made supersymmetric: the superstring. It contains among others mass zero gauge fields of spin 1 and 2. The recent revival of interests in string field theories is due to the recognition of the compactified superstring theory as a viable theory of grandunification of all interactions, especially after Green and Schwarz's discovery of the gauge and gravitational anomaly cancellation in 0(32) superstring theory. New developments include string phenomenology, general discussions of compactification, new models, especially the heterotic string. These are either applications or extensions of string field theories. Although these are very exciting developments, the author limits his attention to the basics of the bosonic string theory

  5. The Quantified Characterization Method of the Micro-Macro Contacts of Three-Dimensional Granular Materials on the Basis of Graph Theory.

    Science.gov (United States)

    Guan, Yanpeng; Wang, Enzhi; Liu, Xiaoli; Wang, Sijing; Luan, Hebing

    2017-08-03

    We have attempted a multiscale and quantified characterization method of the contact in three-dimensional granular material made of spherical particles, particularly in cemented granular material. Particle contact is defined as a type of surface contact with voids in its surroundings, rather than a point contact. Macro contact is a particle contact set satisfying the restrictive condition of a two-dimensional manifold with a boundary. On the basis of graph theory, two dual geometrical systems are abstracted from the granular pack. The face and the face set, which satisfies the two-dimensional manifold with a boundary in the solid cell system, are extracted to characterize the particle contact and the macro contact, respectively. This characterization method is utilized to improve the post-processing in DEM (Discrete Element Method) from a micro perspective to describe the macro effect of the cemented granular material made of spherical particles. Since the crack has the same shape as its corresponding contact, this method is adopted to characterize the crack and realize its visualization. The integral failure route of the sample can be determined by a graph theory algorithm. The contact force is assigned to the weight value of the face characterizing the particle contact. Since the force vectors can be added, the macro contact force can be solved by adding the weight of its corresponding faces.

  6. Directed Graph Methodology for Acquisition Path Analysis: a possible tool to support the state-level approach

    International Nuclear Information System (INIS)

    Vincze, Arpad; Nemeth, Andras

    2013-01-01

    According to a recent statement, the IAEA seeks to develop a more effective safeguards system to achieve greater deterrence, because deterrence of proliferation is much more effective than detection. To achieve this goal, a less predictive safeguards system is being developed based on the advanced state-level approach that is driven by all available safeguards-relevant information. The 'directed graph analysis' is recommended as a possible methodology to implement acquisition path analysis by the IAEA to support the State evaluation process. The basic methodology is simple, well established, powerful, and its adaptation to the modelling of the nuclear profile of a State requires minimum software development. Based on this methodology the material flow network model has been developed under the Hungarian Support Programme to the IAEA, which is described in detail. In the proposed model, materials in different chemical and physical form can flow through pipes representing declared processes, material transports, diversions or undeclared processes. The nodes of the network are the material types, while the edges of the network are the pipes. A state parameter (p) is assigned to each node and edge representing the probability of their existence in the State. The possible application of this model in the State-level analytical approach will be discussed and outlook for further work will be given. The paper is followed by the slides of the presentation

  7. Twistor-theoretic approach to topological field theories

    International Nuclear Information System (INIS)

    Ito, Kei.

    1991-12-01

    The two-dimensional topological field theory which describes a four-dimensional self-dual space-time (gravitational instanton) as a target space, which we constructed before, is shown to be deeply connected with Penrose's 'twistor theory'. The relations are presented in detail. Thus our theory offers a 'twistor theoretic' approach to topological field theories. (author)

  8. Computing decay rates for new physics theories with FeynRules  and MadGraph 5 _aMC@NLO

    CERN Document Server

    Alwall, Johan; Fuks, Benjamin; Mattelaer, Olivier; Öztürk, Deniz Gizem; Shen, Chia-Hsien

    2015-01-01

    We present new features of the FeynRules and MadGraph5/aMC@NLO programs for the automatic computation of decay widths that consistently include channels of arbitrary final-state multiplicity. The implementations are generic enough so that they can be used in the framework of any quantum field theory, possibly including higher-dimensional operators. We extend at the same time the conventions of the Universal FeynRules Output (or UFO) format to include decay tables and information on the total widths. We finally provide a set of representative examples of the usage of the new functions of the different codes in the framework of the Standard Model, the Higgs Effective Field Theory, the Strongly Interacting Light Higgs model and the Minimal Supersymmetric Standard Model and compare the results to available literature and programs for validation purposes.

  9. Graphs, groups and surfaces

    CERN Document Server

    White, AT

    1985-01-01

    The field of topological graph theory has expanded greatly in the ten years since the first edition of this book appeared. The original nine chapters of this classic work have therefore been revised and updated. Six new chapters have been added, dealing with: voltage graphs, non-orientable imbeddings, block designs associated with graph imbeddings, hypergraph imbeddings, map automorphism groups and change ringing.Thirty-two new problems have been added to this new edition, so that there are now 181 in all; 22 of these have been designated as ``difficult'''' and 9 as ``unsolved''''. Three of the four unsolved problems from the first edition have been solved in the ten years between editions; they are now marked as ``difficult''''.

  10. Fault diagnosis of generation IV nuclear HTGR components – Part II: The area error enthalpy–entropy graph approach

    International Nuclear Information System (INIS)

    Rand, C.P. du; Schoor, G. van

    2012-01-01

    Highlights: ► Different uncorrelated fault signatures are derived for HTGR component faults. ► A multiple classifier ensemble increases confidence in classification accuracy. ► Detailed simulation model of system is not required for fault diagnosis. - Abstract: The second paper in a two part series presents the area error method for generation of representative enthalpy–entropy (h–s) fault signatures to classify malfunctions in generation IV nuclear high temperature gas-cooled reactor (HTGR) components. The second classifier is devised to ultimately address the fault diagnosis (FD) problem via the proposed methods in a multiple classifier (MC) ensemble. FD is realized by way of different input feature sets to the classification algorithm based on the area and trajectory of the residual shift between the fault-free and the actual operating h–s graph models. The application of the proposed technique is specifically demonstrated for 24 single fault transients considered in the main power system (MPS) of the Pebble Bed Modular Reactor (PBMR). The results show that the area error technique produces different fault signatures with low correlation for all the examined component faults. A brief evaluation of the two fault signature generation techniques is presented and the performance of the area error method is documented using the fault classification index (FCI) presented in Part I of the series. The final part of this work reports the application of the proposed approach for classification of an emulated fault transient in data from the prototype Pebble Bed Micro Model (PBMM) plant. Reference data values are calculated for the plant via a thermo-hydraulic simulation model of the MPS. The results show that the correspondence between the fault signatures, generated via experimental plant data and simulated reference values, are generally good. The work presented in the two part series, related to the classification of component faults in the MPS of different

  11. Exploratory graph analysis: A new approach for estimating the number of dimensions in psychological research

    NARCIS (Netherlands)

    Golino, H.F.; Epskamp, S.

    2017-01-01

    The estimation of the correct number of dimensions is a long-standing problem in psychometrics. Several methods have been proposed, such as parallel analysis (PA), Kaiser-Guttman’s eigenvalue-greater-than-one rule, multiple average partial procedure (MAP), the maximum-likelihood approaches that use

  12. Cooperation or Localization in European Capacity Markets? A Coalitional Game over Graph Approach

    Directory of Open Access Journals (Sweden)

    Giorgos Stamtsis

    2018-06-01

    Full Text Available Capacity markets, as a means to address the capacity adequacy issue, are constantly becoming an important part of the European internal electricity market. The debate focuses on how the capacity markets will be smoothly integrated in one Pan-European power market, without resulting in multiple national fragmentations and consequently in economic efficiency losses. Cross-border participation and regional cooperation are considered as two sine qua non conditions in this respect. The present paper provides a coalitional game theoretical approach aiming to facilitate the cooperation of neighboring countries, when it comes to the security of electricity supply and the necessity of establishing a capacity market. Such an approach can support respective decisions about capacity markets cooperation as well as stress-test the benefits considering all cooperation possibilities.

  13. Analysis of the Usage of Magnetic Force-directed Approach and Visual Techniques for Interactive Context-based Drawing of Multi-attributed Graphs

    Directory of Open Access Journals (Sweden)

    Zabiniako Vitaly

    2014-12-01

    Full Text Available In this article, the authors perform an analysis in order to assess adaptation of magnetic force-directed algorithms for context-based information extraction from multi-attributed graphs during visualization sessions. Theoretic standings behind magnetic force-directed approach are stated together with review on how particular features of respective algorithms in combination with appropriate visual techniques are especially suitable for improved processing and presenting of knowledge that is captured in form of graphs. The complexity of retrieving multi-attributed information within the proposed approach is handled with dedicated tools, such as selective attraction of nodes to MFE (Magnetic Force Emitter based on search criteria, localization of POI (Point of Interest regions, graph node anchoring, etc. Implicit compatibility of aforementioned tools with interactive nature of data exploration is distinguished. Description of case study, based on bibliometric network analysis is given, which is followed by the review of existing related works in this field. Conclusions are made and further studies in the field of visualization of multi-attributed graphs are defined.

  14. Bounds for percolation thresholds on directed and undirected graphs

    Science.gov (United States)

    Hamilton, Kathleen; Pryadko, Leonid

    2015-03-01

    Percolation theory is an efficient approach to problems with strong disorder, e.g., in quantum or classical transport, composite materials, and diluted magnets. Recently, the growing role of big data in scientific and industrial applications has led to a renewed interest in graph theory as a tool for describing complex connections in various kinds of networks: social, biological, technological, etc. In particular, percolation on graphs has been used to describe internet stability, spread of contagious diseases and computer viruses; related models describe market crashes and viral spread in social networks. We consider site-dependent percolation on directed and undirected graphs, and present several exact bounds for location of the percolation transition in terms of the eigenvalues of matrices associated with graphs, including the adjacency matrix and the Hashimoto matrix used to enumerate non-backtracking walks. These bounds correspond t0 a mean field approximation and become asymptotically exact for graphs with no short cycles. We illustrate this convergence numerically by simulating percolation on several families of graphs with different cycle lengths. This research was supported in part by the NSF Grant PHY-1416578 and by the ARO Grant W911NF-11-1-0027.

  15. Quantum field theory approaches to meson structure

    International Nuclear Information System (INIS)

    Branz, Tanja

    2011-01-01

    Meson spectroscopy became one of the most interesting topics in particle physics in the last ten years. In particular, the discovery of new unexpected states in the charmonium spectrum which cannot be simply explained by the constituent quark model attracted the interest of many theoretical efforts. In the present thesis we discuss different meson structures ranging from light and heavy quark-antiquark states to bound states of hadrons-hadronic molecules. Here we consider the light scalar mesons f 0 (980) and a 0 (980) and the charmonium-like Y(3940), Y(4140) and Z ± (4430) states. In the discussion of the meson properties like mass spectrum, total and partial decay widths and production rates we introduce three different theoretical methods for the treatment and description of hadronic structure. For the study of bound states of mesons we apply a coupled channel approach which allows for the dynamical generation of meson-meson resonances. The decay properties of meson molecules are further on studied within a second model based on effective Lagrangians describing the interaction of the bound state and its constituents. Besides hadronic molecules the effective Lagrangian approach is also used to study the radiative and strong decay properties of ordinary quark-antiquark (q anti q) states. The AdS/QCD model forms the completion of the three theoretical methods introduced in the present thesis. This holographic model provides a completely different ansatz and is based on extra dimensions and string theory. Within this framework we calculate the mass spectrum of light and heavy mesons and their decay constants.

  16. Does Guiding Toward Task-Relevant Information Help Improve Graph Processing and Graph Comprehension of Individuals with Low or High Numeracy? An Eye-Tracker Experiment.

    Science.gov (United States)

    Keller, Carmen; Junghans, Alex

    2017-11-01

    Individuals with low numeracy have difficulties with understanding complex graphs. Combining the information-processing approach to numeracy with graph comprehension and information-reduction theories, we examined whether high numerates' better comprehension might be explained by their closer attention to task-relevant graphical elements, from which they would expect numerical information to understand the graph. Furthermore, we investigated whether participants could be trained in improving their attention to task-relevant information and graph comprehension. In an eye-tracker experiment ( N = 110) involving a sample from the general population, we presented participants with 2 hypothetical scenarios (stomach cancer, leukemia) showing survival curves for 2 treatments. In the training condition, participants received written instructions on how to read the graph. In the control condition, participants received another text. We tracked participants' eye movements while they answered 9 knowledge questions. The sum constituted graph comprehension. We analyzed visual attention to task-relevant graphical elements by using relative fixation durations and relative fixation counts. The mediation analysis revealed a significant ( P attention to task-relevant information, which did not differ between the 2 conditions. Training had a significant main effect on visual attention ( P attention to task-relevant graphical elements than individuals with low numeracy. With appropriate instructions, both groups can be trained to improve their graph-processing efficiency. Future research should examine (e.g., motivational) mediators between visual attention and graph comprehension to develop appropriate instructions that also result in higher graph comprehension.

  17. Boolean Approach to Dichotomic Quantum Measurement Theories

    Energy Technology Data Exchange (ETDEWEB)

    Nagata, K. [Korea Advanced Institute of Science and Technology, Daejeon (Korea, Republic of); Nakamura, T. [Keio University, Yokohama (Japan); Batle, J. [Universitat de les Illes Balears, Balearic Islands (Spain); Abdalla, S. [King Abdulaziz University Jeddah, Jeddah (Saudi Arabia); Farouk, A. [Al-Zahra College for Women, Muscat (Egypt)

    2017-02-15

    Recently, a new measurement theory based on truth values was proposed by Nagata and Nakamura [Int. J. Theor. Phys. 55, 3616 (2016)], that is, a theory where the results of measurements are either 0 or 1. The standard measurement theory accepts a hidden variable model for a single Pauli observable. Hence, we can introduce a classical probability space for the measurement theory in this particular case. Additionally, we discuss in the present contribution the fact that projective measurement theories (the results of which are either +1 or −1) imply the Bell, Kochen, and Specker (BKS) paradox for a single Pauli observable. To justify our assertion, we present the BKS theorem in almost all the two-dimensional states by using a projective measurement theory. As an example, we present the BKS theorem in two-dimensions with white noise. Our discussion provides new insight into the quantum measurement problem by using this measurement theory based on the truth values.

  18. Effective field theory approaches for tensor potentials

    Energy Technology Data Exchange (ETDEWEB)

    Jansen, Maximilian

    2016-11-14

    Effective field theories are a widely used tool to study physical systems at low energies. We apply them to systematically analyze two and three particles interacting via tensor potentials. Two examples are addressed: pion interactions for anti D{sup 0}D{sup *0} scattering to dynamically generate the X(3872) and dipole interactions for two and three bosons at low energies. For the former, the one-pion exchange and for the latter, the long-range dipole force induce a tensor-like structure of the potential. We apply perturbative as well as non-perturbative methods to determine low-energy observables. The X(3872) is of major interest in modern high-energy physics. Its exotic characteristics require approaches outside the range of the quark model for baryons and mesons. Effective field theories represent such methods and provide access to its peculiar nature. We interpret the X(3872) as a hadronic molecule consisting of neutral D and D{sup *} mesons. It is possible to apply an effective field theory with perturbative pions. Within this framework, we address chiral as well as finite volume extrapolations for low-energy observables, such as the binding energy and the scattering length. We show that the two-point correlation function for the D{sup *0} meson has to be resummed to cure infrared divergences. Moreover, next-to-leading order coupling constants, which were introduced by power counting arguments, appear to be essential to renormalize the scattering amplitude. The binding energy as well as the scattering length display a moderate dependence on the light quark masses. The X(3872) is most likely deeper bound for large light quark masses. In a finite volume on the other hand, the binding energy significantly increases. The dependence on the light quark masses and the volume size can be simultaneously obtained. For bosonic dipoles we apply a non-perturbative, numerical approach. We solve the Lippmann-Schwinger equation for the two-dipole system and the Faddeev

  19. Discrete Morse functions for graph configuration spaces

    International Nuclear Information System (INIS)

    Sawicki, A

    2012-01-01

    We present an alternative application of discrete Morse theory for two-particle graph configuration spaces. In contrast to previous constructions, which are based on discrete Morse vector fields, our approach is through Morse functions, which have a nice physical interpretation as two-body potentials constructed from one-body potentials. We also give a brief introduction to discrete Morse theory. Our motivation comes from the problem of quantum statistics for particles on networks, for which generalized versions of anyon statistics can appear. (paper)

  20. KnowLife: a versatile approach for constructing a large knowledge graph for biomedical sciences.

    Science.gov (United States)

    Ernst, Patrick; Siu, Amy; Weikum, Gerhard

    2015-05-14

    Biomedical knowledge bases (KB's) have become important assets in life sciences. Prior work on KB construction has three major limitations. First, most biomedical KBs are manually built and curated, and cannot keep up with the rate at which new findings are published. Second, for automatic information extraction (IE), the text genre of choice has been scientific publications, neglecting sources like health portals and online communities. Third, most prior work on IE has focused on the molecular level or chemogenomics only, like protein-protein interactions or gene-drug relationships, or solely address highly specific topics such as drug effects. We address these three limitations by a versatile and scalable approach to automatic KB construction. Using a small number of seed facts for distant supervision of pattern-based extraction, we harvest a huge number of facts in an automated manner without requiring any explicit training. We extend previous techniques for pattern-based IE with confidence statistics, and we combine this recall-oriented stage with logical reasoning for consistency constraint checking to achieve high precision. To our knowledge, this is the first method that uses consistency checking for biomedical relations. Our approach can be easily extended to incorporate additional relations and constraints. We ran extensive experiments not only for scientific publications, but also for encyclopedic health portals and online communities, creating different KB's based on different configurations. We assess the size and quality of each KB, in terms of number of facts and precision. The best configured KB, KnowLife, contains more than 500,000 facts at a precision of 93% for 13 relations covering genes, organs, diseases, symptoms, treatments, as well as environmental and lifestyle risk factors. KnowLife is a large knowledge base for health and life sciences, automatically constructed from different Web sources. As a unique feature, KnowLife is harvested from

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

    Science.gov (United States)

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

    2016-06-28

    The human brain exhibits marked hemispheric differences, though it is not fully understood to what extent lateralization of the epileptic focus is relevant. Preoperative [(18)F]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 [(18)F]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 [(18)F]FDG-PET offers an important additional modality to explore brain networks.

  2. LHCb Software and Conditions Database Cross-Compatibility Tracking System: a Graph-Theory Approach

    CERN Document Server

    Cattaneo, M; Shapoval, I

    2012-01-01

    The Conditions Database (CondDB) of the LHCb experiment provides versioned, time dependent geometry and conditions data or all LHCb data processing applications (simulation, high level trigger, reconstruction, analysis). The evolution of CondDB and of the LHCb applications is a weakly-homomorphic process. It means that compatibility between a CondDB state and LHCb application state may not be preserved across different database and application generations. More over, a CondDB state by itself belongs to a complex three-dimensional phase space which evolves according to certain CondDB self-compatibility criteria, so it is sometimes difficult even to determine a self-consistent CondDB state. These compatibility issues may lead to various kinds of problems in the LHCb production, varying from unexpected application crashes to incorrect data processing results. Thus, there is a need for defining a well-established set of compatibility criteria between mentioned above entities, together with developing a compatibil...

  3. LHCb: LHCb Software and Conditions Database Cross-Compatibility Tracking: a Graph-Theory Approach

    CERN Multimedia

    Cattaneo, M; Shapoval, I

    2012-01-01

    The Conditions Database (CondDB) of the LHCb experiment provides versioned, time dependent geometry and conditions data or all LHCb data processing applications (simulation, high level trigger, reconstruction, analysis). The evolution of CondDB and of the LHCb applications is a weakly-homomorphic process. It means that compatibility between a CondDB state and LHCb application state may not be preserved across different database and application generations. More over, a CondDB state by itself belongs to a complex three-dimensional phase space which evolves according to certain CondDB self-compatibility criteria, so it is sometimes difficult even to determine a self-consistent CondDB state. These compatibility issues may lead to various kinds of problems in the LHCb production, varying from unexpected application crashes to incorrect data processing results. Thus, there is a need for defining a well-established set of compatibility criteria between mentioned above entities, together with developing a compatibil...

  4. A Novel Relevance Feedback Approach Based on Similarity Measure Modification in an X-Ray Image Retrieval System Based on Fuzzy Representation Using Fuzzy Attributed Relational Graph

    Directory of Open Access Journals (Sweden)

    Hossien Pourghassem

    2011-04-01

    Full Text Available Relevance feedback approaches is used to improve the performance of content-based image retrieval systems. In this paper, a novel relevance feedback approach based on similarity measure modification in an X-ray image retrieval system based on fuzzy representation using fuzzy attributed relational graph (FARG is presented. In this approach, optimum weight of each feature in feature vector is calculated using similarity rate between query image and relevant and irrelevant images in user feedback. The calculated weight is used to tune fuzzy graph matching algorithm as a modifier parameter in similarity measure. The standard deviation of the retrieved image features is applied to calculate the optimum weight. The proposed image retrieval system uses a FARG for representation of images, a fuzzy matching graph algorithm as similarity measure and a semantic classifier based on merging scheme for determination of the search space in image database. To evaluate relevance feedback approach in the proposed system, a standard X-ray image database consisting of 10000 images in 57 classes is used. The improvement of the evaluation parameters shows proficiency and efficiency of the proposed system.

  5. Graph theoretical model of a sensorimotor connectome in zebrafish.

    Science.gov (United States)

    Stobb, Michael; Peterson, Joshua M; Mazzag, Borbala; Gahtan, Ethan

    2012-01-01

    Mapping the detailed connectivity patterns (connectomes) of neural circuits is a central goal of neuroscience. The best quantitative approach to analyzing connectome data is still unclear but graph theory has been used with success. We present a graph theoretical model of the posterior lateral line sensorimotor pathway in zebrafish. The model includes 2,616 neurons and 167,114 synaptic connections. Model neurons represent known cell types in zebrafish larvae, and connections were set stochastically following rules based on biological literature. Thus, our model is a uniquely detailed computational representation of a vertebrate connectome. The connectome has low overall connection density, with 2.45% of all possible connections, a value within the physiological range. We used graph theoretical tools to compare the zebrafish connectome graph to small-world, random and structured random graphs of the same size. For each type of graph, 100 randomly generated instantiations were considered. Degree distribution (the number of connections per neuron) varied more in the zebrafish graph than in same size graphs with less biological detail. There was high local clustering and a short average path length between nodes, implying a small-world structure similar to other neural connectomes and complex networks. The graph was found not to be scale-free, in agreement with some other neural connectomes. An experimental lesion was performed that targeted three model brain neurons, including the Mauthner neuron, known to control fast escape turns. The lesion decreased the number of short paths between sensory and motor neurons analogous to the behavioral effects of the same lesion in zebrafish. This model is expandable and can be used to organize and interpret a growing database of information on the zebrafish connectome.

  6. Graph theoretical model of a sensorimotor connectome in zebrafish.

    Directory of Open Access Journals (Sweden)

    Michael Stobb

    Full Text Available Mapping the detailed connectivity patterns (connectomes of neural circuits is a central goal of neuroscience. The best quantitative approach to analyzing connectome data is still unclear but graph theory has been used with success. We present a graph theoretical model of the posterior lateral line sensorimotor pathway in zebrafish. The model includes 2,616 neurons and 167,114 synaptic connections. Model neurons represent known cell types in zebrafish larvae, and connections were set stochastically following rules based on biological literature. Thus, our model is a uniquely detailed computational representation of a vertebrate connectome. The connectome has low overall connection density, with 2.45% of all possible connections, a value within the physiological range. We used graph theoretical tools to compare the zebrafish connectome graph to small-world, random and structured random graphs of the same size. For each type of graph, 100 randomly generated instantiations were considered. Degree distribution (the number of connections per neuron varied more in the zebrafish graph than in same size graphs with less biological detail. There was high local clustering and a short average path length between nodes, implying a small-world structure similar to other neural connectomes and complex networks. The graph was found not to be scale-free, in agreement with some other neural connectomes. An experimental lesion was performed that targeted three model brain neurons, including the Mauthner neuron, known to control fast escape turns. The lesion decreased the number of short paths between sensory and motor neurons analogous to the behavioral effects of the same lesion in zebrafish. This model is expandable and can be used to organize and interpret a growing database of information on the zebrafish connectome.

  7. Bell inequalities for graph states

    International Nuclear Information System (INIS)

    Toth, G.; Hyllus, P.; Briegel, H.J.; Guehne, O.

    2005-01-01

    Full text: In the last years graph states have attracted an increasing interest in the field of quantum information theory. Graph states form a family of multi-qubit states which comprises many popular states such as the GHZ states and the cluster states. They also play an important role in applications. For instance, measurement based quantum computation uses graph states as resources. From a theoretical point of view, it is remarkable that graph states allow for a simple description in terms of stabilizing operators. In this contribution, we investigate the non-local properties of graph states. We derive a family of Bell inequalities which require three measurement settings for each party and are maximally violated by graph states. In turn, any graph state violates at least one of the inequalities. We show that for certain types of graph states the violation of these inequalities increases exponentially with the number of qubits. We also discuss connections to other entanglement properties such as the positively of the partial transpose or the geometric measure of entanglement. (author)

  8. Community detection by graph Voronoi diagrams

    Science.gov (United States)

    Deritei, Dávid; Lázár, Zsolt I.; Papp, István; Járai-Szabó, Ferenc; Sumi, Róbert; Varga, Levente; Ravasz Regan, Erzsébet; Ercsey-Ravasz, Mária

    2014-06-01

    Accurate and efficient community detection in networks is a key challenge for complex network theory and its applications. The problem is analogous to cluster analysis in data mining, a field rich in metric space-based methods. Common to these methods is a geometric, distance-based definition of clusters or communities. Here we propose a new geometric approach to graph community detection based on graph Voronoi diagrams. Our method serves as proof of principle that the definition of appropriate distance metrics on graphs can bring a rich set of metric space-based clustering methods to network science. We employ a simple edge metric that reflects the intra- or inter-community character of edges, and a graph density-based rule to identify seed nodes of Voronoi cells. Our algorithm outperforms most network community detection methods applicable to large networks on benchmark as well as real-world networks. In addition to offering a computationally efficient alternative for community detection, our method opens new avenues for adapting a wide range of data mining algorithms to complex networks from the class of centroid- and density-based clustering methods.

  9. Graphs with Eulerian unit spheres

    OpenAIRE

    Knill, Oliver

    2015-01-01

    d-spheres in graph theory are inductively defined as graphs for which all unit spheres S(x) are (d-1)-spheres and that the removal of one vertex renders the graph contractible. Eulerian d-spheres are geometric d-spheres which are d+1 colorable. We prove here that G is an Eulerian sphere if and only if the degrees of all the (d-2)-dimensional sub-simplices in G are even. This generalizes a Kempe-Heawood result for d=2 and is work related to the conjecture that all d-spheres have chromatic numb...

  10. Modern approach to relativity theory (radar formulation)

    International Nuclear Information System (INIS)

    Strel'tsov, V.N.

    1991-01-01

    The main peculiarities of the radar formulation of the relativity theory are presented. This formulation operates with the retarded (light) distances and relativistic or radar length introduced on their basis. 21 refs.; 1 tab

  11. Proving relations between modular graph functions

    International Nuclear Information System (INIS)

    Basu, Anirban

    2016-01-01

    We consider modular graph functions that arise in the low energy expansion of the four graviton amplitude in type II string theory. The vertices of these graphs are the positions of insertions of vertex operators on the toroidal worldsheet, while the links are the scalar Green functions connecting the vertices. Graphs with four and five links satisfy several non-trivial relations, which have been proved recently. We prove these relations by using elementary properties of Green functions and the details of the graphs. We also prove a relation between modular graph functions with six links. (paper)

  12. Theoretical and expert system approach to photoionization theories

    Directory of Open Access Journals (Sweden)

    Petrović Ivan D.

    2016-01-01

    Full Text Available The influence of the ponderomotive and the Stark shifts on the tunneling transition rate was observed, for non-relativistic linearly polarized laser field for alkali atoms, with three different theoretical models, the Keldysh theory, the Perelomov, Popov, Terent'ev (PPT theory, and the Ammosov, Delone, Krainov (ADK theory. We showed that aforementioned shifts affect the transition rate differently for different approaches. Finally, we presented a simple expert system for analysis of photoionization theories.

  13. Nonperturbative approach to quantum field theories: phase transitions and confinement

    International Nuclear Information System (INIS)

    Yankielowicz, S.

    1976-08-01

    Lectures are given on a nonperturbative approach to quantum field theories. Phenomena are discussed for which the usual weak coupling perturbative approach in terms of Feynman diagrams is of no assistance. Properties associated with large distance behavior, i.e., phase transitions, low lying spectra, coherent excitations which are presumably built out of the long wave structure of the theory are described. These methods are important for the study of strong coupling field theories and the question of quarks confinement. 25 references

  14. Bond graph modeling of centrifugal compression systems

    OpenAIRE

    Uddin, Nur; Gravdahl, Jan Tommy

    2015-01-01

    A novel approach to model unsteady fluid dynamics in a compressor network by using a bond graph is presented. The model is intended in particular for compressor control system development. First, we develop a bond graph model of a single compression system. Bond graph modeling offers a different perspective to previous work by modeling the compression system based on energy flow instead of fluid dynamics. Analyzing the bond graph model explains the energy flow during compressor surge. Two pri...

  15. Bipartite Graphs as Models of Population Structures in Evolutionary Multiplayer Games

    Science.gov (United States)

    Peña, Jorge; Rochat, Yannick

    2012-01-01

    By combining evolutionary game theory and graph theory, “games on graphs” study the evolutionary dynamics of frequency-dependent selection in population structures modeled as geographical or social networks. Networks are usually represented by means of unipartite graphs, and social interactions by two-person games such as the famous prisoner’s dilemma. Unipartite graphs have also been used for modeling interactions going beyond pairwise interactions. In this paper, we argue that bipartite graphs are a better alternative to unipartite graphs for describing population structures in evolutionary multiplayer games. To illustrate this point, we make use of bipartite graphs to investigate, by means of computer simulations, the evolution of cooperation under the conventional and the distributed N-person prisoner’s dilemma. We show that several implicit assumptions arising from the standard approach based on unipartite graphs (such as the definition of replacement neighborhoods, the intertwining of individual and group diversity, and the large overlap of interaction neighborhoods) can have a large impact on the resulting evolutionary dynamics. Our work provides a clear example of the importance of construction procedures in games on graphs, of the suitability of bigraphs and hypergraphs for computational modeling, and of the importance of concepts from social network analysis such as centrality, centralization and bipartite clustering for the understanding of dynamical processes occurring on networked population structures. PMID:22970237

  16. Lattice gauge theory approach to quantum chromodynamics

    International Nuclear Information System (INIS)

    Kogut, J.B.

    1983-01-01

    The author reviews in a pedagogical fashion some of the recent developments in lattice quantum chromodynamics. This review emphasizes explicit examples and illustrations rather than general proofs and analyses. It begins with a discussion of the heavy-quark potential in continuum quantum chromodynamics. Asymptotic freedom and renormalization-group improved perturbation theory are discussed. A simple dielectric model of confinement is considered as an intuitive guide to the vacuum of non-Abelian gauge theories. Next, the Euclidean form of lattice gauge theory is introduced, and an assortment of calculational methods are reviewed. These include high-temperature expansions, duality, Monte Carlo computer simulations, and weak coupling expansions. A #betta#-parameter calculation for asymptotically free-spin models is presented. The Hamiltonian formulation of lattice gauge theory is presented and is illustrated in the context of flux tube dynamics. Roughening transitions, Casimir forces, and the restoration of rotational symmetry are discussed. Mechanisms of confinement in lattice theories are illustrated in the two-dimensional electrodynamics of the planar model and the U(1) gauge theory in four dimensions. Generalized actions for SU(2) gauge theories and the relevance of monopoles and strings to crossover phenomena are considered. A brief discussion of the continuity of fields and topologial charge in asymptotically free lattice models is presented. The final major topic of this review concerns lattice fermions. The species doubling problem and its relation to chiral symmetry are illustrated. Staggered Euclidean fermion methods are discussed in detail, with an emphasis on species counting, remnants of chiral symmetry, Block spin variables, and the axial anomaly. Numerical methods for including fermions in computer simulations are considered. Jacobi and Gauss-Siedel inversion methods to obtain the fermion propagator in a background gauge field are reviewed

  17. Alternative approaches to maximally supersymmetric field theories

    International Nuclear Information System (INIS)

    Broedel, Johannes

    2010-01-01

    The central objective of this work is the exploration and application of alternative possibilities to describe maximally supersymmetric field theories in four dimensions: N=4 super Yang-Mills theory and N=8 supergravity. While twistor string theory has been proven very useful in the context of N=4 SYM, no analogous formulation for N=8 supergravity is available. In addition to the part describing N=4 SYM theory, twistor string theory contains vertex operators corresponding to the states of N=4 conformal supergravity. Those vertex operators have to be altered in order to describe (non-conformal) Einstein supergravity. A modified version of the known open twistor string theory, including a term which breaks the conformal symmetry for the gravitational vertex operators, has been proposed recently. In a first part of the thesis structural aspects and consistency of the modified theory are discussed. Unfortunately, the majority of amplitudes can not be constructed, which can be traced back to the fact that the dimension of the moduli space of algebraic curves in twistor space is reduced in an inconsistent manner. The issue of a possible finiteness of N=8 supergravity is closely related to the question of the existence of valid counterterms in the perturbation expansion of the theory. In particular, the coefficient in front of the so-called R 4 counterterm candidate has been shown to vanish by explicit calculation. This behavior points into the direction of a symmetry not taken into account, for which the hidden on-shell E 7(7) symmetry is the prime candidate. The validity of the so-called double-soft scalar limit relation is a necessary condition for a theory exhibiting E 7(7) symmetry. By calculating the double-soft scalar limit for amplitudes derived from an N=8 supergravity action modified by an additional R 4 counterterm, one can test for possible constraints originating in the E 7(7) symmetry. In a second part of the thesis, the appropriate amplitudes are calculated

  18. Fixation Time for Evolutionary Graphs

    Science.gov (United States)

    Nie, Pu-Yan; Zhang, Pei-Ai

    Evolutionary graph theory (EGT) is recently proposed by Lieberman et al. in 2005. EGT is successful for explaining biological evolution and some social phenomena. It is extremely important to consider the time of fixation for EGT in many practical problems, including evolutionary theory and the evolution of cooperation. This study characterizes the time to asymptotically reach fixation.

  19. Item response theory - A first approach

    Science.gov (United States)

    Nunes, Sandra; Oliveira, Teresa; Oliveira, Amílcar

    2017-07-01

    The Item Response Theory (IRT) has become one of the most popular scoring frameworks for measurement data, frequently used in computerized adaptive testing, cognitively diagnostic assessment and test equating. According to Andrade et al. (2000), IRT can be defined as a set of mathematical models (Item Response Models - IRM) constructed to represent the probability of an individual giving the right answer to an item of a particular test. The number of Item Responsible Models available to measurement analysis has increased considerably in the last fifteen years due to increasing computer power and due to a demand for accuracy and more meaningful inferences grounded in complex data. The developments in modeling with Item Response Theory were related with developments in estimation theory, most remarkably Bayesian estimation with Markov chain Monte Carlo algorithms (Patz & Junker, 1999). The popularity of Item Response Theory has also implied numerous overviews in books and journals, and many connections between IRT and other statistical estimation procedures, such as factor analysis and structural equation modeling, have been made repeatedly (Van der Lindem & Hambleton, 1997). As stated before the Item Response Theory covers a variety of measurement models, ranging from basic one-dimensional models for dichotomously and polytomously scored items and their multidimensional analogues to models that incorporate information about cognitive sub-processes which influence the overall item response process. The aim of this work is to introduce the main concepts associated with one-dimensional models of Item Response Theory, to specify the logistic models with one, two and three parameters, to discuss some properties of these models and to present the main estimation procedures.

  20. Coexistence of graph-oriented and relational data file organisations in a data bank system

    International Nuclear Information System (INIS)

    Engel, K.D.

    1980-01-01

    It is shown that a coexistence of hierarchical and relational data bank structures in computer networks in a common data bank system is possible. This coexistence model, first established by NIJSSEN, regards the graph theory CODASYL approach and CODD's relational model as graph-oriented, or rather table-oriented, data file organisation as presented to the user of a common logical structure of the data bank. (WB) [de

  1. Field theory a path integral approach

    CERN Document Server

    Das, Ashok

    2006-01-01

    This unique book describes quantum field theory completely within the context of path integrals. With its utility in a variety of fields in physics, the subject matter is primarily developed within the context of quantum mechanics before going into specialized areas.Adding new material keenly requested by readers, this second edition is an important expansion of the popular first edition. Two extra chapters cover path integral quantization of gauge theories and anomalies, and a new section extends the supersymmetry chapter, where singular potentials in supersymmetric systems are described.

  2. Dobrushin's approach to queueing network theory

    Directory of Open Access Journals (Sweden)

    F. I. Karpelevich

    1996-01-01

    Full Text Available R.L. Dobrushin (1929-1995 made substantial contributions to Queueing Network Theory (QNT. A review of results from QNT which arose from his ideas or were connected to him in other ways is given. We also comment on various related open problems.

  3. Resource competition: a bifurcation theory approach.

    NARCIS (Netherlands)

    Kooi, B.W.; Dutta, P.S.; Feudel, U.

    2013-01-01

    We develop a framework for analysing the outcome of resource competition based on bifurcation theory. We elaborate our methodology by readdressing the problem of competition of two species for two resources in a chemostat environment. In the case of perfect-essential resources it has been

  4. Constructing New Theory for Identifying Students with Emotional Disturbance: A Constructivist Approach to Grounded Theory

    OpenAIRE

    Dori Barnett

    2012-01-01

    A grounded theory study that examined how practitioners in a county alternative and correctional education setting identify youth with emotional and behavioral difficulties for special education services provides an exemplar for a constructivist approach to grounded theory methodology. Discussion focuses on how a constructivist orientation to grounded theory methodology informed research decisions, shaped the development of the emergent grounded theory, and prompted a way of thinking about da...

  5. Frog: Asynchronous Graph Processing on GPU with Hybrid Coloring Model

    Energy Technology Data Exchange (ETDEWEB)

    Shi, Xuanhua; Luo, Xuan; Liang, Junling; Zhao, Peng; Di, Sheng; He, Bingsheng; Jin, Hai

    2018-01-01

    GPUs have been increasingly used to accelerate graph processing for complicated computational problems regarding graph theory. Many parallel graph algorithms adopt the asynchronous computing model to accelerate the iterative convergence. Unfortunately, the consistent asynchronous computing requires locking or atomic operations, leading to significant penalties/overheads when implemented on GPUs. As such, coloring algorithm is adopted to separate the vertices with potential updating conflicts, guaranteeing the consistency/correctness of the parallel processing. Common coloring algorithms, however, may suffer from low parallelism because of a large number of colors generally required for processing a large-scale graph with billions of vertices. We propose a light-weight asynchronous processing framework called Frog with a preprocessing/hybrid coloring model. The fundamental idea is based on Pareto principle (or 80-20 rule) about coloring algorithms as we observed through masses of realworld graph coloring cases. We find that a majority of vertices (about 80%) are colored with only a few colors, such that they can be read and updated in a very high degree of parallelism without violating the sequential consistency. Accordingly, our solution separates the processing of the vertices based on the distribution of colors. In this work, we mainly answer three questions: (1) how to partition the vertices in a sparse graph with maximized parallelism, (2) how to process large-scale graphs that cannot fit into GPU memory, and (3) how to reduce the overhead of data transfers on PCIe while processing each partition. We conduct experiments on real-world data (Amazon, DBLP, YouTube, RoadNet-CA, WikiTalk and Twitter) to evaluate our approach and make comparisons with well-known non-preprocessed (such as Totem, Medusa, MapGraph and Gunrock) and preprocessed (Cusha) approaches, by testing four classical algorithms (BFS, PageRank, SSSP and CC). On all the tested applications and

  6. Moment equation approach to neoclassical transport theory

    International Nuclear Information System (INIS)

    Hirshman, S.P.

    1978-01-01

    The neoclassical cross-field fluxes for a toroidally confined, axisymmetric plasma are calculated in terms of the thermodynamic forces from the fluid continuity and momentum balance equations. This macroscopic formulation of neoclassical transport theory unifies the numerous complex expressions for the transport coefficients, previously obtained by solving the Fokker--Planck equation, and elucidates their physical basis. In the large aspect ratio limit, the continuous transition in the scaling of the diffusion coefficient throughout various collisionality regimes is shown to depend on the ratio of parallel viscosity coefficients of the plasma species. Comparison of the present results with the kinetic theory expressions for the neoclassical fluxes determines the parallel viscosity coefficients for a multispecies plasma in the long-mean-free-path regime

  7. An Activity Theory Approach to Affordance

    DEFF Research Database (Denmark)

    Bærentsen, Klaus B.; Trettvik, Johan

    2002-01-01

    We present an analysis of the concept of affordance as it was originally introduced by J. J. Gibson, and elaborate on this concept, acknowledging, that the general theoretical landscape in psychology is in fundamental ways different from the situation in which Gibson found himself when he crafted...... the notion. Specifically we will suggest the inclusion of the ecological theory of perception in the paradigm of cultural historical psychology and activity theory developed in the former Soviet Union by most notably Lev Vygotsky, S. L. Rubinshtein, A. N. Leontjev and others. It will be suggested, that much...... of the confusion in HCI concerning the concept of affordance is a consequence of the attempt of using it inside a theoretical paradigm that is unable to capture and encompass one of the most essential aspect of Gibsons concept of affordance, that is its foundation in activity...

  8. Field theory approaches to new media practices

    DEFF Research Database (Denmark)

    Hartley, Jannie Møller; Willig, Ida; Waltorp, Karen

    2015-01-01

    In this article introducing the theme of the special issue we argue that studies of new media practices might benefit from especially Pierre Bourdieu’s research on cultural production. We introduce some of the literature, which deals with the use of digital media, and which have taken steps...... to develop field theory in this context. Secondly, we present the four thematic articles in this issue and the articles outside the theme, which includes two translations of classic texts within communication and media research. This introduction article concludes by encouraging media scholars to embark...... on more studies within a field theory framework, as the ability of the comprehensive theoretical work and the ideas of a reflexive sociology is able to trigger the good questions, more than it claims to offer a complete and self-sufficient sociology of media and inherent here also new media....

  9. FDI theories. A location-based approach

    Directory of Open Access Journals (Sweden)

    Popovici, Oana Cristina

    2014-09-01

    Full Text Available Given the importance of FDI for the economic growth of both home and host countries, the aim of this paper is to assess the importance granted to location advantages during the development of FDI theory. We start with the earliest theoretical directions as regards FDI location issues and extend our study to describing less debated theories, but of a particular importance for this theme. In this way, we have the opportunity to emphasize the changes in FDI location determinants. We find that a direction of the FDI theories’ expansion is due to the incorporation of new variables on location, although the location advantages are barely mentioned in the first explanations regarding the international activity of the firms.

  10. Information theory based approaches to cellular signaling.

    Science.gov (United States)

    Waltermann, Christian; Klipp, Edda

    2011-10-01

    Cells interact with their environment and they have to react adequately to internal and external changes such changes in nutrient composition, physical properties like temperature or osmolarity and other stresses. More specifically, they must be able to evaluate whether the external change is significant or just in the range of noise. Based on multiple external parameters they have to compute an optimal response. Cellular signaling pathways are considered as the major means of information perception and transmission in cells. Here, we review different attempts to quantify information processing on the level of individual cells. We refer to Shannon entropy, mutual information, and informal measures of signaling pathway cross-talk and specificity. Information theory in systems biology has been successfully applied to identification of optimal pathway structures, mutual information and entropy as system response in sensitivity analysis, and quantification of input and output information. While the study of information transmission within the framework of information theory in technical systems is an advanced field with high impact in engineering and telecommunication, its application to biological objects and processes is still restricted to specific fields such as neuroscience, structural and molecular biology. However, in systems biology dealing with a holistic understanding of biochemical systems and cellular signaling only recently a number of examples for the application of information theory have emerged. This article is part of a Special Issue entitled Systems Biology of Microorganisms. Copyright © 2011 Elsevier B.V. All rights reserved.

  11. The Harary index of a graph

    CERN Document Server

    Xu, Kexiang; Trinajstić, Nenad

    2015-01-01

    This is the first book to focus on the topological index, the Harary index, of a graph, including its mathematical properties, chemical applications and some related and attractive open problems. This book is dedicated to Professor Frank Harary (1921—2005), the grandmaster of graph theory and its applications. It has be written by experts in the field of graph theory and its applications. For a connected graph G, as an important distance-based topological index, the Harary index H(G) is defined as the sum of the reciprocals of the distance between any two unordered vertices of the graph G. In this book, the authors report on the newest results on the Harary index of a graph. These results mainly concern external graphs with respect to the Harary index; the relations to other topological indices; its properties and applications to pure graph theory and chemical graph theory; and two significant variants, i.e., additively and multiplicatively weighted Harary indices. In the last chapter, we present a number o...

  12. Pilot-wave approaches to quantum field theory

    Energy Technology Data Exchange (ETDEWEB)

    Struyve, Ward, E-mail: Ward.Struyve@fys.kuleuven.be [Institute of Theoretical Physics, K.U.Leuven, Celestijnenlaan 200D, B-3001 Leuven (Belgium); Institute of Philosophy, K.U.Leuven, Kardinaal Mercierplein 2, B-3000 Leuven (Belgium)

    2011-07-08

    The purpose of this paper is to present an overview of recent work on pilot-wave approaches to quantum field theory. In such approaches, systems are not only described by their wave function, as in standard quantum theory, but also by some additional variables. In the non-relativistic pilot-wave theory of deBroglie and Bohm those variables are particle positions. In the context of quantum field theory, there are two natural choices, namely particle positions and fields. The incorporation of those variables makes it possible to provide an objective description of nature in which rather ambiguous notions such as 'measurement' and 'observer' play no fundamental role. As such, the theory is free of the conceptual difficulties, such as the measurement problem, that plague standard quantum theory.

  13. Effective field theory: A modern approach to anomalous couplings

    International Nuclear Information System (INIS)

    Degrande, Céline; Greiner, Nicolas; Kilian, Wolfgang; Mattelaer, Olivier; Mebane, Harrison; Stelzer, Tim; Willenbrock, Scott; Zhang, Cen

    2013-01-01

    We advocate an effective field theory approach to anomalous couplings. The effective field theory approach is the natural way to extend the standard model such that the gauge symmetries are respected. It is general enough to capture any physics beyond the standard model, yet also provides guidance as to the most likely place to see the effects of new physics. The effective field theory approach also clarifies that one need not be concerned with the violation of unitarity in scattering processes at high energy. We apply these ideas to pair production of electroweak vector bosons. -- Highlights: •We discuss the advantages of effective field theories compared to anomalous couplings. •We show that one need not be concerned with unitarity violation at high energy. •We discuss the application of effective field theory to weak boson physics

  14. A new approach in nuclear risk theory

    International Nuclear Information System (INIS)

    Serbanescu, D.

    1994-01-01

    The basic problem of the probabilistic safety assessment (PSA) is the errors evaluation. The main contributor to the final PSA results is the systematical error induced by the method itself. There may be some alternatives to the PSA classical approaches. All the new more successful approaches in the PSA results validation are related to the modelling problem. A comparison between two possible approaches for a pressurized heavy water reactor (PHWR) leakage event tree is included: The new approach proposed in (Serbanescu, 1991); the approach used in (Serbanescu, 1992), based on some unexplored yet features of the existing PSA analyses. The results are presented in relative units and an algorithm which was already implemented on an IBM.PC computer (Serbanescu, 1991) is used as a tool to decisions making tool. The decision making process should be based on a nuclear power plant (NPP) between modelling from the risk analysis point of view. This is the main feature of the proposed approach. (author). 4 refs, 2 figs, 2 tabs

  15. Replica methods for loopy sparse random graphs

    International Nuclear Information System (INIS)

    Coolen, ACC

    2016-01-01

    I report on the development of a novel statistical mechanical formalism for the analysis of random graphs with many short loops, and processes on such graphs. The graphs are defined via maximum entropy ensembles, in which both the degrees (via hard constraints) and the adjacency matrix spectrum (via a soft constraint) are prescribed. The sum over graphs can be done analytically, using a replica formalism with complex replica dimensions. All known results for tree-like graphs are recovered in a suitable limit. For loopy graphs, the emerging theory has an appealing and intuitive structure, suggests how message passing algorithms should be adapted, and what is the structure of theories describing spin systems on loopy architectures. However, the formalism is still largely untested, and may require further adjustment and refinement. (paper)

  16. Concept maps and nursing theory: a pedagogical approach.

    Science.gov (United States)

    Hunter Revell, Susan M

    2012-01-01

    Faculty seek to teach nursing students how to link clinical and theoretical knowledge with the intent of improving patient outcomes. The author discusses an innovative 9-week concept mapping activity as a pedagogical approach to teach nursing theory in a graduate theory course. Weekly concept map building increased student engagement and fostered theoretical thinking. Unexpectedly, this activity also benefited students through group work and its ability to enhance theory-practice knowledge.

  17. Comprehensive Review on Divisible Load Theory: Concepts, Strategies, and Approaches

    Directory of Open Access Journals (Sweden)

    Shamsollah Ghanbari

    2014-01-01

    Full Text Available There is extensive literature concerning the divisible load theory. The divisible load theory is mainly applied for scheduling in the area of distributed computing. It is based on the fact that the load can be divided into some arbitrarily independent parts, in which each part can be processed independently by a processor. This paper reviews the literature concerning the divisible load theory, while focusing on the details of the basic concepts, approaches, strategies, typologies, and open problems.

  18. On characterizing terrain visibility graphs

    Directory of Open Access Journals (Sweden)

    William Evans

    2015-06-01

    Full Text Available A terrain is an $x$-monotone polygonal line in the $xy$-plane. Two vertices of a terrain are mutually visible if and only if there is no terrain vertex on or above the open line segment connecting them. A graph whose vertices represent terrain vertices and whose edges represent mutually visible pairs of terrain vertices is called a terrain visibility graph. We would like to find properties that are both necessary and sufficient for a graph to be a terrain visibility graph; that is, we would like to characterize terrain visibility graphs.Abello et al. [Discrete and Computational Geometry, 14(3:331--358, 1995] showed that all terrain visibility graphs are “persistent”. They showed that the visibility information of a terrain point set implies some ordering requirements on the slopes of the lines connecting pairs of points in any realization, and as a step towards showing sufficiency, they proved that for any persistent graph $M$ there is a total order on the slopes of the (pseudo lines in a generalized configuration of points whose visibility graph is $M$.We give a much simpler proof of this result by establishing an orientation to every triple of vertices, reflecting some slope ordering requirements that are consistent with $M$ being the visibility graph, and prove that these requirements form a partial order. We give a faster algorithm to construct a total order on the slopes. Our approach attempts to clarify the implications of the graph theoretic properties on the ordering of the slopes, and may be interpreted as defining properties on an underlying oriented matroid that we show is a restricted type of $3$-signotope.

  19. The n-th Power Signed Graphs-II

    OpenAIRE

    Reddyy, P. Siva Kota; Vijay, S.; Lokeshaz, V.

    2010-01-01

    For standard terminology and notion in graph theory we refer the reader to Harary [6]; the non-standard will be given in this paper as and when required. We treat only finite simple graphs without self loops and isolates.

  20. Elementary number theory an algebraic approach

    CERN Document Server

    Bolker, Ethan D

    2007-01-01

    This text uses the concepts usually taught in the first semester of a modern abstract algebra course to illuminate classical number theory: theorems on primitive roots, quadratic Diophantine equations, and the Fermat conjecture for exponents three and four. The text contains abundant numerical examples and a particularly helpful collection of exercises, many of which are small research problems requiring substantial study or outside reading. Some problems call for new proofs for theorems already covered or for inductive explorations and proofs of theorems found in later chapters.Ethan D. Bolke

  1. Workspace and sensorimotor theories : Complementary approaches to experience

    NARCIS (Netherlands)

    Degenaar, J.; Keijzer, F.

    A serious difficulty for theories of consciousness is to go beyond mere correlation between physical processes and experience. Currently, neural workspace and sensorimotor contingency theories are two of the most promising approaches to make any headway here. This paper explores the relation between

  2. Semiclassical and quantum-electrodynamical approaches in nonrelativistic radiation theory

    International Nuclear Information System (INIS)

    Milonni, P.W.

    1976-01-01

    Theoretical aspects of the interaction of atoms with the radiation field are reviewed with emphasis on those features of the interaction requiring field quantization. The approach is nonrelativistic, with special attention given to the theory of spontaneous emission. (Auth.)

  3. Integrated landscape approach : Closing the gap between theory and application

    NARCIS (Netherlands)

    Bürgi, Matthias; Ali, Panna; Chowdhury, Afroza; Heinimann, Andreas; Hett, Cornelia; Kienast, Felix; Mondal, Manoranjan Kumar; Upreti, Bishnu Raj; Verburg, Peter H.

    2017-01-01

    Recently, the integrated landscape approach has gained increasing interest of the scientific community, as well as of organizations active in the field of sustainable development. However, the enthusiastic welcome is challenged by little consensus on theory, terminology and definitions. Moreover,

  4. grounded theory approach in sermon analysis of sermons

    African Journals Online (AJOL)

    The grounded theory approach is implemented in analysing sermons on poverty and directed at ... poverty situation in South Africa, especially in the black community (Pieterse ..... The activity of open coding discovers gaps or holes of needed.

  5. A mass graph-based approach for the identification of modified proteoforms using top-down tandem mass spectra.

    Science.gov (United States)

    Kou, Qiang; Wu, Si; Tolic, Nikola; Paša-Tolic, Ljiljana; Liu, Yunlong; Liu, Xiaowen

    2017-05-01

    Although proteomics has rapidly developed in the past decade, researchers are still in the early stage of exploring the world of complex proteoforms, which are protein products with various primary structure alterations resulting from gene mutations, alternative splicing, post-translational modifications, and other biological processes. Proteoform identification is essential to mapping proteoforms to their biological functions as well as discovering novel proteoforms and new protein functions. Top-down mass spectrometry is the method of choice for identifying complex proteoforms because it provides a 'bird's eye view' of intact proteoforms. The combinatorial explosion of various alterations on a protein may result in billions of possible proteoforms, making proteoform identification a challenging computational problem. We propose a new data structure, called the mass graph, for efficient representation of proteoforms and design mass graph alignment algorithms. We developed TopMG, a mass graph-based software tool for proteoform identification by top-down mass spectrometry. Experiments on top-down mass spectrometry datasets showed that TopMG outperformed existing methods in identifying complex proteoforms. http://proteomics.informatics.iupui.edu/software/topmg/. xwliu@iupui.edu. Supplementary data are available at Bioinformatics online. © The Author 2016. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com

  6. DDR: Efficient computational method to predict drug–target interactions using graph mining and machine learning approaches

    KAUST Repository

    Olayan, Rawan S.

    2017-11-23

    Motivation Finding computationally drug-target interactions (DTIs) is a convenient strategy to identify new DTIs at low cost with reasonable accuracy. However, the current DTI prediction methods suffer the high false positive prediction rate. Results We developed DDR, a novel method that improves the DTI prediction accuracy. DDR is based on the use of a heterogeneous graph that contains known DTIs with multiple similarities between drugs and multiple similarities between target proteins. DDR applies non-linear similarity fusion method to combine different similarities. Before fusion, DDR performs a pre-processing step where a subset of similarities is selected in a heuristic process to obtain an optimized combination of similarities. Then, DDR applies a random forest model using different graph-based features extracted from the DTI heterogeneous graph. Using five repeats of 10-fold cross-validation, three testing setups, and the weighted average of area under the precision-recall curve (AUPR) scores, we show that DDR significantly reduces the AUPR score error relative to the next best start-of-the-art method for predicting DTIs by 34% when the drugs are new, by 23% when targets are new, and by 34% when the drugs and the targets are known but not all DTIs between them are not known. Using independent sources of evidence, we verify as correct 22 out of the top 25 DDR novel predictions. This suggests that DDR can be used as an efficient method to identify correct DTIs.

  7. Quick Mining of Isomorphic Exact Large Patterns from Large Graphs

    KAUST Repository

    Almasri, Islam

    2014-12-01

    The applications of the sub graph isomorphism search are growing with the growing number of areas that model their systems using graphs or networks. Specifically, many biological systems, such as protein interaction networks, molecular structures and protein contact maps, are modeled as graphs. The sub graph isomorphism search is concerned with finding all sub graphs that are isomorphic to a relevant query graph, the existence of such sub graphs can reflect on the characteristics of the modeled system. The most computationally expensive step in the search for isomorphic sub graphs is the backtracking algorithm that traverses the nodes of the target graph. In this paper, we propose a pruning approach that is inspired by the minimum remaining value heuristic that achieves greater scalability over large query and target graphs. Our testing on various biological networks shows that performance enhancement of our approach over existing state-of-the-art approaches varies between 6x and 53x. © 2014 IEEE.

  8. Quick Mining of Isomorphic Exact Large Patterns from Large Graphs

    KAUST Repository

    Almasri, Islam; Gao, Xin; Fedoroff, Nina V.

    2014-01-01

    The applications of the sub graph isomorphism search are growing with the growing number of areas that model their systems using graphs or networks. Specifically, many biological systems, such as protein interaction networks, molecular structures and protein contact maps, are modeled as graphs. The sub graph isomorphism search is concerned with finding all sub graphs that are isomorphic to a relevant query graph, the existence of such sub graphs can reflect on the characteristics of the modeled system. The most computationally expensive step in the search for isomorphic sub graphs is the backtracking algorithm that traverses the nodes of the target graph. In this paper, we propose a pruning approach that is inspired by the minimum remaining value heuristic that achieves greater scalability over large query and target graphs. Our testing on various biological networks shows that performance enhancement of our approach over existing state-of-the-art approaches varies between 6x and 53x. © 2014 IEEE.

  9. On path hypercompositions in graphs and automata

    Directory of Open Access Journals (Sweden)

    Massouros Christos G.

    2016-01-01

    Full Text Available The paths in graphs define hypercompositions in the set of their vertices and therefore it is feasible to associate hypercompositional structures to each graph. Similarly, the strings of letters from their alphabet, define hypercompositions in the automata, which in turn define the associated hypergroups to the automata. The study of the associated hypercompositional structures gives results in both, graphs and automata theory.

  10. Decision theory and choices a complexity approach

    CERN Document Server

    Kirman, Alan; Vinci, Concetto Paolo

    2010-01-01

    In economics agents are assumed to choose on the basis of rational calculations aimed at the maximization of their pleasure or profit. Formally, agents are said to manifest transitive and consistent preferences in attempting to maximize their utility in the presence of several constraints. They operate according to the choice imperative: given a set of alternatives, choose the best. This imperative works well in a static and simplistic framework, but it may fail or vary when 'the best' is changing continuously. This approach has been questioned by a descriptive approach that springing from the

  11. Variational Approach in the Theory of Liquid-Crystal State

    Science.gov (United States)

    Gevorkyan, E. V.

    2018-03-01

    The variational calculus by Leonhard Euler is the basis for modern mathematics and theoretical physics. The efficiency of variational approach in statistical theory of liquid-crystal state and in general case in condensed state theory is shown. The developed approach in particular allows us to introduce correctly effective pair interactions and optimize the simple models of liquid crystals with help of realistic intermolecular potentials.

  12. Activity System Theory Approach to Healthcare Information System

    OpenAIRE

    Bai, Guohua

    2004-01-01

    Healthcare information system is a very complex system and has to be approached from systematic perspectives. This paper presents an Activity System Theory (ATS) approach by integrating system thinking and social psychology. First part of the paper, the activity system theory is presented, especially a recursive model of human activity system is introduced. A project ‘Integrated Mobile Information System for Diabetic Healthcare (IMIS)’ is then used to demonstrate a practical application of th...

  13. Homology groups for particles on one-connected graphs

    Science.gov (United States)

    MaciÄ Żek, Tomasz; Sawicki, Adam

    2017-06-01

    We present a mathematical framework for describing the topology of configuration spaces for particles on one-connected graphs. In particular, we compute the homology groups over integers for different classes of one-connected graphs. Our approach is based on some fundamental combinatorial properties of the configuration spaces, Mayer-Vietoris sequences for different parts of configuration spaces, and some limited use of discrete Morse theory. As one of the results, we derive the closed-form formulae for ranks of the homology groups for indistinguishable particles on tree graphs. We also give a detailed discussion of the second homology group of the configuration space of both distinguishable and indistinguishable particles. Our motivation is the search for new kinds of quantum statistics.

  14. Sequential approach to Colombeau's theory of generalized functions

    International Nuclear Information System (INIS)

    Todorov, T.D.

    1987-07-01

    J.F. Colombeau's generalized functions are constructed as equivalence classes of the elements of a specially chosen ultrapower of the class of the C ∞ -functions. The elements of this ultrapower are considered as sequences of C ∞ -functions, so in a sense, the sequential construction presented here refers to the original Colombeau theory just as, for example, the Mikusinski sequential approach to the distribution theory refers to the original Schwartz theory of distributions. The paper could be used as an elementary introduction to the Colombeau theory in which recently a solution was found to the problem of multiplication of Schwartz distributions. (author). Refs

  15. Application de la théorie des graphes au traitement de la carte géologique Applying the Theory of Graphs to the Treatment of Geological Maps

    Directory of Open Access Journals (Sweden)

    Bouillé F.

    2006-11-01

    Full Text Available La saisie des informations d'une carte géologique par les méthodes classiques (grilles ou relevés aléatoires de courbes ne constitue pas une base de données opérationnelle. Par contre, l'assimilation des limites géologiques à un graphe orienté répond aux critères d'optimalité (encombrement très réduit, temps minimal, fiabilité, et permet une digitalisation rationnelle de la carte, une bonne structuration du fichier, et la réalisation d'applications intéressantes : restitutions graphiques sélectives à toutes échelles, calculs de pendages, surfaces, volumes, études de corrélation. Nous avons donc établi une chaîne de traitement de la carte géologique dont chaque maillon (saisie des informations; contrôle, mise à jour, consultation, application opère sur un ou plusieurs graphes. Obtaining data from geological maps by conventional methods (grids or random curve plotting is not an operational data base. However, the comparison of geological boundaries with a directional graph meets criteria of optimalness (very small bulk, minimum time, reliability and makes it possible to digitize the map rationally, to structure the file properly and to achieve significant applications such as selective graph plotting on all scales, calculating dips, areas and volumes, and making correlotion analyses. Therefore, we worked out a geological map processing sequence in which each element (data acquisition, checking, updating, consulting, applications operates on one or several graphs.

  16. A utility theory approach for insurance pricing

    Directory of Open Access Journals (Sweden)

    Mohsen Gharakhani

    2015-11-01

    Full Text Available Providing insurance contract with “deductible” is beneficial for both insurer and insured. In this paper, we provide a utility modeling approach to handle insurance pricing and evaluate the tradeoff between discount benefit and deductible level. We analyze four different pricing problems of no insurance, full insurance coverage, insurance with β% deductible and insurance with D-dollar deductible based on a given utility function. A numerical example is also used to illustrate some interesting results.

  17. Information Graph Flow: A Geometric Approximation of Quantum and Statistical Systems

    Science.gov (United States)

    Vanchurin, Vitaly

    2018-05-01

    Given a quantum (or statistical) system with a very large number of degrees of freedom and a preferred tensor product factorization of the Hilbert space (or of a space of distributions) we describe how it can be approximated with a very low-dimensional field theory with geometric degrees of freedom. The geometric approximation procedure consists of three steps. The first step is to construct weighted graphs (we call information graphs) with vertices representing subsystems (e.g., qubits or random variables) and edges representing mutual information (or the flow of information) between subsystems. The second step is to deform the adjacency matrices of the information graphs to that of a (locally) low-dimensional lattice using the graph flow equations introduced in the paper. (Note that the graph flow produces very sparse adjacency matrices and thus might also be used, for example, in machine learning or network science where the task of graph sparsification is of a central importance.) The third step is to define an emergent metric and to derive an effective description of the metric and possibly other degrees of freedom. To illustrate the procedure we analyze (numerically and analytically) two information graph flows with geometric attractors (towards locally one- and two-dimensional lattices) and metric perturbations obeying a geometric flow equation. Our analysis also suggests a possible approach to (a non-perturbative) quantum gravity in which the geometry (a secondary object) emerges directly from a quantum state (a primary object) due to the flow of the information graphs.

  18. The causal approach in quantum field theory

    International Nuclear Information System (INIS)

    Grigore, D. R.

    2003-01-01

    The mathematical formulation of perturbative renormalization theory starts from Bogoliubov axioms imposed on the S-matrix (or equivalently on the chronological products). The S-matrix is a formal series of operator valued distributions: these distributions are denoted by T(x 1 , ... , x n ) and one supposes that they act in the Fock space of some collection of free fields. These operator-valued distributions are called chronological products. The expression T(x) is called the interaction Lagrangian. It is convenient to construct more general objects namely, the operator-valued distributions T(W 1 (x 1 ), ... ,W n (x n )), where W j are arbitrary Wick monomials. These objects verify some properties (following from Bogolyubov axioms) and express the following properties: the initial condition, skew-symmetry in all arguments, Poincare invariance, causality and unitarity. The existence of solutions follows from the analysis of Epstein and Glaser as a recursive procedure using in an essential way the causality axiom. Sometimes it is possible to supplement these axioms by other invariance properties with respect to space-time symmetries (inversions and/or scale invariance), charge conjugation, global symmetry with respect to some internal symmetry group, supersymmetric invariance, etc. if they are valid for the interaction Lagrangian. In the literature, the invariance properties of the chronological products with respect to scale invariance was analyzed in detail. The scale invariance operators U λ are transforming field operators corresponding to particles of masses m j in fields corresponding to scaled masses λ -1 m j . One can prove that if all masses are positive the chronological products can be normalized such that they are scale invariant. On the contrary, if all masses of the model are zero then the scale invariance of the chronological products can be implemented only up to some logarithmic terms in λ. For models describing higher spin particles unphysical

  19. Field theory approach to quantum hall effect

    International Nuclear Information System (INIS)

    Cabo, A.; Chaichian, M.

    1990-07-01

    The Fradkin's formulation of statistical field theory is applied to the Coulomb interacting electron gas in a magnetic field. The electrons are confined to a plane in normal 3D-space and also interact with the physical 3D-electromagnetic field. The magnetic translation group (MTG) Ward identities are derived. Using them it is shown that the exact electron propagator is diagonalized in the basis of the wave functions of the free electron in a magnetic field whenever the MTG is unbroken. The general tensor structure of the polarization operator is obtained and used to show that the Chern-Simons action always describes the Hall effect properties of the system. A general proof of the Streda formula for the Hall conductivity is presented. It follows that the coefficient of the Chern-Simons terms in the long-wavelength approximation is exactly given by this relation. Such a formula, expressing the Hall conductivity as a simple derivative, in combination with diagonal form of the full propagator allows to obtain a simple expressions for the filling factor and the Hall conductivity. Indeed, these results, after assuming that the chemical potential lies in a gap of the density of states, lead to the conclusion that the Hall conductivity is given without corrections by σ xy = νe 2 /h where ν is the filling factor. In addition it follows that the filling factor is independent of the magnetic field if the chemical potential remains in the gap. (author). 21 ref, 1 fig

  20. Total colourings of graphs

    CERN Document Server

    Yap, Hian-Poh

    1996-01-01

    This book provides an up-to-date and rapid introduction to an important and currently active topic in graph theory. The author leads the reader to the forefront of research in this area. Complete and easily readable proofs of all the main theorems, together with numerous examples, exercises and open problems are given. The book is suitable for use as a textbook or as seminar material for advanced undergraduate and graduate students. The references are comprehensive and so it will also be useful for researchers as a handbook.

  1. Managing corporate capabilities:theory and industry approaches.

    Energy Technology Data Exchange (ETDEWEB)

    Slavin, Adam M.

    2007-02-01

    This study characterizes theoretical and industry approaches to organizational capabilities management and ascertains whether there is a distinct ''best practice'' in this regard. We consider both physical capabilities, such as technical disciplines and infrastructure, and non-physical capabilities such as corporate culture and organizational procedures. We examine Resource-Based Theory (RBT), which is the predominant organizational management theory focused on capabilities. RBT seeks to explain the effect of capabilities on competitiveness, and thus provide a basis for investment/divestment decisions. We then analyze industry approaches described to us in interviews with representatives from Goodyear, 3M, Intel, Ford, NASA, Lockheed Martin, and Boeing. We found diversity amongst the industry capability management approaches. Although all organizations manage capabilities and consider them to some degree in their strategies, no two approaches that we observed were identical. Furthermore, we observed that theory is not a strong driver in this regard. No organization used the term ''Resource-Based Theory'', nor did any organization mention any other guiding theory or practice from the organizational management literature when explaining their capabilities management approaches. As such, we concluded that there is no single best practice for capabilities management. Nevertheless, we believe that RBT and the diverse industry experiences described herein can provide useful insights to support development of capabilities management approaches.

  2. Software for Graph Analysis and Visualization

    Directory of Open Access Journals (Sweden)

    M. I. Kolomeychenko

    2014-01-01

    Full Text Available This paper describes the software for graph storage, analysis and visualization. The article presents a comparative analysis of existing software for analysis and visualization of graphs, describes the overall architecture of application and basic principles of construction and operation of the main modules. Furthermore, a description of the developed graph storage oriented to storage and processing of large-scale graphs is presented. The developed algorithm for finding communities and implemented algorithms of autolayouts of graphs are the main functionality of the product. The main advantage of the developed software is high speed processing of large size networks (up to millions of nodes and links. Moreover, the proposed graph storage architecture is unique and has no analogues. The developed approaches and algorithms are optimized for operating with big graphs and have high productivity.

  3. Graphs of groups on surfaces interactions and models

    CERN Document Server

    White, AT

    2001-01-01

    The book, suitable as both an introductory reference and as a text book in the rapidly growing field of topological graph theory, models both maps (as in map-coloring problems) and groups by means of graph imbeddings on sufaces. Automorphism groups of both graphs and maps are studied. In addition connections are made to other areas of mathematics, such as hypergraphs, block designs, finite geometries, and finite fields. There are chapters on the emerging subfields of enumerative topological graph theory and random topological graph theory, as well as a chapter on the composition of English

  4. On a conjecture concerning helly circle graphs

    Directory of Open Access Journals (Sweden)

    Durán Guillermo

    2003-01-01

    Full Text Available We say that G is an e-circle graph if there is a bijection between its vertices and straight lines on the cartesian plane such that two vertices are adjacent in G if and only if the corresponding lines intersect inside the circle of radius one. This definition suggests a method for deciding whether a given graph G is an e-circle graph, by constructing a convenient system S of equations and inequations which represents the structure of G, in such a way that G is an e-circle graph if and only if S has a solution. In fact, e-circle graphs are exactly the circle graphs (intersection graphs of chords in a circle, and thus this method provides an analytic way for recognizing circle graphs. A graph G is a Helly circle graph if G is a circle graph and there exists a model of G by chords such that every three pairwise intersecting chords intersect at the same point. A conjecture by Durán (2000 states that G is a Helly circle graph if and only if G is a circle graph and contains no induced diamonds (a diamond is a graph formed by four vertices and five edges. Many unsuccessful efforts - mainly based on combinatorial and geometrical approaches - have been done in order to validate this conjecture. In this work, we utilize the ideas behind the definition of e-circle graphs and restate this conjecture in terms of an equivalence between two systems of equations and inequations, providing a new, analytic tool to deal with it.

  5. Constructing New Theory for Identifying Students with Emotional Disturbance: A Constructivist Approach to Grounded Theory

    Directory of Open Access Journals (Sweden)

    Dori Barnett

    2012-06-01

    Full Text Available A grounded theory study that examined how practitioners in a county alternative and correctional education setting identify youth with emotional and behavioral difficulties for special education services provides an exemplar for a constructivist approach to grounded theory methodology. Discussion focuses on how a constructivist orientation to grounded theory methodology informed research decisions, shaped the development of the emergent grounded theory, and prompted a way of thinking about data collection and analysis. Implications for future research directions and policy and practice in the field of special and alternative education are discussed.

  6. Resistance and relatedness on an evolutionary graph

    Science.gov (United States)

    Maciejewski, Wes

    2012-01-01

    When investigating evolution in structured populations, it is often convenient to consider the population as an evolutionary graph—individuals as nodes, and whom they may act with as edges. There has, in recent years, been a surge of interest in evolutionary graphs, especially in the study of the evolution of social behaviours. An inclusive fitness framework is best suited for this type of study. A central requirement for an inclusive fitness analysis is an expression for the genetic similarity between individuals residing on the graph. This has been a major hindrance for work in this area as highly technical mathematics are often required. Here, I derive a result that links genetic relatedness between haploid individuals on an evolutionary graph to the resistance between vertices on a corresponding electrical network. An example that demonstrates the potential computational advantage of this result over contemporary approaches is provided. This result offers more, however, to the study of population genetics than strictly computationally efficient methods. By establishing a link between gene transfer and electric circuit theory, conceptualizations of the latter can enhance understanding of the former. PMID:21849384

  7. Dynamic modelling of the expansion cylinder of an open Joule cycle Ericsson engine: A bond graph approach

    International Nuclear Information System (INIS)

    Creyx, M.; Delacourt, E.; Morin, C.; Desmet, B.

    2016-01-01

    A dynamic model using the bond graph formalism of the expansion cylinder of an open Joule cycle Ericsson engine intended for a biomass-fuelled micro-CHP system is presented. Dynamic phenomena, such as the thermodynamic evolution of air, the instantaneous air mass flow rates linked to pressure drops crossing the valves, the heat transferred through the expansion cylinder wall and the mechanical friction losses, are included in the model. The influence on the Ericsson engine performances of the main operating conditions (intake air pressure and temperature, timing of intake and exhaust valve closing, rotational speed, mechanical friction losses and heat transfer at expansion cylinder wall) is studied. The operating conditions maximizing the performances of the Ericsson engine used in the a biomass-fuelled micro-CHP unit are an intake air pressure between 6 and 8 bar, a maximized intake air temperature, an adjustment of the intake and exhaust valve closing corresponding to an expansion cycle close to the theoretical Joule cycle, a rotational speed close to 800 rpm. The heat transfer at the expansion cylinder wall reduces the engine performances. - Highlights: • A bond graph dynamic model of the Ericsson engine expansion cylinder is presented. • Dynamic aspects are modelled: pressure drops, friction losses, wall heat transfer. • Influent factors and phenomena on the engine performances are investigated. • Expansion cycles close to the theoretical Joule cycle maximize the performances. • The heat transfer at the expansion chamber wall reduces the performances.

  8. Eigenfunction statistics on quantum graphs

    International Nuclear Information System (INIS)

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

    2010-01-01

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

  9. RECENT THEORIES OF THE FIRM: A CRITICAL APPROACH

    Directory of Open Access Journals (Sweden)

    Pacala Anca

    2012-07-01

    Full Text Available Besides the classical theories of the firms as complete or incomplete contract theories, in the last decades there were developed some new theories bringing new perspectives and approaches. Among these new perspectives we are presenting in this paper the evolutionary theory of the firm, the importance of resources and knowledge, and game theory. According to evolutionary theory the most important element for a firm is the company itself and its specific assets (physical and human. Evolutionist theories, in their diversity, are interested in issues such as the effects of changes in the long run within the firms, in terms of products, processes, decisions, analysis of the determinants of success. Resource and knowledge -based theories try to find a common point between transactions and organizational management analysis, focusing on development issues within companies, the importance of business strategy and achieving competitive advantages. Finally, cooperative game theory sees the firm as a coalition of various parts that compose it, emphasizing the importance of cooperative relations between employees and shareholders, risk sharing and effective collective skills, knowledge and funds using.

  10. Graph visualization (Invited talk)

    NARCIS (Netherlands)

    Wijk, van J.J.; Kreveld, van M.J.; Speckmann, B.

    2012-01-01

    Black and white node link diagrams are the classic method to depict graphs, but these often fall short to give insight in large graphs or when attributes of nodes and edges play an important role. Graph visualization aims obtaining insight in such graphs using interactive graphical representations.

  11. Groups, graphs and random walks

    CERN Document Server

    Salvatori, Maura; Sava-Huss, Ecaterina

    2017-01-01

    An accessible and panoramic account of the theory of random walks on groups and graphs, stressing the strong connections of the theory with other branches of mathematics, including geometric and combinatorial group theory, potential analysis, and theoretical computer science. This volume brings together original surveys and research-expository papers from renowned and leading experts, many of whom spoke at the workshop 'Groups, Graphs and Random Walks' celebrating the sixtieth birthday of Wolfgang Woess in Cortona, Italy. Topics include: growth and amenability of groups; Schrödinger operators and symbolic dynamics; ergodic theorems; Thompson's group F; Poisson boundaries; probability theory on buildings and groups of Lie type; structure trees for edge cuts in networks; and mathematical crystallography. In what is currently a fast-growing area of mathematics, this book provides an up-to-date and valuable reference for both researchers and graduate students, from which future research activities will undoubted...

  12. Drug repositioning for non-small cell lung cancer by using machine learning algorithms and topological graph theory.

    Science.gov (United States)

    Huang, Chien-Hung; Chang, Peter Mu-Hsin; Hsu, Chia-Wei; Huang, Chi-Ying F; Ng, Ka-Lok

    2016-01-11

    Non-small cell lung cancer (NSCLC) is one of the leading causes of death globally, and research into NSCLC has been accumulating steadily over several years. Drug repositioning is the current trend in the pharmaceutical industry for identifying potential new uses for existing drugs and accelerating the development process of drugs, as well as reducing side effects. This work integrates two approaches--machine learning algorithms and topological parameter-based classification--to develop a novel pipeline of drug repositioning to analyze four lung cancer microarray datasets, enriched biological processes, potential therapeutic drugs and targeted genes for NSCLC treatments. A total of 7 (8) and 11 (12) promising drugs (targeted genes) were discovered for treating early- and late-stage NSCLC, respectively. The effectiveness of these drugs is supported by the literature, experimentally determined in-vitro IC50 and clinical trials. This work provides better drug prediction accuracy than competitive research according to IC50 measurements. With the novel pipeline of drug repositioning, the discovery of enriched pathways and potential drugs related to NSCLC can provide insight into the key regulators of tumorigenesis and the treatment of NSCLC. Based on the verified effectiveness of the targeted drugs predicted by this pipeline, we suggest that our drug-finding pipeline is effective for repositioning drugs.

  13. Visibility graphs for fMRI data: Multiplex temporal graphs and their modulations across resting-state networks

    Directory of Open Access Journals (Sweden)

    Speranza Sannino

    2017-10-01

    Full Text Available Visibility algorithms are a family of methods that map time series into graphs, such that the tools of graph theory and network science can be used for the characterization of time series. This approach has proved a convenient tool, and visibility graphs have found applications across several disciplines. Recently, an approach has been proposed to extend this framework to multivariate time series, allowing a novel way to describe collective dynamics. Here we test their application to fMRI time series, following two main motivations, namely that (a this approach allows vs to simultaneously capture and process relevant aspects of both local and global dynamics in an easy and intuitive way, and (b this provides a suggestive bridge between time series and network theory that nicely fits the consolidating field of network neuroscience. Our application to a large open dataset reveals differences in the similarities of temporal networks (and thus in correlated dynamics across resting-state networks, and gives indications that some differences in brain activity connected to psychiatric disorders could be picked up by this approach. Here we present the first application of multivariate visibility graphs to fMRI data. Visibility graphs are a way to represent a time series as a temporal network, evidencing specific aspects of its dynamics, such as extreme events. Multivariate time series, as those encountered in neuroscience, and in fMRI in particular, can be seen as a multiplex network, in which each layer represents a time series (a region of interest in the brain in our case. Here we report the method, we describe some relevant aspects of its application to BOLD time series, and we discuss the analogies and differences with existing methods. Finally, we present an application to a high-quality, publicly available dataset, containing healthy subjects and psychotic patients, and we discuss our findings. All the code to reproduce the analyses and the

  14. Group manifold approach to gravity and supergravity theories

    International Nuclear Information System (INIS)

    d'Auria, R.; Fre, P.; Regge, T.

    1981-05-01

    Gravity theories are presented from the point of view of group manifold formulation. The differential geometry of groups and supergroups is discussed first; the notion of connection and related Yang-Mills potentials is introduced. Then ordinary Einstein gravity is discussed in the Cartan formulation. This discussion provides a first example which will then be generalized to more complicated theories, in particular supergravity. The distinction between ''pure'' and ''impure' theories is also set forth. Next, the authors develop an axiomatic approach to rheonomic theories related to the concept of Chevalley cohomology on group manifolds, and apply these principles to N = 1 supergravity. Then the panorama of so far constructed pure and impure group manifold supergravities is presented. The pure d = 5 N = 2 case is discussed in some detail, and N = 2 and N = 3 in d = 4 are considered as examples of the impure theories. The way a pure theory becomes impure after dimensional reduction is illustrated. Next, the role of kinematical superspace constraints as a subset of the group-manifold equations of motion is discussed, and the use of this approach to obtain the auxiliary fields is demonstrated. Finally, the application of the group manifold method to supersymmetric Super Yang-Mills theories is addressed

  15. Chemical Graph Transformation with Stereo-Information

    DEFF Research Database (Denmark)

    Andersen, Jakob Lykke; Flamm, Christoph; Merkle, Daniel

    2017-01-01

    Double Pushout graph transformation naturally facilitates the modelling of chemical reactions: labelled undirected graphs model molecules and direct derivations model chemical reactions. However, the most straightforward modelling approach ignores the relative placement of atoms and their neighbo......Double Pushout graph transformation naturally facilitates the modelling of chemical reactions: labelled undirected graphs model molecules and direct derivations model chemical reactions. However, the most straightforward modelling approach ignores the relative placement of atoms...... and their neighbours in space. Stereoisomers of chemical compounds thus cannot be distinguished, even though their chemical activity may differ substantially. In this contribution we propose an extended chemical graph transformation system with attributes that encode information about local geometry. The modelling...... of graph transformation, but we here propose a framework that also allows for partially specified stereoinformation. While there are several stereochemical configurations to be considered, we focus here on the tetrahedral molecular shape, and suggest general principles for how to treat all other chemically...

  16. Pragmatic Graph Rewriting Modifications

    OpenAIRE

    Rodgers, Peter; Vidal, Natalia

    1999-01-01

    We present new pragmatic constructs for easing programming in visual graph rewriting programming languages. The first is a modification to the rewriting process for nodes the host graph, where nodes specified as 'Once Only' in the LHS of a rewrite match at most once with a corresponding node in the host graph. This reduces the previously common use of tags to indicate the progress of matching in the graph. The second modification controls the application of LHS graphs, where those specified a...

  17. Using the graphs models for evaluating in-core monitoring systems reliability by the method of imiting simulaton

    International Nuclear Information System (INIS)

    Golovanov, M.N.; Zyuzin, N.N.; Levin, G.L.; Chesnokov, A.N.

    1987-01-01

    An approach for estimation of reliability factors of complex reserved systems at early stages of development using the method of imitating simulation is considered. Different types of models, their merits and lacks are given. Features of in-core monitoring systems and advosability of graph model and graph theory element application for estimating reliability of such systems are shown. The results of investigation of the reliability factors of the reactor monitoring, control and core local protection subsystem are shown

  18. Engineering Object-Oriented Semantics Using Graph Transformations

    NARCIS (Netherlands)

    Kastenberg, H.; Kleppe, A.G.; Rensink, Arend

    In this paper we describe the application of the theory of graph transformations to the practise of language design. We have defined the semantics of a small but realistic object-oriented language (called TAAL) by mapping the language constructs to graphs and their operational semantics to graph

  19. External memory K-bisimulation reduction of big graphs

    NARCIS (Netherlands)

    Luo, Y.; Fletcher, G.H.L.; Hidders, A.J.H.; Wu, Y.; De Bra, P.M.E.

    2013-01-01

    In this paper, we present, to our knowledge, the first known I/O efficient solutions for computing the k-bisimulation partition of a massive directed graph, and performing maintenance of such a partition upon updates to the underlying graph. Ubiquitous in the theory and application of graph data,

  20. Attack Graph Construction for Security Events Analysis

    Directory of Open Access Journals (Sweden)

    Andrey Alexeevich Chechulin

    2014-09-01

    Full Text Available The paper is devoted to investigation of the attack graphs construction and analysis task for a network security evaluation and real-time security event processing. Main object of this research is the attack modeling process. The paper contains the description of attack graphs building, modifying and analysis technique as well as overview of implemented prototype for network security analysis based on attack graph approach.

  1. Expander graphs in pure and applied mathematics

    OpenAIRE

    Lubotzky, Alexander

    2012-01-01

    Expander graphs are highly connected sparse finite graphs. They play an important role in computer science as basic building blocks for network constructions, error correcting codes, algorithms and more. In recent years they have started to play an increasing role also in pure mathematics: number theory, group theory, geometry and more. This expository article describes their constructions and various applications in pure and applied mathematics.

  2. Heterodox surplus approach: production, prices, and value theory

    OpenAIRE

    Lee, Frederic

    2011-01-01

    In this paper I argue that that there is a heterodox social surplus approach that has its own account of output-employment and prices, and its own value theory which draws upon various heterodox traditions. Starting with the Sraffian technical definition of the social surplus and then working with a Sraffa-Leontief input-output framework, the particular distinguishing feature of the heterodox approach is the role of agency in determining prices, the social surplus, and total social product a...

  3. RECENT APPROACHES IN THE OPTIMUM CURRENCY AREAS THEORY

    Directory of Open Access Journals (Sweden)

    AURA SOCOL

    2011-04-01

    Full Text Available This study is dealing with the endogenous characteristic of the OCA criteria, starting from the idea that a higherconformity of the business cycles will result in a better timing of the economic cycles and, thus, in getting closerto the quality of an optimum currency area. Thus, if the classical theory is focused on a static approach of theproblem, the new theories assert that these conditions are dynamic, and they cannot be positively affected evenby the establishment of the Economic and Monetary Union. The consequences are overwhelming, as theendogenous approach shows that a monetary union can be achieved even if all the conditions mentioned inMundell’s optimum currency areas theory are not met, showing that some of them may also be met subsequentto the unification. Thus, a country joining a monetary union, althogh it does not meet the criteria for an optimumcurrency area, will ex post lead to the increase of the integration and business cycle correlation degree.

  4. Anti-bribery control and incentives as agency theory approaches

    Directory of Open Access Journals (Sweden)

    Fabian Teichmann

    2017-11-01

    Full Text Available This article takes an agency theory approach towards bribery in multinational corporations. In particular, it is advocated that incentives could help to align the interests of principals and agents and reduce information asymmetries. This could help to increase anti-bribery compliance and hence support the fight against corruption in Eastern Europe.

  5. Anthropological Approach and Activity Theory: Culture, Communities and Institutions

    Science.gov (United States)

    Lagrange, Jean-Baptiste

    2013-01-01

    The goal of this paper is to evaluate the contribution of the anthropological approach (AA) concurrently to Activity Theory (AT) in view of overarching questions about classroom use of technology for teaching and learning mathematics. I will do it first from a philosophical point of view, presenting the main notions of AA that have been used to…

  6. Anti-bribery control and incentives as agency theory approaches

    OpenAIRE

    Fabian Teichmann

    2017-01-01

    This article takes an agency theory approach towards bribery in multinational corporations. In particular, it is advocated that incentives could help to align the interests of principals and agents and reduce information asymmetries. This could help to increase anti-bribery compliance and hence support the fight against corruption in Eastern Europe.

  7. Recasting Communication Theory and Research: A Cybernetic Approach.

    Science.gov (United States)

    Hill, Gary A.

    The author's main concern is to provide a research format which will supply a unitary conception of communication. The wide range of complex topics and variety of concepts embraced by communication theory and the rather disparate set of phenomena encompassed by communication research create this need for a unitary study approach capable of linking…

  8. Children's Conceptions of Mental Illness: A Naive Theory Approach

    Science.gov (United States)

    Fox, Claudine; Buchanan-Barrow, Eithne; Barrett, Martyn

    2010-01-01

    This paper reports two studies that investigated children's conceptions of mental illness using a naive theory approach, drawing upon a conceptual framework for analysing illness representations which distinguishes between the identity, causes, consequences, curability, and timeline of an illness. The studies utilized semi-structured interviewing…

  9. An Expectancy Theory Motivation Approach to Peer Assessment

    Science.gov (United States)

    Friedman, Barry A.; Cox, Pamela L.; Maher, Larry E.

    2008-01-01

    Group projects are an important component of higher education, and the use of peer assessment of students' individual contributions to group projects has increased. The researchers employed an expectancy theory approach and an experimental design in a field setting to investigate conditions that influence students' motivation to rate their peers'…

  10. Graph Transformation for Consolidation of Creativity Sessions Results

    DEFF Research Database (Denmark)

    Dolog, Peter

    2010-01-01

    Graph transformation approach for consolidation of creativity sessions results is part of the FP7 EU/IST project idSpace: Tooling of and training for collaborative, distributed product innovation. The goal of graph transformation approach is to provide a tool for merging results of various sessions...... (such as brainstorming sessions), which are represented as graphs, when the session participants- are physically distributed....

  11. Combinatorial and geometric aspects of Feynman graphs and Feynman integrals

    Energy Technology Data Exchange (ETDEWEB)

    Bergbauer, Christoph

    2009-06-11

    The integrals associated to Feynman graphs must have been a source of frustration for particle physicists ever since. Indeed there is a delicate difference between being able to draw a Feynman graph and being able to compute the associated Feynman integral. Although perturbation theory has brought enormous breakthroughs, many physicists turned to more abstract developments in quantum field theory, looked for other ways to produce perturbational results, or left the field entirely. Nonetheless there is a significant number of physicists, computational and theoretical, who pursue the quest for concepts and algorithms to compute and understand those integrals to higher and higher orders. Their motivation is to help test the validity of the underlying physical theory. For a mathematician, Feynman graphs and their integrals provide a rich subject in their own right, independent of their computability. It was only recently though that the work of Bloch, Esnault and Kreimer has brought a growing interest of mathematicians from various disciplines to the subject. In fact it opened up a completely new direction of research: a motivic interpretation of Feynman graphs that unites their combinatorial, geometric and arithmetic aspects. This idea had been in the air for a while, based on computational results of Broadhurst and Kreimer, and on a theorem of Belkale and Brosnan related to a conjecture of Kontsevich about the generality of the underlying motives. A prerequisite for the motivic approach is a profound understanding of renormalization that was established less recently in a modern language by Connes and Kreimer. This dissertation studies the renormalization of Feynman graphs in position space using an adapted resolution of singularities, and makes two other contributions of mostly combinatorial nature to the subject. I hope this may serve as a reference for somebody who feels comfortable with the traditional position space literature and looks for a transition to the

  12. Combinatorial and geometric aspects of Feynman graphs and Feynman integrals

    International Nuclear Information System (INIS)

    Bergbauer, Christoph

    2009-01-01

    The integrals associated to Feynman graphs must have been a source of frustration for particle physicists ever since. Indeed there is a delicate difference between being able to draw a Feynman graph and being able to compute the associated Feynman integral. Although perturbation theory has brought enormous breakthroughs, many physicists turned to more abstract developments in quantum field theory, looked for other ways to produce perturbational results, or left the field entirely. Nonetheless there is a significant number of physicists, computational and theoretical, who pursue the quest for concepts and algorithms to compute and understand those integrals to higher and higher orders. Their motivation is to help test the validity of the underlying physical theory. For a mathematician, Feynman graphs and their integrals provide a rich subject in their own right, independent of their computability. It was only recently though that the work of Bloch, Esnault and Kreimer has brought a growing interest of mathematicians from various disciplines to the subject. In fact it opened up a completely new direction of research: a motivic interpretation of Feynman graphs that unites their combinatorial, geometric and arithmetic aspects. This idea had been in the air for a while, based on computational results of Broadhurst and Kreimer, and on a theorem of Belkale and Brosnan related to a conjecture of Kontsevich about the generality of the underlying motives. A prerequisite for the motivic approach is a profound understanding of renormalization that was established less recently in a modern language by Connes and Kreimer. This dissertation studies the renormalization of Feynman graphs in position space using an adapted resolution of singularities, and makes two other contributions of mostly combinatorial nature to the subject. I hope this may serve as a reference for somebody who feels comfortable with the traditional position space literature and looks for a transition to the

  13. Adaptive Graph Convolutional Neural Networks

    OpenAIRE

    Li, Ruoyu; Wang, Sheng; Zhu, Feiyun; Huang, Junzhou

    2018-01-01

    Graph Convolutional Neural Networks (Graph CNNs) are generalizations of classical CNNs to handle graph data such as molecular data, point could and social networks. Current filters in graph CNNs are built for fixed and shared graph structure. However, for most real data, the graph structures varies in both size and connectivity. The paper proposes a generalized and flexible graph CNN taking data of arbitrary graph structure as input. In that way a task-driven adaptive graph is learned for eac...

  14. Incremental Frequent Subgraph Mining on Large Evolving Graphs

    KAUST Repository

    Abdelhamid, Ehab; Canim, Mustafa; Sadoghi, Mohammad; Bhatta, Bishwaranjan; Chang, Yuan-Chi; Kalnis, Panos

    2017-01-01

    , such as social networks, utilize large evolving graphs. Mining these graphs using existing techniques is infeasible, due to the high computational cost. In this paper, we propose IncGM+, a fast incremental approach for continuous frequent subgraph mining problem

  15. Nursing Services Delivery Theory: an open system approach

    Science.gov (United States)

    Meyer, Raquel M; O’Brien-Pallas, Linda L

    2010-01-01

    meyer r.m. & o’brien-pallas l.l. (2010)Nursing services delivery theory: an open system approach. Journal of Advanced Nursing66(12), 2828–2838. Aim This paper is a discussion of the derivation of the Nursing Services Delivery Theory from the application of open system theory to large-scale organizations. Background The underlying mechanisms by which staffing indicators influence outcomes remain under-theorized and unmeasured, resulting in a ‘black box’ that masks the nature and organization of nursing work. Theory linking nursing work, staffing, work environments, and outcomes in different settings is urgently needed to inform management decisions about the allocation of nurse staffing resources in organizations. Data sources A search of CINAHL and Business Source Premier for the years 1980–2008 was conducted using the following terms: theory, models, organization, organizational structure, management, administration, nursing units, and nursing. Seminal works were included. Discussion The healthcare organization is conceptualized as an open system characterized by energy transformation, a dynamic steady state, negative entropy, event cycles, negative feedback, differentiation, integration and coordination, and equifinality. The Nursing Services Delivery Theory proposes that input, throughput, and output factors interact dynamically to influence the global work demands placed on nursing work groups at the point of care in production subsystems. Implications for nursing The Nursing Services Delivery Theory can be applied to varied settings, cultures, and countries and supports the study of multi-level phenomena and cross-level effects. Conclusion The Nursing Services Delivery Theory gives a relational structure for reconciling disparate streams of research related to nursing work, staffing, and work environments. The theory can guide future research and the management of nursing services in large-scale healthcare organizations. PMID:20831573

  16. Data structures theory and practice

    CERN Document Server

    Berztiss, A T

    1971-01-01

    Computer Science and Applied Mathematics: Data Structures: Theory and Practice focuses on the processes, methodologies, principles, and approaches involved in data structures, including algorithms, decision trees, Boolean functions, lattices, and matrices. The book first offers information on set theory, functions, and relations, and graph theory. Discussions focus on linear formulas of digraphs, isomorphism of digraphs, basic definitions in the theory of digraphs, Boolean functions and forms, lattices, indexed sets, algebra of sets, and order pair and related concepts. The text then examines

  17. Abelian Chern endash Simons theory. II. A functional integral approach

    International Nuclear Information System (INIS)

    Manoliu, M.

    1998-01-01

    Following Witten, [Commun. Math. Phys. 21, 351 endash 399 (1989)] we approach the Abelian quantum Chern endash Simons (CS) gauge theory from a Feynman functional integral point of view. We show that for 3-manifolds with and without a boundary the formal functional integral definitions lead to mathematically proper expressions that agree with the results from the rigorous construction [J. Math. Phys. 39, 170 endash 206 (1998)] of the Abelian CS topological quantum field theory via geometric quantization. copyright 1998 American Institute of Physics

  18. Parametric statistical inference basic theory and modern approaches

    CERN Document Server

    Zacks, Shelemyahu; Tsokos, C P

    1981-01-01

    Parametric Statistical Inference: Basic Theory and Modern Approaches presents the developments and modern trends in statistical inference to students who do not have advanced mathematical and statistical preparation. The topics discussed in the book are basic and common to many fields of statistical inference and thus serve as a jumping board for in-depth study. The book is organized into eight chapters. Chapter 1 provides an overview of how the theory of statistical inference is presented in subsequent chapters. Chapter 2 briefly discusses statistical distributions and their properties. Chapt

  19. PRIVATE GRAPHS – ACCESS RIGHTS ON GRAPHS FOR SEAMLESS NAVIGATION

    Directory of Open Access Journals (Sweden)

    W. Dorner

    2016-06-01

    Full Text Available After the success of GNSS (Global Navigational Satellite Systems and navigation services for public streets, indoor seems to be the next big development in navigational services, relying on RTLS – Real Time Locating Services (e.g. WIFI and allowing seamless navigation. In contrast to navigation and routing services on public streets, seamless navigation will cause an additional challenge: how to make routing data accessible to defined users or restrict access rights for defined areas or only to parts of the graph to a defined user group? The paper will present case studies and data from literature, where seamless and especially indoor navigation solutions are presented (hospitals, industrial complexes, building sites, but the problem of restricted access rights was only touched from a real world, but not a technical perspective. The analysis of case studies will show, that the objective of navigation and the different target groups for navigation solutions will demand well defined access rights and require solutions, how to make only parts of a graph to a user or application available to solve a navigational task. The paper will therefore introduce the concept of private graphs, which is defined as a graph for navigational purposes covering the street, road or floor network of an area behind a public street and suggest different approaches how to make graph data for navigational purposes available considering access rights and data protection, privacy and security issues as well.

  20. Stakeholder Theory As an Ethical Approach to Effective Management: applying the theory to multiple contexts

    Directory of Open Access Journals (Sweden)

    Jeffrey S. Harrison

    2015-09-01

    Full Text Available Objective – This article provides a brief overview of stakeholder theory, clears up some widely held misconceptions, explains the importance of examining stakeholder theory from a variety of international perspectives and how this type of research will advance management theory, and introduces the other articles in the special issue. Design/methodology/approach – Some of the foundational ideas of stakeholder theory are discussed, leading to arguments about the importance of the theory to management research, especially in an international context. Findings – Stakeholder theory is found to be a particularly useful perspective for addressing some of the important issues in business from an international perspective. It offers an opportunity to reinterpret a variety of concepts, models and phenomena across may different disciplines. Practical implications – The concepts explored in this article may be applied in many contexts, domestically and internationally, and across business disciplines as diverse as economics, public administration, finance, philosophy, marketing, law, and management. Originality/value – Research on stakeholder theory in an international context is both lacking and sorely needed. This article and the others in this special issue aim to help fill that void.

  1. Pristine transfinite graphs and permissive electrical networks

    CERN Document Server

    Zemanian, Armen H

    2001-01-01

    A transfinite graph or electrical network of the first rank is obtained conceptually by connecting conventionally infinite graphs and networks together at their infinite extremities. This process can be repeated to obtain a hierarchy of transfiniteness whose ranks increase through the countable ordinals. This idea, which is of recent origin, has enriched the theories of graphs and networks with radically new constructs and research problems. The book provides a more accessible introduction to the subject that, though sacrificing some generality, captures the essential ideas of transfiniteness for graphs and networks. Thus, for example, some results concerning discrete potentials and random walks on transfinite networks can now be presented more concisely. Conversely, the simplifications enable the development of many new results that were previously unavailable. Topics and features: *A simplified exposition provides an introduction to transfiniteness for graphs and networks.*Various results for conventional g...

  2. Disease management research using event graphs.

    Science.gov (United States)

    Allore, H G; Schruben, L W

    2000-08-01

    Event Graphs, conditional representations of stochastic relationships between discrete events, simulate disease dynamics. In this paper, we demonstrate how Event Graphs, at an appropriate abstraction level, also extend and organize scientific knowledge about diseases. They can identify promising treatment strategies and directions for further research and provide enough detail for testing combinations of new medicines and interventions. Event Graphs can be enriched to incorporate and validate data and test new theories to reflect an expanding dynamic scientific knowledge base and establish performance criteria for the economic viability of new treatments. To illustrate, an Event Graph is developed for mastitis, a costly dairy cattle disease, for which extensive scientific literature exists. With only a modest amount of imagination, the methodology presented here can be seen to apply modeling to any disease, human, plant, or animal. The Event Graph simulation presented here is currently being used in research and in a new veterinary epidemiology course. Copyright 2000 Academic Press.

  3. Graph Model Based Indoor Tracking

    DEFF Research Database (Denmark)

    Jensen, Christian Søndergaard; Lu, Hua; Yang, Bin

    2009-01-01

    The tracking of the locations of moving objects in large indoor spaces is important, as it enables a range of applications related to, e.g., security and indoor navigation and guidance. This paper presents a graph model based approach to indoor tracking that offers a uniform data management...

  4. Price competition on graphs

    NARCIS (Netherlands)

    Soetevent, A.R.

    2010-01-01

    This paper extends Hotelling's model of price competition with quadratic transportation costs from a line to graphs. I propose an algorithm to calculate firm-level demand for any given graph, conditional on prices and firm locations. One feature of graph models of price competition is that spatial

  5. Graphing Inequalities, Connecting Meaning

    Science.gov (United States)

    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…

  6. Distance-regular graphs

    NARCIS (Netherlands)

    van Dam, Edwin R.; Koolen, Jack H.; Tanaka, Hajime

    2016-01-01

    This is a survey of distance-regular graphs. We present an introduction to distance-regular graphs for the reader who is unfamiliar with the subject, and then give an overview of some developments in the area of distance-regular graphs since the monograph 'BCN'[Brouwer, A.E., Cohen, A.M., Neumaier,

  7. Spectra of Graphs

    NARCIS (Netherlands)

    Brouwer, A.E.; Haemers, W.H.

    2012-01-01

    This book gives an elementary treatment of the basic material about graph spectra, both for ordinary, and Laplace and Seidel spectra. The text progresses systematically, by covering standard topics before presenting some new material on trees, strongly regular graphs, two-graphs, association

  8. Particle, superparticle, superstring and new approach to twistor theory

    International Nuclear Information System (INIS)

    Eisenberg, Y.

    1990-10-01

    A new approach to twistor theory is proposed. The approach is based on certain reformulations of the classical massless particle and superparticle in terms of twistors. The first quantization of these systems leads to a full classification of all the free 4D field theories. The extension of one of this systems to the interacting case leads to a reformulation of the standard Dirac-Yang-Mills field equations in terms of gauge potential which fulfills certain curvatureless conditions in a generalized space (Minkowski+twistor). These conditions are a consequence of integrability conditions of an overdetermined system of linear equations whose vector field is composed from the components of the Dirac field and the Yang-Mills field strength. The twistorial reformulation allows us to gauge away all the ordinary space-time variables. By this procedure we obtain a description of the usual free massless field theories in terms of pure twistor space. These systems are invariant under an infinite dimensional algebra, which contains the two dimensional conformal algebera as a subalgebra. We propose this systems as candidates to a generalization of the notion of two-dimensional conformal field theories to four dimensions. Alternatively, we introduce an extension of the pure twistorial point particle to a two dimensional object, i.e. a pure twistorial string. (author)

  9. On the geometrical approach to the relativistic string theory

    International Nuclear Information System (INIS)

    Barbashov, B.M.; Nesterenko, V.V.

    1978-01-01

    In a geometrical approach to the string theory in the four-dimensional Minkowski space the relativistic invariant gauge proposed earlier for the string moving in three-dimensional space-time is used. In contrast to the results of previous paper the system of equations for the coefficients of the fundamental forms of the string model world sheet can be reduced now to one nonlinear Lionville equation again but for a complex valued function u. It is shown that in the case of space-time with arbitrary dimension there are such string motions which are described by one non-linear equation with a real function u. And as a consequence the soliton solutions investigated earlier take place in a geometrical approach to the string theory in any dimensional space-time

  10. Spinning particle approach to higher spin field theory

    International Nuclear Information System (INIS)

    Corradini, Olindo

    2011-01-01

    We shortly review on the connection between higher-spin gauge field theories and supersymmetric spinning particle models. In such approach the higher spin equations of motion are linked to the first-class constraint algebra associated with the quantization of particle models. Here we consider a class of spinning particle models characterized by local O(N)-extended supersymmetry since these models are known to provide an alternative approach to the geometric formulation of higher spin field theory. We describe the canonical quantization of the models in curved target space and discuss the obstructions that appear in presence of an arbitrarily curved background. We then point out the special role that conformally flat spaces appear to have in such models and present a derivation of the higher-spin curvatures for maximally symmetric spaces.

  11. Toward a Theory of Strategic Communication: A Relationship Management Approach

    Science.gov (United States)

    2012-03-22

    Washington, DC: U.S. Department of Defense, Aug. 15, 2009), 5. 31 Ibid. 32 Ibid., 6. 33 Ibid. 34 Severin Peters, Strategic Communication for Crisis ...Relations, ed. Robert L. Heath (Thousand Oaks, CA: Sage Publications, 2001), 128. 76 W. Timothy Coombs , “Interpersonal Communication and Public Relations...Toward a Theory of Strategic Communication : A Relationship Management Approach by Lieutenant Colonel Cheryl D. Phillips

  12. Feynman's thesis: A new approach to quantum theory

    International Nuclear Information System (INIS)

    Das, Ashok

    2007-01-01

    It is not usual for someone to write a book on someone else's Ph.D. thesis, but then Feynman was not a usual physicist. He was without doubt one of the most original physicists of the twentieth century, who has strongly influenced the developments in quantum field theory through his many ingenious contributions. Path integral approach to quantum theories is one such contribution which pervades almost all areas of physics. What is astonishing is that he developed this idea as a graduate student for his Ph.D. thesis which has been printed, for the first time, in the present book along with two other related articles. The early developments in quantum theory, by Heisenberg and Schroedinger, were based on the Hamiltonian formulation, where one starts with the Hamiltonian description of a classical system and then promotes the classical observables to noncommuting quantum operators. However, Dirac had already stressed in an article in 1932 (this article is also reproduced in the present book) that the Lagrangian is more fundamental than the Hamiltonian, at least from the point of view of relativistic invariance and he wondered how the Lagrangian may enter into the quantum description. He had developed this idea through his 'transformation matrix' theory and had even hinted on how the action of the classical theory may enter such a description. However, although the brief paper by Dirac contained the basic essential ideas, it did not fully develop the idea of a Lagrangian description in detail in the functional language. Feynman, on the other hand, was interested in the electromagnetic interactions of the electron from a completely different point of view rooted in a theory involving action-at-a-distance. His theory (along with John Wheeler) did not have a Hamiltonian description and, in order to quantize such a theory, he needed an alternative formulation of quantum mechanics. When the article by Dirac was brought to his attention, he immediately realized what he was

  13. Spectral clustering and biclustering learning large graphs and contingency tables

    CERN Document Server

    Bolla, Marianna

    2013-01-01

    Explores regular structures in graphs and contingency tables by spectral theory and statistical methods This book bridges the gap between graph theory and statistics by giving answers to the demanding questions which arise when statisticians are confronted with large weighted graphs or rectangular arrays. Classical and modern statistical methods applicable to biological, social, communication networks, or microarrays are presented together with the theoretical background and proofs. This book is suitable for a one-semester course for graduate students in data mining, mult

  14. Combinatorial theory of the semiclassical evaluation of transport moments. I. Equivalence with the random matrix approach

    Energy Technology Data Exchange (ETDEWEB)

    Berkolaiko, G., E-mail: berko@math.tamu.edu [Department of Mathematics, Texas A and M University, College Station, Texas 77843-3368 (United States); Kuipers, J., E-mail: Jack.Kuipers@physik.uni-regensburg.de [Institut für Theoretische Physik, Universität Regensburg, D-93040 Regensburg (Germany)

    2013-11-15

    To study electronic transport through chaotic quantum dots, there are two main theoretical approaches. One involves substituting the quantum system with a random scattering matrix and performing appropriate ensemble averaging. The other treats the transport in the semiclassical approximation and studies correlations among sets of classical trajectories. There are established evaluation procedures within the semiclassical evaluation that, for several linear and nonlinear transport moments to which they were applied, have always resulted in the agreement with random matrix predictions. We prove that this agreement is universal: any semiclassical evaluation within the accepted procedures is equivalent to the evaluation within random matrix theory. The equivalence is shown by developing a combinatorial interpretation of the trajectory sets as ribbon graphs (maps) with certain properties and exhibiting systematic cancellations among their contributions. Remaining trajectory sets can be identified with primitive (palindromic) factorisations whose number gives the coefficients in the corresponding expansion of the moments of random matrices. The equivalence is proved for systems with and without time reversal symmetry.

  15. Field-strength formulation of gauge theories. The Hamiltonian approach in the Abelian theory

    International Nuclear Information System (INIS)

    Mendel, E.; Durand, L.

    1984-01-01

    We develop a Hamiltonian approach to the field-strength or dual formation of the Abelian gauge theory in which the potential A/sup μ/ is eliminated as a dynamical variable. Our work is based on the covariant gauge x/sup μ/A/sub μ/(x) = 0 which allows a simple elimination of A/sup μ/ in terms of the field strengths F/sup munu/. We obtain complete results for the generating functional for the Green's functions of the theory, Z = Z[f,g], where f and g are nonlocal currents coupled to E and B, and illustrate some unfamiliar aspects of the new formalism

  16. Joint Graph Layouts for Visualizing Collections of Segmented Meshes

    KAUST Repository

    Ren, Jing; Schneider, Jens; Ovsjanikov, Maks; Wonka, Peter

    2017-01-01

    We present a novel and efficient approach for computing joint graph layouts and then use it to visualize collections of segmented meshes. Our joint graph layout algorithm takes as input the adjacency matrices for a set of graphs along with partial, possibly soft, correspondences between nodes of different graphs. We then use a two stage procedure, where in the first step, we extend spectral graph drawing to include a consistency term so that a collection of graphs can be handled jointly. Our second step extends metric multi-dimensional scaling with stress majorization to the joint layout setting, while using the output of the spectral approach as initialization. Further, we discuss a user interface for exploring a collection of graphs. Finally, we show multiple example visualizations of graphs stemming from collections of segmented meshes and we present qualitative and quantitative comparisons with previous work.

  17. Joint Graph Layouts for Visualizing Collections of Segmented Meshes

    KAUST Repository

    Ren, Jing

    2017-09-12

    We present a novel and efficient approach for computing joint graph layouts and then use it to visualize collections of segmented meshes. Our joint graph layout algorithm takes as input the adjacency matrices for a set of graphs along with partial, possibly soft, correspondences between nodes of different graphs. We then use a two stage procedure, where in the first step, we extend spectral graph drawing to include a consistency term so that a collection of graphs can be handled jointly. Our second step extends metric multi-dimensional scaling with stress majorization to the joint layout setting, while using the output of the spectral approach as initialization. Further, we discuss a user interface for exploring a collection of graphs. Finally, we show multiple example visualizations of graphs stemming from collections of segmented meshes and we present qualitative and quantitative comparisons with previous work.

  18. EIT Imaging Regularization Based on Spectral Graph Wavelets.

    Science.gov (United States)

    Gong, Bo; Schullcke, Benjamin; Krueger-Ziolek, Sabine; Vauhkonen, Marko; Wolf, Gerhard; Mueller-Lisse, Ullrich; Moeller, Knut

    2017-09-01

    The objective of electrical impedance tomographic reconstruction is to identify the distribution of tissue conductivity from electrical boundary conditions. This is an ill-posed inverse problem usually solved under the finite-element method framework. In previous studies, standard sparse regularization was used for difference electrical impedance tomography to achieve a sparse solution. However, regarding elementwise sparsity, standard sparse regularization interferes with the smoothness of conductivity distribution between neighboring elements and is sensitive to noise. As an effect, the reconstructed images are spiky and depict a lack of smoothness. Such unexpected artifacts are not realistic and may lead to misinterpretation in clinical applications. To eliminate such artifacts, we present a novel sparse regularization method that uses spectral graph wavelet transforms. Single-scale or multiscale graph wavelet transforms are employed to introduce local smoothness on different scales into the reconstructed images. The proposed approach relies on viewing finite-element meshes as undirected graphs and applying wavelet transforms derived from spectral graph theory. Reconstruction results from simulations, a phantom experiment, and patient data suggest that our algorithm is more robust to noise and produces more reliable images.

  19. Interacting particle systems on graphs

    Science.gov (United States)

    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

  20. A graph kernel approach for alignment-free domain-peptide interaction prediction with an application to human SH3 domains.

    Science.gov (United States)

    Kundu, Kousik; Costa, Fabrizio; Backofen, Rolf

    2013-07-01

    State-of-the-art experimental data for determining binding specificities of peptide recognition modules (PRMs) is obtained by high-throughput approaches like peptide arrays. Most prediction tools applicable to this kind of data are based on an initial multiple alignment of the peptide ligands. Building an initial alignment can be error-prone, especially in the case of the proline-rich peptides bound by the SH3 domains. Here, we present a machine-learning approach based on an efficient graph-kernel technique to predict the specificity of a large set of 70 human SH3 domains, which are an important class of PRMs. The graph-kernel strategy allows us to (i) integrate several types of physico-chemical information for each amino acid, (ii) consider high-order correlations between these features and (iii) eliminate the need for an initial peptide alignment. We build specialized models for each human SH3 domain and achieve competitive predictive performance of 0.73 area under precision-recall curve, compared with 0.27 area under precision-recall curve for state-of-the-art methods based on position weight matrices. We show that better models can be obtained when we use information on the noninteracting peptides (negative examples), which is currently not used by the state-of-the art approaches based on position weight matrices. To this end, we analyze two strategies to identify subsets of high confidence negative data. The techniques introduced here are more general and hence can also be used for any other protein domains, which interact with short peptides (i.e. other PRMs). The program with the predictive models can be found at http://www.bioinf.uni-freiburg.de/Software/SH3PepInt/SH3PepInt.tar.gz. We also provide a genome-wide prediction for all 70 human SH3 domains, which can be found under http://www.bioinf.uni-freiburg.de/Software/SH3PepInt/Genome-Wide-Predictions.tar.gz. Supplementary data are available at Bioinformatics online.

  1. A graph kernel approach for alignment-free domain–peptide interaction prediction with an application to human SH3 domains

    Science.gov (United States)

    Kundu, Kousik; Costa, Fabrizio; Backofen, Rolf

    2013-01-01

    Motivation: State-of-the-art experimental data for determining binding specificities of peptide recognition modules (PRMs) is obtained by high-throughput approaches like peptide arrays. Most prediction tools applicable to this kind of data are based on an initial multiple alignment of the peptide ligands. Building an initial alignment can be error-prone, especially in the case of the proline-rich peptides bound by the SH3 domains. Results: Here, we present a machine-learning approach based on an efficient graph-kernel technique to predict the specificity of a large set of 70 human SH3 domains, which are an important class of PRMs. The graph-kernel strategy allows us to (i) integrate several types of physico-chemical information for each amino acid, (ii) consider high-order correlations between these features and (iii) eliminate the need for an initial peptide alignment. We build specialized models for each human SH3 domain and achieve competitive predictive performance of 0.73 area under precision-recall curve, compared with 0.27 area under precision-recall curve for state-of-the-art methods based on position weight matrices. We show that better models can be obtained when we use information on the noninteracting peptides (negative examples), which is currently not used by the state-of-the art approaches based on position weight matrices. To this end, we analyze two strategies to identify subsets of high confidence negative data. The techniques introduced here are more general and hence can also be used for any other protein domains, which interact with short peptides (i.e. other PRMs). Availability: The program with the predictive models can be found at http://www.bioinf.uni-freiburg.de/Software/SH3PepInt/SH3PepInt.tar.gz. We also provide a genome-wide prediction for all 70 human SH3 domains, which can be found under http://www.bioinf.uni-freiburg.de/Software/SH3PepInt/Genome-Wide-Predictions.tar.gz. Contact: backofen@informatik.uni-freiburg.de Supplementary

  2. On a Fuzzy Algebra for Querying Graph Databases

    OpenAIRE

    Pivert , Olivier; Thion , Virginie; Jaudoin , Hélène; Smits , Grégory

    2014-01-01

    International audience; This paper proposes a notion of fuzzy graph database and describes a fuzzy query algebra that makes it possible to handle such database, which may be fuzzy or not, in a flexible way. The algebra, based on fuzzy set theory and the concept of a fuzzy graph, is composed of a set of operators that can be used to express preference queries on fuzzy graph databases. The preferences concern i) the content of the vertices of the graph and ii) the structure of the graph. In a s...

  3. Number theory an approach through history from Hammurapi to Legendre

    CERN Document Server

    Weil, André

    2007-01-01

    Number Theory or arithmetic, as some prefer to call it, is the oldest, purest, liveliest, most elementary yet sophisticated field of mathematics. It is no coincidence that the fundamental science of numbers has come to be known as the "Queen of Mathematics." Indeed some of the most complex conventions of the mathematical mind have evolved from the study of basic problems of number theory. André Weil, one of the outstanding contributors to number theory, has written an historical exposition of this subject; his study examines texts that span roughly thirty-six centuries of arithmetical work — from an Old Babylonian tablet, datable to the time of Hammurapi to Legendre’s Essai sur la Théorie des Nombres (1798). Motivated by a desire to present the substance of his field to the educated reader, Weil employs an historical approach in the analysis of problems and evolving methods of number theory and their significance within mathematics. In the course of his study Weil accompanies the reader into the worksho...

  4. Sensory conflict in motion sickness: An observer theory approach

    Science.gov (United States)

    Oman, Charles M.

    1989-01-01

    Motion sickness is the general term describing a group of common nausea syndromes originally attributed to motion-induced cerebral ischemia, stimulation of abdominal organ afferent, or overstimulation of the vestibular organs of the inner ear. Sea-, car-, and airsicknesses are the most commonly experienced examples. However, the discovery of other variants such as Cinerama-, flight simulator-, spectacle-, and space sickness in which the physical motion of the head and body is normal or absent has led to a succession of sensory conflict theories which offer a more comprehensive etiologic perspective. Implicit in the conflict theory is the hypothesis that neutral and/or humoral signals originate in regions of the brain subversing spatial orientation, and that these signals somehow traverse to other centers mediating sickness symptoms. Unfortunately, the present understanding of the neurophysiological basis of motion sickness is far from complete. No sensory conflict neuron or process has yet been physiologically identified. To what extent can the existing theory be reconciled with current knowledge of the physiology and pharmacology of nausea and vomiting. The stimuli which causes sickness, synthesizes a contemporary Observer Theory view of the Sensory Conflict hypothesis are reviewed, and a revised model for the dynamic coupling between the putative conflict signals and nausea magnitude estimates is presented. The use of quantitative models for sensory conflict offers a possible new approach to improving the design of visual and motion systems for flight simulators and other virtual environment display systems.

  5. Rerepresenting and Restructuring Domain Theories: A Constructive Induction Approach

    OpenAIRE

    Donoho, S. K.; Rendell, L. A.

    1995-01-01

    Theory revision integrates inductive learning and background knowledge by combining training examples with a coarse domain theory to produce a more accurate theory. There are two challenges that theory revision and other theory-guided systems face. First, a representation language appropriate for the initial theory may be inappropriate for an improved theory. While the original representation may concisely express the initial theory, a more accurate theory forced to use that same representati...

  6. Query Optimizations over Decentralized RDF Graphs

    KAUST Repository

    Abdelaziz, Ibrahim; Mansour, Essam; Ouzzani, Mourad; Aboulnaga, Ashraf; Kalnis, Panos

    2017-01-01

    Applications in life sciences, decentralized social networks, Internet of Things, and statistical linked dataspaces integrate data from multiple decentralized RDF graphs via SPARQL queries. Several approaches have been proposed to optimize query

  7. Mapping site-based construction workers’ motivation: Expectancy theory approach

    Directory of Open Access Journals (Sweden)

    Parviz Ghoddousi

    2014-03-01

    Full Text Available The aim of this study is to apply a recently proposed model of motivation based on expectancy theory to site-based workers in the construction context and confirm the validity of this model for the construction industry. The study drew upon data from 194 site-based construction workers in Iran to test the proposed model of motivation. To this end, the structural equation modelling (SEM approach based on the confirmatory factor analysis (CFA technique was deployed. The study reveals that the proposed model of expectancy theory incorporating five indicators (i.e. intrinsic instrumentality, extrinsic instrumentality, intrinsic valence, extrinsic valence and expectancy is able to map the process of construction workers’ motivation. Nonetheless, the findings posit that intrinsic indicators could be more effective than extrinsic ones. This proffers the necessity of construction managers placing further focus on intrinsic motivators to motivate workers. 

  8. Mapping site-based construction workers’ motivation: Expectancy theory approach

    Directory of Open Access Journals (Sweden)

    Parviz Ghoddousi

    2014-03-01

    Full Text Available The aim of this study is to apply a recently proposed model of motivation based on expectancy theory to site-based workers in the construction context and confirm the validity of this model for the construction industry. The study drew upon data from 194 site-based construction workers in Iran to test the proposed model of motivation. To this end, the structural equation modelling (SEM approach based on the confirmatory factor analysis (CFA technique was deployed. The study reveals that the proposed model of expectancy theory incorporating five indicators (i.e. intrinsic instrumentality, extrinsic instrumentality, intrinsic valence, extrinsic valence and expectancy is able to map the process of construction workers’ motivation. Nonetheless, the findings posit that intrinsic indicators could be more effective than extrinsic ones. This proffers the necessity of construction managers placing further focus on intrinsic motivators to motivate workers.

  9. Enabling Graph Appliance for Genome Assembly

    Energy Technology Data Exchange (ETDEWEB)

    Singh, Rina [ORNL; Graves, Jeffrey A [ORNL; Lee, Sangkeun (Matt) [ORNL; Sukumar, Sreenivas R [ORNL; Shankar, Mallikarjun [ORNL

    2015-01-01

    In recent years, there has been a huge growth in the amount of genomic data available as reads generated from various genome sequencers. The number of reads generated can be huge, ranging from hundreds to billions of nucleotide, each varying in size. Assembling such large amounts of data is one of the challenging computational problems for both biomedical and data scientists. Most of the genome assemblers developed have used de Bruijn graph techniques. A de Bruijn graph represents a collection of read sequences by billions of vertices and edges, which require large amounts of memory and computational power to store and process. This is the major drawback to de Bruijn graph assembly. Massively parallel, multi-threaded, shared memory systems can be leveraged to overcome some of these issues. The objective of our research is to investigate the feasibility and scalability issues of de Bruijn graph assembly on Cray s Urika-GD system; Urika-GD is a high performance graph appliance with a large shared memory and massively multithreaded custom processor designed for executing SPARQL queries over large-scale RDF data sets. However, to the best of our knowledge, there is no research on representing a de Bruijn graph as an RDF graph or finding Eulerian paths in RDF graphs using SPARQL for potential genome discovery. In this paper, we address the issues involved in representing a de Bruin graphs as RDF graphs and propose an iterative querying approach for finding Eulerian paths in large RDF graphs. We evaluate the performance of our implementation on real world ebola genome datasets and illustrate how genome assembly can be accomplished with Urika-GD using iterative SPARQL queries.

  10. Evolutionary games on graphs

    Science.gov (United States)

    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.

  11. A geometrical approach to two-dimensional Conformal Field Theory

    Science.gov (United States)

    Dijkgraaf, Robertus Henricus

    1989-09-01

    This thesis is organized in the following way. In Chapter 2 we will give a brief introduction to conformal field theory along the lines of standard quantum field theory, without any claims to originality. We introduce the important concepts of the stress-energy tensor, the Virasoro algebra, and primary fields. The general principles are demonstrated by fermionic and bosonic free field theories. This also allows us to discuss some general aspects of moduli spaces of CFT's. In particular, we describe in some detail the space of iiiequivalent toroidal comi)actificalions, giving examples of the quantum equivalences that we already mentioned. In Chapter 3 we will reconsider general quantum field theory from a more geometrical point of view, along the lines of the so-called operator formalism. Crucial to this approach will be the consideration of topology changing amplitudes. After a simple application to 2d topological theories, we proceed to give our second introduction to CFT, stressing the geometry behind it. In Chapter 4 the so-called rational conformal field theories are our object of study. These special CFT's have extended symmetries with only a finite number of representations. If an interpretation as non-linear sigma model exists, this extra symmetry can be seen as a kind of resonance effect due to the commensurability of the size of the string and the target space-time. The structure of rational CFT's is extremely rigid, and one of our results will be that the operator content of these models is—up to some discrete choices—completely determined by the symmetry algebra. The study of rational models is in its rigidity very analogous to finite group theory. In Chapter 5 this analogy is further pursued and substantiated. We will show how one can construct from general grounds rational conformal field theories from finite groups. These models are abstract versions of non-linear o-models describing string propagation on 'orbifoids.' An orbifold is a singular

  12. Towards a nonequilibrium quantum field theory approach to electroweak baryogenesis

    International Nuclear Information System (INIS)

    Riotto, A.

    1996-01-01

    We propose a general method to compute CP violating observables from extensions of the standard model in the context of electroweak baryogenesis. It is an alternative to the one recently developed by Huet and Nelson and relies on a nonequilibrium quantum field theory approach. The method is valid for all shapes and sizes of the bubble wall expanding in the thermal bath during a first-order electroweak phase transition. The quantum physics of CP violation and its suppression coming from the incoherent nature of thermal processes are also made explicit. copyright 1996 The American Physical Society

  13. A theory approach for creation of the matter of universe

    International Nuclear Information System (INIS)

    Duong Van Phi; Duong Anh Duc

    1993-08-01

    We shall represent an approach for the creation of the matter of Universe in the framework of a Quantum Theory, established in an 8-dimensional space. The primitive matter was being created from the Primary Vacuum and it consisted of the deuterons atoms, neutrinos and photons. From these neutral elements the attractive centres were formed and in the final stage an extremely high mass density Universe was built, and successively, the Big-Bang occurred. The problems of particle dominance, of excess of the deuterons and of magnitude of the numbers of neutrinos, etc. are discussed. (author). 19 refs, 2 tabs

  14. Compact toroid theory issues and approaches: a panel report

    International Nuclear Information System (INIS)

    1985-06-01

    In the six years since the initiation of the compact toroid program by the Office of Fusion Energy, remarkable scientific advances have occurred on both field-reversed configurations (FRC) and spheromaks. This progress has been stimulated by a diverse experimental program with facilities at six laboratories, and by a small but nevertheless broad theoretical research effort encompassing more than a dozen institutions. The close coupling between theoretical and experimental programs has contributed immeasurably to this progress. This document offers guidance for future compact toroid theory by identifying and discussing the key physics issues. In most cases promising approaches to these issues are offered

  15. Toward an effective field theory approach to reheating

    Science.gov (United States)

    Özsoy, Ogan; Giblin, John T.; Nesbit, Eva; Şengör, Gizem; Watson, Scott

    2017-12-01

    We investigate whether effective field theory (EFT) approaches, which have been useful in examining inflation and dark energy, can also be used to establish a systematic approach to inflationary reheating. We consider two methods. First, we extend Weinberg's background EFT to the end of inflation and reheating. We establish when parametric resonance and decay of the inflaton occurs, but also find intrinsic theoretical limitations, which make it difficult to capture some reheating models. This motivates us to next consider Cheung et al.'s EFT approach, which instead focuses on perturbations and the symmetry breaking induced by the cosmological background. Adapting the latter approach to reheating implies some new and important differences compared to the EFT of inflation. In particular, there are new hierarchical scales, and we must account for inflaton oscillations during reheating, which lead to discrete symmetry breaking. Guided by the fundamental symmetries, we construct the EFT of reheating, and as an example of its usefulness we establish a new class of reheating models and the corresponding predictions for gravity wave observations. In this paper we primarily focus on the first stages of preheating. We conclude by discussing challenges for the approach and future directions. This paper builds on ideas first proposed in the paper [O. Ozsoy, G. Sengor, K. Sinha, and S. Watson, arXiv:1507.06651.].

  16. [Notes on childhood and theory: a Latin American approach].

    Science.gov (United States)

    Bustelo Graffigna, Eduardo

    2012-12-01

    This work seeks to introduce and examine different historically relevant theories and propose certain frameworks that allow for the development of a Latin American theoretical approach based in a new discourse regarding childhood and adolescence. In order to undertake the creation of this Latin American approach, understanding the category of childhood as a social and historical construction, the work draws upon the contributions of structuralism (in particular, childhood as a permanent category, its relational dimension with regards to adulthood and its historical and intercultural dimension) and Foucault and Deleuze's concept of the society of control associated with the category of domination, an essential aspect of Latin American thought. The text was presented as a speech in the V World Congress for the Rights of Children and Adolescents held in San Juan, Argentina, from October 15-19, 2012.

  17. Hamiltonian truncation approach to quenches in the Ising field theory

    Directory of Open Access Journals (Sweden)

    T. Rakovszky

    2016-10-01

    Full Text Available In contrast to lattice systems where powerful numerical techniques such as matrix product state based methods are available to study the non-equilibrium dynamics, the non-equilibrium behaviour of continuum systems is much harder to simulate. We demonstrate here that Hamiltonian truncation methods can be efficiently applied to this problem, by studying the quantum quench dynamics of the 1+1 dimensional Ising field theory using a truncated free fermionic space approach. After benchmarking the method with integrable quenches corresponding to changing the mass in a free Majorana fermion field theory, we study the effect of an integrability breaking perturbation by the longitudinal magnetic field. In both the ferromagnetic and paramagnetic phases of the model we find persistent oscillations with frequencies set by the low-lying particle excitations not only for small, but even for moderate size quenches. In the ferromagnetic phase these particles are the various non-perturbative confined bound states of the domain wall excitations, while in the paramagnetic phase the single magnon excitation governs the dynamics, allowing us to capture the time evolution of the magnetisation using a combination of known results from perturbation theory and form factor based methods. We point out that the dominance of low lying excitations allows for the numerical or experimental determination of the mass spectra through the study of the quench dynamics.

  18. Linear response theory an analytic-algebraic approach

    CERN Document Server

    De Nittis, Giuseppe

    2017-01-01

    This book presents a modern and systematic approach to Linear Response Theory (LRT) by combining analytic and algebraic ideas. LRT is a tool to study systems that are driven out of equilibrium by external perturbations. In particular the reader is provided with a new and robust tool to implement LRT for a wide array of systems. The proposed formalism in fact applies to periodic and random systems in the discrete and the continuum. After a short introduction describing the structure of the book, its aim and motivation, the basic elements of the theory are presented in chapter 2. The mathematical framework of the theory is outlined in chapters 3–5: the relevant von Neumann algebras, noncommutative $L^p$- and Sobolev spaces are introduced; their construction is then made explicit for common physical systems; the notion of isopectral perturbations and the associated dynamics are studied. Chapter 6 is dedicated to the main results, proofs of the Kubo and Kubo-Streda formulas. The book closes with a chapter about...

  19. Incremental View Maintenance for Deductive Graph Databases Using Generalized Discrimination Networks

    Directory of Open Access Journals (Sweden)

    Thomas Beyhl

    2016-12-01

    Full Text Available Nowadays, graph databases are employed when relationships between entities are in the scope of database queries to avoid performance-critical join operations of relational databases. Graph queries are used to query and modify graphs stored in graph databases. Graph queries employ graph pattern matching that is NP-complete for subgraph isomorphism. Graph database views can be employed that keep ready answers in terms of precalculated graph pattern matches for often stated and complex graph queries to increase query performance. However, such graph database views must be kept consistent with the graphs stored in the graph database. In this paper, we describe how to use incremental graph pattern matching as technique for maintaining graph database views. We present an incremental maintenance algorithm for graph database views, which works for imperatively and declaratively specified graph queries. The evaluation shows that our maintenance algorithm scales when the number of nodes and edges stored in the graph database increases. Furthermore, our evaluation shows that our approach can outperform existing approaches for the incremental maintenance of graph query results.

  20. Price Competition on Graphs

    OpenAIRE

    Adriaan R. Soetevent

    2010-01-01

    This paper extends Hotelling's model of price competition with quadratic transportation costs from a line to graphs. I propose an algorithm to calculate firm-level demand for any given graph, conditional on prices and firm locations. One feature of graph models of price competition is that spatial discontinuities in firm-level demand may occur. I show that the existence result of D'Aspremont et al. (1979) does not extend to simple star graphs. I conjecture that this non-existence result holds...