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  

Science Conference Proceedings (OSTI)

... C++). More information. Journal of Combinatorics dynamic surveys DS8 and DS9 are a bibliography and glossary of graphs. ...

2013-11-18T23:59:59.000Z

2

graph drawing  

Science Conference Proceedings (OSTI)

... Layout Program (C). Graphviz: Graph Visualization Software (C), consisting of many graph drawing programs, viewers (C, Java, and TCL/TK), etc. ...

2013-11-18T23:59:59.000Z

3

Motion graphs  

Science Conference Proceedings (OSTI)

In this paper we present a novel method for creating realistic, controllable motion. Given a corpus of motion capture data, we automatically construct a directed graph called a motion graph that encapsulates connections among the database. The ... Keywords: animation with constraints, motion capture, motion synthesis

Lucas Kovar; Michael Gleicher; Frédéric Pighin

2002-07-01T23:59:59.000Z

4

Algorithms for string and graph layout  

E-Print Network (OSTI)

Many graph optimization problems can be viewed as graph layout problems. A layout of a graph is a geometric arrangement of the vertices subject to given constraints. For example, the vertices of a graph can be arranged on ...

Newman, Alantha.

2004-01-01T23:59:59.000Z

5

PDSF Utilization Graphs  

NLE Websites -- All DOE Office Websites (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 sketcher: extending illustration to quantitative graphs  

Science Conference Proceedings (OSTI)

Scientists, engineers, and educators commonly need to make graphs that quickly illustrate quantitative ideas yet are not based on specific data sets. We call these graphs quantitative concept diagrams (QCDs). Existing charting and illustration programs ... Keywords: charting, constraint-based layout, illustration, information visualization, planar map coloring, quantitative concept diagrams, snap-dragging

Robin Stewart; m.c. schraefel

2009-04-01T23:59:59.000Z

7

Learning Graph Matching  

E-Print Network (OSTI)

As a fundamental problem in pattern recognition, graph matching has applications in a variety of fields, from computer vision to computational biology. In graph matching, patterns are modeled as graphs and pattern recognition amounts to finding a correspondence between the nodes of different graphs. Many formulations of this problem can be cast in general as a quadratic assignment problem, where a linear term in the objective function encodes node compatibility and a quadratic term encodes edge compatibility. The main research focus in this theme is about designing efficient algorithms for approximately solving the quadratic assignment problem, since it is NP-hard. In this paper we turn our attention to a different question: how to estimate compatibility functions such that the solution of the resulting graph matching problem best matches the expected solution that a human would manually provide. We present a method for learning graph matching: the training examples are pairs of graphs and the `labels' are ma...

Caetano, Tiberio S; Cheng, Li; Le, Quoc V; Smola, Alex J

2008-01-01T23:59:59.000Z

8

Claw-free graphs and line graphs.  

E-Print Network (OSTI)

??The research of my dissertation is motivated by the conjecture ofThomassen that every 4-connected line graph is hamiltonian and by the conjecture ofTutte that every… (more)

Shao, Yehong, 1976-

2005-01-01T23:59:59.000Z

9

Almost self-centered graphs  

E-Print Network (OSTI)

The center of a graph is the set of vertices with minimum eccentricity. Graphs in which all vertices are central are called self-centered graphs. In this paper almost self-centered (ASC) graphs are introduced as the graphs with exactly two non-central vertices. The block structure of these graphs is described and constructions for generating such graphs are proposed. Embeddings of arbitrary graphs into ASC graphs are studied. In particular it is shown that any graph can be embedded into an ASC graph of prescribed radius. Embeddings into ASC graphs of radius two are studied in more detail. Embedding index of a graph G is introduced as the smallest number of vertices needed to add to G such that G is an induced subgraph of an ASC graph.

Sandi Klavzar; et al.

2009-01-01T23:59:59.000Z

10

directed acyclic word graph  

Science Conference Proceedings (OSTI)

... and R. Verin, Direct Construction of Compact Directed Acyclic Word Graphs, 8th Annual Symposium, CPM 97, Aarhus, Denmark, 116-129, 1997. ...

2013-08-23T23:59:59.000Z

11

Graph partitioning via recurrent multivalued neural networks  

Science Conference Proceedings (OSTI)

In this work, the well-known Graph Partitioning (GP) problem for undirected weighted graphs has been studied from two points of view: maximizing (MaxCut) or minimizing (MinCut) the cost of the cut induced in the graph by the partition. An unified model, ...

Enrique Mérida-Casermeiro; Domingo López-Rodríguez

2005-06-01T23:59:59.000Z

12

Undirected Graphs maze exploration  

E-Print Network (OSTI)

and Adar, 2004 corporate e-mail #12;5 Power transmission grid of Western US Reference: Duncan Watts #12 The Internet as mapped by The Opte Project http://www.opte.org #12;8 Graph terminology #12;9 Some graph

Sedgewick, Robert

13

Detachments of Complete Graphs  

Science Conference Proceedings (OSTI)

A detachment of a graph $G$ is formed by splitting each vertex into one or more subvertices, and sharing the incident edges arbitrarily among the subvertices. In this paper we consider the question of whether a graph $H$ is a detachment of some complete ...

Keith Edwards

2005-05-01T23:59:59.000Z

14

Graph anomalies in cyber communications  

Science Conference Proceedings (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

15

Slicibility of rectangular graphs and floorplan optimization  

Science Conference Proceedings (OSTI)

Keywords: floorplanning, graph dualization, heuristic search, nonslicible floorplans, planar graphs, slicible floorplans, very large scale integration

Partha S. Dasgupta; Susmita Sur-Kolay

1997-04-01T23:59:59.000Z

16

A Semantic Graph Query Language  

Science Conference Proceedings (OSTI)

Semantic graphs can be used to organize large amounts of information from a number of sources into one unified structure. A semantic query language provides a foundation for extracting information from the semantic graph. The graph query language described here provides a simple, powerful method for querying semantic graphs.

Kaplan, I L

2006-10-16T23:59:59.000Z

17

Crawling Online Social Graphs  

E-Print Network (OSTI)

Unbiased sampling of facebook,” 2009. [9] A. Korolova, R.these users. For example, Facebook was ranked as the 4thsample (1M node) of the Facebook graph. The basic idea is

Ye, Shaozhi; Lang, Juan; Wu, S F

2010-01-01T23:59:59.000Z

18

Graph Transformations in Relational Databases  

E-Print Network (OSTI)

The theory of graph transformation [2] was originally developed as a generalization of Chomsky grammars from strings to graphs. Methods, techniques, and tools from the area of graph transformations have already been studied and applied in many fields of computer science such as formal language theory, pattern recognition and generation, compiler construction, software engineering, etc. Despite the large variety of existing graph transformation tools, the implementation of their graph transformation engine typically follows the same principle. In this respect, first a matching occurrence of the left-hand side (LHS) of the graph transformation rule is being found by some sophisticated graph pattern matching algorithm. Then the engine performs some local modifications to add or remove graph elements to the matching pattern, and the entire process starts all over again. Since graph pattern matching leads to the subgraph isomorphism problem that is known to be NPcomplete in general, this step is considered to be the most crucial in the overall performance of a graph transformation engine. Current tools (e.g., PROGRES [4]) use different efficient strategies for the graph pattern matching phase. However, I argue that the overall complexity of a graph transformation engine is not necessarily equal to the complexity of the graph pattern matching phase, especially for long transformation sequences.

Gergely Varró

2004-01-01T23:59:59.000Z

19

Analysis of multilevel graph partitioning  

Science Conference Proceedings (OSTI)

Recently, a number of researchers have investigated a class of algorithms that are based on multilevel graph partitioning that have moderate computational complexity, and provide excellent graph partitions. However, there exists little theoretical analysis ...

George Karypis; Vipin Kumar

1995-12-01T23:59:59.000Z

20

Taxonomy-superimposed graph mining  

Science Conference Proceedings (OSTI)

New graph structures where node labels are members of hierarchically organized ontologies or taxonomies have become commonplace in different domains, e.g., life sciences. It is a challenging task to mine for frequent patterns in this new graph model ...

Ali Cakmak; Gultekin Ozsoyoglu

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

Towards graph containment search and indexing  

Science Conference Proceedings (OSTI)

Given a set of model graphs D and a query graph q, containment search aims to find all model graphs g ? D such that q contains g (q ? g). Due to the wide adoption of graph models, fast containment search ...

Chen Chen; Xifeng Yan; Philip S. Yu; Jiawei Han; Dong-Qing Zhang; Xiaohui Gu

2007-09-01T23:59:59.000Z

22

Temporal Representation in Semantic Graphs  

Science Conference Proceedings (OSTI)

A wide range of knowledge discovery and analysis applications, ranging from business to biological, make use of semantic graphs when modeling relationships and concepts. Most of the semantic graphs used in these applications are assumed to be static pieces of information, meaning temporal evolution of concepts and relationships are not taken into account. Guided by the need for more advanced semantic graph queries involving temporal concepts, this paper surveys the existing work involving temporal representations in semantic graphs.

Levandoski, J J; Abdulla, G M

2007-08-07T23:59:59.000Z

23

Errors in graph embedding algorithms  

Science Conference Proceedings (OSTI)

One major area of difficulty in developing an algorithm for embedding a graph on a surface is handling bridges which have more than one possible placement. This paper addresses a number of published algorithms where this has not been handled correctly. ... Keywords: Algorithm, Graph embedding, Graph genus, Torus

Wendy Myrvold; William Kocay

2011-03-01T23:59:59.000Z

24

Extremal graphs without 4-cycles  

Science Conference Proceedings (OSTI)

We prove an upper bound for the number of edges a C"4-free graph on q^2+q vertices can contain for q even. This upper bound is achieved whenever there is an orthogonal polarity graph of a plane of even order q. Keywords: Extremal graph, Polarity, Projective plane

Frank A. Firke, Peter M. Kosek, Evan D. Nash, Jason Williford

2013-05-01T23:59:59.000Z

25

Power domination in block graphs  

Science Conference Proceedings (OSTI)

The problem of monitoring an electric power system by placing as few measurement devices in the system as possible is closely related to the well-known domination problem in graphs. In 2002, Haynes et al. considered the graph theoretical representation ... Keywords: algorithm, block graphs, electric power system, power dominating set

Guangjun Xu; Liying Kang; Erfang Shan; Min Zhao

2006-08-01T23:59:59.000Z

26

Graph theoretic approach to parallel gene assembly  

Science Conference Proceedings (OSTI)

We study parallel complexity of signed graphs motivated by the highly complex genetic recombination processes in ciliates. The molecular gene assembly operations have been modeled by operations of signed graphs, i.e., graphs where the vertices have a ... Keywords: Double-split graphs, Gene assembly, Local complement, Parallel assembly, Perfect matching, Signed graphs, Split graphs

Tero Harju; Chang Li; Ion Petre

2008-11-01T23:59:59.000Z

27

Quantum chaos on discrete graphs  

E-Print Network (OSTI)

Adapting a method developed for the study of quantum chaos on {\\it quantum (metric)} graphs \\cite {KS}, spectral $\\zeta$ functions and trace formulae for {\\it discrete} Laplacians on graphs are derived. This is achieved by expressing the spectral secular equation in terms of the periodic orbits of the graph, and obtaining functions which belongs to the class of $\\zeta$ functions proposed originally by Ihara \\cite {Ihara}, and expanded by subsequent authors \\cite {Stark,Sunada}. Finally, a model of "classical dynamics" on the discrete graph is proposed. It is analogous to the corresponding classical dynamics derived for quantum graphs \\cite {KS}.

Uzy Smilansky

2007-04-26T23:59:59.000Z

28

Graph Homomorphisms for Quantum Players  

E-Print Network (OSTI)

A homomorphism from a graph X to a graph Y is an adjacency preserving mapping f:V(X)->V(Y). We consider a nonlocal game in which Alice and Bob are trying to convince a verifier with certainty that a graph X admits a homomorphism to Y. This is a generalization of the well-studied graph coloring game. Via systematic study of quantum homomorphisms we prove new results for graph coloring. Most importantly, we show that the Lovasz theta number of the complement lower bounds the quantum chromatic number, which itself is not known to be computable. We also show that other quantum graph parameters, such as quantum independence number, can differ from their classical counterparts. Finally, we show that quantum homomorphisms closely relate to zero-error channel capacity. In particular, we use quantum homomorphisms to construct graphs for which entanglement-assistance increases their one-shot zero-error capacity.

David E. Roberson; Laura Mancinska

2012-12-07T23:59:59.000Z

29

Games on Graphs  

E-Print Network (OSTI)

We introduce and study Maker-Breaker positional games on random graphs. Our goal is to determine the threshold probability pF for the existence of Maker's strategy to claim a member of F in the unbiased (one-on-one) game played on the edges of the random graph G(n; p), for various target families F of winning sets. More generally, for each probability above this threshold we study the smallest bias b such that Maker wins the (1: b) biased game. We investigate these functions for a number of basic games, like the connectivity game, the perfect matching game, the clique game, the Hamiltonian cycle game and the tree game. Particular attention is devoted to unbiased games, when b = 1. Next, we consider the planarity game and the k-coloring game on the complete graph on n vertices. In the planarity game the winning sets are all non-planar subgraphs, and in the k-coloring game the winning sets are all non-k-colorable subgraphs. For both of the games we look at a (1: b) biased game. We are interested in determining the largest bias b such that Maker wins the Maker-Breaker version of the game. On the other hand, we want to find the largest bias b such that Forcer wins the Avoider-Forcer version of the game. Finally, we deal with balanced online games on the random graph process. The game is played by a player called Painter. Edges in the random graph process are introduced two at a time. For each pair of edges Painter immediately and irrevocably chooses one of the two possibilities to color one of them red and the other one blue. His goal is to avoid creating a monochromatic copy of a prescribed fixed graph H, for as long as possible. We study the threshold mH for the number of edges to be played to know that Painter almost surely will create a monochromatic copy of H, for H being a cycle, a path and a star.

Milos Stojakovic

2005-01-01T23:59:59.000Z

30

Distributed large-scale natural graph factorization  

Science Conference Proceedings (OSTI)

Natural graphs, such as social networks, email graphs, or instant messaging patterns, have become pervasive through the internet. These graphs are massive, often containing hundreds of millions of nodes and billions of edges. While some theoretical models ... Keywords: asynchronous algorithms, distributed optimization, graph algorithms, graph factorization, large-scale machine learning, matrix factorization

Amr Ahmed, Nino Shervashidze, Shravan Narayanamurthy, Vanja Josifovski, Alexander J. Smola

2013-05-01T23:59:59.000Z

31

On crossing numbers of geometric proximity graphs  

Science Conference Proceedings (OSTI)

Let P be a set of n points in the plane. A geometric proximity graph on P is a graph where two points are connected by a straight-line segment if they satisfy some prescribed proximity rule. We consider four classes of higher order proximity graphs, ... Keywords: Crossing number, Geometric graphs, Proximity graphs

Bernardo M. Ábrego; Ruy Fabila-Monroy; Silvia Fernández-Merchant; David Flores-Peñaloza; Ferran Hurtado; Vera Sacristán; Maria Saumell

2011-05-01T23:59:59.000Z

32

A history of graph entropy measures  

Science Conference Proceedings (OSTI)

This survey seeks to describe methods for measuring the entropy of graphs and to demonstrate the wide applicability of entropy measures. Setting the scene with a review of classical measures for determining the structural information content of graphs, ... Keywords: Entropy, Graph complexity, Graph entropy, Graphs, Information inequalities, Information measures, Information theory, Structural complexity

Matthias Dehmer; Abbe Mowshowitz

2011-01-01T23:59:59.000Z

33

Energy of graphs and digraphs.  

E-Print Network (OSTI)

??The energy of a graph is the sum of the absolute values of the eigenvalues of its adjacency matrix. The concept is related to the… (more)

Jahanbakht, Nafiseh

2010-01-01T23:59:59.000Z

34

Skewed graph partitioning  

Science Conference Proceedings (OSTI)

Graph partitioning is an important abstraction used in solving many scientific computing problems. Unfortunately, the standard partitioning model does not incorporate considerations that are important in many settings. We address this by describing a generalized partitioning model which incorporates the notion of partition skew and is applicable to a variety of problems. We then develop enhancements to several important partitioning algorithms necessary to solve the generalized partitioning problem. Finally we demonstrate the benefit of employing several of these generalized methods to static decomposition of parallel computing problems.

Hendrickson, B.; Leland, R. [Sandia National Labs., Albuquerque, NM (United States); Van Driessche, R. [Alcatel Telecom, Antwerp (Belgium)

1997-02-01T23:59:59.000Z

35

A graph theoretic approach to ultrafast information distribution: Borel Cayley graph resizing algorithm  

Science Conference Proceedings (OSTI)

A graph theoretic approach is proposed to formulate communication graphs that enable ultrafast information distribution. In our earlier work, we reported that Borel Cayley graph (BCG) is a promising candidate as a logical topology for fast information ... Keywords: Borel Cayley graph, Cayley graph, Graph theory, Interconnection networks, Network modeling

Jaewook Yu; Eric Noel; K. Wendy Tang

2010-11-01T23:59:59.000Z

36

Clustering based on a near neighbor graph and a grid cell graph  

Science Conference Proceedings (OSTI)

This paper presents two novel graph-clustering algorithms, Clustering based on a Near Neighbor Graph (CNNG) and Clustering based on a Grid Cell Graph (CGCG). CNNG algorithm inspired by the idea of near neighbors is an improved graph-clustering method ... Keywords: Clustering, Grid Cell Graph, Grid cell, Near Neighbor Graph, Near neighbor point set

Xinquan Chen

2013-06-01T23:59:59.000Z

37

Robust Hamiltonicity of Dirac graphs  

E-Print Network (OSTI)

A graph is Hamiltonian if it contains a cycle which passes through every vertex of the graph exactly once. A classical theorem of Dirac from 1952 asserts that every graph on $n$ vertices with minimum degree at least $n/2$ is Hamiltonian. We refer to such graphs as Dirac graphs. In this paper we extend Dirac's theorem in two directions and show that Dirac graphs are robustly Hamiltonian in a very strong sense. First, we consider a random subgraph of a Dirac graph obtained by taking each edge independently with probability $p$, and prove that there exists a constant $C$ such that if $p \\ge C \\log n / n$, then a.a.s. the resulting random subgraph is still Hamiltonian. Second, we prove that if a $(1:b)$ Maker-Breaker game is played on a Dirac graph, then Maker can construct a Hamiltonian subgraph as long as the bias $b$ is at most $cn /\\log n$ for some absolute constant $c > 0$. Both of these results are tight up to a constant factor, and are proved under one general framework.

Krivelevich, Michael; Sudakov, Benny

2012-01-01T23:59:59.000Z

38

Quantum networks modelled by graphs  

Science Conference Proceedings (OSTI)

Quantum networks are often modelled using Schrödinger operators on metric graphs. To give meaning to such models one has to know how to interpret the boundary conditions which match the wave functions at the graph vertices. In this article we give a survey

Pavel Exner; Olaf Post

2008-01-01T23:59:59.000Z

39

On Generating Random Network Structures: Connected Graphs  

Science Conference Proceedings (OSTI)

are presented for random generation of connected graphs, sugraphs (sub- graphs on the ... a distribution and take it into account at estimation. Attainability is ...

40

From quantum graphs to quantum random walks  

E-Print Network (OSTI)

We give a short overview over recent developments on quantum graphs and outline the connection between general quantum graphs and so-called quantum random walks.

Gregor Tanner

2005-04-29T23: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

Probe threshold and probe trivially perfect graphs  

Science Conference Proceedings (OSTI)

An undirected graph G=(V,E) is a probeC graph if its vertex set can be partitioned into two sets, N (nonprobes) and P (probes) where N is independent and there exists E^'@?NxN such that G^'=(V,E@?E^') is a C graph. In this article we investigate probe ... Keywords: 2-SAT, Graph class, Probe graphs, Probe interval, Probe threshold, Probe trivially perfect

Daniel Bayer; Van Bang Le; H. N. de Ridder

2009-11-01T23:59:59.000Z

42

Nested (2,r)-regular graphs and their network properties.  

E-Print Network (OSTI)

??A graph G is a (t, r)-regular graph if every collection of t independent vertices is collectively adjacent to exactly r vertices. If a graph… (more)

Brooks, Josh Daniel

2012-01-01T23:59:59.000Z

43

APPROXIMATING THE CHROMATIC NUMBER OF A GRAPH BY ...  

E-Print Network (OSTI)

Dec 16, 2005 ... ?(G) of a graph G. We introduce an operator ? mapping any graph parameter ?( G), nested between ...... On the Shannon capacity of a graph.

44

Time Series Graphs of Global and Hemispheric Temperature Anomalies...  

NLE Websites -- All DOE Office Websites (Extended Search)

Time Series Graphs of Global and Hemispheric Temperature Anomalies graphics Graph - Global and Hemispheric Annual Temperature Anomalies, 1850-2012 graphics Graph - Northern...

45

Positional Games on Random Graphs  

E-Print Network (OSTI)

We introduce and study Maker/Breaker-type positional games on random graphs. Our main concern is to determine the threshold probability pF for the existence of Maker's strategy to claim a member of in the unbiased game played on the edges of random graph G(n, p), for various target families of winning sets. More generally, for each probability above this threshold we study the smallest bias b such that Maker wins the (1: b) biased game. We investigate these functions for a number of basic games, like the connectivity game, the perfect matching game, the clique game and the Hamiltonian cycle game.

Milos Stojakovic; Tibor Szabo

2005-01-01T23:59:59.000Z

46

A discrete curvature on a planar graph  

E-Print Network (OSTI)

Given a planar graph derived from a spherical, euclidean or hyperbolic tessellation, one can define a discrete curvature by combinatorial properties, which after embedding the graph in a compact 2d-manifold, becomes the Gaussian curvature.

M. Lorente

2004-12-20T23:59:59.000Z

47

Graph coloring and related symmetric functions - CECM  

E-Print Network (OSTI)

metric functions), pa (the power sum symmetric functions), s~ (the Schur functions ), ..... It is true for line graphs (a special class of claw-free graphs) by a result of.

48

0-1 graph partitioning and image segmentation  

E-Print Network (OSTI)

Graph partitioning is the grouping of all the nodes in a graph into two or more partitions based on certain criteria. Graph cut techniques are used to partition a graph. The Minimum Cut method gives imbalanced partitions. ...

Goh, Chun Fan

2008-01-01T23:59:59.000Z

49

Mining closed relational graphs with connectivity constraints  

Science Conference Proceedings (OSTI)

Relational graphs are widely used in modeling large scale networks such as biological networks and social networks. In this kind of graph, connectivity becomes critical in identifying highly associated groups and clusters. In this paper, we investigate ... Keywords: closed pattern, connectivity, graph

Xifeng Yan; X. Jasmine Zhou; Jiawei Han

2005-08-01T23:59:59.000Z

50

A Graph Analytical Approach for Topic Detection  

Science Conference Proceedings (OSTI)

Topic detection with large and noisy data collections such as social media must address both scalability and accuracy challenges. KeyGraph is an efficient method that improves on current solutions by considering keyword cooccurrence. We show that KeyGraph ... Keywords: KeyGraph-based Topic Detection, Topic detection, community detection, network analysis

Hassan Sayyadi, Louiqa Raschid

2013-12-01T23:59:59.000Z

51

Bipartite graph partitioning and data clustering  

Science Conference Proceedings (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 ... Keywords: bipartite graph, correspondence analysis, document clustering, graph partitioning, singular value decomposition, spectral relaxation

Hongyuan Zha; Xiaofeng He; Chris Ding; Horst Simon; Ming Gu

2001-10-01T23:59:59.000Z

52

Introducing complete graphs in molecular connectivity studies  

Science Conference Proceedings (OSTI)

The mathematical model of the molecular polarizability of fifty-four organic compounds, of the lattice enthalpy of twenty metal halides, and of the partition coefficient of twenty-five organic compounds has been used to test four different complete graph, ... Keywords: Mathematical model, algorithms, chemical graphs, complete graphs, core electrons, molecular connectivity, polarizability

Lionello Pogliani

2005-01-01T23:59:59.000Z

53

Drawing graphs nicely using simulated annealing  

Science Conference Proceedings (OSTI)

The paradigm of simulated annealing is applied to the problem of drawing graphs “nicely.” Our algorithm deals with general undirected graphs with straight-line edges, and employs several simple criteria for the aesthetic quality of the result. ... Keywords: aesthetics, graph drawing, simulated annealing

Ron Davidson; David Harel

1996-10-01T23:59:59.000Z

54

Constrained Graph Optimization: Interdiction and Preservation Problems  

SciTech Connect

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

55

Happy Endings for Flip Graphs  

E-Print Network (OSTI)

Abstract. We show that the triangulations of a finite point set form a flip graph that can be embedded isometrically into a hypercube, if and only if the point set has no empty convex pentagon. Point sets of this type include convex subsets of lattices, points on two lines, and several other infinite families. As a consequence, flip distance in such point sets can be computed efficiently. 1

unknown authors

2006-01-01T23:59:59.000Z

56

Happy Endings for Flip Graphs  

E-Print Network (OSTI)

We show that the triangulations of a finite point set form a flip graph that can be embedded isometrically into a hypercube, if and only if the point set has no empty convex pentagon. Point sets of this type include intersections of lattices with convex sets, points on two lines, and several other infinite families. As a consequence, flip distance in such point sets can be computed efficiently.

David Eppstein

2007-01-01T23:59:59.000Z

57

Computing Information Value from RDF Graph Properties  

Science Conference Proceedings (OSTI)

Information value has been implicitly utilized and mostly non-subjectively computed in information retrieval (IR) systems. We explicitly define and compute the value of an information piece as a function of two parameters, the first is the potential semantic impact the target information can subjectively have on its recipient's world-knowledge, and the second parameter is trust in the information source. We model these two parameters as properties of RDF graphs. Two graphs are constructed, a target graph representing the semantics of the target body of information and a context graph representing the context of the consumer of that information. We compute information value subjectively as a function of both potential change to the context graph (impact) and the overlap between the two graphs (trust). Graph change is computed as a graph edit distance measuring the dissimilarity between the context graph before and after the learning of the target graph. A particular application of this subjective information valuation is in the construction of a personalized ranking component in Web search engines. Based on our method, we construct a Web re-ranking system that personalizes the information experience for the information-consumer.

al-Saffar, Sinan; Heileman, Gregory

2010-11-08T23:59:59.000Z

58

API Requirements for Dynamic Graph Prediction  

SciTech Connect

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

59

Mixture graph based semi-supervised dimensionality reduction  

Science Conference Proceedings (OSTI)

Graph structure is crucial to graph based dimensionality reduction. A mixture graph based semi-supervised dimensionality reduction (MGSSDR) method with pairwise constraints is proposed. MGSSDR first constructs multiple diverse graphs on different random ... Keywords: dimensionality reduction, mixture graph, noise, pairwise constraints

G. X. Yu; H. Peng; J. Wei; Q. L. Ma

2010-12-01T23:59:59.000Z

60

LINEAR INEQUALITIES AMONG GRAPH INVARIANTS: USING ...  

E-Print Network (OSTI)

[30] P. Fowler, P. Hansen, G. Caporossi, and A. Soncini, Polyenes with maximum homo-lumo gap. (variable neighborhood search for extremal graphs 7), ...

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 algorithms in the titan toolkit.  

Science Conference Proceedings (OSTI)

Graph algorithms are a key component in a wide variety of intelligence analysis activities. The Graph-Based Informatics for Non-Proliferation and Counter-Terrorism project addresses the critical need of making these graph algorithms accessible to Sandia analysts in a manner that is both intuitive and effective. Specifically we describe the design and implementation of an open source toolkit for doing graph analysis, informatics, and visualization that provides Sandia with novel analysis capability for non-proliferation and counter-terrorism.

McLendon, William Clarence, III; Wylie, Brian Neil

2009-10-01T23:59:59.000Z

62

A copositive programming approach to graph partitioning  

E-Print Network (OSTI)

Aug 3, 2005 ... the random graph we can determine OPTMC by inspection, see column 3. The last 4 columns .... completeness. Freeman, San Francisco, 1979.

63

Line graph explorer: scalable display of line graphs using Focus+Context  

Science Conference Proceedings (OSTI)

Scientific measurements are often depicted as line graphs. State-of-the-art high throughput systems in life sciences, telemetry and electronics measurement rapidly generate hundreds to thousands of such graphs. Despite the increasing volume and ubiquity ... Keywords: Focus+Context, line graph

Robert Kincaid; Heidi Lam

2006-05-01T23:59:59.000Z

64

Multithreaded Algorithms for Graph Coloring  

SciTech Connect

Graph algorithms are challenging to parallelize when high performance and scalability are primary goals. Low concurrency, poor data locality, irregular access pattern, and high data access to computation ratio are among the chief reasons for the challenge. The performance implication of these features is exasperated on distributed memory machines. More success is being achieved on shared-memory, multi-core architectures supporting multithreading. We consider a prototypical graph problem, coloring, and show how a greedy algorithm for solving it can be e*ectively parallelized on multithreaded architectures. We present in particular two di*erent parallel algorithms. The first relies on speculation and iteration, and is suitable for any shared-memory, multithreaded system. The second uses data ow principles and is targeted at the massively multithreaded Cray XMT system. We benchmark the algorithms on three di*erent platforms and demonstrate scalable runtime performance. In terms of quality of solution, both algorithms use nearly the same number of colors as the serial algorithm.

Catalyurek, Umit V.; Feo, John T.; Gebremedhin, Assefaw H.; Halappanavar, Mahantesh; Pothen, Alex

2012-10-21T23:59:59.000Z

65

Feature Tracking Using Reeb Graphs  

Science Conference Proceedings (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

66

Scalable modeling of real graphs using Kronecker multiplication  

Science Conference Proceedings (OSTI)

Given a large, real graph, how can we generate a synthetic graph that matches its properties, i.e., it has similar degree distribution, similar (small) diameter, similar spectrum, etc? We propose to use "Kronecker graphs", which naturally obey ...

Jure Leskovec; Christos Faloutsos

2007-06-01T23:59:59.000Z

67

Generating random graphs with large girth  

Science Conference Proceedings (OSTI)

We present a simple and efficient algorithm for randomly generating simple graphs without small cycles. These graphs can be used to design high performance Low-Density Parity-Check (LDPC) codes. For any constant k, ? ? 1/2k(k ...

Mohsen Bayati; Andrea Montanari; Amin Saberi

2009-01-01T23:59:59.000Z

68

Collaborative robotic instruction: A graph teaching experience  

Science Conference Proceedings (OSTI)

Graphing is a key skill in the study of Physics. Drawing and interpreting graphs play a key role in the understanding of science, while the lack of these has proved to be a handicap and a limiting factor in the learning of scientific concepts. It has ... Keywords: Face-to-face computer supported collaborative learning, Intelligent tutoring systems, Interactive learning environments, Robotic assisted teaching

Rubén Mitnik; Matías Recabarren; Miguel Nussbaum; Alvaro Soto

2009-09-01T23:59:59.000Z

69

Inflo: collaborative reasoning via open calculation graphs  

Science Conference Proceedings (OSTI)

Inflo is a web tool that introduces new ways to collaboratively construct and deconstruct logical arguments drawn as visual dataflow graphs. Inflo graphs are dynamic: nodes are logical propositions that can contain computations based on ... Keywords: collaboration, decision making, knowledge curation

Jonathan Lung; Steve Easterbrook

2012-02-01T23:59:59.000Z

70

Anonymizing bipartite graph data using safe groupings  

Science Conference Proceedings (OSTI)

Private data often come in the form of associations between entities, such as customers and products bought from a pharmacy, which are naturally represented in the form of a large, sparse bipartite graph. As with tabular data, it is desirable to be able ... Keywords: Graph, Microdata, Privacy, Query answering

Graham Cormode; Divesh Srivastava; Ting Yu; Qing Zhang

2010-02-01T23:59:59.000Z

71

Expressing graph algorithms using generalized active messages  

Science Conference Proceedings (OSTI)

Recently, graph computation has emerged as an important class of high-performance computing application whose characteristics differ markedly from those of traditional, compute-bound, kernels. Libraries such as BLAS, LAPACK, and others have been successful ... Keywords: active messages, parallel graph algorithms, parallel programming models

Nick Edmonds; Jeremiah Willcock; Andrew Lumsdaine

2013-08-01T23:59:59.000Z

72

Improved call graph comparison using simulated annealing  

Science Conference Proceedings (OSTI)

The amount of suspicious binary executables submitted to Anti-Virus (AV) companies are in the order of tens of thousands per day. Current hash-based signature methods are easy to deceive and are inefficient for identifying known malware that have undergone ... Keywords: call graph, graph edit distance, malware, simulated annealing, static analysis

Orestis Kostakis; Joris Kinable; Hamed Mahmoudi; Kimmo Mustonen

2011-03-01T23:59:59.000Z

73

Graph mining: Laws, generators, and algorithms  

Science Conference Proceedings (OSTI)

How does the Web look? How could we tell an abnormal social network from a normal one? These and similar questions are important in many fields where the data can intuitively be cast as a graph; examples range from computer networks to sociology to biology ... Keywords: Generators, graphs, patterns, social networks

Deepayan Chakrabarti; Christos Faloutsos

2006-06-01T23:59:59.000Z

74

Quantum Algorithms for Graph Problems -- A Survey  

E-Print Network (OSTI)

In this survey we give an overview about important methods to construct quantum algorithms and quantum lower bounds for graph problems. We show how to use these methods, and we give a summary about the quantum complexity of the most important graph problems. At the end of our paper, we give some interesting questions in this research area.

Sebastian Dörn

2006-01-01T23:59:59.000Z

75

Oriented unicyclic graphs with extremal skew energy  

E-Print Network (OSTI)

Let $\\G$ be an oriented graph of order $n$ and $\\a_1,\\a_2,..., \\a_n$ denote all the eigenvalues of the skew-adjacency matrix of $\\G.$ The skew energy $\\displaystyle{\\cal E}_s(\\G)= \\sum_{i=1}^{n} |\\a_i|.$ In this paper, the oriented unicyclic graphs with minimal and maximal skew energy are determined.

Yaoping, Hou; Chongyan, Zhang

2011-01-01T23:59:59.000Z

76

Bond Graph Modeling Of Variable Structure Systems  

E-Print Network (OSTI)

The problem of describing variable structure models in a compact, object--oriented fashion is revisited and analyzed from the perspective of bond graph modeling. Traditionally, bond graphs have always been used to describe continuous-- time physical processes with a fixed structure. Yet, this paper shall demonstrate that bond graphs are equally suitable to describe variable structure models as fixed structure models. Moreover, a bond graph description of variable structure models can teach us a lot about the essential properties of variable structure models, properties that are not easily visible when other modeling approaches are taken. The paper discusses issues related to causality reassignment and conditional index changes as a consequence of switching in a physical system. Keywords: Bond graphs, variable structure system, computational causality, conditional index change, switching, object--oriented modeling, Dymola. INTRODUCTION When the causality strokes were added to the forme...

François E. Cellier; Martin Otter; Hilding Elmqvist

1995-01-01T23:59:59.000Z

77

A combinatorial construction of almost-ramanujan graphs using the zig-zag product  

Science Conference Proceedings (OSTI)

Reingold, Vadhan and Wigderson [21] introduced the graph zig-zag product. This product combines a large graph and a small graph into one graph, such that the resulting graph inherits its size from the large graph, its degree from the small graph ... Keywords: expander graphs, zig-zag product

Avraham Ben-Aroya; Amnon Ta-Shma

2008-05-01T23:59:59.000Z

78

Bond graph modeling of centrifugal compressor system  

E-Print Network (OSTI)

system, active surge control. A novel method of modeling centrifugal compression systems for surge control purposes by using bond graphs is presented. By using the bond graph method, we get a simple description of compression systems based on physical phenomena and it is straight forward to get the dynamic equations. It is demonstrated that several active surge control methods can be represented by the same bond graph. It is also shown how methods for active surge control can be classified using energy flow in terms of upstream energy injection or downstream energy dissipation. A model of a compression system with recycle flow is derived in this work. 1.

Nur Uddin; Jan Tommy Gravdahl

2012-01-01T23:59:59.000Z

79

Upper oriented chromatic number of undirected graphs and oriented colorings of product graphs  

E-Print Network (OSTI)

The oriented chromatic number of an oriented graph $\\vec G$ is the minimum order of an oriented graph $\\vev H$ such that $\\vec G$ admits a homomorphism to $\\vev H$. The oriented chromatic number of an undirected graph $G$ is then the greatest oriented chromatic number of its orientations. In this paper, we introduce the new notion of the upper oriented chromatic number of an undirected graph $G$, defined as the minimum order of an oriented graph $\\vev U$ such that every orientation $\\vec G$ of $G$ admits a homomorphism to $\\vec U$. We give some properties of this parameter, derive some general upper bounds on the ordinary and upper oriented chromatic numbers of Cartesian, strong, direct and lexicographic products of graphs, and consider the particular case of products of paths.

Sopena, Eric

2010-01-01T23:59:59.000Z

80

Image segmentation by iterated region merging with localized graph cuts  

Science Conference Proceedings (OSTI)

This paper presents an iterated region merging-based graph cuts algorithm which is a novel extension of the standard graph cuts algorithm. Graph cuts addresses segmentation in an optimization framework and finds a globally optimal solution to a wide ... Keywords: Graph cuts, Image segmentation, Region merging

Bo Peng; Lei Zhang; David Zhang; Jian Yang

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


81

The depleted hydrogen atoms in chemical graph theory  

Science Conference Proceedings (OSTI)

A new algorithm which explicitly describes the depleted hydrogen atoms is proposed for chemical graph computations, and especially for molecular connectivity model studies. The new algorithm continues to be centred on the concepts of complete graphs ... Keywords: General chemical graphs, complete graphs, hydrogen perturbation, molecular connectivity computations

Lionello Pogliani

2008-12-01T23:59:59.000Z

82

On the density of a graph and its blowup  

Science Conference Proceedings (OSTI)

It is well known that, of all graphs with edge-density p, the random graph G(n,p) contains the smallest density of copies of K"t","t, the complete bipartite graph of size 2t. Since K"t","t is a t-blowup of an edge, the following intriguing open question ... Keywords: Blowup, Graph density, Triangle density

Asaf Shapira; Raphael Yuster

2010-11-01T23:59:59.000Z

83

Theoretical underpinnings for maximal clique enumeration on perturbed graphs  

Science Conference Proceedings (OSTI)

The problem of enumerating the maximal cliques of a graph is a computationally expensive problem with applications in a number of different domains. Sometimes the benefit of knowing the maximal clique enumeration (MCE) of a single graph is worth investing ... Keywords: Graph algorithms, Graph perturbation theory, Maximal clique enumeration, Uncertain and noisy data

William Hendrix; Matthew C. Schmidt; Paul Breimyer; Nagiza F. Samatova

2010-06-01T23:59:59.000Z

84

Graph Invariants and Large Cycles - a Survey  

E-Print Network (OSTI)

Graph invariants are the best and single tools for investigation of abstract structures of graphs. They, combined in convenient relations, carry global and general information about a graph and its various substructures (cycle structures, factors, colorings, coverings, and so on). In this survey paper we have attempted to bring together all direct (pure) relations between basic invariants of a graph and its large cycle structures, perhaps the most important cycle structures, namely Hamilton, longest, dominating and some generalized cycles including Hamilton and dominating cycles as special cases. These very few relations actually form a source (basis) from which nearly all possible hamiltonian results can be developed further based on generalized and extended invariants, extended list of path or cycle structures and additional structural limitations.

Nikoghosyan, Zh G

2010-01-01T23:59:59.000Z

85

Electronic tools for designing charts and graphs  

E-Print Network (OSTI)

This thesis explores the issues involved in designing an interactive chart and graph making system, especially tailored to the needs of the graphic designer. It defines a set of user interface requirements and describe the ...

Jones, Mary, M.S.V.S. Massachusetts Institute of Technology

1983-01-01T23:59:59.000Z

86

The Gram dimension of a graph  

E-Print Network (OSTI)

be a Gram representation of Xi and let U an orthogonal matrix mapping u. (1) j to u. (2) ...... On the Shannon capacity of a graph IEEE Trans. Inform. Th. IT-25:.

87

Continuous Time Group Discovery in Dynamic Graphs  

Science Conference Proceedings (OSTI)

With the rise in availability and importance of graphs and networks, it has become increasingly important to have good models to describe their behavior. While much work has focused on modeling static graphs, we focus on group discovery in dynamic graphs. We adapt a dynamic extension of Latent Dirichlet Allocation to this task and demonstrate good performance on two datasets. Modeling relational data has become increasingly important in recent years. Much work has focused on static graphs - that is fixed graphs at a single point in time. Here we focus on the problem of modeling dynamic (i.e. time-evolving) graphs. We propose a scalable Bayesian approach for community discovery in dynamic graphs. Our approach is based on extensions of Latent Dirichlet Allocation (LDA). LDA is a latent variable model for topic modeling in text corpora. It was extended to deal with topic changes in discrete time and later in continuous time. These models were referred to as the discrete Dynamic Topic Model (dDTM) and the continuous Dynamic Topic Model (cDTM), respectively. When adapting these models to graphs, we take our inspiration from LDA-G and SSN-LDA, applications of LDA to static graphs that have been shown to effectively factor out community structure to explain link patterns in graphs. In this paper, we demonstrate how to adapt and apply the cDTM to the task of finding communities in dynamic networks. We use link prediction to measure the quality of the discovered community structure and apply it to two different relational datasets - DBLP author-keyword and CAIDA autonomous systems relationships. We also discuss a parallel implementation of this approach using Hadoop. In Section 2, we review LDA and LDA-G. In Section 3, we review the cDTM and introduce cDTMG, its adaptation to modeling dynamic graphs. We discuss inference for the cDTM-G and details of our parallel implementation in Section 4 and present its performance on two datasets in Section 5 before concluding in Section 6.

Miller, K; Eliassi-Rad, T

2010-11-04T23:59:59.000Z

88

Semiregular Factorization of Simple Graphs A. J. W. Hilton  

E-Print Network (OSTI)

]. A (d, d + 1)-graph is said to be semiregular. An (r, r + 1)-factorization of a graph is a decomposition of the graph into edge-disjoint (r, r + 1)-factors. We discuss here the state of knowledge about (r, r +1)-factorizations of d-regular graphs and of (d, d + 1)-graphs. For r, s 0, let (r, s) be the least integer

Wojciechowski, Jerzy

89

Improving accessibility to statistical graphs: the iGraph-Lite system  

Science Conference Proceedings (OSTI)

Information is often presented in graphical form. Unfortunately, current assistive technologies such as screen readers are not well-equipped to handle these representations. To provide accessibility to graphs published in ``The Daily" (Statistics Canada's ... Keywords: accessibility (blind and visually impaired), natural language interaction, statistical graphs

Leo Ferres; Petro Verkhogliad; Gitte Lindgaard; Louis Boucher; Antoine Chretien; Martin Lachance

2007-10-01T23:59:59.000Z

90

GRAPHS AND (Z2) k-ACTIONS  

E-Print Network (OSTI)

Abstract. Let (?, M n) be an effective smooth action of (Z2) k on an n-dimensional smooth closed connected manifold having a finite fixed set. One can associate to this action a regular graph of valency n. If the action is nonbounding one uses this graph to obtain a lower bound for the number of fixed points. Furthermore, this result is applied to a general nonbounding (Z2) k-action fixing a finite fixed set. With the help of graphs and the Kosniowski-Stong formula, up to cobordism all (Z2) k-actions fixing three isolated points (resp. four isolated points) are classified completely, and at the same time, the Smith problem for (Z2) k-actions fixing three isolated points (resp. four isolated points) is also solved. 1.

Zhi L Ü

2005-01-01T23:59:59.000Z

91

Graph clustering with network structure indices  

E-Print Network (OSTI)

Graph clustering has become ubiquitous in the study of relational data sets. We examine two simple algorithms: a new graphical adaptation of the k-medoids algorithm and the Girvan-Newman method based on edge betweenness centrality. We show that they can be effective at discovering the latent groups or communities that are defined by the link structure of a graph. However, both approaches rely on prohibitively expensive computations, given the size of modern relational data sets. Network structure indices (NSIs) are a proven technique for indexing network structure and efficiently finding short paths. We show how incorporating NSIs into these graph clustering algorithms can overcome these complexity limitations. We also present promising quantitative and qualitative evaluations of the modified algorithms on synthetic and real data sets. 1.

Matthew J. Rattigan; Marc Maier; David Jensen

2007-01-01T23:59:59.000Z

92

Subgraphs of quasi-random oriented graphs  

E-Print Network (OSTI)

One cannot guarantee the presence of an oriented four-cycle in an oriented graph $D$ simply by demanding it has many edges, as an acyclic orientation of the complete graph on $n$ vertices has $\\binom{n}{2}$ edges -- the most possible -- but contains no oriented cycle. We show that a simple quasi-randomness condition on the orientation of $D$ does allow one to guarantee the presence of an oriented four-cycle. Significantly our results work even for sparse oriented graphs. Furthermore, we give examples which show that, in a sense, our result is best possible. We also prove a result concerning oriented six-cycles and a more general result in the case $D$ is dense. Finally, we raise a number of questions and conjectures related to these results.

Amini, Omid; Huc, Florian

2009-01-01T23:59:59.000Z

93

An empirical comparison of some approximate methods for graph coloring  

Science Conference Proceedings (OSTI)

The Graph Coloring Problem (GCP) is a classical NP-complete problem for which several approximate solution algorithms have been proposed: Brelaz algorithm, simulated annealing (SA), ant colony optimization (ACO). This paper reports empirical results ... Keywords: graph coloring, gravitational swarm

Israel Rebollo-Ruiz; Manuel Graña

2012-03-01T23:59:59.000Z

94

Sequoia tops Graph 500 list of 'big data' supercomputers  

NLE Websites -- All DOE Office Websites (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

95

Long alternating cycles in edge-colored complete graphs  

Science Conference Proceedings (OSTI)

Let Knc denote a complete graph on n vertices whose edges are colored in an arbitrary way. And let ?(Knc) denote the maximum number of edges of the same ... Keywords: alternating cycle, color degree, edge-colored graph

Hao Li; Guanghui Wang; Shan Zhou

2007-08-01T23:59:59.000Z

96

Using constraints to achieve stability in automatic graph layout algorithms  

Science Conference Proceedings (OSTI)

Automatic layout algorithms are commonly used when displaying graphs on the screen because they provide a “nice” drawing of the graph without user intervention. There are, however, a couple of disadvantages to automatic layout. Without user ...

Karl-Friedrich Böhringer; Frances Newbery Paulisch

1990-03-01T23:59:59.000Z

97

Efficient algorithms for graph all-matching and containment search.  

E-Print Network (OSTI)

??Recent advances in database research have shown the potential of graph in modelling complicated data. Graph data have pervaded many modern applications including bio-informatics, chem-informatics,… (more)

Zhu, Gaoping

2012-01-01T23:59:59.000Z

98

The cost of monotonicity in distributed graph searching  

E-Print Network (OSTI)

are placed at a particular vertex of the graph, called the homebase. Moreover, this sequence of moves must is aiming at clearing the whole network. Given a graph G and a homebase v0 V (G), the search problem

Ilcinkas, David

99

The cost of monotonicity in distributed graph searching  

E-Print Network (OSTI)

of the graph, called the homebase. Moreover, this sequence of moves must satisfy that recontamination never network. Given a graph G and a homebase v0 V (G), the search problem consists in designing a distributed

Paris-Sud XI, Université de

100

FASTEST MIXING MARKOV CHAIN ON GRAPHS WITH SYMMETRIES  

E-Print Network (OSTI)

We show how to exploit symmetries of a graph to efficiently compute the fastest mixing Markov chain on the graph (i.e., find the transition probabilities on the edges to minimize the second-largest eigenvalue modulus of ...

Xiao, Lin

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

Computing maximum non-crossing matching in convex bipartite graphs  

Science Conference Proceedings (OSTI)

We consider computing a maximum non-crossing matching in convex bipartite graphs. For a convex bipartite graph of n vertices and m edges, we present an O (n logn ...

Danny Z. Chen; Xiaomin Liu; Haitao Wang

2012-05-01T23:59:59.000Z

102

A hybrid parallel genetic algorithm approach for graph coloring  

Science Conference Proceedings (OSTI)

Graph-Coloring problem (GCP) deals with assigning labels (colors) to the vertices of a graph such that adjacent vertices do not get the same color. Coloring a graph with minimum number of colors is a well-known NP-hard problem. In this paper a new permutation ... Keywords: Graph coloring problem, message passing interface (MPI), migration model, parallel genetic algorithm, static wavelength assignment

S. N. Sivanandam; S. Sumathi; T. Hamsapriya

2005-08-01T23:59:59.000Z

103

THE OPERATOR © FOR THE CHROMATIC NUMBER OF A GRAPH£ ¡  

E-Print Network (OSTI)

We introduce an operator © mapping any graph parameter ¬( ), nested between the stability number ...... Local chromatic number and Sperner capacity. ?ournal.

104

Hamiltonian Graphs and the Traveling Salesman Problem  

E-Print Network (OSTI)

A new characterization of Hamiltonian graphs using f-cutset matrix is proposed. A new exact polynomial time algorithm for the traveling salesman problem (TSP) based on this new characterization is developed. We then define so called ordered weighted adjacency list for given weighted complete graph and proceed to the main result of the paper, namely, the exact algorithm based on utilization of ordered weighted adjacency list and the simple properties that any path or circuit must satisfy. This algorithm performs checking of sub-lists, containing (p-1) entries (edge pairs) for paths and p entries (edge pairs) for circuits, chosen from ordered adjacency list in a well defined sequence to determine exactly the shortest Hamiltonian path and shortest Hamiltonian circuit in a weighted complete graph of p vertices. The procedure has intrinsic advantage of landing on the desired solution in quickest possible time and even in worst case in polynomial time. A new characterization of shortest Hamiltonian tour for a weighted complete graph satisfying triangle inequality (i.e. for tours passing through every city on a realistic map of cities where cities can be taken as points on a Euclidean plane) is also proposed. Finally, we discuss a novel classical algorithm for unstructured search and its effect on any of the NP-Complete problems.

Dhananjay P. Mehendale

2007-04-27T23:59:59.000Z

105

Multilevel heuristic algorithm for graph partitioning  

Science Conference Proceedings (OSTI)

Many real applications involve optimisation problems where more than one objective has to be optimised at the same time. One of these kinds of problems is graph partitioning, that appears in applications such as VLSI design, data-mining, efficient disc ...

Raul Baños; Consolación Gil; Julio Ortega; Francisco G. Montoya

2003-04-01T23:59:59.000Z

106

Exploiting graph properties of game trees  

Science Conference Proceedings (OSTI)

The state space of most adversary games is a directed graph. However, due to the success of simple recursive algorithms based on Alpha-Beta, theoreticians and practitioners have concentrated on the traversal of trees, giving the field the name "game-tree ... Keywords: game playing, search

Aske Plaat; Jonathan Schaeffer; Wim Pijls; Arie de Bruin

1996-08-01T23:59:59.000Z

107

Suggesting friends using the implicit social graph  

Science Conference Proceedings (OSTI)

Although users of online communication tools rarely categorize their contacts into groups such as "family", "co-workers", or "jogging buddies", they nonetheless implicitly cluster contacts, by virtue of their interactions with them, forming implicit ... Keywords: contact group clustering, implicit social graph, tie strength

Maayan Roth; Assaf Ben-David; David Deutscher; Guy Flysher; Ilan Horn; Ari Leichtberg; Naty Leiser; Yossi Matias; Ron Merom

2010-07-01T23:59:59.000Z

108

Graph clustering with network structure indices  

Science Conference Proceedings (OSTI)

Graph clustering has become ubiquitous in the study of relational data sets. We examine two simple algorithms: a new graphical adaptation of the k-medoids algorithm and the Girvan-Newman method based on edge betweenness centrality. We show that ...

Matthew J. Rattigan; Marc Maier; David Jensen

2007-06-01T23:59:59.000Z

109

Grid smoothing: a graph-based approach  

Science Conference Proceedings (OSTI)

In the past few years, mesh representation of images has attracted a lot of research interest due to its wide area of applications in image processing. In the mesh framework, an image is represented by a graph in which the nodes represent the pixels ... Keywords: content adaptative mesh, grid smoothing, image coding, non-linear optimisation

Guillaume Noel; Karim Djouani; Yskandar Hamam

2010-11-01T23:59:59.000Z

110

Graph grammars with string-regulated rewriting  

Science Conference Proceedings (OSTI)

Multicellular organisms undergo a complex developmental process, orchestrated by the genetic information in their cells, in order to form a newborn individual from a fertilized egg. This complex process, not completely understood yet, is believed to ... Keywords: Development, Expressive power, Genetic regulation, Graph grammars, Regulated rewriting

Daniel Lobo; Francisco J. Vico; Jürgen Dassow

2011-10-01T23:59:59.000Z

111

Computing role assignments of chordal graphs  

Science Conference Proceedings (OSTI)

In social network theory, a simple graph G is called k-role assignable if there is a surjective mapping that assigns a number from {1,...,k} called a role to each vertex of G such that any two vertices with the same role have ...

Pim Van't Hof; Daniël Paulusma; Johan M. M. Van Rooij

2009-09-01T23:59:59.000Z

112

Diagnosability of star graphs with missing edges  

Science Conference Proceedings (OSTI)

In this paper, we study the system diagnosis on an n-dimensional star under the comparison model. Following the concept of local diagnosability [3], the strong local diagnosability property [7] is discussed; this property describes the equivalence of ... Keywords: Comparison diagnosis model, Extended star structure, Local diagnosability, MM* diagnosis model, Star graph, Strong local diagnosability property

Chieh-Feng Chiang; Guo-Huang Hsu; Lun-Min Shih; Jimmy J. M. Tan

2012-04-01T23:59:59.000Z

113

Quantum secret sharing with qudit graph states  

Science Conference Proceedings (OSTI)

We present a unified formalism for threshold quantum secret sharing using graph states of systems with prime dimension. We construct protocols for three varieties of secret sharing: with classical and quantum secrets shared between parties over both classical and quantum channels.

Keet, Adrian; Fortescue, Ben; Sanders, Barry C. [Institute for Quantum Information Science, University of Calgary, Alberta, T2N 1N4 (Canada); Markham, Damian [LTCI-CNRS, Telecom ParisTech, 37/39 rue Dareau, F-75014 Paris (France)

2010-12-15T23:59:59.000Z

114

Quantum secret sharing with qudit graph states  

E-Print Network (OSTI)

We present a unified formalism for threshold quantum secret sharing using graph states of systems with prime dimension. We construct protocols for three varieties of secret sharing: with classical and quantum secrets shared between parties over both classical and quantum channels.

Adrian Keet; Ben Fortescue; Damian Markham; Barry C. Sanders

2010-04-26T23:59:59.000Z

115

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

116

A graph based method for faster display for distribution networks  

Science Conference Proceedings (OSTI)

This paper presents our logical display approach for Distribution Networks based on the concept of Microsoft graphs. We demonstrate that by using Microsoft graphs we do not have to redraw the circuits after each switching operation or after a change ... Keywords: algorithms, distribution, graphs, logical display, network systems

Mansoor Al-A'ali

2008-06-01T23:59:59.000Z

117

Kinetic and stationary point-set embeddability for plane graphs  

Science Conference Proceedings (OSTI)

We investigate a kinetic version of point-set embeddability. Given a plane graph G(V,E) where |V|=n, and a set P of n moving points where the trajectory of each point is an algebraic function of constant ... Keywords: kinetic algorithm, kinetic graph drawing, plane graph, point-set embeddability

Zahed Rahmati; Sue H. Whitesides; Valerie King

2012-09-01T23:59:59.000Z

118

Modeling molecular polarizabilities with graph-theoretical concepts  

Science Conference Proceedings (OSTI)

A model study of the molecular polarizabilities of a wide heterogeneous class of organic compounds was carried out. The model of this property was based on graph-theoretical molecular connectivity and pseudoconnectivity basis indices, including the corresponding ... Keywords: complete graphs, core electrons, graph-theoretical connectivity indices, molecular polarizabilities

Lionello Pogliani

2004-12-01T23:59:59.000Z

119

Discovering informative connection subgraphs in multi-relational graphs  

Science Conference Proceedings (OSTI)

Discovering patterns in graphs has long been an area of interest. In most approaches to such pattern discovery either quantitative anomalies, frequency of substructure or maximum flow is used to measure the interestingness of a pattern. In this paper ... Keywords: multi-relational graphs, semantic pattern discovery in RDF graphs, subgraph discovery

Cartic Ramakrishnan; William H. Milnor; Matthew Perry; Amit P. Sheth

2005-12-01T23:59:59.000Z

120

Image segmentation using quadtree-based similarity graph and normalized cut  

Science Conference Proceedings (OSTI)

The graph cuts in image segmentation have been widely used in recent years because it regards the problem of image partitioning as a graph partitioning issue, a well-known problem in graph theory. The normalized cut approach uses spectral graph properties ... Keywords: graph partitioning, image segmentation, quadtree, spectral graph

Marco Antonio Garcia De Carvalho; Anselmo Castelo Branco Ferreira; André Luis Costa

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


121

StreamWorks - A system for Dynamic Graph Search  

Science Conference Proceedings (OSTI)

Acting on time-critical events by processing ever growing social media, news or cyber data streams is a major technical challenge. Many of these data sources can be modeled as multi-relational graphs. Mining and searching for subgraph patterns in a continuous setting requires an efficient approach to incremental graph search. The goal of our work is to enable real-time search capabilities for graph databases. This demonstration will present a dynamic graph query system that leverages the structural and semantic characteristics of the underlying multi-relational graph.

Choudhury, Sutanay; Holder, Larry; Chin, George; Ray, Abhik; Beus, Sherman J.; Feo, John T.

2013-06-11T23:59:59.000Z

122

Maker Can Construct a Sparse Graph on a Small Board  

E-Print Network (OSTI)

We study Maker/Breaker games on the edges of sparse graphs. Maker and Breaker take turns in claiming previously unclaimed edges of a given graph H. Maker aims to occupy a given target graph G and Breaker tries to prevent Maker from achieving his goal. We define a function f and show that for every d-regular graph G on n vertices there is a graph H with at most f(d)n edges such that Maker can occupy a copy of G in the game on H.

Gebauer, Heidi

2010-01-01T23:59:59.000Z

123

Implementing Graph Pattern Queries on a Relational Database  

Science Conference Proceedings (OSTI)

When a graph database is implemented on top of a relational database, queries in the graph query language are translated into relational SQL queries. Graph pattern queries are an important feature of a graph query language. Translating graph pattern queries into single SQL statements results in very poor query performance. By taking into account the pattern query structure and generating multiple SQL statements, pattern query performance can be dramatically improved. The performance problems encountered with the single SQL statements generated for pattern queries reflects a problem in the SQL query planner and optimizer. Addressing this problem would allow relational databases to better support semantic graph databases. Relational database systems that provide good support for graph databases may also be more flexible platforms for data warehouses.

Kaplan, I L; Abdulla, G M; Brugger, S T; Kohn, S R

2007-12-26T23:59:59.000Z

124

Visibility graph analysis of solar wind velocity  

E-Print Network (OSTI)

We analyze in situ measurements of solar wind velocity obtained by Advanced Composition Explorer (ACE) spacecraft and Helios spacecraft during the years 1998-2012 and 1975-1983 respectively. The data belong to mainly solar cycle 23 (1996-2008) and solar cycle 21 (1976-1986) respectively. We use Directed Horizontal Visibility graph (DHVg) algorithm and estimate a graph functional, namely, the degree distance (D) as the Kullback-Leibler divergence (KLD) argument to understand time irreversibility of solar wind time series. We estimate this degree distance irreversibility parameter for these time series at different phases of solar activity cycle. Irreversibility parameter is first established for known dynamical data and then applied for solar wind velocity time series. It is observed that irreversibility in solar wind velocity fluctuations show similar behaviour at 0.3 AU (Helios data) and 1 AU (ACE data). Moreover it changes over the different phases of solar activity cycle.

Suyal, Vinita; Singh, Harinder P

2013-01-01T23:59:59.000Z

125

A Concatenational Graph Evolution Aging Model  

Science Conference Proceedings (OSTI)

Modeling the long-term face aging process is of great importance for face recognition and animation, but there is a lack of sufficient long-term face aging sequences for model learning. To address this problem, we propose a CONcatenational GRaph Evolution ... Keywords: Aging,Face,Active appearance model,Correlation,Computational modeling,Data models,Muscles,ANOVA,Face aging,aging model evaluation,long-term aging,short-term aging

Jinli Suo; Xilin Chen; Shiguang Shan; Wen Gao; Qionghai Dai

2012-11-01T23:59:59.000Z

126

Graph operations that are good for greedoids  

Science Conference Proceedings (OSTI)

S is a local maximum stable set of a graph G, and we write S@?@J(G), if the set S is a maximum stable set of the subgraph induced by S@?N(S), where N(S) is the neighborhood of S. In Levit and Mandrescu (2002) [5] we have proved that @J(G) is a greedoid ... Keywords: Corona, Greedoid, Local maximum stable set, Zykov sum

Vadim E. Levit; Eugen Mandrescu

2010-07-01T23:59:59.000Z

127

On a base exchange game on graphs  

E-Print Network (OSTI)

We consider the following maker-breaker game on a graph G that has a partition of the edge set E into two spanning trees E1 and E2. Initially the edges of E1 are purple and the edges of E2 blue. Maker and breaker move alternately. In a move of the maker a blue edge is coloured purple. The breaker then has to recolour a different edge blue in such a way that the purple and the blue edges are spanning trees again. The goal of the maker is to exchange all colours, i.e. to make E1 blue and E2 purple. We prove that a sufficient but not necessary condition for the breaker to win is that the graph contains an induced K4. Furthermore we characterize the structure of a partition of a wheel into two spanning trees and show that the maker wins on wheels Wn with n ? 4 and provide an example of a graph where, for some partitions, the maker wins, for some others, the breaker wins.

Stephan Dominique Andres; Winfried Hochstättler; Markus Merkel

2010-01-01T23:59:59.000Z

128

Modeling and Analysis of Time-Varying Graphs  

E-Print Network (OSTI)

We live in a world increasingly dominated by networks -- communications, social, information, biological etc. A central attribute of many of these networks is that they are dynamic, that is, they exhibit structural changes over time. While the practice of dynamic networks has proliferated, we lag behind in the fundamental, mathematical understanding of network dynamism. Existing research on time-varying graphs ranges from preliminary algorithmic studies (e.g., Ferreira's work on evolving graphs) to analysis of specific properties such as flooding time in dynamic random graphs. A popular model for studying dynamic graphs is a sequence of graphs arranged by increasing snapshots of time. In this paper, we study the fundamental property of reachability in a time-varying graph over time and characterize the latency with respect to two metrics, namely store-or-advance latency and cut-through latency. Instead of expected value analysis, we concentrate on characterizing the exact probability distribution of routing l...

Basu, Prithwish; Ramanathan, Ram; Johnson, Matthew P

2010-01-01T23:59:59.000Z

129

Strict inequalities for connective constants of transitive graphs  

E-Print Network (OSTI)

The connective constant of a graph is the exponential growth rate of the number of self-avoiding walks starting at a given vertex. Strict inequalities are proved for connective constants of vertex-transitive graphs. Firstly, the connective constant decreases strictly when the graph is replaced by a non-trivial quotient graph. Secondly, the connective constant increases strictly when a quasi-transitive family of new edges is added. These results have the following implications for Cayley graphs. The connective constant of a Cayley graph decreases strictly when a new relator is added to the group, and increases strictly when a non-trivial group element is declared to be a generator.

Geoffrey R. Grimmett; Zhongyang Li

2013-01-14T23:59:59.000Z

130

Coloring kk-free intersection graphs of geometric objects in the plane  

Science Conference Proceedings (OSTI)

The intersection graph of a collection C of sets is a graph on the vertex set C, in which C1,C2 ? C are joined by an edge if and only if C1 ? C2 ... Keywords: chromatic number, intersection graph, quasi-planar, string graph, topological graph

Jacob Fox; János Pach

2008-06-01T23:59:59.000Z

131

An extended star graph: a proposal of a new network topology and its fundamental properties  

Science Conference Proceedings (OSTI)

In the past years, various network architectures for parallel computers have been proposed, for example, hyper cubes or star graphs. These classes of networks are known as Cayley graphs. In recent years, there have been some proposals of new families ... Keywords: Cayley graphs, degree four Cayley graphs, diameter, hypercubes, interconnection networks, network topology, routing algorithms, star graphs

Satoru Watanabe; Satoshi Okawa

2006-03-01T23:59:59.000Z

132

Graduated assignment algorithm for finding the common labelling of a set of graphs  

Science Conference Proceedings (OSTI)

In pattern recognition applications, it is useful to represent objects by attributed graphs considering their structural properties. Besides, some graph matching problems need a Common Labelling between vertices of a set of graphs. Computing this Common ... Keywords: graduated assignment, graph common labelling, inconsistent labelling, multiple graph matching, softassign

Albert Solé-Ribalta; Francesc Serratosa

2010-08-01T23:59:59.000Z

133

A Graph Theory Package for Maple - CECM - Simon Fraser University  

E-Print Network (OSTI)

{jfarr,mahdad,skhodada,mmonagan}@cecm.sfu.ca. Abstract. We present a new graph theory package for Maple. The package is presently intended for teaching  ...

134

New Benchmark Instances for the Steiner Problem in Graphs  

E-Print Network (OSTI)

Sep 26, 2001 ... New Benchmark Instances for the Steiner Problem in Graphs. Isabel Rosseti ( rosseti ***at*** inf.puc-rio.br) Marcus Poggi de Aragão (poggi ...

135

GreenArrow© - A New Graph Labeling Technique - Available ...  

Search PNNL. PNNL Home; About; Research; Publications; Jobs; News; Contacts; GreenArrow© - A New Graph Labeling Technique. Battelle Number(s): ...

136

Joint Spectral Radius and Path-Complete Graph Lyapunov Functions  

E-Print Network (OSTI)

Nov 22, 2011 ... Abstract: We introduce the framework of path-complete graph Lyapunov functions for approximation of the joint spectral radius. The approach is ...

137

Finding good nearly balanced cuts in power law graphs  

E-Print Network (OSTI)

The green dots in figure 8-A represent cuts that were obtained using Spectral plus Swept Hyperplane .... Fast approximate energy minimization via graph cuts.

138

Enhancing graph production skills via programmed instruction: An experimental analysis of the effect of guided-practice on data-based graph production  

Science Conference Proceedings (OSTI)

A computer-based graphing simulator used tutorial modules to teach 61 undergraduate college students how to create cumulative graphs from sets of data. One group was required to complete the steps of constructing an appropriate graph within a computer-provided ... Keywords: Computer-based instruction, Graphing, Programmed instruction, Simulation

Darrel R. Davis

2011-09-01T23:59:59.000Z

139

Noisy evolution of graph-state entanglement  

Science Conference Proceedings (OSTI)

A general method for the study of the entanglement evolution of graph states under the action of Pauli maps was recently proposed in Cavalcanti et al. [Phys. Rev. Lett. 103, 030502 (2009)]. This method is based on lower and upper bounds to the entanglement of the entire state as a function only of the state of a (typically) considerably smaller subsystem undergoing an effective noise process related to the original map. This provides a huge decrease in the size of the matrices involved in the calculation of entanglement in these systems. In the present paper we elaborate on this method in detail and generalize it to other natural situations not described by Pauli maps. Specifically, for Pauli maps we introduce an explicit formula for the characterization of the resulting effective noise. Beyond Pauli maps, we show that the same ideas can be applied to the case of thermal reservoirs at arbitrary temperature. In the latter case, we discuss how to optimize the bounds as a function of the noise strength. We illustrate our ideas with explicit exemplary results for several different graphs and particular decoherence processes. The limitations of the method are also discussed.

Aolita, L.; Dhara, C. [ICFO-Institut de Ciencies Fotoniques, Mediterranean Technology Park, E-08860 Castelldefels, Barcelona (Spain); Cavalcanti, D. [Centre for Quantum Technologies, University of Singapore (Singapore); Chaves, R.; Davidovich, L. [Instituto de Fisica, Universidade Federal do Rio de Janeiro, Caixa Postal 68528, 21941-972 Rio de Janeiro, RJ (Brazil); Acin, A. [ICFO-Institut de Ciencies Fotoniques, Mediterranean Technology Park, E-08860 Castelldefels, Barcelona (Spain); ICREA-Institucio Catalana de Recerca i Estudis Avancats, Lluis Companys 23, E-08010 Barcelona (Spain)

2010-09-15T23:59:59.000Z

140

EntityAuthority: Semantically Enriched Graph-Based Authority Propagation  

E-Print Network (OSTI)

embedded in the text of Web pages, and to transform the page-level graph into a generalized data graph- ply be Page, InfoUnit, or richer concept names such as Person, Organization, etc., that can. Thus each node in the EWG corresponds to ei- ther a Web page or an information unit (InfoUnit for short

Pennsylvania, University of

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

On bounding the bandwidth of graphs with symmetry  

E-Print Network (OSTI)

transmission can be formulated as the bandwidth problem for the ... [6], the hypercube graph [23], the grid graph [7], the complete k-level t-ary tree [39], the .... The 'diag' operator maps an n × n matrix to the n-vector given by its diagonal, while.

142

Cell-graph modeling of salivary gland morphology  

Science Conference Proceedings (OSTI)

Branching morphogenesis is a developmental process shared by many organs, including the submandibular salivary gland. During morphogenesis, cells within the gland undergo rearrangements to cause changes in the overall tissue morphology. This work presents ... Keywords: branching morphogenesis, cell-graphs, graph-mining, salivary gland

Cemal Cagatay Bilgin; Shayoni Ray; William P. Daley; Banu Baydil; Sharon J. Sequeira; Bülent Yener; Melinda Larsen

2010-04-01T23:59:59.000Z

143

On the connectivity of extremal Ramsey graphs Andrew Beveridge  

E-Print Network (OSTI)

and Computer Science Macalester College Saint Paul, MN 55105 Oleg Pikhurko # Department of Mathematical Sciences Carnegie Mellon University Pittsburgh, PA 15213 Received: 1 December 2006, Accepted: 31 October 2007 Abstract An (r, b)­graph is a graph that contains no clique of size r and no independent set

Pikhurko, Oleg

144

Commute-time convolution kernels for graph clustering  

Science Conference Proceedings (OSTI)

Commute time has proved to be a powerful attribute for clustering and characterising graph structure, and which is easily computed from the Laplacian spectrum. Moreover, commute time is robust to deletions of random edges and noisy edge weights. In this ... Keywords: commute times, convolution kernel, graph kernel, laplacian

Normawati A. Rahman; Edwin R. Hancock

2010-08-01T23:59:59.000Z

145

Analyzing uncertainty in TG protection graphs with TG/MC  

Science Conference Proceedings (OSTI)

We introduce TG/MC, a Monte Carlo approach for evaluating the impact of uncertainty about vulnerabilities upon forecasts of security for a real-world system modeled by a protection graph. A TG/MC model defines a vulnerability as a potential change to ... Keywords: Monte Carlo, TG, Take-Grant, protection graph, security

James R. Conrad; Jim Alves-Foss; Sauchi Stephen Lee

2010-09-01T23:59:59.000Z

146

Exclusivity structures and graph representatives of local complementation orbits  

E-Print Network (OSTI)

We describe a construction that maps any connected graph G on three or more vertices into a larger graph, H(G), whose independence number is strictly smaller than its Lov\\'asz number which is equal to its fractional packing number. The vertices of H(G) represent all possible events consistent with the stabilizer group of the graph state associated with G, and exclusive events are adjacent. Mathematically, the graph H(G) corresponds to the orbit of G under local complementation. Physically, the construction translates into graph-theoretic terms the connection between a graph state and a Bell inequality maximally violated by quantum mechanics. In the context of zero-error information theory, the construction suggests a protocol achieving the maximum rate of entanglement-assisted capacity, a quantum mechanical analogue of the Shannon capacity, for each H(G). The violation of the Bell inequality is expressed by the one-shot version of this capacity being strictly larger than the independence number. Finally, given the correspondence between graphs and exclusivity structures, we are able to compute the independence number for certain infinite families of graphs with the use of quantum non-locality, therefore highlighting an application of quantum theory in the proof of a purely combinatorial statement.

Adan Cabello; Matthew G. Parker; Giannicola Scarpa; Simone Severini

2012-11-18T23:59:59.000Z

147

Detecting research topics via the correlation between graphs and texts  

Science Conference Proceedings (OSTI)

In this paper we address the problem of detecting topics in large-scale linked document collections. Recently, topic detection has become a very active area of research due to its utility for information navigation, trend analysis, and high-level description ... Keywords: citation graphs, correlation of text and links, graph mining, probabilistic measure, topic detection

Yookyung Jo; Carl Lagoze; C. Lee Giles

2007-08-01T23:59:59.000Z

148

Quantum graphs where back-scattering is prohibited  

E-Print Network (OSTI)

We describe a new class of scattering matrices for quantum graphs in which back-scattering is prohibited. We discuss some properties of quantum graphs with these scattering matrices and explain the advantages and interest in their study. We also provide two methods to build the vertex scattering matrices needed for their construction.

J. M. Harrison; U. Smilansky; B. Winn

2007-08-06T23:59:59.000Z

149

Quantum graphs: an introduction and a brief survey  

E-Print Network (OSTI)

The purpose of this text is to set up a few basic notions concerning quantum graphs, to indicate some areas addressed in the quantum graph research, and to provide some pointers to the literature. The pointers in many cases are secondary, i.e. they refer to other surveys.

Peter Kuchment

2008-02-23T23:59:59.000Z

150

Embedding of hypercubes into necklace, windmill and snake graphs  

Science Conference Proceedings (OSTI)

Graph embedding problems have gained importance in the field of interconnection networks for parallel computer architectures. In this paper, we determine the exact wirelength of embedding hypercubes into necklace, windmill and snake graphs. Keywords: Congestion, Edge isoperimetric problem, Embedding, Hypercubes, Interconnection networks, Wirelength

Indra Rajasingh; Bharati Rajan; R. Sundara Rajan

2012-06-01T23:59:59.000Z

151

On Characterizing Game-Perfect Graphs by Forbidden Induced Subgraphs  

E-Print Network (OSTI)

A graph G is called g-perfect if, for any induced subgraph H of G, the game chromatic number of H equals the clique number of H. A graph G is called g-col-perfect if, for any induced subgraph H of G, the game coloring number of H equals the clique number of H. In this paper we characterize the classes of g-perfect resp. g-col-perfect graphs by a set of forbidden induced subgraphs and explicitly. Moreover, we study similar notions for variants of the game chromatic number, namely B-perfect and [A, B]-perfect graphs, and for several variants of the game coloring number, and characterize the classes of these graphs.

Stephan Dominique Andres

2010-01-01T23:59:59.000Z

152

Horizontal Visibility graphs generated by type-II intermittency  

E-Print Network (OSTI)

In this contribution we study the onset of chaos via type-II intermittency within the framework of Horizontal Visibility graph theory. We construct graphs associated to time series generated by an iterated map close to a Neimark-Sacker bifurcation and study, both numerically and analytically, their main topological properties. We find well defined equivalences between the main statistical properties of intermittent series (scaling of laminar trends and Lyapunov exponent) and those of the resulting graphs, and accordingly construct a graph theoretical description of type-II intermittency. We finally recast this theory into a graph-theoretical renormalization group framework, and show that the fixed point structure of RG flow diagram separates regular, critical and chaotic dynamics.

Ángel M. Núñez; José Patricio Gómez; Lucas Lacasa

2013-10-02T23:59:59.000Z

153

An Experiment on Graph Analysis Methodologies for Scenarios  

Science Conference Proceedings (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

154

Quantum query complexity of some graph problems  

E-Print Network (OSTI)

Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for the bounded error quantum query complexity of Connectivity, Strong Connectivity, Minimum Spanning Tree, and Single Source Shortest Paths. For example we show that the query complexity of Minimum Spanning Tree is in Theta(n^{3/2}) in the matrix model and in Theta(sqrt{nm}) in the array model, while the complexity of Connectivity is also in Theta(n^{3/2}) in the matrix model, but in Theta(n) in the array model. The upper bounds utilize search procedures for finding minima of functions under various conditions.

Christoph Durr; Mark Heiligman; Peter Hoyer; Mehdi Mhalla

2004-01-15T23:59:59.000Z

155

Efficient broadcast on random geometric graphs  

Science Conference Proceedings (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

156

A sequential growth dynamics for a directed acyclic dyadic graph  

E-Print Network (OSTI)

A model of discrete spacetime on a microscopic level is considered. It is a directed acyclic dyadic graph. This is the particular case of a causal set. The goal of this model is to describe particles as some repetitive symmetrical self-organized structures of the graph without any reference to continuous spacetime. The dynamics of the model is considered. This dynamics is stochastic sequential additions of new vertexes. Growth of the graph is a Markovian process. This dynamics is a consequence of a causality principle.

Alexey L. Krugly

2011-12-05T23:59:59.000Z

157

Nested cycles in large triangulations and crossing-critical graphs  

E-Print Network (OSTI)

We show that every sufficiently large plane triangulation has a large collection of nested cycles that either are pairwise disjoint, or pairwise intersect in exactly one vertex, or pairwise intersect in exactly two vertices. We apply this result to show that for each fixed positive integer $k$, there are only finitely many $k$-crossing-critical simple graphs of average degree at least six. Combined with the recent constructions of crossing-critical graphs given by Bokal, this settles the question of for which numbers $q>0$ there is an infinite family of $k$-crossing-critical simple graphs of average degree $q$.

Hernandez-Velez, Cesar; Thomas, Robin

2009-01-01T23:59:59.000Z

158

The Graph Laplacian and the Dynamics of Complex Networks  

SciTech Connect

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

159

Spectral dimension in graph models of causal quantum gravity  

E-Print Network (OSTI)

The phenomenon of scale dependent spectral dimension has attracted special interest in the quantum gravity community over the last eight years. It was first observed in computer simulations of the causal dynamical triangulation (CDT) approach to quantum gravity and refers to the reduction of the spectral dimension from 4 at classical scales to 2 at short distances. Thereafter several authors confirmed a similar result from different approaches to quantum gravity. Despite the contribution from different approaches, no analytical model was proposed to explain the numerical results as the continuum limit of CDT. In this thesis we introduce graph ensembles as toy models of CDT and show that both the continuum limit and a scale dependent spectral dimension can be defined rigorously. First we focus on a simple graph ensemble, the random comb. It does not have any dynamics from the gravity point of view, but serves as an instructive toy model to introduce the characteristic scale of the graph, study the continuum limit and define the scale dependent spectral dimension. Having defined the continuum limit, we study the reduction of the spectral dimension on more realistic toy models, the multigraph ensembles, which serve as a radial approximation of CDT. We focus on the (recurrent) multigraph approximation of the two-dimensional CDT whose ensemble measure is analytically controlled. The latter comes from the critical Galton-Watson process conditioned on non-extinction. Next we turn our attention to transient multigraph ensembles, corresponding to higher-dimensional CDT. Firstly we study their fractal properties and secondly calculate the scale dependent spectral dimension and compare it to computer simulations. We comment further on the relation between Horava-Lifshitz gravity, asymptotic safety, multifractional spacetimes and CDT-like models.

Georgios Giasemidis

2013-10-30T23:59:59.000Z

160

A new framework for elimination-based data flow analysis using DJ graphs  

Science Conference Proceedings (OSTI)

Keywords: DJ graphs, Tarjan's interval, exhaustive and incremental data flow analysis, irreducible flowgraphs, reducible flowgraphs

Vugranam C. Sreedhar; Guang R. Gao; Yong-Fong Lee

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


161

A graph-theoretic model of lexical syntactic acquisition  

Science Conference Proceedings (OSTI)

This paper presents a graph-theoretic model of the acquisition of lexical syntactic representations. The representations the model learns are non-categorical or graded. We propose a new evaluation methodology of syntactic acquisition in the framework ...

Hinrich Schütze; Michael Walsh

2008-10-01T23:59:59.000Z

162

Effective Graph Clustering for Path Queries in Digital Map Databases  

E-Print Network (OSTI)

In this paper, we present an experimental evaluation of graph clustering strategies in terms of their effectiveness in optimizing I/O for path query processing in digital map databases. Clustering optimization is attractive because it does not incurs any run-time cost, and is complimentary to many of the existing techniques in path query optimization. We first propose a novel graph clustering technique, called Spatial Partition Clustering (SPC), that creates balanced partitions of links based on the spatial proximity of their origin nodes. We then select three alternative clustering techniques from the literature, namely two-way partitioning, approximately topological clustering, and random clustering, to compare their performance in path query processing with SPC. Experimental evaluation indicates that our SPC performs the best for the high-locality graphs (such as GIS maps), whereas the two-way partitioning approach performs the best for no-locality random graphs. 1 Introduction 1....

Yun-Wu Huang; Ning Jing; Elke A. Rundensteiner

1996-01-01T23:59:59.000Z

163

Chip-Firing and Rotor-Routing on Directed Graphs  

E-Print Network (OSTI)

We give a rigorous and self-contained survey of the abelian sandpile model and rotor-router model on finite directed graphs, highlighting the connections between them. We present several intriguing open problems.

Holroyd, Alexander E; Meszaros, Karola; Peres, Yuval; Propp, James; Wilson, David B

2008-01-01T23:59:59.000Z

164

Graph-Theoretic Techniques for Web Content Mining  

Science Conference Proceedings (OSTI)

Describing exciting new opportunities for utilizing robust graph representations of data with common machine learning algorithms, this book demonstrates and investigates these novel techniques through the domain of web content mining.

Adam Schenker; Horst Bunke; Mark Last; Abraham Kandel

2005-05-01T23:59:59.000Z

165

Geometry of loop quantum gravity on a graph  

SciTech Connect

We discuss the meaning of geometrical constructions associated to loop quantum gravity states on a graph. In particular, we discuss the 'twisted geometries' and derive a simple relation between these and Regge geometries.

Rovelli, Carlo; Speziale, Simone [Centre de Physique Theorique, CNRS-Luminy Case 907, 13288 Marseille Cedex 09 (France)

2010-08-15T23:59:59.000Z

166

Investigation of bond graphs for nuclear reactor simulations  

E-Print Network (OSTI)

This work proposes a simple and effective approach to modeling multiphysics nuclear reactor problems using bond graphs. The conventional method of modeling the coupled multiphysics transients in nuclear reactors is operator ...

Sosnovsky, Eugeny

2010-01-01T23:59:59.000Z

167

Parallel Algorithms for Graph Optimization using Tree Decompositions  

SciTech Connect

Although many $\\cal{NP}$-hard graph optimization problems can be solved in polynomial time on graphs of bounded tree-width, the adoption of these techniques into mainstream scientific computation has been limited due to the high memory requirements of the necessary dynamic programming tables and excessive runtimes of sequential implementations. This work addresses both challenges by proposing a set of new parallel algorithms for all steps of a tree decomposition-based approach to solve the maximum weighted independent set problem. A hybrid OpenMP/MPI implementation includes a highly scalable parallel dynamic programming algorithm leveraging the MADNESS task-based runtime, and computational results demonstrate scaling. This work enables a significant expansion of the scale of graphs on which exact solutions to maximum weighted independent set can be obtained, and forms a framework for solving additional graph optimization problems with similar techniques.

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

2012-06-01T23:59:59.000Z

168

Modelling structured domains using description graphs and logic programming  

Science Conference Proceedings (OSTI)

Although OWL 2 is widely used to describe complex objects such as chemical molecules, it cannot represent ‘structural' features of chemical entities (e.g., having a ring). A combination of rules and description graphs (DGs) has been proposed ...

Despoina Magka; Boris Motik; Ian Horrocks

2012-05-01T23:59:59.000Z

169

Interactive searching and visualization of patterns in attributed graphs  

Science Conference Proceedings (OSTI)

Searching for patterns in graphs and visualizing the search results is an active area of research with numerous applications. With the continual growth of database size, querying these databases often results in multiple solutions. Text-based systems ...

Pierre-Yves Koenig; Faraz Zaidi; Daniel Archambault

2010-05-01T23:59:59.000Z

170

Temporally Scalable Visual SLAM using a Reduced Pose Graph  

E-Print Network (OSTI)

In this paper, we demonstrate a system for temporally scalable visual SLAM using a reduced pose graph representation. Unlike previous visual SLAM approaches that use keyframes, our approach continually uses new measurements ...

Johannsson, Hordur

2012-05-25T23:59:59.000Z

171

On electric resistances for distance-regular graphs  

E-Print Network (OSTI)

We investigate the behavior of electric potentials on distance-regular graphs, and extend some results of a prior paper. Our main result, Theorem 4, shows(together with Corollary 3) that if distance is measured by the electric resistance between points then all points are close to being equidistant on a distance-regular graph with large valency. A number of auxiliary results are also presented.

Koolen, Jack; Park, Jongyook

2011-01-01T23:59:59.000Z

172

Confusability graphs for symmetric sets of quantum states  

E-Print Network (OSTI)

For a set of quantum states generated by the action of a group, we consider the graph obtained by considering two group elements adjacent whenever the corresponding states are non-orthogonal. We analyze the structure of the connected components of the graph and show two applications to the optimal estimation of an unknown group action and to the search for decoherence free subspaces of quantum channels with symmetry.

Giulio Chiribella; Yuxiang Yang

2013-01-07T23:59:59.000Z

173

Scalable methods for representing, characterizing, and generating large graphs.  

Science Conference Proceedings (OSTI)

Goal - design methods to characterize and identify a low dimensional representation of graphs. Impact - enabling predictive simulation; monitoring dynamics on graphs; and sampling and recovering network structure from limited observations. Areas to explore are: (1) Enabling technologies - develop novel algorithms and tailor existing ones for complex networks; (2) Modeling and generation - Identify the right parameters for graph representation and develop algorithms to compute these parameters and generate graphs from these parameters; and (3) Comparison - Given two graphs how do we tell they are similar? Some conclusions are: (1) A bad metric can make anything look good; (2) A metric that is based an edge-by edge prediction will suffer from the skewed distribution of present and absent edges; (3) The dominant signal is the sparsity, edges only add a noise on top of the signal, the real signal, structure of the graph is often lost behind the dominant signal; and (4) Proposed alternative: comparison based on carefully chosen set of features, it is more efficient, sensitive to selection of features, finding independent set of features is an important area, and keep an eye on us for some important results.

Grace, Matthew D.; Dunlavy, Daniel M. (Sandia National Laboratories, Albuquerque, NM); Ray, Jaideep; Pinar, Ali; Hendrickson, Bruce Alan (Sandia National Laboratories, Albuquerque, NM); Phillips, Cynthia Ann (Sandia National Laboratories, Albuquerque, NM); Kolda, Tamara Gibson

2010-07-01T23:59:59.000Z

174

pGraph: Efficient Parallel Construction of Large-Scale Protein Sequence Homology Graphs  

Science Conference Proceedings (OSTI)

Detecting sequence homology between protein sequences is a fundamental problem in computational molecular biology, with a pervasive application in nearly all analyses that aim to structurally and functionally characterize protein molecules. While detecting the homology between two protein sequences is relatively inexpensive, detecting pairwise homology for a large number of protein sequences can become computationally prohibitive for modern inputs, often requiring millions of CPU hours. Yet, there is currently no robust support to parallelize this kernel. In this paper, we identify the key characteristics that make this problemparticularly hard to parallelize, and then propose a new parallel algorithm that is suited for detecting homology on large data sets using distributed memory parallel computers. Our method, called pGraph, is a novel hybrid between the hierarchical multiple-master/worker model and producer-consumer model, and is designed to break the irregularities imposed by alignment computation and work generation. Experimental results show that pGraph achieves linear scaling on a 2,048 processor distributed memory cluster for a wide range of inputs ranging from as small as 20,000 sequences to 2,560,000 sequences. In addition to demonstrating strong scaling, we present an extensive report on the performance of the various system components and related parametric studies.

Wu, Changjun; Kalyanaraman, Anantharaman; Cannon, William R.

2012-09-15T23:59:59.000Z

175

Anatomy of a young giant component in the random graph  

E-Print Network (OSTI)

We provide a complete description of the giant component of the Erd\\H{o}s-R\\'enyi random graph $G(n,p)$ as soon as it emerges from the scaling window, i.e., for $p = (1+\\epsilon)/n$ where $\\epsilon^3 n \\to \\infty$ and $\\epsilon=o(1)$. Our description is particularly simple for $\\epsilon = o(n^{-1/4})$, where the giant component $C_1$ is contiguous with the following model (i.e., every graph property that holds with high probability for this model also holds w.h.p. for $C_1$). Let $Z$ be normal with mean $\\frac23 \\epsilon^3 n$ and variance $\\epsilon^3 n$, and let $K$ be a random 3-regular graph on $2\\lfloor Z\\rfloor$ vertices. Replace each edge of $K$ by a path, where the path lengths are i.i.d. geometric with mean $1/\\epsilon$. Finally, attach an independent Poisson($1-\\epsilon$)-Galton-Watson tree to each vertex. A similar picture is obtained for larger $\\epsilon=o(1)$, in which case the random 3-regular graph is replaced by a random graph with $N_k$ vertices of degree $k$ for $k\\geq 3$, where $N_k$ has mean...

Ding, Jian; Lubetzky, Eyal; Peres, Yuval

2009-01-01T23:59:59.000Z

176

Structure Discovery in Large Semantic Graphs Using Extant Ontological Scaling and Descriptive Statistics  

Science Conference Proceedings (OSTI)

As semantic datasets grow to be very large and divergent, there is a need to identify and exploit their inherent semantic structure for discovery and optimization. Towards that end, we present here a novel methodology to identify the semantic structures inherent in an arbitrary semantic graph dataset. We first present the concept of an extant ontology as a statistical description of the semantic relations present amongst the typed entities modeled in the graph. This serves as a model of the underlying semantic structure to aid in discovery and visualization. We then describe a method of ontological scaling in which the ontology is employed as a hierarchical scaling filter to infer different resolution levels at which the graph structures are to be viewed or analyzed. We illustrate these methods on three large and publicly available semantic datasets containing more than one billion edges each. Keywords-Semantic Web; Visualization; Ontology; Multi-resolution Data Mining;

al-Saffar, Sinan; Joslyn, Cliff A.; Chappell, Alan R.

2011-07-18T23:59:59.000Z

177

Mining Large Heterogeneous Graphs using Cray s Urika  

SciTech Connect

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

178

Weaving independently generated photons into an arbitrary graph state  

SciTech Connect

The controlled-Z (cz) operations acting separately on pairs of qubits are commonly adopted in the schemes of generating graph states, the multipartite entangled states for the one-way quantum computing. For this purpose, we propose a setup of cascade cz operation on a whole group of qubits in sequence. The operation of the setup starts with entangling an ancilla photon with the first photon as qubit, and this ancilla automatically moves from one entanglement link to another in assisting the formation of a string in graph states. The generation of some special types of graph states, such as the three-dimensional ones, can be greatly simplified in this approach. The setup presented uses weak nonlinearities, but an implementation using probabilistic linear optics is also possible.

Lin, Qing [College of Information Science and Engineering, Huaqiao University (Xiamen), Xiamen 361021 (China); He, Bing [University of California, Merced, 5200 North Lake Road, Merced, California 95343 (United States); Institute for Quantum Information Science, University of Calgary, Alberta T2N 1N4 (Canada)

2011-12-15T23:59:59.000Z

179

Weaving independently generated photons into an arbitrary graph state  

E-Print Network (OSTI)

The controlled Z (CZ) operations acting separately on pairs of qubits are commonly adopted in the schemes of generating graph states, the multi-partite entangled states for the one-way quantum computing. For this purpose, we propose a setup of cascade CZ operation on a whole group of qubits in sequence. The operation of the setup starts with entangling an ancilla photon to the first photon as qubit, and this ancilla automatically moves from one entanglement link to another in assisting the formation of a string in graph states. The generation of some special types of graph states, such as the three-dimensional ones, can be greatly simplified in this approach. The setup presented uses weak nonlinearities, but an implementation using probabilistic linear optics is also possible.

Qing Lin; Bing He

2010-11-21T23:59:59.000Z

180

Generalizing GraphPlan by Formulating Planning as a CSP  

E-Print Network (OSTI)

We examine the approach of encoding planning problems as CSPs more closely. First we present a simple CSP encoding for planning problems and then a set of transformations that can be used to eliminate variables and add new constraints to the encoding. We show that our transformations uncover additional structure in the planning problem, structure that subsumes the structure uncovered by GRAPHPLAN planning graphs. We solve the CSP encoded planning problem by using standard CSP algorithms. Empirical evidence is presented to validate the effectiveness of this approach to solving planning problems, and to show that even a prototype implementation is more effective than standard GRAPHPLAN. Our prototype is even competitive with far more optimized planning graph based implementations. We also demonstrate that this approach can be more easily lifted to more complex types of planning than can planning graphs. In particular, we show that the approach can be easily extended to planning with resources.

Adriana Lopez; Fahiem Bacchus

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


181

Applying a Model Transformation Taxonomy to Graph Transformation Technology  

E-Print Network (OSTI)

A taxonomy of model transformations was introduced in [16]. Among others, such a taxonomy can help developers in deciding which language, forma lism, tool or mechanism is best suited to carry out a particular model transformation activity. In this paper we apply the taxonomy to the technique of graph transformation, and we exemplify it by referring to four representative graph transformation tools. As a byproduct of our analysis, we discuss how well each of the considered tools carry out the activity of model transformation.

Tom Mens; Pieter Van Gorp; Dániel Varró; Gabor Karsai

2005-01-01T23:59:59.000Z

182

Create reports and graphs | ENERGY STAR Buildings & Plants  

NLE Websites -- All DOE Office Websites (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

183

Graph Based Modeling and Implementation with EER/GRAL  

E-Print Network (OSTI)

This paper gives a cohesive approach to modeling and implementation with graphs. This approach uses extended entity relationship (EER) diagrams supplemented with the Z-like constraint language GRAL. Due to the foundation of EER/GRAL on Z a common formal basis exists. EER/GRAL descriptions give conceptual models which can be implemented in a seamless manner by efficient data structures using the GraLab graph library. Descriptions of four medium size EER/GRAL-applications conclude the paper to demonstrate the usefulness of the approach in practice.

J. Ebert; A. Winter; P. Dahm; A. Franzke; R. Süttenbach

1996-01-01T23:59:59.000Z

184

Multithreaded Asynchronous Graph Traversal for In-Memory and Semi-External Memory  

Science Conference Proceedings (OSTI)

Processing large graphs is becoming increasingly important for many domains such as social networks, bioinformatics, etc. Unfortunately, many algorithms and implementations do not scale with increasing graph sizes. As a result, researchers have attempted ...

Roger Pearce; Maya Gokhale; Nancy M. Amato

2010-11-01T23:59:59.000Z

185

Graph of words embedding for molecular structure-activity relationship analysis  

Science Conference Proceedings (OSTI)

Structure-Activity relationship analysis aims at discovering chemical activity of molecular compounds based on their structure. In this article we make use of a particular graph representation of molecules and propose a new graph embedding procedure ...

Jaume Gibert; Ernest Valveny; Horst Bunke

2010-11-01T23:59:59.000Z

186

PTAS for maximum weight independent set problem with random weights in bounded degree graphs  

E-Print Network (OSTI)

Finding the largest independent set in a graph is a notoriously difficult NP-complete combinatorial optimization problem. Moreover, even for graphs with largest degree 3, no polynomial time approximation algorithm exists ...

Gamarnik, David

187

Graph-based reference table construction to facilitate entity matching  

Science Conference Proceedings (OSTI)

Entity matching plays a crucial role in information integration among heterogeneous data sources, and numerous solutions have been developed. Entity resolution based on reference table has the benefits of high efficiency and being easy to update. In ... Keywords: Entity matching, Graph clustering, Reference table

Fangda Wang, Hongzhi Wang, Jianzhong Li, Hong Gao

2013-06-01T23:59:59.000Z

188

Tree/Graph Visualization CMSC 436/636  

E-Print Network (OSTI)

grid, transportation routes, trade, immigration ­ Connections: relationships, causality, citations, disease transmission vectors, #12;Hierarchical and Relational Data · Conceptually a graph · Key challenges · Distortion mapping Clustering · Group nodes into clusters · Use clusters for layout · Display appropriate

Rheingans, Penny

189

MML Inference of Decision Graphs with Multi-way Joins  

Science Conference Proceedings (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

190

Nodal domains on graphs - How to count them and why?  

E-Print Network (OSTI)

The purpose of the present manuscript is to collect known results and present some new ones relating to nodal domains on graphs, with special emphasize on nodal counts. Several methods for counting nodal domains will be presented, and their relevance as a tool in spectral analysis will be discussed.

Ram Band; Idan Oren; Uzy Smilansky

2007-11-21T23:59:59.000Z

191

Nodal domains on graphs - How to count them and why?  

E-Print Network (OSTI)

The purpose of the present manuscript is to collect known results and present some new ones relating to nodal domains on graphs, with special emphasize on nodal counts. Several methods for counting nodal domains will be presented, and their relevance as a tool in spectral analysis will be discussed.

Band, Ram; Smilansky, Uzy

2007-01-01T23:59:59.000Z

192

An unified transition detection based on bipartite graph matching approach  

Science Conference Proceedings (OSTI)

This paper addresses transition detection which consists in identifying the boundary between consecutive shots. In this work, we propose an approach to cope with transition detection in which we define and use a new dissimilarity measure based on the ... Keywords: bipartite graph matching, cut, gradual transition

Zenilton Kleber Gonçalves Do Patrocínio, Jr.; Silvio Jamil F. Guimaräes; Henrique Batista Da Silva; Kleber Jacques Ferreira De Souza

2010-11-01T23:59:59.000Z

193

Object oriented parallelisation of graph algorithms using parallel iterator  

Science Conference Proceedings (OSTI)

Multi-core machines are becoming widely used which, as a consequence, forces parallel computing to move from research labs to being adopted everywhere. Due to the fact that developing parallel code is a significantly complex process, the main focus of ... Keywords: graph algorithms, object oriented parallelisation, parallel computing, parallel iterator

Lama Akeila; Oliver Sinnen; Wafaa Humadi

2010-01-01T23:59:59.000Z

194

Simulation of an Electrical Substation Using the Bond Graph Technique  

Science Conference Proceedings (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

195

Global Maker-Breaker games on sparse graphs  

E-Print Network (OSTI)

In this paper we consider Maker-Breaker games, played on the edges of sparse graphs. For a given graph property P we seek a graph (board of the game) with the smallest number of edges on which Maker can build a subgraph that satisfies P. In this paper we focus on global properties. We prove the following results: 1) for the positive minimum degree game, there is a winning board with n vertices and about 10n/7 edges, on the other hand, at least 11n/8 edges are required; 2) for the spanning k-connectivity game, there is a winning board with n vertices and (1+ok(1))kn edges; 3) for the Hamiltonicity game, there is a winning board of constant average degree; 4) for a tree T on n vertices of bounded maximum degree ?, there is a graph G on n vertices and at most f(?) · n edges, on which Maker can construct a copy of T. We also discuss biased versions on these games and argue that the picture changes quite drastically there. 1

Dan Hefetz; Michael Krivelevich; Tibor Szabó

2009-01-01T23:59:59.000Z

196

A Winning Strategy for the Ramsey Graph Game  

E-Print Network (OSTI)

We consider a "Maker-Breaker" version of the Ramsey Graph Game, RG(n), and present a winning strategy for Maker requiring at most (n 0 3)2 n01 + n + 1 moves. This is the fastest winning strategy known so far. We also demonstrate how the ideas presented can be used to develop winning strategies for some related combinatorial games. Keywords: Combinatorial Games, Algorithms on Graphs, Ramsey Theory 1 Introduction The Ramsey Graph Game, RG(n), on a complete graph on N vertices, KN , is considered. Two players, Maker (red) and Breaker (blue) alternately color the edges of KN . Maker is first to play, and the players color one edge per move. Maker wins the game if there is a red Kn . Breaker wins if there is no red Kn after all the N (N 0 1)=2 edges have been colored. Let R(n; n) denote the n-th Ramsey number, i.e., the smallest number R such that for every two-coloring of the edges of KR there exsist a monochromatic Kn ae KR . Maker has a simple winning strategy if N 2R(n; n). Note ...

Aleksandar Pekec

1995-01-01T23:59:59.000Z

197

Weighted graph comparison techniques for brain connectivity analysis  

Science Conference Proceedings (OSTI)

The analysis of brain connectivity is a vast field in neuroscience with a frequent use of visual representations and an increasing need for visual analysis tools. Based on an in-depth literature review and interviews with neuroscientists, we explore ... Keywords: brain connectivity analysis, brain connectivity visualization, graph comparison

Basak Alper; Benjamin Bach; Nathalie Henry Riche; Tobias Isenberg; Jean-Daniel Fekete

2013-04-01T23:59:59.000Z

198

Degenerate flag varieties: moment graphs and Schröder numbers  

Science Conference Proceedings (OSTI)

We study geometric and combinatorial properties of the degenerate flag varieties of type A. These varieties are acted upon by the automorphism group of a certain representation of a type A quiver, containing a maximal torus T. Using the group ... Keywords: Flag varieties, Moment graphs, Quiver Grassmannians, Schröder numbers

Giovanni Cerulli Irelli; Evgeny Feigin; Markus Reineke

2013-08-01T23:59:59.000Z

199

Arbitrary Orientations Of Hamilton Cycles In Oriented Graphs  

E-Print Network (OSTI)

We use a randomised embedding method to prove that for all \\alpha>0 any sufficiently large oriented graph G with minimum in-degree and out-degree \\delta^+(G),\\delta^-(G)\\geq (3/8+\\alpha)|G| contains every possible orientation of a Hamilton cycle. This confirms a conjecture of H\\"aggkvist and Thomason.

Kelly, Luke

2009-01-01T23:59:59.000Z

200

More on graph theoretic software watermarks: Implementation, analysis, and attacks  

Science Conference Proceedings (OSTI)

This paper presents an implementation of the watermarking method proposed by Venkatesan et al. in their paper [R. Venkatesan, V. Vazirani, S. Sinha, A graph theoretic approach to software watermarking, in: Fourth International Information Hiding Workshop, ... Keywords: Software piracy protection, Software protection, Software watermarking, Surreptitious software

Christian Collberg; Andrew Huntwork; Edward Carter; Gregg Townsend; Michael Stepp

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

Top-K nearest keyword search on large graphs  

Science Conference Proceedings (OSTI)

It is quite common for networks emerging nowadays to have labels or textual contents on the nodes. On such networks, we study the problem of top-k nearest keyword (k-NK) search. In a network G modeled as an undirected graph, each node is ...

Miao Qiao, Lu Qin, Hong Cheng, Jeffrey Xu Yu, Wentao Tian

2013-08-01T23:59:59.000Z

202

Component supervision by sensor placement on bond-graph model  

Science Conference Proceedings (OSTI)

The component supervision procedure consists of the comparison of the actual behaviour with the reference behaviour which describes the normal mode. The analytical redundancy has to find relations between known variables of the system. These relations ... Keywords: bond graphs, causal paths, modelling, sensors placement, supervision

M. Khemliche; B. Ould Bouamama; A. Khellaf; M. Mostefaï

2005-03-01T23:59:59.000Z

203

STRUCTURAL ANNOTATION OF EM IMAGES BY GRAPH CUT  

Science Conference Proceedings (OSTI)

Biological images have the potential to reveal complex signatures that may not be amenable to morphological modeling in terms of shape, location, texture, and color. An effective analytical method is to characterize the composition of a specimen based on user-defined patterns of texture and contrast formation. However, such a simple requirement demands an improved model for stability and robustness. Here, an interactive computational model is introduced for learning patterns of interest by example. The learned patterns bound an active contour model in which the traditional gradient descent optimization is replaced by the more efficient optimization of the graph cut methods. First, the energy function is defined according to the curve evolution. Next, a graph is constructed with weighted edges on the energy function and is optimized with the graph cut algorithm. As a result, the method combines the advantages of the level set method and graph cut algorithm, i.e.,"topological" invariance and computational efficiency. The technique is extended to the multi-phase segmentation problem; the method is validated on synthetic images and then applied to specimens imaged by transmission electron microscopy(TEM).

Chang, Hang; Auer, Manfred; Parvin, Bahram

2009-05-08T23:59:59.000Z

204

Efficient simulation of hybrid systems: A hybrid bond graph approach  

Science Conference Proceedings (OSTI)

Accurate and efficient simulations facilitate cost-effective design and analysis of large, complex, embedded systems, whose behaviors are typically hybrid, i.e. continuous behaviors interspersed with discrete mode changes. In this paper we present an ... Keywords: component-oriented modeling, dynamic causal assignment, hybrid bond graphs, modeling and simulation environments, simulation of hybrid systems

Indranil Roychoudhury; Matthew J Daigle; Gautam Biswas; Xenofon Koutsoukos

2011-06-01T23:59:59.000Z

205

Using graph-based program characterization for predictive modeling  

Science Conference Proceedings (OSTI)

Using machine learning has proven effective at choosing the right set of optimizations for a particular program. For machine learning techniques to be most effective, compiler writers have to develop expressive means of characterizing the program being ... Keywords: compiler optimization, graph-based program characterization, iterative compilation, machine learning, support vector machine

Eunjung Park; John Cavazos; Marco A. Alvarez

2012-03-01T23:59:59.000Z

206

Teaching graph algorithms to children of all ages  

Science Conference Proceedings (OSTI)

We report on our experiences in teaching graph theory and algorithms to school children, aged 5 to 17. Our objectives were to demonstrate that children can discover quite complex mathematical concepts, and are able to work with abstractions and use computation ... Keywords: abstraction, computational thinking, k-12 education, modelling, problem based learning

J. Paul Gibson

2012-07-01T23:59:59.000Z

207

On-Line Construction of Compact Directed Acyclic Word Graphs  

Science Conference Proceedings (OSTI)

A Compact Directed Acyclic Word Graph (CDAWG) is a space-efficient text indexing structure, that can be used in several different string algorithms, especially in the analysis of biological sequences. In this paper, we present a new on-line algorithm ...

Shunsuke Inenaga; Hiromasa Hoshino; Ayumi Shinohara; Masayuki Takeda; Setsuo Arikawa; Giancarlo Mauri; Giulio Pavesi

2001-07-01T23:59:59.000Z

208

Note: A note on power domination in grid graphs  

Science Conference Proceedings (OSTI)

The problem of monitoring an electric power system by placing as few measurement devices in the system as possible is closely related to the well known vertex covering and dominating set problems in graphs (see [T.W. Haynes, S.M. Hedetniemi, S.T. Hedetniemi, ... Keywords: Grid, Power domination

Michael Dorfling; Michael A. Henning

2006-04-01T23:59:59.000Z

209

A note on power domination in grid graphs  

Science Conference Proceedings (OSTI)

The problem of monitoring an electric power system by placing as few measurement devices in the system as possible is closely related to the well known vertex covering and dominating set problems in graphs (see [T.W. Haynes, S.M. Hedetniemi, S.T. Hedetniemi, ... Keywords: grid, power domination

Michael Dorfling; Michael A. Henning

2006-04-01T23:59:59.000Z

210

Graphical and incremental type inference: a graph transformation approach  

Science Conference Proceedings (OSTI)

We present a graph grammar based type inference system for a totally graphic development language. NiMo (Nets in Motion) can be seen as a graphic equivalent to Haskell that acts as an on-line tracer and debugger. Programs are process networks that evolve ... Keywords: graphical language, process networks, type inference, type visualization

Silvia Clerici; Cristina Zoltan; Guillermo Prestigiacomo

2010-05-01T23:59:59.000Z

211

An extension of secure group communication using key graph  

Science Conference Proceedings (OSTI)

With the continuously emerging of Internet applications based on secure group communication, the design of secure group communication becomes an important Internet design topic. Group key management is important for secure group communication. Previous ... Keywords: Batch rekey, Group security, Key graph, Rekey

Zhang Jun; Zhou Yu; Ma Fanyuan; Gu Dawu; Bai Yingcai

2006-10-01T23:59:59.000Z

212

Exponential random graph modeling of communication networks to understand organizational crisis  

Science Conference Proceedings (OSTI)

In recent social network studies, exponential random graph models have been used comprehensively to model global social network structure as a function of their local features. In this study, we describe the exponential random graph models and demonstrate ... Keywords: email communications, exponential random graph models, organizational disintegration, p* models, social networks, statistical models for social networks

Jafar Hamra; Shahadat Uddin; Liaquat Hossain

2011-05-01T23:59:59.000Z

213

Green-Marl: a DSL for easy and efficient graph analysis  

Science Conference Proceedings (OSTI)

The increasing importance of graph-data based applications is fueling the need for highly efficient and parallel implementations of graph analysis software. In this paper we describe Green-Marl, a domain-specific language (DSL) whose high level language ... Keywords: domain-specific language, graph, parallel programming

Sungpack Hong; Hassan Chafi; Edic Sedlar; Kunle Olukotun

2012-04-01T23:59:59.000Z

214

A multiobjective evolutionary programming framework for graph-based data mining  

Science Conference Proceedings (OSTI)

Subgraph mining is the process of identifying concepts describing interesting and repetitive subgraphs within graph-based data. The exponential number of possible subgraphs makes the problem very challenging. Existing methods apply a single-objective ... Keywords: Evolutionary multiobjective optimization, Frequent subgraph mining, Graph-based data mining, Multiobjective evolutionary programming, Multiobjective graph-based data mining, Pareto optimality

Prakash Shelokar, Arnaud Quirin, íScar CordóN

2013-07-01T23:59:59.000Z

215

On perturbation theory and an algorithm for maximal clique enumeration in uncertain and noisy graphs  

Science Conference Proceedings (OSTI)

The maximal clique enumeration (MCE) problem can be used to find very tightly-coupled collections of objects inside a network or graph of relationships. However, when such networks are based on noisy or uncertain data, the solutions to the MCE problem ... Keywords: biological applications, graph algorithms, graph perturbation theory, maximal clique enumeration

William Hendrix; Matthew C. Schmidt; Paul Breimyer; Nagiza F. Samatova

2009-06-01T23:59:59.000Z

216

An event-based framework for characterizing the evolutionary behavior of interaction graphs  

Science Conference Proceedings (OSTI)

Interaction graphs are ubiquitous in many fields such as bioinformatics, sociology and physical sciences. There have been many studies in the literature targeted at studying and mining these graphs. However, almost all of them have studied these graphs ... Keywords: Dynamic interaction networks, diffusion of innovations, evolutionary analysis

Sitaram Asur; Srinivasan Parthasarathy; Duygu Ucar

2009-11-01T23:59:59.000Z

217

Semi-automated derivation of conceptual neighborhood graphs of topological relations  

Science Conference Proceedings (OSTI)

Conceptual neighborhood graphs are similarity-based schemata of spatial/temporal relations. This paper proposes a semi-automated method for deriving a conceptual neighborhood graph of topological relations, which shows all pairs of relations between ... Keywords: 9+-intersection, conceptual neighborhood graphs, conceptual neighbors, smooth transformation, topological relations

Yohei Kurata

2009-09-01T23:59:59.000Z

218

Cleaning random d-regular graphs with brushes using a degree-greedy algorithm  

Science Conference Proceedings (OSTI)

In the recently introduced model for cleaning a graph with brushes, we use a degree-greedy algorithm to clean a random d-regular graph on n vertices (with dn even). We then use a differential equations method to find the (asymptotic) ... Keywords: cleaning process, degree--greedy algorithm, differential equations method, random d-regular graphs

Margaret-Ellen Messinger; Pawe? Pra?at; Richard J. Nowakowski; Nicholas Wormald

2007-08-01T23:59:59.000Z

219

Distributed computation of the knn graph for large high-dimensional point sets  

Science Conference Proceedings (OSTI)

High-dimensional problems arising from robot motion planning, biology, data mining, and geographic information systems often require the computation of k nearest neighbor (knn) graphs. The knn graph of a data set is obtained by connecting each point ... Keywords: Approximate nearest neighbors, Distributed and parallel algorithms, Metric spaces, Nearest neighbors, Range queries, Robotics, knn graphs

Erion Plaku; Lydia E. Kavraki

2007-03-01T23:59:59.000Z

220

Shape prior model for media-adventitia border segmentation in IVUS using graph cut  

Science Conference Proceedings (OSTI)

We present a shape prior based graph cut method which does not require user initialisation. The shape prior is generalised from multiple training shapes, rather than using singular templates as priors. Weighted directed graph construction is used to ... Keywords: IVUS, graph cut, image segmentation, shape prior

Ehab Essa; Xianghua Xie; Igor Sazonov; Perumal Nithiarasu; Dave Smith

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


221

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

222

Orientable embeddings and orientable cycle double covers of projective-planar graphs  

E-Print Network (OSTI)

In a closed 2-cell embedding of a graph each face is homeomorphic to an open disk and is bounded by a cycle in the graph. The Orientable Strong Embedding Conjecture says that every 2-connected graph has a closed 2-cell embedding in some orientable surface. This implies both the Cycle Double Cover Conjecture and the Strong Embedding Conjecture. In this paper we prove that every 2-connected projective-planar cubic graph has a closed 2-cell embedding in some orientable surface. The three main ingredients of the proof are (1) a surgical method to convert nonorientable embeddings into orientable embeddings; (2) a reduction for 4-cycles for orientable closed 2-cell embeddings, or orientable cycle double covers, of cubic graphs; and (3) a structural result for projective-planar embeddings of cubic graphs. We deduce that every 2-edge-connected projective-planar graph (not necessarily cubic) has an orientable cycle double cover.

Ellingham, M N

2009-01-01T23:59:59.000Z

223

Combinatorial Information Theoretical Measurement of the Semantic Significance of Semantic Graph Motifs  

Science Conference Proceedings (OSTI)

Given an arbitrary semantic graph data set, perhaps one lacking in explicit ontological information, we wish to first identify its significant semantic structures, and then measure the extent of their significance. Casting a semantic graph dataset as an edge-labeled, directed graph, this task can be built on the ability to mine frequent {\\em labeled} subgraphs in edge-labeled, directed graphs. We begin by considering the fundamentals of the enumerative combinatorics of subgraph motif structures in edge-labeled directed graphs. We identify its frequent labeled, directed subgraph motif patterns, and measure the significance of the resulting motifs by the information gain relative to the expected value of the motif based on the empirical frequency distribution of the link types which compose them, assuming indpendence. We illustrate the method on a small test graph, and discuss results obtained for small linear motifs (link type bigrams and trigrams) in a larger graph structure.

Joslyn, Cliff A.; al-Saffar, Sinan; Haglin, David J.; Holder, Larry

2011-06-14T23:59:59.000Z

224

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

SciTech Connect

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

225

Stochastic kinetic models: Dynamic independence, modularity and graphs  

E-Print Network (OSTI)

The dynamic properties and independence structure of stochastic kinetic models (SKMs) are analyzed. An SKM is a highly multivariate jump process used to model chemical reaction networks, particularly those in biochemical and cellular systems. We identify SKM subprocesses with the corresponding counting processes and propose a directed, cyclic graph (the kinetic independence graph or KIG) that encodes the local independence structure of their conditional intensities. Given a partition $[A,D,B]$ of the vertices, the graphical separation $A\\perp B|D$ in the undirected KIG has an intuitive chemical interpretation and implies that $A$ is locally independent of $B$ given $A\\cup D$. It is proved that this separation also results in global independence of the internal histories of $A$ and $B$ conditional on a history of the jumps in $D$ which, under conditions we derive, corresponds to the internal history of $D$. The results enable mathematical definition of a modularization of an SKM using its implied dynamics. Gra...

Bowsher, Clive G

2010-01-01T23:59:59.000Z

226

Solving planning-graph by compiling it into CSP  

E-Print Network (OSTI)

Although the deep affinity between Graphplan's backward search, and the process of solving constraint satisfaction problems has been noted earlier, these relations have hither-to been primarily used to adapt CSP search techniques into the backward search phase of Graphplan. This paper describes GP-CSP, a system that does planning by automatically converting Graphplan's planning graph into a CSP encoding, and solving the CSP encoding using standard CSP solvers. Our comprehensive empirical evaluation of GP-CSP demonstrates that it is quite competitive with both standard Graphplan and Blackbox system, which compiles planning graphs into SAT encodings. We discuss the many advantages offered by focusing on CSP encodings rather than SAT encodings, including the fact that by exploiting implicit constraint representations, GP-CSP tends to be less susceptible to memory blow-up associated with methods that compile planning problems into SAT encodings. Our work is inspired by t...

Minh Binh Do; Subbarao Kambhampati

2000-01-01T23:59:59.000Z

227

Every 2-choosable graph is circular consecutive 2-choosable  

E-Print Network (OSTI)

, 2008 Abstract Suppose G is a graph, r is a positive real number and S(r) is a circle of perimeter r. For a positive real number t r, a (t, r)- circular consecutive colour-list assignment L is a mapping that assigns to each vertex v of G an interval L(v) of S(r) of length t. A circular L-colouring of G

Zhu, Xuding

228

On a base exchange game on bispanning graphs  

E-Print Network (OSTI)

We consider the following maker-breaker game on a graph G that has a partition of the edge set E into two spanning trees E1 and E2. Initially the edges of E1 are purple and the edges of E2 blue. Maker and breaker move alternately. In a move of the maker a blue edge is coloured purple. The breaker then has to recolour a different edge blue in such a way that the purple and the blue edges are spanning trees again. The goal of the maker is to exchange all colours, i.e. to make E1 blue and E2 purple. We prove that a sufficient but not necessary condition for the breaker to win is that the graph contains an induced K4. Furthermore we characterize the structure of a partition of a wheel into two spanning trees and show that the maker wins on wheels Wn with n ? 4 and provide an example of a graph where, for some partitions, the maker wins, for some others, the breaker wins.

Stephan Dominique Andres; Winfried Hochstättler; Markus Merkel

2011-01-01T23:59:59.000Z

229

Sequoia retains top ranking on Graph 500 for third year running  

NLE Websites -- All DOE Office Websites (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

230

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

231

Variable neighborhood search for extremal graphs. 22. Extending bounds for independence to upper irredundance  

Science Conference Proceedings (OSTI)

A set of vertices S in a graph G is independent if no neighbor of a vertex of S belongs to S. A set of vertices U in a graph G is irredundant if each vertex v of U has a private neighbor, which may be v itself, i.e., a neighbor of v which is not a neighbor ... Keywords: AGX, Extremal graph, Invariant, Upper irredundance

Mustapha Aouchiche; Odile Favaron; Pierre Hansen

2009-10-01T23:59:59.000Z

232

Graph-Theoretic Analysis of Discrete-Phase-Space States for ...  

Graph-Theoretic Analysis of Discrete-Phase-Space States for ... Data collected from devices and human condition may be used to forewarn of critical events such as

233

VLSI floorplan generation and area optimization using AND-OR graph search  

Science Conference Proceedings (OSTI)

Floorplan design based on rectangular dualization is considered in two phases. First, given the adjacency graph and sets of aspect ratios of the blocks, a topology is generated which is likely to yield a minimum-area floorplan during the second phase ... Keywords: AND-OR graph search, VLSI, VLSI floorplan generation, adjacency graph, area optimization, aspect ratios, bottom-up polynomial-time algorithm, circuit layout CAD, circuit optimisation, graph theory, heuristic search method, integrated circuit interconnections, minimum-area floorplan, nonslicible floorplans, optimal sizing, rectangular dualization, search effort, top-down first phase

P. S. Dasgupta; S. Sur-Kolay; B. B. Bhattacharya

1995-01-01T23:59:59.000Z

234

ParaGraph-RTS: A parallel reduction-based run-time system  

Science Conference Proceedings (OSTI)

We are investigating the use of the functional programming paradigm on multiprocessor computers. We have developed a parallel graph reduction run-time system called ParaGraph-RTS (Parallel Graph Reduction) that provides both significant amounts of exploitable parallelism and the robustness to support development of large scientific codes. This system allows us to empirically investigate the functional programming paradigm within computationally intensive application domains. In this paper, we describe an implementation of ParaGraph-RTS on a shared-memory multiprocessor. The implementation strategy reflects insights gained through performance characterizations of the reduction process. Preliminary performance results and analyses are presented. 8 refs., 4 figs.

Yantis, B.; Rich, D.; Michelsen, R.

1989-01-01T23:59:59.000Z

235

Improved Complexity Bound of Vertex Cover for Low degree Graph  

E-Print Network (OSTI)

In this paper, we use a new method to decrease the parameterized complexity bound for finding the minimum vertex cover of connected max-degree-3 undirected graphs. The key operation of this method is reduction of the size of a particular subset of edges which we introduce in this paper and is called as "real-cycle" subset. Using "real-cycle" reductions alone we compute a complexity bound $O(1.15855^k)$ where $k$ is size of the optimal vertex cover. Combined with other techniques, the complexity bound can be further improved to be $O(1.1504^k)$. This is currently the best complexity bound.

Yue, Weiya; Cao, Weiwei

2010-01-01T23:59:59.000Z

236

Multithreaded Algorithms for Maximum Matching in Bipartite Graphs  

Science Conference Proceedings (OSTI)

Abstract—We design, implement, and evaluate algorithms for computing a matching of maximum cardinality in a bipartite graph on multi-core and massively multithreaded computers. As computers with larger number of slower cores dominate the commodity processor market, the design of multithreaded algorithms to solve large matching problems becomes a necessity. Recent work on serial algorithms based on searching for augmenting paths for this problem have shown that their performance is sensitive to the order in which the vertices are processed for matching. In a multithreaded environment, imposing a serial order in which vertices are considered for matching would lead to loss of concurrency and performance. But this raises the question: Would parallel matching algorithms on multithreaded machines improve performance over a serial algorithm? We answer this question in the affirmative. We report efficient multithreaded implementations of two key algorithms (Hopcroft- Karp based on breadth-first-search, and Pothen-Fan based on depth-first-search) and their variants, combined with the Karp- Sipser initialization algorithm. We report extensive results and insights using three shared-memory platforms (a 48-core AMD Opteron, a 32-core Intel Nehalem, and a 128-processor Cray XMT) on a representative set of real-world and synthetic graphs. To the best of our knowledge, this is the first extensive study of augmentation-based parallel algorithms for bipartite cardinality matching.

Azad, Md Ariful; Halappanavar, Mahantesh; Rajamanickam, Siva; Boman, Erik G.; Khan, Arif; Pothen, Alex

2012-05-31T23:59:59.000Z

237

INDDGO: Integrated Network Decomposition & Dynamic programming for Graph Optimization  

SciTech Connect

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

238

A tree-decomposed transfer matrix for computing exact Potts model partition functions for arbitrary graphs, with applications to planar graph colourings  

E-Print Network (OSTI)

Combining tree decomposition and transfer matrix techniques provides a very general algorithm for computing exact partition functions of statistical models defined on arbitrary graphs. The algorithm is particularly efficient in the case of planar graphs. We illustrate it by computing the Potts model partition functions and chromatic polynomials (the number of proper vertex colourings using Q colours) for large samples of random planar graphs with up to N=100 vertices. In the latter case, our algorithm yields a sub-exponential average running time of ~ exp(1.516 sqrt(N)), a substantial improvement over the exponential running time ~ exp(0.245 N) provided by the hitherto best known algorithm. We study the statistics of chromatic roots of random planar graphs in some detail, comparing the findings with results for finite pieces of a regular lattice.

Andrea Bedini; Jesper Lykke Jacobsen

2010-03-25T23:59:59.000Z

239

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

240

Fast solution of NP-hard coloring problems on large random graphs  

E-Print Network (OSTI)

Combining tree decomposition and transfer matrix techniques provides a highly efficient and very general algorithm for computing exact partition functions of statistical models defined on large graphs. We illustrate this by considering the hard problem of computing the exact number of vertex colorings for randomly generated planar graphs with up to N = 100 vertices.

Bedini, Andrea

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.


241

A Study of Tabu Search for Coloring Random 3-Colorable Graphs Around the Phase Transition  

Science Conference Proceedings (OSTI)

The authors present an experimental investigation of tabu search (TS) to solve the 3-coloring problem (3-COL). Computational results reveal that a basic TS algorithm is able to find proper 3-colorings for random 3-colorable graphs with up to 11000 vertices ... Keywords: 3-Coloring, Phase Transitions, Random Graphs, TS Algorithm, Tabu Search

Jin-Kao Hao; Jean-Philippe Hamiez; Fred W. Glover

2010-10-01T23:59:59.000Z

242

DYNAMIC FACTOR GRAPHS: A NOVEL FRAMEWORK FOR MULTIPLE FEATURES DATA FUSION  

E-Print Network (OSTI)

DYNAMIC FACTOR GRAPHS: A NOVEL FRAMEWORK FOR MULTIPLE FEATURES DATA FUSION Kittipat Kampa, Jose C and fusion are combined in the same framework. The new framework is built on 2 main ideas; 1) flexible segmentation and fusion with linear Gaussian model assumption. Index Terms-- dynamic factor graphs, sum

Slatton, Clint

243

Bond Graph Model of a Vertical U-Tube Steam Condenser Coupled with a Heat Exchanger  

E-Print Network (OSTI)

Bond Graph Model of a Vertical U-Tube Steam Condenser Coupled with a Heat Exchanger K. Medjaher1+ A and thus the bottom well acts as a heat exchanger. The storage of hydraulic and thermal energies steam condenser; Heat exchanger; Bond graph 1. Introduction Modern process engineering plants

Paris-Sud XI, Université de

244

Energy of a graph is never an odd integer R. B. Bapat  

E-Print Network (OSTI)

Energy of a graph is never an odd integer R. B. Bapat Indian Statistical Institute New Delhi, 781039 Abstract It is shown that if the energy of a graph is rational then it must be an even integer. We the diagonal. An interesting quantity in H¨uckel theory is the sum of the energies of all the electrons

Bapat, Ravindra B.

245

The Web Graph: an Overview Jean-Loup Guillaume and Matthieu Latapy  

E-Print Network (OSTI)

The Web Graph: an Overview Jean-Loup Guillaume and Matthieu Latapy LIAFA - Universit´e Paris 7, 2 Chesnay. Matthieu.Latapy@inria.fr We propose here an overview of the questions which arise about the Web discuss some general facts about the Web graph: its size, its evolution rate, and other problems which

Paris-Sud XI, Université de

246

Answering natural language queries over linked data graphs: a distributional semantics approach  

Science Conference Proceedings (OSTI)

This paper demonstrates Treo, a natural language query mechanism for Linked Data graphs. The approach uses a distributional semantic vector space model to semantically match user query terms with data, supporting vocabulary-independent (or ... Keywords: distributional-compositional semantics, knowledge graphs, natural language queries, schema-agnostic queries, semantic search

André Freitas; Fabrício F. de Faria; Seán O'Riain; Edward Curry

2013-07-01T23:59:59.000Z

247

Parallel Graph Transformation for Model Simulation applied to Timed Transition Petri Nets  

Science Conference Proceedings (OSTI)

This work discusses the use of parallel graph transformation systems for (multi-formalism) modeling and simulation and their implementation in the meta-modeling tool AToM^3. As an example, a simulator for Timed Transition Petri Nets (TTPN) is modeled ... Keywords: model simulation, parallel graph transformation, timed transition Petri nets

J. de Lara; C. Ermel; G. Taentzer; K. Ehrig

2004-12-01T23:59:59.000Z

248

Facet defining inequalities among graph invariants: The system GraPHedron  

Science Conference Proceedings (OSTI)

We present a new computer system, called GraPHedron, which uses a polyhedral approach to help the user to discover optimal conjectures in graph theory. We define what should be optimal conjectures and propose a formal framework allowing to identify them. ... Keywords: Computer-assisted system, Conjecture, GraPHedron, Graph

Hadrien Mélot

2008-05-01T23:59:59.000Z

249

A New Conceptual Graph Generated Algorithm for Semi-structured Databases  

Science Conference Proceedings (OSTI)

As the World Wide Web grows dramatically in recent years, there is increasing interest in semi-structured data on the web. Semi-structured data are usually represented in graph format, many graph schemas have then been proposed to extract schemas from ...

Kam-Fai Wong; Yat Fan Su; Dongqing Yang; Shiwei Tang

2001-10-01T23:59:59.000Z

250

L(2, 1)-Labeling of Oriented Planar Graphs T. Calamoneria,1,, B. Sinaimeria,1,  

E-Print Network (OSTI)

L(2, 1)-Labeling of Oriented Planar Graphs T. Calamoneria,1,, B. Sinaimeria,1, a Department, the maximum (D), over all D C is denoted (C). In this paper we study the L(2, 1)-labeling problem on oriented planar graphs providing some upper bounds on . Then we focus on some spe- cific subclasses of oriented

Calamoneri, Tiziana

251

A Space-Filling Visualization Technique for Multivariate Small World Graphs  

Science Conference Proceedings (OSTI)

We introduce an information visualization technique, known as GreenCurve, for large sparse graphs that exhibit small world properties. Our fractal-based design approach uses spatial cues to approximate the node connections and thus eliminates the links between the nodes in the visualization. The paper describes a sophisticated algorithm to order the neighboring nodes of a large sparse graph by solving the Fiedler vector of its graph Laplacian, and then fold the graph nodes into a space-filling fractal curve based on the Fiedler vector. The result is a highly compact visualization that gives a succinct overview of the graph with guaranteed visibility of every graph node. We show in the paper that the GreenCurve technology is (1) theoretically sustainable by introducing an error estimation metric to measure the fidelity of the new graph representation, (2) empirically rigorous by conducting a usability study to investigate its strengths and weaknesses against the traditional graph layout, and (3) pragmatically feasible by applying it to analyze stressed conditions of the large scale electric power grid on the west coast.

Wong, Pak C.; Foote, Harlan P.; Mackey, Patrick S.; Chin, George; Huang, Zhenyu; Thomas, James J.

2012-03-15T23:59:59.000Z

252

Folksonomy link prediction based on a tripartite graph for tag recommendation  

Science Conference Proceedings (OSTI)

Nowadays social tagging has become a popular way to annotate, search, navigate and discover online resources, in turn leading to the sheer amount of user-generated metadata. This paper addresses the problem of recommending suitable tags during folksonomy ... Keywords: Folksonomy, Graph-based ranking, Link prediction, Social tagging, Tag recommendation, Tripartite graph

Majdi Rawashdeh; Heung-Nam Kim; Jihad Mohamad Alja'Am; Abdulmotaleb Saddik

2013-04-01T23:59:59.000Z

253

True costs of cheap labor are hard to measure: edge deletion and VCG payments in graphs  

Science Conference Proceedings (OSTI)

We address the problem of lowering the buyer's expected payments in shortest path auctions, where the buyer's goal is to purchase a path in a graph in which edges are owned by selfish agents. We show that by deleting some of the edges of the graph, one ... Keywords: auction, mechanism design, shortest paths

Edith Elkind

2005-06-01T23:59:59.000Z

254

Regular Article: On the Spectra of Certain Graphs Arising from Finite Fields  

Science Conference Proceedings (OSTI)

Cayley graphs on a subgroup ofGL(3,p),p>3 a prime, are defined and their properties, particularly their spectra, studied. It is shown that these graphs are connected, vertex-transitive, nonbipartite, and regular, and their degrees are computed. The eigenvalues ...

Nancy Tufts Allen

1998-10-01T23:59:59.000Z

255

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

SciTech Connect

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

Martin, S.P.

1991-02-01T23:59:59.000Z

256

A Methodology for Finding Invariants of Motion for Asymmetric Systems with Gauge-Transformed Umbra Lagrangian Generated by Bond Graphs  

Science Conference Proceedings (OSTI)

The purpose of this article is to obtain conservation laws (invariants of motion) for different energy domains through the extended Noether theorem and bond graphs. Bond graphs are profitably used in representing the physics of a system as well as obtaining ... Keywords: Bond graphs, Noether's theorem, gauge-transformed umbra-Lagrangian, invariants of motion, umbra-Lagrangian

Amalendu Mukherjee; Vikas Rastogi; Anirvan Dasgupta

2006-04-01T23:59:59.000Z

257

Linking SARAH and MadGraph using the UFO format  

E-Print Network (OSTI)

SARAH is a Mathematica package optimized for the fast, efficient and precise study of supersymmetric models beyond the MSSM: a new model can be defined in a short form and all vertices are derived. This allows SARAH to create model files for FeynArts/FormCalc, CalcHep/CompHep and WHIZARD/OMEGA. The newest version of SARAH now provides the possibility to create model files in the UFO format which is supported by MadGraph 5, MadAnalysis 5, GoSam, and soon by Herwig++. Furthermore, SARAH also calculates the mass matrices, RGEs and 1-loop corrections to the mass spectrum. This information is used to write source code for SPheno in order to create a precision spectrum generator for the given model. This spectrum-generator-generator functionality as well as the output of WHIZARD and CalcHep model files have seen further improvement in this version.

Staub, Florian

2012-01-01T23:59:59.000Z

258

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

259

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

Science Conference Proceedings (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

260

Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs  

E-Print Network (OSTI)

Abstract. This paper first presents a unified approach to design efficient algorithms for the weighted domination problem and its three variants, i.e., the weighted independent, connected, and total domination problems, on interval graphs. Given an interval model with endpoints sorted, these algorithms run in time O(n) orO(n log log n) where n is the number of vertices. The results are then extended to solve the same problems on circular-arc graphs in O(n + m) time where m is the number of edges of the input graph.

Maw-shang Chang

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


261

Uses of c-graphs in a prototype for automatic translation  

Science Conference Proceedings (OSTI)

This paper presents a prototype, not completely operational, that is intended to use c-graphs in the translation of assemblers. Firstly, the formalization of the structure and its principal notions (substructures, classes of substructures, order, etc.) ...

Marco A. Clemente-Salazar

1984-07-01T23:59:59.000Z

262

Storage device sizing for a hybrid railway traction system by means of bicausal bond graphs  

E-Print Network (OSTI)

(a supercapacitor) included in this system is then discussed. Keywords: bond graph, bicausality In the paper, the example of a supercapacitor process consists of choosing the system structure dimensioning

Paris-Sud XI, Université de

263

Source templates for the automatic generation of adjoint code through static call graph reversal  

Science Conference Proceedings (OSTI)

We present a new approach to the automatic generation of adjoint codes using automatic differentiation by source transformation. Our method relies on static checkpointing techniques applied to an extended version of the program's call graph. A code ...

Uwe Naumann; Jean Utke

2005-05-01T23:59:59.000Z

264

Graph-Based Software Design for Managing Complexity and Enabling Concurrency in Multiphysics PDE Software  

Science Conference Proceedings (OSTI)

Multiphysics simulation software is plagued by complexity stemming from nonlinearly coupled systems of Partial Differential Equations (PDEs). Such software typically supports many models, which may require different transport equations, constitutive ... Keywords: Scientific computing, multiphysics, object-oriented design, task graph

Patrick K. Notz; Roger P. Pawlowski; James C. Sutherland

2012-11-01T23:59:59.000Z

265

Delay of Social Search on Small-world Graphs Hazer Inaltekin a, Mung Chiang b  

E-Print Network (OSTI)

Delay of Social Search on Small-world Graphs Hazer Inaltekin a, Mung Chiang b H. Vincent Poor b a: hazeri@unimelb.edu.au (Hazer Inaltekin ), chiangm@princeton.edu (Mung Chiang), poor@princeton.edu (H

Chiang, Mung

266

Tracing the birth of an osn: Social graph and profile analysis in google  

E-Print Network (OSTI)

This paper leverages the unique opportunity of Google launching the Google+ OSN. Through multiple crawls of the Google+ OSN, before and after the official public release of the network, our results provide insights into the social graph dynamics of the birth of an OSN. Our findings underline the impact of peculiar aspects of Google+ such as (a) Google’s large initial user base taken over from other Google products and (b) Google+’s provision for asymmetric friendships, on its graph structure, especially in light of previously studied OSN graphs. In addition, we study the geographic distribution of the users and links of Google+, and correlate the social graph with additional information available from the public profiles.

Doris Schiöberg; Fabian Schneider; Harald Schiöberg; Stefan Schmid; Steve Uhlig; Anja Feldmann; Tu Berlin; Telekom Innovation Laboratories

2012-01-01T23:59:59.000Z

267

Enhanced modeling : real-time simulation and modeling of graph based problems on interactive workbenches  

E-Print Network (OSTI)

This thesis presents a methodology and framework for designing systems that apply real-time simulation of computational models throughout the modeling and parameter modification stages of problem solving for graph based ...

Chak, Daniel, 1980-

2004-01-01T23:59:59.000Z

268

Robust on-line computation of Reeb graphs: simplicity and speed  

Science Conference Proceedings (OSTI)

Reeb graphs are a fundamental data structure for understanding and representing the topology of shapes. They are used in computer graphics, solid modeling, and visualization for applications ranging from the computation of similarities and finding defects ...

Valerio Pascucci; Giorgio Scorzelli; Peer-Timo Bremer; Ajith Mascarenhas

2007-08-01T23:59:59.000Z

269

A graph grammar based approach to automated multi-objective analog circuit design  

Science Conference Proceedings (OSTI)

This paper introduces a graph grammar based approach to automated topology synthesis of analog circuits. A grammar is developed to generate circuits through production rules, that are encoded in the form of a derivation tree. The synthesis has been sped ...

Angan Das; Ranga Vemuri

2009-04-01T23:59:59.000Z

270

P.: On stability of Hamilton-connectedness under the 2-closure in claw-free graphs  

E-Print Network (OSTI)

We show that, in a claw-free graph, Hamilton-connectedness is preserved under the operation of local completion performed at a vertex with 2-connected neighborhood. This result proves a conjecture by Bollobás et al. 1 Notation and terminology In this paper, by a graph we mean a finite simple undirected graph G = (V (G), E(G)). For a vertex x ? V (G), NG(x) denotes the neighborhood of x in G, i.e. NG(x) = {y ? V (G) | xy ? E(G)}, and NG[x] denotes the closed neighborhood of x in G, i.e. NG[x] = NG(x) ? {x}. If G, H are graphs, then H ? G means that H is a subgraph of G. The induced subgraph of G on a set M ? V (G) is denoted ?M?G. By a clique we mean a (not necessarily maximal) complete subgraph of G. A vertex x ? V (G) for which ?NG(x)?G is a connected graph (k-connected graph, clique) is said to be locally connected (locally k-connected, simplicial), respectively. A path with endvertices a, b will be referred to as an (a, b)-path. If P is an (a, b)-path and u ? V (P), then u ?(P) and u +(P) denotes the predecessor and successor of u on P (always considered in the orientation from a to b). If no confusion can arise we simply write u ? and u +. If P is a path

Zden?k Ryjá?ek; Petr Vrána

2009-01-01T23:59:59.000Z

271

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

272

Split and Join: Strong Partitions and Universal Steiner Trees for Graphs  

E-Print Network (OSTI)

We study the problem of constructing universal Steiner trees for undirected graphs. Given a graph $G$ and a root node $r$, we seek a single spanning tree $T$ of minimum stretch, where the stretch of $T$ is defined to be the maximum ratio, over all subsets of terminals $X$, of the ratio of the cost of the sub-tree $T_X$ that connects $r$ to $X$ to the cost of an optimal Steiner tree connecting $X$ to $r$. Universal Steiner trees (USTs) are important for data aggregation problems where computing the Steiner tree from scratch for every input instance of terminals is costly, as for example in low energy sensor network applications. We provide a polynomial time UST construction for general graphs with $2^{O(\\sqrt{\\log n})}$-stretch. We also give a polynomial time polylogarithmic-stretch construction for minor-free graphs. One basic building block in our algorithm is a hierarchy of graph partitions, each of which guarantees small strong cluster diameter and bounded local neighbourhood intersections. Our partition h...

Busch, Costas; Radhakrishnan, Jaikumar; Rajaraman, Rajmohan; Srinivasagopalan, Srivathsan

2011-01-01T23:59:59.000Z

273

Combining a Multithreaded Scene Graph System with a Tiled Display Environment  

SciTech Connect

This case study highlights the technical challenges of creating an application that uses a multithreaded scene graph toolkit for rendering and uses a software environment for management of tiled display systems. Scene graph toolkits simplify and streamline graphics applications by providing data management and rendering services. Software for tiled display environments typically performs device and event management by opening windows on displays, by gathering and processing input device events, and by orchestrating the execution of application rendering code. These environments serve double-duty as frameworks for creating parallel rendering applications. We explore technical issues related to interfacing scene graph systems with software that manages tiled projection systems in the context of an implementation, and formulate suggestions for the future growth of such systems.

Frank, R; Bethel, W

2001-03-29T23:59:59.000Z

274

Min-cuts and Shortest Cycles in Planar Graphs in O(n log log n) Time  

E-Print Network (OSTI)

We present a deterministic O(n log log n) time algorithm for finding shortest cycles and minimum cuts in planar graphs. The algorithm improves the previously known fastest algorithm by Italiano et al. in STOC'11 by a factor of log n. This speedup is obtained through the use of dense distance graphs combined with a divide-and-conquer approach.

\\L\\kacki, Jakub

2011-01-01T23:59:59.000Z

275

Using Battery Level as Metric for Graph Planarization Jovan Radak, Nathalie Mitton, and David Simplot-Ryl  

E-Print Network (OSTI)

Using Battery Level as Metric for Graph Planarization Jovan Radak, Nathalie Mitton, and David. In this paper we tackle the prob- lem of possible connectivity loss in the reduced graph by applying a battery the energy consumption over nodes. Keywords: RNG, topology control, wireless sensor networks, battery

Paris-Sud XI, Université de

276

Decision support system for water distribution systems based on neural networks and graphs theory for leakage detection  

Science Conference Proceedings (OSTI)

This paper presents an efficient and effective decision support system (DSS) for operational monitoring and control of water distribution systems based on a three layer General Fuzzy Min-Max Neural Network (GFMMNN) and graph theory. The operational monitoring ... Keywords: Decision support system, Graph theory, Loop corrective flows equations, Modeling and simulation, Neural network, Operational control of water distribution systems

Corneliu T. C. Arsene; Bogdan Gabrys; David Al-Dabass

2012-12-01T23:59:59.000Z

277

Identifying Calcium-Binding Sites with Oxygen-Carbon Shell Geometric and Chemic Criteria-A Graph-Based Approach  

Science Conference Proceedings (OSTI)

Identifying calcium-binding sites in proteins help acknowledge protein functions. We thus developed a graph theory and geometry approach to improve the accuracy for predicting calcium-binding sites, we enhance our previous approach at a high level to ... Keywords: calcium-binding sites, graph theory, maximal cliques, prediction

Hui Liu; Hai Deng

2008-11-01T23:59:59.000Z

278

An incremental learning algorithm based on the K-associated graph for non-stationary data classification  

Science Conference Proceedings (OSTI)

Non-stationary classification problems concern the changes on data distribution over a classifier lifetime. To face this problem, learning algorithms must conciliate essential, but difficult to gather, attributes like good classification performance, ... Keywords: Concept drift, Graph-based learning, Incremental learning, K-associated graph, Non-stationary classification, Purity measure

JoãO Roberto Bertini, Jr, Liang Zhao, Alneu A. Lopes

2013-10-01T23:59:59.000Z

279

A fast parallel algorithm for finding a most reliable source on a general ring-tree graph with unreliable edges  

Science Conference Proceedings (OSTI)

Given an unreliable communication network, we aim to find a most reliable source (MRS) on the network, which maximizes the expected number of nodes that are reachable from it. Although the problem of finding an MRS on general graphs is #P-hard, it is ... Keywords: complementary dynamic programming, general ring-tree graph, most reliable source, parallel algorithm

Wei Ding; Guoliang Xue

2011-08-01T23:59:59.000Z

280

Parse, price and cut: delayed column and row generation for graph based parsers  

Science Conference Proceedings (OSTI)

Graph-based dependency parsers suffer from the sheer number of higher order edges they need to (a) score and (b) consider during optimization. Here we show that when working with LP relaxations, large fractions of these edges can be pruned before they ...

Sebastian Riedel; David Smith; Andrew McCallum

2012-07-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

Modeling and Dynamic Simulation of Electric Power Steering System of Automobile Using Bond Graph Technique  

Science Conference Proceedings (OSTI)

Electric Power Steering (EPS) systems have many merits over traditional hydraulic power steering systems in fuel economy, variable assist capabilities and favorable road feeling by virtue of adjustment assist characteristic with adopting assist motor ... Keywords: electric power steering system, bond graph, modeling, simulation

Lin-an Wang; Qiang Li; Xiao-juan Liang

2010-04-01T23:59:59.000Z

282

The spectral shift function and Levinson's theorem for quantum star graphs  

SciTech Connect

We consider the Schroedinger operator on a star shaped graph with n edges joined at a single vertex. We derive an expression for the trace of the difference of the perturbed and unperturbed resolvent in terms of a Wronskian. This leads to representations for the perturbation determinant and the spectral shift function, and to an analog of Levinson's formula.

Demirel, Semra [University of Stuttgart, Department of Mathematics, Pfaffenwaldring 57, D-70569 Stuttgart (Germany)

2012-08-15T23:59:59.000Z

283

Querying Graphs in Protein-Protein Interactions Networks Using Feedback Vertex Set  

Science Conference Proceedings (OSTI)

Recent techniques increase rapidly the amount of our knowledge on interactions between proteins. The interpretation of these new information depends on our ability to retrieve known substructures in the data, the Protein-Protein Interactions (PPIs) networks. ... Keywords: Graph query, pattern matching, dynamic programming, protein-protein interactions networks.

Guillaume Blin; Florian Sikora; Stephane Vialette

2010-10-01T23:59:59.000Z

284

Domain-independent data cleaning via analysis of entity-relationship graph  

Science Conference Proceedings (OSTI)

In this article, we address the problem of reference disambiguation. Specifically, we consider a situation where entities in the database are referred to using descriptions (e.g., a set of instantiated attributes). The objective of reference disambiguation ... Keywords: Connection strength, RelDC, data cleaning, entity resolution, graph analysis, reference disambiguation, relationship analysis

Dmitri V. Kalashnikov; Sharad Mehrotra

2006-06-01T23:59:59.000Z

285

Shortest Paths in Fuzzy Weighted Graphs Chris Cornelis,* Peter De Kesel,  

E-Print Network (OSTI)

and fuzzy logic--Theory and applications. Upper Saddle River, NJ: Prentice Hall; 1995. 15. Campos L, Muñoz A;12:213­227. 5. Dubois D, Prade H. Fuzzy sets and systems: Theory and applications. New York: Aca- demic PressShortest Paths in Fuzzy Weighted Graphs Chris Cornelis,* Peter De Kesel, Etienne E. Kerre

Gent, Universiteit

286

Graph-based reasoning in collaborative knowledge management for industrial maintenance  

Science Conference Proceedings (OSTI)

Capitalization and sharing of lessons learned play an essential role in managing the activities of industrial systems. This is particularly the case for the maintenance management, especially for distributed systems often associated with collaborative ... Keywords: Case-based reasoning, Conceptual graph rule, Experience feedback, Expert knowledge, Fleet considerations, Maintenance management

Bernard Kamsu-Foguem, Daniel Noyes

2013-10-01T23:59:59.000Z

287

Building a generic graph-based descriptor set for use in drug discovery  

Science Conference Proceedings (OSTI)

The ability to predict drug activity from molecular structure is an important field of research both in academia and in the pharmaceutical industry. Raw 3D structure data is not in a form suitable for identifying properties using machine learning so ... Keywords: QSAR, drug discovery, machine learning, molecular graphs, simple paths

Phillip Lock; Nicolas Le Mercier; Jiuyong Li; Markus Stumptner

2009-12-01T23:59:59.000Z

288

Yang-Lee Zeros of the Ising model on Random Graphs of Non Planar Topology  

E-Print Network (OSTI)

We obtain in a closed form the 1/N^2 contribution to the free energy of the two Hermitian N\\times N random matrix model with non symmetric quartic potential. From this result, we calculate numerically the Yang-Lee zeros of the 2D Ising model on dynamical random graphs with the topology of a torus up to n=16 vertices. They are found to be located on the unit circle on the complex fugacity plane. In order to include contributions of even higher topologies we calculated analytically the nonperturbative (sum over all genus) partition function of the model Z_n = \\sum_{h=0}^{\\infty} \\frac{Z_n^{(h)}}{N^{2h}} for the special cases of N=1,2 and graphs with n\\le 20 vertices. Once again the Yang-Lee zeros are shown numerically to lie on the unit circle on the complex fugacity plane. Our results thus generalize previous numerical results on random graphs by going beyond the planar approximation and strongly indicate that there might be a generalization of the Lee-Yang circle theorem for dynamical random graphs.

D'Albuquerque, L C; Dalmazi, D; Albuquerque, Luiz C. de; Alves, Nelson A.

2000-01-01T23:59:59.000Z

289

Yang-Lee Zeros of the Ising model on Random Graphs of Non Planar Topology  

E-Print Network (OSTI)

We obtain in a closed form the 1/N^2 contribution to the free energy of the two Hermitian N\\times N random matrix model with non symmetric quartic potential. From this result, we calculate numerically the Yang-Lee zeros of the 2D Ising model on dynamical random graphs with the topology of a torus up to n=16 vertices. They are found to be located on the unit circle on the complex fugacity plane. In order to include contributions of even higher topologies we calculated analytically the nonperturbative (sum over all genus) partition function of the model Z_n = \\sum_{h=0}^{\\infty} \\frac{Z_n^{(h)}}{N^{2h}} for the special cases of N=1,2 and graphs with n\\le 20 vertices. Once again the Yang-Lee zeros are shown numerically to lie on the unit circle on the complex fugacity plane. Our results thus generalize previous numerical results on random graphs by going beyond the planar approximation and strongly indicate that there might be a generalization of the Lee-Yang circle theorem for dynamical random graphs.

Luiz C. de Albuquerque; Nelson A. Alves; D. Dalmazi

1999-12-29T23:59:59.000Z

290

Exact algorithms for maximum acyclic subgraph on a superclass of cubic graphs  

Science Conference Proceedings (OSTI)

Finding a maximum acyclic subgraph is on the list of problems that seem to be hard to tackle from a parameterized perspective. We develop two quite efficient algorithms (one is exact, the other parameterized) for (1, n)-graphs, a class containing ...

Henning Fernau; Daniel Raible

2008-02-01T23:59:59.000Z

291

Battery Aware Dynamic Scheduling For Periodic Task Graphs Venkat Rao1  

E-Print Network (OSTI)

Battery Aware Dynamic Scheduling For Periodic Task Graphs Venkat Rao1 , Nicolas Navet1 , Gaurav. of Electrical Engineering anshul@cse.iitd.ernet.in gswaran@ee.iitd.ernet.in Abstract Battery lifetime, a primary profile. This paper ex- plores how scheduling guidelines from battery models can help in extending battery

Paris-Sud XI, Université de

292

A revision of Minty's algorithm for finding a maximum weight stable set of a clawfree graph  

E-Print Network (OSTI)

Daishin Nakamurayand Akihisa Tamuraz y Department of Computer Sciences, University of Electro­Communications, Tokyo 182­8585, Japan. z Research Institute for Mathematical Sciences, Kyoto University, Kyoto 606, Minty's algorithm construct the Edmonds' graph Ed(G; S; w) defined as below. Let x 1 ; : : : ; x r

293

Graph-based ranking algorithms for e-mail expertise analysis  

Science Conference Proceedings (OSTI)

In this paper we study graph--based ranking measures for the purpose of using them to rank email correspondents according to their degree of expertise on subjects of interest. While this complete expertise analysis consists of several steps, in this ... Keywords: digraph node ranking, expert finding, ordered list distance, social network analysis

Byron Dom; Iris Eiron; Alex Cozzi; Yi Zhang

2003-06-01T23:59:59.000Z

294

Software architecture graphs as complex networks: A novel partitioning scheme to measure stability and evolution  

Science Conference Proceedings (OSTI)

The stability and evolution of the structure of consecutive versions of a series of software architecture graphs are analysed using the theory of complex networks. Brief comparisons are drawn between the scale-free behaviour and second order phase transitions. ... Keywords: Complexity, Directed network, Lehman's laws, Power law, Scale-free, Software measurement, Software metric

S. Jenkins; S. R. Kirk

2007-06-01T23:59:59.000Z

295

An Empirical Analysis of Some Heuristic Features for Planning through Local Search and Action Graphs  

Science Conference Proceedings (OSTI)

Planning through local search and action graphs is a powerful approach to fully-automated planning which is implemented in the well-known LPG planner. The approach is based on a stochastic local search procedure exploring a space of partial plans and ... Keywords: Automated planning, domain-independent planning, efficient planning, experimental evaluation of planning techniques

Alfonso Gerevini; Alessandro Saetti; Ivan Serina

2011-04-01T23:59:59.000Z

296

The greedy algorithm for domination in graphs of maximum degree 3  

Science Conference Proceedings (OSTI)

We show that for a connected graph with n nodes and e edges and maximum degree at most 3, the size of the dominating set found by the greedy algorithm is at most 10n - 2e/13 if e ? 11/10n, 11n - ... Keywords: algorithms, dominating set, maximum size

Suzanne M. Seager

2004-01-01T23:59:59.000Z

297

Absence of Zeros for the Chromatic Polynomial on Bounded Degree Graphs  

Science Conference Proceedings (OSTI)

In this paper, I give a short proof of a recent result by Sokal, showing that all zeros of the chromatic polynomial $P_G(q)$ of a finite graph $G$ of maximal degree $D$ lie in the disk $|q|< K D$, where $K$ is a constant that is strictly smaller than ...

Christian Borgs

2006-01-01T23:59:59.000Z

298

Lower bounds on the OBDD size of two fundamental functions' graphs  

Science Conference Proceedings (OSTI)

Ordered Binary Decision Diagrams (OBDDs) are a data structure for Boolean functions which supports many useful operations. Among others it finds applications in CAD, model checking, and symbolic graph algorithms. Nevertheless, many simple functions are ... Keywords: Analysis of algorithms, Computational complexity, Data structures, Theory of computation

Daniel Sawitzki

2007-01-01T23:59:59.000Z

299

Fuzzy lattice reasoning (FLR) type neural computation for weighted graph partitioning  

Science Conference Proceedings (OSTI)

The fuzzy lattice reasoning (FLR) neural network was introduced lately based on an inclusion measure function. This work presents a novel FLR extension, namely agglomerative similarity measure FLR, or asmFLR for short, for clustering based on a similarity ... Keywords: Clustering, Fuzzy lattices, Graph partitioning, Measurable path, Metric, Similarity measure

Vassilis G. Kaburlasos; Lefteris Moussiades; Athena Vakali

2009-06-01T23:59:59.000Z

300

NE-Rank: A Novel Graph-Based Keyphrase Extraction in Twitter  

Science Conference Proceedings (OSTI)

The massive growth of the micro-blogging service Twitter has shed the light on the challenging problem of summarizing a collection of large number of tweets. This paper attempts to extract topical key phrases that would represent topics in tweets. Due ... Keywords: Keyphrase Extraction, Graph-based Ranking, Hashtag, Twitter, PageRank, TextRank, NE-Rank

Abdelghani Bellaachia; Mohammed Al-Dhelaan

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


301

Conservation laws for a gauge-variant umbra-Lagrangian in classical mechanics using bond graphs  

Science Conference Proceedings (OSTI)

In this article, conservation laws (invariants of motion) have been derived from symmetry operations for different energy domains. The formulation has been derived through an extended Noetherâ??s theorem and the bond graphs. An additional time-like ... Keywords: Noether's theorem, gauge transformation, radiation thermal system, time variant stiffness, umbra-Lagrangian

Vikas Rastogi; Amalendu Mukherjee

2011-04-01T23:59:59.000Z

302

The Dominating Set Problem is Fixed Parameter Tractable for Graphs of Bounded Genus  

E-Print Network (OSTI)

, planar, black and white graph, because b 1 b 3 can be added in F and the addition can not activate any be added to the face without destroying planarity. Since we assume the white node is already of degree linear in k. In this paper, using the search tree approach, we show that the dominating set problem

Ellis, John

303

Heat-ray: combating identity snowball attacks using machinelearning, combinatorial optimization and attack graphs  

Science Conference Proceedings (OSTI)

As computers have become ever more interconnected, the complexity of security configuration has exploded. Management tools have not kept pace, and we show that this has made identity snowball attacks into a critical danger. Identity snowball attacks ... Keywords: access control, attack graph, authentication, combinatorial optimization, identity snowball, machine learning, sparsest cut, support vector machine

John Dunagan; Alice X. Zheng; Daniel R. Simon

2009-10-01T23:59:59.000Z

304

Absolutely continuous spectrum implies ballistic transport for quantum particles in a random potential on tree graphs  

SciTech Connect

We discuss the dynamical implications of the recent proof that for a quantum particle in a random potential on a regular tree graph absolutely continuous (ac) spectrum occurs non-perturbatively through rare fluctuation-enabled resonances. The main result is spelled in the title.

Aizenman, Michael [Departments of Physics and Mathematics, Princeton University, Princeton, New Jersey 08544 (United States); Warzel, Simone [Zentrum Mathematik, TU Munich, Boltzmannstr. 3, 85747 Garching (Germany)

2012-09-15T23:59:59.000Z

305

Tracing the Birth of an OSN: Social Graph and Profile Analysis in Google+  

E-Print Network (OSTI)

Tracing the Birth of an OSN: Social Graph and Profile Analysis in Google+ Doris Schi¨oberg Fabian of Google launch- ing the Google+ OSN. Through multiple crawls of the Google+ OSN, before and after of the birth of an OSN. Our findings underline the impact of peculiar aspects of Google+ such as (a) Google

Schmid, Stefan

306

A Fuzzy Graph-Based Model for Selecting Knowledge Management Tools in Innovation Processes  

Science Conference Proceedings (OSTI)

The evolution of organization, management, and production processes is moving towards more complexity every day. An improvement of the performance by the recovery and reuse of resources can be reached by going beyond traditional boundaries and by enforcing ... Keywords: Conflict Resolution, Fuzzy Linguistic Aggregation, Graph Theory, Knowledge Management, Process Innovation

Kouroush Jenab; Ahmad R. Sarfaraz

2012-01-01T23:59:59.000Z

307

A random graph model of kidney exchanges: efficiency, individual-rationality and incentives  

Science Conference Proceedings (OSTI)

In kidney exchanges, hospitals share patient lists and receive transplantations. A kidney-paired donation (KPD) mechanism needs to promote full sharing of information about donor-patient pairs, and identify a Pareto efficient outcome that also satisfies ... Keywords: individual rationality, kidney exchange, maximum matching, mechanism design, random graph theory

Panagiotis Toulis; David C. Parkes

2011-06-01T23:59:59.000Z

308

Fast discrete Fourier transform computations using the reduced adder graph technique  

Science Conference Proceedings (OSTI)

It has recently been shown that the n-dimensional reduced adder graph (RAG-n) technique is beneficial for many DSP applications such as for FIR and IIR filters, where multipliers can be grouped in multiplier blocks. This paper highlights ...

Uwe Meyer-Bäse; Hariharan Natarajan; Andrew G. Dempster

2007-01-01T23:59:59.000Z

309

Universal Design of Auditory Graphs: A Comparison of Sonification Mappings for Visually Impaired and Sighted Listeners  

Science Conference Proceedings (OSTI)

Determining patterns in data is an important and often difficult task for scientists and students. Unfortunately, graphing and analysis software typically is largely inaccessible to users with vision impairment. Using sound to represent data (i.e., sonification ... Keywords: Magnitude estimation, auditory display, visually impaired

B. N. Walker; L. M. Mauney

2010-03-01T23:59:59.000Z

310

Graph-based simulation of quantum computation in the density matrix representation  

Science Conference Proceedings (OSTI)

Quantum-mechanical phenomena are playing an increasing role in information processing, as transistor sizes approach the nanometer level, and quantum circuits and data encoding methods appear in the securest forms of communication. Simulating such phenomena ... Keywords: QuIDDs, decision diagrams, density matrices, graph data structures, quantum algorithms, quantum circuits, quantum errors, simulation

George F. Viamontes; Igor L. Markov; John P. Hayes

2005-03-01T23:59:59.000Z

311

[16] W.T. Tutte. Convex representations of graphs. Proc. London Math. Soc., (10):304--320, 1960. [17] W.T. Tutte. How to draw a graph. Proc. London Math. Soc., (13):743--768, 1963.  

E-Print Network (OSTI)

., San Francisco, 1979. [8] G. Kant. Drawing planar graphs using the lmc­ordering. In Proc. 33rd Symp by inspection of the pointer manipulations. Since the x­coordinate of a vertex v equals to the sum

Utrecht, Universiteit

312

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:

313

Planning as Constraint Satisfaction: Solving the planning-graph by compiling it into CSP  

E-Print Network (OSTI)

Although the deep affinity between Graphplan's backward search, and the process of solving constraint satisfaction problems has been noted earlier, these relations have hither-to been primarily used to adapt CSP search techniques into the backward search phase of Graphplan. This paper describes GP-CSP, a system that does planning by automatically converting Graphplan's planning graph into a CSP encoding, and solving the CSP encoding using standard CSP solvers. Our comprehensive empirical evaluation of GP-CSP demonstrates that it is superior to both standard Graphplan and Blackbox system, which compiles planning graphs into SAT encodings. Our results show that CSP encodings outperform SAT encodings in terms of both space and time requirements. The space reduction is particularly important as it makes GP-CSP less susceptible to the memory blow-up associated with SAT compilation methods. Our work is inspired by the success of van Beek & Chen's CPLAN system. However, in contrast...

Minh Binh Do; Subbarao Kambhampati

2001-01-01T23:59:59.000Z

314

Tropical cyclone identification and tracking system using integrated neural oscillatory elastic graph matching and hybrid RBF network track mining techniques  

Science Conference Proceedings (OSTI)

We present an automatic and integrated neural network-based tropical cyclone (TC) identification and track mining system. The proposed system consists of two main modules: 1) TC pattern identification system using neural oscillatory elastic graph matching ...

R. S.T. Lee; J. N.K. Liu

2000-05-01T23:59:59.000Z

315

On Longest Cycle $C$ of a graph $G$ via Structures of $G-C$  

E-Print Network (OSTI)

Two sharp lower bounds for the length of a longest cycle $C$ of a graph $G$ are presented in terms of the lengths of a longest path and a longest cycle of $G-C$, denoted by $\\overline{p}$ and $\\overline{c}$, respectively, combined with minimum degree $\\delta$: (1) $|C|\\geq(\\overline{p}+2)(\\delta-\\overline{p})$ and (2) $|C|\\geq(\\overline{c}+1)(\\delta-\\overline{c}+1)$.

Nikoghosyan, Zh G

2009-01-01T23:59:59.000Z

316

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

Science Conference Proceedings (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

317

A graph theoretical model for the total balancedness of combinatorial optimization games, Revista de la Unión Matemática Argentina 53  

E-Print Network (OSTI)

Abstract. In this paper we present a model for the study of the total balancedness of packing and covering games, concerning some aspects of graph theory. We give an alternative proof of van Velzen’s characterization of totally balanced covering games. We introduce new types of graph perfection, which allows us to give another approach to the open problem of characterizing totally balanced packing games. 1.

M. Escalante; V. Leoni; G. Nasini

2012-01-01T23:59:59.000Z

318

Trade-off between computation time and Hamiltonian degree in adiabatic graph-state quantum computation  

E-Print Network (OSTI)

Measurement-based quantum computation (MBQC) and adiabatic quantum computation (AQC) are two very different computational methods. While in MBQC computation is driven by adaptive measurements on a large entangled state, in AQC it is the adiabatic transition to a ground state holding the solution to the problem which results in computation. In this paper we combine MBQC on graph states with AQC and investigate how properties, such as computational depth, energy gap and Hamiltonian degree, translate into each other. Following an approach proposed by Bacon and Flammia, we show that any measurement-based quantum computation on a graph state with gflow can be converted into an adiabatic computation, which we call adiabatic graph-state quantum computation (AGQC). We then identify how a trade-off can be made between computational depth and Hamiltonian degree, and clarify the effects of out-of-order measurements in the adiabatic computation. In the extreme case, we present a translation to AGQC where all computations can be carried out in constant time, at the expense of having high degree starting Hamiltonian. This leads to a natural conjecture for a lower bound on the cost of simulating large degree operators using smaller degree operators.

Bobby Antonio; Damian Markham; Janet Anders

2013-09-05T23:59:59.000Z

319

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

320

Embedded Graphs  

E-Print Network (OSTI)

the definition of either kind of obstruction we need the concepts of clean, mixed, ... A subgraph of Bk is called clean, mixed, or full if none, some but not all, or all.

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

directed graph  

Science Conference Proceedings (OSTI)

... In the Harvard-Oxford books on Aristotle, one of the translators suggests that ... 1847---the same year in which Boole published his key book in which ...

2013-08-23T23:59:59.000Z

322

Fast computation of MadGraph amplitudes on graphics processing unit (GPU)  

E-Print Network (OSTI)

Continuing our previous studies on QED and QCD processes, we use the graphics processing unit (GPU) for fast calculations of helicity amplitudes for general Standard Model (SM) processes. Additional HEGET codes to handle all SM interactions are introduced, as well assthe program MG2CUDA that converts arbitrary MadGraph generated HELAS amplitudess(FORTRAN) into HEGET codes in CUDA. We test all the codes by comparing amplitudes and cross sections for multi-jet srocesses at the LHC associated with production of single and double weak bosonss a top-quark pair, Higgs boson plus a weak boson or a top-quark pair, and multisle Higgs bosons via weak-boson fusion, where all the heavy particles are allowes to decay into light quarks and leptons with full spin correlations. All the helicity amplitudes computed by HEGET are found to agree with those comsuted by HELAS within the expected numerical accuracy, and the cross sections obsained by gBASES, a GPU version of the Monte Carlo integration program, agree wish those obtained by BASES (FORTRAN), as well as those obtained by MadGraph. The performance of GPU was over a factor of 10 faster than CPU for all processes except those with the highest number of jets.

K. Hagiwara; J. Kanzaki; Q. Li; N. Okamura; T. Stelzer

2013-05-03T23:59:59.000Z

323

Nevada Bureau of Mines and Geology Open-File Report 12-3 Data Tables and Graphs of Geothermal Power Production in Nevada,  

E-Print Network (OSTI)

This report summarizes statistics on geothermal power production in Nevada from initial plant construction in 1985 through 2011. Data are compiled on nameplate capacity, gross production, and net production by producing geothermal area. Graphs illustrate trends for individual areas and for Nevada overall. The data and graphs are in an Excel spreadsheet, which is also available online with this document, at

Lisa Shevenell; Jonathan G. Price; Ronald H. Hess

2012-01-01T23:59:59.000Z

324

Graphs of the cross sections in the recommended Monte Carlo cross-section library at the Los Alamos Scientific Laboratory  

Science Conference Proceedings (OSTI)

Graphs of all neutron cross sections and photon production cross sections on the Recommended Monte Carlo Cross Section (RMCCS) library have been plotted along with local neutron heating numbers. Values for anti ..nu.., the average number of neutrons per fission, are also given.

Soran, P.D.; Seamon, R.E.

1980-05-01T23:59:59.000Z

325

Multi-organ segmentation from multi-phase abdominal CT via 4D graphs using enhancement, shape and location optimization  

Science Conference Proceedings (OSTI)

The interpretation of medical images benefits from anatomical and physiological priors to optimize computer-aided diagnosis (CAD) applications. Diagnosis also relies on the comprehensive analysis of multiple organs and quantitative measures of soft tissue. ... Keywords: 4D graph, enhancement, multi-phase CT, segmentation, shape

Marius George Linguraru; John A. Pura; Ananda S. Chowdhury; Ronald M. Summers

2010-09-01T23:59:59.000Z

326

17Solar Storm Energy and Pie Graphs The pie charts below show approximately how various forms of energy  

E-Print Network (OSTI)

17Solar Storm Energy and Pie Graphs The pie charts below show approximately how various forms of energy are involved in a solar flare. Flares occur when stored magnetic energy is suddenly released. The chart on the left shows how much of this magnetic energy is available for creating a flare (purple

327

Traffic scheduling mechanism based on graph theory for Power Saving mode of IEEE 802.11 distributed coordinator function  

Science Conference Proceedings (OSTI)

In IEEE 802.11 Power Saving (PS) mode specified for Independent Basic Service Set (IBSS), mobile stations announce their pending data packets within Announcement Traffic Indication Message (ATIM) window immediately after the reception ... Keywords: IEEE 80211, MAC protocol, ad hoc networks, distributed coordinator, energy efficiency, graph theory, medium access control, power saving, power-efficient, time synchronisation function, traffic scheduling

M. H. Ye; C. T. Lau; A. B. Premkumar

2009-03-01T23:59:59.000Z

328

WINDOWS AND FACADES RETRIEVAL USING SIMILARITY ON GRAPH OF CONTOURS Jean-Emmanuel Haugeard, Sylvie Philipp-Foliguet, Frederic Precioso  

E-Print Network (OSTI)

WINDOWS AND FACADES RETRIEVAL USING SIMILARITY ON GRAPH OF CONTOURS Jean-Emmanuel Haugeard, Sylvie topic. In this context, the detection, representation and classification of windows can be beneficial for the identification of the respective fa- cade. In this paper, a novel method for windows and facade retrieval

Paris-Sud XI, Université de

329

Automatic heart isolation for CT coronary visualization using graph-cuts  

E-Print Network (OSTI)

We describe a means to automatically and efficiently isolate the outer surface of the entire heart in Computer Tomography (CT) cardiac scans. Isolating the entire heart allows the coronary vessels on the surface of the heart to be easily visualized despite the proximity of surrounding organs such as the ribs and pulmonary blood vessels. Numerous techniques have been described for segmenting the left ventricle of the heart in images from various types of medical scanners but rarely has the entire heart been segmented. We make use of graphcuts to do the segmentation and introduce a novel means of initiating and constraining the graph-cut technique for heart isolation. The technique has been tested on 70 patient data sets. Results are compares with hand labeled results. 1.

G. Funka-lea; Y. Boykov; C. Florin; M. -p. Jolly; R. Moreau-gobard; R. Ramaraj; D. Rinck

2006-01-01T23:59:59.000Z

330

A Volume Rendering Extension for the OpenSG Scene Graph API  

E-Print Network (OSTI)

We will present the current state of our ongoing work on a simple to use, extensible and cross-platform volume rendering library. Primary target of our framework is interactive scientific visualization, but volumetric effects are also desirable in other fields of computer graphics, e.g. virtual reality applications. The framework we present is based on texture-based direct volume rendering. We apply the concept of volume shaders and demonstrate their usefulness in terms of flexibility, extensibility and adaption to new or different graphics hardware. Our framework is based on the OpenSG scene graph API, that is designed especially with multi-threading and cluster-rendering in mind, thus, it is very easy to integrate volumetric visualizations into powerful virtual reality systems.

Thomas Klein Manfred; Thomas Klein; Manfred Weiler; Thomas Ertl

2003-01-01T23:59:59.000Z

331

14.1.1Graphing Sine, Cosine and Tangent Functions To work properly, a solar panel must  

E-Print Network (OSTI)

panel greater than 1,000 watts? Space Math http://spacemath.gsfc.nasa.gov #12;Answer Key 14.1.1 Problem, after exactly one month (30 days) has elapsed? Space Math http://spacemath.gsfc.nasa.gov #12;Answer Key://spacemath.gsfc.nasa.gov #12;Answer Key 14.4.1 Problem 1 ­ Graph the function for a 48-hour time interval. -120 -100 -80 -60

332

PyDecay/GraphPhys: A Unified Language and Storage System for Particle Decay Process Descriptions  

SciTech Connect

To ease the tasks of Monte Carlo (MC) simulation and event reconstruction (i.e. inferring particle-decay events from experimental data) for long-term BaBar data preservation and analysis, the following software components have been designed: a language ('GraphPhys') for specifying decay processes, common to both simulation and data analysis, allowing arbitrary parameters on particles, decays, and entire processes; an automated visualization tool to show graphically what decays have been specified; and a searchable database storage mechanism for decay specifications. Unlike HepML, a proposed XML standard for HEP metadata, the specification language is designed not for data interchange between computer systems, but rather for direct manipulation by human beings as well as computers. The components are interoperable: the information parsed from files in the specification language can easily be rendered as an image by the visualization package, and conversion between decay representations was implemented. Several proof-of-concept command-line tools were built based on this framework. Applications include building easier and more efficient interfaces to existing analysis tools for current projects (e.g. BaBar/BESII), providing a framework for analyses in future experimental settings (e.g. LHC/SuperB), and outreach programs that involve giving students access to BaBar data and analysis tools to give them a hands-on feel for scientific analysis.

Dunietz, Jesse N.; /MIT /SLAC

2011-06-22T23:59:59.000Z

333

A ‘‘string of feature graphs’’ model for recognition of complex activities  

E-Print Network (OSTI)

Videos usually consist of activities involving interactions between multiple actors, sometimes referred to as complex activities. Recognition of such activities requires modeling the spatio-temporal relationships between the actors and their individual variabilities. In this paper, we consider the problem of recognition of complex activities in a video given a query example. We propose a new feature model based on a string representation of the video which respects the spatio-temporal ordering. This ordered arrangement of local collections of features (e.g., cuboids, STIP), which are the characters in the string, are initially matched using graph-based spectral techniques. Final recognition is obtained by matching the string representations of the query and the test videos in a dynamic programming framework which allows for variability in sampling rates and speed of activity execution. The method does not require tracking or recognition of body parts, is able to identify the region of interest in a cluttered scene, and gives reasonable performance with even a single query example. We test our approach in an example-based video retrieval framework with two publicly available complex activity datasets and provide comparisons against other methods that have studied this problem. 1.

U. Gaur; Y. Zhu; B. Song; A. Roy-chowdhury

2011-01-01T23:59:59.000Z

334

Environment manipulation planner for humanoid robots using task graph that generates action sequence  

E-Print Network (OSTI)

Abstract — In this paper, we describe a planner for a humanoid robot that is capable of finding a path in an environment with movable objects, whereas previous motion planner only deal with an environment with fixed objects. We address an environment manipulation problem for a humanoid robot that finds a walking path from the given start location to the goal location while displacing obstructing objects on the walking path. This problem requires more complex configuration space than previous researches using a mobile robot especially in a manipulation phase, since a humanoid robot has many degree of freedoms in its arm than a forklift type robot. Our approach is to build environment manipulation task graph that decompose the given task into subtasks which are solved using navigation path planner or whole body motion planner. We also propose a standing location search and a displacing obstacle location search for connecting subtasks. Efficient method to solve manipulation planning that rely on whole body inverse kinematics and motion planning technology is also shown. Finally, we show experimental results in an environment with movable objects such as chairs and trash boxes. The planner finds an action sequence consists of walking paths and manipulating obstructing objects to walk from the start position to the goal position. I.

Kei Okada; Atsushi Haneda; Hiroyuki Nakai; Masayuki Inaba; Hirochika Inoue

2004-01-01T23:59:59.000Z

335

The relationship between graphing calculator use and the development of classroom norms in an exemplay teacher's college algebra course  

E-Print Network (OSTI)

The purpose of this study was to advance knowledge about the relationship between graphing calculator use and classroom norm development. An interpretive case study design incorporating qualitative and quantitative research methods was used to explore the question: What happens when an exemplary teacher uses graphing calculators in a college algebra class? The purposively selected participants were the teacher and eleven students of a Texas community college algebra course. All 29 classes of the 14-week spring 2006 semester were observed in their entirety by the researcher. The theoretical frameworks guiding the study were the affective representation system and the Multiple Representations Model of Learning and Teaching with the use of the Mathematics and Science Classroom Observation System for data collection, analysis, and profiling of classroom lessons. Originally developed for grades K-12, the use of the instrument was extended to college algebra. Triangulation of data sources using constant comparative and content analysis methods were used to support the three major findings: (1) The instructor's proactive orchestration of specialized instruction, support materials, and designed activities contributed to the establishment of graphing calculator use as an essential part of classroom norms and promoted students' independent use of the tool; (2) The dynamic and interactive features of the TI-84 Plus graphing calculator facilitated the delivery of instruction at high cognitive levels during student interactive activities providing access to, exploration of, and use of multiple representations for some mathematical concepts and solutions not easily attainable using traditional methods; and (3) Although the majority of students had never used a graphing calculator before the course, all students used the tool at appropriate times during instructional activities, self-reporting that their use of the calculator was generally beneficial for enhancing their understanding of lessons and supporting class interactions. Additionally, all students independently chose to use the calculator during major assessments and reported knowledgeable use of the tool to facilitate improved test performance. Replication of the study is limited because the norms developed in this case are unique to the teacher and students who negotiated their establishment. Suggestions are given regarding educational policies, reform practices, and research extensions.

Gerren, Sally Sue

2008-08-01T23:59:59.000Z

336

View  

E-Print Network (OSTI)

Jul 3, 2007 ... some cases, give conjectures in a fully automated way). Considering that ..... The input of the program is the definition of a given problem written in a text file. .... For instance, one can get statistics ... To determine S, GraPHedron does not need to access the graphs. ..... on Graph Theory (Novi Sad, 1983), pp.

337

3D automatic anatomy segmentation based on iterative graph-cut-ASM  

SciTech Connect

Purpose: This paper studies the feasibility of developing an automatic anatomy segmentation (AAS) system in clinical radiology and demonstrates its operation on clinical 3D images. Methods: The AAS system, the authors are developing consists of two main parts: object recognition and object delineation. As for recognition, a hierarchical 3D scale-based multiobject method is used for the multiobject recognition task, which incorporates intensity weighted ball-scale (b-scale) information into the active shape model (ASM). For object delineation, an iterative graph-cut-ASM (IGCASM) algorithm is proposed, which effectively combines the rich statistical shape information embodied in ASM with the globally optimal delineation capability of the GC method. The presented IGCASM algorithm is a 3D generalization of the 2D GC-ASM method that they proposed previously in Chen et al.[Proc. SPIE, 7259, 72590C1-72590C-8 (2009)]. The proposed methods are tested on two datasets comprised of images obtained from 20 patients (10 male and 10 female) of clinical abdominal CT scans, and 11 foot magnetic resonance imaging (MRI) scans. The test is for four organs (liver, left and right kidneys, and spleen) segmentation, five foot bones (calcaneus, tibia, cuboid, talus, and navicular). The recognition and delineation accuracies were evaluated separately. The recognition accuracy was evaluated in terms of translation, rotation, and scale (size) error. The delineation accuracy was evaluated in terms of true and false positive volume fractions (TPVF, FPVF). The efficiency of the delineation method was also evaluated on an Intel Pentium IV PC with a 3.4 GHZ CPU machine. Results: The recognition accuracies in terms of translation, rotation, and scale error over all organs are about 8 mm, 10 deg. and 0.03, and over all foot bones are about 3.5709 mm, 0.35 deg. and 0.025, respectively. The accuracy of delineation over all organs for all subjects as expressed in TPVF and FPVF is 93.01% and 0.22%, and all foot bones for all subjects are 93.75% and 0.28%, respectively. While the delineations for the four organs can be accomplished quite rapidly with average of 78 s, the delineations for the five foot bones can be accomplished with average of 70 s. Conclusions: The experimental results showed the feasibility and efficacy of the proposed automatic anatomy segmentation system: (a) the incorporation of shape priors into the GC framework is feasible in 3D as demonstrated previously for 2D images; (b) our results in 3D confirm the accuracy behavior observed in 2D. The hybrid strategy IGCASM seems to be more robust and accurate than ASM and GC individually; and (c) delineations within body regions and foot bones of clinical importance can be accomplished quite rapidly within 1.5 min.

Chen, Xinjian; Bagci, Ulas [Radiology and Imaging Sciences, Clinical Center, National Institutes of Health, Building 10 Room 1C515, Bethesda, Maryland 20892-1182 and Life Sciences Research Center, School of Life Sciences and Technology, Xidian University, Xi'an 710071 (China); Radiology and Imaging Sciences, Clinical Center, National Institutes of Health, Building 10 Room 1C515, Bethesda, Maryland 20892-1182 (United States)

2011-08-15T23:59:59.000Z

338

View  

E-Print Network (OSTI)

Oct 14, 2009 ... where A?(y) = ?i yiA(i) maps Rm to Sn, C is the cone of copositive ...... [14] Lovász, L. (1979), “On the Shannon capacity of a graph,” IEEE ...

339

Aspecto-Temporal Data and Lexical Representations in French within Simple Conceptual Graphs on the Basis of Semantico-Cognitive Schemes  

Science Conference Proceedings (OSTI)

This paper deals with the modeling of time, aspect and verbal meanings in natural language processing within Simple Conceptual Graphs (SCG) by way of Semantico-Cognitive Schemes (SCS) and the aspecto-temporal theory. The expression of a semantico-cognitive ...

Tassadit Amghar; Thierry Charnois; Delphine Battistelli

2001-07-01T23:59:59.000Z

340

Hydrogeologic settings of A/M Area: Framework for groundwater transport: Book 6, Appendix B, Time/concentration graphs A/M Area monitoring wells  

Science Conference Proceedings (OSTI)

This document presents the time/concentration graphs for the Savannah River A/M monitoring wells. This Appendix B is part of the determination of the hydrogeologic setting of the A/M Area as a part of ground water transport studies.

Van Pelt, R.; Lewis, S.E.; Aadand, R.K.

1994-03-11T23: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.


341

Convergence of clock processes on infinite graphs and aging in Bouchaud's asymmetric trap model on $\\Z^d$  

E-Print Network (OSTI)

Using a method developed by Durrett and Resnick, [23], we establish general criteria for the convergence of properly rescaled clock processes of random dynamics in random environments on infinite graphs. This extends the results of Gayrard, [27], Bovier and Gayrard, [20], and Bovier, Gayrard, and Svejda, [21], and gives a unified framework for proving convergence of clock processes. As a first application we prove that Bouchaud's asymmetric trap model on $Z^d$ exhibits a normal aging behavior for all $d \\geq 2$. Namely, we show that certain two-time correlation functions, among which the classical probability to find the process at the same site at two time points, converge, as the age of the process diverges, to the distribution function of the arcsine law. As a byproduct we prove that the fractional kinetics process ages.

Véronique Gayrard; Adela Svejda

2013-09-12T23:59:59.000Z

342

ON RESONANCE GRAPHS OF CATACONDENSED HEXAGONAL GRAPHS  

E-Print Network (OSTI)

. ---------------------------------- Supported in part by the Ministry of Education, Science and Sport of Slovenia under the grant 0101-P- 504 of the phenanthrene is presented in Fig. 1. rr rr ¨¨ rr ¨¨ ¨¨ rr rr ¨¨ ¨¨ ¨¨ r r r r r r r r r r r r r r rr rr ¨¨ rr ¨¨ ¨¨ rr rr ¨¨ ¨¨ ¨¨ r r r r r r r r r r r r r r rr rr ¨¨ rr ¨¨ ¨¨ rr rr ¨¨ ¨¨ ¨¨ r r r r r r r r r r r r r

Klavzar, Sandi

343

Simultaneous Segmentation and Pose Estimation of Humans Using Dynamic Graph Cuts  

Science Conference Proceedings (OSTI)

This paper presents a novel algorithm for performing integrated segmentation and 3D pose estimation of a human body from multiple views. Unlike other state of the art methods which focus on either segmentation or ... Keywords: Energy minimization, Pose estimation, Segmentation

Pushmeet Kohli; Jonathan Rihan; Matthieu Bray; Philip H. Torr

2008-09-01T23:59:59.000Z

344

How to build argumental graphs using TAG shared forest: a view from control verbs problematic  

Science Conference Proceedings (OSTI)

The aim of this paper is to describe an approach to semantic representation in the Lexicalized Tree Adjoining Grammars (LTAG)[1] paradigm. We show how to use all the informations contained in the two representation structures provided by the LTAG formalism ...

Djamé Seddah; Bertrand Gaiffe

2005-04-01T23:59:59.000Z

345

Convex Graph Invariants  

E-Print Network (OSTI)

Dec 2, 2010 ... Department of Electrical Engineering and Computer Science ... constraints, for instance, on certain subgraphs being forbidden, on the degree distribution, ... connections between our work and the data-driven perspective on robust .... we are given the combination of a cycle and a grid, or a cycle and the.

346

Stochastic Graph Transformation Systems  

Science Conference Proceedings (OSTI)

In distributed and mobile systems with volatile bandwidth and fragile connectivity, non-functional aspects like performance and reliability become more and more important. To formalize, measure, and predict such properties, stochastic methods are required. ...

Reiko Heckel; Georgios Lajios; Sebastian Menge

2006-01-01T23:59:59.000Z

347

Aging in reversible dynamics of disordered systems. I. Emergence of the arcsine law in Bouchaud's asymmetric trap model on the complete graph  

E-Print Network (OSTI)

In this paper the celebrated arcsine aging scheme of G. Ben Arous and J. Cern\\'y is taken up. Using a brand new approach based on point processes and weak convergence techniques, this scheme is implemented in a wide class of Markov processes that can best be described as Glauber dynamics of discrete disordered systems. More specifically, conditions are given for the underlying clock process (a partial sum process that measures the total time elapsed along paths of a given length) to converge to a subordinator, and this subordinator is constructed explicitly. This approach is illustrated on Bouchaud's asymmetric trap model on the complete graph for which aging is for the first time proved, and the full, optimal picture, obtained.

Véronique Gayrard

2010-08-23T23:59:59.000Z

348

Feature Tracking Using Reeb Graphs  

E-Print Network (OSTI)

H.W. , Wegner, R. : Volume tracking using higher dimensionalShen, H.W. : Ef?cient isosurface tracking using precomputedBell, J. : Analyzing and tracking burning structures in lean

Weber, Gunther H.

2011-01-01T23:59:59.000Z

349

Acquisition of network graph structure  

E-Print Network (OSTI)

in the world, behind only google.com (Alexa Internet, Inc. ,is referred to as google.com rather than the numeric IP

Jones, Jason Jeffrey

2011-01-01T23:59:59.000Z

350

Acquisition of network graph structure  

E-Print Network (OSTI)

LIST OF TABLES Table 1: Truth Tables for Experiments 1 andYes Bias Table 1 contains truth tables for both experimentswere connected. Table 1. Truth Tables for Experiments 1 and

Jones, Jason Jeffrey

2011-01-01T23:59:59.000Z

351

Generalized power domination of graphs  

Science Conference Proceedings (OSTI)

In this paper, we introduce the concept of k-power domination which is a common generalization of domination and power domination. We extend several known results for power domination to k-power domination. Concerning the complexity of the k-power domination ... Keywords: Domination, Electrical network monitoring, Power domination

Gerard Jennhwa Chang; Paul Dorbec; Mickael Montassier; André Raspaud

2012-08-01T23:59:59.000Z

352

TOWARD A SOCIAL GRAPH RECOMMENDATION  

E-Print Network (OSTI)

cessed: 5/8/2012. [6] facebook. Key Factsstatistics. http://networking websites such as Facebook, LinkedIn, and Twitternetworking websites such as Facebook have became a prominent

Adabi, Ali

2012-01-01T23:59:59.000Z

353

Implementation Design Document UNC Distributed Graph Service  

E-Print Network (OSTI)

. Shackelford The University of North Carolina at Chapel Hill Department of Computer Science CB#3175, Sitterson

North Carolina at Chapel Hill, University of

354

Requirements Document UNC Distributed Graph Service  

E-Print Network (OSTI)

. Shackelford The University of North Carolina at Chapel Hill Department of Computer Science CB#3175, Sitterson

North Carolina at Chapel Hill, University of

355

Minimal Spanning Trees with Conflict Graphs  

E-Print Network (OSTI)

(i.e. edges of G which can be combined with every other edge in the minimum spanning tree solution). MSTCG ..... cycle [Sch03]. More formally, I1 is the set of all ...

356

OpenEI Community - Visualization Graph  

Open Energy Info (EERE)

http:en.openei.orgcommunitytaxonomyterm700 en New Gapminder Visualizations Added http:en.openei.orgcommunityblognew-gapminder-visualizations-added

 <...

357

2Cosmic Bar Graphs Galaxy Type  

E-Print Network (OSTI)

or cosmic gamma ray bursts by other instruments in the IPN. It has also observed over 130 events which review the highlights of these observations, which include gamma-ray bursts, soft gamma repeaters Name 1.Introduction The SPI anticoincidence system was first proposed as a gamma-ray burst (GRB

358

Graph Implementations for Nonsmooth Convex Programs  

E-Print Network (OSTI)

as well as for certain standard forms such as semidefinite programs (SDPs), that are efficient in both theory .... functions and sets with known geometries, and combine them in ways which ... affine and the right-hand side (RHS) is a convex set.

359

Efficient shape matching via graph cuts  

Science Conference Proceedings (OSTI)

Meaningful notions of distance between planar shapes typically involve the computation of a correspondence between points on one shape and points on the other. To determine an optimal correspondence is a computationally challenging combinatorial problem. ...

Frank R. Schmidt; Eno Töppe; Daniel Cremers; Yuri Boykov

2007-08-01T23:59:59.000Z

360

Decomposition of overlapping protein complexes: A graph ...  

E-Print Network (OSTI)

Apr 26, 2006 ... tion (COD), that given a protein interaction network iden- tifies its ... show that the COD method opens a new avenue for the analysis of protein ...

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

Graph Algorithms in the Internet Age  

E-Print Network (OSTI)

given expected degrees. Internet Mathematics, 1(1), 2003. [law relationships of the internet topology. SIGCOMM, pagesto generate annotated internet topologies. SIGCOMM, pages [

Stanton, Isabelle Lesley

2012-01-01T23:59:59.000Z

362

A Spectral Algorithm for Improving Graph Partitions  

E-Print Network (OSTI)

Dec 3, 2009 ... of the 41st Annual Symposium on Foundations of Computer Science, page 367, Washington, DC, USA,. 2000. IEEE Computer Society.

363

Continuous Graph Partitioning for Camera Network Surveillance  

E-Print Network (OSTI)

Office of Science's education programs, like the Workforce Development for Teachers and Scientists (WDTS that will prepare us to address energy and environmental challenges. WDTS aims to recruit and train a pipeline. To this end, WDTS sponsors workforce training and education programs, often based at DOE's national

Bullo, Francesco

364

Toolkits for visualizing co-authorship graph  

Science Conference Proceedings (OSTI)

Visualization eases insight into complex systems such as co-authorship networks. We present an initial deployment of an author navigator application for convenient visual examination of JCDL and LANL co--authorship networks. Keywords: co-authorship, visualization

Xiaoming Liu; Johan Bollen; Michael L. Nelson; Herbert Van de Sompel; Jeremy Hussell; Rick Luce; Linn Marks

2004-06-01T23:59:59.000Z

365

Heap reference analysis using access graphs  

Science Conference Proceedings (OSTI)

Despite significant progress in the theory and practice of program analysis, analyzing properties of heap data has not reached the same level of maturity as the analysis of static and stack data. The spatial and temporal structure of stack and static ... Keywords: Aliasing, data flow analysis, heap references, liveness

Uday P. Khedker; Amitabha Sanyal; Amey Karkare

2007-11-01T23:59:59.000Z

366

A universal machine for biform theory graphs  

Science Conference Proceedings (OSTI)

Broadly speaking, there are two kinds of semantics-aware assistant systems for mathematics: proof assistants express the semantic in logic and emphasize deduction, and computer algebra systems express the semantics in programming languages and emphasize ...

Michael Kohlhase, Felix Mance, Florian Rabe

2013-07-01T23:59:59.000Z

367

Continuum Percolation in the Relative Neighborhood Graph  

E-Print Network (OSTI)

.-M. Billiot, and R. Drouilhet. Existence of Delaunay Pairwise Gibbs Point Processes with Superstable Component. J. of Statist. Physics, 95:719­744, 1999. [8] E. Bertin, J.-M. Billiot, and R. Drouilhet. Existence, and R. Drouilhet. k-Nearest-Neighbour Gibbs Point Pro- cesses. Markov Processes and Related Fields, 5

Paris-Sud XI, Université de

368

SAS/GRAPH Output versus ODS Graphics................  

E-Print Network (OSTI)

For a hard-copy book: No part of this publication may be reproduced, stored in a retrieval system, or transmitted, in any form or by any means, electronic, mechanical, photocopying, or otherwise, without the prior written permission of the publisher, SAS Institute Inc. For a web download or e-book: Your use of this publication shall be governed by the terms established by the vendor at the time you acquire this publication. The scanning, uploading, and distribution of this book via the Internet or any other means without the permission of the publisher is illegal and punishable by law. Please purchase only authorized electronic editions and do not participate in or

unknown authors

2013-01-01T23:59:59.000Z

369

Haptic graphs for blind computer users  

E-Print Network (OSTI)

Yu,W. Ramloll,R. Brewster,S.A. Proceedings of the First Workshop on Haptic Human-Computer Interaction pp 102-107 Academic Press

Yu, W.; Ramloll, R.; Brewster, S.A.

370

Haptic graphs for blind computer users  

E-Print Network (OSTI)

Yu,W. Ramloll,R. BrewsterS.A.,R. Haptic Human-Computer Interaction. Brewster, S.A. and Murray-Smith, R. (Eds.),Springer LNCS,Vol 2058 pp 41-51 Springer

Yu, W.; Ramloll, R.; BrewsterS.A., R.; Haptic Human-Computer Interaction.; Brewster, S.A.; and Murray-Smith, R.; (Eds.), Springer LNCS, Vol 2058 pp 41-51 Springer [More Details

371

On semidefinite programming bounds for graph bandwidth  

E-Print Network (OSTI)

problems via association schemes, to appear in Handbook of Semidefinite, Cone and Poly- nomial Optimization: Theory, Algorithms, Software and Applications, ...

372

OSGAR: A Scene Graph with Uncertain Transformations  

Science Conference Proceedings (OSTI)

An important problem for augmented reality is registration error. No system can be perfectly tracked, calibrated or modeled. As a result, the overlaid graphics will not align perfectly with objects in the physical world. This can be distracting, annoying ...

Enylton Machado Coelho; Blair MacIntyre; Simon J. Julier

2004-11-01T23:59:59.000Z

373

Fixed Points of Graph Peeling James Abello  

E-Print Network (OSTI)

to groups above it. We explore a different way to decompose a network into edge layers such that the local simultaneously distant and close readings of a network. It can be used to examine a network at different levels

374

Proof graphs for parameterised boolean equation systems  

Science Conference Proceedings (OSTI)

Parameterised Boolean equation systems (PBESs) can be used for solving a variety of verification problems such as model checking and equivalence checking problems. The definition of solution for a PBES is notoriously difficult to understand, which makes ...

Sjoerd Cranen, Bas Luttik, Tim A. C. Willemse

2013-08-01T23:59:59.000Z

375

Visualization Graph | OpenEI Community  

Open Energy Info (EERE)

Home Groups Community Central Green Button Applications Developer Utility Rate FRED: FRee Energy Database More Public Groups Private Groups Features Groups Blog posts Content...

376

Strongly Connected Graph Components and Computing ... - CECM  

E-Print Network (OSTI)

The magnitude of the determinant of A is bounded by S = n! ... For a machine prime p, in order to improve the running time of our algorithm, we've imple-.

377

Graph Cut Approaches for Materials Segmentation Preserving ...  

Science Conference Proceedings (OSTI)

... Embryo in the Grain Boundary Regions of a Cold Rolled Low Carbon Steel ... P2-07: Development of a Data Fusion Module to Register and Combine EBSD, ...

378

Visual Reasoning With Graphs Yusuf Pisan  

E-Print Network (OSTI)

in a number of areas: to explain complex mechanical and dynamic systems[5,2,6,8], to solve geometry to understand and reason using diagrams to communicate effectively with people. This paper explains how line]. Diagrams serve both as devices to aid in visualization of the situation[14] and as short-term fast access

Forbus, Kenneth D.

379

The Complexity of Graph Connectivity Avi Wigderson  

E-Print Network (OSTI)

world the obvious is optimal. Theorem 25 ([KW]) For every function k(n), dm (STCONN(k(n))) =\\Omega is based on the properties of pairwise independent (2­universal) hash functions of Carter and Wegman [Ca--804, 1990. [CaWe] L. Carter and M. Wegman, Universal hash functions, J. of Computer Systems and Sciences, 18

Wigderson, Avi

380

RETROSPECTIVE: Interprocedural Slicing Using Dependence Graphs  

E-Print Network (OSTI)

commercial product, CodeSurfer R ¡ , a tool for code understanding and inspection that supports browsing and Implementation (1979-1999): A Selection, 2003. Copyright 2003 ACM 1-58113-623-4 ...$5.00. including arrays [4, 50

Binkley, David W.

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

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 environment. We look at a way to minimize the environmental load of office buildings and at the same moment improve indoor air quality and comfort for the occupants of offices. Therefore the end-users behavior of building occupants needs to be taken into account. New design approaches are needed to implement the behavior of occupants of buildings. Improvement of the energy consumption is made possible by agent-based systems for energy management in buildings. Human-in-the-loop Technology: a technology to implement user behavior is developed. By starting from the human perspective and use available and new technology, the outcome was focused on the ability to provide improved individual comfort for the end user. As the end-users become more important within energy infrastructure of buildings, the focus is on the occupant and therefore a bottom-up design approach has been developed. In the final article an example on the level of workplace will be presented.

Zeiler, W.

2011-01-01T23:59:59.000Z

382

The Knapsack Problem with Conflict Graphs  

E-Print Network (OSTI)

University of Graz, Department of Statistics and Operations Research, Universi- taetsstr. ... [13]) and does not permit pseudo-polynomial algorithms (under P = NP

383

Parallel Color Coding and Graph Partitioning Enabling Subgraph Counting for Massive Graphs  

E-Print Network (OSTI)

Zhao, Maleq Khan, V.S. Anil Kumar, Madhav V. Marathe Virginia Tech The Problem The problem is to count the error.) a) Color each vertex of G uniformly at random with a color from {1,...,k}. b) Count Xi The total running time of ParSE can be bounded by: Here P is the number of partitions, Q is the number

Khan, Maleq

384

2-colored 2-colored graphs 2-colored labeled graphs 2-connected 2 ...  

E-Print Network (OSTI)

... of bouquet Emirps Enantiomorphs Endomorphism patterns Energy function ... n Gray-coded Greatest minimal norm Greedy algorithm Green function Green's ...

385

Graph OLAP: a multi-dimensional framework for graph data analysis  

E-Print Network (OSTI)

or protein networks (chem/bio-informatics), 2D/3D objects (data, with applications from chem/bio- informatics, social

Chen, Chen; Yan, Xifeng; Zhu, Feida; Han, Jiawei; Yu, Philip S.

2009-01-01T23:59:59.000Z

386

Intro Algo ring Arbitrary graphs Conclusion PING PONG IN DANGEROUS GRAPHS  

E-Print Network (OSTI)

(homebase), a team of mobile agents has to locate the black hole(s). Performance : nb of agents, nb of moves (homebase), a team of mobile agents has to locate the black hole(s). Performance : nb of agents, nb of moves (homebase), a team of mobile agents has to locate the black hole(s). Performance : nb of agents, nb of moves

Fondements et Applications, Université Paris 7

387

Building Energy Software Tools Directory: D-Gen PRO  

NLE Websites -- All DOE Office Websites (Extended Search)

sales and marketing reports and graphs on the economic feasibility of on-site and cogeneration, including waste heat analysis. Graphs can be viewed by the monthly energy...

388

A Distributed Graph Storage System for Artifacts in Group Collaborations  

E-Print Network (OSTI)

Douglas E. Shackelford John B. Smith F. Donelson Smith The University of North Carolina at Chapel Hill

North Carolina at Chapel Hill, University of

389

Solving Stability Problems on a Superclass of Interval Graphs  

E-Print Network (OSTI)

are reviewed in Section 4; in the following we introduce a new one based on ...... Additional hard constraints may derive from mobility requirements (handover).

390

Exact graph search algorithms for generalized traveling salesman path problems  

Science Conference Proceedings (OSTI)

The Generalized Traveling Salesman Path Problem (GTSPP) involves finding the shortest path from a location s to a location t that passes through at least one location from each of a set of generalized location categories (e.g., gas stations, ...

Michael N. Rice; Vassilis J. Tsotras

2012-06-01T23:59:59.000Z

391

Visualising Memory Graphs: Interactive Debugging using Java3D  

E-Print Network (OSTI)

that three dimensional visualisation cau be a useful tool for debugging, program analysis, and a viable - 3D Modelling in Java 6 3 Requirements 9 4 Design 10 4.1 Preliminaries 10 4.1.1 Creating

Oxford, University of

392

SplittingHeirs: inferring haplotypes by optimizing resultant dense graphs  

Science Conference Proceedings (OSTI)

Phasing genotype data to identify the composite haplotype pairs is a widely-studied problem due to its value for understanding genetic contributions to diseases, population genetics research, and other significant endeavors. The accuracy of the phasing ...

Sharlee Climer; Alan R. Templeton; Weixiong Zhang

2010-08-01T23:59:59.000Z

393

Design patterns detection using SOP expressions for graphs  

Science Conference Proceedings (OSTI)

Several recurring patterns of classes exist in many object oriented software as an experience of developers. Design Pattern Detection is an important part of many solutions to Software Reuse practices. Design pattern instances are highly important and ... Keywords: Boolean function, SOP form, UML, design pattern

Manjari Gupta; Akshara Pande; A. K. Tripathi

2011-01-01T23:59:59.000Z

394

Removing critical nodes from a graph: complexity results and ...  

E-Print Network (OSTI)

Jul 26, 2011 ... In this work we focus on a CNP where a cost wi is specified for deleting ... in social networks; the key players are those whose absence ... function (1) is modeled in [18] in order to investigate the robustness of a transportation.

395

Authenticated data structures for graph and geometric searching  

Science Conference Proceedings (OSTI)

In Crypto '95, Micali and Sidney proposed a method for shared generation of a pseudo-random function f(?) among n players in such a way that for all the inputs x, any u players can compute f(x) while t ...

Michael T. Goodrich; Roberto Tamassia; Nikos Triandopoulos; Robert Cohen

2003-04-01T23:59:59.000Z

396

General Arc-flow Formulation with Graph Compression  

E-Print Network (OSTI)

number of rolls of paper of fixed width waiting to be cut for satisfying demand of different customers who want pieces of various widths. Rolls must be cut in such

397

Optimization Online - Exact Solution of Graph Coloring Problems via ...  

E-Print Network (OSTI)

Mar 12, 2010 ... On the contrary, column generation provides tight lower bounds by solving the ... INFORMS Journal on Computing, 24(1):81-100, 2012.

398

Reformulation of a model for hierarchical divisive graph modularity ...  

E-Print Network (OSTI)

generation algorithm originally proposed by Grötschel and Wakabayashi (1989) for gen- ... column generation algorithm proposed by Cafieri et al. (2010), and a ...

399

JOINT SPECTRAL RADIUS AND PATH-COMPLETE GRAPH ...  

E-Print Network (OSTI)

proximation of the joint spectral radius. The approach is based on the analysis of the underlying switched system via inequalities imposed among multiple ...

400

Trading off space for passes in graph streaming problems  

Science Conference Proceedings (OSTI)

Data stream processing has recently received increasing attention as a computational paradigm for dealing with massive data sets. While major progress has been achieved for several fundamental data sketching and statistics problems, there are many problems ...

Camil Demetrescu; Irene Finocchi; Andrea Ribichini

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

Graphs and Combinatorics (1993)9:97-104 Combinatorics  

E-Print Network (OSTI)

Department of Mathematics, Faculty of Education, Ryukyu University, Nishihara-cho, Okinawa, 903-01 Japan

Bárány, Imre

402

A semidefinite programming based heuristic for graph coloring  

E-Print Network (OSTI)

compute ?-number in each iteration or recycle the matrix X until there are no remaining .... Preliminary tests show that combining recycling strategy with TABU  ...

403

A Branch-and-Cut Algorithm for Graph Coloring ?  

E-Print Network (OSTI)

2030. 33751. 5. 8 ? 4-FullIns 3. 114. 541. 6. 7 ? 4-FullIns 4. 690. 6650. 6. 8 ? 4- FullIns 5. 4146. 77305. 6. 9 ? 5-FullIns 3. 154. 792. 7. 8 ? 5-FullIns 4. 1085. 11395.

404

Web-Based Multimodal Graphs for Visually Impaired People  

E-Print Network (OSTI)

Yu,W. Reid,D. Brewster,S.A. In 1st Cambridge Workshop on Universal Access and Assistive Technology (CWUAAT), (Cambridge, UK) Cambridge University Press

Yu, W.; Reid, D.; Brewster, S.A.

405

Conic approach to quantum graph parameters using linear ...  

E-Print Network (OSTI)

Dec 23, 2013 ... such peculiar correlations exist in the world we live in was found by Aspect et al. [

406

Toward a network graph-based innovation cluster density index  

E-Print Network (OSTI)

Innovation clusters have been studied and examined in many forms: ranging from qualitative observations to in-depth analytical models and frameworks to long-term studies tracking the actors and entities making up an ...

Harple, Daniel L., Jr

2013-01-01T23:59:59.000Z

407

Dynamic Parameter Spring Model for Automatic Graph Layout  

E-Print Network (OSTI)

.3....(..............................),max()( )8.3....(..............................),max()( ),( ),( ),( ),( ),( ),( ),( ),( rifd Cifsp

Tanaka, Jiro

408

Min-Max Theorems Related to Geometric Representationsof Graphs ...  

E-Print Network (OSTI)

Oct 27, 2010 ... A related concept is that of an “energy function” (see, e.g., ... A nice interpretation of this energy is given as follows. ..... Washington, DC, 1997. 6.

409

Optimal integer delay budgeting on directed acyclic graphs  

Science Conference Proceedings (OSTI)

Delay budget is an excess delay each component of a design can tolerate under a given timing constraint. Delay budgeting has been widely exploited to improve the design quality. We present an optimal integer delay budgeting algorithm. Due to numerical ...

E. Bozorgzadeh; S. Ghiasi; A. Takahashi; M. Sarrafzadeh

2003-06-01T23:59:59.000Z

410

New geometric techniques for linear programming and graph partitioning  

E-Print Network (OSTI)

In this thesis, we advance a collection of new geometric techniques for the analysis of combinatorial algorithms. Using these techniques, we resolve several longstanding questions in the theory of linear programming, ...

Kelner, Jonathan, 1980-

2006-01-01T23:59:59.000Z

411

Smoke sheets for graph-structured vortex filaments  

Science Conference Proceedings (OSTI)

Smoke is one of the core phenomena which fluid simulation techniques in computer graphics have attempted to capture. It is both well understood mathematically and important in lending realism to computer generated effects. In an attempt to overcome the ...

Alfred Barnat; Nancy S. Pollard

2012-07-01T23:59:59.000Z

412

Using coreference links and sentence compression in graph ...  

Science Conference Proceedings (OSTI)

... In this pilot we submitted two runs; one with and one without using text snippets ... 1MUSA project page: http://sifnos.ilsp.gr/musa/ ... he's a great actor ...

2009-02-27T23:59:59.000Z

413

On Graph Crossing Number and Edge Planarization Julia Chuzhoy  

E-Print Network (OSTI)

. In the Minimum Crossing Number Toyota Technological Institute, Chicago, IL 60637. Email: cjulia@ttic.edu. Supported in part by NSF CAREER award CCF-0844872. Toyota Technological Institute, Chicago, IL 60637. Email: yury@ttic.edu Toyota Technological Institute, Chicago, IL 60637. Email: tasos@ttic.edu problem, given

Chuzhoy, Julia

414

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

415

Decoding linear codes via optimization and graph-based techniques  

E-Print Network (OSTI)

mapping of increasing length as an encoder is asymptotically good enough, with high probability, to achieve the capacity.

Taghavi, Mohammad H.

2008-01-01T23:59:59.000Z

416

Factor Graphs for Relational Regression Sumit Prakash Chopra  

E-Print Network (OSTI)

it is convenient and useful to capture the overall average price trends followed by a group of houses economic crises, is understanding real estate prices. The price of a house clearly depends on its individual attributes, such as, the number of bedrooms. However, the price also depends on the neighborhood

Mohri, Mehryar

417

Estimating node degree in bait-prey graphs  

Science Conference Proceedings (OSTI)

Motivation: Proteins work together to drive biological processes in cellular machines. Summarizing global and local properties of the set of protein interactions, the interactome, is necessary for describing cellular systems. We consider ...

Denise Scholtens; Tony Chiang; Wolfgang Huber; Robert Gentleman

2008-01-01T23:59:59.000Z

418

Exploring computer-generated line graphs through virtual touch.  

E-Print Network (OSTI)

Yu,W. Ramloll,R. Brewster,S.A. Riedel,B. Accepted for publication in IEEE ISSPA 2001 (Kuala-Lumpur, Malaysia), IEEE IEEE

Yu, W.; Ramloll, R.; Brewster, S.A.

419

MRF Labeling with a Graph-Shifts Algorithm  

E-Print Network (OSTI)

for solving the energy minimization problem associated withto solve the energy minimization problem asso- ciated withwe will consider problem as energy function minimization in

Corso, Jason J.; Tu, Zhuowen; Yuille, Alan

2008-01-01T23:59:59.000Z

420

MRF Labeling with a Graph-Shifts Algorithm  

E-Print Network (OSTI)

for solving the energy minimization problem associated withto solve the energy minimization problem asso- ciated withwe will consider problem as energy function minimization in

Jason J. Corso; Zhuowen Tu; Alan Yuille

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


421

Chemical knowledge representation with description graphs and logic programming  

Science Conference Proceedings (OSTI)

OWL 2 is commonly used to represent objects with complex structure, such as complex assemblies in engineering applications, human anatomy or the structure of chemical molecules [2]. Towards that direction, the European Bioinformatics Institute (EBI) ...

Despoina Magka; Boris Motik; Ian Horrocks

2011-12-01T23:59:59.000Z

422

Hybrid query expansion on ontology graph in biomedical information retrieval  

Science Conference Proceedings (OSTI)

Nowadays, biomedical researchers publish thousands of papers and journals every day. Searching through biomedical literature to keep up with the state of the art is a task of increasing difficulty for many individual researchers. The continuously increasing ...

Liang Dong / Zijun Wang

2012-01-01T23:59:59.000Z

423

Effective and Efficient Relational Query Processing using Conceptual Graphs  

E-Print Network (OSTI)

Ounis,I. Pasca,M. Proceedings of the 20th BCS Colloquium on Information Retrieval, IRSG'98, Electronic Workshops in Computing, Autrans, Isere, France, 1998 Springer

Ounis, I.

424

On Graph Based Interaction for Semantic Query Languages  

Science Conference Proceedings (OSTI)

In the last years, several proposals have been presented concerning graphical query languages working on diagrammatic representations of semantic data models. Such proposals are mainly based on two different user interaction modalities, i.e., to allow ...

Giuseppe Santucci

1996-09-01T23:59:59.000Z

425

An efficient semidefinite programming relaxation for the graph ...  

E-Print Network (OSTI)

restrictions on the subset sizes. Since the new relaxation does not depend on the num- ... fundamental problem that is extensively studied. Many heuristics are ...... In: Handbook of Semidefinite, Conic and Polyno- mial Optimization: Theory ...

426

Computational properties of argument systems satisfying graph-theoretic constraints  

Science Conference Proceedings (OSTI)

One difficulty that arises in abstract argument systems is that many natural questions regarding argument acceptability are, in general, computationally intractable having been classified as complete for classes such as np, co-np, and ... Keywords: Argumentation frameworks, Computational complexity, Computational properties of argumentation

Paul E. Dunne

2007-07-01T23:59:59.000Z

427

Representation of procedures and practices in contextual graphs  

Science Conference Proceedings (OSTI)

Over the last ten years a community that is interested in context has emerged. Brézillon (1999) gave a survey of the literature on context in artificial intelligence. There is now a series of conferences on context, a website and a mailing list. ...

P Brézillon

2003-06-01T23:59:59.000Z

428

Battery aware dynamic scheduling for periodic task graphs  

Science Conference Proceedings (OSTI)

Battery lifetime, a primary design constraint for mobile embedded systems, has been shown to depend heavily on the load current profile. This paper explores how scheduling guidelines from battery models can help in extending battery capacity. It then ...

Venkat Rao; Nicolas Navet; Gaurav Singhal; Anshul Kumar; G. S. Visweswaran

2006-04-01T23:59:59.000Z

429

A New Probabilistic Graph Model and Its Application to Materials ...  

Science Conference Proceedings (OSTI)

Bayesian inference of grain boundary properties from heterogeneous data · Comparison of Novel Microstructure Quantification Frameworks for Visualization,  ...

430

Entity reference resolution via spreading activation on RDF-Graphs  

Science Conference Proceedings (OSTI)

The use of natural language identifiers as reference for ontology elements—in addition to the URIs required by the Semantic Web standards—is of utmost importance because of their predominance in the human everyday life, i.e.speech ...

Joachim Kleb; Andreas Abecker

2010-05-01T23:59:59.000Z

431

Bond graph models of electromechanical systems. The AC generator case  

E-Print Network (OSTI)

Abascal 1 Shape optimization with topological derivative and its application to noise barrier for railway piezoelectric patches I Benedetti, Z S Khodaei, M H Aliabadi 418 On the displacement derivatives of the three for dynamic crack analysis in piezoelectric solids using non-linear crack-face boundary conditions M Wünsche

Batlle, Carles

432

NZ Programming Contest 2000 Problem A Simple Graphs 10 points  

E-Print Network (OSTI)

Action Intensity savings Savings at electricity rate $0.07/kWh $0.10/kWh $0.13/kWh Vampire appliances Unplug all appliances not in use (assume 20W of vampire appliances) 0.48 kWh per day $0.034 $0.048 $0 hot (50°C) to cold wash using high efficiency washer (86 litres per load)iv 2.25 kWh per load $0.16 $0

Goodman, James R.

433

A Few Graph-Based Relational Numerical Abstract Domains  

Science Conference Proceedings (OSTI)

This article presents the systematic design of a class of relational numerical abstract domains from non-relational ones. Constructed domains represent sets of invariants of the form (vj - vi ¿ C), where vj ...

Antoine Miné

2002-09-01T23:59:59.000Z

434

Exact Solution of Graph Coloring Problems via Constraint ...  

E-Print Network (OSTI)

Wireless Mesh Networks. Capone et al. (2010). Employee ...... Integrating operations research in constraint programming. 4OR: Quart. J. Oper. Res. 4 1–45

435

Alternative Fuels Data Center  

Alternative Fuels and Advanced Vehicles Data Center (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

436

GRAPHMC  

Energy Science and Technology Software Center (OSTI)

002928WKSTN00 graphMC: A package for testing the independence of graphs  www.sandia.gov/~apinar/graphMC/graphMC 

437

Quantifying the Effects of Smooth View Transitions on Perceptual Constancy in  

E-Print Network (OSTI)

...........................................................................23 Figure 14 ­ Experiment 1: Average Error Rates by transition style and graph size for the tree in Figure 16........................31 Figure 18 ­ Experiment 2: Average error rate by transition ­ Experiment 3: Average Error Rates by transition style and tree size

438

Alternative Fuels Data Center  

Alternative Fuels and Advanced Vehicles Data Center (EERE)

electricity Go electricity Go 10567_pev_sales_20130906 U.S. PEV Sales by Model 10567_pev_sales_20130906 Monthly Plug-in Electric Vehicle (PEV) sales by model from December 2010 to June 2013 Last update September 2013 View Graph Graph Download Data Electric-charging-stations Electric Charging Station Locations by State Electric-charging-stations View Map Graph Generated_thumb20130810-31804-1vcodfy Clean Cities Hybrid Electric Vehicle Inventory Generated_thumb20130810-31804-1vcodfy HEV inventory reported by Clean Cities coalitions 2004-2010 View Graph Graph Download Data Arra-thumb ARRA Electrification Projects Arra-thumb Last update November 2012 View Map Graph L_i-electric Electric Vehicle Incentives and Laws, by State L_i-electric View Map Graph Generated_thumb20130810-31804-3w4k5i

439

Using Graphite to view network data  

NLE Websites -- All DOE Office Websites (Extended Search)

Graphite Graphite to Visualize Network Data Jon Dugan Summer ESCC 2010, Columbus, OH Lawrence Berkeley National Laboratory U.S. Department of Energy | Office of Science ESnet Statistics Overview ESxSNMP (Data Collection) ESxSNMP (Data Collection) Graphite (Visualization) Graphite (Visualization) Analytics (Custom Reports) Analytics (Custom Reports) Net Almanac (Metadata) Net Almanac (Metadata) Lawrence Berkeley National Laboratory U.S. Department of Energy | Office of Science What is Graphite? "Enterprise scalable realtime graphing" * Developed by Orbitz for visualizing internal performance data * Open source: https://launchpad.net/graphite * Has own RRD like database called Carbon * RRD Compatible ESxSNMP Integration * via REST interface * Easy integration, Graphite is well written

440

Factor graphs and MCMC approaches to iterative equalization of nonlinear dispersive channels  

E-Print Network (OSTI)

In this work, equalization for nonlinear dispersive channels is considered. Nonlinear communication channels can lead to significant degradations when nonlinearities are not taken into account at either the receiver or the ...

Kashif, Faisal M. (Faisal Mahmood)

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


441

A tight bound on the length of odd cycles in the incompatibility graph ...  

E-Print Network (OSTI)

Sep 2, 2011 ... A bound of k + 2 was claimed for the smallest odd cycle of a non-C1P ..... these can be combined with any zero entry to get a forcing triple.

442

LP and SDP Branch-and-Cut Algorithms for the Minimum Graph ...  

E-Print Network (OSTI)

more from separating the cycle inequalities of the cut polytope on a slightly .... recent successful study of a combined semidefinite polyhedral branch-and-cut ap -.

443

Graph visualization for the analysis of the structure and dynamics of extreme-scale supercomputers  

Science Conference Proceedings (OSTI)

We are exploring the development and application of information visualization techniques for the analysis of new extreme-scale supercomputer architectures. Modern supercomputers typically comprise very large clusters of commodity SMPs interconnected by possibly dense and often nonstandard networks. The scale, complexity, and inherent nonlocality of the structure and dynamics of this hardware, and the systems and applications distributed over it, challenge traditional analysis methods. As part of the a la carte team at Los Alamos National Laboratory, who are simulating these advanced architectures, we are exploring advanced visualization techniques and creating tools to provide intuitive exploration, discovery, and analysis of these simulations. This work complements existing and emerging algorithmic analysis tools. Here we gives background on the problem domain, a description of a prototypical computer architecture of interest (on the order of 10,000 processors connected by a quaternary fat-tree network), and presentations of several visualizations of the simulation data that make clear the flow of data in the interconnection network.

Berkbigler, K. P. (Kathryn P.); Bush, B. W. (Brian W.); Davis, Kei,; Hoisie, A. (Adolfy); Smith, S. A. (Steve A.)

2002-01-01T23:59:59.000Z

444

A Graph Theory Package for Maple, Part II - CECM - Simon Fraser ...  

E-Print Network (OSTI)

angles and choose the orientation which maximizes the area of the convex hull ... Opteron running at 2.2 GHz. 33. 32. 46. 41. 4534. 47. 31. 42. 50. 35. 52. 51. 48.

445

An iterative graph cut optimization algorithm for a double MRF Christian Wolf  

E-Print Network (OSTI)

Analysis and Recognition, volume 1, pages 147­152, 1997. [9] A. Tonazzini and L. Bedini. Independent(1):17­27, 2004. [10] A. Tonazzini, L. Bedini, and E. Salerno. A markov model for blind image separation by a mean of the 13th european signal processing conference, 2005. [12] A. Tonazzini, E. Salerno, and L. Bedini. Fast

Wolf, Christian

446

Note: A Graph-Theoretical Approach to Level of Repair Analysis  

E-Print Network (OSTI)

Aug 29, 2004... of repair and maintenance facilities to minimize overall life-cycle costs. ... Category 2: Applications -- OR and Management Sciences ...

447

Design pattern mining using greedy algorithm for multi-labelled graphs  

Science Conference Proceedings (OSTI)

Design patterns are used as a software reuse technology, which provides a large scale reuse. During maintenance of a software system, developers can understand and benefit by understanding the idea of which design patterns have been used in the system, ...

Manjari Gupta

2011-11-01T23:59:59.000Z

448

Quasi borel cayley graphs for ultrafast information dissemination in large and dense networks  

Science Conference Proceedings (OSTI)

As modern networks grow quickly in size, and the amount of data to be processed in the network explodes, fast information dissemination and data exchange is gaining strong attention today. In this research, we observe that the underlying topology ...

Jaewook Yu / K. Wendy Tang; Thomas G. Robertazzi

2011-01-01T23:59:59.000Z

449

Levelized Scheduling of Directed A-Cyclic Precedence Constrained Task Graphs onto Heterogeneous Computing System  

Science Conference Proceedings (OSTI)

Efficient scheduling of processes onto processors of a heterogeneous computing system has always been an important and challenging area of research.The scheduling problem has been shown to be NP-Complete in general cases as well as in several restricted ...

E. Illvarasan; P. Thambidurai

2005-02-01T23:59:59.000Z

450

DISTANCE k-GRAPHS OF HYPERCUBE AND q-HERMITE POLYNOMIALS  

E-Print Network (OSTI)

that the probability distribution of Hq k(Gq), where Hq k is the k-th q-Hermite polynomial, is derived from a sequence. This paper is organized as follows. In section 2 we will recall some basic notations and tools we need

Obata, Nobuaki

451

Properties and Algorithms for Unfolding of Probabilistic Data-Flow Graphs  

Science Conference Proceedings (OSTI)

It is known that any selection statement (e.g. if and switch-case statements) in an application is associated with a probability which could either be predetermined by user input or chosen at runtime. Such a statement can be regarded as a computation ...

Sissades Tongsima; Timothy W. O'neil; Chantana Chantrapornchai; Edwin H.-M. Sha

2000-07-01T23:59:59.000Z

452

Image to Haptic Data Conversion: A First Step to Improving Blind People's Accessibility to Printed Graphs  

E-Print Network (OSTI)

Yu,W. Guffie,K. Brewster,S.A. Proceedings of Eurohaptics 2001 (Birmingham, UK) pp 87-89 Academic Press

Yu, W.; Guffie, K.; Brewster, S.A.

453

A measure based on optimal matching in graph theory for document similarity  

Science Conference Proceedings (OSTI)

Measuring pairwise document similarity is critical to various text retrieval and mining tasks. The most popular measure for document similarity is the Cosine measure in Vector Space Model. In this paper, we propose a new similarity measure based on optimal ...

Xiaojun Wan; Yuxin Peng

2004-10-01T23:59:59.000Z

454

On the complexity of Nash equilibria of action-graph games  

E-Print Network (OSTI)

In light of much recent interest in finding a model of multi-player multi-action games that allows for efficient computation of Nash equilibria yet remains as expressive as possible, we investigate the computational ...

Daskalakis, Constantinos

2009-01-01T23:59:59.000Z

455

A graph-based recovery and decomposition of Swanson's hypothesis using semantic predications  

Science Conference Proceedings (OSTI)

Objectives: This paper presents a methodology for recovering and decomposing Swanson's Raynaud Syndrome-Fish Oil hypothesis semi-automatically. The methodology leverages the semantics of assertions extracted from biomedical literature (called semantic ... Keywords: Background knowledge, Literature-Based Discovery (LBD), Semantic associations, Semantic predications, Subgraph creation, Swanson's hypothesis

Delroy Cameron; Olivier Bodenreider; Hima Yalamanchili; Tu Danh; Sreeram Vallabhaneni; Krishnaprasad Thirunarayan; Amit P. Sheth; Thomas C. Rindflesch

2013-04-01T23:59:59.000Z

456

Graph-based distributed cooperative navigation for a general multi-robot measurement model  

Science Conference Proceedings (OSTI)

Cooperative navigation (CN) enables a group of cooperative robots to reduce their individual navigation errors. For a general multi-robot (MR) measurement model that involves both inertial navigation data and other onboard sensor readings, taken at different ... Keywords: Filtering, information fusion, localization, multi-agent systems, navigation

Vadim Indelman; Pini Gurfil; Ehud Rivlin; Hector Rotstein

2012-08-01T23:59:59.000Z

457

Intelligent Support for Authoring 'Graph of Microworlds' based on Compositional Modeling Technique  

E-Print Network (OSTI)

Engineering, Hiroshima University 1-4-1, Kagamiyama, Higashihiroshima, Hiroshima 739-8527 Japan tsukasa@isl.hiroshima

Bradley, Elizabeth

458

Realizing the costs: template-based surface realisation in the GRAPH approach to referring expression generation  

Science Conference Proceedings (OSTI)

We describe a new realiser developed for the TUNA 2009 Challenge, and present its evaluation scores on the development set, showing a clear increase in performance compared to last year's simple realiser.

Ivo Brugman; Mariët Theune; Emiel Krahmer; Jette Viethen

2009-03-01T23:59:59.000Z

459

Heuristic-Based Techniques for Mapping Irregular Communication Graphs to Mesh Topologies  

Science Conference Proceedings (OSTI)

Mapping of parallel applications on the network topology is becoming increasingly important on large supercomputers. Topology aware mapping can reduce the hops traveled by messages on the network and hence reduce contention, which can lead to improved ... Keywords: mapping, interconnect topology, communication optimization, performance, irregular patterns

Abhinav Bhatele; Laxmikant V. Kale

2011-09-01T23:59:59.000Z

460

Efficient booster pump placement in water networks using graph theoretic principles  

Science Conference Proceedings (OSTI)

Municipal water delivery networks face increasing demands due to population growth. We focus on enhancing a water utility's infrastructure to meet its growing demands in a cost effective manner. Specifically, we consider the problem of placing pressure ...

I. Narayanan; V. Sarangan; A. Vasan; A. Srinivasan; A. Sivasubramaniam; B. S. Murt; S. Narasimhan

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


461

Automatic Transformation of MPI Programs to Asynchronous, Graph-Driven Form  

SciTech Connect

The goals of this project are to develop new, scalable, high-fidelity algorithms for atomic-level simulations and program transformations that automatically restructure existing applications, enabling them to scale forward to Petascale systems and beyond. The techniques enable legacy MPI application code to exploit greater parallelism though increased latency hiding and improved workload assignment. The techniques were successfully demonstrated on high-end scalable systems located at DOE laboratories. Besides the automatic MPI program transformations efforts, the project also developed several new scalable algorithms for ab-initio molecular dynamics, including new massively parallel algorithms for hybrid DFT and new parallel in time algorithms for molecular dynamics and ab-initio molecular dynamics. These algorithms were shown to scale to very large number of cores, and they were designed to work in the latency hiding framework developed in this project. The effectiveness of the developments was enhanced by the direct application to real grand challenge simulation problems covering a wide range of technologically important applications, time scales and accuracies. These included the simulation of the electronic structure of mineral/fluid interfaces, the very accurate simulation of chemical reactions in microsolvated environments, and the simulation of chemical behavior in very large enzyme reactions.

Baden, Scott B [University of California, San Diego; Weare, John H [University of California, San Diego; Bylaska, Eric J [Pacific Northwest National Laboratory

2013-04-30T23:59:59.000Z

462

M-TOP: multi-target operator placement of query graphs for data streams  

Science Conference Proceedings (OSTI)

Nowadays, many applications processes stream-based data, such as financial market analysis, network intrusion detection, or visualization applications. To process stream-based data in an application-independent manner, distributed stream processing systems ...

Nazario Cipriani; Oliver Schiller; Bernhard Mitschang

2011-09-01T23:59:59.000Z

463

On dynamic scheduling of a parallel server system with certain graph structure  

E-Print Network (OSTI)

Equivalent Workload Formulation (EWF) . . . . . . . . . .4.3 Reduced EWF (REWF) . . . . . . . . . . . . . . . . .of Optimal Solution of EWF . . . . . . . . . . . 7.1 Overall

Pesic, Vladimir N.

2011-01-01T23:59:59.000Z

464

Hermitean matrix model free energy: Feynman graph technique for all genera  

E-Print Network (OSTI)

We present a diagrammatic technique for calculating the free energy of the Hermitian one-matrix model to all orders of 1/N expansion in the case where the limiting eigenvalue distribution spans arbitrary (but fixed) number of disjoint intervals (curves).

L. Chekhov; B. Eynard

2005-04-13T23:59:59.000Z

465

Note: A Graph-Theoretical Approach to Level of Repair Analysis  

E-Print Network (OSTI)

Aug 29, 2004 ... Acquisition Management System at www.ams.mod.uk/ams). ... LORA seeks to determine an optimal provision of repair and maintenance.

466

Design of Graph-Based Evolutionary Algorithms: A Case Study for Chemical Process Networks  

Science Conference Proceedings (OSTI)

This paper describes the adaptation of evolutionary algorithms (EAs) to the structural optimization of chemical engineering plants, using rigorous process simulation combined with realistic costing procedures to calculate target function values.To represent ...

Michael Emmerich; Monika Grötzner; Martin Schütz

2001-09-01T23:59:59.000Z

467

Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pure Tokens  

E-Print Network (OSTI)

into G from a safe site (the homebase). The team operates in presence of an adversary that chooses e

Paris-Sud XI, Université de

468

Breaking the speed and scalability barriers for graph exploration on distributed-memory machines  

Science Conference Proceedings (OSTI)

In this paper, we describe the challenges involved in designing a family of highly-efficient Breadth-First Search (BFS) algorithms and in optimizing these algorithms on the latest two generations of Blue Gene machines, Blue Gene/P and Blue Gene/Q. With ...

Fabio Checconi; Fabrizio Petrini; Jeremiah Willcock; Andrew Lumsdaine; Anamitra Roy Choudhury; Yogish Sabharwal

2012-11-01T23:59:59.000Z

469

Exploring the use of constraint programming for enforcing connectivity during graph generation  

E-Print Network (OSTI)

Brown,K.N. Prosser,P. Beck,J.C. Wu,C.W. The Fifth Workshop on Modelling and Solving Problems with Constraints, held at the 19th International Joint Conference on Artificial Intelligence (IJCAI 2005)

Brown, K.N.; Prosser, P.

470

Use of Implicit Graph for Recommending Relevant Videos: A Simulated Evaluation  

E-Print Network (OSTI)

Vallet,D. Hopfgartner,F. Jose,J.M. Proceedings of the 30th European Conference on Information Retrieval, Glasgow, UK pp 199-210 Springer Verlag

Vallet, D.; Hopfgartner, F.

471

RepFrag: a graph based method for finding repeats and transposons from fragmented genomes  

Science Conference Proceedings (OSTI)

Growing sequencing and assembly efforts have been met by the advances in high throughput machines. However, the presence of massive amounts of repeats and transposons complicates the assembly process. Given a library of possible repeats, this paper considers ...

Nirmalya Bandyopadhyay; A. Mark Settles; Tamer Kahveci

2010-08-01T23:59:59.000Z

472

A fast-graph approach to modeling similarity of whole genomes  

Science Conference Proceedings (OSTI)

As increasing numbers of closely related genomic sequences become available, the need to develop methods for detecting fine differences among them also grows apparent. Several calls have been made for improved algorithms to exploit the wealth ...

Adrienne E. Breland / Frederick C. Harris; Karen A. Schlauch

2011-01-01T23:59:59.000Z

473

Morphology-guided graph search for untangling objects: C. elegans analysis  

Science Conference Proceedings (OSTI)

We present a novel approach for extracting cluttered objects based on their morphological properties. Specifically, we address the problem of untangling Caenorhabditis elegans clusters in high-throughput screening experiments. We represent the skeleton ...

Tammy Riklin Raviv; V. Ljosa; A. L. Conery; F. M. Ausubelc; A. E. Carpenter; P. Golland; C. Wählby

2010-09-01T23:59:59.000Z

474

J.F.: Challenges in Mapping Graph Exploration Algorithms on Advanced Multi-core Processors  

E-Print Network (OSTI)

Multi-core processors are a shift of paradigm in computer architecture that promises a dramatic increase in performance. But multi-core processors also bring an unprecedented level of complexity in algorithmic design and software development. In this paper we describe the challenges and design choices involved in parallelizing a breadth-first search (BFS) algorithm on a state-of-the-art multi-core processor, the Cell Broadband Engine (Cell BE). Our experiments obtained on a pre-production Cell BE board running at 3.2 GHz show almost linear speedups when using multiple synergistic processing units, and an impressive level of performance when compared to other processors. The Cell BE is typically an order of magnitude faster than conventional processors, such as the AMD Opteron and the Intel Pentium 4 and Woodcrest, an order of magnitude faster than the MTA-2 multi-threaded processor, and two orders of magnitude faster than a BlueGene/L processor. 1

Oreste Villa; Daniele Paolo Scarpazza; Fabrizio Petrini; Juan Fernández Peinador

2007-01-01T23:59:59.000Z

475

Using Conceptual Graphs in a Multifaceted Logical Model for Information Retrieval  

E-Print Network (OSTI)

Ounis,I. Chevallet,J. Proceedings of the 7th Database and Expert System Applications Conference, DEXA'96 Zurich, Switzerland, Lecture Notes in Computer Science pp 812-823 Springer

Ounis, I.

476

Applying KeyGraph and Data Crystallization to technology monitoring on solar cell  

Science Conference Proceedings (OSTI)

Technology monitoring is helpful for companies, employees, and stakeholders to understand the technological situation of their supplying products nowadays. Solar cell, one of the green energy, is growing rapidly with its nonpolluted and unexhausted characteristics. ... Keywords: Technology monitoring, data crystallization, keygraph, patent data, solar cell

Tzu-Fu Chiu

2010-08-01T23:59:59.000Z

477

Nenad Antonic & Kresimir Burazin Graph spaces of first-order linear partial differential operators  

E-Print Network (OSTI)

is supported in part by the Croatian MZOS trough projects 037­0372787­2795 and 037­1193086­ 3226. 3rd March types (elliptic, parabolic or hyperbolic). His immediate goal was the study of practical problems, like

Burazin, Kresimir

478

Twitter polarity classification with label propagation over lexical links and the follower graph  

Science Conference Proceedings (OSTI)

There is high demand for automated tools that assign polarity to microblog content such as tweets (Twitter posts), but this is challenging due to the terseness and informality of tweets in addition to the wide variety and rapid evolution of language ...

Michael Speriosu; Nikita Sudan; Sid Upadhyay; Jason Baldridge

2011-07-01T23:59:59.000Z

479

Fast k-NN classifier for documents based on a graph structure  

Science Conference Proceedings (OSTI)

In this paper, a fast k nearest neighbors (k-NN) classifier for documents is presented. Documents are usually represented in a high-dimensional feature space, where their terms are treated as features and the weight of each term reflects its importance ... Keywords: fast nearest neighbor search, nearest neighbor classifier, text documents

Fernando José Artigas-Fuentes; Reynaldo Gil-García; José Manuel Badía-Contelles; Aurora Pons-Porrata

2010-11-01T23:59:59.000Z

480

Computational, statistical and graph-theoretical methods for disease mapping and cluster detection  

E-Print Network (OSTI)

Epidemiology, the study of disease risk factors in populations, emerged between the 16th and 19th centuries in response to terrifying epidemics of infectious diseases such as yellow fever, cholera and bubonic plague. ...

Wieland, Shannon Christine

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


481

hal-00189944,version1-23Nov2007 On b-perfect chordal graphs  

E-Print Network (OSTI)

not contain any member of F as an induced subgraph. r r r r r ¡¡ ¡¡ee ee F1 r r r r r r r ¡¡ ee F2 r r rr r r r r r ¡¡ ¡¡ ¡¡ee ee ee F3 r r r r r r rr rr¨¨ ¨¨ F4 r r r r r r r dd dd dd dd F5 r r r rr r r r dd dd dd dd F6 r r r rr r r r dd dd dd dd F7 r r r r r r r r d d

Paris-Sud XI, Université de

482

A case study on financial ratios via cross-graph quasi-bicliques  

Science Conference Proceedings (OSTI)

Stocks with similar financial ratio values across years have similar price movements. We investigate this hypothesis by clustering groups of stocks that exhibit homogeneous financial ratio values across years, and then study their price movements. We ... Keywords: 3D subspace clustering, Financial data mining, Financial ratios analysis, Quasi-bicliques

Kelvin Sim; Guimei Liu; Vivekanand Gopalkrishnan; Jinyan Li

2011-01-01T23:59:59.000Z

483

SNARE: a link analytic system for graph labeling and risk detection  

Science Conference Proceedings (OSTI)

Classifying nodes in networks is a task with a wide range of applications. It can be particularly useful in anomaly and fraud detection. Many resources are invested in the task of fraud detection due to the high cost of fraud, and being able to automatically ... Keywords: anomaly detection, belief propagation, social networks

Mary McGlohon; Stephen Bay; Markus G. Anderle; David M. Steier; Christos Faloutsos

2009-06-01T23:59:59.000Z

484

Project review for the acquisition executive  

Science Conference Proceedings (OSTI)

A set of view graphs for briefing the acquisition executive for the Uranium Mill Tailings Remedial Action (UMTRA) Project are presented.

NONE

1986-10-01T23:59:59.000Z

485

Alternative Fuels Data Center  

Alternative Fuels and Advanced Vehicles Data Center (EERE)

hydrogen Go hydrogen Go Hydrogen-stations Hydrogen Fueling Station Locations by State Hydrogen-stations View Map Graph Hydrogen_li_by_state Hydrogen Incentives and Laws, by State Hydrogen_li_by_state View Map Graph Generated_thumb20130810-31804-1c5lrlb Commuter Responses to the 2008 Oil Price Spike Generated_thumb20130810-31804-1c5lrlb Ways that workers changed their commutes in response to high gasoline prices Last update May 2012 View Graph Graph Download Data Generated_thumb20130810-31804-f64ffe U.S. Consumption of Ethanol and MTBE Oxygenates Generated_thumb20130810-31804-f64ffe Trend of ethanol and MTBE consumption as oxygenates and gasohol blends from 1992-2009 Last update February 2012 View Graph Graph Download Data Generated_thumb20130810-31804-14nv4j5 AFV Acquisitions by Regulated Fleets (by Fuel Type)

486

Alternative Fuels Data Center  

Alternative Fuels and Advanced Vehicles Data Center (EERE)

propane Go propane Go Propane_li_by_state Propane Incentives and Laws, by State Propane_li_by_state View Map Graph Propane-stations Propane Fueling Station Locations by State Propane-stations View Map Graph 10561_expenditures_by_sector_20130906 Per Capita Energy Expenditures by Sector 10561_expenditures_by_sector_20130906 Trend of transportation and residential energy expenditures from 1970-2010 Last update September 2013 View Graph Graph Download Data Generated_thumb20130810-31804-yezn9l Alternative Fuel Vehicles in Use Generated_thumb20130810-31804-yezn9l Trend of the number of AFVs in use by fuel type from 1992-2010 Last update May 2012 View Graph Graph Download Data Generated_thumb20130810-31804-1gs1r9t Estimated Consumption of Alternative Fuels by AFVs Generated_thumb20130810-31804-1gs1r9t

487

Alternative Fuels Data Center  

Alternative Fuels and Advanced Vehicles Data Center (EERE)

driving-behavior Go driving-behavior Go Generated_thumb20130810-31804-1c5lrlb Commuter Responses to the 2008 Oil Price Spike Generated_thumb20130810-31804-1c5lrlb Ways that workers changed their commutes in response to high gasoline prices Last update May 2012 View Graph Graph Download Data Generated_thumb20130810-31804-1jtc9qa Fuel Economy at Various Driving Speeds Generated_thumb20130810-31804-1jtc9qa Trend of fuel efficiency at different speeds, grouped by vehicle age Last update April 2013 View Graph Graph Download Data Generated_thumb20130810-31804-pe0nga Average Vehicle Trip Length by Purpose Generated_thumb20130810-31804-pe0nga Average trip length and distribution by trip type in U.S., 2009 Last update May 2012 View Graph Graph Download Data Commuter Responses to the 2008 Oil Price Spike

488

Alternative Fuels Data Center: Maps and Data  

Alternative Fuels and Advanced Vehicles Data Center (EERE)

3 results 3 results Generated_thumb20131218-346-1wqb49b Clean Cities Alternative Fuel Vehicle Inventory Generated_thumb20131218-346-1wqb49b AFV inventory reported by Clean Cities coalitions 2004-2012 Last update December 2013 View Graph Graph Download Data Generated_thumb20131220-17260-1w22iig Clean Cities Hybrid Electric Vehicle Inventory Generated_thumb20131220-17260-1w22iig HEV inventory reported by Clean Cities coalitions 2004-2012 Last update December 2013 View Graph Graph Download Data Generated_thumb20131211-30676-1y0adz7 Clean Cities Petroleum Savings by AFV Type Generated_thumb20131211-30676-1y0adz7 Trend of displacement by fuels used in AFVs from 2004-2012 Last update December 2013 View Graph Graph Download Data Clean Cities Alternative Fuel Vehicle Inventory 2004 2005 2006 2007 2008 2009 2010 2011 2012

489

Alternative Fuels Data Center: Maps and Data  

Alternative Fuels and Advanced Vehicles Data Center (EERE)

49 results 49 results AFVs and HEVs - Generated_thumb20130810-31804-1ch454p AFV Acquisitions by Regulated Fleets (by Fleet Type) Generated_thumb20130810-31804-1ch454p Trend of S&FP AFV acquisitions by fleet type from 1992-2010 Last update May 2011 View Graph Graph Download Data Generated_thumb20130810-31804-14nv4j5 AFV Acquisitions by Regulated Fleets (by Fuel Type) Generated_thumb20130810-31804-14nv4j5 Trend of S&FP AFV acquisitions by fuel type from 1992-2010 Last update May 2011 View Graph Graph Download Data Generated_thumb20130912-6343-1mnubiw AFV and HEV Model Offerings, By Manufacturer Generated_thumb20130912-6343-1mnubiw Trend of AFV models produced by OEMs from 1991-2013 Last update September 2013 View Graph Graph Download Data Arra-thumb ARRA Electrification Projects

490

Alternative Fuels Data Center  

Alternative Fuels and Advanced Vehicles Data Center (EERE)

idle-reduction Go idle-reduction Go Generated_thumb20131211-30676-qwys9o Clean Cities Petroleum Savings by Idle Reduction Generated_thumb20131211-30676-qwys9o Trend of displacement by idle reduction policies and technologies from 2004-2012 Last update December 2013 View Graph Graph Download Data 10568_vehicle_idle_20130906 Estimated Fuel Used by Commercial Trucks Whie Idling 10568_vehicle_idle_20130906 Comparison of idling percentage for different commercial trucks. Last update September 2013 View Graph Graph Download Data Map_thumbnail Truckstop Electrification Facilities Map_thumbnail Last update May 2013 View Graph Graph Generated_thumb20130810-31804-1kqzbly Incentive Additions by Policy Type Generated_thumb20130810-31804-1kqzbly Trend of state enactments listed by incentive type from 2002-2010 Last

491

Alternative Fuels Data Center  

Alternative Fuels and Advanced Vehicles Data Center (EERE)

ethanol Go ethanol Go Generated_thumb20130810-31804-vrej6p Modes of Transporting Ethanol-Related Materials Generated_thumb20130810-31804-vrej6p Percent of feedstock corn, ethanol, and byproduct that is transported by truck, rail, and barge Last update October 2008 View Graph Graph Download Data Generated_thumb20130810-31804-tkcjvt Global Ethanol Production Generated_thumb20130810-31804-tkcjvt Quantity of ethanol produced by country from 2007-2012 Last update April 2013 View Graph Graph Download Data Generated_thumb20130810-31804-znpuo3 Conventional (Corn Ethanol) RFS2 Mandates and Consumption Generated_thumb20130810-31804-znpuo3 Last update August 2012 View Graph Graph Download Data Generated_thumb20130810-31804-3pjz7n U.S. Production, Consumption, and Trade of Ethanol Generated_thumb20130810-31804-3pjz7n

492

Alternative Fuels Data Center  

Alternative Fuels and Advanced Vehicles Data Center (EERE)

laws-incentives Go laws-incentives Go Generated_thumb20130810-31804-1kqzbly Incentive Additions by Policy Type Generated_thumb20130810-31804-1kqzbly Trend of state enactments listed by incentive type from 2002-2010 Last update March 2013 View Graph Graph Download Data Generated_thumb20130810-31804-78hthx Incentive and Law Additions by Fuel/Technology Type Generated_thumb20130810-31804-78hthx Trend of state incentive and law enactments listed by the targeted technology or fuel type from 2002-2010 Last update March 2013 View Graph Graph Download Data Generated_thumb20130810-31804-17ocipv Regulation Additions by Regulation Type Generated_thumb20130810-31804-17ocipv Trend of state enactments listed by regulation type from 2002-2010 Last update March 2013 View Graph Graph Download Data

493

Annual Energy Review - Energy Information Administration  

U.S. Energy Information Administration (EIA)

4.14 Offshore Wind Resources GRAPH: 4.15 Geothermal Resources GRAPH: 4.16 Biomass Resources GRAPH: Petroleum and Other Liquids; Topic: PDF (entire section)

494

CONVERGENT SDP-RELAXATIONS IN POLYNOMIAL ...  

E-Print Network (OSTI)

Apr 12, 2006 ... extension of the correlation sparsity pattern graph (csp graph); the csp graph has as many nodes as variables, and a link beween two nodes ...

495

Annual Energy Review - Energy Information Administration  

U.S. Energy Information Administration (EIA)

4.11 Concentrating Solar Resources GRAPH: 4.12 Photovoltaic Solar Resources GRAPH: 4.13 Onshore Wind Resources GRAPH: 4.14 Offshore Wind Resources

496

Finding Statistics & Data at Queen's Sept/08 STATISTICS Facts & figures in tables, charts, time series, graphs, etc.  

E-Print Network (OSTI)

Statistics Handbook ­ statistics on oil, gas, electricity, as well as energy trade and the economy & U.S. trade in goods with over 200 countries Tuition and Living Accommodation Cost at Canadian DegreeGranting Universities ­ how much are you paying? World Trade Database ­ Canadian imports/exports

Graham, Nick

497

Spatio-Temporal Sensor Graphs (STSG): A data model for the discovery of spatio-temporal patterns  

Science Conference Proceedings (OSTI)

Developing a model that facilitates the representation and knowledge discovery on sensor data presents many challenges. With sensors reporting data at a very high frequency, resulting in large volumes of data, there is a need for a model that is memory ... Keywords: Sensor networks, Spatio-temporal networks, knowledge discovery

Betsy George; James M. Kang; Shashi Shekhar

2009-08-01T23:59:59.000Z

498

On the Analysis of Locative Phrases with Graphs and Lexicon-Grammar: The Classifier/Proper Noun Pairing  

Science Conference Proceedings (OSTI)

This paper analyses French locative prepositional phrases containing a location proper name Npr (e.g. Méditerranée) and its associated classifier Nc (e.g. mer). The (Nc, Npr) pairs are formally described with the aid of elementary sentences. We study ...

Matthieu Constant

2002-06-01T23:59:59.000Z

499

Clustering large collection of biomedical literature based on ontology-enriched bipartite graph representation and mutual refinement strategy  

Science Conference Proceedings (OSTI)

In this paper we introduce a novel document clustering approach that solves some major problems of traditional document clustering approaches. Instead of depending on traditional vector space model, this approach represents a set of documents as bipartite ...

Illhoi Yoo; Xiaohua Hu

2006-04-01T23:59:59.000Z

500

756 IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. 11, NO. 7, JULY 2002 Adaptive Wavelet Graph Model for Bayesian  

E-Print Network (OSTI)

and approving it for publication was Dr. Mila Nikolova. T. Frese is with McKinsey & Company, Chicago, IL 60610 USA (e-mail: Thomas.Frese@mckinsey.com). C. A. Bouman is with the School of Electrical and Computer