A graph rewriting programming language for graph drawing
Rodgers, Peter
1998-01-01
This paper describes Grrr, a prototype visual graph drawing tool. Previously there were no visual languages for programming graph drawing algorithms despite the inherently visual nature of the process. The languages which gave a diagrammatic view of graphs were not computationally complete and so could not be used to implement complex graph drawing algorithms. Hence current graph drawing tools are all text based. Recent developments in graph rewriting systems have produced computationally com...
Handbook of graph drawing and visualization
Tamassia, Roberto
2013-01-01
Planarity Testing and Embedding Maurizio PatrignaniCrossings and Planarization Christoph Buchheim, Markus Chimani, Carsten Gutwenger, Michael Jünger, and Petra MutzelSymmetric Graph Drawing Peter Eades and Seok-Hee HongProximity Drawings Giuseppe LiottaTree Drawing Algorithms Adrian RusuPlanar Straight-Line Drawing Algorithms Luca VismaraPlanar Orthogonal and Polyline Drawing Algorithms Christian A. Duncan and Michael T. GoodrichSpine and Radial Drawings Emilio Di Giacomo, Walter Didimo, and Giuseppe LiottaCircular Drawing Algorithms Janet M. Six and Ioannis G. TollisRectangular Drawing Algori
Layered Graph Drawing for Visualizing Evaluation Structures.
Onoue, Yosuke; Kukimoto, Nobuyuki; Sakamoto, Naohisa; Misue, Kazuo; Koyamada, Koji
2017-01-01
An evaluation structure is a hierarchical structure of human cognition extracted from interviews based on the evaluation grid method. An evaluation structure can be defined as a directed acyclic graph (DAG). The authors propose a layer-assignment method that is part of the Sugiyama framework, a popular method for drawing DAGs, to satisfy the requirements for drawing evaluation structures. Their evaluations demonstrate that the layered graph drawing produced by the proposed layer-assignment method is preferred by users and aids in the understanding of evaluation structures.
A New Graph Drawing Scheme for Social Network
Eric Ke Wang
2014-01-01
visualization is employed to extract the potential information from the large scale of social network data and present the information briefly as visualized graphs. In the process of information visualization, graph drawing is a crucial part. In this paper, we study the graph layout algorithms and propose a new graph drawing scheme combining multilevel and single-level drawing approaches, including the graph division method based on communities and refining approach based on partitioning strategy. Besides, we compare the effectiveness of our scheme and FM3 in experiments. The experiment results show that our scheme can achieve a clearer diagram and effectively extract the community structure of the social network to be applied to drawing schemes.
Graph-drawing algorithms geometries versus molecular mechanics in fullereness
Kaufman, M.; Pisanski, T.; Lukman, D.; Borštnik, B.; Graovac, A.
1996-09-01
The algorithms of Kamada-Kawai (KK) and Fruchterman-Reingold (FR) have been recently generalized (Pisanski et al., Croat. Chem. Acta 68 (1995) 283) in order to draw molecular graphs in three-dimensional space. The quality of KK and FR geometries is studied here by comparing them with the molecular mechanics (MM) and the adjacency matrix eigenvectors (AME) algorithm geometries. In order to compare different layouts of the same molecule, an appropriate method has been developed. Its application to a series of experimentally detected fullerenes indicates that the KK, FR and AME algorithms are able to reproduce plausible molecular geometries.
Morphing Planar Graph Drawings with a Polynomial Number of Steps
Alamdari, Soroush; Angelini, Patrizio; Chan, Timothy M.
2013-01-01
In 1944, Cairns proved the following theorem: given any two straight-line planar drawings of a triangulation with the same outer face, there exists a morph (i.e., a continuous transformation) between the two drawings so that the drawing remains straight-line planar at all times. Cairns’s original...
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.
Subprogram STDPL for standard graph drawing of two-dimensional data
Fujimura, Toichiro
1977-05-01
The subroutine STDPL has been developed for drawing the graphs of data. The data should have two components, and the graphs are drawn on x-y plane using refined parameters. A functional subroutine package, F-Series, was also developed by combining the basic plotter subroutines, which is employed in STDPL. Visualization of the data is important in grasping trend of the results obtained by experiment or calculation. However, plotting them by use of the basic subroutines alone is laborious and tends to give errors. The STDPL is designed to detect input-parameter errors and correct them as much as possible to continue the plotting. Some typical examples and FORTRAN list of the subroutines are also given. (auth.)
Jayaswal, Balhans
1987-01-01
PLOT3D series of graphic codes (version 1 to 5) have been developed for drawing three dimensional graphs, maps, histograms and simple layout diagrams on monochrome or colour raster graphic terminal and plotter. Of these, PLOT3D Version-5 is an advanced code, equipped with several features that make it specially suitable for drawing 3D maps, multicolour 3D and contour graphs, and 3D layout diagrams, in axonometric or perspective projection. Prior to drawing, graphic parameters that define orientation, magnification, smoothening, shading, colour-map, etc. of the figure can be selected interactively by means of simple commands on the user terminal, or by reading those commands from an input data file. This code requires linking with any one of three supporting libraries: PLOT 10 TCS, PLOT 10 IGL, and CALCOMP, and the figure can be plotted in single colour, or displayed in single or multiple colours depending upon the type of library support and output device. Furthermore, this code can also be used to plot left and right eye view projections of 3D figure for composing a stereoscopic image from them with the aid of a viewer. 14 figures. (author)
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.
Creating more effective graphs
Robbins, Naomi B
2012-01-01
A succinct and highly readable guide to creating effective graphs The right graph can be a powerful tool for communicating information, improving a presentation, or conveying your point in print. If your professional endeavors call for you to present data graphically, here's a book that can help you do it more effectively. Creating More Effective Graphs gives you the basic knowledge and techniques required to choose and create appropriate graphs for a broad range of applications. Using real-world examples everyone can relate to, the author draws on her years of experience in gr
Bläsius, T.; Radermacher, M.; Rutter, I.; Steffen, B.; Baier, C.; van den Brand, M.; Eder, J.; Hinchey, M.; Margaria, T.
2017-01-01
We study the problem of computing straight-line drawings of non-planar graphs with few crossings. We assume that a crossing-minimization algorithm is applied first, yielding a planarization, i.e., a planar graph with a dummy vertex for each crossing, that fixes the topology of the resulting drawing.
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
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.
Graph Algorithm Animation with Grrr
Rodgers, Peter; Vidal, Natalia
2000-01-01
We discuss geometric positioning, highlighting of visited nodes and user defined highlighting that form the algorithm animation facilities in the Grrr graph rewriting programming language. The main purpose of animation was initially for the debugging and profiling of Grrr code, but recently it has been extended for the purpose of teaching algorithms to undergraduate students. The animation is restricted to graph based algorithms such as graph drawing, list manipulation or more traditional gra...
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.
Szekely, George
2012-01-01
Children are drawing inventors. Their art is certainly not what most adults think of as drawing. Almost instinctively, kids know that drawing is everywhere--that they can draw with almost anything, and that innumerable surfaces can be converted for art use. Teaching drawing is showing interest and enthusiasm for kids' drawing inventions--instead…
Gregory, Nuala
2017-01-01
This article divides into two roughly equal parts, both of which aim to address the "act" rather than the "art" of drawing. The second part focuses on a theoretical discussion of drawing. The first bears on a number of themes including the role of drawing in colonial history, drawing and data collection, and drawing and memory.…
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...
Adams, Eileen
2017-01-01
This article draws heavily on the author's critical autobiography: "Eileen Adams: Agent of Change." It presents evidence of the value of drawing as a medium for learning, particularly in art and design, and argues that drawing is a useful educational tool. The premise is that drawing makes you think. This article explains various…
Cho, Ho Seon; Lee, Geun Hui
2004-04-15
This book deals with how to read and draw the mechanical drawing, which includes the basic of drawing like purpose, kinds, and criterion, projection, special projection drawing, omission of the figure, section, and types of section, dimensioning method, writing way of allowable limit size, tolerance of regular size, parts list and assembling drawing, fitting, mechanical elements like screw, key, pin, rivet, spring, bearing, pipe, valve, welding, geometric tolerance and mechanical materials.
Planar graphs theory and algorithms
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.
Summary: beyond fault trees to fault graphs
Alesso, H.P.; Prassinos, P.; Smith, C.F.
1984-09-01
Fault Graphs are the natural evolutionary step over a traditional fault-tree model. A Fault Graph is a failure-oriented directed graph with logic connectives that allows cycles. We intentionally construct the Fault Graph to trace the piping and instrumentation drawing (P and ID) of the system, but with logical AND and OR conditions added. Then we evaluate the Fault Graph with computer codes based on graph-theoretic methods. Fault Graph computer codes are based on graph concepts, such as path set (a set of nodes traveled on a path from one node to another) and reachability (the complete set of all possible paths between any two nodes). These codes are used to find the cut-sets (any minimal set of component failures that will fail the system) and to evaluate the system reliability
Mechatronic modeling and simulation using bond graphs
Das, Shuvra
2009-01-01
Introduction to Mechatronics and System ModelingWhat Is Mechatronics?What Is a System and Why Model Systems?Mathematical Modeling Techniques Used in PracticeSoftwareBond Graphs: What Are They?Engineering SystemsPortsGeneralized VariablesBond GraphsBasic Components in SystemsA Brief Note about Bond Graph Power DirectionsSummary of Bond Direction RulesDrawing Bond Graphs for Simple Systems: Electrical and MechanicalSimplification Rules for Junction StructureDrawing Bond Graphs for Electrical SystemsDrawing Bond Graphs for Mechanical SystemsCausalityDrawing Bond Graphs for Hydraulic and Electronic Components and SystemsSome Basic Properties and Concepts for FluidsBond Graph Model of Hydraulic SystemsElectronic SystemsDeriving System Equations from Bond GraphsSystem VariablesDeriving System EquationsTackling Differential CausalityAlgebraic LoopsSolution of Model Equations and Their InterpretationZeroth Order SystemsFirst Order SystemsSecond Order SystemTransfer Functions and Frequency ResponsesNumerical Solution ...
Optimal Monotone Drawings of Trees
He, Dayu; He, Xin
2016-01-01
A monotone drawing of a graph G is a straight-line drawing of G such that, for every pair of vertices u,w in G, there exists abpath P_{uw} in G that is monotone in some direction l_{uw}. (Namely, the order of the orthogonal projections of the vertices of P_{uw} on l_{uw} is the same as the order they appear in P_{uw}.) The problem of finding monotone drawings for trees has been studied in several recent papers. The main focus is to reduce the size of the drawing. Currently, the smallest drawi...
Symposium: What Is College English?
Bloom, Lynn Z.; White, Edward M.; Enoch, Jessica; Hawk, Byron
2013-01-01
This symposium explores the role(s) College English has (or has not) had in the scholarly work of four scholars. Lynn Bloom explores the many ways College English influenced her work and the work of others throughout their scholarly lives. Edward M. White examines four articles he has published in College English and draws connections between…
Graph Treewidth and Geometric Thickness Parameters
Dujmović, Vida; Wood, David R.
2005-01-01
Consider a drawing of a graph $G$ in the plane such that crossing edges are coloured differently. The minimum number of colours, taken over all drawings of $G$, is the classical graph parameter "thickness". By restricting the edges to be straight, we obtain the "geometric thickness". By further restricting the vertices to be in convex position, we obtain the "book thickness". This paper studies the relationship between these parameters and treewidth. Our first main result states that for grap...
JNCASR
Impact of Women's research in Science and Technology in the new millennium'. The. Symposium will showcase the work done by young Indian Women Scientists in different branches of Science and Engineering, at a wide spectrum of Research ...
1995-01-01
The International Union of Theoretical and Applied Mechanics (IUTAM) decided in 1992 to sponsor the fourth Symposium on Laminar-Turbulent Transition, Sendai/Japan, 1994. The objectives of the present Symposium were to deepen the fundamental knowledge of stability and laminar turbulent transition in three-dimensional and compressible flows and to contribute to recent developing technologies in the field. This Symposium followed the three previous IUTAM-Symposia (Stuttgart 1979, Novosibirsk 1984 and Toulouse 1989). The Scientific Committee selected two keynote lectures and 62 technical papers. The Symposium was held on the 5th to 9th of September, 1994, at the Sendai International Center in Sendai. The participants were 82 scientists from 10 countries. The keynote lectures have critically reviewed recent development of researches concerning the laminar-to-turbulent transition phenomena from the fundamental and the application aspects. Many papers presented were concerned about the detailed mechanism of the bo...
Rachal, John R.
2003-01-01
Uses the framework of a symposium to present an imagined discussion by historical figures about whether and how knowledge might be acquired. Discussants include Democritus, Protagoras, Heraclitus, Socrates, Jesus, Gorgias, Nietzsche, Buddha, and Kierkegaard. (Contains 40 endnotes.) (SK)
Ancestral Genres of Mathematical Graphs
Gerofsky, Susan
2011-01-01
Drawing from sources in gesture studies, cognitive science, the anthropology of religion and art/architecture history, this article explores cultural, bodily and cosmological resonances carried (unintentionally) by mathematical graphs on Cartesian coordinates. Concepts of asymmetric bodily spaces, grids, orthogonality, mapping and sacred spaces…
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...
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
Steinø, Nicolai
2018-01-01
In a time of computer aided design, computer graphics and parametric design tools, the art of architectural drawing is in a state of neglect. But design and drawing are inseparably linked in ways which often go unnoticed. Essentially, it is very difficult, if not impossible, to conceive of a design...... is that computers can represent graphic ideas both faster and better than most medium-skilled draftsmen, drawing in design is not only about representing final designs. In fact, several steps involving the capacity to draw lie before the representation of a final design. Not only is drawing skills an important...... prerequisite for learning about the nature of existing objects and spaces, and thus to build a vocabulary of design. It is also a prerequisite for both reflecting and communicating about design ideas. In this paper, a taxonomy of notation, reflection, communication and presentation drawing is presented...
Kruse Aagaard, Anders; Lahmy, Maya
2014-01-01
This paper aims to discuss the expanding territory of the architectural drawing through digital fabrication processes and with this angle suggest an experimental practice in research and education. At two workshops held throughout June 2014 this approach and mind-set was presented to 2nd year...... on the correlation between tool and drawing. The output of the workshop is considered one accumulated body of drawings and artefacts, mapping some aspect of the method put forward in a tangible materialised approach....
Burgoyne, Greig
2016-01-01
"Only when we move do we see the chains" - Rosa Luxemburg Bad drawing / paper cell is a site-specific drawing performance commissioned for The Prison Drawing Project, Scarborough jail, Yorkshire, presented as a film grafted onto the space that is the cell. It takes the notion of drawing as an act of covering and form of measurement, in an immersive act of attempted liberation. Measuring using rolls of paper, the film chronicles what could be seen as a bad day wallpapering a space, no ass...
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...
Staff Association
2014-01-01
Prize draw Go Sport vouchers 393 members of the Staff Association participated in our free prize draw in July where they could win one of the thirty Go Sport vouchers of 50 euros. The thirty winners have been contacted and can come and collect their voucher from the Staff Association Secretariat.
Whitelaw, James; Wung, T
1992-01-01
A Symposium on Aerothermodynamics of Combustors was held at the Institute of Applied Mechanics of the National Taiwan University from 3 to 5 June 1991 and was attended by 130 delegates from eight countries. The topics of the forty formal presentations included measurements and calculations of isothermal simulations and of combusting flows with one and two phases, and with consideration of configurations ranging from simple diffusion to gas-turbine flows. The discussions inside and outside of the Symposium Hall were lively and an open forum session demonstrated the range of opinions currently and strongly held. The International Union of Theoretical and Applied Mechanics initiated the Symposium under the chairmanship of Professor R S L Lee and with the Scientific Committee listed below. It benefited from sponsorship, again as listed below, and from contributors who presented interesting and up-to-date descriptions of their research. Invited lectures were delivered by Professors R Bilger and F Weinberg and set ...
Narayana, KL; Reddy, K Venkata
2006-01-01
About the Book: Written by three distinguished authors with ample academic and teaching experience, this textbook, meant for diploma and degree students of Mechanical Engineering as well as those preparing for AMIE examination, incorporates the latest standards. The new edition includes the features of assembly drawings, part drawings and computer-aided drawings to cater to the needs of students pursuing various courses. The text of the new edition has been thoroughly revised to include new concepts and practices in the subject. It should prove an ideal textbook. Contents: Introduction
Moving vertices to make drawings plane
Goaoc, X.; Kratochvil, J.; Okamoto, Y.; Shin, C.S.; Wolff, A.; Hong, S.K.; Nishizeki, T.; Quan, W.
2008-01-01
In John Tantalo’s on-line game Planarity the player is given a non-plane straight-line drawing of a planar graph. The aim is to make the drawing plane as quickly as possible by moving vertices. In this paper we investigate the related problem MinMovedVertices which asks for the minimum number of
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
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...
Drawing Contour Trees in the Plane.
Heine, C; Schneider, D; Carr, Hamish; Scheuermann, G
2011-11-01
The contour tree compactly describes scalar field topology. From the viewpoint of graph drawing, it is a tree with attributes at vertices and optionally on edges. Standard tree drawing algorithms emphasize structural properties of the tree and neglect the attributes. Applying known techniques to convey this information proves hard and sometimes even impossible. We present several adaptions of popular graph drawing approaches to the problem of contour tree drawing and evaluate them. We identify five esthetic criteria for drawing contour trees and present a novel algorithm for drawing contour trees in the plane that satisfies four of these criteria. Our implementation is fast and effective for contour tree sizes usually used in interactive systems (around 100 branches) and also produces readable pictures for larger trees, as is shown for an 800 branch example.
Fuel wood symposium; Symposium Energieholz
Wild, C.; Wauer, A. (comps.)
2001-07-01
The Bavarian State Institute of Forestry (LWF) organised a 'Fuel Wood Symposium' in Freising-Weihenstephan on 17.11.2000. The purpose of this specialist conference was to give an overview of the use of biomass, especially wood, as an source of energy. (orig.) [German] Die Bayerische Landesanstalt fuer Wald und Forstwirtschaft richtete am 17.11.2000 in Freising-Weihenstephan das 'Symposium Energieholz' aus. Ziel der Fachtagung war es, einen Ueberblick ueber die energetische Nutzung von Biomasse, insbesondere Holz, zu geben. (orig.)
Owen-Whitred, K.
2015-01-01
Overview/Highlights: To begin, I'd like to take a moment to highlight some of the novel elements of this Symposium as compared to those that have been held in the past. For the first time ever, this Symposium was organized around five concurrent sessions, covering over 300 papers and presentations. These sessions were complemented by an active series of exhibits put on by vendors, universities, ESARDA, INMM, and Member State Support Programmes. We also had live demonstrations throughout the week on everything from software to destructive analysis to instrumentation, which provided the participants the opportunity to see recent developments that are ready for implementation. I'm sure you all had a chance to observe - and, more importantly, interact with - the electronic Poster, or ePoster format used this past week. This technology was used here for the first time ever by the IAEA, and I'm sure was a first for many of us as well. The ePoster format allowed participants to interact with the subject matter, and the subject matter experts, in a dynamic, engaging way. In addition to the novel technology used here, I have to say that having the posters strategically embedded in the sessions on the same topic, by having each poster author introduce his or her topic to the assembled group in order to lure us to the poster area during the breaks, was also a novel and highly effective technique. A final highlight I'd like to touch on in terms of the Symposium organization is the diversity of participation. This chart shows the breakdown by geographical distribution for the Symposium, in terms of participants. There are no labels, so don't try to read any, I simply wanted to demonstrate that we had great representation in terms of both the Symposium participants in general and the session chairs more specifically-and on that note, I would just mention here that 59 Member States participated in the Symposium. But what I find especially interesting and
Anon.
1989-01-15
The recent 8th International Symposium on High Energy Spin Physics at the University of Minnesota in Minneapolis, Minnesota, opened with a bang when L. Pondrom (Wisconsin), donning a hard hat borrowed from construction workers, ventured that 'spin, the notorious inessential complication of hadronic physics, is finally telling us what real QCD (quantum chromodynamics, the field theory of quarks and gluons) looks like.' He was referring to an animated discussion on the meaning of the recent spin oriented (polarized) scattering results from the European Muon Collaboration (EMC) at CERN and reported at the Symposium by R. Garnet (Liverpool) and P. Schuler (Yale) which show that the proton spin is not simply a reflection of the spins of its constituent quarks.
Stefanou, George
2014-01-01
This book contains the proceedings of the IUTAM Symposium on Multiscale Modeling and Uncertainty Quantification of Materials and Structures that was held at Santorini, Greece, September 9 – 11, 2013. It consists of 20 chapters which are divided in five thematic topics: Damage and fracture, homogenization, inverse problems–identification, multiscale stochastic mechanics and stochastic dynamics. Over the last few years, the intense research activity at microscale and nanoscale reflected the need to account for disparate levels of uncertainty from various sources and across scales. As even over-refined deterministic approaches are not able to account for this issue, an efficient blending of stochastic and multiscale methodologies is required to provide a rational framework for the analysis and design of materials and structures. The purpose of this IUTAM Symposium was to promote achievements in uncertainty quantification combined with multiscale modeling and to encourage research and development in this grow...
Drawing Euler Diagrams with Circles
Stapleton, Gem; Zhang, Leishi; Howse, John; Rodgers, Peter
2010-01-01
Euler diagrams are a popular and intuitive visualization tool which are used in a wide variety of application areas, including biological and medical data analysis. As with other data visualization methods, such as graphs, bar charts, or pie charts, the automated generation of an Euler diagram from a suitable data set would be advantageous, removing the burden of manual data analysis and the subsequent task of drawing an appropriate diagram. Various methods have emerged that automatically dra...
Shioiri, Jumpei
1996-01-01
The IUTAM Symposium on Constitutive Relation in High/Very High Strain Rates (CRHVHSR) was held October 16 - 19, 1995, at Seminar House, Science University of Tokyo, under the sponsorship of IUTAM, Japan Society for the Promotion of Science, The Commemorative Association for the Japan World Exposition (1970), Inoue Foundation for Science, The Japan Society for Aeronautical and Space Sciences, and Science University of Tokyo. The proposal to hold the symposium was accepted by the General Assembly of IUT AM held in Haifa, Israel, in August 1992, and the scientists mentioned below were appointed by the Bureau of IUTAM to serve as members of the Scientific Committee. The main object of the symposium was to make a general survey of recent developments in the research of constitutive relations in high and very high strain rates and related problems in high velocity solid mechanics, and to explore further new ideas for dealing with unresolved problems of a fundamental nature as well as of practical importance. The su...
Eigenfunction statistics on quantum graphs
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.
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...
Joint Graph Layouts for Visualizing Collections of Segmented Meshes
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.
Joint Graph Layouts for Visualizing Collections of Segmented Meshes
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.
Drawing images or Architectural drawing
Amparo Bernal López-Sanvicente
2013-10-01
Full Text Available In this article we will discuss how the aesthetic values, that the digital imaging provide, has influenced in drawing and architecture in a historical reading of the evolution of each means of architecture expression. In painting art and photography have been happening genres and styles that have adopted criteria of one or another discipline. When photography became independent from painting as an artistic discipline, its relationship to the architecture affected both the acceptance of its stylistic canon and the broadcast area. With technological development and the emergence of the new concept of digital imaging, it has become an indispensable tool in the whole process of contemporary architecture, which should not contaminate the true sense of the architectural drawing.
Levesque, Emily M.
2017-11-01
This proceeding summarizes the highlights of IAU 329, ``The Lives and Death-Throes of Massive Stars'', held in Auckland, NZ from 28 Nov - 2 Dec. I consider the progress that has been made in the field over the course of these ``beach symposia'', outline the overall content of the conference, and discuss how the current subfields in massive stellar astrophysics have evolved in recent years. I summarize some of the new results and innovative approaches that were presented during the symposium, and conclude with a discussion of how current and future resources in astronomy can serve as valuable tools for studying massive stars in the coming years.
Graph visualization (Invited talk)
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.
Kiciman, Emre; Counts, Scott; Gamon, Michael
2014-01-01
, time and other confounding factors, few of the studies that attempt to extract information from social media actually condition on such factors due to the difficulty in extracting these factors from naturalistic data and the added complexity of including them in analyses. In this paper, we present......Much research has focused on studying complex phenomena through their reflection in social media, from drawing neighborhood boundaries to inferring relationships between medicines and diseases. While it is generally recognized in the social sciences that such studies should be conditioned on gender...... a simple framework for specifying and implementing common social media analyses that makes it trivial to inspect and condition on contextual information. Our data model—discussion graphs—captures both the structural features of relationships inferred from social media as well as the context...
Zhou Hongsheng
2009-01-01
A program of self-generating graph of radiation sampling for geophysical prospecting is developed with AutoLISP, which is developed wholly by the author and can self-generate and explain sampling graphs. The program has largely increased drawing efficiency and can avoid the graph errors due to manual drawing. (authors)
Pedley, Timothy
2003-01-01
The IUTAM Symposium on Flow in Collapsible Tubes and Past Other Highly Compliant Boundaries was held on 26-30 March, 2001, at the University of Warwick. As this was the first scientific meeting of its kind we considered it important to mark the occasion by producing a book. Accordingly, at the end of the Symposium the Scientific Committee met to discuss the most appropriate format for the book. We wished to avoid the format of the conventional conference book consisting of a large number of short articles of varying quality. It was agreed that instead we should produce a limited number of rigorously refereed and edited articles by selected participants who would aim to sum up the state of the art in their particular research area. The outcome is the present book. Peter W. Ca rpenter, Warwick Timothy J. Pedley, Cambridge May, 2002. VB SCIENTIFIC COMMITTEE Co-Chair: P.W. Carpenter, Engineering, Warwiek, UK Co-Chair: TJ. Pedley, DAMTP, Cambridge, UK V.V. Babenko, Hydromechanics, Kiev, Ukraine R. Bannasch, Bionik...
Michel Blanc
2009-01-01
1. The Universe in One Drawing (G. Smoot Physics 2006) 2. Superfluid Properties (R. Richardson Physics 1996) 3. The Asymptotic Freedom of the Quark (David Gross, Physics 2004) 4. Understanding Superfluidity (Anthony Legget, Physics 2003) 5. Taming Infinities (G. 't Hooft, Physics 1999) 6. Homo Diagrammaticus (M. Veltman, Physics 1999) 7. A Tale Of Two Liquids (D. Osheroff, Physics 1996) 8. Wire Proliferation (G. Charpak, Physics 1992) 9. High Temperature Superconductivity (G. Bednorz, Physics 1987) 10. Atomic Cuisine (courtesy of C. Rubbia, Physics 1984) 11. Colliding Charm (S. Ting, Physics 1976) 12. The Bubble Chamber ( D. Glaser, Physics 1960) 13. The Narrow Resonance of the J-Psi (B. Richter, Physics 1976) 14. Stochastic Cooling (S. Van der Meer, Physics 1984) 15. The Good Anomaly (J Steinberger, Physics 1988) 16. Quark Somewhere on the White Paper (R. Taylor, Physics 1990) 17. The Tau of Particle Physics (M. Perl, 1995) 18. NMR Spectroscopy (K. Wuethrich, Chemistry 2002) 19. Coherent States (R....
Pragmatic Graph Rewriting Modifications
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...
Bui, Huy
1993-01-01
Inverse problems occur in a wide variey of fields. In general, the inverse problem can be defined as one where one should estimate the cause from the result, while the direct problem is concerned with how to obtain the result from the cause. The aim of this symposium was to gather scientists and researchers in engineering mechanics concerned with inverse problems in order to exchange research result and develop computational and experimentalapproaches to solve inverse problems. The contributions in this volume cover the following subjects: mathematical and computational aspects of inverse problems, parameter or system identification, shape determination, sensitivity analysis, optimization, material property characterization, ultrasonic nondestructive testing, elastodynamic inverse problems, thermal inverse problems, and other miscellaneous engineering applications.
Neumann, Philipp; Nagel, Wolfgang
2016-01-01
The research and its outcomes presented in this collection focus on various aspects of high-performance computing (HPC) software and its development which is confronted with various challenges as today's supercomputer technology heads towards exascale computing. The individual chapters address one or more of the research directions (1) computational algorithms, (2) system software, (3) application software, (4) data management and exploration, (5) programming, and (6) software tools. The collection thereby highlights pioneering research findings as well as innovative concepts in exascale software development that have been conducted under the umbrella of the priority programme "Software for Exascale Computing" (SPPEXA) of the German Research Foundation (DFG) and that have been presented at the SPPEXA Symposium, Jan 25-27 2016, in Munich. The book has an interdisciplinary appeal: scholars from computational sub-fields in computer science, mathematics, physics, or engineering will find it of particular interest...
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...
Seventh International Beaver Symposium
Yuri A. Gorshkov
2016-01-01
The paper presents data on the seventh international Beaver Symposium. Brief historical background about previous Beaver Symposia beaver is shown. Data on the sections of symposium, number of participants and reports are presented.
Seventh International Beaver Symposium
Yuri A. Gorshkov
2016-05-01
Full Text Available The paper presents data on the seventh international Beaver Symposium. Brief historical background about previous Beaver Symposia beaver is shown. Data on the sections of symposium, number of participants and reports are presented.
Adaptive Graph Convolutional Neural Networks
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...
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.
Graph-theoretical concepts and physicochemical data
Lionello Pogliani
2003-02-01
Full Text Available Graph theoretical concepts have been used to model the molecular polarizabilities of fifty-four organic derivatives, and the induced dipole moment of a set of fifty-seven organic compounds divided into three subsets. The starting point of these modeling strategies is the hydrogen-suppressed chemical graph and pseudograph of a molecule, which works very well for second row atoms. From these types of graphs a set of graph-theoretical basis indices, the molecular connectivity indices, can be derived and used to model properties and activities of molecules. With the aid of the molecular connectivity basis indices it is then possible to build higher-order descriptors. The problem of 'graph' encoding the contribution of the inner-core electrons of heteroatoms can here be solved with the aid of odd complete graphs, Kp-(p-odd. The use of these graph tools allow to draw an optimal modeling of the molecular polarizabilities and a satisfactory modeling of the induced dipole moment of a wide set of organic derivatives.
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
Graphing Inequalities, Connecting Meaning
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…
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.
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,
Fuzzy Graph Language Recognizability
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.
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
Lawford, R.G.; Hubbard, K.G.
1991-01-01
For the purposes of the symposium, the Great Plains area was defined as the three Canadian Prairie provinces of Alberta, Saskatchewan and Manitoba, and eight north central states including North and South Dakota, Nebraska, Montana, Minnesota, Wyoming, Colorado and Kansas, covering over 3.5 million square kilometers. The presentations during the plenary sessions provided a comprehensive overview of the climate change subject and uncertainties, and the resource base and socio-economic structure which it will impact. There was a high degree of unanimity concerning research needs, which fell into seven areas: lack of understanding and models of linkages between climate, the resource base, and socio-economic structures; need for better regional climate change scenarios for use in impact studies; inadequate understanding of natural processes, particularly where physical, biophysical and biogeochemical parameters are operating; need for policy research to enable change of policies and informed decisions; readily available common databases for use in joint U.S./Canada climate studies; an information base and mechanisms to enable more effective communications; and networks to monitor the progress of global warming and its impact on resources
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
Simplicial complexes of graphs
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.
Introduction to quantum graphs
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...
Drawing evaluation report for sampling equipment drawings
WILSON, G.W.
1999-01-01
This document presents the results of a task to evaluate Tank Waste Remediation System (TWRS) sampling equipment drawings and identifies drawings category as either essential, support, or general drawings. This report completes the drawing evaluation task as outlined in Engineering Task Plan For Truck 3 and 4 Drawing Compliance and Evaluation (Wilson, 1997). The scope of this report is limited to an evaluation and identification of drawing category for drawings of certain tank waste sampling equipment for which the TRWS Characterization Project has been assigned custody, including: vapor sampling, grab sampling, auger sampling, and all core sampling equipment (see LMHC Task Order 304). This report does not address drawings for other waste tank deployed equipment systems having similar assigned custody, such as, Light Duty Utility Arm (LDUA), Cone Penetrometer system, or Long Length Contaminated Equipment (LLCE). The LDUA drawings are addressed in the Characterization Equipment Essential Drawings (HNF 1998). The Cone Penetrometer system drawings which are vendor drawings (not H- series) is not currently turned over to operations for deployment. The LLCE equipment was just recently assigned to Characterization Project and were not included in the original scope for this evaluation and will be addressed in the evaluation update scheduled for fiscal year 1999
Graphing trillions of triangles.
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.
Friedlander, Eric; Jahren, Björn; Østvær, Paul
2009-01-01
The 2007 Abel Symposium took place at the University of Oslo in August 2007. The goal of the symposium was to bring together mathematicians whose research efforts have led to recent advances in algebraic geometry, algebraic K-theory, algebraic topology, and mathematical physics. A common theme of this symposium was the development of new perspectives and new constructions with a categorical flavor. As the lectures at the symposium and the papers of this volume demonstrate, these perspectives and constructions have enabled a broadening of vistas, a synergy between once-differentiated subjects, and solutions to mathematical problems both old and new.
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
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...
Pim Heijnen; Adriaan Soetevent
2014-01-01
This paper extends Hotelling's model of price competition with quadratic transportation costs from a line to graphs. We derive an algorithm to calculate firm-level demand for any given graph, conditional on prices and firm locations. These graph models of price competition may lead to spatial discontinuities in firm-level demand. We show that the existence result of D'Aspremont et al. (1979) does not extend to simple star graphs and conjecture that this non-existence result holds more general...
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.
Gelfand, I M; Shnol, E E
1969-01-01
The second in a series of systematic studies by a celebrated mathematician I. M. Gelfand and colleagues, this volume presents students with a well-illustrated sequence of problems and exercises designed to illuminate the properties of functions and graphs. Since readers do not have the benefit of a blackboard on which a teacher constructs a graph, the authors abandoned the customary use of diagrams in which only the final form of the graph appears; instead, the book's margins feature step-by-step diagrams for the complete construction of each graph. The first part of the book employs simple fu
Lothian, Joshua [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Powers, Sarah S. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Sullivan, Blair D. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Baker, Matthew B. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Schrock, Jonathan [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Poole, Stephen W. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)
2013-10-01
The benchmarking effort within the Extreme Scale Systems Center at Oak Ridge National Laboratory seeks to provide High Performance Computing benchmarks and test suites of interest to the DoD sponsor. The work described in this report is a part of the effort focusing on graph generation. A previously developed benchmark, SystemBurn, allowed the emulation of different application behavior profiles within a single framework. To complement this effort, similar capabilities are desired for graph-centric problems. This report examines existing synthetic graph generator implementations in preparation for further study on the properties of their generated synthetic graphs.
Mansutti, Alessio; Miculan, Marino; Peressotti, Marco
2017-01-01
We introduce loose graph simulations (LGS), a new notion about labelled graphs which subsumes in an intuitive and natural way subgraph isomorphism (SGI), regular language pattern matching (RLPM) and graph simulation (GS). Being a unification of all these notions, LGS allows us to express directly...... also problems which are “mixed” instances of previous ones, and hence which would not fit easily in any of them. After the definition and some examples, we show that the problem of finding loose graph simulations is NP-complete, we provide formal translation of SGI, RLPM, and GS into LGSs, and we give...
Alberto Apostolico
2009-08-01
Full Text Available The Web Graph is a large-scale graph that does not fit in main memory, so that lossless compression methods have been proposed for it. This paper introduces a compression scheme that combines efficient storage with fast retrieval for the information in a node. The scheme exploits the properties of the Web Graph without assuming an ordering of the URLs, so that it may be applied to more general graphs. Tests on some datasets of use achieve space savings of about 10% over existing methods.
Graph Theory. 1. Fragmentation of Structural Graphs
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.
Drawing Evaluation Report for Sampling Equipment Drawings
BOGER, R.M.
1999-01-01
This document presents the results of a task to update the evaluation of River Protection Project (WP) sampling equipment drawings and updates the assigned drawings category as either essential, support, or general drawings. This report updates the drawing evaluation that was originally done per Engineering Task Plan For Truck 3 and 4 Drawing Compliance and Evaluation. The scope of this report is limited to updating the evaluation and identification of drawing category for drawings of certain tank waste sampling equipment for which the RPP Characterization Project has been assigned custody, including: vapor sampling, grab sampling, auger sampling, all core sampling equipment, and Light Duty Utility Arm (LDUA) (see LMHC contract No. 519, release 10). This report does not address drawings for other waste tank deployed equipment systems having similar assigned custody, such as, Cone Penetrometer system, or Long Length Contaminated Equipment (LLCE). The Cone Penetrometer system, which is depicted on vendor drawings, (not H- series), is not currently turned over to operations for deployment. The LLCE equipment was just recently assigned to Characterization Project and was not included in the original scope for this update and will be addressed in the evaluation update scheduled for later in fiscal year 1999, when equipment ownership is determined
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
Cohen, A.M.; Beineke, L.W.; Wilson, R.J.; Cameron, P.J.
2004-01-01
In this chapter we investigate the classification of distance-transitive graphs: these are graphs whose automorphism groups are transitive on each of the sets of pairs of vertices at distance i, for i = 0, 1,.... We provide an introduction into the field. By use of the classification of finite
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...
Perepelitsa, VA; Sergienko, [No Value; Kochkarov, AM
1999-01-01
Definitions of prefractal and fractal graphs are introduced, and they are used to formulate mathematical models in different fields of knowledge. The topicality of fractal-graph recognition from the point of view, of fundamental improvement in the efficiency of the solution of algorithmic problems
Husfeldt, Thore
2015-01-01
This chapter presents an introduction to graph colouring algorithms. The focus is on vertex-colouring algorithms that work for general classes of graphs with worst-case performance guarantees in a sequential model of computation. The presentation aims to demonstrate the breadth of available...
Packing Degenerate Graphs Greedily
Allen, P.; Böttcher, J.; Hladký, J.; Piguet, Diana
2017-01-01
Roč. 61, August (2017), s. 45-51 ISSN 1571-0653 R&D Projects: GA ČR GJ16-07822Y Institutional support: RVO:67985807 Keywords : tree packing conjecture * graph packing * graph processes Subject RIV: BA - General Mathematics OBOR OECD: Pure mathematics
Symposium on neutron scattering
Lehmann, M.S.; Saenger, W.; Hildebrandt, G.; Dachs, H.
1984-01-01
Extended abstracts of the named symposium are presented. The first part of this report contains the abstracts of the lectures, the second those of the posters. Topics discussed on the symposium include neutron diffraction and neutron scattering studies in magnetism, solid state chemistry and physics, materials research. Some papers discussing instruments and methods are included too. (GSCH)
Generalized connectivity of graphs
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.
Generating Realistic Labelled, Weighted Random Graphs
Michael Charles Davis
2015-12-01
Full Text Available Generative algorithms for random graphs have yielded insights into the structure and evolution of real-world networks. Most networks exhibit a well-known set of properties, such as heavy-tailed degree distributions, clustering and community formation. Usually, random graph models consider only structural information, but many real-world networks also have labelled vertices and weighted edges. In this paper, we present a generative model for random graphs with discrete vertex labels and numeric edge weights. The weights are represented as a set of Beta Mixture Models (BMMs with an arbitrary number of mixtures, which are learned from real-world networks. We propose a Bayesian Variational Inference (VI approach, which yields an accurate estimation while keeping computation times tractable. We compare our approach to state-of-the-art random labelled graph generators and an earlier approach based on Gaussian Mixture Models (GMMs. Our results allow us to draw conclusions about the contribution of vertex labels and edge weights to graph structure.
Autoregressive Moving Average Graph Filtering
Isufi, Elvin; Loukas, Andreas; Simonetto, Andrea; Leus, Geert
2016-01-01
One of the cornerstones of the field of signal processing on graphs are graph filters, direct analogues of classical filters, but intended for signals defined on graphs. This work brings forth new insights on the distributed graph filtering problem. We design a family of autoregressive moving average (ARMA) recursions, which (i) are able to approximate any desired graph frequency response, and (ii) give exact solutions for tasks such as graph signal denoising and interpolation. The design phi...
Localization in random bipartite graphs: Numerical and empirical study
Slanina, František
2017-05-01
We investigate adjacency matrices of bipartite graphs with a power-law degree distribution. Motivation for this study is twofold: first, vibrational states in granular matter and jammed sphere packings; second, graphs encoding social interaction, especially electronic commerce. We establish the position of the mobility edge and show that it strongly depends on the power in the degree distribution and on the ratio of the sizes of the two parts of the bipartite graph. At the jamming threshold, where the two parts have the same size, localization vanishes. We found that the multifractal spectrum is nontrivial in the delocalized phase, but still near the mobility edge. We also study an empirical bipartite graph, namely, the Amazon reviewer-item network. We found that in this specific graph the mobility edge disappears, and we draw a conclusion from this fact regarding earlier empirical studies of the Amazon network.
Subgraph detection using graph signals
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.
Subgraph detection using graph signals
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.
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
CONTEXT 2015 Doctorial Symposium
Eklund, Peter; wegener, rebekah
2015-01-01
What is the CONTEXT 2015 Doctoral Symposium? The CONTEXT 2015 Doctoral Symposium is an opportunity for doctoral researchers to showcase their work and discuss problems, challenges, and ideas in an open and collegial environment with expert feedback. The Doctoral Symposium is a workshop for doctoral...... feedback and general advice in a constructive atmosphere. Doctoral researchers will present and discuss their research in a supportive atmosphere with other doctoral researchers and an international panel of established researchers that provide expert feedback. The workshop will take place on a single full...... day, Monday November 2, 2015, the day prior to the start of the main CONTEXT 2015 conference....
Haynes Teresa W.
2014-08-01
Full Text Available A path π = (v1, v2, . . . , vk+1 in a graph G = (V,E is a downhill path if for every i, 1 ≤ i ≤ k, deg(vi ≥ deg(vi+1, where deg(vi denotes the degree of vertex vi ∈ V. The downhill domination number equals the minimum cardinality of a set S ⊆ V having the property that every vertex v ∈ V lies on a downhill path originating from some vertex in S. We investigate downhill domination numbers of graphs and give upper bounds. In particular, we show that the downhill domination number of a graph is at most half its order, and that the downhill domination number of a tree is at most one third its order. We characterize the graphs obtaining each of these bounds
Tailored Random Graph Ensembles
Roberts, E S; Annibale, A; Coolen, A C C
2013-01-01
Tailored graph ensembles are a developing bridge between biological networks and statistical mechanics. The aim is to use this concept to generate a suite of rigorous tools that can be used to quantify and compare the topology of cellular signalling networks, such as protein-protein interaction networks and gene regulation networks. We calculate exact and explicit formulae for the leading orders in the system size of the Shannon entropies of random graph ensembles constrained with degree distribution and degree-degree correlation. We also construct an ergodic detailed balance Markov chain with non-trivial acceptance probabilities which converges to a strictly uniform measure and is based on edge swaps that conserve all degrees. The acceptance probabilities can be generalized to define Markov chains that target any alternative desired measure on the space of directed or undirected graphs, in order to generate graphs with more sophisticated topological features.
Alspach, BR
1985-01-01
This volume deals with a variety of problems involving cycles in graphs and circuits in digraphs. Leading researchers in this area present here 3 survey papers and 42 papers containing new results. There is also a collection of unsolved problems.
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.
Hyperbolicity in median graphs
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,.
Geometric and engineering drawing
Morling, K
2010-01-01
The new edition of this successful text describes all the geometric instructions and engineering drawing information that are likely to be needed by anyone preparing or interpreting drawings or designs with plenty of exercises to practice these principles.
Uniform Single Valued Neutrosophic Graphs
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.
Collective Rationality in Graph Aggregation
Endriss, U.; Grandi, U.; Schaub, T.; Friedrich, G.; O'Sullivan, B.
2014-01-01
Suppose a number of agents each provide us with a directed graph over a common set of vertices. Graph aggregation is the problem of computing a single “collective” graph that best represents the information inherent in this profile of individual graphs. We consider this aggregation problem from the
Barra, F.; Gaspard, P.
2001-01-01
We consider the classical evolution of a particle on a graph by using a time-continuous Frobenius-Perron operator that generalizes previous propositions. In this way, the relaxation rates as well as the chaotic properties can be defined for the time-continuous classical dynamics on graphs. These properties are given as the zeros of some periodic-orbit zeta functions. We consider in detail the case of infinite periodic graphs where the particle undergoes a diffusion process. The infinite spatial extension is taken into account by Fourier transforms that decompose the observables and probability densities into sectors corresponding to different values of the wave number. The hydrodynamic modes of diffusion are studied by an eigenvalue problem of a Frobenius-Perron operator corresponding to a given sector. The diffusion coefficient is obtained from the hydrodynamic modes of diffusion and has the Green-Kubo form. Moreover, we study finite but large open graphs that converge to the infinite periodic graph when their size goes to infinity. The lifetime of the particle on the open graph is shown to correspond to the lifetime of a system that undergoes a diffusion process before it escapes
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 ...
Gravina, M.F.; Kunz, P.F.; Rensing, P.E.
1992-09-01
HippoDraw is a NeXTSTEP application for viewing statistical data. It has several unique features which make viewing data distributions highly interactive. It also incorporates a set of simple drawing tools. HippoDraw is written in Objective-C and uses the Hippoplotamus library package to handle the n-tuples and displays
Generative Processes: Thick Drawing
Wallick, Karl
2012-01-01
This article presents techniques and theories of generative drawing as a means for developing complex content in architecture design studios. Appending the word "generative" to drawing adds specificity to the most common representation tool and clarifies that such drawings are not singularly about communication or documentation but are…
XXth symposium neuroradiologicum 2014
NONE
2014-09-15
The volume includes abstracts from lectures and poster presentations during the XXth symposium neuroradiologicum 2014 covering the following issues: Stroke, head and neck, pediatric diagnostic neuroradiology, spine and interventional neuroradiology, adult diagnostic neuroradiology, intravascular interventional neuroradiology.
Ronkainen, H.; Holmberg, K. [eds.
1998-11-01
Cost 516 Tribology action is the first joint European research action focusing on tribology, which originates in the approval of its Memorandum of understanding in February 1994. The COST 516 Tribology Symposium took place in Espoo, Finland from 14th to 15th May 1998. This was the first Symposium of the COST 516 Tribology action. The large number of research contributions at the Symposium, altogether almost SO, and their scientific and technical level, is an indication of the importance and significance of tribology research. The symposium proceedings contain papers in a wide variety of subjects, covering the three categories of the COST 516 Tribology action, namely Grease lubrication (GRIT), Tribology of renewable environmentally adapted lubricants (REAL) and Coatings and surface treatments (CAST). (orig.)
Proxy Graph: Visual Quality Metrics of Big Graph Sampling.
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.
On some covering graphs of a graph
Shariefuddin Pirzada
2016-10-01
Full Text Available For a graph $G$ with vertex set $V(G=\\{v_1, v_2, \\dots, v_n\\}$, let $S$ be the covering set of $G$ having the maximum degree over all the minimum covering sets of $G$. Let $N_S[v]=\\{u\\in S : uv \\in E(G \\}\\cup \\{v\\}$ be the closed neighbourhood of the vertex $v$ with respect to $S.$ We define a square matrix $A_S(G= (a_{ij},$ by $a_{ij}=1,$ if $\\left |N_S[v_i]\\cap N_S[v_j] \\right| \\geq 1, i\
Fundamentals of algebraic graph transformation
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...
The STAPL Parallel Graph Library
Harshvardhan,
2013-01-01
This paper describes the stapl Parallel Graph Library, a high-level framework that abstracts the user from data-distribution and parallelism details and allows them to concentrate on parallel graph algorithm development. It includes a customizable distributed graph container and a collection of commonly used parallel graph algorithms. The library introduces pGraph pViews that separate algorithm design from the container implementation. It supports three graph processing algorithmic paradigms, level-synchronous, asynchronous and coarse-grained, and provides common graph algorithms based on them. Experimental results demonstrate improved scalability in performance and data size over existing graph libraries on more than 16,000 cores and on internet-scale graphs containing over 16 billion vertices and 250 billion edges. © Springer-Verlag Berlin Heidelberg 2013.
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''''.
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...
Subdominant pseudoultrametric on graphs
Dovgoshei, A A; Petrov, E A [Institute of Applied Mathematics and Mechanics, National Academy of Sciences of Ukraine, Donetsk (Ukraine)
2013-08-31
Let (G,w) be a weighted graph. We find necessary and sufficient conditions under which the weight w:E(G)→R{sup +} can be extended to a pseudoultrametric on V(G), and establish a criterion for the uniqueness of such an extension. We demonstrate that (G,w) is a complete k-partite graph, for k≥2, if and only if for any weight that can be extended to a pseudoultrametric, among all such extensions one can find the least pseudoultrametric consistent with w. We give a structural characterization of graphs for which the subdominant pseudoultrametric is an ultrametric for any strictly positive weight that can be extended to a pseudoultrametric. Bibliography: 14 titles.
Quantitative graph theory mathematical foundations and applications
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
Chan, Zenobia C Y
2013-08-01
The implementation of art education in nursing is said to have positive effects on nursing students. Most studies applied visual art dialogues or object design, whereas the effectiveness of drawing as a teaching and learning method is rarely examined and discussed. This paper aimed to discuss the potential and effectiveness of drawing as a learning and teaching method. Four drawings which were created by Hong Kong nursing students are demonstrated and the students' perspectives of how drawing enhanced learning are shown in this paper. Topics on drawing as a fun teaching and learning method and the way it can enhance critical thinking and creativity are also discussed. In conclusion, the activity was a great success, and students enjoyed the learning process and reflected positive comments. However, we cannot conclude that drawing is an effective teaching and learning method based on a single paper, therefore more similar studies should be conducted to investigate this method. Copyright © 2012 Elsevier Ltd. All rights reserved.
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
Dayal, Amit; Brock, David
2018-01-01
Prashant Chandrasekar, a lead developer for the Social Interactome project, has tasked the team with creating a graph representation of the data collected from the social networks involved in that project. The data is currently stored in a MySQL database. The client requested that the graph database be Cayley, but after a literature review, Neo4j was chosen. The reasons for this shift will be explained in the design section. Secondarily, the team was tasked with coming up with three scena...
Stevanovic, Dragan
2015-01-01
Spectral Radius of Graphs provides a thorough overview of important results on the spectral radius of adjacency matrix of graphs that have appeared in the literature in the preceding ten years, most of them with proofs, and including some previously unpublished results of the author. The primer begins with a brief classical review, in order to provide the reader with a foundation for the subsequent chapters. Topics covered include spectral decomposition, the Perron-Frobenius theorem, the Rayleigh quotient, the Weyl inequalities, and the Interlacing theorem. From this introduction, the
Graphs as a Managerial Tool: A Case Study of Du Pont's Use of Graphs in the Early Twentieth Century.
Yates, JoAnne
1985-01-01
Sketches the development of business graphs in America. Examines their early use at Du Pont and the origin of the chart room around 1920, an important factor in the executive control systems at Du Pont. Draws lessons from this case study for managers and teachers of business communication. (PD)
Drawing Theory. An Introduction
Stefano Milani
2014-08-01
Full Text Available Nowadays, drawing practices seem to operate in a rather uncertain field that is typical of an in-between phase of disciplinary development and that needs to be addressed, if an ‘anticipated projection’ of the development of drawing is to be attempted. The field of drawing, as practice and discourse, seems to have entered an end-condition, where the celebration of the extensive production of drawings is combined with a certain fatigue in both its understanding and reflection. Even though the role of drawing is nowadays still regarded as the most common act of architecture, this understanding of drawing is hardly subject to critical inquiries, and, unfortunately, mostly limited to its instrumental role within the representation of the project.A common characteristic in all of the papers in this issue of Footprint is that a specific character of the theoretical field generated by drawing is the elaboration of the correlation between two epistemic regions. This singular character probably belongs to drawing’s structural duality of being simultaneously a simulacrum of a reality and reality itself, memory and anticipation, subject and object, by being in essence the measure of two different facets inherent to architectural thinking. Drawing not only gives consistency to the poles, rendering them architectural matter, but also literally (reconstructs them. At the same time, drawing formalizes the theoretical distance between the two.
2018-01-01
MiniDraw is a teaching-oriented 2D graphics direct manipulation framework in Java, inspired by JHotDraw. It is used in the book "Flexible, Reliable Software - using Patterns and Agile Development", by Henrik Bærbak Christensen, published by CRC Press 2010.......MiniDraw is a teaching-oriented 2D graphics direct manipulation framework in Java, inspired by JHotDraw. It is used in the book "Flexible, Reliable Software - using Patterns and Agile Development", by Henrik Bærbak Christensen, published by CRC Press 2010....
Graph embedding with rich information through heterogeneous graph
Sun, Guolei
2017-01-01
Graph embedding, aiming to learn low-dimensional representations for nodes in graphs, has attracted increasing attention due to its critical application including node classification, link prediction and clustering in social network analysis. Most
Using Graph and Vertex Entropy to Compare Empirical Graphs with Theoretical Graph Models
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.
Handbook of graph grammars and computing by graph transformation
Engels, G; Kreowski, H J; Rozenberg, G
1999-01-01
Graph grammars originated in the late 60s, motivated by considerations about pattern recognition and compiler construction. Since then, the list of areas which have interacted with the development of graph grammars has grown quite impressively. Besides the aforementioned areas, it includes software specification and development, VLSI layout schemes, database design, modeling of concurrent systems, massively parallel computer architectures, logic programming, computer animation, developmental biology, music composition, visual languages, and many others.The area of graph grammars and graph tran
Topics in graph theory graphs and their Cartesian product
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.
Bisseling, R.H.; Byrka, J.; Cerav-Erbas, S.; Gvozdenovic, N.; Lorenz, M.; Pendavingh, R.A.; Reeves, C.; Röger, M.; Verhoeven, A.; Berg, van den J.B.; Bhulai, S.; Hulshof, J.; Koole, G.; Quant, C.; Williams, J.F.
2006-01-01
Splitting a large software system into smaller and more manageable units has become an important problem for many organizations. The basic structure of a software system is given by a directed graph with vertices representing the programs of the system and arcs representing calls from one program to
Coloring geographical threshold graphs
Bradonjic, Milan [Los Alamos National Laboratory; Percus, Allon [Los Alamos National Laboratory; Muller, Tobias [EINDHOVEN UNIV. OF TECH
2008-01-01
We propose a coloring algorithm for sparse random graphs generated by the geographical threshold graph (GTG) model, a generalization of random geometric graphs (RGG). In a GTG, nodes are distributed in a Euclidean space, and edges are assigned according to a threshold function involving the distance between nodes as well as randomly chosen node weights. The motivation for analyzing this model is that many real networks (e.g., wireless networks, the Internet, etc.) need to be studied by using a 'richer' stochastic model (which in this case includes both a distance between nodes and weights on the nodes). Here, we analyze the GTG coloring algorithm together with the graph's clique number, showing formally that in spite of the differences in structure between GTG and RGG, the asymptotic behavior of the chromatic number is identical: {chi}1n 1n n / 1n n (1 + {omicron}(1)). Finally, we consider the leading corrections to this expression, again using the coloring algorithm and clique number to provide bounds on the chromatic number. We show that the gap between the lower and upper bound is within C 1n n / (1n 1n n){sup 2}, and specify the constant C.
Budhiraja, A.S.; Mukherjee, D.; Wu, R.
2017-01-01
We consider a variation of the supermarket model in which the servers can communicate with their neighbors and where the neighborhood relationships are described in terms of a suitable graph. Tasks with unit-exponential service time distributions arrive at each vertex as independent Poisson
Kucharik, Marcel; Hofacker, Ivo; Stadler, Peter
2014-01-01
of the folding free energy landscape, however, can provide the relevant information. Results We introduce the basin hopping graph (BHG) as a novel coarse-grained model of folding landscapes. Each vertex of the BHG is a local minimum, which represents the corresponding basin in the landscape. Its edges connect...
Larsen, Nadia; Neshveyev, Sergey; Skau, Christian
2016-01-01
Like the first Abel Symposium, held in 2004, the Abel Symposium 2015 focused on operator algebras. It is interesting to see the remarkable advances that have been made in operator algebras over these years, which strikingly illustrate the vitality of the field. A total of 26 talks were given at the symposium on a variety of themes, all highlighting the richness of the subject. The field of operator algebras was created in the 1930s and was motivated by problems of quantum mechanics. It has subsequently developed well beyond its initial intended realm of applications and expanded into such diverse areas of mathematics as representation theory, dynamical systems, differential geometry, number theory and quantum algebra. One branch, known as “noncommutative geometry”, has become a powerful tool for studying phenomena that are beyond the reach of classical analysis. This volume includes research papers that present new results, surveys that discuss the development of a specific line of research, and articles ...
The STAPL Parallel Graph Library
Harshvardhan,; Fidel, Adam; Amato, Nancy M.; Rauchwerger, Lawrence
2013-01-01
This paper describes the stapl Parallel Graph Library, a high-level framework that abstracts the user from data-distribution and parallelism details and allows them to concentrate on parallel graph algorithm development. It includes a customizable
Responding to Children's Drawings
Watts, Robert
2010-01-01
This article aims to explore the issues that face primary school teachers when responding to children's drawings. Assessment in art and design is an ongoing concern for teachers with limited experience and confidence in the area and, although children's drawings continue to be a focus of much research, the question of what it is that teachers say…
Architecture, Drawing, Topology
Meldgaard, Morten
This book presents contributions of drawing and text along with their many relationalities from ontology to history and vice versa in a range of reflections on architecture, drawing and topology. We hope to thereby indicate the potential of the theme in understanding not only the architecture of ...
Eppstein, D.; Holten, D.H.R.; Löffler, M.; Nöllenburg, M.; Speckmann, B.; Verbeek, K.A.B.
2013-01-01
We define strict confluent drawing, a form of confluent drawing in which the existence of an edge is indicated by the presence of a smooth path through a system of arcs and junctions (without crossings), and in which such a path, if it exists, must be unique. We prove that it is NP-complete to
Eppstein, D.; Holten, D.; Löffler, M.; Nöllenburg, M.; Speckmann, B.; Verbeek, K.A.B.
2016-01-01
We define strict confluent drawing, a form of confluent drawing in which the existence of an edge is indicated by the presence of a smooth path through a system of arcs and junctions (without crossings), and in which such a path, if it exists, must be unique. We prove that it is NP-complete to
Characterization equipment essential drawing plan
WILSON, G.W.
1999-01-01
The purpose of this document is to list the Characterization equipment drawings that are classified as Essential Drawings. Essential Drawings: Are those drawings identified by the facility staff as necessary to directly support the safe operation of the facility or equipment (HNF 1997a). The Characterization equipment drawings identified in this report are deemed essential drawings as defined in HNF-PRO-242, Engineering Drawing Requirements (HNF 1997a). These drawings will be prepared, revised, and maintained per HNF-PRO-440, Engineering Document Change Control (HNF 1997b). All other Characterization equipment drawings not identified in this document will be considered Support drawings until the Characterization Equipment Drawing Evaluation Report is completed
Winlaw, Manda [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); De Sterck, Hans [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Sanders, Geoffrey [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
2015-10-26
In very simple terms a network can be de ned as a collection of points joined together by lines. Thus, networks can be used to represent connections between entities in a wide variety of elds including engi- neering, science, medicine, and sociology. Many large real-world networks share a surprising number of properties, leading to a strong interest in model development research and techniques for building synthetic networks have been developed, that capture these similarities and replicate real-world graphs. Modeling these real-world networks serves two purposes. First, building models that mimic the patterns and prop- erties of real networks helps to understand the implications of these patterns and helps determine which patterns are important. If we develop a generative process to synthesize real networks we can also examine which growth processes are plausible and which are not. Secondly, high-quality, large-scale network data is often not available, because of economic, legal, technological, or other obstacles [7]. Thus, there are many instances where the systems of interest cannot be represented by a single exemplar network. As one example, consider the eld of cybersecurity, where systems require testing across diverse threat scenarios and validation across diverse network structures. In these cases, where there is no single exemplar network, the systems must instead be modeled as a collection of networks in which the variation among them may be just as important as their common features. By developing processes to build synthetic models, so-called graph generators, we can build synthetic networks that capture both the essential features of a system and realistic variability. Then we can use such synthetic graphs to perform tasks such as simulations, analysis, and decision making. We can also use synthetic graphs to performance test graph analysis algorithms, including clustering algorithms and anomaly detection algorithms.
Automated drawing generation system
Yoshinaga, Toshiaki; Kawahata, Junichi; Yoshida, Naoto; Ono, Satoru
1991-01-01
Since automated CAD drawing generation systems still require human intervention, improvements were focussed on an interactive processing section (data input and correcting operation) which necessitates a vast amount of work. As a result, human intervention was eliminated, the original objective of a computerized system. This is the first step taken towards complete automation. The effects of development and commercialization of the system are as described below. (1) The interactive processing time required for generating drawings was improved. It was determined that introduction of the CAD system has reduced the time required for generating drawings. (2) The difference in skills between workers preparing drawings has been eliminated and the quality of drawings has been made uniform. (3) The extent of knowledge and experience demanded of workers has been reduced. (author)
Groupies in multitype random graphs
Shang, Yilun
2016-01-01
A groupie in a graph is a vertex whose degree is not less than the average degree of its neighbors. Under some mild conditions, we show that the proportion of groupies is very close to 1/2 in multitype random graphs (such as stochastic block models), which include Erd?s-R?nyi random graphs, random bipartite, and multipartite graphs as special examples. Numerical examples are provided to illustrate the theoretical results.
Groupies in multitype random graphs.
Shang, Yilun
2016-01-01
A groupie in a graph is a vertex whose degree is not less than the average degree of its neighbors. Under some mild conditions, we show that the proportion of groupies is very close to 1/2 in multitype random graphs (such as stochastic block models), which include Erdős-Rényi random graphs, random bipartite, and multipartite graphs as special examples. Numerical examples are provided to illustrate the theoretical results.
Temporal Representation in Semantic Graphs
Levandoski, J J; Abdulla, G M
2007-08-07
A wide range of knowledge discovery and analysis applications, ranging from business to biological, make use of semantic graphs when modeling relationships and concepts. Most of the semantic graphs used in these applications are assumed to be static pieces of information, meaning temporal evolution of concepts and relationships are not taken into account. Guided by the need for more advanced semantic graph queries involving temporal concepts, this paper surveys the existing work involving temporal representations in semantic graphs.
Quantum walks on quotient graphs
Krovi, Hari; Brun, Todd A.
2007-01-01
A discrete-time quantum walk on a graph Γ is the repeated application of a unitary evolution operator to a Hilbert space corresponding to the graph. If this unitary evolution operator has an associated group of symmetries, then for certain initial states the walk will be confined to a subspace of the original Hilbert space. Symmetries of the original graph, given by its automorphism group, can be inherited by the evolution operator. We show that a quantum walk confined to the subspace corresponding to this symmetry group can be seen as a different quantum walk on a smaller quotient graph. We give an explicit construction of the quotient graph for any subgroup H of the automorphism group and illustrate it with examples. The automorphisms of the quotient graph which are inherited from the original graph are the original automorphism group modulo the subgroup H used to construct it. The quotient graph is constructed by removing the symmetries of the subgroup H from the original graph. We then analyze the behavior of hitting times on quotient graphs. Hitting time is the average time it takes a walk to reach a given final vertex from a given initial vertex. It has been shown in earlier work [Phys. Rev. A 74, 042334 (2006)] that the hitting time for certain initial states of a quantum walks can be infinite, in contrast to classical random walks. We give a condition which determines whether the quotient graph has infinite hitting times given that they exist in the original graph. We apply this condition for the examples discussed and determine which quotient graphs have infinite hitting times. All known examples of quantum walks with hitting times which are short compared to classical random walks correspond to systems with quotient graphs much smaller than the original graph; we conjecture that the existence of a small quotient graph with finite hitting times is necessary for a walk to exhibit a quantum speedup
Irgens, Marius; Wold, Erlend
2015-01-01
This book focuses on complex geometry and covers highly active topics centered around geometric problems in several complex variables and complex dynamics, written by some of the world’s leading experts in their respective fields. This book features research and expository contributions from the 2013 Abel Symposium, held at the Norwegian University of Science and Technology Trondheim on July 2-5, 2013. The purpose of the symposium was to present the state of the art on the topics, and to discuss future research directions.
A generalization of total graphs
M Afkhami
2018-04-12
Apr 12, 2018 ... product of any lower triangular matrix with the transpose of any element of U belongs to U. The ... total graph of R, which is denoted by T( (R)), is a simple graph with all elements of R as vertices, and ...... [9] Badawi A, On dot-product graph of a commutative ring, Communications in Algebra 43 (2015). 43–50.
Graph transformation tool contest 2008
Rensink, Arend; van Gorp, Pieter
This special section is the outcome of the graph transformation tool contest organised during the Graph-Based Tools (GraBaTs) 2008 workshop, which took place as a satellite event of the International Conference on Graph Transformation (ICGT) 2008. The contest involved two parts: three “off-line case
On dominator colorings in graphs
colors required for a dominator coloring of G is called the dominator .... Theorem 1.3 shows that the complete graph Kn is the only connected graph of order n ... Conversely, if a graph G satisfies condition (i) or (ii), it is easy to see that χd(G) =.
Xuan, Junyu; Lu, Jie; Zhang, Guangquan; Luo, Xiangfeng
2015-12-01
Graph mining has been a popular research area because of its numerous application scenarios. Many unstructured and structured data can be represented as graphs, such as, documents, chemical molecular structures, and images. However, an issue in relation to current research on graphs is that they cannot adequately discover the topics hidden in graph-structured data which can be beneficial for both the unsupervised learning and supervised learning of the graphs. Although topic models have proved to be very successful in discovering latent topics, the standard topic models cannot be directly applied to graph-structured data due to the "bag-of-word" assumption. In this paper, an innovative graph topic model (GTM) is proposed to address this issue, which uses Bernoulli distributions to model the edges between nodes in a graph. It can, therefore, make the edges in a graph contribute to latent topic discovery and further improve the accuracy of the supervised and unsupervised learning of graphs. The experimental results on two different types of graph datasets show that the proposed GTM outperforms the latent Dirichlet allocation on classification by using the unveiled topics of these two models to represent graphs.
XI Symposium on Probability and Stochastic Processes
Pardo, Juan; Rivero, Víctor; Bravo, Gerónimo
2015-01-01
This volume features lecture notes and a collection of contributed articles from the XI Symposium on Probability and Stochastic Processes, held at CIMAT Mexico in September 2013. Since the symposium was part of the activities organized in Mexico to celebrate the International Year of Statistics, the program included topics from the interface between statistics and stochastic processes. The book starts with notes from the mini-course given by Louigi Addario-Berry with an accessible description of some features of the multiplicative coalescent and its connection with random graphs and minimum spanning trees. It includes a number of exercises and a section on unanswered questions. Further contributions provide the reader with a broad perspective on the state-of-the art of active areas of research. Contributions by: Louigi Addario-Berry Octavio Arizmendi Fabrice Baudoin Jochen Blath Loïc Chaumont J. Armando Domínguez-Molina Bjarki Eldon Shui Feng Tulio Gaxiola Adrián González Casanova Evgueni Gordienko Daniel...
Algorithms for Planar Graphs and Graphs in Metric Spaces
Wulff-Nilsen, Christian
structural properties that can be exploited. For instance, a road network or a wire layout on a microchip is typically (near-)planar and distances in the network are often defined w.r.t. the Euclidean or the rectilinear metric. Specialized algorithms that take advantage of such properties are often orders...... of magnitude faster than the corresponding algorithms for general graphs. The first and main part of this thesis focuses on the development of efficient planar graph algorithms. The most important contributions include a faster single-source shortest path algorithm, a distance oracle with subquadratic...... for geometric graphs and graphs embedded in metric spaces. Roughly speaking, the stretch factor is a real value expressing how well a (geo-)metric graph approximates the underlying complete graph w.r.t. distances. We give improved algorithms for computing the stretch factor of a given graph and for augmenting...
Cornes, Michael; van Dongen-Lases, Edmée; Grankvist, Kjell
2017-01-01
does occur if order of draw is not followed during blood collection and when performing venipuncture under less than ideal circumstances, thus putting patient safety at risk. Moreover, given that order of draw is not difficult to follow and knowing that ideal phlebotomy conditions and protocols...... Medicine Working Group for the Preanalytical Phase (EFLM WG-PRE) provides an overview and summary of the literature with regards to order of draw in venous blood collection. Given the evidence presented in this article, the EFLM WG-PRE herein concludes that a significant frequency of sample contamination...
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
Spectral fluctuations of quantum graphs
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
Dynamic Representations of Sparse Graphs
Brodal, Gerth Stølting; Fagerberg, Rolf
1999-01-01
We present a linear space data structure for maintaining graphs with bounded arboricity—a large class of sparse graphs containing e.g. planar graphs and graphs of bounded treewidth—under edge insertions, edge deletions, and adjacency queries. The data structure supports adjacency queries in worst...... case O(c) time, and edge insertions and edge deletions in amortized O(1) and O(c+log n) time, respectively, where n is the number of nodes in the graph, and c is the bound on the arboricity....
Domination criticality in product graphs
M.R. Chithra
2015-07-01
Full Text Available A connected dominating set is an important notion and has many applications in routing and management of networks. Graph products have turned out to be a good model of interconnection networks. This motivated us to study the Cartesian product of graphs G with connected domination number, γc(G=2,3 and characterize such graphs. Also, we characterize the k−γ-vertex (edge critical graphs and k−γc-vertex (edge critical graphs for k=2,3 where γ denotes the domination number of G. We also discuss the vertex criticality in grids.
Graph Creation, Visualisation and Transformation
Maribel Fernández
2010-03-01
Full Text Available We describe a tool to create, edit, visualise and compute with interaction nets - a form of graph rewriting systems. The editor, called GraphPaper, allows users to create and edit graphs and their transformation rules using an intuitive user interface. The editor uses the functionalities of the TULIP system, which gives us access to a wealth of visualisation algorithms. Interaction nets are not only a formalism for the specification of graphs, but also a rewrite-based computation model. We discuss graph rewriting strategies and a language to express them in order to perform strategic interaction net rewriting.
Study of Chromatic parameters of Line, Total, Middle graphs and Graph operators of Bipartite graph
Nagarathinam, R.; Parvathi, N.
2018-04-01
Chromatic parameters have been explored on the basis of graph coloring process in which a couple of adjacent nodes receives different colors. But the Grundy and b-coloring executes maximum colors under certain restrictions. In this paper, Chromatic, b-chromatic and Grundy number of some graph operators of bipartite graph has been investigat
W.T. Doolittle; P.E. Bruns
1969-01-01
This symposium on yellow and paper birch is the third in a series of meetings devoted to discussion of our fine hardwood timber species. The first meeting, held at Carbondale, Illinois, in 1966, dealt with black walnut. The second, held at Houghton, Michigan, in 1968, dealt with sugar maple. The purpose of this third meeting is to bring together our present knowledge...
Symposium summary and prognosis
Bjorken, J.D.
1975-11-01
The summary of the symposium on high energy physics experiments includes phenomena at low energies, the foundations of physics (considered to be mainly gravitation and quantum electrodynamics), standards of reference used for interpretation of experimental data, the new physics, particle proliferation, theoretical development, and a prognosis for the future
Pattison,B
1992-01-01
13me Symposium qui se déroule du 27 au 31 juillet pour la première fois au Cern. Brian Pattison ouvre la cérémonie et donne la parole à Dr.Ugland (qui représente le DG C.Rubbia excusé) et d'autres intervenants
2002
This document contains three papers from a symposium on issues of human resource development (HRD). "The Complex Roots of Human Resource Development" (Monica Lee) discusses the roots of HRD within the framework of the following views of management: (1) classic (the view that managers must be able to create appropriate rules and…
Graph Sampling for Covariance Estimation
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.
International symposium 'Energetics 2006'. Symposium proceedings
2006-01-01
ZEMAK as a civil association, created in the term positive legitimate regulations of our country, presents non party, non political and non profitable association, which primary goal is animation of eperts and other scientific and non scientific workers in the function of permanent following, studying and giving directives for solve the energy problems for a long temporal period. Behind us are fourteen successful years of fertile and wealthy work, which is bringing maimal penetration in domestic as well as foreign scientific field. This successful work of ZEMAK deserves by all members which professional work is in the institutions like: MANU (Macedonian academy of science and art), Technical faculties from the Universities, state and private company from energy field and other civil persons. The main goal of this 9-th International Symposium traditionally is to collect all engineers and eperts from the field of energy, and those which professional life is energy. During this International Symposium will be present, analyze and discuss about 100 incoming papers, prepared by 100th or more authors and coauthors, divided in the following topics: Basic energy and ecology, Renewable energy sources, Energy efficiency and energy saving and Management in energy and regulations.
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...
Canonical Labelling of Site Graphs
Nicolas Oury
2013-06-01
Full Text Available We investigate algorithms for canonical labelling of site graphs, i.e. graphs in which edges bind vertices on sites with locally unique names. We first show that the problem of canonical labelling of site graphs reduces to the problem of canonical labelling of graphs with edge colourings. We then present two canonical labelling algorithms based on edge enumeration, and a third based on an extension of Hopcroft's partition refinement algorithm. All run in quadratic worst case time individually. However, one of the edge enumeration algorithms runs in sub-quadratic time for graphs with "many" automorphisms, and the partition refinement algorithm runs in sub-quadratic time for graphs with "few" bisimulation equivalences. This suite of algorithms was chosen based on the expectation that graphs fall in one of those two categories. If that is the case, a combined algorithm runs in sub-quadratic worst case time. Whether this expectation is reasonable remains an interesting open problem.
Learning heat diffusion graphs
Thanou, Dorina; Dong, Xiaowen; Kressner, Daniel; Frossard, Pascal
2016-01-01
Effective information analysis generally boils down to properly identifying the structure or geometry of the data, which is often represented by a graph. In some applications, this structure may be partly determined by design constraints or pre-determined sensing arrangements, like in road transportation networks for example. In general though, the data structure is not readily available and becomes pretty difficult to define. In particular, the global smoothness assumptions, that most of the...
Syed, M. Qasim; Lovatt, Ian
2014-01-01
This paper is an addition to the series of papers on the exponential function begun by Albert Bartlett. In particular, we ask how the graph of the exponential function y = e[superscript -t/t] would appear if y were plotted versus ln t rather than the normal practice of plotting ln y versus t. In answering this question, we find a new way to…
Understanding Charts and Graphs.
1987-07-28
Farenheit degrees, which have no Onaturalo zero ); finally, ratio scales have numbers that are ordered so that the magnitudes of differences are important and...system. They have to do with the very nature of how marks serve as meaningful symbols. In the ideal case, a chart or graph will be absolutely unambiguous...and these laws comprise this principle (see Stevens, 1974). Absolute discriminability: A minimal magnitude of a mark is necessary for it to be detected
Boyadjiev, Z.
1995-01-01
This paper includes drawings of Kozloduy nuclear power plant needed for study for the seismic analysis and testing. It covers the list and schemes of safety and safety related systems for normal operation as well as protection and control systems
Whalen, Adryce C.
1985-01-01
The author describes activities of a weekly enrichment class providing right-brain tasks to gifted elementary students. Activities, which centered on artistic creativity, were taken from "Drawing On the Right Side of the Brain" by B. Edwards. (CL)
Fourth Tennessee water resources symposium
Sale, M.J.; Presley, P.M.
1991-01-01
The annual Tennessee Water Resources Symposium was initiated in 1988 as a means to bring together people with common interests in the state's important water-related resources at a technical, professional level. Initially the symposium was sponsored by the American Institute of Hydrology and called the Hydrology Symposium, but the Tennessee Section of the American Water Resources Association (AWRA) has taken on the primary coordination role for the symposium over the last two years and the symposium name was changed in 1990 to water resources to emphasize a more inter-disciplinary theme. This year's symposium carries on the successful tradition of the last three years. Our goal is to promote communication and cooperation among Tennessee's water resources professionals: scientists, engineers, and researchers from federal, state, academic, and private institutions and organizations who have interests and responsibilities for the state's water resources. For these conference proceedings, individual papers are processed separately for the Energy Data Base
Headache in children's drawings.
Wojaczyńska-Stanek, Katarzyna; Koprowski, Robert; Wróbel, Zygmunt; Gola, Małgorzata
2008-02-01
Headache is a common health problem in childhood. Children's drawings are helpful in the diagnosis of headache type. Children, especially younger ones, communicate better through pictures than verbally. The aim of the present study is to evaluate the usefulness of drawings of the child's headache in the diagnostic process carried out by a pediatrician and a pediatric neurologist. At the beginning of a visit in a neurological clinic, or on the first day of hospitalization, the child was asked, "Please draw your headache," or "How do you feel your headache?" without any additional explanations or suggestions. Clinical diagnosis of headache type was made on the basis of the standard diagnostic evaluation. For the purpose of this study, children's headaches were categorized as migraine, tension-type headache, or "the others." One hundred twenty-four drawings of children with headaches were analyzed by 8 pediatricians and 8 pediatric neurologists. The analysts were unaware of the clinical history, age, sex, and diagnosis of the patients. The clinical diagnosis was considered the "gold standard" to which the headache drawing diagnosis was compared. There were 68 girls 5-18 years of age and 56 boys 7-18 years of age. Of the 124 children, 40 were clinically diagnosed with migraine (32.2%), 47 with tension-type headache (37.9%), and 37 (29.8%) as the others. Children with migraine most frequently draw sharp elements. Children with tension-type headache mainly drew compression elements and pressing elements. In the group of "the other" headaches, 21 children were diagnosed with somatoform disorders. The most frequent element in this group's drawings was a whirl in the head. Colors used most frequently were black and red, which signify severe pain. There was no difference in sensitivity of diagnoses between neurologists and pediatricians. Because the evaluation of drawings by children with headaches done both by pediatricians and pediatric neurologists was correct for
Graphs cospectral with a friendship graph or its complement
Alireza Abdollahi
2013-12-01
Full Text Available Let $n$ be any positive integer and let $F_n$ be the friendship (or Dutch windmill graph with $2n+1$ vertices and $3n$ edges. Here we study graphs with the same adjacency spectrum as the $F_n$. Two graphs are called cospectral if the eigenvalues multiset of their adjacency matrices are the same. Let $G$ be a graph cospectral with $F_n$. Here we prove that if $G$ has no cycle of length $4$ or $5$, then $Gcong F_n$. Moreover if $G$ is connected and planar then $Gcong F_n$.All but one of connected components of $G$ are isomorphic to $K_2$.The complement $overline{F_n}$ of the friendship graph is determined by its adjacency eigenvalues, that is, if $overline{F_n}$ is cospectral with a graph $H$, then $Hcong overline{F_n}$.
Tank farms essential drawing plan
Domnoske-Rauch, L.A.
1998-01-01
The purpose of this document is to define criteria for selecting Essential Drawings, Support Drawings, and Controlled Print File (CPF) drawings and documents for facilities that are part of East and West Tank Farms. Also, the drawings and documents that meet the criteria are compiled separate listings. The Essential Drawing list and the Support Drawing list establish a priority for updating technical baseline drawings. The CPF drawings, denoted by an asterisk (*), defined the drawings and documents that Operations is required to maintain per the TWRS Administration Manual. The Routing Boards in Buildings 272-WA and 272-AW are not part of the CPF
Decomposing Oriented Graphs into Six Locally Irregular Oriented Graphs
Bensmail, Julien; Renault, Gabriel
2016-01-01
An undirected graph G is locally irregular if every two of its adjacent vertices have distinct degrees. We say that G is decomposable into k locally irregular graphs if there exists a partition E1∪E2∪⋯∪Ek of the edge set E(G) such that each Ei induces a locally irregular graph. It was recently co...
X-Graphs: Language and Algorithms for Heterogeneous Graph Streams
2017-09-01
are widely used by academia and industry. 15. SUBJECT TERMS Data Analytics, Graph Analytics, High-Performance Computing 16. SECURITY CLASSIFICATION...form the core of the DeepDive Knowledge Construction System. 2 INTRODUCTION The goal of the X-Graphs project was to develop computational techniques...memory multicore machine. Ringo is based on Snap.py and SNAP, and uses Python . Ringo now allows the integration of Delite DSL Framework Graph
Endomorphisms of graph algebras
Conti, Roberto; Hong, Jeong Hee; Szymanski, Wojciech
2012-01-01
We initiate a systematic investigation of endomorphisms of graph C*-algebras C*(E), extending several known results on endomorphisms of the Cuntz algebras O_n. Most but not all of this study is focused on endomorphisms which permute the vertex projections and globally preserve the diagonal MASA D...... that the restriction to the diagonal MASA of an automorphism which globally preserves both D_E and the core AF-subalgebra eventually commutes with the corresponding one-sided shift. Secondly, we exhibit several properties of proper endomorphisms, investigate invertibility of localized endomorphisms both on C...
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.
COMPUTING: International symposium
Anon.
1984-01-01
Recent Developments in Computing, Processor, and Software Research for High Energy Physics, a four-day international symposium, was held in Guanajuato, Mexico, from 8-11 May, with 112 attendees from nine countries. The symposium was the third in a series of meetings exploring activities in leading-edge computing technology in both processor and software research and their effects on high energy physics. Topics covered included fixed-target on- and off-line reconstruction processors; lattice gauge and general theoretical processors and computing; multiprocessor projects; electron-positron collider on- and offline reconstruction processors; state-of-the-art in university computer science and industry; software research; accelerator processors; and proton-antiproton collider on and off-line reconstruction processors
Birgisson, Björn; Frost, David; Wang, Linbing
2013-01-01
The micro- and nano-modification of infrastructure materials and the associated multi-scale characterization and simulation has the potential to open up whole new uses and classes of materials, with wide-ranging implications for society. The use of multi-scale characterization and simulation brings the ability to target changes at the very small scale that predictably effect the bulk behavior of the material and thus allowing for the optimization of material behavior and performance. The International RILEM Symposium on Multi-Scale Modeling and Characterization of Infrastructure Materials (Stockholm, June 10-12, 2013) brought together key researchers from around the world to present their findings and ongoing research in this field in a focused environment with extended discussion times. From asphalt to concrete, from chemistry to mechanics, from nano- to macro-scale: the collection of topics covered by the Symposium represents the width and depth of the currently ongoing efforts of developing more sustain...
Pasquali, Anna; Environment and the Formation of Galaxies : 30 years later
2011-01-01
The publication of the morphology - density relation by Alan Dressler in 1980 brought into the limelight the role played by environment in the formation and evolution of galaxies. The symposium Environment and the Formation of Galaxies: 30 years later, was organised with the purpose of establishing the environmental impact on the evolution of galaxies and its dependence on look-back time. Special emphasis was placed on the physical mechanisms that are responsible for transforming galaxies once they are accreted by a group or a cluster, including the observable imprint left in the galaxy HI distribution. Other major topics of the symposium were the environmental dependence of galaxy properties at z ≥ 1 and the implementation of environmental effects in cosmological models of galaxy formation and evolution. This book presents the edited proceedings of this stimulating meeting.
JaxoDraw: A graphical user interface for drawing Feynman diagrams
Binosi, D.; Theußl, L.
2004-08-01
JaxoDraw is a Feynman graph plotting tool written in Java. It has a complete graphical user interface that allows all actions to be carried out via mouse click-and-drag operations in a WYSIWYG fashion. Graphs may be exported to postscript/EPS format and can be saved in XML files to be used for later sessions. One of JaxoDraw's main features is the possibility to create ? code that may be used to generate graphics output, thus combining the powers of ? with those of a modern day drawing program. With JaxoDraw it becomes possible to draw even complicated Feynman diagrams with just a few mouse clicks, without the knowledge of any programming language. Program summaryTitle of program: JaxoDraw Catalogue identifier: ADUA Program summary URL:http://cpc.cs.qub.ac.uk/summaries/ADUA Program obtainable from: CPC Program Library, Queen's University of Belfast, N. Ireland Distribution format: tar gzip file Operating system: Any Java-enabled platform, tested on Linux, Windows ME, XP, Mac OS X Programming language used: Java License: GPL Nature of problem: Existing methods for drawing Feynman diagrams usually require some 'hard-coding' in one or the other programming or scripting language. It is not very convenient and often time consuming, to generate relatively simple diagrams. Method of solution: A program is provided that allows for the interactive drawing of Feynman diagrams with a graphical user interface. The program is easy to learn and use, produces high quality output in several formats and runs on any operating system where a Java Runtime Environment is available. Number of bytes in distributed program, including test data: 2 117 863 Number of lines in distributed program, including test data: 60 000 Restrictions: Certain operations (like internal latex compilation, Postscript preview) require the execution of external commands that might not work on untested operating systems. Typical running time: As an interactive program, the running time depends on the complexity
PARAMETRIC DRAWINGS VS. AUTOLISP
PRUNĂ Liviu
2015-06-01
Full Text Available In this paper the authors make a critical analysis of the advantages offered by the parametric drawing use by comparison with the AutoLISP computer programs used when it comes about the parametric design. Studying and analysing these two work models the authors have got to some ideas and conclusions which should be considered in the moment in that someone must to decide if it is the case to elaborate a software, using the AutoLISP language, or to establish the base rules that must be followed by the drawing, in the idea to construct outlines or blocks which can be used in the projection process.
1999-01-01
The purpose of the Space 2000 Symposium is to present the creativity and achievements of key figures of the 20th century. It offers a retrospective discussion on space exploration. It considers the future of the enterprise, and the legacy that will be left for future generations. The symposium includes panel discussions, smaller session meetings with some panelists, exhibits, and displays. The first session entitled "From Science Fiction to Science Facts" commences after a brief overview of the symposium. The panel discussions include talks on space exploration over many decades, and the missions of the millennium to search for life on Mars. The second session, "Risks and Rewards of Human Space Exploration," focuses on the training and health risks that astronauts face on their exploratory mission to space. Session three, "Messages and Messengers Informing and Inspire Space Exploration and the Public," focuses on the use of TV medium by educators and actors to inform and inspire a wide variety of audiences with adventures of space exploration. Session four, "The Legacy of Carl Sagan," discusses the influences made by Sagan to scientific research and the general public. In session five, "Space Exploration for a new Generation," two student speakers and the NASA Administrator Daniel S. Goldin address the group. Session six, "Destiny or Delusion? -- Humankind's Place in the Cosmos," ends the symposium with issues of space exploration and some thought provoking questions. Some of these issues and questions are: what will be the societal implications if we discover the origin of the universe, stars, or life; what will be the impact if scientists find clear evidence of life outside the domains of the Earth; should there be limits to what humans can or should learn; and what visionary steps should space-faring people take now for future generations.
Anon.
1989-04-15
Late last year, a symposium entitled 'Rare Decays' attracted 115 participants to a hotel in Vancouver, Canada. These participants were particle physicists interested in checking conventional selection rules to look for clues of possible new behaviour outside today's accepted 'Standard Model'. For physicists, 'rare decays' include processes that have so far not been seen, explicitly forbidden by the rules of the Standard Model, or processes highly suppressed because the decay is dominated by an easier route, or includes processes resulting from multiple transitions.
1979 DOE statistical symposium
Gardiner, D.A.; Truett T. (comps. and eds.)
1980-09-01
The 1979 DOE Statistical Symposium was the fifth in the series of annual symposia designed to bring together statisticians and other interested parties who are actively engaged in helping to solve the nation's energy problems. The program included presentations of technical papers centered around exploration and disposal of nuclear fuel, general energy-related topics, and health-related issues, and workshops on model evaluation, risk analysis, analysis of large data sets, and resource estimation.
1981-03-01
This paper gives a report of the paper presented at the symposium held in Hanover on 9 and 10 February 1981. The topics include: the behaviour of dust and coal dust on combustion and explosion; a report on the accidents which occurred at the Laegerdorf cement works' coal crushing and drying plant; current safety requirements at coal crushing and drying plant; and coal crushing and drying. Four papers are individually abstracted. (In German)
1979 DOE statistical symposium
Gardiner, D.A.; Truett, T.
1980-09-01
The 1979 DOE Statistical Symposium was the fifth in the series of annual symposia designed to bring together statisticians and other interested parties who are actively engaged in helping to solve the nation's energy problems. The program included presentations of technical papers centered around exploration and disposal of nuclear fuel, general energy-related topics, and health-related issues, and workshops on model evaluation, risk analysis, analysis of large data sets, and resource estimation
1981-01-01
The 15th ESLAB symposium was held at the end of June 1981 in Amsterdam with the topic being X-ray astronomy. The aim of this symposium was to bring together the international astrophysical community in order to 1. review the present state of X-ray astronomy in the light of new observations gathered in recent missions and to review data on interesting objects in correlated wavelen8th regions; 2. discuss theoretical models describing the phenomena observed; 3. present ESA's European X-ray Observatory Satellite (EXOSAT) and to discuss future X-ray missions and their associated instrumenta tion. These topics seemed to be so interesting for the scientific community that more than 120 contributions were submitted. Of these, 94 were finally accepted and approximately 200 participants attended the 5-day meeting. The symposium was organised in nine sessions covering the whole field. Every main topic was introduced by a review lecture covering the state of-the-art. The aim of the meeting was to assess the impact of...
LHC Nobel Symposium Proceedings
Ekelöf, Tord
2013-12-01
In the summer of 2012, a great discovery emerged at the Large Hadron Collider (LHC) at CERN in Geneva. A plethora of new precision data had already by then been collected by the ATLAS and CMS experiments at LHC, providing further extensive support for the validity of the Standard Model of particle physics. But what now appeared was the first evidence for what was not only the last unverified prediction of the Standard Model, but also perhaps the most decisive one: the prediction made already in 1964 of a unique scalar boson required by the theory of François Englert and Peter Higgs on how fundamental particles acquire mass. At that moment in 2012, it seemed particularly appropriate to start planning a gathering of world experts in particle physics to take stock of the situation and try to answer the challenging question: what next? By May 2013, when the LHC Nobel Symposium was held at the Krusenberg Mansion outside Uppsala in Sweden, the first signs of a great discovery had already turned into fully convincing experimental evidence for the existence of a scalar boson of mass about 125 GeV, having properties compatible with the 50-year-old prediction. And in October 2013, the evidence was deemed so convincing that the Swedish Royal Academy of Sciences awarded the Nobel Prize in Physics to Englert and Higgs for their pioneering work. At the same time the search at the LHC for other particles, beyond those predicted by the Standard Model, with heavier masses up to—and in some cases beyond—1 TeV, had provided no positive result. The triumph of the Standard Model seems resounding, in particular because the mass of the discovered scalar boson is such that, when identified with the Higgs boson, the Standard Model is able to provide predictions at energies as high as the Planck mass, although at the price of accepting that the vacuum would be metastable. However, even if there were some feelings of triumph, the ambience at the LHC Nobel Symposium was more one of
Optimization Problems on Threshold Graphs
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.
Eulerian Graphs and Related Topics
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
Maunz, Peter Lukas Wilhelm [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Sterk, Jonathan David [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Lobser, Daniel [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Parekh, Ojas D. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Ryan-Anderson, Ciaran [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
2016-01-01
In recent years, advanced network analytics have become increasingly important to na- tional security with applications ranging from cyber security to detection and disruption of ter- rorist networks. While classical computing solutions have received considerable investment, the development of quantum algorithms to address problems, such as data mining of attributed relational graphs, is a largely unexplored space. Recent theoretical work has shown that quan- tum algorithms for graph analysis can be more efficient than their classical counterparts. Here, we have implemented a trapped-ion-based two-qubit quantum information proces- sor to address these goals. Building on Sandia's microfabricated silicon surface ion traps, we have designed, realized and characterized a quantum information processor using the hyperfine qubits encoded in two 171 Yb + ions. We have implemented single qubit gates using resonant microwave radiation and have employed Gate set tomography (GST) to characterize the quan- tum process. For the first time, we were able to prove that the quantum process surpasses the fault tolerance thresholds of some quantum codes by demonstrating a diamond norm distance of less than 1 . 9 x 10 [?] 4 . We used Raman transitions in order to manipulate the trapped ions' motion and realize two-qubit gates. We characterized the implemented motion sensitive and insensitive single qubit processes and achieved a maximal process infidelity of 6 . 5 x 10 [?] 5 . We implemented the two-qubit gate proposed by Molmer and Sorensen and achieved a fidelity of more than 97 . 7%.
Mechanical Drawing and Design.
Mikulsky, Marilyn; McEnaney, Walter K.
A syllabus is provided for a comprehensive foundation course in mechanical drawing and design for grades 9, 10, 11, or 12 that is prerequisite to advanced elective courses. Introductory materials include course objectives, an overview of basic concepts, and guidelines for implementation. Brief discussions of and suggestions for the areas of design…
Tvedebrink, Tenna Doktor Olsen; Fisker, Anna Marie; Kirkegaard, Poul Henning
This poster presents a series of drawings depicting the initial considerations made with the Ph.D. project for an improved ‘Interior Design for Food’ in a Danish hospital ward. The project concerns a study on the ontological and symbolic interrelationship possibly existing between food...
Holm, Isak Winkel
2016-01-01
of judgement that distinguishes between the inside and outside of a political community, between citizens and zombies. Second, the chapter focuses on the rhetorics applied to draw the line between rights-bearers and the rightless. ‘Prophetic’ speech, echoing the language of the Old Testament prophets, is vital...
Bernard Tschumi Draws Architecture!
Gevork Hartoonian
2014-08-01
Full Text Available Bernard Tschumi’s delineation prepared for the Museu de Arte Contemporânea provides the starting point for this essay, which discusses the historicity of drawing and highlights the horizontality and the verticality that structure architecture’s contrast with the pictorial realm. Juxtaposing a freehand sketch with the digital image of the same project, Tschumi moves to address the paradox concerning the position of the body and drawing. This drawing also speaks for the reversal in the position of the body brought about by digital reproductivity.The reversal alludes to Tschumi’s theorization of architecture in terms of space and event. These, I will argue, are anticipated in The Manhattan Transcripts (1981 where a set of freehand drawings is used to evoke a filmic mood wherein the image is projected parallel to the spectator’s seated position. The essay goes further, suggesting that the theatricality permeating the present architecture is part of the shift from horizontality to the painterly, and yet the phenomenon is not merely a technical issue. Rather, it alludes to architecture’s dialogical rapport with painting at work since the Renaissance.
Asymptote Misconception on Graphing Functions: Does Graphing Software Resolve It?
Mehmet Fatih Öçal
2017-01-01
Full Text Available Graphing function is an important issue in mathematics education due to its use in various areas of mathematics and its potential roles for students to enhance learning mathematics. The use of some graphing software assists students’ learning during graphing functions. However, the display of graphs of functions that students sketched by hand may be relatively different when compared to the correct forms sketched using graphing software. The possible misleading effects of this situation brought a discussion of a misconception (asymptote misconception on graphing functions. The purpose of this study is two- fold. First of all, this study investigated whether using graphing software (GeoGebra in this case helps students to determine and resolve this misconception in calculus classrooms. Second, the reasons for this misconception are sought. The multiple case study was utilized in this study. University students in two calculus classrooms who received instructions with (35 students or without GeoGebra assisted instructions (32 students were compared according to whether they fell into this misconception on graphing basic functions (1/x, lnx, ex. In addition, students were interviewed to reveal the reasons behind this misconception. Data were analyzed by means of descriptive and content analysis methods. The findings indicated that those who received GeoGebra assisted instruction were better in resolving it. In addition, the reasons behind this misconception were found to be teacher-based, exam-based and some other factors.
Drawing experts have better visual memory while drawing
Perdreau, F.A.G.; Cavanagh, P.
2015-01-01
Drawing involves frequent shifts of gaze between the original and the drawing and visual memory helps compare the original object and the drawing across these gaze shifts while creating and correcting the drawing. It remains unclear whether this memory encodes all of the object or only the features
ON BIPOLAR SINGLE VALUED NEUTROSOPHIC GRAPHS
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.
Welcome and introduction to symposium
humanities, Symposium on Information and technology in the arts and; McLaughlin, Jeremy Lee; Matusiak, Krystyna; Hirsh, Sandra
2015-01-01
Welcome and introduction slides used for presentation at the Virtual Symposium on Information and Technology in the Arts and Humanities, held April 22 and 23, 2015. The Symposium was co-sponsored by the ASIS&T (Association for Information Science and Technology) Special Interest Group for Arts and Humanities (SIG AH) and the Special Interest Group for Visualization, Images, and Sound (SIG VIS).
Graph Theory. 2. Vertex Descriptors and Graph Coloring
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.
On an edge partition and root graphs of some classes of line graphs
K Pravas
2017-04-01
Full Text Available The Gallai and the anti-Gallai graphs of a graph $G$ are complementary pairs of spanning subgraphs of the line graph of $G$. In this paper we find some structural relations between these graph classes by finding a partition of the edge set of the line graph of a graph $G$ into the edge sets of the Gallai and anti-Gallai graphs of $G$. Based on this, an optimal algorithm to find the root graph of a line graph is obtained. Moreover, root graphs of diameter-maximal, distance-hereditary, Ptolemaic and chordal graphs are also discussed.
The planar cubic Cayley graphs
Georgakopoulos, Agelos
2018-01-01
The author obtains a complete description of the planar cubic Cayley graphs, providing an explicit presentation and embedding for each of them. This turns out to be a rich class, comprising several infinite families. He obtains counterexamples to conjectures of Mohar, Bonnington and Watkins. The author's analysis makes the involved graphs accessible to computation, corroborating a conjecture of Droms.
Groupies in random bipartite graphs
Yilun Shang
2010-01-01
A vertex $v$ of a graph $G$ is called a groupie if its degree is notless than the average of the degrees of its neighbors. In thispaper we study the influence of bipartition $(B_1,B_2)$ on groupiesin random bipartite graphs $G(B_1,B_2,p)$ with both fixed $p$ and$p$ tending to zero.
Nested Dynamic Condition Response Graphs
Hildebrandt, Thomas; Mukkamala, Raghava Rao; Slaats, Tijs
2012-01-01
We present an extension of the recently introduced declarative process model Dynamic Condition Response Graphs ( DCR Graphs) to allow nested subgraphs and a new milestone relation between events. The extension was developed during a case study carried out jointly with our industrial partner...
Bell inequalities for graph states
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)
Graph Sampling for Covariance Estimation
Chepuri, Sundeep Prabhakar; Leus, Geert
2017-01-01
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
Network reconstruction via graph blending
Estrada, Rolando
2016-05-01
Graphs estimated from empirical data are often noisy and incomplete due to the difficulty of faithfully observing all the components (nodes and edges) of the true graph. This problem is particularly acute for large networks where the number of components may far exceed available surveillance capabilities. Errors in the observed graph can render subsequent analyses invalid, so it is vital to develop robust methods that can minimize these observational errors. Errors in the observed graph may include missing and spurious components, as well fused (multiple nodes are merged into one) and split (a single node is misinterpreted as many) nodes. Traditional graph reconstruction methods are only able to identify missing or spurious components (primarily edges, and to a lesser degree nodes), so we developed a novel graph blending framework that allows us to cast the full estimation problem as a simple edge addition/deletion problem. Armed with this framework, we systematically investigate the viability of various topological graph features, such as the degree distribution or the clustering coefficients, and existing graph reconstruction methods for tackling the full estimation problem. Our experimental results suggest that incorporating any topological feature as a source of information actually hinders reconstruction accuracy. We provide a theoretical analysis of this phenomenon and suggest several avenues for improving this estimation problem.
A cluster algorithm for graphs
S. van Dongen
2000-01-01
textabstractA cluster algorithm for graphs called the emph{Markov Cluster algorithm (MCL~algorithm) is introduced. The algorithm provides basically an interface to an algebraic process defined on stochastic matrices, called the MCL~process. The graphs may be both weighted (with nonnegative weight)
Quantum chaos on discrete graphs
Smilansky, Uzy
2007-01-01
Adapting a method developed for the study of quantum chaos on quantum (metric) graphs (Kottos and Smilansky 1997 Phys. Rev. Lett. 79 4794, Kottos and Smilansky 1999 Ann. Phys., NY 274 76), spectral ζ functions and trace formulae for discrete Laplacians on graphs are derived. This is achieved by expressing the spectral secular equation in terms of the periodic orbits of the graph and obtaining functions which belong to the class of ζ functions proposed originally by Ihara (1966 J. Mat. Soc. Japan 18 219) and expanded by subsequent authors (Stark and Terras 1996 Adv. Math. 121 124, Kotani and Sunada 2000 J. Math. Sci. Univ. Tokyo 7 7). Finally, a model of 'classical dynamics' on the discrete graph is proposed. It is analogous to the corresponding classical dynamics derived for quantum graphs (Kottos and Smilansky 1997 Phys. Rev. Lett. 79 4794, Kottos and Smilansky 1999 Ann. Phys., NY 274 76). (fast track communication)
RJSplot: Interactive Graphs with R.
Barrios, David; Prieto, Carlos
2018-03-01
Data visualization techniques provide new methods for the generation of interactive graphs. These graphs allow a better exploration and interpretation of data but their creation requires advanced knowledge of graphical libraries. Recent packages have enabled the integration of interactive graphs in R. However, R provides limited graphical packages that allow the generation of interactive graphs for computational biology applications. The present project has joined the analytical power of R with the interactive graphical features of JavaScript in a new R package (RJSplot). It enables the easy generation of interactive graphs in R, provides new visualization capabilities, and contributes to the advance of computational biology analytical methods. At present, 16 interactive graphics are available in RJSplot, such as the genome viewer, Manhattan plots, 3D plots, heatmaps, dendrograms, networks, and so on. The RJSplot package is freely available online at http://rjsplot.net. © 2018 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim.
present proceedings from the UPGEM conference "Draw the Line!" in Copenhagen May 2008. The proceedings include contributions by UPGEM researchers, conference speeches by other researchers, politicians and gender equality officers in which they relate their work and research with the research done in UPGEM......Draw the Line! International Conference, Copenhagen 2008 Papers, proceedings and recommendations is the second publication of the international three year long project "Understanding Puzzles in the Gendered European Map" (UPGEM), which is financed by the European Commission. In this publication we....... The UPGEM research has previously been published in national reports from each of the partner countries (Denmark, Estonia, Finland, Italy and Poland). In these individual national reports of universities as workplaces for male and female researchers we discuss scientific cultures in physics embedded...
Flensborg, Ingelise
The creative drawing process Associated Professor Ingelise Flensborg, PhD The Danish University school of Education, Aarhus University Tuborgvej 164 København NV Why are children's drawings important for the development of cognitive structures and for their development in a visual society......'s. It is a pattern of actions as well as a pattern for action In my doctoral thesis I discussed the connection between spatial orientation and visual representation (as a form of knowledge). I wanted to show the developmental possibilities within spatial cognition in art-education. I used the dynamic theory......, which is supposed to be our most basic cognitive structure. The body's interaction with the environment is decisive for children's spatial representations. In my theoretical and empirical investigations I found that this interaction creates the basic form of cognitive structures. The child...
2002-01-01
At a special colloquium at CERN on 31 May, social psychologist Véronique Ducret will discuss harassment in the workplace. The goal of her seminar is prevention of harassment, how to avoid it and how to react if you find yourself a victim. Harassment takes many forms, some more obvious than others. At first glance, you may think that cases of sexual harassment would be clear-cut, but often there is misunderstanding as to what is unacceptable behaviour. The golden rule is always to put yourself in the other person's shoes. What is important is not necessarily what you intend, but how it is received. A harmless joke to some may be deeply offensive to others. Other forms of harassment, such as moral harassment or 'mobbing' and exclusion are equally pernicious, equally damaging, and also not always clear-cut. In some cases, the perpetrators may not realise the impact of their actions. Following an introduction by the CERN Director of Administration, Jan van der Boon, Ducret's symposium wil...
On characterizing terrain visibility graphs
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.
Graph embedding with rich information through heterogeneous graph
Sun, Guolei
2017-11-12
Graph embedding, aiming to learn low-dimensional representations for nodes in graphs, has attracted increasing attention due to its critical application including node classification, link prediction and clustering in social network analysis. Most existing algorithms for graph embedding only rely on the topology information and fail to use the copious information in nodes as well as edges. As a result, their performance for many tasks may not be satisfactory. In this thesis, we proposed a novel and general framework for graph embedding with rich text information (GERI) through constructing a heterogeneous network, in which we integrate node and edge content information with graph topology. Specially, we designed a novel biased random walk to explore the constructed heterogeneous network with the notion of flexible neighborhood. Our sampling strategy can compromise between BFS and DFS local search on heterogeneous graph. To further improve our algorithm, we proposed semi-supervised GERI (SGERI), which learns graph embedding in an discriminative manner through heterogeneous network with label information. The efficacy of our method is demonstrated by extensive comparison experiments with 9 baselines over multi-label and multi-class classification on various datasets including Citeseer, Cora, DBLP and Wiki. It shows that GERI improves the Micro-F1 and Macro-F1 of node classification up to 10%, and SGERI improves GERI by 5% in Wiki.
CORECLUSTER: A Degeneracy Based Graph Clustering Framework
Giatsidis , Christos; Malliaros , Fragkiskos; Thilikos , Dimitrios M. ,; Vazirgiannis , Michalis
2014-01-01
International audience; Graph clustering or community detection constitutes an important task forinvestigating the internal structure of graphs, with a plethora of applications in several domains. Traditional tools for graph clustering, such asspectral methods, typically suffer from high time and space complexity. In thisarticle, we present \\textsc{CoreCluster}, an efficient graph clusteringframework based on the concept of graph degeneracy, that can be used along withany known graph clusteri...
A linear graph for digoxin radioimmunoassay
Smith, S.E.; Richter, A.
1975-01-01
The determination of drug or hormone concentrations by radio-immunoassay involves interpolation of values for radioisotope counts within standard curves, a technique which requires some dexterity in curve drawing and which results in some inaccuracy in practice. Most of the procedures designed to overcome these difficulties are complex and time-consuming. In radioimmunoassays involving saturation of the antibody-binding sites a special case exists in that the bound radioactivity is directly proportional to the specific activity of the ligand in the system. Thus a graph of the ratio of radioactivity bound in the absence to that in the presence of added non-radioactive ligand is linear against the concentration of added ligand (Hales,C.N., and Randle, P.J., 1963, Biochem. J., vol. 88, 137). A description is given of a simple and convenient modification of their method, and its application to the routine clinical determination of digoxin using a commercial kit (Lanoxitest β digoxin radioimmunoassay kit, Wellcome Reagents Ltd.). Specially constructed graph paper, which yields linearity with standard solutions, was designed so that it could be used directly without data transmission. The specific activity function appears as the upper arithmetical horizontal scale; corresponding values of the concentration of non-radioactive ligand in the solution added were individually calculated and appear on the lower scale opposite the appropriate values of the upper scale. The linearity of the graphs obtained confirmed that binding of digoxin was approximately constant through the range of clinical concentrations tested (0.5 to 8ng/ml), although binding declined slightly at higher concentrations. (U.K.)
Anon.
1989-01-01
Late last year, a symposium entitled 'Rare Decays' attracted 115 participants to a hotel in Vancouver, Canada. These participants were particle physicists interested in checking conventional selection rules to look for clues of possible new behaviour outside today's accepted 'Standard Model'. For physicists, 'rare decays' include processes that have so far not been seen, explicitly forbidden by the rules of the Standard Model, or processes highly suppressed because the decay is dominated by an easier route, or includes processes resulting from multiple transitions
Hierarchy of modular graph identities
D’Hoker, Eric; Kaidi, Justin
2016-01-01
The low energy expansion of Type II superstring amplitudes at genus one is organized in terms of modular graph functions associated with Feynman graphs of a conformal scalar field on the torus. In earlier work, surprising identities between two-loop graphs at all weights, and between higher-loop graphs of weights four and five were constructed. In the present paper, these results are generalized in two complementary directions. First, all identities at weight six and all dihedral identities at weight seven are obtained and proven. Whenever the Laurent polynomial at the cusp is available, the form of these identities confirms the pattern by which the vanishing of the Laurent polynomial governs the full modular identity. Second, the family of modular graph functions is extended to include all graphs with derivative couplings and worldsheet fermions. These extended families of modular graph functions are shown to obey a hierarchy of inhomogeneous Laplace eigenvalue equations. The eigenvalues are calculated analytically for the simplest infinite sub-families and obtained by Maple for successively more complicated sub-families. The spectrum is shown to consist solely of eigenvalues s(s−1) for positive integers s bounded by the weight, with multiplicities which exhibit rich representation-theoretic patterns.
Semantic graphs and associative memories
Pomi, Andrés; Mizraji, Eduardo
2004-12-01
Graphs have been increasingly utilized in the characterization of complex networks from diverse origins, including different kinds of semantic networks. Human memories are associative and are known to support complex semantic nets; these nets are represented by graphs. However, it is not known how the brain can sustain these semantic graphs. The vision of cognitive brain activities, shown by modern functional imaging techniques, assigns renewed value to classical distributed associative memory models. Here we show that these neural network models, also known as correlation matrix memories, naturally support a graph representation of the stored semantic structure. We demonstrate that the adjacency matrix of this graph of associations is just the memory coded with the standard basis of the concept vector space, and that the spectrum of the graph is a code invariant of the memory. As long as the assumptions of the model remain valid this result provides a practical method to predict and modify the evolution of the cognitive dynamics. Also, it could provide us with a way to comprehend how individual brains that map the external reality, almost surely with different particular vector representations, are nevertheless able to communicate and share a common knowledge of the world. We finish presenting adaptive association graphs, an extension of the model that makes use of the tensor product, which provides a solution to the known problem of branching in semantic nets.
Hierarchy of modular graph identities
D’Hoker, Eric; Kaidi, Justin [Mani L. Bhaumik Institute for Theoretical Physics, Department of Physics and Astronomy,University of California,Los Angeles, CA 90095 (United States)
2016-11-09
The low energy expansion of Type II superstring amplitudes at genus one is organized in terms of modular graph functions associated with Feynman graphs of a conformal scalar field on the torus. In earlier work, surprising identities between two-loop graphs at all weights, and between higher-loop graphs of weights four and five were constructed. In the present paper, these results are generalized in two complementary directions. First, all identities at weight six and all dihedral identities at weight seven are obtained and proven. Whenever the Laurent polynomial at the cusp is available, the form of these identities confirms the pattern by which the vanishing of the Laurent polynomial governs the full modular identity. Second, the family of modular graph functions is extended to include all graphs with derivative couplings and worldsheet fermions. These extended families of modular graph functions are shown to obey a hierarchy of inhomogeneous Laplace eigenvalue equations. The eigenvalues are calculated analytically for the simplest infinite sub-families and obtained by Maple for successively more complicated sub-families. The spectrum is shown to consist solely of eigenvalues s(s−1) for positive integers s bounded by the weight, with multiplicities which exhibit rich representation-theoretic patterns.
Animated construction of line drawings
Fu, Hongbo
2011-12-01
Revealing the sketching sequence of a line drawing can be visually intriguing and used for video-based storytelling. Typically this is enabled based on tedious recording of artists\\' drawing process. We demonstrate that it is often possible to estimate a reasonable drawing order from a static line drawing with clearly defined shape geometry, which looks plausible to a human viewer. We map the key principles of drawing order from drawing cognition to computational procedures in our framework. Our system produces plausible animated constructions of input line drawings, with no or little user intervention. We test our algorithm on a range of input sketches, with varying degree of complexity and structure, and evaluate the results via a user study. We also present applications to gesture drawing synthesis and drawing animation creation especially in the context of video scribing.
Animated construction of line drawings
Fu, Hongbo
2011-12-01
Revealing the sketching sequence of a line drawing can be visually intriguing and used for video-based storytelling. Typically this is enabled based on tedious recording of artists\\' drawing process. We demonstrate that it is often possible to estimate a reasonable drawing order from a static line drawing with clearly defined shape geometry, which looks plausible to a human viewer. We map the key principles of drawing order from drawing cognition to computational procedures in our framework. Our system produces plausible animated constructions of input line drawings, with no or little user intervention. We test our algorithm on a range of input sketches, with varying degree of complexity and structure, and evaluate the results via a user study. We also present applications to gesture drawing synthesis and drawing animation creation especially in the context of video scribing. © 2011 ACM.
NIC symposium 2010. Proceedings
Muenster, Gernot [Muenster Univ. (Germany). Inst. fuer Theoretische Physik 1; Wolf, Dietrich [Duisburg-Essen Univ., Duisburg (Germany). Fakultaet fuer Physik; Kremer, Manfred (eds.) [Forschungszentrum Juelich GmbH (DE). Juelich Supercomputing Centre (JSC)
2012-06-21
The fifth NIC-Symposium gave an overview of the activities of the John von Neumann Institute for Computing (NIC) and of the results obtained in the last two years by research groups supported by the NIC. The large recent progress in supercomputing is highlighted by the fact that the newly installed Blue Gene/P system in Juelich - with a peak performance of 1 Petaflop/s - currently ranks number four in the TOP500 list. This development opens new dimensions in simulation science for researchers in Germany and Europe. NIC - a joint foundation of Forschungszentrum Juelich, Deutsches Elektronen-Synchrotron (DESY) and Gesellschaft fuer Schwerionenforschung (GSI) - supports with its members' supercomputer facilities about 130 research groups at universities and national labs working on computer simulations in various fields of science. Fifteen invited lectures covered selected topics in the following fields: Astrophysics Biophysics Chemistry Elementary Particle Physics Condensed Matter Materials Science Soft Matter Science Environmental Research Hydrodynamics and turbulence Plasma Physics Computer Science The talks are intended to inform a broad audience of scientists and the interested public about the research activities at NIC. The proceedings of the symposium cover projects that have been supported by the IBM supercomputers JUMP and IBM Blue Gene/P in Juelich and the APE topical computer at DESY-Zeuthen in an even wider range than the lectures.
NIC symposium 2010. Proceedings
Muenster, Gernot
2012-01-01
The fifth NIC-Symposium gave an overview of the activities of the John von Neumann Institute for Computing (NIC) and of the results obtained in the last two years by research groups supported by the NIC. The large recent progress in supercomputing is highlighted by the fact that the newly installed Blue Gene/P system in Juelich - with a peak performance of 1 Petaflop/s - currently ranks number four in the TOP500 list. This development opens new dimensions in simulation science for researchers in Germany and Europe. NIC - a joint foundation of Forschungszentrum Juelich, Deutsches Elektronen-Synchrotron (DESY) and Gesellschaft fuer Schwerionenforschung (GSI) - supports with its members' supercomputer facilities about 130 research groups at universities and national labs working on computer simulations in various fields of science. Fifteen invited lectures covered selected topics in the following fields: Astrophysics Biophysics Chemistry Elementary Particle Physics Condensed Matter Materials Science Soft Matter Science Environmental Research Hydrodynamics and turbulence Plasma Physics Computer Science The talks are intended to inform a broad audience of scientists and the interested public about the research activities at NIC. The proceedings of the symposium cover projects that have been supported by the IBM supercomputers JUMP and IBM Blue Gene/P in Juelich and the APE topical computer at DESY-Zeuthen in an even wider range than the lectures.
NIC symposium 2010. Proceedings
Muenster, Gernot [Muenster Univ. (Germany). Inst. fuer Theoretische Physik 1; Wolf, Dietrich [Duisburg-Essen Univ., Duisburg (Germany). Fakultaet fuer Physik; Kremer, Manfred [Forschungszentrum Juelich GmbH (DE). Juelich Supercomputing Centre (JSC)
2012-06-21
The fifth NIC-Symposium gave an overview of the activities of the John von Neumann Institute for Computing (NIC) and of the results obtained in the last two years by research groups supported by the NIC. The large recent progress in supercomputing is highlighted by the fact that the newly installed Blue Gene/P system in Juelich - with a peak performance of 1 Petaflop/s - currently ranks number four in the TOP500 list. This development opens new dimensions in simulation science for researchers in Germany and Europe. NIC - a joint foundation of Forschungszentrum Juelich, Deutsches Elektronen-Synchrotron (DESY) and Gesellschaft fuer Schwerionenforschung (GSI) - supports with its members' supercomputer facilities about 130 research groups at universities and national labs working on computer simulations in various fields of science. Fifteen invited lectures covered selected topics in the following fields: Astrophysics Biophysics Chemistry Elementary Particle Physics Condensed Matter Materials Science Soft Matter Science Environmental Research Hydrodynamics and turbulence Plasma Physics Computer Science The talks are intended to inform a broad audience of scientists and the interested public about the research activities at NIC. The proceedings of the symposium cover projects that have been supported by the IBM supercomputers JUMP and IBM Blue Gene/P in Juelich and the APE topical computer at DESY-Zeuthen in an even wider range than the lectures.
International Evoked Potentials Symposium
1980-01-01
The past decade has seen great progress in the measurement of evoked potentials in man; a steady increase in our understanding of their charac teristics, their origins and their usefulness; and a growing application in the field of clinical diagnosis. The topic is a truly multidisciplinary one. Important research contributions have been made by workers of many different backgrounds and clinical applications span the specialities. This book represents a revised and updated version of the work originally presented at the international evoked potential symposium held in Nottingham 4-6 1978. The Nottingham Symposium provided a forum for a state-of-the-art discussion amongst workers from many different disciplines and from many different countries. For each major topic in the field an expert review set the scene for discussion of current research presentations. This format is retained in the book: the chapters in Part A provide the context in which the research presented in Part B is set. The task of selecting m...
Symposium Gyro Technology 1997
Sorg, H [ed.; Stuttgart Univ. (Germany). Inst. A fuer Mechanik
1997-10-01
This volume includes the twenty papers which were presented at the Symposium Gyro Technology 1997. The subjects that have been treated during the symposium were as follows: Performance and design of silicon micromachined gyro; improved rate gyroscope designs designated for fabrication by modern deep silicon etching; micromechanical vibratory rate gyroscopes fabricated in conventional CMOS; error modelling of silicon angular rate sensor; a capacitive accelerometer as an example for surface micromachined inertial sensors; initial production results of a new family of fiber optic gyroscopes; dual-axis multiplexed open loop fiber optic gyroscope; flattely supported vibratory gyro-sensor using a Trident-type tuning fork resonator; innovative mechanizations to optimize inertial sensors for high or low rate operations; design of a planar vibratory gyroscope using electrostatic actuation and electromanetic detection; fiber optic gyro based land navigation system; FOG AHRS and AHRS/GPS navigation system: the low cost solution; GPS/GLONASS/INS-navigation (GLOGINAV); small-sized integrated system of the sea mobile objects attitude and navigation; concepts for hybrid positioning; preliminary results from a large ring laser gyroscope for fundamental physics and geophysics; a `sense of balance` - AHRS with low-cost vibrating-gyroscopes for medical diagnostics; application of strapdown inertial systems of orientation and navigation in intrapipe moving diagnostic apparatus; investigation of a digital readout system for laser gyro; the use of angular rate multiple integrals as input signals for strapdown attitude algorithms. (AKF)
XML Graphs in Program Analysis
Møller, Anders; Schwartzbach, Michael I.
2011-01-01
of XML graphs against different XML schema languages, and provide a software package that enables others to make use of these ideas. We also survey the use of XML graphs for program analysis with four very different languages: XACT (XML in Java), Java Servlets (Web application programming), XSugar......XML graphs have shown to be a simple and effective formalism for representing sets of XML documents in program analysis. It has evolved through a six year period with variants tailored for a range of applications. We present a unified definition, outline the key properties including validation...
Rabern, Landon
2007-01-01
We improve upper bounds on the chromatic number proven independently in \\cite{reedNote} and \\cite{ingo}. Our main lemma gives a sufficient condition for two paths in graph to be completely joined. Using this, we prove that if a graph has an optimal coloring with more than $\\frac{\\omega}{2}$ singleton color classes, then it satisfies $\\chi \\leq \\frac{\\omega + \\Delta + 1}{2}$. It follows that a graph satisfying $n - \\Delta < \\alpha + \\frac{\\omega - 1}{2}$ must also satisfy $\\chi \\leq \\frac{\\ome...
Graphs with Eulerian unit spheres
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...
PARAMETRIC DRAWINGS VS. AUTOLISP
PRUNĂ Liviu; SLONOVSCHI Andrei
2015-01-01
In this paper the authors make a critical analysis of the advantages offered by the parametric drawing use by comparison with the AutoLISP computer programs used when it comes about the parametric design. Studying and analysing these two work models the authors have got to some ideas and conclusions which should be considered in the moment in that someone must to decide if it is the case to elaborate a software, using the AutoLISP language, or to establish the base rules that must be followed...
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.
Drawing evaluation report for sampling equipment drawings; TOPICAL
WILSON, G.W.
1999-01-01
This document presents the results of a task to evaluate Tank Waste Remediation System (TWRS) sampling equipment drawings and identifies drawings category as either essential, support, or general drawings. This report completes the drawing evaluation task as outlined in Engineering Task Plan For Truck 3 and 4 Drawing Compliance and Evaluation (Wilson, 1997). The scope of this report is limited to an evaluation and identification of drawing category for drawings of certain tank waste sampling equipment for which the TRWS Characterization Project has been assigned custody, including: vapor sampling, grab sampling, auger sampling, and all core sampling equipment (see LMHC Task Order 304). This report does not address drawings for other waste tank deployed equipment systems having similar assigned custody, such as, Light Duty Utility Arm (LDUA), Cone Penetrometer system, or Long Length Contaminated Equipment (LLCE). The LDUA drawings are addressed in the Characterization Equipment Essential Drawings (HNF 1998). The Cone Penetrometer system drawings which are vendor drawings (not H- series) is not currently turned over to operations for deployment. The LLCE equipment was just recently assigned to Characterization Project and were not included in the original scope for this evaluation and will be addressed in the evaluation update scheduled for fiscal year 1999
Drawing experts have better visual memory while drawing.
Perdreau, Florian; Cavanagh, Patrick
2015-01-01
Drawing involves frequent shifts of gaze between the original and the drawing and visual memory helps compare the original object and the drawing across these gaze shifts while creating and correcting the drawing. It remains unclear whether this memory encodes all of the object or only the features around the current drawing position and whether both the original and the copy are equally well represented. To address these questions, we designed a "drawing" experiment coupled with a change detection task. A polygon was displayed on one screen and participants had to copy it on another, with the original and the drawing presented in alternation. At unpredictable moments during the copying process, modifications were made on the drawing and the original figure (while they were not in view). Participants had to correct their drawing every time they perceived a change so that their drawing always matched the current original figure. Our results show a better memory representation of the original figure than of the drawing, with locations relevant to the current production most accurately represented. Critically, experts showed better memory for both the original and the drawing than did novices, suggesting that experts have specialized advantages for encoding visual shapes.
Research symposium proceedings. Final report
NONE
1991-12-31
THE research symposium was organized to present the cutting edge research for PET by individuals from leading institutions throughout the world. The Institute for Clinical PET (ICP) has focused its annual meeting on the clinical applications of PET.
International symposium on NMR spectroscopy
The publication consists of 32 papers and presentations from the field of NMR spectroscopy applications submitted to the International Symposium on NMR Spectroscopy held at Smolenice between 29 Sep and 3 Oct, 1980. (B.S.)
Proceedings Forest & Field Fuels Symposium
None
1978-07-01
The purpose of the symposium is to examine two specific renewable resources, forest and field fuels, to pinpoint areas where funding of RD&D would be effective in expanding their marketability and use as substitutes for imported oil.
Third Symposium on Macrocyclic Compounds
1979-01-01
At the Third Symposium on Macrocyclic Compounds there were sessions on facilitated transport, analytical applications, organic synthesis and reactions, phase transfer catalysis, and metal complexation. Abstracts of the individual presentations are included
VIII international electric vehicle symposium
1986-01-01
The proceedings from the symposium are presented. Major topics discussed include: battery technology, powertrains; hybrid vehicles, marketing and economics, propulsion, and electric vehicle design and performance. Each paper has been separately indexed for inclusion in the Energy Data Base.
Fourth symposium on macrocyclic compounds
Christensen, J.J.; Izatt, R.M.
1980-01-01
Both theoretical and experimental aspects of the properties and behavior of synthetic and naturally occurring macrocyclic compounds are covered in this symposium. This document contains abstracts of the papers
ACS Symposium on Molecular Tribology
Gellman, Andrew
2002-01-01
.... The aspects of tribology covered by the symposium were quite broad but included a number of areas of importance to Air Force technologies including vapor phase lubrication, lubrication of MEMS...
Properly colored connectivity of graphs
Li, Xueliang; Qin, Zhongmei
2018-01-01
A comprehensive survey of proper connection of graphs is discussed in this book with real world applications in computer science and network security. Beginning with a brief introduction, comprising relevant definitions and preliminary results, this book moves on to consider a variety of properties of graphs that imply bounds on the proper connection number. Detailed proofs of significant advancements toward open problems and conjectures are presented with complete references. Researchers and graduate students with an interest in graph connectivity and colorings will find this book useful as it builds upon fundamental definitions towards modern innovations, strategies, and techniques. The detailed presentation lends to use as an introduction to proper connection of graphs for new and advanced researchers, a solid book for a graduate level topics course, or as a reference for those interested in expanding and further developing research in the area.
Graph anomalies in cyber communications
Vander Wiel, Scott A [Los Alamos National Laboratory; Storlie, Curtis B [Los Alamos National Laboratory; Sandine, Gary [Los Alamos National Laboratory; Hagberg, Aric A [Los Alamos National Laboratory; Fisk, Michael [Los Alamos National Laboratory
2011-01-11
Enterprises monitor cyber traffic for viruses, intruders and stolen information. Detection methods look for known signatures of malicious traffic or search for anomalies with respect to a nominal reference model. Traditional anomaly detection focuses on aggregate traffic at central nodes or on user-level monitoring. More recently, however, traffic is being viewed more holistically as a dynamic communication graph. Attention to the graph nature of the traffic has expanded the types of anomalies that are being sought. We give an overview of several cyber data streams collected at Los Alamos National Laboratory and discuss current work in modeling the graph dynamics of traffic over the network. We consider global properties and local properties within the communication graph. A method for monitoring relative entropy on multiple correlated properties is discussed in detail.
Open Graphs and Computational Reasoning
Lucas Dixon
2010-06-01
Full Text Available We present a form of algebraic reasoning for computational objects which are expressed as graphs. Edges describe the flow of data between primitive operations which are represented by vertices. These graphs have an interface made of half-edges (edges which are drawn with an unconnected end and enjoy rich compositional principles by connecting graphs along these half-edges. In particular, this allows equations and rewrite rules to be specified between graphs. Particular computational models can then be encoded as an axiomatic set of such rules. Further rules can be derived graphically and rewriting can be used to simulate the dynamics of a computational system, e.g. evaluating a program on an input. Examples of models which can be formalised in this way include traditional electronic circuits as well as recent categorical accounts of quantum information.
Woeginger, G.J.
1998-01-01
In this short note we argue that the toughness of split graphs can be computed in polynomial time. This solves an open problem from a recent paper by Kratsch et al. (Discrete Math. 150 (1996) 231–245).
Generating random networks and graphs
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...
Animated construction of line drawings
Fu, Hongbo; Zhou, Shizhe; Liu, Ligang; Mitra, Niloy J.
2011-01-01
Revealing the sketching sequence of a line drawing can be visually intriguing and used for video-based storytelling. Typically this is enabled based on tedious recording of artists' drawing process. We demonstrate that it is often possible
Graph theory and its applications
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.
A faithful functor among algebras and graphs
Falcón Ganfornina, Óscar Jesús; Falcón Ganfornina, Raúl Manuel; Núñez Valdés, Juan; Pacheco Martínez, Ana María; Villar Liñán, María Trinidad; Vigo Aguiar, Jesús (Coordinador)
2016-01-01
The problem of identifying a functor between the categories of algebras and graphs is currently open. Based on a known algorithm that identifies isomorphisms of Latin squares with isomorphism of vertex-colored graphs, we describe here a pair of graphs that enable us to find a faithful functor between finite-dimensional algebras over finite fields and these graphs.
Graphs with branchwidth at most three
Bodlaender, H.L.; Thilikos, D.M.
1997-01-01
In this paper we investigate both the structure of graphs with branchwidth at most three, as well as algorithms to recognise such graphs. We show that a graph has branchwidth at most three, if and only if it has treewidth at most three and does not contain the three-dimensional binary cube graph
A Modal-Logic Based Graph Abstraction
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
Graphs whose complement and square are isomorphic
Pedersen, Anders Sune
2014-01-01
We study square-complementary graphs, that is, graphs whose complement and square are isomorphic. We prove several necessary conditions for a graph to be square-complementary, describe ways of building new square-complementary graphs from existing ones, construct infinite families of square-compl...
Acyclicity in edge-colored graphs
Gutin, Gregory; Jones, Mark; Sheng, Bin
2017-01-01
A walk W in edge-colored graphs is called properly colored (PC) if every pair of consecutive edges in W is of different color. We introduce and study five types of PC acyclicity in edge-colored graphs such that graphs of PC acyclicity of type i is a proper superset of graphs of acyclicity of type...
Building Scalable Knowledge Graphs for Earth Science
Ramachandran, Rahul; Maskey, Manil; Gatlin, Patrick; Zhang, Jia; Duan, Xiaoyi; Miller, J. J.; Bugbee, Kaylin; Christopher, Sundar; Freitag, Brian
2017-01-01
Knowledge Graphs link key entities in a specific domain with other entities via relationships. From these relationships, researchers can query knowledge graphs for probabilistic recommendations to infer new knowledge. Scientific papers are an untapped resource which knowledge graphs could leverage to accelerate research discovery. Goal: Develop an end-to-end (semi) automated methodology for constructing Knowledge Graphs for Earth Science.
Port-Hamiltonian Systems on Open Graphs
Schaft, A.J. van der; Maschke, B.M.
2010-01-01
In this talk we discuss how to define in an intrinsic manner port-Hamiltonian dynamics on open graphs. Open graphs are graphs where some of the vertices are boundary vertices (terminals), which allow interconnection with other systems. We show that a directed graph carries two natural Dirac
Constructing Dense Graphs with Unique Hamiltonian Cycles
Lynch, Mark A. M.
2012-01-01
It is not difficult to construct dense graphs containing Hamiltonian cycles, but it is difficult to generate dense graphs that are guaranteed to contain a unique Hamiltonian cycle. This article presents an algorithm for generating arbitrarily large simple graphs containing "unique" Hamiltonian cycles. These graphs can be turned into dense graphs…
Skew-adjacency matrices of graphs
Cavers, M.; Cioaba, S.M.; Fallat, S.; Gregory, D.A.; Haemers, W.H.; Kirkland, S.J.; McDonald, J.J.; Tsatsomeros, M.
2012-01-01
The spectra of the skew-adjacency matrices of a graph are considered as a possible way to distinguish adjacency cospectral graphs. This leads to the following topics: graphs whose skew-adjacency matrices are all cospectral; relations between the matchings polynomial of a graph and the characteristic
Chromatic polynomials of random graphs
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.
Commuting graphs of matrix algebras
Akbari, S.; Bidkhori, H.; Mohammadian, A.
2006-08-01
The commuting graph of a ring R, denoted by Γ(R), is a graph whose vertices are all non- central elements of R and two distinct vertices x and y are adjacent if and only if xy = yx. The commuting graph of a group G, denoted by Γ(G), is similarly defined. In this paper we investigate some graph theoretic properties of Γ(M n (F)), where F is a field and n ≥ 2. Also we study the commuting graphs of some classical groups such as GL n (F) and SL n (F). We show that Γ(M n (F)) is a connected graph if and only if every field extension of F of degree n contains a proper intermediate field. We prove that apart from finitely many fields, a similar result is true for Γ(GL n (F)) and Γ(SL n (F)). Also we show that for two fields E and F and integers m, n ≥> 2, if Γ(M m (E)) ≅ Γ(M n (F)), then m = n and vertical bar E vertical bar = vertical bar F vertical bar. (author)
Czech Children's Drawing of Nature
Yilmaz, Zuhal; Kubiatko, Milan; Topal, Hatice
2012-01-01
Do world children draw nature pictures in a certain way? Range of mountains in the background, a sun, couple clouds, a river rising from mountains. Is this type of drawing universal in the way these nature items are organized on a drawing paper? The sample size from Czech Republic included 33 participants from two kindergartens. They were 5 and 6…
Drawing in architectural lighting design
Skipetari, A.; Nijhuis, S.
2011-01-01
Drawing is an important tool for lighting designers. Not only as a means of visual communication but also to aid visual thinking. As a process and product, drawing is a constituent part of the overall lighting design process, from concept to realisation. The emphasis is usually placed on drawing as
Using Behavior Over Time Graphs to Spur Systems Thinking Among Public Health Practitioners.
Calancie, Larissa; Anderson, Seri; Branscomb, Jane; Apostolico, Alexsandra A; Lich, Kristen Hassmiller
2018-02-01
Public health practitioners can use Behavior Over Time (BOT) graphs to spur discussion and systems thinking around complex challenges. Multiple large systems, such as health care, the economy, and education, affect chronic disease rates in the United States. System thinking tools can build public health practitioners' capacity to understand these systems and collaborate within and across sectors to improve population health. BOT graphs show a variable, or variables (y axis) over time (x axis). Although analyzing trends is not new to public health, drawing BOT graphs, annotating the events and systemic forces that are likely to influence the depicted trends, and then discussing the graphs in a diverse group provides an opportunity for public health practitioners to hear each other's perspectives and creates a more holistic understanding of the key factors that contribute to a trend. We describe how BOT graphs are used in public health, how they can be used to generate group discussion, and how this process can advance systems-level thinking. Then we describe how BOT graphs were used with groups of maternal and child health (MCH) practitioners and partners (N = 101) during a training session to advance their thinking about MCH challenges. Eighty-six percent of the 84 participants who completed an evaluation agreed or strongly agreed that they would use this BOT graph process to engage stakeholders in their home states and jurisdictions. The BOT graph process we describe can be applied to a variety of public health issues and used by practitioners, stakeholders, and researchers.
Graph Quasicontinuous Functions and Densely Continuous Forms
Lubica Hola
2017-07-01
Full Text Available Let $X, Y$ be topological spaces. A function $f: X \\to Y$ is said to be graph quasicontinuous if there is a quasicontinuous function $g: X \\to Y$ with the graph of $g$ contained in the closure of the graph of $f$. There is a close relation between the notions of graph quasicontinuous functions and minimal usco maps as well as the notions of graph quasicontinuous functions and densely continuous forms. Every function with values in a compact Hausdorff space is graph quasicontinuous; more generally every locally compact function is graph quasicontinuous.
Automated Vehicles Symposium 2015
Beiker, Sven
2016-01-01
This edited book comprises papers about the impacts, benefits and challenges of connected and automated cars. It is the third volume of the LNMOB series dealing with Road Vehicle Automation. The book comprises contributions from researchers, industry practitioners and policy makers, covering perspectives from the U.S., Europe and Japan. It is based on the Automated Vehicles Symposium 2015 which was jointly organized by the Association of Unmanned Vehicle Systems International (AUVSI) and the Transportation Research Board (TRB) in Ann Arbor, Michigan, in July 2015. The topical spectrum includes, but is not limited to, public sector activities, human factors, ethical and business aspects, energy and technological perspectives, vehicle systems and transportation infrastructure. This book is an indispensable source of information for academic researchers, industrial engineers and policy makers interested in the topic of road vehicle automation.
2014-01-01
Every four years, Schaeffler provides an insight into its latest developments and technologies from the engine, transmission and chassis as well as hybridization and electric mobility sectors. In 2014 the Schaeffler Symposium with the motto “Solving the Powertrain Puzzle” took place from 3th to 4th of April in Baden-Baden. Mobility for tomorrow is the central theme of this proceeding. The authors are discussing the different requirements, which are placed on mobility in different regions of the world. In addition to the company's work in research and development, a comprehensive in-house mobility study also provides a reliable basis for the discussion. The authors are convinced that there will be a paradigm shift in the automotive industry. Issues such as increasing efficiency and advancing electrification of the powertrain, automatic and semi-automatic driving, as well as integration in information networks will define the automotive future. In addition, the variety of solutions available worldwide will ...
NATO Telecommunications Symposium
Lucas, William; Conrath, David
1978-01-01
This book contains the proceedings of the first international symposium devoted to research on the evaluation and planning of new person-to-person telecommunication systems. It was sponsored by NATO's Special Programme Panel on Systems Science and took place, in September 1977, at the University of Bergamo in the north of Italy. Telecommunication systems which provide for communication be tween people, rather than computers or other instruments, are of two kinds. There are mass communication systems (broadcast radio and television) and interpersonal systems (for example, the telephone and Telex) which join together individuals or small groups. Here we have included in the interpersonal category certain systems for re trieving information from computers, essentially those systems in which the role of the computer 1s primarily to act as a store and to identify that information which best fits a user's request. (This excludes management information systems in which the computer performs important transformat...
Genter, N.E.
1996-01-01
The objective of this symposium was to discuss the sorts of evidence of molecular alterations in DNA which can be used to study causation of the stochastic effects of importance in radiation protection. Specifically, the aim was to address the following: what sort of indications might show whether a cancer was caused by radiation; whether there is a radiogenic signature to distinguish damage caused by ionizing radiation; whether bio-markers might be available for susceptibility, for exposure, for biological consequences. Despite a number of epidemiological studies (referred to), there is no clear, credible, defensible answer as to whether low-level radiation increases the risk of cancer. A new ethical question is, what rules should be in place for identifying and protecting genetically sensitive individuals. 1 tab
Osborne, R.V.
1992-01-01
The author defined the objectives of the symposium as follows: to present and examine the recent evidence associating clusters of leukemia with sources of ionizing radiation; to examine the statistical basis for the analysis of clustering; to examine the underlying assumptions in epidemiological studies that clusters must have an environmental cause; to examine the extent to which we can take into account the biological causes of non-randomness in populations, particularly those of geographic and genetic origin; to evaluate the relative merits of different kinds of epidemiological studies for yielding significant information concerning clustering; to consider the potential utility of combining the results from existing studies, and whether new epidemiological studies might be helpful; to consider what other directions, including application of the technologies of molecular biology, are likely to help clarify the underlying mechanisms or causes
SYMPOSIUM: Particle identification
Anon.
1989-07-15
Typical elementary particle experiments consist of a source of interactions (an external beam and a fixed target or two colliding beams) and a detector system including most of the following components: a tracking system and analysis magnet, calorimetry (measurement of energy deposition), hadron and electron identification, muon detection, trigger counters and processors, and data acquisition electronics. Experiments aimed at future high luminosity hadron collider (proton-proton or proton-antiproton) projects such as an upgraded Tevatron at Fermilab, the Large Hadron Collider (LHC) idea at CERN, and the proposed US Superconducting Supercollider (SSC), must ideally cover the entire solid angle and be capable of not only surviving the collisions, but also providing high resolution event information at incredible interaction rates. The Symposium on Particle Identification at High Luminosity Hadron Colliders held at Fermilab from 5-7 April (sponsored by Fermilab, the US Department of Energy, and the SSC Central Design Group) focused on this single facet of detector technology.
Design Modelling Symposium 2015
Tamke, Martin; Gengnagel, Christoph; Faircloth, Billie; Scheurer, Fabian
2015-01-01
This book reflects and expands on the current trend in the building industry to understand, simulate and ultimately design buildings by taking into consideration the interlinked elements and forces that act on them. This approach overcomes the traditional, exclusive focus on building tasks, while posing new challenges in all areas of the industry from material and structural to the urban scale. Contributions from invited experts, papers and case studies provide the reader with a comprehensive overview of the field, as well as perspectives from related disciplines, such as computer science. The chapter authors were invited speakers at the 5th Symposium "Modelling Behaviour", which took place at the CITA in Copenhagen in September 2015.
Automated Vehicles Symposium 2014
Beiker, Sven; Road Vehicle Automation 2
2015-01-01
This paper collection is the second volume of the LNMOB series on Road Vehicle Automation. The book contains a comprehensive review of current technical, socio-economic, and legal perspectives written by experts coming from public authorities, companies and universities in the U.S., Europe and Japan. It originates from the Automated Vehicle Symposium 2014, which was jointly organized by the Association for Unmanned Vehicle Systems International (AUVSI) and the Transportation Research Board (TRB) in Burlingame, CA, in July 2014. The contributions discuss the challenges arising from the integration of highly automated and self-driving vehicles into the transportation system, with a focus on human factors and different deployment scenarios. This book is an indispensable source of information for academic researchers, industrial engineers, and policy makers interested in the topic of road vehicle automation.
Nunno, Giulia; Lindstrøm, Tom; Øksendal, Bernt; Zhang, Tusheng
2007-01-01
Kiyosi Ito, the founder of stochastic calculus, is one of the few central figures of the twentieth century mathematics who reshaped the mathematical world. Today stochastic calculus is a central research field with applications in several other mathematical disciplines, for example physics, engineering, biology, economics and finance. The Abel Symposium 2005 was organized as a tribute to the work of Kiyosi Ito on the occasion of his 90th birthday. Distinguished researchers from all over the world were invited to present the newest developments within the exciting and fast growing field of stochastic analysis. The present volume combines both papers from the invited speakers and contributions by the presenting lecturers. A special feature is the Memoirs that Kiyoshi Ito wrote for this occasion. These are valuable pages for both young and established researchers in the field.
Anon.
1982-01-01
The thirteenth symposium in the successful series on multiparticle dynamics was held from 6-11 June in the picturesque North Holland village of Volendam. While originally confined to hadron-hadron interactions, multiparticle dynamics is now of interest in all types of particle collision. Results on proton-antiproton collisions at CERN, both in the SPS and the ISR, are a talking point wherever particle physicists meet, and Volendam was no exception. Also prominent at Volendam were ultrarelativistic effects in nucleus-nucleus collisions. However the main aim of this year's meeting was to review the common features of hadrons produced in different types of collision (lepton-lepton, lepton-hadron and hadron-hadron)
2016-01-01
Representatives of state universities, public institutions and Costa Rican private sector, and American experts have exposed projects or experiences about the use and generation of renewable energy in different fields. The thematics presented have been about: development of smart grids and design of electrical energy production systems that allow money saving and reducing emissions to the environment; studies on the use of non-traditional plants and agricultural waste; sustainable energy model in the process of coffee production; experiments from biomass for the fabrication of biodiesel, biogas production and storage; and the use of non-conventional energy. Researches were presented at the Renewable Energy Symposium, organized by the Centro de Investigacion en Estructuras Microscopicas and support of the Vicerrectoria de Investigacion, both from the Universidad de Costa Rica [es
Owren, Brynjulf
2008-01-01
The 2006 Abel symposium is focusing on contemporary research involving interaction between computer science, computational science and mathematics. In recent years, computation has been affecting pure mathematics in fundamental ways. Conversely, ideas and methods of pure mathematics are becoming increasingly important within computational and applied mathematics. At the core of computer science is the study of computability and complexity for discrete mathematical structures. Studying the foundations of computational mathematics raises similar questions concerning continuous mathematical structures. There are several reasons for these developments. The exponential growth of computing power is bringing computational methods into ever new application areas. Equally important is the advance of software and programming languages, which to an increasing degree allows the representation of abstract mathematical structures in program code. Symbolic computing is bringing algorithms from mathematical analysis into the...
SYMPOSIUM: Multiparticle Dynamics
Anon.
1984-09-15
How is the seemingly simple world of quarks and leptons related to the complicated phenomena that particle physicists see in their detectors? This was the theme of the 15th Symposium on multiparticle dynamics held in Lund, Sweden, from 11-16 June. Apart from the many results from the CERN proton-antiproton Collider, a recurrent theme during the conference was the growing awareness of the importance of quark 'hadronization'. Everyone knows that isolated quarks have never been found in Nature. Only those combinations of quarks and antiquarks that form hadrons have been detected. The dressing of the quarks to become hadrons goes under the name 'hadronization' and this process is very difficult to describe theoretically from first principles. Even the currently accepted theory for strong quark interactions — quantum chromodynamics, QCD — has difficulties. QCD has been shown to be a good theory describing 'small distance phenomena' — small compared to a hadron.
Interactive Graph Layout of a Million Nodes
Peng Mi; Maoyuan Sun; Moeti Masiane; Yong Cao; Chris North
2016-01-01
Sensemaking of large graphs, specifically those with millions of nodes, is a crucial task in many fields. Automatic graph layout algorithms, augmented with real-time human-in-the-loop interaction, can potentially support sensemaking of large graphs. However, designing interactive algorithms to achieve this is challenging. In this paper, we tackle the scalability problem of interactive layout of large graphs, and contribute a new GPU-based force-directed layout algorithm that exploits graph to...
Khovanov homology of graph-links
Nikonov, Igor M [M. V. Lomonosov Moscow State University, Faculty of Mechanics and Mathematics, Moscow (Russian Federation)
2012-08-31
Graph-links arise as the intersection graphs of turning chord diagrams of links. Speaking informally, graph-links provide a combinatorial description of links up to mutations. Many link invariants can be reformulated in the language of graph-links. Khovanov homology, a well-known and useful knot invariant, is defined for graph-links in this paper (in the case of the ground field of characteristic two). Bibliography: 14 titles.
PRIVATE GRAPHS – ACCESS RIGHTS ON GRAPHS FOR SEAMLESS NAVIGATION
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.
Architectural Drawing - an Animate Field
Hougaard, Anna Katrine
2015-01-01
Architectural drawing is changing because architects today draw with computers. Due to this change digital diagrams employed by computational architectural practices are often emphasized as powerful structures of control and organisation in the design process. But there are also diagrams, which do...... ways of directing behaviour of artefacts and living things without controlling this behaviour completely. I analyse a musical composition by John Cage as an example of a sketch diagram, and then hypothesize that orthogonal, architectural drawing can work in similar ways. Thereby I hope to point out...... important affordance of architectural drawing as a ¬hybrid between the openness of hand-sketching and the rule-based-ness of diagramming, an affordance which might be useful in the migrational zone of current architectural drawing where traditional hand drawing techniques and computer drawing techniques...
Symposium Promotes Technological Literacy through STEM
Havice, Bill; Marshall, Jerry
2009-01-01
This article describes a symposium which promotes technological literacy through science, technology, engineering, and mathematics (STEM). The three-day symposium titled, "The Anderson, Oconee, Pickens Symposium on Teaching and Learning STEM Standards for the 21st Century," was held August 4-6, 2008 at the Tri-County Technical College…
Andreas P. Braun
2016-04-01
Full Text Available Box graphs succinctly and comprehensively characterize singular fibers of elliptic fibrations in codimension two and three, as well as flop transitions connecting these, in terms of representation theoretic data. We develop a framework that provides a systematic map between a box graph and a crepant algebraic resolution of the singular elliptic fibration, thus allowing an explicit construction of the fibers from a singular Weierstrass or Tate model. The key tool is what we call a fiber face diagram, which shows the relevant information of a (partial toric triangulation and allows the inclusion of more general algebraic blowups. We shown that each such diagram defines a sequence of weighted algebraic blowups, thus providing a realization of the fiber defined by the box graph in terms of an explicit resolution. We show this correspondence explicitly for the case of SU(5 by providing a map between box graphs and fiber faces, and thereby a sequence of algebraic resolutions of the Tate model, which realizes each of the box graphs.
Degree-based graph construction
Kim, Hyunju; Toroczkai, Zoltan; Erdos, Peter L; Miklos, Istvan; Szekely, Laszlo A
2009-01-01
Degree-based graph construction is a ubiquitous problem in network modelling (Newman et al 2006 The Structure and Dynamics of Networks (Princeton Studies in Complexity) (Princeton, NJ: Princeton University Press), Boccaletti et al 2006 Phys. Rep. 424 175), ranging from social sciences to chemical compounds and biochemical reaction networks in the cell. This problem includes existence, enumeration, exhaustive construction and sampling questions with aspects that are still open today. Here we give necessary and sufficient conditions for a sequence of nonnegative integers to be realized as a simple graph's degree sequence, such that a given (but otherwise arbitrary) set of connections from an arbitrarily given node is avoided. We then use this result to present a swap-free algorithm that builds all simple graphs realizing a given degree sequence. In a wider context, we show that our result provides a greedy construction method to build all the f-factor subgraphs (Tutte 1952 Can. J. Math. 4 314) embedded within K n setmn S k , where K n is the complete graph and S k is a star graph centred on one of the nodes. (fast track communication)
Hierarchical organisation of causal graphs
Dziopa, P.
1993-01-01
This paper deals with the design of a supervision system using a hierarchy of models formed by graphs, in which the variables are the nodes and the causal relations between the variables of the arcs. To obtain a representation of the variables evolutions which contains only the relevant features of their real evolutions, the causal relations are completed with qualitative transfer functions (QTFs) which produce roughly the behaviour of the classical transfer functions. Major improvements have been made in the building of the hierarchical organization. First, the basic variables of the uppermost level and the causal relations between them are chosen. The next graph is built by adding intermediary variables to the upper graph. When the undermost graph has been built, the transfer functions parameters corresponding to its causal relations are identified. The second task consists in the upwelling of the information from the undermost graph to the uppermost one. A fusion procedure of the causal relations has been designed to compute the QFTs relevant for each level. This procedure aims to reduce the number of parameters needed to represent an evolution at a high level of abstraction. These techniques have been applied to the hierarchical modelling of nuclear process. (authors). 8 refs., 12 figs
Integer Flows and Circuit Covers of Graphs and Signed Graphs
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
Integrated color face graphs for plant accident display
Hara, Fumio
1987-01-01
This paper presents an integrated man-machine interface that uses cartoon-like colored graphs in the form of faces, that, through different facial expressions, display a plant condition. This is done by drawing the face on a CRT by nonlinearly transforming 31 variables and coloring the face. This integrated color graphics technique is applied to display the progess of events in the Three Mile Island nuclear power plant accident. Human visual perceptive characteristics are investigated in relation to the perception of the plant accident process, the naturality in face color change, and the consistency between facial expressions and colors. This paper concludes that colors used in an integrated color face graphs must be completely consistent with emotional feelings perceived from the colors. (author)
Examining Graphing Calculator Affordances in Learning Pre-Calculus among Undergraduate Students
Nzuki, Francis
2016-01-01
This study examines graphing calculator affordances in learning mathematics among college precalculus students. The study draws from the Cognitive Load Theory (CLT) and the "Intelligent Technology" theoretical framework proposed by Salomon, Perkins, and Globerson (1991). From these perspectives the effects "with" the graphing…
International Symposium on Nuclear Safety
2013-03-01
Nuclear Regulatory Authority of the Slovak Republic and the Embassy of Japan in the Slovak Republic, under the auspices of the Deputy Prime Minister and Minister of Foreign and European Affairs Mr Lajcak organized International Symposium on Nuclear Safety on 14 and 15 March 2013. The symposium took place almost exactly two years after the occurrence of accidents at the Japanese nuclear power plant Fukushima Daichi. The main mission of the symposium was an attempt to contribute to the improvement of nuclear safety by sharing information and lessons presented by Japanese experts with experts from the region, the International Atomic Energy Agency (IAEA) and the European Commission. The aim of the symposium, unlike many other events organized in connection with the events in Fukushima Daichi NPP, was a summary of the results of stress tests and measures update adopted by the international community, especially within Europe. Panel discussion was included to the program of the symposium for this aim was, mainly focused on the current state of implementation of the National Action Plan of the Slovak Republic, the Czech Republic, Poland, Ukraine and Switzerland and the IAEA Action Plan.
Graph modeling systems and methods
Neergaard, Mike
2015-10-13
An apparatus and a method for vulnerability and reliability modeling are provided. The method generally includes constructing a graph model of a physical network using a computer, the graph model including a plurality of terminating vertices to represent nodes in the physical network, a plurality of edges to represent transmission paths in the physical network, and a non-terminating vertex to represent a non-nodal vulnerability along a transmission path in the physical network. The method additionally includes evaluating the vulnerability and reliability of the physical network using the constructed graph model, wherein the vulnerability and reliability evaluation includes a determination of whether each terminating and non-terminating vertex represents a critical point of failure. The method can be utilized to evaluate wide variety of networks, including power grid infrastructures, communication network topologies, and fluid distribution systems.
Feder, Tomá s; Motwani, Rajeev
2009-01-01
Results on graph turnpike problem without distinctness, including its NP-completeness, and an O(m+n log n) algorithm, is presented. The usual turnpike problem has all pairwise distances given, but does not specify which pair of vertices w e corresponds to. There are two other problems that can be viewed as special cases of the graph turnpike problem, including the bandwidth problem and the low-distortion graph embedding problem. The aim for the turnpike problem in the NP-complete is to orient the edges with weights w i in either direction so that when the whole cycle is transversed in the real line, it returns to a chosen starting point for the cycle. An instance of the turnpike problem with or without distinctness is uniquely mappable if there exists at most one solution up to translation and choice of orientation.
Feder, Tomás
2009-06-01
Results on graph turnpike problem without distinctness, including its NP-completeness, and an O(m+n log n) algorithm, is presented. The usual turnpike problem has all pairwise distances given, but does not specify which pair of vertices w e corresponds to. There are two other problems that can be viewed as special cases of the graph turnpike problem, including the bandwidth problem and the low-distortion graph embedding problem. The aim for the turnpike problem in the NP-complete is to orient the edges with weights w i in either direction so that when the whole cycle is transversed in the real line, it returns to a chosen starting point for the cycle. An instance of the turnpike problem with or without distinctness is uniquely mappable if there exists at most one solution up to translation and choice of orientation.
Negation switching invariant signed graphs
Deepa Sinha
2014-04-01
Full Text Available A signed graph (or, $sigraph$ in short is a graph G in which each edge x carries a value $\\sigma(x \\in \\{-, +\\}$ called its sign. Given a sigraph S, the negation $\\eta(S$ of the sigraph S is a sigraph obtained from S by reversing the sign of every edge of S. Two sigraphs $S_{1}$ and $S_{2}$ on the same underlying graph are switching equivalent if it is possible to assign signs `+' (`plus' or `-' (`minus' to vertices of $S_{1}$ such that by reversing the sign of each of its edges that has received opposite signs at its ends, one obtains $S_{2}$. In this paper, we characterize sigraphs which are negation switching invariant and also see for what sigraphs, S and $\\eta (S$ are signed isomorphic.
Rosmanis, Ansis
2011-01-01
I introduce a continuous-time quantum walk on graphs called the quantum snake walk, the basis states of which are fixed-length paths (snakes) in the underlying graph. First, I analyze the quantum snake walk on the line, and I show that, even though most states stay localized throughout the evolution, there are specific states that most likely move on the line as wave packets with momentum inversely proportional to the length of the snake. Next, I discuss how an algorithm based on the quantum snake walk might potentially be able to solve an extended version of the glued trees problem, which asks to find a path connecting both roots of the glued trees graph. To the best of my knowledge, no efficient quantum algorithm solving this problem is known yet.
Smyth, Charles Piazzi
Reprinted from the Memoirs of the Royal Astronomical Society 15, 1846, pp. 71-82. With annotations and illustrations added by Klaus Hentschel. The activities of the Astronomer Royal for Scotland, Charles Piazzi Smyth (1819-1900), include the triangulation of South African districts, landscape painting, day-to-day or tourist sketching, the engraving and lithographing of prominent architectural sites, the documentary photography of the Egyptian pyramids or the Tenerife Dragon tree, and `instant photographs' of the clouds above his retirement home in Clova, Ripon. His colorful records of the aurora polaris, and solar and terrestrial spectra all profited from his trained eye and his subtle mastery of the pen and the brush. As his paper on astronomical drawing, which we chose to reproduce in this volume, amply demonstrates, he was conversant in most of the print technology repertoire that the 19th century had to offer, and carefully selected the one most appropriate to each sujet. For instance, he chose mezzotint for the plates illustrating Maclear's observations of Halley's comet in 1835/36, so as to achieve a ``rich profundity of shadows, the deep obscurity of which is admirably adapted to reproduce those fine effects of chiaroscuro frequently found in works where the quantity of dark greatly predominates.'' The same expertise with which he tried to emulate Rembrandt's chiaroscuro effects he applied to assessing William and John Herschel's illustrations of nebulae, which appeared in print between 1811 and 1834. William Herschel's positive engraving, made partly by stippling and partly by a coarse mezzotint, receives sharp admonishment because of the visible ruled crossed lines in the background and the fact that ``the objects, which are also generally too light, [have] a much better definition than they really possess.'' On the other hand, John Herschel's illustration of nebulae and star clusters, given in negative, ``in which the lights are the darkest part of the
Drawing expression of autistic child
SOLDÁTOVÁ, Barbora
2016-01-01
The presented thesis deals with drawing of children with autism. It is divided into two parts, the theoretical and the empirical. In the theoretical parts there are four chapters. Three chapters deal with problem of autism spectrum disorders, types of autism, options of diagnostics, frequency and possible causes of autism. The fourth chapter deals with basic information about children's drawing, unique manifestation of the autistic disablement in the children's drawing. In the empirical part ...
On Graph Rewriting, Reduction and Evaluation
Zerny, Ian
2010-01-01
We inter-derive two prototypical styles of graph reduction: reduction machines à la Turner and graph rewriting systems à la Barendregt et al. To this end, we adapt Danvy et al.'s mechanical program derivations from the world of terms to the world of graphs. We also outline how to inter-derive a t......We inter-derive two prototypical styles of graph reduction: reduction machines à la Turner and graph rewriting systems à la Barendregt et al. To this end, we adapt Danvy et al.'s mechanical program derivations from the world of terms to the world of graphs. We also outline how to inter...
The fascinating world of graph theory
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
Graph-based modelling in engineering
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. .
XML Graphs in Program Analysis
Møller, Anders; Schwartzbach, Michael Ignatieff
2007-01-01
XML graphs have shown to be a simple and effective formalism for representing sets of XML documents in program analysis. It has evolved through a six year period with variants tailored for a range of applications. We present a unified definition, outline the key properties including validation...... of XML graphs against different XML schema languages, and provide a software package that enables others to make use of these ideas. We also survey four very different applications: XML in Java, Java Servlets and JSP, transformations between XML and non-XML data, and XSLT....
Graph topologies on closed multifunctions
Giuseppe Di Maio
2003-10-01
Full Text Available In this paper we study function space topologies on closed multifunctions, i.e. closed relations on X x Y using various hypertopologies. The hypertopologies are in essence, graph topologies i.e topologies on functions considered as graphs which are subsets of X x Y . We also study several topologies, including one that is derived from the Attouch-Wets filter on the range. We state embedding theorems which enable us to generalize and prove some recent results in the literature with the use of known results in the hyperspace of the range space and in the function space topologies of ordinary functions.
Cyclic graphs and Apery's theorem
Sorokin, V N
2002-01-01
This is a survey of results about the behaviour of Hermite-Pade approximants for graphs of Markov functions, and a survey of interpolation problems leading to Apery's result about the irrationality of the value ζ(3) of the Riemann zeta function. The first example is given of a cyclic graph for which the Hermite-Pade problem leads to Apery's theorem. Explicit formulae for solutions are obtained, namely, Rodrigues' formulae and integral representations. The asymptotic behaviour of the approximants is studied, and recurrence formulae are found
Interacting particle systems on graphs
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
DrawFromDrawings: 2D Drawing Assistance via Stroke Interpolation with a Sketch Database.
Matsui, Yusuke; Shiratori, Takaaki; Aizawa, Kiyoharu
2017-07-01
We present DrawFromDrawings, an interactive drawing system that provides users with visual feedback for assistance in 2D drawing using a database of sketch images. Following the traditional imitation and emulation training from art education, DrawFromDrawings enables users to retrieve and refer to a sketch image stored in a database and provides them with various novel strokes as suggestive or deformation feedback. Given regions of interest (ROIs) in the user and reference sketches, DrawFromDrawings detects as-long-as-possible (ALAP) stroke segments and the correspondences between user and reference sketches that are the key to computing seamless interpolations. The stroke-level interpolations are parametrized with the user strokes, the reference strokes, and new strokes created by warping the reference strokes based on the user and reference ROI shapes, and the user study indicated that the interpolation could produce various reasonable strokes varying in shapes and complexity. DrawFromDrawings allows users to either replace their strokes with interpolated strokes (deformation feedback) or overlays interpolated strokes onto their strokes (suggestive feedback). The other user studies on the feedback modes indicated that the suggestive feedback enabled drawers to develop and render their ideas using their own stroke style, whereas the deformation feedback enabled them to finish the sketch composition quickly.
Stages of Drawing and Intelligence
Kavanagh, Fintan
1998-01-01
Children's drawings follow a developmental sequence. Beginning with uncontrolled scribble, children progress to controlled scribble, through basic forms, to increasingly sophisticated modes of representation...
[Teenagers' drawings in transcultural consultations].
Simon, Amalini; Titia Rizzi, Alice
The place of teenagers' drawings has been studied as part of a transcultural consultation, based on the creativity of the children of migrants. When speaking is difficult, drawings enable teenagers to show another dimension of their internal world. Aravin, a young Tamil boy, who lacked the necessary words, was able to express all the complexity of his thoughts through his drawings, finally being able to formulate in the group the difficult situations which he was drawing. Copyright © 2016 Elsevier Masson SAS. All rights reserved.
Shader-Based Wireframe Drawing
Bærentzen, Jakob Andreas; Nielsen, Steen Lund; Gjøl, Mikkel
2008-01-01
In this paper, we first argue that drawing lines on polygons is harder than it may appear. We then propose two novel and robust techniques for a special case of this problem, namely wireframe drawing. Neither method suffers from the well-known artifacts associated with the standard two pass, offset...... based techniques for wireframe drawing. Both methods draw prefiltered lines and produce high-quality antialiased results without super-sampling. The first method is a single pass technique well suited for convex N-gons for small N (in particular quadrilaterals or triangles). It is demonstrated...
Engineering drawing from the beginning
Cousins, M F
1970-01-01
Engineering Drawing from the Beginning, Volume 2 discusses the methods for communicating technical engineering concepts through illustrations and drawings. This volume covers the more advance techniques in engineering drawing. The coverage of the text includes the helix, which is the path traced by a point moving uniformly around the surface of a right cylinder that is moving axially. The book also covers drawings of solid objects such as prisms, pyramids, and cones, along with hollow objects made from sheet material. In Chapter 5, the text presents the conventional representations of common
Memorial Symposium for Willibald Jentschke
2002-01-01
Willibald 'Willi' Jentschke, Director General of CERN from 1971 to 1975 and founder of the DESY Laboratory in Hamburg, died last March, just a few months after celebrating his 90th birthday. At that time, the Bulletin dedicated an article to him (Bulletin n°19-20/2002). Now, CERN has organised a Memorial Symposium for next Thursday 31 October, where you are cordially invited. This tribute will include the following speechs: L. Maiani : Welcome E. Lohrmann : Message from DESY H. Schopper : Willi Jentschke M. Veltman and D. Perkins : The Neutral Currents K. Johnsen : The ISR in Jentschke's time K. Winter : Some recollections of Jentschke The Memorial Symposium will take place in the Council Chamber, Thursday 31 October at 15 hrs. Drinks will be served at 17:30 hrs following the symposium.
Jarlskog, Cecilia
2014-01-01
CERN, currently the largest organization in the world for particle physics, was founded in 1954. Originally located in Meyrin, at the outskirts of the city of Geneva in Switzerland, it has with time extended into neighboring France. The Theoretical Study Division of CERN, however, was created already in 1952, i.e., before the official inauguration of CERN. It was situated in Copenhagen. Christian Møller [1] was appointed (part-time) as the Director and there were two full time senior staff members, Gunnar Källén and Ben R. Mottelson. While constructing buildings and accelerators were in progress, an international conference was organized by CERN in the city of Geneva. This “CERN Symposium on High Energy Accelerators and Pion Physics”, 11–23 June 1956, attracted about 250 participants from outside CERN, among them at least 18 Nobel Laureates or future Laureates. Unfortunately, the participants from CERN are not listed in the Proceedings [2]. The conference focused on measuring devices such as bubbl...
43rd Aerospace Mechanisms Symposium
Boesiger, Edward A.
2016-01-01
The Aerospace Mechanisms Symposium (AMS) provides a unique forum for those active in the design, production and use of aerospace mechanisms. A major focus is the reporting of problems and solutions associated with the development and flight certification of new mechanisms. Sponsored and organized by the Mechanisms Education Association, responsibility for hosting the AMS is shared by the National Aeronautics and Space Administration and Lockheed Martin Space Systems Company (LMSSC). Now in its 43rd symposium, the AMS continues to be well attended, attracting participants from both the U.S. and abroad. The 43rd AMS was held in Santa Clara, California on May 4, 5 and 6, 2016. During these three days, 42 papers were presented. Topics included payload and positioning mechanisms, components such as hinges and motors, CubeSats, tribology, and mechanism testing. Hardware displays during the supplier exhibit gave attendees an opportunity to meet with developers of current and future mechanism components. The high quality of this symposium is a result of the work of many people, and their efforts are gratefully acknowledged. This extends to the voluntary members of the symposium organizing committee representing the eight NASA field centers, LMSSC, and the European Space Agency. Appreciation is also extended to the session chairs, the authors, and particularly the personnel at ARC responsible for the symposium arrangements and the publication of these proceedings. A sincere thank you also goes to the symposium executive committee who is responsible for the year-to-year management of the AMS, including paper processing and preparation of the program. The use of trade names of manufacturers in this publication does not constitute an official endorsement of such products or manufacturers, either expressed or implied, by the National Aeronautics and Space Administration.
Combinatorial and geometric aspects of Feynman graphs and Feynman integrals
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
Combinatorial and geometric aspects of Feynman graphs and Feynman integrals
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
Multiple graph regularized protein domain ranking
Wang, Jim Jing-Yan
2012-11-19
Background: Protein domain ranking is a fundamental task in structural biology. Most protein domain ranking methods rely on the pairwise comparison of protein domains while neglecting the global manifold structure of the protein domain database. Recently, graph regularized ranking that exploits the global structure of the graph defined by the pairwise similarities has been proposed. However, the existing graph regularized ranking methods are very sensitive to the choice of the graph model and parameters, and this remains a difficult problem for most of the protein domain ranking methods.Results: To tackle this problem, we have developed the Multiple Graph regularized Ranking algorithm, MultiG-Rank. Instead of using a single graph to regularize the ranking scores, MultiG-Rank approximates the intrinsic manifold of protein domain distribution by combining multiple initial graphs for the regularization. Graph weights are learned with ranking scores jointly and automatically, by alternately minimizing an objective function in an iterative algorithm. Experimental results on a subset of the ASTRAL SCOP protein domain database demonstrate that MultiG-Rank achieves a better ranking performance than single graph regularized ranking methods and pairwise similarity based ranking methods.Conclusion: The problem of graph model and parameter selection in graph regularized protein domain ranking can be solved effectively by combining multiple graphs. This aspect of generalization introduces a new frontier in applying multiple graphs to solving protein domain ranking applications. 2012 Wang et al; licensee BioMed Central Ltd.
Multiple graph regularized protein domain ranking
Wang, Jim Jing-Yan; Bensmail, Halima; Gao, Xin
2012-01-01
Background: Protein domain ranking is a fundamental task in structural biology. Most protein domain ranking methods rely on the pairwise comparison of protein domains while neglecting the global manifold structure of the protein domain database. Recently, graph regularized ranking that exploits the global structure of the graph defined by the pairwise similarities has been proposed. However, the existing graph regularized ranking methods are very sensitive to the choice of the graph model and parameters, and this remains a difficult problem for most of the protein domain ranking methods.Results: To tackle this problem, we have developed the Multiple Graph regularized Ranking algorithm, MultiG-Rank. Instead of using a single graph to regularize the ranking scores, MultiG-Rank approximates the intrinsic manifold of protein domain distribution by combining multiple initial graphs for the regularization. Graph weights are learned with ranking scores jointly and automatically, by alternately minimizing an objective function in an iterative algorithm. Experimental results on a subset of the ASTRAL SCOP protein domain database demonstrate that MultiG-Rank achieves a better ranking performance than single graph regularized ranking methods and pairwise similarity based ranking methods.Conclusion: The problem of graph model and parameter selection in graph regularized protein domain ranking can be solved effectively by combining multiple graphs. This aspect of generalization introduces a new frontier in applying multiple graphs to solving protein domain ranking applications. 2012 Wang et al; licensee BioMed Central Ltd.
Multiple graph regularized protein domain ranking.
Wang, Jim Jing-Yan; Bensmail, Halima; Gao, Xin
2012-11-19
Protein domain ranking is a fundamental task in structural biology. Most protein domain ranking methods rely on the pairwise comparison of protein domains while neglecting the global manifold structure of the protein domain database. Recently, graph regularized ranking that exploits the global structure of the graph defined by the pairwise similarities has been proposed. However, the existing graph regularized ranking methods are very sensitive to the choice of the graph model and parameters, and this remains a difficult problem for most of the protein domain ranking methods. To tackle this problem, we have developed the Multiple Graph regularized Ranking algorithm, MultiG-Rank. Instead of using a single graph to regularize the ranking scores, MultiG-Rank approximates the intrinsic manifold of protein domain distribution by combining multiple initial graphs for the regularization. Graph weights are learned with ranking scores jointly and automatically, by alternately minimizing an objective function in an iterative algorithm. Experimental results on a subset of the ASTRAL SCOP protein domain database demonstrate that MultiG-Rank achieves a better ranking performance than single graph regularized ranking methods and pairwise similarity based ranking methods. The problem of graph model and parameter selection in graph regularized protein domain ranking can be solved effectively by combining multiple graphs. This aspect of generalization introduces a new frontier in applying multiple graphs to solving protein domain ranking applications.
Multiple graph regularized protein domain ranking
Wang Jim
2012-11-01
Full Text Available Abstract Background Protein domain ranking is a fundamental task in structural biology. Most protein domain ranking methods rely on the pairwise comparison of protein domains while neglecting the global manifold structure of the protein domain database. Recently, graph regularized ranking that exploits the global structure of the graph defined by the pairwise similarities has been proposed. However, the existing graph regularized ranking methods are very sensitive to the choice of the graph model and parameters, and this remains a difficult problem for most of the protein domain ranking methods. Results To tackle this problem, we have developed the Multiple Graph regularized Ranking algorithm, MultiG-Rank. Instead of using a single graph to regularize the ranking scores, MultiG-Rank approximates the intrinsic manifold of protein domain distribution by combining multiple initial graphs for the regularization. Graph weights are learned with ranking scores jointly and automatically, by alternately minimizing an objective function in an iterative algorithm. Experimental results on a subset of the ASTRAL SCOP protein domain database demonstrate that MultiG-Rank achieves a better ranking performance than single graph regularized ranking methods and pairwise similarity based ranking methods. Conclusion The problem of graph model and parameter selection in graph regularized protein domain ranking can be solved effectively by combining multiple graphs. This aspect of generalization introduces a new frontier in applying multiple graphs to solving protein domain ranking applications.
Mining and Reclamation Technology Symposium
None Available
1999-06-24
The Mining and Reclamation Technology Symposium was commissioned by the Mountaintop Removal Mining/Valley Fill Environmental Impact Statement (EIS) Interagency Steering Committee as an educational forum for the members of the regulatory community who will participate in the development of the EIS. The Steering Committee sought a balanced audience to ensure the input to the regulatory community reflected the range of perspectives on this complicated and emotional issue. The focus of this symposium is on mining and reclamation technology alternatives, which is one of eleven topics scheduled for review to support development of the EIS. Others include hydrologic, environmental, ecological, and socio-economic issues.
Constructing Knowledge Graphs of Depression
Huang, Zhisheng; Yang, Jie; van Harmelen, Frank; Hu, Qing
2017-01-01
Knowledge Graphs have been shown to be useful tools for integrating multiple medical knowledge sources, and to support such tasks as medical decision making, literature retrieval, determining healthcare quality indicators, co-morbodity analysis and many others. A large number of medical knowledge
Partitioning graphs into connected parts
Hof, van 't P.; Paulusma, D.; Woeginger, G.J.; Frid, A.; Morozov, A.S.; Rybalchenko, A.; Wagner, K.W.
2009-01-01
The 2-DISJOINT CONNECTED SUBGRAPHS problem asks if a given graph has two vertex-disjoint connected subgraphs containing pre-specified sets of vertices. We show that this problem is NP-complete even if one of the sets has cardinality 2. The LONGEST PATH CONTRACTIBILITY problem asks for the largest
Isoperimetric inequalities for minimal graphs
Pacelli Bessa, G.; Montenegro, J.F.
2007-09-01
Based on Markvorsen and Palmer's work on mean time exit and isoperimetric inequalities we establish slightly better isoperimetric inequalities and mean time exit estimates for minimal graphs in N x R. We also prove isoperimetric inequalities for submanifolds of Hadamard spaces with tamed second fundamental form. (author)
Humidity Graphs for All Seasons.
Esmael, F.
1982-01-01
In a previous article in this journal (Vol. 17, p358, 1979), a wet-bulb depression table was recommended for two simple experiments to determine relative humidity. However, the use of a graph is suggested because it gives the relative humidity directly from the wet and dry bulb readings. (JN)
Contracting a planar graph efficiently
Holm, Jacob; Italiano, Giuseppe F.; Karczmarz, Adam
2017-01-01
the data structure, we can achieve optimal running times for decremental bridge detection, 2-edge connectivity, maximal 3-edge connected components, and the problem of finding a unique perfect matching for a static planar graph. Furthermore, we improve the running times of algorithms for several planar...
Graph Model Based Indoor Tracking
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...
A graph with fractional revival
Bernard, Pierre-Antoine; Chan, Ada; Loranger, Érika; Tamon, Christino; Vinet, Luc
2018-02-01
An example of a graph that admits balanced fractional revival between antipodes is presented. It is obtained by establishing the correspondence between the quantum walk on a hypercube where the opposite vertices across the diagonals of each face are connected and, the coherent transport of single excitations in the extension of the Krawtchouk spin chain with next-to-nearest neighbour interactions.
Fixation Time for Evolutionary Graphs
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.
Coloring sums of extensions of certain graphs
Johan Kok
2017-12-01
Full Text Available We recall that the minimum number of colors that allow a proper coloring of graph $G$ is called the chromatic number of $G$ and denoted $\\chi(G$. Motivated by the introduction of the concept of the $b$-chromatic sum of a graph the concept of $\\chi'$-chromatic sum and $\\chi^+$-chromatic sum are introduced in this paper. The extended graph $G^x$ of a graph $G$ was recently introduced for certain regular graphs. This paper furthers the concepts of $\\chi'$-chromatic sum and $\\chi^+$-chromatic sum to extended paths and cycles. Bipartite graphs also receive some attention. The paper concludes with patterned structured graphs. These last said graphs are typically found in chemical and biological structures.
Mathematical Minute: Rotating a Function Graph
Bravo, Daniel; Fera, Joseph
2013-01-01
Using calculus only, we find the angles you can rotate the graph of a differentiable function about the origin and still obtain a function graph. We then apply the solution to odd and even degree polynomials.
Towards a theory of geometric graphs
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...
Bounds on Gromov hyperbolicity constant in graphs
Infinite graphs; Cartesian product graphs; independence number; domin- ation number; geodesics ... the secure transmission of information through the internet (see [15, 16]). In particular, ..... In particular, δ(G) is an integer multiple of 1/4.
Torsional rigidity, isospectrality and quantum graphs
Colladay, Don; McDonald, Patrick; Kaganovskiy, Leon
2017-01-01
We study torsional rigidity for graph and quantum graph analogs of well-known pairs of isospectral non-isometric planar domains. We prove that such isospectral pairs are distinguished by torsional rigidity. (paper)
Drawing Links within Dental Education
Wright, J.
2017-01-01
This study examines results of a practical drawing task given to a cohort of first year dental surgery students at Kings College Dental Institute, London. It compares and relates their success in drilling and removing caries and pulp tissue from a virtual tooth using the hapTEL virtual learning system, with each individuals' drawing skills.…
Architectural Drawing - an Animate Field
Hougaard, Anna Katrine
2015-01-01
Architectural drawing is changing because architects today draw with computers. Due to this change digital diagrams employed by computational architectural practices are often emphasized as powerful structures of control and organisation in the design process. But there are also diagrams, which d...
Drawing subway maps : a survey
Wolff, A.
2007-01-01
This paper deals with automating the drawing of subway maps. There are two features of schematic subway maps that make them different from drawings of other networks such as flow charts or organigrams. First, most schematic subway maps use not only horizontal and vertical lines, but also diagonals.
The Third International Symposium on Space Terahertz Technology: Symposium proceedings
1992-01-01
Papers from the symposium are presented that are relevant to the generation, detection, and use of the terahertz spectral region for space astronomy and remote sensing of the Earth's upper atmosphere. The program included thirteen sessions covering a wide variety of topics including solid-state oscillators, power-combining techniques, mixers, harmonic multipliers, antennas and antenna arrays, submillimeter receivers, and measurement techniques.
Drawing cure: children's drawings as a psychoanalytic instrument.
Wittmann, Barbara
2010-01-01
This essay deals with the special case of drawings as psychoanalytical instruments. It aims at a theoretical understanding of the specific contribution made by children's drawings as a medium of the psychical. In the influential play technique developed by Melanie Klein, drawing continuously interacts with other symptomatic (play) actions. Nonetheless, specific functions of drawing within the play technique can be identified. The essay will discuss four crucial aspects in-depth: 1) the strengthening of the analysis's recursivity associated with the graphic artifact; 2) the opening of the analytic process facilitated by drawing; 3) the creation of a genuinely graphic mode of producing meaning that allows the child to develop a "theory" of the workings of his own psychic apparatus; and 4) the new possibilities of symbolization associated with the latter. In contrast to classical definitions of the psychological instrument, the child's drawing is a weakly structured tool that does not serve to reproduce psychic processes in an artificial, controlled setting. The introduction of drawing into the psychoanalytic cure is by no means interested in replaying past events, but in producing events suited to effecting a transformation of the synchronic structures of the unconscious.
I Draw Therefore I Am: Drawing as Visual (Communication Studies
Muliyadi Mahamood
2013-11-01
Full Text Available This paper sets view to consider the significance of drawings as part of visual communication design. Drawing gives a chance to observe, to muse, to select and develop continuous thinking techniques. It is to present that drawing is not just a cursory to generate ideas, but it has its own energy and philosophy which deserve studying as a domain of art. In recent years, drawing has received attention; there is on the one hand a group of drawing practitioners, and on the other hand a group of drawing researchers. Drawing in design is a medium of visual and spatial thinking. Digging into research actually is a necessity for visual communication studies. It is suggested here three kinds of research approaches: research into art/design; research through art/design; and research for art/design. Indeed, it leads to four axis topics (topoi for design studies: design practice, design product, design discourse, and design meta-discourse. A field of study called ‘visual culture’ which, departed from the study of critical theory and cultural studies which have set out relatively new field of study called ‘visual studies’. Based upon to this perspective, visual (communication studies should be more self-reflexive. The production of visual communication contributes to construct the visual culture in society.
Bond graph modeling of centrifugal compression systems
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...
A Graph Calculus for Predicate Logic
Paulo A. S. Veloso
2013-03-01
Full Text Available We introduce a refutation graph calculus for classical first-order predicate logic, which is an extension of previous ones for binary relations. One reduces logical consequence to establishing that a constructed graph has empty extension, i. e. it represents bottom. Our calculus establishes that a graph has empty extension by converting it to a normal form, which is expanded to other graphs until we can recognize conflicting situations (equivalent to a formula and its negation.
Sphere and dot product representations of graphs
R.J. Kang (Ross); T. Müller (Tobias)
2012-01-01
textabstractA graph $G$ is a $k$-sphere graph if there are $k$-dimensional real vectors $v_1,\\dots,v_n$ such that $ij\\in E(G)$ if and only if the distance between $v_i$ and $v_j$ is at most $1$. A graph $G$ is a $k$-dot product graph if there are $k$-dimensional real vectors $v_1,\\dots,v_n$ such
Deep Learning with Dynamic Computation Graphs
Looks, Moshe; Herreshoff, Marcello; Hutchins, DeLesley; Norvig, Peter
2017-01-01
Neural networks that compute over graph structures are a natural fit for problems in a variety of domains, including natural language (parse trees) and cheminformatics (molecular graphs). However, since the computation graph has a different shape and size for every input, such networks do not directly support batched training or inference. They are also difficult to implement in popular deep learning libraries, which are based on static data-flow graphs. We introduce a technique called dynami...
Constructs for Programming with Graph Rewrites
Rodgers, Peter
2000-01-01
Graph rewriting is becoming increasingly popular as a method for programming with graph based data structures. We present several modifications to a basic serial graph rewriting paradigm and discuss how they improve coding programs in the Grrr graph rewriting programming language. The constructs we present are once only nodes, attractor nodes and single match rewrites. We illustrate the operation of the constructs by example. The advantages of adding these new rewrite modifiers is to reduce t...
Computing paths and cycles in biological interaction graphs
von Kamp Axel
2009-06-01
/negative paths and cycles in interaction graphs is an important method for network analysis in Systems Biology. This contribution draws the attention of the community to this important computational problem and provides a number of new algorithms, partially specifically tailored for biological interaction graphs. All algorithms have been implemented in the CellNetAnalyzer framework which can be downloaded for academic use at http://www.mpi-magdeburg.mpg.de/projects/cna/cna.html.
On the sizes of expander graphs and minimum distances of graph codes
Høholdt, Tom; Justesen, Jørn
2014-01-01
We give lower bounds for the minimum distances of graph codes based on expander graphs. The bounds depend only on the second eigenvalue of the graph and the parameters of the component codes. We also give an upper bound on the size of a degree regular graph with given second eigenvalue....
McMillen, Sue; McMillen, Beth
2010-01-01
Connecting stories to qualitative coordinate graphs has been suggested as an effective instructional strategy. Even students who are able to "create" bar graphs may struggle to correctly "interpret" them. Giving children opportunities to work with qualitative graphs can help them develop the skills to interpret, describe, and compare information…
The groupies of random multipartite graphs
Portmann, Marius; Wang, Hongyun
2012-01-01
If a vertex $v$ in a graph $G$ has degree larger than the average of the degrees of its neighbors, we call it a groupie in $G$. In the current work, we study the behavior of groupie in random multipartite graphs with the link probability between sets of nodes fixed. Our results extend the previous ones on random (bipartite) graphs.
Modeling Software Evolution using Algebraic Graph Rewriting
Ciraci, Selim; van den Broek, Pim
We show how evolution requests can be formalized using algebraic graph rewriting. In particular, we present a way to convert the UML class diagrams to colored graphs. Since changes in software may effect the relation between the methods of classes, our colored graph representation also employs the
A Type Graph Model for Java Programs
Rensink, Arend; Zambon, Eduardo
2009-01-01
In this report we present a type graph that models all executable constructs of the Java programming language. Such a model is useful for any graph-based technique that relies on a representation of Java programs as graphs. The model can be regarded as a common representation to which all Java
An intersection graph of straight lines
Thomassen, Carsten
2002-01-01
G. Ehrlich, S. Even, and R.E. Tarjan conjectured that the graph obtained from a complete 3 partite graph K4,4,4 by deleting the edges of four disjoint triangles is not the intersection graph of straight line segments in the plane. We show that it is....
Girth 5 graphs from relative difference sets
Jørgensen, Leif Kjær
2005-01-01
We consider the problem of construction of graphs with given degree $k$ and girth 5 and as few vertices as possible. We give a construction of a family of girth 5 graphs based on relative difference sets. This family contains the smallest known graph of degree 8 and girth 5 which was constructed ...
Cycles in weighted graphs and related topics
Zhang, Shenggui
2002-01-01
This thesis contains results on paths andcycles in graphs andon a more or less relatedtopic, the vulnerability of graphs. In the first part of the thesis, Chapters 2 through 5, we concentrate on paths andcycles in weightedgraphs. A number of sufficient conditions are presentedfor graphs to contain
Graph Transformation Semantics for a QVT Language
Rensink, Arend; Nederpel, Ronald; Bruni, Roberto; Varró, Dániel
It has been claimed by many in the graph transformation community that model transformation, as understood in the context of Model Driven Architecture, can be seen as an application of graph transformation. In this paper we substantiate this claim by giving a graph transformation-based semantics to
Girth 5 graphs from relative difference sets
Jørgensen, Leif Kjær
We consider the problem of construction of graphs with given degree and girth 5 and as few vertices as possible. We give a construction of a family of girth 5 graphs based on relative difference sets. This family contains the smallest known graph of degree 8 and girth 5 which was constructed by G...
Improper colouring of (random) unit disk graphs
Kang, R.J.; Müller, T.; Sereni, J.S.
2008-01-01
For any graph G, the k-improper chromatic number ¿k(G) is the smallest number of colours used in a colouring of G such that each colour class induces a subgraph of maximum degree k. We investigate ¿k for unit disk graphs and random unit disk graphs to generalise results of McDiarmid and Reed
Alliances and Bisection Width for Planar Graphs
Olsen, Martin; Revsbæk, Morten
2013-01-01
An alliance in a graph is a set of vertices (allies) such that each vertex in the alliance has at least as many allies (counting the vertex itself) as non-allies in its neighborhood of the graph. We show that any planar graph with minimum degree at least 4 can be split into two alliances in polyn...
A Type Graph Model for Java Programs
Rensink, Arend; Zambon, Eduardo; Lee, D.; Lopes, A.; Poetzsch-Heffter, A.
2009-01-01
In this work we present a type graph that models all executable constructs of the Java programming language. Such a model is useful for any graph-based technique that relies on a representation of Java programs as graphs. The model can be regarded as a common representation to which all Java syntax
RATGRAPH: Computer Graphing of Rational Functions.
Minch, Bradley A.
1987-01-01
Presents an easy-to-use Applesoft BASIC program that graphs rational functions and any asymptotes that the functions might have. Discusses the nature of rational functions, graphing them manually, employing a computer to graph rational functions, and describes how the program works. (TW)
A new cluster algorithm for graphs
S. van Dongen
1998-01-01
textabstractA new cluster algorithm for graphs called the emph{Markov Cluster algorithm ($MCL$ algorithm) is introduced. The graphs may be both weighted (with nonnegative weight) and directed. Let~$G$~be such a graph. The $MCL$ algorithm simulates flow in $G$ by first identifying $G$ in a
Well-covered graphs and factors
Randerath, Bert; Vestergaard, Preben D.
2006-01-01
A maximum independent set of vertices in a graph is a set of pairwise nonadjacent vertices of largest cardinality α. Plummer defined a graph to be well-covered, if every independent set is contained in a maximum independent set of G. Every well-covered graph G without isolated vertices has a perf...
A new characterization of trivially perfect graphs
Christian Rubio Montiel
2015-03-01
Full Text Available A graph $G$ is \\emph{trivially perfect} if for every induced subgraph the cardinality of the largest set of pairwise nonadjacent vertices (the stability number $\\alpha(G$ equals the number of (maximal cliques $m(G$. We characterize the trivially perfect graphs in terms of vertex-coloring and we extend some definitions to infinite graphs.
47 CFR 80.761 - Conversion graphs.
2010-10-01
... MARITIME SERVICES Standards for Computing Public Coast Station VHF Coverage § 80.761 Conversion graphs. The following graphs must be employed where conversion from one to the other of the indicated types of units is... 47 Telecommunication 5 2010-10-01 2010-10-01 false Conversion graphs. 80.761 Section 80.761...
SYMPOSIUM ON PLANT PROTEIN PHOSPHORYLATION
JOHN C WALKER
2011-11-01
Protein phosphorylation and dephosphorylation play key roles in many aspects of plant biology, including control of cell division, pathways of carbon and nitrogen metabolism, pattern formation, hormonal responses, and abiotic and biotic responses to environmental signals. A Symposium on Plant Protein Phosphorylation was hosted on the Columbia campus of the University of Missouri from May 26-28, 2010. The symposium provided an interdisciplinary venue at which scholars studying protein modification, as it relates to a broad range of biological questions and using a variety of plant species, presented their research. It also provided a forum where current international challenges in studies related to protein phosphorylation could be examined. The symposium also stimulated research collaborations through interactions and networking among those in the research community and engaged students and early career investigators in studying issues in plant biology from an interdisciplinary perspective. The proposed symposium, which drew 165 researchers from 13 countries and 21 States, facilitated a rapid dissemination of acquired knowledge and technical expertise regarding protein phosphorylation in plants to a broad range of plant biologists worldwide.
Diversity in the Workplace. Symposium.
2002
Three papers comprise this symposium on diversity in the workplace. "Factors That Assist and Barriers That Hinder the Success of Diversity Initiatives in Multinational Corporations" (Rose Mary Wentling) reports that factors that assisted in the success were classified under diversity department, human, and work environment; barriers were…
Indian symposium reviews tsunami response
Paula Banerjee
2005-07-01
Full Text Available A symposium of academics and human rights activists organised by the Calcutta Research Group assessed the extent to which relief and rehabilitation initiatives in Tamil Nadu and the Andaman and Nicobar islands have recognised the rights of those affected to receive aid without discrimination based on caste, religion or gender.
National symposium on food irradiation
Beyers, M.; Brodrick, H.T.; Van Niekerk, W.C.A.
1980-01-01
This report contains proceedings of papers delivered at the national symposium on food irradiation held in Pretoria. The proceedings have been grouped into the following sections: general background; meat; agricultural products; marketing; and radiation facilities - cost and plant design. Each paper has been submitted separately to INIS. Tables listing irradiated food products cleared for human consumption in different countries are given
44th Aerospace Mechanisms Symposium
Boesiger, Edward A. (Compiler)
2018-01-01
The Aerospace Mechanisms Symposium (AMS) provides a unique forum for those active in the design, production and use of aerospace mechanisms. A major focus is the reporting of problems and solutions associated with the development and flight certification of new mechanisms.
2016 Gilbert W. Beebe symposium
The National Academies of Sciences, Engineering, and Medicine is hosting the 2016 Gilbert W. Beebe Symposium. Its focus will be on commemorating the 1986 Chernobyl nuclear reactor accident and discussing the achievements of 30 years of studies on the radiation health effects following the accident and future research directions.
AAAI 1993 Fall Symposium Reports
Levinson, Robert; Epstein, Susan; Terveen, Loren; Bonasso, R. Peter; Miller, David P.; Bowyer, Kevin; Hall, Lawrence
1994-01-01
The Association for the Advancement of Artificial Intelligence held its 1993 Fall Symposium Series on October 22-24 in Raleigh, North Carolina. This article contains summaries of the six symposia that were conducted: Automated Deduction in Nonstandard Logics; Games: Planning and Learning; Human-Computer Collaboration: Reconciling Theory, Synthesizing Practice; Instantiating Intelligent Agents; and Machine Learning and Computer Vision: What, Why, and How?
11. European cosmic ray symposium
1989-03-01
The biannual Symposium includes all aspects of cosmic ray research. The scientific programme was organized under three main headings: Cosmic rays in the heliosphere, Cosmic rays in the interstellar and extragalactic space, Properties of high-energy interactions as studied by cosmic rays. Seven invited talks were indexed seprately for the INIS database. (R.P.)
Tournaments, oriented graphs and football sequences
Pirzada S.
2017-08-01
Full Text Available Consider the result of a soccer league competition where n teams play each other exactly once. A team gets three points for each win and one point for each draw. The total score obtained by each team vi is called the f-score of vi and is denoted by fi. The sequences of all f-scores [fi]i=1n$\\left[ {{\\rm{f}}_{\\rm{i}} } \\right]_{{\\rm{i}} = 1}^{\\rm{n}} $ arranged in non-decreasing order is called the f-score sequence of the competition. We raise the following problem: Which sequences of non-negative integers in non-decreasing order is a football sequence, that is the outcome of a soccer league competition. We model such a competition by an oriented graph with teams represented by vertices in which the teams play each other once, with an arc from team u to team v if and only if u defeats v. We obtain some necessary conditions for football sequences and some characterizations under restrictions.
1999-02-01
Scientists Meet in Antofagasta to Discuss Front-Line Astrophysics To mark the beginning of the VLT era, the European Southern Observatory is organizing a VLT Opening Symposium which will take place in Antofagasta (Chile) on 1-4 March 1999, just before the start of regular observations with the ESO Very Large Telescope on April 1, 1999. The Symposium occupies four full days and is held on the campus of the Universidad Catolica del Norte. It consists of plenary sessions on "Science in the VLT Era and Beyond" and three parallel Workshops on "Clusters of Galaxies at High Redshift" , "Star-way to the Universe" and "From Extrasolar Planets to Brown Dwarfs" . There will be many presentations of recent work at the major astronomical facilities in the world. The meeting provides a very useful forum to discuss the latest developments and, in this sense, contributes to the planning of future research with the VLT and other large telescopes. The symposium will be opened with a talk by the ESO Director General, Prof. Riccardo Giacconi , on "Paranal - an observatory for the 21st century". It will be followed by reports about the first scientific results from the main astronomical instruments on VLT UT1, FORS1 and ISAAC. The Symposium participants will see the VLT in operation during special visits to the Paranal Observatory. Press conferences are being arranged each afternoon to inform about the highlights of the conference. After the Symposium, there will be an Official Inauguration Ceremony at Paranal on 5 March Contributions from ESO ESO scientists will make several presentations at the Symposium. They include general reviews of various research fields as well as important new data and results from the VLT that show the great potential of this new astronomical facility. Some of the recent work is described in this Press Release, together with images and spectra of a large variety of objects. Note that all of these data will soon become publicly available via the VLT Archive
Influence of asymmetrical drawing radius deviation in micro deep drawing
Heinrich, L.; Kobayashi, H.; Shimizu, T.; Yang, M.; Vollertsen, F.
2017-09-01
Nowadays, an increasing demand for small metal parts in electronic and automotive industries can be observed. Deep drawing is a well-suited technology for the production of such parts due to its excellent qualities for mass production. However, the downscaling of the forming process leads to new challenges in tooling and process design, such as high relative deviation of tool geometry or blank displacement compared to the macro scale. FEM simulation has been a widely-used tool to investigate the influence of symmetrical process deviations as for instance a global variance of the drawing radius. This study shows a different approach that allows to determine the impact of asymmetrical process deviations on micro deep drawing. In this particular case the impact of an asymmetrical drawing radius deviation and blank displacement on cup geometry deviation was investigated for different drawing ratios by experiments and FEM simulation. It was found that both variations result in an increasing cup height deviation. Nevertheless, with increasing drawing ratio a constant drawing radius deviation has an increasing impact, while blank displacement results in a decreasing offset of the cups geometry. This is explained by different mechanisms that result in an uneven cup geometry. While blank displacement leads to material surplus on one side of the cup, an unsymmetrical radius deviation on the other hand generates uneven stretching of the cups wall. This is intensified for higher drawing ratios. It can be concluded that the effect of uneven radius geometry proves to be of major importance for the production of accurately shaped micro cups and cannot be compensated by intentional blank displacement.
On a conjecture concerning helly circle graphs
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.
Centrosymmetric Graphs And A Lower Bound For Graph Energy Of Fullerenes
Katona Gyula Y.
2014-11-01
Full Text Available The energy of a molecular graph G is defined as the summation of the absolute values of the eigenvalues of adjacency matrix of a graph G. In this paper, an infinite class of fullerene graphs with 10n vertices, n ≥ 2, is considered. By proving centrosymmetricity of the adjacency matrix of these fullerene graphs, a lower bound for its energy is given. Our method is general and can be extended to other class of fullerene graphs.
International Computer Symposium
Jain, Lakhmi; Peng, Sheng-Lung; Pan, Jeng-Shyang; Yang, Ching-Nung; Lin, Chia-Chen
2013-01-01
The field of Intelligent Systems and Applications has expanded enormously during the last two decades. Theoretical and practical results in this area are growing rapidly due to many successful applications and new theories derived from many diverse problems. This book is dedicated to the Intelligent Systems and Applications in many different aspects. In particular, this book is to provide highlights of the current research in Intelligent Systems and Applications. It consists of research papers in the following specific topics: l Graph Theory and Algorithms l Interconnection Networks and Combinatorial Algorithms l Artificial Intelligence and Fuzzy Systems l Database, Data Mining, and Information Retrieval l Information Literacy, e-Learning, and Social Media l Computer Networks and Web Service/Technologies l Wireless Sensor Networks l Wireless Network Protocols l Wireless Data Processing This book provides a reference to theoretical problems as well as practical solutio...
IAEA symposium on international safeguards
1999-01-01
The eighth IAEA Symposium on International Safeguards was organized by the IAEA in cooperation with the Institute of Nuclear Materials Management and the European Safeguards Research and Development Association. It was attended by over 350 specialists and policy makers in the field of nuclear safeguards and verification from more than 50 countries and organizations. The purpose of the Symposium was to foster a broad exchange of information on concepts and technologies related to important developments in the areas of international safeguards and security. For the first time in the history of the symposia, the IAEA is issuing proceedings free of charge to participants on CD-ROM. The twenty-two plenary, technical, and poster sessions featured topics related to technological and policy aspects from national, regional and global perspectives. The theme of the Symposium: Four Decades of Development - Safeguarding into the New Millennium set the stage for the commemoration of a number of significant events in the annals of safeguards. 1997 marked the Fortieth Anniversary of the IAEA, the Thirtieth Anniversary of the Tlatelolco Treaty, and the Twentieth Anniversary of the Department of Safeguards Member State Support Programmes. There were special events and noted presentations featuring these anniversaries and giving the participants an informative retrospective view of safeguards development over the past four decades. The proceedings of this symposium provide the international community with a comprehensive view of where nuclear safeguards and verification stood in 1997 in terms of the growing demands and expectations. The Symposium offered thoughtful perspectives on where safeguards are headed within the broader context of verification issues. As the world of international nuclear verification looks towards the next millennium, the implementation of the expanding and strengthened safeguards system presents formidable challenges
Subsampling for graph power spectrum estimation
Chepuri, Sundeep Prabhakar; Leus, Geert
2016-01-01
In this paper we focus on subsampling stationary random signals that reside on the vertices of undirected graphs. Second-order stationary graph signals are obtained by filtering white noise and they admit a well-defined power spectrum. Estimating the graph power spectrum forms a central component of stationary graph signal processing and related inference tasks. We show that by sampling a significantly smaller subset of vertices and using simple least squares, we can reconstruct the power spectrum of the graph signal from the subsampled observations, without any spectral priors. In addition, a near-optimal greedy algorithm is developed to design the subsampling scheme.
On 4-critical t-perfect graphs
Benchetrit, Yohann
2016-01-01
It is an open question whether the chromatic number of $t$-perfect graphs is bounded by a constant. The largest known value for this parameter is 4, and the only example of a 4-critical $t$-perfect graph, due to Laurent and Seymour, is the complement of the line graph of the prism $\\Pi$ (a graph is 4-critical if it has chromatic number 4 and all its proper induced subgraphs are 3-colorable). In this paper, we show a new example of a 4-critical $t$-perfect graph: the complement of the line gra...
Subsampling for graph power spectrum estimation
Chepuri, Sundeep Prabhakar
2016-10-06
In this paper we focus on subsampling stationary random signals that reside on the vertices of undirected graphs. Second-order stationary graph signals are obtained by filtering white noise and they admit a well-defined power spectrum. Estimating the graph power spectrum forms a central component of stationary graph signal processing and related inference tasks. We show that by sampling a significantly smaller subset of vertices and using simple least squares, we can reconstruct the power spectrum of the graph signal from the subsampled observations, without any spectral priors. In addition, a near-optimal greedy algorithm is developed to design the subsampling scheme.
Proving relations between modular graph functions
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)
Xiong, B.; Oude Elberink, S.; Vosselman, G.
2014-07-01
In the task of 3D building model reconstruction from point clouds we face the problem of recovering a roof topology graph in the presence of noise, small roof faces and low point densities. Errors in roof topology graphs will seriously affect the final modelling results. The aim of this research is to automatically correct these errors. We define the graph correction as a graph-to-graph problem, similar to the spelling correction problem (also called the string-to-string problem). The graph correction is more complex than string correction, as the graphs are 2D while strings are only 1D. We design a strategy based on a dictionary of graph edit operations to automatically identify and correct the errors in the input graph. For each type of error the graph edit dictionary stores a representative erroneous subgraph as well as the corrected version. As an erroneous roof topology graph may contain several errors, a heuristic search is applied to find the optimum sequence of graph edits to correct the errors one by one. The graph edit dictionary can be expanded to include entries needed to cope with errors that were previously not encountered. Experiments show that the dictionary with only fifteen entries already properly corrects one quarter of erroneous graphs in about 4500 buildings, and even half of the erroneous graphs in one test area, achieving as high as a 95% acceptance rate of the reconstructed models.
Significance evaluation in factor graphs
Madsen, Tobias; Hobolth, Asger; Jensen, Jens Ledet
2017-01-01
in genomics and the multiple-testing issues accompanying them, accurate significance evaluation is of great importance. We here address the problem of evaluating statistical significance of observations from factor graph models. Results Two novel numerical approximations for evaluation of statistical...... significance are presented. First a method using importance sampling. Second a saddlepoint approximation based method. We develop algorithms to efficiently compute the approximations and compare them to naive sampling and the normal approximation. The individual merits of the methods are analysed both from....... Conclusions The applicability of saddlepoint approximation and importance sampling is demonstrated on known models in the factor graph framework. Using the two methods we can substantially improve computational cost without compromising accuracy. This contribution allows analyses of large datasets...
Groups, graphs and random walks
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...
Flux networks in metabolic graphs
Warren, P B; Queiros, S M Duarte; Jones, J L
2009-01-01
A metabolic model can be represented as a bipartite graph comprising linked reaction and metabolite nodes. Here it is shown how a network of conserved fluxes can be assigned to the edges of such a graph by combining the reaction fluxes with a conserved metabolite property such as molecular weight. A similar flux network can be constructed by combining the primal and dual solutions to the linear programming problem that typically arises in constraint-based modelling. Such constructions may help with the visualization of flux distributions in complex metabolic networks. The analysis also explains the strong correlation observed between metabolite shadow prices (the dual linear programming variables) and conserved metabolite properties. The methods were applied to recent metabolic models for Escherichia coli, Saccharomyces cerevisiae and Methanosarcina barkeri. Detailed results are reported for E. coli; similar results were found for other organisms
3-biplacement of bipartite graphs
Lech Adamus
2008-01-01
Full Text Available Let \\(G=(L,R;E\\ be a bipartite graph with color classes \\(L\\ and \\(R\\ and edge set \\(E\\. A set of two bijections \\(\\{\\varphi_1 , \\varphi_2\\}\\, \\(\\varphi_1 , \\varphi_2 :L \\cup R \\to L \\cup R\\, is said to be a \\(3\\-biplacement of \\(G\\ if \\(\\varphi_1(L= \\varphi_2(L = L\\ and \\(E \\cap \\varphi_1^*(E=\\emptyset\\, \\(E \\cap \\varphi_2^*(E=\\emptyset\\, \\(\\varphi_1^*(E \\cap \\varphi_2^*(E=\\emptyset\\, where \\(\\varphi_1^*\\, \\(\\varphi_2^*\\ are the maps defined on \\(E\\, induced by \\(\\varphi_1\\, \\(\\varphi_2\\, respectively. We prove that if \\(|L| = p\\, \\(|R| = q\\, \\(3 \\leq p \\leq q\\, then every graph \\(G=(L,R;E\\ of size at most \\(p\\ has a \\(3\\-biplacement.
On the centrality of some graphs
Vecdi Aytac
2017-10-01
Full Text Available A central issue in the analysis of complex networks is the assessment of their stability and vulnerability. A variety of measures have been proposed in the literature to quantify the stability of networks and a number of graph-theoretic parameters have been used to derive formulas for calculating network reliability. Different measures for graph vulnerability have been introduced so far to study different aspects of the graph behavior after removal of vertices or links such as connectivity, toughness, scattering number, binding number, residual closeness and integrity. In this paper, we consider betweenness centrality of a graph. Betweenness centrality of a vertex of a graph is portion of the shortest paths all pairs of vertices passing through a given vertex. In this paper, we obtain exact values for betweenness centrality for some wheel related graphs namely gear, helm, sunflower and friendship graphs.
Quantum walk on a chimera graph
Xu, Shu; Sun, Xiangxiang; Wu, Jizhou; Zhang, Wei-Wei; Arshed, Nigum; Sanders, Barry C.
2018-05-01
We analyse a continuous-time quantum walk on a chimera graph, which is a graph of choice for designing quantum annealers, and we discover beautiful quantum walk features such as localization that starkly distinguishes classical from quantum behaviour. Motivated by technological thrusts, we study continuous-time quantum walk on enhanced variants of the chimera graph and on diminished chimera graph with a random removal of vertices. We explain the quantum walk by constructing a generating set for a suitable subgroup of graph isomorphisms and corresponding symmetry operators that commute with the quantum walk Hamiltonian; the Hamiltonian and these symmetry operators provide a complete set of labels for the spectrum and the stationary states. Our quantum walk characterization of the chimera graph and its variants yields valuable insights into graphs used for designing quantum-annealers.
Fibonacci number of the tadpole graph
Joe DeMaio
2014-10-01
Full Text Available In 1982, Prodinger and Tichy defined the Fibonacci number of a graph G to be the number of independent sets of the graph G. They did so since the Fibonacci number of the path graph Pn is the Fibonacci number F(n+2 and the Fibonacci number of the cycle graph Cn is the Lucas number Ln. The tadpole graph Tn,k is the graph created by concatenating Cn and Pk with an edge from any vertex of Cn to a pendant of Pk for integers n=3 and k=0. This paper establishes formulae and identities for the Fibonacci number of the tadpole graph via algebraic and combinatorial methods.
Software for Graph Analysis and Visualization
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.
Animated construction of line drawings
Fu, Hongbo; Zhou, Shizhe; Liu, Ligang; Mitra, Niloy J.
2011-01-01
system produces plausible animated constructions of input line drawings, with no or little user intervention. We test our algorithm on a range of input sketches, with varying degree of complexity and structure, and evaluate the results via a user study
Gravina, M.F.; Kunz, P.F.; Pavel, T.J.; Rensing, P.E.
1992-02-01
Hippo Draw is a result of research into finding better ways to visualize the kind of statistical data that is so common in high energy physics analyses. In these analyses, frequency distributions are visualized as histograms, contour plots, scatter plots, etc. Traditionally, one used a library of subroutines, called a histogram package, within one's analysis programs to create and display such distributions. HippoDraw is a NeXTstep application for viewing statistical data. It has several unique features which make viewing data distributions highly interactive. It also incorporates simple drawing tools. HippoDraw is written in Objective-C and uses the Hippoplotamus library package which handles the n-tuples and displays. Hippoplotamus is written in ANSI C. 4 refs
Parallel External Memory Graph Algorithms
Arge, Lars Allan; Goodrich, Michael T.; Sitchinava, Nodari
2010-01-01
In this paper, we study parallel I/O efficient graph algorithms in the Parallel External Memory (PEM) model, one o f the private-cache chip multiprocessor (CMP) models. We study the fundamental problem of list ranking which leads to efficient solutions to problems on trees, such as computing lowest...... an optimal speedup of Â¿(P) in parallel I/O complexity and parallel computation time, compared to the single-processor external memory counterparts....
Submanifolds weakly associated with graphs
A CARRIAZO, L M FERN ´ANDEZ and A RODRÍGUEZ-HIDALGO. Department of Geometry and Topology, ..... by means of trees (connected graphs without cycles) and forests (disjoint unions of trees, see [6]) given in [3], by extending it to weak ... CR-submanifold. In this case, every tree is a K2. Finally, Theorem 3.8 of [3] can ...
Deterritorializing Drawing - transformation/deformation
Brabrand, Helle
2012-01-01
but also from within by sensations, body ‘images’ are different to all other images. Twisting these body images make a mode of operation of art. The paper will address the above issues discussing modes of operation and appearance of my actual project. Acting in the reality of drawing, the project confront...... the body, situated in real time and depth, with drawing transforming and deforming time and depth....
Topological structure of dictionary graphs
Fuks, Henryk; Krzeminski, Mark
2009-01-01
We investigate the topological structure of the subgraphs of dictionary graphs constructed from WordNet and Moby thesaurus data. In the process of learning a foreign language, the learner knows only a subset of all words of the language, corresponding to a subgraph of a dictionary graph. When this subgraph grows with time, its topological properties change. We introduce the notion of the pseudocore and argue that the growth of the vocabulary roughly follows decreasing pseudocore numbers-that is, one first learns words with a high pseudocore number followed by smaller pseudocores. We also propose an alternative strategy for vocabulary growth, involving decreasing core numbers as opposed to pseudocore numbers. We find that as the core or pseudocore grows in size, the clustering coefficient first decreases, then reaches a minimum and starts increasing again. The minimum occurs when the vocabulary reaches a size between 10 3 and 10 4 . A simple model exhibiting similar behavior is proposed. The model is based on a generalized geometric random graph. Possible implications for language learning are discussed.
Quantum information processing with graph states
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.)
A Real-Time Systems Symposium Preprint.
1983-09-01
Real - Time Systems Symposium Preprint Interim Tech...estimate of the occurence of the error. Unclassii ledSECUqITY CLASSIF’ICA T" NO MI*IA If’ inDI /’rrd erter for~~ble. ’Corrputnqg A REAL - TIME SYSTEMS SYMPOSIUM...ABSTRACT This technical report contains a preprint of a paper accepted for presentation at the REAL - TIME SYSTEMS SYMPOSIUM, Arlington,
Degree Associated Edge Reconstruction Number of Graphs with Regular Pruned Graph
P. Anusha Devi
2015-10-01
Full Text Available An ecard of a graph $G$ is a subgraph formed by deleting an edge. A da-ecard specifies the degree of the deleted edge along with the ecard. The degree associated edge reconstruction number of a graph $G,~dern(G,$ is the minimum number of da-ecards that uniquely determines $G.$ The adversary degree associated edge reconstruction number of a graph $G, adern(G,$ is the minimum number $k$ such that every collection of $k$ da-ecards of $G$ uniquely determines $G.$ The maximal subgraph without end vertices of a graph $G$ which is not a tree is the pruned graph of $G.$ It is shown that $dern$ of complete multipartite graphs and some connected graphs with regular pruned graph is $1$ or $2.$ We also determine $dern$ and $adern$ of corona product of standard graphs.
An efficient algorithm for planar drawing of RNA structures with pseudoknots of any type.
Byun, Yanga; Han, Kyungsook
2016-06-01
An RNA pseudoknot is a tertiary structural element in which bases of a loop pair with complementary bases are outside the loop. A drawing of RNA secondary structures is a tree, but a drawing of RNA pseudoknots is a graph that has an inner cycle within a pseudoknot and possibly outer cycles formed between the pseudoknot and other structural elements. Visualizing a large-scale RNA structure with pseudoknots as a planar drawing is challenging because a planar drawing of an RNA structure requires both pseudoknots and an entire structure enclosing the pseudoknots to be embedded into a plane without overlapping or crossing. This paper presents an efficient heuristic algorithm for visualizing a pseudoknotted RNA structure as a planar drawing. The algorithm consists of several parts for finding crossing stems and page mapping the stems, for the layout of stem-loops and pseudoknots, and for overlap detection between structural elements and resolving it. Unlike previous algorithms, our algorithm generates a planar drawing for a large RNA structure with pseudoknots of any type and provides a bracket view of the structure. It generates a compact and aesthetic structure graph for a large pseudoknotted RNA structure in O([Formula: see text]) time, where n is the number of stems of the RNA structure.
37 CFR 1.152 - Design drawings.
2010-07-01
... 37 Patents, Trademarks, and Copyrights 1 2010-07-01 2010-07-01 false Design drawings. 1.152... Design drawings. The design must be represented by a drawing that complies with the requirements of § 1... are not permitted in a design drawing. Photographs and ink drawings are not permitted to be combined...
Ninth international symposium on radiopharmacology
1995-01-01
The goal of this Symposium is to provide a forum for those international scientists involved in applying the principles of pharmacology and radiation biology to the development of agents for the diagnosis and treatment of disease. The program will highlight state-of-the-art progress in the development of those agents used in conjunction with some form of radiation such as radiopharmaceuticals, radiopaques, photo- and radiosensitizing drugs, and neutron capture agents. An underlying pharmacokinetic parameter associated with all these agents is the need for site-specific delivery to an organ or tumor. Therefore, a major goal of the symposium will be to address those pharmacologic principles for targeting molecules to specific tissue sites. Accordingly, session themes will include receptor-mediated processes, membrane transporters, antibody interactions, metabolic trapping, and oligonucleotide-antisense mechanisms
Memorial Symposium for Victor Weisskopf
2002-01-01
Victor 'Viki' Weisskopf, former Director General of CERN from 1961 to 1965, passed away five months ago. At that time, the Bulletin dedicated its coverpage to this brilliant physicist (19-20/2002). Now, CERN has organised a Memorial Symposium for next Tuesday 17 September, where you are cordially invited. This tribute will include the following speechs: L. Maiani: Welcome J. D. Jackson: Highlights from the career and scientific works of Victor F. Weisskopf M. Hine and K. Johnsen: Working with Viki at CERN M. Jacob: Knowledge and Wonder A member of Viki's family: Reminiscences. The Memorial Symposium will take place in the Main Auditorium at 15h. Drinks will be served in Pas Perdus at 17h 30.
Ninth international symposium on radiopharmacology
NONE
1995-12-31
The goal of this Symposium is to provide a forum for those international scientists involved in applying the principles of pharmacology and radiation biology to the development of agents for the diagnosis and treatment of disease. The program will highlight state-of-the-art progress in the development of those agents used in conjunction with some form of radiation such as radiopharmaceuticals, radiopaques, photo- and radiosensitizing drugs, and neutron capture agents. An underlying pharmacokinetic parameter associated with all these agents is the need for site-specific delivery to an organ or tumor. Therefore, a major goal of the symposium will be to address those pharmacologic principles for targeting molecules to specific tissue sites. Accordingly, session themes will include receptor-mediated processes, membrane transporters, antibody interactions, metabolic trapping, and oligonucleotide-antisense mechanisms.
Georgieva, Katya; Nagovitsyn, Yury; The sun : new challenges
2012-01-01
These are the proceedings of the Symposium 3 of JENAM 2011 on new scientific challenges posed by the Sun. The topics covered are 1. The unusual sunspot minimum, which poses challenges to the solar dynamo theory 2. The Sun’s Terra-Hertz emission, which opens a new observational window 3. Corona wave activity 4. Space weather agents - initiation, propagation, and forecasting In 21 in-depth contributions, the reader will be presented with the latest findings.
Memorial symposium for Victor Weisskopf.
Maximilien Brice
2002-01-01
A memorial symposium for Victor Weisskopf, CERN Director-General from 1961 to 1965, was held at CERN on 17 September 2002. Photo 01: L. Maiani: Welcome.Photo 02: J. D. Jackson: Highlights from the career and scientific works of Victor F. Weisskopf.Photos 05 09: M. Hine and K. Johnsen: Working with Viki at CERN.Photo 10: M. Jacob: Knowledge and Wonder.Photo 14: K. Worth (Viki's daughter): Reminiscences.
Scandinavian Symposium on Reactor Waste
1981-09-01
More than 100 delegates forom the Scandinavian countries were gathered for a symposium on September 14-16 1981 at Kungaelv Sweden to discuss nuclear reactor waste. The organisation for the handling of radioactive waste at different countries was presented and the principles of radioactive safety were discussed. The planning of the deposition and storage of waste was described. The proceedings are reproduced on some twenty papers, a number of them written in English. (G.B.)
Symposium on Nuclear Energy. Proceedings
1981-01-01
The energy problem poses a big challenge to a developing country like the Philippines. The development of renewable energy sources is not enough. Aware then of the limitations of these energy sources, in spite of arguments against nuclear energy we have no other recourse but to go nuclear. This symposium emphasizes the importance of energy development to attain the country's progress and discusses the pros and economics of nuclear power. (RTD)
National symposium on food irradiation
1979-10-01
This report contains abstracts of papers delivered at the National symposium on food irradiation held in Pretoria. The abstracts have been grouped into the following sections: General background, meat, agricultural products, marketing and radiation facilities - cost and plant design. Each abstract has been submutted separately to INIS. Tables listing irradiated food products cleared for human consumption in different countries are given as well as a table listing those irradiated food items that have been cleared in South Africa
Rapporteurs report of the symposium
Myerscough, Dan
2014-01-01
The objective of the symposium was to share current practice, experiences and innovations within the management of contaminated metallic radioactive material. The symposium was a forum for: Learning about current practices, Highlight strategic issues related to metals recycling, Exchange of experiences, Discussion of innovative and new techniques and needs for improvements, Developing and maintenance of networks in the area of metals recycling. The aim was to bring together operators, regulators, decision makers, scientists, consultants, contractors and other stakeholders. A short introduction by representatives from Studsvik, IAEA and OECD/NEA started the symposium followed by presentations by invited speakers from international organisations. Seven topical sessions covered issues relating to: 1 - Regulations and recommendations: - International recommendations and national legislation, - Application of regulations, - Regulator views; 2 - Minimising waste amounts: - Experience in minimising the generation of waste in the form of radioactive or potentially radioactive metals, - Activities to minimise the waste volumes for disposal; 3 - Characterisation and categorisation of metals to be recycled; 4 - Decontamination of metals for clearance; 5 - Melting of metals for clearance, reuse or volume reduction; 6 - Best practice in management of metals for clearance and recycling; 7 - Sustainability and public acceptance. Each session contained three to five presentations and group discussions. Each session was concluded with a short analysis of the presentations and the outcome of the group discussions. Conclusions of each session and outcome of the group discussions were presented on a Summing up the third day. The symposium also held a poster session with topics as above. This report provides a short summary of the various presentations and discussions concentrating on the key messages and outcomes of the sessions
JaxoDraw: A graphical user interface for drawing Feynman diagrams. Version 2.0 release notes
Binosi, D.; Collins, J.; Kaufhold, C.; Theussl, L.
2009-09-01
A new version of the Feynman graph plotting tool JaxoDraw is presented. Version 2.0 is a fundamental re-write of most of the JaxoDraw core and some functionalities, in particular importing graphs, are not backward-compatible with the 1.x branch. The most prominent new features include: drawing of Bézier curves for all particle modes, on-the-fly update of edited objects, multiple undo/redo functionality, the addition of a plugin infrastructure, and a general improved memory performance. A new LaTeX style file is presented that has been written specifically on top of the original axodraw.sty to meet the needs of this new version. New version program summaryProgram title: JaxoDraw Catalogue identifier: ADUA_v2_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/ADUA_v2_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: GPL No. of lines in distributed program, including test data, etc.: 103 544 No. of bytes in distributed program, including test data, etc.: 3 745 814 Distribution format: tar.gz Programming language: Java Computer: Any Java-enabled platform Operating system: Any Java-enabled platform, tested on Linux, Windows XP, Mac OS X Classification: 14 Catalogue identifier of previous version: ADUA_v1_0 Journal reference of previous version: Comput. Phys. Comm. 161 (2004) 76 Does the new version supersede the previous version?: Yes Nature of problem: Existing methods for drawing Feynman diagrams usually require some hard-coding in one or the other programming or scripting language. It is not very convenient and often time consuming, to generate relatively simple diagrams. Solution method: A program is provided that allows for the interactive drawing of Feynman diagrams with a graphical user interface. The program is easy to learn and use, produces high quality output in several formats and runs on any operating system where a Java Runtime Environment is available. Reasons for new version: A
Replica methods for loopy sparse random graphs
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)
Chemical Graph Transformation with Stereo-Information
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...
Reconstructing Topological Graphs and Continua
Gartside, Paul; Pitz, Max F.; Suabedissen, Rolf
2015-01-01
The deck of a topological space $X$ is the set $\\mathcal{D}(X)=\\{[X \\setminus \\{x\\}] \\colon x \\in X\\}$, where $[Z]$ denotes the homeomorphism class of $Z$. A space $X$ is topologically reconstructible if whenever $\\mathcal{D}(X)=\\mathcal{D}(Y)$ then $X$ is homeomorphic to $Y$. It is shown that all metrizable compact connected spaces are reconstructible. It follows that all finite graphs, when viewed as a 1-dimensional cell-complex, are reconstructible in the topological sense, and more genera...
Decomposing a graph into bistars
Thomassen, Carsten
2013-01-01
Bárat and the present author conjectured that, for each tree T, there exists a natural number kT such that the following holds: If G is a kT-edge-connected graph such that |E(T)| divides |E(G)|, then G has a T-decomposition, that is, a decomposition of the edge set into trees each of which...... is isomorphic to T. The conjecture has been verified for infinitely many paths and for each star. In this paper we verify the conjecture for an infinite family of trees that are neither paths nor stars, namely all the bistars S(k,k+1)....
Projective configurations in projectivegeometrical drawings
Ivashchenko Andrey Viktorovich
2015-05-01
Full Text Available The article focuses on the optimization of the earlier discussed computer method of obtaining new forms of polyhedra based on projective geometry drawings (trace Diagrams.While working on getting new multifaceted forms by projective geometry methods based on the well-known models of polyhedra on the first stage of the work it is required to calculate the parameters of projective geometry drawings, and then to build them. This is an often used apparatus of analytical geometry. According to it, at first the parameters of the polyhedron (core system of planes are calculated, then we obtain the equation of the plane of the face of the polyhedron, and finally we obtain the equations of lines the next plane faces on the selected curve plane. At each stage of application such a method requires the use of the algorithms of floating point arithmetic, on the one hand, leads to some loss of accuracy of the results and, on the other hand, the large amount of computer time to perform these operations in comparison with integer arithmetic operations.The proposed method is based on the laws existing between the lines that make up the drawing - the known configurations of projective geometry (complete quadrilaterals, configuration of Desargues, Pappus et al..The authors discussed in detail the analysis procedure of projective geometry drawing and the presence of full quadrilaterals, Desargues and Pappus configurations in it.Since the composition of these configurations is invariant with respect to projective change of the original nucleus, knowing them, you can avoid the calculations when solving the equations for finding direct projective geometry drawing analytically, getting them on the basis of belonging to a particular configuration. So you can get a definite advantage in accuracy of the results, and in the cost of computer time. Finding these basic configurations significantly enriches the set of methods and the use of projective geometry drawings.
On path hypercompositions in graphs and automata
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.
Attack Graph Construction for Security Events Analysis
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.
Steiner Distance in Graphs--A Survey
Mao, Yaping
2017-01-01
For a connected graph $G$ of order at least $2$ and $S\\subseteq V(G)$, the \\emph{Steiner distance} $d_G(S)$ among the vertices of $S$ is the minimum size among all connected subgraphs whose vertex sets contain $S$. In this paper, we summarize the known results on the Steiner distance parameters, including Steiner distance, Steiner diameter, Steiner center, Steiner median, Steiner interval, Steiner distance hereditary graph, Steiner distance stable graph, average Steiner distance, and Steiner ...
Density conditions for triangles in multipartite graphs
Bondy, Adrian; Shen, Jin; Thomassé, Stephan
2006-01-01
subgraphs in G. We investigate in particular the case where G is a complete multipartite graph. We prove that a finite tripartite graph with all edge densities greater than the golden ratio has a triangle and that this bound is best possible. Also we show that an infinite-partite graph with finite parts has...... a triangle, provided that the edge density between any two parts is greater than 1/2....
Efficient Algorithmic Frameworks via Structural Graph Theory
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
Electroplastic drawing of stainless steels
Troitskij, O.A.; Spitsyn, V.I.; Sokolov, N.V.; Ryzhkov, V.G.
1977-01-01
Effect of electroplastic drawing on mechanical, magnetic and electrical properties of wire of 12Kh18N10T and Kh13N13M2 steels was studied. Pulse, direct and alternating currents were used. Direct and alternating current densities were 400 A/mm 2 , mean density of pulse current was 200 A/mm 2 . The investigations have shown that the current density increase results in decreasing the wire strengthening intensity though in increasing plastic properties. As a result of electroplastic drawing the growth of magnetic characteristics of wire occurs
Crispy Cracks Symposium Explores Crispness and Water Management
Hamer, R.J.; Vliet, van T.
2008-01-01
This article provides an overview of the first international symposium on crispness creation and retention. The symposium, entitled, ¿Crispy Cracks Symposium,¿ was organized by Cereals & Europe and TI Food and Nutrition. The symposium contained three sessions: 1) Crispiness¿The Fundamentals; 2)
Interactive graphics for the Macintosh: software review of FlexiGraphs.
Antonak, R F
1990-01-01
While this product is clearly unique, its usefulness to individuals outside small business environments is somewhat limited. FlexiGraphs is, however, a reasonable first attempt to design a microcomputer software package that controls data through interactive editing within a graph. Although the graphics capabilities of mainframe programs such as MINITAB (Ryan, Joiner, & Ryan, 1981) and the graphic manipulations available through exploratory data analysis (e.g., Velleman & Hoaglin, 1981) will not be surpassed anytime soon by this program, a researcher may want to add this program to a software library containing other Macintosh statistics, drawing, and graphics programs if only to obtain the easy-to-obtain curve fitting and line smoothing options. I welcome the opportunity to review the enhanced "scientific" version of FlexiGraphs that the author of the program indicates is currently under development. An MS-DOS version of the program should be available within the year.
Symposium on Differential Geometry and Differential Equations
Berger, Marcel; Bryant, Robert
1987-01-01
The DD6 Symposium was, like its predecessors DD1 to DD5 both a research symposium and a summer seminar and concentrated on differential geometry. This volume contains a selection of the invited papers and some additional contributions. They cover recent advances and principal trends in current research in differential geometry.
Conserving biodiversity on native rangelands: Symposium proceedings
Daniel W. Uresk; Greg L. Schenbeck; James T. O' Rourke
1997-01-01
These proceedings are the result of a symposium, "Conserving biodiversity on native rangelands" held on August 17, 1995 in Fort Robinson State Park, NE. The purpose of this symposium was to provide a forum to discuss how elements of rangeland biodiversity are being conserved today. We asked, "How resilient and sustainable are rangeland systems to the...
4th International Language Management Symposium
Prošek, Martin
2016-01-01
Roč. 77, č. 3 (2016), s. 233-240 ISSN 0037-7031. [international language management symposium] Institutional support: RVO:68378092 Keywords : language management theory * international language symposium * language management Subject RIV: AI - Linguistics OBOR OECD: Linguistics Impact factor: 0.625, year: 2016
Coal economics and taxation discussed at symposium
1978-06-01
Some of the highlights from the Symposium on Coal Economics and Taxation Symposium, Regina Saskatchewan May 7-9, 1978, sponsored by the Coal Association of Canada are presented. Investment, provincial policy, sources of funds, uncertainty, tax policies, and operating costs are discussed.
6th European symposium on uroradiology
Bujlov, V.M.
1999-01-01
Materials of the 6th European symposium on uroradiology held in Strasbourg (France) in September, 1998. Symposium topics included problems of radiological diagnosis of kidneys, renovascular hypertension, man and woman sterility, pelvis organs of men and women, functional studies of lower urinary tract, pediatric and interventional uroradiology. Great attention is paid to magnetic resonance tomography, ultrasonography and conventional biomedical radiography [ru
Decomposing a planar graph into an independent set and a 3-degenerate graph
Thomassen, Carsten
2001-01-01
We prove the conjecture made by O. V. Borodin in 1976 that the vertex set of every planar graph can be decomposed into an independent set and a set inducing a 3-degenerate graph. (C) 2001 Academic Press....
Graph algorithms in the titan toolkit.
McLendon, William Clarence, III; Wylie, Brian Neil
2009-10-01
Graph algorithms are a key component in a wide variety of intelligence analysis activities. The Graph-Based Informatics for Non-Proliferation and Counter-Terrorism project addresses the critical need of making these graph algorithms accessible to Sandia analysts in a manner that is both intuitive and effective. Specifically we describe the design and implementation of an open source toolkit for doing graph analysis, informatics, and visualization that provides Sandia with novel analysis capability for non-proliferation and counter-terrorism.
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...
An algebraic approach to graph codes
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...
Jensen, T.R.; Thomassen, Carsten
2000-01-01
If k is a prime power, and G is a graph with n vertices, then a k-coloring of G may be considered as a vector in GF(k)(n). We prove that the subspace of GF(3)(n) spanned by all 3-colorings of a planar triangle-free graph with n vertices has dimension n. In particular, any such graph has at least n...... - 1 nonequivalent 3-colorings, and the addition of any edge or any vertex of degree 3 results in a 3-colorable graph. (C) 2000 John Wiley & Sons, Inc....
Interactive Graph Layout of a Million Nodes
Peng Mi
2016-12-01
Full Text Available Sensemaking of large graphs, specifically those with millions of nodes, is a crucial task in many fields. Automatic graph layout algorithms, augmented with real-time human-in-the-loop interaction, can potentially support sensemaking of large graphs. However, designing interactive algorithms to achieve this is challenging. In this paper, we tackle the scalability problem of interactive layout of large graphs, and contribute a new GPU-based force-directed layout algorithm that exploits graph topology. This algorithm can interactively layout graphs with millions of nodes, and support real-time interaction to explore alternative graph layouts. Users can directly manipulate the layout of vertices in a force-directed fashion. The complexity of traditional repulsive force computation is reduced by approximating calculations based on the hierarchical structure of multi-level clustered graphs. We evaluate the algorithm performance, and demonstrate human-in-the-loop layout in two sensemaking case studies. Moreover, we summarize lessons learned for designing interactive large graph layout algorithms on the GPU.
Text-Filled Stacked Area Graphs
Kraus, Martin
2011-01-01
-filled stacked area graphs; i.e., graphs that feature stacked areas that are filled with small-typed text. Since these graphs allow for computing the text layout automatically, it is possible to include large amounts of textual detail with very little effort. We discuss the most important challenges and some...... solutions for the design of text-filled stacked area graphs with the help of an exemplary visualization of the genres, publication years, and titles of a database of several thousand PC games....
Reconstructing Nearly Simple Polytopes from their Graph
Doolittle, Joseph
2017-01-01
We present a partial description of which polytopes are reconstructible from their graphs. This is an extension of work by Blind and Mani (1987) and Kalai (1988), which showed that simple polytopes can be reconstructed from their graphs. In particular, we introduce a notion of $h$-nearly simple and prove that 1-nearly simple and 2-nearly simple polytopes are reconstructible from their graphs. We also give an example of a 3-nearly simple polytope which is not reconstructible from its graph. Fu...
A Reduction of the Graph Reconstruction Conjecture
Monikandan S.
2014-08-01
Full Text Available A graph is said to be reconstructible if it is determined up to isomor- phism from the collection of all its one-vertex deleted unlabeled subgraphs. Reconstruction Conjecture (RC asserts that all graphs on at least three vertices are reconstructible. In this paper, we prove that interval-regular graphs and some new classes of graphs are reconstructible and show that RC is true if and only if all non-geodetic and non-interval-regular blocks G with diam(G = 2 or diam(Ḡ = diam(G = 3 are reconstructible
Total dominator chromatic number of a graph
Adel P. Kazemi
2015-06-01
Full Text Available Given a graph $G$, the total dominator coloring problem seeks a proper coloring of $G$ with the additional property that every vertex in the graph is adjacent to all vertices of a color class. We seek to minimize the number of color classes. We initiate to study this problem on several classes of graphs, as well as finding general bounds and characterizations. We also compare the total dominator chromatic number of a graph with the chromatic number and the total domination number of it.
Equitable Colorings Of Corona Multiproducts Of Graphs
Furmánczyk Hanna
2017-11-01
Full Text Available A graph is equitably k-colorable if its vertices can be partitioned into k independent sets in such a way that the numbers of vertices in any two sets differ by at most one. The smallest k for which such a coloring exists is known as the equitable chromatic number of G and denoted by =(G. It is known that the problem of computation of =(G is NP-hard in general and remains so for corona graphs. In this paper we consider the same model of coloring in the case of corona multiproducts of graphs. In particular, we obtain some results regarding the equitable chromatic number for the l-corona product G ◦l H, where G is an equitably 3- or 4-colorable graph and H is an r-partite graph, a cycle or a complete graph. Our proofs are mostly constructive in that they lead to polynomial algorithms for equitable coloring of such graph products provided that there is given an equitable coloring of G. Moreover, we confirm the Equitable Coloring Conjecture for corona products of such graphs. This paper extends the results from [H. Furmánczyk, K. Kaliraj, M. Kubale and V.J. Vivin, Equitable coloring of corona products of graphs, Adv. Appl. Discrete Math. 11 (2013 103–120].
VT Digital Line Graph Miscellaneous Transmission Lines
Vermont Center for Geographic Information — (Link to Metadata) This datalayer is comprised of Miscellaineous Transmission Lines. Digital line graph (DLG) data are digital representations of cartographic...
Health and economic development: introduction to the symposium.
Clay, Joy A; Mirvis, David M
2008-01-01
This symposium explores the role of health as an 'economic engine' in the lower Mississippi River Delta region of the United States. The health as an economic engine model proposes that health is an important and perhaps critical determinant of economic growth and development. This model is the reverse of the more commonly considered paradigm in which economic conditions are major determinants of health status. This reframing of the conventional pathway draws upon an existing and extensive internationally-based body of knowledge, predominantly from research done in Africa and Asia. We suggest, in this symposium, that the health as an economic engine model can also be applied within the United States, particularly in regions that are economically underdeveloped and have poor health. This reframing has significant implications for population health policy as public health advancement can be legitimately argued to be an investment rather than just an expense. Viewing health as an economic engine supports a call to community-based participatory action on the part of policy makers, researchers, and educators to further both public and private investment in health, particularly for children and the poor.
Studying Meaning in Children' Drawings
Hopperstad, Marit Holm
2010-01-01
This paper reports on an ethnographic study conducted with two Year 1 classes in two different Norwegian schools. In total, 35 five- and six-year-old children were involved in the study and were observed over a two-month period as they engaged in learning activities that involved drawing. Building on Kress and Van Leeuwen's (1996) theory of a…
Analysing Children's Drawings: Applied Imagination
Bland, Derek
2012-01-01
This article centres on a research project in which freehand drawings provided a richly creative and colourful data source of children's imagined, ideal learning environments. Issues concerning the analysis of the visual data are discussed, in particular, how imaginative content was analysed and how the analytical process was dependent on an…
Drawing Analogies to Deepen Learning
Fava, Michelle
2017-01-01
This article offers examples of how drawing can facilitate thinking skills that promote analogical reasoning to enable deeper learning. The instructional design applies cognitive principles, briefly described here. The workshops were developed iteratively, through feedback from student and teacher participants. Elements of the UK National…
Physics momentum 'stars' draw majors
Lindström, I
2003-01-01
Over the past decade, the number of University of Arizona students declaring physics as their major has doubled, amid a national decline. According to a recent report by the National Task Force on Undergraduate Physics, it is the university's dedication to its undergraduate physics program which draws students in (1 page).
Human Figure Drawings in Perspective.
Naglieri, Jack A.
1993-01-01
Responds to previous article (Motta, Little, and Tobin, this issue) which reviewed data-based studies on figure drawings and found little support for their validity or use in assessing personality, behavior, emotion, or intellectual functioning. Contends that article is unacceptable for publication in present form, with main criticism being that…
On cyclic orthogonal double covers of circulant graphs by special infinite graphs
R. El-Shanawany
2017-12-01
Full Text Available In this article, a technique to construct cyclic orthogonal double covers (CODCs of regular circulant graphs by certain infinite graph classes such as complete bipartite and tripartite graphs and disjoint union of butterfly and K1,2n−10 is introduced.
The complexity of the matching-cut problem for planar graphs and other graph classes
Bonsma, P.S.
2009-01-01
The Matching-Cut problem is the problem to decide whether a graph has an edge cut that is also a matching. Previously this problem was studied under the name of the Decomposable Graph Recognition problem, and proved to be -complete when restricted to graphs with maximum degree four. In this paper it
Brechet, Claire; Jolley, Richard P.
2014-01-01
The purpose of the present study was to investigate the roles of emotional comprehension and representational drawing skill in children's expressive drawing. Fifty 7- to 10-year-olds were asked to produce two (happy and sad) expressive drawings, two representational drawings (drawing of a man running and drawing of a house) and to answer the…
Probability on graphs random processes on graphs and lattices
Grimmett, Geoffrey
2018-01-01
This introduction to some of the principal models in the theory of disordered systems leads the reader through the basics, to the very edge of contemporary research, with the minimum of technical fuss. Topics covered include random walk, percolation, self-avoiding walk, interacting particle systems, uniform spanning tree, random graphs, as well as the Ising, Potts, and random-cluster models for ferromagnetism, and the Lorentz model for motion in a random medium. This new edition features accounts of major recent progress, including the exact value of the connective constant of the hexagonal lattice, and the critical point of the random-cluster model on the square lattice. The choice of topics is strongly motivated by modern applications, and focuses on areas that merit further research. Accessible to a wide audience of mathematicians and physicists, this book can be used as a graduate course text. Each chapter ends with a range of exercises.
Characterization equipment essential/support drawing plan
WILSON, G.W.
1999-01-01
The purpose of this document is to list the Characterization equipment drawings that are classified as Essential Drawings and Support Drawings. Essential Drawings: Are those drawings identified by the facility staff as necessary to directly support the safe operation of the facility or equipment (HNF 1997a). Support Drawings: Are those drawings identified by facility staff that further describe the design details of structures, systems, or components shown on essential drawings. (HNF 1997a) The Characterization equipment drawings identified in this report are deemed essential drawings as defined in HNF-PRO-242, Engineering Drawing Requirements (HNF 1997a). These drawings will be prepared, revised, and maintained per HNF-PRO-440, Engineering Document Change Control (HNF 1997b). All other Characterization equipment drawings not identified in this document will be considered General drawings until the Characterization Equipment Drawing Evaluation Report (Wilson 1998) is updated during fiscal year 1999. Trucks 1 and 2 drawings are not included in this revision of the essential drawing list due to uncertainty about future use
International symposium 'Energetics 2004'. Symposium proceedings. Book 1
2004-01-01
The holding of this Symposium was initiated by ZEMAK - Macedonian Energy Association that for the last tens of years established itself in the national and international scientific and professional circles as a competent association of professionals with the main goal to follow, promote and improve the energy sector in the country. Having in mind the fact that the power energy sector as a fundamental sector plays a main role in the development and the improvement of the rest of the industry, and in the same time has a tremendous impact on the sustainable development of the entire economy of a country, power energy sector in fact has the paramount importance in the business environment of our country. Thus, ZEMAK has historically important role as a responsible and permanent driver, promoter and initiator for resolving of all-important questions directly or indirectly interconnected with the power energy sector in the country, and therefore the entire economy in the country as well. Following the past, ZEMAK had and would always have needs of organizing national and international symposiums and workshops as a panel where directly at one place national and international power energy experts could initiate, debate and resolve all up-to-date questions in the present energy sector in Macedonia, could analyze the modern world trends in the energy sector and try to find appropriate models for their application for further development and improvement of the energy sector in our country. This international symposium has the main goal to concentrate on a single place everybody who has power energy as a permanent preoccupation and/or vocation and professional interest. To aggregate on one place various experts, from the Academy and Universities, from the business circles and companies who are preoccupied with power energy directly or indirectly in their everyday life and work. During the Symposium more than 90 scientific and/or professional papers were presented and discussed
14. European cosmic ray symposium. Symposium program and abstracts
1994-08-01
The abstracts of the 14. European Cosmic Ray Symposium are presented. The papers cover a large variety of topics in cosmic ray physics, both from the theoretical and the experimental point of view. Sun physics, and the effects on the inner heliosphere, the composition, and the properties of the primary and secondary cosmic radiation, galactic acceleration and the results of accelerator physics relevant to cosmic radiation physics, and the description and the results of large detector systems are presented. 63 items are indexed for INIS database. (K.A.)
International symposium 'Energetics 2004'. Symposium proceedings. Book 2
2004-01-01
The holding of this Symposium was initiated by ZEMAK - Macedonian Energy Association that for the last tens of years established itself in the national and international scientific and professional circles as a competent association of professionals with the main goal to follow, promote and improve the energy sector in the country. Having in mind the fact that the power energy sector as a fundamental sector plays a main role in the development and the improvement of the rest of the industry, and in the same time has a tremendous impact on the sustainable development of the entire economy of a country, power energy sector in fact has the paramount importance in the business environment of our country. Thus, ZEMAK has historically important role as a responsible and permanent driver, promoter and initiator for resolving of all-important questions directly or indirectly interconnected with the power energy sector in the country, and therefore the entire economy in the country as well. Following the past, ZEMAK had and would always have needs of organizing national and international symposiums and workshops as a panel where directly at one place national and international power energy experts could initiate, debate and resolve all up-to-date questions in the present energy sector in Macedonia, could analyze the modern world trends in the energy sector and try to find appropriate models for their application for further development and improvement of the energy sector in our country. This international symposium has the main goal to concentrate on a single place everybody who has power energy as a permanent preoccupation and/or vocation and professional interest. To aggregate on one place various experts, from the Academy and Universities, from the business circles and companies who are preoccupied with power energy directly or indirectly in their everyday life and work. During the Symposium more than 90 scientific and/or professional papers were presented and discussed
Enabling Graph Appliance for Genome Assembly
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.
Isospectral graphs with identical nodal counts
Oren, Idan; Band, Ram
2012-01-01
According to a recent conjecture, isospectral objects have different nodal count sequences (Gnutzmann et al 2005 J. Phys. A: Math. Gen. 38 8921–33). We study generalized Laplacians on discrete graphs, and use them to construct the first non-trivial counterexamples to this conjecture. In addition, these examples demonstrate a surprising connection between isospectral discrete and quantum graphs. (paper)
Compression-based inference on graph data
Bloem, P.; van den Bosch, A.; Heskes, T.; van Leeuwen, D.
2013-01-01
We investigate the use of compression-based learning on graph data. General purpose compressors operate on bitstrings or other sequential representations. A single graph can be represented sequentially in many ways, which may in uence the performance of sequential compressors. Using Normalized
On minimum degree conditions for supereulerian graphs
Broersma, Haitze J.; Xiong, L.
1999-01-01
A graph is called supereulerian if it has a spanning closed trail. Let $G$ be a 2-edge-connected graph of order $n$ such that each minimal edge cut $E \\subseteq E (G)$ with $|E| \\le 3$ satisfies the property that each component of $G-E$ has order at least $(n-2)/5$. We prove that either $G$ is
On the exterior structure of graphs
Kastler, Daniel
2004-01-01
After a detailed ab initio description of the exterior structure of graphs as handled by Connes and Kreimer in their work on renormalization (illustrated by the example of the φ 3 model in six dimensions) we spell out in detail their study of the Lie algebra of infinitesimal characters and of the group of characters of the Hopf algebra of Feynman graphs
The Minimum Distance of Graph Codes
Høholdt, Tom; Justesen, Jørn
2011-01-01
We study codes constructed from graphs where the code symbols are associated with the edges and the symbols connected to a given vertex are restricted to be codewords in a component code. In particular we treat such codes from bipartite expander graphs coming from Euclidean planes and other...... geometries. We give results on the minimum distances of the codes....
Domination versus disjunctive domination in graphs | Henning ...
Domination versus disjunctive domination in graphs. Michael A Henning, Sinclair A Marcon. Abstract. A dominating set in a graph G is a set S of vertices of G such that every vertex not in S is adjacent to a vertex of S. The domination number of G is the minimum cardinality of a dominating set of G. For a positive integer b, ...
Eigenvalues and expansion of bipartite graphs
Høholdt, Tom; Janwa, Heeralal
2012-01-01
We prove lower bounds on the largest and second largest eigenvalue of the adjacency matrix of bipartite graphs and give necessary and sufficient conditions for equality. We give several examples of classes that are optimal with respect to the bouns. We prove that BIBD-graphs are characterized by ...
1National Centre for Advanced Research in Discrete Mathematics ... 3Department of Computer Science, Ball State University, Muncie, IN, USA .... The corona of two disjoint graphs G1 and G2 is defined to be the graph G = G1 ◦ G2,.
Trajectories entropy in dynamical graphs with memory
Francesco eCaravelli
2016-04-01
Full Text Available In this paper we investigate the application of non-local graph entropy to evolving and dynamical graphs. The measure is based upon the notion of Markov diffusion on a graph, and relies on the entropy applied to trajectories originating at a specific node. In particular, we study the model of reinforcement-decay graph dynamics, which leads to scale free graphs. We find that the node entropy characterizes the structure of the network in the two parameter phase-space describing the dynamical evolution of the weighted graph. We then apply an adapted version of the entropy measure to purely memristive circuits. We provide evidence that meanwhile in the case of DC voltage the entropy based on the forward probability is enough to characterize the graph properties, in the case of AC voltage generators one needs to consider both forward and backward based transition probabilities. We provide also evidence that the entropy highlights the self-organizing properties of memristive circuits, which re-organizes itself to satisfy the symmetries of the underlying graph.
Graphs, Ideal Flow, and the Transportation Network
Teknomo, Kardi
2016-01-01
This lecture discusses the mathematical relationship between network structure and network utilization of transportation network. Network structure means the graph itself. Network utilization represent the aggregation of trajectories of agents in using the network graph. I show the similarity and relationship between the structural pattern of the network and network utilization.
Supplantation of Mental Operations on Graphs
Vogel, Markus; Girwidz, Raimund; Engel, Joachim
2007-01-01
Research findings show the difficulties younger students have in working with graphs. Higher mental operations are necessary for a skilled interpretation of abstract representations. We suggest connecting a concrete representation of the modeled problem with the related graph. The idea is to illustrate essential mental operations externally. This…
Some remarks on definability of process graphs
Grabmayer, C.A.; Klop, J.W.; Luttik, B.; Baier, C.; Hermanns, H.
2006-01-01
We propose the notions of "density" and "connectivity" of infinite process graphs and investigate them in the context of the wellknown process algebras BPA and BPP. For a process graph G, the density function in a state s maps a natural number n to the number of states of G with distance less or
On revealing graph cycles via boundary measurements
Belishev, M I; Wada, N
2009-01-01
This paper deals with boundary value inverse problems on a metric graph, the structure of the graph being assumed unknown. The question under consideration is how to detect from the dynamical and/or spectral inverse data whether the graph contains cycles (is not a tree). For any graph Ω, the dynamical as well as spectral boundary inverse data determine the so-called wave diameter d w : H -1 (Ω) → R defined on functionals supported in the graph. The known fact is that if Ω is a tree then d w ≥ 0 holds and, in this case, the inverse data determine Ω up to isometry. A graph Ω is said to be coordinate if the functions {dist Ω (., γ)} γin∂Ω constitute a coordinate system on Ω. For such graphs, we propose a procedure, which reveals the presence/absence of cycles. The hypothesis is that Ω contains cycles if and only if d w takes negative values. We do not justify this hypothesis in the general case but reduce it to a certain special class of graphs (suns)
Declarative Process Mining for DCR Graphs
Debois, Søren; Hildebrandt, Thomas T.; Laursen, Paw Høvsgaard
2017-01-01
We investigate process mining for the declarative Dynamic Condition Response (DCR) graphs process modelling language. We contribute (a) a process mining algorithm for DCR graphs, (b) a proposal for a set of metrics quantifying output model quality, and (c) a preliminary example-based comparison...
A Graph Library Extension of SVG
Nørmark, Kurt
2007-01-01
be aggregated as a single node, and an entire graph can be embedded in a single node. In addition, a number of different graph animations are described. The starting point of the SVG extension is a library that provides an exact of mirror of SVG 1.1 in the functional programming language Scheme. Each element...
Acyclicity in edge-colored graphs
Gutin, Gregory; Jones, Mark; Sheng, Bin
2017-01-01
A walk W in edge-colored graphs is called properly colored (PC) if every pair of consecutive edges in W is of different color. We introduce and study five types of PC acyclicity in edge-colored graphs such that graphs of PC acyclicity of type i is a proper superset of graphs of acyclicity of type i......+1, i=1,2,3,4. The first three types are equivalent to the absence of PC cycles, PC closed trails, and PC closed walks, respectively. While graphs of types 1, 2 and 3 can be recognized in polynomial time, the problem of recognizing graphs of type 4 is, somewhat surprisingly, NP-hard even for 2-edge-colored...... graphs (i.e., when only two colors are used). The same problem with respect to type 5 is polynomial-time solvable for all edge-colored graphs. Using the five types, we investigate the border between intractability and tractability for the problems of finding the maximum number of internally vertex...
From concatenated codes to graph codes
Justesen, Jørn; Høholdt, Tom
2004-01-01
We consider codes based on simple bipartite expander graphs. These codes may be seen as the first step leading from product type concatenated codes to more complex graph codes. We emphasize constructions of specific codes of realistic lengths, and study the details of decoding by message passing...
Graph coarsening and clustering on the GPU
Fagginger Auer, B.O.; Bisseling, R.H.
2013-01-01
Agglomerative clustering is an effective greedy way to quickly generate graph clusterings of high modularity in a small amount of time. In an effort to use the power offered by multi-core CPU and GPU hardware to solve the clustering problem, we introduce a fine-grained sharedmemory parallel graph
Pixels to Graphs by Associative Embedding
Newell, Alejandro; Deng, Jia
2017-01-01
network such that it takes in an input image and produces a full graph. This is done end-to-end in a single stage with the use of associative embeddings. The network learns to simultaneously identify all of the elements that make up a graph and piece them
Isomorphisms and traversability of directed path graphs
Broersma, Haitze J.; Li, Xueliang; Li, X.
1998-01-01
The concept of a line digraph is generalized to that of a directed path graph. The directed path graph $\\forw P_k(D)$ of a digraph $D$ is obtained by representing the directed paths on $k$ vertices of $D$ by vertices. Two vertices are joined by an arc whenever the corresponding directed paths in $D$
Young Children's Drawings in Problem Solving
Bakar, Kamariah Abu; Way, Jennifer; Bobis, Janette
2016-01-01
This paper explores young children's drawings (6 years old) in early number and addition activities in Malaysia. Observation, informal interviews and analysis of drawings revealed two types of drawing, and gave insight into the transitional process required for children to utilise drawings in problem solving. We argue the importance of valuing and…
Try This: Draw Like a Scientist
Preston, Christine
2016-01-01
Young children love to draw, and should be encouraged to explore drawing as a communication tool. Drawing is a means by which children can express their thoughts, interests and feelings, long before they learn to write. We know that: "children's drawings are vehicles for expression and communication" (Chang, 2012, p. 187). This form of…
37 CFR 1.165 - Plant drawings.
2010-07-01
... 37 Patents, Trademarks, and Copyrights 1 2010-07-01 2010-07-01 false Plant drawings. 1.165 Section... Plant drawings. (a) Plant patent drawings should be artistically and competently executed and must... required by the examiner. The drawing must disclose all the distinctive characteristics of the plant...
2010-07-01
... 37 Patents, Trademarks, and Copyrights 1 2010-07-01 2010-07-01 false The drawings. 1.437 Section 1... Application § 1.437 The drawings. (a) Drawings are required when they are necessary for the understanding of the invention (PCT Art. 7). (b) The physical requirements for drawings are set forth in PCT Rule 11...
Drawing on Curiosity: Between Two Worlds
Wigglesworth, Ron
2017-01-01
This narrative of my research on drawing shares my experience of relearning drawing by hand and how the act of drawing can stimulate curiosity. This article examines its potential to enhance learning/observation in science. It describes a kinaesthetic drawing methodology and addresses pedagogical solutions for overcoming a student's declaration…
37 CFR 2.51 - Drawing required.
2010-07-01
... 37 Patents, Trademarks, and Copyrights 1 2010-07-01 2010-07-01 false Drawing required. 2.51... COMMERCE RULES OF PRACTICE IN TRADEMARK CASES Drawing § 2.51 Drawing required. (a) In an application under section 1(a) of the Act, the drawing of the mark must be a substantially exact representation of the mark...
2016-01-01
Preface: The 6th Asian Physics Symposium 2015 (APS 2015) The 6th Asian Physics Symposium 2015 (APS 2015) is organized by the Physics Department, Faculty of Mathematics and Natural Sciences, Bandung Institute of Technology, in collaboration with HFI (Indonesian Physical Society), PAPSI (Physics and Applied Physics Society of Indonesia), HANI (Indonesian Nuclear Scientist Society), HRMI (Indonesian Material Research Society), HAGI (Indonesian Geophysicist Society) - West Java Chapter, and HFMBI (Indonesian Medical Physicist and Biophysicist Society). APS 2015 is aimed at providing a forum of scientific communication and interaction among distinguished scientists working in physics and its related fields. In this scientific event the latest research will be presented, and state-of-the-art developments in the field discussed, to help to guide our future research directions. It is also designed to offer the opportunity for young Indonesian scientists and students to make direct contacts with well-known scientists abroad and thereby foster the existing research collaborations and extend international research networking for the future. The scope of research presented and discussed in this symposium covers theoretical high energy physics, materials sciences and technology, biophysics and medical physics, nuclear science and engineering, earth and planetary sciences, computational physics, instrumentation and measurement, physics education, and interdisciplinary physics. The program of APS 2016 features 6 invited talks and 208 contributed oral presentations, which come from 7 different countries: Japan, South Korea, Singapore, Malaysia, Iraq, Ethiopia, and Indonesia. All papers have been reviewed after they are presented in this event. Selected papers are published in this Institute of Physics (IoP) Conference Series. Finally, I would like to express my sincere appreciation to all of authors for their valuable contributions and also to the members of the committee for
Aarhus Regenerative Orthopaedics Symposium (AROS)
Foldager, Casper B.; Bendtsen, Michael; Berg, Lise C.
2016-01-01
to musculoskeletal pain and disability. The Aarhus Regenerative Orthopaedics Symposium (AROS) 2015 was motivated by the need to address regenerative challenges in an ageing population by engaging clinicians, basic scientists, and engineers. In this position paper, we review our contemporary understanding of societal......, patient-related, and basic science-related challenges in order to provide a reasoned roadmap for the future to deal with this compelling and urgent healthcare problem. © 2017 The Author(s). Published by Taylor & Francis on behalf of the Nordic Orthopedic Federation....