Selected topics on the nonrelativistic diagram technique

International Nuclear Information System (INIS)

Blokhintsev, L.D.; Narodetskij, I.M.

1983-01-01

The construction of the diagrams describing various processes in the four-particle systems is considered. It is shown that these diagrams, in particular the diagrams corresponding to the simple mechanisms often used in nuclear and atomic reaction theory, are readily obtained from the Faddeev-Yakubovsky equations. The covariant four-dimensional formalism of nonrelativistic Feynman graphs and its connection to the three-dimensional graph technique are briefly discussed

Updating the Nomographical Diagrams for Dimensioning the Beams

OpenAIRE

Pop Maria T.

2015-01-01

In order to reduce the time period needed for structures design it is strongly recommended to use nomographical diagrams. The base for formation and updating the nomographical diagrams, stands on the charts presented by different technical publications. The updated charts use the same algorithm and calculation elements as the former diagrams in accordance to the latest prescriptions and European standards. The result consists in a chart, having the same properties, similar with the nomogragra...

Khovanov homology of graph-links

Energy Technology Data Exchange (ETDEWEB)

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.

Updating the Nomographical Diagrams for Dimensioning the Beams

Directory of Open Access Journals (Sweden)

Pop Maria T.

2015-12-01

Full Text Available In order to reduce the time period needed for structures design it is strongly recommended to use nomographical diagrams. The base for formation and updating the nomographical diagrams, stands on the charts presented by different technical publications. The updated charts use the same algorithm and calculation elements as the former diagrams in accordance to the latest prescriptions and European standards. The result consists in a chart, having the same properties, similar with the nomogragraphical diagrams already in us. As a general conclusion, even in our days, the nomographical diagrams are very easy to use. Taking into consideration the value of the moment it’s easy to find out the necessary reinforcement area and vice-verse, having the reinforcement area you can find out the capable moment. It still remains a useful opportunity for pre-sizing and designs the reinforced concrete sections.

Growth charts of human development

NARCIS (Netherlands)

Van Buuren, Stef

2014-01-01

This article reviews and compares two types of growth charts for tracking human development over age. Both charts assume the existence of a continuous latent variable, but relate to the observed data in different ways. The D-score diagram summarizes developmental indicators into a single aggregate

A novel decision diagrams extension method

International Nuclear Information System (INIS)

Li, Shumin; Si, Shubin; Dui, Hongyan; Cai, Zhiqiang; Sun, Shudong

2014-01-01

Binary decision diagram (BDD) is a graph-based representation of Boolean functions. It is a directed acyclic graph (DAG) based on Shannon's decomposition. Multi-state multi-valued decision diagram (MMDD) is a natural extension of BDD for the symbolic representation and manipulation of the multi-valued logic functions. This paper proposes a decision diagram extension method based on original BDD/MMDD while the scale of a reliability system is extended. Following a discussion of decomposition and physical meaning of BDD and MMDD, the modeling method of BDD/MMDD based on original BDD/MMDD is introduced. Three case studies are implemented to demonstrate the presented methods. Compared with traditional BDD and MMDD generation methods, the decision diagrams extension method is more computationally efficient as shown through the running time

Box graphs and resolutions I

Directory of Open Access Journals (Sweden)

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.

Stage line diagram: an age-conditional reference diagram for tracking development.

Science.gov (United States)

van Buuren, Stef; Ooms, Jeroen C L

2009-05-15

This paper presents a method for calculating stage line diagrams, a novel type of reference diagram useful for tracking developmental processes over time. Potential fields of applications include: dentistry (tooth eruption), oncology (tumor grading, cancer staging), virology (HIV infection and disease staging), psychology (stages of cognitive development), human development (pubertal stages) and chronic diseases (stages of dementia). Transition probabilities between successive stages are modeled as smoothly varying functions of age. Age-conditional references are calculated from the modeled probabilities by the mid-P value. It is possible to eliminate the influence of age by calculating standard deviation scores (SDS). The method is applied to the empirical data to produce reference charts on secondary sexual maturation. The mean of the empirical SDS in the reference population is close to zero, whereas the variance depends on age. The stage line diagram provides quick insight into both status (in SDS) and tempo (in SDS/year) of development of an individual child. Other measures (e.g. height SDS, body mass index SDS) from the same child can be added to the chart. Diagrams for sexual maturation are available as a web application at http://vps.stefvanbuuren.nl/puberty. The stage line diagram expresses status and tempo of discrete changes on a continuous scale. Wider application of these measures scores opens up new analytic possibilities. (c) 2009 John Wiley & Sons, Ltd.

Modeling Software Evolution using Algebraic Graph Rewriting

NARCIS (Netherlands)

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

Memory-type control charts in statistical process control

NARCIS (Netherlands)

Abbas, N.

2012-01-01

Control chart is the most important statistical tool to manage the business processes. It is a graph of measurements on a quality characteristic of the process on the vertical axis plotted against time on the horizontal axis. The graph is completed with control limits that cause variation mark. Once

Finding and accessing diagrams in biomedical publications.

Science.gov (United States)

Kuhn, Tobias; Luong, ThaiBinh; Krauthammer, Michael

2012-01-01

Complex relationships in biomedical publications are often communicated by diagrams such as bar and line charts, which are a very effective way of summarizing and communicating multi-faceted data sets. Given the ever-increasing amount of published data, we argue that the precise retrieval of such diagrams is of great value for answering specific and otherwise hard-to-meet information needs. To this end, we demonstrate the use of advanced image processing and classification for identifying bar and line charts by the shape and relative location of the different image elements that make up the charts. With recall and precisions of close to 90% for the detection of relevant figures, we discuss the use of this technology in an existing biomedical image search engine, and outline how it enables new forms of literature queries over biomedical relationships that are represented in these charts.

Phase diagrams of the elements

International Nuclear Information System (INIS)

Young, D.A.

1975-01-01

A summary of the pressure-temperature phase diagrams of the elements is presented, with graphs of the experimentally determined solid-solid phase boundaries and melting curves. Comments, including theoretical discussion, are provided for each diagram. The crystal structure of each solid phase is identified and discussed. This work is aimed at encouraging further experimental and theoretical research on phase transitions in the elements

APPLICATION OF U-CHART AND C-CHART IN TECHNOLOGICAL PROCESS OF PRIMARY WOOD PROCESSING

Directory of Open Access Journals (Sweden)

Damjan Stanojević

2014-01-01

Full Text Available Control charts are statistical methods of quality control. Basically it is a graph where the abscissa represents the order of control, and the ordinate is marked with parameter values, which are controled by samples over a certain size. Using charts determine varying quality and also related the stability and capacity of the production process in relation to the established control limits. Dr. Schuchardt, which can be regarded as the creator of control charts, says that their mission: to maintain the production process in a state of control, to lead the production process into a state of control, to show that the state of control has been achieved. According to Dr. Schuchardt „for a phenomenon is said to be controlled if based on current data we can predict, at least within certain limits, how the phenomenon will change in the future. Here, under certain prediction within limits means that we can determine, at least approximately, the probability that the phenomenon is found within the given limits“. Control charts for attribute quality characteristics are: p- control chart, m- control chart, u- control chart, c- control chart.

Visualizing a Procedure with Nassi-Schneiderman Charts.

Science.gov (United States)

Weiss, Edmond H.

1990-01-01

Argues that Nassi-Schneiderman (NS) charts, when used to diagram human procedures, can eliminate prose ambiguities. Asserts that these devices provide most of the advantages of decision tables and trees. Suggests using NS charts in testing the logic and completeness of traditional procedures, or even in place of many traditional publications. (SG)

Preparation of exposures charts for X-ray tubes

International Nuclear Information System (INIS)

Zoofan, B.

1988-01-01

An exposure chart is a fundamental graph which provides guidance of the exposure conditions in relation to the thickness for a given specimen. It must be prepared specially for the X-ray unit and the type of the film to be used. Although exposure charts are available for each particular X-ray tube from its manufacturer, individual radiographic laboratory should be able to prepare its own exposure charts in a precise manner. Here a typical procedure to prepare such a chart is provided in a practical way with some necessary recommendations

Impulse-Momentum Diagrams

Science.gov (United States)

Rosengrant, David

2011-01-01

Multiple representations are a valuable tool to help students learn and understand physics concepts. Furthermore, representations help students learn how to think and act like real scientists. These representations include: pictures, free-body diagrams, energy bar charts, electrical circuits, and, more recently, computer simulations and…

Application Of Empirical Phase Diagrams For Multidimensional Data Visualization Of High Throughput Microbatch Crystallization Experiments.

Science.gov (United States)

Klijn, Marieke E; Hubbuch, Jürgen

2018-04-27

Protein phase diagrams are a tool to investigate cause and consequence of solution conditions on protein phase behavior. The effects are scored according to aggregation morphologies such as crystals or amorphous precipitates. Solution conditions affect morphological features, such as crystal size, as well as kinetic features, such as crystal growth time. Common used data visualization techniques include individual line graphs or symbols-based phase diagrams. These techniques have limitations in terms of handling large datasets, comprehensiveness or completeness. To eliminate these limitations, morphological and kinetic features obtained from crystallization images generated with high throughput microbatch experiments have been visualized with radar charts in combination with the empirical phase diagram (EPD) method. Morphological features (crystal size, shape, and number, as well as precipitate size) and kinetic features (crystal and precipitate onset and growth time) are extracted for 768 solutions with varying chicken egg white lysozyme concentration, salt type, ionic strength and pH. Image-based aggregation morphology and kinetic features were compiled into a single and easily interpretable figure, thereby showing that the EPD method can support high throughput crystallization experiments in its data amount as well as its data complexity. Copyright © 2018. Published by Elsevier Inc.

The geometry of on-shell diagrams

Science.gov (United States)

Franco, Sebastián; Galloni, Daniele; Mariotti, Alberto

2014-08-01

The fundamental role of on-shell diagrams in quantum field theory has been recently recognized. On-shell diagrams, or equivalently bipartite graphs, provide a natural bridge connecting gauge theory to powerful mathematical structures such as the Grassmannian. We perform a detailed investigation of the combinatorial and geometric objects associated to these graphs. We mainly focus on their relation to polytopes and toric geometry, the Grassmannian and its stratification. Our work extends the current understanding of these connections along several important fronts, most notably eliminating restrictions imposed by planarity, positivity, reducibility and edge removability. We illustrate our ideas with several explicit examples and introduce concrete methods that considerably simplify computations. We consider it highly likely that the structures unveiled in this article will arise in the on-shell study of scattering amplitudes beyond the planar limit. Our results can be conversely regarded as an expansion in the understanding of the Grassmannian in terms of bipartite graphs.

The use of control charts by laypeople and hospital decision-makers for guiding decision making.

Science.gov (United States)

Schmidtke, K A; Watson, D G; Vlaev, I

2017-07-01

Graphs presenting healthcare data are increasingly available to support laypeople and hospital staff's decision making. When making these decisions, hospital staff should consider the role of chance-that is, random variation. Given random variation, decision-makers must distinguish signals (sometimes called special-cause data) from noise (common-cause data). Unfortunately, many graphs do not facilitate the statistical reasoning necessary to make such distinctions. Control charts are a less commonly used type of graph that support statistical thinking by including reference lines that separate data more likely to be signals from those more likely to be noise. The current work demonstrates for whom (laypeople and hospital staff) and when (treatment and investigative decisions) control charts strengthen data-driven decision making. We present two experiments that compare people's use of control and non-control charts to make decisions between hospitals (funnel charts vs. league tables) and to monitor changes across time (run charts with control lines vs. run charts without control lines). As expected, participants more accurately identified the outlying data using a control chart than using a non-control chart, but their ability to then apply that information to more complicated questions (e.g., where should I go for treatment?, and should I investigate?) was limited. The discussion highlights some common concerns about using control charts in hospital settings.

Triangular Diagrams Teach Steady and Dynamic Behaviour of Catalytic Reactions.

Science.gov (United States)

Klusacek, K.; And Others

1989-01-01

Illustrates how triangular diagrams can aid in presenting some of the rather complex transient interactions that occur among gas and surface species during heterogeneous catalytic reactions. The basic equations and numerical examples are described. Classroom use of the triangular diagram is discussed. Several diagrams and graphs are provided. (YP)

Growth charts of human development.

Science.gov (United States)

van Buuren, Stef

2014-08-01

This article reviews and compares two types of growth charts for tracking human development over age. Both charts assume the existence of a continuous latent variable, but relate to the observed data in different ways. The D-score diagram summarizes developmental indicators into a single aggregate score measuring global development. The relations between the indicators should be consistent with the Rasch model. If true, the D-score is a measure with interval scale properties, and allows for the calculation of meaningful differences both within and across age. The stage line diagram describes the natural development of ordinal indicators. The method models the transition probabilities between successive stages of the indicator as smoothly varying functions of age. The location of each stage is quantified by the mid-P-value. Both types of diagrams assist in identifying early and delayed development, as well as finding differences in tempo. The relevant techniques are illustrated to track global development during infancy and early childhood (0-2 years) and Tanner pubertal stages (8-21 years). New reference values for both applications are provided. © The Author(s) 2013 Reprints and permissions: sagepub.co.uk/journalsPermissions.nav.

Automated Methodologies for the Design of Flow Diagrams for Development and Maintenance Activities

Science.gov (United States)

Shivanand M., Handigund; Shweta, Bhat

The Software Requirements Specification (SRS) of the organization is a text document prepared by strategic management incorporating the requirements of the organization. These requirements of ongoing business/ project development process involve the software tools, the hardware devices, the manual procedures, the application programs and the communication commands. These components are appropriately ordered for achieving the mission of the concerned process both in the project development and the ongoing business processes, in different flow diagrams viz. activity chart, workflow diagram, activity diagram, component diagram and deployment diagram. This paper proposes two generic, automatic methodologies for the design of various flow diagrams of (i) project development activities, (ii) ongoing business process. The methodologies also resolve the ensuing deadlocks in the flow diagrams and determine the critical paths for the activity chart. Though both methodologies are independent, each complements other in authenticating its correctness and completeness.

A cognitive architecture-based model of graph comprehension

OpenAIRE

Peebles, David

2012-01-01

I present a model of expert comprehension performance for 2 × 2 "interaction" graphs typically used to present data from two-way factorial research designs. Developed using the ACT-R cognitive architecture, the model simulates the cognitive and perceptual operations involved in interpreting interaction graphs and provides a detailed characterisation of the information extracted from the diagram, the prior knowledge required to interpret interaction graphs, and the knowledge generated during t...

Interactive SIGHT: textual access to simple bar charts

Science.gov (United States)

Demir, Seniz; Oliver, David; Schwartz, Edward; Elzer, Stephanie; Carberry, Sandra; Mccoy, Kathleen F.; Chester, Daniel

2010-12-01

Information graphics, such as bar charts and line graphs, are an important component of many articles from popular media. The majority of such graphics have an intention (a high-level message) to communicate to the graph viewer. Since the intended message of a graphic is often not repeated in the accompanying text, graphics together with the textual segments contribute to the overall purpose of an article and cannot be ignored. Unfortunately, these visual displays are provided in a format which is not readily accessible to everyone. For example, individuals with sight impairments who use screen readers to listen to documents have limited access to the graphics. This article presents a new accessibility tool, the Interactive SIGHT (Summarizing Information GrapHics Textually) system, that is intended to enable visually impaired users to access the knowledge that one would gain from viewing information graphics found on the web. The current system, which is implemented as a browser extension that works on simple bar charts, can be invoked by a user via a keystroke combination while navigating the web. Once launched, Interactive SIGHT first provides a brief summary that conveys the underlying intention of a bar chart along with the chart's most significant and salient features, and then produces history-aware follow-up responses to provide further information about the chart upon request from the user. We present two user studies that were conducted with sighted and visually impaired users to determine how effective the initial summary and follow-up responses are in conveying the informational content of bar charts, and to evaluate how easy it is to use the system interface. The evaluation results are promising and indicate that the system responses are well-structured and enable visually impaired users to answer key questions about bar charts in an easy-to-use manner. Post-experimental interviews revealed that visually impaired participants were very satisfied with

A spectral chart of synchrotron orbital radiation

International Nuclear Information System (INIS)

Hiramatsu, Nobuyasu; Yoneda, Yasuharu

1977-01-01

This paper introduces a chart of the spectrum of synchrotron orbital radiation. The radiation from high energy electrons has been used for various purposes. The formulas to express the spectrum have been presented. The parameters which determine the spectrum are the acceleration energy E, the deflection radius R, the wavelength of photons, the photon energy, and the harmonics. The chart in this paper determines the field intensity H to be applied on an accelerator when E and R are freely selected, and either the wavelength or the harmonics is obtained from the other one. Then, the spectrum distribution can be obtained. A.A. Sokolov and I.M. Ternov modified the formula for the emitted energy from an electron which had been given by G.A. Schott. The modified formula is used to obtain the number of photons per 1 eV. The relation between R and the harmonics is expressed by parallel lines in a log-log graph. The relation among R, H and E is also expressed in the same graph by parallel lines. The spectroscopic intensity is also shown in the same graph by a curved line. (Kato, T.)

Counting loop diagrams: computational complexity of higher-order amplitude evaluation

International Nuclear Information System (INIS)

Eijk, E. van; Kleiss, R.; Lazopoulos, A.

2004-01-01

We discuss the computational complexity of the perturbative evaluation of scattering amplitudes, both by the Caravaglios-Moretti algorithm and by direct evaluation of the individual diagrams. For a self-interacting scalar theory, we determine the complexity as a function of the number of external legs. We describe a method for obtaining the number of topologically inequivalent Feynman graphs containing closed loops, and apply this to 1- and 2-loop amplitudes. We also compute the number of graphs weighted by their symmetry factors, thus arriving at exact and asymptotic estimates for the average symmetry factor of diagrams. We present results for the asymptotic number of diagrams up to 10 loops, and prove that the average symmetry factor approaches unity as the number of external legs becomes large. (orig.)

Diagrams of natural deductions

Energy Technology Data Exchange (ETDEWEB)

Popov, S V

1982-01-01

The concept of natural deductions was investigated by the author in his analysis of the complexity of deductions in propositional computations (1975). Here some natural deduction systems are considered, and an analytical procedure proposed which results in a deduction diagram for each system. Each diagram takes the form of an orientated, charge graph, features of which can be used to establish the equivalence of classes of deductions. For each of the natural deduction systems considered, a system of equivalent transformation schemes is derived, which is complete with respect to the given definition of equivalence. 2 references.

Algorithmic approach to diagram techniques

International Nuclear Information System (INIS)

Ponticopoulos, L.

1980-10-01

An algorithmic approach to diagram techniques of elementary particles is proposed. The definition and axiomatics of the theory of algorithms are presented, followed by the list of instructions of an algorithm formalizing the construction of graphs and the assignment of mathematical objects to them. (T.A.)

A Cause-Consequence Chart of a Redundant Protection System

DEFF Research Database (Denmark)

Nielsen, Dan Sandvik; Platz, O.; Runge, B.

1975-01-01

A cause-consequence chart is applied in analysing failures of a redundant protection system (a core spray system in a nuclear power plant). It is shown how the diagram provides a basis for calculating two probability measures for malfunctioning of the protection system. The test policy of compone...... of components is taken into account. The possibility of using parameter variation as a basis for the choice of test policy is indicated.......A cause-consequence chart is applied in analysing failures of a redundant protection system (a core spray system in a nuclear power plant). It is shown how the diagram provides a basis for calculating two probability measures for malfunctioning of the protection system. The test policy...

Electronic growth charts: watching our patients grow.

Science.gov (United States)

Murphy, Cynthia A; Carstens, Kimberly; Villamayor, Precy

2005-01-01

Pediatric Growth Charts have been used in the pediatric community since 1977. The first growth charts were developed by the National Center for Health Statistics as a clinical tool for health care professionals. The growth charts, revised in 2000, by the Center for Disease Control consists of a series of percentile curves for selected body measurements in children [1]. Capitalizing on the benefits of our Electronic Medical Record (EMR), and as a byproduct of nursing electronic documentation of routine heights, weights, and frontal occipital circumferences, our system plots the routine measurements without additional intervention by the staff. Clinicians can view the graphs online or generate printed reports as needed during routine examination for outpatient or hospitalized care. This abstract outlines the background, design process, programming rules utilized to plot growth curves, and the evaluation of the electronic CDC growth charts in our organization.

Run charts revisited: a simulation study of run chart rules for detection of non-random variation in health care processes.

Science.gov (United States)

Anhøj, Jacob; Olesen, Anne Vingaard

2014-01-01

A run chart is a line graph of a measure plotted over time with the median as a horizontal line. The main purpose of the run chart is to identify process improvement or degradation, which may be detected by statistical tests for non-random patterns in the data sequence. We studied the sensitivity to shifts and linear drifts in simulated processes using the shift, crossings and trend rules for detecting non-random variation in run charts. The shift and crossings rules are effective in detecting shifts and drifts in process centre over time while keeping the false signal rate constant around 5% and independent of the number of data points in the chart. The trend rule is virtually useless for detection of linear drift over time, the purpose it was intended for.

Some remarks on non-planar Feynman diagrams

International Nuclear Information System (INIS)

Bielas, Krzysztof; Dubovyk, Ievgen; Gluza, Janusz

2013-12-01

Two criteria for planarity of a Feynman diagram upon its propagators (momentum ows) are presented. Instructive Mathematica programs that solve the problem and examples are provided. A simple geometric argument is used to show that while one can planarize non-planar graphs by embedding them on higher-genus surfaces (in the example it is a torus), there is still a problem with defining appropriate dual variables since the corresponding faces of the graph are absorbed by torus generators.

Some remarks on non-planar Feynman diagrams

Energy Technology Data Exchange (ETDEWEB)

Bielas, Krzysztof; Dubovyk, Ievgen; Gluza, Janusz [Silesia Univ., Katowice (Poland). Inst. of Physics; Riemann, Tord [Deutsches Elektronen-Synchrotron (DESY), Zeuthen (Germany)

2013-12-15

Two criteria for planarity of a Feynman diagram upon its propagators (momentum ows) are presented. Instructive Mathematica programs that solve the problem and examples are provided. A simple geometric argument is used to show that while one can planarize non-planar graphs by embedding them on higher-genus surfaces (in the example it is a torus), there is still a problem with defining appropriate dual variables since the corresponding faces of the graph are absorbed by torus generators.

A New Graph Drawing Scheme for Social Network

Directory of Open Access Journals (Sweden)

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.

A Critique of the Theoretical and Empirical Literature of the Use of Diagrams, Graphs, and Other Visual Aids in the Learning of Scientific-Technical Content from Expository Texts and Instruction

Science.gov (United States)

Carifio, James; Perla, Rocco J.

2009-01-01

This article presents a critical review and analysis of key studies that have been done in science education and other areas on the effects and effectiveness of using diagrams, graphs, photographs, illustrations, and concept maps as "adjunct visual aids" in the learning of scientific-technical content. It also summarizes and reviews those studies…

Visualizing Library Statistics using Open Flash Chart 2 and Drupal

Directory of Open Access Journals (Sweden)

Laura K. Wiegand

2013-01-01

Full Text Available Libraries continue to need to demonstrate their value to stakeholders, and while statistics alone do not represent value, they are an important element. We found ourselves, and our stakeholders, uninspired by our infrequently updated bulleted list of statistics on our website and so set out to create a more dynamic and visually appealing look at our statistics. This article outlines how we used our content management system, Drupal, Open Flash Chart and custom programming to convert library statistics into Flash charts, including how to populate the graphs with dynamic data from external sources. The end result is our Library Statistics Dashboard (http://library.uncw.edu/facts_planning/dashboard that visually demonstrates the use, activity and resources in the library via interactive and visually interesting graphs.

Transmission Line Adapted Analytical Power Charts Solution

Science.gov (United States)

Sakala, Japhet D.; Daka, James S. J.; Setlhaolo, Ditiro; Malichi, Alec Pulu

2017-08-01

The performance of a transmission line has been assessed over the years using power charts. These are graphical representations, drawn to scale, of the equations that describe the performance of transmission lines. Various quantities that describe the performance, such as sending end voltage, sending end power and compensation to give zero voltage regulation, may be deduced from the power charts. Usually required values are read off and then converted using the appropriate scales and known relationships. In this paper, the authors revisit this area of circle diagrams for transmission line performance. The work presented here formulates the mathematical model that analyses the transmission line performance from the power charts relationships and then uses them to calculate the transmission line performance. In this proposed approach, it is not necessary to draw the power charts for the solution. However the power charts may be drawn for the visual presentation. The method is based on applying derived equations and is simple to use since it does not require rigorous derivations.

Finding and Accessing Diagrams in Biomedical Publications

OpenAIRE

Kuhn, Tobias; Luong, ThaiBinh; Krauthammer, Michael

2012-01-01

Complex relationships in biomedical publications are often communicated by diagrams such as bar and line charts, which are a very effective way of summarizing and communicating multi-faceted data sets. Given the ever-increasing amount of published data, we argue that the precise retrieval of such diagrams is of great value for answering specific and otherwise hard-to-meet information needs. To this end, we demonstrate the use of advanced image processing and classification for identifying bar...

Accessing Data Bases Through Interface Views Using a Unified Graph-Oriented Entity-Relationship Model

DEFF Research Database (Denmark)

Kraft, Peter; Sørensen, Jens Otto

Interface Abstract: The paper describes an Entity Relationship (ER) model with a diagrammed schema and extensions modeled into a graph. The semantics of schema symbols are fundamentally simple implying a unified model where given conceptualizations of environments are diagrammed uniquely. By the ......Interface Abstract: The paper describes an Entity Relationship (ER) model with a diagrammed schema and extensions modeled into a graph. The semantics of schema symbols are fundamentally simple implying a unified model where given conceptualizations of environments are diagrammed uniquely...... with a unified graphic model is more efficient and less error-prone than working with more complex ER models and models based on lexical description. Key terms: Entity-relationship model, path expressions, entity-relationship language, derived interface view, view updates, graphical models....

System dynamics and control with bond graph modeling

CERN Document Server

Kypuros, Javier

2013-01-01

Part I Dynamic System ModelingIntroduction to System DynamicsIntroductionSystem Decomposition and Model ComplexityMathematical Modeling of Dynamic SystemsAnalysis and Design of Dynamic SystemsControl of Dynamic SystemsDiagrams of Dynamic SystemsA Graph-Centered Approach to ModelingSummaryPracticeExercisesBasic Bond Graph ElementsIntroductionPower and Energy VariablesBasic 1-Port ElementsBasic 2-Ports ElementsJunction ElementsSimple Bond Graph ExamplesSummaryPracticeExercisesBond Graph Synthesis and Equation DerivationIntroductionGeneral GuidelinesMechanical TranslationMechanical RotationElectrical CircuitsHydraulic CircuitsMixed SystemsState Equation DerivationState-Space RepresentationsAlgebraic Loops and Derivative CausalitySummaryPracticeExercisesImpedance Bond GraphsIntroductionLaplace Transform of the State-Space EquationBasic 1-Port ImpedancesImpedance Bond Graph SynthesisJunctions, Transformers, and GyratorsEffort and Flow DividersSign ChangesTransfer Function DerivationAlternative Derivation of Transf...

A Three-dimensional Topological Model of Ternary Phase Diagram

International Nuclear Information System (INIS)

Mu, Yingxue; Bao, Hong

2017-01-01

In order to obtain a visualization of the complex internal structure of ternary phase diagram, the paper realized a three-dimensional topology model of ternary phase diagram with the designed data structure and improved algorithm, under the guidance of relevant theories of computer graphics. The purpose of the model is mainly to analyze the relationship between each phase region of a ternary phase diagram. The model not only obtain isothermal section graph at any temperature, but also extract a particular phase region in which users are interested. (paper)

Probabilistic Graph Layout for Uncertain Network Visualization.

Science.gov (United States)

Schulz, Christoph; Nocaj, Arlind; Goertler, Jochen; Deussen, Oliver; Brandes, Ulrik; Weiskopf, Daniel

2017-01-01

We present a novel uncertain network visualization technique based on node-link diagrams. Nodes expand spatially in our probabilistic graph layout, depending on the underlying probability distributions of edges. The visualization is created by computing a two-dimensional graph embedding that combines samples from the probabilistic graph. A Monte Carlo process is used to decompose a probabilistic graph into its possible instances and to continue with our graph layout technique. Splatting and edge bundling are used to visualize point clouds and network topology. The results provide insights into probability distributions for the entire network-not only for individual nodes and edges. We validate our approach using three data sets that represent a wide range of network types: synthetic data, protein-protein interactions from the STRING database, and travel times extracted from Google Maps. Our approach reveals general limitations of the force-directed layout and allows the user to recognize that some nodes of the graph are at a specific position just by chance.

Graphic Organizers: Outlets for Your Thoughts.

Science.gov (United States)

Ekhaml, Leticia

1998-01-01

Graphs, bars, charts, and diagrams have been used by designers, writers, and scientists to communicate. Now, research suggests that graphic organizers benefit teaching and learning. This article describes graphic organizers: sequential, conceptual, hierarchical, cyclical, Venn, fishbone or Ishikawa, squeeze and stretch, why-why, t-chart, KWL…

Using a Density-Management Diagram to Develop Thinning Schedules for Loblolly Pine Plantations

Science.gov (United States)

Thomas J. Dean; V. Clark Baldwin

1993-01-01

A method for developing thinning schedules using a density-management diagram is presented. A density-management diagram is a form of stocking chart based on patterns of natural stand development. The diagram allows rotation diameter and the upper and lower limits of growing stock to be easily transformed into before and after thinning densities. Site height lines on...

What Do You See?

Science.gov (United States)

Coleman, Julianne Maner; Goldston, M. Jenice

2011-01-01

When students draw observations or interpret and draw a diagram, they're communicating their understandings of science and demonstrating visual literacy abilities. Visual literacy includes skills needed to accurately interpret and produce visual and graphical information such as drawings, diagrams, tables, charts, maps, and graphs. Communication…

Application of Bond Graph Modeling for Photovoltaic Module Simulation

Directory of Open Access Journals (Sweden)

Madi S.

2016-01-01

Full Text Available In this paper, photovoltaic generator is represented using the bond-graph methodology. Starting from the equivalent circuit the bond graph and the block diagram of the photovoltaic generator have been derived. Upon applying bond graph elements and rules a mathematical model of the photovoltaic generator is obtained. Simulation results of this obtained model using real recorded data (irradiation and temperature at the Renewable Energies Development Centre in Bouzaréah – Algeria are obtained using MATLAB/SMULINK software. The results have compared with datasheet of the photovoltaic generator for validation purposes.

How to generate and interpret fire characteristics charts for surface and crown fire behavior

Science.gov (United States)

Patricia L. Andrews; Faith Ann Heinsch; Luke Schelvan

2011-01-01

A fire characteristics chart is a graph that presents primary related fire behavior characteristics-rate of spread, flame length, fireline intensity, and heat per unit area. It helps communicate and interpret modeled or observed fire behavior. The Fire Characteristics Chart computer program plots either observed fire behavior or values that have been calculated by...

10 CFR 2.1003 - Availability of material.

Science.gov (United States)

2010-01-01

..., computer programs and codes, field notes, laboratory notes, maps, diagrams and photographs, which have been...; (xiv) Graphs, plots, strip charts, sketches; (xv) Descriptive material related to the information...

ROLE OF UML SEQUENCE DIAGRAM CONSTRUCTS IN OBJECT LIFECYCLE CONCEPT

Directory of Open Access Journals (Sweden)

Miroslav Grgec

2007-06-01

Full Text Available When modeling systems and using UML concepts, a real system can be viewed in several ways. The RUP (Rational Unified Process defines the "4 + 1 view": 1. Logical view (class diagram (CD, object diagram (OD, sequence diagram (SD, collaboration diagram (COD, state chart diagram (SCD, activity diagram (AD, 2.Process view (use case diagram, CD, OD, SD, COD, SCD, AD, 3. Development view (package diagram, component diagram, 4. Physical view (deployment diagram, and 5. Use case view (use case diagram, OD, SD, COD, SCD, AD which combines the four mentioned above. With sequence diagram constructs we are describing object behavior in scope of one use case and their interaction. Each object in system goes through a so called lifecycle (create, supplement object with data, use object, decommission object. The concept of the object lifecycle is used to understand and formalize the behavior of objects from creation to deletion. With help of sequence diagram concepts our paper will describe the way of interaction modeling between objects through lifeline of each of them, and their importance in software development.

Flaw evaluation charts

International Nuclear Information System (INIS)

Korosec, D.; Vojvodic Tuma, J.

1999-01-01

The structural integrity of the primary components in pressurized water reactor nuclear power plant is very important in the respect of safe and efficient operation. These components have to be subjected to periodic controls. In the light of fracture mechanics concept, the acceptance criteria for defects (flaws) are developed. Flaw evaluation procedure is necessary, to evaluate the defects regarding their acceptability for further operation. The objective of the flaw evaluation charts is to provide a series of simple graphs as decision maps. that immediate decision may be taken regarding the acceptability of a detected defects, on the basis of ASME Code XI criteria.(author)

The application of coloured Petri nets to verification of distributed systems specified by message Sequence Charts

OpenAIRE

CHERNENOK S.A.; NEPOMNIASCHY V.A.

2015-01-01

The language of message sequence charts (MSC) is a popular scenario-based specification language used to describe the interaction of components in distributed systems. However, the methods for validation of MSC diagrams are underdeveloped. This paper describes a method for translation of MSC diagrams into coloured Petri nets (CPN). The method is applied to the property verification of these diagrams. The considered set of diagram elements is extended by the elements of UML sequence diagrams a...

Graphs as a Managerial Tool: A Case Study of Du Pont's Use of Graphs in the Early Twentieth Century.

Science.gov (United States)

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)

Exact computation of the Voronoi Diagram of spheres in 3D, its topology and its geometric invariants

DEFF Research Database (Denmark)

Anton, François; Mioc, Darka; Santos, Marcelo

2011-01-01

In this paper, we are addressing the exact computation of the Delaunay graph (or quasi-triangulation) and the Voronoi diagram of spheres using Wu’s algorithm. Our main contribution is first a methodology for automated derivation of invariants of the Delaunay empty circumcircle predicate for spheres...... and the Voronoi vertex of four spheres, then the application of this methodology to get all geometrical invariants that intervene in this problem and the exact computation of the Delaunay graph and the Voronoi diagram of spheres. To the best of our knowledge, there does not exist a comprehensive treatment...... of the exact computation with geometrical invariants of the Delaunay graph and the Voronoi diagram of spheres. Starting from the system of equations defining the zero-dimensional algebraic set of the problem, we are following Wu’s algorithm to transform the initial system into an equivalent Wu characteristic...

Strategy and pattern recognition in expert\\ud comprehension of 2 × 2 interaction graphs

OpenAIRE

Peebles, David

2013-01-01

I present a model of expert comprehension performance for 2 × 2 "interaction" graphs typically used to present data from two-way factorial research designs. Developed using the ACT-R cognitive architecture, the model simulates the cognitive and perceptual operations involved in interpreting interaction graphs and provides a detailed characterisation of the information\\ud extracted from the diagram, the prior knowledge required to interpret interaction graphs, and the knowledge generated durin...

Analytic properties of Feynman diagrams in quantum field theory

CERN Document Server

Todorov, I T

1971-01-01

Analytic Properties of Feynman Diagrams in Quantum Field Theory deals with quantum field theory, particularly in the study of the analytic properties of Feynman graphs. This book is an elementary presentation of a self-contained exposition of the majorization method used in the study of these graphs. The author has taken the intermediate position between Eden et al. who assumes the physics of the analytic properties of the S-matrix, containing physical ideas and test results without using the proper mathematical methods, and Hwa and Teplitz, whose works are more mathematically inclined with a

16 CFR Appendix I to Part 1025 - Suggested Form of Final Prehearing Order

Science.gov (United States)

2010-01-01

... of any objections thereto; (g) A list and brief description of any charts, graphs, models, schematic diagrams, and similar objects that will be used in opening statements or closing arguments but will not be...

Worldline Green functions for multiloop diagrams

International Nuclear Information System (INIS)

Schmidt, M.G.; Heidelberg Univ.; Schubert, C.

1994-03-01

We propose a multiloop generalization of the Bern-Kosower formalism, based on Strassler's approach of evaluating worldline path integrals by worldline Green functions. Those Green functions are explicitly constructed for the basic two-loop graph, and for a loop with an arbitrary number of propagator insertions. For scalar and abelian gauge theories, the resulting integral representations allow to combine whole classes of Feynman diagrams into compact expressions. (orig.)

Visualizing Dataflow Graphs of Deep Learning Models in TensorFlow.

Science.gov (United States)

Wongsuphasawat, Kanit; Smilkov, Daniel; Wexler, James; Wilson, Jimbo; Mane, Dandelion; Fritz, Doug; Krishnan, Dilip; Viegas, Fernanda B; Wattenberg, Martin

2018-01-01

We present a design study of the TensorFlow Graph Visualizer, part of the TensorFlow machine intelligence platform. This tool helps users understand complex machine learning architectures by visualizing their underlying dataflow graphs. The tool works by applying a series of graph transformations that enable standard layout techniques to produce a legible interactive diagram. To declutter the graph, we decouple non-critical nodes from the layout. To provide an overview, we build a clustered graph using the hierarchical structure annotated in the source code. To support exploration of nested structure on demand, we perform edge bundling to enable stable and responsive cluster expansion. Finally, we detect and highlight repeated structures to emphasize a model's modular composition. To demonstrate the utility of the visualizer, we describe example usage scenarios and report user feedback. Overall, users find the visualizer useful for understanding, debugging, and sharing the structures of their models.

Control Chart on Semi Analytical Weighting

Science.gov (United States)

Miranda, G. S.; Oliveira, C. C.; Silva, T. B. S. C.; Stellato, T. B.; Monteiro, L. R.; Marques, J. R.; Faustino, M. G.; Soares, S. M. V.; Ulrich, J. C.; Pires, M. A. F.; Cotrim, M. E. B.

2018-03-01

Semi-analytical balance verification intends to assess the balance performance using graphs that illustrate measurement dispersion, trough time, and to demonstrate measurements were performed in a reliable manner. This study presents internal quality control of a semi-analytical balance (GEHAKA BG400) using control charts. From 2013 to 2016, 2 weight standards were monitored before any balance operation. This work intended to evaluate if any significant difference or bias were presented on weighting procedure over time, to check the generated data reliability. This work also exemplifies how control intervals are established.

Extended sequence diagram for human system interaction

International Nuclear Information System (INIS)

Hwang, Jong Rok; Choi, Sun Woo; Ko, Hee Ran; Kim, Jong Hyun

2012-01-01

Unified Modeling Language (UML) is a modeling language in the field of object oriented software engineering. The sequence diagram is a kind of interaction diagram that shows how processes operate with one another and in what order. It is a construct of a message sequence chart. It depicts the objects and classes involved in the scenario and the sequence of messages exchanged between the objects needed to carry out the functionality of the scenario. This paper proposes the Extended Sequence Diagram (ESD), which is capable of depicting human system interaction for nuclear power plants, as well as cognitive process of operators analysis. In the conventional sequence diagram, there is a limit to only identify the activities of human and systems interactions. The ESD is extended to describe operators' cognitive process in more detail. The ESD is expected to be used as a task analysis method for describing human system interaction. The ESD can also present key steps causing abnormal operations or failures and diverse human errors based on cognitive condition

First corrections to hyperfine splitting and the Lamb shift induced by diagrams with two external photons and second-order radiative insertions in the electron line

International Nuclear Information System (INIS)

Eides, M.I.; Karshenboim, S.G.; Shelyuto, V.A.

1994-01-01

Contributions to hyperfine splitting (HFS) and to the Lamb shift on the order of α 2 (Zα) 5 induced by graphs with two radiative photons inserted into the electron line are considered. It is shown that this gauge-invariant set of diagrams, which give corrections of the considered order, consists of nineteen topologically different diagrams. Contributions to both HFS and the Lamb shift induced by graphs containing the one-loop electron self-energy as a subgraph and by the graph containing two one-loop vertices are obtained. 15 refs., 3 figs

NuChart: an R package to study gene spatial neighbourhoods with multi-omics annotations.

Directory of Open Access Journals (Sweden)

Ivan Merelli

Full Text Available Long-range chromosomal associations between genomic regions, and their repositioning in the 3D space of the nucleus, are now considered to be key contributors to the regulation of gene expression and important links have been highlighted with other genomic features involved in DNA rearrangements. Recent Chromosome Conformation Capture (3C measurements performed with high throughput sequencing (Hi-C and molecular dynamics studies show that there is a large correlation between colocalization and coregulation of genes, but these important researches are hampered by the lack of biologists-friendly analysis and visualisation software. Here, we describe NuChart, an R package that allows the user to annotate and statistically analyse a list of input genes with information relying on Hi-C data, integrating knowledge about genomic features that are involved in the chromosome spatial organization. NuChart works directly with sequenced reads to identify the related Hi-C fragments, with the aim of creating gene-centric neighbourhood graphs on which multi-omics features can be mapped. Predictions about CTCF binding sites, isochores and cryptic Recombination Signal Sequences are provided directly with the package for mapping, although other annotation data in bed format can be used (such as methylation profiles and histone patterns. Gene expression data can be automatically retrieved and processed from the Gene Expression Omnibus and ArrayExpress repositories to highlight the expression profile of genes in the identified neighbourhood. Moreover, statistical inferences about the graph structure and correlations between its topology and multi-omics features can be performed using Exponential-family Random Graph Models. The Hi-C fragment visualisation provided by NuChart allows the comparisons of cells in different conditions, thus providing the possibility of novel biomarkers identification. NuChart is compliant with the Bioconductor standard and it is freely

Information network architectures

Science.gov (United States)

Murray, N. D.

1985-01-01

Graphs, charts, diagrams and outlines of information relative to information network architectures for advanced aerospace missions, such as the Space Station, are presented. Local area information networks are considered a likely technology solution. The principle needs for the network are listed.

Interactive Land-Use Optimization Using Laguerre Voronoi Diagram with Dynamic Generating Point Allocation

Science.gov (United States)

Chaidee, S.; Pakawanwong, P.; Suppakitpaisarn, V.; Teerasawat, P.

2017-09-01

In this work, we devise an efficient method for the land-use optimization problem based on Laguerre Voronoi diagram. Previous Voronoi diagram-based methods are more efficient and more suitable for interactive design than discrete optimization-based method, but, in many cases, their outputs do not satisfy area constraints. To cope with the problem, we propose a force-directed graph drawing algorithm, which automatically allocates generating points of Voronoi diagram to appropriate positions. Then, we construct a Laguerre Voronoi diagram based on these generating points, use linear programs to adjust each cell, and reconstruct the diagram based on the adjustment. We adopt the proposed method to the practical case study of Chiang Mai University's allocated land for a mixed-use complex. For this case study, compared to other Voronoi diagram-based method, we decrease the land allocation error by 62.557 %. Although our computation time is larger than the previous Voronoi-diagram-based method, it is still suitable for interactive design.

Dynamic airspace configuration method based on a weighted graph model

Directory of Open Access Journals (Sweden)

Chen Yangzhou

2014-08-01

Full Text Available This paper proposes a new method for dynamic airspace configuration based on a weighted graph model. The method begins with the construction of an undirected graph for the given airspace, where the vertices represent those key points such as airports, waypoints, and the edges represent those air routes. Those vertices are used as the sites of Voronoi diagram, which divides the airspace into units called as cells. Then, aircraft counts of both each cell and of each air-route are computed. Thus, by assigning both the vertices and the edges with those aircraft counts, a weighted graph model comes into being. Accordingly the airspace configuration problem is described as a weighted graph partitioning problem. Then, the problem is solved by a graph partitioning algorithm, which is a mixture of general weighted graph cuts algorithm, an optimal dynamic load balancing algorithm and a heuristic algorithm. After the cuts algorithm partitions the model into sub-graphs, the load balancing algorithm together with the heuristic algorithm transfers aircraft counts to balance workload among sub-graphs. Lastly, airspace configuration is completed by determining the sector boundaries. The simulation result shows that the designed sectors satisfy not only workload balancing condition, but also the constraints such as convexity, connectivity, as well as minimum distance constraint.

Dynamic MLD analysis with flow graphs

International Nuclear Information System (INIS)

Jenab, K.; Sarfaraz, A.; Dhillon, B.S.; Seyed Hosseini, S.M.

2012-01-01

Master Logic Diagram (MLD) depicts the interrelationships among the independent functions and dependent support functions. Using MLD, the manner in which all functions, sub-functions interact to achieve the overall system objective can be investigated. This paper reports a probabilistic model to analyze an MLD by translating the interrelationships to a graph model. The proposed model uses the flow-graph concept and Moment Generating Function (MGF) to analyze the dependency matrix representing the MLD with embedded self-healing function/sub-functions. The functions/sub-functions are featured by failure detection and recovery mechanisms. The newly developed model provides the probability of the system failure, and system mean and standard deviation time to failure in the MLD. An illustrative example is demonstrated to present the application of the model.

[Growth charts: Impact on the prevalence of nutritional disorders].

Science.gov (United States)

Polo Martín, P; Abellan, J J; Nájar Godoy, M I; Álvarez de Laviada Mulero, T

2015-05-01

The references used to assess child growth in Spain are the graphs of the Orbegozo Foundation and the charts of the World Health Organization (WHO). The objective of this study is to analyze the differences between the two charts for weight, height and body mass index, and assess their relevance to identify growth or nutritional problems. The values of the extreme percentiles of height, weight and body mass index for each sex from 0 to 10 years in both charts are compared. For each value Absolute differences and Z scores are calculated for each value. To evaluate the impact on the prevalence of the various nutritional or growth disorders the location of the value of the respective percentiles of in each of the charts were assessed. Significant differences were observed between the 3th percentile of height and weight, 97th of weight, and 85th and 97th of body mass index. Marked differences were observed for the extreme values of body mass index. During the first years, the Orbegozo charts overestimate the prevalence of malnutrition (between 2% and 19% depending on age and sex) compared to the WHO charts. In subsequent ages Orbegozo underestimates WHO between 0.7% and 2.89%. Orbegozo underestimates the prevalence of overweight (between 2.5% and 14.8%) compared to the WHO charts. The 97th percentile of Body mass index in the Orbegozo charts corresponds in most cases with WHO percentiles above 99.99%. The two charts analyzed have significant differences from a clinical and the public health point of view, in the estimation of overweight/obesity and malnutrition. Copyright © 2014 Asociación Española de Pediatría. Published by Elsevier España, S.L.U. All rights reserved.

Decision diagram for neutron and photon dose estimation and for classification of persons involved in radiation accident

International Nuclear Information System (INIS)

Anon.

1981-01-01

The relation is described between monitoring and health care measures taken during a radiation accident. The decision-making chart for the assessment of exposure and the classification of people involved are presented, the risks of the respective decision-making are discussed and the flow charts and explanations for the diagrams are given. (H.S.)

Chaotic Traversal (CHAT): Very Large Graphs Traversal Using Chaotic Dynamics

Science.gov (United States)

Changaival, Boonyarit; Rosalie, Martin; Danoy, Grégoire; Lavangnananda, Kittichai; Bouvry, Pascal

2017-12-01

Graph Traversal algorithms can find their applications in various fields such as routing problems, natural language processing or even database querying. The exploration can be considered as a first stepping stone into knowledge extraction from the graph which is now a popular topic. Classical solutions such as Breadth First Search (BFS) and Depth First Search (DFS) require huge amounts of memory for exploring very large graphs. In this research, we present a novel memoryless graph traversal algorithm, Chaotic Traversal (CHAT) which integrates chaotic dynamics to traverse large unknown graphs via the Lozi map and the Rössler system. To compare various dynamics effects on our algorithm, we present an original way to perform the exploration of a parameter space using a bifurcation diagram with respect to the topological structure of attractors. The resulting algorithm is an efficient and nonresource demanding algorithm, and is therefore very suitable for partial traversal of very large and/or unknown environment graphs. CHAT performance using Lozi map is proven superior than the, commonly known, Random Walk, in terms of number of nodes visited (coverage percentage) and computation time where the environment is unknown and memory usage is restricted.

Calculating massive 3-loop graphs for operator matrix elements by the method of hyperlogarithms

International Nuclear Information System (INIS)

Ablinger, Jakob; Schneider, Carsten; Bluemlein, Johannes; Raab, Clemens; Wissbrock, Fabian

2014-02-01

We calculate convergent 3-loop Feynman diagrams containing a single massive loop equipped with twist τ=2 local operator insertions corresponding to spin N. They contribute to the massive operator matrix elements in QCD describing the massive Wilson coefficients for deep-inelastic scattering at large virtualities. Diagrams of this kind can be computed using an extended version to the method of hyperlogarithms, originally being designed for massless Feynman diagrams without operators. The method is applied to Benz- and V-type graphs, belonging to the genuine 3-loop topologies. In case of the V-type graphs with five massive propagators new types of nested sums and iterated integrals emerge. The sums are given in terms of finite binomially and inverse binomially weighted generalized cyclotomic sums, while the 1-dimensionally iterated integrals are based on a set of ∝30 square-root valued letters. We also derive the asymptotic representations of the nested sums and present the solution for N element of C. Integrals with a power-like divergence in N-space∝a N , a element of R, a>1, for large values of N emerge. They still possess a representation in x-space, which is given in terms of root-valued iterated integrals in the present case. The method of hyperlogarithms is also used to calculate higher moments for crossed box graphs with different operator insertions.

Calculating massive 3-loop graphs for operator matrix elements by the method of hyperlogarithms

Energy Technology Data Exchange (ETDEWEB)

Ablinger, Jakob; Schneider, Carsten [Johannes Kepler Univ., Linz (Austria). Reserach Inst. for Symbolic Computation (RISC); Bluemlein, Johannes; Raab, Clemens [Deutsches Elektronen-Synchrotron (DESY), Zeuthen (Germany); Wissbrock, Fabian [Deutsches Elektronen-Synchrotron (DESY), Zeuthen (Germany); Johannes Kepler Univ., Linz (Austria). Reserach Inst. for Symbolic Computation (RISC)

2014-02-15

We calculate convergent 3-loop Feynman diagrams containing a single massive loop equipped with twist τ=2 local operator insertions corresponding to spin N. They contribute to the massive operator matrix elements in QCD describing the massive Wilson coefficients for deep-inelastic scattering at large virtualities. Diagrams of this kind can be computed using an extended version to the method of hyperlogarithms, originally being designed for massless Feynman diagrams without operators. The method is applied to Benz- and V-type graphs, belonging to the genuine 3-loop topologies. In case of the V-type graphs with five massive propagators new types of nested sums and iterated integrals emerge. The sums are given in terms of finite binomially and inverse binomially weighted generalized cyclotomic sums, while the 1-dimensionally iterated integrals are based on a set of ∝30 square-root valued letters. We also derive the asymptotic representations of the nested sums and present the solution for N element of C. Integrals with a power-like divergence in N-space∝a{sup N}, a element of R, a>1, for large values of N emerge. They still possess a representation in x-space, which is given in terms of root-valued iterated integrals in the present case. The method of hyperlogarithms is also used to calculate higher moments for crossed box graphs with different operator insertions.

Calculating massive 3-loop graphs for operator matrix elements by the method of hyperlogarithms

Energy Technology Data Exchange (ETDEWEB)

Ablinger, Jakob [Research Institute for Symbolic Computation (RISC), Johannes Kepler University, Altenbergerstraße 69, A-4040 Linz (Austria); Blümlein, Johannes; Raab, Clemens [Deutsches Elektronen-Synchrotron, DESY, Platanenallee 6, D-15738 Zeuthen (Germany); Schneider, Carsten [Research Institute for Symbolic Computation (RISC), Johannes Kepler University, Altenbergerstraße 69, A-4040 Linz (Austria); Wißbrock, Fabian [Research Institute for Symbolic Computation (RISC), Johannes Kepler University, Altenbergerstraße 69, A-4040 Linz (Austria); Deutsches Elektronen-Synchrotron, DESY, Platanenallee 6, D-15738 Zeuthen (Germany)

2014-08-15

We calculate convergent 3-loop Feynman diagrams containing a single massive loop equipped with twist τ=2 local operator insertions corresponding to spin N. They contribute to the massive operator matrix elements in QCD describing the massive Wilson coefficients for deep-inelastic scattering at large virtualities. Diagrams of this kind can be computed using an extended version of the method of hyperlogarithms, originally being designed for massless Feynman diagrams without operators. The method is applied to Benz- and V-type graphs, belonging to the genuine 3-loop topologies. In case of the V-type graphs with five massive propagators, new types of nested sums and iterated integrals emerge. The sums are given in terms of finite binomially and inverse binomially weighted generalized cyclotomic sums, while the 1-dimensionally iterated integrals are based on a set of ∼30 square-root valued letters. We also derive the asymptotic representations of the nested sums and present the solution for N∈C. Integrals with a power-like divergence in N-space ∝a{sup N},a∈R,a>1, for large values of N emerge. They still possess a representation in x-space, which is given in terms of root-valued iterated integrals in the present case. The method of hyperlogarithms is also used to calculate higher moments for crossed box graphs with different operator insertions.

Calculating massive 3-loop graphs for operator matrix elements by the method of hyperlogarithms

International Nuclear Information System (INIS)

Ablinger, Jakob; Blümlein, Johannes; Raab, Clemens; Schneider, Carsten; Wißbrock, Fabian

2014-01-01

We calculate convergent 3-loop Feynman diagrams containing a single massive loop equipped with twist τ=2 local operator insertions corresponding to spin N. They contribute to the massive operator matrix elements in QCD describing the massive Wilson coefficients for deep-inelastic scattering at large virtualities. Diagrams of this kind can be computed using an extended version of the method of hyperlogarithms, originally being designed for massless Feynman diagrams without operators. The method is applied to Benz- and V-type graphs, belonging to the genuine 3-loop topologies. In case of the V-type graphs with five massive propagators, new types of nested sums and iterated integrals emerge. The sums are given in terms of finite binomially and inverse binomially weighted generalized cyclotomic sums, while the 1-dimensionally iterated integrals are based on a set of ∼30 square-root valued letters. We also derive the asymptotic representations of the nested sums and present the solution for N∈C. Integrals with a power-like divergence in N-space ∝a N ,a∈R,a>1, for large values of N emerge. They still possess a representation in x-space, which is given in terms of root-valued iterated integrals in the present case. The method of hyperlogarithms is also used to calculate higher moments for crossed box graphs with different operator insertions

The Role of Concurrent Engineering in Weapons System Acquisition

Science.gov (United States)

1988-12-01

checx sheets, Pareto diagrams, graphs, control charts, and scatter diagrams. Kaoru Iskilkawa, Guide to Qualiy Conmi, Asian Productivity Organization...Dewing [3 !,Juran [141, and Ishikawa [l𔃿). Managers in the United States and Japan have used techniques of statistics to measure performance and they have...New York (1962). 15. Kaoru Ishkawa, Guide to Quall’y Control, KRAUS International Publications, White Plains, NY (1-982). 16. Robert H. Hayc,%. St

Easy QC 7 tools

International Nuclear Information System (INIS)

1981-04-01

This book explains method of QC 7 tools, mind for using QC 7 tools, effect of QC 7 tools application, giving descriptions of graph, pareto's diagram like application writing way and using method of pareto's diagram, characteristic diagram, check sheet such as purpose and subject of check, goals and types of check sheet, and using point of check sheet, histogram like application and using method, and stratification, scatterplot, control chart, promotion method and improvement and cases of practice of QC tools.

Easy QC 7 tools

Energy Technology Data Exchange (ETDEWEB)

NONE

1981-04-15

This book explains method of QC 7 tools, mind for using QC 7 tools, effect of QC 7 tools application, giving descriptions of graph, pareto's diagram like application writing way and using method of pareto's diagram, characteristic diagram, check sheet such as purpose and subject of check, goals and types of check sheet, and using point of check sheet, histogram like application and using method, and stratification, scatterplot, control chart, promotion method and improvement and cases of practice of QC tools.

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

International Nuclear Information System (INIS)

Neri, I; Bollé, D

2009-01-01

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

On the stretch factor of convex Delaunay graphs

Directory of Open Access Journals (Sweden)

Prosenjit Bose

2010-06-01

Full Text Available Let C be a compact and convex set in the plane that contains the origin in its interior, and let S be a finite set of points in the plane. The Delaunay graph DGC(S of S is defined to be the dual of the Voronoi diagram of S with respect to the convex distance function defined by C. We prove that DGC(S is a t-spanner for S, for some constant t that depends only on the shape of the set C. Thus, for any two points p and q in S, the graph DGC(S contains a path between p and q whose Euclidean length is at most t times the Euclidean distance between p and q.

Extraneous Information and Graph Comprehension: Implications for Effective Design Choices

Science.gov (United States)

Stewart, Brandie M.; Cipolla, Jessica M.; Best, Lisa A.

2009-01-01

Purpose: The purpose of this paper is to examine if university students could accurately extract information from graphs presented in 2D or 3D formats with different colour hue variations or solid black and white. Design/methodology/approach: Participants are presented with 2D and 3D bar and pie charts in a PowerPoint presentation and are asked to…

Designing a Cross-organizational Case Management System using Dynamic Condition Response Graphs

DEFF Research Database (Denmark)

Hildebrandt, Thomas; Mukkamala, Raghava Rao; Slaats, Tijs

2011-01-01

systems. We show how DCR Graphs allow to capture directly both the behavioral constraints identified during meetings with the customer and the operational execution as markings of the graph. In comparison, imperative models such as BPMN, Petri Net, UML Sequence or Activity diagrams are only good...... at describing the operational way to fulfill the constraints, leaving the constraints implicit. In particular, we point out that the BPMN ad-hoc sub process activity, intended to support more loosely structured goal driven ad-hoc processes, is inconsistently described in the final version of the BPMN 2...

JaxoDraw: A graphical user interface for drawing Feynman diagrams

Science.gov (United States)

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

Thermal operator representation of finite temperature graphs

International Nuclear Information System (INIS)

Brandt, F.T.; Frenkel, J.; Das, Ashok; Espinosa, Olivier; Perez, Silvana

2005-01-01

Using the mixed space representation (t,p→) in the context of scalar field theories, we prove in a simple manner that the Feynman graphs at finite temperature are related to the corresponding zero temperature diagrams through a simple thermal operator, both in the imaginary time as well as in the real time formalisms. This result is generalized to the case when there is a nontrivial chemical potential present. Several interesting properties of the thermal operator are also discussed

Applications of zero-suppressed decision diagrams

CERN Document Server

Sasao, Tsutomu

2014-01-01

A zero-suppressed decision diagram (ZDD) is a data structure to represent objects that typically contain many zeros. Applications include combinatorial problems, such as graphs, circuits, faults, and data mining. This book consists of four chapters on the applications of ZDDs. The first chapter by Alan Mishchenko introduces the ZDD. It compares ZDDs to BDDs, showing why a more compact representation is usually achieved in a ZDD. The focus is on sets of subsets and on sum-of-products (SOP) expressions. Methods to generate all the prime implicants (PIs), and to generate irredundant SOPs are show

Gravity on-shell diagrams

Energy Technology Data Exchange (ETDEWEB)

Herrmann, Enrico [Walter Burke Institute for Theoretical Physics, California Institute of Technology,Pasadena, CA 91125 (United States); Trnka, Jaroslav [Center for Quantum Mathematics and Physics (QMAP),Department of Physics, University of California,Davis, CA 95616 (United States)

2016-11-22

We study on-shell diagrams for gravity theories with any number of supersymmetries and find a compact Grassmannian formula in terms of edge variables of the graphs. Unlike in gauge theory where the analogous form involves only dlog-factors, in gravity there is a non-trivial numerator as well as higher degree poles in the edge variables. Based on the structure of the Grassmannian formula for N=8 supergravity we conjecture that gravity loop amplitudes also possess similar properties. In particular, we find that there are only logarithmic singularities on cuts with finite loop momentum and that poles at infinity are present, in complete agreement with the conjecture presented in http://dx.doi.org/10.1007/JHEP06(2015)202.

E-Activities.

Science.gov (United States)

Brewster, Joy

2001-01-01

Presents five technology-based activities to teach elementary students about the human body, including: creating a heartbeat graph; charting the benefits of exercise; playing a "sense"ational card game; reading online stories from three children living with various conditions or illnesses; and examining diagrams of the human body that have been…

Labelling subway lines

NARCIS (Netherlands)

Garrido, M.A.; Iturriaga, C.; Márquez, A.; Portillo, J.R.; Reyes, P.; Wolff, A.; Eades, P.; Takaoka, T.

2001-01-01

Graphical features on map, charts, diagrams and graph drawings usually must be annotated with text labels in order to convey their meaning. In this paper we focus on a problem that arises when labeling schematized maps, e.g. for subway networks. We present algorithms for labeling points on a line

Adaptive random walks on the class of Web graphs

Science.gov (United States)

Tadić, B.

2001-09-01

We study random walk with adaptive move strategies on a class of directed graphs with variable wiring diagram. The graphs are grown from the evolution rules compatible with the dynamics of the world-wide Web [B. Tadić, Physica A 293, 273 (2001)], and are characterized by a pair of power-law distributions of out- and in-degree for each value of the parameter β, which measures the degree of rewiring in the graph. The walker adapts its move strategy according to locally available information both on out-degree of the visited node and in-degree of target node. A standard random walk, on the other hand, uses the out-degree only. We compute the distribution of connected subgraphs visited by an ensemble of walkers, the average access time and survival probability of the walks. We discuss these properties of the walk dynamics relative to the changes in the global graph structure when the control parameter β is varied. For β≥ 3, corresponding to the world-wide Web, the access time of the walk to a given level of hierarchy on the graph is much shorter compared to the standard random walk on the same graph. By reducing the amount of rewiring towards rigidity limit β↦βc≲ 0.1, corresponding to the range of naturally occurring biochemical networks, the survival probability of adaptive and standard random walk become increasingly similar. The adaptive random walk can be used as an efficient message-passing algorithm on this class of graphs for large degree of rewiring.

Reactome diagram viewer: data structures and strategies to boost performance.

Science.gov (United States)

Fabregat, Antonio; Sidiropoulos, Konstantinos; Viteri, Guilherme; Marin-Garcia, Pablo; Ping, Peipei; Stein, Lincoln; D'Eustachio, Peter; Hermjakob, Henning

2018-04-01

Reactome is a free, open-source, open-data, curated and peer-reviewed knowledgebase of biomolecular pathways. For web-based pathway visualization, Reactome uses a custom pathway diagram viewer that has been evolved over the past years. Here, we present comprehensive enhancements in usability and performance based on extensive usability testing sessions and technology developments, aiming to optimize the viewer towards the needs of the community. The pathway diagram viewer version 3 achieves consistently better performance, loading and rendering of 97% of the diagrams in Reactome in less than 1 s. Combining the multi-layer html5 canvas strategy with a space partitioning data structure minimizes CPU workload, enabling the introduction of new features that further enhance user experience. Through the use of highly optimized data structures and algorithms, Reactome has boosted the performance and usability of the new pathway diagram viewer, providing a robust, scalable and easy-to-integrate solution to pathway visualization. As graph-based visualization of complex data is a frequent challenge in bioinformatics, many of the individual strategies presented here are applicable to a wide range of web-based bioinformatics resources. Reactome is available online at: https://reactome.org. The diagram viewer is part of the Reactome pathway browser (https://reactome.org/PathwayBrowser/) and also available as a stand-alone widget at: https://reactome.org/dev/diagram/. The source code is freely available at: https://github.com/reactome-pwp/diagram. fabregat@ebi.ac.uk or hhe@ebi.ac.uk. Supplementary data are available at Bioinformatics online.

Energy Blocks--A Physical Model for Teaching Energy Concepts

Science.gov (United States)

Hertting, Scott

2016-01-01

Most physics educators would agree that energy is a very useful, albeit abstract topic. It is therefore important to use various methods to help the student internalize the concept of energy itself and its related ideas. These methods include using representations such as energy bar graphs, energy pie charts, or energy tracking diagrams.…

Diagram of Saturn V Launch Vehicle

Science.gov (United States)

1971-01-01

This is a good cutaway diagram of the Saturn V launch vehicle showing the three stages, the instrument unit, and the Apollo spacecraft. The chart on the right presents the basic technical data in clear detail. The Saturn V is the largest and most powerful launch vehicle in the United States. The towering 363-foot Saturn V was a multistage, multiengine launch vehicle standing taller than the Statue of Liberty. Altogether, the Saturn V engines produced as much power as 85 Hoover Dams. Development of the Saturn V was the responsibility of the Marshall Space Flight Center at Huntsville, Alabama, directed by Dr. Wernher von Braun.

Pembuatan Kakas Bantu untuk Mendeteksi Ketidaksesuaian Diagram Urutan (Sequence Diagram dengan Diagram Kasus Penggunaan (Use Case Diagram

Directory of Open Access Journals (Sweden)

Andrias Meisyal Yuwantoko

2017-03-01

Full Text Available Sebuah diagram urutan dibuat  berdasarkan alur yang ada pada deskripsi kasus penggunaan. Alur tersebut dire- presentasikan dalam  bentuk  interaksi antara aktor  dan  sistem. Pemeriksaan rancangan diagram urutan perlu dilakukan untuk mengetahui ketidaksesuaian urutan alur  kasus penggunaan dengan urutan pesan yang dikirimkan oleh objek-objek pada diagram urutan. Rancangan diagram yang sesuai merupakan kunci ketepatan (correctness implementasi  perangkat lunak. Namun, pemeriksaan ketidaksesuaian masih dilakukan secara manual. Hal ini menjadi masalah apabila sebuah proyek perangkat lunak memiliki banyak  rancangan diagram dan sumber daya manusia tidak  mencukupi. Pemeriksaan membutuhkan waktu yang lama dan memiliki dampak pada waktu pengembangan perangkat lunak. Penelitian ini mengusulkan pembuatan kakas bantu  untuk mendeteksi ketidaksesuaian diagram urutan dengan diagram kasus penggunaan. Ketidaksesuaian dilihat dari kemiripan semantik kalimat antara alur pada deskripsi kasus penggunaan dan triplet. Dari hasil pembuatan kakas bantu, kakas bantu yang dibuat dapat mendeteksi ketidaksesuaian diagram urutan dengan diagram kasus penggunaan. Kakas  bantu ini diharapkan tidak hanya membantu pemeriksaan rancangan diagram akan tetapi mempercepat waktu pengembangan perangkat lunak.

SU-F-T-96: A New Paradigm of Weekly Chart Checking for Radiation Therapy Clinics

International Nuclear Information System (INIS)

Tan, J; Pompos, A; Jiang, S; Yan, Y

2016-01-01

Purpose: To put forth an innovative clinical paradigm for weekly chart checking so that treatment status is periodically checked accurately and efficiently. This study also aims to help optimize the chart checking clinical workflow in a busy radiation therapy clinic. Methods: It is mandated by the Texas Administrative code to check patient charts of radiation therapy once a week or every five fractions, however it varies drastically among institutions in terms of when and how it is done. Some do it every day, but a lot of efforts are wasted on opening ineligible charts; some do it on a fixed day but the distribution of intervals between subsequent checks is not optimal. To establish an optimal chart checking procedure, a new paradigm was developed to achieve 1) charts are checked more accurately and more efficiently; 2) charts are checked on optimal days without any miss; 3) workload is evened out throughout a week when multiple physicists are involved. All active charts will be accessed by querying the R&V system. Priority is assigned to each chart based on the number of days before the next due date followed by sorting and workload distribution steps. New charts are also taken into account when distributing the workload so it is reasonably even throughout the week. Results: Our clinical workflow became more streamlined and smooth. In addition, charts get checked in a more timely fashion so that errors would get caught earlier should they occur. Conclusion: We developed a new weekly chart checking diagram. It helps physicists check charts in a timely manner, saves their time in busy clinics, and consequently reduces possible errors.

SU-F-T-96: A New Paradigm of Weekly Chart Checking for Radiation Therapy Clinics

Energy Technology Data Exchange (ETDEWEB)

Tan, J; Pompos, A; Jiang, S; Yan, Y [UT Southwestern Medical Center, Dallas, TX (United States)

2016-06-15

Purpose: To put forth an innovative clinical paradigm for weekly chart checking so that treatment status is periodically checked accurately and efficiently. This study also aims to help optimize the chart checking clinical workflow in a busy radiation therapy clinic. Methods: It is mandated by the Texas Administrative code to check patient charts of radiation therapy once a week or every five fractions, however it varies drastically among institutions in terms of when and how it is done. Some do it every day, but a lot of efforts are wasted on opening ineligible charts; some do it on a fixed day but the distribution of intervals between subsequent checks is not optimal. To establish an optimal chart checking procedure, a new paradigm was developed to achieve 1) charts are checked more accurately and more efficiently; 2) charts are checked on optimal days without any miss; 3) workload is evened out throughout a week when multiple physicists are involved. All active charts will be accessed by querying the R&V system. Priority is assigned to each chart based on the number of days before the next due date followed by sorting and workload distribution steps. New charts are also taken into account when distributing the workload so it is reasonably even throughout the week. Results: Our clinical workflow became more streamlined and smooth. In addition, charts get checked in a more timely fashion so that errors would get caught earlier should they occur. Conclusion: We developed a new weekly chart checking diagram. It helps physicists check charts in a timely manner, saves their time in busy clinics, and consequently reduces possible errors.

From State Diagram to Class Diagram

DEFF Research Database (Denmark)

Borch, Ole; Madsen, Per Printz

2009-01-01

UML class diagram and Java source code are interrelated and Java code is a kind of interchange format. Working with UML state diagram in CASE tools, a corresponding xml file is maintained. Designing state diagrams is mostly performed manually using design patterns and coding templates - a time...... consuming process. This article demonstrates how to compile such a diagram into Java code and later, by reverse engineering, produce a class diagram. The process from state diagram via intermediate SAX parsed xml file to Apache Velocity generated Java code is described. The result is a fast reproducible...

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

Directory of Open Access Journals (Sweden)

Tomasz Kajdanowicz

2016-09-01

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

The Eh-pH Diagram and Its Advances

Directory of Open Access Journals (Sweden)

Hsin-Hsiung Huang

2016-01-01

as the concentration of a given ligand, temperature or showing the solubility of stable solids. A personal computer is capable of drawing the diagram by utilizing a 3D program, such as ParaView, or VisIt, or MATLAB. Two 3D wireframe volume plots of a Uranium-carbonate system from Garrels and Christ were used to verify the Eh-pH calculation and the presentation from ParaView. Although a two-dimensional drawing is still much clearer to read, a 3D graph can allow one to visualize an entire system by executing rotation, clipping, slicing and making a movie.

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

Science.gov (United States)

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

2015-12-01

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

Graph and model transformation tools for model migration : empirical results from the transformation tool contest

NARCIS (Netherlands)

Rose, L.M.; Herrmannsdoerfer, M.; Mazanek, S.; Van Gorp, P.M.E.; Buchwald, S.; Horn, T.; Kalnina, E.; Koch, A.; Lano, K.; Schätz, B.; Wimmer, M.

2014-01-01

We describe the results of the Transformation Tool Contest 2010 workshop, in which nine graph and model transformation tools were compared for specifying model migration. The model migration problem—migration of UML activity diagrams from version 1.4 to version 2.2—is non-trivial and practically

Direct Visual Editing of Node Attributes in Graphs

Directory of Open Access Journals (Sweden)

Christian Eichner

2016-10-01

Full Text Available There are many expressive visualization techniques for analyzing graphs. Yet, there is only little research on how existing visual representations can be employed to support data editing. An increasingly relevant task when working with graphs is the editing of node attributes. We propose an integrated visualize-and-edit approach to editing attribute values via direct interaction with the visual representation. The visualize part is based on node-link diagrams paired with attribute-dependent layouts. The edit part is as easy as moving nodes via drag-and-drop gestures. We present dedicated interaction techniques for editing quantitative as well as qualitative attribute data values. The benefit of our novel integrated approach is that one can directly edit the data while the visualization constantly provides feedback on the implications of the data modifications. Preliminary user feedback indicates that our integrated approach can be a useful complement to standard non-visual editing via external tools.

A graph rewriting programming language for graph drawing

OpenAIRE

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

Charting Ingredients for Life

Science.gov (United States)

2005-01-01

[figure removed for brevity, see original site] Figure 1: Spectrum Charts Light from a Faraway Galaxy This graph, or spectrum, charts light from a faraway galaxy located 10 billion light years from Earth. It tracks mid-infrared light from an extremely luminous galaxy when the universe was only 1/4 of its current age. Spectra are created when an instrument called a spectrograph spreads light out into its basic parts, like a prism turning sunlight into a rainbow. They reveal the signatures, or 'fingerprints,' of molecules that make up a galaxy and contribute to its light. Spitzer's infrared spectrometer identified characteristic fingerprints of complex organic molecules called polycyclic aromatic hydrocarbons, illustrated in the artist's concept in the inset. These large molecules comprised of carbon and hydrogen, are considered among the building blocks of life. Scientists determined it took 10 billion years for photons from this galaxy to reach Spitzer's infrared eyes. These complex carbon and hydrogen molecules are from a young galaxy which is undergoing intense star formation, at the time the universe was only 3.5 billion years old. These distant galaxies with enormous amounts of gas being converted into young stars are some of the most luminous objects in the sky. Enshrouded by dust, they are only faint, inconspicuous little dots in optical images. They are as bright as 10 trillion suns put together and 10 times brighter than starburst galaxies seen in our local universe. This prompts a fascinating question as to what physical process is driving such enormous energy production in these galaxies when the universe is so young. These data were taken by Spitzer's infrared spectrograph in August and September 2004.

R13B1 and R114 exergy-enthalpy charts and their usefulness in a refrigerating-heating process analysis

International Nuclear Information System (INIS)

de Rossi, F.; Mastrullo, R.; Sasso, M.; Sibilio, S.

1989-01-01

R13B1 and R114 exergy-enthalpy diagrams in SI units based on data and equations published by the International Institute of Refrigeration are presented. The charts cover the ranges of 0.5 kPa to 15000 kPa and 120 degrees C to 180 degrees C for R13B1 and 0.8 kPa to 5000 kPa and -70 degrees C to 250 degrees C for R114. In this paper an analysis of a cascade refrigerating-heating compound system is included to illustrate the use of the charts

Graph Aggregation

NARCIS (Netherlands)

Endriss, U.; Grandi, U.

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

Influence of thermophysical properties of working fluid on the design of cryogenic turboexpanders using nsds diagram

International Nuclear Information System (INIS)

Sam, Ashish A; Ghosh, Parthasarathi

2015-01-01

Cryogenic turboexpanders are an essential part of liquefaction and refrigeration plants. The thermodynamic efficiency of these plants depends upon the efficiency of the turboexpander, which is the main cold generating component of these plants, and therefore, they should be designed for high thermodynamic efficiencies. Balje's [1] n s d s chart, which is a contour of isentropic efficiencies plotted against specific speed and specific diameter, is commonly used for the preliminary design of cryogenic turboexpanders. But, these charts were developed based on calculations for a specific heat ratio (γ) of 1.4, and studies show that care should be taken while implementing the same for gases which have a higher γ of 1.67. Hence there is a need to investigate the extent of applicability of n s d s diagram in designing expansion turbines for higher specific heat ratios. In this paper, Computational Fluid Dynamics (CFD) analysis of cryogenic turboexpanders was carried out using Ansys CFX®. The turboexpanders were designed based on the methodologies prescribed by Kun and Sentz [2] following the n s d s diagram of Balje and Hasselgruber's technique for generating blade profile. The computational results of the two cases were analysed to investigate the applicability of Balje's n s d s diagram for the design of turboexpanders for refrigeration and liquefaction cycles. (paper)

Proxy Graph: Visual Quality Metrics of Big Graph Sampling.

Science.gov (United States)

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

2017-06-01

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

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

Science.gov (United States)

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

2010-07-15

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

VennPainter: A Tool for the Comparison and Identification of Candidate Genes Based on Venn Diagrams.

Directory of Open Access Journals (Sweden)

Guoliang Lin

Full Text Available VennPainter is a program for depicting unique and shared sets of genes lists and generating Venn diagrams, by using the Qt C++ framework. The software produces Classic Venn, Edwards' Venn and Nested Venn diagrams and allows for eight sets in a graph mode and 31 sets in data processing mode only. In comparison, previous programs produce Classic Venn and Edwards' Venn diagrams and allow for a maximum of six sets. The software incorporates user-friendly features and works in Windows, Linux and Mac OS. Its graphical interface does not require a user to have programing skills. Users can modify diagram content for up to eight datasets because of the Scalable Vector Graphics output. VennPainter can provide output results in vertical, horizontal and matrix formats, which facilitates sharing datasets as required for further identification of candidate genes. Users can obtain gene lists from shared sets by clicking the numbers on the diagram. Thus, VennPainter is an easy-to-use, highly efficient, cross-platform and powerful program that provides a more comprehensive tool for identifying candidate genes and visualizing the relationships among genes or gene families in comparative analysis.

Chromatic graph theory

CERN Document Server

Chartrand, Gary; Rosen, Kenneth H

2008-01-01

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

User compliance with documenting on a track and trigger-based observation and response chart: a two-phase multi-site audit study.

Science.gov (United States)

Elliott, Doug; Allen, Emily; McKinley, Sharon; Perry, Lin; Duffield, Christine; Fry, Margaret; Gallagher, Robyn; Iedema, Rick; Roche, Michael

2017-12-01

To examine user compliance and completeness of documentation with a newly designed observation and response chart and whether a rapid response system call was triggered when clinically indicated. Timely recognition and responses to patient deterioration in hospital general wards remain a challenge for healthcare systems globally. Evaluating practice initiatives to improve recognition and response are required. Two-phase audit. Following introduction of the charts in ten health service sites in Australia, an audit of chart completion was conducted during a short trial for initial usability (Phase 1; 2011). After chart adoption as routine use in practice, retrospective and prospective chart audits were conducted (Phase 2; 2012). Overall, 818 and 1,058 charts were audited during the two phases respectively. Compliance was mixed but improved with the new chart (4%-14%). Contrary to chart guidelines, numbers rather than dots were written in the graphing section in 60% of cases. Rates of recognition of abnormal vital signs improved slightly with new charts in use, particularly for higher levels of surveillance and clinical review. Based on local calling criteria, an emergency call was initiated in 33% of cases during the retrospective audit and in 41% of cases with the new chart. User compliance was less than optimal, limiting full function of the chart sections and compliance with local calling criteria. Overcoming apparent behavioural and work culture barriers may improve chart completion, aiding identification of abnormal vital signs and triggering a rapid response system activation when clinical deterioration is detected. © 2017 The Authors. Journal of Advanced Nursing Published by John Wiley & Sons Ltd.

An extended evaluation of the readability of tapered, animated, and textured directed-edge representations in node-link graphs

NARCIS (Netherlands)

Holten, D.H.R.; Isenberg, P.; Wijk, van J.J.; Fekete, J.D.

2011-01-01

We present the results of a study comparing five directed-edge representations for use in 2D, screen-based node-link diagrams. The goal of this work is to extend the understanding of tradeoffs and best practices for the representation of edges in directed graphs and to help practitioners choose

Phase diagram of two-component bosons on an optical lattice

International Nuclear Information System (INIS)

Altman, Ehud; Hofstetter, Walter; Demler, Eugene; Lukin, Mikhail D

2003-01-01

We present a theoretical analysis of the phase diagram of two-component bosons on an optical lattice. A new formalism is developed which treats the effective spin interactions in the Mott and superfluid phases on the same footing. Using this new approach we chart the phase boundaries of the broken spin symmetry states up to the Mott to superfluid transition and beyond. Near the transition point, the magnitude of spin exchange can be very large, which facilitates the experimental realization of spin-ordered states. We find that spin and quantum fluctuations have a dramatic effect on the transition, making it first order in extended regions of the phase diagram. When each species is at integer filling, an additional phase transition may occur, from a spin-ordered insulator to a Mott insulator with no broken symmetries. We determine the phase boundaries in this regime and show that this is essentially a Mott transition in the spin sector

Využití regulačních diagramů pro kontrolu jakosti

OpenAIRE

Ječmínková, Michaela

2014-01-01

Diplomová práce se zaměřuje na využití Shewhartových regulačních diagramů pro kontrolu jakosti. Práce popisuje současný proces kontroly kvality v podniku a následně poskytuje praktický návod zavedení statistické regulace procesu kontroly jakosti vybraného komponentu a hodnocení způsobilosti. Součástí práce je také aplikace pro tvorbu regulačních diagramů a průběžnou kontrolu jakosti daného výrobku. This diploma thesis deals with use of Shewhart Control Charts in quality control. The thesis...

A case study in Gantt charts as historiophoty: A century of psychology at the University of Alberta.

Science.gov (United States)

Dawson, Michael R W

2013-05-01

History is typically presented as historiography, where historians communicate via the written word. However, some historians have suggested alternative formats for communicating and thinking about historical information. One such format is known as historiophoty, which involves using a variety of visual images to represent history. The current article proposes that a particular type of graph, known as a Gantt chart, is well suited for conducting historiophoty. When used to represent history, Gantt charts provide a tremendous amount of information. Furthermore, the spatial nature of Gantt charts permits other kinds of spatial operations to be performed on them. This is illustrated with a case study of the history of a particular psychology department. The academic year 2009-2010 marked the centennial of psychology at the University of Alberta. This centennial was marked by compiling a list of its full-time faculty members for each year of its history. This historiography was converted into historiophoty by using it as the source for the creation of a Gantt chart. The current article shows how the history of psychology at the University of Alberta is revealed by examining this Gantt chart in a variety of different ways. This includes computing simple descriptive statistics from the chart, creating smaller versions of the Gantt to explore departmental demographics, and using image processing methods to provide measures of departmental stability throughout its history. (PsycINFO Database Record (c) 2013 APA, all rights reserved).

Graph sampling

OpenAIRE

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

2017-01-01

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

Algorithms for Planar Graphs and Graphs in Metric Spaces

DEFF Research Database (Denmark)

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

Diagram of the Saturn V Launch Vehicle in Metric

Science.gov (United States)

1971-01-01

This is a good cutaway diagram of the Saturn V launch vehicle showing the three stages, the instrument unit, and the Apollo spacecraft. The chart on the right presents the basic technical data in clear metric detail. The Saturn V is the largest and most powerful launch vehicle in the United States. The towering, 111 meter, Saturn V was a multistage, multiengine launch vehicle standing taller than the Statue of Liberty. Altogether, the Saturn V engines produced as much power as 85 Hoover Dams. Development of the Saturn V was the responsibility of the Marshall Space Flight Center at Huntsville, Alabama, directed by Dr. Wernher von Braun.

FusionCharts Beginner's Guide The Official Guide for FusionCharts Suite

CERN Document Server

Nadhani, Sanket; Bhattacharya, Shamasis

2012-01-01

The book is written as a practical, step-by-step guide to using FusionCharts Suite. The book not only teaches you the fundamentals and implementation of FusionCharts Suite, but also makes you the data visualization guru among your friends and colleagues by teaching how to select the right chart type and usability tips. Filled with examples, code samples and practical tips in a no-nonsense way, the book is a breeze to read.This book is both for beginners and advanced web developers who need to create interactive charts for their web applications. No previous knowledge of FusionCharts Suite is a

Degree Associated Edge Reconstruction Number of Graphs with Regular Pruned Graph

Directory of Open Access Journals (Sweden)

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.

Graph Theory. 2. Vertex Descriptors and Graph Coloring

Directory of Open Access Journals (Sweden)

Lorentz JÄNTSCHI

2002-12-01

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

On an edge partition and root graphs of some classes of line graphs

Directory of Open Access Journals (Sweden)

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.

Graphs and matrices

CERN Document Server

Bapat, Ravindra B

2014-01-01

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

The study of insect blood-feeding behaviour: 2. Recording techniques and the use of flow charts

Directory of Open Access Journals (Sweden)

J. J. B. Smith

1987-01-01

Full Text Available This paper continues a discussion of approaches and methodologies we have used in our studies of feeding in haematophagous insects. Described are techniques for directly monitoring behaviour: electrical recording of feeding behaviour via resistance changes in the food canal, optical methods for monitoring mouthpart activity, and a computer technique for behavioural event recording. Also described is the use of "flow charts" or "decision diagrams" to model interrelated sequences of behaviours.

Disconnected Diagrams in Lattice QCD

Science.gov (United States)

Gambhir, Arjun Singh

In this work, we present state-of-the-art numerical methods and their applications for computing a particular class of observables using lattice quantum chromodynamics (Lattice QCD), a discretized version of the fundamental theory of quarks and gluons. These observables require calculating so called "disconnected diagrams" and are important for understanding many aspects of hadron structure, such as the strange content of the proton. We begin by introducing the reader to the key concepts of Lattice QCD and rigorously define the meaning of disconnected diagrams through an example of the Wick contractions of the nucleon. Subsequently, the calculation of observables requiring disconnected diagrams is posed as the computationally challenging problem of finding the trace of the inverse of an incredibly large, sparse matrix. This is followed by a brief primer of numerical sparse matrix techniques that overviews broadly used methods in Lattice QCD and builds the background for the novel algorithm presented in this work. We then introduce singular value deflation as a method to improve convergence of trace estimation and analyze its effects on matrices from a variety of fields, including chemical transport modeling, magnetohydrodynamics, and QCD. Finally, we apply this method to compute observables such as the strange axial charge of the proton and strange sigma terms in light nuclei. The work in this thesis is innovative for four reasons. First, we analyze the effects of deflation with a model that makes qualitative predictions about its effectiveness, taking only the singular value spectrum as input, and compare deflated variance with different types of trace estimator noise. Second, the synergy between probing methods and deflation is investigated both experimentally and theoretically. Third, we use the synergistic combination of deflation and a graph coloring algorithm known as hierarchical probing to conduct a lattice calculation of light disconnected matrix elements

Disconnected Diagrams in Lattice QCD

Energy Technology Data Exchange (ETDEWEB)

Gambhir, Arjun [College of William and Mary, Williamsburg, VA (United States)

2017-08-01

In this work, we present state-of-the-art numerical methods and their applications for computing a particular class of observables using lattice quantum chromodynamics (Lattice QCD), a discretized version of the fundamental theory of quarks and gluons. These observables require calculating so called \\disconnected diagrams" and are important for understanding many aspects of hadron structure, such as the strange content of the proton. We begin by introducing the reader to the key concepts of Lattice QCD and rigorously define the meaning of disconnected diagrams through an example of the Wick contractions of the nucleon. Subsequently, the calculation of observables requiring disconnected diagrams is posed as the computationally challenging problem of finding the trace of the inverse of an incredibly large, sparse matrix. This is followed by a brief primer of numerical sparse matrix techniques that overviews broadly used methods in Lattice QCD and builds the background for the novel algorithm presented in this work. We then introduce singular value deflation as a method to improve convergence of trace estimation and analyze its effects on matrices from a variety of fields, including chemical transport modeling, magnetohydrodynamics, and QCD. Finally, we apply this method to compute observables such as the strange axial charge of the proton and strange sigma terms in light nuclei. The work in this thesis is innovative for four reasons. First, we analyze the effects of deflation with a model that makes qualitative predictions about its effectiveness, taking only the singular value spectrum as input, and compare deflated variance with different types of trace estimator noise. Second, the synergy between probing methods and deflation is investigated both experimentally and theoretically. Third, we use the synergistic combination of deflation and a graph coloring algorithm known as hierarchical probing to conduct a lattice calculation of light disconnected matrix elements

Learning Styles of Medical and Midwifery Students in Mashhad University of Medical Sciences

OpenAIRE

A Zeraati; H Hajian; R Shojaian

2009-01-01

Background: Students have individual learning style preferences including visual (V; learning from graphs, charts, and flow diagrams), auditory (A; learning from speech), read-write(R; learning from reading and writing), and kinesthetic (K; learning from touch, hearing, smell, taste, and sight).These preferences can be assessed using the VARK questionnaire.Purpose: We aimed to assess different learning styles of medical students in our collage.Methods: This study was conducted to describe lea...

Graphs cospectral with a friendship graph or its complement

Directory of Open Access Journals (Sweden)

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

Diagram Size vs. Layout Flaws: Understanding Quality Factors of UML Diagrams

DEFF Research Database (Denmark)

Störrle, Harald

2016-01-01

, though, is our third goal of extending our analysis aspects of diagram quality. Method: We improve our definition of diagram size and add a (provisional) definition of diagram quality as the number of topographic layout flaws. We apply these metrics on 60 diagrams of the five most commonly used types...... of UML diagram. We carefully analyze the structure of our diagram samples to ensure representativeness. We correlate diagram size and layout quality with modeler performance data obtained in previous experiments. The data set is the largest of its kind (n-156). Results: We replicate earlier findings......, and extend them to two new diagram types. We provide an improved definition of diagram size, and provide a definition of topographic layout quality, which is one more step towards a comprehensive definition of diagram quality as such. Both metrics are shown to be objectively applicable. We quantify...

Graph embedding with rich information through heterogeneous graph

KAUST Repository

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.

Topics in graph theory graphs and their Cartesian product

CERN Document Server

Imrich, Wilfried; Rall, Douglas F

2008-01-01

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

Study of Chromatic parameters of Line, Total, Middle graphs and Graph operators of Bipartite graph

Science.gov (United States)

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

Handbook of graph grammars and computing by graph transformation

CERN Document Server

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

Roundhouse Diagrams.

Science.gov (United States)

Ward, Robin E.; Wandersee, James

2000-01-01

Students must understand key concepts through reasoning, searching out related concepts, and making connections within multiple systems to learn science. The Roundhouse diagram was developed to be a concise, holistic, graphic representation of a science topic, process, or activity. Includes sample Roundhouse diagrams, a diagram checklist, and…

Safety- barrier diagrams

DEFF Research Database (Denmark)

Duijm, Nijs Jan

2008-01-01

Safety-barrier diagrams and the related so-called 'bow-tie' diagrams have become popular methods in risk analysis. This paper describes the syntax and principles for constructing consistent and valid safety-barrier diagrams. The relation of safety-barrier diagrams to other methods such as fault...... trees and Bayesian networks is discussed. A simple method for quantification of safety-barrier diagrams is proposed. It is concluded that safety-barrier diagrams provide a useful framework for an electronic data structure that integrates information from risk analysis with operational safety management....

Development of Markup Language for Medical Record Charting: A Charting Language.

Science.gov (United States)

Jung, Won-Mo; Chae, Younbyoung; Jang, Bo-Hyoung

2015-01-01

Nowadays a lot of trials for collecting electronic medical records (EMRs) exist. However, structuring data format for EMR is an especially labour-intensive task for practitioners. Here we propose a new mark-up language for medical record charting (called Charting Language), which borrows useful properties from programming languages. Thus, with Charting Language, the text data described in dynamic situation can be easily used to extract information.

Centrosymmetric Graphs And A Lower Bound For Graph Energy Of Fullerenes

Directory of Open Access Journals (Sweden)

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.

Sidebar- Programming Commercial Robots

OpenAIRE

Matellán Olivera, Vicente; McDonal, Bruce; Biggs, Geoffrey; Cañas, José María

2007-01-01

P. 125-132 Manual systems require the user/programmer to directly enter the desired behaviour of the robot, usually using a graphical or text-based programming language, as shown in Fig. 1. Text-based systems are either controller-specific languages, generic procedural languages, or behavioural languages, which typically differ by the flexibility and method of expression of the system. Graphical languages [BKS02, BI01] use a graph, flow-chart or diagram based graphical interface...

Graphs and Homomorphisms

CERN Document Server

Hell, Pavol

2004-01-01

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

Growth Charts (For Parents)

Science.gov (United States)

... Staying Safe Videos for Educators Search English Español Growth Charts KidsHealth / For Parents / Growth Charts What's in ... Problem? Print en español Tablas de crecimiento About Growth Charts Look at any class picture, and you' ...

Graph comprehension in science and mathematics education: Objects and categories

DEFF Research Database (Denmark)

Voetmann Christiansen, Frederik; May, Michael

types of registers. In the second part of the paper, we consider how diagrams in science are often composites of iconic and indexical elements, and how this fact may lead to confusion for students. In the discussion the utility of the Peircian semiotic framework for educational studies......, the typological mistake of considering graphs as images is discussed related to litterature, and two examples from engineering education are given. The educational implications for science and engineering are discussed, with emphasis on the need for students to work explicitly with conversions between different...... of representational forms in science is discussed, and how the objects of mathematics and science relate to their semiotic representations....

PENGEMBANGAN APLIKASI MANAJEMEN PROYEK SECARA GRAFIS BERBASIS WEB MENGGUNAKAN METODE DIAGRAM PRESEDENSI

Directory of Open Access Journals (Sweden)

Suhadi Lili

2004-07-01

operasi komputer, dan tidak terhambat oleh restriksi internet (sering kali berupa firewall. Untuk mewujudkan sifat-sifat tersebut, aplikasi ini disusun dengan teknologi J2EE, Java, Web Service, dan untuk enkapsulasi data digunakan struktur XML karena fleksibel dan mampu merepresentasikan struktur hirarki data berbentuk tree. Dalam perancangan aplikasi ini digunakan bahasa UML untuk memodelkan aplikasi, sedangkan pemodelan data menggunakan Conceptual Data Model dan Physical Data Model Fitur utama yang dibuat untuk manajemen proyek pada aplikasi ini adalah komponen Gantt Chart yang menerapkan metode Diagram Presedensi. Komponen ini dapat membantu manajer untuk melakukan manajemen proyek dengan menyediakan fitur untuk menggambarkan secara visual pelaksanaan proyek dengan elemen-elemen Gantt Chart yaitu : Task Sheet, Diagram Pane, Time Line, dan Work Calendar. Dengan penerapan metode Diagram Presedensi akan mempermudah perencana proyek dalam penentuan jadwal start dan finish dari task-task penyusun proyek Aplikasi yang telah dibuat telah mengalami uji coba untuk berjalan secara multiuser, dan dari beberapa kali skenario uji coba yang dijalankan aplikasi sudah berjalan sesuai dengan spesifikasi yang telah ditetapkan. Kata Kunci : Project Management, Gantt Chart, Diagram Presedensi

Decomposing Oriented Graphs into Six Locally Irregular Oriented Graphs

DEFF Research Database (Denmark)

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

Surface Prognostic Charts

Data.gov (United States)

National Oceanic and Atmospheric Administration, Department of Commerce — Surface Prognostic Charts are historical surface prognostic (forecast) charts created by the United States Weather Bureau. They include fronts, isobars, cloud, and...

Non-heuristic reduction of the graph in graph-cut optimization

International Nuclear Information System (INIS)

Malgouyres, François; Lermé, Nicolas

2012-01-01

During the last ten years, graph cuts had a growing impact in shape optimization. In particular, they are commonly used in applications of shape optimization such as image processing, computer vision and computer graphics. Their success is due to their ability to efficiently solve (apparently) difficult shape optimization problems which typically involve the perimeter of the shape. Nevertheless, solving problems with a large number of variables remains computationally expensive and requires a high memory usage since underlying graphs sometimes involve billion of nodes and even more edges. Several strategies have been proposed in the literature to improve graph-cuts in this regards. In this paper, we give a formal statement which expresses that a simple and local test performed on every node before its construction permits to avoid the construction of useless nodes for the graphs typically encountered in image processing and vision. A useless node is such that the value of the maximum flow in the graph does not change when removing the node from the graph. Such a test therefore permits to limit the construction of the graph to a band of useful nodes surrounding the final cut.

Graph embedding with rich information through heterogeneous graph

KAUST Repository

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

Construction of renormalized coefficient functions of the Feynman diagrams by means of a computer

International Nuclear Information System (INIS)

Tarasov, O.V.

1978-01-01

An algorithm and short description of computer program, written in SCHOONSCHIP, are given. The program is assigned for construction of integrands of renormalized coefficient functions of the Feynman diagrams in scalar theories in the case of arbitrary subtraction point. For the given Feynman graph computer completely realizes the R-operation of Bogolubov-Parasjuk and gives the result as an integral over Feynman parameters. With the help of the program the time construction of the whole renormalized coefficient function is equal approximately 30 s on the CDC-6500 computer

Graphing trillions of triangles.

Science.gov (United States)

Burkhardt, Paul

2017-07-01

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

Adaptive Graph Convolutional Neural Networks

OpenAIRE

Li, Ruoyu; Wang, Sheng; Zhu, Feiyun; Huang, Junzhou

2018-01-01

Graph Convolutional Neural Networks (Graph CNNs) are generalizations of classical CNNs to handle graph data such as molecular data, point could and social networks. Current filters in graph CNNs are built for fixed and shared graph structure. However, for most real data, the graph structures varies in both size and connectivity. The paper proposes a generalized and flexible graph CNN taking data of arbitrary graph structure as input. In that way a task-driven adaptive graph is learned for eac...

Safety-barrier diagrams

DEFF Research Database (Denmark)

Duijm, Nijs Jan

2007-01-01

Safety-barrier diagrams and the related so-called "bow-tie" diagrams have become popular methods in risk analysis. This paper describes the syntax and principles for constructing consistent and valid safety-barrier diagrams. The relation with other methods such as fault trees and Bayesian networks...... are discussed. A simple method for quantification of safety-barrier diagrams is proposed, including situations where safety barriers depend on shared common elements. It is concluded that safety-barrier diagrams provide a useful framework for an electronic data structure that integrates information from risk...... analysis with operational safety management....

Asymptote Misconception on Graphing Functions: Does Graphing Software Resolve It?

Directory of Open Access Journals (Sweden)

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.

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

Science.gov (United States)

Kempton, Mark

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

X-Graphs: Language and Algorithms for Heterogeneous Graph Streams

Science.gov (United States)

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

On the sizes of expander graphs and minimum distances of graph codes

DEFF Research Database (Denmark)

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

Similarity Measure of Graphs

Directory of Open Access Journals (Sweden)

Amine Labriji

2017-07-01

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

Spectra of Graphs

NARCIS (Netherlands)

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

2012-01-01

This book gives an elementary treatment of the basic material about graph spectra, both for ordinary, and Laplace and Seidel spectra. The text progresses systematically, by covering standard topics before presenting some new material on trees, strongly regular graphs, two-graphs, association

On middle cube graphs

Directory of Open Access Journals (Sweden)

C. Dalfo

2015-10-01

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

ICAO Aeronautical chart production: aerodrome obstruction charts from small–format aerial digital imagery

Directory of Open Access Journals (Sweden)

Jorge Padro Molina

2012-11-01

Full Text Available Aeronautical charts and aerodrome obstruction charts, provide information about obstacles around the airport, so pilots and air traffic controllers can comply with the procedures and limitations of its utilization. Safety in aviation demands updated and precise aeronautical charts production, adopting the standards of the International Civil Aviation Organization (ICAO. In this paper the methodology employed to generate obstruction charts for five airports in Mexico, using aerial digital imagery obtained with small–format cameras, is described. Through two aerial surveys on each airport, from 10 000 and 5 000 feet above ground level, two orthomosaics were generated covering the airport influence area, the runway, and the obstacle limitation surfaces: approach/Take–off climb, transitional, inner horizontal, and conical. Using stereopair photointerpretation most of the obstacles were identified, and by means of the orthomosaics; aerodrome charts, and aerodrome obstruction charts types A, B and C, were generated. Using satellite geodetic receivers, 18 points were surveyed on each runway in order to obtain its dimensions, and to establish ground control points for mosaics generation. Throughout detailed field work, height and location of the obstacles were verified, and finally, after several reviewing processes by aeronautical authorities, generation of ICAO charts was concluded when all airport maps were integrated in a Geographical Information System.

[Ophthalmologic reading charts : Part 2: Current logarithmically scaled reading charts].

Science.gov (United States)

Radner, W

2016-12-01

To analyze currently available reading charts regarding print size, logarithmic print size progression, and the background of test-item standardization. For the present study, the following logarithmically scaled reading charts were investigated using a measuring microscope (iNexis VMA 2520; Nikon, Tokyo): Eschenbach, Zeiss, OCULUS, MNREAD (Minnesota Near Reading Test), Colenbrander, and RADNER. Calculations were made according to EN-ISO 8596 and the International Research Council recommendations. Modern reading charts and cards exhibit a logarithmic progression of print sizes. The RADNER reading charts comprise four different cards with standardized test items (sentence optotypes), a well-defined stop criterion, accurate letter sizes, and a high print quality. Numbers and Landolt rings are also given in the booklet. The OCULUS cards have currently been reissued according to recent standards and also exhibit a high print quality. In addition to letters, numbers, Landolt rings, and examples taken from a timetable and the telephone book, sheet music is also offered. The Colenbrander cards use short sentences of 44 characters, including spaces, and exhibit inaccuracy at smaller letter sizes, as do the MNREAD cards. The MNREAD cards use sentences of 60 characters, including spaces, and have a high print quality. Modern reading charts show that international standards can be achieved with test items similar to optotypes, by using recent technology and developing new concepts of test-item standardization. Accurate print sizes, high print quality, and a logarithmic progression should become the minimum requirements for reading charts and reading cards in ophthalmology.

Adventures in graph theory

CERN Document Server

Joyner, W David

2017-01-01

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

Distance-regular graphs

NARCIS (Netherlands)

van Dam, Edwin R.; Koolen, Jack H.; Tanaka, Hajime

2016-01-01

This is a survey of distance-regular graphs. We present an introduction to distance-regular graphs for the reader who is unfamiliar with the subject, and then give an overview of some developments in the area of distance-regular graphs since the monograph 'BCN'[Brouwer, A.E., Cohen, A.M., Neumaier,

On the strong metric dimension of generalized butterfly graph, starbarbell graph, and {C}_{m}\\odot {P}_{n} graph

Science.gov (United States)

Yunia Mayasari, Ratih; Atmojo Kusmayadi, Tri

2018-04-01

Let G be a connected graph with vertex set V(G) and edge set E(G). For every pair of vertices u,v\\in V(G), the interval I[u, v] between u and v to be the collection of all vertices that belong to some shortest u ‑ v path. A vertex s\\in V(G) strongly resolves two vertices u and v if u belongs to a shortest v ‑ s path or v belongs to a shortest u ‑ s path. A vertex set S of G is a strong resolving set of G if every two distinct vertices of G are strongly resolved by some vertex of S. The strong metric basis of G is a strong resolving set with minimal cardinality. The strong metric dimension sdim(G) of a graph G is defined as the cardinality of strong metric basis. In this paper we determine the strong metric dimension of a generalized butterfly graph, starbarbell graph, and {C}mȯ {P}n graph. We obtain the strong metric dimension of generalized butterfly graph is sdim(BFn ) = 2n ‑ 2. The strong metric dimension of starbarbell graph is sdim(S{B}{m1,{m}2,\\ldots,{m}n})={\\sum }i=1n({m}i-1)-1. The strong metric dimension of {C}mȯ {P}n graph are sdim({C}mȯ {P}n)=2m-1 for m > 3 and n = 2, and sdim({C}mȯ {P}n)=2m-2 for m > 3 and n > 2.

Subgraph detection using graph signals

KAUST Repository

Chepuri, Sundeep Prabhakar

2017-03-06

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

Subgraph detection using graph signals

KAUST Repository

Chepuri, Sundeep Prabhakar; Leus, Geert

2017-01-01

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

Graph spectrum

NARCIS (Netherlands)

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

2012-01-01

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

Pragmatic Graph Rewriting Modifications

OpenAIRE

Rodgers, Peter; Vidal, Natalia

1999-01-01

We present new pragmatic constructs for easing programming in visual graph rewriting programming languages. The first is a modification to the rewriting process for nodes the host graph, where nodes specified as 'Once Only' in the LHS of a rewrite match at most once with a corresponding node in the host graph. This reduces the previously common use of tags to indicate the progress of matching in the graph. The second modification controls the application of LHS graphs, where those specified a...

Simplicial complexes of graphs

CERN Document Server

Jonsson, Jakob

2008-01-01

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

Spectral Imaging of Portolan Charts

Science.gov (United States)

France, Fenella G.; Wilson, Meghan A.; Ghez, Anita

2018-05-01

Spectral imaging of Portolan Charts, early nautical charts, provided extensive new information about their construction and creation. The origins of the portolan chart style have been a continual source of perplexity to numerous generations of cartographic historians. The spectral imaging system utilized incorporates a 50 megapixel mono-chrome camera with light emitting diode (LED) illumination panels that cover the range from 365 nm to 1050 nm to capture visible and non-visible information. There is little known about how portolan charts evolved, and what influenced their creation. These early nautical charts began as working navigational tools of medieval mariners, initially made in the 1300s in Italy, Portugal and Spain; however the origin and development of the portolan chart remained shrouded in mystery. Questions about these early navigational charts included whether colorants were commensurate with the time period and geographical location, and if different, did that give insight into trade routes, or possible later additions to the charts? For example; spectral data showed the red pigment on both the 1320 portolan chart and the 1565 Galapagos Islands matched vermillion, an opaque red pigment used since antiquity. The construction of these charts was also of great interest. Spectral imaging with a range of illumination modes revealed the presence of a "hidden circle" often referred to in relation to their construction. This paper will present in-depth analysis of how spectral imaging of the Portolans revealed similarities and differences, new hidden information and shed new light on construction and composition.

The STAPL Parallel Graph Library

KAUST Repository

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.

Topic Model for Graph Mining.

Science.gov (United States)

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.

Modern graph theory

CERN Document Server

Bollobás, Béla

1998-01-01

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

A graph edit dictionary for correcting errors in roof topology graphs reconstructed from point clouds

Science.gov (United States)

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.

AUTO-LAY: automatic layout generation for procedure flow diagrams

Energy Technology Data Exchange (ETDEWEB)

Forzano, P; Castagna, P [Ansaldo SpA, Genoa (Italy)

1996-12-31

Nuclear Power Plant Procedures can be seen from essentially two viewpoints: the process and the information management. From the first point of view, it is important to supply the knowledge apt to solve problems connected with the control of the process, from the second one the focus of attention is on the knowledge representation, its structure, elicitation and maintenance, formal quality assurance. These two aspects of procedure representation can be considered and solved separately. In particular, methodological, formal and management issues require long and tedious activities, that in most cases constitute a great barrier for procedures development and upgrade. To solve these problems, Ansaldo is developing DIAM, a wide integrated tool for procedure management to support in procedure writing, updating, usage and documentation. One of the most challenging features of DIAM is AUTO-LAY, a CASE sub-tool that, in a complete automatical way, structures parts or complete flow diagrams. This is a feature that is partially present in some other CASE products, that, anyway, do not allow complex graph handling and isomorphism between video and paper representation AUTO-LAY has the unique prerogative to draw graphs of any complexity, to section them in pages, and to automatically compose a document. This has been recognized in the literature as the most important second-generation CASE improvement. (author). 5 refs., 9 figs.

AUTO-LAY: automatic layout generation for procedure flow diagrams

International Nuclear Information System (INIS)

Forzano, P.; Castagna, P.

1995-01-01

Nuclear Power Plant Procedures can be seen from essentially two viewpoints: the process and the information management. From the first point of view, it is important to supply the knowledge apt to solve problems connected with the control of the process, from the second one the focus of attention is on the knowledge representation, its structure, elicitation and maintenance, formal quality assurance. These two aspects of procedure representation can be considered and solved separately. In particular, methodological, formal and management issues require long and tedious activities, that in most cases constitute a great barrier for procedures development and upgrade. To solve these problems, Ansaldo is developing DIAM, a wide integrated tool for procedure management to support in procedure writing, updating, usage and documentation. One of the most challenging features of DIAM is AUTO-LAY, a CASE sub-tool that, in a complete automatical way, structures parts or complete flow diagrams. This is a feature that is partially present in some other CASE products, that, anyway, do not allow complex graph handling and isomorphism between video and paper representation AUTO-LAY has the unique prerogative to draw graphs of any complexity, to section them in pages, and to automatically compose a document. This has been recognized in the literature as the most important second-generation CASE improvement. (author). 5 refs., 9 figs

Introduction to quantum graphs

CERN Document Server

Berkolaiko, Gregory

2012-01-01

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

Algorithmic phase diagrams

Science.gov (United States)

Hockney, Roger

1987-01-01

Algorithmic phase diagrams are a neat and compact representation of the results of comparing the execution time of several algorithms for the solution of the same problem. As an example, the recent results are shown of Gannon and Van Rosendale on the solution of multiple tridiagonal systems of equations in the form of such diagrams. The act of preparing these diagrams has revealed an unexpectedly complex relationship between the best algorithm and the number and size of the tridiagonal systems, which was not evident from the algebraic formulae in the original paper. Even so, for a particular computer, one diagram suffices to predict the best algorithm for all problems that are likely to be encountered the prediction being read directly from the diagram without complex calculation.

Graph Generator Survey

Energy Technology Data Exchange (ETDEWEB)

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.

Loose Graph Simulations

DEFF Research Database (Denmark)

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

Fractional smith chart theory

KAUST Repository

Shamim, Atif

2011-03-01

For the first time, a generalized Smith chart is introduced here to represent fractional order circuit elements. It is shown that the standard Smith chart is a special case of the generalized fractional order Smith chart. With illustrations drawn for both the conventional integer based lumped elements and the fractional elements, a graphical technique supported by the analytical method is presented to plot impedances on the fractional Smith chart. The concept is then applied towards impedance matching networks, where the fractional approach proves to be much more versatile and results in a single element matching network for a complex load as compared to the two elements in the conventional approach. © 2010 IEEE.

Autoregressive Moving Average Graph Filtering

OpenAIRE

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

On cyclic orthogonal double covers of circulant graphs by special infinite graphs

Directory of Open Access Journals (Sweden)

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.

INIS: Terminology charts

Energy Technology Data Exchange (ETDEWEB)

NONE

1970-08-01

This document is one in a series of publications known as the INIS Reference Series. It is to be used in conjunction with the INIS indexing manual and the INIS thesaurus for the preparation of input to the INIS database. The thesaurus and terminology charts in their first edition (Rev.0) were produced as the result of an agreement between the International Atomic Energy Agency (IAEA) and the European Atomic Energy Community (Euratom). Except for minor changes the terminology and the interrelationships between terms are those of the December 1969 edition of the Euratom Thesaurus. The purpose of the terminology harts is to display the descriptors of the thesaurus in the context of their hierarchical and other semantic relationships. Hierarchically related terms are grouped in clusters, each representing one of the principal concepts of a subject field. The descriptors are grouped around or under the broadest term of the clusters which is printed in upper case. The hierarchical relationships within the clusters are shown by the arrangement of the terms in smaller boxes within the larger boxes circumscribing the clusters. The clusters are connected by lines of various thickness, representing the other (mostly non-hierarchical) relationships. These connections are the equivalent to 'see also' and 'related term' cross-references. The thickness of the lines represents the strength of the semantic relations, or, in the practice of a retrieval system the probability that one term replacing a connected term in a query, will still yield pertinent references. The figures accompanying the descriptors represent their frequency of assignment to the first 987,000 documents stored in the Euratom system (May 1970). They are presented in order to show the relative importance of the descriptors within the subject field. The asterisks (*) accompanying descriptors in the charts refer to descriptors, for which a scope note can be found in the INIS: Thesaurus at the time the charts went

INIS: Terminology charts

International Nuclear Information System (INIS)

1970-08-01

This document is one in a series of publications known as the INIS Reference Series. It is to be used in conjunction with the INIS indexing manual and the INIS thesaurus for the preparation of input to the INIS database. The thesaurus and terminology charts in their first edition (Rev.0) were produced as the result of an agreement between the International Atomic Energy Agency (IAEA) and the European Atomic Energy Community (Euratom). Except for minor changes the terminology and the interrelationships between terms are those of the December 1969 edition of the Euratom Thesaurus. The purpose of the terminology harts is to display the descriptors of the thesaurus in the context of their hierarchical and other semantic relationships. Hierarchically related terms are grouped in clusters, each representing one of the principal concepts of a subject field. The descriptors are grouped around or under the broadest term of the clusters which is printed in upper case. The hierarchical relationships within the clusters are shown by the arrangement of the terms in smaller boxes within the larger boxes circumscribing the clusters. The clusters are connected by lines of various thickness, representing the other (mostly non-hierarchical) relationships. These connections are the equivalent to 'see also' and 'related term' cross-references. The thickness of the lines represents the strength of the semantic relations, or, in the practice of a retrieval system the probability that one term replacing a connected term in a query, will still yield pertinent references. The figures accompanying the descriptors represent their frequency of assignment to the first 987,000 documents stored in the Euratom system (May 1970). They are presented in order to show the relative importance of the descriptors within the subject field. The asterisks (*) accompanying descriptors in the charts refer to descriptors, for which a scope note can be found in the INIS: Thesaurus at the time the charts went

Analysis and Verification of Message Sequence Charts of Distributed Systems with the Help of Coloured Petri Nets

Directory of Open Access Journals (Sweden)

S. A. Chernenok

2014-01-01

Full Text Available The standard language of message sequence charts MSC is intended to describe scenarios of object interaction. Due to their expressiveness and simplicity MSC diagrams are widely used in practice at all stages of system design and development. In particular, the MSC language is used for describing communication behavior in distributed systems and communication protocols. In this paper the method for analysis and verification of MSC and HMSC diagrams is considered. The method is based on the translation of (HMSC into coloured Petri nets. The translation algorithms cover most standard elements of the MSC including data concepts. Size estimates of the CPN which is the result of the translation are given. Properties of the resulting CPN are analyzed and verified by using the known system CPN Tools and the CPN verifier based on the known tool SPIN. The translation method has been demonstrated by the example.

Quantum walks on quotient graphs

International Nuclear Information System (INIS)

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

Cell nuclei attributed relational graphs for efficient representation and classification of gastric cancer in digital histopathology

Science.gov (United States)

Sharma, Harshita; Zerbe, Norman; Heim, Daniel; Wienert, Stephan; Lohmann, Sebastian; Hellwich, Olaf; Hufnagl, Peter

2016-03-01

This paper describes a novel graph-based method for efficient representation and subsequent classification in histological whole slide images of gastric cancer. Her2/neu immunohistochemically stained and haematoxylin and eosin stained histological sections of gastric carcinoma are digitized. Immunohistochemical staining is used in practice by pathologists to determine extent of malignancy, however, it is laborious to visually discriminate the corresponding malignancy levels in the more commonly used haematoxylin and eosin stain, and this study attempts to solve this problem using a computer-based method. Cell nuclei are first isolated at high magnification using an automatic cell nuclei segmentation strategy, followed by construction of cell nuclei attributed relational graphs of the tissue regions. These graphs represent tissue architecture comprehensively, as they contain information about cell nuclei morphology as vertex attributes, along with knowledge of neighborhood in the form of edge linking and edge attributes. Global graph characteristics are derived and ensemble learning is used to discriminate between three types of malignancy levels, namely, non-tumor, Her2/neu positive tumor and Her2/neu negative tumor. Performance is compared with state of the art methods including four texture feature groups (Haralick, Gabor, Local Binary Patterns and Varma Zisserman features), color and intensity features, and Voronoi diagram and Delaunay triangulation. Texture, color and intensity information is also combined with graph-based knowledge, followed by correlation analysis. Quantitative assessment is performed using two cross validation strategies. On investigating the experimental results, it can be concluded that the proposed method provides a promising way for computer-based analysis of histopathological images of gastric cancer.

Fundamentals of algebraic graph transformation

CERN Document Server

Ehrig, Hartmut; Prange, Ulrike; Taentzer, Gabriele

2006-01-01

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

OAP- OFFICE AUTOMATION PILOT GRAPHICS DATABASE SYSTEM

Science.gov (United States)

Ackerson, T.

1994-01-01

The Office Automation Pilot (OAP) Graphics Database system offers the IBM PC user assistance in producing a wide variety of graphs and charts. OAP uses a convenient database system, called a chartbase, for creating and maintaining data associated with the charts, and twelve different graphics packages are available to the OAP user. Each of the graphics capabilities is accessed in a similar manner. The user chooses creation, revision, or chartbase/slide show maintenance options from an initial menu. The user may then enter or modify data displayed on a graphic chart. The cursor moves through the chart in a "circular" fashion to facilitate data entries and changes. Various "help" functions and on-screen instructions are available to aid the user. The user data is used to generate the graphics portion of the chart. Completed charts may be displayed in monotone or color, printed, plotted, or stored in the chartbase on the IBM PC. Once completed, the charts may be put in a vector format and plotted for color viewgraphs. The twelve graphics capabilities are divided into three groups: Forms, Structured Charts, and Block Diagrams. There are eight Forms available: 1) Bar/Line Charts, 2) Pie Charts, 3) Milestone Charts, 4) Resources Charts, 5) Earned Value Analysis Charts, 6) Progress/Effort Charts, 7) Travel/Training Charts, and 8) Trend Analysis Charts. There are three Structured Charts available: 1) Bullet Charts, 2) Organization Charts, and 3) Work Breakdown Structure (WBS) Charts. The Block Diagram available is an N x N Chart. Each graphics capability supports a chartbase. The OAP graphics database system provides the IBM PC user with an effective means of managing data which is best interpreted as a graphic display. The OAP graphics database system is written in IBM PASCAL 2.0 and assembler for interactive execution on an IBM PC or XT with at least 384K of memory, and a color graphics adapter and monitor. Printed charts require an Epson, IBM, OKIDATA, or HP Laser

Electronic diagrams

CERN Document Server

Colwell, Morris A

1976-01-01

Electronic Diagrams is a ready reference and general guide to systems and circuit planning and in the preparation of diagrams for both newcomers and the more experienced. This book presents guidelines and logical procedures that the reader can follow and then be equipped to tackle large complex diagrams by recognition of characteristic 'building blocks' or 'black boxes'. The goal is to break down many of the barriers that often seem to deter students and laymen in learning the art of electronics, especially when they take up electronics as a spare time occupation. This text is comprised of nin

Graph-based modelling in engineering

CERN Document Server

Rysiński, Jacek

2017-01-01

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

The Little-Hopfield model on a sparse random graph

International Nuclear Information System (INIS)

Castillo, I Perez; Skantzos, N S

2004-01-01

We study the Hopfield model on a random graph in scaling regimes where the average number of connections per neuron is a finite number and the spin dynamics is governed by a synchronous execution of the microscopic update rule (Little-Hopfield model). We solve this model within replica symmetry, and by using bifurcation analysis we prove that the spin-glass/paramagnetic and the retrieval/paramagnetic transition lines of our phase diagram are identical to those of sequential dynamics. The first-order retrieval/spin-glass transition line follows by direct evaluation of our observables using population dynamics. Within the accuracy of numerical precision and for sufficiently small values of the connectivity parameter we find that this line coincides with the corresponding sequential one. Comparison with simulation experiments shows excellent agreement

WWW chart of the nuclides

International Nuclear Information System (INIS)

Huang Xiaolong; Zhou Chunmei; Zhuang Youxiang; Zhao Zhixiang; Golashvili, T.V.; Chechev, V.P.

2000-01-01

WWW chart of the nuclides was established on the basis of the latest evaluations of nuclear structure and decay data. By viewing WWW chart of the nuclides, one can retrieve the fundamental data of nuclide such as atomic mass, abundance, spin and parity; the decay mode, branching ratio, half-life and Q-value of radioactive nuclide, energy and intensity of strong γ-ray, etc. The URL (Uniform Resource Locator) of WWW chart of the nuclides is: http://myhome.py.gd.cn/chart/index,asp

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

Science.gov (United States)

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

2013-02-01

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

Viral pathogenesis in diagrams

National Research Council Canada - National Science Library

Tremblay, Michel; Berthiaume, Laurent; Ackermann, Hans-Wolfgang

2001-01-01

.... The 268 diagrams in Viral Pathogenesis in Diagrams were selected from over 800 diagrams of English and French virological literature, including one derived from a famous drawing by Leonardo da Vinci...

Quality Control System using Simple Implementation of Seven Tools for Batik Textile Manufacturing

Science.gov (United States)

Ragil Suryoputro, Muhammad; Sugarindra, Muchamad; Erfaisalsyah, Hendy

2017-06-01

In order to produce better products and mitigate defect in products, every company must implement a quality control system. Company will find means to implement a quality control system that is capable and reliable. One of the methods is using the simple implementation of the seven tools in quality control defects. The case studied in this research was the level of disability xyz grey fabric on a shuttle loom 2 on the Batik manufacturing company. The seven tools that include: flowchart, check sheet, histogram, scatter diagram combined with control charts, Pareto diagrams and fishbone diagrams (causal diagram). Check sheet results obtained types of defects in the grey fabric was woven xyz is warp, double warp, the warp break, double warp, empty warp, warp tenuous, ugly edges, thick warp, and rust. Based on the analysis of control chart indicates that the process is out of control. This can be seen in the graph control where there is still a lot of outlier data. Based on a scatter diagram shows a positive correlation between the percentage of disability and the number of production. Based on Pareto diagram, repair needs priority is for the dominant type of defect is warp (44%) and based on double warp value histogram is also the highest with a value of 23635.11 m. In addition, based on the analysis of the factors causing defect by fishbone diagram double warp or other types of defects originating from the materials, methods, machines, measurements, man and environment. Thus the company can take to minimize the prevention and repair of defects and improve product quality.

STABILITY OF LINEAR MULTIAGENT SCALAR SYSTEMS AND ITS DEPENDENCE ON CONNECTIVITY GRAPH

Directory of Open Access Journals (Sweden)

S. I. Tomashevich

2014-03-01

Full Text Available Multiagent systems are now finding increasingly wide applications in various engineering fields such as energy, transportation, robotics, aviation and others. There are two main aspects to be focused on when organizing multiagent systems: the dynamics of the agents themselves and the ways of their interaction. This interaction is determined by the structure of information connections between agents. Thus, there are several key points of multiagent systems study: the dynamics of individual agents and shape of the information graph. Formation dynamics, in general, is determined by a set of properties of agents and connectivity graph. The paper deals with the relationship between dynamics of agents and Laplace matrix, which is used to set the graph connections. The present research is based on the results given in the known paper by A. Fax and R. Murray (IEEE Trans. AC, 2004. An illustrative example is given, and the application problem of studying the formation dynamics consisting of the group of quadrocopters is presented. Information exchange between agents is determined in the paper by means of the conventional set of graphs. The paper presents an interpretation of the stability conditions and the method of system performance improvement based on these conditions. Motion of quadrocopters group along the flight height is used as an example for methodology application. The simulation results demonstrate the basic dependencies between the information graph shape (and, consequently, the eigenvalues of the Laplacian, which describes this graph and formation stability. Simulation and consideration of Nyquist diagram connection with the key points give an indication of the system stability and take steps to change the control laws. Necessary conditions for the formation stability are obtained on the basis of this research method. Research result makes it possible to create local control laws for agents to ensure the stability of motion in the selected

Equipackable graphs

DEFF Research Database (Denmark)

Vestergaard, Preben Dahl; Hartnell, Bert L.

2006-01-01

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

Generalized connectivity of graphs

CERN Document Server

Li, Xueliang

2016-01-01

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

On two energy-like invariants of line graphs and related graph operations

Directory of Open Access Journals (Sweden)

Xiaodan Chen

2016-02-01

Full Text Available Abstract For a simple graph G of order n, let μ 1 ≥ μ 2 ≥ ⋯ ≥ μ n = 0 $\\mu_{1}\\geq\\mu_{2}\\geq\\cdots\\geq\\mu_{n}=0$ be its Laplacian eigenvalues, and let q 1 ≥ q 2 ≥ ⋯ ≥ q n ≥ 0 $q_{1}\\geq q_{2}\\geq\\cdots\\geq q_{n}\\geq0$ be its signless Laplacian eigenvalues. The Laplacian-energy-like invariant and incidence energy of G are defined as, respectively, LEL ( G = ∑ i = 1 n − 1 μ i and IE ( G = ∑ i = 1 n q i . $$\\mathit{LEL}(G=\\sum_{i=1}^{n-1}\\sqrt{ \\mu_{i}} \\quad\\mbox{and}\\quad \\mathit {IE}(G=\\sum_{i=1}^{n} \\sqrt{q_{i}}. $$ In this paper, we present some new upper and lower bounds on LEL and IE of line graph, subdivision graph, para-line graph and total graph of a regular graph, some of which improve previously known results. The main tools we use here are the Cauchy-Schwarz inequality and the Ozeki inequality.

Multivariate Statistical Process Control Charts: An Overview

OpenAIRE

Bersimis, Sotiris; Psarakis, Stelios; Panaretos, John

2006-01-01

In this paper we discuss the basic procedures for the implementation of multivariate statistical process control via control charting. Furthermore, we review multivariate extensions for all kinds of univariate control charts, such as multivariate Shewhart-type control charts, multivariate CUSUM control charts and multivariate EWMA control charts. In addition, we review unique procedures for the construction of multivariate control charts, based on multivariate statistical techniques such as p...

Price Competition on Graphs

OpenAIRE

Adriaan R. Soetevent

2010-01-01

This paper extends Hotelling's model of price competition with quadratic transportation costs from a line to graphs. I propose an algorithm to calculate firm-level demand for any given graph, conditional on prices and firm locations. One feature of graph models of price competition is that spatial discontinuities in firm-level demand may occur. I show that the existence result of D'Aspremont et al. (1979) does not extend to simple star graphs. I conjecture that this non-existence result holds...

Price Competition on Graphs

OpenAIRE

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

Skew-adjacency matrices of graphs

NARCIS (Netherlands)

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

Graph theory

CERN Document Server

Diestel, Reinhard

2017-01-01

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

Acyclicity in edge-colored graphs

DEFF Research Database (Denmark)

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

Graph Sampling for Covariance Estimation

KAUST Repository

Chepuri, Sundeep Prabhakar

2017-04-25

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

Price competition on graphs

NARCIS (Netherlands)

Soetevent, A.R.

2010-01-01

This paper extends Hotelling's model of price competition with quadratic transportation costs from a line to graphs. I propose an algorithm to calculate firm-level demand for any given graph, conditional on prices and firm locations. One feature of graph models of price competition is that spatial

The Hill Chart Calculation for Pelton Runner Models using the HydroHillChart - Pelton Module Software

Directory of Open Access Journals (Sweden)

Adelina Bostan

2015-07-01

Full Text Available The Pelton turbines industrial design is based on the hill chart characteristics obtained by measuring the models. Primary data measurements used to obtain the hill chart can be processed graphically, by hand or by using graphic programs respectively CAD programs; the HydroHillChart - Pelton module software is a specialized tool in achieving the hill chart, using interpolation cubic spline functions. Thereby, based on measurements of several models of Pelton turbines, a computerized library, used to design industrial Pelton turbines can be created. The paper presents the universal characteristics calculated by using the HydroHillChart - Pelton module software for a series of Pelton runners.

Graphing the order of the sexes: constructing, recalling, interpreting, and putting the self in gender difference graphs.

Science.gov (United States)

Hegarty, Peter; Lemieux, Anthony F; McQueen, Grant

2010-03-01

Graphs seem to connote facts more than words or tables do. Consequently, they seem unlikely places to spot implicit sexism at work. Yet, in 6 studies (N = 741), women and men constructed (Study 1) and recalled (Study 2) gender difference graphs with men's data first, and graphed powerful groups (Study 3) and individuals (Study 4) ahead of weaker ones. Participants who interpreted graph order as evidence of author "bias" inferred that the author graphed his or her own gender group first (Study 5). Women's, but not men's, preferences to graph men first were mitigated when participants graphed a difference between themselves and an opposite-sex friend prior to graphing gender differences (Study 6). Graph production and comprehension are affected by beliefs and suppositions about the groups represented in graphs to a greater degree than cognitive models of graph comprehension or realist models of scientific thinking have yet acknowledged.

Collective Rationality in Graph Aggregation

NARCIS (Netherlands)

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

GoFFish: A Sub-Graph Centric Framework for Large-Scale Graph Analytics1

Energy Technology Data Exchange (ETDEWEB)

Simmhan, Yogesh; Kumbhare, Alok; Wickramaarachchi, Charith; Nagarkar, Soonil; Ravi, Santosh; Raghavendra, Cauligi; Prasanna, Viktor

2014-08-25

Large scale graph processing is a major research area for Big Data exploration. Vertex centric programming models like Pregel are gaining traction due to their simple abstraction that allows for scalable execution on distributed systems naturally. However, there are limitations to this approach which cause vertex centric algorithms to under-perform due to poor compute to communication overhead ratio and slow convergence of iterative superstep. In this paper we introduce GoFFish a scalable sub-graph centric framework co-designed with a distributed persistent graph storage for large scale graph analytics on commodity clusters. We introduce a sub-graph centric programming abstraction that combines the scalability of a vertex centric approach with the flexibility of shared memory sub-graph computation. We map Connected Components, SSSP and PageRank algorithms to this model to illustrate its flexibility. Further, we empirically analyze GoFFish using several real world graphs and demonstrate its significant performance improvement, orders of magnitude in some cases, compared to Apache Giraph, the leading open source vertex centric implementation. We map Connected Components, SSSP and PageRank algorithms to this model to illustrate its flexibility. Further, we empirically analyze GoFFish using several real world graphs and demonstrate its significant performance improvement, orders of magnitude in some cases, compared to Apache Giraph, the leading open source vertex centric implementation.

Graph Theory. 1. Fragmentation of Structural Graphs

Directory of Open Access Journals (Sweden)

Lorentz JÄNTSCHI

2002-12-01

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

Model-Based Requirements Management in Gear Systems Design Based On Graph-Based Design Languages

Directory of Open Access Journals (Sweden)

Kevin Holder

2017-10-01

Full Text Available For several decades, a wide-spread consensus concerning the enormous importance of an in-depth clarification of the specifications of a product has been observed. A weak clarification of specifications is repeatedly listed as a main cause for the failure of product development projects. Requirements, which can be defined as the purpose, goals, constraints, and criteria associated with a product development project, play a central role in the clarification of specifications. The collection of activities which ensure that requirements are identified, documented, maintained, communicated, and traced throughout the life cycle of a system, product, or service can be referred to as “requirements engineering”. These activities can be supported by a collection and combination of strategies, methods, and tools which are appropriate for the clarification of specifications. Numerous publications describe the strategy and the components of requirements management. Furthermore, recent research investigates its industrial application. Simultaneously, promising developments of graph-based design languages for a holistic digital representation of the product life cycle are presented. Current developments realize graph-based languages by the diagrams of the Unified Modelling Language (UML, and allow the automatic generation and evaluation of multiple product variants. The research presented in this paper seeks to present a method in order to combine the advantages of a conscious requirements management process and graph-based design languages. Consequently, the main objective of this paper is the investigation of a model-based integration of requirements in a product development process by means of graph-based design languages. The research method is based on an in-depth analysis of an exemplary industrial product development, a gear system for so-called “Electrical Multiple Units” (EMU. Important requirements were abstracted from a gear system

Fiber-reinforced plastic composites. Possibilities and limitations of applications as machine-construction materials

Science.gov (United States)

Ophey, Lothar

1988-01-01

The use of fiber-reinforced composite structural materials in engineering applications is discussed in a survey of currently available technology and future prospects. The ongoing rapid growth in the use of these materials is described, and the criteria to be applied in selecting base materials, lamination schemes, fasteners, and processing methods are examined in detail and illustrated with graphs, diagrams, flow charts, and drawings. A description of a sample application (comparing the properties of steel, CFRP, SiC-reinforced Al, CFRP/steel, and CFRP/Al automobile piston rods) is included.

A binary-decision-diagram-based two-bit arithmetic logic unit on a GaAs-based regular nanowire network with hexagonal topology

International Nuclear Information System (INIS)

Zhao Hongquan; Kasai, Seiya; Shiratori, Yuta; Hashizume, Tamotsu

2009-01-01

A two-bit arithmetic logic unit (ALU) was successfully fabricated on a GaAs-based regular nanowire network with hexagonal topology. This fundamental building block of central processing units can be implemented on a regular nanowire network structure with simple circuit architecture based on graphical representation of logic functions using a binary decision diagram and topology control of the graph. The four-instruction ALU was designed by integrating subgraphs representing each instruction, and the circuitry was implemented by transferring the logical graph structure to a GaAs-based nanowire network formed by electron beam lithography and wet chemical etching. A path switching function was implemented in nodes by Schottky wrap gate control of nanowires. The fabricated circuit integrating 32 node devices exhibits the correct output waveforms at room temperature allowing for threshold voltage variation.

SMART AERONAUTICAL CHART MANAGEMENT SYSTEM DESIGN

Directory of Open Access Journals (Sweden)

M. E. Pakdil

2015-10-01

Full Text Available Civil aviation is developing rapidly, and the number of domestic and international operations is increasing exponentially every year than the previous one. Airline companies with increased air traffic and the number of passengers increase the demand of new aircrafts. An aircraft needs not only fuel but also pilot and aeronautical information (charts, digital navigation information, flight plan, and etc. to perform flight operation. One of the most important components in aeronautical information is the terminal chart. Authorized institution in every state is responsible to publish their terminal charts for certain periods. Although these charts are produced in accordance with ICAO’s Annex 4 and Annex 15, cartographic representation and page layout differs in each state’s publication. This situation makes difficult to read them by pilots. In this paper, standard instrument departure (SID charts are analysed to produce by use of cutting-edge and competitive technologies instead of classical computer-aided drawing and vector based graphic applications that are currently used by main chart producers. The goal is to design efficient and commercial chart management system that is able to produce aeronautical charts with same cartographic representation for all states.

Introductory graph theory

CERN Document Server

Chartrand, Gary

1984-01-01

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

Diagram, a Learning Environment for Initiation to Object-Oriented Modeling with UML Class Diagrams

Science.gov (United States)

Py, Dominique; Auxepaules, Ludovic; Alonso, Mathilde

2013-01-01

This paper presents Diagram, a learning environment for object-oriented modelling (OOM) with UML class diagrams. Diagram an open environment, in which the teacher can add new exercises without constraints on the vocabulary or the size of the diagram. The interface includes methodological help, encourages self-correcting and self-monitoring, and…

Informal networks: the company behind the chart.

Science.gov (United States)

Krackhardt, D; Hanson, J R

1993-01-01

A glance at an organizational chart can show who's the boss and who reports to whom. But this formal chart won't reveal which people confer on technical matters or discuss office politics over lunch. Much of the real work in any company gets done through this informal organization with its complex networks of relationships that cross functions and divisions. According to consultants David Krackhardt and Jeffrey Hanson, managers can harness the true power in their companies by diagramming three types of networks: the advice network, which reveals the people to whom others turn to get work done; the trust network, which uncovers who shares delicate information; and the communication network, which shows who talks about work-related matters. Using employee questionnaires, managers can generate network maps that will get to the root of many organizational problems. When a task force in a computer company, for example, was not achieving its goals, the CEO turned to network maps to find out why. He discovered that the task force leader was central in the advice network but marginal in the trust network. Task force members did not believe he would look out for their interests, so the CEO used the trust map to find someone to share responsibility for the group. And when a bank manager saw in the network map that there was little communication between tellers and supervisors, he looked for ways to foster interaction among employees of all levels. As companies continue to flatten and rely on teams, managers must rely less on their authority and more on understanding these informal networks. Managers who can use maps to identify, leverage, and revamp informal networks will have the key to success.

VennDiagram: a package for the generation of highly-customizable Venn and Euler diagrams in R

Directory of Open Access Journals (Sweden)

Boutros Paul C

2011-01-01

Full Text Available Abstract Background Visualization of orthogonal (disjoint or overlapping datasets is a common task in bioinformatics. Few tools exist to automate the generation of extensively-customizable, high-resolution Venn and Euler diagrams in the R statistical environment. To fill this gap we introduce VennDiagram, an R package that enables the automated generation of highly-customizable, high-resolution Venn diagrams with up to four sets and Euler diagrams with up to three sets. Results The VennDiagram package offers the user the ability to customize essentially all aspects of the generated diagrams, including font sizes, label styles and locations, and the overall rotation of the diagram. We have implemented scaled Venn and Euler diagrams, which increase graphical accuracy and visual appeal. Diagrams are generated as high-definition TIFF files, simplifying the process of creating publication-quality figures and easing integration with established analysis pipelines. Conclusions The VennDiagram package allows the creation of high quality Venn and Euler diagrams in the R statistical environment.

VennDiagram: a package for the generation of highly-customizable Venn and Euler diagrams in R.

Science.gov (United States)

Chen, Hanbo; Boutros, Paul C

2011-01-26

Visualization of orthogonal (disjoint) or overlapping datasets is a common task in bioinformatics. Few tools exist to automate the generation of extensively-customizable, high-resolution Venn and Euler diagrams in the R statistical environment. To fill this gap we introduce VennDiagram, an R package that enables the automated generation of highly-customizable, high-resolution Venn diagrams with up to four sets and Euler diagrams with up to three sets. The VennDiagram package offers the user the ability to customize essentially all aspects of the generated diagrams, including font sizes, label styles and locations, and the overall rotation of the diagram. We have implemented scaled Venn and Euler diagrams, which increase graphical accuracy and visual appeal. Diagrams are generated as high-definition TIFF files, simplifying the process of creating publication-quality figures and easing integration with established analysis pipelines. The VennDiagram package allows the creation of high quality Venn and Euler diagrams in the R statistical environment.

Creating more effective graphs

CERN Document Server

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

Graph Compression by BFS

Directory of Open Access Journals (Sweden)

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.

Introduction to Feynman diagrams

CERN Document Server

Bilenky, Samoil Mikhelevich

1974-01-01

Introduction to Feynman Diagrams provides Feynman diagram techniques and methods for calculating quantities measured experimentally. The book discusses topics Feynman diagrams intended for experimental physicists. Topics presented include methods for calculating the matrix elements (by perturbation theory) and the basic rules for constructing Feynman diagrams; techniques for calculating cross sections and polarizations; processes in which both leptons and hadrons take part; and the electromagnetic and weak form factors of nucleons. Experimental physicists and graduate students of physics will

Graphing Inequalities, Connecting Meaning

Science.gov (United States)

Switzer, J. Matt

2014-01-01

Students often have difficulty with graphing inequalities (see Filloy, Rojano, and Rubio 2002; Drijvers 2002), and J. Matt Switzer's students were no exception. Although students can produce graphs for simple inequalities, they often struggle when the format of the inequality is unfamiliar. Even when producing a correct graph of an…

Fuzzy Graph Language Recognizability

OpenAIRE

Kalampakas , Antonios; Spartalis , Stefanos; Iliadis , Lazaros

2012-01-01

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

Bell inequalities for graph states

International Nuclear Information System (INIS)

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

2005-01-01

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

Quantitative graph theory mathematical foundations and applications

CERN Document Server

Dehmer, Matthias

2014-01-01

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

Dynamic Representations of Sparse Graphs

DEFF Research Database (Denmark)

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

Spectral fluctuations of quantum graphs

International Nuclear Information System (INIS)

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

2014-01-01

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

Multiple graph regularized protein domain ranking.

Science.gov (United States)

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.

Acyclicity in edge-colored graphs

DEFF Research Database (Denmark)

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

ON BIPOLAR SINGLE VALUED NEUTROSOPHIC GRAPHS

OpenAIRE

Said Broumi; Mohamed Talea; Assia Bakali; Florentin Smarandache

2016-01-01

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

Practical graph mining with R

CERN Document Server

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

2014-01-01

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

A seminar on graph theory

CERN Document Server

Harary, Frank

2015-01-01

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

Diagrams benefit symbolic problem-solving.

Science.gov (United States)

Chu, Junyi; Rittle-Johnson, Bethany; Fyfe, Emily R

2017-06-01

The format of a mathematics problem often influences students' problem-solving performance. For example, providing diagrams in conjunction with story problems can benefit students' understanding, choice of strategy, and accuracy on story problems. However, it remains unclear whether providing diagrams in conjunction with symbolic equations can benefit problem-solving performance as well. We tested the impact of diagram presence on students' performance on algebra equation problems to determine whether diagrams increase problem-solving success. We also examined the influence of item- and student-level factors to test the robustness of the diagram effect. We worked with 61 seventh-grade students who had received 2 months of pre-algebra instruction. Students participated in an experimenter-led classroom session. Using a within-subjects design, students solved algebra problems in two matched formats (equation and equation-with-diagram). The presence of diagrams increased equation-solving accuracy and the use of informal strategies. This diagram benefit was independent of student ability and item complexity. The benefits of diagrams found previously for story problems generalized to symbolic problems. The findings are consistent with cognitive models of problem-solving and suggest that diagrams may be a useful additional representation of symbolic problems. © 2017 The British Psychological Society.

Uniform Single Valued Neutrosophic Graphs

Directory of Open Access Journals (Sweden)

S. Broumi

2017-09-01

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

Extremal graph theory

CERN Document Server

Bollobas, Bela

2004-01-01

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

Multiple graph regularized protein domain ranking

KAUST Repository

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

KAUST Repository

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

Directory of Open Access Journals (Sweden)

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.

Canonical Labelling of Site Graphs

Directory of Open Access Journals (Sweden)

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.

Control of control charts

NARCIS (Netherlands)

Sri Nurdiati, S.N.

2005-01-01

Although the Shewhart chart is widely used in practice because of its simplicity, applying this control chart to monitor the mean of a process may lead to two types of problems. The first concerns the typically unknown parameters involved in the distribution, while the second concerns the validity

International chart of the nuclides. 2001

International Nuclear Information System (INIS)

Golashvili, T.V.; Kupriyanov, V.M.; Lbov, A.A.

2002-01-01

The International Chart of Nuclides - 2001 has been developed taking into account the data obtained in 1998-2001. Unlike widespread nuclide charts the present Chart of Nuclides contains EVALUATED values of the main characteristics. These values are supplied with the standard deviations. (author)

Shewhart control charts in new perspective

NARCIS (Netherlands)

Albers, Willem/Wim; Kallenberg, W.C.M.

2007-01-01

The effects of estimating parameters and the violation of the assumption of normality when dealing with control charts are discussed. Corrections for estimating errors and extensions of the normal control chart to parametric and nonparametric charts are investigated. The underlying theory is

NNDC Chart of Nuclides

International Nuclear Information System (INIS)

Sonzogni, A.

2008-01-01

The National Nuclear Data Center has recently developed an interactive chart of nuclides, http://www.nndc.bnl.gov/chart/, that provides nuclear structure and decay data. Since its implementation, it has proven to be one of the most popular web products. The information presented is derived from the ENSDF and Nuclear Wallet Card databases. Experimentally known nuclides are represented by a cell in chart with the number of neutrons on the horizontal axis and the number of protons on the vertical axis. The color of the cell is used to indicate the ground state half-life or the ground state predominant decay mode. (author)

Flowcharting with D-charts

Science.gov (United States)

Meyer, D.

1985-01-01

A D-Chart is a style of flowchart using control symbols highly appropriate to modern structured programming languages. The intent of a D-Chart is to provide a clear and concise one-for-one mapping of control symbols to high-level language constructs for purposes of design and documentation. The notation lends itself to both high-level and code-level algorithmic description. The various issues that may arise when representing, in D-Chart style, algorithms expressed in the more popular high-level languages are addressed. In particular, the peculiarities of mapping control constructs for Ada, PASCAL, FORTRAN 77, C, PL/I, Jovial J73, HAL/S, and Algol are discussed.

Domination criticality in product graphs

Directory of Open Access Journals (Sweden)

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

Directory of Open Access Journals (Sweden)

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.

Graph Colouring Algorithms

DEFF Research Database (Denmark)

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

The fascinating world of graph theory

CERN Document Server

Benjamin, Arthur; Zhang, Ping

2015-01-01

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

Classical dynamics on graphs

International Nuclear Information System (INIS)

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

Optimizing UML Class Diagrams

Directory of Open Access Journals (Sweden)

Sergievskiy Maxim

2018-01-01

Full Text Available Most of object-oriented development technologies rely on the use of the universal modeling language UML; class diagrams play a very important role in the design process play, used to build a software system model. Modern CASE tools, which are the basic tools for object-oriented development, can’t be used to optimize UML diagrams. In this manuscript we will explain how, based on the use of design patterns and anti-patterns, class diagrams could be verified and optimized. Certain transformations can be carried out automatically; in other cases, potential inefficiencies will be indicated and recommendations given. This study also discusses additional CASE tools for validating and optimizing of UML class diagrams. For this purpose, a plugin has been developed that analyzes an XMI file containing a description of class diagrams.

Groupies in multitype random graphs

OpenAIRE

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.

Data report - charts and graphs

International Nuclear Information System (INIS)

Anon.

1995-01-01

This article is the summary report of uranium transactions. Specific data includes: (1) last month's deals, (2) uranium prices, both ranges and historical trends over twelve year period, and (3) SWU prices and ranges over a twelve year period

Quantum information processing with graph states

International Nuclear Information System (INIS)

Schlingemann, Dirk-Michael

2005-04-01

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

Fibonacci number of the tadpole graph

Directory of Open Access Journals (Sweden)

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.

On characterizing terrain visibility graphs

Directory of Open Access Journals (Sweden)

William Evans

2015-06-01

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

Network reconstruction via graph blending

Science.gov (United States)

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.

Interaction graphs

DEFF Research Database (Denmark)

Seiller, Thomas

2016-01-01

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

de Sitter relativity in static charts

Energy Technology Data Exchange (ETDEWEB)

Cotaescu, Ion I. [West University of Timisoara, Timisoara (Romania)

2018-02-15

The relative geodesic motion in static (and spherically symmetric) local charts on the (1 + 3)-dimensional de Sitter spacetimes is studied in terms of conserved quantities. The Lorentzian isometries are derived, relating the coordinates of the local chart of a fixed observer with the coordinates of a mobile chart considered as the rest frame of a massive particle freely moving on a timelike geodesic. The time dilation and Lorentz contraction are discussed pointing out some notable features of the de Sitter relativity in static charts. (orig.)

Groupies in multitype random graphs.

Science.gov (United States)

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.

The Harary index of a graph

CERN Document Server

Xu, Kexiang; Trinajstić, Nenad

2015-01-01

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

A Modal-Logic Based Graph Abstraction

NARCIS (Netherlands)

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

2008-01-01

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

Software tool for physics chart checks.

Science.gov (United States)

Li, H Harold; Wu, Yu; Yang, Deshan; Mutic, Sasa

2014-01-01

Physics chart check has long been a central quality assurance (QC) measure in radiation oncology. The purpose of this work is to describe a software tool that aims to accomplish simplification, standardization, automation, and forced functions in the process. Nationally recognized guidelines, including American College of Radiology and American Society for Radiation Oncology guidelines and technical standards, and the American Association of Physicists in Medicine Task Group reports were identified, studied, and summarized. Meanwhile, the reported events related to physics chart check service were analyzed using an event reporting and learning system. A number of shortfalls in the chart check process were identified. To address these problems, a software tool was designed and developed under Microsoft. Net in C# to hardwire as many components as possible at each stage of the process. The software consists of the following 4 independent modules: (1) chart check management; (2) pretreatment and during treatment chart check assistant; (3) posttreatment chart check assistant; and (4) quarterly peer-review management. The users were a large group of physicists in the author's radiation oncology clinic. During over 1 year of use the tool has proven very helpful in chart checking management, communication, documentation, and maintaining consistency. The software tool presented in this work aims to assist physicists at each stage of the physics chart check process. The software tool is potentially useful for any radiation oncology clinics that are either in the process of pursuing or maintaining the American College of Radiology accreditation.

Graph mining for next generation sequencing: leveraging the assembly graph for biological insights.

Science.gov (United States)

Warnke-Sommer, Julia; Ali, Hesham

2016-05-06

The assembly of Next Generation Sequencing (NGS) reads remains a challenging task. This is especially true for the assembly of metagenomics data that originate from environmental samples potentially containing hundreds to thousands of unique species. The principle objective of current assembly tools is to assemble NGS reads into contiguous stretches of sequence called contigs while maximizing for both accuracy and contig length. The end goal of this process is to produce longer contigs with the major focus being on assembly only. Sequence read assembly is an aggregative process, during which read overlap relationship information is lost as reads are merged into longer sequences or contigs. The assembly graph is information rich and capable of capturing the genomic architecture of an input read data set. We have developed a novel hybrid graph in which nodes represent sequence regions at different levels of granularity. This model, utilized in the assembly and analysis pipeline Focus, presents a concise yet feature rich view of a given input data set, allowing for the extraction of biologically relevant graph structures for graph mining purposes. Focus was used to create hybrid graphs to model metagenomics data sets obtained from the gut microbiomes of five individuals with Crohn's disease and eight healthy individuals. Repetitive and mobile genetic elements are found to be associated with hybrid graph structure. Using graph mining techniques, a comparative study of the Crohn's disease and healthy data sets was conducted with focus on antibiotics resistance genes associated with transposase genes. Results demonstrated significant differences in the phylogenetic distribution of categories of antibiotics resistance genes in the healthy and diseased patients. Focus was also evaluated as a pure assembly tool and produced excellent results when compared against the Meta-velvet, Omega, and UD-IDBA assemblers. Mining the hybrid graph can reveal biological phenomena captured

Stage line diagram: An age-conditional reference diagram for tracking development

NARCIS (Netherlands)

Buuren, S. van; Ooms, J.C.L.

2009-01-01

This paper presents a method for calculating stage line diagrams, a novel type of reference diagram useful for tracking developmental processes over time. Potential fields of applications include: dentistry (tooth eruption), oncology (tumor grading, cancer staging), virology (HIV infection and

Stage line diagram: an age-conditional reference diagram for tracking development.

NARCIS (Netherlands)

Van Buuren, S.; Ooms, J.C.L.

2009-01-01

This paper presents a method for calculating stage line diagrams, a novel type of reference diagram useful for tracking developmental processes over time. Potential fields of applications include: dentistry (tooth eruption), oncology (tumor grading, cancer staging), virology (HIV infection and

Distance-transitive graphs

NARCIS (Netherlands)

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

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

Science.gov (United States)

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

2016-01-01

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

Temporal Representation in Semantic Graphs

Energy Technology Data Exchange (ETDEWEB)

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.

Weighing Rain Gauge Recording Charts

Data.gov (United States)

National Oceanic and Atmospheric Administration, Department of Commerce — Weighing rain gauge charts record the amount of precipitation that falls at a given location. The vast majority of the Weighing Rain Gauge Recording Charts...

The complexity of the matching-cut problem for planar graphs and other graph classes

NARCIS (Netherlands)

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

PRIVATE GRAPHS – ACCESS RIGHTS ON GRAPHS FOR SEAMLESS NAVIGATION

Directory of Open Access Journals (Sweden)

W. Dorner

2016-06-01

Full Text Available After the success of GNSS (Global Navigational Satellite Systems and navigation services for public streets, indoor seems to be the next big development in navigational services, relying on RTLS – Real Time Locating Services (e.g. WIFI and allowing seamless navigation. In contrast to navigation and routing services on public streets, seamless navigation will cause an additional challenge: how to make routing data accessible to defined users or restrict access rights for defined areas or only to parts of the graph to a defined user group? The paper will present case studies and data from literature, where seamless and especially indoor navigation solutions are presented (hospitals, industrial complexes, building sites, but the problem of restricted access rights was only touched from a real world, but not a technical perspective. The analysis of case studies will show, that the objective of navigation and the different target groups for navigation solutions will demand well defined access rights and require solutions, how to make only parts of a graph to a user or application available to solve a navigational task. The paper will therefore introduce the concept of private graphs, which is defined as a graph for navigational purposes covering the street, road or floor network of an area behind a public street and suggest different approaches how to make graph data for navigational purposes available considering access rights and data protection, privacy and security issues as well.

Integer Flows and Circuit Covers of Graphs and Signed Graphs

Science.gov (United States)

Cheng, Jian

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

CERPHASE: Computer-generated phase diagrams

International Nuclear Information System (INIS)

Ruys, A.J.; Sorrell, C.C.; Scott, F.H.

1990-01-01

CERPHASE is a collection of computer programs written in the programming language basic and developed for the purpose of teaching the principles of phase diagram generation from the ideal solution model of thermodynamics. Two approaches are used in the generation of the phase diagrams: freezing point depression and minimization of the free energy of mixing. Binary and ternary phase diagrams can be generated as can diagrams containing the ideal solution parameters used to generate the actual phase diagrams. Since the diagrams generated utilize the ideal solution model, data input required from the operator is minimal: only the heat of fusion and melting point of each component. CERPHASE is menu-driven and user-friendly, containing simple instructions in the form of screen prompts as well as a HELP file to guide the operator. A second purpose of CERPHASE is in the prediction of phase diagrams in systems for which no experimentally determined phase diagrams are available, enabling the estimation of suitable firing or sintering temperatures for otherwise unknown systems. Since CERPHASE utilizes ideal solution theory, there are certain limitations imposed on the types of systems that can be predicted reliably. 6 refs., 13 refs

Port-Hamiltonian Systems on Open Graphs

NARCIS (Netherlands)

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

JaxoDraw: A graphical user interface for drawing Feynman diagrams. Version 2.0 release notes

Science.gov (United States)

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

Towards a theory of geometric graphs

CERN Document Server

Pach, Janos

2004-01-01

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

Quantum walk on a chimera graph

Science.gov (United States)

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.

Software for Graph Analysis and Visualization

Directory of Open Access Journals (Sweden)

M. I. Kolomeychenko

2014-01-01

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

Review of Designs for Haptic Data Visualization.

Science.gov (United States)

Paneels, Sabrina; Roberts, Jonathan C

2010-01-01

There are many different uses for haptics, such as training medical practitioners, teleoperation, or navigation of virtual environments. This review focuses on haptic methods that display data. The hypothesis is that haptic devices can be used to present information, and consequently, the user gains quantitative, qualitative, or holistic knowledge about the presented data. Not only is this useful for users who are blind or partially sighted (who can feel line graphs, for instance), but also the haptic modality can be used alongside other modalities, to increase the amount of variables being presented, or to duplicate some variables to reinforce the presentation. Over the last 20 years, a significant amount of research has been done in haptic data presentation; e.g., researchers have developed force feedback line graphs, bar charts, and other forms of haptic representations. However, previous research is published in different conferences and journals, with different application emphases. This paper gathers and collates these various designs to provide a comprehensive review of designs for haptic data visualization. The designs are classified by their representation: Charts, Maps, Signs, Networks, Diagrams, Images, and Tables. This review provides a comprehensive reference for researchers and learners, and highlights areas for further research.

NOAA Raster Navigational Charts (RNC)

Data.gov (United States)

National Oceanic and Atmospheric Administration, Department of Commerce — NOAA, National Ocean Service, Office of Coast Survey, Marine Chart Division is responsible to build and maintain a suite of more than 1000 nautical charts that are...

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

Science.gov (United States)

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

2018-01-01

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

Text-Filled Stacked Area Graphs

DEFF Research Database (Denmark)

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

Construction and validation of a Tamil logMAR chart.

Science.gov (United States)

Varadharajan, Srinivasa; Srinivasan, Krithica; Kumaresan, Brindha

2009-09-01

To design, construct and validate a new Tamil logMAR visual acuity chart based on current recommendations. Ten Tamil letters of equal legibility were identified experimentally and were used in the chart. Two charts, one internally illuminated and one externally illuminated, were constructed for testing at 4 m distance. The repeatability of the two charts was tested. For validation, the two charts were compared with a standard English logMAR chart (ETDRS). When compared to the ETDRS chart, a difference of 0.06 +/- 0.07 and 0.07 +/- 0.07 logMAR was found for the internally and externally illuminated charts respectively. Limits of agreement between the internally illuminated Tamil logMAR chart and ETDRS chart were found to be (-0.08, 0.19), and (-0.07, 0.20) for the externally illuminated chart. The test - retest results showed a difference of 0.02 +/- 0.04 and 0.02 +/- 0.06 logMAR for the internally and externally illuminated charts respectively. Limits of agreement for repeated measurements for the internally illuminated Tamil logMAR chart were found to be (-0.06, 0.10), and (-0.10, 0.14) for the externally illuminated chart. The newly constructed Tamil logMAR charts have good repeatability. The difference in visual acuity scores between the newly constructed Tamil logMAR chart and the standard English logMAR chart was within acceptable limits. This new chart can be used for measuring visual acuity in the literate Tamil population.

Para-equilibrium phase diagrams

International Nuclear Information System (INIS)

Pelton, Arthur D.; Koukkari, Pertti; Pajarre, Risto; Eriksson, Gunnar

2014-01-01

Highlights: • A rapidly cooled system may attain a state of para-equilibrium. • In this state rapidly diffusing elements reach equilibrium but others are immobile. • Application of the Phase Rule to para-equilibrium phase diagrams is discussed. • A general algorithm to calculate para-equilibrium phase diagrams is described. - Abstract: If an initially homogeneous system at high temperature is rapidly cooled, a temporary para-equilibrium state may result in which rapidly diffusing elements have reached equilibrium but more slowly diffusing elements have remained essentially immobile. The best known example occurs when homogeneous austenite is quenched. A para-equilibrium phase assemblage may be calculated thermodynamically by Gibbs free energy minimization under the constraint that the ratios of the slowly diffusing elements are the same in all phases. Several examples of calculated para-equilibrium phase diagram sections are presented and the application of the Phase Rule is discussed. Although the rules governing the geometry of these diagrams may appear at first to be somewhat different from those for full equilibrium phase diagrams, it is shown that in fact they obey exactly the same rules with the following provision. Since the molar ratios of non-diffusing elements are the same in all phases at para-equilibrium, these ratios act, as far as the geometry of the diagram is concerned, like “potential” variables (such as T, pressure or chemical potentials) rather than like “normal” composition variables which need not be the same in all phases. A general algorithm to calculate para-equilibrium phase diagrams is presented. In the limit, if a para-equilibrium calculation is performed under the constraint that no elements diffuse, then the resultant phase diagram shows the single phase with the minimum Gibbs free energy at any point on the diagram; such calculations are of interest in physical vapor deposition when deposition is so rapid that phase

On Graph Rewriting, Reduction and Evaluation

DEFF Research Database (Denmark)

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

Chart Series

Data.gov (United States)

U.S. Department of Health & Human Services — The Centers for Medicare and Medicaid Services (CMS) offers several different Chart Series with data on beneficiary health status, spending, operations, and quality...

Graph transformation tool contest 2008

NARCIS (Netherlands)

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

Indian Academy of Sciences (India)

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

Graphs with branchwidth at most three

NARCIS (Netherlands)

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

PLOT3D (version-5): a computer code for drawing three dimensional graphs, maps and histograms, in single or multiple colours, for mono or stereoscopic viewing

International Nuclear Information System (INIS)

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)

Planar graphs theory and algorithms

CERN Document Server

Nishizeki, T

1988-01-01

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

Graph Quasicontinuous Functions and Densely Continuous Forms

Directory of Open Access Journals (Sweden)

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.

CORECLUSTER: A Degeneracy Based Graph Clustering Framework

OpenAIRE

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

Sintering diagrams of UO2

International Nuclear Information System (INIS)

Mohan, A.; Soni, N.C.; Moorthy, V.K.

1979-01-01

Ashby's method (see Acta Met., vol. 22, p. 275, 1974) of constructing sintering diagrams has been modified to obtain contribution diagrams directly from the computer. The interplay of sintering variables and mechanisms are studied and the factors that affect the participation of mechanisms in UO 2 are determined. By studying the physical properties, it emerges that the order of inaccuracies is small in most cases and do not affect the diagrams. On the other hand, even a 10% error in activation energies, which is quite plausible, would make a significant difference to the diagram. The main criticism of Ashby's approach is that the numerous properties and equations used, communicate their inaccuracies to the diagrams and make them unreliable. The present study has considerably reduced the number of factors that need to be refined to make the sintering diagrams more meaningful. (Auth.)

Coloring sums of extensions of certain graphs

Directory of Open Access Journals (Sweden)

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.

On a conjecture concerning helly circle graphs

Directory of Open Access Journals (Sweden)

Durán Guillermo

2003-01-01

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

Guidelines for a graph-theoretic implementation of structural equation modeling

Science.gov (United States)

Grace, James B.; Schoolmaster, Donald R.; Guntenspergen, Glenn R.; Little, Amanda M.; Mitchell, Brian R.; Miller, Kathryn M.; Schweiger, E. William

2012-01-01

Structural equation modeling (SEM) is increasingly being chosen by researchers as a framework for gaining scientific insights from the quantitative analyses of data. New ideas and methods emerging from the study of causality, influences from the field of graphical modeling, and advances in statistics are expanding the rigor, capability, and even purpose of SEM. Guidelines for implementing the expanded capabilities of SEM are currently lacking. In this paper we describe new developments in SEM that we believe constitute a third-generation of the methodology. Most characteristic of this new approach is the generalization of the structural equation model as a causal graph. In this generalization, analyses are based on graph theoretic principles rather than analyses of matrices. Also, new devices such as metamodels and causal diagrams, as well as an increased emphasis on queries and probabilistic reasoning, are now included. Estimation under a graph theory framework permits the use of Bayesian or likelihood methods. The guidelines presented start from a declaration of the goals of the analysis. We then discuss how theory frames the modeling process, requirements for causal interpretation, model specification choices, selection of estimation method, model evaluation options, and use of queries, both to summarize retrospective results and for prospective analyses. The illustrative example presented involves monitoring data from wetlands on Mount Desert Island, home of Acadia National Park. Our presentation walks through the decision process involved in developing and evaluating models, as well as drawing inferences from the resulting prediction equations. In addition to evaluating hypotheses about the connections between human activities and biotic responses, we illustrate how the structural equation (SE) model can be queried to understand how interventions might take advantage of an environmental threshold to limit Typha invasions. The guidelines presented provide for

Optimization Problems on Threshold Graphs

Directory of Open Access Journals (Sweden)

Elena Nechita

2010-06-01

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

Hierarchy of modular graph identities

Energy Technology Data Exchange (ETDEWEB)

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.

Hierarchy of modular graph identities

International Nuclear Information System (INIS)

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.

Well-covered graphs and factors

DEFF Research Database (Denmark)

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

On the centrality of some graphs

Directory of Open Access Journals (Sweden)

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.

Feynman diagram drawing made easy

International Nuclear Information System (INIS)

Baillargeon, M.

1997-01-01

We present a drawing package optimised for Feynman diagrams. These can be constructed interactively with a mouse-driven graphical interface or from a script file, more suitable to work with a diagram generator. It provides most features encountered in Feynman diagrams and allows to modify every part of a diagram after its creation. Special attention has been paid to obtain a high quality printout as easily as possible. This package is written in Tcl/Tk and in C. (orig.)

Enabling Graph Appliance for Genome Assembly

Energy Technology Data Exchange (ETDEWEB)

Singh, Rina [ORNL; Graves, Jeffrey A [ORNL; Lee, Sangkeun (Matt) [ORNL; Sukumar, Sreenivas R [ORNL; Shankar, Mallikarjun [ORNL

2015-01-01

In recent years, there has been a huge growth in the amount of genomic data available as reads generated from various genome sequencers. The number of reads generated can be huge, ranging from hundreds to billions of nucleotide, each varying in size. Assembling such large amounts of data is one of the challenging computational problems for both biomedical and data scientists. Most of the genome assemblers developed have used de Bruijn graph techniques. A de Bruijn graph represents a collection of read sequences by billions of vertices and edges, which require large amounts of memory and computational power to store and process. This is the major drawback to de Bruijn graph assembly. Massively parallel, multi-threaded, shared memory systems can be leveraged to overcome some of these issues. The objective of our research is to investigate the feasibility and scalability issues of de Bruijn graph assembly on Cray s Urika-GD system; Urika-GD is a high performance graph appliance with a large shared memory and massively multithreaded custom processor designed for executing SPARQL queries over large-scale RDF data sets. However, to the best of our knowledge, there is no research on representing a de Bruijn graph as an RDF graph or finding Eulerian paths in RDF graphs using SPARQL for potential genome discovery. In this paper, we address the issues involved in representing a de Bruin graphs as RDF graphs and propose an iterative querying approach for finding Eulerian paths in large RDF graphs. We evaluate the performance of our implementation on real world ebola genome datasets and illustrate how genome assembly can be accomplished with Urika-GD using iterative SPARQL queries.

On 4-critical t-perfect graphs

OpenAIRE

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

Local adjacency metric dimension of sun graph and stacked book graph

Science.gov (United States)

Yulisda Badri, Alifiah; Darmaji

2018-03-01

A graph is a mathematical system consisting of a non-empty set of nodes and a set of empty sides. One of the topics to be studied in graph theory is the metric dimension. Application in the metric dimension is the navigation robot system on a path. Robot moves from one vertex to another vertex in the field by minimizing the errors that occur in translating the instructions (code) obtained from the vertices of that location. To move the robot must give different instructions (code). In order for the robot to move efficiently, the robot must be fast to translate the code of the nodes of the location it passes. so that the location vertex has a minimum distance. However, if the robot must move with the vertex location on a very large field, so the robot can not detect because the distance is too far.[6] In this case, the robot can determine its position by utilizing location vertices based on adjacency. The problem is to find the minimum cardinality of the required location vertex, and where to put, so that the robot can determine its location. The solution to this problem is the dimension of adjacency metric and adjacency metric bases. Rodrguez-Velzquez and Fernau combine the adjacency metric dimensions with local metric dimensions, thus becoming the local adjacency metric dimension. In the local adjacency metric dimension each vertex in the graph may have the same adjacency representation as the terms of the vertices. To obtain the local metric dimension of values in the graph of the Sun and the stacked book graph is used the construction method by considering the representation of each adjacent vertex of the graph.

On Effective Graphic Communication of Health Inequality: Considerations for Health Policy Researchers.

Science.gov (United States)

Asada, Yukiko; Abel, Hannah; Skedgel, Chris; Warner, Grace

2017-12-01

Policy Points: Effective graphs can be a powerful tool in communicating health inequality. The choice of graphs is often based on preferences and familiarity rather than science. According to the literature on graph perception, effective graphs allow human brains to decode visual cues easily. Dot charts are easier to decode than bar charts, and thus they are more effective. Dot charts are a flexible and versatile way to display information about health inequality. Consistent with the health risk communication literature, the captions accompanying health inequality graphs should provide a numerical, explicitly calculated description of health inequality, expressed in absolute and relative terms, from carefully thought-out perspectives. Graphs are an essential tool for communicating health inequality, a key health policy concern. The choice of graphs is often driven by personal preferences and familiarity. Our article is aimed at health policy researchers developing health inequality graphs for policy and scientific audiences and seeks to (1) raise awareness of the effective use of graphs in communicating health inequality; (2) advocate for a particular type of graph (ie, dot charts) to depict health inequality; and (3) suggest key considerations for the captions accompanying health inequality graphs. Using composite review methods, we selected the prevailing recommendations for improving graphs in scientific reporting. To find the origins of these recommendations, we reviewed the literature on graph perception and then applied what we learned to the context of health inequality. In addition, drawing from the numeracy literature in health risk communication, we examined numeric and verbal formats to explain health inequality graphs. Many disciplines offer commonsense recommendations for visually presenting quantitative data. The literature on graph perception, which defines effective graphs as those allowing the easy decoding of visual cues in human brains, shows

Radar Chart

Data.gov (United States)

National Oceanic and Atmospheric Administration, Department of Commerce — The Radar Chart collection is an archived product of summarized radar data. The geographic coverage is the 48 contiguous states of the United States. These hourly...

Mechatronic modeling and simulation using bond graphs

CERN Document Server

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

The Semiotic Structure of Geometry Diagrams: How Textbook Diagrams Convey Meaning

Science.gov (United States)

Dimmel, Justin K.; Herbst, Patricio G.

2015-01-01

Geometry diagrams use the visual features of specific drawn objects to convey meaning about generic mathematical entities. We examine the semiotic structure of these visual features in two parts. One, we conduct a semiotic inquiry to conceptualize geometry diagrams as mathematical texts that comprise choices from different semiotic systems. Two,…

Visualizing weighted networks: a performance comparison of adjacency matrices versus node-link diagrams

Science.gov (United States)

McIntire, John P.; Osesina, O. Isaac; Bartley, Cecilia; Tudoreanu, M. Eduard; Havig, Paul R.; Geiselman, Eric E.

2012-06-01

Ensuring the proper and effective ways to visualize network data is important for many areas of academia, applied sciences, the military, and the public. Fields such as social network analysis, genetics, biochemistry, intelligence, cybersecurity, neural network modeling, transit systems, communications, etc. often deal with large, complex network datasets that can be difficult to interact with, study, and use. There have been surprisingly few human factors performance studies on the relative effectiveness of different graph drawings or network diagram techniques to convey information to a viewer. This is particularly true for weighted networks which include the strength of connections between nodes, not just information about which nodes are linked to other nodes. We describe a human factors study in which participants performed four separate network analysis tasks (finding a direct link between given nodes, finding an interconnected node between given nodes, estimating link strengths, and estimating the most densely interconnected nodes) on two different network visualizations: an adjacency matrix with a heat-map versus a node-link diagram. The results should help shed light on effective methods of visualizing network data for some representative analysis tasks, with the ultimate goal of improving usability and performance for viewers of network data displays.

Expert interpretation of bar and line graphs: The role of graphicacy in reducing the effect of graph format.

Directory of Open Access Journals (Sweden)

David ePeebles

2015-10-01

Full Text Available The distinction between informational and computational equivalence of representations, first articulated by Larkin and Simon (1987 has been a fundamental principle in the analysis of diagrammatic reasoning which has been supported empirically on numerous occasions. We present an experiment that investigates this principle in relation to the performance of expert graph users of 2 x 2 'interaction' bar and line graphs. The study sought to determine whether expert interpretation is affected by graph format in the same way that novice interpretations are. The findings revealed that, unlike novices - and contrary to the assumptions of several graph comprehension models - experts' performance was the same for both graph formats, with their interpretation of bar graphs being no worse than that for line graphs. We discuss the implications of the study for guidelines for presenting such data and for models of expert graph comprehension.

Proving termination of graph transformation systems using weighted type graphs over semirings

NARCIS (Netherlands)

Bruggink, H.J.S.; König, B.; Nolte, D.; Zantema, H.; Parisi-Presicce, F.; Westfechtel, B.

2015-01-01

We introduce techniques for proving uniform termination of graph transformation systems, based on matrix interpretations for string rewriting. We generalize this technique by adapting it to graph rewriting instead of string rewriting and by generalizing to ordered semirings. In this way we obtain a

Open String Diagrams I: Topological Type

OpenAIRE

Nag, Subhashis; Sankaran, Parameswaran

1992-01-01

An arbitrary Feynman graph for string field theory interactions is analysed and the homeomorphism type of the corresponding world sheet surface is completely determined even in the non-orientable cases. Algorithms are found to mechanically compute the topological characteristics of the resulting surface from the structure of the signed oriented graph. Whitney's permutation-theoretic coding of graphs is utilized.

Italian cardiovascular mortality charts of the CUORE project: are they comparable with the SCORE charts?

LENUS (Irish Health Repository)

Donfrancesco, Chiara

2010-08-01

The aim of this study was to build risk charts for the assessment of cardiovascular mortality of the CUORE project, an Italian longitudinal study, and to compare them with the systematic coronary risk evaluation (SCORE) project charts for low risk European countries.

DIMENSI METRIK GRAPH LOBSTER Ln (q;r

Directory of Open Access Journals (Sweden)

PANDE GDE DONY GUMILAR

2013-05-01

Full Text Available The metric dimension of connected graph G is the cardinality of minimum resolving set in graph G. In this research, we study how to find the metric dimension of lobster graph Ln (q;r. Lobster graph Ln (q;r is a regular lobster graph with vertices backbone on the main path, every backbone vertex is connected to q hand vertices and every hand vertex is connected to r finger vertices, with n, q, r element of N. We obtain the metric dimension of lobster graph L2 (1;1 is 1, the metric dimension of lobster graph L2 (1;1 for n > 2 is 2.

Ring diagrams and phase transitions

International Nuclear Information System (INIS)

Takahashi, K.

1986-01-01

Ring diagrams at finite temperatures carry most infrared-singular parts among Feynman diagrams. Their effect to effective potentials are in general so significant that one must incorporate them as well as 1-loop diagrams. The author expresses these circumstances in some examples of supercooled phase transitions

Summary: beyond fault trees to fault graphs

International Nuclear Information System (INIS)

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

Interactive Graph Layout of a Million Nodes

Directory of Open Access Journals (Sweden)

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.

Eulerian Graphs and Related Topics

CERN Document Server

Fleischner, Herbert

1990-01-01

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

The One Universal Graph — a free and open graph database

Science.gov (United States)

Ng, Liang S.; Champion, Corbin

2016-02-01

Recent developments in graph database mostly are huge projects involving big organizations, big operations and big capital, as the name Big Data attests. We proposed the concept of One Universal Graph (OUG) which states that all observable and known objects and concepts (physical, conceptual or digitally represented) can be connected with only one single graph; furthermore the OUG can be implemented with a very simple text file format with free software, capable of being executed on Android or smaller devices. As such the One Universal Graph Data Exchange (GOUDEX) modules can potentially be installed on hundreds of millions of Android devices and Intel compatible computers shipped annually. Coupled with its open nature and ability to connect to existing leading search engines and databases currently in operation, GOUDEX has the potential to become the largest and a better interface for users and programmers to interact with the data on the Internet. With a Web User Interface for users to use and program in native Linux environment, Free Crowdware implemented in GOUDEX can help inexperienced users learn programming with better organized documentation for free software, and is able to manage programmer's contribution down to a single line of code or a single variable in software projects. It can become the first practically realizable “Internet brain” on which a global artificial intelligence system can be implemented. Being practically free and open, One Universal Graph can have significant applications in robotics, artificial intelligence as well as social networks.

The Conjugate Acid-Base Chart.

Science.gov (United States)

Treptow, Richard S.

1986-01-01

Discusses the difficulties that beginning chemistry students have in understanding acid-base chemistry. Describes the use of conjugate acid-base charts in helping students visualize the conjugate relationship. Addresses chart construction, metal ions, buffers and pH titrations, and the organic functional groups and nonaqueous solvents. (TW)

Degree-based graph construction

International Nuclear Information System (INIS)

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)

Stereo 3D spatial phase diagrams

Energy Technology Data Exchange (ETDEWEB)

Kang, Jinwu, E-mail: kangjw@tsinghua.edu.cn; Liu, Baicheng, E-mail: liubc@tsinghua.edu.cn

2016-07-15

Phase diagrams serve as the fundamental guidance in materials science and engineering. Binary P-T-X (pressure–temperature–composition) and multi-component phase diagrams are of complex spatial geometry, which brings difficulty for understanding. The authors constructed 3D stereo binary P-T-X, typical ternary and some quaternary phase diagrams. A phase diagram construction algorithm based on the calculated phase reaction data in PandaT was developed. And the 3D stereo phase diagram of Al-Cu-Mg ternary system is presented. These phase diagrams can be illustrated by wireframe, surface, solid or their mixture, isotherms and isopleths can be generated. All of these can be displayed by the three typical display ways: electronic shutter, polarization and anaglyph (for example red-cyan glasses). Especially, they can be printed out with 3D stereo effect on paper, and watched by the aid of anaglyph glasses, which makes 3D stereo book of phase diagrams come to reality. Compared with the traditional illustration way, the front of phase diagrams protrude from the screen and the back stretches far behind of the screen under 3D stereo display, the spatial structure can be clearly and immediately perceived. These 3D stereo phase diagrams are useful in teaching and research. - Highlights: • Stereo 3D phase diagram database was constructed, including binary P-T-X, ternary, some quaternary and real ternary systems. • The phase diagrams can be watched by active shutter or polarized or anaglyph glasses. • The print phase diagrams retains 3D stereo effect which can be achieved by the aid of anaglyph glasses.

Downhill Domination in Graphs

Directory of Open Access Journals (Sweden)

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

Subsampling for graph power spectrum estimation

KAUST Repository

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.

Proving relations between modular graph functions

International Nuclear Information System (INIS)

Basu, Anirban

2016-01-01

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

Subsampling for graph power spectrum estimation

KAUST Repository

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.

Semantic graphs and associative memories

Science.gov (United States)

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.

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

Directory of Open Access Journals (Sweden)

Namhee Kim

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

A generalization of total graphs

Indian Academy of Sciences (India)

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.

Decomposing a planar graph into an independent set and a 3-degenerate graph

DEFF Research Database (Denmark)

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

Commuting graphs of matrix algebras

International Nuclear Information System (INIS)

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)

Graph-theoretical concepts and physicochemical data

Directory of Open Access Journals (Sweden)

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.

Graphs whose complement and square are isomorphic

DEFF Research Database (Denmark)

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

Graphs & digraphs

CERN Document Server

Chartrand, Gary; Zhang, Ping

2010-01-01

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

Packing Degenerate Graphs Greedily

Czech Academy of Sciences Publication Activity Database

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

Continuous-time quantum walks on star graphs

International Nuclear Information System (INIS)

Salimi, S.

2009-01-01

In this paper, we investigate continuous-time quantum walk on star graphs. It is shown that quantum central limit theorem for a continuous-time quantum walk on star graphs for N-fold star power graph, which are invariant under the quantum component of adjacency matrix, converges to continuous-time quantum walk on K 2 graphs (complete graph with two vertices) and the probability of observing walk tends to the uniform distribution.

Tailored Random Graph Ensembles

International Nuclear Information System (INIS)

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.

The Smallest Valid Extension-Based Efficient, Rare Graph Pattern Mining, Considering Length-Decreasing Support Constraints and Symmetry Characteristics of Graphs

Directory of Open Access Journals (Sweden)

Unil Yun

2016-05-01

Full Text Available Frequent graph mining has been proposed to find interesting patterns (i.e., frequent sub-graphs from databases composed of graph transaction data, which can effectively express complex and large data in the real world. In addition, various applications for graph mining have been suggested. Traditional graph pattern mining methods use a single minimum support threshold factor in order to check whether or not mined patterns are interesting. However, it is not a sufficient factor that can consider valuable characteristics of graphs such as graph sizes and features of graph elements. That is, previous methods cannot consider such important characteristics in their mining operations since they only use a fixed minimum support threshold in the mining process. For this reason, in this paper, we propose a novel graph mining algorithm that can consider various multiple, minimum support constraints according to the types of graph elements and changeable minimum support conditions, depending on lengths of graph patterns. In addition, the proposed algorithm performs in mining operations more efficiently because it can minimize duplicated operations and computational overheads by considering symmetry features of graphs. Experimental results provided in this paper demonstrate that the proposed algorithm outperforms previous mining approaches in terms of pattern generation, runtime and memory usage.

Relating zeta functions of discrete and quantum graphs

Science.gov (United States)

Harrison, Jonathan; Weyand, Tracy

2018-02-01

We write the spectral zeta function of the Laplace operator on an equilateral metric graph in terms of the spectral zeta function of the normalized Laplace operator on the corresponding discrete graph. To do this, we apply a relation between the spectrum of the Laplacian on a discrete graph and that of the Laplacian on an equilateral metric graph. As a by-product, we determine how the multiplicity of eigenvalues of the quantum graph, that are also in the spectrum of the graph with Dirichlet conditions at the vertices, depends on the graph geometry. Finally we apply the result to calculate the vacuum energy and spectral determinant of a complete bipartite graph and compare our results with those for a star graph, a graph in which all vertices are connected to a central vertex by a single edge.

Air Emissions Sources, Charts and Maps

Data.gov (United States)

U.S. Environmental Protection Agency — Air Emissions provides (1) interactive charts supporting national, state, or county charts, (2) county maps of criteria air pollutant emissions for a state, and (3)...

The One Universal Graph — a free and open graph database

International Nuclear Information System (INIS)

Ng, Liang S.; Champion, Corbin

2016-01-01

Recent developments in graph database mostly are huge projects involving big organizations, big operations and big capital, as the name Big Data attests. We proposed the concept of One Universal Graph (OUG) which states that all observable and known objects and concepts (physical, conceptual or digitally represented) can be connected with only one single graph; furthermore the OUG can be implemented with a very simple text file format with free software, capable of being executed on Android or smaller devices. As such the One Universal Graph Data Exchange (GOUDEX) modules can potentially be installed on hundreds of millions of Android devices and Intel compatible computers shipped annually. Coupled with its open nature and ability to connect to existing leading search engines and databases currently in operation, GOUDEX has the potential to become the largest and a better interface for users and programmers to interact with the data on the Internet. With a Web User Interface for users to use and program in native Linux environment, Free Crowdware implemented in GOUDEX can help inexperienced users learn programming with better organized documentation for free software, and is able to manage programmer's contribution down to a single line of code or a single variable in software projects. It can become the first practically realizable “Internet brain” on which a global artificial intelligence system can be implemented. Being practically free and open, One Universal Graph can have significant applications in robotics, artificial intelligence as well as social networks. (paper)

Recognition of fractal graphs

NARCIS (Netherlands)

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

Automation of Feynman diagram evaluations

International Nuclear Information System (INIS)

Tentyukov, M.N.

1998-01-01

A C-program DIANA (DIagram ANAlyser) for the automation of Feynman diagram evaluations is presented. It consists of two parts: the analyzer of diagrams and the interpreter of a special text manipulating language. This language can be used to create a source code for analytical or numerical evaluations and to keep the control of the process in general

Interactive Graph Layout of a Million Nodes

OpenAIRE

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

Making SPC easier with zone control charts

International Nuclear Information System (INIS)

Lanning, B.

1995-01-01

The zone control chart is a simple, easy to learn statistical process control (SPC) tool that can be applied to any process where the data are normally distributed. Several Shewhart runs rules are incorporated into a simple scoring system, with a single rule to determine when a process is out of control. Zone charts have average run lengths (ARLs) for detecting shifts in the process mean which, for most cases, are uniformly better than the standard control charts. This paper presents the simplified methodology behind the zone control chart

RATGRAPH: Computer Graphing of Rational Functions.

Science.gov (United States)

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)

Introduction of quality management (1978)

International Nuclear Information System (INIS)

1978-03-01

This book indicates quality management explaining way of dealing data, population, sample and data, table of frequency distribution and histogram, data and qualification scale, process capability diagram cause and effect diagram, Parrot's diagram, and check sheet. It deals with control chart using of control chart, way to read the control chart, writing of control chart and sampling check such as application, sorts, use basic repairs of sampling check.

Graph algorithms in the titan toolkit.

Energy Technology Data Exchange (ETDEWEB)

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.

A Graph Calculus for Predicate Logic

Directory of Open Access Journals (Sweden)

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.

Deep Learning with Dynamic Computation Graphs

OpenAIRE

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

OpenAIRE

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

Quantum chaos on discrete graphs

International Nuclear Information System (INIS)

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.

Science.gov (United States)

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.

Bipartite separability and nonlocal quantum operations on graphs

Science.gov (United States)

Dutta, Supriyo; Adhikari, Bibhas; Banerjee, Subhashish; Srikanth, R.

2016-07-01

In this paper we consider the separability problem for bipartite quantum states arising from graphs. Earlier it was proved that the degree criterion is the graph-theoretic counterpart of the familiar positive partial transpose criterion for separability, although there are entangled states with positive partial transpose for which the degree criterion fails. Here we introduce the concept of partially symmetric graphs and degree symmetric graphs by using the well-known concept of partial transposition of a graph and degree criteria, respectively. Thus, we provide classes of bipartite separable states of dimension m ×n arising from partially symmetric graphs. We identify partially asymmetric graphs that lack the property of partial symmetry. We develop a combinatorial procedure to create a partially asymmetric graph from a given partially symmetric graph. We show that this combinatorial operation can act as an entanglement generator for mixed states arising from partially symmetric graphs.

Google Charts Testing | CRDI - Centre de recherches pour le ...

International Development Research Centre (IDRC) Digital Library (Canada)

Google Charts Testing. The following item is a demo of Google GeoChart. Please note that geo chart can only recognize country name or city name rather than location or address (that is google my map's expertise). Additionally, Geo chart does support title and legend. To render geo chart properly, please get a ...

Algorithms and Data Structures for Graphs

DEFF Research Database (Denmark)

Rotenberg, Eva

are planar graphs, which are those that can be drawn on a piece of paper without any pair of edges crossing. For planar graphs where each edge can only be traversed in one direction, a fundamental question is whether there is a route from vertex A to vertex B in the graph. We show how such a graph can...... of the form: "Is there an edge such that all paths between A and B go via that edge?" and which can quickly be updated when edges are inserted or deleted. We further show how to represent a planar graph such that we can quickly update our representation when an edge is deleted, and such that questions...

On the nullity number of graphs

Directory of Open Access Journals (Sweden)

Mustapha Aouchiche

2017-10-01

Full Text Available The paper discusses bounds on the nullity number of graphs. It is proved in [B. Cheng and B. Liu, On the nullity of graphs. Electron. J. Linear Algebra 16 (2007 60--67] that $\\eta \\le n - D$, where $\\eta$, n and D denote the nullity number, the order and the diameter of a connected graph, respectively. We first give a necessary condition on the extremal graphs corresponding to that bound, and then we strengthen the bound itself using the maximum clique number. In addition, we prove bounds on the nullity using the number of pendant neighbors in a graph. One of those bounds is an improvement of a known bound involving the domination number.

Graph Transforming Java Data

NARCIS (Netherlands)

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

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

Graph processing platforms at scale: practices and experiences

Energy Technology Data Exchange (ETDEWEB)

Lim, Seung-Hwan [ORNL; Lee, Sangkeun (Matt) [ORNL; Brown, Tyler C [ORNL; Sukumar, Sreenivas R [ORNL; Ganesh, Gautam [ORNL

2015-01-01

Graph analysis unveils hidden associations of data in many phenomena and artifacts, such as road network, social networks, genomic information, and scientific collaboration. Unfortunately, a wide diversity in the characteristics of graphs and graph operations make it challenging to find a right combination of tools and implementation of algorithms to discover desired knowledge from the target data set. This study presents an extensive empirical study of three representative graph processing platforms: Pegasus, GraphX, and Urika. Each system represents a combination of options in data model, processing paradigm, and infrastructure. We benchmarked each platform using three popular graph operations, degree distribution, connected components, and PageRank over a variety of real-world graphs. Our experiments show that each graph processing platform shows different strength, depending the type of graph operations. While Urika performs the best in non-iterative operations like degree distribution, GraphX outputforms iterative operations like connected components and PageRank. In addition, we discuss challenges to optimize the performance of each platform over large scale real world graphs.

Generalized hypercube graph $\\Q_n(S$, graph products and self-orthogonal codes

Directory of Open Access Journals (Sweden)

Pani Seneviratne

2016-01-01

Full Text Available A generalized hypercube graph $\\Q_n(S$ has $\\F_{2}^{n}=\\{0,1\\}^n$ as the vertex set and two vertices being adjacent whenever their mutual Hamming distance belongs to $S$, where $n \\ge 1$ and $S\\subseteq \\{1,2,\\ldots, n\\}$. The graph $\\Q_n(\\{1\\}$ is the $n$-cube, usually denoted by $\\Q_n$.We study graph boolean products $G_1 = \\Q_n(S\\times \\Q_1, G_2 = \\Q_{n}(S\\wedge \\Q_1$, $G_3 = \\Q_{n}(S[\\Q_1]$ and show that binary codes from neighborhood designs of $G_1, G_2$ and $G_3$ are self-orthogonal for all choices of $n$ and $S$. More over, we show that the class of codes $C_1$ are self-dual. Further we find subgroups of the automorphism group of these graphs and use these subgroups to obtain PD-sets for permutation decoding. As an example we find a full error-correcting PD set for the binary $[32, 16, 8]$ extremal self-dual code.

NOAA Seamless Raster Navigational Charts (RNC)

Data.gov (United States)

National Oceanic and Atmospheric Administration, Department of Commerce — The NOAA Seamless Raster Chart Server provides a seamless collarless mosaic of the NOAA Raster Navigational Charts (RNC). The RNC are a collection of approximately...

Survey of Approaches to Generate Realistic Synthetic Graphs

Energy Technology Data Exchange (ETDEWEB)

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

2016-10-01

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

Constructing Dense Graphs with Unique Hamiltonian Cycles

Science.gov (United States)

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…

Chromatic polynomials of random graphs

International Nuclear Information System (INIS)

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

2010-01-01

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

On some labelings of triangular snake and central graph of triangular snake graph

Science.gov (United States)

Agasthi, P.; Parvathi, N.

2018-04-01

A Triangular snake Tn is obtained from a path u 1 u 2 … u n by joining ui and u i+1 to a new vertex wi for 1≤i≤n‑1. A Central graph of Triangular snake C(T n ) is obtained by subdividing each edge of Tn exactly once and joining all the non adjacent vertices of Tn . In this paper the ways to construct square sum, square difference, Root Mean square, strongly Multiplicative, Even Mean and Odd Mean labeling for Triangular Snake and Central graph of Triangular Snake graphs are reported.

Orientations of infinite graphs with prescribed edge-connectivity

DEFF Research Database (Denmark)

Thomassen, Carsten

2016-01-01

We prove a decomposition result for locally finite graphs which can be used to extend results on edge-connectivity from finite to infinite graphs. It implies that every 4k-edge-connected graph G contains an immersion of some finite 2k-edge-connected Eulerian graph containing any prescribed vertex...... set (while planar graphs show that G need not containa subdivision of a simple finite graph of large edge-connectivity). Also, every 8k-edge connected infinite graph has a k-arc-connected orientation, as conjectured in 1989....

Genus Ranges of 4-Regular Rigid Vertex Graphs.

Science.gov (United States)

Buck, Dorothy; Dolzhenko, Egor; Jonoska, Nataša; Saito, Masahico; Valencia, Karin

2015-01-01

A rigid vertex of a graph is one that has a prescribed cyclic order of its incident edges. We study orientable genus ranges of 4-regular rigid vertex graphs. The (orientable) genus range is a set of genera values over all orientable surfaces into which a graph is embedded cellularly, and the embeddings of rigid vertex graphs are required to preserve the prescribed cyclic order of incident edges at every vertex. The genus ranges of 4-regular rigid vertex graphs are sets of consecutive integers, and we address two questions: which intervals of integers appear as genus ranges of such graphs, and what types of graphs realize a given genus range. For graphs with 2 n vertices ( n > 1), we prove that all intervals [ a, b ] for all a genus ranges. For graphs with 2 n - 1 vertices ( n ≥ 1), we prove that all intervals [ a, b ] for all a genus ranges. We also provide constructions of graphs that realize these ranges.

A new cluster algorithm for graphs

NARCIS (Netherlands)

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

VennDiagramWeb: a web application for the generation of highly customizable Venn and Euler diagrams.

Science.gov (United States)

Lam, Felix; Lalansingh, Christopher M; Babaran, Holly E; Wang, Zhiyuan; Prokopec, Stephenie D; Fox, Natalie S; Boutros, Paul C

2016-10-03

Visualization of data generated by high-throughput, high-dimensionality experiments is rapidly becoming a rate-limiting step in computational biology. There is an ongoing need to quickly develop high-quality visualizations that can be easily customized or incorporated into automated pipelines. This often requires an interface for manual plot modification, rapid cycles of tweaking visualization parameters, and the generation of graphics code. To facilitate this process for the generation of highly-customizable, high-resolution Venn and Euler diagrams, we introduce VennDiagramWeb: a web application for the widely used VennDiagram R package. VennDiagramWeb is hosted at http://venndiagram.res.oicr.on.ca/ . VennDiagramWeb allows real-time modification of Venn and Euler diagrams, with parameter setting through a web interface and immediate visualization of results. It allows customization of essentially all aspects of figures, but also supports integration into computational pipelines via download of R code. Users can upload data and download figures in a range of formats, and there is exhaustive support documentation. VennDiagramWeb allows the easy creation of Venn and Euler diagrams for computational biologists, and indeed many other fields. Its ability to support real-time graphics changes that are linked to downloadable code that can be integrated into automated pipelines will greatly facilitate the improved visualization of complex datasets. For application support please contact Paul.Boutros@oicr.on.ca.

Chemical Graph Transformation with Stereo-Information

DEFF Research Database (Denmark)

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

2017-01-01

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

Large-Scale Graph Processing Using Apache Giraph

KAUST Repository

Sakr, Sherif

2017-01-07

This book takes its reader on a journey through Apache Giraph, a popular distributed graph processing platform designed to bring the power of big data processing to graph data. Designed as a step-by-step self-study guide for everyone interested in large-scale graph processing, it describes the fundamental abstractions of the system, its programming models and various techniques for using the system to process graph data at scale, including the implementation of several popular and advanced graph analytics algorithms.

Large-Scale Graph Processing Using Apache Giraph

KAUST Repository

Sakr, Sherif; Orakzai, Faisal Moeen; Abdelaziz, Ibrahim; Khayyat, Zuhair

2017-01-01

This book takes its reader on a journey through Apache Giraph, a popular distributed graph processing platform designed to bring the power of big data processing to graph data. Designed as a step-by-step self-study guide for everyone interested in large-scale graph processing, it describes the fundamental abstractions of the system, its programming models and various techniques for using the system to process graph data at scale, including the implementation of several popular and advanced graph analytics algorithms.

Graph Algorithm Animation with Grrr

OpenAIRE

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

Genus Ranges of Chord Diagrams.

Science.gov (United States)

Burns, Jonathan; Jonoska, Nataša; Saito, Masahico

2015-04-01

A chord diagram consists of a circle, called the backbone, with line segments, called chords, whose endpoints are attached to distinct points on the circle. The genus of a chord diagram is the genus of the orientable surface obtained by thickening the backbone to an annulus and attaching bands to the inner boundary circle at the ends of each chord. Variations of this construction are considered here, where bands are possibly attached to the outer boundary circle of the annulus. The genus range of a chord diagram is the genus values over all such variations of surfaces thus obtained from a given chord diagram. Genus ranges of chord diagrams for a fixed number of chords are studied. Integer intervals that can be, and those that cannot be, realized as genus ranges are investigated. Computer calculations are presented, and play a key role in discovering and proving the properties of genus ranges.

My Bar Graph Tells a Story

Science.gov (United States)

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…

An intersection graph of straight lines

DEFF Research Database (Denmark)

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

Trajectories entropy in dynamical graphs with memory

Directory of Open Access Journals (Sweden)

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.

On revealing graph cycles via boundary measurements

International Nuclear Information System (INIS)

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)

OPEX: Optimized Eccentricity Computation in Graphs

Energy Technology Data Exchange (ETDEWEB)

Henderson, Keith [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)

2011-11-14

Real-world graphs have many properties of interest, but often these properties are expensive to compute. We focus on eccentricity, radius and diameter in this work. These properties are useful measures of the global connectivity patterns in a graph. Unfortunately, computing eccentricity for all nodes is O(n2) for a graph with n nodes. We present OPEX, a novel combination of optimizations which improves computation time of these properties by orders of magnitude in real-world experiments on graphs of many different sizes. We run OPEX on graphs with up to millions of links. OPEX gives either exact results or bounded approximations, unlike its competitors which give probabilistic approximations or sacrifice node-level information (eccentricity) to compute graphlevel information (diameter).

Pixels to Graphs by Associative Embedding

KAUST Repository

Newell, Alejandro

2017-06-22

Graphs are a useful abstraction of image content. Not only can graphs represent details about individual objects in a scene but they can capture the interactions between pairs of objects. We present a method for training a convolutional neural 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 together. We benchmark on the Visual Genome dataset, and report a Recall@50 of 9.7% compared to the prior state-of-the-art at 3.4%, a nearly threefold improvement on the challenging task of scene graph generation.

A faithful functor among algebras and graphs

OpenAIRE

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.

prepare_taxa_charts.py: A Python program to automate generation of publication ready taxonomic pie chart images from QIIME.

Science.gov (United States)

Lakhujani, Vijay; Badapanda, Chandan

2017-06-01

QIIME (Quantitative Insights Into Microbial Ecology) is one of the most popular open-source bioinformatics suite for performing metagenome, 16S rRNA amplicon and Internal Transcribed Spacer (ITS) data analysis. Although, it is very comprehensive and powerful tool, it lacks a method to provide publication ready taxonomic pie charts. The script plot_taxa_summary . py bundled with QIIME generate a html file and a folder containing taxonomic pie chart and legend as separate images. The images have randomly generated alphanumeric names. Therefore, it is difficult to associate the pie chart with the legend and the corresponding sample identifier. Even if the option to have the legend within the html file is selected while executing plot_taxa_summary . py , it is very tedious to crop a complete image (having both the pie chart and the legend) due to unequal image sizes. It requires a lot of time to manually prepare the pie charts for multiple samples for publication purpose. Moreover, there are chances of error while identifying the pie chart and legend pair due to random alphanumeric names of the images. To bypass all these bottlenecks and make this process efficient, we have developed a python based program, prepare_taxa_charts . py , to automate the renaming, cropping and merging of taxonomic pie chart and corresponding legend image into a single, good quality publication ready image. This program not only augments the functionality of plot_taxa_summary . py but is also very fast in terms of CPU time and user friendly.

Cellular Automata on Graphs: Topological Properties of ER Graphs Evolved towards Low-Entropy Dynamics

Directory of Open Access Journals (Sweden)

Marc-Thorsten Hütt

2012-06-01

Full Text Available Cellular automata (CA are a remarkably  efficient tool for exploring general properties of complex systems and spatiotemporal patterns arising from local rules. Totalistic cellular automata,  where the update  rules depend  only on the density of neighboring states, are at the same time a versatile  tool for exploring  dynamical  processes on graphs. Here we briefly review our previous results on cellular automata on graphs, emphasizing some systematic relationships between network architecture and dynamics identified in this way. We then extend the investigation  towards graphs obtained in a simulated-evolution procedure, starting from Erdő s–Rényi (ER graphs and selecting for low entropies of the CA dynamics. Our key result is a strong association of low Shannon entropies with a broadening of the graph’s degree distribution.

The color space of a graph

DEFF Research Database (Denmark)

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

Forbidden Structures for Planar Perfect Consecutively Colourable Graphs

Directory of Open Access Journals (Sweden)

Borowiecka-Olszewska Marta

2017-05-01

Full Text Available A consecutive colouring of a graph is a proper edge colouring with posi- tive integers in which the colours of edges incident with each vertex form an interval of integers. The idea of this colouring was introduced in 1987 by Asratian and Kamalian under the name of interval colouring. Sevast- janov showed that the corresponding decision problem is NP-complete even restricted to the class of bipartite graphs. We focus our attention on the class of consecutively colourable graphs whose all induced subgraphs are consecutively colourable, too. We call elements of this class perfect consecutively colourable to emphasise the conceptual similarity to perfect graphs. Obviously, the class of perfect consecutively colourable graphs is induced hereditary, so it can be characterized by the family of induced forbidden graphs. In this work we give a necessary and sufficient conditions that must be satisfied by the generalized Sevastjanov rosette to be an induced forbid- den graph for the class of perfect consecutively colourable graphs. Along the way, we show the exact values of the deficiency of all generalized Sevastjanov rosettes, which improves the earlier known estimating result. It should be mentioned that the deficiency of a graph measures its closeness to the class of consecutively colourable graphs. We motivate the investigation of graphs considered here by showing their connection to the class of planar perfect consecutively colourable graphs.

47 CFR 80.761 - Conversion graphs.

Science.gov (United States)

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

Building Scalable Knowledge Graphs for Earth Science

Science.gov (United States)

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.

Chart Audit and Chart Stimulated Recall as Methods of Needs Assessment in Continuing Professional Health Education.

Science.gov (United States)

Affleck, Louise; Jennett, Penny

1998-01-01

Chart audit (assessment of patient medical records) is a cost-effective continuing-education needs-assessment method. Chart stimulated recall, in which physicians' memory of particular cases is stimulated by records, potentially increases content validity and exploration of clinical reasoning as well as the context of clinical decisions. (SK)

On the diameter of dot-critical graphs

Directory of Open Access Journals (Sweden)

Doost Ali Mojdeh

2009-01-01

Full Text Available A graph G is \\(k\\-dot-critical (totaly \\(k\\-dot-critical if \\(G\\ is dot-critical (totaly dot-critical and the domination number is \\(k\\. In the paper [T. Burtona, D. P. Sumner, Domination dot-critical graphs, Discrete Math, 306 (2006, 11-18] the following question is posed: What are the best bounds for the diameter of a \\(k\\-dot-critical graph and a totally \\(k\\-dot-critical graph \\(G\\ with no critical vertices for \\(k \\geq 4\\? We find the best bound for the diameter of a \\(k\\-dot-critical graph, where \\(k \\in\\{4,5,6\\}\\ and we give a family of \\(k\\-dot-critical graphs (with no critical vertices with sharp diameter \\(2k-3\\ for even \\(k \\geq 4\\.

Collaborative diagramming during problem based learning in medical education: Do computerized diagrams support basic science knowledge construction?

Science.gov (United States)

De Leng, Bas; Gijlers, Hannie

2015-05-01

To examine how collaborative diagramming affects discussion and knowledge construction when learning complex basic science topics in medical education, including its effectiveness in the reformulation phase of problem-based learning. Opinions and perceptions of students (n = 70) and tutors (n = 4) who used collaborative diagramming in tutorial groups were collected with a questionnaire and focus group discussions. A framework derived from the analysis of discourse in computer-supported collaborative leaning was used to construct the questionnaire. Video observations were used during the focus group discussions. Both students and tutors felt that collaborative diagramming positively affected discussion and knowledge construction. Students particularly appreciated that diagrams helped them to structure knowledge, to develop an overview of topics, and stimulated them to find relationships between topics. Tutors emphasized that diagramming increased interaction and enhanced the focus and detail of the discussion. Favourable conditions were the following: working with a shared whiteboard, using a diagram format that facilitated distribution, and applying half filled-in diagrams for non-content expert tutors and\\or for heterogeneous groups with low achieving students. The empirical findings in this study support the findings of earlier more descriptive studies that diagramming in a collaborative setting is valuable for learning complex knowledge in medicine.

Qualities of dental chart recording and coding.

Science.gov (United States)

Chantravekin, Yosananda; Tasananutree, Munchulika; Santaphongse, Supitcha; Aittiwarapoj, Anchisa

2013-01-01

Chart recording and coding are the important processes in the healthcare informatics system, but there were only a few reports in the dentistry field. The objectives of this study are to study the qualities of dental chart recording and coding, as well as the achievement of lecture/workshop on this topic. The study was performed by auditing the patient's charts at the TU Dental Student Clinic from July 2011-August 2012. The chart recording mean scores ranged from 51.0-55.7%, whereas the errors in the coding process were presented in the coder part more than the doctor part. The lecture/workshop could improve the scores only in some topics.

graphkernels: R and Python packages for graph comparison.

Science.gov (United States)

Sugiyama, Mahito; Ghisu, M Elisabetta; Llinares-López, Felipe; Borgwardt, Karsten

2018-02-01

Measuring the similarity of graphs is a fundamental step in the analysis of graph-structured data, which is omnipresent in computational biology. Graph kernels have been proposed as a powerful and efficient approach to this problem of graph comparison. Here we provide graphkernels, the first R and Python graph kernel libraries including baseline kernels such as label histogram based kernels, classic graph kernels such as random walk based kernels, and the state-of-the-art Weisfeiler-Lehman graph kernel. The core of all graph kernels is implemented in C ++ for efficiency. Using the kernel matrices computed by the package, we can easily perform tasks such as classification, regression and clustering on graph-structured samples. The R and Python packages including source code are available at https://CRAN.R-project.org/package=graphkernels and https://pypi.python.org/pypi/graphkernels. mahito@nii.ac.jp or elisabetta.ghisu@bsse.ethz.ch. Supplementary data are available online at Bioinformatics. © The Author(s) 2017. Published by Oxford University Press.

The making of Andersen’s liquefaction chart

OpenAIRE

Sabaliauskas, Tomas; Ibsen, Lars Bo

2017-01-01

Andersen’s chart (Andersen & Berre, 1999) is a graphical method of observing cyclic soil response. It allows observing soil response to various stress amplitudes that can lead to liquefaction, excess plastic deformation stabilizing soil response.The process of obtaining the original chart has been improved. Algorithm based approximation is introduced. Pore pressure dependent ultimate bearing capacity normalization factor is introduced to normalize the chart.

Comparison of reading speed with 3 different log-scaled reading charts.

Science.gov (United States)

Buari, Noor Halilah; Chen, Ai-Hong; Musa, Nuraini

2014-01-01

A reading chart that resembles real reading conditions is important to evaluate the quality of life in terms of reading performance. The purpose of this study was to compare the reading speed of UiTM Malay related words (UiTM-Mrw) reading chart with MNread Acuity Chart and Colenbrander Reading Chart. Fifty subjects with normal sight were randomly recruited through randomized sampling in this study (mean age=22.98±1.65 years). Subjects were asked to read three different near charts aloud and as quickly as possible at random sequence. The charts were the UiTM-Mrw Reading Chart, MNread Acuity Chart and Colenbrander Reading Chart, respectively. The time taken to read each chart was recorded and any errors while reading were noted. Reading performance was quantified in terms of reading speed as words per minute (wpm). The mean reading speed for UiTM-Mrw Reading Chart, MNread Acuity Chart and Colenbrander Reading Chart was 200±30wpm, 196±28wpm and 194±31wpm, respectively. Comparison of reading speed between UiTM-Mrw Reading Chart and MNread Acuity Chart showed no significant difference (t=-0.73, p=0.72). The same happened with the reading speed between UiTM-Mrw Reading Chart and Colenbrander Reading Chart (t=-0.97, p=0.55). Bland and Altman plot showed good agreement between reading speed of UiTM-Mrw Reading Chart with MNread Acuity Chart with the Colenbrander Reading Chart. UiTM-Mrw Reading Chart in Malay language is highly comparable with standardized charts and can be used for evaluating reading speed. Copyright © 2013 Spanish General Council of Optometry. Published by Elsevier Espana. All rights reserved.

Graph anomalies in cyber communications

Energy Technology Data Exchange (ETDEWEB)

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.

Graphs, groups and surfaces

CERN Document Server

White, AT

1985-01-01

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

Subdominant pseudoultrametric on graphs

Energy Technology Data Exchange (ETDEWEB)

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.

Equitable Colorings Of Corona Multiproducts Of Graphs

Directory of Open Access Journals (Sweden)

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

Sphere and dot product representations of graphs

NARCIS (Netherlands)

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

HydroHillChart – Francis module. Software used to Calculate the Hill Chart of the Francis Hydraulic Turbines

Directory of Open Access Journals (Sweden)

Dorian Nedelcu

2015-07-01

Full Text Available The paper presents the Hydro Hill Chart - Francis module application, used to calculate the hill chart of the Pelton, Francis and Kaplan hydraulic turbine models, by processing the data measured on the stand. After describing the interface and menu, the input data is graphically presented and the universal characteristic for measuring scenarios ao=const. and n11=const is calculated. Finally, the two calculated hill charts are compared through a graphical superimposition of the isolines.

Graph Query Portal

OpenAIRE

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

An Association-Oriented Partitioning Approach for Streaming Graph Query

Directory of Open Access Journals (Sweden)

Yun Hao

2017-01-01

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

A comparative study of applying Mason’s Rule in the case of flow-graphs and bond-graphs

Directory of Open Access Journals (Sweden)

Adriana Grava

2009-05-01

Full Text Available The paper presents two methods to analyzethe electric circuits using the flow-graphs and thebond-graphs studying the differences between thesemethods.As it can be noticed, the two methods are totallydifferent; their common point being Mason’s rule thatis applied in both cases but it is applied differently foreach type of graphs.

An algebraic approach to graph codes

DEFF Research Database (Denmark)

Pinero, Fernando

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

Replica methods for loopy sparse random graphs

International Nuclear Information System (INIS)

Coolen, ACC

2016-01-01

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

The STAPL Parallel Graph Library

KAUST Repository

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

Chart of the nuclides - Strasbourg 1990

International Nuclear Information System (INIS)

Antony, M.S.

1991-01-01

Data were compiled for a nuclide chart over the last two years. The compilation is complete to the end of September 1990. The chart includes about 30000 data. Decay modes are represented by colours. Announcement capabilities and prices are given. (G.P.) 3 refs

Obtaining the Andersen's chart, triangulation algorithm

DEFF Research Database (Denmark)

Sabaliauskas, Tomas; Ibsen, Lars Bo

Andersen’s chart (Andersen & Berre, 1999) is a graphical method of observing cyclic soil response. It allows observing soil response to various stress amplitudes that can lead to liquefaction, excess plastic deformation or stabilizing soil response. The process of obtaining the original chart has...

49 CFR 236.718 - Chart, dog.

Science.gov (United States)

2010-10-01

... 49 Transportation 4 2010-10-01 2010-10-01 false Chart, dog. 236.718 Section 236.718 Transportation Other Regulations Relating to Transportation (Continued) FEDERAL RAILROAD ADMINISTRATION, DEPARTMENT OF... OF SIGNAL AND TRAIN CONTROL SYSTEMS, DEVICES, AND APPLIANCES Definitions § 236.718 Chart, dog. A...

Coloring and The Lonely Graph

OpenAIRE

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

Graph Mining Meets the Semantic Web

Energy Technology Data Exchange (ETDEWEB)

Lee, Sangkeun (Matt) [ORNL; Sukumar, Sreenivas R [ORNL; Lim, Seung-Hwan [ORNL

2015-01-01

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

A model of language inflection graphs

Science.gov (United States)

Fukś, Henryk; Farzad, Babak; Cao, Yi

2014-01-01

Inflection graphs are highly complex networks representing relationships between inflectional forms of words in human languages. For so-called synthetic languages, such as Latin or Polish, they have particularly interesting structure due to the abundance of inflectional forms. We construct the simplest form of inflection graphs, namely a bipartite graph in which one group of vertices corresponds to dictionary headwords and the other group to inflected forms encountered in a given text. We, then, study projection of this graph on the set of headwords. The projection decomposes into a large number of connected components, to be called word groups. Distribution of sizes of word group exhibits some remarkable properties, resembling cluster distribution in a lattice percolation near the critical point. We propose a simple model which produces graphs of this type, reproducing the desired component distribution and other topological features.

Asymptotic laws for random knot diagrams

Science.gov (United States)

Chapman, Harrison

2017-06-01

We study random knotting by considering knot and link diagrams as decorated, (rooted) topological maps on spheres and pulling them uniformly from among sets of a given number of vertices n, as first established in recent work with Cantarella and Mastin. The knot diagram model is an exciting new model which captures both the random geometry of space curve models of knotting as well as the ease of computing invariants from diagrams. We prove that unknot diagrams are asymptotically exponentially rare, an analogue of Sumners and Whittington’s landmark result for self-avoiding polygons. Our proof uses the same key idea: we first show that knot diagrams obey a pattern theorem, which describes their fractal structure. We examine how quickly this behavior occurs in practice. As a consequence, almost all diagrams are asymmetric, simplifying sampling from this model. We conclude with experimental data on knotting in this model. This model of random knotting is similar to those studied by Diao et al, and Dunfield et al.

Incremental Frequent Subgraph Mining on Large Evolving Graphs

KAUST Repository

Abdelhamid, Ehab

2017-08-22

Frequent subgraph mining is a core graph operation used in many domains, such as graph data management and knowledge exploration, bioinformatics and security. Most existing techniques target static graphs. However, modern applications, such as social networks, utilize large evolving graphs. Mining these graphs using existing techniques is infeasible, due to the high computational cost. In this paper, we propose IncGM+, a fast incremental approach for continuous frequent subgraph mining problem on a single large evolving graph. We adapt the notion of “fringe” to the graph context, that is the set of subgraphs on the border between frequent and infrequent subgraphs. IncGM+ maintains fringe subgraphs and exploits them to prune the search space. To boost the efficiency, we propose an efficient index structure to maintain selected embeddings with minimal memory overhead. These embeddings are utilized to avoid redundant expensive subgraph isomorphism operations. Moreover, the proposed system supports batch updates. Using large real-world graphs, we experimentally verify that IncGM+ outperforms existing methods by up to three orders of magnitude, scales to much larger graphs and consumes less memory.

Smooth Bundling of Large Streaming and Sequence Graphs

NARCIS (Netherlands)

Hurter, C.; Ersoy, O.; Telea, A.

2013-01-01

Dynamic graphs are increasingly pervasive in modern information systems. However, understanding how a graph changes in time is difficult. We present here two techniques for simplified visualization of dynamic graphs using edge bundles. The first technique uses a recent image-based graph bundling

The groupies of random multipartite graphs

OpenAIRE

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.

Open Graphs and Computational Reasoning

Directory of Open Access Journals (Sweden)

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.

Properly colored connectivity of graphs

CERN Document Server

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.

Inferring ontology graph structures using OWL reasoning

KAUST Repository

Rodriguez-Garcia, Miguel Angel

2018-01-05

Ontologies are representations of a conceptualization of a domain. Traditionally, ontologies in biology were represented as directed acyclic graphs (DAG) which represent the backbone taxonomy and additional relations between classes. These graphs are widely exploited for data analysis in the form of ontology enrichment or computation of semantic similarity. More recently, ontologies are developed in a formal language such as the Web Ontology Language (OWL) and consist of a set of axioms through which classes are defined or constrained. While the taxonomy of an ontology can be inferred directly from the axioms of an ontology as one of the standard OWL reasoning tasks, creating general graph structures from OWL ontologies that exploit the ontologies\\' semantic content remains a challenge.We developed a method to transform ontologies into graphs using an automated reasoner while taking into account all relations between classes. Searching for (existential) patterns in the deductive closure of ontologies, we can identify relations between classes that are implied but not asserted and generate graph structures that encode for a large part of the ontologies\\' semantic content. We demonstrate the advantages of our method by applying it to inference of protein-protein interactions through semantic similarity over the Gene Ontology and demonstrate that performance is increased when graph structures are inferred using deductive inference according to our method. Our software and experiment results are available at http://github.com/bio-ontology-research-group/Onto2Graph .Onto2Graph is a method to generate graph structures from OWL ontologies using automated reasoning. The resulting graphs can be used for improved ontology visualization and ontology-based data analysis.

Inferring ontology graph structures using OWL reasoning.

Science.gov (United States)

Rodríguez-García, Miguel Ángel; Hoehndorf, Robert

2018-01-05

Ontologies are representations of a conceptualization of a domain. Traditionally, ontologies in biology were represented as directed acyclic graphs (DAG) which represent the backbone taxonomy and additional relations between classes. These graphs are widely exploited for data analysis in the form of ontology enrichment or computation of semantic similarity. More recently, ontologies are developed in a formal language such as the Web Ontology Language (OWL) and consist of a set of axioms through which classes are defined or constrained. While the taxonomy of an ontology can be inferred directly from the axioms of an ontology as one of the standard OWL reasoning tasks, creating general graph structures from OWL ontologies that exploit the ontologies' semantic content remains a challenge. We developed a method to transform ontologies into graphs using an automated reasoner while taking into account all relations between classes. Searching for (existential) patterns in the deductive closure of ontologies, we can identify relations between classes that are implied but not asserted and generate graph structures that encode for a large part of the ontologies' semantic content. We demonstrate the advantages of our method by applying it to inference of protein-protein interactions through semantic similarity over the Gene Ontology and demonstrate that performance is increased when graph structures are inferred using deductive inference according to our method. Our software and experiment results are available at http://github.com/bio-ontology-research-group/Onto2Graph . Onto2Graph is a method to generate graph structures from OWL ontologies using automated reasoning. The resulting graphs can be used for improved ontology visualization and ontology-based data analysis.

Optical generation of matter qubit graph states

International Nuclear Information System (INIS)

Benjamin, S C; Eisert, J; Stace, T M

2005-01-01

We present a scheme for rapidly entangling matter qubits in order to create graph states for one-way quantum computing. The qubits can be simple three-level systems in separate cavities. Coupling involves only local fields and a static (unswitched) linear optics network. Fusion of graph-state sections occurs with, in principle, zero probability of damaging the nascent graph state. We avoid the finite thresholds of other schemes by operating on two entangled pairs, so that each generates exactly one photon. We do not require the relatively slow single qubit local flips to be applied during the growth phase: growth of the graph state can then become a purely optical process. The scheme naturally generates graph states with vertices of high degree and so is easily able to construct minimal graph states, with consequent resource savings. The most efficient approach will be to create new graph-state edges even as qubits elsewhere are measured, in a 'just in time' approach. An error analysis indicates that the scheme is relatively robust against imperfections in the apparatus

U.S. Pacific Command > Organization > Organization Chart

Science.gov (United States)

Responsibility USPACOM Previous Commanders Organization Organization Chart Media News Flickr Photos Video Directory Media Inquiries Home : Organization : Organization Chart About DoD DoD Careers Join the Military

XML Graphs in Program Analysis

DEFF Research Database (Denmark)

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

Graphs with Eulerian unit spheres

OpenAIRE

Knill, Oliver

2015-01-01

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

Smart Book Charts

Science.gov (United States)

Chinnapongse, Ronald L.

2015-01-01

Smart book charts for TPSM: Heatshield for Extreme Entry Environment Technology (HEEET), Conformal Ablative TPS (CA-TPS), 3D Woven Multifunctional Ablative TPS (3D MAT), and Adaptable, Deployable, Entry and Placement Technology (ADEPT).

The Container Problem in Bubble-Sort Graphs

Science.gov (United States)

Suzuki, Yasuto; Kaneko, Keiichi

Bubble-sort graphs are variants of Cayley graphs. A bubble-sort graph is suitable as a topology for massively parallel systems because of its simple and regular structure. Therefore, in this study, we focus on n-bubble-sort graphs and propose an algorithm to obtain n-1 disjoint paths between two arbitrary nodes in time bounded by a polynomial in n, the degree of the graph plus one. We estimate the time complexity of the algorithm and the sum of the path lengths after proving the correctness of the algorithm. In addition, we report the results of computer experiments evaluating the average performance of the algorithm.

The many faces of graph dynamics

Science.gov (United States)

Pignolet, Yvonne Anne; Roy, Matthieu; Schmid, Stefan; Tredan, Gilles

2017-06-01

The topological structure of complex networks has fascinated researchers for several decades, resulting in the discovery of many universal properties and reoccurring characteristics of different kinds of networks. However, much less is known today about the network dynamics: indeed, complex networks in reality are not static, but rather dynamically evolve over time. Our paper is motivated by the empirical observation that network evolution patterns seem far from random, but exhibit structure. Moreover, the specific patterns appear to depend on the network type, contradicting the existence of a ‘one fits it all’ model. However, we still lack observables to quantify these intuitions, as well as metrics to compare graph evolutions. Such observables and metrics are needed for extrapolating or predicting evolutions, as well as for interpolating graph evolutions. To explore the many faces of graph dynamics and to quantify temporal changes, this paper suggests to build upon the concept of centrality, a measure of node importance in a network. In particular, we introduce the notion of centrality distance, a natural similarity measure for two graphs which depends on a given centrality, characterizing the graph type. Intuitively, centrality distances reflect the extent to which (non-anonymous) node roles are different or, in case of dynamic graphs, have changed over time, between two graphs. We evaluate the centrality distance approach for five evolutionary models and seven real-world social and physical networks. Our results empirically show the usefulness of centrality distances for characterizing graph dynamics compared to a null-model of random evolution, and highlight the differences between the considered scenarios. Interestingly, our approach allows us to compare the dynamics of very different networks, in terms of scale and evolution speed.

Chart of the nuclides

International Nuclear Information System (INIS)

Yoshizawa, Y.; Horiguchi, T.; Yamada, M.

1980-01-01

In this chart, four colors are use to classify nuclides according to their half-lives. The different symbols are also to show the decay modes and their percentage in each nuclide. Four tables are provided on the back of the chart. Table 1 is the ordinary periodic Table. Table 2 provides fundamental constants used for nuclear physics. Tables 3 lists the physical constants (mean density, ionization potential, melting point, and boiling point) of all elements. Table 4 provides the gamma-ray intensity standards. Half-lives, energy, relative intensity, and intensity per decay are list for 33 nuclides. (J.P.N.)

Low-algorithmic-complexity entropy-deceiving graphs

KAUST Repository

Zenil, Hector

2017-07-08

In estimating the complexity of objects, in particular, of graphs, it is common practice to rely on graphand information-theoretic measures. Here, using integer sequences with properties such as Borel normality, we explain how these measures are not independent of the way in which an object, such as a graph, can be described or observed. From observations that can reconstruct the same graph and are therefore essentially translations of the same description, we see that when applying a computable measure such as the Shannon entropy, not only is it necessary to preselect a feature of interest where there is one, and to make an arbitrary selection where there is not, but also more general properties, such as the causal likelihood of a graph as a measure (opposed to randomness), can be largely misrepresented by computable measures such as the entropy and entropy rate. We introduce recursive and nonrecursive (uncomputable) graphs and graph constructions based on these integer sequences, whose different lossless descriptions have disparate entropy values, thereby enabling the study and exploration of a measure\\'s range of applications and demonstrating the weaknesses of computable measures of complexity.

Multiple graph regularized nonnegative matrix factorization