Powered by Deep Web Technologies
Note: This page contains sample records for the topic "view graph graph" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


1

Graph Algorithms Tours in Graphs  

E-Print Network [OSTI]

terminates only at y. Graph Algorithms 14 #12;Combining the Main and the Secondary Cycles Let C = (x a secondary cycle C starting with y. - Combine the cycles C and C into C. Return the cycle C. Graph AlgorithGraph Algorithms Tours in Graphs Graph Algorithms #12;Special Paths and Cycles in Graphs Euler Path

Bar-Noy, Amotz

2

Graph Algorithms Special Sets in Graphs  

E-Print Network [OSTI]

{u e}. Graph Algorithms 8 #12;Example: A Vertex Cover Set Graph Algorithms 9 #12;Example: A Minimum Size Vertex Cover Set Graph Algorithms 10 #12;A Clique A set of vertices for which all possible edges * * * * * Graph Algorithms 20 #12;Independent Sets and Vertex Cover Sets Observation: I is an independent set

Bar-Noy, Amotz

3

Graph Algorithms Edge Coloring  

E-Print Network [OSTI]

: Perfect Matching Graph Algorithms 6 #12;Edge Covering An edge covering, EC E, is a set of edges #12;Example: Edge Covering Graph Algorithms 8 #12;Example: Minimal Edge Covering Graph Algorithms 9 #12;Example: Minimum Size Edge Covering Graph Algorithms 10 #12;Matching and Edge Covering Definition

Bar-Noy, Amotz

4

Graph Algorithms Robert Elsasser  

E-Print Network [OSTI]

-regular bipartite graph has a perfect matching. Definition 3: A vertex cover of a graph G = (V, E) is a set Q VGraph Algorithms Robert Els¨asser 10 November 2011 Program of the day: · Matchings in bipartite graphs Robert Els¨asser Universit¨at Paderborn Graph Algorithms WS 11/12 0 #12;5. Matchings in bipartite

Elsässer, Robert

5

PDSF Utilization Graphs  

Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

Graphs Graphs Utilization Graphs This page contains a series of graphs that use data from the PDSF batch scheduler (SGE) to show the utilization of the cluster over the past 24 hours. The graphs were generated with RRDTool and are updated approximately every 15 minutes. This graph shows the aggregate cluster CPU availablity and usage according to sgeload: 24 hour rolling usage graph (click to see long term averages) This graph shows the number of jobs being run by each group: Rolling 24 Running Jobs by Group (click to see long term averages) This is the same graph as above weighted by the clockspeed (GHz) of the node used for the job: Rolling 24 Running Jobs by Group (click to see long term averages) This graph show the number of pending jobs by group: Rolling 24 Pending Jobs

6

Graph Visualization API Library for Application Builders  

Science Journals Connector (OSTI)

Founded in 1991, Tom Sawyer Software produces quality graph-based architectures for application developers. These technologies include graph management, graph layout, graph diagramming, and graph visualization...

Franois Bertault; Wendy Feng; Uli Feier; Gabe Grigorescu

2002-01-01T23:59:59.000Z

7

Graph Algorithms Vertex Coloring  

E-Print Network [OSTI]

Coloring Definition I: A disjoint collection of independent sets that cover all the vertices in the graphGraph Algorithms Vertex Coloring Graph Algorithms #12;The Input Graph G = (V, E) a simple and undirected graph: V : a set of n vertices. E: a set of m edges. A B EF C D A B C D E F A 0 1 1 1 0 0 B 1 0

Bar-Noy, Amotz

8

Graph algorithms experimentation facility  

E-Print Network [OSTI]

minimum vertex cover and maximum clique size heuristics and some visibility and circle graph related methods. As a by-product of our implementation we obtained several results about the structure of maximum independent sets for several classes of graphs...

Sonom, Donald George

2012-06-07T23:59:59.000Z

9

Graphs, Trees Pebbles, Robots  

E-Print Network [OSTI]

Graphs, Trees Pebbles, Robots 1 #12;Outline I. Robot Arms. II. Rigid Graphs. III. Characterizations. Applications: (a) Rigid Components. 2 #12;I. Robot arms and the Carpenter's Rule Problem. Can a robot arm

Haas, Ruth

10

Parasupersymmetry in Quantum Graphs  

E-Print Network [OSTI]

We study hidden parasupersymmetry structures in purely bosonic quantum mechanics on compact equilateral graphs. We consider a single free spinless particle on the graphs and show that the Huang-Su parasupersymmetry algebra is hidden behind degenerate spectra.

Satoshi Ohya

2012-10-29T23:59:59.000Z

11

Parasupersymmetry in Quantum Graphs  

E-Print Network [OSTI]

We study hidden parasupersymmetry structures in purely bosonic quantum mechanics on compact equilateral graphs. We consider a single free spinless particle on the graphs and show that the Rubakov-Spiridonov-Khare-Tomiya parasupersymmetries are hidden behind degenerate spectra.

Ohya, Satoshi

2012-01-01T23:59:59.000Z

12

Graph Algorithms Robert Elsasser  

E-Print Network [OSTI]

. Definition 3: A vertex cover of a graph G = (V, E) is a set Q V , such that each edge of E is incidentGraph Algorithms Robert Els¨asser 17 November 2011 Program of the day: · Matchings in bipartite graphs Robert Els¨asser Universit¨at Paderborn Graph Algorithms WS 11/12 0 #12;5. Matchings in bipartite

Elsässer, Robert

13

Standards for graph algorithm primitives  

E-Print Network [OSTI]

It is our view that the state of the art in constructing a large collection of graph algorithms in terms of linear algebraic operations is mature enough to support the emergence of a standard set of primitive building ...

Mattson, Tim

14

A heuristic algorithm for graph isomorphism  

E-Print Network [OSTI]

polynomial time algorithm O(n?), ISO-MT, that seems' to solve the graph isomorphism decision problem correctly for all classes of graphs. Our algorithm is extremely useful from the practical point of view since counter examples (pairs of graphs for which our...

Torres Navarro, Luz

1999-01-01T23:59:59.000Z

15

Spectral characterizations of sun graphs and broken sun graphs  

E-Print Network [OSTI]

Spectral characterizations of sun graphs and broken sun graphs Romain Boulet 10 Dec 2009 Abstract- cyclic graphs. An odd (resp. even) sun is a graph obtained by appending a pendant vertex to each vertex of an odd (resp. even) cycle. A broken sun is a graph obtained by deleting pendant vertices of a sun

Paris-Sud XI, Université de

16

Convex Graph Invariants  

E-Print Network [OSTI]

Dec 2, 2010 ... where A represents the adjacency matrix of a graph, and the maximum is taken over all ...... SDPT3 - a MATLAB software package for.

2010-12-02T23:59:59.000Z

17

Spectral Graph Theory  

E-Print Network [OSTI]

REU this summer was also to examine the brain of. Caenorhabditis elegans (C. Elegans). Chklovskii formed a Laplacian matrix of the graph representing.

*D. J. Kelleher

2011-09-30T23:59:59.000Z

18

Graphs associated with semigroups  

E-Print Network [OSTI]

the empty graph is not td d t b pl t . A ~b* h 1 g ph G graph having all of its vertices and edges in G. The citations on the following pages follow the style f th ~fdt f th A t M th tt 1 ~S1 t A path is a sequence of distinct vertices, V , V... , . . . , V n' where V and V are adjacent for i 1, 2, . . . , n-l. If there exists a path between two vertices, the pair is said to be connected. A connected ~ra h is a graph in which every pair of vertices is joined by a path. The empty graph...

Baber, Stephen Asa

2012-06-07T23:59:59.000Z

19

Graph anomalies in cyber communications  

SciTech Connect (OSTI)

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.

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-11T23:59:59.000Z

20

GraphState - a tool for graph identification and labelling  

E-Print Network [OSTI]

We present python libraries for Feynman graphs manipulation. The key feature of these libraries is usage of generalization of graph representation offered by B. G. Nickel et al. In this approach graph is represented in some unique 'canonical' form that depends only on its combinatorial type. The uniqueness of graph representation gives an efficient way for isomorphism finding, searching for subgraphs and other graph manipulation tasks. Though offered libraries were originally designed for Feynman graphs, they might be useful for more general graph problems.

Batkovich, D; Kompaniets, M; Novikov, S

2014-01-01T23:59:59.000Z

Note: This page contains sample records for the topic "view graph graph" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


21

GraphState - a tool for graph identification and labelling  

E-Print Network [OSTI]

We present python libraries for Feynman graphs manipulation. The key feature of these libraries is usage of generalization of graph representation offered by B. G. Nickel et al. In this approach graph is represented in some unique 'canonical' form that depends only on its combinatorial type. The uniqueness of graph representation gives an efficient way for isomorphism finding, searching for subgraphs and other graph manipulation tasks. Though offered libraries were originally designed for Feynman graphs, they might be useful for more general graph problems.

D. Batkovich; Yu. Kirienko; M. Kompaniets; S. Novikov

2014-09-29T23:59:59.000Z

22

Querying graphs with data  

E-Print Network [OSTI]

Graph data is becoming more and more pervasive. Indeed, services such as Social Networks or the Semantic Web can no longer rely on the traditional relational model, as its structure is somewhat too rigid for the applications ...

Vrgoc, Domagoj

2014-06-27T23:59:59.000Z

23

Fuzzy Mathematics Fuzzy -Sets, -Relations, -Logic, -Graphs,  

E-Print Network [OSTI]

Fuzzy Mathematics Fuzzy -Sets, -Relations, -Logic, -Graphs, -Mappings and The Extension Principle . . . . . . . . . . . . . . . . . . 8 2 The Extension Principle 10 3 Fuzzy Graphs 16 4 Fuzzy Logic 19 Back View #12;Section 1: Fuzzy Olaf Wolkenhauer Control Systems Centre UMIST o.wolkenhauer@umist.ac.uk www

Rostock, Universität

24

Graph degree linkage: agglomerative clustering on a directed graph  

Science Journals Connector (OSTI)

This paper proposes a simple but effective graph-based agglomerative algorithm, for clustering high-dimensional data. We explore the different roles of two fundamental concepts in graph theory, indegree and outdegree, in the context of clustering. The ...

Wei Zhang; Xiaogang Wang; Deli Zhao; Xiaoou Tang

2012-10-01T23:59:59.000Z

25

Kinetic Pie Delaunay Graph and Its Applications  

Science Journals Connector (OSTI)

We construct a new proximity graph, called the Pie Delaunay graph, on a set of n points which is a super graph of Yao graph and Euclidean minimum spanning tree (EMST). We efficiently maintain the Pie

Mohammad Ali Abam; Zahed Rahmati; Alireza Zarei

2012-01-01T23:59:59.000Z

26

Densities in graphs and matroids  

E-Print Network [OSTI]

|E(H)| |V (H)|?1 ? |E(T)| |V (T)|?1 = 1 for all non-trivial subgraphs of T. In general, a balanced graph G is a graph such that |E(H)| |V (H)| ? |E(G)| |V (G)| and a 1-balanced graph is a graph such that |E(H)| |V (H)|?1 ? |E(G)| |V (G)|?1 for all non...

Kannan, Lavanya

2009-05-15T23:59:59.000Z

27

Exploring the role of graph spectra in graph coloring algorithm performance  

Science Journals Connector (OSTI)

This paper considers the challenge of recognizing how the properties of a graph determine the performance of graph coloring algorithms. In particular, we examine how spectral properties of the graph make the graph coloring task easy or hard. We address ... Keywords: Algorithm selection, Branch and bound, DSATUR, Graph coloring, Graph invariants, Graph spectra, LP-relaxation

Kate Smith-Miles, Davaatseren Baatar

2014-10-01T23:59:59.000Z

28

Exact algorithm for graph homomorphism and locally injective graph homomorphism  

Science Journals Connector (OSTI)

For graphs G and H, a homomorphism from G to H is a function @f:V(G)->V(H), which maps vertices adjacent in G to adjacent vertices of H. A homomorphism is locally injective if no two vertices with a common neighbor are mapped to a single vertex in H. ... Keywords: Exact algorithm, Graph algorithms, Graph homomorphism, H(2,1)-labeling, Locally injective homomorphism

Pawe? Rzewski

2014-07-01T23:59:59.000Z

29

Extremal Graph Numbers of Graphs on Few May 4, 2012  

E-Print Network [OSTI]

Extremal Graph Numbers of Graphs on Few Vertices John Kim May 4, 2012 1 Introduction Let H this number to be the extremal graph number of H on n vertices, and we denote it by ex(n, H). When H(n, K3) n 2 2 . A precise formula for ex(n, K3) is given by: ex(n, K3) = n 2 n + 1 2 . The extremal

Zeilberger, Doron

30

How to Resum Feynman Graphs  

E-Print Network [OSTI]

In this paper we reformulate in a simpler way the combinatoric core of constructive quantum field theory We define universal rational combinatoric weights for pairs made of a graph and one of its spanning trees. These weights are nothing but the percentage of Hepp's sectors in which the tree is leading the ultraviolet analysis. We explain how they allow to reshuffle the divergent series formulated in terms of Feynman graphs into convergent series indexed by the trees that these graphs contain. The Feynman graphs to be used are not the ordinary ones but those of the intermediate field representation, and the result of the reshuffling is called the Loop Vertex Expansion.

Vincent Rivasseau; Zhituo Wang

2013-09-24T23:59:59.000Z

31

Fast iterative graph computation with block updates  

Science Journals Connector (OSTI)

Scaling iterative graph processing applications to large graphs is an important problem. Performance is critical, as data scientists need to execute graph programs many times with varying parameters. The need for a high-level, high-performance programming ...

Wenlei Xie; Guozhang Wang; David Bindel; Alan Demers; Johannes Gehrke

2013-09-01T23:59:59.000Z

32

L21: "Irregular" Graph Algorithms  

E-Print Network [OSTI]

11/11/10 1 L21: "Irregular" Graph Algorithms November 11, 2010 Administrative ·Class cancelled Monday, November 22, 11:59 PM Today we will cover Successive Over Relaxation. Here is the sequential code ·Irregular parallel computation - Sparse matrix operations (last time) and graph algorithms (this time

Hall, Mary W.

33

Phylogenetic Toric Varieties on Graphs  

E-Print Network [OSTI]

We define the phylogenetic model of a trivalent graph as a generalization of a binary symmetric model of a trivalent phylogenetic tree. If the underlining graph is a tree, the model has a parametrization that can be expressed in terms of the tree...

Buczynska, Weronika J.

2010-10-12T23:59:59.000Z

34

Contraction semigroups on metric graphs  

E-Print Network [OSTI]

The main objective of the present work is to study contraction semigroups generated by Laplace operators on metric graphs, which are not necessarily self-adjoint. We prove criteria for such semigroups to be continuity and positivity preserving. Also we provide a characterization of generators of Feller semigroups on metric graphs.

Vadim Kostrykin; Jurgen Potthoff; Robert Schrader

2008-02-26T23:59:59.000Z

35

Contractions of planar graphs in polynomial time?  

E-Print Network [OSTI]

Contractions of planar graphs in polynomial time? Marcin Kami´nski??1 , Dani¨el Paulusma2 that for every graph H, there exists a polyno- mial-time algorithm deciding if a planar graph can be contracted to H. We introduce contractions and topological minors of embedded (plane) graphs and show that a plane

Dimitrios, Thilikos

36

Some Remarks on Definability of Process Graphs  

E-Print Network [OSTI]

them in the context of the well- known process algebras BPA and BPP. For a process graph G, the density going from s to infinity" exist in G. For BPA-graphs we discuss some tentative findings about-definability results, stating that certain process graphs are not BPA-graphs, and stronger, not even BPA

Klop, Jan Willem

37

Extremal Graph Problems, Degenerate Extremal Problems,  

E-Print Network [OSTI]

Extremal Graph Problems, Degenerate Extremal Problems, and Supersaturated Graphs Mikl´os Simonovits´an-type extremal problem. The graphs attaining the maximum will be called extremal and their family will be denoted and multi- ple edges. In 1940, P. Tur´an posed and solved the extremal problem of Kp+1, the complete graph

Simonovits, Miklós

38

CP(Graph): Introducing a Graph Computation Domain in Constraint Programming  

E-Print Network [OSTI]

CP(Graph): Introducing a Graph Computation Domain in Constraint Programming Gregoire Dooms, Yves constraint programming by introducing CP(Graph), a new computation domain focused on graphs including a new and its associated propagator are sketched. CP(Graph) is in- tegrated with finite domain and finite sets

Deville, Yves

39

Transforming a graph into a 1-balanced graph  

Science Journals Connector (OSTI)

Let G be a non-trivial, loopless graph and for each non-trivial subgraph H of G, let g(H)=|E(H)||V(H)|-@w(H). The graph G is 1-balanced if @c(G), the maximum among g(H), taken over all non-trivial subgraphs H of G, is attained when H=G. This quantity ... Keywords: Fractional arboricity, Molecular, Strongly balanced, Uniformly dense

Lavanya Kannan; Arthur Hobbs; Hong-Jian Lai; Hongyuan Lai

2009-01-01T23:59:59.000Z

40

Are Pixel Graphs Are Better at Representing Information than Pie Graphs?  

Science Journals Connector (OSTI)

This study investigates whether pixel graphs more accurately represent percentage based data than pie graphs or bar graphs. Participants were asked ... representing large quantities of percentage based data than

Jolie Bell; Jim Davies

2010-01-01T23:59:59.000Z

Note: This page contains sample records for the topic "view graph graph" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


41

Multilevel spectral clustering : graph partitions and image segmentation  

E-Print Network [OSTI]

While the spectral graph partitioning method gives high quality segmentation, segmenting large graphs by the spectral method is computationally expensive. Numerous multilevel graph partitioning algorithms are proposed to ...

Kong, Tian Fook

2008-01-01T23:59:59.000Z

42

Algebraic connectivity and graph robustness.  

SciTech Connect (OSTI)

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

Feddema, John Todd; Byrne, Raymond Harry; Abdallah, Chaouki T. (University of New Mexico)

2009-07-01T23:59:59.000Z

43

SLQ: a user-friendly graph querying system  

Science Journals Connector (OSTI)

Querying complex graph databases such as knowledge graphs is a challenging task for non-professional users. In this demo, we present SLQ, a user-friendly graph querying system enabling schemales and structures graph querying, where a user need not describe ... Keywords: graph databases, keyword query, schemaless graph querying

Shengqi Yang; Yanan Xie; Yinghui Wu; Tianyu Wu; Huan Sun; Jian Wu; Xifeng Yan

2014-06-01T23:59:59.000Z

44

NLS ground states on graphs  

E-Print Network [OSTI]

We investigate the existence of ground states for the subcritical NLS energy on metric graphs. In particular, we find out a topological assumption that guarantees the nonexistence of ground states, and give an example in which the assumption is not fulfilled and ground states actually exist. In order to obtain the result, we introduce a new rearrangement technique, adapted to the graph where it applies. Owing to such a technique, the energy level of the rearranged function is improved by conveniently mixing the symmetric and monotone rearrangement procedures.

Riccardo Adami; Enrico Serra; Paolo Tilli

2014-06-16T23:59:59.000Z

45

On Edge Szeged Index of Bridge Graphs  

Science Journals Connector (OSTI)

Corollary 2. Let H be any graph with fixed vertex $$ v $$ .... Then the edge Szeged index of the bridge

Fuqin Zhan; Youfu Qiao

2013-01-01T23:59:59.000Z

46

Hybrid motion graph for character motion synthesis  

Science Journals Connector (OSTI)

Objective: This paper proposes a novel framework of Hybrid Motion Graph (HMG) for creating character animations, which enhances the graph-based structural control by motion field representations for efficient motion synthesis of diverse and interactive ... Keywords: Motion fields, Motion graph, Motion synthesis, Motion template, Motion transition

Weiwei Xing; Xiang Wei; Jian Zhang; Cheng Ren; Wei Lu

2014-02-01T23:59:59.000Z

47

THE TUKEY ORDER FOR GRAPHS 1. Introduction  

E-Print Network [OSTI]

THE TUKEY ORDER FOR GRAPHS 1. Introduction Given a graph G, we let VG stand for the vertex set of G. For graphs G without isolated vertices, the Tukey order can be characterized thus: () G H iff there exist) is called a (generalized) Galois-Tukey connection (abbreviated GT-connection) from R to S if the following

Nyikos, Peter J.

48

Constrained Graph Optimization: Interdiction and Preservation Problems  

SciTech Connect (OSTI)

The maximum flow, shortest path, and maximum matching problems are a set of basic graph problems that are critical in theoretical computer science and applications. Constrained graph optimization, a variation of these basic graph problems involving modification of the underlying graph, is equally important but sometimes significantly harder. In particular, one can explore these optimization problems with additional cost constraints. In the preservation case, the optimizer has a budget to preserve vertices or edges of a graph, preventing them from being deleted. The optimizer wants to find the best set of preserved edges/vertices in which the cost constraints are satisfied and the basic graph problems are optimized. For example, in shortest path preservation, the optimizer wants to find a set of edges/vertices within which the shortest path between two predetermined points is smallest. In interdiction problems, one deletes vertices or edges from the graph with a particular cost in order to impede the basic graph problems as much as possible (for example, delete edges/vertices to maximize the shortest path between two predetermined vertices). Applications of preservation problems include optimal road maintenance, power grid maintenance, and job scheduling, while interdiction problems are related to drug trafficking prevention, network stability assessment, and counterterrorism. Computational hardness results are presented, along with heuristic methods for approximating solutions to the matching interdiction problem. Also, efficient algorithms are presented for special cases of graphs, including on planar graphs. The graphs in many of the listed applications are planar, so these algorithms have important practical implications.

Schild, Aaron V [Los Alamos National Laboratory

2012-07-30T23:59:59.000Z

49

Security of graph data: hashing schemes and definitions  

Science Journals Connector (OSTI)

Use of graph-structured data models is on the rise - in graph databases, in representing biological and healthcare data as well as geographical data. In order to secure graph-structured data, and develop cryptographically secure schemes for graph databases, ... Keywords: graphs, hash functions, integrity, perfectly secure hash functions, privacy

Muhammad U. Arshad, Ashish Kundu, Elisa Bertino, Krishna Madhavan, Arif Ghafoor

2014-03-01T23:59:59.000Z

50

Locating-total domination in graphs  

Science Journals Connector (OSTI)

In this paper, we continue the study of locating-total domination in graphs. A set S of vertices in a graph G is a total dominating set in G if every vertex of G is adjacent to a vertex in S . We consider total dominating sets S which have the additional property that distinct vertices in V ( G ) ? S are totally dominated by distinct subsets of the total dominating set. Such a set S is called a locating-total dominating set in G , and the locating-total domination number of G is the minimum cardinality of a locating-total dominating set in G . We obtain new lower and upper bounds on the locating-total domination number of a graph. Interpolation results are established, and the locating-total domination number in special families of graphs, including cubic graphs and grid graphs, is investigated.

Michael A. Henning; Nader Jafari Rad

2012-01-01T23:59:59.000Z

51

API Requirements for Dynamic Graph Prediction  

SciTech Connect (OSTI)

Given a large-scale time-evolving multi-modal and multi-relational complex network (a.k.a., a large-scale dynamic semantic graph), we want to implement algorithms that discover patterns of activities on the graph and learn predictive models of those discovered patterns. This document outlines the application programming interface (API) requirements for fast prototyping of feature extraction, learning, and prediction algorithms on large dynamic semantic graphs. Since our algorithms must operate on large-scale dynamic semantic graphs, we have chosen to use the graph API developed in the CASC Complex Networks Project. This API is supported on the back end by a semantic graph database (developed by Scott Kohn and his team). The advantages of using this API are (i) we have full-control of its development and (ii) the current API meets almost all of the requirements outlined in this document.

Gallagher, B; Eliassi-Rad, T

2006-10-13T23:59:59.000Z

52

To make a circle graph (pie graph) in Excel 2010 1. Enter the data ...  

E-Print Network [OSTI]

To make a circle graph (pie graph) in Excel 2010. 1. Enter the data into Excel in rows, with the data labels followed by the numerical data. 2. Select all cells that...

Dave

2012-03-20T23:59:59.000Z

53

On real number labelings and graph invertibility  

Science Journals Connector (OSTI)

For non-negative real x"0 and simple graph G, @l"x"""0","1(G) is the minimum span over all labelings that assign real numbers to the vertices of G such that adjacent vertices receive labels that differ by at least x"0 and vertices at distance two receive ... Keywords: ?-invertible, ?j,k-labeling, ?x,1-labeling, Distance-constrained labeling, Kneser graphs, Self-complementary graphs

Jeong-Ok Choi; John Georges; David Mauro; Yan Wang

2012-10-01T23:59:59.000Z

54

Some algorithmic results in graph imbeddings  

E-Print Network [OSTI]

new technique called double bar amalgamation is developed. The second problem deals with constructing graph imbeddings on a sur- face of genus c (where c is an integer) less than the marimum genus 7, (G) the given graph G. We develop a polynomial... time algorithm that constructs an imbedding of a given upper imbbedable graph G with even Betti number, on an orientable surface of genus (7, (G) ? 1). TABLE OF CONTENTS CHAPTER Page I INTRODUCTION 1. 1 Overview 1. 2 Graphs and Relationships Used...

Joshi, Sanjay

1990-01-01T23:59:59.000Z

55

Generating Reports & Graphs in Portfolio Manager  

Broader source: Energy.gov [DOE]

This presentation, given through the DOE's Technical Assitance Program (TAP), provides information on how to generate reports and graphs in Portfolio Manager.

56

Nuclear reactor multiphysics via bond graph formalism  

E-Print Network [OSTI]

This work proposes a simple and effective approach to modeling nuclear reactor multiphysics problems using bond graphs. Conventional multiphysics simulation paradigms normally use operator splitting, which treats the ...

Sosnovsky, Eugeny

2014-01-01T23:59:59.000Z

57

Hamilton Decompositions of Graphs with Primitive Complements .  

E-Print Network [OSTI]

??A graph G is a pair (V, E) where V is the set of vertices(or nodes) and E is the set of edges connecting the (more)

OZKAN, SIBEL

2007-01-01T23:59:59.000Z

58

Generation of graph-state streams  

E-Print Network [OSTI]

We propose a protocol to generate a stream of mobile qubits in a graph state through a single stationary parent qubit and discuss two types of its physical implementation, namely, the generation of photonic graph states through an atom-like qubit and those of flying atoms through a cavity-mode photonic qubit. The generated graph states fall into an important class that can hugely reduce the resource requirement of fault-tolerant linear optics quantum computation, which was previously known to be far from realistic. In regard to the flying atoms, we also propose a heralded generation scheme, which allows for high-fidelity graph states even under the photon loss.

Daniel Ballester; Jaeyoon Cho; M. S. Kim

2010-12-08T23:59:59.000Z

59

On Products and Line Graphs of Signed Graphs, their Eigenvalues and Energy  

E-Print Network [OSTI]

On Products and Line Graphs of Signed Graphs, their Eigenvalues and Energy K.A. Germina, Shahul and Laplacian matrices and their eigenvalues and energies of the general product (non-complete extended p- sum product and the eigenvalues and energy of the product in terms of those of the factor graphs

Zaslavsky, Thomas

60

3D Graph Visualization with the Oculus Rift Virtual Graph Reality  

E-Print Network [OSTI]

3D Graph Visualization with the Oculus Rift Virtual Graph Reality Farshad Barahimi, Stephen Wismath regarding three- dimensional (3D) representations of graphs. However, the actual usefulness of such 3D reality environment such as a CAVE, or · printed as a physical model with a 3D printer. Early studies

Wismath, Stephen

Note: This page contains sample records for the topic "view graph graph" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


61

Graph-Theoretic Generation of Assembly Plans Part I: Correct Generation of Precedence Graphs  

E-Print Network [OSTI]

1 Graph-Theoretic Generation of Assembly Plans Part I: Correct Generation of Precedence Graphs Lehigh University Bethlehem, Pennsylvania Abstract Automatic generation and selection of assembly plans a graph-theoretic scheme for the generation of assembly plans. Our scheme involves decomposing the CSP

Wu, David

62

Useful Graphs and Charts - Ion Beams - Radiation Effects Facility...  

Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

Ion Beams Available Beams Beam Change Times Measurements Useful Graphs Useful Graphs and Charts LET vs. Range in Si Graphs: 15 MeVu Beams 24.8 MeVu Beams 40 MeVu Beams...

63

Sequoia supercomputer tops Graph 500 | National Nuclear Security...  

National Nuclear Security Administration (NNSA)

on Graph 500 and new techniques for solving large graph problems on small high performance computing (HPC) systems, all the way down to a single server. Lawrence Livermore's...

64

LD-graphs and global location-domination in bipartite graphs  

Science Journals Connector (OSTI)

Abstract A dominating set S of a graph G is a locating-dominating-set, LD-set for short, if every vertex v not in S is uniquely determined by the set of neighbors of v belonging to S. Locating-dominating sets of minimum cardinality are called LD-codes and the cardinality of an LD-code is the location-domination number, ? ( G ) . An LD-set S of a graph G is global if it is an LD-set for both G and its complement, G . One of the main contributions of this work is the definition of the LD-graph, an edge-labeled graph associated to an LD-set, that will be very helpful to deduce some properties of location-domination in graphs. Concretely, we use LD-graphs to study the relation between the location-domination number in a bipartite graph and its complement.

C. Hernando; M. Mora; I.M. Pelayo

2014-01-01T23:59:59.000Z

65

Extremal optimization for graph partitioning Stefan Boettcher*  

E-Print Network [OSTI]

­4 and of fast-folding protein confor- mations 5 are but two examples. In cases where the relation between-temperature properties of disordered systems. In the present work we focus on the intrinsic features of the method on the graph bipartitioning problem. We consider various kinds of graph ensembles, both with geometric

Percus, Allon

66

Graph searching and a generalized parking function  

E-Print Network [OSTI]

introduced a new generalization, the G-multiparking function, where G is a simple graph on a totally ordered vertex set {1, 2, . . . , n}. We give an algorithm that converts a G-multiparking function into a rooted spanning forest of G by using a graph...

Kostic, Dimitrije Nenad

2009-05-15T23:59:59.000Z

67

Feature Tracking Using Reeb Graphs  

SciTech Connect (OSTI)

Tracking features and exploring their temporal dynamics can aid scientists in identifying interesting time intervals in a simulation and serve as basis for performing quantitative analyses of temporal phenomena. In this paper, we develop a novel approach for tracking subsets of isosurfaces, such as burning regions in simulated flames, which are defined as areas of high fuel consumption on a temperature isosurface. Tracking such regions as they merge and split over time can provide important insights into the impact of turbulence on the combustion process. However, the convoluted nature of the temperature isosurface and its rapid movement make this analysis particularly challenging. Our approach tracks burning regions by extracting a temperature isovolume from the four-dimensional space-time temperature field. It then obtains isosurfaces for the original simulation time steps and labels individual connected 'burning' regions based on the local fuel consumption value. Based on this information, a boundary surface between burning and non-burning regions is constructed. The Reeb graph of this boundary surface is the tracking graph for burning regions.

Weber, Gunther H.; Bremer, Peer-Timo; Day, Marcus S.; Bell, John B.; Pascucci, Valerio

2010-08-02T23:59:59.000Z

68

Path Integral on Star Graph  

E-Print Network [OSTI]

In this paper we study path integral for a single spinless particle on a star graph with N edges, whose vertex is known to be described by U(N) family of boundary conditions. After carefully studying the free particle case, both at the critical and off-critical levels, we propose a new path integral formulation that correctly captures all the scale-invariant subfamily of boundary conditions realized at fixed points of boundary renormalization group flow. Our proposal is based on the folding trick, which maps a scalar-valued wave function on star graph to an N-component vector-valued wave function on half-line. All the parameters of scale-invariant subfamily of boundary conditions are encoded into the momentum independent weight factors, which appear to be associated with the two distinct path classes on half-line that form the cyclic group Z_2. We show that, when bulk interactions are edge-independent, these weight factors are generally given by an N-dimensional unitary representation of Z_2. Generalization to momentum dependent weight factors and applications to worldline formalism are briefly discussed.

Satoshi Ohya

2011-04-28T23:59:59.000Z

69

Path Integral on Star Graph  

E-Print Network [OSTI]

In this paper we study path integral for a single spinless particle on a star graph with N edges, whose vertex is known to be described by U(N) family of boundary conditions. After carefully studying the free particle case, both at the critical and off-critical levels, we propose new path integral formulation that correctly captures all the scale-invariant subfamily of boundary conditions realized at fixed points of boundary renormalization group flow. Our proposal is based on the folding trick, which maps a scalar-valued wave function on star graph to an N-component vector-valued wave function on half-line. All the parameters of scale-invariant subfamily of boundary conditions are encoded into the momentum independent weight factors, which appear to be associated with the two distinct path classes on half-line that form the cyclic group Z_2. We show that, when bulk interactions are edge-independent, these weight factors are generally given by an N-dimensional unitary representation of Z_2. Generalization to ...

Ohya, Satoshi

2011-01-01T23:59:59.000Z

70

Modeling and Recognition of Landmark Image Collections Using Iconic Scene Graphs  

E-Print Network [OSTI]

Modeling and Recognition of Landmark Image Collections Using Iconic Scene Graphs Xiaowei Li images share a common 3D structure. Each valid cluster is then represented by a single iconic view, and geometric relationships between iconic views are captured by an iconic scene graph. In addition to serving

Lazebnik, Svetlana

71

Approximate von Neumann entropy for directed graphs  

Science Journals Connector (OSTI)

In this paper, we develop an entropy measure for assessing the structural complexity of directed graphs. Although there are many existing alternative measures for quantifying the structural properties of undirected graphs, there are relatively few corresponding measures for directed graphs. To fill this gap in the literature, we explore an alternative technique that is applicable to directed graphs. We commence by using Chung's generalization of the Laplacian of a directed graph to extend the computation of von Neumann entropy from undirected to directed graphs. We provide a simplified form of the entropy which can be expressed in terms of simple node in-degree and out-degree statistics. Moreover, we find approximate forms of the von Neumann entropy that apply to both weakly and strongly directed graphs, and that can be used to characterize network structure. We illustrate the usefulness of these simplified entropy forms defined in this paper on both artificial and real-world data sets, including structures from protein databases and high energy physics theory citation networks.

Cheng Ye; Richard C. Wilson; Csar H. Comin; Luciano da F. Costa; Edwin R. Hancock

2014-05-12T23:59:59.000Z

72

Measuring extremal dependencies in Web graphs Yana Volkovich  

E-Print Network [OSTI]

Measuring extremal dependencies in Web graphs Yana Volkovich University of Twente P.O. Box 217 dependencies in power law graph data (Web sample, Wikipedia sample and a preferential attachment graph) using of the proposed methods have never been applied to the Web graph data. This paper fills this gap. The new insights

Boucherie, Richard J.

73

Measuring Extremal Dependencies in Web Graphs Yana Volkovich  

E-Print Network [OSTI]

Measuring Extremal Dependencies in Web Graphs Yana Volkovich University of Twente P.O. Box 217 graph data (Web sample, Wikipedia sample and a preferential attachment graph) using statistical of the proposed meth- ods have never been used in the Web graph data mining. The present work fills this gap

Boucherie, Richard J.

74

What Energy Functions Can Be Minimized via Graph Cuts?  

E-Print Network [OSTI]

What Energy Functions Can Be Minimized via Graph Cuts? Vladimir Kolmogorov, Member, IEEE, and Ramin been developed to solve energy minimization problems in computer vision. Each of these techniques constructs a graph such that the minimum cut on the graph also minimizes the energy. Yet, because these graph

Field, David

75

What Energy Functions can be Minimized via Graph Cuts?  

E-Print Network [OSTI]

What Energy Functions can be Minimized via Graph Cuts? Vladimir Kolmogorov and Ramin Zabih Computer. In the last few years, several new algorithms based on graph cuts have been developed to solve energy cut on the graph also minimizes the energy. Yet because these graph constructions are complex

Field, David

76

A Note on Hamilton Cycles in Kneser Graphs Ian Shields  

E-Print Network [OSTI]

A Note on Hamilton Cycles in Kneser Graphs Ian Shields IBM P.O. Box 12195 Research Triangle Park) have Hamilton cycles when n #20; 27. A similar result is shown for bipartite Kneser graphs. 1 for Hamilton cycles in Kneser graphs, K(n; k), and bipartite Kneser graphs, H(n; k). With the exception

Savage, Carla D.

77

Optimal acyclic edge colouring of grid like graphs  

Science Journals Connector (OSTI)

We determine the values of the acyclic chromatic index of a class of graphs referred to as d-dimensional partial tori. These are graphs which can be expressed as the cartesian product of d graphs each of which is an induced path or cycle. This class ... Keywords: Acyclic chromatic index, Acyclic edge colouring, Graph, Hypercube, Mesh

Rahul Muthu, N. Narayanan, C. R. Subramanian

2010-11-01T23:59:59.000Z

78

Discrete Mathematics Algebraic and Topological Methods in Graph Theory  

E-Print Network [OSTI]

symmetrical trivalent graphs which lead to negative currature carbon and bovon nitrie chemical structures. (D

Mohar, Bojan

79

Fibonacci-like cubes as Z-transformation graphs  

Science Journals Connector (OSTI)

The Fibonacci cube @C"n is a subgraph of n-dimensional hypercube induced by the vertices without two consecutive ones. Klavzar and Zigert [Fibonacci cubes are the resonance graphs of fibonaccenes, Fibonacci Quart. 43 (2005) 269-276] proved that Fibonacci ... Keywords: Fibonacci cube, Lucas cube, Perfect matching, Plane bipartite graph, Resonance graph, Z-transformation graph

Heping Zhang, Lifeng Ou, Haiyuan Yao

2009-04-01T23:59:59.000Z

80

Discrete Applied Mathematics 121 (2002) 139153 NeST graphs  

E-Print Network [OSTI]

Discrete Applied Mathematics 121 (2002) 139­153 NeST graphs Ryan B. Haywarda; , Paul E. Kearneyb; received in revised form 14 March 2001; accepted 26 March 2001 Abstract We establish results on NeST graphs show the equivalence of proper NeST graphs and unit NeST graphs, the equivalence of ÿxed distance NeST

Hayward, Ryan B.

Note: This page contains sample records for the topic "view graph graph" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


81

IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 51, NO. 5, MAY 2005 1635 On Factor Graphs and the Fourier Transform  

E-Print Network [OSTI]

of turbo codes and low-den- sity parity-check codes has made the subject of codes on graphs and iterative the auxiliary symbol alphabets, may be viewed as an expanded form of TWL graph. A Forney graph (or normal

Kschischang, Frank R.

82

A role for matrices in graph theory  

E-Print Network [OSTI]

A ROLE FOR MATRICES IN GRAPH THEORY A Thesis by John Patrick McLean Submitted to the Graduate College of Texas A&M University in partial fulfillment of the requirement for the degree of MASTER OF SCIENCE May 1971 Ma]or Subject: Mathematics... A ROLE FOR MATRICES IN GRAPH THEORY A Thesis by John Patrick McLean Approved as to style and content by: (Chairman of Committee) (Head of Department) I (Member) (Member) May 1971 tp Qey $ ABSTRACT A Role for Matrices in Graph Theory...

McLean, John Patrick

1971-01-01T23:59:59.000Z

83

3-Rainbow Domination Number in Graphs  

Science Journals Connector (OSTI)

The k-rainbow domination is a location problem in operations research. Give an undirected graph G as the natural model of location problem. We have a set of k colors and assign an arbitrary subset of these col...

Kung-Jui Pai; Wei-Jai Chiu

2013-01-01T23:59:59.000Z

84

Graph Summarization with Bounded Error Saket Navlakha  

E-Print Network [OSTI]

of Maryland College Park, MD, USA-20742 saket@cs.umd.edu Rajeev Rastogi Yahoo! Labs Bangalore, India rrastogi@yahoo-inc Graphs are a fundamental abstraction that have been em- ployed for centuries to model real-world systems

Gruner, Daniel S.

85

On semidefinite programming bounds for graph bandwidth  

E-Print Network [OSTI]

May 24, 2011 ... We propose two new lower bounds on graph bandwidth and cyclic ... matrix computations, parallel computations, VLSI layout, etc; see, for example [19]. ...... problems by SeDuMi [30] using the Yalmip interface [22] with Matlab.

2011-05-24T23:59:59.000Z

86

Graph Implementations for Nonsmooth Convex Programs  

E-Print Network [OSTI]

Summary. We describe graph implementations, a generic method for represent- ... object-oriented features of Matlab to turn it into an optimization modeling language: ..... For matrix and array expressions, these rules are applied on an elemen-.

2007-09-07T23:59:59.000Z

87

The Minimum Rank Problem for Outerplanar Graphs.  

E-Print Network [OSTI]

??Given a simple graph G with vertex set V(G)={1,2,...,n} define S(G) to be the set of all real symmetric matrices A such that for all (more)

Sinkovic, John Henry

2013-01-01T23:59:59.000Z

88

Minimum rank of graphs that allow loops.  

E-Print Network [OSTI]

??The traditional "minimum rank problem" for simple graphs associates a set of symmetric matrices, the zero-nonzero pattern of whose off-diagonal entries are described by the (more)

Mikkelson, Rana C.

2008-01-01T23:59:59.000Z

89

Bipartite graph partitioning and data clustering  

SciTech Connect (OSTI)

Many data types arising from data mining applications can be modeled as bipartite graphs, examples include terms and documents in a text corpus, customers and purchasing items in market basket analysis and reviewers and movies in a movie recommender system. In this paper, the authors propose a new data clustering method based on partitioning the underlying biopartite graph. The partition is constructed by minimizing a normalized sum of edge weights between unmatched pairs of vertices of the bipartite graph. They show that an approximate solution to the minimization problem can be obtained by computing a partial singular value decomposition (SVD) of the associated edge weight matrix of the bipartite graph. They point out the connection of their clustering algorithm to correspondence analysis used in multivariate analysis. They also briefly discuss the issue of assigning data objects to multiple clusters. In the experimental results, they apply their clustering algorithm to the problem of document clustering to illustrate its effectiveness and efficiency.

Zha, Hongyuan; He, Xiaofeng; Ding, Chris; Gu, Ming; Simon, Horst D.

2001-05-07T23:59:59.000Z

90

Hamilton Paths in Generalized Petersen Graphs.  

E-Print Network [OSTI]

??This thesis puts forward the conjecture that for n > 3k with k > 2, the generalized Petersen graph, GP(n,k) is Hamilton-laceable if n is (more)

Pensaert, William

2006-01-01T23:59:59.000Z

91

Progressive transitions using body part motion graphs  

Science Journals Connector (OSTI)

In this work we describe a preliminary method for progressive transitions in human locomotions. To achieve this, motion graphs have been used to synthesize body part transitions and every part has been synchronized with the other parts using time scaling. ...

Adso Fernndez-Baena; David Miralles

2011-12-01T23:59:59.000Z

92

A Faster Algorithm for Computing Motorcycle Graphs  

Science Journals Connector (OSTI)

We present a new algorithm for computing motorcycle graphs that runs in $$O(n^{4/3+\\varepsilon })$$O(n4/3+) time for any $$\\varepsilon >0$$>0, improving on all previously known algorithms. The main application of this result is to computing the straight ... Keywords: 65D18, 68Q25, 68U05, Algorithms design and analysis, Medial axis, Motorcycle graph, Polygon, Straight skeleton

Antoine Vigneron, Lie Yan

2014-10-01T23:59:59.000Z

93

About equivalent interval colorings of weighted graphs  

Science Journals Connector (OSTI)

Given a graph G=(V,E) with strictly positive integer weights @w"i on the vertices i@?V, a k-interval coloring of G is a function I that assigns an interval I(i)@?{1,...,k} of @w"i consecutive integers (called colors) to each vertex i@?V. If two adjacent ... Keywords: Equivalent colorings, Interval coloring problem, Weighted graphs

Mathieu Bouchard; Mirjana angalovi?; Alain Hertz

2009-10-01T23:59:59.000Z

94

Accelerating semantic graph databases on commodity clusters  

SciTech Connect (OSTI)

We are developing a full software system for accelerating semantic graph databases on commodity cluster that scales to hundreds of nodes while maintaining constant query throughput. Our framework comprises a SPARQL to C++ compiler, a library of parallel graph methods and a custom multithreaded runtime layer, which provides a Partitioned Global Address Space (PGAS) programming model with fork/join parallelism and automatic load balancing over a commodity clusters. We present preliminary results for the compiler and for the runtime.

Morari, Alessandro; Castellana, Vito G.; Haglin, David J.; Feo, John T.; Weaver, Jesse R.; Tumeo, Antonino; Villa, Oreste

2013-10-06T23:59:59.000Z

95

Graph representation of protein free energy landscape  

SciTech Connect (OSTI)

The thermodynamics and kinetics of protein folding and protein conformational changes are governed by the underlying free energy landscape. However, the multidimensional nature of the free energy landscape makes it difficult to describe. We propose to use a weighted-graph approach to depict the free energy landscape with the nodes on the graph representing the conformational states and the edge weights reflecting the free energy barriers between the states. Our graph is constructed from a molecular dynamics trajectory and does not involve projecting the multi-dimensional free energy landscape onto a low-dimensional space defined by a few order parameters. The calculation of free energy barriers was based on transition-path theory using the MSMBuilder2 package. We compare our graph with the widely used transition disconnectivity graph (TRDG) which is constructed from the same trajectory and show that our approach gives more accurate description of the free energy landscape than the TRDG approach even though the latter can be organized into a simple tree representation. The weighted-graph is a general approach and can be used on any complex system.

Li, Minghai; Duan, Mojie; Fan, Jue; Huo, Shuanghong, E-mail: shuo@clarku.edu [Gustaf H. Carlson School of Chemistry and Biochemistry, Clark University, 950 Main Street, Worcester, Massachusetts 01610 (United States)] [Gustaf H. Carlson School of Chemistry and Biochemistry, Clark University, 950 Main Street, Worcester, Massachusetts 01610 (United States); Han, Li [Department of Mathematics and Computer Science, Clark University, 950 Main Street, Worcester, Massachusetts 01610 (United States)] [Department of Mathematics and Computer Science, Clark University, 950 Main Street, Worcester, Massachusetts 01610 (United States)

2013-11-14T23:59:59.000Z

96

A Portrait Drawing Robot Using a Geometric Graph Approach: Furthest Neighbour Theta-Graphs  

E-Print Network [OSTI]

literature include painting robots where various type of systems were implemented [1], [2], [4]. For instanceA Portrait Drawing Robot Using a Geometric Graph Approach: Furthest Neighbour Theta-Graphs Meng drawing humanoid robot, Betty. To solve this line drawing problem we present a modified Theta

Durocher, Stephane

97

Graph Kernels Based on Relevant Patterns and Cycle Information for Chemoinformatics  

E-Print Network [OSTI]

by combining relevant cycles and newly discovered cycles. Horv´ath showed that a low number of iterationsGraph Kernels Based on Relevant Patterns and Cycle Information for Chemoinformatics Benoit Ga of view, graph kernels provide a nice framework for combining these two fields. We present in this paper

Boyer, Edmond

98

Streaming Graph Computations with a Helpful Advisor  

E-Print Network [OSTI]

Motivated by the trend to outsource work to commercial cloud computing services, we consider a variation of the streaming paradigm where a streaming algorithm can be assisted by a powerful helper that can provide annotations to the data stream. We extend previous work on such {\\em annotation models} by considering a number of graph streaming problems. Without annotations, streaming algorithms for graph problems generally require significant memory; we show that for many standard problems, including all graph problems that can be expressed with totally unimodular integer programming formulations, only a constant number of hash values are needed for single-pass algorithms given linear-sized annotations. We also obtain a protocol achieving \\textit{optimal} tradeoffs between annotation length and memory usage for matrix-vector multiplication; this result contributes to a trend of recent research on numerical linear algebra in streaming models.

Cormode, Graham; Thaler, Justin

2010-01-01T23:59:59.000Z

99

Sequoia tops Graph 500 list of 'big data' supercomputers  

Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

ATL062113_graph ATL062113_graph 06/21/2013 The Livermore Lab's Sequoia supercomputer topped the biannual Graph 500 list of the world's fastest systems for "big data" this week. The Graph 500 benchmark measures the speed with which a supercomputer can "connect the dots" within a massive set of data. Sequoia traversed 15,363 connections per second. Sequoia tops Graph 500 list of 'big data' supercomputers Donald B Johnston, LLNL, (925) 423-4902, johnston19@llnl.gov LLNL's 20 petaflops Sequoia supercomputer has retained its No. 1 ranking on the Graph 500 list, a measure of a system's ability to conduct analytic calculations -- finding the proverbial needle in the haystack. An IBM Blue Gene Q system, Sequoia was able to traverse 15,363 giga edges per second on a scale of 40 graph (a graph with 2^40 vertices). The new

100

An efficient semidefinite programming relaxation for the graph ...  

E-Print Network [OSTI]

The general graph partition problem (GPP) is defined as follows. Let G = (V ... We denote by A the adjacency matrix of G. For a given partition of the graph into k.

2012-08-28T23:59:59.000Z

Note: This page contains sample records for the topic "view graph graph" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


101

Synthesis of Parallel Hardware Implementations from Synchronous Dataflow Graph Specifications  

E-Print Network [OSTI]

Synthesis of Parallel Hardware Implementations from Synchronous Dataflow Graph Specifications, Berkeley Spring 1998 #12; Synthesis of Parallel Hardware Implementations from Synchronous Dataflow Graph Specifications Copyright © 1998 by Michael Cameron Williamson #12; 1 Abstract Synthesis of Parallel Hardware

102

Synthesis of Parallel Hardware Implementations from Synchronous Dataflow Graph Specifications  

E-Print Network [OSTI]

Synthesis of Parallel Hardware Implementations from Synchronous Dataflow Graph Specifications, Berkeley Spring 1998 #12;Synthesis of Parallel Hardware Implementations from Synchronous Dataflow Graph Specifications Copyright © 1998 by Michael Cameron Williamson #12;1 Abstract Synthesis of Parallel Hardware

103

Towards a Query-by-Example System for Knowledge Graphs  

Science Journals Connector (OSTI)

We witness an unprecedented proliferation of knowledge graphs that record millions of heterogeneous entities and their diverse relationships. While knowledge graphs are structure-flexible and content-rich, it is difficult to query them. The challenge ...

Nandish Jayaram; Arijit Khan; Chengkai Li; Xifeng Yan; Ramez Elmasri

2014-06-01T23:59:59.000Z

104

Graph Expansion, Tseitin Formulas and Resolution Proofs for CSP  

Science Journals Connector (OSTI)

We study the resolution complexity of Tseitin formulas over arbitrary rings in terms of combinatorial properties of graphs. We give some evidence that an expansion of a graph is a good characterization of the ...

Dmitry Itsykson; Vsevolod Oparin

2013-01-01T23:59:59.000Z

105

Graph isomorphism and adiabatic quantum computing  

Science Journals Connector (OSTI)

In the graph isomorphism (GI) problem two N-vertex graphs G and G? are given and the task is to determine whether there exists a permutation of the vertices of G that preserves adjacency and transforms G?G?. If yes, then G and G? are said to be isomorphic; otherwise they are nonisomorphic. The GI problem is an important problem in computer science and is thought to be of comparable difficulty to integer factorization. In this paper we present a quantum algorithm that solves arbitrary instances of GI and which also provides an approach to determining all automorphisms of a given graph. We show how the GI problem can be converted to a combinatorial optimization problem that can be solved using adiabatic quantum evolution. We numerically simulate the algorithm's quantum dynamics and show that it correctly (i) distinguishes nonisomorphic graphs; (ii) recognizes isomorphic graphs and determines the permutation(s) that connect them; and (iii) finds the automorphism group of a given graph G. We then discuss the GI quantum algorithm's experimental implementation, and close by showing how it can be leveraged to give a quantum algorithm that solves arbitrary instances of the NP-complete subgraph isomorphism problem. The computational complexity of an adiabatic quantum algorithm is largely determined by the minimum energy gap ?(N) separating the ground and first-excited states in the limit of large problem size N?1. Calculating ?(N) in this limit is a fundamental open problem in adiabatic quantum computing, and so it is not possible to determine the computational complexity of adiabatic quantum algorithms in general, nor consequently, of the specific adiabatic quantum algorithms presented here. Adiabatic quantum computing has been shown to be equivalent to the circuit model of quantum computing, and so development of adiabatic quantum algorithms continues to be of great interest.

Frank Gaitan and Lane Clark

2014-02-28T23:59:59.000Z

106

BAG: a graph theoretic sequence clustering algorithm  

Science Journals Connector (OSTI)

In this paper, we first discuss issues in clustering biological sequences with graph properties, which inspired the design of our sequence clustering algorithm BAG. BAG recursively utilises several graph properties: biconnectedness, articulation points, pquasi-completeness, and domain knowledge specific to biological sequence clustering. To reduce the fragmentation issue, we have developed a new metric called cluster utility to guide cluster splitting. Clusters are then merged back with less stringent constraints. Experiments with the entire COG database and other sequence databases show that BAG can cluster a large number of sequences accurately while keeping the number of fragmented clusters significantly low.

Sun Kim; Jason Lee

2006-01-01T23:59:59.000Z

107

Bose-Einstein condensation on quantum graphs  

E-Print Network [OSTI]

We present results on Bose-Einstein condensation (BEC) on general compact quantum graphs, i.e., one-dimensional systems with a (potentially) complex topology. We first investigate non-interacting many-particle systems and provide a complete classification of systems that exhibit condensation. We then consider models with interactions that consist of a singular part as well as a hardcore part. In this way we obtain generalisations of the Tonks-Girardeau gas to graphs. For this we find an absence of phase transitions which then indicates an absence of BEC.

Jens Bolte; Joachim Kerner

2014-03-02T23:59:59.000Z

108

Entanglement of graph states up to 8 qubits  

E-Print Network [OSTI]

The entanglement of graph states up to eight qubits is calculated in the regime of iteration calculation. The entanglement measures could be the relative entropy of entanglement, the logarithmic robustness or the geometric measure. All 146 local inequivalent graphs are classified as two categories: graphs with identical upper LOCC entanglement bound and lower bipartite entanglement bound, graphs with unequal bounds. The late may displays non-integer entanglement. The precision of iteration calculation of the entanglement is less than $10^{-14}$.

Xiao-yu Chen

2009-09-09T23:59:59.000Z

109

A survey of models of the web graph Anthony Bonato  

E-Print Network [OSTI]

A survey of models of the web graph Anthony Bonato Department of Mathematics Wilfrid Laurier University Waterloo, ON Canada, N2L 3C5 abonato@rogers.com Abstract. The web graph has been the focus of much rigorously. 1 Introduction The web graph W has nodes representing web pages, and edges rep- resenting

Bonato, Anthony

110

Comparison of coarsening schemes for multilevel graph partitioning  

E-Print Network [OSTI]

Comparison of coarsening schemes for multilevel graph partitioning C´edric Chevalier1 and Ilya Laboratory, Argonne, IL, USA, safro@mcs.anl.gov Abstract. Graph partitioning is a well-known optimization as a process of graph topology learning at different scales in order to generate a better approx- imation

Safro, Ilya

111

On minimum balanced bipartitions of triangle-free graphs  

Science Journals Connector (OSTI)

A balanced bipartition of a graph G is a partition of V(G) into two subsets V 1 and V 2 that differ in cardinality by at most 1. A minimum balanced bipartition of G ... Keywords: Balanced bipartition, Planar graphs, Triangle-free graphs

Haiyan Li; Yanting Liang; Muhuo Liu; Baogang Xu

2014-04-01T23:59:59.000Z

112

Hiroshi Ishikawa A Practical Introduction to Graph Cut  

E-Print Network [OSTI]

Technology Contents Overview / Brief history Energy minimization Graphs and their minimum cuts Energy Elevation map #12;History Probablistic methods (SA, ICM,...) have been used for energy minimization OR has Overview / Brief history Energy minimization Graphs and their minimum cuts Energy minimization via graph

Ishikawa, Hiroshi

113

Hamiltonian Cycles on Symmetrical Graphs Carlo H. Squin  

E-Print Network [OSTI]

Hamiltonian Cycles on Symmetrical Graphs Carlo H. Séquin Computer Science Division, EECS Department-connected symmetrical graphs are colored so that they form Hamiltonian cycles. As an introduction we discuss is to color all edges in these graphs with multi- ple congruent copies of Hamiltonian cycles exhibiting

O'Brien, James F.

114

Compatible Hamilton cycles in Dirac graphs Michael Krivelevich  

E-Print Network [OSTI]

Compatible Hamilton cycles in Dirac graphs Michael Krivelevich Choongbum Lee Benny Sudakov system F over a Dirac graph G, there exists a Hamilton cycle compatible with F. This settles in a very strong form, a conjecture of H¨aggkvist from 1988. 1 Introduction A Hamilton cycle in a graph G

Krivelevich, Michael

115

Infinite Hamilton Cycles in Squares of Locally Finite Graphs  

E-Print Network [OSTI]

Infinite Hamilton Cycles in Squares of Locally Finite Graphs Agelos Georgakopoulos Abstract We prove Diestel's conjecture that the square G2 of a 2-connected locally finite graph G has a Hamilton if and only if they have distance at most n in G. A Hamilton cycle in a graph is a cycle containing all its

Diestel, Reinhard

116

Robust Self-assembly of Graphs Stanislav Angelov1  

E-Print Network [OSTI]

Robust Self-assembly of Graphs Stanislav Angelov1 , Sanjeev Khanna2 , and Mirk´o Visontai3 1 Google, University of Pennsylvania Philadelphia, PA 19104, USA mirko@math.upenn.edu Abstract. Self-assembly studied model of self-assembly is the Accretive Graph Assembly Model whereby an edge-weighted graph

Pennsylvania, University of

117

Simultaneous Segmentation and Filtering via Reduced Graph Cuts  

E-Print Network [OSTI]

provides small graphs while preserving thin structures but do not offer low memory usage when the amount [7,4,13]. In [7], binary energy functions are minimized for the shape fitting problem with graph cutsSimultaneous Segmentation and Filtering via Reduced Graph Cuts N. Lermé F. Malgouyres LAGA UMR CNRS

Malgouyres, François

118

Cellular Algebras and Graph Invariants Based on Quantum Walks  

E-Print Network [OSTI]

We consider two graph invariants inspired by quantum walks- one in continuous time and one in discrete time. We will associate a matrix algebra called a cellular algebra with every graph. We show that, if the cellular algebras of two graphs have a similar structure, then they are not distinguished by either of the proposed invariants.

Jamie Smith

2011-03-01T23:59:59.000Z

119

EFFECTIVE RESISTANCE ON GRAPHS AND THE EPIDEMIC QUASIMETRIC  

E-Print Network [OSTI]

EFFECTIVE RESISTANCE ON GRAPHS AND THE EPIDEMIC QUASIMETRIC JOSH ERICSON, PIETRO POGGI distance, effective resistance, and modulus of path families. 1. Introduction Consider a finite contact into "natural" communities. We begin with some preliminaries on elementary graph theory. 2. Graphs 2.1. Notation

Poggi-Corradini, Pietro

120

Bicycles and Left-Right Tours in Locally Finite Graphs  

E-Print Network [OSTI]

Bicycles and Left-Right Tours in Locally Finite Graphs von Melanie Win Myint, M. S. Dem Department-Right Tours 29 6 LRTs Generate the Bicycle Space 43 7 The ABL Planarity Criterion 53 8 Pedestrian Graphs 69 bicycles and some other concepts they relate to, such as left- right tours and pedestrian graphs

Diestel, Reinhard

Note: This page contains sample records for the topic "view graph graph" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


121

Graph and matrix approaches to rough sets through matroids  

Science Journals Connector (OSTI)

Abstract Rough sets are efficient for attribute reduction and rule extraction in data mining. However, many important problems including attribute reduction in rough sets are NP-hard, therefore the algorithms to solve them are often greedy. Matroids, generalized from linear independence in vector spaces, provide well-established platforms for greedy algorithm design. In this paper, we use graph and matrix approaches to study rough sets through matroids. First, we construct an isomorphism from equivalence relations to 2-circuit matroids, and then propose graph representations of lower and upper approximations through the graphic matroid. We also study graph representations of lower and upper approximations by that of the dual of the matroid. Second, in light of the fact that the relational matrix is a representable matrix of the matroid induced by an equivalence relation, matrix representations of lower and upper approximations are obtained with the representable matrix of the matroid. In a word, borrowing from matroids, this work presents two interesting views, graph and matrix ones, to investigate rough sets.

Shiping Wang; Qingxin Zhu; William Zhu; Fan Min

2014-01-01T23:59:59.000Z

122

Parameterized Algorithms for Graph Partitioning Problems  

E-Print Network [OSTI]

) time algorithm for any FGPP. Parameterized by p, Max and Min k-Vertex Cover can be solved in times O (1Parameterized Algorithms for Graph Partitioning Problems Hadas Shachnai and Meirav Zehavi are constants defining the problem, and m1, m2 are the cardinalities of the edge sets having both endpoints

Shachnai, Hadas

123

Algorithms for Graphs (Locally) Bounded Treewidth  

E-Print Network [OSTI]

set, vertex cover and independent set. Others used this approach to solve other NP-hard problemsAlgorithms for Graphs of (Locally) Bounded Treewidth by MohammadTaghi Hajiaghayi A thesis presented-hard and hence there is no efficient algorithm for solving them, unless P= NP. One way to overcome this hardness

Hajiaghayi, Mohammad

124

Graph Domination, Coloring and Cliques in Telecommunications  

E-Print Network [OSTI]

Graph Domination, Coloring and Cliques in Telecommunications Balabhaskar Balasundaram and Sergiy for important problems that arise in different areas of wireless telecommunication. In particular, applications The telecommunication industry has always been a host for a wide variety of optimization problems. In recent years

Butenko, Sergiy

125

Optimizing Path Query Performance: Graph Clustering Strategies  

E-Print Network [OSTI]

ywh@us.ibm.com Ning Jingz Changsha Institute of Technology jning@eecs.umich.edu Elke A. Rundensteinerx not incur any run-time cost, requires no auxiliary data structures, and is complimentary to many of the performance of these graph clustering techniques using an actual city road network as well as randomly

126

The Web Graph of a Tourism System  

E-Print Network [OSTI]

The website network of a tourism destination is examined. The main statistical characteristics of the underlying graph are calculated. The topology of the network is similar to the one characterizing similar systems. However, some differences are found, mainly due to the relatively poor connectivity among the vertices of the network.

Baggio, R

2006-01-01T23:59:59.000Z

127

Connected obstructions to full graph homomorphisms  

Science Journals Connector (OSTI)

Minimal obstructions to full homomorphisms to a graph B have been proved to be of size at most |B|+1. This turns out to require that disconnected obstructions be allowed. In this paper we prove that the size of minimal connected obstructions is at most ...

Pavol Hell, Ale Pultr

2014-10-01T23:59:59.000Z

128

Graph Processing on an "almost" Relational Database  

Science Journals Connector (OSTI)

It would be hard to disagree with the contention that graph processing (whether it be of connections between people, shopping habits,...) allows the creation of valuable data-driven products and insights. There is less consensus on the systems that make ...

Ramesh Subramonian

2014-06-01T23:59:59.000Z

129

Betti Numbers of Graph Sean Jacques  

E-Print Network [OSTI]

ii Betti Numbers of Graph Ideals Sean Jacques Thesis submitted to the University of She but there are formulae for finding the Betti numbers (part of the information which comprises a minimal free resolution especially explicit or useful descriptions of the Betti numbers. However we restrict our attention to those

Katzman, Moty

130

Graph-Theoretic Scagnostics Leland Wilkinson  

E-Print Network [OSTI]

Tukey and Tukey scagnostics and develop graph- theoretic methods for implementing their procedure, statistical graphics 1 INTRODUCTION Around 20 years ago, John and Paul Tukey developed an ex- ploratory of the method were never published. Paul Tukey did offer more detail at an IMA visualization workshop a few

Grossman, Robert

131

NEST REPRESENTATIONS OF DIRECTED GRAPH ALGEBRAS  

E-Print Network [OSTI]

NEST REPRESENTATIONS OF DIRECTED GRAPH ALGEBRAS KENNETH R. DAVIDSON AND ELIAS KATSOULIS Abstract. This paper is a comprehensive study of the nest rep- resentations for the free semigroupoid algebra LG that the finite dimensional nest representations sep- arate the points in LG, and a fortiori, in T + (G

Katsoulis, Elias G.

132

Quantum graph as a quantum spectral filter  

SciTech Connect (OSTI)

We study the transmission of a quantum particle along a straight input-output line to which a graph {Gamma} is attached at a point. In the point of contact we impose a singularity represented by a certain properly chosen scale-invariant coupling with a coupling parameter {alpha}. We show that the probability of transmission along the line as a function of the particle energy tends to the indicator function of the energy spectrum of {Gamma} as {alpha}{yields}{infinity}. This effect can be used for a spectral analysis of the given graph {Gamma}. Its applications include a control of a transmission along the line and spectral filtering. The result is illustrated with an example where {Gamma} is a loop exposed to a magnetic field. Two more quantum devices are designed using other special scale-invariant vertex couplings. They can serve as a band-stop filter and as a spectral separator, respectively.

Turek, Ondrej; Cheon, Taksu [Laboratory of Physics, Kochi University of Technology, Tosa Yamada, Kochi 782-8502 (Japan)] [Laboratory of Physics, Kochi University of Technology, Tosa Yamada, Kochi 782-8502 (Japan)

2013-03-15T23:59:59.000Z

133

A Parallel Graph Partitioner for STAPL  

E-Print Network [OSTI]

A PARALLEL GRAPH PARTITIONER FOR STAPL A Thesis by NICOLAS CASTET Submitted to the O ce of Graduate Studies of Texas A&M University in partial ful llment of the requirements for the degree of MASTER OF SCIENCE Approved by: Chair... of Committee, Nancy M. Amato Co-Chair of Committee, Lawrence Rauchwerger Committee Member, Marvin L. Adams Department Head, Duncan M. Walker May 2013 Major Subject: Computer Science Copyright 2013 Nicolas Castet ABSTRACT Multi-core architectures...

Castet, Nicolas

2013-04-26T23:59:59.000Z

134

Locating-total domination in claw-free cubic graphs  

Science Journals Connector (OSTI)

In this paper, we continue the study of locating-total domination in graphs. A set S of vertices of a graph G is a total dominating set of G if every vertex of G is adjacent to a vertex in S . We consider total dominating sets S which have the additional property that distinct vertices in V ( G ) ? S are totally dominated by distinct subsets of the total dominating set. Such a set S is called a locating-total dominating set in G , and the locating-total domination number of G is the minimum cardinality of a locating-total dominating set in G . A claw-free graph is a graph that does not contain K 1 , 3 as an induced subgraph. We show that the locating-total domination number of a claw-free cubic graph is at most one-half its order and we characterize the graphs achieving this bound.

Michael A. Henning; Christian Lwenstein

2012-01-01T23:59:59.000Z

135

Sharp thresholds for Hamiltonicity in random intersection graphs  

Science Journals Connector (OSTI)

Random Intersection Graphs, G"n","m","p, is a class of random graphs introduced in Karonski (1999) [7] where each of the n vertices chooses independently a random subset of a universal set of m elements. Each element of the universal sets is chosen independently ... Keywords: Hamilton cycles, Random intersection graph, Sharp threshold, Stochastic order relation between Gn,p and Gn,m,p

Charilaos Efthymiou; Paul G. Spirakis

2010-09-01T23:59:59.000Z

136

k-Boson Quantum Walks Do Not Distinguish Arbitrary Graphs  

E-Print Network [OSTI]

In this paper, we define k-equivalence, a relation on graphs that relies on their associated cellular algebras. We show that a k-Boson quantum walk cannot distinguish pairs of graphs that are k- equivalent. The existence of pairs of k-equivalent graphs has been shown by Ponomarenko et al. [2, 6]. This gives a negative answer to a question posed by Gamble et al. [7].

Jamie Smith

2010-04-01T23:59:59.000Z

137

Ising-like models on arbitrary graphs : the Hadamard way  

E-Print Network [OSTI]

We propose a generic framework to analyse classical Ising-like models defined on arbitrary graphs. The energy spectrum is shown to be the Hadamard transform of a suitably defined vector associated with the graph. This allows a quick computation of this spectrum owing to the existence of a fast Hadamard transform algorithm (used for instance in image ccompression processes). We than go further and apply this formalism to regular graphs, such as hypercubic graphs, for which a simple recurrence relation for the spectrum is given, which speeds up even more its determination. First attempts to analyse partition functions and transfer matrices are also discussed.

Mosseri, Rmy

2014-01-01T23:59:59.000Z

138

Computing the stability number of a graph via linear and ...  

E-Print Network [OSTI]

Throughout the paper A(G) ? Sn will denote the adjacency matrix of the graph G, that is, the (i, ..... Some matlab code that constructs the relevant semidefi-.

2006-04-27T23:59:59.000Z

139

Independent set problems and odd-hole-preserving graph reductions  

E-Print Network [OSTI]

to provide a polynomial-time reduction in the size of the input required to decide the perfection or imperfection of a graph....

Warren, Jeffrey Scott

2009-05-15T23:59:59.000Z

140

Polyhedral graph abstractions and an approach to the Linear Hirsch ...  

E-Print Network [OSTI]

March 17, 2011. Abstract. We introduce a new combinatorial abstraction for the graphs of polyhe- dra. The new abstraction is a flexible framework defined by...

2011-03-17T23:59:59.000Z

Note: This page contains sample records for the topic "view graph graph" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


141

Isomorphism testing for circulant graphs Cn(a, b)  

E-Print Network [OSTI]

Isomorphism testing for circulant graphs Cn(a, b). Sara Nicoloso ?. Ugo Pietropaoli . March 10, 2010. Abstract. In this paper we focus on connected...

2010-03-10T23:59:59.000Z

142

A notable family of entire intrinsic minimal graph...  

E-Print Network [OSTI]

to C1(O). This notion of C2 surface obviously includes the entire intrinsic graphs ...... F. Serra Cassano, Surface measures in Carnot-Carathodory spaces, Calc.

2006-09-09T23:59:59.000Z

143

Graphs are among the most important abstract data structures in computer sci-ence, and the algorithms that operate on them are critical to modern life. Graphs  

E-Print Network [OSTI]

description that assumes a sparse matrix representation of the graph, and operates on that matrix with linear environments (e.g., Matlab ). (2) Ease of implementation. Parallel graph algorithms are notoriously difficult computation of graph algorithms. (3) Performance. Graph algorithms expressed by a series of sparse matrix

Kepner, Jeremy

144

Ising models on power-law random graphs Sander Dommers  

E-Print Network [OSTI]

Ising models on power-law random graphs Sander Dommers Cristian Giardin`a Remco van der Hofstad May 25, 2010 Abstract We study a ferromagnetic Ising model on random graphs with a power-law degree Introduction and results In this article we study the behavior of the Ising model on complex networks

Hofstad, Remco van der

145

GRAPH THEORY AND PFAFFIAN REPRESENTATIONS OF ISING PARTITION FUNCTION.  

E-Print Network [OSTI]

GRAPH THEORY AND PFAFFIAN REPRESENTATIONS OF ISING PARTITION FUNCTION. THIERRY GOBRON Abstract. A well known theorem due to Kasteleyn states that the partition function of an Ising model to the graph. This results both embodies the free fermionic nature of any planar Ising model and eventually

Recanati, Catherine

146

Human-assisted graph search: it's okay to ask questions  

Science Journals Connector (OSTI)

We consider the problem of human-assisted graph search: given a directed acyclic graph with some (unknown) target node(s), we consider the problem of finding the target node(s) by asking an omniscient human questions of the form "Is there a target ...

Aditya Parameswaran; Anish Das Sarma; Hector Garcia-Molina; Neoklis Polyzotis; Jennifer Widom

2011-02-01T23:59:59.000Z

147

Local algorithms for the prime factorization of strong product graphs  

E-Print Network [OSTI]

Local algorithms for the prime factorization of strong product graphs Marc Hellmuth, Wilfried factorization algorithms is limited in practise by unavoidable noise in the data. A first step towards error-tolerant "approximate" prime factorization, is the development of local approaches that cover the graph by factorizable

Stadler, Peter F.

148

Groups generated by bounded automata and their schreier graphs  

E-Print Network [OSTI]

that the Schreier graphs on levels of automaton groups can be constructed by an iterative procedure of inflation of graphs. This was used to associate a piecewise linear map of the form fK(v) = minA?KAv, where K is a finite set of nonnegative matrices, with every...

Bondarenko, Ievgen

2009-05-15T23:59:59.000Z

149

A SPATIAL WEB GRAPH MODEL WITH LOCAL INFLUENCE REGIONS  

E-Print Network [OSTI]

A SPATIAL WEB GRAPH MODEL WITH LOCAL INFLUENCE REGIONS W. AIELLO, A. BONATO, C. COOPER, J. JANSSEN- served in real-world networks such as the web graph. On the other hand, experimental and heuristic network can be recognized as densely linked subgraphs, or that web pages with many common neigh- bours

Pralat, Pawel

150

Semidefinite programming and eigenvalue bounds for the graph ...  

E-Print Network [OSTI]

The graph partition problem is the problem of partitioning the vertex set of a graph ... In this paper we simplify a known matrix-lifting semidefinite ...... [44] Sturm, J.F.: Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones.

2013-11-26T23:59:59.000Z

151

ADAGE: A software package for analyzing graph evolution  

E-Print Network [OSTI]

graph evolution. 2.2 Using ADAGE 2.2.1 Installation ADAGE was built for use on MATLAB 2007 version. In this case input is a string. If the MATLAB matrix has already been saved, simply run > input = loadADAGE: A software package for analyzing graph evolution Mary McGlohon, Christos Faloutsos May 2007

152

MATLAB Tutorial Getting Started with Calculations, Graphing and Programming  

E-Print Network [OSTI]

MATLAB Tutorial Getting Started with Calculations, Graphing and Programming Nicholas R. Kirchner UI 2 Calculations with MATLAB Standard Calculations and Variables Matrices and Vectors 3 Graphing NRK;Matrices and Vectors, Definitions MATLAB is short for MATrix LABoratory. It was built for high-speed matrix

Weinberger, Hans

153

New approximation algorithms for minimum cycle bases of graphs  

Science Journals Connector (OSTI)

We consider the problem of computing an approximate minimum cycle basis of an undirected edge-weighted graph G with m edges and n vertices; the extension to directed graphs is also discussed. In this problem, a {0, 1} incidence vector ...

Telikepalli Kavitha; Kurt Mehlhorn; Dimitrios Michail

2007-02-01T23:59:59.000Z

154

Rank Synopses for Efficient Time Travel on the Web Graph  

E-Print Network [OSTI]

Rank Synopses for Efficient Time Travel on the Web Graph Klaus Berberich, Srikanta Bedathur}@mpi-inf.mpg.de ProblemProblem SolutionSolution ExperimentsExperiments Step 1: PageRank Normalization We normalize PageRank scores computed on Gt ( Vt, Et ) (i.e., the graph at time t ) dividing by the lower bound PageRank score

155

Algorithms to Compute Minimum Cycle Basis in Directed Graphs #  

E-Print Network [OSTI]

, . . . ,C d whose incidence vectors permit a unique linear combination of the incidence vector of any cycleAlgorithms to Compute Minimum Cycle Basis in Directed Graphs # Telikepalli Kavitha + Kurt Mehlhorn # Abstract We consider the problem of computing a minimum cycle basis in a di­ rected graph G with m arcs

Mehlhorn, Kurt

156

VIDEO SUMMARIZATION BY VIDEO STRUCTURE ANALYSIS AND GRAPH OPTIMIZATION  

E-Print Network [OSTI]

VIDEO SUMMARIZATION BY VIDEO STRUCTURE ANALYSIS AND GRAPH OPTIMIZATION Shi Lu, Irwin King video summarization method that combines video structure analysis and graph optimiza- tion. First, we analyze the structure of the video, find the boundaries of video scenes, then we calculate each scene

King, Kuo Chin Irwin

157

Video Denoising and Simplification Via Discrete Regularization on Graphs  

E-Print Network [OSTI]

Video Denoising and Simplification Via Discrete Regularization on Graphs Mahmoud Ghoniem, Youssef algorithms for video de- noising and simplification based on discrete regularization on graphs. The main difference between video and image denoising is the temporal redundancy in video sequences. Recent works

Paris-Sud XI, Université de

158

Fast top-k simple shortest paths discovery in graphs  

Science Journals Connector (OSTI)

With the wide applications of large scale graph data such as social networks, the problem of finding the top-k shortest paths attracts increasing attention. This paper focuses on the discovery of the top-k simple shortest paths (paths without ... Keywords: graphs, shortest path, top-k

Jun Gao; Huida Qiu; Xiao Jiang; Tengjiao Wang; Dongqing Yang

2010-10-01T23:59:59.000Z

159

Some Remarks on Factor Graphs Hans-Andrea Loeliger  

E-Print Network [OSTI]

be used and combined in factor graphs. Keywords: factor graphs, turbo signal processing, gradient methodsA(x)fB(x)fC(x). (2) We expand this into f(x) = fA(x)fB(x )fC(x )(x - x )(x - x ), (3) #12;fA x = x fC fB x Figure 2

Loeliger, Hans-Andrea

160

Which Codes Have Cycle-Free Tanner Graphs?  

E-Print Network [OSTI]

, 2, 4, 5, 9, 11, 16, 17, 18, 22, 29, 30]. For example, the well- known turbo codes and turbo decoding-graph representations for turbo codes were introduced in [29, 30], where it is also shown that turbo decoding asymptotically good if the underlying Tanner graph is a sufficiently strong expander. These codes were studied

Karpovsky, Mark

Note: This page contains sample records for the topic "view graph graph" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


161

Graph-based Image Segmentation Using Weighted Color Patch  

E-Print Network [OSTI]

Graph-based Image Segmentation Using Weighted Color Patch Xiaofang Wang1 , Chao Zhu1 , Charles a new method based on the weighted color patch to compute the weight of edges in an affinity graph with color patches. Furthermore, we assign both local and global weights adaptively for each pixel in a patch

Paris-Sud XI, Université de

162

THE ELECTRICAL RESISTANCE OF A GRAPH CAPTURES ITS  

E-Print Network [OSTI]

THE ELECTRICAL RESISTANCE OF A GRAPH CAPTURES ITS COMMUTE AND COVER TIMES Ashok K. Chandra random walks and electrical networks by showing that resistance in this network is intimately connected of the graph is replaced by a unit resistance. As an example of the interplay between electrical

Borenstein, Elhanan

163

A COMBINATORIAL PROOF OF RAYLEIGH MONOTONICITY FOR GRAPHS  

E-Print Network [OSTI]

of the Rayleigh monotonicity property of graphs. Consider a (linear, resistive) electrical network, AND D.G. WAGNER Abstract. We give an elementary, self-contained, and purely com- binatorial proof allow graphs to have loops and/or mul- tiple edges. The value of ye is interpreted as the electrical

164

Bicyclic graphs with exactly two main signless Laplacian eigenvalues  

E-Print Network [OSTI]

A signless Laplacian eigenvalue of a graph $G$ is called a main signless Laplacian eigenvalue if it has an eigenvector the sum of whose entries is not equal to zero. In this paper, all connected bicyclic graphs with exactly two main eigenvalues are determined.

Huang, He

2012-01-01T23:59:59.000Z

165

Motorcycle Graphs and Straight Skeletons Siu-Wing Cheng  

E-Print Network [OSTI]

Motorcycle Graphs and Straight Skeletons Siu-Wing Cheng Antoine Vigneron March 17, 2005 Abstract We present a new algorithm to compute motorcycle graphs. It runs in O(n n log n) time when n is the number of motorcycles. We give a new characterization of the straight skeleton of a non

Vigneron, Antoine

166

On bounding the bandwidth of graphs with symmetry - Optimization ...  

E-Print Network [OSTI]

Hamming graph H(2,q) (also known as the lattice graph) has bandwidth equal to. (q+1)q. 2. ?1 .... 59. 10 3 120. 72. 75. 76. 90. Table 9: Bounds on the bandwidth of K(v,2) and K(v,3). v d meig .... Freeman, San Francisco, 1979. [19] Graham, A.

2013-08-08T23:59:59.000Z

167

International energy indicators. [Statistical tables and graphs  

SciTech Connect (OSTI)

International statistical tables and graphs are given for the following: (1) Iran - Crude Oil Capacity, Production and Shut-in, June 1974-April 1980; (2) Saudi Arabia - Crude Oil Capacity, Production, and Shut-in, March 1974-Apr 1980; (3) OPEC (Ex-Iran and Saudi Arabia) - Capacity, Production and Shut-in, June 1974-March 1980; (4) Non-OPEC Free World and US Production of Crude Oil, January 1973-February 1980; (5) Oil Stocks - Free World, US, Japan, and Europe (Landed, 1973-1st Quarter, 1980); (6) Petroleum Consumption by Industrial Countries, January 1973-December 1979; (7) USSR Crude Oil Production and Exports, January 1974-April 1980; and (8) Free World and US Nuclear Generation Capacity, January 1973-March 1980. Similar statistical tables and graphs included for the United States include: (1) Imports of Crude Oil and Products, January 1973-April 1980; (2) Landed Cost of Saudi Oil in Current and 1974 Dollars, April 1974-January 1980; (3) US Trade in Coal, January 1973-March 1980; (4) Summary of US Merchandise Trade, 1976-March 1980; and (5) US Energy/GNP Ratio, 1947 to 1979.

Bauer, E.K. (ed.)

1980-05-01T23:59:59.000Z

168

An Experiment on Graph Analysis Methodologies for Scenarios  

SciTech Connect (OSTI)

Visual graph representations are increasingly used to represent, display, and explore scenarios and the structure of organizations. The graph representations of scenarios are readily understood, and commercial software is available to create and manage these representations. The purpose of the research presented in this paper is to explore whether these graph representations support quantitative assessments of the underlying scenarios. The underlying structure of the scenarios is the information that is being targeted in the experiment and the extent to which the scenarios are similar in content. An experiment was designed that incorporated both the contents of the scenarios and analysts graph representations of the scenarios. The scenarios content was represented graphically by analysts, and both the structure and the semantics of the graph representation were attempted to be used to understand the content. The structure information was not found to be discriminating for the content of the scenarios in this experiment; but, the semantic information was discriminating.

Brothers, Alan J.; Whitney, Paul D.; Wolf, Katherine E.; Kuchar, Olga A.; Chin, George

2005-09-30T23:59:59.000Z

169

Graphical description of local Gaussian operations for continuous-variable weighted graph states  

E-Print Network [OSTI]

The form of a local Clifford (LC, also called local Gaussian (LG)) operation for the continuous-variable (CV) weighted graph states is presented in this paper, which is the counterpart of the LC operation of local complementation for qubit graph states. The novel property of the CV weighted graph states is shown, which can be expressed by the stabilizer formalism. It is distinctively different from the qubit weighted graph states, which can not be expressed by the stabilizer formalism. The corresponding graph rule, stated in purely graph theoretical terms, is described, which completely characterizes the evolution of CV weighted graph states under this LC operation. This LC operation may be applied repeatedly on a CV weighted graph state, which can generate the infinite LC equivalent graph states of this graph state. This work is an important step to characterize the LC equivalence class of CV weighted graph states.

Jing Zhang

2008-10-08T23:59:59.000Z

170

M&Ms4Graphs: Multi-scale, Multi-dimensional Graph Analytics Tools for Cyber-Security  

E-Print Network [OSTI]

ranging from micro- (host level) to macro-scale (enterprise level). Achievements · Major release of Graph Library - Exhibit at GraphLab Conference, July 2014 · Selected publications 1. "Towards A Networks-of-Networks of Machine Learning Research, 2014. Rendering of Network Traffic Data Showing Communication between IP

171

MapGraph: A High Level API for Fast Development of High Performance Graph Analytics on GPUs  

Science Journals Connector (OSTI)

High performance graph analytics are critical for a long list of application domains. In recent years, the rapid advancement of many-core processors, in particular graphical processing units (GPUs), has sparked a broad interest in developing high performance ... Keywords: GPU, Graph analytics, high-level API

Zhisong Fu; Michael Personick; Bryan Thompson

2014-06-01T23:59:59.000Z

172

Efficient broadcast on random geometric graphs  

SciTech Connect (OSTI)

A Randon Geometric Graph (RGG) is constructed by distributing n nodes uniformly at random in the unit square and connecting two nodes if their Euclidean distance is at most r, for some prescribed r. They analyze the following randomized broadcast algorithm on RGGs. At the beginning, there is only one informed node. Then in each round, each informed node chooses a neighbor uniformly at random and informs it. They prove that this algorithm informs every node in the largest component of a RGG in {Omicron}({radical}n/r) rounds with high probability. This holds for any value of r larger than the critical value for the emergence of a giant component. In particular, the result implies that the diameter of the giant component is {Theta}({radical}n/r).

Bradonjic, Milan [Los Alamos National Laboratory; Elsasser, Robert [UNIV OF PADERBORN; Friedrich, Tobias [INTERNATIONAL COMPUTER SCI.; Sauerwald, Thomas [INTERNATIONAL COMPUTER SCI.

2009-01-01T23:59:59.000Z

173

Bicyclic graphs with maximal revised Szeged index  

E-Print Network [OSTI]

The revised Szeged index $Sz^*(G)$ is defined as $Sz^*(G)=\\sum_{e=uv \\in E}(n_u(e)+ n_0(e)/2)(n_v(e)+ n_0(e)/2),$ where $n_u(e)$ and $n_v(e)$ are, respectively, the number of vertices of $G$ lying closer to vertex $u$ than to vertex $v$ and the number of vertices of $G$ lying closer to vertex $v$ than to vertex $u$, and $n_0(e)$ is the number of vertices equidistant to $u$ and $v$. Hansen used the AutoGraphiX and made the following conjecture about the revised Szeged index for a connected bicyclic graph $G$ of order $n \\geq 6$:

Li, Xueliang

2011-01-01T23:59:59.000Z

174

ASYMPTOTIC STUDY OF SUBCRITICAL GRAPH CLASSES MICHAEL DRMOTA, ERIC FUSY, MIHYUN KANG, VERONIKA KRAUS  

E-Print Network [OSTI]

ASYMPTOTIC STUDY OF SUBCRITICAL GRAPH CLASSES MICHAEL DRMOTA, ´ERIC FUSY, MIHYUN KANG, VERONIKA from the so-called "subcritical" graph classes, which include the classes of cacti graphs, outerplanar graphs chosen from subcritical classes. We show that the number gn/n! (resp. gn) of labelled (resp

Paris-Sud XI, Université de

175

THE MATCHING ENERGY OF A GRAPH IVAN GUTMAN AND STEPHAN WAGNER  

E-Print Network [OSTI]

(3) implies that the energy of a tree is a monotonically increasing function of any m(T, k) for the study of the energy of trees, we may consider it also for cycle­containing graphs. For such graphsTHE MATCHING ENERGY OF A GRAPH IVAN GUTMAN AND STEPHAN WAGNER Abstract. The energy of a graph G

Wagner, Stephan

176

Multiclass Diffuse Interface Models for Semi-supervised Learning on Graphs  

E-Print Network [OSTI]

Multiclass Diffuse Interface Models for Semi-supervised Learning on Graphs Cristina Garcia-Cardona1: Graph Segmentation, Diffuse Interfaces, Learning on Graphs. Abstract: We present a graph-based variational algorithm for multiclass classification of high-dimensional data, moti- vated by total variation

Percus, Allon

177

Locating and paired-dominating sets in graphs  

Science Journals Connector (OSTI)

In this paper, we continue the study of paired-domination in graphs introduced by Haynes and Slater [T.W. Haynes, P.J. Slater, Paired-domination in graphs, Networks 32 (1998), 199206]. A paired-dominating set of a graph G with no isolated vertex is a dominating set S of vertices whose induced subgraph has a perfect matching. We consider paired-dominating sets which are also locating sets, that is distinct vertices of G are dominated by distinct subsets of the paired-dominating set. We consider three variations of sets which are paired-dominating and locating sets and investigate their properties.

John McCoy; Michael A. Henning

2009-01-01T23:59:59.000Z

178

Geodesic Distance in Planar Graphs: An Integrable Approach  

E-Print Network [OSTI]

We discuss the enumeration of planar graphs using bijections with suitably decorated trees, which allow for keeping track of the geodesic distances between faces of the graph. The corresponding generating functions obey non-linear recursion relations on the geodesic distance. These are solved by use of stationary multi-soliton tau-functions of suitable reductions of the KP hierarchy. We obtain a unified formulation of the (multi-) critical continuum limit describing large graphs with marked points at large geodesic distances, and obtain integrable differential equations for the corresponding scaling functions. This provides a continuum formulation of two-dimensional quantum gravity, in terms of the geodesic distance.

P. Di Francesco

2005-06-27T23:59:59.000Z

179

The Graph Laplacian and the Dynamics of Complex Networks  

SciTech Connect (OSTI)

In this talk, we explore the structure of networks from a spectral graph-theoretic perspective by analyzing the properties of the Laplacian matrix associated with the graph induced by a network. We will see how the eigenvalues of the graph Laplacian relate to the underlying network structure and dynamics and provides insight into a phenomenon frequently observed in real world networks - the emergence of collective behavior from purely local interactions seen in the coordinated motion of animals and phase transitions in biological networks, to name a few.

Thulasidasan, Sunil [Los Alamos National Laboratory

2012-06-11T23:59:59.000Z

180

Local complementation rule for continuous-variable four-mode unweighted graph states  

E-Print Network [OSTI]

The local complementation rule is applied for continuous-variable (CV) graph states in the paper, which is an elementary graph transformation rule and successive application of which generates the orbit of any graph states. The corresponding local Gaussian transformations of local complementation for four-mode unweighted graph states were found, which do not mirror the form of the local Clifford unitary of qubit exactly. This work is an important step to characterize the local Gaussian equivalence classes of CV graph states.

Jing Zhang

2008-08-14T23:59:59.000Z

Note: This page contains sample records for the topic "view graph graph" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


181

Exact Solution of Graph Coloring Problems via Constraint ...  

E-Print Network [OSTI]

of coloring the vertices of a graph so that adjacent vertices have different ..... in a vector y having always the same order corresponding to that of matrix A rows.

2011-09-21T23:59:59.000Z

182

New Lower Bounds on the Stability Number of a Graph  

E-Print Network [OSTI]

Jun 27, 2007 ... adjacency matrix of G. The complete graph on n vertices is denoted by Kn. ..... We used MATLAB to compute each of the five bounds on each of...

2007-06-27T23:59:59.000Z

183

Modeling modern network attacks and countermeasures using attack graphs  

E-Print Network [OSTI]

By accurately measuring risk for enterprise networks, attack graphs allow network defenders to understand the most critical threats and select the most effective countermeasures. This paper describes substantial enhancements ...

Ingols, Kyle W.

184

Probabilistic flooding for efficient information dissemination in random graph topologies  

Science Journals Connector (OSTI)

Probabilistic flooding has been frequently considered as a suitable dissemination information approach for limiting the large message overhead associated with traditional (full) flooding approaches that are used to disseminate globally information in ... Keywords: Information dissemination, Probabilistic flooding, Random graphs

Konstantinos Oikonomou; Dimitrios Kogias; Ioannis Stavrakakis

2010-07-01T23:59:59.000Z

185

A description of dynamical graphs associated to elementary regulatory circuits  

Science Journals Connector (OSTI)

......regulatory networks (regulatory graphs), as...for recent reviews, De Jong (2002...notion of cross-regulatory modules and a...2003)). We plan to study the...simulation of genetic regulatory systems: a literature review. J. Comput......

E. Remy; B. Moss; C. Chaouiya; D. Thieffry

2003-09-01T23:59:59.000Z

186

Drawing a Graph in a Hypercube David R. Wood  

E-Print Network [OSTI]

Drawing a Graph in a Hypercube David R. Wood #3; Departament de Matem#18;atica Aplicada II Universitat Polit#18;ecnica de Catalunya Barcelona, Spain david.wood@upc.edu Submitted: Nov 16, 2004; Accepted

Wood, David R.

187

Drawing a Graph in a Hypercube David R. Wood  

E-Print Network [OSTI]

Drawing a Graph in a Hypercube David R. Wood Departament de Matem`atica Aplicada II Universitat Polit`ecnica de Catalunya Barcelona, Spain david.wood@upc.edu Submitted: Nov 16, 2004; Accepted: Aug 11

Wood, David R.

188

Ranking Outlier Nodes in Subspaces of Attributed Graphs  

E-Print Network [OSTI]

. Our graph outlier ranking (GOutRank) introduces scoring functions based on these selected subgraphs by looking at the most promising objects first. They 1http://www.ipd.kit.edu/~muellere/GOutRank/ allow users

Antwerpen, Universiteit

189

Diamond graphs and super-reflexivity William B. Johnson  

E-Print Network [OSTI]

Diamond graphs and super-reflexivity William B. Johnson and Gideon Schechtman Abstract The main results is that dimension reduction a-la Johnson­Lindenstrauss fails in any non super reflexive space

Johnson, William B.

190

Probabilistic Flooding for Efficient Information Dissemination in Random Graph  

E-Print Network [OSTI]

the benefits of the properly parameterized probabilistic flooding scheme. Simulation results sup- portProbabilistic Flooding for Efficient Information Dissemination in Random Graph Topologies 1 & Telecommunications, Athens, Greece Abstract Probabilistic flooding has been frequently considered as a suitable

Stavrakakis, Ioannis

191

Solving Steiner Tree Problems in Graphs with Lagrangian Relaxation  

Science Journals Connector (OSTI)

This paper presents an algorithm to obtain near optimal solutions for the Steiner tree problem in graphs. It is based on a Lagrangian relaxation of a multi-commodity flow formulation of the problem. An extensi...

Laura Bahiense; Francisco Barahona; Oscar Porto

2003-09-01T23:59:59.000Z

192

Technology Portfolio Planning by Weighted Graph Analysis of System Architectures  

E-Print Network [OSTI]

Technology Portfolio Planning by Weighted Graph Analysis of System Architectures Peter Davison and Bruce Cameron Massachusetts Institute of Technology, Cambridge, MA 02139 Edward F. Crawley Skolkovo Institute of Science and Technology, Skolkovo 143025, Russia Abstract5 Many systems undergo significant

de Weck, Olivier L.

193

Circuit and bond polytopes on series-parallel graphs$  

E-Print Network [OSTI]

Jul 10, 2014 ... In the literature, a circuit is sometimes called simple cycle. ... of the circuits of series-parallel graphs, combined with a theorem of Balas [2, 3].

2014-07-10T23:59:59.000Z

194

Graph Model for Carbon Dioxide Emissions from Metallurgical Plants  

Science Journals Connector (OSTI)

Mathematical models are presented for estimating carbon dioxide emissions from metallurgical processes. The article also presents ... in graph form to calculate transit and net emissions of carbon dioxide based o...

Yu. N. Chesnokov; V. G. Lisienko; A. V. Lapteva

2013-03-01T23:59:59.000Z

195

How are Feynman graphs resumed by the Loop Vertex Expansion?  

E-Print Network [OSTI]

The purpose of this short letter is to clarify which set of pieces of Feynman graphs are resummed in a Loop Vertex Expansion, and to formulate a conjecture on the $\\phi^4$ theory in non-integer dimension.

Vincent Rivasseau; Zhituo Wang

2010-06-23T23:59:59.000Z

196

A rigidity result for the graph case of the Penrose inequality  

E-Print Network [OSTI]

In this note we prove a global rigidity result for asymptotically flat, scalar flat Euclidean hypersurfaces with a minimal horizon lying in a hyperplane, under a natural ellipticity condition. As a consequence we obtain, in the context of the Riemannian Penrose conjecture, a local rigidity result for the family of exterior Schwarzschild solutions (viewed as graphs in Euclidean space).

Levi Lopes de Lima; Frederico Giro

2012-06-25T23:59:59.000Z

197

The Branching of Graphs in 2-d Quantum Gravity  

E-Print Network [OSTI]

The branching ratio is calculated for three different models of 2d gravity, using dynamical planar phi-cubed graphs. These models are pure gravity, the D=-2 Gaussian model coupled to gravity and the single spin Ising model coupled to gravity. The ratio gives a measure of how branched the graphs dominating the partition function are. Hence it can be used to estimate the location of the branched polymer phase for the multiple Ising model coupled to 2d gravity.

M. G. Harris

1996-07-16T23:59:59.000Z

198

K-theory of locally finite graph C Natalia Iyudu  

E-Print Network [OSTI]

in the case of an infinite graph with finite Betti number and obtain the formula K0(OE) = Z(E)+(E), where (E) is the first Betti number and (E) is the brunching number of the graph E. We note, that in the infinite case depends only on the first Betti number: K1(OE) = Z(E). These allow to provide a counterexample to the fact

199

Alliance Partition Number in Graphs Department of Mathematics  

E-Print Network [OSTI]

Alliance Partition Number in Graphs Linda Eroh Department of Mathematics University of Wisconsin)656-2355 Abstract Let G be a graph with vertex set V (G) and edge set E(G). A (defen- sive) alliance in G is a subset S of V (G) such that for every vertex v S, |N[v] S| |N(v) (V (G) - S)|. The alliance partition

Gera, Ralucca

200

The peculiar phase structure of random graph bisection  

SciTech Connect (OSTI)

The mincut graph bisection problem involves partitioning the n vertices of a graph into disjoint subsets, each containing exactly n/2 vertices, while minimizing the number of 'cut' edges with an endpoint in each subset. When considered over sparse random graphs, the phase structure of the graph bisection problem displays certain familiar properties, but also some surprises. It is known that when the mean degree is below the critical value of 2 log 2, the cutsize is zero with high probability. We study how the minimum cutsize increases with mean degree above this critical threshold, finding a new analytical upper bound that improves considerably upon previous bounds. Combined with recent results on expander graphs, our bound suggests the unusual scenario that random graph bisection is replica symmetric up to and beyond the critical threshold, with a replica symmetry breaking transition possibly taking place above the threshold. An intriguing algorithmic consequence is that although the problem is NP-hard, we can find near-optimal cutsizes (whose ratio to the optimal value approaches 1 asymptotically) in polynomial time for typical instances near the phase transition.

Percus, Allon G [Los Alamos National Laboratory; Istrate, Gabriel [E-AUSTRIA RESEARCH INSTITUTE; Goncalves, Bruno T [EMORY UNIV; Sumi, Robert Z [E-AUSTRIA RESEARCH INATITUTE

2008-01-01T23:59:59.000Z

Note: This page contains sample records for the topic "view graph graph" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


201

Mining the inner structure of the Web graph  

Science Journals Connector (OSTI)

Despite being the sum of decentralized and uncoordinated efforts by heterogeneous groups and individuals, the World Wide Web exhibits a well-defined structure, characterized by several interesting properties. This structure was clearly revealed by Broder et al (2000 Graph structure in the web Comput. Netw. 33 309) who presented the evocative bow-tie picture of the Web. Although, the bow-tie structure is a relatively clear abstraction of the macroscopic picture of the Web, it is quite uninformative with respect to the finer details of the Web graph. In this paper, we mine the inner structure of the Web graph. We present a series of measurements on the Web, which offer a better understanding of the individual components of the bow-tie. In the process, we develop algorithmic techniques for performing these measurements. We discover that the scale-free properties permeate all the components of the bow-tie which exhibit the same macroscopic properties as the Web graph itself. However, close inspection reveals that their inner structure is quite distinct. We show that the Web graph does not exhibit self similarity within its components, and we propose a possible alternative picture for the Web graph, as it emerges from our experiments.

Debora Donato; Stefano Leonardi; Stefano Millozzi; Panayiotis Tsaparas

2008-01-01T23:59:59.000Z

202

Discrete Mathematics and Theoretical Computer Science DMTCS vol. 11:2, 2009, 149160 Spectral characterizations of sun graphs and  

E-Print Network [OSTI]

characterizations of sun graphs and broken sun graphs Romain Boulet Institut de Math´ematiques de Toulouse by their spectrum by considering some unicyclic graphs. An odd (resp. even) sun is a graph obtained by appending a pendant vertex to each vertex of an odd (resp. even) cycle. A broken sun is a graph obtained by deleting

Paris-Sud XI, Université de

203

Liars domination in graphs  

Science Journals Connector (OSTI)

Assume that each vertex of a graph G is the possible location for an intruder such as a thief, or a saboteur, a fire in a facility or some possible processor fault in a computer network. A device at a vertex v is assumed to be able to detect the intruder at any vertex in its closed neighborhood N [ v ] and to identify at which vertex in N [ v ] the intruder is located. One must then have a dominating set S ? V ( G ) , a set with ? v ? S N [ v ] = V ( G ) , to be able to identify any intruders location. If any one device can fail to detect the intruder, then one needs a double-dominating set. This paper considers liars dominating sets, sets that can identify an intruders location even when any one device in the neighborhood of the intruder vertex can lie, that is, any one device in the neighborhood of the intruder vertex can misidentify any vertex in its closed neighborhood as the intruder location. Liars dominating sets lie between double dominating sets and triple dominating sets because every triple dominating set is a liars dominating set, and every liars dominating set must double dominate.

Miranda L. Roden; Peter J. Slater

2009-01-01T23:59:59.000Z

204

Multicoloured Random Graphs: The Random Dynamics Program  

E-Print Network [OSTI]

The Random Dynamics program is a proposal to explain the origin of all symmetries, including Lorentz and gauge invariance without appeal to any fundamental invariance of the laws of nature, and to derive the known physical laws in such a way as to be almost unavoidable. C. D. Froggatt and H. B. Nielsen proposed in their book Origin of Symmetries, that symmetries and physical laws should arise naturally from some essentially random dynamics rather than being postulated to be exact. The most useful assumption of the program that can be made about the fundamental laws is taken to be that they are random and then to see how known physics like mechanics and relativity follow from them. It is believed that almost any model of these regularities would appear in some limit for example as energies become small. Almost all theories or models at the fundamental level could then explain known physics. We suggest how using the formalism and properties of random graphs might be useful in developing the theory, and point towards directions in which it can be more fully extended in future work.

Sam Tarzi

2014-07-15T23:59:59.000Z

205

Alliance free sets in Cartesian product graphs  

E-Print Network [OSTI]

Let $G=(V,E)$ be a graph. For a non-empty subset of vertices $S\\subseteq V$, and vertex $v\\in V$, let $\\delta_S(v)=|\\{u\\in S:uv\\in E\\}|$ denote the cardinality of the set of neighbors of $v$ in $S$, and let $\\bar{S}=V-S$. Consider the following condition: {equation}\\label{alliancecondition} \\delta_S(v)\\ge \\delta_{\\bar{S}}(v)+k, \\{equation} which states that a vertex $v$ has at least $k$ more neighbors in $S$ than it has in $\\bar{S}$. A set $S\\subseteq V$ that satisfies Condition (\\ref{alliancecondition}) for every vertex $v \\in S$ is called a \\emph{defensive} $k$-\\emph{alliance}; for every vertex $v$ in the neighborhood of $S$ is called an \\emph{offensive} $k$-\\emph{alliance}. A subset of vertices $S\\subseteq V$, is a \\emph{powerful} $k$-\\emph{alliance} if it is both a defensive $k$-alliance and an offensive $(k +2)$-alliance. Moreover, a subset $X\\subset V$ is a defensive (an offensive or a powerful) $k$-alliance free set if $X$ does not contain any defensive (offensive or powerful, respectively) $k$-allianc...

Yero, Ismael G; Bermudo, Sergio

2011-01-01T23:59:59.000Z

206

Algorithms and architectures for high performance analysis of semantic graphs.  

SciTech Connect (OSTI)

Semantic graphs offer one promising avenue for intelligence analysis in homeland security. They provide a mechanism for describing a wide variety of relationships between entities of potential interest. The vertices are nouns of various types, e.g. people, organizations, events, etc. Edges in the graph represent different types of relationships between entities, e.g. 'is friends with', 'belongs-to', etc. Semantic graphs offer a number of potential advantages as a knowledge representation system. They allow information of different kinds, and collected in differing ways, to be combined in a seamless manner. A semantic graph is a very compressed representation of some of relationship information. It has been reported that the semantic graph can be two orders of magnitude smaller than the processed intelligence data. This allows for much larger portions of the data universe to be resident in computer memory. Many intelligence queries that are relevant to the terrorist threat are naturally expressed in the language of semantic graphs. One example is the search for 'interesting' relationships between two individuals or between an individual and an event, which can be phrased as a search for short paths in the graph. Another example is the search for an analyst-specified threat pattern, which can be cast as an instance of subgraph isomorphism. It is important to note than many kinds of analysis are not relationship based, so these are not good candidates for semantic graphs. Thus, a semantic graph should always be used in conjunction with traditional knowledge representation and interface methods. Operations that involve looking for chains of relationships (e.g. friend of a friend) are not efficiently executable in a traditional relational database. However, the semantic graph can be thought of as a pre-join of the database, and it is ideally suited for these kinds of operations. Researchers at Sandia National Laboratories are working to facilitate semantic graph analysis. Since intelligence datasets can be extremely large, the focus of this work is on the use of parallel computers. We have been working to develop scalable parallel algorithms that will be at the core of a semantic graph analysis infrastructure. Our work has involved two different thrusts, corresponding to two different computer architectures. The first architecture of interest is distributed memory, message passing computers. These machines are ubiquitous and affordable, but they are challenging targets for graph algorithms. Much of our distributed-memory work to date has been collaborative with researchers at Lawrence Livermore National Laboratory and has focused on finding short paths on distributed memory parallel machines. Our implementation on 32K processors of BlueGene/Light finds shortest paths between two specified vertices in just over a second for random graphs with 4 billion vertices.

Hendrickson, Bruce Alan

2005-09-01T23:59:59.000Z

207

Quantum ergodicity for graphs related to interval maps  

E-Print Network [OSTI]

We prove quantum ergodicity for a family of graphs that are obtained from ergodic one-dimensional maps of an interval using a procedure introduced by Pakonski et al (J. Phys. A, v. 34, 9303-9317 (2001)). As observables we take the L^2 functions on the interval. The proof is based on the periodic orbit expansion of a majorant of the quantum variance. Specifically, given a one-dimensional, Lebesgue-measure-preserving map of an interval, we consider an increasingly refined sequence of partitions of the interval. To this sequence we associate a sequence of graphs, whose directed edges correspond to elements of the partitions and on which the classical dynamics approximates the Perron-Frobenius operator corresponding to the map. We show that, except possibly for subsequences of density 0, the eigenstates of the quantum graphs equidistribute in the limit of large graphs. For a smaller class of observables we also show that the Egorov property, a correspondence between classical and quantum evolution in the semiclassical limit, holds for the quantum graphs in question.

G. Berkolaiko; J. P. Keating; U. Smilansky

2006-07-07T23:59:59.000Z

208

A graph-based system for network-vulnerability analysis  

SciTech Connect (OSTI)

This paper presents a graph-based approach to network vulnerability analysis. The method is flexible, allowing analysis of attacks from both outside and inside the network. It can analyze risks to a specific network asset, or examine the universe of possible consequences following a successful attack. The graph-based tool can identify the set of attack paths that have a high probability of success (or a low effort cost) for the attacker. The system could be used to test the effectiveness of making configuration changes, implementing an intrusion detection system, etc. The analysis system requires as input a database of common attacks, broken into atomic steps, specific network configuration and topology information, and an attacker profile. The attack information is matched with the network configuration information and an attacker profile to create a superset attack graph. Nodes identify a stage of attack, for example the class of machines the attacker has accessed and the user privilege level he or she has compromised. The arcs in the attack graph represent attacks or stages of attacks. By assigning probabilities of success on the arcs or costs representing level-of-effort for the attacker, various graph algorithms such as shortest-path algorithms can identify the attack paths with the highest probability of success.

Swiler, L.P.; Phillips, C.

1998-06-01T23:59:59.000Z

209

Pauli graph and finite projective lines/geometries  

E-Print Network [OSTI]

The commutation relations between the generalized Pauli operators of N-qudits (i. e., N p-level quantum systems), and the structure of their maximal sets of commuting bases, follow a nice graph theoretical/geometrical pattern. One may identify vertices/points with the operators so that edges/lines join commuting pairs of them to form the so-called Pauli graph P_{p^N} . As per two-qubits (p = 2, N = 2) all basic properties and partitionings of this graph are embodied in the geometry of the symplectic generalized quadrangle of order two, W(2). The structure of the two-qutrit (p = 3, N = 2) graph is more involved; here it turns out more convenient to deal with its dual in order to see all the parallels with the two-qubit case and its surmised relation with the geometry of generalized quadrangle Q(4, 3), the dual of W(3). Finally, the generalized adjacency graph for multiple (N > 3) qubits/qutrits is shown to follow from symplectic polar spaces of order two/three. The relevance of these mathematical concepts to mutually unbiased bases and to quantum entanglement is also highlighted in some detail.

Michel R. P. Planat; Metod Saniga

2007-03-16T23:59:59.000Z

210

Mining Large Heterogeneous Graphs using Cray s Urika  

SciTech Connect (OSTI)

Pattern discovery and predictive modeling from seemingly related Big Data represented as massive, ad-hoc, heterogeneous networks (e.g., extremely large graphs with complex, possibly unknown structure) is an outstanding problem in many application domains. To address this problem, we are designing graph-mining algorithms capable of discovering relationship-patterns from such data and using those discovered patterns as features for classification and predictive modeling. Specifically, we are: (i) exploring statistical properties, mechanics and generative models of behavior patterns in heterogeneous information networks, (ii) developing novel, automated and scalable graph-pattern discovery algorithms and (iii) applying our relationship-analytics (data science + network science) expertise to domains spanning healthcare to homeland security.

Sukumar, Sreenivas R [ORNL] [ORNL; Bond, Nathaniel A [ORNL] [ORNL

2013-01-01T23:59:59.000Z

211

Structural Testing: An Introduction Flow Graphs Path Testing Conclusions Path Testing  

E-Print Network [OSTI]

Structural Testing: An Introduction Flow Graphs Path Testing Conclusions Path Testing Mohammad Mousavi Eindhoven University of Technology, The Netherlands Software Testing, 2013 Mousavi: Path Testing #12;Structural Testing: An Introduction Flow Graphs Path Testing Conclusions Outline Structural

Mousavi, Mohammad

212

Structural Testing: An Introduction Flow Graphs Path Testing Conclusions Path Testing  

E-Print Network [OSTI]

Structural Testing: An Introduction Flow Graphs Path Testing Conclusions Path Testing Mohammad Mousavi Eindhoven University of Technology, The Netherlands Software Testing, 2012 Mousavi: Path Testing #12;Structural Testing: An Introduction Flow Graphs Path Testing Conclusions Outline Structural

Mousavi, Mohammad

213

Local context selection for outlier ranking in graphs with multiple numeric node attributes  

Science Journals Connector (OSTI)

Outlier ranking aims at the distinction between exceptional outliers and regular objects by measuring deviation of individual objects. In graphs with multiple numeric attributes, not all the attributes are relevant or show dependencies with the graph ...

Patricia Iglesias Snchez; Emmanuel Mller; Oretta Irmler; Klemens Bhm

2014-06-01T23:59:59.000Z

214

Improved upper bound for acyclic chromatic index of planar graphs without 4-cycles  

Science Journals Connector (OSTI)

Let $\\chi'_{a}(G)$ and ?(G) denote the acyclic chromatic index and the maximum degree of a graph G, respectively. Fiam?k ... Keywords: 4-Cycles, Acyclic edge coloring, Planar graph

Yingqian Wang; Ping Sheng

2014-04-01T23:59:59.000Z

215

Create reports and graphs | ENERGY STAR Buildings & Plants  

Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

Create reports and graphs Create reports and graphs Secondary menu About us Press room Contact Us Portfolio Manager Login Facility owners and managers Existing buildings Commercial new construction Industrial energy management Small business Service providers Service and product providers Verify applications for ENERGY STAR certification Design commercial buildings Energy efficiency program administrators Commercial and industrial program sponsors Associations State and local governments Federal agencies Tools and resources Training In this section Learn the benefits Get started Use Portfolio Manager The new ENERGY STAR Portfolio Manager How Portfolio Manager helps you save The benchmarking starter kit Identify your property type Enter data into Portfolio Manager The data quality checker How Portfolio Manager calculates metrics

216

Bifurcations of mutually coupled equations in random graphs  

E-Print Network [OSTI]

We study the behavior of solutions of mutually coupled equations in heterogeneous random graphs. Heterogeneity means that some equations receive many inputs whereas most of the equations are given only with a few connections. Starting from a situation where the isolated equations are unstable, we prove that a heterogeneous interaction structure leads to the appearance of stable subspaces of solutions. Moreover, we show that, for certain classes of heterogeneous networks, increasing the strength of interaction leads to a cascade of bifurcations in which the dimension of the stable subspace of solutions increases. We explicitly determine the bifurcation scenario in terms of the graph structure.

Eduardo Garibaldi; Tiago Pereira

2014-09-19T23:59:59.000Z

217

Groups generated by bounded automata and their schreier graphs  

E-Print Network [OSTI]

on levels of automaton groups can be constructed by an iterative procedure of inflation of graphs. This was used to associate a piecewise linear map of the form fK(v) = minA?KAv, where K is a finite set of nonnegative matrices, with every bounded automaton... and minimal growth of the components of f(n)K (v). We prove that the growth exponent of diameters of the Schreier graphs is equal to ?max and the orbital contracting coefficient of the group is equal to 1? min . We prove that the simple random walks on orbital...

Bondarenko, Ievgen

2008-10-10T23:59:59.000Z

218

Vacuum energy, spectral determinant and heat kernel asymptotics of graph Laplacians with general vertex matching conditions  

E-Print Network [OSTI]

We consider Laplace operators on metric graphs, networks of one-dimensional line segments (bonds), with matching conditions at the vertices that make the operator self-adjoint. Such quantum graphs provide a simple model of quantum mechanics in a classically chaotic system with multiple scales corresponding to the lengths of the bonds. For graph Laplacians we briefly report results for the spectral determinant, vacuum energy and heat kernel asymptotics of general graphs in terms of the vertex matching conditions.

J. M. Harrison; K. Kirsten

2010-03-16T23:59:59.000Z

219

Maximum edge-cuts in~cubic graphs with large girth and in~random cubic graphs  

E-Print Network [OSTI]

We show that for every cubic graph G with sufficiently large girth there exists a probability distribution on edge-cuts of G such that each edge is in a randomly chosen cut with probability at least 0.88672. This implies that G contains an edge-cut of size at least 1.33008n, where n is the number of vertices of G, and has fractional cut covering number at most 1.12776. The lower bound on the size of maximum edge-cut also applies to random cubic graphs. Specifically, a random n-vertex cubic graph a.a.s. contains an edge cut of size 1.33008n.

Kardos, Frantisek; Volec, Jan

2011-01-01T23:59:59.000Z

220

Partition functions of the Ising model on some self-similar Schreier graphs  

E-Print Network [OSTI]

Partition functions of the Ising model on some self-similar Schreier graphs Daniele D for the Ising model on three families of finite graphs converging to infinite self-similar graphs. Mathematics Subject Classification (2000). Primary 82B20; Secondary 05A15. Keywords. Ising model, partition

Smirnova-Nagnibeda, Tatiana

Note: This page contains sample records for the topic "view graph graph" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


221

Labeling Products of Complete Graphs with a Condition at Distance Two  

Science Journals Connector (OSTI)

For integers $j \\geq k$, an L(j,k)-labeling of a graph G is an integer labeling of the vertices in V(G) such that adjacent vertices receive integers which differ by at least j, and vertices which are distance ... Keywords: $\\lambda^j_k$-labeling, Cayley graph, product of complete graphs, vertex labeling

John P. Georges; David W. Mauro; Melanie I. Stein

2001-01-01T23:59:59.000Z

222

On generalized Petersen graphs labeled with a condition at distance two  

Science Journals Connector (OSTI)

An L(2, 1)-labeling of graph G is an integer labeling of the vertices in V(G) such that adjacent vertices receive labels which differ by at least two, and vertices which are distance two apart receive labels which differ by at least ... Keywords: ?-number, 3-regular graphs, L(2,1)-labeling, generalized Petersen graph

John P. Georges; David W. Mauro

2002-12-01T23:59:59.000Z

223

PARTITIONING HYPERGRAPHS IN SCIENTIFIC COMPUTING APPLICATIONS THROUGH VERTEX SEPARATORS ON GRAPHS  

E-Print Network [OSTI]

however, comes at a cost: algorithms on hypergraphs are inherently more complicated than those on graphsPARTITIONING HYPERGRAPHS IN SCIENTIFIC COMPUTING APPLICATIONS THROUGH VERTEX SEPARATORS ON GRAPHS of hypergraphs, nor the runtime efficiency of graph algorithms can be overlooked. Therefore, the new research

Pinar, Ali

224

Analyzing the Scalability of Graph Algorithms on Eldorado Keith D. Underwood1  

E-Print Network [OSTI]

Analyzing the Scalability of Graph Algorithms on Eldorado Keith D. Underwood1 , Megan Vance2 system provides exceptional perfor- mance on a variety of sparse graph algorithms. Unfor- tunately level scalability of the Eldorado platform on several graph algorithms. 1 Introduction Algorithms

Hendrickson, Bruce

225

Correlation and Contrast Link Formation Patterns in a Time Evolving Graph  

Science Journals Connector (OSTI)

A time evolving graph is becoming increasingly abundant in a wide variety of application domains. While several classes of advanced frequent patterns in time evolving graphs are proposed, in this paper, correlation and contrast patterns on link formations ... Keywords: subgraph mining, time evolving graph, contrast patterns, correlation patterns

Tomonobu Ozaki; Minoru Etoh

2011-12-01T23:59:59.000Z

226

Closed and Maximal Subgraph Mining in Internally and Externally Weighted Graph Databases  

Science Journals Connector (OSTI)

We formalize a problem of closed and maximal pattern discovery in internally and externally weighted graph databases. We introduce two weights, internal weights and external weights, which represent utility and significance of each edge in the graph, ... Keywords: subgraph mining, weighted graph, closed, maximal patterns

Tomonobu Ozaki; Minoru Etoh

2011-03-01T23:59:59.000Z

227

Protection of a Graph EJ Cockayne y , PJP Grobler z , WR Grundlingh z ,  

E-Print Network [OSTI]

four strategies, i.e. properties of such functions under which the entire graph may be deemed protected of guards required to protect the graph under the various strategies, are stud- ied. Exact values or boundsProtection of a Graph #3; EJ Cockayne y , PJP Grobler z , WR Grundlingh z , J Munganga ? & JH van

van Vuuren, Jan H.

228

SQBC: An efficient subgraph matching method over large and dense graphs  

Science Journals Connector (OSTI)

Recent progress in biology and computer science have generated many complicated networks, most of which can be modeled as large and dense graphs. Developing effective and efficient subgraph match methods over these graphs is urgent, meaningful and necessary. ... Keywords: Algorithm, Database, Graph theory, Index strategy, Large network, Subgraph isomorphism

Weiguo Zheng; Lei Zou; Xiang Lian; Huaming Zhang; Wei Wang; Dongyan Zhao

2014-03-01T23:59:59.000Z

229

Some Remarks on Cycles in Graphs and Digraphs \\Lambda Martin Loebl  

E-Print Network [OSTI]

Some Remarks on Cycles in Graphs and Digraphs \\Lambda Martin Loebl Department of Applied, Chile mmatamal@dim.uchile.cl Abstract We survey several recent results on cycles of graphs and directed graphs of the following form: 'Does there exist a set of cycles with a property P that generates all

Loebl, Martin

230

EVEN CYCLE DECOMPOSITIONS OF GRAPHS WITH NO ODD-K4-MINOR  

E-Print Network [OSTI]

EVEN CYCLE DECOMPOSITIONS OF GRAPHS WITH NO ODD-K4-MINOR TONY HUYNH, SANG-IL OUM, AND MARYAM VERDIAN-RIZI Abstract. An even cycle decomposition of a graph G is a partition of E(G) into cycles of even length. Evidently, every Eulerian bipartite graph has an even cycle decomposition. Seymour [circuits

Kim, Yong Jung

231

Improved bounds and algorithms for graph cuts and network reliability David G. Harris  

E-Print Network [OSTI]

Improved bounds and algorithms for graph cuts and network reliability David G. Harris Aravind, the graphs we deal with will be multi-graphs with no self-loops. We define R(p), the reliability polyno- mial there is no currently known algorithm for estimating R(p), the complementary probability U(p) = 1 - R(p), which we

Srinivasan, Aravind

232

CLAW-FREE 3-CONNECTED P11-FREE GRAPHS ARE HAMILTONIAN  

E-Print Network [OSTI]

CLAW-FREE 3-CONNECTED P11-FREE GRAPHS ARE HAMILTONIAN TOMASZ LUCZAK AND FLORIAN PFENDER Abstract. We show that every 3-connected claw-free graph which contains no induced copy of P11 is hamiltonian. Since there ex- ist non-hamiltonian 3-connected claw-free graphs without induced copies of P12

Pfender, Florian

233

The evolution of helping and harming on graphs: the return of the inclusive fitness effect  

E-Print Network [OSTI]

The evolution of helping and harming on graphs: the return of the inclusive fitness effect L relatedness between individuals promotes helping behaviour, evolu- tionary graph theory emphasizes., 2006; Ohtsuki & Nowak, 2006). Evolutionary graph theory models allow the effect of space on helping

Alvarez, Nadir

234

Task graph pre-scheduling, using Nash equilibrium in game theory  

Science Journals Connector (OSTI)

Prescheduling algorithms are targeted at restructuring of task graphs for optimal scheduling. Task graph scheduling is a NP-complete problem. This article offers a prescheduling algorithm for tasks to be executed on the networks of homogeneous processors. ... Keywords: Game theory, Nash equilibrium, Prescheduling, Scheduling, Task graph

Marjan Abdeyazdan; Saeed Parsa; Amir Masoud Rahmani

2013-04-01T23:59:59.000Z

235

Using Visualization Process Graphs to Improve Visualization Exploration  

E-Print Network [OSTI]

Using Visualization Process Graphs to Improve Visualization Exploration T. J. Jankun-Kelly1 University, MS 39762, USA. Email: tjk@acm.org Abstract. Visualization exploration is an iterative process, redundant exploration was quickly identified and eliminated. 1 Introduction During the visualization process

Jankun-Kelly, T. J.

236

MML Inference of Decision Graphs with Multi-way Joins  

Science Journals Connector (OSTI)

A decision tree is a comprehensible representation that has been widely used in many machine learning domains. But in the area of supervised learning, decision trees have their limitations. Two notable problems are those of replication and fragmentation. ... Keywords: MDL, MML, decision graphs, decision trees, machine learning, minimum message length, probabilistic prediction, supervised learning

Peter J. Tan; David L. Dowe

2002-12-01T23:59:59.000Z

237

Graphs, Rewriting and Pathway Reconstruction for Rule-Based Models  

E-Print Network [OSTI]

simulation of systems represented by rule- based models. This is founded on a new, clean, graph on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012). Editors: D. D'Souza, J ­ Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany #12;Danos et al. 277 illuminates choices made

Fontana, Walter

238

Even-Hole-Free Graphs Part II: Recognition Algorithm  

E-Print Network [OSTI]

of Computer Studies, University of Leeds, Leeds LS29JT, United Kingdom. This work was supported in part by NSF, University of Waterloo on an NSERC Canada International Fellowship. Ajai Kapoor was supported by a grant from recognition algorithm for even-hole-free graphs. The algorithm builds on a structural theorem proved in [4

Cornuejols, Gerard P.

239

Finding good decompositions for dynamic programming on dense graphs  

Science Journals Connector (OSTI)

It is well-known that for graphs with high edge density the tree-width is always high while the clique-width can be low. Boolean-width is a new parameter that is never higher than tree-width or clique-width and can in fact be as small as logarithmic ...

Eivind Magnus Hvidevold; Sadia Sharmin; Jan Arne Telle; Martin Vatshelle

2011-09-01T23:59:59.000Z

240

Optimizing Path Query Performance: Graph Clustering Strategies \\Lambda  

E-Print Network [OSTI]

.J. Watson Labs ywh@us.ibm.com Ning Jing z Changsha Institute of Technology jning@eecs.umich.edu Elke A because it does not incur any run­time cost, requires no auxiliary data structures, and is complimentary evaluation of the performance of these graph clustering techniques using an actual city road network as well

Note: This page contains sample records for the topic "view graph graph" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


241

A graph-based network-vulnerability analysis system  

SciTech Connect (OSTI)

This report presents a graph-based approach to network vulnerability analysis. The method is flexible, allowing analysis of attacks from both outside and inside the network. It can analyze risks to a specific network asset, or examine the universe of possible consequences following a successful attack. The analysis system requires as input a database of common attacks, broken into atomic steps, specific network configuration and topology information, and an attacker profile. The attack information is matched with the network configuration information and an attacker profile to create a superset attack graph. Nodes identify a stage of attack, for example the class of machines the attacker has accessed and the user privilege level he or she has compromised. The arcs in the attack graph represent attacks or stages of attacks. By assigning probabilities of success on the arcs or costs representing level-of-effort for the attacker, various graph algorithms such as shortest-path algorithms can identify the attack paths with the highest probability of success.

Swiler, L.P.; Phillips, C. [Sandia National Labs., Albuquerque, NM (United States); Gaylor, T. [3M, Austin, TX (United States). Visual Systems Div.

1998-01-01T23:59:59.000Z

242

A graph-based network-vulnerability analysis system  

SciTech Connect (OSTI)

This paper presents a graph based approach to network vulnerability analysis. The method is flexible, allowing analysis of attacks from both outside and inside the network. It can analyze risks to a specific network asset, or examine the universe of possible consequences following a successful attack. The analysis system requires as input a database of common attacks, broken into atomic steps, specific network configuration and topology information, and an attacker profile. The attack information is matched with the network configuration information and an attacker profile to create a superset attack graph. Nodes identify a stage of attack, for example the class of machines the attacker has accessed and the user privilege level he or she has compromised. The arcs in the attack graph represent attacks or stages of attacks. By assigning probabilities of success on the arcs or costs representing level of effort for the attacker, various graph algorithms such as shortest path algorithms can identify the attack paths with the highest probability of success.

Swiler, L.P.; Phillips, C.; Gaylor, T.

1998-05-03T23:59:59.000Z

243

Approximating the Diameter of Planar Graphs in Near Linear Time  

E-Print Network [OSTI]

common starting vertex. Let Gin (resp. Gout) be the subgraph of G induced by C and all interior (resp. exterior) vertices to C. Let d(Gin, Gout, G) denote the largest distance in the graph G between a marked vertex in V (Gin) and a marked vertex in V (Gout). In the beginning, all vertices of G are marked and we

Yuster, Raphael

244

Lesson Summary Students will graph past sea level data obtained  

E-Print Network [OSTI]

World Numbers Symbolic Relationships Habits of Mind Communication Skills NSES Science Standards Science History and Nature of Science Nature of Science NCGE Geography Standards The Uses of Geography Standard 17 Teaching Time: 20 ­ 30 minutes Materials · Graph paper · Ruler · Pen or pencil Advanced Planning

Mojzsis, Stephen J.

245

Describing bond graph models of hydraulic components in Modelica  

Science Journals Connector (OSTI)

In this paper we discuss an object oriented description of bond graph models of hydraulic components by means of the unified modeling language Modelica. A library which is still under development is briefly described and models of some standard hydraulic components are given for illustration. In particular we address the modeling of hydraulic orifices.

W. Borutzky; B. Barnard; J.U. Thoma

2000-01-01T23:59:59.000Z

246

Mining Large Graphs And Streams Using Matrix And Tensor Tools  

E-Print Network [OSTI]

RESULTS The graphs at right show overall variability distribution estimated for the Pentium D 800 where a core no longer works properly. In the Sun T1 Niagara cores this is done with a built-in- self processors we record the temperature at which the failure occurred and adjust to the frequencies

Kolda, Tamara G.

247

Compact Routing on Internet-Like Graphs Dmitri Krioukov  

E-Print Network [OSTI]

Compact Routing on Internet-Like Graphs Dmitri Krioukov Email: dima@krioukov.net Kevin Fall Intel and simulation, we derive the stretch distribution of this routing scheme on Internet-like interdomain topologies that the average TZ stretch is quite low and virtually independent of . In particular, for the Internet interdomain

Yang, Xiaowei

248

Proc. AAAI-13 1 Concurrent Reasoning with Inference Graphs  

E-Print Network [OSTI]

Proc. AAAI-13 1 Concurrent Reasoning with Inference Graphs Daniel R. Schlegel and Stuart C. Shapiro Department of Computer Science and Engineering University at Buffalo, Buffalo NY, 14260 shapiro complex problem (Shapiro 1989). Parallelizing Datalog has been more successful, but it is a less

Shapiro, Stuart C.

249

Proc. GKR 2013 Concurrent Reasoning with Inference Graphs  

E-Print Network [OSTI]

Proc. GKR 2013 Concurrent Reasoning with Inference Graphs Daniel R. Schlegel and Stuart C. Shapiro Department of Computer Science and Engineering University at Buffalo shapiro>@buffalo.edu Abstract [Shapiro, 1989], largely because there is no persistent underlying representation of the relationships be

Shapiro, Stuart C.

250

Simulation of an Electrical Substation Using the Bond Graph Technique  

Science Journals Connector (OSTI)

Simulation and especially computer simulation, is a basic tool since it enables engineers to understand how systems work without actually needing to see them. They can learn how they work in different circumstances and optimize their design with considerably ... Keywords: simulation, electrical substations, elements, electricity, bond graph

Gregorio Romero; Jesus Felez; Joaquin Maroto; Jose Manuel Mera

2008-04-01T23:59:59.000Z

251

MATLAB Tutorial Getting Started with Calculations, Graphing and Programming  

E-Print Network [OSTI]

MATLAB Tutorial Getting Started with Calculations, Graphing and Programming Nicholas R. Kirchner University of Minnesota Thursday, August 30, 2012 #12;Outline 1 MATLAB installation NRK (University of Minnesota) MATLAB 2012.08.30 2 / 28 #12;Outline 1 MATLAB installation 2 The MATLAB UI NRK (University

Weinberger, Hans

252

The Optimal Rescue Path Set Problem in Undirected Graphs  

Science Journals Connector (OSTI)

This paper proposes the optimal rescue path set problem in an undirected graph G?=?(V,E), in which some vehicles have to go from a source node s to a destination node t. However, during the traveling of the vehic...

Huili Zhang; Yinfeng Xu

2013-01-01T23:59:59.000Z

253

Insider Threat Detection using Stream Mining and Graph Mining  

E-Print Network [OSTI]

Insider Threat Detection using Stream Mining and Graph Mining Pallabi Parveen, Jonathan Evans threats who attempt to conceal their activities by varying their behaviors over time. This paper applies of insider threat detection, demonstrating that the ensemble-based approach is significantly more effective

Hamlen, Kevin W.

254

An Approach to Security Policy Configuration Using Semantic Threat Graphs  

E-Print Network [OSTI]

An Approach to Security Policy Configuration Using Semantic Threat Graphs Simon N. Foley, in turn, unnecessarily expose the enterprise to known threats. This paper pro- poses a threat management- nomic configuration of security mechanisms. This knowledge is mod- eled in terms of Semantic Threat

Foley, Simon

255

Decentralized Semantic Threat Graphs Simon N. Foley1  

E-Print Network [OSTI]

Decentralized Semantic Threat Graphs Simon N. Foley1 William M. Fitzgerald1 Cork Constraint.foley@cs.ucc.ie wfitzgerald@4c.ucc.ie Abstract. Threat knowledge-bases such as those maintained by MITRE and NIST provide a basis with which to mitigate known threats to an enterprise. These centralised knowledge-bases assume

Foley, Simon

256

Structured Region Graphs: Morphing EP into GBP Max Welling  

E-Print Network [OSTI]

Structured Region Graphs: Morphing EP into GBP Max Welling Dept. of Computer Science UC Irvine@eecs.berkeley.edu Abstract GBP and EP are two successful algo­ rithms for approximate probabilistic infer­ ence, which on these structures allow conversion between EP and GBP free ener­ gies. Thus it is revealed that all EP ap

Welling, Max

257

Structured Region Graphs: Morphing EP into GBP Max Welling  

E-Print Network [OSTI]

Structured Region Graphs: Morphing EP into GBP Max Welling Dept. of Computer Science UC Irvine@eecs.berkeley.edu Abstract GBP and EP are two successful algo- rithms for approximate probabilistic infer- ence, which on these structures allow conversion between EP and GBP free ener- gies. Thus it is revealed that all EP ap

Welling, Max

258

Brain Mapping Using Topology Graphs Obtained by Surface Segmentation  

E-Print Network [OSTI]

Brain Mapping Using Topology Graphs Obtained by Surface Segmentation Fabien Vivodtzev1 , Lars@ucdavis.edu Summary. Brain mapping is a technique used to alleviate the tedious and time- consuming process of annotating brains by mapping existing annotations from brain atlases to individual brains. We introduce

Linsen, Lars

259

An Interchange File Format for Graphs Michael Himsolt  

E-Print Network [OSTI]

graphical information. It is designed as an extendible format and provides facilities such that other be as flexible and extensible as possible. Other programs should be able to write graph files with low overhead Ascii). Since end of line is encoded differ­ ently on different platform, we choose not to use end­of­line

Pentus, Mati

260

Classification of Adinkra Graphs A Senior Project submitted to  

E-Print Network [OSTI]

. We compute an invariant on the graphs: a sequence of natural numbers called Betti numbers given that gives the sequence of Betti numbers for any Adinkra. The equation depends only on N, the number Expression for the Betti Numbers . . . . . . . . . . . . . . . . . . 28 3.9 Computing the Betti Polynomial

Landweber, Gregory D.

Note: This page contains sample records for the topic "view graph graph" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


261

Quantitative Analysis of the Full Bitcoin Transaction Graph  

E-Print Network [OSTI]

Quantitative Analysis of the Full Bitcoin Transaction Graph Dorit Ron and Adi Shamir Department.ron,adi.shamir}@weizmann.ac.il Abstract. The Bitcoin scheme is a rare example of a large scale global payment system in which all and how they spend their bitcoins, the balance of bitcoins they keep in their accounts, and how they move

262

Hamilton cycles in graphs and hypergraphs: an extremal perspective  

E-Print Network [OSTI]

Hamilton cycles in graphs and hypergraphs: an extremal perspective Abstract. As one of the most fundamental and well-known NP-complete problems, the Hamilton cycle problem has been the subject of intensive and the study of Hamilton cycles in hypergraphs. We survey these developments and highlight open problems

Osthus, Deryk

263

HAMILTON CYCLES IN GRAPHS AND HYPERGRAPHS: AN EXTREMAL PERSPECTIVE  

E-Print Network [OSTI]

HAMILTON CYCLES IN GRAPHS AND HYPERGRAPHS: AN EXTREMAL PERSPECTIVE DANIELA K¨UHN AND DERYK OSTHUS Abstract. As one of the most fundamental and well-known NP-complete problems, the Hamilton cycle problem emerged, such as resilience, robustness and the study of Hamilton cycles in hypergraphs. We survey

Osthus, Deryk

264

HAMILTON CYCLES IN GRAPHS AND HYPERGRAPHS: AN EXTREMAL PERSPECTIVE  

E-Print Network [OSTI]

HAMILTON CYCLES IN GRAPHS AND HYPERGRAPHS: AN EXTREMAL PERSPECTIVE DANIELA K¨UHN AND DERYK OSTHUS Abstract. As one of the most fundamental and well-known NP-complete prob- lems, the Hamilton cycle problem emerged, such as resilience, robustness and the study of Hamilton cycles in hypergraphs. We survey

Osthus, Deryk

265

Compatible Hamilton cycles in random graphs Michael Krivelevich  

E-Print Network [OSTI]

Compatible Hamilton cycles in random graphs Michael Krivelevich Choongbum Lee Benny Sudakov, there exists a properly colored Hamilton cycle. Furthermore, our proof can be easily modified to show, there exists a Hamilton cycle in which all edges have distinct colors (i.e., a rainbow Hamilton cycle). 1

Sudakov, Benjamin

266

SEISMIC WAVES ESTIMATION AND WAVE FIELD DECOMPOSITION WITH FACTOR GRAPHS  

E-Print Network [OSTI]

SEISMIC WAVES ESTIMATION AND WAVE FIELD DECOMPOSITION WITH FACTOR GRAPHS Stefano Maranò Christoph, Dept. Information Technology & Electr. Eng., 8092 Zürich ABSTRACT Physical wave fields are often from sensors of different kinds. In this paper we propose a technique for the analysis of vector wave

Loeliger, Hans-Andrea

267

User's search behavior graph for aiding personalized web search  

Science Journals Connector (OSTI)

The www is a dynamic environment and it is difficult to capture the user preferences and interests without interfering with the normal activity of the user. Hence to improve user searching in the World Wide Web, we have proposed a personalized search ... Keywords: personalization, user conceptual index, user's search behavior graph, web information retrieval, web search

S. Sendhilkumar; T. V. Geetha

2007-12-01T23:59:59.000Z

268

Heat kernel estimates and related inequalities on metric graphs  

E-Print Network [OSTI]

We consider metric graphs with Kirchhoff boundary conditions. We study the intrinsic metric, volume doubling and a Poincar\\'e inequality. This enables us to prove a parabolic Harnack inequality. The proof involves various techniques from the theory of strongly local Dirichlet forms. Along our way we show Sobolev and Nash type inequalities and related heat kernel estimates.

Sebastian Haeseler

2011-01-15T23:59:59.000Z

269

SMITH INVARIANTS AND DUAL GRADED GRAPHS ALEXANDER MILLER  

E-Print Network [OSTI]

SMITH INVARIANTS AND DUAL GRADED GRAPHS ALEXANDER MILLER Abstract. The aim of this paper the Smith invariants immediately, as the eigenvalues are completely understood [3, 15]. Furthermore, we. Background 1 1.1. Differential posets 1 1.2. Eigenvalues 3 1.3. Smith invariants 3 2. Conjecture for r

Weinberger, Hans

270

Synchronous Black Hole Search in Directed Graphs Adrian Kosowski  

E-Print Network [OSTI]

Synchronous Black Hole Search in Directed Graphs Adrian Kosowski Alfredo Navarra Cristina M called black hole nodes, and once a robot enters in one of them, it is destroyed. The goal is to find supported by the Italian CNR Short-Term Mobility Program. A. Kosowski was supported Polish Ministry Grant N

Paris-Sud XI, Université de

271

WRIGHT'S CONSTANTS IN GRAPH ENUMERATION AND BROWNIAN EXCURSION AREA  

E-Print Network [OSTI]

WRIGHT'S CONSTANTS IN GRAPH ENUMERATION AND BROWNIAN EXCURSION AREA SVANTE JANSON Abstract - 1) = n n-2 for every n # 1. Wright [19] proved that for any fixed k # -1, we have the analoguous) Note the equivalent recursion formula # k+1 = 3k + 2 2 # k + k # j=0 # j # k-j , k # -1. (4) Wright

Janson, Svante

272

WRIGHT'S CONSTANTS IN GRAPH ENUMERATION AND BROWNIAN EXCURSION AREA  

E-Print Network [OSTI]

WRIGHT'S CONSTANTS IN GRAPH ENUMERATION AND BROWNIAN EXCURSION AREA SVANTE JANSON Abstract n 1. Wright [19] proved that for any fixed k -1, we have the analoguous asymptotic formula C(n, n-j, k -1. (4) Wright gives in the later paper [20] the same result in the form k = 2(1-5k)/23k1/2(k - 1

Janson, Svante

273

Concept generation of dynamic systems using bond graphs  

E-Print Network [OSTI]

REPRESENTATIONS OF IMMITTANCES . . . Immittance synthesis in design Conventional immit tance synthesis techniques by Foster and Cauer Immittance synthesis with bond graphs . . . . . . . . . . . . . Example - Synthesis of two frequency absorber... . . . . . . . . . 35 . 35 . 38 . . . . . . 40 . . . . . . 49 TABLE OF CONTENTS (Continued) CHAPTER Page V PHYSICAL REPRESENTATIONS OF TRANSFER FUNCTIONS Transfer function synthesis in design . . . . . . . . . . . General procedure Conditions for passive...

Krishnan, S

1990-01-01T23:59:59.000Z

274

The average number of distinct sites visited by a random walker on random graphs  

E-Print Network [OSTI]

We study the linear large $n$ behavior of the average number of distinct sites $S(n)$ visited by a random walker after $n$ steps on a large random graph. An expression for the graph topology dependent prefactor $B$ in $S(n) = Bn$ is proposed. We use generating function techniques to relate this prefactor to the graph adjacency matrix and then devise message-passing equations to calculate its value. Numerical simulations are performed to evaluate the agreement between the message passing predictions and random walk simulations on random graphs. Scaling with system size and average graph connectivity are also analysed.

De Bacco, Caterina; Sollich, Peter

2015-01-01T23:59:59.000Z

275

Potential-controlled filtering in quantum star graphs  

SciTech Connect (OSTI)

We study the scattering in a quantum star graph with a Fueloep-Tsutsui coupling in its vertex and with external potentials on the lines. We find certain special couplings for which the probability of the transmission between two given lines of the graph is strongly influenced by the potential applied on another line. On the basis of this phenomenon we design a tunable quantum band-pass spectral filter. The transmission from the input to the output line is governed by a potential added on the controlling line. The strength of the potential directly determines the passband position, which allows to control the filter in a macroscopic manner. Generalization of this concept to quantum devices with multiple controlling lines proves possible. It enables the construction of spectral filters with more controllable parameters or with more operation modes. In particular, we design a band-pass filter with independently adjustable multiple passbands. We also address the problem of the physical realization of Fueloep-Tsutsui couplings and demonstrate that the couplings needed for the construction of the proposed quantum devices can be approximated by simple graphs carrying only {delta} potentials. - Highlights: Black-Right-Pointing-Pointer Spectral filtering devices based on quantum graphs are designed theoretically. Black-Right-Pointing-Pointer The passband is controlled by the application of macroscopic potentials on lines. Black-Right-Pointing-Pointer The filters are built upon special Fulop-Tsutsui type couplings at graph vertices. Black-Right-Pointing-Pointer A method of construction of Fulop-Tsutsui vertices from delta potentials is devised.

Turek, Ondrej, E-mail: ondrej.turek@kochi-tech.ac.jp; Cheon, Taksu, E-mail: taksu.cheon@kochi-tech.ac.jp

2013-03-15T23:59:59.000Z

276

LDRD final report : first application of geospatial semantic graphs to SAR image data.  

SciTech Connect (OSTI)

Modeling geospatial information with semantic graphs enables search for sites of interest based on relationships between features, without requiring strong a priori models of feature shape or other intrinsic properties. Geospatial semantic graphs can be constructed from raw sensor data with suitable preprocessing to obtain a discretized representation. This report describes initial work toward extending geospatial semantic graphs to include temporal information, and initial results applying semantic graph techniques to SAR image data. We describe an efficient graph structure that includes geospatial and temporal information, which is designed to support simultaneous spatial and temporal search queries. We also report a preliminary implementation of feature recognition, semantic graph modeling, and graph search based on input SAR data. The report concludes with lessons learned and suggestions for future improvements.

Brost, Randolph C.; McLendon, William Clarence,

2013-01-01T23:59:59.000Z

277

Quantitative Analysis of the Full Bitcoin Transaction Graph  

E-Print Network [OSTI]

Abstract. The Bitcoin scheme is a rare example of a large scale global payment system in which all the transactions are publicly accessible (but in an anonymous way). We downloaded the full history of this scheme, and analyzed many statistical properties of its associated transaction graph. In this paper we answer for the first time a variety of interesting questions about the typical behavior of users, how they acquire and how they spend their bitcoins, the balance of bitcoins they keep in their accounts, and how they move bitcoins between their various accounts in order to better protect their privacy. In addition, we isolated all the large transactions in the system, and discovered that almost all of them are closely related to a single large transaction that took place in November 2010, even though the associated users apparently tried to hide this fact with many strange looking long chains and fork-merge structures in the transaction graph.

Dorit Ron; Adi Shamir

278

A graph-separation theorem for quantum causal models  

E-Print Network [OSTI]

A causal model is an abstract representation of a physical system as a directed acyclic graph (DAG), where the statistical dependencies are encoded using a graphical criterion called `d-separation'. Recent work by Wood & Spekkens shows that causal models cannot, in general, provide a faithful representation of quantum systems. Since d-separation encodes a form of Reichenbach's Common Cause Principle (RCCP), whose validity is questionable in quantum mechanics, we propose a generalised graph separation rule that does not assume the RCCP. We prove that the new rule faithfully captures the statistical dependencies between observables in a quantum network, encoded as a DAG, and is consistent with d-separation in a classical limit. We note that the resulting model is still unable to give a faithful representation of correlations stronger than quantum mechanics, such as the Popescu-Rorlich box.

Jacques Pienaar; Caslav Brukner

2014-10-31T23:59:59.000Z

279

Judicious partitions of graphs Bela Bollobas and Alexander Scott  

E-Print Network [OSTI]

, and for any graph G, there is a partition V (G) = k i=1 Vi such that e(G[Vi]) e(G)/ k+1 2 for i = 1 demand 1 #12;that e(G[Vi]) be fairly close to e(G)/k2 , for i = 1, . . . , k, and that e(Vi, Vj) be fairly close to 2e(G)/k2 , for 1 i

Scott, Alexander Alexander

280

A Tutte polynomial which distinguishes rooted unicyclic graphs  

Science Journals Connector (OSTI)

Let @C"@r be a rooted graph. For any subset S of E(@C) let C"@r(S) be the component of S containing @r. Define r(S)=|V(C"@r(S))|-1, nul"k(S)=|C"@r(S)|-r(S), and nul(S)=|S|-r(S). With these, define the three-variable greedoid Tutte polynomial of @C"@r, ...

Steven J. Tedford

2009-02-01T23:59:59.000Z

Note: This page contains sample records for the topic "view graph graph" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


281

Proximity graphs based multi-scale image segmentation  

SciTech Connect (OSTI)

We present a novel multi-scale image segmentation approach based on irregular triangular and polygonal tessellations produced by proximity graphs. Our approach consists of two separate stages: polygonal seeds generation followed by an iterative bottom-up polygon agglomeration into larger chunks. We employ constrained Delaunay triangulation combined with the principles known from the visual perception to extract an initial ,irregular polygonal tessellation of the image. These initial polygons are built upon a triangular mesh composed of irregular sized triangles and their shapes are ad'apted to the image content. We then represent the image as a graph with vertices corresponding to the polygons and edges reflecting polygon relations. The segmentation problem is then formulated as Minimum Spanning Tree extraction. We build a successive fine-to-coarse hierarchy of irregular polygonal grids by an iterative graph contraction constructing Minimum Spanning Tree. The contraction uses local information and merges the polygons bottom-up based on local region-and edge-based characteristics.

Skurikhin, Alexei N [Los Alamos National Laboratory

2008-01-01T23:59:59.000Z

282

Sequoia retains top ranking on Graph 500 for third year running  

Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

12113_sequoia 12113_sequoia 11/21/2013 High Resolution Image Lawrence Livermore's Sequoia supercomputer again retained its No. 1 ranking on the Graph 500 list. Sequoia retains top ranking on Graph 500 for third year running Donald B Johnston, LLNL, (925) 423-4902, johnston19@llnl.gov High Resolution Image From left: LLNL's Adam Bertsch, Dona Crawford and Scott Futral with the certificate for No. 1 on the Graph 500 in the SC13 DOE booth. LLNL's 20 petaflops Sequoia supercomputer again retained its No. 1 ranking on the Graph 500 list, a measure of a system's ability to conduct analytic calculations -- finding the proverbial needle in the haystack. An IBM Blue Gene Q system, Sequoia was able to traverse 15,363 giga edges per second on a scale of 40 graph (a graph with 2^40 vertices). The new

283

Graphical rule of transforming continuous-variable graph states by local homodyne detection  

E-Print Network [OSTI]

Graphical rule, describing that any single-mode homodyne detection turns a given continuous-variable (CV) graph state into a new one, is presented. Employing two simple graphical rules: local complement operation and vertex deletion (single quadrature-amplitude $\\hat{x}$ measurement), the graphical rule for any single-mode quadrature component measurement can be obtained. The shape of CV weighted graph state may be designed and constructed easily from a given larger graph state by applying this graphical rule.

Jing Zhang

2010-06-21T23:59:59.000Z

284

Time-varying Reeb Graphs for Continuous Space-Time Data  

SciTech Connect (OSTI)

The Reeb graph is a useful tool in visualizing real-valued data obtained from computational simulations of physical processes. We characterize the evolution of the Reeb graph of a time-varying continuous function defined in three-dimensional space. We show how to maintain the Reeb graph over time and compress the entire sequence of Reeb graphs into a single, partially persistent data structure, and augment this data structure with Betti numbers to describe the topology of level sets and with path seeds to assist in the fast extraction of level sets for visualization.

Edelsbrunner, H; Harer, J; Mascarenhas, A; Pascucci, V; Snoeyink, J

2008-04-22T23:59:59.000Z

285

A Penrose inequality for asymptotically locally hyperbolic graphs  

E-Print Network [OSTI]

We use the inverse mean curvature flow to prove a sharp Alexandrov-Fenchel-type inequality for a class of hypersurfaces in certain locally hyperbolic manifolds. As an application we derive an optimal Penrose inequality for asymptotically locally hyperbolic graphs in any dimension $n\\geq 3$. When the horizon has the topology of a compact surface of genus at least one, this provides an affirmative answer, for this class of initial data sets, to a question posed by Gibbons, Chru\\'sciel and Simon on the validity of a Penrose-type inequality for black hole solutions carrying a higher genus horizon.

Levi Lopes de Lima; Frederico Giro

2013-05-14T23:59:59.000Z

286

Solving planning-graph by compiling it into CSP Minh Binh Do & Subbarao Kambhampati  

E-Print Network [OSTI]

Solving planning-graph by compiling it into CSP Minh Binh Do & Subbarao Kambhampati Department to adapt CSP search techniques into the backward search phase of Graphplan. This paper describes GP-CSP, a system that does planning by automati- cally converting Graphplan's planning graph into a CSP encoding

Kambhampati, Subbarao

287

Random even graphs and the Ising model Geo#rey Grimmett # , Svante Janson +  

E-Print Network [OSTI]

Random even graphs and the Ising model Geo#rey Grimmett # , Svante Janson + September 19, 2007 Abstract We explore the relationship between the Ising model with inverse temperature #, the q = 2 random. For a planar graph G, the boundary edges of the + clusters of the Ising model on the planar dual of G forms

Janson, Svante

288

The Multivariate Ising Polynomial of a Graph Daniel Andren and Klas Markstrom  

E-Print Network [OSTI]

The Multivariate Ising Polynomial of a Graph Daniel Andr´en and Klas Markstr¨om Abstract. In this paper we discuss the two variable Ising polyno- mial in a graph theoretical setting. This polynomial has its origin in physics as the partition function of the Ising model with an external field. We prove

Markström, Klas

289

K6 MINORS IN LARGE 6-CONNECTED GRAPHS Ken-ichi Kawarabayashi  

E-Print Network [OSTI]

Princeton, NJ 08544, USA Robin Thomas2 School of Mathematics Georgia Institute of Technology Atlanta-20146 Hamburg, Germany ABSTRACT Jørgensen conjectured that every 6-connected graph G with no K6 minor hand, Conjecture 1.1 provides a nice and clean statement for 6-connected graphs. Unfortunately, it, too

Norin, Sergey

290

Perfect Graphs Edited by J.L. RAMIREZ ALFONSIN and B.A. REED  

E-Print Network [OSTI]

York . Brisbane . Toronto . Singapore #12; 1 The Theta Body and Imperfection F.B. Shepherd FundamentalPerfect Graphs Edited by J.L. RAMIREZ ALFONSIN and B.A. REED JOHN WILEY & SONS Chichester . New). Perfect Graphs. Editor J.L. Ram'irez Alfons'in and B.A. Reed c fl2000 John Wiley & Sons Ltd. #12; 2

Shepherd, Bruce

291

On Regular Graphs Optimally Labeled with a Condition at Distance Two  

Science Journals Connector (OSTI)

For positive integers $j \\geq k$, the $\\lambda_{j,k}$-number of graph G is the smallest span among all integer labelings of V(G) such that vertices at distance two receive labels which differ by at least k and adjacent vertices ... Keywords: $L(j, k)$-labeling, prism, regular graph

John P. Georges; David W. Mauro

2004-02-01T23:59:59.000Z

292

Possible and necessary winners in voting trees: majority graphs vs. profiles  

E-Print Network [OSTI]

Possible and necessary winners in voting trees: majority graphs vs. profiles Maria Silvia Pini like those of Gibbard and Sattertwhaite demonstrate that, under weak assumptions like an election in voting trees: majority graphs vs. profiles, Maria Silvia Pini, Francesca Rossi, Kristen Brent Venable

Rossi, Francesca

293

Dig-ta Video, Learn-ng Styes, and Student Understanding of Kinematics Graphs  

E-Print Network [OSTI]

Dig-ta Video, Learn-ng Styes, and Student Understanding of Kinematics Graphs Teresa Larkin Video, Learning Styles, and Student Understanding of Kinematics Graphs Introduction Student learning interactive digital video as well preferences and student understanding and their ability to interpret motion

Zollman, Dean

294

A SURVEY ON HAMILTON CYCLES IN DIRECTED GRAPHS DANIELA KUHN AND DERYK OSTHUS  

E-Print Network [OSTI]

A SURVEY ON HAMILTON CYCLES IN DIRECTED GRAPHS DANIELA K¨UHN AND DERYK OSTHUS Abstract. We survey some recent results on long-standing conjectures regard- ing Hamilton cycles in directed graphs towards Kelly's conjecture on Hamilton decompositions of regular tournaments: the edges of every regular

Kühn, Daniela

295

EDGE-DISJOINT HAMILTON CYCLES IN GRAPHS DEMETRES CHRISTOFIDES, DANIELA KUHN AND DERYK OSTHUS  

E-Print Network [OSTI]

EDGE-DISJOINT HAMILTON CYCLES IN GRAPHS DEMETRES CHRISTOFIDES, DANIELA K¨UHN AND DERYK OSTHUS at least n/8 edge-disjoint Hamilton cycles. More generally, we give an asymptotically best possible answer for the number of edge-disjoint Hamilton cycles that a graph G with minimum degree must have. We also prove

Osthus, Deryk

296

Bent Hamilton Cycles in d-Dimensional Grid Graphs Department of Computer Science  

E-Print Network [OSTI]

Bent Hamilton Cycles in d-Dimensional Grid Graphs F. Ruskey Department of Computer Science Classifications: 05C45, 05C38 Abstract A bent Hamilton cycle in a grid graph is one in which each edge Hamilton cycle if some dimension is even and d 3, and does not have a bent Hamilton cycle if all

Sawada, Joe

297

Improved group-theoretical method for eigenvalue problems of special symmetric structures, using graph theory  

Science Journals Connector (OSTI)

Group-theoretical methods for decomposition of eigenvalue problems of skeletal structures with symmetry employ the symmetry group of the structures and block-diagonalize their matrices. In some special cases, such decompositions can further be continued. ... Keywords: Decomposition, Eigenvalues, Group theory, Laplacian matrix, Mass graph, Natural frequency, Representation theory, Stiffness graph, Symmetry

A. Kaveh; M. Nikbakht

2010-01-01T23:59:59.000Z

298

Memory Bounds for the Distributed Execution of a Hierarchical Synchronous Data-Flow Graph  

E-Print Network [OSTI]

Memory Bounds for the Distributed Execution of a Hierarchical Synchronous Data-Flow Graph Karol analysis tech- nique to define the boundary of shared memory requirements of Multiprocessor System of transformations to the SDF graph so as to reveal its memory characteristics. These transformations produce

Paris-Sud XI, Université de

299

INDDGO: Integrated Network Decomposition & Dynamic programming for Graph Optimization  

SciTech Connect (OSTI)

It is well-known that dynamic programming algorithms can utilize tree decompositions to provide a way to solve some \\emph{NP}-hard problems on graphs where the complexity is polynomial in the number of nodes and edges in the graph, but exponential in the width of the underlying tree decomposition. However, there has been relatively little computational work done to determine the practical utility of such dynamic programming algorithms. We have developed software to construct tree decompositions using various heuristics and have created a fast, memory-efficient dynamic programming implementation for solving maximum weighted independent set. We describe our software and the algorithms we have implemented, focusing on memory saving techniques for the dynamic programming. We compare the running time and memory usage of our implementation with other techniques for solving maximum weighted independent set, including a commercial integer programming solver and a semi-definite programming solver. Our results indicate that it is possible to solve some instances where the underlying decomposition has width much larger than suggested by the literature. For certain types of problems, our dynamic programming code runs several times faster than these other methods.

Groer, Christopher S [ORNL; Sullivan, Blair D [ORNL; Weerapurage, Dinesh P [ORNL

2012-10-01T23:59:59.000Z

300

Vertex-Colored Graphs, Bicycle Spaces and Mahler Measure Kalyn R. Lamey Daniel S. Silver Susan G. Williams  

E-Print Network [OSTI]

Vertex-Colored Graphs, Bicycle Spaces and Mahler Measure Kalyn R. Lamey Daniel S. Silver Susan G to the bicycle space of the graph. For graphs G with a free Zd -action by automorphisms, C is a finitely identify the subspace C0 of based conservative vertex colorings with the bicycle space B of G. In section 3

Williams, Susan

Note: This page contains sample records for the topic "view graph graph" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


301

Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes  

Science Journals Connector (OSTI)

Abstract An identifying code is a subset of vertices of a graph with the property that each vertex is uniquely determined (identified) by its nonempty neighbourhood within the identifying code. When only vertices out of the code are asked to be identified, we get the related concept of a locating-dominating set. These notions are closely related to a number of similar and well-studied concepts such as the one of a test cover. In this paper, we study the decision problems Identifying Code and Locating-Dominating Set (which consist in deciding whether a given graph admits an identifying code or a locating-dominating set, respectively, with a given size) and their minimization variants Minimum Identifying Code and Minimum Locating-Dominating Set. These problems are known to be NP-hard, even when the input graph belongs to a number of specific graph classes such as planar bipartite graphs. Moreover, it is known that they are approximable within a logarithmic factor, but hard to approximate within any sub-logarithmic factor. We extend the latter result to the case where the input graph is bipartite, split or co-bipartite: both problems remain hard in these cases. Among other results, we also show that for bipartite graphs of bounded maximum degree (at least 3), the two problems are hard to approximate within some constant factor, a question which was open. We summarize all known results in the area, and we compare them to the ones for the related problem Dominating Set. In particular, our work exhibits important graph classes for which Dominating Set is efficiently solvable, but Identifying Code and Locating-Dominating Set are hard (whereas in all previous works, their complexity was the same). We also introduce graph classes for which the converse holds, and for which the complexities of Identifying Code and Locating-Dominating Set differ.

Florent Foucaud

2014-01-01T23:59:59.000Z

302

A framework for graph-based synthesis, analysis, and visualization of HPC cluster job data.  

SciTech Connect (OSTI)

The monitoring and system analysis of high performance computing (HPC) clusters is of increasing importance to the HPC community. Analysis of HPC job data can be used to characterize system usage and diagnose and examine failure modes and their effects. This analysis is not straightforward, however, due to the complex relationships that exist between jobs. These relationships are based on a number of factors, including shared compute nodes between jobs, proximity of jobs in time, etc. Graph-based techniques represent an approach that is particularly well suited to this problem, and provide an effective technique for discovering important relationships in job queuing and execution data. The efficacy of these techniques is rooted in the use of a semantic graph as a knowledge representation tool. In a semantic graph job data, represented in a combination of numerical and textual forms, can be flexibly processed into edges, with corresponding weights, expressing relationships between jobs, nodes, users, and other relevant entities. This graph-based representation permits formal manipulation by a number of analysis algorithms. This report presents a methodology and software implementation that leverages semantic graph-based techniques for the system-level monitoring and analysis of HPC clusters based on job queuing and execution data. Ontology development and graph synthesis is discussed with respect to the domain of HPC job data. The framework developed automates the synthesis of graphs from a database of job information. It also provides a front end, enabling visualization of the synthesized graphs. Additionally, an analysis engine is incorporated that provides performance analysis, graph-based clustering, and failure prediction capabilities for HPC systems.

Mayo, Jackson R.; Kegelmeyer, W. Philip, Jr.; Wong, Matthew H.; Pebay, Philippe Pierre; Gentile, Ann C.; Thompson, David C.; Roe, Diana C.; De Sapio, Vincent; Brandt, James M.

2010-08-01T23:59:59.000Z

303

Graph fusion algebras of WLM(p,p')  

E-Print Network [OSTI]

We consider the W-extended logarithmic minimal model WLM(p,p'). As in the rational minimal models, the so-called fundamental fusion algebra of WLM(p,p') is described by a simple graph fusion algebra. The fusion matrices in the regular representation thereof are mutually commuting, but in general not diagonalizable. Nevertheless, we show that they can be brought simultaneously to block-diagonal forms whose blocks are upper-triangular matrices of dimension 1, 3, 5 or 9. The directed graphs associated with the two fundamental modules are described in detail. The corresponding adjacency matrices share a complete set of common generalized eigenvectors organized as a web constructed by interlacing the Jordan chains of the two matrices. This web is here called a Jordan web and it consists of connected subwebs with 1, 3, 5 or 9 generalized eigenvectors. The similarity matrix, formed by concatenating these vectors, simultaneously brings the two fundamental adjacency matrices to Jordan canonical form modulo permutation similarity. The ranks of the participating Jordan blocks are 1 or 3, and the corresponding eigenvalues are given by 2cos(j\\pi/n) where j=0,...,n and n=p,p'. For p>1, only some of the modules in the fundamental fusion algebra of WLM(p,p') are associated with boundary conditions within our lattice approach. The regular representation of the corresponding fusion subalgebra has features similar to the ones in the regular representation of the fundamental fusion algebra, but with dimensions of the upper-triangular blocks and connected Jordan-web components given by 1, 2, 3 or 8. Some of the key results are illustrated for W-extended critical percolation WLM(2,3).

Jorgen Rasmussen

2009-11-17T23:59:59.000Z

304

Advances in model transformations by graph transformation: specification, execution and analysis  

Science Journals Connector (OSTI)

Model transformations are a core technology of today's model-driven software development processes. Graph transformations provide a state-of-the-art formalism to specify and execute such transformations in practice. This was the case in the SENSORIA ...

Gbor Bergmann; Artur Boronat; Reiko Heckel; Paolo Torrini; Istvn Rth; Dniel Varr

2011-01-01T23:59:59.000Z

305

On Zero-Sum \\({\\mathbb{Z}_k}\\) -Magic Labelings of 3-Regular Graphs  

Science Journals Connector (OSTI)

Let G = (V, E) be a finite loopless graph and let (A,+) be an abelian group with identity 0. Then an A-magic labeling of G is a function ...

Jeong-Ok Choi; J. P. Georges; David Mauro

2013-05-01T23:59:59.000Z

306

The Minimum Rank, Inverse Inertia, and Inverse Eigenvalue Problems for Graphs.  

E-Print Network [OSTI]

??For a graph G we define S(G) to be the set of all real symmetric n by n matrices whose off-diagonal zero/nonzero pattern is described (more)

Kempton, Mark Condie

2010-01-01T23:59:59.000Z

307

Design techniques for graph-based error-correcting codes and their applications  

E-Print Network [OSTI]

by channels afterward. The discovery of turbo codes and rediscovery of Low Density Parity Check codes (LDPC) have revived the research in channel coding with novel ideas and techniques on code concatenation, iterative decoding, graph-based construction...

Lan, Ching Fu

2006-04-12T23:59:59.000Z

308

GrIDS A GRAPH BASED INTRUSION DETECTION SYSTEM FOR LARGE NETWORKS  

E-Print Network [OSTI]

or groups of hosts. By analyzing the characteristics of the activity graphs, GrIDS detects and reports under contract DOD DABT 63-93-C-0045. intra-networks intranets to share and disseminate internal

California at Davis, University of

309

Novel approaches for solving large-scale optimization problems on graphs  

E-Print Network [OSTI]

This dissertation considers a class of closely related NP-hard otpimization problems on graphs that arise in many important applications, including network-based data mining, analysis of the stock market, social networks, coding theory, fault...

Trukhanov, Svyatoslav

2009-05-15T23:59:59.000Z

310

Mathematical misconceptions in graphing and central tendency among sixth grade and undergraduate students  

E-Print Network [OSTI]

of the requirements for the degree of MASTER OF SCIENCE August 2002 Major Subject: Curriculum and Instruction MATHEMATICAL MISCONCEPTIONS IN GRAPHING AND CENTRAL TENDENCY AMONG SIXTH GRADE AND UNDERGRADUATE STUDENTS A Thesis by MARY ELIZABETH HAMMER... lfeldt / Head of De artment) August 2002 Major Subject: Curriculum and Instruction 111 ABSTRACT Mathematical Misconceptions in Graphing and Central Tendency Among Sixth Grade and Undergraduate Students. (August 2002) Mary Elizabeth Hammer, B. A...

Hammer, Mary Elizabeth

2002-01-01T23:59:59.000Z

311

Topology induced bifurcations for the NLS on the tadpole graph  

E-Print Network [OSTI]

In this paper we give the complete classification of solitons for a cubic NLS equation on the simplest network with a non-trivial topology: the tadpole graph, i.e. a ring with a half-line attached to it and free boundary conditions at the junction. The model, although simple, exhibits a surprisingly rich behavior and in particular we show that it admits: 1) a denumerable family of continuous branches of embedded solitons bifurcating from linear eigenstates and threshold resonances of the system; 2) a continuous branch of edge solitons displaying a pitchfork symmetry breaking bifurcation at the threshold of the continuous spectrum; 3) a finite family of continuous branches of solitons without linear analogue. All the solutions are explicitly constructed in terms of elliptic Jacobian functions. Moreover we show that families of nonlinear bound states of the above kind continue to exist in the presence of a uniform magnetic field orthogonal to the plane of the ring when a well definite flux quantization condition holds true. Finally we highlight the role of resonances in the linearization as a signature of the occurrence of bifurcations of solitons from the continuous spectrum.

C. Cacciapuoti; D. Finco; D. Noja

2014-05-14T23:59:59.000Z

312

Fusion categories in terms of graphs and relations  

E-Print Network [OSTI]

Every fusion category C that is k-linear over a suitable field k, is the category of finite-dimensional comodules of a Weak Hopf Algebra H. This Weak Hopf Algebra is finite-dimensional, cosemisimple and has commutative bases. It arises as the universal coend with respect to the long canonical functor \\omega:C->Vect_k. We show that H is a quotient H=H[G]/I of a Weak Bialgebra H[G] which has a combinatorial description in terms of a finite directed graph G that depends on the choice of a generator M of C and on the fusion coefficients of C. The algebra underlying H[G] is the path algebra of the quiver GxG, and so the composability of paths in G parameterizes the truncation of the tensor product of C. The ideal I is generated by two types of relations. The first type enforces that the tensor powers of the generator M have the appropriate endomorphism algebras, thus providing a Schur-Weyl dual description of C. If C is braided, this includes relations of the form `RTT=TTR' where R contains the coefficients of the braiding on \\omega M\\otimes\\omega M, a generalization of the construction of Faddeev-Reshetikhin-Takhtajan to Weak Bialgebras. The second type of relations removes a suitable set of group-like elements in order to make the category of finite-dimensional comodules equivalent to C over all tensor powers of the generator M. As examples, we treat the modular categories associated with U_q(sl_2).

Hendryk Pfeiffer

2009-12-02T23:59:59.000Z

313

Translation of Graph-based Knowledge Representation in Multi-agent System  

Science Journals Connector (OSTI)

Abstract Agents provide a feasible mean for maintaining and manipulating large scale data. This paper deals with the problem of information exchange between different agents. It uses graph based formalism for the representation of knowledge maintained by an agent and graph transformations as a mean of knowledge exchange. Such a rigorous formalism ensures the cohesion of graph-based knowledge held by agents after each modification and exchange action. The approach presented in this paper is illustrated by a case study dealing with the problem of personal data held in different places (maintained by different agents) and the process of transmitting such information.11 Financial support for this study was provided from resources of National Center for Research and Development, the grant number \\{NCBiR\\} 0021/R/ID2/2011/01.

Leszek Kotulski; Adam S?dziwy; Barbara Strug

2014-01-01T23:59:59.000Z

314

Influence of geometry and topology of quantum graphs on their nonlinear optical properties  

Science Journals Connector (OSTI)

We analyze the nonlinear optics of quasi-one-dimensional quantum graphs and manipulate their topology and geometry to generate nonlinearities in a simple system approaching the fundamental limits of the first and second hyperpolarizabilities. We explore a huge configuration space in order to determine whether the fundamental limits may be approached for specific topologies, independent of molecular details, when the geometry is manipulated to maximize the intrinsic response. Changes in geometry result in smooth variations of the nonlinearities. Topological changes between geometrically similar systems cause profound changes in the nonlinear susceptibilities that include a discontinuity due to abrupt changes in the boundary conditions. We demonstrate the same universal scaling behavior for quantum graphs that is predicted for general quantum nonlinear optical systems near their fundamental limits, indicating that our results for quantum graphs may reflect general structure-property relationships for globally optimized nonlinear optical systems.

Rick Lytel; Shoresh Shafei; Julian H. Smith; Mark G. Kuzyk

2013-04-17T23:59:59.000Z

315

Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard  

Science Journals Connector (OSTI)

Let G = (V,E) be an undirected graph and C a subset of vertices. If the sets Br(?) ? C, ? ? V (respectively, ? ? V\\C), are all nonempty and different, where Br(?) ... Keywords: NP-completeness, coding theory, complexity, graph, identifying code, locating-dominating code

Irne Charon; Olivier Hudry; Antoine Lobstein

2003-01-01T23:59:59.000Z

316

Graph Data Format Workshop Report Ulrik Brandes 1 , M. Scott Marshall 2 , and Stephen C. North 3  

E-Print Network [OSTI]

Graph Data Format Workshop Report Ulrik Brandes 1 , M. Scott Marshall 2 , and Stephen C. North 3 1, The Netherlands. scott@cwi.nl 3 AT&T Research, 180 Park Ave., Bldg. 103, Florham Park, NJ 07932-0971, U.S.A. north workshop was held in conjunction with Graph Drawing 2000. The participants identi#12;ed requirements

Brandes, Ulrik

317

The Elusive Hamilton Problem for Cayley Graphs--an 28th Clemson Mini-Conference on Discrete Mathematics and Algorithms  

E-Print Network [OSTI]

The Elusive Hamilton Problem for Cayley Graphs--an Overview 28th Clemson Mini State University October 3, 2013 Erik Westlund (KSU) Elusive Hamilton Problem for Cayley Graphs October} Cay(Z12; {2, 3, 4} ) Cay(D4; {a, b} ) Cay(Z4 2; S ) Erik Westlund (KSU) Elusive Hamilton Problem

Goddard, Wayne

318

Automation of the Dipole Subtraction Method in MadGraph/MadEvent  

E-Print Network [OSTI]

We present the implementation of the dipole subtraction formalism for the real radiation contributions to any next-to-leading order QCD process in the MadGraph/MadEvent framework. Both massless and massive dipoles are considered. Starting from a specific (n+1)-particle process the package provides a Fortran code for all possible dipoles to all Born processes that constitute the subtraction term to the (n+1)-particle process. The output files are given in the usual "MadGraph StandAlone" style using helicity amplitudes.

Rikkert Frederix; Thomas Gehrmann; Nicolas Greiner

2008-08-15T23:59:59.000Z

319

Multiclass Diffuse Interface Models for Semi-Supervised Learning on Graphs  

E-Print Network [OSTI]

We present a graph-based variational algorithm for multiclass classification of high-dimensional data, motivated by total variation techniques. The energy functional is based on a diffuse interface model with a periodic potential. We augment the model by introducing an alternative measure of smoothness that preserves symmetry among the class labels. Through this modification of the standard Laplacian, we construct an efficient multiclass method that allows for sharp transitions between classes. The experimental results demonstrate that our approach is competitive with the state of the art among other graph-based algorithms.

Garcia-Cardona, Cristina; Percus, Allon G

2012-01-01T23:59:59.000Z

320

View  

E-Print Network [OSTI]

Aug 19, 2009 ... linear-algebraic and graph theoretic properties of this matrix class. The con- ..... The MatLab solvers linprog and quadprog were used.

2010-03-14T23:59:59.000Z

Note: This page contains sample records for the topic "view graph graph" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


321

View  

E-Print Network [OSTI]

function, and the nuclear norm. The support function is based on the graph of the product of a matrix with its transpose. Closed form expressions for the support...

2014-08-28T23:59:59.000Z

322

Linear Prediction Models with Graph Regularization for Web-page Categorization  

E-Print Network [OSTI]

! Inc. New York City, NY, USA tzhang@yahoo-inc.com Alexandrin Popescul Yahoo! Inc. Santa Clara, CA, USA popescul@yahoo- inc.com Byron Dom Yahoo! Inc. Santa Clara, CA, USA bdom@yahoo-inc.com ABSTRACT We present that classes of graph neighbors seeded with a text only classifier and further re- fined with an EM

Zhang, Tong

323

Graph analysis of functional brain networks: practical issues in translational neuroscience  

Science Journals Connector (OSTI)

...Theme Issue Complex network theory and the brain compiled and edited by David Papo, Javier...Bullmore Graph analysis of functional brain networks: practical issues in translational...Theme Issue Complex network theory and the brain . The brain can be regarded as a network...

2014-01-01T23:59:59.000Z

324

On the Structure of Graphs with Non-Surjective L(2,1)-Labelings  

Science Journals Connector (OSTI)

For a graph G, an L(2,1)-labeling of G with span k is a mapping $L \\rightarrow \\{0, 1, 2, \\ldots, k\\}$ such that adjacent vertices are assigned integers which differ by at least 2, vertices at distance two are assigned integers ... Keywords: $\\lambda$-labeling, 1)-labeling, L(2, dominating vertex set, hole index

John P. Georges; David W. Mauro

2005-05-01T23:59:59.000Z

325

Notes: A note on collections of graphs with non-surjective lambda labelings  

Science Journals Connector (OSTI)

The @l-number of a graph G, denoted @l(G), is the smallest integer k such that there exists a function from V(G) into {0,1,2,...,k} under which adjacent vertices receive integers which differ by at least 2 and vertices at distance two receive integers ... Keywords: ?-Labeling, ?-Number, 05C, L(2,1)-Labeling, Surjective

John P. Georges; David W. Mauro

2005-02-01T23:59:59.000Z

326

On the $\\lambda$-Number of $Q_n$ and Related Graphs  

Science Journals Connector (OSTI)

An $L(2, l)$-labeling of graph $G$ is an integer labeling of $V(G)$ such that adjacent vertices have labels that differ by at least 2 and such that vertices distance 2 apart have labels that differ by at least 1. The $\\lambda$-number of $G, \\lambda(G)$, ... Keywords: $\\lambda$-labeling, $n$-cube, vertex labeling

Marshall A. Whittlesey; John P. Georges; David W. Mauro

1995-11-01T23:59:59.000Z

327

A note on collections of graphs with non-surjective lambda labelings  

Science Journals Connector (OSTI)

The ?-number of a graph G, denoted ?(G), is the smallest integer k such that there exists a function from V(G) into {0, 1, 2,..., k} under which adjacent vertices receive integers which differ by at least ... Keywords: ?-labeling, ?-number, L(2, 1)-labeling, surjective

John P. Georges; David W. Mauro

2005-02-01T23:59:59.000Z

328

Intro. to Linear Algebra 250C Extra Credit Project 2 ---Graphs and Markov Processes  

E-Print Network [OSTI]

of the week? How do you write this in matrix form? Use MATLAB to do the calculations. We are now interested A is called the transition matrix for the process. 9. Using MATLAB, find A k for k = 1, 2, 3, 5, 10, 20, 50Intro. to Linear Algebra 250­C Extra Credit Project 2 --- Graphs and Markov Processes Introduction

Woodward, Christopher

329

Intro. to Linear Algebra 250-C Extra Credit Project 2 --Graphs and Markov Processes  

E-Print Network [OSTI]

that each column of A should sum up to 1 (why?). Use MATLAB to create the vectors x, y and the matrix A. 3 of the week? How do you write this in matrix form? Use MATLAB to do the calculations. We are now interestedIntro. to Linear Algebra 250-C Extra Credit Project 2 -- Graphs and Markov Processes Introduction

Woodward, Christopher

330

Bond Graph Modeling of Centrifugal Compressor System Nur Uddin and Jan Tommy Gravdahl  

E-Print Network [OSTI]

Bond Graph Modeling of Centrifugal Compressor System Nur Uddin and Jan Tommy Gravdahl Dept, Norway N-7491 nur.uddin@itk.ntnu.no, Jan.Tommy.Gravdahl@itk.ntnu.no Keywords: Compressor, compressor surge, surge avoidance system, active surge control. Abstract A novel method of modeling centrifugal

Gravdahl, Jan Tommy

331

Time-varying Reeb Graphs for Continuous Space-Time Data Herbert Edelsbrunner  

E-Print Network [OSTI]

and/or a fee. SOCG '04 New York City, New York USA Copyright 2004 ACM ?? . . . $4.99. of dataTime-varying Reeb Graphs for Continuous Space-Time Data Herbert Edelsbrunner , John Harer , Ajith the evolving sequence into a single, partially persistent data structure. We envision this data structure

Pascucci, Valerio

332

Graph-based Criteria for Spectrum-Aware Clustering in Cognitive Radio Milan Bradonjica, Loukas Lazosb,  

E-Print Network [OSTI]

Graph-based Criteria for Spectrum-Aware Clustering in Cognitive Radio Networks Milan Bradonji, Arizona Email: llazos@ece.arizona.edu Abstract Cognitive radios (CRs) can exploit vacancies in licensed. 1. Introduction Under a fixed spectrum allocation paradigm, frequency bands are licensed

Lazos, Loukas

333

Automated Design Methodology for Mechatronic Systems Using Bond Graphs and Genetic Programming  

E-Print Network [OSTI]

, allow free composition, and are efficient for classification and analysis of models, allowing rapidAutomated Design Methodology for Mechatronic Systems Using Bond Graphs and Genetic Programming University, zhangbai@egr.msu.edu Abstract This paper suggests an automated design methodology

Fernandez, Thomas

334

Fully Distributed Trust Model based on Trust Graph for Mobile Ad hoc Networks  

E-Print Network [OSTI]

Fully Distributed Trust Model based on Trust Graph for Mobile Ad hoc Networks Mawloud Omar, Yacine University of Technology, France. bouabdal@hds.utc.fr Abstract A mobile ad hoc network (MANET) is a wireless that defines who trusts who and how. Our work aims to provide a fully distributed trust model for mobile ad hoc

Paris-Sud XI, Université de

335

Multi-robot Human Guidance using Topological Graphs Piyush Khandelwal and Peter Stone  

E-Print Network [OSTI]

Multi-robot Human Guidance using Topological Graphs Piyush Khandelwal and Peter Stone Department,pstone}@cs.utexas.edu Abstract Prior approaches to human guidance using robots in- side a building have typically been limited to a single robot guide that navigates a human from start to goal. However, due to their limited mobility

Stone, Peter

336

Discrete Scale Invariance in Scale Free Graphs Matias Gra~na  

E-Print Network [OSTI]

, Buenos Aires, Argentina. Abstract In this work we introduce an energy function in order to study finiteN, Universidad de Buenos Aires, Ciudad Universitaria, Pab. 1 (1428) Ciudad de Buenos Aires, Argentina. Juan Pablo scale free graphs generated with different models. The energy distribution has a fractal pattern

Graña, Matías

337

Exploring Aggregate Effect with Weighted Transcoding Graphs for Efficient Cache Replacement in Transcoding Proxies  

E-Print Network [OSTI]

Exploring Aggregate Effect with Weighted Transcoding Graphs for Efficient Cache Replacement University Taipei, Taiwan, ROC E-mail: {cychang@arbor.ee.ntu.edu.tw; mschen@cc.ee.ntu.edu.tw} Abstract This paper explores the aggregate effect when caching multiple versions of the same Web object

Chen, Ming-Syan

338

1 Introduction 1 1.1 Graphs, digraphs, and homomorphisms 1  

E-Print Network [OSTI]

CONTENTS 1 Introduction 1 1.1 Graphs, digraphs, and homomorphisms 1 1.2 Homomorphisms preserve adjacency 3 1.3 Homomorphisms generalize colourings 6 1.4 The existence of homomorphisms 10 1.5 Homomorphisms generalize isomorphisms 16 1.6 Homomorphic equivalence 18 1.7 The composition of homomorphisms 20

Hell, Pavol

339

On the Number of Cycles in Planar Graphs Kevin Buchin1  

E-Print Network [OSTI]

technique. Combining both, we show that there is no planar graph with more than 2.8927n simple cycles cycles can be obtained by combining an upper bound on the number of triangulations with an upper bound spanning cycles on n points with an alternative approach. This bound is better than the combined bound

Fuchs, Gunter

340

VIDEO SUMMARIZATION BY SPATIAL-TEMPORAL GRAPH OPTIMIZATION Shi Lu, Michael R. Lyu, Irwin King  

E-Print Network [OSTI]

VIDEO SUMMARIZATION BY SPATIAL-TEMPORAL GRAPH OPTIMIZATION Shi Lu, Michael R. Lyu, Irwin King SAR {slu, lyu, king}@cse.cuhk.edu.hk ABSTRACT In this paper we present a novel approach for video sum-temporal content cov- erage and visual coherence of the video summary. The ap- proach has three stages. First

King, Kuo Chin Irwin

Note: This page contains sample records for the topic "view graph graph" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


341

First-passage percolation on ladder-like graphs with heterogeneous exponential times  

E-Print Network [OSTI]

We determine the asymptotic speed of the first-passage percolation process on some ladder-like graphs (or width-2 stretches) when the times associated with different edges are independent and exponentially distributed but not necessarily all with the same mean. The method uses a particular Markov chain associated with the first-passage percolation process and properties of its stationary distribution.

Renlund, Henrik

2011-01-01T23:59:59.000Z

342

Fusion rule algebras and walks on graphs V.S. Sunder  

E-Print Network [OSTI]

Fusion rule algebras and walks on graphs V.S. Sunder Institute of Mathematical Sciences Madras the relation between fusion algebras and Cartan algebras in Mn(IR); as a result of our analysis, we arrive Hermitian fusion algebra', which turns out, in many cases to have non-negative structure constants

Sunder, V S

343

GMAD: Graph-based Malware Activity Detection by DNS traffic analysis  

Science Journals Connector (OSTI)

Malicious activities on the Internet are one of the most dangerous threats to Internet users and organizations. Malicious software controlled remotely is addressed as one of the most critical methods for executing the malicious activities. Since blocking ... Keywords: Botnet, DNS, Graph clustering, Malware domain name, Sequential correlation

Jehyun Lee, Heejo Lee

2014-08-01T23:59:59.000Z

344

Systemic risk in energy derivative markets: a graph-theory analysis  

E-Print Network [OSTI]

Systemic risk in energy derivative markets: a graph-theory analysis Delphine Lautier 1,2 and Franck condition for systemic risk to appear, this article focuses on integration in energy derivative markets, and that energy markets are becoming more and more integrated. Financial support of the French Energy Council

Paris-Sud XI, Université de

345

A Methodology for Empirical Analysis of Brain Connectivity through Graph Mining  

E-Print Network [OSTI]

A Methodology for Empirical Analysis of Brain Connectivity through Graph Mining Jiang Bian, Josh M Informatics Brain Imaging Research Center, Psychiatric Research Institute University of Arkansas for Medical and functional brain connectivity networks and has helped researchers conceive the effects of neurological

Xie, Mengjun

346

Graphs of models for exploring design spaces in the engineering of Human Computer Interaction  

E-Print Network [OSTI]

Graphs of models for exploring design spaces in the engineering of Human Computer Interaction +33 (0)4 76 51 48 54 gaelle.calvary@imag.fr ABSTRACT Model Driven Engineering (MDE) has focused creativity in the early phases. Our research aims at stretching MDE all over the design process including

Paris-Sud XI, Université de

347

Hamilton Cycles which Extend Transposition Matchings in Cayley Graphs of S n  

E-Print Network [OSTI]

Hamilton Cycles which Extend Transposition Matchings in Cayley Graphs of S n Frank Ruskey \\Lambda matching M b in Cay(B : S n ). We show here when n ? 4 that for any b 2 B, there is a Hamilton cycle in Cay only a Hamilton path, the question is still open and is, in fact, a special case of the more general

Savage, Carla D.

348

Hamilton Cycles Containing Randomly Selected Edges in Random Regular Graphs \\Lambda  

E-Print Network [OSTI]

Hamilton Cycles Containing Randomly Selected Edges in Random Regular Graphs \\Lambda R. W. Robinson oriented root edges have been randomly specified for the cycle to contain. The Hamilton cycle must be orientable to agree with all of the orientations on the j root edges. It is shown that the requisite Hamilton

Robinson, Robert W.

349

EDGE-DISJOINT HAMILTON CYCLES IN RANDOM GRAPHS FIACHRA KNOX, DANIELA KUHN AND DERYK OSTHUS  

E-Print Network [OSTI]

EDGE-DISJOINT HAMILTON CYCLES IN RANDOM GRAPHS FIACHRA KNOX, DANIELA K¨UHN AND DERYK OSTHUS a collection of (G)/2 edge-disjoint Hamilton cycles in G Gn,p, plus an additional edge-disjoint matching of Frieze and Krivelevich. 1. Introduction The question of how many edge-disjoint Hamilton cycles one can

Kühn, Daniela

350

Anytime QoS optimization over the PlanGraph for web service composition  

Science Journals Connector (OSTI)

Automatic service composition is the generation of a business process to fulfill business goals that cannot be fulfilled by individual services. Planning algorithms are frequently used to solve this problem. In addition to satisfying functional goals, ... Keywords: QoS optimization, graph plan, web service composition

Yuhong Yan; Min Chen; Yubin Yang

2012-03-01T23:59:59.000Z

351

Relations in Mathematical Morphology with applications to Graphs and Rough Sets  

E-Print Network [OSTI]

Relations in Mathematical Morphology with applications to Graphs and Rough Sets John G. Stell School of Computing, University of Leeds Leeds, LS2 9JT, U.K. jgs@comp.leeds.ac.uk Abstract. Rough sets for granularity, and the question of how rough sets relate to mathe- matical morphology has been raised by Bloch

Stell, John

352

A Graph-based Approach to API Usage Adaptation Hoan Anh Nguyen,1a  

E-Print Network [OSTI]

A Graph-based Approach to API Usage Adaptation Hoan Anh Nguyen,1a Tung Thanh Nguyen,1b Gary Wilson the updated libraries. Existing API usage adaptation techniques support simple adaptation such as replacing the target of calls to a deprecated API, however, cannot handle complex adaptations such as creat- ing a new

Kim, Miryung

353

NLS ground states on graphs Riccardo Adami # , Enrico Serra + , Paolo Tilli  

E-Print Network [OSTI]

Abstract We investigate the existence of ground states for the subcritical NLS energy on metric graphs. In particular, we find out a topologi­ cal assumption that guarantees the nonexistence of ground states, and give an example in which the assumption is not fulfilled and ground states actually exist. In order

354

The Effect of Neighbor Graph Connectivity on Coverage Redundancy in Wireless Sensor Networks  

E-Print Network [OSTI]

that the network field is covered by these nodes at the desired ratio while the usage of the energy by the sensorThe Effect of Neighbor Graph Connectivity on Coverage Redundancy in Wireless Sensor Networks problems in wireless sensor networks. To reduce the energy consumption that arises when the high number

Varela, Carlos

355

A Discriminative Model-Constrained Graph Cuts Approach to Fully Automated Pediatric  

E-Print Network [OSTI]

A Discriminative Model-Constrained Graph Cuts Approach to Fully Automated Pediatric Brain Tumor of Radiology, University Medical Center, Erlangen, Germany 4 Siemens, CT SE SCR 2, Erlangen, Germany Abstract. In this paper we present a fully automated approach to the segmentation of pediatric brain tumors in multi

Carneiro, Gustavo

356

HEAT KERNELS ON METRIC GRAPHS AND A TRACE FORMULA VADIM KOSTRYKIN, J  

E-Print Network [OSTI]

HEAT KERNELS ON METRIC GRAPHS AND A TRACE FORMULA VADIM KOSTRYKIN, J ? URGEN POTTHOFF, AND ROBERT SCHRADER Dedicated to Jean­Michel Combes on the occasion of his 65­th birthday ABSTRACT. We study heat parameter. For such op­ erators we prove a representation for the heat kernel as a sum over all walks

357

Where the sidewalk ends: extending the internet as graph using traceroutes from P2P users  

Science Journals Connector (OSTI)

An accurate Internet topology graph is important in many areas of networking, from deciding ISP business relationships to diagnosing network anomalies. Most Internet mapping efforts have derived the network structure, at the level of interconnected autonomous ... Keywords: as-level topology, bgp, internet measurement, traceroute

Kai Chen; David R. Choffnes; Rahul Potharaju; Yan Chen; Fabian E. Bustamante; Dan Pei; Yao Zhao

2009-12-01T23:59:59.000Z

358

Roots xk(y) of a formal power series with applications to graph enumeration  

E-Print Network [OSTI]

the n(y) are formal power series with invertible constant term (coefficients lying in a commutative ringRoots xk(y) of a formal power series f(x, y) = n=0 an(y) xn with applications to graph enumeration and q-series Alan Sokal New York University / University College London Lectures at Queen Mary -- 11, 18

Banaji,. Murad

359

Affine Nested Loop Programs and their Binary Parameterized Dataflow Graph Counterparts  

E-Print Network [OSTI]

Affine Nested Loop Programs and their Binary Parameterized Dataflow Graph Counterparts Ed F Parameterized static affine nested loop programs can be automatically converted to input-output equivalent Kahn affine nested loop programs which are nested loop programs in which the loop boundaries, the conditions

Bhattacharyya, Shuvra S.

360

Introduction to Physical Systems Modelling with Bond Graphs Jan F. Broenink  

E-Print Network [OSTI]

on energy and energy exchange. Analogies between domains are more than just equations being analogous and directed graphs, in which the vertices represent submodels and the edges represent an ideal energy connection between power ports. The vertices are idealised descriptions of physical phenomena

Batlle, Carles

Note: This page contains sample records for the topic "view graph graph" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


361

Design and Verification of Instantiable Compliance Rule Graphs in Process-Aware  

E-Print Network [OSTI]

against imposed compliance rules. Tab. 1 summarizes quality compliance rules imposed on the software. Nevertheless, for quality assurance, it could be desired to verify c2 over the development process. ThusDesign and Verification of Instantiable Compliance Rule Graphs in Process-Aware Information Systems

Pfeifer, Holger

362

Predicting Protein Folds with Structural Repeats Using a Chain Graph Model  

E-Print Network [OSTI]

Predicting Protein Folds with Structural Repeats Using a Chain Graph Model Yan Liu yanliu, Carnegie Mellon University, Pittsburgh, PA 15213 USA Abstract Protein fold recognition is a key step to to accurately identify protein folds aris- ing from typical spatial arrangements of well-defined secondary

Xing, Eric P.

363

Characterization of Trivalent Graphs with Minimal Eigenvalue Gap* Clemens Brand,a Barry Guiduli,b,** and Wilfried Imrichc,***  

E-Print Network [OSTI]

Characterization of Trivalent Graphs with Minimal Eigenvalue Gap* Clemens Brand,a Barry Guiduli is the mirror image of one of these blocks. Each interior block is of the type: or (2) We will refer

Babai, László

364

Vortex graphs as N-omers and CP(N-1) Skyrmions in N-component Bose-Einstein condensates  

E-Print Network [OSTI]

Stable vortex N-omers are constructed in coherently coupled N-component Bose-Einstein condensates. We classify all possible N-omers in terms of the mathematical graph theory and numerically construct all graphs for N=2,3,4. We also find that N-omers are well described as CP(N-1) skyrmions when inter-component and intra-component couplings are U(N) symmetric, and we evaluate their size dependence on the Rabi coupling.

Minoru Eto; Muneto Nitta

2013-03-25T23:59:59.000Z

365

2007 CBECS Large Hospital Building FAQs: 2003-2007 Comparison Graphs  

Gasoline and Diesel Fuel Update (EIA)

FAQs: 2003-2007 Comparison Graphs Main FAQs: 2003-2007 Comparison Graphs Main Report | Methodology | FAQ | List of Tables CBECS 2007 - Release date: August 17, 2012 Jump to: Figure 1 | Figure 2 | Figure 3 | Figure 4 | Figure 5 Figure 1 Number of Large Hospital Buildings and 95% Confidence Intervals by Census Region, 2003 and 2007 Figure 2 Total Floorspace and 95% Confidence Intervals in Large Hospital Buildings by Census Region, 2003 and 2007 Figure 3 Major Fuel Intensity and 95% Confidence Intervals by Census Region, 2003 and 2007 Figure 4 Electricity Intensity and 95% Confidence Intervals in Large Hospital Buildings by Census Region, 2003 and 2007 Figure 5 Natural Gas Intensity and 95% Confidence Intervals in Large Hospital Buildings by Census Region, 2003 and 2007 Specific questions on this product may be directed to:

366

The Green's function of a finite-gap Schrdinger operator discretization on a quad graph  

E-Print Network [OSTI]

We are using the finite-gap approach for the construction of the Schr\\"{o}dinger operator discretization on a quad graph. The latter is represented by a two-dimensional integer sublattice in a $d$-dimensional space. The Green's function of the operator can be posed explicitly as an integral of the differential built by the spectral data, calculated on contours of the special form. We also know the the asymptotics of the achieved function.

Vasilevskiy Boris

2014-02-09T23:59:59.000Z

367

Memorial University of Newfoundland Department of Mathematics and Statistics Bellman's Algorithm for Acyclic Directed Graphs  

E-Print Network [OSTI]

time O(n 2 ). And each iteration of step (3) takes times O(n); with up to n iterations, step (3. A canonical ordering of the vertices is generated by the following algorithm (the output of which is either of a directed graph takes time O(n 2 ). How- ever, the algorithm presented has time O(n 3 ). In step (2), which

deYoung, Brad

368

Efficient Graph Based Assembly of Short-Read Sequences on Hybrid Core Architecture  

SciTech Connect (OSTI)

Advanced architectures can deliver dramatically increased throughput for genomics and proteomics applications, reducing time-to-completion in some cases from days to minutes. One such architecture, hybrid-core computing, marries a traditional x86 environment with a reconfigurable coprocessor, based on field programmable gate array (FPGA) technology. In addition to higher throughput, increased performance can fundamentally improve research quality by allowing more accurate, previously impractical approaches. We will discuss the approach used by Convey?s de Bruijn graph constructor for short-read, de-novo assembly. Bioinformatics applications that have random access patterns to large memory spaces, such as graph-based algorithms, experience memory performance limitations on cache-based x86 servers. Convey?s highly parallel memory subsystem allows application-specific logic to simultaneously access 8192 individual words in memory, significantly increasing effective memory bandwidth over cache-based memory systems. Many algorithms, such as Velvet and other de Bruijn graph based, short-read, de-novo assemblers, can greatly benefit from this type of memory architecture. Furthermore, small data type operations (four nucleotides can be represented in two bits) make more efficient use of logic gates than the data types dictated by conventional programming models.JGI is comparing the performance of Convey?s graph constructor and Velvet on both synthetic and real data. We will present preliminary results on memory usage and run time metrics for various data sets with different sizes, from small microbial and fungal genomes to very large cow rumen metagenome. For genomes with references we will also present assembly quality comparisons between the two assemblers.

Sczyrba, Alex; Pratap, Abhishek; Canon, Shane; Han, James; Copeland, Alex; Wang, Zhong; Brewer, Tony; Soper, David; D'Jamoos, Mike; Collins, Kirby; Vacek, George

2011-03-22T23:59:59.000Z

369

Instability of Bose-Einstein condensation on quantum graphs under repulsive perturbations  

E-Print Network [OSTI]

In this Note we investigate Bose-Einstein condensation in interacting quantum many-particle systems on graphs. We extend previous results obtained for particles on an interval and show that even arbitrarily small repulsive two-particle interactions destroy a condensate in the non-interacting Bose gas. Our results also cover singular two-particle interactions, such as the well-known Lieb-Lininger model, in the thermodynamic limit.

Jens Bolte; Joachim Kerner

2014-11-26T23:59:59.000Z

370

Resumes de textes par extraction de phrases, algorithmes de graphe et energie textuelle  

E-Print Network [OSTI]

R´esum´es de textes par extraction de phrases, algorithmes de graphe et ´energie textuelle Silvia. Lorsqu'il s'agit de r´esumer automatiquement une large quantit´e de texte, l'approche actuellement la´en´eralement effectu´es sur la matrice mots ? phrases. Le r´esum´e reprend alors les n phrases les plus lourdes dans l

San-Juan, Eric

371

Social image tagging using graph-based reinforcement on multi-type interrelated objects  

Science Journals Connector (OSTI)

Social image tagging is becoming increasingly popular with the development of social website, where images are annotated with arbitrary keywords called tags. Most of present image tagging approaches are mainly based on the visual similarity or mapping between visual feature and tags. However, in the social media environment, images are always associated with multi-type of object information (i.e., visual content, tags, and user contact information) which makes this task more challenging. In this paper, we propose to fuse multi-type of information to tag social image. Specifically, we model social image tagging as a ranking and reinforcement problem, and a novel graph-based reinforcement algorithm for interrelated multi-type objects is proposed. When a user issue a tagging request for a query image, a candidate tag set is derived and a set of friends of the query user is selected. Then a graph which contains three types of objects (i.e., visual features of the query image, candidate tags, and friend users) is constructed, and each type of objects are initially ranked based on their weight and intra-relation. Finally, candidate tags are re-ranked by our graph-based reinforcement algorithm which takes into consideration both inter-relation with visual features and friend users, and the top ranked tags are saved. Experiments on real-life dataset demonstrate that our algorithm significantly outperforms state-of-the-art algorithms.

Xiaoming Zhang; Xiaojian Zhao; Zhoujun Li; Jiali Xia; Ramesh Jain; Wenhan Chao

2013-01-01T23:59:59.000Z

372

AGE: a distributed environment for creating interactive animations of graphs  

E-Print Network [OSTI]

com- munication domain. Standard routines, which we shall refer to as the AGE client primitives, that read snd write AGE messages to and from the socket, and routines that create and interpret AGE messages have been developed and are available... for use by those wishing to code a client program (refer to Appendix C). While most requirements for the environment desired are fulfilled by the AGE server, itself, some facilities are supplied by clients, namely, scripts, view broadcasting...

Veatch, Timothy Richard

1990-01-01T23:59:59.000Z

373

Planning Graph as a (Dynamic) CSP: Exploiting EBL, DDB and other CSP Search Techniques in Graphplan  

E-Print Network [OSTI]

This paper reviews the connections between Graphplan's planning-graph and the dynamic constraint satisfaction problem and motivates the need for adapting CSP search techniques to the Graphplan algorithm. It then describes how explanation based learning, dependency directed backtracking, dynamic variable ordering, forward checking, sticky values and random-restart search strategies can be adapted to Graphplan. Empirical results are provided to demonstrate that these augmentations improve Graphplan's performance significantly (up to 1000x speedups) on several benchmark problems. Special attention is paid to the explanation-based learning and dependency directed backtracking techniques as they are empirically found to be most useful in improving the performance of Graphplan.

Kambhampati, S

2011-01-01T23:59:59.000Z

374

Some observations on Goldberg-Trajan's Maximum Flow algorithm on Bipartite Graphs  

E-Print Network [OSTI]

) is a direct graph with two distinguished vertices s (the source) and t (the sink). Each edge [u, v] in G is associated with a positive integer cap(u, v), called the capacity of the edge. If there is no edge from vertex u to vertex v. then we define... cap(u, v) = 0. Intuitively, a flow in a flow network should satisfy the following three conditions: (1) the amount of flow along an edge should not exceed the capacity of the edge (capacity constraint); (2) a flow from a vertex u to a vertex v can...

Yang, Bencai

1997-01-01T23:59:59.000Z

375

MadDM v.1.0: Computation of Dark Matter Relic Abundance Using MadGraph5  

E-Print Network [OSTI]

We present MadDM v.1.0, a numerical tool to compute dark matter relic abundance in a generic model. The code is based on the existing MadGraph 5 architecture and as such is easily integrable into any MadGraph collider study. A simple Python interface offers a level of user-friendliness characteristic of MadGraph 5 without sacrificing functionality. MadDM is able to calculate the dark matter relic abundance in models which include a multi-component dark sector, resonance annihilation channels and co-annihilations. We validate the code in a wide range of dark matter models by comparing the relic density results from MadDM to the existing tools and literature.

Mihailo Backovic; Kyoungchul Kong; Mathew McCaskey

2014-04-24T23:59:59.000Z

376

The Ising Model on Diluted Graphs and Strong Amenability Olle H aggstr om \\Lambda Roberto H. Schonmann y Jeffrey E. Steif z  

E-Print Network [OSTI]

The Ising Model on Diluted Graphs and Strong Amenability Olle H¨ aggstr¨ om \\Lambda Roberto H. Schonmann y Jeffrey E. Steif z May 10, 1999 Abstract Say that a graph has persistent transition if the Ising that the critical temperature for the Ising model with no external field on the infinite clusters of Bernoulli

377

Sharpness of the phase transition and exponential decay of the subcritical cluster size for percolation on quasi-transitive graphs  

E-Print Network [OSTI]

We study homogeneous, independent percolation on general quasi-transitive graphs. We prove that in the disorder regime where all clusters are finite almost surely, in fact the expectation of the cluster size is finite. This extends a well-known theorem by Menshikov and Aizenman & Barsky to all quasi-transitive graphs. Moreover we deduce that in this disorder regime the cluster size distribution decays exponentially, extending a result of Aizenman & Newman. Our results apply to both edge and site percolation, as well as long range (edge) percolation. The proof is based on a modification of the Aizenman & Barsky method.

Ton?i Antunovi?; Ivan Veseli?

2007-11-12T23:59:59.000Z

378

Parameterized reductions and algorithms for a graph editing problem that generalizes vertex cover  

Science Journals Connector (OSTI)

We study a novel generalization of the Vertex Cover problem which is motivated by, e.g., error correction (data cleaning) prior to inference of chemical mixtures by their observable reaction products. We focus on the important case of deciding on one of two candidate substances. This problem has nice graph-theoretic formulations situated between Vertex Cover and 3-Hitting Set. In order to characterize its parameterized complexity we devise parameter-preserving reductions, and we show that some minimum solution can be computed faster than by solving 3-Hitting Set in general. More explicitly, we introduce the Union Editing problem: In a hypergraph with red and blue vertices, edit the colors so that the red set becomes exactly the union of some hyperedges. The case of degree 2 is equivalent to Star Editing: in a graph with red and blue edges, edit the colors so that the red set becomes exactly the union of some stars, i.e., vertices with all their incident edges. Our time bound is O ? ( 1.8 4 c ) where c denotes the total number of recolored edges.

Peter Damaschke; Leonid Molokov

2012-01-01T23:59:59.000Z

379

Pattern analysis of directed graphs using DEDICOM: an application to Enron email.  

SciTech Connect (OSTI)

DEDICOM is a linear algebra model for analyzing intrinsically asymmetric relationships, such as trade among nations or the exchange of emails among individuals. DEDICOM decomposes a complex pattern of observed relations among objects into a sum of simpler patterns of inferred relations among latent components of the objects. Three-way DEDICOM is a higher-order extension of the model that incorporates a third mode of the data, such as time, giving it stronger uniqueness properties and consequently enhancing interpretability of solutions. In this paper, we present algorithms for computing these decompositions on large, sparse data as well as a variant for computing an asymmetric nonnegative factorization. When we apply these techniques to adjacency arrays arising from directed graphs with edges labeled by time, we obtain a smaller graph on latent semantic dimensions and gain additional information about their changing relationships over time. We demonstrate these techniques on the Enron email corpus to learn about the social networks and their transient behavior. The mixture of roles assigned to individuals by DEDICOM showed strong correspondence with known job classifications and revealed the patterns of communication between these roles. Changes in the communication pattern over time, e.g., between top executives and the legal department, were also apparent in the solutions.

Bader, Brett William; Harshman, Richard A. (University of Western Ontario London, Ontario, Canada); Kolda, Tamara Gibson (Sandia National Labs, Livermore, CA)

2006-12-01T23:59:59.000Z

380

Limit Theorems for the Discrete-Time Quantum Walk on a Graph with Joined Half Lines  

E-Print Network [OSTI]

We consider a discrete-time quantum walk $W_{t,\\kappa}$ at time $t$ on a graph with joined half lines $\\mathbb{J}_\\kappa$, which is composed of $\\kappa$ half lines with the same origin. Our analysis is based on a reduction of the walk on a half line. The idea plays an important role to analyze the walks on some class of graphs with \\textit{symmetric} initial states. In this paper, we introduce a quantum walk with an enlarged basis and show that $W_{t,\\kappa}$ can be reduced to the walk on a half line even if the initial state is \\textit{asymmetric}. For $W_{t,\\kappa}$, we obtain two types of limit theorems. The first one is an asymptotic behavior of $W_{t,\\kappa}$ which corresponds to localization. For some conditions, we find that the asymptotic behavior oscillates. The second one is the weak convergence theorem for $W_{t,\\kappa}$. On each half line, $W_{t,\\kappa}$ converges to a density function like the case of the one-dimensional lattice with a scaling order of $t$. The results contain the cases of quantum walks starting from the general initial state on a half line with the general coin and homogeneous trees with the Grover coin.

Kota Chisaki; Norio Konno; Etsuo Segawa

2010-09-07T23:59:59.000Z

Note: This page contains sample records for the topic "view graph graph" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


381

Introduction to Network Analysis 1 Spectral Methods (aka Algebraic Graph Theory, see Chapter 14 in *BE+ "Network analysis")  

E-Print Network [OSTI]

Introduction to Network Analysis 1 Spectral Methods (aka Algebraic Graph Theory, see Chapter 14 in *BE+ "Network analysis") Three main objects of interest: adjacency matrix, Laplacian, and normalized to Network Analysis 12 original reverse Cuthill-McKee spectral Matlab demo #12;Introduction to Network

Safro, Ilya

382

Non-perturbative corrections to mean-field critical behavior: the spherical model on a spider-web graph  

Science Journals Connector (OSTI)

We consider the spherical model on a spider-web graph. This graph is effectively infinite dimensional, similar to the Bethe lattice, but has loops. We show that these lead to non-trivial corrections to the simple mean-field behavior. We first determine all normal modes of the coupled springs problem on this graph, using its large symmetry group. In the thermodynamic limit, the spectrum is a set of ?-functions, and all the modes are localized. The fractional number of modes with frequency less than ? varies as exp?( ? C/?) for ? tending to zero, where C is a constant. For an unbiased random walk on the vertices of this graph, this implies that the probability of return to the origin at time t varies as exp?( ? C't1/3), for large t, where C' is a constant. For the spherical model, we show that while the critical exponents take the values expected from the mean-field theory, the free energy per site at temperature T, near and above the critical temperature Tc, also has an essential singularity of the type exp?[ ? K(T ? Tc)?1/2].

Ajit C Balram; Deepak Dhar

2012-01-01T23:59:59.000Z

383

Toward an Automated Design Method for Multi-Domain Dynamic Systems Using Bond Graphs and Genetic Programming  

E-Print Network [OSTI]

of models, permitting rapid determination of various types of acceptability or feasibility of candidate1 Toward an Automated Design Method for Multi-Domain Dynamic Systems Using Bond Graphs and Genetic Abstract This paper describes a unified and automated design method for synthesizing designs for multi

Hu, Jianjun

384

Second Annual Conference on Advances in Cognitive Systems Poster Collection (2013) 217-234 Inference Graphs: A Roadmap  

E-Print Network [OSTI]

-234 Inference Graphs: A Roadmap Daniel R. Schlegel DRSCHLEG@BUFFALO.EDU Stuart C. Shapiro SHAPIRO GLAIR (Shapiro & Bona, 2010) and MGLAIR (Bona, 2013), which use the SNePS 2 KRR system (Shapiro perform natural deduction inference using forward, backward, bi-directional (Shapiro, Martins, & Mc

Shapiro, Stuart C.

385

Introduction to Network Science 1 Spectral Methods (aka Algebraic Graph Theory, see Chapter 14 in [BE] "Network analysis")  

E-Print Network [OSTI]

Introduction to Network Science 1 Spectral Methods (aka Algebraic Graph Theory, see Chapter 14 #12;Introduction to Network Science 2 #12;Introduction to Network Science 3 Homework: Prove any 2 out of 3 in Theorem 3 (submit by 3/6/2014) #12;Introduction to Network Science 4 There exists some nonzero

Safro, Ilya

386

In "Handbook of Mathematical Models in Computer Vision", Springer, 2006 p.1 Graph Cuts in Vision and Graphics  

E-Print Network [OSTI]

In "Handbook of Mathematical Models in Computer Vision", Springer, 2006 p.1 Graph Cuts in Vision, shortest paths [6, 22]), Markov ran- dom fields, statistical physics, simulated annealing and other. This chap- ter does not provide any new research results, however, some applications are presented from

Boykov, Yuri

387

On the incompleteness of the AS-level graph: a novel methodology for BGP route collector placement  

Science Journals Connector (OSTI)

In the last decade many studies have used the Internet AS-level topology to perform several analyses, from discovering its graph properties to assessing its impact on the effectiveness of worm-containment strategies. Yet, the BGP data typically used ... Keywords: BGP, autonomous systems, incompleteness, internet, measurement, topology

Enrico Gregori; Alessandro Improta; Luciano Lenzini; Lorenzo Rossi; Luca Sani

2012-11-01T23:59:59.000Z

388

Confining sets and avoiding bottleneck cases: A simple maximum independent set algorithm in degree-3 graphs  

Science Journals Connector (OSTI)

We present an O ? ( 1.083 6 n ) -time algorithm for finding a maximum independent set in an n -vertex graph with degree bounded by 3, which improves all previous running time bounds for this problem. Our approach has the following two features. Without increasing the number of reduction/branching rules to get an improved time bound, we first successfully extract the essence from the previously known reduction rules such as domination, which can be used to get simple algorithms. More formally, we introduce a procedure for computing confining sets, which unifies several known reducible subgraphs and covers new reducible subgraphs. Second we identify those instances that generate the worst recurrence among all recurrences of our branching rules as bottleneck instances and prove that bottleneck instances cannot appear consecutively after each branching operation.

Mingyu Xiao; Hiroshi Nagamochi

2013-01-01T23:59:59.000Z

389

Approximate inference on planar graphs using loop calculus and belief progagation  

SciTech Connect (OSTI)

We introduce novel results for approximate inference on planar graphical models using the loop calculus framework. The loop calculus (Chertkov and Chernyak, 2006b) allows to express the exact partition function Z of a graphical model as a finite sum of terms that can be evaluated once the belief propagation (BP) solution is known. In general, full summation over all correction terms is intractable. We develop an algorithm for the approach presented in Chertkov et al. (2008) which represents an efficient truncation scheme on planar graphs and a new representation of the series in terms of Pfaffians of matrices. We analyze in detail both the loop series and the Pfaffian series for models with binary variables and pairwise interactions, and show that the first term of the Pfaffian series can provide very accurate approximations. The algorithm outperforms previous truncation schemes of the loop series and is competitive with other state-of-the-art methods for approximate inference.

Chertkov, Michael [Los Alamos National Laboratory; Gomez, Vicenc [RADBOUD UNIV; Kappen, Hilbert [RADBOUD UNIV

2009-01-01T23:59:59.000Z

390

A combined graph theory and analytic hierarchy process approach for multicriteria evaluation of hydrogen energy systems  

Science Journals Connector (OSTI)

Hydrogen is a renewable energy source and has the potential to mitigate the green house gas effect and to meet the increasing global electricity demand. In the present study, a multicriteria methodology is developed by combining graph theory and analytic hierarchy process methods for the evaluation and selection of hydrogen energy systems. The hydrogen energy system alternatives are assessed with respect to economic, environmental, performance and social criteria by computing the hydrogen energy system preference index. A detailed procedure for determination of hydrogen energy system preference index is suggested. Two examples relating to hydrogen production processes and hydrogen energy technologies are cited in order to demonstrate and validate the effectiveness and flexibility of the proposed methodology. In each example, a list of all possible choices from the best to the worst alternatives is obtained taking into account different evaluation criteria.

Pramod B. Lanjewar; R.V. Rao; A.V. Kale

2014-01-01T23:59:59.000Z

391

Entanglement creation and distribution on a graph of exchange-coupled qutrits  

SciTech Connect (OSTI)

We propose a protocol that allows both the creation and the distribution of entanglement, resulting in two distant parties (Alice and Bob) conclusively sharing a bipartite Bell state. The system considered is a graph of three-level objects (''qutrits'') coupled by SU(3) exchange operators. The protocol begins with a third party (Charlie) encoding two lattice sites in unentangled states, and allowing unitary evolution under time. Alice and Bob perform a projective measurement on their respective qutrits at a given time, and obtain a maximally entangled Bell state with a certain probablility. We also consider two further protocols, one based on simple repetition and the other based on successive measurements and conditional resetting, and show that the cumulative probability of creating a Bell state between Alice and Bob tends to unity.

Hadley, Christopher; Serafini, Alessio; Bose, Sougato [Department of Physics and Astronomy, University College London, Gower Street, London WC1E 6BT (United Kingdom)

2005-11-15T23:59:59.000Z

392

Parallel Chip-Firing on the Complete Graph: Devil's Staircase and Poincare Rotation Number  

E-Print Network [OSTI]

We study how parallel chip-firing on the complete graph K_n changes behavior as we vary the total number of chips. Surprisingly, the activity of the system, defined as the average number of firings per time step, does not increase smoothly in the number of chips; instead it remains constant over long intervals, punctuated by sudden jumps. In the large n limit we find a "devil's staircase" dependence of activity on the number of chips. The proof proceeds by reducing the chip-firing dynamics to iteration of a self-map of the circle S^1, in such a way that the activity of the chip-firing state equals the Poincare rotation number of the circle map. The stairs of the devil's staircase correspond to periodic chip-firing states of small period.

Levine, Lionel

2008-01-01T23:59:59.000Z

393

Bifurcations and stability of standing waves in the nonlinear Schrdinger equation on the tadpole graph  

E-Print Network [OSTI]

We develop a detailed rigorous analysis of edge bifurcations of standing waves in the nonlinear Schr\\"odinger (NLS) equation on a tadpole graph (a ring attached to a semi-infinite line subject to the Kirchhoff boundary conditions at the junction). It is shown in the recent work [7] by using explicit Jacobi elliptic functions that the cubic NLS equation on a tadpole graph admits a rich structure of standing waves. Among these, there are different branches of localized waves bifurcating from the edge of the essential spectrum of an associated Schr\\"odinger operator. We show by using a modified Lyapunov-Schmidt reduction method that the bifur- cation of localized standing waves occurs for every positive power nonlinearity. We distinguish a primary branch of never vanishing standing waves bifurcating from the trivial solution and an infinite sequence of higher branches with oscillating behavior in the ring. The higher branches bifurcate from the branches of degenerate standing waves with vanishing tail outside the ring. Moreover, we analyze stability of bifurcating standing waves. Namely, we show that the primary branch is composed by orbitally stable standing waves for subcritical power nonlinearities, while all nontrivial higher branches are linearly unstable near the bifurcation point. The stability character of the degenerate branches remains inconclusive at the analytical level, whereas heuristic arguments based on analysis of embedded eigenvalues of negative Krein signatures support the conjecture of their linear instability at least near the bifurcation point. Numerical results for the cubic NLS equation show that this conjecture is valid and that the degenerate branches become spectrally stable far away from the bifurcation point.

Diego Noja; Dmitry Pelinovsky; Gaukhar Shaikhova

2014-12-28T23:59:59.000Z

394

IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 47, NO. 2, FEBRUARY 2001 493 Introduction to the Special Issue on Codes on Graphs  

E-Print Network [OSTI]

by the excellent perfor- mance exhibited by the turbo codes of Berrou and Glavieux, MacKay and Neal's near-capacity results on Gallager codes, and the linear-complexity expander graph codes of Sipser and Spielman

Frey, Brendan J.

395

Belief propagation algorithm for computing correlation functions in finite-temperature quantum many-body systems on loopy graphs  

Science Journals Connector (OSTI)

Belief propagationa powerful heuristic method to solve inference problems involving a large number of random variableswas recently generalized to quantum theory. Like its classical counterpart, this algorithm is exact on trees when the appropriate independence conditions are met and is expected to provide reliable approximations when operated on loopy graphs. In this paper, we benchmark the performances of loopy quantum belief propagation (QBP) in the context of finite-temperature quantum many-body physics. Our results indicate that QBP provides reliable estimates of the high-temperature correlation function when the typical loop size in the graph is large. As such, it is suitable, e.g., for the study of quantum spin glasses on Bethe lattices and the decoding of sparse quantum error correction codes.

David Poulin and Ersen Bilgin

2008-05-16T23:59:59.000Z

396

A graph-based approach enhancing correctness and speed of web services composition through explicit specification of functional semantics  

Science Journals Connector (OSTI)

Since most of studies on the automated composition of web services do not consider the functional semantics of services, unsatisfied results may be generated against users' intentions. Their time complexity is very high since every possible combination of available services must be considered. To enhance the correctness and speed of the composition of services, we propose a graph-based composition method, which explicitly specifies and uses the functional semantics of web services. A representative action, which represents what a service actually does, is identified. Data dependencies among available services are organised and stored as an AND/OR graph, on which service composition is performed. Rules are devised to map a service onto an appropriate action and to combine service actions. Effective pruning rules are also proposed. The experimental results demonstrate the superiority of the proposed method in terms of the correctness and speed of service composition.

Dong-Hoon Shin; Kyong-Ho Lee; Fuyuki Ishikawa

2014-01-01T23:59:59.000Z

397

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

E-Print Network [OSTI]

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

Lucas Lacasa

2014-02-21T23:59:59.000Z

398

Towards the flexible reuse of model transformations: A formal approach based on graph transformation  

Science Journals Connector (OSTI)

Abstract Model transformations are the heart and soul of Model-Driven Engineering (MDE). However, in order to increase the adoption of MDE by industry, techniques for developing model transformations in the large and raising the quality and productivity in their construction, like reusability, are still needed. In previous works, we developed a reutilization approach for graph transformations based on the definition of concepts, which gather the structural requirements needed by meta-models to qualify for the transformations. Reusable transformations are typed by concepts, becoming transformation templates. Transformation templates are instantiated by binding the concept to a concrete meta-model, inducing a retyping of the transformation for the given meta-model. This paper extends the approach allowing heterogeneities between the concept and the meta-model, thus increasing the reuse opportunities of transformation templates. Heterogeneities are resolved by using algebraic adapters which induce both a retyping and an adaptation of the transformation. As an alternative, the adapters can also be employed to induce an adaptation of the meta-model, and in this work we show the conditions for equivalence of both approaches to transformation reuse.

Juan de Lara; Esther Guerra

2014-01-01T23:59:59.000Z

399

$K$-theory and homotopies of 2-cocycles on higher-rank graphs.  

E-Print Network [OSTI]

This paper continues our investigation into the question of when a homotopy $\\omega = {\\omega_t}_{t \\in [0,1]}$ of 2-cocycles on a locally compact Hausdorff groupoid $\\mathcal{G}$ gives rise to an isomorphism of the $K$-theory groups of the twisted groupoid $C^*$-algebras: $K_*(C^*(\\mathcal{G}, \\omega_0)) \\cong K_*(C^*(\\mathcal{G}, \\omega_1)).$ In particular, we build on work by Kumjian, Pask, and Sims to show that if $\\mathcal{G} = \\mathcal{G}_\\Lambda$ is the infinite path groupoid associated to a row-finite higher-rank graph $\\Lambda$ with no sources, and ${c_t}_{t \\in [0,1]}$ is a homotopy of 2-cocycles on $\\Lambda$, then $K_*(C^*(\\mathcal{G}_\\Lambda, \\sigma_{c_0})) \\cong K_*(C^*(\\mathcal{G}_\\Lambda, \\sigma_{c_1})),$ where $\\sigma_{c_t}$ denotes the 2-cocycle on $\\mathcal{G}_\\Lambda$ associated to the 2-cocycle $c_t$ on $\\Lambda$. We also prove a technical result (Theorem 3.5), namely that a homotopy of 2-cocycles on a locally compact Hausdorff groupoid $\\mathcal{G}$ gives rise to an upper semi-continuous $C^*$-bundle.

Elizabeth Gillaspy

400

On the Degree Distribution of P\\'{o}lya Urn Graph Processes  

E-Print Network [OSTI]

This paper presents a tighter bound on the degree distribution of arbitrary P\\'{o}lya urn graph processes, proving that the proportion of vertices with degree $d$ obeys a power-law distribution $P(d) \\propto d^{-\\gamma}$ for $d \\leq n^{\\frac{1}{6}-\\epsilon}$ for any $\\epsilon > 0$, where $n$ represents the number of vertices in the network. Previous work by Bollob\\'{a}s et al. formalized the well-known preferential attachment model of Barab\\'{a}si and Albert, and showed that the power-law distribution held for $d \\leq n^{\\frac{1}{15}}$ with $\\gamma = 3$. Our revised bound represents a significant improvement over existing models of degree distribution in scale-free networks, where its tightness is restricted by the Azuma-Hoeffding concentration inequality for martingales. We achieve this tighter bound through a careful analysis of the first set of vertices in the network generation process, and show that the newly acquired is at the edge of exhausting Bollob\\'as model in the sense that the degree expectation ...

Tutunov, Rasul; Jadbabaie, Ali; Eaton, Eric

2014-01-01T23:59:59.000Z

Note: This page contains sample records for the topic "view graph graph" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


401

Graph-theoretic analysis of discrete-phase-space states for condition change detection and quantification of information  

SciTech Connect (OSTI)

Data collected from devices and human condition may be used to forewarn of critical events such as machine/structural failure or events from brain/heart wave data stroke. By monitoring the data, and determining what values are indicative of a failure forewarning, one can provide adequate notice of the impending failure in order to take preventive measures. This disclosure teaches a computer-based method to convert dynamical numeric data representing physical objects (unstructured data) into discrete-phase-space states, and hence into a graph (structured data) for extraction of condition change.

Hively, Lee M.

2014-09-16T23:59:59.000Z

402

Complete graph asymptotics for the Ising and random cluster models on 5D grids with cyclic boundary  

E-Print Network [OSTI]

The finite size scaling behaviour for the Ising model in five dimensions, with either free or cyclic boundary, has been the subject for a long running debate. The older papers have been based on ideas from e.g. field theory or renormalization. In this paper we propose a detailed and exact scaling picture for critical region of the model with cyclic boundary. Unlike the previous papers our approach is based on a comparison with the existing exact and rigorous results for the FK-random-cluster model on a complete graph. Based on those results we identify several distinct scaling regions in an $L$-dependent window around the critical point. We test these predictions by comparing with data from Monte Carlo simulations and find a good agreement. The main feature which differs between the complete graph and the five dimensional model with free boundary is the existence of a bimodal energy distribution near the critical point in the latter. This feature was found by the same authors in an earlier paper in the form o...

Lundow, P H

2014-01-01T23:59:59.000Z

403

The Twelfth IEEE International Conference on Computer Vision, Kyoto, Japan. September 27 -October 4, 2009. Higher-Order Gradient Descent by Fusion-Move Graph Cut  

E-Print Network [OSTI]

, us- ing the reduction[6, 14] then available. The more recent reduction[10] for energies of even 4, 2009. Higher-Order Gradient Descent by Fusion-Move Graph Cut Hiroshi Ishikawa Nagoya City) the fusion move algorithm, ii) the reduction of higher-order binary energy minimization to first

Ishikawa, Hiroshi

404

The graphs at right show overall variability distribution estimated for the Pentium D 800 series (near) and the T1 Niagara (far) using the FPGA data  

E-Print Network [OSTI]

RESULTS The graphs at right show overall variability distribution estimated for the Pentium D 800 where a core no longer works properly. In the Sun T1 Niagara cores this is done with a built-in- self processors we record the temperature at which the failure occurred and adjust to the frequencies

Renau, Jose

405

arXiv:1104.0081v2[math.CO]4Apr2011 CAYLEY GRAPHS OF ORDER 16p ARE HAMILTONIAN  

E-Print Network [OSTI]

is prime. We show that if S is any generating set of G, then there is a hamiltonian cycle.2(1) of [10]. Namely, several of the main results of that paper combine to show: Every connected Cayley graph on G has a hamiltonian cycle if |G| = kp, where p is prime, 1 k

Morris, Joy

406

Design and analysis of algorithms and data structures for the efficient solution of graph theoretic problems on MIMD computers  

SciTech Connect (OSTI)

The problem of developing efficient algorithms and data structures to solve graph theoretic problems on tightly-coupled MIMD comuters is addressed. Several approaches to parallelizing a serial algorithm are examined. A technique is developed which allows the prediction of the expected execution time of some kinds of parallel algorithms. This technique can be used to determine which parallel algorithm is best for a particular application. Two parallel approximate algorithms for the Euclidean traveling salesman problem are designed and analyzed. The algorithms are parallelizations of the farthest-insertion heuristic and Karp's partitioning algorithm. Software lockout, the delay of processes due to contention for shared data structure, can be a significant hindrance to obtaining satisfactory speedup. Using the tactics of indirection and replication, new data structures are devised which can reduce the severity of software lockout. Finally, an upper bound to the speedup of parallel branch-and-bound algorithms which use the best-bound search strategy is determined.

Quinn, M.J.

1983-01-01T23:59:59.000Z

407

Structural convergence of web graph, social network and malaria network: an analytical framework for emerging web-hybrid search engine  

Science Journals Connector (OSTI)

It is a well known truth that there is no malaria transmission without blood-sucking bites by mosquitoes. Since there is no blood-sucking without contacts, it follows that the contacts between human beings and mosquitoes can be exploited to generate contact networks. Active computational research in this area is geared at developing new frontiers in modelling malaria transmission through network theory and methods. Ongoing research in this area points to the fact that there are structural similarities between web graph, social network and malaria networks. It is the aim of this paper to explore the structural convergence and to exploit this to build a framework that will pave the way for developing web-hybrid search engines. Like the emergence of search engines revolutionised web research, it is expected that application of search engines in malaria research will make a tremendous impact in malaria control.

Monday Eze; Jane Labadin; Terrin Lim

2014-01-01T23:59:59.000Z

408

The Need to Support of Data Flow Graph Visualization of Forensic Lucid Programs, Forensic Evidence, and their Evaluation by GIPSY  

E-Print Network [OSTI]

Lucid programs are data-flow programs and can be visually represented as data flow graphs (DFGs) and composed visually. Forensic Lucid, a Lucid dialect, is a language to specify and reason about cyberforensics cases. It includes the encoding of the evidence (representing the context of evaluation) and the crime scene modeling in order to validate claims against the model and perform event reconstruction, potentially within large swaths of digital evidence. To aid investigators to model the scene and evaluate it, instead of typing a Forensic Lucid program, we propose to expand the design and implementation of the Lucid DFG programming onto Forensic Lucid case modeling and specification to enhance the usability of the language and the system.

Mokhov, Serguei A; Debbabi, Mourad

2010-01-01T23:59:59.000Z

409

Sustainability analysis of complex dynamic systems using embodied energy flows: The eco-bond graphs modeling and simulation framework  

Science Journals Connector (OSTI)

Abstract This article presents a general methodology for modeling complex dynamic systems focusing on sustainability properties that emerge from tracking energy flows. We adopt the embodied energy (emergy) concept that traces all energy transformations required for running a process. Thus, energy at any process within a system is studied in terms of all the energy previously invested to support it (up to the primary sources) and therefore sustainability can be analyzed structurally. These ideas were implemented in the bond graph framework, a modeling paradigm where physical variables are explicitly checked for adherence to energy conservation principles. The results are a novel Ecological Bond Graphs (EcoBG) modeling paradigm and the new EcoBondLib library, a set of practical ready-to-use graphical models based on EcoBG principles and developed under the Modelica model encoding standard. EcoBG represents general systems in a three-faceted fashion, describing dynamics at their mass, energy, and emergy facets. EcoBG offers a scalable graphical formalism for the description of emergy dynamic equations, resolving some mathematical difficulties inherited from the original formulation of the equations. The core elements of EcoBG offer a soundly organized mathematical skeleton upon which new custom variables and indexes can be built to extend the modeling power. This can be done safely, without compromising the correctness of the core energy balance calculations. As an example we show how to implement a custom sustainability index at local submodels, for detecting unsustainable phases that are not automatically discovered when using the emergy technique alone. The fact that we implemented EcoBondLib relying on the Modelica technology opens up powerful possibilities for studying sustainability of systems with interactions between natural and industrial processes. Modelica counts on a vast and reusable knowledge base of industrial-strength models and tools in engineering applications, developed by the Modelica community throughout decades.

Rodrigo D. Castro; Franois E. Cellier; Andreas Fischlin

2014-01-01T23:59:59.000Z

410

From Entity Relationship to XML Schema: A Graph-Theoretic Approach  

Science Journals Connector (OSTI)

We propose a mapping from the Enhanced Entity Relationship conceptual model to the W3C XML Schema Language with the following properties: information and integrity constraints are preserved, no redundance is introduced, different hierarchical views of ...

Massimo Franceschet; Donatella Gubiani; Angelo Montanari; Carla Piazza

2009-08-01T23:59:59.000Z

411

L-RCM: a method to detect connected components in undirected graphs by using the Laplacian matrix and the RCM algorithm  

E-Print Network [OSTI]

In this paper we consider undirected graphs with no loops and multiple edges, consisting of k connected components. In these cases, it is well known that one can find a numbering of the vertices such that the adjacency matrix A is block diagonal with k blocks. This also holds for the (unnormalized) Laplacian matrix L= D-A, with D a diagonal matrix with the degrees of the nodes. In this paper we propose to use the Reverse Cuthill-McKee (RCM) algorithm to obtain a block diagonal form of L that reveals the number of connected components of the graph. We present some theoretical results about the irreducibility of the Laplacian matrix ordered by the RCM algorithm. As a practical application we present a very efficient method to detect connected components with a computational cost of O(m+n), being m the number of edges and n the number of nodes. The RCM method is implemented in some comercial packages like MATLAB and Mathematica. We make the computations by using the function symrcm of MATLAB. Some numerical resu...

Pedroche, Francisco; Carrascosa, Carlos; Palomares, Alberto

2012-01-01T23:59:59.000Z

412

Graphs, Strings, and Actions  

E-Print Network [OSTI]

c Springer Science+Business Media, LLC 2009 ...... [MS1] J. E. McClure and J. H. Smith. A solution of ... [MS3] James E. McClure and Jeffrey H. Smith.

2010-04-01T23:59:59.000Z

413

View Consistency in Architectures for Cyber-Physical Systems  

Science Journals Connector (OSTI)

Current methods for modeling, analysis, and design of cyber-physical systems lack a unifying framework due to the complexity and heterogeneity of the constituent elements and their interactions. Our approach is to define relationships between system ... Keywords: system architecture, view consistency, graph morphism, multi-domain modeling, cyber-physical systems

Ajinkya Bhave; Bruce H. Krogh; David Garlan; Bradley Schmerl

2011-04-01T23:59:59.000Z

414

Digitizer Auditory Graph: Making Graphs Accessible to the Visually  

E-Print Network [OSTI]

.2 Social Issues: Assistive technologies for persons with disabilities Copyright is held by the author 30332 USA heejoong@gatech.edu Bruce N. Walker Sonification Lab, Schools of Psychology and Interactive Computing Georgia Institute of Technology 654 Cherry St. Atlanta, GA 30332 USA bruce

415

Graphes et structures de donnes pour les graphes  

E-Print Network [OSTI]

,X,g,Y,f,W,c,U,a,V) n'est pas un cycle simpleC 2 =(U,c,W,e,X,g,Y,f,W,d,V,a,U) XU V W Z Y a c b e d f g h C1 C2 IFT2015

Hamel, Sylvie

416

Graphes et structures de donnes pour les graphes  

E-Print Network [OSTI]

simpleC 1 =(V,b,X,g,Y,f,W,c,U,a,V) n'est pas un cycle simpleC 2 =(U,c,W,e,X,g,Y,f,W,d,V,a,U) XU V W Z Y

Hamel, Sylvie

417

Presented by Scalable Graph Decompositions  

E-Print Network [OSTI]

Approach #12;4 Managed by UT-Battelle for the U.S. Department of Energy Sullivan_MapD_SC10 Tree by UT-Battelle for the U.S. Department of Energy Sullivan_MapD_SC10 Finding a tree decomposition · Tree.S. Department of Energy Sullivan_MapD_SC10 Yeast Protein Interaction Network Motivation · Massive data

418

Introduction to bond graph theory  

E-Print Network [OSTI]

the port interface. C2C1 C3 P1 P2 #12;P2C1 C3 C2 00 1 CC C P2P1 : C1 : C2: C3 1 2 3 45 6 7 P1 e1 = e6 = e3

Batlle, Carles

419

Continuous Control in Buildings with Bond Graphs  

E-Print Network [OSTI]

Global warming caused by CO2 emissions as a result of energy consumption, shows its growing effects on the average temperatures worldwide. Office buildings are responsible for a major share of the 40% of the energy consumption of the built...

Zeiler, W.

2011-01-01T23:59:59.000Z

420

Graph-Theoretic Connectivity Control of Mobile  

E-Print Network [OSTI]

exploration, surveillance, and recon- naissance, to cooperative construction and manipulation. The success]­[23]. This research has given rise to connectivity or topology control algorithms that regulate the transmission power is with the Department of Electrical and Computer Engineering, Georgia Institute of Technology, Atlanta, GA 30332 USA (e

Pappas, George J.

Note: This page contains sample records for the topic "view graph graph" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


421

Detecting Network Vulnerabilities Through Graph Theoretical Methods  

E-Print Network [OSTI]

a signi?cant linear relationship between generator size andof those generators. We performed simple linear regression

2007-01-01T23:59:59.000Z

422

Graph Algorithms in the Internet Age  

E-Print Network [OSTI]

V \\ {A}. We say that set S covers a set T if for every t ? Tin a set S such that the sources cover many elementsa set T . It iteratively finds the source in S that covers

Stanton, Isabelle Lesley

2012-01-01T23:59:59.000Z

423

Detecting Network Vulnerabilities Through Graph Theoretical Methods  

E-Print Network [OSTI]

benchmark power networks. 1 Introduction The electric power grid network is susceptible to power outages of our work is power networks, our techniques are applicable to other systems such as the transportation vulnerabilities in power networks is an important prob- lem, as even a small number of vulnerable connections can

Geddes, Cameron Guy Robinson

424

Detecting Network Vulnerabilities Through Graph Theoretical Methods  

E-Print Network [OSTI]

Introduction The electric power grid network is susceptibleProblem We model electric power grid networks as undirectedlines in the electric power grid network. Because of the

2007-01-01T23:59:59.000Z

425

Bond Graph Based Approach to Passive Teleoperation  

E-Print Network [OSTI]

Honeywell Labs, 3660 Technology Dr., Minneapolis, MN 55418 e-mail: kailash.kvishnaswamy@honeywell.com Perry

Li, Perry Y.

426

MONSTR: Term Graph Rewriting for Parallel  

E-Print Network [OSTI]

abstract and slightly simplified version of the language DACTL [GKSS88, GHK + 88]. The abstraction takes us

Banach, Richard

427

A Fibration Semantics for Extended Term Graph  

E-Print Network [OSTI]

­ ing was introduced, or of its generalization in the language DACTL itself [GKSS88, GHK + 88, GKS91

Banach, Richard

428

On the spectra of simplicial rook graphs  

E-Print Network [OSTI]

)(n? 2k ? 2)(k ? 2)Zn?k ? (n? 2k ? 1)(n? 2k ? 2) k? i=0 [ Xj + Yj ] + n?k?1? i=k+1 [ (2i? n)(n? i? 2)(Xi + Yi) + 2(i? k ? 1)(n? i? 2)Zi ] + k? j=0 [ (n? 2k ? 1)(n? 2k ? 2)(Xj + Yj) ] + n?k?1? j=k+1 [ (2j ? n)(k + j ? n)(Xj + Yj) + 2(j ? n+ k)(j ? 1? k)Zj... ) = ( n? (d?1)(d?2)2 d? 1 ) . #3; The permutohedron vectors account for almost all of the eigenvectors in the following sense: if Hd,n ? RN be the linear span of the eigenvectors constructed in Props. 3.1 and 3.2, then for each fixed d, we have lim n...

Martin, Jeremy L.; Wagner, Jennifer D.

2014-05-05T23:59:59.000Z

429

RDF analytics: lenses over semantic graphs  

Science Journals Connector (OSTI)

The development of Semantic Web (RDF) brings new requirements for data analytics tools and methods, going beyond querying to semantics-rich analytics through warehouse-style tools. In this work, we fully redesign, from the bottom up, core data analytics ... Keywords: OLAP, RDF, data warehouse

Dario Colazzo, Franois Goasdou, Ioana Manolescu, Alexandra Roati?

2014-04-01T23:59:59.000Z

430

Graph Transformation with Focus on Incident Edges  

E-Print Network [OSTI]

such as the sesqui-pushout, the heterogeneous pushout and the adaptive star grammars approaches. We first define-called shallow cloning [15] or deep cloning [20] operations). Informally, by cloning a node n, we mean making funded by the project CLIMT of the French Agence Nationale de la Recherche (ANR-11-BS02-016). #12;(Sq

Duval, Dominique

431

BASSET: Scalable Gateway Finder in Large Graphs  

SciTech Connect (OSTI)

Given a social network, who is the best person to introduce you to, say, Chris Ferguson, the poker champion? Or, given a network of people and skills, who is the best person to help you learn about, say, wavelets? The goal is to find a small group of 'gateways': persons who are close enough to us, as well as close enough to the target (person, or skill) or, in other words, are crucial in connecting us to the target. The main contributions are the following: (a) we show how to formulate this problem precisely; (b) we show that it is sub-modular and thus it can be solved near-optimally; (c) we give fast, scalable algorithms to find such gateways. Experiments on real data sets validate the effectiveness and efficiency of the proposed methods, achieving up to 6,000,000x speedup.

Tong, H; Papadimitriou, S; Faloutsos, C; Yu, P S; Eliassi-Rad, T

2010-11-03T23:59:59.000Z

432

Oracle Spatial and Graph Jayant Sharma  

E-Print Network [OSTI]

and Multimodal Networks ·Drive Time Polygon Analysis ·Trade Area Management ·Service Delivery Optimization ·Water affiliates. All rights reserved.13 Each mode (car, bus, rail, bike, etc) modeled as a separate network Performance for Spatial Workloads o Exploits Exadata's processing power, bandwidth, parallelism, security

Shahabi, Cyrus

433

Covering Graphs with Few Complete Bipartite Subgraphs  

E-Print Network [OSTI]

Vienna, Austria fleisch@dbai.tuwien.ac.at 2 Mathematics Department, University of Dar es Salaam PO Box 35062, Dar es Salaam, Tanzania emujuni@maths.udsm.ac.tz 3 Department of Computer Science, Durham

Paulusma, Daniel

434

Analysis of beacon triangulation in random graphs  

E-Print Network [OSTI]

and then based on these coordinates; the positions of other hosts are measured relative to the Landmarks. This scheme provides a fast and scalable way to estimate the network distances. Vivaldi [6] is another coordinate-based approach that assigns synthetic... and then based on these coordinates; the positions of other hosts are measured relative to the Landmarks. This scheme provides a fast and scalable way to estimate the network distances. Vivaldi [6] is another coordinate-based approach that assigns synthetic...

Kakarlapudi, Geetha

2005-02-17T23:59:59.000Z

435

Extremal infinite graph theory Theme: local )  

E-Print Network [OSTI]

(TAFEL). Ind.start: T is a star--easy. Ind.step: r has a successor x with bxc > 2. If bxc has order > 3

Diestel, Reinhard

436

Polynomials associated with graph coloring and orientations  

E-Print Network [OSTI]

is the idea of specializations, which are defined here as any substitution for the variables x1;x2;:::. Of particular interest is the principal specialization of F, psl(F)= F(1;1;:::;1| {z } l 1s ;0;0;:::); where l is some nonnegative integer, which plays a...

Humpert, Brandon Eugene

2011-04-26T23:59:59.000Z

437

Graphs from Volume 1 Book 2  

Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

to vitrify all Low Activity Waste (second LAW plant) -- Alternative 2B. 2 For all glass options, most of the impacts come from secondary waste. Secondary waste causes...

438

Evolutionary Design of Objects Using Scene Graphs  

E-Print Network [OSTI]

for the evolution of a wind turbine. The VRML representation produced better results. 1 Motivation Evolutionary of di#11;erent representations have been used in evolutionary design. They range from direct encoding

Ebner, Marc

439

Semidefinite programming relaxations for graph coloring and ...  

E-Print Network [OSTI]

Abstract. The semidefinite programming formulation of the Lovsz theta number does not only give one ...... et al., editor, Handbook in OR & MS, pages 393514.

440

Optimization in Geometric Graphs: Complexity and Approximation  

E-Print Network [OSTI]

computational tests. We propose using minimum bottleneck connected dominating set problem in order to determine the optimal transmission range of a wireless network that will ensure a certain size of "virtual backbone". We prove that this problem is NP...

Kahruman-Anderoglu, Sera

2011-02-22T23:59:59.000Z

Note: This page contains sample records for the topic "view graph graph" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


441

Single View Human Action Recognition using Key Pose Matching and Viterbi Path Searching  

E-Print Network [OSTI]

by a graph model called Action Net. Given the input, silhouette matching be- tween the input frames representation scheme called Action Net. Action Net is a graph model. Each node in the Action Net contains the 2D the essence of each action class even if there is variance in execution styles of the same action. The Action

Southern California, University of

442

Prime et al. Transposition of the Co-citation method with a view to Classifying Web Pages 1 Transposition of the Co-citation method with a view to Classifying  

E-Print Network [OSTI]

of the Web graph and more specifically the method of co-citation in this graph. sic_00153710,version1-11Jun the example of a Spanish student and a Spanish researcher both of whom are looking for information in nuclear cataloguing and indexing tasks. Since the manual application of metadata values is very costly, and given

Paris-Sud XI, Université de

443

Graph representation issues for pure and hybrid dataflow architectures  

E-Print Network [OSTI]

approach their peak for performance, simultaneity will be the key to high speed computations. When using the highest performance components, simultaneity is the only remaining considera- tion in achieving raw speed [13]. It is, therefore, reasonable... computers wffl evolve from conventional von Neumann computers rather than computers based on other models of computation. Designers of high performance architectures must ensure that delivered systems satisfy certain criteria. Dennis [12] poses three...

Perkins, Stephen James

2012-06-07T23:59:59.000Z

444

Construction and optimal search of interpolated motion graphs  

E-Print Network [OSTI]

to synthesize high quality human motion based only on a simple sketch or a few easily specified constraints. We provided by interpolation. We demonstrate the power of this approach by synthesizing optimal or near [16]. Figure 1 shows two examples of the motion generated by our system. We demonstrate the power

445

Efficient Parallel Graph Algorithms For Coarse Grained Multicomputers and BSP ?  

E-Print Network [OSTI]

7 , and S. W. Song 8 1 Univ. Federal de Mato Grosso do Sul, Campo Grande, Brasil, edson and Engineering Research Council of Canada, FAPESP (Brasil), CNPq (Brasil), PROTEM­2­TCPAC (Brasil

Santoro, Nicola

446

Bounds and Algorithms for the Knapsack Problem with Conflict Graph  

E-Print Network [OSTI]

Keywords: Knapsack Problem, Maximum Weight Stable Set Problem, Branch- and-Bound ..... Figure 3: Weighted clique cover algorithm of Held et al. [9].

2014-06-19T23:59:59.000Z

447

Polynomial algorithms for visibility graphs of staircase polygons  

E-Print Network [OSTI]

us to devise polynomial algorithms for some of the classical NP-Complete problems [4]. Some of the problems of interest are the maximum clique, the maxi- mum independent set, the minimum clique covering, and the isomorphism problems [4]. All... us to devise polynomial algorithms for some of the classical NP-Complete problems [4]. Some of the problems of interest are the maximum clique, the maxi- mum independent set, the minimum clique covering, and the isomorphism problems [4]. All...

Pisupati, Chandrasekhar

2012-06-07T23:59:59.000Z

448

Contributed Paper A Graph-Theory Framework for Evaluating Landscape  

E-Print Network [OSTI]

Carolina del Norte (E.U.A.). Comparamos este paisaje con redes simuladas con topolog´ia, resistencia a la. M´as aun, la red de h´abitats ten´ia caracter´isticas en com´un con las redes en planicies, que exhiben desplazamiento lento y con redes sin escalas, que son resistentes a las perturbaciones aleatorias

Illinois at Chicago, University of

449

Graph theoretic generalizations of clique: optimization and extensions  

E-Print Network [OSTI]

and telecommunication industry among others. The focus of this dissertation is a degree-based relaxation called k-plex. A distance-based relaxation called k-clique and a diameter-based relaxation called k-club are also investigated in this dissertation. We present...

Balasundaram, Balabhaskar

2009-05-15T23:59:59.000Z

450

Generalized Domination in Graphs with Applications in Wireless Networks  

E-Print Network [OSTI]

failure is considered by studying k-connected m-dominating set. We describe several structural properties that hold form ? k, but fail when m < k. Three different formulations based on vertex-cut inequalities are shown depending on the value of k and m...

Sung, Je Sang

2013-12-10T23:59:59.000Z

451

Quantum Fluctuations and Geometry: From Graph Counting to Ricci Flow  

E-Print Network [OSTI]

We discuss in rather general terms quantum field theories dealing with spaces of maps between Riemannian manifolds. In particular we explore the well--known connection between the renormalization group flow for non--linear sigma models and the Ricci flow.

Mauro Carfora; Stefano Romano

2009-02-12T23:59:59.000Z

452

Tradespace exploration for space system architectures : a weighted graph framework  

E-Print Network [OSTI]

Many systems undergo significant architecture-level change during their lifecycles as a result of exogenous system disturbances (e.g. budget reduction or changes in stakeholder requirements), failure to develop critical ...

Davison, Peter Leslie

2014-01-01T23:59:59.000Z

453

Earthquakes With Normal Focal Depths-Tables/Graphs  

Science Journals Connector (OSTI)

...seismoaraphs are in operation at the observatory...Mountain area are fairly cold. In the rugged area...Hallo Lagoon are in operation. Vol. XXI EARTHQUAKE...ionosphere specialists, a weather man, three glaciologists...comfortably at 70 by oil heaters. The men slapt two...every type. Hot and cold running water ware...

454

Dynamic Graph Generation for Large Scale Operational Train ...  

E-Print Network [OSTI]

Aug 1, 2011 ... Abstract: The aim of operational train timetabling is to find a conflict free timetable for a set of passenger and freight trains with predefined...

Frank Fischer

2011-08-01T23:59:59.000Z

455

Graph Rotation Systems for Physical Construction of Large Structures  

E-Print Network [OSTI]

), Form-Z, Rhinoceros 3D, Cadwork, 3ds Max and SketchUp. However, there are still a lot to do theoretically and practically. 9 II.2. Computer Graphics Applied to Architecture Computer Graphics techniques have been used in mostly virtual design...

Xing, Qing

2012-02-14T23:59:59.000Z

456

Exploring Blog Graphs Patterns and a Model for Information  

E-Print Network [OSTI]

success, discovering links between companies. Example: blogs in the 2004 election. [Adamic, Glance 2005MichelleMalkin #12;11 Blogosphere network Non-trivial vs. trivial cascades Cascades From networks to cascades slashdot boingboing DlistedMichelleMalkin Time #12;12 From networks to cascades Non-trivial vs. trivial

457

SURFACE DIFFUSION OF GRAPHS: VARIATIONAL FORMULATION, ERROR ANALYSIS, AND SIMULATION  

E-Print Network [OSTI]

on (t). In this reduced model f is given, whereas in the full model f corresponds to the elastic energy- cada del Litoral (IMAL), G¨uemes 3450, 3000 Santa Fe, Argentina (pmorin@math.unl.edu.ar). The research of Argentina and NSF grant DMS-9971450. This work was partly developed while this author was visiting

Morin, Pedro

458

A graph layout algorithm for drawing metabolic pathways  

Science Journals Connector (OSTI)

......out thanks to the support of the German Ministry for Education and Sciences (BMBF) (Project Bioregio 0312212) and the Klaus...59. Michal,G. (1993) Biochemical Pathways (poster). Boehringer Mannheim GmbH. Michal,G. (1999......

Moritz Y. Becker; Isabel Rojas

2001-05-01T23:59:59.000Z

459

On Dependency Graphs and the Lattice Gas Alexander D. Scott  

E-Print Network [OSTI]

College London London WC1E 6BT, England scott@math.ucl.ac.uk Alan D. Sokal Department of Physics New York probability space, for which one wishes to prove that P( xX Ax) > 0, i.e. that with positive probability none for independent subsets of vertices, i.e. the polynomial ZG(w) = X X X independent xX wx , (1.1) where we

Scott, Alexander Alexander

460

SIMPLICIAL EMBEDDINGS BETWEEN PANTS GRAPHS Javier Aramayona 1  

E-Print Network [OSTI]

is induced by a surface homeomorphism. More concretely, let be a compact orientable surface whose every, the group of homotopy classes of self-homeomorphisms of . Note that Mod() acts on P() by simplicial]: Theorem 1 ([Mar]). If is a compact, connected, orientable surface with () > 0, then the natural

Aramayona, Javier

Note: This page contains sample records for the topic "view graph graph" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


461

Energy-based analysis of biochemical cycles using bond graphs  

Science Journals Connector (OSTI)

...encouragement to embark on a new research direction...Hill, TL . 1989 Free energy transduction and biochemical cycle kinetics. New York, NY: Springer...cellular systems. New York, NY: Chapman Hall...D . 1977 Power and energy in linearized physical...

2014-01-01T23:59:59.000Z

462

Surface Reconstruction with Feature Preservation based on Graph-cuts  

E-Print Network [OSTI]

features. The effectiveness of the weighted minimal surface model E(S) is examined in the tetrahedral mesh is a very close approximation to the global minimum of EC (S). Various examples show the effectiveness Sciences, Nanyang Technological University, Singapore 637371. E-mail: wanm0003@e.ntu.edu.sg, {desheng,xctai}@ntu

Soatto, Stefano

463

Signed graphs for portfolio analysis in risk management  

Science Journals Connector (OSTI)

......IMA Journal of Management Mathematics (2002...analysis in risk management FRANK HARARY + Computer Science Department, New...portfolio from a risk management perspective can be...manage risk. One approach to contain risk is......

Frank Harary; Meng-Hiot Lim; Donald C. Wunsch

2002-07-01T23:59:59.000Z

464

The spaces of measure preserving equivalence relations and graphs  

E-Print Network [OSTI]

acts on Sg() by conjugation: g · H = gHg-1 . Proposition 1.2. The conjugation action of on Sg will show that gnHg-1 n gHg-1 , i.e., that for x , d(x, gnHg-1 n ) d(x, gHg-1 ). Now d(x, gnHg-1 n ) = d(g-1 n xgn, H) and d(x, gHg-1 ) = d(g-1 xg, H). Since g-1 n xgn g-1 xg and |d(x, H) - d(y, H)| d(x, y

Kechris, Alexander

465

A new graph model and algorithms for consistent superstring problems  

Science Journals Connector (OSTI)

...National Research Foundation of Korea (NRF) grant funded by the Korea government (MSIP...Korea) and by an Inha University research grant. Figure 1. (a) The AC machine for...methods and theory. New York, NY: Computer Science Press 3 Drmanac, R , and C...

2014-01-01T23:59:59.000Z

466

Design Guidelines for Audio Presentation of Graphs and Tables  

E-Print Network [OSTI]

Brown,L.M. Brewster,S.A. Ramloll,R. Burton,M. Riedel,B. ICAD 2003 Workshop on Auditory Displays In Assistive Technologies, Boston, M.A. International Conference on Auditory Display

Brown, L.M.; Brewster, S.A.

467

Introduction In 1975, Noy-Meir presented a comprehensive, graph-  

E-Print Network [OSTI]

equilibria (i.e. states of zero net cha; Parsons & Chapman 1998). This simple calculation illustrates that grazed grassland is necessarily

Schwinning, Susan - Department of Biology, Texas State University

468

Stereo vision based on compressed feature correlation and graph cut  

E-Print Network [OSTI]

This dissertation has developed a fast and robust algorithm to solve the dense correspondence problem with a good performance in untextured regions by merging Sparse Array Correlation from the computational fluids community ...

Tan, Sheng, 1976-

2005-01-01T23:59:59.000Z

469

Stochastic context-free graph grammars for glycoprotein modelling  

Science Journals Connector (OSTI)

The rapid progress in proteomics has generated an increased interest in the full characterization of glycoproteins. Tandem mass spectrometry is a useful technique. One common problem of current bioinformatics tools for automated interpretation of tandem ...

Baozhen Shan

2004-07-01T23:59:59.000Z

470

Energy-based analysis of biochemical cycles using bond graphs  

Science Journals Connector (OSTI)

...7 a shows the response of the amount...increases or the frequency of the input...require free-energy transduction...networks to derive frequency responses with respect...electrochemical energy storage: electrical...

2014-01-01T23:59:59.000Z

471

DETECTING CRITICAL NODES IN SPARSE GRAPHS Given a ...  

E-Print Network [OSTI]

This is beyond the scope of this paper, and is an interesting topic for future research. ..... OF CIVIL AND COASTAL ENGINEERING, UNIVERSITY OF FLORIDA,...

2008-08-21T23:59:59.000Z

472

APPROXIMATING SIGNALS SUPPORTED ON GRAPHS Xiaofan Zhu and Michael Rabbat  

E-Print Network [OSTI]

monitoring and the smart grid. For example, in field estimation [1, 2], a large number of wireless sensors these issues. We first generalize the concept of smooth signals and define a metric to measure the smoothness

Rabbat, Michael

473

Cuts and Partitions in Graphs/Trees with Applications  

E-Print Network [OSTI]

algorithm for the problem, which gives an upper bound of O(k3) on the kernel size, significantly improving the previous best upper bound O(k6). We further exploit this connection to give a parameterized algorithm for the problem that runs in time O? (1.62k...

Fan, Jia-Hao

2013-07-23T23:59:59.000Z

474

Parallel local search for Steiner trees in graphs  

Science Journals Connector (OSTI)

This paper discusses sequential and parallel local search for the Steiner tree problem ingraphs. We introduce novel neighborhoods whose computational time and space complexityis smaller than those known in the...

M.G.A. Verhoeven; M.E.M. Severens

1999-01-01T23:59:59.000Z

475

Approximating the Minimum Hub Cover Problem on Planar Graphs  

E-Print Network [OSTI]

Nov 25, 2014 ... The proposed algorithm incrementally constructs a search tree representing the ..... Ph.D. thesis, Sabanci University. Yelbay, B., S. ?I. Birbil,...

2014-11-25T23:59:59.000Z

476

Graph Theory: Problem Set 2 Jan 21, 2013  

E-Print Network [OSTI]

of G if uNG(v) ((v) - (u)) = 0. Show that G has at least two poles. Solution. Let Amax = {v | (v) is maximum} VG. Since is not a constant function, Amax is a nonempty proper subset of VG. Let A Amax be the set of those vertices v for which there exists a vertex u / Amax such that vu G. Since G is connected

Harju, Tero

477

Spectral problems of optical waveguides and quantum graphs  

E-Print Network [OSTI]

xjj 1g centered at x. We now give a more precise formulation of Theorem 2: Theorem 3. There exist positive constants C1 and C(z) such that k xuk C1 (1 + jx1j)N e C(z)dist(x;Sl); (2.22) where N is the order of polynomial boundedness of u. Remark 4... polynomially 20 one cannot expect anything better. In the periodic situation, using Floquet-Bloch theory, one can guarantee absence of this growth. Details of this claim will be provided at the end of this section. Proof. De ne the sesqui-linear form Q[';w...

Ong, Beng Seong

2006-10-30T23:59:59.000Z

478

DYNAMIC PROGRAMMING VERSUS GRAPH CUT ALGORITHMS Chris Glasbey  

E-Print Network [OSTI]

¨¨ ¨¨ ¨¨ ¨¨ ¨¨¨% uA u c 3 u c 1 u c 4 u c 4 u c 2 u c 5 u c 5 u c 3 u c 5 u c 3 u c 1 u c 2 u c 1 u c 2 u c 3 u c 5 u c 3 u c 1 u c 4 u c 4 u c 1 u c 2 u c 4 u c 4 u c 2 u c 5 u c 2 u c 1 u c 5 u c 3 sourceu rr rrrj u d d d d dd u c u © u ¨¨ ¨¨ ¨¨ ¨¨ ¨¨¨% uA u c 3 u c 1 u c 4 u c 4 u c 2 u c 5 u c

Stone, J. V.

479

Graph spectra and modal dynamics of oscillatory networks  

E-Print Network [OSTI]

Our research focuses on developing design-oriented analytical tools that enable us to better understand how a network comprising dynamic and static elements behaves when it is set in oscillatory motion, and how the ...

Ayazifar, Babak, 1967-

2003-01-01T23:59:59.000Z

480

The Geometry of Root Systems and Signed Graphs Thomas Zaslavsky  

E-Print Network [OSTI]

of advances in technology. For more information regarding JSTOR, please contact support@jstor.org. http, characteristic of our profession, to higher forms of education and human enrichment. In my friend and colleague. Publisher contact information may be obtained at http://www.jstor.org/journals/maa.html. Each copy of any

Zaslavsky, Thomas

Note: This page contains sample records for the topic "view graph graph" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


481

A Survey of Microseismic Activity - graphs on pgs. 2  

Science Journals Connector (OSTI)

...MEMBERSHIP COHM ITTEE Ross R. Heinrich...n~bers and changes or address should...seismograms, (2) a world-wide...Utah a 0.3 Bonneville lake beds Scoresbysund...Alaska 1.1 2.0 Graywacke...Stores, 221 North Grand Boulevard...SEISM and the name of the station...day of month (2) ml n2 sl s2...

L. M. Murphy

482

Using linear algebra and graph theory for satisfiability decision  

E-Print Network [OSTI]

, b}, {a, c} is a hitting clause-set. A k-uniform hitting clause-set is a hitting clause- set F, b}, {a, c} is a 1-uniform hitting clause-set. OK 01/2004 2 #12;The Algebra of Conflicts Barcelona clause). OK 01/2004 3 #12;The Algebra of Conflicts Barcelona, January 2004 How it started Hans Kleine B

Martin, Ralph R.

483

A Graph Theoretic Mathematical Model for Alzheimer's disease  

E-Print Network [OSTI]

by microglia, a cytokine that inhibits the secretion of IL1 and TNA. Dysregulation of lipid metabolism lipids that is dysregulated, though its exact mechanism in the AD process is not well

Baras, John S.

484

Conic approach to quantum graph parameters using linear ...  

E-Print Network [OSTI]

Jul 10, 2014 ... this construction is to show that for matrices supported by a cycle, being completely ...... By combining Theorems 2.2 and 3.7, we deduce that.

2014-07-10T23:59:59.000Z

485

Hamiltonian strongly regular graphs A. E. Brouwer & W. H. Haemers  

E-Print Network [OSTI]

, v K and v = u+ , then uHv...u is a longer cycle, if uHv denotes a path joining u and v via vertices+ | = |K- | (). (ii) If u, v K and u+ is adjacent to v+ , then uHv, , , u+ v+ ...u is a longer cycle

Brouwer, Andries E.

486

Vacuum energy and repulsive Casimir forces in quantum star graphs  

E-Print Network [OSTI]

;31#4; shows that E2a is closer to 12Ea than to Ea. We conclude that the permeable piston is attractive in the cubical configuration. #3;1#4; W. Lukosz, Physica #1;Utrecht#2; 56, 109 #1;1971#2;. #3;2#4; N. F. Svaiter and B. F. Svaiter, J. Phys. A 25, 979 #1...;31#4; shows that E2a is closer to 12Ea than to Ea. We conclude that the permeable piston is attractive in the cubical configuration. #3;1#4; W. Lukosz, Physica #1;Utrecht#2; 56, 109 #1;1971#2;. #3;2#4; N. F. Svaiter and B. F. Svaiter, J. Phys. A 25, 979 #1...

Fulling, Stephen; Kaplan, L.; Wilson, J. H.

2007-01-01T23:59:59.000Z

487

CHARTS / GRAPHS / IMAGES Mining Social Images with Distance Metric Learning  

E-Print Network [OSTI]

Tagging Pengcheng Wu wupe0003@ntu.edu.sg Fig. Average precision at top t annotated tags under 11 methods

Hoi, Steven Chu-Hong

488

A graph editing framework for the StreamIt language  

E-Print Network [OSTI]

A programming language is more useful if it provides a level of abstraction that makes programming more intuitive and also allows the development of tools that take advantage of the language's internal representation. ...

Reyes, Juan C. (Juan Carlos), 1980-

2004-01-01T23:59:59.000Z

489

THE OPERATOR FOR THE CHROMATIC NUMBER OF A GRAPH  

E-Print Network [OSTI]

by ADONET, Marie Curie Research Training Network MRTN-CT-2oo3-5o4438. ?Centrum voor ...... Mathematics of Operations Research, 28:47o-496. [21] Laurent, M. ... ?ournal of Combinatorics, Information & System Sciences, 3:134-

2007-11-15T23:59:59.000Z

490

Bond graph models of electromechanical systems. The AC generator case  

E-Print Network [OSTI]

. After reviewing electromechanical energy conversion and torque gener- ation, the core element present in any electromechanical system is introduced, and the corresponding electrical and mechanical ports are attached to it. No modulated elements are necessary, since the energy representation

Batlle, Carles

491

Computing the Grothendieck constant of some graph classes  

E-Print Network [OSTI]

Jun 10, 2011 ... Page 1 ... (CWI), Science Park 123, 1098 XG Amsterdam, The Netherlands. ... University, P.O. Box 90153, 5000 LE Tilburg, The Netherlands.

2011-06-10T23:59:59.000Z

492

Game matching number of graphs Douglas B. West  

E-Print Network [OSTI]

. Game: Two players, Max and Min, alternately choose edges of a matching, ending with a maximal matching. Max wants it to be large; Min wants it to be small. #12;The Matching Game We want a large matching but can't pick all the edges. Game: Two players, Max and Min, alternately choose edges of a matching

West, Douglas B.

493

Graph Coloring in the Estimation of Sparse Derivative Matrices ...  

E-Print Network [OSTI]

Mar 15, 2004 ... being run for 3 days on a Sun Blade 10 running Solaris. Chaff (a SAT solver) to- .... A sparse matrix library in c++ for high performance...

2004-03-15T23:59:59.000Z

494

GRAPH BASED DATA STRUCTURES FOR SKELETON BASED REFINEMENT ALGORITHMS  

E-Print Network [OSTI]

2 , A. Plaza 1 and M. A. Padrón 1 1 University of Las Palmas de Gran Canaria, Canary Islands, Spain

Rivero, Jose Pablo Suárez

495

Extremes are better: investigating mental map preservation in dynamic graphs  

E-Print Network [OSTI]

Purchase,H.C. Samra,A. Proceedings of the 5th International Conference on Diagrammatic Representation and Inference pp 60-73

Purchase, H.C.

496

Notes for Graduate Course "Graphs, Spectral Theory, and  

E-Print Network [OSTI]

of Eisenstein series (some notes on this can be found on my web- page). I wish to thank Jonathan circumventing Weil's deep p __ work showing |K`| 2 p, which is sharp). Our proof is just a geometri- cal rearrangement. There already is a DEEP algebraic- geometric proof

Miller, Stephen David

497

Beyond Streams and Graphs: Dynamic Tensor Analysis Dacheng Tao  

E-Print Network [OSTI]

not necessarily scale up, let alone operate on semi-infinite streams. Thus, we introduce the dynamic ten- sor nodes; all of them are identical or closely related to eigen analysis or derivatives; 4) social networks- zero entries in the adjacency matrix. The network value of a customer [13] has close ties to the first

498

Mysteries around the graph Laplacian eigenvalue 4 Yuji Nakatsukasaa  

E-Print Network [OSTI]

, which we previously observed through our numerical experiments. The eigen- value distribution, there is a sudden jump. Interest- ingly, the eigenvectors corresponding to the eigenvalues below 4 are semi of any eigen- vector corresponding to the eigenvalue greater than 4 decay exponentially from

Saito, Naoki

499

Mysteries around the graph Laplacian eigenvalue 4 Yuji Nakatsukasa1  

E-Print Network [OSTI]

from the eigen- value 0 up to 4. Then, at the eigenvalue 4, there is a sudden jump as shown in Figure 1 Laplacian eigen- value distributions. (a) 2D projection of dendrites of an RGC of a mouse; (b to the eigenvalues below 4 are semi-global oscillations (like Fourier modes) over the entire tree or one

Saito, Naoki

500

Alternative Fuels Data Center  

Alternative Fuels and Advanced Vehicles Data Center [Office of Energy Efficiency and Renewable Energy (EERE)]

Go Go Generated_thumb20130810-31804-12g76v6 Incentive and Law Additions by Targeted Agent Generated_thumb20130810-31804-12g76v6 Trend of state incentive and law enactments listed by the targeted agent from 2002-2010 Last update March 2013 View Graph Graph Download Data Natural-gas-stations Natural Gas Fueling Stations by State Natural-gas-stations View Map Graph Map_thumbnail Workplace Charging Challenge Partner Stations Map_thumbnail View Graph Graph Lng-stations Liquefied Natural Gas Fueling Stations by State Lng-stations View Map Graph L_i-electric Electric Vehicle Incentives and Laws, by State L_i-electric View Map Graph Propane_li_by_state Propane Incentives and Laws, by State Propane_li_by_state View Map Graph Generated_thumb20130810-31804-1f4rg7 On-Road AFVs Made Available by Year