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


1

Graph Algorithms Tours in Graphs  

E-Print Network [OSTI]

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

Bar-Noy, Amotz

2

Graphs, Trees Pebbles, Robots  

E-Print Network [OSTI]

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

Haas, Ruth

3

Hyperbolic Graph Generator  

E-Print Network [OSTI]

Networks representing many complex systems in nature and society share some common structural properties like heterogeneous degree distributions and strong clustering. Recent research on network geometry has shown that those real networks can be adequately modeled as random geometric graphs in hyperbolic spaces. In this paper, we present a computer program to generate such graphs. Besides real-world-like networks, the program can generate random graphs from other well-known graph ensembles, such as the soft configuration model, random geometric graphs on a circle, or Erd\\H{o}s-R\\'enyi random graphs. The simulations show a good match between the expected values of different network structural properties and the corresponding empirical values measured in generated graphs, confirming the accurate behavior of the program.

Aldecoa, Rodrigo; Krioukov, Dmitri

2015-01-01T23:59:59.000Z

4

Spectral characterizations of sun graphs and broken sun graphs  

E-Print Network [OSTI]

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

Paris-Sud XI, Université de

5

Convex Graph Invariants  

E-Print Network [OSTI]

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

2010-12-02T23:59:59.000Z

6

Graph Generator Survey  

SciTech Connect (OSTI)

The benchmarking effort within the Extreme Scale Systems Center at Oak Ridge National Laboratory seeks to provide High Performance Computing benchmarks and test suites of interest to the DoD sponsor. The work described in this report is a part of the effort focusing on graph generation. A previously developed benchmark, SystemBurn, allowed the emulation of dierent application behavior profiles within a single framework. To complement this effort, similar capabilities are desired for graph-centric problems. This report examines existing synthetic graph generator implementations in preparation for further study on the properties of their generated synthetic graphs.

Lothian, Josh [ORNL; Powers, Sarah S [ORNL; Sullivan, Blair D [ORNL; Baker, Matthew B [ORNL; Schrock, Jonathan [ORNL; Poole, Stephen W [ORNL

2013-12-01T23:59:59.000Z

7

Graphs associated with semigroups  

E-Print Network [OSTI]

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

Baber, Stephen Asa

2012-06-07T23:59:59.000Z

8

Graph concatenation for quantum codes  

E-Print Network [OSTI]

Graphs are closely related to quantum error-correcting codes: every stabilizer code is locally equivalent to a graph code and every codeword stabilized code can be described by a graph and a classical code. For the ...

Beigi, Salman

9

Querying graphs with data†  

E-Print Network [OSTI]

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

Vrgoc, Domagoj

2014-06-27T23:59:59.000Z

10

The Branching of Graphs in 2-d Quantum Gravity  

E-Print Network [OSTI]

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

M. G. Harris

1996-07-16T23:59:59.000Z

11

Graph Concatenation for Quantum Codes  

E-Print Network [OSTI]

Graphs are closely related to quantum error-correcting codes: every stabilizer code is locally equivalent to a graph code, and every codeword stabilized code can be described by a graph and a classical code. For the construction of good quantum codes of relatively large block length, concatenated quantum codes and their generalizations play an important role. We develop a systematic method for constructing concatenated quantum codes based on "graph concatenation", where graphs representing the inner and outer codes are concatenated via a simple graph operation called "generalized local complementation." Our method applies to both binary and non-binary concatenated quantum codes as well as their generalizations.

Salman Beigi; Isaac Chuang; Markus Grassl; Peter Shor; Bei Zeng

2010-02-03T23:59:59.000Z

12

Graph dynamics : learning and representation  

E-Print Network [OSTI]

Graphs are often used in artificial intelligence as means for symbolic knowledge representation. A graph is nothing more than a collection of symbols connected to each other in some fashion. For example, in computer vision ...

Ribeiro, Andre Figueiredo

2006-01-01T23:59:59.000Z

13

Densities in graphs and matroids  

E-Print Network [OSTI]

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

Kannan, Lavanya

2009-05-15T23:59:59.000Z

14

Temporal Representation in Semantic Graphs  

SciTech Connect (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

15

Cliques in graphs  

E-Print Network [OSTI]

Cliques in Graphs Siu Lun Allan Lo Christís College University of Cambridge A thesis submitted for the degree of Doctor of Philosophy 2010 Declaration This dissertation is the result of my own work and includes nothing which is the outcome of work...

Lo, Allan

2010-10-12T23:59:59.000Z

16

Extremal Graph Numbers of Graphs on Few May 4, 2012  

E-Print Network [OSTI]

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

Zeilberger, Doron

17

Graph Coarsening for Path Finding in Cybersecurity Graphs  

SciTech Connect (OSTI)

n the pass-the-hash attack, hackers repeatedly steal password hashes and move through a computer network with the goal of reaching a computer with high level administrative privileges. In this paper we apply graph coarsening in network graphs for the purpose of detecting hackers using this attack or assessing the risk level of the network's current state. We repeatedly take graph minors, which preserve the existence of paths in the graph, and take powers of the adjacency matrix to count the paths. This allows us to detect the existence of paths as well as find paths that have high risk of being used by adversaries.

Hogan, Emilie A.; Johnson, John R.; Halappanavar, Mahantesh

2013-01-01T23:59:59.000Z

18

How to Resum Feynman Graphs  

E-Print Network [OSTI]

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

Vincent Rivasseau; Zhituo Wang

2013-09-24T23:59:59.000Z

19

Graph/Network Visualization Data model: graph structures (relations,  

E-Print Network [OSTI]

of physics #12;8 The Spring Model Using springs to represent node-node relations. Minimizing energy1 1 Graph/Network Visualization Data model: graph structures (relations, knowledge) and networks hierarchies #12;7 Sugiyama : Building Hierarchy Domain knowledge based. Designing heuristic, e.g. minimizing

Fang, Shiaofen

20

Contraction semigroups on metric graphs  

E-Print Network [OSTI]

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

Vadim Kostrykin; Jurgen Potthoff; Robert Schrader

2008-02-26T23:59:59.000Z

Note: This page contains sample records for the topic "locations time-concentration graphs" 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

Phylogenetic Toric Varieties on Graphs  

E-Print Network [OSTI]

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

Buczynska, Weronika J.

2010-10-12T23:59:59.000Z

22

Discrete Mathematics 233 (2001) 175182 www.elsevier.com/locate/disc  

E-Print Network [OSTI]

Discrete Mathematics 233 (2001) 175­182 www.elsevier.com/locate/disc Some remarks on cycles on cycles of graphs and directed graphs of the following form: `Does there exist a set of cycles with a property P that generates all the cycles by operation O?'. c 2001 Published by Elsevier Science B.V. 1

Matamala, Martín

23

Contractions of planar graphs in polynomial time?  

E-Print Network [OSTI]

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

Dimitrios, Thilikos

24

Extremal Graph Problems, Degenerate Extremal Problems,  

E-Print Network [OSTI]

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

Simonovits, Miklós

25

Virasoro Representations on Fusion Graphs  

E-Print Network [OSTI]

For any non-unitary model with central charge c(2,q) the path spaces associated to a certain fusion graph are isomorphic to the irreducible Virasoro highest weight modules.

J. Kellendonk; A. Recknagel

1992-10-01T23:59:59.000Z

26

Standards for graph algorithm primitives  

E-Print Network [OSTI]

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

Mattson, Tim

27

Doing time : inducing temporal graphs  

E-Print Network [OSTI]

We consider the problem of constructing a directed acyclic graph that encodes temporal relations found in a text. The unit of our analysis is a temporal segment, a fragment of text that maintains temporal coherence. The ...

Bramsen, Philip James

2006-01-01T23:59:59.000Z

28

Graph anomalies in cyber communications  

SciTech Connect (OSTI)

Enterprises monitor cyber traffic for viruses, intruders and stolen information. Detection methods look for known signatures of malicious traffic or search for anomalies with respect to a nominal reference model. Traditional anomaly detection focuses on aggregate traffic at central nodes or on user-level monitoring. More recently, however, traffic is being viewed more holistically as a dynamic communication graph. Attention to the graph nature of the traffic has expanded the types of anomalies that are being sought. We give an overview of several cyber data streams collected at Los Alamos National Laboratory and discuss current work in modeling the graph dynamics of traffic over the network. We consider global properties and local properties within the communication graph. A method for monitoring relative entropy on multiple correlated properties is discussed in detail.

Vander Wiel, Scott A [Los Alamos National Laboratory; Storlie, Curtis B [Los Alamos National Laboratory; Sandine, Gary [Los Alamos National Laboratory; Hagberg, Aric A [Los Alamos National Laboratory; Fisk, Michael [Los Alamos National Laboratory

2011-01-11T23:59:59.000Z

29

Network Based Approaches for Clustering and Location Decisions  

E-Print Network [OSTI]

in large scale graphs, determining location of facilities for pre-positioning emergency relief supplies, and selecting nodes to form a virtual backbone in a wireless sensor network. To begin with, a new clique relaxation called a k-community is defined...

Verma, Anurag

2012-10-19T23:59:59.000Z

30

Managing Attack Graph Complexity Through Visual Hierarchical Aggregation  

E-Print Network [OSTI]

Managing Attack Graph Complexity Through Visual Hierarchical Aggregation Steven Noel Center a framework for managing network attack graph complexity through interactive visualization, which includes hierarchical aggregation of graph elements. Aggregation collapses non-overlapping subgraphs of the attack graph

Noel, Steven

31

Algebraic connectivity and graph robustness.  

SciTech Connect (OSTI)

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

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

2009-07-01T23:59:59.000Z

32

Graph Analytics for Signature Discovery  

SciTech Connect (OSTI)

Within large amounts of seemingly unstructured data it can be diffcult to find signatures of events. In our work we transform unstructured data into a graph representation. By doing this we expose underlying structure in the data and can take advantage of existing graph analytics capabilities, as well as develop new capabilities. Currently we focus on applications in cybersecurity and communication domains. Within cybersecurity we aim to find signatures for perpetrators using the pass-the-hash attack, and in communications we look for emails or phone calls going up or down a chain of command. In both of these areas, and in many others, the signature we look for is a path with certain temporal properties. In this paper we discuss our methodology for finding these temporal paths within large graphs.

Hogan, Emilie A.; Johnson, John R.; Halappanavar, Mahantesh; Lo, Chaomei

2013-06-01T23:59:59.000Z

33

Optimization in Geometric Graphs: Complexity and Approximation  

E-Print Network [OSTI]

We consider several related problems arising in geometric graphs. In particular, we investigate the computational complexity and approximability properties of several optimization problems in unit ball graphs and develop algorithms to find exact...

Kahruman-Anderoglu, Sera

2011-02-22T23:59:59.000Z

34

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

35

Percolation in the Secrecy Graph Amites Sarkar  

E-Print Network [OSTI]

Percolation in the Secrecy Graph Amites Sarkar Martin Haenggi July 8, 2011 Abstract Secrecy graphs. Department of Mathematics, Western Washington University, Bellingham, WA 98225, USA. Email: amites.sarkar

Sarkar, Amites

36

Evan Marshall Trevathan Admissible SC-Graphs  

E-Print Network [OSTI]

Evan Marshall Trevathan Admissible SC-Graphs Page 1 Admissible SC-Graphs Define: ( , )G ( 2)nB n ( 4)nD n ( 6,7,8)nE n 4F 2G 2H 3H #12;Evan Marshall Trevathan Admissible SC-Graphs Page 2 the form of a #12;Evan Marshall Trevathan Admissible SC-Graphs Page 3 "loop", like ,with no other

Donnelly, Rob

37

NLS ground states on graphs  

E-Print Network [OSTI]

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

Riccardo Adami; Enrico Serra; Paolo Tilli

2014-06-16T23:59:59.000Z

38

Library Locations Locations other than Main Library  

E-Print Network [OSTI]

Library Locations Locations other than Main Library Example: Feminist Studies HQ1410 .U54 2009 University of California, Santa Barbara Library www.library.ucsb.edu Updated 3-2014 A - B.......................................6 Central M - N..................................................Arts Library (Music Building) P

39

STANDARD OPERATING PROCEDURE Location(s): ___________________________________________________  

E-Print Network [OSTI]

of as hazardous waste. 8. Decontamination: Specific instructions: For light contamination of small areas or items12.1 STANDARD OPERATING PROCEDURE for PHENOL Location(s): ___________________________________________________ Chemical(s): Phenol Specific Hazards: May be fatal if inhaled. Harmful if absorbed through skin. Harmful

Pawlowski, Wojtek

40

A heuristic algorithm for graph isomorphism  

E-Print Network [OSTI]

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

Torres Navarro, Luz

1999-01-01T23:59:59.000Z

Note: This page contains sample records for the topic "locations time-concentration graphs" 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

THE TUKEY ORDER FOR GRAPHS 1. Introduction  

E-Print Network [OSTI]

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

Nyikos, Peter J.

42

Generalized Graph States Based on Hadamard Matrices  

E-Print Network [OSTI]

Graph states are widely used in quantum information theory, including entanglement theory, quantum error correction, and one-way quantum computing. Graph states have a nice structure related to a certain graph, which is given by either a stabilizer group or an encoding circuit, both can be directly given by the graph. To generalize graph states, whose stabilizer groups are abelian subgroups of the Pauli group, one approach taken is to study non-abelian stabilizers. In this work, we propose to generalize graph states based on the encoding circuit, which is completely determined by the graph and a Hadamard matrix. We study the entanglement structures of these generalized graph states, and show that they are all maximally mixed locally. We also explore the relationship between the equivalence of Hadamard matrices and local equivalence of the corresponding generalized graph states. This leads to a natural generalization of the Pauli $(X,Z)$ pairs, which characterizes the local symmetries of these generalized graph states. Our approach is also naturally generalized to construct graph quantum codes which are beyond stabilizer codes.

Shawn X Cui; Nengkun Yu; Bei Zeng

2015-02-25T23:59:59.000Z

43

Constrained Graph Optimization: Interdiction and Preservation Problems  

SciTech Connect (OSTI)

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

Schild, Aaron V [Los Alamos National Laboratory

2012-07-30T23:59:59.000Z

44

Acyclic Coloring of Graphs of Maximum Degree Five: Nine Colors are Enough  

E-Print Network [OSTI]

graphs with "large" girth [BKW99], 1-planar graphs [BKRS01], outerplanar graphs (see for instance [Sop97

Boyer, Edmond

45

EuroComb 2005 DMTCS proc. AE, 2005, 389396 Acyclic Coloring of Graphs of Maximum  

E-Print Network [OSTI]

for several families F of graphs such as planar graphs [Bor79], planar graphs with "large" girth [BKW99], 1

Fertin, Guillaume

46

Acyclic Coloring of Graphs of Maximum Degree Five: Nine Colors are Enough  

E-Print Network [OSTI]

graphs with ``large'' girth [BKW99], 1­planar graphs [BKRS01], outerplanar graphs (see for instance [Sop

Fertin, Guillaume

47

Lamplighter groups, de Bruijn graphs, spider-web graphs and their spectra  

E-Print Network [OSTI]

We describe the infinite family of spider-web graphs $S_{k,M,N }$, $k \\geq 2$, $M \\geq 1$ and $N \\geq 0$, studied in physical literature as tensor products of well-known de Brujin graphs $B_{k,N}$ and cyclic graphs $C_M$ and show that these graphs are Schreier graphs of the lamplighter groups $L_k = Z/kZ \\wr Z$. This allows us to compute their spectra and to identify the infinite limit of $S_{k,M,N}$, as $N, M \\to\\infty$, with the Cayley graph of the lamplighter group $L_k$.

Rostislav Grigorchuk; Paul-Henry Leemann; Tatiana Nagnibeda

2015-02-24T23:59:59.000Z

48

Nuclear reactor multiphysics via bond graph formalism  

E-Print Network [OSTI]

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

Sosnovsky, Eugeny

2014-01-01T23:59:59.000Z

49

Generating Reports & Graphs in Portfolio Manager  

Broader source: Energy.gov [DOE]

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

50

Hamilton Decompositions of Graphs with Primitive Complements .  

E-Print Network [OSTI]

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

OZKAN, SIBEL

2007-01-01T23:59:59.000Z

51

Graph algorithms in the titan toolkit.  

SciTech Connect (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

52

Generation of graph-state streams  

E-Print Network [OSTI]

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

Daniel Ballester; Jaeyoon Cho; M. S. Kim

2010-12-08T23:59:59.000Z

53

Some algorithmic results in graph imbeddings  

E-Print Network [OSTI]

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

Joshi, Sanjay

1990-01-01T23:59:59.000Z

54

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

E-Print Network [OSTI]

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

Zaslavsky, Thomas

55

3D Graph Visualization with the Oculus Rift Virtual Graph Reality  

E-Print Network [OSTI]

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

Wismath, Stephen

56

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

E-Print Network [OSTI]

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

Wu, David

57

On the Cohen-Macaulay graphs and girth  

E-Print Network [OSTI]

In this paper we investigate the Cohen-Macaulay property of graphs versus girth. In particular, we classify Cohen-Macaulay graphs of girth at least five and planar Gorenstein graphs of girth four.

Hoang, Do Trong; Trung, Tran Nam

2012-01-01T23:59:59.000Z

58

Reversible micromachining locator  

DOE Patents [OSTI]

This invention provides a device which includes a locator, a kinematic mount positioned on a conventional tooling machine, a part carrier disposed on the locator and a retainer ring. The locator has disposed therein a plurality of steel balls, placed in an equidistant position circumferentially around the locator. The kinematic mount includes a plurality of magnets which are in registry with the steel balls on the locator. In operation, a blank part to be machined is placed between a surface of a locator and the retainer ring (fitting within the part carrier). When the locator (with a blank part to be machined) is coupled to the kinematic mount, the part is thus exposed for the desired machining process. Because the locator is removably attachable to the kinematic mount, it can easily be removed from the mount, reversed, and reinserted onto the mount for additional machining. Further, the locator can likewise be removed from the mount and placed onto another tooling machine having a properly aligned kinematic mount. Because of the unique design and use of magnetic forces of the present invention, positioning errors of less than 0.25 micrometer for each machining process can be achieved. 7 figs.

Salzer, L.J.; Foreman, L.R.

1999-08-31T23:59:59.000Z

59

Reversible micromachining locator  

DOE Patents [OSTI]

This invention provides a device which includes a locator, a kinematic mount positioned on a conventional tooling machine, a part carrier disposed on the locator and a retainer ring. The locator has disposed therein a plurality of steel balls, placed in an equidistant position circumferentially around the locator. The kinematic mount includes a plurality of magnets which are in registry with the steel balls on the locator. In operation, a blank part to be machined is placed between a surface of a locator and the retainer ring (fitting within the part carrier). When the locator (with a blank part to be machined) is coupled to the kinematic mount, the part is thus exposed for the desired machining process. Because the locator is removably attachable to the kinematic mount, it can easily be removed from the mount, reversed, and reinserted onto the mount for additional machining. Further, the locator can likewise be removed from the mount and placed onto another tooling machine having a properly aligned kinematic mount. Because of the unique design and use of magnetic forces of the present invention, positioning errors of less than 0.25 micrometer for each machining process can be achieved.

Salzer, Leander J. (Los Alamos, NM); Foreman, Larry R. (Los Alamos, NM)

1999-01-01T23:59:59.000Z

60

Reversible micromachining locator  

DOE Patents [OSTI]

A locator with a part support is used to hold a part onto the kinematic mount of a tooling machine so that the part can be held in or replaced in exactly the same position relative to the cutting tool for machining different surfaces of the part or for performing different machining operations on the same or different surfaces of the part. The locator has disposed therein a plurality of steel balls placed at equidistant positions around the planar surface of the locator and the kinematic mount has a plurality of magnets which alternate with grooves which accommodate the portions of the steel balls projecting from the locator. The part support holds the part to be machined securely in place in the locator. The locator can be easily detached from the kinematic mount, turned over, and replaced onto the same kinematic mount or another kinematic mount on another tooling machine without removing the part to be machined from the locator so that there is no need to touch or reposition the part within the locator, thereby assuring exact replication of the position of the part in relation to the cutting tool on the tooling machine for each machining operation on the part.

Salzer, Leander J. (Los Almos, NM); Foreman, Larry R. (late of Los Alamos, NM)

2002-01-01T23:59:59.000Z

Note: This page contains sample records for the topic "locations time-concentration graphs" 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

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

E-Print Network [OSTI]

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

Rostock, Universität

62

Graph searching and a generalized parking function  

E-Print Network [OSTI]

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

Kostic, Dimitrije Nenad

2009-05-15T23:59:59.000Z

63

Directed Graphs, Decompositions, and Spatial Linkages  

E-Print Network [OSTI]

The decomposition of a system of constraints into small basic components is an important tool of design and analysis. Specifically, the decomposition of a linkage into minimal components is a central tool of analysis and synthesis of linkages. In this paper we prove that every pinned 3-isostatic (minimally rigid) graph (grounded linkage) has a unique decomposition into minimal strongly connected components (in the sense of directed graphs) which we call 3-Assur graphs. This analysis extends the Assur decompositions of plane linkages previously studied in the mathematical and the mechanical engineering literature. These 3-Assur graphs are the central building blocks for all kinematic linkages in 3-space. They share a number of key combinatorial and geometric properties with the 2-Assur graphs, including an associated lower block-triangular decomposition of the pinned rigidity matrix which provides a format for extending the motion induced by inserting one driver in a bottom Assur linkage to the joints of the e...

Shai, Offer; Whiteley, Walter

2010-01-01T23:59:59.000Z

64

Locating Heat Recovery Opportunities  

E-Print Network [OSTI]

Basic concepts of heat recovery are defined as they apply to the industrial community. Methods for locating, ranking, and developing heat recovery opportunities are presented and explained. The needs for useful heat 'sinks' are emphasized as equal...

Waterland, A. F.

1981-01-01T23:59:59.000Z

65

International land rig locator  

SciTech Connect (OSTI)

Mechanical specifications, ratings, locations, and status are listed for each of the 5,000 contract rotary drilling rigs operated by the more than 700 independent drilling contractors throughout the Free World.

Not Available

1984-03-01T23:59:59.000Z

66

International land rig locator  

SciTech Connect (OSTI)

Mechanical specifications, ratings, locations, and status are listed for each of the 5,000 contract rotary drilling rigs operated by more than 700 independent drilling contractors throughout the Free World.

Not Available

1983-09-01T23:59:59.000Z

67

Location linked information  

E-Print Network [OSTI]

This work builds an infrastructure called Location Linked Information that offers a means to associate digital information with public, physical places. This connection creates a hybrid virtual/physical space, called glean ...

Mankins, Matthew William David, 1975-

2003-01-01T23:59:59.000Z

68

a r r i o r BUILDING# NAME LOCATION BUILDING# NAME LOCATION OTHER BUILDINGS LOCATION SORORITIES LOCATION  

E-Print Network [OSTI]

Admissions Parking Palmer Lake B l a c k W a r r i o r R i v e r BUILDING# NAME LOCATION BUILDING# NAME LOCATION OTHER BUILDINGS LOCATION SORORITIES LOCATION 7046 70127012 1155 10331033 1150 1039 1038

Carver, Jeffrey C.

69

What Energy Functions Can Be Minimized via Graph Cuts?  

E-Print Network [OSTI]

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

Field, David

70

What Energy Functions can be Minimized via Graph Cuts?  

E-Print Network [OSTI]

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

Field, David

71

Attack Graphs for Sensor Placement, Alert Prioritization, and Attack Response  

E-Print Network [OSTI]

1 Attack Graphs for Sensor Placement, Alert Prioritization, and Attack Response Steven Noel of IDS alarms, using attack graph analysis. Our attack graphs predict the various possible ways and attacker exploits provides an attack graph showing all possible paths to critical assets. We then place IDS

Noel, Steven

72

A Note on Hamilton Cycles in Kneser Graphs Ian Shields  

E-Print Network [OSTI]

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

Savage, Carla D.

73

Gibbs Measures and Phase Transitions on Sparse Random Graphs  

E-Print Network [OSTI]

regular graphs . . . . . . . . . . . . . . 87 6.2 Hyper-loops, hypergraphs, cores and a peeling algorithm

Montanari, Annamaria

74

Discrete Applied Mathematics 121 (2002) 139153 NeST graphs  

E-Print Network [OSTI]

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

Hayward, Ryan B.

75

EuroComb 2005 DMTCS proc. AE, 2005, 389--396 Acyclic Coloring of Graphs of Maximum  

E-Print Network [OSTI]

for several families F of graphs such as planar graphs [Bor79], planar graphs with ``large'' girth [BKW99], 1

Fertin, Guillaume

76

Revisiting Interval Graphs for Network Science  

E-Print Network [OSTI]

The vertices of an interval graph represent intervals over a real line where overlapping intervals denote that their corresponding vertices are adjacent. This implies that the vertices are measurable by a metric and there exists a linear structure in the system. The generalization is an embedding of a graph onto a multi-dimensional Euclidean space and it was used by scientists to study the multi-relational complexity of ecology. However the research went out of fashion in the 1980s and was not revisited when Network Science recently expressed interests with multi-relational networks known as multiplexes. This paper studies interval graphs from the perspective of Network Science.

Loe, Chuan Wen

2015-01-01T23:59:59.000Z

77

A role for matrices in graph theory  

E-Print Network [OSTI]

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

McLean, John Patrick

1971-01-01T23:59:59.000Z

78

From graphs to signals and back: Identification of graph structures using spectral analysis  

E-Print Network [OSTI]

Many systems comprising entities in interactions can be represented as graphs, whose structure gives significant insights about how these systems work. Network theory has undergone further developments, in particular in relation to detection of communities in graphs, to catch this structure. Recently, an approach has been proposed to transform a graph into a collection of signals: Using a multidimensional scaling technique on a distance matrix representing relations between vertices of the graph, points in a Euclidean space are obtained and interpreted as signals, indexed by the vertices. In this article, we propose several extensions to this approach, developing a framework to study graph structures using signal processing tools. We first extend the current methodology, enabling us to highlight connections between properties of signals and graph structures, such as communities, regularity or randomness, as well as combinations of those. A robust inverse transformation method is next described, taking into ac...

Hamon, Ronan; Flandrin, Patrick; Robardet, Cťline

2015-01-01T23:59:59.000Z

79

Continuous-time quantum walks on star graphs  

SciTech Connect (OSTI)

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

Salimi, S. [Department of Physics, University of Kurdistan, P.O. Box 66177-15175, Sanandaj (Iran, Islamic Republic of)], E-mail: shsalimi@uok.ac.ir

2009-06-15T23:59:59.000Z

80

Bipartite graph partitioning and data clustering  

SciTech Connect (OSTI)

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

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

2001-05-07T23:59:59.000Z

Note: This page contains sample records for the topic "locations time-concentration graphs" 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 Minimum Rank Problem for Outerplanar Graphs.  

E-Print Network [OSTI]

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

Sinkovic, John Henry

2013-01-01T23:59:59.000Z

82

Minimum rank of graphs that allow loops.  

E-Print Network [OSTI]

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

Mikkelson, Rana C.

2008-01-01T23:59:59.000Z

83

On semidefinite programming bounds for graph bandwidth  

E-Print Network [OSTI]

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

2011-05-24T23:59:59.000Z

84

Graph Implementations for Nonsmooth Convex Programs  

E-Print Network [OSTI]

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

2007-09-07T23:59:59.000Z

85

Forced orientation of graphs Babak Farzad  

E-Print Network [OSTI]

Forced orientation of graphs Babak Farzad Mohammad Mahdian Ebad S. Mahmoodian Amin Saberiß Bardia, USA. (saberi@cc.gatech.edu) ∂ Department of Computer Science, UIUC, Urbana, USA. (sadri@cs.uiuc.edu) 1

Toronto, University of

86

Hamilton Paths in Generalized Petersen Graphs.  

E-Print Network [OSTI]

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

Pensaert, William

2006-01-01T23:59:59.000Z

87

Graph Summarization with Bounded Error Saket Navlakha  

E-Print Network [OSTI]

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

Gruner, Daniel S.

88

Theoretical Computer Science 263 (2001) 235245 www.elsevier.com/locate/tcs  

E-Print Network [OSTI]

), and in a district of the city of Geneva (b). The black zone represents the served area. The paper is organized are discretized on a regular grid, and the cells are computed by a radio wave propagation prediction tool. Fig. 1 to have huge size when many geographic locations are allowed. A smart way to reduce the graph size without

Nielsen, Frank

2001-01-01T23:59:59.000Z

89

Theoretical Computer Science 306 (2003) 339351 www.elsevier.com/locate/tcs  

E-Print Network [OSTI]

of petroleum products. It uses a directed graph G, where arcs represent pipes and nodes represent locations Elsevier B.V. All rights reserved. Keywords: Petroleum; Transportation; Oil pipeline; Complexity; Approximability 1. Introduction Petroleum products are typically transported through pipelines. Pipelines are di

Laber, Eduardo Sany

90

Computer Lab Information Location  

E-Print Network [OSTI]

M340 Computer Lab Information · Location: The computer labs accessible to you are Weber 205 it is recommended that you save your files on a floppy when you are finished. · There is another directory, g:\\m340 to the saved files you have to add the directory to the Matlab path. To do this type addpath g:\\m340

Dangelmayr, Gerhard

91

Accelerating semantic graph databases on commodity clusters  

SciTech Connect (OSTI)

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

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

2013-10-06T23:59:59.000Z

92

2Cosmic Bar Graphs Galaxy Type  

E-Print Network [OSTI]

in the cluster are spirals? Problem 2 ­ Gamma-ray bursts happen about once each day. The bar graph to the right there are 160 total galaxies, the fraction of spirals is 137/160 = 0.86, or equivalently 86%. Problem 2 ­ Gamma-ray2Cosmic Bar Graphs 0 20 40 60 80 100 S E SB I Galaxy Type Number 0 200 400 600 800 1000 FB SB Burst

93

Graph representation of protein free energy landscape  

SciTech Connect (OSTI)

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

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

2013-11-14T23:59:59.000Z

94

Electric current locator  

DOE Patents [OSTI]

The disclosure herein provides an apparatus for location of a quantity of current vectors in an electrical device, where the current vector has a known direction and a known relative magnitude to an input current supplied to the electrical device. Mathematical constants used in Biot-Savart superposition equations are determined for the electrical device, the orientation of the apparatus, and relative magnitude of the current vector and the input current, and the apparatus utilizes magnetic field sensors oriented to a sensing plane to provide current vector location based on the solution of the Biot-Savart superposition equations. Description of required orientations between the apparatus and the electrical device are disclosed and various methods of determining the mathematical constants are presented.

King, Paul E. (Corvallis, OR); Woodside, Charles Rigel (Corvallis, OR)

2012-02-07T23:59:59.000Z

95

ARM - Instrument Location Table  

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

AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel),Feet) Year Jan Feb Mar Apr May Jun Jul(Summary)morphinanInformation InInformation InExplosionAnnouncements MediagovCampaignsListgovInstrumentsLocation Table

96

MadGraph 5 : Going Beyond  

E-Print Network [OSTI]

MadGraph 5 is the new version of the MadGraph matrix element generator, written in the Python programming language. It implements a number of new, efficient algorithms that provide improved performance and functionality in all aspects of the program. It features a new user interface, several new output formats including C++ process libraries for Pythia 8, and full compatibility with FeynRules for new physics models implementation, allowing for event generation for any model that can be written in the form of a Lagrangian. MadGraph 5 builds on the same philosophy as the previous versions, and its design allows it to be used as a collaborative platform where theoretical, phenomenological and simulation projects can be developed and then distributed to the high-energy community. We describe the ideas and the most important developments of the code and illustrate its capabilities through a few simple phenomenological examples.

Johan Alwall; Michel Herquet; Fabio Maltoni; Olivier Mattelaer; Tim Stelzer

2011-06-02T23:59:59.000Z

97

Streaming Graph Computations with a Helpful Advisor  

E-Print Network [OSTI]

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

Cormode, Graham; Thaler, Justin

2010-01-01T23:59:59.000Z

98

Circuit and bond polytopes on series-parallel graphs$  

E-Print Network [OSTI]

Jul 10, 2014 ... M0 = IS, for some star decomposition S of G, and Mi?Ni is a cut of G, for i = 1,..., k. 2. Circuit polytope on series-parallel graphs. Given a graph G†...

2014-07-10T23:59:59.000Z

99

An efficient semidefinite programming relaxation for the graph ...  

E-Print Network [OSTI]

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

2012-08-28T23:59:59.000Z

100

Generating Random Graphs with Large Girth Mohsen Bayati  

E-Print Network [OSTI]

Generating Random Graphs with Large Girth Mohsen Bayati Andrea Montanari Amin Saberi Abstract We; saberi@stanford.edu. 1 #12;free graphs are close to bipartite. We show that our new algorithm guarantees

Saberi, Amin

Note: This page contains sample records for the topic "locations time-concentration graphs" 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

GARNET : a Graphical Attack graph and Reachability Network Evaluation Tool  

E-Print Network [OSTI]

Attack graphs are valuable tools in the assessment of network security, revealing potential attack paths an adversary could use to gain control of network assets. Creating an effective visualization for attack graphs is ...

Williams, Leevar (Leevar Christoff)

2008-01-01T23:59:59.000Z

102

Codes on Graphs: Duality and MacWilliams Identities  

E-Print Network [OSTI]

A conceptual framework involving partition functions of normal factor graphs is introduced, paralleling a similar recent development by Al-Bashabsheh and Mao. The partition functions of dual normal factor graphs are shown ...

Forney, G. David, Jr.

103

Scalable Parallel Algorithms for Massive Scale-free Graphs  

E-Print Network [OSTI]

Efficiently storing and processing massive graph data sets is a challenging problem as researchers seek to leverage ďBig DataĒ to answer next-generation scientific questions. New techniques are required to process large scale-free graphs in shared...

Pearce, Roger Allan

2013-12-05T23:59:59.000Z

104

Math 564 Graph Theory Fall 2008 Instructor Amites Sarkar  

E-Print Network [OSTI]

Math 564 Graph Theory Fall 2008 Instructor Amites Sarkar Text Pearls in Graph Theory (Dover Edition and Fridays, in 216 Bond Hall. My phone number is 650 7569 and my e-mail is amites.sarkar@wwu.edu #12;

Sarkar, Amites

105

Math 564 Graph Theory Fall 2013 Instructor Amites Sarkar  

E-Print Network [OSTI]

Math 564 Graph Theory Fall 2013 Instructor Amites Sarkar Text Modern Graph Theory B¬īela Bollob, Tuesdays, Wednesdays and Fridays, in 216 Bond Hall. My phone number is 650 7569 and my e-mail is amites.sarkar

Sarkar, Amites

106

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

E-Print Network [OSTI]

Agarwal, G., & Kempe, D. (2008). Modularity-maximizing graph communities via mathematical program- ming. The European Physical Journal B - Condensed†...

2012-01-31T23:59:59.000Z

107

Problems of Distance-Regular Graphs Hiroshi Suzuki  

E-Print Network [OSTI]

. Biggs, Algebraic Graph Theory Second Edition, Cambridge U. P., Cambridge 1993. [16] N. L. Biggs, A. G

Xi, Changchang

108

Bose-Einstein condensation on quantum graphs  

E-Print Network [OSTI]

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

Jens Bolte; Joachim Kerner

2014-03-02T23:59:59.000Z

109

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

110

Hamiltonian Cycles on Symmetrical Graphs Carlo H. Squin  

E-Print Network [OSTI]

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

O'Brien, James F.

111

Optimal IDS Sensor Placement And Alert Prioritization Using Attack Graphs  

E-Print Network [OSTI]

1 Optimal IDS Sensor Placement And Alert Prioritization Using Attack Graphs Steven Noel and Sushil optimally place intrusion detection system (IDS) sensors and prioritize IDS alerts using attack graph. The set of all such paths through the network constitutes an attack graph, which we aggregate according

Noel, Steven

112

Improving Attack Graph Visualization through Data Reduction and Attack Grouping  

E-Print Network [OSTI]

Improving Attack Graph Visualization through Data Reduction and Attack Grouping John Homer1 Laboratory, USA Abstract. Various tools exist to analyze enterprise network systems and to produce attack graphs detailing how attackers might penetrate into the system. These attack graphs, however, are often

Ou, Xinming "Simon"

113

Compatible Hamilton cycles in Dirac graphs Michael Krivelevich  

E-Print Network [OSTI]

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

Krivelevich, Michael

114

Infinite Hamilton Cycles in Squares of Locally Finite Graphs  

E-Print Network [OSTI]

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

Diestel, Reinhard

115

Robust Self-assembly of Graphs Stanislav Angelov1  

E-Print Network [OSTI]

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

Pennsylvania, University of

116

Simultaneous Segmentation and Filtering via Reduced Graph Cuts  

E-Print Network [OSTI]

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

Malgouyres, François

117

Cellular Algebras and Graph Invariants Based on Quantum Walks  

E-Print Network [OSTI]

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

Jamie Smith

2011-03-01T23:59:59.000Z

118

Inference of Edge Replacement Graph Grammars Jacek P. Kukluk1  

E-Print Network [OSTI]

Inference of Edge Replacement Graph Grammars Jacek P. Kukluk1 , Lawrence B. Holder2 , and Diane J@eecs.wsu.edu Abstract We describe an algorithm and experiments for inference of edge replacement graph grammars for inference of Node Replacement Recursive Graph Grammars [7]. In this paper we describe an approach

Holder, Lawrence B.

119

Bicycles and Left-Right Tours in Locally Finite Graphs  

E-Print Network [OSTI]

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

Diestel, Reinhard

120

Dominating Set on Bipartite Graphs Mathieu Liedloff  

E-Print Network [OSTI]

.5263n ) time algorithm using polynomial space and an O(1.5137n ) time algorithm using exponential space ) time and polynomial space algorithm, and an O(1.5063n ) time algorithm that uses exponential space. We]). Known results. Given a graph G = (V, E), a subset D V is a dominating set of G if every vertex of V

Liedloff, Mathieu

Note: This page contains sample records for the topic "locations time-concentration graphs" 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

Optimizing Path Query Performance: Graph Clustering Strategies  

E-Print Network [OSTI]

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

122

Graph-Theoretic Scagnostics Leland Wilkinson  

E-Print Network [OSTI]

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

Grossman, Robert

123

Graph Grammars for Self Assembling Robotic Systems  

E-Print Network [OSTI]

Graph Grammars for Self Assembling Robotic Systems Eric Klavins Electrical Engineering University numbers of objects so that they perform some global task. Nevertheless, there are examples of sophisticated machines, such as the ribosome or the mechanical motor in the bacterial flagellum, that seem

Ghrist, Robert W.

124

NEST REPRESENTATIONS OF DIRECTED GRAPH ALGEBRAS  

E-Print Network [OSTI]

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

Katsoulis, Elias G.

125

The Web Graph of a Tourism System  

E-Print Network [OSTI]

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

Baggio, R

2006-01-01T23:59:59.000Z

126

Flexible Layered Authentication Graph for Multimedia Streaming  

E-Print Network [OSTI]

With the increasing demand on multimedia streaming in more and more applications, security issues such as integrity side, lost packets are dropped from the graph and a packet is verifiable if it has a path and all subsequent packets become not verifiable. EMSS [4] makes a great improvement by building multiple

Sun, Qibin

127

Lessons 6 Graphs of Functional Models  

E-Print Network [OSTI]

Aug 30, 2013 ... One of the problems (#1) illustrates the principle of supply and demand, ... All of the problems involve building up a function model (see Lesson 5) ... Granite Management rents out several apartment complexes in the .... Side. 0.001 per cm2. Bottom. 0.005 per cm2. Lessons 6 Graphs of Functional Models.

2013-08-30T23:59:59.000Z

128

Spring loaded locator pin assembly  

DOE Patents [OSTI]

This invention deals with spring loaded locator pins. Locator pins are sometimes referred to as captured pins. This is a mechanism which locks two items together with the pin that is spring loaded so that it drops into a locator hole on the work piece.

Groll, Todd A. (Idaho Falls, ID); White, James P. (Pocatelo, ID)

1998-01-01T23:59:59.000Z

129

Spring loaded locator pin assembly  

DOE Patents [OSTI]

This invention deals with spring loaded locator pins. Locator pins are sometimes referred to as captured pins. This is a mechanism which locks two items together with the pin that is spring loaded so that it drops into a locator hole on the work piece. 5 figs.

Groll, T.A.; White, J.P.

1998-03-03T23:59:59.000Z

130

Line graphs e contrazioni: un approccio rigoroso alla space syntax  

E-Print Network [OSTI]

The methods of the space syntax have been the subject of extensive discussion, and several techniques to identify the axis lines have been proposed. The space syntax can be represented in terms of line graph, a graphs defined on the edge of a given primary graph. By means of the line graph algorithms, a system of labels defined on the edges of the primary graph is transformed into a system of labels on the vertices of the line graph. The contraction of adjacent edges with the same label allows to build a more general graph than those generated with the methods of the space syntax. By means of the functions implemented in Mathematica is therefore possible to redefine the space syntax on any system of urban quantities (labels) and reproduce the results of the axial lines as a special case. As an example is discussed a possible application of the method to the urban noise analysis.

D'Autilia, Roberto

2015-01-01T23:59:59.000Z

131

Data-flow graphs as a model of parallel complexity  

SciTech Connect (OSTI)

A new model of parallel computation based on data-flow graphs is introduced, which is specifically oriented towards complexity theory. Data-flow graphs are capable of illustrating properties of synchronous, asynchronous, and nondeterministic computations. Sufficient conditions are derived for asynchronous data-flow graphs to be determinate, i.e., all possible computations are finite and yield the same result. For determinate graphs, it is shown that the synchronous computation is as fast as any asynchronous computation. An algorithm is presented that transforms a nondeterminate data-flow graphs into a synchronous determinate one. The basic data-flow graph idea is extended into a model with greater potential parallelism, called the Uniform Data Flow Graph Family (UDFGF) Model. It is proved that time and space for the UDFGF model are polynomially related to reversal and space for the Turing Machine model, in both the deterministic and nondeterministic cases. In addition to forming an abstract computational model, data-flow graphs are parallel programs for real multiprocessors. Given a data flow graph program and a multiprocessor, each node of the graph must be assigned to one of the processors. It is proved that this problem is intractable, and a practical algorithm to find approximate solutions for it is presented.

Campbell, M.L.

1987-01-01T23:59:59.000Z

132

Statistical Properties of Quantum Graph Spectra  

E-Print Network [OSTI]

A general analytical approach to the statistical description of quantum graph spectra based on the exact periodic orbit expansions of quantum levels is discussed. The exact and approximate expressions obtained in \\cite{Anima} for the probability distribution functions using the spectral hierarchy method are analyzed. In addition, the mechanism of appearance of the universal statistical properties of spectral fluctuations of quantum-chaotic systems is considered in terms of the semiclassical theory of periodic orbits.

Yu. Dabaghian

2006-08-09T23:59:59.000Z

133

Analysis of beacon triangulation in random graphs  

E-Print Network [OSTI]

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 53 viii LIST OF TABLES TABLE Page I Beacons needed for different n to avoid conflicts . . . . . . . . . . . . 13 II Beacons needed for different n to make pu(n) equal to one for lambda = 10 from our model and simulation... . . . . . . . . . . . . . . . . . 25 III Beacons needed for different n to make pu(n) equal to one for lambda = 10 from our simulation data for G(n,p) graph and uniform distribution case . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 26 IV Beacons needed for different n...

Kakarlapudi, Geetha

2005-02-17T23:59:59.000Z

134

k-Boson Quantum Walks Do Not Distinguish Arbitrary Graphs  

E-Print Network [OSTI]

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

Jamie Smith

2010-04-01T23:59:59.000Z

135

Dynamics of entanglement of bosonic modes on symmetric graphs  

E-Print Network [OSTI]

We investigate the dynamics of an initially disentangled Gaussian state on a general finite symmetric graph. As concrete examples we obtain properties of this dynamics on mean field graphs of arbitrary sizes. In the same way that chains can be used for transmitting entanglement by their natural dynamics, these graphs can be used to store entanglement. We also consider two kinds of regular polyhedron which show interesting features of entanglement sharing.

F. Ghahhari; V. Karimipour; R. Shahrokhshahi

2006-11-23T23:59:59.000Z

136

Mobile Alternative Fueling Station Locator  

SciTech Connect (OSTI)

The Department of Energy's Alternative Fueling Station Locator is available on-the-go via cell phones, BlackBerrys, or other personal handheld devices. The mobile locator allows users to find the five closest biodiesel, electricity, E85, hydrogen, natural gas, and propane fueling sites using Google technology.

Not Available

2009-04-01T23:59:59.000Z

137

Independent set problems and odd-hole-preserving graph reductions  

E-Print Network [OSTI]

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

Warren, Jeffrey Scott

2009-05-15T23:59:59.000Z

138

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

E-Print Network [OSTI]

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

2006-04-27T23:59:59.000Z

139

Generating Random Graphs with Large Girth Mohsen Bayati  

E-Print Network [OSTI]

Generating Random Graphs with Large Girth Mohsen Bayati Andrea Montanari Amin Saberi Abstract We for Computational and Mathematical Engineering, Stanford University; saberi@stanford.edu. knowledge

Montanari, Annamaria

140

A notable family of entire intrinsic minimal graph...  

E-Print Network [OSTI]

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

2006-09-09T23:59:59.000Z

Note: This page contains sample records for the topic "locations time-concentration graphs" 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

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

E-Print Network [OSTI]

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

Kepner, Jeremy

142

Visualization Graph | OpenEI Community  

Open Energy Info (EERE)

AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on Office of InspectorConcentrating SolarElectric Coop,Save EnergyGlouster,Winside, Nebraska (UtilityVirginiaNoGraph Home

143

Location-aware active signage  

E-Print Network [OSTI]

Three-dimensional route maps, which depict a path from one location to another, can be powerful tools for visualizing and communicating directions. This thesis presents a client-server architecture for generating and ...

Nichols, Patrick James, 1981-

2004-01-01T23:59:59.000Z

144

Algorithms to Compute Minimum Cycle Basis in Directed Graphs #  

E-Print Network [OSTI]

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

Mehlhorn, Kurt

145

Deciding Timed Bisimulation for Timed Automata Using Zone Valuation Graph  

E-Print Network [OSTI]

Deciding Timed Bisimulation for Timed Automata Using Zone Valuation Graph Shibashis Guha, Chinmay was first proved to be decidable for timed automata by Cerans using a product construction method on region graph. Several other methods have been proposed in the literature since then for decid- ing timed

Prasad, Sanjiva

146

Rank Synopses for Efficient Time Travel on the Web Graph  

E-Print Network [OSTI]

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

147

Semidefinite programming and eigenvalue bounds for the graph ...  

E-Print Network [OSTI]

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

2013-11-26T23:59:59.000Z

148

ADAGE: A software package for analyzing graph evolution  

E-Print Network [OSTI]

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

149

MATLAB Tutorial Getting Started with Calculations, Graphing and Programming  

E-Print Network [OSTI]

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

Weinberger, Hans

150

Understanding Complex Network Attack Graphs through Clustered Adjacency Matrices  

E-Print Network [OSTI]

Understanding Complex Network Attack Graphs through Clustered Adjacency Matrices Steven Noel}@gmu.edu Abstract We apply adjacency matrix clustering to network attack graphs for attack correlation, prediction, and hypothesizing. We self-multiply the clustered adjacency matrices to show attacker reachability across

Noel, Steven

151

Improving Attack Graph Visualization through Data Reduction and Attack Grouping  

SciTech Connect (OSTI)

Various tools exist to analyze enterprise network systems and to produce attack graphs detailing how attackers might penetrate into the system. These attack graphs, however, are often complex and difficult to comprehend fully, and a human user may find it problematic to reach appropriate configuration decisions. This paper presents methodologies that can 1) automatically identify portions of an attack graph that do not help a user to understand the core security problems and so can be trimmed, and 2) automatically group similar attack steps as virtual nodes in a model of the network topology, to immediately increase the understandability of the data. We believe both methods are important steps toward improving visualization of attack graphs to make them more useful in configuration management for large enterprise networks. We implemented our methods using one of the existing attack-graph toolkits. Initial experimentation shows that the proposed approaches can 1) significantly reduce the complexity of attack graphs by trimming a large portion of the graph that is not needed for a user to understand the security problem, and 2) significantly increase the accessibility and understandability of the data presented in the attack graph by clearly showing, within a generated visualization of the network topology, the number and type of potential attacks to which each host is exposed.

John Homer; Ashok Varikuti; Xinming Ou; Miles A. McQueen

2008-09-01T23:59:59.000Z

152

Scaling Semantic Graph Databases in Size and Performance  

SciTech Connect (OSTI)

In this paper we present SGEM, a full software system for accelerating large-scale semantic graph databases on commodity clusters. Unlike current approaches, SGEM addresses semantic graph databases by only employing graph methods at all the levels of the stack. On one hand, this allows exploiting the space efficiency of graph data structures and the inherent parallelism of graph algorithms. These features adapt well to the increasing system memory and core counts of modern commodity clusters. On the other hand, however, these systems are optimized for regular computation and batched data transfers, while graph methods usually are irregular and generate fine-grained data accesses with poor spatial and temporal locality. Our framework comprises a SPARQL to data parallel C compiler, a library of parallel graph methods and a custom, multithreaded runtime system. We introduce our stack, motivate its advantages with respect to other solutions and show how we solved the challenges posed by irregular behaviors. We present the result of our software stack on the Berlin SPARQL benchmarks with datasets up to 10 billion triples (a triple corresponds to a graph edge), demonstrating scaling in dataset size and in performance as more nodes are added to the cluster.

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

2014-08-06T23:59:59.000Z

153

A Surface Reconstruction Method Using Global Graph Cut Optimization  

E-Print Network [OSTI]

SAR (China) 1 sparis@csail.mit.edu -- Sylvain Paris has worked on this project during his PhD at ARTIS calibrated images mainly has been approached using local methods, either as a continuous optimization problem of a pixel. Index Terms Graph flow, graph cut, 3D reconstruction from calibrated cameras, discontinuities

Paris, Sylvain

154

A Surface Reconstruction Method Using Global Graph Cut Optimization  

E-Print Network [OSTI]

SAR (China) 1sparis@csail.mit.edu ­ Sylvain Paris has worked on this project during his PhD at ARTIS calibrated images mainly has been approached using local methods, either as a continuous optimization problem of a pixel. Index Terms Graph flow, graph cut, 3D reconstruction from calibrated cameras, discontinuities

Paris, Sylvain

155

A Surface Reconstruction Method Using Global Graph Cut Optimization  

E-Print Network [OSTI]

SAR (China) 1sparis@csail.mit.edu ­ Sylvain Paris has worked on this project during his PhD at ARTIS reconstruction from multiple calibrated images mainly has been approached using local methods, either to 1/10th of a pixel. Index Terms Graph flow, graph cut, 3D reconstruction from calibrated cameras

Paris-Sud XI, Université de

156

Resource Minimized Static Mapping and Dynamic Scheduling of SDF Graphs  

E-Print Network [OSTI]

Resource Minimized Static Mapping and Dynamic Scheduling of SDF Graphs Jinwoo Kim, Tae-ho Shin than the previous approaches. Keywords-Mapping, buffer size minimization, SDF graph, dynamic scheduling a model-based approach based on SDF (synchronous data flow) model. Since the parallelism of an application

Ha, Soonhoi

157

Synthesis of Parallel Hardware Implementations from Synchronous Dataflow Graph Specifications  

E-Print Network [OSTI]

of automated register­transfer level (RTL) VHDL code generation from synchronous dataflow (SDF) graph for mapping applications specified in SDF to parallel digital hardware implementations. Two styles synthesis from SDF graphs is presented. In order to minimize cost while meeting performance require­ ments

158

Including Blind Students in Computer Science Through Access to Graphs  

E-Print Network [OSTI]

Including Blind Students in Computer Science Through Access to Graphs Suzanne Balik, Sean Mealin SKetching tool, GSK, to provide blind and sighted people with a means to create, examine, and share graphs (node-link diagrams) in real-time. GSK proved very effective for one blind computer science student

Young, R. Michael

159

Video Denoising and Simplification Via Discrete Regularization on Graphs  

E-Print Network [OSTI]

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

Paris-Sud XI, Universitť de

160

VIDEO SUMMARIZATION BY VIDEO STRUCTURE ANALYSIS AND GRAPH OPTIMIZATION  

E-Print Network [OSTI]

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

King, Kuo Chin Irwin

Note: This page contains sample records for the topic "locations time-concentration graphs" 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

Groups generated by bounded automata and their schreier graphs  

E-Print Network [OSTI]

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

Bondarenko, Ievgen

2009-05-15T23:59:59.000Z

162

Bicyclic graphs with exactly two main signless Laplacian eigenvalues  

E-Print Network [OSTI]

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

Huang, He

2012-01-01T23:59:59.000Z

163

Motorcycle Graphs and Straight Skeletons Siu-Wing Cheng  

E-Print Network [OSTI]

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

Vigneron, Antoine

164

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

E-Print Network [OSTI]

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

2013-08-08T23:59:59.000Z

165

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

E-Print Network [OSTI]

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

166

Synchronized sampling improves fault location  

SciTech Connect (OSTI)

Transmission line faults must be located accurately to allow maintenance crews to arrive at the scene and repair the faulted section as soon as possible. Rugged terrain and geographical layout cause some sections of power transmission lines to be difficult to reach. In the past, a variety of fault location algorithms were introduced as either an add-on feature in protective relays or stand-alone implementation in fault locators. In both cases, the measurements of current and voltages were taken at one terminal of a transmission line only. Under such conditions, it may become difficult to determine the fault location accurately, since data from other transmission line ends are required for more precise computations. In the absence of data from the other end, existing algorithms have accuracy problems under several circumstances, such as varying switching and loading conditions, fault infeed from the other end, and random value of fault resistance. Most of the one-end algorithms were based on estimation of voltage and current phasors. The need to estimate phasors introduces additional difficulty in high-speed tripping situations where the algorithms may not be fast enough in determining fault location accurately before the current signals disappear due to the relay operation and breaker opening. This article introduces a unique concept of high-speed fault location that can be implemented either as a simple add-on to the digital fault recorders (DFRs) or as a stand-alone new relaying function. This advanced concept is based on the use of voltage and current samples that are synchronously taken at both ends of a transmission line. This sampling technique can be made readily available in some new DFR designs incorporating receivers for accurate sampling clock synchronization using the satellite Global Positioning System (GPS).

Kezunovic, M. [Texas A and M Univ., College Station, TX (United States)] [Texas A and M Univ., College Station, TX (United States); Perunicic, B. [Lamar Univ., Beaumont, TX (United States)] [Lamar Univ., Beaumont, TX (United States)

1995-04-01T23:59:59.000Z

167

Location logistics of industrial facilities  

E-Print Network [OSTI]

of company intent1ons is not made at the correct time and in the correct manner. 6. Recommend Best Areas for Further Invest1 ations. Once the on-site evaluations have been completed, the 11st of possibilities is reduced still further and only the best... location and site selection. This data was gathered through library research, atten- dance of various industr1al development conferences, sol1citation of mater1als from individuals currently involved with industrial facil1ties location, and various...

Hammack, William Eugene

1981-01-01T23:59:59.000Z

168

Boston, Massachusetts Location: Boston, MA  

E-Print Network [OSTI]

-recovery ventilation and water-source heat pumps Each unit has fresh air ducted independently. Each residence is warmed by a heat pump that taps the Trigen Energy Corporation steam lines that run underneath the street. #12;WallsBoston, Massachusetts #12;Location: Boston, MA Building type(s): Multi-unit residential, Retail 350

Prevedouros, Panos D.

169

Building Address Locations -Assumes entire  

E-Print Network [OSTI]

Building Address Locations - Assumes entire building unless noted Designation Submit through* 560, 4 BU Crosstown Center 801 Massachusetts Ave Floor 1, 2 BMC BCD Building 800 Harrison Avenue BCD BMC Biosquare III 670 Albany Floors 2, 3, 6, 7 BMC Biosquare III 670 Albany Floors 1, 4, 5, 8 BU Building

Guenther, Frank

170

Well performance graph simplifies field calculations  

SciTech Connect (OSTI)

Graphic Methods are widely employed in order to understand overall well behavior using only surface parameters. The authors propose a new graphic method, used successfully by Agip for oil and gas wells in Italy, Libya, Nigeria and Tunisia. The well performance graph helps solve many production problems, including estimation of: inflow performance relationship; causes of rate decline throughout well life; and production rate and bottomhole flowing pressure for various pressures upstream of the surface choke, and vice-versa. This method differs from others by using flow behavior through the choke for both critical and subcritical conditions. Equations describing flow through the formation, string and surface choke are also used. Results are quite reliable when these theoretical equations are calibrated with field data, either from the well concerned or from nearby wells producing the same fluid. This article describes the technique as it applies to oil wells. The methodology for gas wells is similar.

De Ghetto, G.

1987-05-01T23:59:59.000Z

171

Community detection in directed acyclic graphs  

E-Print Network [OSTI]

Some temporal networks, most notably citation networks, are naturally represented as directed acyclic graphs (DAGs). To detect communities in DAGs, we propose a modularity for DAGs by defining an appropriate null model (i.e., randomized network) respecting the order of nodes. We implement a spectral method to approximately maximize the proposed modularity measure and test the method on citation networks and other DAGs. We find that the attained values of the modularity for DAGs are similar for partitions that we obtain by maximizing the proposed modularity (designed for DAGs), the modularity for undirected networks and that for general directed networks. In other words, if we neglect the order imposed on nodes (and the direction of links) in a given DAG and maximize the conventional modularity measure, the obtained partition is close to the optimal one in the sense of the modularity for DAGs.

Speidel, Leo; Masuda, Naoki

2015-01-01T23:59:59.000Z

172

Efficient broadcast on random geometric graphs  

SciTech Connect (OSTI)

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

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

2009-01-01T23:59:59.000Z

173

Bicyclic graphs with maximal revised Szeged index  

E-Print Network [OSTI]

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

Li, Xueliang

2011-01-01T23:59:59.000Z

174

THE MATCHING ENERGY OF A GRAPH IVAN GUTMAN AND STEPHAN WAGNER  

E-Print Network [OSTI]

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

Wagner, Stephan

175

Embeddings of Cubic Halin Graphs A Surface-by-Surface Inventory  

E-Print Network [OSTI]

Embeddings of Cubic Halin Graphs A Surface-by-Surface Inventory Jonathan L. Gross Columbia@cs.columbia.edu; http://www.cs.columbia.edu/gross/. 1 #12;Embeddings of Cubic Halin Graphs: An Inventory 2 1 graph for a 14-vertex tree with 8 leaves. #12;Embeddings of Cubic Halin Graphs: An Inventory 3

Gross, Jonathan L.

176

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

E-Print Network [OSTI]

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

Paris-Sud XI, Université de

177

Geodesic Distance in Planar Graphs: An Integrable Approach  

E-Print Network [OSTI]

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

P. Di Francesco

2005-06-27T23:59:59.000Z

178

The Graph Laplacian and the Dynamics of Complex Networks  

SciTech Connect (OSTI)

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

Thulasidasan, Sunil [Los Alamos National Laboratory

2012-06-11T23:59:59.000Z

179

Diamond graphs and super-reflexivity William B. Johnson  

E-Print Network [OSTI]

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

Johnson, William B.

180

Kron Reduction of Graphs with Applications to Electrical Networks  

E-Print Network [OSTI]

Consider a weighted and undirected graph, possibly with self-loops, and its corresponding Laplacian matrix, possibly augmented with additional diagonal elements corresponding to the self-loops. The Kron reduction of this graph is again a graph whose Laplacian matrix is obtained by the Schur complement of the original Laplacian matrix with respect to a subset of nodes. The Kron reduction process is ubiquitous in classic circuit theory and in related disciplines such as electrical impedance tomography, smart grid monitoring, transient stability assessment in power networks, or analysis and simulation of induction motors and power electronics. More general applications of Kron reduction occur in sparse matrix algorithms, multi-grid solvers, finite--element analysis, and Markov chains. The Schur complement of a Laplacian matrix and related concepts have also been studied under different names and as purely theoretic problems in the literature on linear algebra. In this paper we propose a general graph-theoretic f...

Dorfler, Florian

2011-01-01T23:59:59.000Z

Note: This page contains sample records for the topic "locations time-concentration graphs" 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

Drawing a Graph in a Hypercube David R. Wood  

E-Print Network [OSTI]

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

Wood, David R.

182

Drawing a Graph in a Hypercube David R. Wood  

E-Print Network [OSTI]

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

Wood, David R.

183

Exact Solution of Graph Coloring Problems via Constraint ...  

E-Print Network [OSTI]

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

2011-09-21T23:59:59.000Z

184

New Lower Bounds on the Stability Number of a Graph  

E-Print Network [OSTI]

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

2007-06-27T23:59:59.000Z

185

The Asymmetric Traveling Salesman Problem on Graphs with Bounded Genus  

E-Print Network [OSTI]

Saberi Abstract We give a constant factor approximation algorithm for the asymmetric traveling salesman:{shayan, saberi}@stanford.edu. 1 #12;Thin trees were first defined in the graph embedding literature in an attempt

Saberi, Amin

186

Random Walks with Lookahead in Power Law Random Graphs  

E-Print Network [OSTI]

1 Random Walks with Lookahead in Power Law Random Graphs Milena Mihail Amin Saberi Prasad Tetali Georgia Institute of Technology Email: mihail, saberi° @cc.gatech.edu tetali@math.cc.gatech.edu Abstract

Mihail, Milena

187

Confluence in Data Reduction: Bridging Graph Transformation and Kernelization  

E-Print Network [OSTI]

Ermel Falk H¨uffner Rolf Niedermeier Olga Runge Institut f¨ur Softwaretechnik und Theoretische of critical pair analysis from graph transformation theory, supported by the AGG software tool. These results

Wichmann, Felix

188

Advanced Vulnerability Analysis and Intrusion Detection Through Predictive Attack Graphs  

E-Print Network [OSTI]

Advanced Vulnerability Analysis and Intrusion Detection Through Predictive Attack Graphs Steven, without considering how they contribute to overall attack risk. Similarly, intrusion alarms are logged threats, complexity of security data, and network growth. Our approach to network defense applies attack

Noel, Steven

189

Modeling modern network attacks and countermeasures using attack graphs  

E-Print Network [OSTI]

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

Ingols, Kyle W.

190

Fracture and Fragmentation of Simplicial Finite Elements Meshes using Graphs  

SciTech Connect (OSTI)

An approach for the topological representation of simplicial finite element meshes as graphs is presented. It is shown that by using a graph, the topological changes induced by fracture reduce to a few, local kernel operations. The performance of the graph representation is demonstrated and analyzed, using as reference the 3D fracture algorithm by Pandolfi and Ortiz [22]. It is shown that the graph representation initializes in O(N{sub E}{sup 1.1}) time and fractures in O(N{sub I}{sup 1.0}) time, while the reference implementation requires O(N{sub E}{sup 2.1}) time to initialize and O(N{sub I}{sup 1.9}) time to fracture, where NE is the number of elements in the mesh and N{sub I} is the number of interfaces to fracture.

Mota, A; Knap, J; Ortiz, M

2006-10-18T23:59:59.000Z

191

Local computation algorithms for graphs of non-constant degrees  

E-Print Network [OSTI]

In the model of local computation algorithms (LCAs), we aim to compute the queried part of the output by examining only a small (sublinear) portion of the input. Many recently developed LCAs on graph problems achieve time ...

Yodpinyanee, Anak

2014-01-01T23:59:59.000Z

192

Parallel Algorithms for Graph Optimization using Tree Decompositions  

SciTech Connect (OSTI)

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

193

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

E-Print Network [OSTI]

Oct 27, 2010 ... 1. Introduction. Geometric representations of graphs is a beautiful area where combina- ..... We shall use the following construction to get hypersphere ...... This is not surprising, as SDP duality theory is more complex than LP.

Marcel K. de Carli Silva and Levent Tuncel

2011-08-06T23:59:59.000Z

194

Technology Portfolio Planning by Weighted Graph Analysis of System Architectures  

E-Print Network [OSTI]

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

de Weck, Olivier L.

195

Ranking Outlier Nodes in Subspaces of Attributed Graphs  

E-Print Network [OSTI]

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

Antwerpen, Universiteit

196

How are Feynman graphs resumed by the Loop Vertex Expansion?  

E-Print Network [OSTI]

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

Vincent Rivasseau; Zhituo Wang

2010-06-23T23:59:59.000Z

197

Decoding linear codes via optimization and graph-based techniques  

E-Print Network [OSTI]

2.2.1 Linear Codes on1.1.2 Graph-Based Codes 1.2 Dissertation Overview . . .versus the length of the code for (3,6)-regular LDPC codes (

Taghavi, Mohammad H.

2008-01-01T23:59:59.000Z

198

MacWilliams identities for codes on graphs  

E-Print Network [OSTI]

The MacWilliams identity for linear time-invariant convolutional codes that has recently been found by Gluesing-Luerssen and Schneider is proved concisely, and generalized to arbitrary group codes on graphs. A similar ...

Forney, G. David, Jr.

199

On the limiting absorption principle and spectra of quantum graphs  

E-Print Network [OSTI]

The main result of the article is validity of the limiting absorption principle and thus absence of the singular continuous spectrum for compact quantum graphs with several infinite leads attached. The technique used involves Dirichlet-to-Neumann operators.

Beng-Seong Ong

2005-10-10T23:59:59.000Z

200

Site Location of Development Act (Maine)  

Broader source: Energy.gov [DOE]

The Site Location of Development Act regulates the locations chosen for state, municipal, quasi-municipal, educational, charitable, commercial and industrial developments with respect to the...

Note: This page contains sample records for the topic "locations time-concentration graphs" 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

Persistent Uniform Resource Locators (PURLs) | Scientific and...  

Office of Scientific and Technical Information (OSTI)

Locators (PURLs) Print page Print page PURLs (Persistent Uniform Resource Locators) are Web addresses that act as permanent identifiers in the face of a dynamic and changing Web...

202

Energy Department Launches Alternative Fueling Station Locator...  

Broader source: Energy.gov (indexed) [DOE]

Launches Alternative Fueling Station Locator App Energy Department Launches Alternative Fueling Station Locator App November 7, 2013 - 11:16am Addthis As part of the Obama...

203

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

E-Print Network [OSTI]

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

Paris-Sud XI, Université de

204

LOCATION: Johnson County Sheriff's Office  

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

AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel),Feet) Year Jan Feb Mar Apr May JunDatastreamsmmcrcalgovInstrumentsruc DocumentationP-SeriesFlickrinformationPostdocs &JeffIntensitySurfaceLOCATION: Johnson County

205

Ombuds Office Location & Hours  

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

AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel),Feet) Year Jan Feb Mar Apr May JunDatastreamsmmcrcalgovInstrumentsrucLas Conchas recoveryLaboratorySpeeding access1 TechnicalOil inventories inOmbuds Office Location

206

Multicoloured Random Graphs: The Random Dynamics Program  

E-Print Network [OSTI]

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

Sam Tarzi

2014-07-15T23:59:59.000Z

207

Pauli graph and finite projective lines/geometries  

E-Print Network [OSTI]

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

Michel R. P. Planat; Metod Saniga

2007-03-16T23:59:59.000Z

208

Kron Reduction of Graphs with Applications to Electrical Networks  

E-Print Network [OSTI]

Consider a weighted and undirected graph, possibly with self-loops, and its corresponding Laplacian matrix, possibly augmented with additional diagonal elements corresponding to the self-loops. The Kron reduction of this graph is again a graph whose Laplacian matrix is obtained by the Schur complement of the original Laplacian matrix with respect to a subset of nodes. The Kron reduction process is ubiquitous in classic circuit theory and in related disciplines such as electrical impedance tomography, smart grid monitoring, transient stability assessment in power networks, or analysis and simulation of induction motors and power electronics. More general applications of Kron reduction occur in sparse matrix algorithms, multi-grid solvers, finite--element analysis, and Markov chains. The Schur complement of a Laplacian matrix and related concepts have also been studied under different names and as purely theoretic problems in the literature on linear algebra. In this paper we propose a general graph-theoretic framework for Kron reduction that leads to novel and deep insights both on the mathematical and the physical side. We show the applicability of our framework to various practical problem setups arising in engineering applications and computation. Furthermore, we provide a comprehensive and detailed graph-theoretic analysis of the Kron reduction process encompassing topological, algebraic, spectral, resistive, and sensitivity analyses. Throughout our theoretic elaborations we especially emphasize the practical applicability of our results.

Florian Dorfler; Francesco Bullo

2011-02-15T23:59:59.000Z

209

A graph-based system for network-vulnerability analysis  

SciTech Connect (OSTI)

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

Swiler, L.P.; Phillips, C.

1998-06-01T23:59:59.000Z

210

Quantum ergodicity for graphs related to interval maps  

E-Print Network [OSTI]

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

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

2006-07-07T23:59:59.000Z

211

Mining Large Heterogeneous Graphs using Cray s Urika  

SciTech Connect (OSTI)

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

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

2013-01-01T23:59:59.000Z

212

Semi-classical measures on Quantum graphs and the Gau map of the determinant manifold  

E-Print Network [OSTI]

believed that QE does not hold in general for a FIXED quantum graph. This is proved for star graphs in [BKW to what people do in several papers like [BG00, BKW04, BW08, Ba12, BB13]. Let

Recanati, Catherine

213

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

E-Print Network [OSTI]

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

Mousavi, Mohammad

214

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

E-Print Network [OSTI]

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

Mousavi, Mohammad

215

Random intersection graphs and their applications in security, wireless communication, and social networks  

E-Print Network [OSTI]

Random intersection graphs have received much interest and been used in diverse applications. They are naturally induced in modeling secure sensor networks under random key predistribution schemes, as well as in modeling the topologies of social networks including common-interest networks, collaboration networks, and actor networks. Simply put, a random intersection graph is constructed by assigning each node a set of items in some random manner and then putting an edge between any two nodes that share a certain number of items. Broadly speaking, our work is about analyzing random intersection graphs, and models generated by composing it with other random graph models including random geometric graphs and Erd\\H{o}s-R\\'enyi graphs. These compositional models are introduced to capture the characteristics of various complex natural or man-made networks more accurately than the existing models in the literature. For random intersection graphs and their compositions with other random graphs, we study properties su...

Zhao, Jun; Gligor, Virgil

2015-01-01T23:59:59.000Z

216

Math 497E/564 Graph Theory Winter 2012 Instructor Amites Sarkar  

E-Print Network [OSTI]

Math 497E/564 Graph Theory Winter 2012 Instructor Amites Sarkar Text Modern Graph Theory B, in 216 Bond Hall. My phone number is 650 7569 and my e-mail is amites.sarkar@wwu.edu #12;

Sarkar, Amites

217

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

E-Print Network [OSTI]

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

J. M. Harrison; K. Kirsten

2010-03-16T23:59:59.000Z

218

Highly Connected Random Geometric Graphs Paul Balister #+ Bela Bollobas +# Amites Sarkar + Mark Walters #  

E-Print Network [OSTI]

Highly Connected Random Geometric Graphs Paul Balister #+ B‚??ela Bollob‚??as +#¬ß Amites Sarkar +¬∂ Mark

Banaji,. Murad

219

Bounds for mixing time of quantum walks on finite graphs  

E-Print Network [OSTI]

Several inequalities are proved for the mixing time of discrete-time quantum walks on finite graphs. The mixing time is defined differently than in Aharonov, Ambainis, Kempe and Vazirani (2001) and it is found that for particular examples of walks on a cycle, a hypercube and a complete graph, quantum walks provide no speed-up in mixing over the classical counterparts. In addition, non-unitary quantum walks (i.e., walks with decoherence) are considered and a criterion for their convergence to the unique stationary distribution is derived.

Vladislav Kargin

2010-07-21T23:59:59.000Z

220

Bifurcations of mutually coupled equations in random graphs  

E-Print Network [OSTI]

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

Eduardo Garibaldi; Tiago Pereira

2014-09-19T23:59:59.000Z

Note: This page contains sample records for the topic "locations time-concentration graphs" 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

Groups generated by bounded automata and their schreier graphs  

E-Print Network [OSTI]

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

Bondarenko, Ievgen

2008-10-10T23:59:59.000Z

222

Automated Fault Location In Smart Distribution Systems  

E-Print Network [OSTI]

of utilizing a suitable fault location method. As distribution systems are gradually evolving into smart distribution systems, application of more accurate fault location methods based on gathered data from various Intelligent Electronic Devices (IEDs...

Lotfifard, Saeed

2012-10-19T23:59:59.000Z

223

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

E-Print Network [OSTI]

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

Loebl, Martin

224

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

E-Print Network [OSTI]

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

Kim, Yong Jung

225

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

E-Print Network [OSTI]

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

Srinivasan, Aravind

226

Multiple Coordinated Views for Network Attack Graphs Steven Noel Michael Jacobs Pramod Kalapa Sushil Jajodia  

E-Print Network [OSTI]

Multiple Coordinated Views for Network Attack Graphs Steven Noel Michael Jacobs Pramod Kalapa graph-based representations have been developed for modeling combinations of low-level network attacks, relatively little attention has been paid to effective techniques for visualizing such attack graphs

Noel, Steven

227

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

228

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

E-Print Network [OSTI]

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

Alvarez, Nadir

229

Between automation and exploration: SAS graphing techniques for visualization of survey data  

E-Print Network [OSTI]

Between automation and exploration: SAS graphing techniques for visualization of survey data Chong of survey data. There is always a tension between automation and exploration. Automation is a common to automate the graphing processes via SAS/Macros and SAS/Graph. However, hidden patterns of the data may

Yu, Alex

230

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

E-Print Network [OSTI]

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

van Vuuren, Jan H.

231

Analysis of the AirTouch automatic vehicle location system's ability to locate moving vehicles  

E-Print Network [OSTI]

Automatic vehicle location systems are becoming more prevalent in diverse transportation applications. Their ability to locate vehicles can assist in locating emergency and public transit vehicles for better real-time dispatching as well...

Henry, Tracy Lynn

1995-01-01T23:59:59.000Z

232

MATLAB Tutorial Getting Started with Calculations, Graphing and Programming  

E-Print Network [OSTI]

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

Weinberger, Hans

233

Analyzing Gene Relationships for Down Syndrome with Labeled Transition Graphs  

E-Print Network [OSTI]

Analyzing Gene Relationships for Down Syndrome with Labeled Transition Graphs Neha Rungta, Hyrum changes in gene expres- sion and physical characteristics associated with Down syndrome is not well understood. Chromosome 21 genes interact with non- chromosome 21 genes to produce Down syndrome

Brigham Young University

234

Structured Region Graphs: Morphing EP into GBP Max Welling  

E-Print Network [OSTI]

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

Welling, Max

235

Structured Region Graphs: Morphing EP into GBP Max Welling  

E-Print Network [OSTI]

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

Welling, Max

236

Kron Reduction of Graphs with Applications to Electrical Networks  

E-Print Network [OSTI]

1 Kron Reduction of Graphs with Applications to Electrical Networks Florian D¨orfler Francesco work supported by NSF grants IIS- 0904501 and CPS-1135819. Florian D¨orfler and Francesco Bullo Barbara, CA 93106, {dorfler, bullo}@engineering.ucsb.edu we consider the circuit naturally associated

Bullo, Francesco

237

Brain Mapping Using Topology Graphs Obtained by Surface Segmentation  

E-Print Network [OSTI]

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

Linsen, Lars

238

Spectral Decision Diagrams Using Graph Transformations Mitchell Thornton Rolf Drechsler  

E-Print Network [OSTI]

Spectral Decision Diagrams Using Graph Transformations #3; Mitchell Thornton Rolf Drechsler Department of Electrical and Computer Engineering Siemens AG Mississippi State University Corporate Technology Mississippi State, MS 39762 81730 Munich, Germany mitch@ece.msstate.edu rolf.drechsler@mchp.siemens

Thornton, Mitchell

239

Mining Large Graphs And Streams Using Matrix And Tensor Tools  

E-Print Network [OSTI]

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

Kolda, Tamara G.

240

Optimizing Path Query Performance: Graph Clustering Strategies \\Lambda  

E-Print Network [OSTI]

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

Note: This page contains sample records for the topic "locations time-concentration graphs" 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

An Interchange File Format for Graphs Michael Himsolt  

E-Print Network [OSTI]

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

Pentus, Mati

242

Hamilton cycles in graphs and hypergraphs: an extremal perspective  

E-Print Network [OSTI]

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

Osthus, Deryk

243

HAMILTON CYCLES IN GRAPHS AND HYPERGRAPHS: AN EXTREMAL PERSPECTIVE  

E-Print Network [OSTI]

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

Osthus, Deryk

244

HAMILTON CYCLES IN GRAPHS AND HYPERGRAPHS: AN EXTREMAL PERSPECTIVE  

E-Print Network [OSTI]

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

Osthus, Deryk

245

Compatible Hamilton cycles in random graphs Michael Krivelevich  

E-Print Network [OSTI]

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

Sudakov, Benjamin

246

SEISMIC WAVES ESTIMATION AND WAVE FIELD DECOMPOSITION WITH FACTOR GRAPHS  

E-Print Network [OSTI]

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

Loeliger, Hans-Andrea

247

Quantitative Analysis of the Full Bitcoin Transaction Graph  

E-Print Network [OSTI]

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

248

SMITH INVARIANTS AND DUAL GRADED GRAPHS ALEXANDER MILLER  

E-Print Network [OSTI]

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

Weinberger, Hans

249

Evaluation of Multimodal Graphs for Blind People , STEPHEN BREWSTER  

E-Print Network [OSTI]

sense on people's fingers. Tactile diagrams exist in many forms and they mainly differEvaluation of Multimodal Graphs for Blind People WAI YU 1 , STEPHEN BREWSTER 2 1 Virtual visualisation system and its evaluations. This system is designed to improve blind and visually impaired people

Williamson, John

250

Synchronous Black Hole Search in Directed Graphs Adrian Kosowski  

E-Print Network [OSTI]

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

Paris-Sud XI, Université de

251

WRIGHT'S CONSTANTS IN GRAPH ENUMERATION AND BROWNIAN EXCURSION AREA  

E-Print Network [OSTI]

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

Janson, Svante

252

WRIGHT'S CONSTANTS IN GRAPH ENUMERATION AND BROWNIAN EXCURSION AREA  

E-Print Network [OSTI]

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

Janson, Svante

253

A graph-based network-vulnerability analysis system  

SciTech Connect (OSTI)

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

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

1998-05-03T23:59:59.000Z

254

A graph-based network-vulnerability analysis system  

SciTech Connect (OSTI)

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

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

1998-01-01T23:59:59.000Z

255

Using Visualization Process Graphs to Improve Visualization Exploration  

E-Print Network [OSTI]

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

Jankun-Kelly, T. J.

256

Graphs, Rewriting and Pathway Reconstruction for Rule-Based Models  

E-Print Network [OSTI]

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

Fontana, Walter

257

Approximating the Diameter of Planar Graphs in Near Linear Time  

E-Print Network [OSTI]

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

Yuster, Raphael

258

A Simple Approach to Abductive Inference using Conceptual Graphs  

E-Print Network [OSTI]

A Simple Approach to Abductive Inference using Conceptual Graphs Maurice Pagnucco Knowledge Systems, Australia. email: morri@cs.su.oz.au fax : +61­2­692­3838 Abstract Abductive reasoning (or simply abduction) is a form of logical in­ ference that aims to derive plausible explanations for data. The term ``abduction

Pagnucco, Maurice

259

Concept generation of dynamic systems using bond graphs  

E-Print Network [OSTI]

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

Krishnan, S

1990-01-01T23:59:59.000Z

260

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

E-Print Network [OSTI]

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

De Bacco, Caterina; Sollich, Peter

2015-01-01T23:59:59.000Z

Note: This page contains sample records for the topic "locations time-concentration graphs" 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

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

SciTech Connect (OSTI)

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

Brost, Randolph C.; McLendon, William Clarence,

2013-01-01T23:59:59.000Z

262

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

SciTech Connect (OSTI)

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

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

2013-09-15T23:59:59.000Z

263

Helicopter magnetic survey conducted to locate wells  

SciTech Connect (OSTI)

A helicopter magnetic survey was conducted in August 2007 over 15.6 sq mi at the Naval Petroleum Reserve No. 3ís (NPR-3) Teapot Dome Field near Casper, Wyoming. The surveyís purpose was to accurately locate wells drilled there during more than 90 years of continuous oilfield operation. The survey was conducted at low altitude and with closely spaced flight lines to improve the detection of wells with weak magnetic response and to increase the resolution of closely spaced wells. The survey was in preparation for a planned CO2 flood for EOR, which requires a complete well inventory with accurate locations for all existing wells. The magnetic survey was intended to locate wells missing from the well database and to provide accurate locations for all wells. The ability of the helicopter magnetic survey to accurately locate wells was accomplished by comparing airborne well picks with well locations from an intense ground search of a small test area.

Veloski, G.A.; Hammack, R.W.; Stamp, V. (Rocky Mountain Oilfield Testing Center); Hall, R. (Rocky Mountain Oilfield Testing Center); Colina, K. (Rocky Mountain Oilfield Testing Center)

2008-07-01T23:59:59.000Z

264

Community Detection from Location-Tagged Networks  

E-Print Network [OSTI]

Many real world systems or web services can be represented as a network such as social networks and transportation networks. In the past decade, many algorithms have been developed to detect the communities in a network using connections between nodes. However in many real world networks, the locations of nodes have great influence on the community structure. For example, in a social network, more connections are established between geographically proximate users. The impact of locations on community has not been fully investigated by the research literature. In this paper, we propose a community detection method which takes locations of nodes into consideration. The goal is to detect communities with both geographic proximity and network closeness. We analyze the distribution of the distances between connected and unconnected nodes to measure the influence of location on the network structure on two real location-tagged social networks. We propose a method to determine if a location-based community detection...

Liu, Zhi

2015-01-01T23:59:59.000Z

265

Location theory and the location of industry along an interstate highway  

E-Print Network [OSTI]

to determine the significance of these locational factors among plants with different characteristics that have located in certain localities should provide pertinent information with both practical and theoretical implications. Since 1956, approximately 64... Summary of Plant Location Theory Cost Fac'tots . . . . . . . . . . . . . ~ The Importance of 'the Demand Factor Greenhut's General Theory of Plant Location and the Intangible Factor Location Factors as Revealed by Empirical Study Greenhut's Case...

Miller, James Patterson

1965-01-01T23:59:59.000Z

266

Regenerator Location Problem in Flexible Optical Networks  

E-Print Network [OSTI]

Nov 22, 2014 ... Abstract: In this study we introduce the regenerator location problem in flexible optical networks (RLP-FON). With a given traffic demand,†...

BARIS YILDIZ

2014-11-22T23:59:59.000Z

267

Locating and tracking assets using RFID  

E-Print Network [OSTI]

. In this research, we will focus on how to ?nd the location of an item by using RFID in real time indoors to track equipment. When an item needs to be located, the purpose of using RFID is to minimize the searching time, e?ort, and investment cost. Thus...

Kim, Gak Gyu

2009-05-15T23:59:59.000Z

268

RECYCLING PROGRAM TYPE LOCATION ALLOWED NOT ALLOWED  

E-Print Network [OSTI]

RECYCLING PROGRAM TYPE LOCATION ALLOWED NOT ALLOWED Batteries, toner, ink cartridges & cell phones and recycling is an important part of that effort. Below is a guide to on-campus recycling at RSMAS: Visit http://www.rsmas.miami.edu/msgso/ for map of recycling bin locations. NOTE: This is not an exhaustive list. If unauthorized items are found

Miami, University of

269

Location Privacy and the Personal Distributed Environment  

E-Print Network [OSTI]

Location Privacy and the Personal Distributed Environment Robert C Atkinson, Swee Keow Goo, James-- The Personal Distributed Environment is a new concept being developed within the Mobile VCE Core 3 research, wherever their location: ubiquitous access. Devices are co-ordinated by Device Management Entities (DMEs

Atkinson, Robert C

270

Quantitative Analysis of the Full Bitcoin Transaction Graph  

E-Print Network [OSTI]

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

Dorit Ron; Adi Shamir

271

A graph-separation theorem for quantum causal models  

E-Print Network [OSTI]

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

Jacques Pienaar; Caslav Brukner

2014-10-31T23:59:59.000Z

272

Spectral properties of microwave graphs with local absorption  

E-Print Network [OSTI]

The influence of absorption on the spectra of microwave graphs has been studied experimentally. The microwave networks were made up of coaxial cables and T junctions. First, absorption was introduced by attaching a 50 Ohm load to an additional vertex for graphs with and without time-reversal symmetry. The resulting level-spacing distributions were compared with a generalization of the Wigner surmise in the presence of open channels proposed recently by Poli et al. [Phys. Rev. Lett. 108, 174101 (2012)]. Good agreement was found using an effective coupling parameter. Second, absorption was introduced along one individual bond via a variable microwave attenuator, and the influence of absorption on the length spectrum was studied. The peak heights in the length spectra corresponding to orbits avoiding the absorber were found to be independent of the attenuation, whereas, the heights of the peaks belonging to orbits passing the absorber once or twice showed the expected decrease with increasing attenuation.

M. Allgaier; S. Gehler; S. Barkhofen; H. -J. StŲckmann; U. Kuhl

2014-03-30T23:59:59.000Z

273

Judicious partitions of graphs Bela Bollobas and Alexander Scott  

E-Print Network [OSTI]

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

Scott, Alexander Alexander

274

A Spatiotemporal Graph Model for Rainfall Event Identification and Representation  

E-Print Network [OSTI]

of a storm ? The spread of a wildfire ? Other dynamic geographic phenomena from time series of snapshot datasets 3Research Objectives Identify the whole lifecycle of rainstorms from time series of snapshot datasets; Represent and analyze the rainstorms... based on a spatiotemporal graph model; Analyze the spatiotemporal characteristics of rainstorms. Data ? NEXRAD (Next generation Radar) ? Hourly precipitation estimate ? Cover more than 2/3 of the nation Rainstormsí Lifecycle Identification Delineate...

Liu, Weibo

2014-04-21T23:59:59.000Z

275

SFSU Building Coordinators List College or Administrative Unit Location(s)  

E-Print Network [OSTI]

SFSU Building Coordinators List College or Administrative Unit Location(s) Building Coordinator81193 cathym@sfsu.edu GYM 102B Student Services Building SSB Mirel Tikkanen x53566 mtikkane@sfsu.edu SSB

276

Method of locating underground mines fires  

DOE Patents [OSTI]

An improved method of locating an underground mine fire by comparing the pattern of measured combustion product arrival times at detector locations with a real time computer-generated array of simulated patterns. A number of electronic fire detection devices are linked thru telemetry to a control station on the surface. The mine's ventilation is modeled on a digital computer using network analysis software. The time reguired to locate a fire consists of the time required to model the mines' ventilation, generate the arrival time array, scan the array, and to match measured arrival time patterns to the simulated patterns.

Laage, Linneas (Eagam, MN); Pomroy, William (St. Paul, MN)

1992-01-01T23:59:59.000Z

277

The Value of Flexibility in Robust Location-Transportation Problem  

E-Print Network [OSTI]

production and distribution of products can be delayed until actual orders are ... such as hub locations, supplier locations, air freight hub locations, railway station

2014-11-24T23:59:59.000Z

278

Addressing endogeneity in residential location models  

E-Print Network [OSTI]

Some empirical residential location choice models have reported dwelling-unit price estimated parameters that are small, not statistically significant, or even positive. This would imply that households are non-sensitive ...

Guevara-Cue, CristiŠn Angelo

2005-01-01T23:59:59.000Z

279

Developing a theory of nightclub location choice  

E-Print Network [OSTI]

This work is an investigation of the factors that influence where nightclubs locate within a city. Nightclubs, like other social spaces, provide important social and economic benefits in the urban environment. As amenities, ...

Crim, Stephen J. (Stephen Johnson)

2008-01-01T23:59:59.000Z

280

THE PLANAR HUB LOCATION PROBLEM: A PROBABILISTIC ...  

E-Print Network [OSTI]

Nov 5, 2012 ... Aykin and Brown, [4]. ...... [8] J.F. Campbell, Integer programming formulations of discrete hub location problems, European J. of O.R.. 72(1994)†...

2012-11-21T23:59:59.000Z

Note: This page contains sample records for the topic "locations time-concentration graphs" 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

Personal Digital Assistant PDA ----Location Based  

E-Print Network [OSTI]

, xur],[ ybl, yur ]) k k=100 K k k- AminAmin kLk k Amax TmaxTmax kAminLocation Anonymization ConstraintsAmax TmaxLocation Service Quality Constraints 3.3 3.3.1 id, loc, query id loc (x,y)query GPS / l- l- k- l- k l- l l- l- m-invariant 2 29 #12;[22] A B C D E F R1 R2 R3 6 Outlier 6

282

Semi-classical measures on Quantum graphs and the Gau map of the determinant manifold  

E-Print Network [OSTI]

believed that QE does not hold in general for a FIXED quantum graph. In [BKW04], it is proved that QE does

Boyer, Edmond

283

Materials for Math 13900 Bring to class each day: graph paper ...  

E-Print Network [OSTI]

Materials for Math 13900. Bring to class each day: graph paper isometric dot paper unlined paper cm ruler. We will also be using: compass small scissors.

Roames, Renee S

2015-01-08T23:59:59.000Z

284

A Penrose inequality for asymptotically locally hyperbolic graphs  

E-Print Network [OSTI]

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

Levi Lopes de Lima; Frederico Gir„o

2013-05-14T23:59:59.000Z

285

Driver expectancy in locating automotive controls  

E-Print Network [OSTI]

of the dimmer switch 150 3 lb Effect of age on expected location of the dimmer switch 150 31c Effect of years of driving experience on expected location of the dimmer switch. 151 31d Effect of miles driven in the past year on expected location... IOO. C Sn. i 36. 2 8/. 5 80. 0 87. 5 A=/0. 0 ZD. D 50. 0 0. 0 /0 D 12 5 2D. O 30. 0 0. 0 80. 0 80. 0 62 IDD. O 100. 0 10[. 0 Bn. o o. o 7. 5 20. 0 40. 0 37'. 5 85. 0 23 3 17. 5 16. / 74. 2 42. 5 SZ. 5 Climate C ntrol 17. 2 43. 0 36...

Francis, Dawn Suzette

1990-01-01T23:59:59.000Z

286

Conclusions and future work We have pointed out the importance of proximity graphs as scaffolds for clustering  

E-Print Network [OSTI]

have introduced two new types of proximity graphs based on ensembles of minimum spanning trees, which for non-Euclidean data; study stochastic graphs. 7 Results: dimens. reduction (Isomap) Ellipse, high noise

Carreira-Perpi√Ī√°n, Miguel √Ā.

287

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

288

Actes JFPC 2008 LS(Graph): Un cadre de recherche locale pour des  

E-Print Network [OSTI]

le diam`etre d'un arbre) parce que ceux-ci sont d¬īej`a impl¬īement¬īes dans LS(Graph). Le program- meur recherche heu- ristiques et metaheuristiques. LS(Graph) est con¬łcu et impl¬īement¬īe en COMET (le code source

Deville, Yves

289

Graph Kernels Based on Relevant Patterns and Cycle Information for Chemoinformatics  

E-Print Network [OSTI]

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

Boyer, Edmond

290

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

291

MadGraph/MadEvent 4 SUSY, new models, matching and more!  

E-Print Network [OSTI]

Alwall - MadGraph/MadEvent 4 513 Mar 2007 What is new in MG/ME 4? Web-oriented, modular software banner #12;Johan Alwall - MadGraph/MadEvent 4 713 Mar 2007 Whole chain on web or downloaded and run locally Cards filled on the web or uploaded (reusable) Modular structure ­ easy to interface to other

California at Santa Cruz, University of

292

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

E-Print Network [OSTI]

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

Rossi, Francesca

293

A near-optimal approximation algorithm for Asymmetric TSP1 on embedded graphs2  

E-Print Network [OSTI]

algorithm of Oveis Gharan and Saberi [SODA 2011], which applies only to graphs15 with orientable genus g and Saberi [11] described a polynomial-time9 O( g log g)-approximation algorithm when the input includes and Saberi [11] applies only to23 graphs embedded on orientable surfaces.24 Chekuri and Sidiropoulos [3

Erickson, Jeff

294

DATABASE Open Access RAG: An update to the RNA-As-Graphs resource  

E-Print Network [OSTI]

DATABASE Open Access RAG: An update to the RNA-As-Graphs resource Joseph A Izzo1 , Namhee Kim1 utilize the benefits of relational database, and improvements to several of the utilities such as directed/labeled graphs and a subgraph search program. Conclusions: The RAG updates presented here augment the database

Schlick, Tamar

295

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

E-Print Network [OSTI]

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

K√ľhn, Daniela

296

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

E-Print Network [OSTI]

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

Osthus, Deryk

297

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

E-Print Network [OSTI]

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

Sawada, Joe

298

A conjecture of Biggs concerning the resistance of a distance-regular graph  

E-Print Network [OSTI]

Previously, Biggs has conjectured that the resistance between any two points on a distance-regular graph of valency greater than 2 is bounded by twice the resistance between adjacent points. We prove this conjecture, give the sharp constant for the inequality, and display the graphs for which the conjecture most nearly fails. Some necessary background material is included, as well as some consequences.

Markowsky, Greg

2010-01-01T23:59:59.000Z

299

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

E-Print Network [OSTI]

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

Zollman, Dean

300

Graph-based simulated annealing: A hybrid approach to stochastic modeling of complex  

E-Print Network [OSTI]

of the system, where the energy is associated with its surface area. The advantage is that for model fittingGraph-based simulated annealing: A hybrid approach to stochastic modeling of complex is based on a hybrid approach, where in a first step a graph model is developed using ideas from stochastic

Kroese, Dirk P.

Note: This page contains sample records for the topic "locations time-concentration graphs" 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

Compositionality in Synchronous Data Flow: Modular Code Generation from Hierarchical SDF Graphs  

E-Print Network [OSTI]

Compositionality in Synchronous Data Flow: Modular Code Generation from Hierarchical SDF Graphs in Synchronous Data Flow: Modular Code Generation from Hierarchical SDF Graphs Stavros Tripakis, Dai Bui, Bert of California, Berkeley stavros, daib, eal@eecs.berkeley.edu October 20, 2009 Abstract Hierarchical SDF models

302

The power graph of a finite group, II Peter J. Cameron  

E-Print Network [OSTI]

The power graph of a finite group, II Peter J. Cameron School of Mathematical Sciences Queen Mary, University of London Mile End Road London E1 4NS, U.K. Abstract The directed power graph of a group G is the digraph with vertex set G, having an arc from y to x whenever x is a power of y; the undirected power

Cameron, Peter

303

Energy Models for Drawing Signed Graphs Anne-Marie Kermarrec and Afshin Moin  

E-Print Network [OSTI]

Energy Models for Drawing Signed Graphs Anne-Marie Kermarrec and Afshin Moin INRIA Rennes Bretagne-dimensional space. Energy models are the prevalent approach to graph drawing. In this paper, we propose energy) or as negative (repulsive). The existent energy models do not discriminate against edge sign. Hence, they do

Paris-Sud XI, Université de

304

WILD QUOTIENT SURFACE SINGULARITIES WHOSE DUAL GRAPHS ARE NOT STAR-SHAPED  

E-Print Network [OSTI]

WILD QUOTIENT SURFACE SINGULARITIES WHOSE DUAL GRAPHS ARE NOT STAR-SHAPED HIROYUKI ITO AND STEFAN- zini on wild quotient singularities in dimension two. Using Kato's theory of log structures and log of Heisenberg groups lead to examples of wild quotient singularities where the dual graph contains at least two

Schröer, Stefan

305

Graph Mining for Object Tracking in Videos Fabien Diot1,2  

E-Print Network [OSTI]

Graph Mining for Object Tracking in Videos Fabien Diot1,2 , Elisa Fromont1 , Baptiste Jeudy1 of graph mining for tracking objects in videos with moving cameras and without any contextual information on the objects to track. To make the mining algorithm efficient, we benefit from a video representation based

306

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

307

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

E-Print Network [OSTI]

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

Norin, Sergey

308

Leak locating microphone, method and system for locating fluid leaks in pipes  

DOE Patents [OSTI]

A leak detecting microphone inserted directly into fluid within a pipe includes a housing having a first end being inserted within the pipe and a second opposed end extending outside the pipe. A diaphragm is mounted within the first housing end and an acoustic transducer is coupled to the diaphragm for converting acoustical signals to electrical signals. A plurality of apertures are provided in the housing first end, the apertures located both above and below the diaphragm, whereby to equalize fluid pressure on either side of the diaphragm. A leak locating system and method are provided for locating fluid leaks within a pipe. A first microphone is installed within fluid in the pipe at a first selected location and sound is detected at the first location. A second microphone is installed within fluid in the pipe at a second selected location and sound is detected at the second location. A cross-correlation is identified between the detected sound at the first and second locations for identifying a leak location.

Kupperman, David S. (Oak Park, IL); Spevak, Lev (Highland Park, IL)

1994-01-01T23:59:59.000Z

309

INDDGO: Integrated Network Decomposition & Dynamic programming for Graph Optimization  

SciTech Connect (OSTI)

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

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

2012-10-01T23:59:59.000Z

310

Transportation Networks and Location A Geometric Approach  

E-Print Network [OSTI]

Transportation Networks and Location A Geometric Approach Belén Palop1,2 1Departamento de March 2009 Florida State University #12;Belén Palop, UVa, SUNY Outline Transportation Network Model;Transportation Network Model Belén Palop, UVa, SUNY Outline Transportation Network Model Network placement

Palop del Río, Belén

311

OPTIMAL LOCATION OF ISOLATION VALVES IN WATER  

E-Print Network [OSTI]

CHAPTER 7 OPTIMAL LOCATION OF ISOLATION VALVES IN WATER DISTRIBUTION SYSTEMS: A RELIABILITY systems to serve expanding population centers. Both the adaptation of existing technologies in water supply systems account for the largest cost item in future maintenance budgets. The aging

Mays, Larry W.

312

Recycling Bin Guide Locations and prices  

E-Print Network [OSTI]

Recycling Bin Guide Locations and prices Metal Bins Deskside Bins with Side Saddle Rubbermaid Bins.58 for auxiliaries. And Non-Public Areas Public Offices Non-Public Recyclables Recyclables RecyclablesTrash Trash Trash #12;New Recycling Bin Guidelines Frequently Asked Questions (as of December 2008) · Why

Kirschner, Denise

313

Exact Location : Date of Accident : AM PM  

E-Print Network [OSTI]

SSN Cell Phone Home Phone Work Phone Exact Location : Date of Accident : AM PM Date accident treatment provided? Yes No Where Was time lost from work? Yes No If yes, how long? Could this accident have the following information as soon as it relates to your work related accident/injury/illness within 72 hours

Swaddle, John

314

Bond Graph Modeling of Current Diffusion in Magnetic Cores Herv Morel, Bruno Allard, Sabrine M'Rad, Cyril Buttay  

E-Print Network [OSTI]

Bond Graph Modeling of Current Diffusion in Magnetic Cores Hervť Morel, Bruno Allard, Sabrine M, F-69621 Villeurbanne Cedex, France KEYBOARD: Bond Graphs, Variational approximation, Diffusive with the diffusion representation. Both approaches yield a same bond graph representation. 2. MODELING CURRENT

Paris-Sud XI, Universitť de

315

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

E-Print Network [OSTI]

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

Williams, Susan

316

VCSEL fault location apparatus and method  

DOE Patents [OSTI]

An apparatus for locating a fault within an optical fiber is disclosed. The apparatus, which can be formed as a part of a fiber-optic transmitter or as a stand-alone instrument, utilizes a vertical-cavity surface-emitting laser (VCSEL) to generate a test pulse of light which is coupled into an optical fiber under test. The VCSEL is subsequently reconfigured by changing a bias voltage thereto and is used as a resonant-cavity photodetector (RCPD) to detect a portion of the test light pulse which is reflected or scattered from any fault within the optical fiber. A time interval .DELTA.t between an instant in time when the test light pulse is generated and the time the reflected or scattered portion is detected can then be used to determine the location of the fault within the optical fiber.

Keeler, Gordon A. (Albuquerque, NM); Serkland, Darwin K. (Albuquerque, NM)

2007-05-15T23:59:59.000Z

317

Commodity/Vendor Purchasing Matrix Vendor Location  

E-Print Network [OSTI]

Commodity/Vendor Purchasing Matrix Commodity Vendor N am e and A ddress Vendor N am e in eVA Vendor sheets of paper and bring to business office for payment. Vendor Purchasing Matrix 090413 Page 1 of 4 #12;Commodity Vendor N am e and A ddress Vendor N am e in eVA Vendor Location in eVA PO C ategory eVA PO needed

Swaddle, John

318

RESIDENTIAL LOCATION CHOICE AND TRAVEL BEHAVIOR: IMPLICATIONS FOR AIR QUALITY  

E-Print Network [OSTI]

RESIDENTIAL LOCATION CHOICE AND TRAVEL BEHAVIOR: IMPLICATIONS FOR AIR QUALITY UC Davis-Caltrans Air control measure. #12;RESIDENTIAL LOCATION CHOICE AND TRAVEL BEHAVIOR: IMPLICATIONS FOR AIR QUALITY.......................................................... 3 2.2 The Role of Residential Location Choice

Levinson, David M.

319

A note on QUBO instances defined on Chimera graphs  

E-Print Network [OSTI]

McGeoch and Wang (2013) recently obtained optimal or near-optimal solutions to some quadratic unconstrained boolean optimization (QUBO) problem instances using a 439 qubit D-Wave Two quantum computing system in much less time than with the IBM ILOG CPLEX mixed-integer quadratic programming (MIQP) solver. The problems studied by McGeoch and Wang are defined on subgraphs -- with up to 439 nodes -- of Chimera graphs. We observe that after a standard reformulation of the QUBO problem as a mixed-integer linear program (MILP), the specific instances used by McGeoch and Wang can be solved to optimality with the CPLEX MILP solver in much less time than the time reported in McGeoch and Wang for the CPLEX MIQP solver. However, the solution time is still more than the time taken by the D-Wave computer in the McGeoch-Wang tests.

Sanjeeb Dash

2013-07-01T23:59:59.000Z

320

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

Note: This page contains sample records for the topic "locations time-concentration graphs" 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

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

SciTech Connect (OSTI)

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

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

2010-08-01T23:59:59.000Z

322

A PTAS for the Classical Ising Spin Glass Problem on the Chimera Graph Structure  

E-Print Network [OSTI]

We present a polynomial time approximation scheme (PTAS) for the minimum value of the classical Ising Hamiltonian with linear terms on the Chimera graph structure as defined in the recent work of McGeoch and Wang. The result follows from a direct application of the techniques used by Bansal, Bravyi and Terhal who gave a PTAS for the same problem on planar and, in particular, grid graphs. We also show that on Chimera graphs, the trivial lower bound is within a constant factor of the optimum.

Rishi Saket

2013-07-01T23:59:59.000Z

323

PARSII - New Reports and Reports With New Reporting Folder Location...  

Energy Savers [EERE]

- New Reports and Reports With New Reporting Folder Location More Documents & Publications PARSII - New Reports and Reports With New Reporting Folder Location Slide 1 Slide 1...

324

Location of laccase in ordered mesoporous materials  

SciTech Connect (OSTI)

The functionalization with amine groups was developed on the SBA-15, and its effect in the laccase immobilization was compared with that of a Periodic Mesoporous Aminosilica. A method to encapsulate the laccase in situ has now been developed. In this work, spherical aberration (C{sub s}) corrected scanning transmission electron microscopy combined with high angle annular dark field detector and electron energy loss spectroscopy were applied to identify the exact location of the enzyme in the matrix formed by the ordered mesoporous solids.

Mayoral, Ńlvaro [Laboratorio de Microscopias Avanzadas, Instituto de Nanociencia de Aragon, Universidad de Zaragoza, Edificio I - D, Mariano Esquillor, 50018 Zaragoza (Spain); Gascůn, Victoria; Blanco, Rosa M.; MŠrquez-Ńlvarez, Carlos; DŪaz, Isabel, E-mail: idiaz@icp.csic.es [Instituto de CatŠlisis y PetroleoquŪmica, CSIC, c/Marie Curie 2, 28049 Madrid (Spain)

2014-11-01T23:59:59.000Z

325

Property:UtilityLocation | Open Energy Information  

Open Energy Info (EERE)

AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home5b9fcbce19 No revisionEnvReviewNonInvasiveExploration JumpSanyalTempWellhead Jump to:TechnologyUtilityLocation Jump to:

326

Homogeneous Factorisations of Graphs and Michael Giudici a, Cai Heng Li a  

E-Print Network [OSTI]

Homogeneous Factorisations of Graphs and Digraphs Michael Giudici a, Cai Heng Li a Primoz Potocnik@maths.uwa.edu.au (Michael Giudici), li@maths.uwa.edu.au (Cai Heng Li), primoz.potocnik@fmf.uni-lj.si (Primoz Preprint

Giudici, Michael

327

Maximal Independent Sets In Graphs With At Most r Goh Chee Ying  

E-Print Network [OSTI]

Maximal Independent Sets In Graphs With At Most r Cycles Goh Chee Ying Department of Mathematics National University of Singapore Singapore goh chee ying@moe.edu.sg Koh Khee Meng Department of Mathematics

Sagan, Bruce

328

Omega: an Overlap-graph de novo Assembler for Meta-genomics  

SciTech Connect (OSTI)

Motivation: Metagenomic sequencing allows reconstruction of mi-crobial genomes directly from environmental samples. Omega (overlap-graph metagenome assembler) was developed here for assembling and scaffolding Illumina sequencing data of microbial communities. Results: Omega found overlaps between reads using a prefix/suffix hash table. The overlap graph of reads was simplified by removing transitive edges and trimming small branches. Unitigs were generat-ed based on minimum cost flow analysis of the overlap graph. Obtained unitigs were merged to contigs and scaffolds using mate-pair information. Omega was compared with two de Bruijn graph assemblers, SOAPdenovo and IDBA-UD, using a publically-available Illumina sequencing dataset of a 64-genome mock com-munity. The assembly results were verified by their alignment with reference genomes. The overall performances of the three assem-blers were comparable and each assembler provided best results for a subset of genomes.

Haider, Bahlul [ORNL; Ahn, Tae-Hyuk [ORNL; Bushnell, Brian [U.S. Department of Energy, Joint Genome Institute; Chai, JJ [ORNL; Copeland, Alex [U.S. Department of Energy, Joint Genome Institute; Pan, Chongle [ORNL

2014-01-01T23:59:59.000Z

329

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

E-Print Network [OSTI]

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

Kempton, Mark Condie

2010-01-01T23:59:59.000Z

330

Forced Orientation of Graphs B. FARZAD , M. MAHDIAN y , E.S. MAHMOODIAN z ,  

E-Print Network [OSTI]

Forced Orientation of Graphs B. FARZAD #3; , M. MAHDIAN y , E.S. MAHMOODIAN z , A. SABERI x , AND B, Georgia Institute of Technology, Atlanta, USA. (saberi@cc.gatech.edu) { Department of Computer Science

Saberi, Amin

331

A New Approach to Argument by Analogy: Extrapolation and Chain Graphs Daniel Steel  

E-Print Network [OSTI]

A New Approach to Argument by Analogy: Extrapolation and Chain Graphs Daniel Steel Department of Philosophy 503 S Kedzie Hall East Lansing, MI 48824-1032 steel@msu.edu #12;1. Introduction. In order to make

Steel, Daniel

332

THE SPECTRAL RADIUS OF INFINITE GRAPHS N. L. BIGGS, BOJAN MOHAR AND JOHN SHAWE-TAYLOR  

E-Print Network [OSTI]

THE SPECTRAL RADIUS OF INFINITE GRAPHS N. L. BIGGS, BOJAN MOHAR AND JOHN SHAWE-TAYLOR 1 follows from Theorem 2.2. #12;118 N. L. BIGGS, B. MOHAR AND J. SHAWE-TAYLOR 3. The expanding case

Mohar, Bojan

333

Feedback vertex sets and disjoint cycles in planar (di)graphs  

E-Print Network [OSTI]

graph has a feedback vertex set of cardinality at most k then its treewidth. is bounded ... in linear time, and this is used to nd an algorithm computing a feedback.

334

The usefulness of the generalised computational model of Term Graph Rewriting Systems (TGRS) for designing and  

E-Print Network [OSTI]

of programs written in UFO ([8,9]), a state-of-the-art object- oriented functional language, onto equivalent as follows: the next two sections introduce MONSTR and UFO and provide Term Graph Rewriting

Banach, Richard

335

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

336

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

E-Print Network [OSTI]

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

Lan, Ching Fu

2006-04-12T23:59:59.000Z

337

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

E-Print Network [OSTI]

Coloring Kk-free intersection graphs of geometric objects in the plane Jacob Fox Department that copies are not made or distributed for profit or commercial advantage and that copies bear this notice

Fox, Jacob

338

Location-Tracking Applications ecent technological advances in wireless loca-  

E-Print Network [OSTI]

areas they have visited. #12;Location-Tracking Applications broker as part of their service contract

Gruteser, Marco

339

Locating a Recycling Center: The General Density Case Jannett Highfill  

E-Print Network [OSTI]

Locating a Recycling Center: The General Density Case Jannett Highfill Department of Economics) 677-3374. #12;2 Locating a Recycling Center: The General Density Case Abstract: The present paper considers a municipality that has a landfill (fixed in location) and plans to optimally locate a "recycling

Mou, Libin

340

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

E-Print Network [OSTI]

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

Hammer, Mary Elizabeth

2002-01-01T23:59:59.000Z

Note: This page contains sample records for the topic "locations time-concentration graphs" 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

Location Independent Professional Project: A Pilot Study  

SciTech Connect (OSTI)

This pilot study project explored the problem of providing access to the nomadic worker who desires to connect a computer through network access points at a number of different locations within the SNL/NM campus as well as outside the campus. The design and prototype development gathered knowledge that may allow a design to be developed that could be extended to a larger number of SNL/NM network drop boxes. The focus was to provide a capability for a worker to access the SNL IRN from a network drop box (e.g. in a conference room) as easily as when accessing the computer network from the office normally used by the worker. Additional study was done on new methods to authenticate the off campus worker, and protect and control access to data.

Hudson, J.A.; Long, J.P.; Miller, M.M.

1999-02-01T23:59:59.000Z

342

Locating hardware faults in a parallel computer  

DOE Patents [OSTI]

Locating hardware faults in a parallel computer, including defining within a tree network of the parallel computer two or more sets of non-overlapping test levels of compute nodes of the network that together include all the data communications links of the network, each non-overlapping test level comprising two or more adjacent tiers of the tree; defining test cells within each non-overlapping test level, each test cell comprising a subtree of the tree including a subtree root compute node and all descendant compute nodes of the subtree root compute node within a non-overlapping test level; performing, separately on each set of non-overlapping test levels, an uplink test on all test cells in a set of non-overlapping test levels; and performing, separately from the uplink tests and separately on each set of non-overlapping test levels, a downlink test on all test cells in a set of non-overlapping test levels.

Archer, Charles J.; Megerian, Mark G.; Ratterman, Joseph D.; Smith, Brian E.

2010-04-13T23:59:59.000Z

343

Fault Locating, Prediction and Protection (FLPPS)  

SciTech Connect (OSTI)

One of the main objectives of this DOE-sponsored project was to reduce customer outage time. Fault location, prediction, and protection are the most important aspects of fault management for the reduction of outage time. In the past most of the research and development on power system faults in these areas has focused on transmission systems, and it is not until recently with deregulation and competition that research on power system faults has begun to focus on the unique aspects of distribution systems. This project was planned with three Phases, approximately one year per phase. The first phase of the project involved an assessment of the state-of-the-art in fault location, prediction, and detection as well as the design, lab testing, and field installation of the advanced protection system on the SCE Circuit of the Future located north of San Bernardino, CA. The new feeder automation scheme, with vacuum fault interrupters, will limit the number of customers affected by the fault. Depending on the fault location, the substation breaker might not even trip. Through the use of fast communications (fiber) the fault locations can be determined and the proper fault interrupting switches opened automatically. With knowledge of circuit loadings at the time of the fault, ties to other circuits can be closed automatically to restore all customers except the faulted section. This new automation scheme limits outage time and increases reliability for customers. The second phase of the project involved the selection, modeling, testing and installation of a fault current limiter on the Circuit of the Future. While this project did not pay for the installation and testing of the fault current limiter, it did perform the evaluation of the fault current limiter and its impacts on the protection system of the Circuit of the Future. After investigation of several fault current limiters, the Zenergy superconducting, saturable core fault current limiter was selected for installation. Because of some testing problems with the Zenergy fault current limiter, installation was delayed until early 2009 with it being put into operation on March 6, 2009. A malfunction of the FCL controller caused the DC power supply to the superconducting magnet to be turned off. This inserted the FCL impedance into the circuit while it was in normal operation causing a voltage resonance condition. While these voltages never reached a point where damage would occur on customer equipment, steps were taken to insure this would not happen again. The FCL was reenergized with load on December 18, 2009. A fault was experienced on the circuit with the FCL in operation on January 14, 2010. The FCL operated properly and reduced the fault current by about 8%, what was expected from tests and modeling. As of the end of the project, the FCL was still in operation on the circuit. The third phase of the project involved the exploration of several advanced protection ideas that might be at a state where they could be applied to the Circuit of the Future and elsewhere in the SCE electrical system. Based on the work done as part of the literature review and survey, as well as a number of internal meetings with engineering staff at SCE, a number of ideas were compiled. These ideas were then evaluated for applicability and ability to be applied on the Circuit of the Future in the time remaining for the project. Some of these basic ideas were implemented on the circuit including measurement of power quality before and after the FCL. It was also decided that we would take what was learned as part of the Circuit of the Future work and extend it to the next generation circuit protection for SCE. Also at this time, SCE put in a proposal to the DOE for the Irvine Smart Grid Demonstration using ARRA funding. SCE was successful in obtaining funding for this proposal, so it was felt that exploration of new protection schemes for this Irvine Smart Grid Demonstration would be a good use of the project resources. With this in mind, a protection system that uses fault interrupting switches, hi

Yinger, Robert, J.; Venkata, S., S.; Centeno, Virgilio

2010-09-30T23:59:59.000Z

344

Exact sampling of graphs with prescribed degree correlations  

E-Print Network [OSTI]

Many real-world networks exhibit correlations between the node degrees. For instance, in social networks nodes tend to connect to nodes of similar degree. Conversely, in biological and technological networks, high-degree nodes tend to be linked with low-degree nodes. Degree correlations also affect the dynamics of processes supported by a network structure, such as the spread of opinions or epidemics. The proper modelling of these systems, i.e., without uncontrolled biases, requires the sampling of networks with a specified set of constraints. We present a solution to the sampling problem when the constraints imposed are the degree correlations. In particular, we develop an efficient and exact method to construct and sample graphs with a specified joint-degree matrix, which is a matrix providing the number of edges between all the sets of nodes of a given degree, for all degrees, thus completely specifying all pairwise degree correlations, and additionally, the degree sequence itself. Our algorithm always pro...

Bassler, Kevin E; Erd?s, Pťter L; Miklůs, IstvŠn; Toroczkai, ZoltŠn

2015-01-01T23:59:59.000Z

345

MobiEyes: A Distributed Location Monitoring Service Using Moving Location Queries  

E-Print Network [OSTI]

, distributed algorithms, mobile data management. « 1 INTRODUCTION WITH the growing availability of mobile-sensitive resource management. The former uses location data to tailor the information delivered to the mobile users traffic and weather. Examples include systems for fleet manage- ment, mobile workforce management

Liu, Ling

346

Infrasound source location An automated method to estimate the location of infrasound sources  

E-Print Network [OSTI]

Waterstaat Delft University of Technology (DUT) Department of Earth Observation and Space Systems Acoustic Meteorologisch Instituut (KNMI) and three additional arrays located in Germany and France. The estimated source for a spherical earth. Extensive filtering is applied to clean the data from as much noise and signals from local

Evers, Läslo G.

347

SAPLE: Sandia Advanced Personnel Locator Engine.  

SciTech Connect (OSTI)

We present the Sandia Advanced Personnel Locator Engine (SAPLE) web application, a directory search application for use by Sandia National Laboratories personnel. SAPLE's purpose is to return Sandia personnel 'results' as a function of user search queries, with its mission to make it easier and faster to find people at Sandia. To accomplish this, SAPLE breaks from more traditional directory application approaches by aiming to return the correct set of results while placing minimal constraints on the user's query. Two key features form the core of SAPLE: advanced search query interpretation and inexact string matching. SAPLE's query interpretation permits the user to perform compound queries when typing into a single search field; where able, SAPLE infers the type of field that the user intends to search on based on the value of the search term. SAPLE's inexact string matching feature yields a high-quality ranking of personnel search results even when there are no exact matches to the user's query. This paper explores these two key features, describing in detail the architecture and operation of SAPLE. Finally, an extensive analysis on logged search query data taken from an 11-week sample period is presented.

Procopio, Michael J.

2010-04-01T23:59:59.000Z

348

TAGGING, TRACKING AND LOCATING WITHOUT GPS  

SciTech Connect (OSTI)

The Savannah River National Laboratory (SRNL) was requested to lead a Law Enforcement Working Group that was formed to collaborate on common operational needs. All agencies represented on the working group ranked their need to tag, track, and locate a witting or unwitting target as their highest priority. Specifically, they were looking for technologies more robust than Global Positioning Satellite (GPS), could communicate back to the owner, and worked where normal cell phone communications did not work or were unreliable. SRNL brought together multiple technologies in a demonstration that was held in in various Alaska venues, including metropolitan, wilderness, and at-sea that met the working group's requirements. Using prototypical technologies from Boeing, On Ramp, and Fortress, SRNL was able to demonstrate the ability to track personnel and material in all scenarios including indoors, in heavily wooden areas, canyons, and in parking garages. In all cases GPS signals were too weak to measure. Bi-directional communication was achieved in areas that Wi-Fi, cell towers, or traditional radios would not perform. The results of the exercise will be presented. These technologies are considered ideal for tracking high value material such has nuclear material with a platform that allows seamless tracking anywhere in the world, indoors or outdoors.

Cordaro, J.; Coleman, T.; Shull, D.

2012-07-08T23:59:59.000Z

349

Hierarchical graphs for better annotations of rule-based models of biochemical systems  

SciTech Connect (OSTI)

In the graph-based formalism of the BioNetGen language (BNGL), graphs are used to represent molecules, with a colored vertex representing a component of a molecule, a vertex label representing the internal state of a component, and an edge representing a bond between components. Components of a molecule share the same color. Furthermore, graph-rewriting rules are used to represent molecular interactions, with a rule that specifies addition (removal) of an edge representing a class of association (dissociation) reactions and with a rule that specifies a change of vertex label representing a class of reactions that affect the internal state of a molecular component. A set of rules comprises a mathematical/computational model that can be used to determine, through various means, the system-level dynamics of molecular interactions in a biochemical system. Here, for purposes of model annotation, we propose an extension of BNGL that involves the use of hierarchical graphs to represent (1) relationships among components and subcomponents of molecules and (2) relationships among classes of reactions defined by rules. We illustrate how hierarchical graphs can be used to naturally document the structural organization of the functional components and subcomponents of two proteins: the protein tyrosine kinase Lck and the T cell receptor (TCR)/CD3 complex. Likewise, we illustrate how hierarchical graphs can be used to document the similarity of two related rules for kinase-catalyzed phosphorylation of a protein substrate. We also demonstrate how a hierarchical graph representing a protein can be encoded in an XML-based format.

Hu, Bin [Los Alamos National Laboratory; Hlavacek, William [Los Alamos National Laboratory

2009-01-01T23:59:59.000Z

350

How the permutation of edges of a metric graph affects the number of points moving along the edges  

E-Print Network [OSTI]

We consider a dynamical system on a metric graph, that corresponds to a semiclassical solution of a time-dependent Schr\\"odinger equation. We omit all details concerning mathematical physics and work with a purely discrete problem. We find a weak inequality representation for the number of points coming out of the vertex of an arbitrary tree graph. We apply this construction to an "H-junction" graph. We calculate the difference between numbers of moving points corresponding to the permutation of edges. Then we find a symmetrical difference of the number of points moving along the edges of a metric graph.

V. L. Chernyshev; A. A. Tolchennikov

2014-10-18T23:59:59.000Z

351

On the Anonymity of Home/Work Location Pairs  

E-Print Network [OSTI]

On the Anonymity of Home/Work Location Pairs Philippe Golle and Kurt Partridge Palo Alto Research population is 1, 21 and 34,980, for locations known at the granularity of a census block, census track

Golle, Philippe

352

Holdout transshipment policy in two-location inventory systems†  

E-Print Network [OSTI]

In two-location inventory systems, unidirectional transshipment policies are considered when an item is not routinely stocked at a location in the system. Unlike the past research in this area which has concentrated on ...

Zhang, Jiaqi

2009-01-01T23:59:59.000Z

353

A Privacy Conscious Bluetooth Infrastructure for Location Aware Computing  

E-Print Network [OSTI]

We present a low cost and easily deployed infrastructure for location aware computing that is built using standard Bluetoothģ technologies and personal computers. Mobile devices are able to determine their location to ...

Huang, Albert

354

Etherthreads : an infrastructure for location-based messages  

E-Print Network [OSTI]

This thesis proposes an infrastructure for location-based services for Bluetooth enabled cellular phones. Specifically, it explores the use of this architecture in a location-based messaging application. A user can send ...

Lassey, Bradford, 1980-

2004-01-01T23:59:59.000Z

355

Provable and practical location privacy for vehicular and mobile systems  

E-Print Network [OSTI]

In recent years, there has been a rapid evolution of location-based vehicular and mobile services (e.g., electronic tolling, congestion pricing, traffic statistics, insurance pricing, location-based social applications), ...

Popa, Raluca Ada

2010-01-01T23:59:59.000Z

356

Locating a semi-obnoxious facility with repelling polygonal regions  

E-Print Network [OSTI]

Apr 30, 2007 ... Page 1 ... For the last years, the location of semi-desirable facilities has been a widely studied topic by the researchers in location theory (see [1†...

2007-04-30T23:59:59.000Z

357

Risks of using AP locations discovered through war driving  

E-Print Network [OSTI]

Risks of using AP locations discovered through war driving Minkyong Kim, Jeffrey J. Fielding the actual locations are often unavailable, they use estimated locations from war driving estimated through war driving. War driving is the process of collecting Wi-Fi beacons by driving or walking

Kotz, David

358

Accurate Eye Center Location through Invariant Isocentric Patterns  

E-Print Network [OSTI]

1 Accurate Eye Center Location through Invariant Isocentric Patterns Roberto Valenti, Student Member, IEEE, and Theo Gevers, Member, IEEE, Abstract--Locating the center of the eyes allows for valuable information to be captured and used in a wide range of applications. Accurate eye center location

Gevers, Theo

359

Decay of Correlations for the Hardcore Model on the $d$-regular Random Graph  

E-Print Network [OSTI]

A key insight from statistical physics about spin systems on random graphs is the central role played by Gibbs measures on trees. We determine the local weak limit of the hardcore model on random regular graphs asymptotically until just below its condensation threshold, showing that it converges in probability locally in a strong sense to the free boundary condition Gibbs measure on the tree. As a consequence we show that the reconstruction threshold on the random graph, indicative of the onset of point to set spatial correlations, is equal to the reconstruction threshold on the $d$-regular tree for which we determine precise asymptotics. We expect that our methods will generalize to a wide range of spin systems for which the second moment method holds.

Nayantara Bhatnagar; Allan Sly; Prasad Tetali

2014-05-23T23:59:59.000Z

360

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 magnetic energy Graph of solar flare energy forms Problem 1 - About what percentages of each of the four

Note: This page contains sample records for the topic "locations time-concentration graphs" 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

GeoTriples: a Tool for Publishing Geospatial Data as RDF Graphs Using R2RML Mappings  

E-Print Network [OSTI]

GeoTriples: a Tool for Publishing Geospatial Data as RDF Graphs Using R2RML Mappings Kostis the linked data paradigm. Therefore, Earth Ob- servation data and other kinds of geospatial data and geospatial data into RDF graphs. GeoTriples goes beyond the state of the art by extending the R2RML mapping

Koubarakis, Manolis

362

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

E-Print Network [OSTI]

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

Brandes, Ulrik

363

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

E-Print Network [OSTI]

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

Goddard, Wayne

364

Analyzing the Facebook friendship graph S. Catanese1, P. De Meo2, E. Ferrara3, G. Fiumara1  

E-Print Network [OSTI]

Analyzing the Facebook friendship graph S. Catanese1, P. De Meo2, E. Ferrara3, G. Fiumara1 1Dept Internet 20 September 2010, Berlin Catanese, De Meo, Ferrara, Fiumara () Analyzing the Facebook friendship Issues Catanese, De Meo, Ferrara, Fiumara () Analyzing the Facebook friendship graph MIFI 2010, 20

Ferrara, Emilio

365

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

E-Print Network [OSTI]

and Graphics: Theories and Applications Yuri Boykov and Olga Veksler Computer Science, The University the corresponding graph. Thus, many applications in vision and graphics use min-cut algorithms as a tool for computing optimal hypersurfaces. Secondly, graph-cuts also work as a powerful energy minimization tool

Boykov, Yuri

366

Improved vertex cover algorithms for fixed genus graphs through genus reduction and planar separation  

E-Print Network [OSTI]

, problems are restricted to decision problems? problems with yes/no answers. The VERTEX CovER problem formulated as a decision problem is "Given a graph G = (V, E) and positive cover k, does there exist a vertex cover of G whose size is at most k...: "Given a graph G = (V, E) and parameter k, does there exist a vertex cover C c: V for G such that C~ & k?" As a decision problem, Karp first demonstrated quantitatively how "hard" VERTEx CovER is to solve by showing that vERTEx covER is NP-complete [16...

Gupton, Kevin Thomas

2003-01-01T23:59:59.000Z

367

Automation of the Dipole Subtraction Method in MadGraph/MadEvent  

E-Print Network [OSTI]

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

Rikkert Frederix; Thomas Gehrmann; Nicolas Greiner

2008-08-15T23:59:59.000Z

368

Multiclass Diffuse Interface Models for Semi-Supervised Learning on Graphs  

E-Print Network [OSTI]

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

Garcia-Cardona, Cristina; Percus, Allon G

2012-01-01T23:59:59.000Z

369

Automated detection and location of indications in eddy current signals  

DOE Patents [OSTI]

A computer implemented information extraction process that locates and identifies eddy current signal features in digital point-ordered signals, signals representing data from inspection of test materials, by enhancing the signal features relative to signal noise, detecting features of the signals, verifying the location of the signal features that can be known in advance, and outputting information about the identity and location of all detected signal features.

Brudnoy, David M. (Albany, NY); Oppenlander, Jane E. (Burnt Hills, NY); Levy, Arthur J. (Schenectady, NY)

2000-01-01T23:59:59.000Z

370

Continuous wavelet transform analysis and modal location analysis acoustic emission source location for nuclear piping crack growth monitoring  

SciTech Connect (OSTI)

Source location is an important feature of acoustic emission (AE) damage monitoring in nuclear piping. The ability to accurately locate sources can assist in source characterisation and early warning of failure. This paper describe the development of a novelAE source location technique termed 'Wavelet Transform analysis and Modal Location (WTML)' based on Lamb wave theory and time-frequency analysis that can be used for global monitoring of plate like steel structures. Source location was performed on a steel pipe of 1500 mm long and 220 mm outer diameter with nominal thickness of 5 mm under a planar location test setup using H-N sources. The accuracy of the new technique was compared with other AE source location methods such as the time of arrival (TOA) techniqueand DeltaTlocation. Theresults of the study show that the WTML method produces more accurate location resultscompared with TOA and triple point filtering location methods. The accuracy of the WTML approach is comparable with the deltaT location method but requires no initial acoustic calibration of the structure.

Mohd, Shukri [Nondestructive Testing Group, Industrial Technology Division, Malaysian Nuclear Agency, 43000, Bangi, Selangor (Malaysia); Holford, Karen M.; Pullin, Rhys [Cardiff School of Engineering, Cardiff University, Queen's Buildings, The Parade, CARDIFF CF24 3AA (United Kingdom)

2014-02-12T23:59:59.000Z

371

Sensitivity of forced air distribution system efficiency to climate, duct location, air leakage and insulation  

E-Print Network [OSTI]

Location, Air Leakage and Insulation Iain S. Walker Energy4 Duct Insulation, Location and Leakageinsulation

Walker, Iain

2001-01-01T23:59:59.000Z

372

Lower Bounding Procedures for the Single Allocation Hub Location ...  

E-Print Network [OSTI]

[9] O'Kelly, M. E., A quadratic integer program for the location of interacting hub facilities, European Journal of Operational Research 32 (1987), pp. 393Ė404.

2014-11-30T23:59:59.000Z

373

The Value of Flexibility in Robust Location-Transportation Problem  

E-Print Network [OSTI]

Nov 25, 2014 ... Abstract: Facility location decisions play a critical role in transportation planning. In fact, it has recently become essential to study how such†...

Amir Ardestani-Jaafari

2014-11-25T23:59:59.000Z

374

p-facility Huff location problem on networks ?  

E-Print Network [OSTI]

sidering the location of two competing facilities on a linear market. ... This perturbs how the market is shared, since the new facilities will ..... Transactions in.

2014-10-30T23:59:59.000Z

375

Open Location-Oriented Services for the Web  

E-Print Network [OSTI]

point of a Service Oriented Architecture (SOA). Technically,the Web Service Oriented Architecture (SOA) ArchitecturalLocation-Oriented Services for the Web architecture based on

Wilde, Erik

2008-01-01T23:59:59.000Z

376

Colorado CRS 29-20-108, Location, Construction, or Improvement...  

Open Energy Info (EERE)

Location, Construction, or Improvement of Major Electrical or Natural Gas Facilities Jump to: navigation, search OpenEI Reference LibraryAdd to library Legal Document-...

377

acoustic location system: Topics by E-print Network  

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

ON POWER SYSTEMS, VOL. 29, NO. 1, JANUARY 2014 203 Distribution Locational Marginal Pricing for Optimal Power Transmission, Distribution and Plants Websites Summary:...

378

anatomic subsite location: Topics by E-print Network  

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

services (e.g., electronic tolling, congestion pricing, traffic statistics, insurance pricing, location-based social applications), ... Popa, Raluca Ada 2010-01-01 First Page...

379

agency dtra location: Topics by E-print Network  

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

flows or spillovers between multinational enterprises (MNEs the diversity of locational environments. The localization of knowledge sources depends on MNE group of...

380

Alternative Fueling Station Locator App Provides Info at Your...  

Broader source: Energy.gov (indexed) [DOE]

Fueling Station Locator website. It provides information on more than 15,000 public and private alternative fueling stations throughout the United States. The app lists where...

Note: This page contains sample records for the topic "locations time-concentration graphs" 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

Nanotechnology enterprise in the United States: structure and location.  

E-Print Network [OSTI]

??This thesis investigates the structure and location of the nanotechnology enterprise in the United States. Nanotechnology merits focus because of the high degree of innovativeÖ (more)

Bhaskarabhatla, Ajay Sivaram

2006-01-01T23:59:59.000Z

382

Locations of Smart Grid Demonstration and Large-Scale Energy...  

Broader source: Energy.gov (indexed) [DOE]

the location of all projects created with funding from the Smart Grid Demonstration and Energy Storage Project, funded through the American Recovery and Reinvestment Act....

383

Condensing Heating and Water Heating Equipment Workshop Location...  

Energy Savers [EERE]

Condensing Heating and Water Heating Equipment Workshop Location: Washington Gas Light Appliance Training Facility 6801 Industrial Road Springfield, VA Date: October 9, 2014 Time:...

384

Determining Optimal Locations for New Wind Energy Development in Iowa.  

E-Print Network [OSTI]

??The purpose of this research is to generate the most accurate model possible for predicting locations most suitable for new wind energy development using aÖ (more)

Mann, David

2011-01-01T23:59:59.000Z

385

Title 33 CFR 115 Bridge Locations and Clearances: Administrative...  

Open Energy Info (EERE)

Bridge Locations and Clearances: Administrative Procedures Jump to: navigation, search OpenEI Reference LibraryAdd to library Legal Document- Federal RegulationFederal Regulation:...

386

An Aggressive Reduction Scheme for the Simple Plant Location ...  

E-Print Network [OSTI]

We used routines from the Callable Library of IBM CPLEX version. 12.1 to solve ..... [23] M. Sun (2006) Solving the uncapacitated facility location problem using.

2011-11-26T23:59:59.000Z

387

Located in historic Los Alamos, New Mexico against the backdrop...  

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

Located in historic Los Alamos, New Mexico against the backdrop of the lush Jemez Mountains, Los Alamos National Laboratory (LANL) offers its education program participants...

388

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

E-Print Network [OSTI]

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

Chen, Ming-Syan

389

Optimizing Graph Algorithms for Improved Cache Performance*+ Joon-Sang Park  

E-Print Network [OSTI]

. For these algorithms, we demonstrate up to 2√? improvement in real execution time by using a simple cache- friendly graphs. We show performance improvements of 2√? - 3√? in real execution time by using the technique N and C are the problem size and cache size respectively. Experimental results show that this cache

Prasanna, Viktor K.

390

A Genetic Algorithm based Approach for Multi-Objective Data-Flow Graph Optimization  

E-Print Network [OSTI]

that the correct- ness of algebraic transformations realized by the underlying genetic operators selection shown for power optimization. In order to avoid inferior results caused by the counteracting demandsA Genetic Algorithm based Approach for Multi-Objective Data-Flow Graph Optimization Birger Landwehr

Coello, Carlos A. Coello

391

On the Number of Cycles in Planar Graphs Kevin Buchin1  

E-Print Network [OSTI]

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

Fuchs, Gunter

392

Development of the TIGRE This describes the TIGRE method for combinator graph reduction.  

E-Print Network [OSTI]

been previously implemented for the G-Ma- chine graph reduction implementation on a VAX (Peyton Jones 1987). In VAX assembly language, unwinding a node while traversing the stack requires four instructions, on average, processing nodes for stack unwinding costs: (4 * 1.38) + 7 = 12.52 VAX instructions per

Koopman, Philip

393

Planar Hop Spanners for Unit Disk Graphs Nicolas Catusse, Victor Chepoi, and Yann Vax`es  

E-Print Network [OSTI]

Planar Hop Spanners for Unit Disk Graphs Nicolas Catusse, Victor Chepoi, and Yann Vax`es Marseille Cedex 9, France {nicolas.catusse,victor.chepoi,yann.vaxes}@lif.univ-mrs.fr Abstract. The simplest;2 Nicolas Catusse, Victor Chepoi, and Yann Vax`es factors (see [9], for instance), the problem

Chepoi, Victor

394

Muller's ratchet in random graphs and scale-free networks Paulo R. A. Campos,1,  

E-Print Network [OSTI]

Muller's ratchet in random graphs and scale-free networks Paulo R. A. Campos,1, * Jaime Combad√£o,2 manuscript received 1 September 2006; published 4 October 2006 Muller's ratchet is an evolutionary process study the speed of Muller's ratchet in a population subdivided into many small subpopulations connected

Dionisio, Francisco

395

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

SciTech Connect (OSTI)

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

396

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

E-Print Network [OSTI]

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

Paris-Sud XI, Université de

397

A Methodology for Empirical Analysis of Brain Connectivity through Graph Mining  

E-Print Network [OSTI]

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

Xie, Mengjun

398

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

E-Print Network [OSTI]

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

Woodward, Christopher

399

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

E-Print Network [OSTI]

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

Woodward, Christopher

400

Novel approaches for solving large-scale optimization problems on graphs  

E-Print Network [OSTI]

. . . . . . . . . . . . . . . . . . . . . . . 97 8 Parameters of calculated weighted diversified portfolios correspon- ding to 500-day trading periods . . . . . . . . . . . . . . . . . . . . . 110 9 Graph parameters for small test-bed . . . . . . . . . . . . . . . . . . 126 10 Number of k... . . . . . . . . . . . . . . . . . . 29 5 Crown structure . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 44 6 t-hat structure . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 50 7 2-club and 2-clique example . . . . . . . . . . . . . . . . . . . . . . . 54 8...

Trukhanov, Svyatoslav

2009-05-15T23:59:59.000Z

Note: This page contains sample records for the topic "locations time-concentration graphs" 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

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

E-Print Network [OSTI]

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

Pascucci, Valerio

402

1 Introduction 1 1.1 Graphs, digraphs, and homomorphisms 1  

E-Print Network [OSTI]

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

Hell, Pavol

403

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

E-Print Network [OSTI]

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

Paris-Sud XI, Université de

404

Kronk, Hudson V., Associate Professor, PhD, 1964, Michigan State University: Graph theory.  

E-Print Network [OSTI]

227 Kronk, Hudson V., Associate Professor, PhD, 1964, Michigan State University: Graph theory) Schick, Anton, Associate Professor, PhD, 1983, Michigan State University: Statistics, probability. (1984, conformal field theory. (1979) Ferry, Steven, Distinguished Professor, PhD, 1973, University of Michigan

Suzuki, Masatsugu

405

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

E-Print Network [OSTI]

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

Savage, Carla D.

406

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

E-Print Network [OSTI]

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

Robinson, Robert W.

407

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

E-Print Network [OSTI]

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

K√ľhn, Daniela

408

The critical group of a graph Texas State U., San Marcos, March 21th, 2014.  

E-Print Network [OSTI]

-firing game (Björner-Lovasz-Shor, Gabrielov, Biggs); #12;This talk is about the critical group, a finite-Tang-Wiesenfeld, Dhar); its combinatorial variant: the Chip-firing game (Björner-Lovasz-Shor, Gabrielov, Biggs-Lovasz-Shor, Gabrielov, Biggs); in arithmetic geometry: Picard group, graph Jacobian (Lorenzini). We'll consider

Sin, Peter

409

The critical group of a graph Millican Colloquium, UNT, March 24th, 2014.  

E-Print Network [OSTI]

-firing game (Björner-Lovasz-Shor, Gabrielov, Biggs); #12;This talk is about the critical group, a finite-Tang-Wiesenfeld, Dhar); its combinatorial variant: the Chip-firing game (Björner-Lovasz-Shor, Gabrielov, Biggs-Lovasz-Shor, Gabrielov, Biggs); in arithmetic geometry: Picard group, graph Jacobian (Lorenzini). We'll consider

Sin, Peter

410

A functional central limit theorem for interacting particle systems on transitive graphs  

E-Print Network [OSTI]

A finite range interacting particle system on a transitive graph is considered. Assuming that the dynamics and the initial measure are invariant, the normalized empirical distribution process converges in distribution to a centered diffusion process. As an application, a central limit theorem for certain hitting times, interpreted as failure times of a coherent system in reliability, is derived.

Paul Doukhan; Gabriel Lang; Sana Louhichi; Bernard Ycart

2007-04-12T23:59:59.000Z

411

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

E-Print Network [OSTI]

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

412

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

E-Print Network [OSTI]

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

Varela, Carlos

413

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

E-Print Network [OSTI]

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

Carneiro, Gustavo

414

LOOP TRANSFORMATIONS FOR INTERFACE-BASED HIERARCHIES IN SDF GRAPHS Jonathan Piat1  

E-Print Network [OSTI]

LOOP TRANSFORMATIONS FOR INTERFACE-BASED HIERARCHIES IN SDF GRAPHS Jonathan Piat1 , Shuvra S processing (DSP) applica- tions. A restricted version of data-flow, termed synchronous data-flow (SDF of hierarchy (Interface-based SDF) has been proposed allowing more expressivity while maintaining its

Bhattacharyya, Shuvra S.

415

Back to Basics: Homogeneous Representations of Multi-Rate Synchronous Dataflow Graphs  

E-Print Network [OSTI]

Synchronous dataflow (SDF) [1] is a popular class of models of computation and is used to model the temporal are particularly useful in the design of systems where worst-case guarantees on performance must be given. An SDF and processing elements. The class of SDF graphs that we focus on in this paper are called multi-rate SDF (MRSDF

Al Hanbali, Ahmad

416

A rigidity result for the graph case of the Penrose inequality  

E-Print Network [OSTI]

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

Levi Lopes de Lima; Frederico Gir„o

2012-06-25T23:59:59.000Z

417

Factor Graphs for Universal Portfolios Andrew J. Bean and Andrew C. Singer  

E-Print Network [OSTI]

transaction costs while taking advantage of side information. We introduce factor graphs as a computational of sequentially investing in a stock market where we have access to a side information sequence and we also must the ratio of the opening price of the jth stock on the (t + 1)th trading period to the opening price

Singer, Andrew C

418

Semantics Guided Filtering of Combinatorial Graph Transformations in Declarative Equation-Based Languages.  

E-Print Network [OSTI]

required to get the simulation working. The paper is organized as follows: Section 2 introduces Modelica, a new equation-based declarative language. Some specific Modelica language constructs necessary using Modelica. Section 5 gives some preliminary definitions related to the concept of bipartite graphs

Burns, Peter

419

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

E-Print Network [OSTI]

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

Banaji,. Murad

420

Affine Nested Loop Programs and their Binary Parameterized Dataflow Graph Counterparts  

E-Print Network [OSTI]

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

Bhattacharyya, Shuvra S.

Note: This page contains sample records for the topic "locations time-concentration graphs" 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

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

E-Print Network [OSTI]

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

King, Kuo Chin Irwin

422

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

E-Print Network [OSTI]

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

Batlle, Carles

423

Finite propagation speed for solutions of the wave equation on metric graphs  

E-Print Network [OSTI]

We provide a class of self-adjoint Laplace operators on metric graphs with the property that the solutions of the associated wave equation satisfy the finite propagation speed property. The proof uses energy methods, which are adaptions of corresponding methods for smooth manifolds.

Vadim Kostrykin; JŁrgen Potthoff; Robert Schrader

2011-06-04T23:59:59.000Z

424

Linear Prediction Models with Graph Regularization for Web-page Categorization  

E-Print Network [OSTI]

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

Zhang, Tong

425

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

E-Print Network [OSTI]

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

Lazos, Loukas

426

The stackelberg minimum spanning tree game on planar and bounded-treewidth graphs  

E-Print Network [OSTI]

The Stackelberg Minimum Spanning Tree Game is a two-level combinatorial pricing problem introduced at WADSí07. The game is played on a graph, whose edges are colored either red or blue, and where the red edges have a given ...

Cardinal, Jean

427

A Distributed Polylogarithmic Time Algorithm for Self-Stabilizing Skip Graphs  

E-Print Network [OSTI]

A Distributed Polylogarithmic Time Algorithm for Self-Stabilizing Skip Graphs Riko Jacob Dept. Computer Science Technische Universit√§t M√ľnchen D-85748 Garching bei M√ľnchen, Germany jacob or commercial advantage and that copies bear this notice and the full citation on the first page. To copy

Richa, Andrea Werneck

428

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

E-Print Network [OSTI]

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

Pfeifer, Holger

429

Predicting Protein Folds with Structural Repeats Using a Chain Graph Model  

E-Print Network [OSTI]

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

Xing, Eric P.

430

Multiple Aphid Resistance from Alien Sources and its Chromosomal Location  

E-Print Network [OSTI]

Multiple Aphid Resistance from Alien Sources and its Chromosomal Location in Bread Wheat Leonardo A Alien Sources and Its Chromosomal Location in Bread Wheat Abstract Wheat (Triticum aestivum) is a very of this thesis were to: 1) identify novel sources of resistance to multiple aphid species in a wheat-alien

431

WORKING PAPER N 2009 -11 Regulatory policy and the location  

E-Print Network [OSTI]

Pamina Koenig Megan MacGarvie JEL Codes: F23, I18 Keywords: Pharmaceutical industry, location choices: pharmaceutical industry, location choices, price regulations, discrete choice model This paper was prepared plants. The pharmaceutical industry is one example of this type of industry. The pharmaceutical industry

Paris-Sud XI, Université de

432

Predicting Debris-Slide Locations in Northwestern California1  

E-Print Network [OSTI]

Predicting Debris-Slide Locations in Northwestern California1 Mark E. Reid,2 Stephen D. Ellen,3 tested four topographic models for predicting locations of debris-slide sources: 1) slope; 2) proximity to stream; 3) SHALSTAB with "standard" parameters; and 4) debris-slide-prone landforms, which delineates

Standiford, Richard B.

433

Quest for Personal Control over Mobile Location Privacy Pradeep Khosla  

E-Print Network [OSTI]

live and work, offering the promise of bringing us close to the holy grail of information technology to be utilized. Many efforts have been made to get it available, as one of the key services in the ubiquitous the architecture, there is a centralized location server, where a mobile user can register and submit her location

Wu, Dapeng Oliver

434

Comparison of Different Methods for Next Location Prediction  

E-Print Network [OSTI]

Comparison of Different Methods for Next Location Prediction Jan Petzold, Faruk Bagci, Wolfgang prediction anticipates a person's movement based on the history of previous sojourns. It is useful location prediction methods: dynamic Bayesian network, multi-layer perceptron, Elman net, Markov predictor

Ungerer, Theo

435

Derivation of Locational Marginal Prices for Restructured Wholesale Power Markets  

E-Print Network [OSTI]

Derivation of Locational Marginal Prices for Restructured Wholesale Power Markets Haifeng Liu restructured wholesale power markets, the detailed derivation of LMPs as actually used in industry practice Operator (MISO). Keywords: Locational marginal pricing, wholesale power market, AC optimal power flow, DC

Tesfatsion, Leigh

436

Blind Channel Identification for the Emitter Location Problem  

E-Print Network [OSTI]

a thesis entitled "Blind Channel Identification for the Emitter Location Problem: A Least Square ApproachBlind Channel Identification for the Emitter Location Problem: A Least Square Approach BY Cheung C. Chau B.S.E.E., Binghamton University, 2000 Thesis Submitted in Partial Fulfillment of the Requirements

Fowler, Mark

437

Analysis of wet deposition at an urban location  

SciTech Connect (OSTI)

Wet deposition data collected at the Detroit Edison urban site provided a clear chemical profile at this location for the period studied. Correlations of major anions with acidity indicate that decreases in pH are associated with increases in sulfates and nitrates. However, other components not measured may have a bearing on pH reductions. The differences between two locations 70 km apart were quite small on the average. Strong local source influences at the urban location were not evident in the limited data set available for study. Wind direction can help determine the ultimate origins of pollutants.

Foltman, R.A.

1985-01-01T23:59:59.000Z

438

On covering planar graphs with a fixed number of balls Victor Chepoi, Bertrand Estellon, Yann Vax`es  

E-Print Network [OSTI]

On covering planar graphs with a fixed number of balls Victor Chepoi, Bertrand Estellon, Yann Vax`es¬īediterran¬īee, F-13288 Marseille Cedex 9, France, {chepoi,estellon,vaxes}@lif.univ-mrs.fr Abstract. In this note

Chepoi, Victor

439

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

E-Print Network [OSTI]

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

Babai, László

440

Lower bounds on the obstacle number of graphs Padmini Mukkamala1, Janos Pach2, and Domotor Palvolgyi3  

E-Print Network [OSTI]

Lower bounds on the obstacle number of graphs Padmini Mukkamala1, J¬īanos Pach2, and D¬®om¬®ot¬®or P are extensively studied and used in computational geometry, robot motion planning, computer vision, sensor

Pach, J√°nos

Note: This page contains sample records for the topic "locations time-concentration graphs" 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

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

E-Print Network [OSTI]

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

Gerren, Sally Sue

2008-10-10T23:59:59.000Z

442

Residential mobility and location choice: a nested logit model with sampling of alternatives  

E-Print Network [OSTI]

Waddell, P. : Modeling residential location in UrbanSim. In:D. (eds. ) Modelling Residential Location Choice. Springer,based model system and a residential location model. Urban

Lee, Brian H.; Waddell, Paul

2010-01-01T23:59:59.000Z

443

Short & long run transmission incentives for generation location  

E-Print Network [OSTI]

This paper is about one aspect of Britain's electricity trading system, its advantages and its weaknesses concerning the incentives it provides or fails to provide for the location of generation. (Similar considerations ...

Turvey, Ralph

2006-01-01T23:59:59.000Z

444

A Versatile Heuristic Approach for Generalized Hub Location ...  

E-Print Network [OSTI]

all costs. The hub location research has diverse sources but was standardized with the work of O'Kelly [15] and the following papers of Campbell [7, 8]. 1†...

2014-12-08T23:59:59.000Z

445

Location and Institution SOUTH AFRICA -PRETORIA FORDHAM UNIVERSITY -UBUNTU PROGRAM  

E-Print Network [OSTI]

Location and Institution SOUTH AFRICA - PRETORIA FORDHAM UNIVERSITY - UBUNTU demographics, and South Africa. Students will also take a required module in Sociology holders need a student visa to enter and study in South Africa, which must

Galles, David

446

New approach to the fault location problem using synchronized sampling  

E-Print Network [OSTI]

This thesis presents a new approach to solving the problem of fault location on a transmission line using synchronized data from both ends of the line. The synchronized phase voltage and current samples taken during the fault transient are used...

Mrkic, Jasna

2012-06-07T23:59:59.000Z

447

Icarus 168 (2004) 249256 www.elsevier.com/locate/icarus  

E-Print Network [OSTI]

Icarus 168 (2004) 249­256 www.elsevier.com/locate/icarus TRACE observations of the 15 November 1999 of an unpublished star atlas (Kilburn et al., 2003), reported on the 31 October 1736 and 25 October 1743 transits

Schneider, Glenn

448

Energy 29 (2004) 14671478 www.elsevier.com/locate/energy  

E-Print Network [OSTI]

Energy 29 (2004) 1467­1478 www.elsevier.com/locate/energy Sensitivity of sequestration efficiency-5442/$ - see front matter # 2004 Elsevier Ltd. All rights reserved. doi:10.1016/j.energy.2004.03.080 #12

Gnanadesikan, Anand

449

Infill location determination and assessment of corresponding uncertainty  

E-Print Network [OSTI]

tried to solve this problem with statistical approaches. In this study, a reservoir simulation based approach was used to select infill well locations. I used multiple reservoir realizations to take different possible outcomes into consideration...

Senel, Ozgur

2009-05-15T23:59:59.000Z

450

Scalable Energy Efficient Location Aware Multicast Protocol for MANET (SEELAMP)  

E-Print Network [OSTI]

Multicast plays an important role in implementing the group communications in bandwidth scarce multihop mobile ad hoc networks. However, due to the dynamic topology of MANETs it is very difficult to build optimal multicast trees and maintaining group membership, making even more challenging to implement scalable and robust multicast in Mobile Ad hoc Networks (MANET). A scalable and energy efficient location aware multicast algorithm, called SEELAMP, for mobile ad hoc networks is presented in the paper that is based on creation of shared tree using the physical location of the nodes for the multicast sessions. It constructs a shared bi-directional multicast tree for its routing operations rather than a mesh, which helps in achieving more efficient multicast delivery. The algorithm uses the concept of small overlapped zones around each node for proactive topology maintenance with in the zone. Protocol depends on the location information obtained using a distributed location service, which effectively reduces th...

Kamboj, Pariza

2010-01-01T23:59:59.000Z

451

Position: Forestry Intern Location: Lower Suwannee National Wildlife Refuge  

E-Print Network [OSTI]

Position: Forestry Intern Location: Lower Suwannee National Wildlife Refuge Application Process: Student Conservation Association (SCA) Forestry and biological Wildlife Refuge. This forestry position will be mostly field work within the Lower

Mazzotti, Frank

452

Rapid location of mount points JONATHAN M. SMITH  

E-Print Network [OSTI]

­­ ­­ Rapid location of mount points JONATHAN M. SMITH Computer Science Department, Columbia ``core'' is ``/u2/smith/core''. The current directory is a directory­valued variable. It is an implied

453

Microsoft Word - postdoc-career-fair-locations-maps.docx  

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

Los A lamos N ational L aboratory Postdoc C areer F air 2 014 Location of Events (Maps with driving instructions) Tuesday, S ept. 9 th Otowi B uilding, 3 rd F loor LANL, T A---03,...

454

Discrete Mathematics and Theoretical Computer Science DMTCS vol. 12:3, 2010, 6374 Covering codes in Sierpinski graphs  

E-Print Network [OSTI]

Discrete Mathematics and Theoretical Computer Science DMTCS vol. 12:3, 2010, 63¬≠74 Covering codesth May 2010. For a graph G and integers a and b, an (a, b)-code of G is a set C of vertices. In this paper we classify integers a and b for which there exist (a, b)-codes in Sierpi¬īnski graphs. Keywords

Paris-Sud XI, Université de

455

Predicting threshold and location of laser damage on optical surfaces  

DOE Patents [OSTI]

An apparatus useful in the prediction of the damage threshold of various optical devices, the location of weak spots on such devices and the location, identification, and elimination of optical surface impurities comprising, a focused and pulsed laser, an photo electric detector/imaging means, and a timer. The weak spots emit photoelectrons when subjected to laser intensities that are less than the intensity actually required to produce the damage. The weak spots may be eliminated by sustained exposure to the laser beam.

Siekhaus, Wigbert (Berkeley, CA)

1987-01-01T23:59:59.000Z

456

Graph Databases for Large-Scale Healthcare Systems: A Framework for Efficient Data Management and Data Services  

SciTech Connect (OSTI)

Designing a database system for both efficient data management and data services has been one of the enduring challenges in the healthcare domain. In many healthcare systems, data services and data management are often viewed as two orthogonal tasks; data services refer to retrieval and analytic queries such as search, joins, statistical data extraction, and simple data mining algorithms, while data management refers to building error-tolerant and non-redundant database systems. The gap between service and management has resulted in rigid database systems and schemas that do not support effective analytics. We compose a rich graph structure from an abstracted healthcare RDBMS to illustrate how we can fill this gap in practice. We show how a healthcare graph can be automatically constructed from a normalized relational database using the proposed 3NF Equivalent Graph (3EG) transformation.We discuss a set of real world graph queries such as finding self-referrals, shared providers, and collaborative filtering, and evaluate their performance over a relational database and its 3EG-transformed graph. Experimental results show that the graph representation serves as multiple de-normalized tables, thus reducing complexity in a database and enhancing data accessibility of users. Based on this finding, we propose an ensemble framework of databases for healthcare applications.

Park, Yubin [University of Texas at Austin] [University of Texas at Austin; Shankar, Mallikarjun [ORNL] [ORNL; Park, Byung H [ORNL] [ORNL; Ghosh, Dr. Joydeep [University of Texas at Austin] [University of Texas at Austin

2014-01-01T23:59:59.000Z

457

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

E-Print Network [OSTI]

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

Jens Bolte; Joachim Kerner

2014-11-26T23:59:59.000Z

458

Dynamic Motion Graphs Bjrn Krger1, Arno Zinke2, Andreas Weber1  

E-Print Network [OSTI]

Dynamic Motion Graphs Bj√∂rn Kr√ľger1, Arno Zinke2, Andreas Weber1 1Institute of Computer Science II, University of Bonn 2GfaR mbH, Bonn e-mail: {kruegerb, zinke, weber}@cs.uni-bonn.de Introduction Method result. [KTWZ10] KR√?GER, B., TAUTGES, J., WEBER, A., AND ZINKE, A. Fast local and global similarity

Bonn, Universität

459

ISOPERIMETRIC CONSTANT OF A k-REGULAR GRAPH (A NOTE ON A THEOREM OF  

E-Print Network [OSTI]

ISOPERIMETRIC CONSTANT OF A k-REGULAR GRAPH (A NOTE ON A THEOREM OF BIGGS, MOHAR, AND SHAWE.2 in the paper [BMS] of Biggs, Mohar, and Shawe-Taylor we have instead of (1) and (2): i #21; 4(1 #26;) , #26 that #26; #20; q 1 i 2 k 2 . References BMS. N. Biggs, B. Mohar, J. Shawe-Taylor, The spectral radius of in

Smirnova-Nagnibeda, Tatiana

460

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

SciTech Connect (OSTI)

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

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

2011-03-22T23:59:59.000Z

Note: This page contains sample records for the topic "locations time-concentration graphs" 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

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

E-Print Network [OSTI]

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

deYoung, Brad

462

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

E-Print Network [OSTI]

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

San-Juan, Eric

463

Experimental investigation of Wigner's reaction matrix for irregular graphs with absorption  

E-Print Network [OSTI]

We use tetrahedral microwave networks consisting of coaxial cables and attenuators connected by T-joints to make an experimental study of Wigner's reaction K matrix for irregular graphs in the presence of absorption. From measurements of the scattering matrix S for each realization of the microwave network we obtain distributions of the imaginary and real parts of K. Our experimental results are in good agreement with theoretical predictions.

Oleh Hul; Oleg Tymoshchuk; Szymon Bauch; Peter M. Koch; Leszek Sirko

2009-03-12T23:59:59.000Z

464

Predicting threshold and location of laser damage on optical surfaces  

DOE Patents [OSTI]

Disclosed is an apparatus useful in the prediction of the damage threshold of various optical devices, the location of weak spots on such devices and the location, identification, and elimination of optical surface impurities. The apparatus comprises a focused and pulsed laser, a photo electric detector/imaging means, and a timer. The weak spots emit photoelectrons when subjected to laser intensities that are less than the intensity actually required to produce the damage. The weak spots may be eliminated by sustained exposure to the laser beam.

Siekhaus, W.

1985-02-04T23:59:59.000Z

465

Method for locating metallic nitride inclusions in metallic alloy ingots  

DOE Patents [OSTI]

A method of determining the location and history of metallic nitride and/or oxynitride inclusions in metallic melts. The method includes the steps of labeling metallic nitride and/or oxynitride inclusions by making a coreduced metallic-hafnium sponge from a mixture of hafnium chloride and the chloride of a metal, reducing the mixed chlorides with magnesium, nitriding the hafnium-labeled metallic-hafnium sponge, and seeding the sponge to be melted with hafnium-labeled nitride inclusions. The ingots are neutron activated and the hafnium is located by radiometric means. Hafnium possesses exactly the proper metallurgical and radiochemical properties for this use.

White, Jack C. (Albany, OR); Traut, Davis E. (Corvallis, OR); Oden, Laurance L. (Albany, OR); Schmitt, Roman A. (Corvallis, OR)

1992-01-01T23:59:59.000Z

466

Icarus 182 (2006) 343349 www.elsevier.com/locate/icarus  

E-Print Network [OSTI]

Icarus 182 (2006) 343­349 www.elsevier.com/locate/icarus Solar wind plasma protrusion, Finland i Finnish Meteorological Institute, Box 503, FIN-00101 Helsinki, Finland j Space Physics Research. The peak electron energy often exceeds the peak energy at the bow shock that indicates a significant

California at Berkeley, University of

467

TWRS information locator database system administrator`s manual  

SciTech Connect (OSTI)

This document is a guide for use by the Tank Waste Remediation System (TWRS) Information Locator Database (ILD) System Administrator. The TWRS ILD System is an inventory of information used in the TWRS Systems Engineering process to represent the TWRS Technical Baseline. The inventory is maintained in the form of a relational database developed in Paradox 4.5.

Knutson, B.J., Westinghouse Hanford

1996-09-13T23:59:59.000Z

468

Location Coding for Mobile Image Retrieval Sam S. Tsai  

E-Print Network [OSTI]

Location Coding for Mobile Image Retrieval Sam S. Tsai , David Chen , Gabriel Takacs , Vijay, gtakacs, vijayc, bgirod}@stanford.edu, jatinder.singh@telekom.de ABSTRACT For mobile image retrieval images using a "bag-of-words" approach while the latter is used in a geometric consistency check to map

Girod, Bernd

469

COMMUNICATION Does the Location of a Mutation Determine the Ability  

E-Print Network [OSTI]

COMMUNICATION Does the Location of a Mutation Determine the Ability to Form Amyloid Fibrils? Marina by a domain swapping mechanism. Domain swapping is a specific means by which oligomeric proteins are formed that the mutations in our model system facilitate domain swapping as the pathway to amyloid for- mation (Figure 1(b

Regan, Lynne

470

Icarus 181 (2006) 302308 www.elsevier.com/locate/icarus  

E-Print Network [OSTI]

Icarus 181 (2006) 302≠308 www.elsevier.com/locate/icarus Near-infrared spectra of laboratory H2O could change peaks in the near-IR as well. This would complicate the interpretation of reflection online 13 December 2005 Abstract We present 1.25≠19 Ķm infrared spectra of pure solid CH4 and H2O/CH4

2006-01-01T23:59:59.000Z

471

Updated 09/30/2014 College & Department Advisor Phone Location  

E-Print Network [OSTI]

Updated 09/30/2014 College & Department Advisor Phone Location College of Agriculture 406 Linfield Agricultural Education Office Assigns Advisor 2132 230 Linfield Animal & Range Sciences Denise) Music Office Assigns Advisors 3562 189 Howard Business Office Assigns Advisors 4681 338 Reid Elementary

Maxwell, Bruce D.

472

Enhancing Location Privacy for Electric Vehicles (at the right time)  

E-Print Network [OSTI]

An electric vehicle (also known as EV) is powered by an electric motor instead of a gasoline engine sudden demands for power). In future development, it has been proposed that such use of electric vehiclesEnhancing Location Privacy for Electric Vehicles (at the right time) Joseph K. Liu1 , Man Ho Au2

473

Energy 25 (2000) 445461 www.elsevier.com/locate/energy  

E-Print Network [OSTI]

Energy 25 (2000) 445­461 www.elsevier.com/locate/energy A risk based heat exchanger analysis Ltd. All rights reserved. PII: S0360-5442(99)00081-X #12;446 A.K. Sheikh et al. / Energy 25 (2000) 445

Budair, Mohammed Omar

474

Energy 25 (2000) 427443 www.elsevier.com/locate/energy  

E-Print Network [OSTI]

Energy 25 (2000) 427­443 www.elsevier.com/locate/energy A risk based heat exchanger analysis;428 S.M. Zubair et al. / Energy 25 (2000) 427­443 Nomenclature A heat transfer area (m2 ) C fluid;429S.M. Zubair et al. / Energy 25 (2000) 427­443 max maximum min minimum r removal Superscripts

Budair, Mohammed Omar

475

Energy 28 (2003) 11831202 www.elsevier.com/locate/energy  

E-Print Network [OSTI]

Energy 28 (2003) 1183­1202 www.elsevier.com/locate/energy Minimum power requirement Ltd. All rights reserved. 1. Introduction The development of new energy systems for aircraft. doi:10.1016/S0360-5442(03)00105-1 #12;1184 J.C. Ordonez, A. Bejan / Energy 28 (2003) 1183

Ordonez, Juan C.

476

Structural Location of Disease-associated Single-nucleotide Polymorphisms  

E-Print Network [OSTI]

Structural Location of Disease-associated Single-nucleotide Polymorphisms Nathan O. Stitziel1 , Yan-synonymous single-nucleotide polymorphism (nsSNP) of genes introduces amino acid changes to proteins, and plays reserved Keywords: single-nucleotide polymorphism; alpha shape; hidden Markov model; surface pockets

Pervouchine, Dmitri D.

477

Lamar Fleming 564 1 1 UH Vending Locations  

E-Print Network [OSTI]

Lamar Fleming 564 1 1 UH Vending Locations Building Map Coke Snack Fresh Coffee Frozen Ice Cream A Basement 534 2 Hilton College 590 4 Houston Science Center 593 1 1 KUHT TV Bldg 536 2 1 1 Lamar Fleming 564

Azevedo, Ricardo

478

Energy 29 (2004) 1317 www.elsevier.com/locate/energy  

E-Print Network [OSTI]

round trip travel of 6100 km. For comparison, global aver- age annual per capita energy consumption with US Energy Information Administration fig- ures [10]. My dEnergy 29 (2004) 13­17 www.elsevier.com/locate/energy Brief Note Personal energy impact

Vermont, University of

479

Efficient Dynamic Programming for Optimal Multi-Location Robot Rendezvous  

E-Print Network [OSTI]

be utilized in real world robot applications. To demonstate the practical potential of our algorithm, we use in a state space with dimension greater than that of the individual robots. We use the application of multiEfficient Dynamic Programming for Optimal Multi-Location Robot Rendezvous Ken Alton and Ian M

Mitchell, Ian

480

Optimal Location of a Mobile Sensor Continuum for Environmental Monitoring  

E-Print Network [OSTI]

air pollution monitoring, seismic monitoring, or monitoring of large infrastructures in civil is proposed for the goal of optimal location of a mobile sensor continuum. The monitoring of pollution on a 2D or track distributed environmental phenomena (weather, seismic events, wildfires, air, soil or river

Boyer, Edmond

Note: This page contains sample records for the topic "locations time-concentration graphs" 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

VEHICLE USE RECORD M/Y DEPARTMENT VEHICLE LOCATION  

E-Print Network [OSTI]

VEHICLE USE RECORD M/Y DEPARTMENT VEHICLE LOCATION Date Origin/Destination Purpose Time Out Time) Accuracy of Information (b) Valid Driver's License VEHICLE # TAG # VEHICLE MAKE, MODEL, AND YEAR NOTE: Vehicle logs must be maintained for audit purposes. It is important that all of the required information

Watson, Craig A.

482

Icarus 188 (2007) 535539 www.elsevier.com/locate/icarus  

E-Print Network [OSTI]

.9 GW (Spencer et al., 2006). So some heating mechanism provides about 6 GW of energy to the system bodies is the same. Thus conventional tidal heating in the current orbital configuration does not passIcarus 188 (2007) 535­539 www.elsevier.com/locate/icarus Note Tidal heating in Enceladus Jennifer

Wisdom, Jack

483

Building and Facility Codes Code Building Location Bldg # Coordinates  

E-Print Network [OSTI]

Building and Facility Codes Code Building Location Bldg # Coordinates APM Applied Physics & Mathematics Building Muir 249 F7 ASANT Asante Hall Eleanor Roosevelt 446 F5 BIO Biology Building Muir 259 F7 BIRCH Birch Aquarium SIO 2300 S-D7 BONN Bonner Hall Revelle 131 G8 BSB Biomedical Sciences Building

Russell, Lynn

484

1 INTRODUCTION The geothermal Bouillante area is located on the  

E-Print Network [OSTI]

1 INTRODUCTION The geothermal Bouillante area is located on the western coast of Basse and isotopic composition of the deep geothermal fluids using well and spring waters. The predictable nature the production stage and for future exploration drilling related to the development of the geothermal field. 2

Paris-Sud XI, Université de

485

Double Difference Earthquake Locations at the Salton Sea Geothermal Reservoir  

SciTech Connect (OSTI)

The purpose of this paper is to report on processing of raw waveform data from 4547 events recorded at 12 stations between 2001 and 2005 by the Salton Sea Geothermal Field (SSGF) seismic network. We identified a central region of the network where vertically elongated distributions of hypocenters have previously been located from regional network analysis. We process the data from the local network by first autopicking first P and S arrivals; second, improving these with hand picks when necessary; then, using cross-correlation to provide very precise P and S relative arrival times. We used the HypoDD earthquake location algorithm to locate the events. We found that the originally elongated distributions of hypocenters became more tightly clustered and extend down the extent of the study volume at 10 Km. However, we found the shapes to depend on choices of location parameters. We speculate that these narrow elongated zones of seismicity may be due to stress release caused by fluid flow.

Boyle, K L; Hutchings, L J; Bonner, B P; Foxall, W; Kasameyer, P W

2007-08-08T23:59:59.000Z

486

Nearoptimal solutions to large scale facility location problems  

E-Print Network [OSTI]

instances of size m \\Theta n = 3000 \\Theta 3000; for the capacitated case the largest instances were 1000 widely broad area of applications many heuristics have been devised to solve it. Among these, the most report our computational experience with problems with up to 3000 potential facility locations

Chudak, Fabian

487

Icarus 193 (2008) 387396 www.elsevier.com/locate/icarus  

E-Print Network [OSTI]

in the ice-shell thickness. For Enceladus, we demonstrate that an Onset I transition can produce tectonicIcarus 193 (2008) 387­396 www.elsevier.com/locate/icarus Thermal convection in ice-I shells­450] investigated the dynamics of an ice shell overlying a pure liquid-water ocean and showed that transitions from

488

Location-Based Tax Incentives: Evidence From India Ritam Chaurey  

E-Print Network [OSTI]

in India. Specifically, I examine the federally financed New Industrial Policy for the statesLocation-Based Tax Incentives: Evidence From India Ritam Chaurey Department of Economics, State University of New York, Binghamton August 24, 2014 Abstract While policies targeting particular geographic

Bandyopadhyay, Antar

489

Seismic Event Location: Nonlinear Inversion Using a Neighbourhood Algorithm  

E-Print Network [OSTI]

is an important part of seismological practice with a wide range of applications, but has particularly signi and the majority of natural earthquakes is provided by the depth of the source. Drilling techniques there is a need to obtain the best possible location by combining data from regional and more distant stations

Sambridge, Malcolm

490

Location and Geology Fig 1. The Macasty black shale  

E-Print Network [OSTI]

, Quebec, is organic-rich black shale and hosting oil and gas. It is equivalent to the Ithaca shaleLocation and Geology Fig 1. The Macasty black shale in the Anticosti Island in the Gulf of St. d13C for calcite disseminated in the black shale range from 2.6o to 2.8 / The values are lower

491

On the Irreps of the N-Extended Supersymmetric Quantum Mechanics and Their Fusion Graphs  

E-Print Network [OSTI]

In this talk we review the classification of the irreducible representations of the algebra of the N-extended one-dimensional supersymmetric quantum mechanics presented in hep-th/0511274. We answer some issues raised in hep-th/0611060, proving the agreement of the results here contained with those in hep-th/0511274. We further show that the fusion algebra of the 1D N-extended supersymmetric vacua introduced in hep-th/0511274 admits a graphical presentation. The N=2 graphs are here explicitly presented for the first time.

Francesco Toppan

2006-12-27T23:59:59.000Z

492

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

E-Print Network [OSTI]

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

Yang, Bencai

1997-01-01T23:59:59.000Z

493

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

494

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

E-Print Network [OSTI]

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

Mihailo Backovic; Kyoungchul Kong; Mathew McCaskey

2014-04-24T23:59:59.000Z

495

Experimental and numerical investigation of the reflection coefficient and the distributions of Wigner's reaction matrix for irregular graphs with absorption  

E-Print Network [OSTI]

We present the results of experimental and numerical study of the distribution of the reflection coefficient P(R) and the distributions of the imaginary P(v) and the real P(u) parts of the Wigner's reaction K matrix for irregular fully connected hexagon networks (graphs) in the presence of strong absorption. In the experiment we used microwave networks, which were built of coaxial cables and attenuators connected by joints. In the numerical calculations experimental networks were described by quantum fully connected hexagon graphs. The presence of absorption introduced by attenuators was modelled by optical potentials. The distribution of the reflection coefficient P(R) and the distributions of the reaction K matrix were obtained from the measurements and numerical calculations of the scattering matrix S of the networks and graphs, respectively. We show that the experimental and numerical results are in good agreement with the exact analytic ones obtained within the framework of random matrix theory (RMT).

Michal Lawniczak; Oleh Hul; Szymon Bauch; Petr Seba; Leszek Sirko

2009-03-18T23:59:59.000Z

496

A preliminary version appeared in Advances in Cryptology --Asiacrypt'02. This is a revised version. The Provable Security of GraphBased OneTime Signatures and  

E-Print Network [OSTI]

A preliminary version appeared in Advances in Cryptology -- Asiacrypt'02. This is a revised version based on ``graphs of one≠way functions''. Bleichen≠ bacher and Maurer thoroughly analyze graph based . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 3 The GBOTS construction 7 4 The Reduction 8 4.1 Inverting H

Hevia, Alejandro

497

A preliminary version appeared in Advances in Cryptology Asiacrypt'02. This is a revised version. The Provable Security of Graph-Based One-Time Signatures and  

E-Print Network [OSTI]

A preliminary version appeared in Advances in Cryptology ≠ Asiacrypt'02. This is a revised version based on "graphs of one-way functions". Bleichen- bacher and Maurer thoroughly analyze graph based . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 3 The GBOTS construction 7 4 The Reduction 8 4.1 Inverting H

Hevia, Alejandro

498

System and method for optically locating microchannel positions  

DOE Patents [OSTI]

A system and method is disclosed for optically locating a microchannel position. A laser source generates a primary laser beam which is directed at a microchannel plate. The microchannel plates include microchannels at various locations. A back-reflectance beam detector receives a back-reflected beam from the plate. The back-reflected beam is generated when the primary beam reflects off of the plate. A photodiode circuit generates a trigger signal when the back-reflected beam exceeds a predetermined threshold, indicating a presence of the microchannel. The method of the present invention includes the steps of generating a primary beam, directing the primary beam to a plate containing a microchannel, receiving from the plate a back-reflected beam generated in response to the primary beam, and generating a trigger signal when the back-reflected beam exceeds a predetermined threshold which corresponds to a presence of the microchannel.

Brewer, Laurence R. (Oakland, CA); Kimbrough, Joseph (Pleasanton, CA); Balch, Joseph (Livermore, CA); Davidson, J. Courtney (Livermore, CA)

2001-01-01T23:59:59.000Z

499

Helicopter Surveys for Locating Wells and Leaking Oilfield Infrastructure  

SciTech Connect (OSTI)

Prior to the injection of CO2 into geological formations, either for enhanced oil recovery or for CO2 sequestration, it is necessary to locate wells that perforate the target formation and are within the radius of influence for planned injection wells. Locating and plugging wells is necessary because improperly plugged well bores provide the most rapid route for CO2 escape to the surface. This paper describes the implementation and evaluation of helicopter and ground-based well detection strategies at a 100+ year old oilfield in Wyoming where a CO2 flood is planned. This project was jointly funded by the U.S. Department of Energyís National Energy Technology Laboratory and Fugro Airborne Surveys

Hammack, R.W.; Veloski, G.A.; Hodges, G. (Fugro Airborne Surveys)

2006-10-01T23:59:59.000Z

500

Mapping the location and configuration of nitrogen in diamond nanoparticles.  

SciTech Connect (OSTI)

Understanding how impurities such as nitrogen are included in diamond nanoparticles is expected to be important for use in future nanodevices, such as qubits for quantum computing. Most commercial diamond nanoparticles contain approximately 2-3% nitrogen, but it is difficult to determine experimentally whether it is located within the core or at the surface of the nanoparticles. Presented here are density functional tight-binding simulations examining the configuration and potential energy surface of substitutional nitrogen in diamond nanoparticles, directly comparing results of different sizes, shapes and surface chemistry. The results predict that nitrogen is metastable within the core of both hydrogenated and dehydrogenated particles, but that the binding energy, coordination and preferred location is dependent upon the structure of the nanoparticle as a whole.

Barnard, A. S.; Sternberg, M.; Center for Nanoscale Materials; Univ. of Oxford

2007-01-17T23:59:59.000Z