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

Locating-total domination in graphs  

Science Journals Connector (OSTI)

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

Michael A. Henning; Nader Jafari Rad

2012-01-01T23:59:59.000Z

2

Locating-total domination in claw-free cubic graphs  

Science Journals Connector (OSTI)

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

Michael A. Henning; Christian Löwenstein

2012-01-01T23:59:59.000Z

3

LD-graphs and global location-domination in bipartite graphs  

Science Journals Connector (OSTI)

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

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

2014-01-01T23:59:59.000Z

4

Locating and paired-dominating sets in graphs  

Science Journals Connector (OSTI)

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

John McCoy; Michael A. Henning

2009-01-01T23:59:59.000Z

5

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

Science Journals Connector (OSTI)

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

Florent Foucaud

2014-01-01T23:59:59.000Z

6

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

Science Journals Connector (OSTI)

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

Irčne Charon; Olivier Hudry; Antoine Lobstein

2003-01-01T23:59:59.000Z

7

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

8

Appendix D Surface Water and Ground Water Time-Concentration Plots,  

Office of Legacy Management (LM)

Surface Water and Ground Water Time-Concentration Plots, Surface Water and Ground Water Time-Concentration Plots, Stream Discharge Measurements, Ground Water Level Data, and Ground Water Well Hydrographs This page intentionally left blank Contents Section .................................................................................. Surface Water Time-Concentration Plots D1.O ............................................................................................... Stream Discharge Measurements D2.0 ............................................................. Ground Water Time-Concentration Plots for Uranium D3.0 .......................................................................................................... Ground Water Level Data D4.0 ..............................................................................................

9

3-Rainbow Domination Number in Graphs  

Science Journals Connector (OSTI)

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

Kung-Jui Pai; Wei-Jai Chiu

2013-01-01T23:59:59.000Z

10

Graph Algorithms Special Sets in Graphs  

E-Print Network (OSTI)

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

Bar-Noy, Amotz

11

Graph Algorithms Edge Coloring  

E-Print Network (OSTI)

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

Bar-Noy, Amotz

12

Graph Algorithms Robert Elsasser  

E-Print Network (OSTI)

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

Elsässer, Robert

13

PDSF Utilization Graphs  

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

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

14

Graph Visualization API Library for Application Builders  

Science Journals Connector (OSTI)

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

François Bertault; Wendy Feng; Uli Föµeier; Gabe Grigorescu…

2002-01-01T23:59:59.000Z

15

Nordhaus–Gaddum bounds for locating domination  

Science Journals Connector (OSTI)

Abstract A dominating set S of graph G is called metric-locating–dominating if it is also locating, that is, if every vertex v is uniquely determined by its vector of distances to the vertices in S . If moreover, every vertex v not in S is also uniquely determined by the set of neighbors of v belonging to S , then it is said to be locating–dominating. Locating, metric-locating–dominating and locating–dominating sets of minimum cardinality are called ? -codes, ? -codes and ? -codes, respectively. A Nordhaus–Gaddum bound is a tight lower or upper bound on the sum or product of a parameter of a graph G and its complement G Ż . In this paper, we present some Nordhaus–Gaddum bounds for the location number ? , the metric-location–domination number ? and the location–domination number ? . Moreover, in each case, the graph family attaining the corresponding bound is fully characterized.

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

2014-01-01T23:59:59.000Z

16

Graph Algorithms Vertex Coloring  

E-Print Network (OSTI)

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

Bar-Noy, Amotz

17

Graph algorithms experimentation facility  

E-Print Network (OSTI)

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

Sonom, Donald George

2012-06-07T23:59:59.000Z

18

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

19

Parasupersymmetry in Quantum Graphs  

E-Print Network (OSTI)

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

Satoshi Ohya

2012-10-29T23:59:59.000Z

20

Parasupersymmetry in Quantum Graphs  

E-Print Network (OSTI)

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

Ohya, Satoshi

2012-01-01T23:59:59.000Z

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

Graph Algorithms Robert Elsasser  

E-Print Network (OSTI)

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

Elsässer, Robert

22

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

23

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

24

Spectral Graph Theory  

E-Print Network (OSTI)

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

*D. J. Kelleher

2011-09-30T23:59:59.000Z

25

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

26

GraphState - a tool for graph identification and labelling  

E-Print Network (OSTI)

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

Batkovich, D; Kompaniets, M; Novikov, S

2014-01-01T23:59:59.000Z

27

GraphState - a tool for graph identification and labelling  

E-Print Network (OSTI)

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

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

2014-09-29T23:59:59.000Z

28

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

29

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

30

Graph degree linkage: agglomerative clustering on a directed graph  

Science Journals Connector (OSTI)

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

Wei Zhang; Xiaogang Wang; Deli Zhao; Xiaoou Tang

2012-10-01T23:59:59.000Z

31

Kinetic Pie Delaunay Graph and Its Applications  

Science Journals Connector (OSTI)

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

Mohammad Ali Abam; Zahed Rahmati; Alireza Zarei

2012-01-01T23:59:59.000Z

32

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

33

Exploring the role of graph spectra in graph coloring algorithm performance  

Science Journals Connector (OSTI)

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

Kate Smith-Miles, Davaatseren Baatar

2014-10-01T23:59:59.000Z

34

Locating and identifying codes in circulant networks  

Science Journals Connector (OSTI)

A set S of vertices of a graph G is a dominating set of G if every vertex u of G is either in S or it has a neighbour in S. In other words, S is dominating if the sets S@?N[u] where u@?V(G) and N[u] denotes the closed neighbourhood of u in G, are all ... Keywords: Circulant network, Domination, Identifying code, Locating code, Locating-dominating set

M. Ghebleh; L. Niepel

2013-09-01T23:59:59.000Z

35

Exact algorithm for graph homomorphism and locally injective graph homomorphism  

Science Journals Connector (OSTI)

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

Pawe? Rzewski

2014-07-01T23:59:59.000Z

36

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

37

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

38

Fast iterative graph computation with block updates  

Science Journals Connector (OSTI)

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

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

2013-09-01T23:59:59.000Z

39

L21: "Irregular" Graph Algorithms  

E-Print Network (OSTI)

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

Hall, Mary W.

40

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

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

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

42

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

43

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

44

Some Remarks on Definability of Process Graphs  

E-Print Network (OSTI)

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

Klop, Jan Willem

45

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

46

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

E-Print Network (OSTI)

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

Deville, Yves

47

Liar’s domination in graphs  

Science Journals Connector (OSTI)

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

Miranda L. Roden; Peter J. Slater

2009-01-01T23:59:59.000Z

48

Transforming a graph into a 1-balanced graph  

Science Journals Connector (OSTI)

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

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

2009-01-01T23:59:59.000Z

49

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

50

Graph anomalies in cyber communications  

SciTech Connect

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

51

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

Science Journals Connector (OSTI)

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

Jolie Bell; Jim Davies

2010-01-01T23:59:59.000Z

52

Multilevel spectral clustering : graph partitions and image segmentation  

E-Print Network (OSTI)

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

Kong, Tian Fook

2008-01-01T23:59:59.000Z

53

Algebraic connectivity and graph robustness.  

SciTech Connect

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

54

SLQ: a user-friendly graph querying system  

Science Journals Connector (OSTI)

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

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

2014-06-01T23:59:59.000Z

55

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

56

On Edge Szeged Index of Bridge Graphs  

Science Journals Connector (OSTI)

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

Fuqin Zhan; Youfu Qiao

2013-01-01T23:59:59.000Z

57

Open neighborhood locating–dominating in trees  

Science Journals Connector (OSTI)

For a graph G that models a facility or a multiprocessor network, detection devices can be placed at the vertices so as to identify the location of an intruder such as a thief or saboteur or a faulty processor. Open neighborhood locating–dominating sets are of interest when the intruder/fault at a vertex precludes its detection at that location. The parameter OLD ( G ) denotes the minimum cardinality of a vertex set S ? V ( G ) such that for each vertex v in V ( G ) its open neighborhood N ( v ) has a unique non-empty intersection with S . For a tree T n of order n we have ? n / 2 ? + 1 ? OLD ( T n ) ? n ? 1 . We characterize the trees that achieve these extremal values.

Suk J. Seo; Peter J. Slater

2011-01-01T23:59:59.000Z

58

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

59

Hybrid motion graph for character motion synthesis  

Science Journals Connector (OSTI)

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

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

2014-02-01T23:59:59.000Z

60

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.

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

Locating and identifying codes in circulant networks  

Science Journals Connector (OSTI)

Abstract A set S of vertices of a graph G is a dominating set of G if every vertex u of G is either in S or it has a neighbour in  S . In other words, S is dominating if the sets S ? N [ u ] where u ? V ( G ) and N [ u ] denotes the closed neighbourhood of u in G , are all nonempty. A set S ? V ( G ) is called a locating code in G , if the sets S ? N [ u ] where u ? V ( G ) ? S are all nonempty and distinct. A set S ? V ( G ) is called an identifying code in G , if the sets S ? N [ u ] where u ? V ( G ) are all nonempty and distinct. We study locating and identifying codes in the circulant networks  C n ( 1 , 3 ) . For an integer n ? 7 , the graph C n ( 1 , 3 ) has vertex set Z n and edges x y where x , y ? Z n and | x ? y | ? { 1 , 3 } . We prove that a smallest locating code in C n ( 1 , 3 ) has size ? n / 3 ? + c , where c ? { 0 , 1 } , and a smallest identifying code in C n ( 1 , 3 ) has size ? 4 n / 11 ? + c ? , where c ? ? { 0 , 1 } .

M. Ghebleh; L. Niepel

2013-01-01T23:59:59.000Z

62

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

63

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

64

Constrained Graph Optimization: Interdiction and Preservation Problems  

SciTech Connect

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

Schild, Aaron V [Los Alamos National Laboratory

2012-07-30T23:59:59.000Z

65

On -locating–dominating sets in paths  

Science Journals Connector (OSTI)

Assume that G = ( V , E ) is a simple undirected graph, and C is a nonempty subset of V . For every v ? V , we define I r ( v ) = { u ? C ? d G ( u , v ) ? r } , where d G ( u , v ) denotes the number of edges on any shortest path between u and v . If the sets I r ( v ) for v ? C are pairwise different, and none of them is the empty set, we say that C is an r -locating–dominating set in G . It is shown that the smallest 2-locating–dominating set in a path with n vertices has cardinality ? ( n + 1 ) / 3 ? , which coincides with the lower bound proved earlier by Bertrand, Charon, Hudry and Lobstein. Moreover, we give a general upper bound which improves a result of Bertrand, Charon, Hudry and Lobstein.

Iiro Honkala

2009-01-01T23:59:59.000Z

66

Security of graph data: hashing schemes and definitions  

Science Journals Connector (OSTI)

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

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

2014-03-01T23:59:59.000Z

67

API Requirements for Dynamic Graph Prediction  

SciTech Connect

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

Gallagher, B; Eliassi-Rad, T

2006-10-13T23:59:59.000Z

68

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

E-Print Network (OSTI)

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

Dave

2012-03-20T23:59:59.000Z

69

On real number labelings and graph invertibility  

Science Journals Connector (OSTI)

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

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

2012-10-01T23:59:59.000Z

70

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

71

Generating Reports & Graphs in Portfolio Manager  

Energy.gov (U.S. Department of Energy (DOE))

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

72

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

73

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

74

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

75

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

76

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

77

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

78

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

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

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

79

Optimal -locating–dominating codes in the infinite king grid  

Science Journals Connector (OSTI)

Abstract Assume that G = ( V , E ) is an undirected graph with vertex set V and edge set E . The ball B r ( v ) denotes the vertices within graphical distance r from v . A subset C ? V is called an ( r , ? l ) -locating–dominating code of type B if the sets I r ( F ) = ? v ? F ( B r ( v ) ? C ) are distinct for all subsets F ? V ? C with at most l vertices. We give examples of optimal ( r , ? 3 ) -locating–dominating codes of type B in the infinite king grid for all r ? N + and prove optimality. The infinite king grid is the graph with vertex set Z 2 and edge set { { ( x 1 , y 1 ) , ( x 2 , y 2 ) } ? | x 1 ? x 2 | ? 1 , | y 1 ? y 2 | ? 1 } .

Mikko Pelto

2013-01-01T23:59:59.000Z

80

Locating–dominating codes: Bounds and extremal cardinalities  

Science Journals Connector (OSTI)

Abstract In this work, two types of codes such that they both dominate and locate the vertices of a graph are studied. Those codes might be sets of detectors in a network or processors controlling a system whose set of responses should determine a malfunctioning processor or an intruder. Here, we present our contributions on ? -codes and ? -codes concerning bounds, extremal values and realization theorems.

José Cáceres; Carmen Hernando; Mercč Mora; Ignacio M. Pelayo; María Luz Puertas

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


81

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

National Nuclear Security Administration (NNSA)

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

82

ARM - Instrument Location Table  

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

govInstrumentsLocation Table govInstrumentsLocation Table Instruments Location Table Contacts Comments? We would love to hear from you! Send us a note below or call us at 1-888-ARM-DATA. Send Instrument Locations Site abbreviations explained in the key. Instrument Name Abbreviation NSA SGP TWP AMF C1 C2 EF BF CF EF IF C1 C2 C3 EF IF Aerosol Chemical Speciation Monitor ACSM Atmospheric Emitted Radiance Interferometer AERI Aethalometer AETH Ameriflux Measurement Component AMC Aerosol Observing System AOS Meteorological Measurements associated with the Aerosol Observing System AOSMET Broadband Radiometer Station BRS

83

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

84

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

85

Extremal optimization for graph partitioning Stefan Boettcher*  

E-Print Network (OSTI)

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

Percus, Allon

86

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

87

Feature Tracking Using Reeb Graphs  

SciTech Connect

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

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

2010-08-02T23:59:59.000Z

88

Path Integral on Star Graph  

E-Print Network (OSTI)

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

Satoshi Ohya

2011-04-28T23:59:59.000Z

89

Path Integral on Star Graph  

E-Print Network (OSTI)

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

Ohya, Satoshi

2011-01-01T23:59:59.000Z

90

Locating–paired-dominating sets in square grids  

Science Journals Connector (OSTI)

Abstract A set S of vertices of a graph G is paired-dominating if S induces a matching in G and S dominates all vertices of G . A set S ? V ( G ) is locating if for any two distinct vertices u , v ? V ( G ) ? S , N ( u ) ? S ? N ( v ) ? S , where N ( u ) and N ( v ) are open neighborhoods of vertices u and v . We give a complete characterization of locating–paired-dominating sets with minimal density in the infinite square grid Z 2 .

?udovít Niepel

2014-01-01T23:59:59.000Z

91

Approximate von Neumann entropy for directed graphs  

Science Journals Connector (OSTI)

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

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

2014-05-12T23:59:59.000Z

92

Measuring extremal dependencies in Web graphs Yana Volkovich  

E-Print Network (OSTI)

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

Boucherie, Richard J.

93

Measuring Extremal Dependencies in Web Graphs Yana Volkovich  

E-Print Network (OSTI)

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

Boucherie, Richard J.

94

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

95

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

96

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.

97

Optimal acyclic edge colouring of grid like graphs  

Science Journals Connector (OSTI)

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

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

2010-11-01T23:59:59.000Z

98

Discrete Mathematics Algebraic and Topological Methods in Graph Theory  

E-Print Network (OSTI)

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

Mohar, Bojan

99

Fibonacci-like cubes as Z-transformation graphs  

Science Journals Connector (OSTI)

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

Heping Zhang, Lifeng Ou, Haiyuan Yao

2009-04-01T23:59:59.000Z

100

Discrete Applied Mathematics 121 (2002) 139153 NeST graphs  

E-Print Network (OSTI)

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

Hayward, Ryan B.

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

Entrance Maze Locations  

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

Entrance Maze Locations Entrance Maze Locations for the Storage Ring Tunnel Martin Knott LS-83 2/17/87 The Purpose of this note is to document the locations and decision rationale of the entrance mazes for the APS storage ring. There are a total of seven entrance mazes, four on the infield side and three on the operating floor side of the ring. Three of the infield mazes are associated with infield buildings, one in the Extraction Building and one each in the two RF Buildings. These three were located to provide convenient passage between the technical buildings and the storage ring components associated with those buildings. The Extraction Building maze allows passage between the positron beam transfer area and the storage ring two sectors upstream of the injection

102

Reading Room Locations  

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

FOIA Offices and Reading Rooms FOIA Offices and Reading Rooms FOIA Office Locations Our FOIA Officers are located at various sites throughout the DOE complex, each with responsibility for records located at or under the jurisdiction of the site. We recommend that you send your request directly to that specific site. This will shorten the processing time. However, if you do not know which location has responsive records, you may either call the Headquarters FOIA office at (202) 586-5955 to determine the appropriate office, or mail the request to the Headquarters FOIA office. Other records are publicly available in the facilities listed below: Headquarters U.S. Department of Energy FOIA/Privacy Act Group 1000 Independence Avenue, SW Washington, D.C. 20585 Phone: 202-586-5955 Fax: 202-586-0575

103

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

104

International land rig locator  

SciTech Connect

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

105

International land rig locator  

SciTech Connect

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

106

Bounds on the locating-total domination number of a tree  

Science Journals Connector (OSTI)

In this paper, we continue the study of locating-total domination in graphs, introduced by Haynes et al. [T.W. Haynes, M.A. Henning, J. Howard, Locating and total dominating sets in trees, Discrete Applied Mathematics 154 (8) (2006) 1293–1300]. A total dominating set S in a graph G = ( V , E ) is a locating-total dominating set of G if, for every pair of distinct vertices u and v in V ? S , N G ( u ) ? S ? N G ( v ) ? S . The minimum cardinality of a locating-total dominating set is the locating-total domination number ? t L ( G ) . We show that, for a tree T of order n ? 3 with l leaves and s support vertices, n + l + 1 2 ? s ? ? t L ( T ) ? n + l 2 . Moreover, we constructively characterize the extremal trees achieving these bounds.

Xue-gang Chen; Moo Young Sohn

2011-01-01T23:59:59.000Z

107

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

108

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.

109

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

110

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

111

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

112

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

113

Bipartite graph partitioning and data clustering  

SciTech Connect

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

114

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

115

Progressive transitions using body part motion graphs  

Science Journals Connector (OSTI)

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

Adso Fernández-Baena; David Miralles

2011-12-01T23:59:59.000Z

116

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.

117

A Faster Algorithm for Computing Motorcycle Graphs  

Science Journals Connector (OSTI)

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

Antoine Vigneron, Lie Yan

2014-10-01T23:59:59.000Z

118

About equivalent interval colorings of weighted graphs  

Science Journals Connector (OSTI)

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

Mathieu Bouchard; Mirjana angalovi?; Alain Hertz

2009-10-01T23:59:59.000Z

119

Accelerating semantic graph databases on commodity clusters  

SciTech Connect

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

120

location | OpenEI  

Open Energy Info (EERE)

location location Dataset Summary Description No description given. Source Oak Ridge National Laboratory Date Released November 30th, 2009 (5 years ago) Date Updated Unknown Keywords biodiesel ethanol location production capacity transportation Data application/zip icon Biorefineries.zip (zip, 7 MiB) Quality Metrics Level of Review Some Review Comment Temporal and Spatial Coverage Frequency Time Period License License Other or unspecified, see optional comment below Comment Rate this dataset Usefulness of the metadata Average vote Your vote Usefulness of the dataset Average vote Your vote Ease of access Average vote Your vote Overall rating Average vote Your vote Comments Login or register to post comments If you rate this dataset, your published comment will include your rating.

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

Pine Tree Growth Locations  

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

Pine Tree Growth Locations Pine Tree Growth Locations Name: Amielee Location: N/A Country: N/A Date: N/A Question: Why do pine trees not grow south of the equator? Replies: Dear Amielee, The natural distribution of the pines is the northern hemisphere: http://phylogeny.arizona.edu/tree/eukaryotes/green_plants/embryophytes/conif ers/pinaceae/pinus/pinus.html However, pines have become introduced into the southern hemisphere through cultivation: http://www.woodweb.com/~treetalk/Radiata_Pine/wowhome.html Sincerely, Anthony R. Brach, Ph.D. Hi Amielee Some pine trees do live south of the equator but we (I live in Australia) do not have the huge forests of native conifers that you have in the northern hemisphere. Even in the northern hemisphere conifers are only found in two forest types: 1. Tiaga

122

Graph representation of protein free energy landscape  

SciTech Connect

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

123

University Location Project Description  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

Location Project Description Location Project Description Boise State University Boise, Idaho Boise State University has undertaken a study of the structural setting and geothermal potential at Neal Hot Springs that will integrate geology, geochemistry, and geophysics to analyze the site on the western Snake River plain. Boise State will determine if Neal Hot Springs sustains the necessary rock dilation and conduit pathways for hydrothermal fluid flow and successful geothermal development. The result will be new data acquisition, including a deep geophysical survey and fault surface data. Colorado School of Mines Golden, Colorado Colorado School of Mines will conduct an investigation near Homedale, Idaho, an area that straddles volcanic rock and unconsolidated sediments.

124

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

125

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

126

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

E-Print Network (OSTI)

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

Durocher, Stephane

127

An optimal locating-dominating set in the infinite triangular grid  

Science Journals Connector (OSTI)

Assume that G = ( V , E ) is an undirected graph, and C ? V . For every v ? V , we denote by I ( v ) the set of all elements of C that are within distance one from v . If all the sets I ( v ) for v ? V ? C are non-empty, and pairwise different, then C is called a locating-dominating set. The smallest possible density of a locating-dominating set in the infinite triangular grid is shown to be 13 57 .

Iiro Honkala

2006-01-01T23:59:59.000Z

128

Clean Cities: Coalition Locations  

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

Locations Locations Clean Cities coalitions are primarily located in major metropolitan areas throughout the United States. Select the dots on the map for information about individual coalitions. See also the list of coalitions by designation date. United States map showing Clean Cities Coalition locations. Philadelphia State of Delaware Capitol Clean Cities of Connecticut Connecticut Southwestern Area New Haven Norwich Red River Valley (Grand Forks, Winnipeg, Manitoba, Canada) Silicon Valley (San Jose) East Bay (Oakland) San Francisco Sacramento Granite State State of Vermont Northeast Ohio Clean Transportation (Cleveland) Detroit Clean Communities of Western New York (Buffalo) Central New York (Syracuse) Capital District (Albany) Empire Clean Cities State of Maryland Washington DC Metropolitan South Shore Western Riverside County Southern California Association of Governments (SCAG) Atlanta Alabama Denver Philadelphia State of Delaware Las Vegas Washington DC Metropolitan Massachusetts Clean Cities Lone Star Clean Fuels Alliance (Austin) Southeast Florida Chicago Land of Enchantment Wisconsin-Southeast Area Southern Colorado Clean Cities Coalition Long Beach Antelope Valley Utah Clean Cities State of Maryland Kentucky Clean Cities Partnership Coalition Rogue Valley State of West Virginia San Joaquin Valley San Francisco Columbia-Willamette St. Louis Central New York (Syracuse) Dallas/Ft. Worth Honolulu Central Arkansas Pittsburgh Southern California Association of Governments (SCAG) Los Angeles Coachella Valley Region Northern Colorado Central Oklahoma (Oklahoma City) Virginia Clean Cities Coalition San Diego Regional Clean Cities Coalition Greater Long Island Maine Clean Communities Tulsa Valley of the Sun (Phoenix) Western Riverside County New Jersey Genesee Region (Rochester) Western Washington Clean Cities (Seattle) Ocean State Connecticut Connecticut2 Kansas City Regional Coalition Greater Indiana Clean Cities Coalition Capital District (Albany) Tucson Central Florida Clean Cities Coalition Alamo Area (San Antonio) Greater Baton Rouge Clean Cities Coalition Triangle (Raleigh, Durham, Chapel Hill) Twin Cities Clean Fuels Ohio Yellowstone-Teton Clean Energy Coalition Greater Lansing Palmetto State Houston-Galveston Middle Tennessee East Tennessee Clean Fuels Coalition Centralina Clean Fuels Coalition State of Iowa Treasure Valley Central Coast Southeast Louisiana Clean Fuels Partnership Land of Sky Coalition

129

Clean Cities: Coalition Locations  

Alternative Fuels and Advanced Vehicles Data Center (EERE)

Locations Locations Clean Cities coalitions are primarily located in major metropolitan areas throughout the United States. Select the dots on the map for information about individual coalitions. See also the list of coalitions by designation date. United States map showing Clean Cities Coalition locations. Philadelphia State of Delaware Capitol Clean Cities of Connecticut Connecticut Southwestern Area New Haven Norwich Red River Valley (Grand Forks, Winnipeg, Manitoba, Canada) Silicon Valley (San Jose) East Bay (Oakland) San Francisco Sacramento Granite State State of Vermont Northeast Ohio Clean Transportation (Cleveland) Detroit Clean Communities of Western New York (Buffalo) Central New York (Syracuse) Capital District (Albany) Empire Clean Cities State of Maryland Washington DC Metropolitan South Shore Western Riverside County Southern California Association of Governments (SCAG) Atlanta Alabama Denver Philadelphia State of Delaware Las Vegas Washington DC Metropolitan Massachusetts Clean Cities Lone Star Clean Fuels Alliance (Austin) Southeast Florida Chicago Land of Enchantment Wisconsin-Southeast Area Southern Colorado Clean Cities Coalition Long Beach Antelope Valley Utah Clean Cities State of Maryland Kentucky Clean Cities Partnership Coalition Rogue Valley State of West Virginia San Joaquin Valley San Francisco Columbia-Willamette St. Louis Central New York (Syracuse) Dallas/Ft. Worth Honolulu Central Arkansas Pittsburgh Southern California Association of Governments (SCAG) Los Angeles Coachella Valley Region Northern Colorado Central Oklahoma (Oklahoma City) Virginia Clean Cities Coalition San Diego Regional Clean Cities Coalition Greater Long Island Maine Clean Communities Tulsa Valley of the Sun (Phoenix) Western Riverside County New Jersey Genesee Region (Rochester) Western Washington Clean Cities (Seattle) Ocean State Connecticut Connecticut2 Kansas City Regional Coalition Greater Indiana Clean Cities Coalition Capital District (Albany) Tucson Central Florida Clean Cities Coalition Alamo Area (San Antonio) Greater Baton Rouge Clean Cities Coalition Triangle (Raleigh, Durham, Chapel Hill) Twin Cities Clean Fuels Ohio Yellowstone-Teton Clean Energy Coalition Greater Lansing Palmetto State Houston-Galveston Middle Tennessee East Tennessee Clean Fuels Coalition Centralina Clean Fuels Coalition State of Iowa Treasure Valley Central Coast Southeast Louisiana Clean Fuels Partnership Land of Sky Coalition

130

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

131

Sequoia tops Graph 500 list of 'big data' supercomputers  

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

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

132

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

133

Synthesis of Parallel Hardware Implementations from Synchronous Dataflow Graph Specifications  

E-Print Network (OSTI)

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

134

Synthesis of Parallel Hardware Implementations from Synchronous Dataflow Graph Specifications  

E-Print Network (OSTI)

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

135

Towards a Query-by-Example System for Knowledge Graphs  

Science Journals Connector (OSTI)

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

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

2014-06-01T23:59:59.000Z

136

Graph Expansion, Tseitin Formulas and Resolution Proofs for CSP  

Science Journals Connector (OSTI)

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

Dmitry Itsykson; Vsevolod Oparin

2013-01-01T23:59:59.000Z

137

Graph isomorphism and adiabatic quantum computing  

Science Journals Connector (OSTI)

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

Frank Gaitan and Lane Clark

2014-02-28T23:59:59.000Z

138

BAG: a graph theoretic sequence clustering algorithm  

Science Journals Connector (OSTI)

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

Sun Kim; Jason Lee

2006-01-01T23:59:59.000Z

139

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

140

Entanglement of graph states up to 8 qubits  

E-Print Network (OSTI)

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

Xiao-yu Chen

2009-09-09T23:59:59.000Z

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

A survey of models of the web graph Anthony Bonato  

E-Print Network (OSTI)

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

Bonato, Anthony

142

Comparison of coarsening schemes for multilevel graph partitioning  

E-Print Network (OSTI)

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

Safro, Ilya

143

On minimum balanced bipartitions of triangle-free graphs  

Science Journals Connector (OSTI)

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

Haiyan Li; Yanting Liang; Muhuo Liu; Baogang Xu

2014-04-01T23:59:59.000Z

144

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

145

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.

146

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

147

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

148

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

149

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

150

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

151

EFFECTIVE RESISTANCE ON GRAPHS AND THE EPIDEMIC QUASIMETRIC  

E-Print Network (OSTI)

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

Poggi-Corradini, Pietro

152

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

153

Test Cell Location  

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

Mazda 3 i-Stop Mazda 3 i-Stop Test Cell Location APRF- 4WD Vehicle Setup Information Downloadable Dynamometer Database (D 3 )- Test Summary Sheet Vehicle Architecture Conventional- Start Stop Vehicle Dynamometer Input Document Date 11/20/2012 Advanced Powertrain Research Facility Test weight [lb] 3250 Vehicle Dynamometer Input Document Date 11/20/2012 Revision Number 1 Advanced Powertrain Research Facility Test weight [lb] Target A [lb] 3250 31.2 Target B [lb/mph] Target C [lb/mph^2] 0.462 0.014 Test Fuel Information - Vehicle equipped with with i-Stop package - Manual Transmission - All tests completed in ECO mode - EPA shift schedule modified based on vehicle shift light activity Revision Number 1 Notes: Fuel type EPA Tier II EEE Gasoline Test Fuel Information - Vehicle equipped with with i-Stop package

154

Locations Everyone: Lights, Camera, Action!  

Science Journals Connector (OSTI)

Locations Everyone: Lights, Camera, Action! ... Harvard Institute of Proteomics Harvard Medical School ...

Robert F. Murphy; Joshua LaBaer

2008-12-05T23:59:59.000Z

155

Parameterized Algorithms for Graph Partitioning Problems  

E-Print Network (OSTI)

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

Shachnai, Hadas

156

Algorithms for Graphs (Locally) Bounded Treewidth  

E-Print Network (OSTI)

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

Hajiaghayi, Mohammad

157

Graph Domination, Coloring and Cliques in Telecommunications  

E-Print Network (OSTI)

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

Butenko, Sergiy

158

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

159

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

160

Connected obstructions to full graph homomorphisms  

Science Journals Connector (OSTI)

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

Pavol Hell, Aleš Pultr

2014-10-01T23:59:59.000Z

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

Graph Processing on an "almost" Relational Database  

Science Journals Connector (OSTI)

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

Ramesh Subramonian

2014-06-01T23:59:59.000Z

162

Betti Numbers of Graph Sean Jacques  

E-Print Network (OSTI)

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

Katzman, Moty

163

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

164

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.

165

Test Cell Location  

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

Chrysler 300 Chrysler 300 Test Cell Location 2WD Vehicle Setup Information Downloadable Dynamometer Database (D 3 )- Test Summary Sheet Vehicle Architecture Conventional Vehicle Dynamometer Input Document Date 8/7/2013 Advanced Powertrain Research Facility Test weight [lb] Target A [lb] 4250 38.61 Target B [lb/mph] Target C [lb/mph^2] 0.8894 0.01105 3.6L VVT Port-injected V-6 8 speed Transmission Revision Number 3 Notes: Test Fuel Information 3.6L VVT Port-injected V-6 8 speed Transmission Fuel type Tier II EEE HF437 3.6L VVT Port-injected V-6 8 speed Transmission Fuel density [g/ml] Fuel Net HV [BTU/lbm] 0.743 18490 T e s t I D [ # ] C y c l e C o l d s t a r t ( C S t ) H o t s t a r t [ H S t ] D a t e T e s t C e l l T e m p [ C ] T e s t C e l l R H [ % ] T e s t C e l l B a r o [ i n / H g ] V e h i c l e c o o l i n g f a n s p e e d : S p e e d M a t c h [ S M ] o r c o n s t a n t s p e e d [ C S ] S

166

Guide to the Library Locations  

E-Print Network (OSTI)

Guide to the Libraries #12;Library Locations W.E.B. DU BOIS LIBRARY www.library.umass.edu 154 Hicks Way (413) 545-0150, (413) 545-2622 The Du Bois Library is the primary location for resources machine, and a fax machine. Quiet study space is located on Floors 2 and 3 and throughout the upper floors

Massachusetts at Amherst, University of

167

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

168

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

169

Quantum graph as a quantum spectral filter  

SciTech Connect

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

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

2013-03-15T23:59:59.000Z

170

A Parallel Graph Partitioner for STAPL  

E-Print Network (OSTI)

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

Castet, Nicolas

2013-04-26T23:59:59.000Z

171

Mobile Alternative Fueling Station Locator  

Alternative Fuels and Advanced Vehicles Data Center (EERE)

Alternative Fueling Station Locator Alternative Fueling Station Locator Fuel Type Biodiesel (B20 and above) Compressed Natural Gas Electric Ethanol (E85) Hydrogen Liquefied Natural Gas (LNG) Liquefied Petroleum Gas (Propane) Location Enter a city, postal code, or address Include private stations Not all stations are open to the public. Choose this option to also search private fueling stations. Search Caution: The AFDC recommends that users verify that stations are open, available to the public, and have the fuel prior to making a trip to that location. Some stations in our database have addresses that could not be located by the Station Locator application. This may result in the station appearing in the center of the zip code area instead of the actual location. If you're having difficulty, please contact the technical response team at

172

Sharp thresholds for Hamiltonicity in random intersection graphs  

Science Journals Connector (OSTI)

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

Charilaos Efthymiou; Paul G. Spirakis

2010-09-01T23:59:59.000Z

173

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

174

Ising-like models on arbitrary graphs : the Hadamard way  

E-Print Network (OSTI)

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

Mosseri, Rémy

2014-01-01T23:59:59.000Z

175

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

176

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

177

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

E-Print Network (OSTI)

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

2011-03-17T23:59:59.000Z

178

Isomorphism testing for circulant graphs Cn(a, b)  

E-Print Network (OSTI)

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

2010-03-10T23:59:59.000Z

179

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

180

LOCATION: Johnson County Sheriff's Office  

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

LOCATION: Johnson County Sheriff's Office Criminalistics Laboratory 11890 Sunset Drive Olathe, Kansas 66061 DATE: JULY 15TH - JULY 18TH, 2013 TUITION: MAFS MEMBERS: 550 Non-MAFS...

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

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

182

Mobile Alternative Fueling Station Locator  

SciTech Connect

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

183

Ising models on power-law random graphs Sander Dommers  

E-Print Network (OSTI)

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

Hofstad, Remco van der

184

GRAPH THEORY AND PFAFFIAN REPRESENTATIONS OF ISING PARTITION FUNCTION.  

E-Print Network (OSTI)

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

Recanati, Catherine

185

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

Science Journals Connector (OSTI)

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

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

2011-02-01T23:59:59.000Z

186

Local algorithms for the prime factorization of strong product graphs  

E-Print Network (OSTI)

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

Stadler, Peter F.

187

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

188

A SPATIAL WEB GRAPH MODEL WITH LOCAL INFLUENCE REGIONS  

E-Print Network (OSTI)

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

Pralat, Pawel

189

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

190

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

191

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

192

New approximation algorithms for minimum cycle bases of graphs  

Science Journals Connector (OSTI)

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

Telikepalli Kavitha; Kurt Mehlhorn; Dimitrios Michail

2007-02-01T23:59:59.000Z

193

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

194

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

195

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

196

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

197

Fast top-k simple shortest paths discovery in graphs  

Science Journals Connector (OSTI)

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

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

2010-10-01T23:59:59.000Z

198

Some Remarks on Factor Graphs Hans-Andrea Loeliger  

E-Print Network (OSTI)

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

Loeliger, Hans-Andrea

199

Which Codes Have Cycle-Free Tanner Graphs?  

E-Print Network (OSTI)

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

Karpovsky, Mark

200

Graph-based Image Segmentation Using Weighted Color Patch  

E-Print Network (OSTI)

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

Paris-Sud XI, Université de

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

THE ELECTRICAL RESISTANCE OF A GRAPH CAPTURES ITS  

E-Print Network (OSTI)

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

Borenstein, Elhanan

202

A COMBINATORIAL PROOF OF RAYLEIGH MONOTONICITY FOR GRAPHS  

E-Print Network (OSTI)

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

203

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

204

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

205

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

206

International energy indicators. [Statistical tables and graphs  

SciTech Connect

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

Bauer, E.K. (ed.)

1980-05-01T23:59:59.000Z

207

An Experiment on Graph Analysis Methodologies for Scenarios  

SciTech Connect

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

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

2005-09-30T23:59:59.000Z

208

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

209

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

E-Print Network (OSTI)

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

Jing Zhang

2008-10-08T23:59:59.000Z

210

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

211

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

Science Journals Connector (OSTI)

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

Zhisong Fu; Michael Personick; Bryan Thompson

2014-06-01T23:59:59.000Z

212

Efficient broadcast on random geometric graphs  

SciTech Connect

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

213

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

214

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

215

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

216

Multiclass Diffuse Interface Models for Semi-supervised Learning on Graphs  

E-Print Network (OSTI)

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

Percus, Allon

217

Location logistics of industrial facilities  

E-Print Network (OSTI)

is not growing rapidly or 1s very small, they may not carry a staff from wh1ch the necessary people for a 25 s1te selection team can be drawn. Also, quite possibly, a company may not be involved in the site selection process for expansion. Instead, they may... 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

2012-06-07T23:59:59.000Z

218

Major DOE Biofuels Project Locations  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

Biofuels Project Locations Biofuels Project Locations BlueFire Ethanol Biochemical Municipal Solid Waste (Mecca, CA) Poet Biochemical Corn Cob/Corn Fiber (Emmetsburg, IA) Lignol Biochemical Woody Biomass- Ag Residues (Grand Junction, CO) ICM Biochemical Switchgrass, Forage Sorghum, Stover (St. Joseph, MO) Abengoa Biochemica Agricultural Residue (Hugoton, KS) DOE Joint Bioenergy Institute (Berkeley, CA) DOE Great Lakes Bioenergy Research Center (Madison, WI) DOE Bioenergy Science Center (Oak Ridge, TN) NewPage Thermochemical Woody Biomass - Mill Residues (Wisconsin Rapids, WI) Range Fuels Thermochemical Woody Waste (Soperton, GA) DSM Innovation Center Biochemical Various (Parsippany, NJ) Novozymes Biochemical Various (Davis, CA) Genencor Biochemical Various (Palo Alto, CA) Verenium Corp Biochemical Various (San Diego, CA)

219

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

220

The Graph Laplacian and the Dynamics of Complex Networks  

SciTech Connect

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

Thulasidasan, Sunil [Los Alamos National Laboratory

2012-06-11T23:59:59.000Z

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

Building Address Locations -Assumes entire  

E-Print Network (OSTI)

Housman Building 80 E. Concord St R BU School of Medicine, Instructional Building 80 E. Concord St L BU JBuilding 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

Guenther, Frank

222

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

E-Print Network (OSTI)

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

Jing Zhang

2008-08-14T23:59:59.000Z

223

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

224

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

225

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.

226

Probabilistic flooding for efficient information dissemination in random graph topologies  

Science Journals Connector (OSTI)

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

Konstantinos Oikonomou; Dimitrios Kogias; Ioannis Stavrakakis

2010-07-01T23:59:59.000Z

227

A description of dynamical graphs associated to elementary regulatory circuits  

Science Journals Connector (OSTI)

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

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

2003-09-01T23:59:59.000Z

228

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.

229

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.

230

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

231

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.

232

Probabilistic Flooding for Efficient Information Dissemination in Random Graph  

E-Print Network (OSTI)

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

Stavrakakis, Ioannis

233

Solving Steiner Tree Problems in Graphs with Lagrangian Relaxation  

Science Journals Connector (OSTI)

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

Laura Bahiense; Francisco Barahona; Oscar Porto

2003-09-01T23:59:59.000Z

234

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.

235

Circuit and bond polytopes on series-parallel graphs$  

E-Print Network (OSTI)

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

2014-07-10T23:59:59.000Z

236

Graph Model for Carbon Dioxide Emissions from Metallurgical Plants  

Science Journals Connector (OSTI)

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

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

2013-03-01T23:59:59.000Z

237

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

238

K-theory of locally finite graph C Natalia Iyudu  

E-Print Network (OSTI)

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

239

Alliance Partition Number in Graphs Department of Mathematics  

E-Print Network (OSTI)

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

Gera, Ralucca

240

The peculiar phase structure of random graph bisection  

SciTech Connect

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

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

2008-01-01T23:59:59.000Z

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

Mining the inner structure of the Web graph  

Science Journals Connector (OSTI)

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

Debora Donato; Stefano Leonardi; Stefano Millozzi; Panayiotis Tsaparas

2008-01-01T23:59:59.000Z

242

station locations | OpenEI  

Open Energy Info (EERE)

00 00 Varnish cache server Browse Upload data GDR 429 Throttled (bot load) Error 429 Throttled (bot load) Throttled (bot load) Guru Meditation: XID: 2142288500 Varnish cache server station locations Dataset Summary Description Alternative fueling stations are located throughout the United States and their availability continues to grow. The Alternative Fuels Data Center (AFDC) maintains a website where you can find alternative fuels stations near you or on a route, obtain counts of alternative fuels stations by state, Source Alternative Fuels Data Center Date Released December 13th, 2010 (4 years ago) Date Updated December 13th, 2010 (4 years ago) Keywords alt fuel alternative fuels alternative fuels stations biodiesel CNG compressed natural gas E85 Electricity ethanol

243

Locating and total dominating sets in trees  

Science Journals Connector (OSTI)

A set S of vertices in a graph G = ( V , E ) is a total dominating set of G if every vertex of V is adjacent to a vertex in S. We consider total dominating sets of minimum cardinality which have the additional property that distinct vertices of V are totally dominated by distinct subsets of the total dominating set.

Teresa W. Haynes; Michael A. Henning; Jamie Howard

2006-01-01T23:59:59.000Z

244

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

245

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

246

Alliance free sets in Cartesian product graphs  

E-Print Network (OSTI)

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

Yero, Ismael G; Bermudo, Sergio

2011-01-01T23:59:59.000Z

247

A survey of computational location privacy  

Science Journals Connector (OSTI)

This is a literature survey of computational location privacy, meaning computation-based privacy mechanisms that treat location data as geometric information. This definition includes privacy-preserving algorithms like anonymity and obfuscation as well ... Keywords: Context, Location, Privacy

John Krumm

2009-08-01T23:59:59.000Z

248

Location and Hours | ornl.gov  

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

Location and Hours Location The ORNL Research Library is located off the central corridor of Bldg. 4500N on the main ORNL campus. Hours The library is open 24 hours, seven days a...

249

Algorithms and architectures for high performance analysis of semantic graphs.  

SciTech Connect

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

Hendrickson, Bruce Alan

2005-09-01T23:59:59.000Z

250

Vacuum State/Refiner/Location  

U.S. Energy Information Administration (EIA) Indexed Site

Vacuum Vacuum State/Refiner/Location Barrels per Atmospheric Crude Oil Distillation Capacity Barrels per Operating Idle Operating Idle Downstream Charge Capacity Thermal Cracking Delayed Fluid Coking Visbreaking Other/Gas Calendar Day Stream Day Distillation Coking Oil Table 3. Capacity of Operable Petroleum Refineries by State as of January 1, 2013 (Barrels per Stream Day, Except Where Noted) ......................................................... Alabama 120,100 0 130,000 0 48,000 32,000 0 0 0 Goodway Refining LLC 4,100 0 5,000 0 0 0 0 0 0 ....................................................................................................................................................................................................

251

Mobile Truck Stop Electrification Site Locator  

Alternative Fuels and Advanced Vehicles Data Center (EERE)

Mobile Truck Stop Electrification Site Locator Location Enter a city, postal code, or address Search Caution: The AFDC recommends that users verify that sites are open prior to...

252

Energy Department Launches Alternative Fueling Station Locator...  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

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

253

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

254

A graph-based system for network-vulnerability analysis  

SciTech Connect

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

255

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

256

Major DOE Biofuels Project Locations  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

Biofuels Biofuels Project Locations Pacific Ethanol (Boardman, OR) BlueFire Ethanol (Corona, CA) POET (Emmetsburg, IA) Lignol Innovations (Commerce City, CO) ICM (St. Joseph, MO) Abengoa (Hugoton, KS) DOE Joint Bioenergy Institute (Berkeley, CA) DOE Great Lakes Bioenergy Research Center (Madison, WI) DOE Bioenergy Science Center (Oak Ridge, TN) NewPage (Wisconsin Rapids, WI) Range Fuels (Soperton, GA) DSM Innovation Center (Parsippany, NJ) Novozymes (Davis, CA) Genencor (Palo Alto, CA) Verenium Corp (San Diego, CA) Dupont (Wilmington, DE) Mascoma (Lebanon, NH) Cargill Inc (Minneapolis, MN) Regional Partnerships South Dakota State University, Brookings, SD Cornell University, Ithaca, NY University of Tennessee, Knoxville, TN Oklahoma State University, Stillwater, OK Oregon State University, Corvallis, OR

257

Mining Large Heterogeneous Graphs using Cray s Urika  

SciTech Connect

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

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

2013-01-01T23:59:59.000Z

258

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

259

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

260

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

Science Journals Connector (OSTI)

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

Patricia Iglesias Sánchez; Emmanuel Müller; Oretta Irmler; Klemens Böhm

2014-06-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

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

Science Journals Connector (OSTI)

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

Yingqian Wang; Ping Sheng

2014-04-01T23:59:59.000Z

262

Create reports and graphs | ENERGY STAR Buildings & Plants  

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

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

263

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

264

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

265

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

266

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

E-Print Network (OSTI)

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

Kardos, Frantisek; Volec, Jan

2011-01-01T23:59:59.000Z

267

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

E-Print Network (OSTI)

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

Smirnova-Nagnibeda, Tatiana

268

Labeling Products of Complete Graphs with a Condition at Distance Two  

Science Journals Connector (OSTI)

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

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

2001-01-01T23:59:59.000Z

269

On generalized Petersen graphs labeled with a condition at distance two  

Science Journals Connector (OSTI)

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

John P. Georges; David W. Mauro

2002-12-01T23:59:59.000Z

270

PARTITIONING HYPERGRAPHS IN SCIENTIFIC COMPUTING APPLICATIONS THROUGH VERTEX SEPARATORS ON GRAPHS  

E-Print Network (OSTI)

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

Pinar, Ali

271

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

E-Print Network (OSTI)

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

Hendrickson, Bruce

272

Correlation and Contrast Link Formation Patterns in a Time Evolving Graph  

Science Journals Connector (OSTI)

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

Tomonobu Ozaki; Minoru Etoh

2011-12-01T23:59:59.000Z

273

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

Science Journals Connector (OSTI)

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

Tomonobu Ozaki; Minoru Etoh

2011-03-01T23:59:59.000Z

274

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.

275

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

Science Journals Connector (OSTI)

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

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

2014-03-01T23:59:59.000Z

276

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

277

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

278

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

279

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

280

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

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

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

Science Journals Connector (OSTI)

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

Marjan Abdeyazdan; Saeed Parsa; Amir Masoud Rahmani

2013-04-01T23:59:59.000Z

282

LOCATION OF THUNDERSTORMS BY RADIO METHODS  

Science Journals Connector (OSTI)

... systems are well known, and the exact location can be determined when the line or substation is afterwards inspected. Thus power supply system statistics provide reliable evidence of the location ...

1943-03-06T23:59:59.000Z

283

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.

284

MML Inference of Decision Graphs with Multi-way Joins  

Science Journals Connector (OSTI)

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

Peter J. Tan; David L. Dowe

2002-12-01T23:59:59.000Z

285

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

286

Even-Hole-Free Graphs Part II: Recognition Algorithm  

E-Print Network (OSTI)

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

Cornuejols, Gerard P.

287

Finding good decompositions for dynamic programming on dense graphs  

Science Journals Connector (OSTI)

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

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

2011-09-01T23:59:59.000Z

288

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

289

A graph-based network-vulnerability analysis system  

SciTech Connect

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

290

A graph-based network-vulnerability analysis system  

SciTech Connect

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

291

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

292

Lesson Summary Students will graph past sea level data obtained  

E-Print Network (OSTI)

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

Mojzsis, Stephen J.

293

Describing bond graph models of hydraulic components in Modelica  

Science Journals Connector (OSTI)

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

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

2000-01-01T23:59:59.000Z

294

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.

295

Compact Routing on Internet-Like Graphs Dmitri Krioukov  

E-Print Network (OSTI)

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

Yang, Xiaowei

296

Proc. AAAI-13 1 Concurrent Reasoning with Inference Graphs  

E-Print Network (OSTI)

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

Shapiro, Stuart C.

297

Proc. GKR 2013 Concurrent Reasoning with Inference Graphs  

E-Print Network (OSTI)

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

Shapiro, Stuart C.

298

Simulation of an Electrical Substation Using the Bond Graph Technique  

Science Journals Connector (OSTI)

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

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

2008-04-01T23:59:59.000Z

299

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

300

The Optimal Rescue Path Set Problem in Undirected Graphs  

Science Journals Connector (OSTI)

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

Huili Zhang; Yinfeng Xu

2013-01-01T23:59:59.000Z

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

Insider Threat Detection using Stream Mining and Graph Mining  

E-Print Network (OSTI)

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

Hamlen, Kevin W.

302

An Approach to Security Policy Configuration Using Semantic Threat Graphs  

E-Print Network (OSTI)

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

Foley, Simon

303

Decentralized Semantic Threat Graphs Simon N. Foley1  

E-Print Network (OSTI)

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

Foley, Simon

304

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

305

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

306

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

307

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

308

Classification of Adinkra Graphs A Senior Project submitted to  

E-Print Network (OSTI)

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

Landweber, Gregory D.

309

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

310

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

311

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

312

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

313

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

314

Graph and matrix approaches to rough sets through matroids  

Science Journals Connector (OSTI)

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

Shiping Wang; Qingxin Zhu; William Zhu; Fan Min

2014-01-01T23:59:59.000Z

315

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

316

User's search behavior graph for aiding personalized web search  

Science Journals Connector (OSTI)

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

S. Sendhilkumar; T. V. Geetha

2007-12-01T23:59:59.000Z

317

Heat kernel estimates and related inequalities on metric graphs  

E-Print Network (OSTI)

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

Sebastian Haeseler

2011-01-15T23:59:59.000Z

318

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

319

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

320

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

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

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

322

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

323

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

324

Potential-controlled filtering in quantum star graphs  

SciTech Connect

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

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

2013-03-15T23:59:59.000Z

325

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

2012-06-07T23:59:59.000Z

326

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

SciTech Connect

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

Brost, Randolph C.; McLendon, William Clarence,

2013-01-01T23:59:59.000Z

327

Alternative Fueling Station Locator | Open Energy Information  

Open Energy Info (EERE)

Alternative Fueling Station Locator Alternative Fueling Station Locator Jump to: navigation, search Tool Summary LAUNCH TOOL Name: Alternative Fueling Station Locator Agency/Company /Organization: United States Department of Energy Partner: National Renewable Energy Laboratory Sector: Energy Focus Area: Fuels & Efficiency, Transportation Phase: Evaluate Options, Prepare a Plan Topics: Datasets Resource Type: Online calculator User Interface: Website Website: www.afdc.energy.gov/afdc/locator/stations/ Web Application Link: www.afdc.energy.gov/afdc/locator/stations/ Cost: Free OpenEI Keyword(s): Featured References: National Renewable Energy Laboratory Advanced Vehicles and Fuels Research: Data and Resources[1] Logo: Alternative Fueling Station Locator The alternative fuel station locator uses an address based search to find

328

Major DOE Biofuels Project Locations | Department of Energy  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

Major DOE Biofuels Project Locations Major DOE Biofuels Project Locations Major DOE Biofuels Project Locations More Documents & Publications Major DOE Biofuels Project Locations...

329

Our Locations | National Nuclear Security Administration  

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

Locations | National Nuclear Security Administration Locations | National Nuclear Security Administration Our Mission Managing the Stockpile Preventing Proliferation Powering the Nuclear Navy Emergency Response Recapitalizing Our Infrastructure Continuing Management Reform Countering Nuclear Terrorism About Us Our Programs Our History Who We Are Our Leadership Our Locations Budget Our Operations Media Room Congressional Testimony Fact Sheets Newsletters Press Releases Speeches Events Social Media Video Gallery Photo Gallery NNSA Archive Federal Employment Apply for Our Jobs Our Jobs Working at NNSA Blog Our Locations Home > About Us > Our Locations Our Locations The NNSA's nuclear security enterprise spans eight sites, including three national laboratories, with more than six decades of cutting-edge nuclear security experience. That history and technical expertise enables NNSA to

330

Our Locations | National Nuclear Security Administration  

National Nuclear Security Administration (NNSA)

Locations | National Nuclear Security Administration Locations | National Nuclear Security Administration Our Mission Managing the Stockpile Preventing Proliferation Powering the Nuclear Navy Emergency Response Recapitalizing Our Infrastructure Continuing Management Reform Countering Nuclear Terrorism About Us Our Programs Our History Who We Are Our Leadership Our Locations Budget Our Operations Media Room Congressional Testimony Fact Sheets Newsletters Press Releases Speeches Events Social Media Video Gallery Photo Gallery NNSA Archive Federal Employment Apply for Our Jobs Our Jobs Working at NNSA Blog Our Locations Home > About Us > Our Locations Our Locations The NNSA's nuclear security enterprise spans eight sites, including three national laboratories, with more than six decades of cutting-edge nuclear security experience. That history and technical expertise enables NNSA to

331

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

332

Helicopter magnetic survey conducted to locate wells  

SciTech Connect

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

333

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

334

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

335

Location-dependent communications using quantum entanglement  

SciTech Connect

The ability to unconditionally verify the location of a communication receiver would lead to a wide range of new security paradigms. However, it is known that unconditional location verification in classical communication systems is impossible. In this work we show how unconditional location verification can be achieved with the use of quantum communication channels. Our verification remains unconditional irrespective of the number of receivers, computational capacity, or any other physical resource held by an adversary. Quantum location verification represents an application of quantum entanglement that delivers a feat not possible in the classical-only channel. It gives us the ability to deliver real-time communications viable only at specified geographical coordinates.

Malaney, Robert A. [School of Electrical Engineering and Telecommunications, University of New South Wales, New South Wales 2052 (Australia)

2010-04-15T23:59:59.000Z

336

Implementing Rational Surface Locations Measured From Thomson...  

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

Rational Surface Locations Measured From Thomson Scattering Into MSTfit by Curtis A. Johnson Senior Thesis (Physics) at the University of Wisconsin-Madison 2014 i Abstract...

337

Stochastic p-Robust Location Problems  

E-Print Network (OSTI)

We present p-robust models based on two classical facility location problems, ... University, Department of Industrial Engineering and Management Sciences, ...

2004-08-03T23:59:59.000Z

338

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

339

Procurement Information by Location | Department of Energy  

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

Procurement Information by Location Procurement Information by Location Procurement Information by Location As part of our Small Business Opportunity Tool, we are offering information about historical procurement by location. Find historical procurement data by state - check out the list of states below, and click on the state's name to learn more about their current programs and past procurement needs. Click on the state to learn more about our current procurement activity: California Colorado District of Columbia Georgia Idaho Illinois Iowa Louisana Maryland Missouri Nevada New Jersey New Mexico New York Ohio Oklahoma Oregon Pennsylvania South Carolina Tennessee Texas Virginia West Virginia Washington Wyoming

340

Optimization Online - Public Facility Location Using Dispersion ...  

E-Print Network (OSTI)

Jan 27, 2013 ... Our results show close collaboration with the p-median solution when decision makers restrict location to demand points, and use parameter ...

Rajan Batta

2013-01-27T23: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

Identifying codes and locating–dominating sets on paths and cycles  

Science Journals Connector (OSTI)

Let G = ( V , E ) be a graph and let r ? 1 be an integer. For a set D ? V , define N r [ x ] = { y ? V : d ( x , y ) ? r } and D r ( x ) = N r [ x ] ? D , where d ( x , y ) denotes the number of edges in any shortest path between x and y . D is known as an r -identifying code ( r -locating-dominating set, respectively), if for all vertices x ? V ( x ? V ? D , respectively), D r ( x ) are all nonempty and different. Roberts and Roberts [D.L. Roberts, F.S. Roberts, Locating sensors in paths and cycles: the case of 2-identifying codes, European Journal of Combinatorics 29 (2008) 72–82] provided complete results for the paths and cycles when r = 2 . In this paper, we provide results for a remaining open case in cycles and complete results in paths for r -identifying codes; we also give complete results for 2-locating-dominating sets in cycles, which completes the results of Bertrand et al. [N. Bertrand, I. Charon, O. Hudry, A. Lobstein, Identifying and locating–dominating codes on chains and cycles, European Journal of Combinatorics 25 (2004) 969–987].

Chunxia Chen; Changhong Lu; Zhengke Miao

2011-01-01T23:59:59.000Z

342

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

343

A Tutte polynomial which distinguishes rooted unicyclic graphs  

Science Journals Connector (OSTI)

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

Steven J. Tedford

2009-02-01T23:59:59.000Z

344

Proximity graphs based multi-scale image segmentation  

SciTech Connect

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

Skurikhin, Alexei N [Los Alamos National Laboratory

2008-01-01T23:59:59.000Z

345

On r-locating-dominating sets in paths  

Science Journals Connector (OSTI)

Assume that G=(V,E) is a simple undirected graph, and C is a nonempty subset of V. For every vV, we define Ir(v)={u

Iiro Honkala

2009-05-01T23:59:59.000Z

346

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

347

Sequoia retains top ranking on Graph 500 for third year running  

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

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

348

Property:UtilityLocation | Open Energy Information  

Open Energy Info (EERE)

UtilityLocation UtilityLocation Jump to: navigation, search Property Name UtilityLocation Property Type Boolean Description Indicates this is the "mailing" location of the Utility. Usually is Yes if the information from EIA Form 861 File1_a is on the page. Pages using the property "UtilityLocation" Showing 25 pages using this property. (previous 25) (next 25) 3 3 Phases Energy Services + true + 4 4-County Electric Power Assn + true + A A & N Electric Coop (Virginia) + true + AEP Generating Company + true + AEP Texas Central Company + true + AEP Texas North Company + true + AES Eastern Energy LP + true + AGC Division of APG Inc + true + AP Holdings LLC + true + APN Starfirst, L.P. + true + APNA Energy + true + Accent Energy Holdings, LLC + true +

349

Property:Event/Location | Open Energy Information  

Open Energy Info (EERE)

Location Location Jump to: navigation, search Property Name Event/Location Property Type String Description The location in which an event will occur. Examples: 'Golden, Colorado' or 'Prestigious Hotel: 11 Rue Leroy, Paris, France'. Pages using the property "Event/Location" Showing 25 pages using this property. (previous 25) (next 25) 1 11th Annual Workshop on Greenhouse Gas Emission Trading + Paris, France + 11th Annual Workshop on Greenhouse Gas Emission Trading Day 2 + Paris, France + 15th International Business Forum: Low Carbon High Growth - Business Models for a Changing Climate + Pretoria, South Africa + 18th Africa Partnership Forum + Paris, France + 2 2012 Bonn Climate Change Conference + Bonn, Germany + 7 7th Asia Clean Energy Forum + Manila, Philippines +

350

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

E-Print Network (OSTI)

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

Jing Zhang

2010-06-21T23:59:59.000Z

351

Time-varying Reeb Graphs for Continuous Space-Time Data  

SciTech Connect

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

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

2008-04-22T23:59:59.000Z

352

Export.gov - Export.gov - Locations  

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

Locations Locations Print | E-mail Page Locations 800.872.8723 Domestic Offices International Offices Locations 800.872.8723 Call: 800.872.8723 (1-800-USA-TRAD(E)) Email: tic@trade.gov between 8:30 AM and 6 PM EST to receive immediate answers to your exporting questions on: Tariff and Tax Information Country-specific General Export Information Region-specific Export Information (Middle East, China, Latin America, EU, etc.) International Documentation, Regulations and Standards Logistics and Finance (HS/Schedule B numbers, Freight Forwarders, partners) Free Trade Agreements (qualifying products for FTA benefits, Certificates of origin.) Trade Data Export-related information offered by federal, state and local entities Export-related information related to other USG agencies Note for Importers: Please contact U.S. Customs at 877.227.5511

353

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

354

Location privacy in mobile computing environments  

Science Journals Connector (OSTI)

In general, privacy can be viewed as the right to be left alone when desired (solitude), the right to remain anonymous (anonymity), and the right to confidentiality (secrecy of information). More specifically, location privacy is “the ability to ...

John P. Baugh; Jinhua Guo

2006-09-01T23:59:59.000Z

355

Data semantics in location-based services  

Science Journals Connector (OSTI)

As location-based applications become part of our everyday life, ranging from traffic prediction systems to services over mobile phones providing us with information about our surroundings, the call for more semantics and accurate services is emerging. ...

Nectaria Tryfona; Dieter Pfoser

2005-01-01T23:59:59.000Z

356

Russian Locations | National Nuclear Security Administration  

National Nuclear Security Administration (NNSA)

Locations | National Nuclear Security Administration Locations | National Nuclear Security Administration Our Mission Managing the Stockpile Preventing Proliferation Powering the Nuclear Navy Emergency Response Recapitalizing Our Infrastructure Continuing Management Reform Countering Nuclear Terrorism About Us Our Programs Our History Who We Are Our Leadership Our Locations Budget Our Operations Media Room Congressional Testimony Fact Sheets Newsletters Press Releases Speeches Events Social Media Video Gallery Photo Gallery NNSA Archive Federal Employment Apply for Our Jobs Our Jobs Working at NNSA Blog The National Nuclear Security Administration Russian Locations Home > About Us > Our Programs > Defense Programs > Future Science & Technology Programs > Office of Advanced Simulation and Computing and Institutional R&D Programs > Russia Tri-Lab S&T Collaborations > Travel

357

Alternative Fueling Station Locator | Department of Energy  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

Alternative Fueling Station Locator Alternative Fueling Station Locator Alternative Fueling Station Locator Find Stations Plan a Route Location: Go Start: End: Go Fuel: All Fuels Biodiesel (B20 and above) Compressed Natural Gas Electric Ethanol (E85) Hydrogen Liquefied Natural Gas (LNG) Liquefied Petroleum Gas (Propane) more search options close Ă— More Search Options Include private stations Include planned stations Owner All Private Federal State Local Utility Payment All American Express Discover MasterCard VISA Cash Checks CFN Clean Energy Fuel Man Gas Card PHH Services Voyager WEX Electric charger types Include level 1 Include level 2 Include DC fast Include legacy chargers Limit results to within 5 miles Limit results to within 5 miles 12,782 alternative fuel stations in the United States Excluding private stations

358

Location-Aware Instant Search Ruicheng Zhong  

E-Print Network (OSTI)

to find a gas station nearby, she can issue a keyword query "gas station" to a LBS system, which returns the relevant gas stations by considering the user's location and keywords. Traditional spatial keyword search

Li, Guoliang

359

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

360

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

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

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

362

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

363

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

E-Print Network (OSTI)

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

Janson, Svante

364

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

E-Print Network (OSTI)

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

Markström, Klas

365

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

366

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

E-Print Network (OSTI)

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

Shepherd, Bruce

367

On Regular Graphs Optimally Labeled with a Condition at Distance Two  

Science Journals Connector (OSTI)

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

John P. Georges; David W. Mauro

2004-02-01T23:59:59.000Z

368

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

369

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

370

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

371

Modeling and Recognition of Landmark Image Collections Using Iconic Scene Graphs  

E-Print Network (OSTI)

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

Lazebnik, Svetlana

372

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

373

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

374

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

375

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

Science Journals Connector (OSTI)

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

A. Kaveh; M. Nikbakht

2010-01-01T23:59:59.000Z

376

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

E-Print Network (OSTI)

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

Paris-Sud XI, Université de

377

INDDGO: Integrated Network Decomposition & Dynamic programming for Graph Optimization  

SciTech Connect

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

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

2012-10-01T23:59:59.000Z

378

Alternative Fueling Station Locations | OpenEI  

Open Energy Info (EERE)

Alternative Fueling Station Locations Alternative Fueling Station Locations Dataset Summary Description Alternative fueling stations are located throughout the United States and their availability continues to grow. The Alternative Fuels Data Center (AFDC) maintains a website where you can find alternative fuels stations near you or on a route, obtain counts of alternative fuels stations by state, view U.S. maps, and more. Access up-to-date fuel station data here: http://www.afdc.energy.gov/afdc/data_download The dataset available for download here provides a "snapshot" of the alternative fueling station information for: compressed natural gas (CNG), E85 (85% ethanol, 15% gasoline), propane/liquefied petroleum gas (LPG), biodiesel, electricity, hydrogen, and liquefied natural gas

379

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

E-Print Network (OSTI)

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

Kschischang, Frank R.

380

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

E-Print Network (OSTI)

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

Williams, Susan

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

The pipeline and valve location problem  

Science Journals Connector (OSTI)

This paper, proposes an exact algorithm for the problem of locating a pipeline between two points of a network, as well as a set of safety valves which help control the damage caused by possible spills along the pipeline. A labelling approach is developed to determine simultaneously the optimal pipeline and valve locations, with the objective of optimising an impact measure that depends on the average number of accidents and their cost. Computational experiments on grid and random instances are presented in order to evaluate the algorithm's performance and to compare its results to the solutions provided by sequential approaches. [Received 11 May 2010; Revised 10 October 2010; Accepted 21 November 2010

Gilbert Laporte; Marta M.B. Pascoal

2012-01-01T23:59:59.000Z

382

Driver expectancy in locating automotive controls  

E-Print Network (OSTI)

to determine if any of these factors had any effect on the distributions of control locations. In the final phase of the study McGrath measured response time and errors in locating controls in two cars, one was a 1973 Toyota and the other a 1973 Buick..., Chrysler, and Dodge. Also included were the following far eastern car makes: Toyota, Honda, Mazda, Hyundai, Isuzu, Nissan, and Geo. The automobiles were divided into six groups: 14 1. Foreign-make, small, mid-size, and sports cars. 2. Foreign...

Francis, Dawn Suzette

1990-01-01T23:59:59.000Z

383

Rack Locations (24) Hatch and Berthing  

E-Print Network (OSTI)

Rack Locations (24) Hatch and Berthing Mechanism Endcone Airflow and Plumbing Crossover Corner requirements of 24 equipment racks. Approximately half of these are for accommodation and control of ISS ) Width 4.3 m diameter (14 ft) Mass 14,515 kg (32,000 lb) 24,023 kg (52,962 lb) with all racks

384

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

385

Forecasting the Locational Dynamics of Transnational Terrorism  

E-Print Network (OSTI)

Forecasting the Locational Dynamics of Transnational Terrorism: A Network Analytic Approach Bruce A-0406 Fax: (919) 962-0432 Email: skyler@unc.edu Abstract--Efforts to combat and prevent transnational terror of terrorism. We construct the network of transnational terrorist attacks, in which source (sender) and target

Massachusetts at Amherst, University of

386

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

387

Location management and Moving Objects Databases  

E-Print Network (OSTI)

wolfson@cs.uic.edu #12;2 Location based services Examples: Where closest gas station? How do I get there;13 Applications-- Summary · Geographic resource discovery-- e.g. "Closest gas station" · Digital Battlefield/trigger examples: · During the past year, how many times was bus#5 late by more than 10 minutes at station 20

Wolfson, Ouri E.

388

Therapy: location-aware assessment and tasks  

Science Journals Connector (OSTI)

In this paper, we present a system that allows therapists to assess and engage patients' in activities triggered by specific stressing contexts. The system is composed by: 1) a web application that the therapist uses to specify the activities and its ... Keywords: location based services, physiological recording, therapy

Luís Carriço; Marco de Sá; Luís Duarte; Tiago Antunes

2012-03-01T23:59:59.000Z

389

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

SciTech Connect

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

390

Graph fusion algebras of WLM(p,p')  

E-Print Network (OSTI)

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

Jorgen Rasmussen

2009-11-17T23:59:59.000Z

391

Sandia National Laboratories: Locations: Livermore, California: Visiting  

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

California California Livermore, California administration building Our location and hours of operation Sandia/California is located at 7011 East Avenue in Livermore, Calif., a suburban community about 45 miles east of San Francisco. Positioned at the eastern edge of the San Francisco Bay Area, Sandia is within easy commuting distance of many affordable housing communities in San Joaquin County and the Central Valley. The official hours of operation at Sandia/California are from 7:30 a.m. to 4 p.m. PST, Monday through Friday. General inquiries can be made by calling (925) 294-3000. See our contacts page for additional information. Getting here All three major airports in the San Francisco Bay Area provide access to Sandia/California. Oakland International Airport is the closest airport to

392

Automated Fault Location In Smart Distribution Systems  

E-Print Network (OSTI)

measured at the power substation during a single phase to ground fault clearance [17] .............................................. 111 Figure 26 Analyzed signal using wavelet transform from phase B current during a fault [17..., but are not limited to, substation and feeder relay, intelligent controllers for capacitor bank switches or reclosers, Automatic Meter Reading (AMR) systems installed at the customer sites, power quality meters installed at strategic locations in the system, low...

Lotfifard, Saeed

2012-10-19T23:59:59.000Z

393

Truckstop Electrification Locator | Open Energy Information  

Open Energy Info (EERE)

Truckstop Electrification Locator Truckstop Electrification Locator Jump to: navigation, search Tool Summary Name: Truckstop Electrification Locator Agency/Company /Organization: United States Department of Energy Phase: "Evaluate Options and Determine Feasibility" is not in the list of possible values (Bring the Right People Together, Create a Vision, Determine Baseline, Evaluate Options, Develop Goals, Prepare a Plan, Get Feedback, Develop Finance and Implement Projects, Create Early Successes, Evaluate Effectiveness and Revise as Needed) for this property., "Perpare a Plan" is not in the list of possible values (Bring the Right People Together, Create a Vision, Determine Baseline, Evaluate Options, Develop Goals, Prepare a Plan, Get Feedback, Develop Finance and Implement Projects, Create Early Successes, Evaluate Effectiveness and Revise as Needed) for this property., "Implement the Plan" is not in the list of possible values (Bring the Right People Together, Create a Vision, Determine Baseline, Evaluate Options, Develop Goals, Prepare a Plan, Get Feedback, Develop Finance and Implement Projects, Create Early Successes, Evaluate Effectiveness and Revise as Needed) for this property.

394

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

Science Journals Connector (OSTI)

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

Gábor Bergmann; Artur Boronat; Reiko Heckel; Paolo Torrini; István Ráth; Dániel Varró

2011-01-01T23:59:59.000Z

395

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

Science Journals Connector (OSTI)

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

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

2013-05-01T23:59:59.000Z

396

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

397

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

398

GrIDS A GRAPH BASED INTRUSION DETECTION SYSTEM FOR LARGE NETWORKS  

E-Print Network (OSTI)

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

California at Davis, University of

399

Novel approaches for solving large-scale optimization problems on graphs  

E-Print Network (OSTI)

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

Trukhanov, Svyatoslav

2009-05-15T23:59:59.000Z

400

Positron Scanner for Locating Brain Tumors  

DOE R&D Accomplishments (OSTI)

A system is described that makes use of positron emitting isotopes for locating brain tumors. This system inherently provides more information about the distribution of radioactivity in the head in less time than existing scanners which use one or two detectors. A stationary circular array of 32 scintillation detectors scans a horizontal layer of the head from many directions simultaneously. The data, consisting of the number of counts in all possible coincidence pairs, are coded and stored in the memory of a Two-Dimensional Pulse-Height Analyzer. A unique method of displaying and interpreting the data is described that enables rapid approximate analysis of complex source distribution patterns. (auth)

Rankowitz, S.; Robertson, J. S.; Higinbotham, W. A.; Rosenblum, M. J.

1962-03-00T23: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

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

402

Alternative Fuels Data Center: Hydrogen Fueling Station Locations  

Alternative Fuels and Advanced Vehicles Data Center (EERE)

Hydrogen Hydrogen Printable Version Share this resource Send a link to Alternative Fuels Data Center: Hydrogen Fueling Station Locations to someone by E-mail Share Alternative Fuels Data Center: Hydrogen Fueling Station Locations on Facebook Tweet about Alternative Fuels Data Center: Hydrogen Fueling Station Locations on Twitter Bookmark Alternative Fuels Data Center: Hydrogen Fueling Station Locations on Google Bookmark Alternative Fuels Data Center: Hydrogen Fueling Station Locations on Delicious Rank Alternative Fuels Data Center: Hydrogen Fueling Station Locations on Digg Find More places to share Alternative Fuels Data Center: Hydrogen Fueling Station Locations on AddThis.com... More in this section... Hydrogen Basics Benefits & Considerations Stations Locations

403

Alternative Fuels Data Center: Propane Fueling Station Locations  

Alternative Fuels and Advanced Vehicles Data Center (EERE)

Propane Propane Printable Version Share this resource Send a link to Alternative Fuels Data Center: Propane Fueling Station Locations to someone by E-mail Share Alternative Fuels Data Center: Propane Fueling Station Locations on Facebook Tweet about Alternative Fuels Data Center: Propane Fueling Station Locations on Twitter Bookmark Alternative Fuels Data Center: Propane Fueling Station Locations on Google Bookmark Alternative Fuels Data Center: Propane Fueling Station Locations on Delicious Rank Alternative Fuels Data Center: Propane Fueling Station Locations on Digg Find More places to share Alternative Fuels Data Center: Propane Fueling Station Locations on AddThis.com... More in this section... Propane Basics Benefits & Considerations Stations Locations Infrastructure Development

404

Major DOE Biofuels Project Locations | Department of Energy  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

Major DOE Biofuels Project Locations More Documents & Publications Major DOE Biofuels Project Locations Slide 1 The Current State of Technology for Cellulosic Ethanol...

405

Alternative Fuels Data Center: Alternative Fueling Station Locator  

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

Locate Stations Printable Version Share this resource Send a link to Alternative Fuels Data Center: Alternative Fueling Station Locator to someone by E-mail Share Alternative Fuels...

406

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

407

Alternative Fuels Data Center: Electric Vehicle Charging Station Locations  

Alternative Fuels and Advanced Vehicles Data Center (EERE)

Electric Vehicle Electric Vehicle Charging Station Locations to someone by E-mail Share Alternative Fuels Data Center: Electric Vehicle Charging Station Locations on Facebook Tweet about Alternative Fuels Data Center: Electric Vehicle Charging Station Locations on Twitter Bookmark Alternative Fuels Data Center: Electric Vehicle Charging Station Locations on Google Bookmark Alternative Fuels Data Center: Electric Vehicle Charging Station Locations on Delicious Rank Alternative Fuels Data Center: Electric Vehicle Charging Station Locations on Digg Find More places to share Alternative Fuels Data Center: Electric Vehicle Charging Station Locations on AddThis.com... More in this section... Electricity Basics Benefits & Considerations Stations Locations Infrastructure Development

408

Topology induced bifurcations for the NLS on the tadpole graph  

E-Print Network (OSTI)

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

C. Cacciapuoti; D. Finco; D. Noja

2014-05-14T23:59:59.000Z

409

Title, Location, Document Number Estimated Cost Description  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

Moody to Lev, SUBJECT: NEPA 2012 APS for DOE-SRS, Dated: JAN 25 2012 Moody to Lev, SUBJECT: NEPA 2012 APS for DOE-SRS, Dated: JAN 25 2012 Title, Location, Document Number Estimated Cost Description EA Determination Date: uncertain Transmittal to State: uncertain EA Approval: uncertain FONSI: uncertain EA Determination Date: uncertain Transmittal to State: uncertain EA Approval: uncertain FONSI: uncertain Total Estimated Cost $65,000 Annual NEPA Planning Summary NEPA Reviews of Proposals to Implement Enterprise SRS Initiatives unknown The Savannah River Site Strategic Plan for 2011 - 2015 describes 12 initiatives that Enterprise SRS will pursue by applying SRS's management core competencies in nuclear materials. Implementation of new missions resulting from this effort will likely require NEPA review. However, until firm proposals are developed

410

Instrument Grant Location CCSR 21XX Location CCSR 12XX Location SIM-1 BD FACSCalibur flow cytometer-2 laser/4 color Grant S-348A none none none  

E-Print Network (OSTI)

Instrument Grant Location CCSR 21XX Location CCSR 12XX Location SIM-1 BD FACSCalibur flow cytometer-2 laser/4 color Grant S-348A none none none BD FACScan flow cytometer 1 laser/3 color none CCSR 2121 none none Beckman Spectrophotometer(3) Grant S-348 CCSR 2122 CCSR 1210 none Chemilluminescence and Gel

Kay, Mark A.

411

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

412

Categorical Exclusion Determinations: Other Location | Department of Energy  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

Other Location Other Location Categorical Exclusion Determinations: Other Location Location Categorical Exclusion Determinations issued for actions in other locations. DOCUMENTS AVAILABLE FOR DOWNLOAD September 28, 2011 CX-006938: Categorical Exclusion Determination Developing Lithium-Ion Cells for Electric Vehicle Batteries CX(s) Applied: B3.6 Date: 09/28/2011 Location(s): Daejeon, South Korea, Other Location Office(s): Energy Efficiency and Renewable Energy, Savannah River Operations Office September 28, 2011 CX-006922: Categorical Exclusion Determination Amerigon Waste Heat Recovery Program for Passenger Vehicles CX(s) Applied: A9, B3.6 Date: 09/28/2011 Location(s): Germany, California, Indiana, Michigan Office(s): Energy Efficiency and Renewable Energy, Savannah River Operations Office

413

Alternative Fuels Data Center: Biodiesel Fueling Station Locations  

Alternative Fuels and Advanced Vehicles Data Center (EERE)

Station Locations to someone by E-mail Station Locations to someone by E-mail Share Alternative Fuels Data Center: Biodiesel Fueling Station Locations on Facebook Tweet about Alternative Fuels Data Center: Biodiesel Fueling Station Locations on Twitter Bookmark Alternative Fuels Data Center: Biodiesel Fueling Station Locations on Google Bookmark Alternative Fuels Data Center: Biodiesel Fueling Station Locations on Delicious Rank Alternative Fuels Data Center: Biodiesel Fueling Station Locations on Digg Find More places to share Alternative Fuels Data Center: Biodiesel Fueling Station Locations on AddThis.com... More in this section... Biodiesel Basics Benefits & Considerations Stations Locations Infrastructure Development Vehicles Laws & Incentives Biodiesel Fueling Station Locations Find biodiesel (B20 and above) fueling stations near an address or ZIP code

414

Location theory and the location of industry along an interstate highway  

E-Print Network (OSTI)

identified in theory will provide a basis for the "empirical" model or system of classification to be used in tabulating the response to the survey. Of particular interest is the theoretical development of the ms]or forces in plant location; i. e, , cost... identified in theory will provide a basis for the "empirical" model or system of classification to be used in tabulating the response to the survey. Of particular interest is the theoretical development of the ms]or forces in plant location; i. e, , cost...

Miller, James Patterson

2012-06-07T23:59:59.000Z

415

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.

416

Location Based Security for Smart Grid Applications  

Science Journals Connector (OSTI)

Abstract Smart Grid (SG) promises efficient, sustainable, green and reliable electrical delivery by combining the existing electrical distribution network assets with modern information and communications technologies (ICT) in order to transfer information and energy in both directions. Introduction of these intelligent devices will help the grid monitor, protect, and automatically optimise the operation of interconnected elements, in addition to interaction between energy suppliers and consumers. However, this exposes the future grid to new security challenges and risks. In this paper, a framework for protecting Smart Grid applications using geographic location of the devices connected to it is proposed. With this framework, each device on the grid adds an extra layer of security. The proposed scheme is not application or device specific which means it can be implemented on any communication node on the grid. The scheme uses an algebraic code based cryptosystems known as GPT (Gabidulin -Paramonov-Trejtakov), which provides a very strong protection while utilising the smallest key size as compared to other cryptosystems based on algebraic codes. As with other code based cryptosystems, the proposed security framework protects grid information against cyber threats as well as against channel impairments in the form of error protection codes.

Eraj Khan; Bamidele Adebisi; Bahram Honary

2013-01-01T23:59:59.000Z

417

SAPLE: Sandia Advanced Personnel Locator Engine.  

SciTech Connect

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

418

Homodyne impulse radar hidden object locator  

DOE Patents (OSTI)

An electromagnetic detector is designed to locate an object hidden behind a separator or a cavity within a solid object. The detector includes a PRF generator for generating 2 MHz pulses, a homodyne oscillator for generating a 2 kHz square wave, and for modulating the pulses from the PRF generator. A transmit antenna transmits the modulated pulses through the separator, and a receive antenna receives the signals reflected off the object. The receiver path of the detector includes a sample and hold circuit, an AC coupled amplifier which filters out DC bias level shifts in the sample and hold circuit, and a rectifier circuit connected to the homodyne oscillator and to the AC coupled amplifier, for synchronously rectifying the modulated pulses transmitted over the transmit antenna. The homodyne oscillator modulates the signal from the PRF generator with a continuous wave (CW) signal, and the AC coupled amplifier operates with a passband centered on that CW signal. The present detector can be used in several applications, including the detection of metallic and non-metallic objects, such as pipes, studs, joists, nails, rebars, conduits and electrical wiring, behind wood wall, ceiling, plywood, particle board, dense hardwood, masonry and cement structure. The detector is portable, light weight, simple to use, inexpensive, and has a low power emission which facilitates the compliance with Part 15 of the FCC rules.

McEwan, Thomas E. (Livermore, CA)

1996-01-01T23:59:59.000Z

419

Fusion categories in terms of graphs and relations  

E-Print Network (OSTI)

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

Hendryk Pfeiffer

2009-12-02T23:59:59.000Z

420

Alternative Fuels Data Center: Ethanol Fueling Station Locations  

Alternative Fuels and Advanced Vehicles Data Center (EERE)

Fueling Fueling Station Locations to someone by E-mail Share Alternative Fuels Data Center: Ethanol Fueling Station Locations on Facebook Tweet about Alternative Fuels Data Center: Ethanol Fueling Station Locations on Twitter Bookmark Alternative Fuels Data Center: Ethanol Fueling Station Locations on Google Bookmark Alternative Fuels Data Center: Ethanol Fueling Station Locations on Delicious Rank Alternative Fuels Data Center: Ethanol Fueling Station Locations on Digg Find More places to share Alternative Fuels Data Center: Ethanol Fueling Station Locations on AddThis.com... More in this section... Ethanol Basics Benefits & Considerations Stations Locations Infrastructure Development Vehicles Laws & Incentives Ethanol Fueling Station Locations Find ethanol (E85) fueling stations near an address or ZIP code or along a

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

Categorical Exclusion Determinations: Other Location | Department of Energy  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

Other Location Other Location Categorical Exclusion Determinations: Other Location Location Categorical Exclusion Determinations issued for actions in other locations. DOCUMENTS AVAILABLE FOR DOWNLOAD September 24, 2013 CX-010914: Categorical Exclusion Determination Pilot Testing of a Highly Efficient Pre-Combustion Sorbent-Based Carbon Capture System (SUMMARY Categorical Exclusion (CX)) CX(s) Applied: A9, A11, B3.6 Date: 09/24/2013 Location(s): Multiple States, China, Canada Offices(s): National Energy Technology Laboratory August 21, 2013 CX-010781: Categorical Exclusion Determination A Geomechanical Model for Gas Shales Based on Integration of Stress CX(s) Applied: A9, A11, B3.6 Date: 08/21/2013 Location(s): Pennsylvania Offices(s): National Energy Technology Laboratory August 16, 2013

422

Alternative Fueling Station Locator - Mobile | Open Energy Information  

Open Energy Info (EERE)

Fueling Station Locator - Mobile Fueling Station Locator - Mobile Jump to: navigation, search Tool Summary LAUNCH TOOL Name: Alternative Fueling Station Locator - Mobile Agency/Company /Organization: United States Department of Energy Partner: National Renewable Energy Laboratory Sector: Energy Focus Area: Transportation Phase: Evaluate Options, Prepare a Plan Resource Type: Online calculator User Interface: Mobile Device Website: www.afdc.energy.gov/afdc/locator/m/stations/ Web Application Link: www.afdc.energy.gov/afdc/locator/m/stations/ Cost: Free References: National Renewable Energy Laboratory Advanced Vehicles and Fuels Research: Data and Resources[1] Logo: Alternative Fueling Station Locator - Mobile Find fueling stations for your alternative fuel vehicle on-the-go with the

423

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

Science Journals Connector (OSTI)

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

Leszek Kotulski; Adam S?dziwy; Barbara Strug

2014-01-01T23:59:59.000Z

424

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

Science Journals Connector (OSTI)

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

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

2013-04-17T23:59:59.000Z

425

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

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

Locations of Smart Grid Demonstration and Large-Scale Energy Storage Projects Locations of Smart Grid Demonstration and Large-Scale Energy Storage Projects Map of the United States...

426

Property:News/PrimaryLocation | Open Energy Information  

Open Energy Info (EERE)

PrimaryLocation Jump to: navigation, search This is a property of type Page. Retrieved from "http:en.openei.orgwindex.php?titleProperty:NewsPrimaryLocation&oldid285888"...

427

File:VallesLocationMap.pdf | Open Energy Information  

Open Energy Info (EERE)

VallesLocationMap.pdf Jump to: navigation, search File File history File usage Metadata File:VallesLocationMap.pdf Size of this preview: 800 479 pixels. Full resolution (934...

428

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

429

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

430

Energy Department Announces Student Teams, New Location for Solar...  

Energy Savers (EERE)

New Location for Solar Decathlon 2013 Energy Department Announces Student Teams, New Location for Solar Decathlon 2013 January 26, 2012 - 10:56am Addthis WASHINGTON, DC - At an...

431

Relative Location of Seismic Events Using Surface Waves  

Science Journals Connector (OSTI)

......The BOXCAR explosion at the Nevada Test Site was located with surface waves...activity in the Pahute Mesa area, Nevada Test Site, December 8, 1968-June 30...The BOXCAR explosion at the Nevada Test Site was located with surfacewavesusingboth......

David von Seggern

1972-04-01T23:59:59.000Z

432

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

433

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

434

On locating–dominating sets in infinite grids  

Science Journals Connector (OSTI)

Determining a malfunctioning component in a processor network gives the motivation for locating–dominating sets. It is shown that the smallest possible density of a locating–dominating set in the king grid equals 1/5 and in the hexagonal mesh 1/3. Moreover, we discuss a natural modification of locating–dominating sets.

Iiro Honkala; Tero Laihonen

2006-01-01T23:59:59.000Z

435

Improved approximation algorithms for a capacitated facility location problem  

E-Print Network (OSTI)

that ordinary randomized rounding rarely generates a feasible solution to the associated set covering problemImproved approximation algorithms for a capacitated facility location problem Fabi'an A. Chudak. There is a set of demand locations that require service from facilities; there is a set of locations at which

Keinan, Alon

436

Location-based Sponsored Search Advertising George Trimponias1  

E-Print Network (OSTI)

Location-based Sponsored Search Advertising George Trimponias1 , Ilaria Bartolini2 , Dimitris unprecedented opportunities for location-based advertising. In this work, we provide models and investigate the market for location-based sponsored search, where advertisers pay the search engine to be displayed

Papadias, Dimitris

437

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

438

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

439

Site Location of Development Act (Maine) | Department of Energy  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

Location of Development Act (Maine) Location of Development Act (Maine) Site Location of Development Act (Maine) < Back Eligibility Agricultural Commercial Construction Fed. Government Fuel Distributor General Public/Consumer Industrial Installer/Contractor Institutional Investor-Owned Utility Local Government Low-Income Residential Multi-Family Residential Municipal/Public Utility Nonprofit Residential Retail Supplier Rural Electric Cooperative Schools State/Provincial Govt Systems Integrator Transportation Tribal Government Utility Savings Category Alternative Fuel Vehicles Hydrogen & Fuel Cells Buying & Making Electricity Water Home Weatherization Solar Wind Program Info State Maine Program Type Siting and Permitting Provider Department of Environmental Protection The Site Location of Development Act regulates the locations chosen for

440

Building Technologies Office: DOE Challenge Home Partner Locator  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

Building Technologies Office Search Building Technologies Office Search Search Help Building Technologies Office HOME ABOUT EMERGING TECHNOLOGIES RESIDENTIAL BUILDINGS COMMERCIAL BUILDINGS APPLIANCE & EQUIPMENT STANDARDS BUILDING ENERGY CODES EERE » Building Technologies Office » Residential Buildings Share this resource Send a link to Building Technologies Office: DOE Challenge Home Partner Locator to someone by E-mail Share Building Technologies Office: DOE Challenge Home Partner Locator on Facebook Tweet about Building Technologies Office: DOE Challenge Home Partner Locator on Twitter Bookmark Building Technologies Office: DOE Challenge Home Partner Locator on Google Bookmark Building Technologies Office: DOE Challenge Home Partner Locator on Delicious Rank Building Technologies Office: DOE Challenge Home Partner

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

Alternative Fuels Data Center: Natural Gas Fueling Station Locations  

Alternative Fuels and Advanced Vehicles Data Center (EERE)

Natural Gas Natural Gas Printable Version Share this resource Send a link to Alternative Fuels Data Center: Natural Gas Fueling Station Locations to someone by E-mail Share Alternative Fuels Data Center: Natural Gas Fueling Station Locations on Facebook Tweet about Alternative Fuels Data Center: Natural Gas Fueling Station Locations on Twitter Bookmark Alternative Fuels Data Center: Natural Gas Fueling Station Locations on Google Bookmark Alternative Fuels Data Center: Natural Gas Fueling Station Locations on Delicious Rank Alternative Fuels Data Center: Natural Gas Fueling Station Locations on Digg Find More places to share Alternative Fuels Data Center: Natural Gas Fueling Station Locations on AddThis.com... More in this section... Natural Gas Basics Benefits & Considerations

442

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

443

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

Science Journals Connector (OSTI)

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

2014-01-01T23:59:59.000Z

444

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

Science Journals Connector (OSTI)

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

John P. Georges; David W. Mauro

2005-05-01T23:59:59.000Z

445

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

Science Journals Connector (OSTI)

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

John P. Georges; David W. Mauro

2005-02-01T23:59:59.000Z

446

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

Science Journals Connector (OSTI)

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

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

1995-11-01T23:59:59.000Z

447

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

Science Journals Connector (OSTI)

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

John P. Georges; David W. Mauro

2005-02-01T23:59:59.000Z

448

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

449

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

450

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

E-Print Network (OSTI)

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

Gravdahl, Jan Tommy

451

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

452

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

453

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

E-Print Network (OSTI)

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

Fernandez, Thomas

454

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

455

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

E-Print Network (OSTI)

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

Stone, Peter

456

Discrete Scale Invariance in Scale Free Graphs Matias Gra~na  

E-Print Network (OSTI)

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

Graña, Matías

457

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

458

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

459

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

460

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

E-Print Network (OSTI)

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

King, Kuo Chin Irwin

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

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

E-Print Network (OSTI)

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

Renlund, Henrik

2011-01-01T23:59:59.000Z

462

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

E-Print Network (OSTI)

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

Sunder, V S

463

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

Science Journals Connector (OSTI)

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

Jehyun Lee, Heejo Lee

2014-08-01T23:59:59.000Z

464

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

E-Print Network (OSTI)

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

Paris-Sud XI, Université de

465

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

466

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

467

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.

468

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.

469

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

470

Anytime QoS optimization over the PlanGraph for web service composition  

Science Journals Connector (OSTI)

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

Yuhong Yan; Min Chen; Yubin Yang

2012-03-01T23:59:59.000Z

471

Relations in Mathematical Morphology with applications to Graphs and Rough Sets  

E-Print Network (OSTI)

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

Stell, John

472

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

E-Print Network (OSTI)

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

Kim, Miryung

473

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

474

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

475

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

476

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

E-Print Network (OSTI)

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

477

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

478

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

Science Journals Connector (OSTI)

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

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

2009-12-01T23:59:59.000Z

479

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

480

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.


481

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

482

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

483

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.

484

Alternative Fueling Station Locator App Provides Info at Your Fingertips |  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

Alternative Fueling Station Locator App Provides Info at Your Alternative Fueling Station Locator App Provides Info at Your Fingertips Alternative Fueling Station Locator App Provides Info at Your Fingertips November 15, 2013 - 10:12am Addthis The Alternative Fueling Station Locator iPhone app helps you find fueling stations that offer electricity, natural gas, biodiesel, E85, propane, or hydrogen. | Energy Department The Alternative Fueling Station Locator iPhone app helps you find fueling stations that offer electricity, natural gas, biodiesel, E85, propane, or hydrogen. | Energy Department Shannon Brescher Shea Communications Manager, Clean Cities Program Smartphone users are familiar with the prompt, "Would you like this site to use your current location?" If you're looking for somewhere to fuel your

485

Establish Building Locations for Greenhouse Gas Mitigation | Department of  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

Establish Building Locations for Greenhouse Gas Mitigation Establish Building Locations for Greenhouse Gas Mitigation Establish Building Locations for Greenhouse Gas Mitigation October 7, 2013 - 10:53am Addthis YOU ARE HERE Step 2 After estimating greenhouse gas (GHG) emissions by building type, building location is an important consideration in evaluating the relevance of energy-saving strategies due to variations in heating and cooling needs, and the GHG reduction potential due to variability of emissions factors across regions of the grid. If site-level energy use estimates are available for each of the program's key building types, the program can identify building locations with the greatest emission reduction potential by using the benchmarking approach. Locations with the worst energy performance relative to the benchmark are

486

Alternative Fueling Station Locator App Provides Info at Your Fingertips |  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

Alternative Fueling Station Locator App Provides Info at Your Alternative Fueling Station Locator App Provides Info at Your Fingertips Alternative Fueling Station Locator App Provides Info at Your Fingertips November 15, 2013 - 10:12am Addthis The Alternative Fueling Station Locator iPhone app helps you find fueling stations that offer electricity, natural gas, biodiesel, E85, propane, or hydrogen. | Energy Department The Alternative Fueling Station Locator iPhone app helps you find fueling stations that offer electricity, natural gas, biodiesel, E85, propane, or hydrogen. | Energy Department Shannon Brescher Shea Communications Manager, Clean Cities Program Smartphone users are familiar with the prompt, "Would you like this site to use your current location?" If you're looking for somewhere to fuel your

487

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

488

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

489

GIS and Location Theory Based Bioenergy Systems Planning.  

E-Print Network (OSTI)

??This research is concerned with bioenergy systems planning and optimization modelling in the context of locating biomass power plants and allocating available biomass feedstock to… (more)

Dong, Jingyuan

2008-01-01T23:59:59.000Z

490

Policy-aware sender anonymity in Location-based services  

E-Print Network (OSTI)

from attackers who (via hacking or subpoenas) gain access toagainst attackers who, via hacking or subpoenas, gain accessthe location database D 1 (via hacking or subpoena) and is “

Vyas, Avinash

2011-01-01T23:59:59.000Z

491

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

492

Research Site Locations for Current EERE Postdoctoral Awards...  

Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

More Documents & Publications Research Site Locations for Current and Former EERE Postdoctoral Awards EERE: VTO - Red Leaf PNG Image EERE: VTO - Hybrid Bus PNG Image...

493

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

494

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

495

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

496

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

497

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

498

Reliability Models for Facility Location: The Expected Failure Cost ...  

E-Print Network (OSTI)

Reliability Models for Facility Location: The Expected Failure Cost Case. Lawrence V. Snyder (larry.snyder ***at*** lehigh.edu) Mark S. Daskin (m-daskin *

Lawrence V. Snyder

499

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

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

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

500

Optimization Online - THE MULTI–FACILITY LOCATION PROBLEM ...  

E-Print Network (OSTI)

Abstract: A generalized Weiszfeld method is proposed for the multi–facility location ... Category 1: Applications -- OR and Management Sciences (Other ).

Cem Iyigun