Powered by Deep Web Technologies
Note: This page contains sample records for the topic "graph pages mer" 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

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

2

PDSF Utilization Graphs  

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

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

3

MER  

Gasoline and Diesel Fuel Update (EIA)

July 25, 1996 July 25, 1996 ''The Administrator shall be responsible for carrying out a central, comprehensive, and unified energy data and information program which will collect, evaluate, assemble, analyze, and disseminate data and information....'' Ordering Information This publication and other EIA publications may be purchased from the Superintendent of Documents, U.S. Government Printing Office. Telephone and fax orders should be directed to: Superintendent of Documents U.S. Government Printing Office Main Order Desk 202-512-1800 Fax: 202-512-2250 8 a.m. to 4:30 p.m., eastern time, M-F Mail orders should be directed to: U.S. Government Printing Office P.O. Box 371954 Pittsburgh, PA 15250-7954 Complimentary subscriptions and single issues are available to certain groups of subscribers, such as public and academic libraries; Federal, State, local, and foreign governments;

4

The MER/CIP Portal for Ground Operations Louise Chan*  

E-Print Network [OSTI]

The MER/CIP Portal for Ground Operations Louise Chan* Sanjay Desai* Matthew D'Ortenzio Robert E Portal We developed the Mars Exploration Rover/Collaborative Information Portal (MER/CIP) to facilitate MER operations. MER/CIP provides a cen- tralized, one-stop delivery platform integrating science

Filman, Robert E.

5

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

6

Analysis of the BATSE Continuous MER data  

E-Print Network [OSTI]

The CGRO/BATSE database includes many types of data such as the 16-channel continuous background or medium energy resolution burst data (CONT and MER data types). We have calculated some four hundred burst's medium energy resolution spectra and Principal Component Analysis has been applied. We found five components can describe GRBs' spectra.

P. Veres; I. Horvath; L. G. Balazs

2005-10-11T23: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

Rover Technology Development and Mission Infusion Beyond MER  

E-Print Network [OSTI]

1 Rover Technology Development and Mission Infusion Beyond MER Richard Volpe Jet Propulsion ROVER TECHNOLOGY USAGE ......3 4. ROVER TECHNOLOGY INFUSION............3 5. MTP ROVER TECHNOLOGY

Volpe, Richard

9

DSK: k-mer counting with very low memory usage  

Science Journals Connector (OSTI)

......k-mer counting with very low memory usage Guillaume Rizk 1 Dominique Lavenier 2 Rayan...function of the desired memory and disk usage. In Section 3, DSK is used to count all...sequences, k-mer length k, target memory usage M (bits), target disk space D (bits......

Guillaume Rizk; Dominique Lavenier; Rayan Chikhi

2013-03-01T23:59:59.000Z

10

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

11

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

12

Page  

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

of of Page This final rule arnentis the Department's DOE must p>st synopses of program announcements of funding opportunities and modification; to these announcements at the Grants.gov FIND Internet site, using the standard dau. elements/format. DOE implemented this requirement in Financial Assistance Letter (pAL) 2003-O3R, 10/28/03. As of the effi~ctive date of this rule - March 22, 2004, DOE is no longer required to publish separate notices of funding opportunities in the Federal Register. DOE must u:re the government-wide standard format to publish program announceme:tlts of funding opportunities. DOE implemented this requirement in F AL 2003-03R, 10/28/03. (See the financial assistance announcement of funding opportunity 1emplate on the Professionals Homepage)

13

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

14

NETL: Mercury Emissions Control Technologies - Demonstration of Mer-Cure  

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

Demonstration of Mer-Cure Technology for Enhanced Mercury Control Demonstration of Mer-Cure Technology for Enhanced Mercury Control ALSTOM Power, Inc. – U.S. Power Plant Laboratories (ALSTOM-PPL) proposes herein a consortium-based program to demonstrate ALSTOM-PPL's Mer-Cure™ technology – a novel, sorbent-based (Mer-Clean™ ) mercury control technology in coal-fired boilers. The program objective is (i) to demonstrate at a full scale greater than 90% mercury capture based on baseline mercury level (ii) at a cost significantly less than 50% of the $60,000/lb of mercury removed. The proposed full-scale demonstration program is to perform two- to six-month test campaigns in three independent host sites with various boiler configurations over a two-year period. The demonstration program will include a two- to four-week short-term field test followed by two- to six-month long-term demonstration for each of the three selected sites.

15

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

16

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

17

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

18

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

19

Graph Visualization API Library for Application Builders  

Science Journals Connector (OSTI)

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

Franois Bertault; Wendy Feng; Uli Feier; Gabe Grigorescu

2002-01-01T23:59:59.000Z

20

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

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

22

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

23

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

24

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

25

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

26

NETL: Mercury Emissions Control Technologies - Evaluation of MerCAP for  

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

Evaluation of MerCAP(tm) for Power Plant Mercury Control Evaluation of MerCAP(tm) for Power Plant Mercury Control URS Group and its test team will perform research to further develop the novel Mercury Control via Adsorption Process (MerCAP™). The general MerCAP™ concept is to place fixed structures into a flue gas stream to adsorb mercury and then periodically regenerate them and recover the captured mercury. EPRI has shown that gold-based sorbents can achieve high levels of mercury removal in scrubbed flue gases. URS is proposing tests at two power plants using gold MerCAP™, installed downstream of either a baghouse or wet scrubber, to evaluate mercury removal from flue gas over a period of 6 months. At Great River Energy’s Stanton Station, which burns North Dakota lignite, sorbent structures will be retrofitted into a single compartment in the Unit 10 baghouse enabling reaction with a 6 MWe equivalence of flue gas. At Southern Company Services’ Plant Yates, which burns Eastern bituminous coal, gold-coated plates will be configured as a mist eliminator (ME) located downstream of a 1 MWe pilot wet absorber , which receives flue gas from Unit 1.

27

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

28

Simrank: Rapid and sensitive general-purpose k-mer search tool  

SciTech Connect (OSTI)

Terabyte-scale collections of string-encoded data are expected from consortia efforts such as the Human Microbiome Project (http://nihroadmap.nih.gov/hmp). Intra- and inter-project data similarity searches are enabled by rapid k-mer matching strategies. Software applications for sequence database partitioning, guide tree estimation, molecular classification and alignment acceleration have benefited from embedded k-mer searches as sub-routines. However, a rapid, general-purpose, open-source, flexible, stand-alone k-mer tool has not been available. Here we present a stand-alone utility, Simrank, which allows users to rapidly identify database strings the most similar to query strings. Performance testing of Simrank and related tools against DNA, RNA, protein and human-languages found Simrank 10X to 928X faster depending on the dataset. Simrank provides molecular ecologists with a high-throughput, open source choice for comparing large sequence sets to find similarity.

DeSantis, T.Z.; Keller, K.; Karaoz, U.; Alekseyenko, A.V; Singh, N.N.S.; Brodie, E.L; Pei, Z.; Andersen, G.L; Larsen, N.

2011-04-01T23:59:59.000Z

29

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

30

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

31

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

32

Hadley Circulation Response to Orbital Precession. Part I: Aquaplanets TIMOTHY M. MERLIS  

E-Print Network [OSTI]

Hadley Circulation Response to Orbital Precession. Part I: Aquaplanets TIMOTHY M. MERLIS Princeton, in final form 24 July 2012) ABSTRACT The response of the monsoonal and annual-mean Hadley circulation slab-ocean lower boundary. Contrary to expectations, the simulated monsoonal Hadley circulation

Eisenman, Ian

33

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

34

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

35

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

36

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

37

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

38

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

39

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

40

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

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

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

42

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

43

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

44

Mercuric ion reduction and resistance in transgenic Arabidopsis thaliana plants expressing a modified bacterial merA gene  

Science Journals Connector (OSTI)

...1995 (received for review July 19, 1995) ABSTRACT...in paints, and in the mining of gold. Its use in...of a phytoremediation plan for metal-contaminated...mercury is subjected to the standard bio- geo-chemical...metal ion pollution. We plan to determine if merA...

C L Rugh; H D Wilde; N M Stack; D M Thompson; A O Summers; R B Meagher

1996-01-01T23:59:59.000Z

45

La loi REOM contre la vie chre en outre-mer : Une construction difficile entre concurrence et administration des prix  

E-Print Network [OSTI]

Outre-mer, M. Victorin Lurel. * Professeur de Sciences économiques, GDI, Université de la Polynésie française et LAMETA, Université de Montpellier. ** Maître de conférences en Sciences économiques, GDI

Paris-Sud XI, Université de

46

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.

47

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

48

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

49

PAGE OF PAGES  

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

bONTRACT AWARD bONTRACT AWARD ! PAGE OF PAGES 1 1. CONTACT NUMBER 2. EFfECT1VE DATE 3. SOUCiTATION NUMBER DE-EMOO01819 I 01/1312012 DE·SOL·OOO2446 *. ISSUED BY ClDE ,,0:.:3:.:0"'0"-1 _ _ _ _ _ - l *. AOUIN!STEREDBY /11_"'. EMCBC - ~~ U.S. Department of Energy U.S. Oepartment of Energy Carlsbad Field Office EM Consolidated Business Cent r 4021 National Parks Highway 250 E. 5th Street, Suite 500 P.O. Box 3090 Cincinnati, OH 45202 Carlsbad, NM 88221 7. NAMEANDAODRESS OF CdOE 8. PAYMeNrV4L BE MADE BY CONTRACTOR ; ' - - - - - - - - - i CAST Specially Transportation, Inc. U.S. Department of Energy Altn: Richard E s h e ' Oak Ridge OperaUons Office 9850 Havana Street Oak Ridge Financial Services Center Henderson, CO 80640·8443 P.O. Box 4307 OA. DUNS NUMIIER 138577528

50

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

51

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

52

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

53

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

54

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

55

Evaporative evolution of Martian brines based on halogens in nakhlites and MER samples  

SciTech Connect (OSTI)

Comparison of Cl and Br from Nakhla viens to MER samples suggests two kinds of brine solutions existed on Mars, one early and one late in the evaporation sequence. These solutions precipitated the secondary salts at the Meridiani and Gusev sites. We have recently reported the Cl and Br abundances determined by APS X-ray Microprobe and EMPA analyses of secondary aqueous minerals in Nakhla veins and discussed the significance of Cl-Br correlations with respect to the evolution of brine solutions on Mars. In that study, we suggested that the low Br concentration ({approx}10 ppm) in Lafayette Iddingsite is indicative of early stage of evaporation during progressive evolution of Martian brine solutions, which is, in turn, consistent with the petrographic evidence of early deposition of salt sequence of carbonate-sulfate- and no halite in Lafayette. We showed that the high Br concentrations of {approx}240 ppm in secondary salts in Nakhla veins similarly indicate late stages of evaporation in evolving Martian brine solutions which is again consistent with petrographic evidence of late stage deposition of salt sequence i.e. carbonate-sulfate-halite in Nakhla. When sea water evaporates under equilibrium conditions, the most insoluble carbonates (siderite and calcite) deposit first, followed by sulfates (gypsum and anhydrite) and finally the water-soluble halides are precipitated when the water content is sufficiently low. In the present study, we make a detailed comparison of Cl/Br ratios in secondary minerals in nakhlites with those in MER soils and rocks at Gusev and Meridiani and show that the compositions of solutions that inundated Lafayette iddingsite (early stage) and Nakhla veins (late stage) include the range of solution-compositions that gave rise to a variety of secondary salts at Gusev and Meridiani sites. Further, the results obtained here suggest that two kinds of brine solutions (one, late and the other, early or intermediate stage) seem to have inundated most of the rocks and soils to varying degrees and precipitated the secondary salts at Meridiani and Gusev sites.

Rao, M.N.; Sutton, S.R.; McKay, D.S. (Lockheed); (UC); (NASA)

2005-02-04T23:59:59.000Z

56

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

57

Graph anomalies in cyber communications  

SciTech Connect (OSTI)

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

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

2011-01-11T23:59:59.000Z

58

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

59

?-Ray footprinting and fluorescence polarization anisotropy of a 30-mer synthetic DNA fragment with one 2?-deoxy-7-hydro-8- oxoguanosine lesion  

Science Journals Connector (OSTI)

The influence of the oxidative lesion 2?-deoxy-7-hydro-8-oxoguanosine (8-oxodG) on some conformational properties of DNA has been studied. Four 30-mer duplexes of the form [5?-GATCCTCTAGAGTC[G* or G]ACCTGCAGGCAT...

F. Barone; L. Cellai; C. Giordano; M. Matzeu; F. Mazzei

2000-01-01T23:59:59.000Z

60

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

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

APPENDIX F, Page F1  

E-Print Network [OSTI]

;Page F16 #12;Page F17 #12;Page F18 #12;Page F19 #12;Page F20 #12;Page F21 #12;Page F22 #12;Page F23 #12

Omiecinski, Curtis

62

DOE PAGES  

Office of Scientific and Technical Information (OSTI)

a useful reference. Find out more Do you have questions about DOE PAGESBeta content, procedures, or policies? More information is available at OSTI's Public Access Policy page and...

63

Monthly Energy Review - April 2001  

Gasoline and Diesel Fuel Update (EIA)

April April 30, 2001 Electronic Access The Monthly Energy Review (MER) is available on the Energy Information Administration (EIA) website in a wide variety of formats at: http://www.eia.doe.gov/mer * Tables: ASCII text (TXT) and Portable Document Format (PDF) files. * Table Data Files: Excel (XLS) and Lotus (WK1). * Database Files (unrounded monthly data 1973 forward): Excel (XLS) files. * Graph pages, MER sections, and complete MER: PDF files. Complete MER PDF files are also available on the EIA "Energy Info Disk" through the U.S. De- partment of Commerce at 1-800-STAT-USA. Also available are ASCII comma delimited data files at: http://www.eia.doe.gov/pub/energy.overview/ monthly.energy/current.mer. Timing of Release: MER data are normally released in the afternoon of the third-to-last workday of each month and are usually available electronically the following

64

Monthly Energy Review - October 2000  

Gasoline and Diesel Fuel Update (EIA)

October October 25, 2000 Electronic Access The Monthly Energy Review (MER) is available on the Energy Information Administration (EIA) website in a wide variety of formats at: http://www.eia.doe.gov/mer * Tables: ASCII text (TXT) and Portable Document Format (PDF) files. * Table Data Files: Excel (XLS) and Lotus (WK1). * Database Files (unrounded monthly data 1973 forward): Excel (XLS) files. * Graph pages, MER sections, and complete MER: PDF files. Complete MER PDF files are also available on the EIA "Energy Info Disk" through the U.S. De- partment of Commerce at 1-800-STAT-USA. Also available are ASCII comma delimited data files at: http://www.eia.doe.gov/pub/energy.overview/ monthly.energy/current.mer. Timing of Release: MER data are normally released in the afternoon of the third-to-last workday of each month and are usually available electronically the following

65

Monthly Energy Review - September 2000  

Gasoline and Diesel Fuel Update (EIA)

September September 26, 2000 Electronic Access The Monthly Energy Review (MER) is available on the Energy Information Administration (EIA) website in a wide variety of formats at: http://www.eia.doe.gov/mer * Tables: ASCII text (TXT) and Portable Document Format (PDF) files. * Table Data Files: Excel (XLS) and Lotus (WK1). * Database Files (unrounded monthly data 1973 forward): Excel (XLS) files. * Graph pages, MER sections, and complete MER: PDF files. Complete MER PDF files are also available on the EIA "Energy Info Disk" through the U.S. De- partment of Commerce at 1-800-STAT-USA. Also available are ASCII comma delimited data files at: http://www.eia.doe.gov/pub/energy.overview/ monthly.energy/current.mer. Timing of Release: MER data are normally released in the afternoon of the third-to-last workday of each month and are usually available electronically the following

66

Monthly Energy Review - June 2001  

Gasoline and Diesel Fuel Update (EIA)

June June 28, 2001 Electronic Access The Monthly Energy Review (MER) is available on the Energy Information Administration (EIA) website in a wide variety of formats at: http://www.eia.doe.gov/mer * Tables: ASCII text (TXT) and Portable Document Format (PDF) files. * Table Data Files: Excel (XLS) and Lotus (WK1). * Database Files (unrounded monthly data 1973 forward): Excel (XLS) files. * Graph pages, MER sections, and complete MER: PDF files. Complete MER PDF files are also available on the EIA "Energy Info Disk" through the U.S. De- partment of Commerce at 1-800-STAT-USA. Also available are ASCII comma delimited data files at: http://www.eia.doe.gov/pub/energy.overview/ monthly.energy/current.mer. Timing of Release: MER data are normally released in the afternoon of the third-to-last workday of each month and are usually available electronically the following

67

Algebraic connectivity and graph robustness.  

SciTech Connect (OSTI)

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

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

2009-07-01T23:59:59.000Z

68

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

69

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

70

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

71

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

72

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

73

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.

74

Janie Page  

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

Janie Page Janie Page Janie Page Grid Integration Group Demand Response Research Center (DRRC) Lawrence Berkeley National Laboratory 1 Cyclotron Road MS 90R1121 Berkeley CA 94720 Office Location: 90-1141 (510) 486-7015 JPage@lbl.gov Janie Page joined the Demand Response Research Group in 2010 as a Scientific Engineering Associate, specializing in residential and small commercial demand response. Prior to joining the DRRC, she was a Principal Associate at Siemens Energy and Automation, developing their Megacities transportation program. She is co-inventor of two U.S. patents for mathematical models describing biological system behavior in magnetic fields and has over thirty related publications in peer reviewed journals. She holds a bachelor's degree in Mathematics (minor: Astrophysics) and a

75

Special Page  

Gasoline and Diesel Fuel Update (EIA)

Since many of you are probably interested in heating fuels for the winter, Since many of you are probably interested in heating fuels for the winter, EIA has also designed specific or special web pages highlighting certain fuels. We find during certain times of the year, users look for certain energy information. For example, last year when heating prices spiked during Jan and Feb, we designed a page to highlight information on propane and heating oil. We also have a gasoline and diesel page because these fuels are important during the driving season. The page has information about stocks, production, imports and prices. We've provided links to various agencies/organizations and sites which may be relevant to getting tracking other information during the heating season such as SPR, LIHEAP, or associations such as API, PMAA, or the

76

Constrained Graph Optimization: Interdiction and Preservation Problems  

SciTech Connect (OSTI)

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

Schild, Aaron V [Los Alamos National Laboratory

2012-07-30T23:59:59.000Z

77

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

78

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

79

API Requirements for Dynamic Graph Prediction  

SciTech Connect (OSTI)

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

Gallagher, B; Eliassi-Rad, T

2006-10-13T23:59:59.000Z

80

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

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

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

82

Generating Reports & Graphs in Portfolio Manager  

Broader source: Energy.gov [DOE]

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

83

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

84

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

85

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

86

Energy Efficiency -- Home Page  

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

If you are having trouble, call 202-586-8800 for help. If you are having trouble, call 202-586-8800 for help. Home >Energy Users EEnergy Efficiency Page Energy-Efficiency Measurement MEASUREMENT DISCUSSION: Measures and Policy Issues Energy Intensity as a Common Surrogate for Energy Efficiency Indices as a Measure of Relative Changes Market-Basket Comprehensive Factorial Decomposition Divisia Index OTHER MEASUREMENT APPROACHES: Best Practice MEASUREMENT ISSUES : Site Energy Versus Primary Energy Physical Versus Economic Units picture of line graph on stand Energy Efficiency Measurement Discussion The development of energy-efficiency indictors, for any country, is limited by the availability of data. Data are limited for several reasons. As the amount of data collected increases so do the costs of collecting, processing, and analyzing the data. The configuration of certain technologies and processes can also limit the possibility of obtaining microdata. As an example, in the manufacturing sector, some motors are encased in such a way that it is impossible to collect data on the motor unless records have been maintained for the motor. This leads to another reason data are limited--respondent burden. Care has to be taken so that surveys are not so long that participation is discouraged or inaccurate answers are given due to the difficulty and time it takes to obtain the data.

87

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

88

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

89

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

90

Hybrid Al/SiC Composite Optics for IFE Applications W. Kowbel, MER Corp., Tucson, AZ And M. Tillack, UCSD, La Jolla, CA  

E-Print Network [OSTI]

Hybrid Al/SiC Composite Optics for IFE Applications W. Kowbel, MER Corp., Tucson, AZ And M. Tillack support of the mirror is a SiC composite. The SiC composite is chosen for the following reasons: 1) VeryC-SiC composite. Subsequently, either CVD or PVD Si is deposited as the optical quality layer. The Si coating

Tillack, Mark

91

Page not found | Department of Energy  

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

71 - 1280 of 31,917 results. 71 - 1280 of 31,917 results. Page Fluidized Bed Technology- An R&D Success Story In the early 1990s, POWER magazine called the development of fluidized bed coal combustors "the commercial success story of the last decade in the power generation business." The success, perhaps... http://energy.gov/fe/fluidized-bed-technology-rd-success-story Download EA-1897: Final Environmental Assessment AltaRock's Newberry Volcano EGS Demonstration near Bend, Oregon http://energy.gov/nepa/downloads/ea-1897-final-environmental-assessment Download Solar Background Document 5 Graph illustrating Chinese Development Bank financing to Chinese solar companies. http://energy.gov/downloads/solar-background-document-5 Download Solar Background Document 6 Graph illustrating solar cell production in the United States and China

92

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

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

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

93

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

94

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

95

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

96

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

97

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

98

Feature Tracking Using Reeb Graphs  

SciTech Connect (OSTI)

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

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

2010-08-02T23:59:59.000Z

99

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

100

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

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

work page  

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

Katherine Harkay's APS Home Page Katherine Harkay's APS Home Page Contact information: Katherine C. Harkay Physicist Accelerator Systems Division Advanced Photon Source Argonne National Laboratory Phone: 630-252-9758 Fax: 630-252-4732 E-mail: harkay@aps.anl.gov Argonne National Laboratory, ASD/401 B2166, 9700 S. Cass Avenue, Argonne, IL 60439, U.S.A. Research Interests: Concentration has been in the areas of high-intensity collective effects and machine coupling impedance, with the goal of improving the performance of particle accelerators. Another major research thrust has been the electron cloud effect, a growing concern in high-intensity, high-energy rings. Long-term research interests include: storage-ring FELs, coherent synchrotron radiation and nonlinear effects in beams, and plasma-based

102

Approximate von Neumann entropy for directed graphs  

Science Journals Connector (OSTI)

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

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

2014-05-12T23:59:59.000Z

103

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.

104

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.

105

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

106

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

107

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.

108

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

109

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

110

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

111

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.

112

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

113

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

114

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.

115

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

116

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

117

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

118

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

119

Bipartite graph partitioning and data clustering  

SciTech Connect (OSTI)

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

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

2001-05-07T23:59:59.000Z

120

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

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

Progressive transitions using body part motion graphs  

Science Journals Connector (OSTI)

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

Adso Fernndez-Baena; David Miralles

2011-12-01T23:59:59.000Z

122

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

123

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

124

Accelerating semantic graph databases on commodity clusters  

SciTech Connect (OSTI)

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

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

2013-10-06T23:59:59.000Z

125

Graph representation of protein free energy landscape  

SciTech Connect (OSTI)

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

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

2013-11-14T23:59:59.000Z

126

page 10  

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

LAB NEWS LAB NEWS * December 15, 2000 * Page 10 Sandia stimulates statewide wind power development Purchase of wind-generated electricity for WIPP is just the start of a wind industry in state Sandia is purchasing "green" elec- tricity generated by an already-in-place wind turbine near Clovis, N.M., to stim- ulate development of wind resources essentially untapped in New Mexico. The ecologically desirable power source is expected to provide electricity for approximately six percent of the DOE's Waste Isolation Pilot Plant (WIPP) total electric services requirement. Sandia scientists hope this purchase, along with others over a 10-year period, will stimulate the growth of a New Mex- ico wind power industry, says Henry Dodd, Manager of Wind Energy Tech- nology Dept 6214.

127

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

128

Monthly Energy Review - January 2007  

Gasoline and Diesel Fuel Update (EIA)

publications: Other monthly EIA reports are Petroleum Supply Monthly, Petroleum publications: Other monthly EIA reports are Petroleum Supply Monthly, Petroleum Marketing Monthly, Natural Gas Monthly, Electric Power Monthly, and International Petroleum Monthly. Readers of the MER may also be interested in EIA's Annual Energy Review, where many of the same data series are provided annually beginning with 1949. For more information, contact the National Energy Information Center at 202-586-8800 or InfoCtr@eia.doe.gov. Electronic Access The MER is available on EIA's Web site in a variety of formats at: http://www.eia.doe.gov/mer. Complete MER, and individual MER sections: Portable Document Format (PDF) files. Individual table and graph pages: PDF files. Data files for individual tables: Excel (XLS) files and ASCII comma-delimited (CSV) files.

129

Monthly Energy Review - March 2001  

Gasoline and Diesel Fuel Update (EIA)

98.00 98.00 per year (price subject to change without advance notice). Periodical postage paid at Washington, DC 20066-9998, and additional mailing offices. POSTMASTER: Send address changes to Monthly Energy Review, Energy Information Administration, EI-30, 1000 Independence Avenue, SW, Washington, DC 20585-0623. Printed with soy ink on recycled paper. Released for Printing: March 27, 2001 Electronic Access The Monthly Energy Review (MER) is available on the Energy Information Administration (EIA) website in a wide variety of formats at: http://www.eia.doe.gov/mer * Tables: ASCII text (TXT) and Portable Document Format (PDF) files. * Table Data Files: Excel (XLS) and Lotus (WK1). * Database Files (unrounded monthly data 1973 forward): Excel (XLS) files. * Graph pages, MER sections, and complete MER: PDF files. Complete MER PDF files are also available on the EIA "Energy

130

Semidefinite programming relaxations for graph coloring and ...  

E-Print Network [OSTI]

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

131

Page comments  

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

home/ home/ http://www.nersc.gov/users/computational-systems/hopper/updates-and-status/open-issues/resolved-error-message-modulecmd-switch-c-172-error-152-module-prgenv-cray-is-currently-not-loaded/#PageComment_97 > module list 2>&1 | grep Prg 32) PrgEnv-gnu/4.1.40 I ignore the error but It's a bit uncomfortable that the error takes screen the space here are my loaded modules: > module list Currently Loaded Modulefiles: 1) modules/3.2.6.6 2) xtpe-network-gemini 3) darshan/2.2.6 4) atp/1.6.2 5) switch/1.0-1.0401.36779.2.72.gem 6) shared-root/1.0-1.0401.37253.3.50.gem 7) pdsh/2.26-1.0401.37449.1.1.gem 8) nodehealth/5.0-1.0401.38460.12.18.gem 9) lbcd/2.1-1.0401.35360.1.2.gem 10) hosts/1.0-1.0401.35364.1.115.gem 11) configuration/1.0-1.0401.35391.1.2.gem 12) ccm/2.2.0-1.0401.37254.2.142 13)

132

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

133

Sequoia tops Graph 500 list of 'big data' supercomputers  

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

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

134

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

135

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

136

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

137

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

138

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

139

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

140

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

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

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

142

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

143

Nuclear Energy Page 570Page 570  

E-Print Network [OSTI]

Nuclear Energy Page 570Page 570 #12;Energy Supply and Conservation/ Nuclear Energy FY 2007;Energy Supply and Conservation/Nuclear Energy/ Overview FY 2007 Congressional Budget Energy Supply and Conservation Office of Nuclear Energy, Science and Technology Overview Appropriation Summary by Program

144

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

145

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

146

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

147

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.

148

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

149

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

150

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

151

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

152

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

153

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

154

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

155

SI Group Scheduling Page  

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

Personnel On-Call Page Beamline Validation Schedule Group Organizational Chart Reviews Presentations Group Scheduling Page Project Scheduling Information Ops Scheduling Info Project / Scheduling Info APS fy2005 Annual Schedule ( html ) PSS Validation Schedule APS fy2006 Annual Schedule (html) PSS Validation Teams Latest Machine Studies Schedule (pdf) (html) New Builds Schedule (For SI GROUP Reference Only) Parasitic Beam Operations Schedule Ops Scheduling Page Shutdown Information Work Schedules August/September Shutdown Shutdown Work List Validation Schedule Safety Info Work Request Links ISM Core Functions Enter / Search Work Requests APS Safety Page Modify / Approve Work Requests Radiation Safety Policy APS TMS Training Profiles MSDS Search This page maintained by Joe Budz

156

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

157

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

158

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

159

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

160

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

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

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

162

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

163

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

164

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

165

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.

166

Page not found | Department of Energy  

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

51 - 2360 of 26,777 results. 51 - 2360 of 26,777 results. Download Solar Background Document 6 Graph illustrating solar cell production in the United States and China from 2002 to 2010. http://energy.gov/downloads/solar-background-document-6 Page Occupational Safety & Health Criteria & Review Approach Documents http://energy.gov/hss/occupational-safety-health-criteria-review-approach-documents Download Docket No. EO-05-01: Letter Documenting Department of Energy Receipt of the Mirant Potomac River Compliance Plan http://energy.gov/oe/downloads/docket-no-eo-05-01-letter-documenting-department-energy-receipt-mirant-potomac-river Download Readiness Review Training- Development of Criteria And Review Approach Documents Slides used for November 8-9, 2010 Readiness Review Training - Development

167

Page not found | Department of Energy  

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

61 - 20070 of 28,560 results. 61 - 20070 of 28,560 results. Download Cumulative Federal Payments to OE Recovery Act Recipients, through April 30, 2013 Graph of cumulative Federal Payments to OE Recovery Act Recipients, through April 30, 2013. http://energy.gov/oe/downloads/cumulative-federal-payments-oe-recovery-act-recipients-through-april-30-2013 Article Quick Facts Quick Facts about the Southeastern Power Administration. http://energy.gov/sepa/articles/quick-facts Page Executive Leadership Program Program Overview: This program is based on the U.S. Office of Personnel Management's Leadership Effectiveness Framework (LEF), a model for effective leadership/managerial performance. The program... http://energy.gov/dvu/executive-leadership-program Article V-189: Oracle VirtualBox 'tracepath' Bug Lets Local Guest Users

168

Pages 38-87 of Penney  

E-Print Network [OSTI]

On a single sheet of graph paper, graph y ~ :1: : 1, y + a; : 1, and y ... Note: When entering matrices into MATLAB, one can use semicolons. (;) to separate...

169

Quantum graph as a quantum spectral filter  

SciTech Connect (OSTI)

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

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

2013-03-15T23:59:59.000Z

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

Webinar Summary Page 1  

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

Webinar Summary Page 1 TC&WM EIS Webinar December 10, 2012 FINAL MEETING SUMMARY HANFORD ADVISORY BOARD WEBINAR: FINAL TANK CLOSURE AND WASTE MANAGEMENT ENVIRONMENTAL IMPACT...

172

CAMD Cleanroom Login Page  

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

Cleanroom Equipment Booking Page Microfabrication Home Please enter in your User ID and Password below. UserID Password Login Forgot your password?...

173

Changyou Wang's Home Page  

E-Print Network [OSTI]

Partial Differential Equations; Calculus of Variations; Geometrical Analysis; Application of ... 2008, article ID rnm163, 23 pages (with O. Savin, Y. Yu). pdf file .

174

Math 172 Chapter 7A notes Page 1 of 14 7.1 Area Between Curves  

E-Print Network [OSTI]

= 1 5 (1)5 - 1 5 (-1)51 -1 = 1 5 (1) - 1 5 (-1) = 2 5 = 2 - 2 5 = 8 5 Example. Find the areaMath 172 Chapter 7A notes Page 1 of 14 7.1 Area Between Curves Recall area under a curve graph in [, ] = - Choose sample points in each subinterval. Add sample point in and draw rectangle 1 , ... , Area

Schumaker, Mark

175

Locating-total domination in claw-free cubic graphs  

Science Journals Connector (OSTI)

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

Michael A. Henning; Christian Lwenstein

2012-01-01T23:59:59.000Z

176

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

177

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

178

Ising-like models on arbitrary graphs : the Hadamard way  

E-Print Network [OSTI]

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

Mosseri, Rmy

2014-01-01T23:59:59.000Z

179

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

180

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

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

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

182

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

183

A notable family of entire intrinsic minimal graph...  

E-Print Network [OSTI]

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

2006-09-09T23:59:59.000Z

184

Sample page | Open Energy Information  

Open Energy Info (EERE)

Sample page Sample page Jump to: navigation, search This page has been rated 13[1][2] on the scale of awesomness. This page is awesome! The above text is generated by the SampleTemplate. Try editing it and changing the level of awesomeness to see the template react. Hint: It says something different depending on whether or not the page is at least 5 awesome. This page is related to the following topics[3][4]: References Sample pages Help pages Additional Info Name Sample page Awesomeness 13 Topics (raw) References; Sample pages; Help pages; References ↑ Francis C. Monastero. 2002. An overview of industry-military cooperation in the development of power operations at the Coso geothermal field in southern California. GRC Bulletin. . ↑ EPRI. 12/12/2012. Assessment and Mapping of the Riverine

185

Related Frog Web Pages  

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

Related Web Pages on Frogs Related Web Pages on Frogs The images of the frog in this kit are computer-generated. For another approach, in which photos and movies are used to follow an actual frog dissection, see the University of Virginia's pages here. For a lot of kid-oriented information about frogs, see Frogland. For live frog lovers .... Sounds of North American Frogs (a CD from Smithsonian Folkways). The Exploratorium in San Francisco maintains an on-line exhibit on frogs. Don't Dissect a Frog, Build it is a section in Nicholas Negroponte's online version of Being Digital. For veterinary and conservation issues, see Association of Reptilian and Amphibian Veterinarians. And of course, The FROGGY Page Berkeley Lab | ACS | Notice to Users | Whole Frog Project | Virtual Frog Page last modified: 01/26/05

186

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

187

Section name University of Reading 2010 Friday 1 October 2010 Page 1  

E-Print Network [OSTI]

2010 Page 2 HSBC ...........................................................................................

Petriu, Emil M.

188

Monthly Energy Review - June 2008  

Gasoline and Diesel Fuel Update (EIA)

Monthly Publications: Other monthly EIA reports are Petroleum Supply Monthly Publications: Other monthly EIA reports are Petroleum Supply Monthly, Petroleum Marketing Monthly, Natural Gas Monthly, Electric Power Monthly, and Inter- national Petroleum Monthly. For more information, contact the National Energy Information Center at 202-586-8800 or InfoCtr@eia.doe.gov. Electronic Access The MER is available on EIA's Web site in a variety of formats at: http://www.eia.doe.gov/mer. Complete MER, and individual MER sections: Portable Document Format (PDF) files. Individual table and graph pages: PDF files. Data files for individual tables: Excel (XLS) files and ASCII comma-delimited (CSV) files. Note: PDF files display selected annual and monthly data. Excel and CSV files display all avail- able annual and monthly data, often at a greater level of precision than the PDF files.

189

Create Page | Open Energy Information  

Open Energy Info (EERE)

Page Page Jump to: navigation, search Search First, try using the search feature to see if the page or topic already exists. If so, feel free to add to or edit that page using the Edit or Edit With Form button at the top of the page. If your topic does not already have a home, come back here for assistance with the creation of your new wiki page. Search Create There are several ways to create a new wiki page. Choose one of the options below to get started: Contribute - Select one of several easy-to-use forms related to some of the most popular OpenEI topics. Create - Don't see a button for your topic, or want to create your own wiki page from scratch? Enter your desired page name below. If the page already exists you can edit it, if not you'll see a blank edit form.

190

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

191

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

192

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

193

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.

194

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

195

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

196

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

197

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

198

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

199

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

200

VIDEO SUMMARIZATION BY VIDEO STRUCTURE ANALYSIS AND GRAPH OPTIMIZATION  

E-Print Network [OSTI]

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

King, Kuo Chin Irwin

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

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

202

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

203

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

204

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

205

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

206

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

207

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

208

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

209

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

210

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

211

International energy indicators. [Statistical tables and graphs  

SciTech Connect (OSTI)

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

Bauer, E.K. (ed.)

1980-05-01T23:59:59.000Z

212

An Experiment on Graph Analysis Methodologies for Scenarios  

SciTech Connect (OSTI)

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

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

2005-09-30T23:59:59.000Z

213

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

214

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

215

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

216

New Page 1  

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

meeting is to provide information to customers in connection with FY2016 Rates. Gloria Jordan, Western, 602-605-2649 or Jack Murray, Western, 602-605-2442 April To Main Page When...

217

Help:User page | Open Energy Information  

Open Energy Info (EERE)

A user page is a page about a wiki user; someone who registered on the A user page is a page about a wiki user; someone who registered on the wiki, and is (most probably) a contributor. If you have registered, you can create your own user page. Your user page is linked in the top right. More importantly, others will see links to your user page from various places which assist wiki collaboration. This includes the "Recent changes" and "page history" displays (See Help:Tracking changes). You can also link to your user page within text of a wiki page, which is mainly useful on talk pages when you sign your name. Contents 1 What to put on your user page 1.1 User scratchpad / development area 2 Other people's user pages 2.1 User Contributions 2.2 Editing someone else's page 2.3 User talk pages What to put on your user page

218

Efficient broadcast on random geometric graphs  

SciTech Connect (OSTI)

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

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

2009-01-01T23:59:59.000Z

219

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

220

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

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

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

222

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

223

Locating and paired-dominating sets in graphs  

Science Journals Connector (OSTI)

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

John McCoy; Michael A. Henning

2009-01-01T23:59:59.000Z

224

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

225

The Graph Laplacian and the Dynamics of Complex Networks  

SciTech Connect (OSTI)

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

Thulasidasan, Sunil [Los Alamos National Laboratory

2012-06-11T23:59:59.000Z

226

Datacenter Sustainability Page 1 Sustainability  

E-Print Network [OSTI]

Datacenter Sustainability Page 1 Datacenter Sustainability #12;Datacenter Sustainability Page 2 sustainability imperative and how advanced technologies, smart business practices, and strategic partnerships are helping us reduce our impact on the environment. Also learn how our investments in efficient, sustainable

Chaudhuri, Surajit

227

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

228

Energy Links Page - EIA  

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

Publications & Reports > Energy Links Page Publications & Reports > Energy Links Page Related Energy Links Energy Companies Coal & Other Electricity Foreign Integrated Natural Gas Transmission, Distribution, and Marketing News Services and Periodicals Oil & Gas Exploration and Production Petroleum Refining, Marketing, and Transportation State Owned U.S. Integrated Government Agencies Other DOE National Laboratories Federal Energy States Universities Trade Associations & Other Trade Associations Other Associations International Statistics Energy Services Other Energy Sites EIA Links Disclaimer These pages contain hypertext links to information created and maintained by other public and private organizations. These links provide additional information that may be useful or interesting and are being provided consistent with the intended purpose of the EIA Web site. EIA does not control or guarantee the accuracy, relevance, timeliness, or completeness of this outside information. EIA does not endorse the organizations sponsoring linked websites and we do not endorse the views they express or the products/services they offer.

229

Page | Open Energy Information  

Open Energy Info (EERE)

Page Page Jump to: navigation, search Properties of type "Page" Showing 149 properties using this type. A Property:ASHRAE 169 Climate Zone Property:ASHRAE 169 Climate Zone Number Property:ASHRAE 169 Climate Zone Subtype Property:ASHRAE 169 Standard Property:AdditionalBenefitPlaces Property:Affiliated Companies Property:Applicant Property:Availability Property:Awardee Property:AwardeeHeadquarters B Property:BLM CaseType Property:BasedNear Property:BrineConstituents Property:BrophyModel Property:Building/County Property:Buildings/ModelBuildingType Property:Buildings/ModelClimateZone Property:Buildings/Models C Property:CXReference Property:CapRockAge Property:CapRockLithology Property:City Property:Collaborating Organizations Property:Collaborators Property:ControlStructure

230

Main Page - NWChem  

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

Log in / create account Log in / create account Search Go Search Navigation Main page Science Benchmarks Download Code Documentation News Community Developers SEARCH TOOLBOX LANGUAGES Forum Menu Page Discussion View source History modified on 17 May 2013 at 21:51 *** 6,254,554 views Main Page From NWChem Jump to: navigation, search NWChem: Delivering High-Performance Computational Chemistry caption NWChem aims to provide its users with computational chemistry tools that are scalable both in their ability to treat large scientific computational chemistry problems efficiently, and in their use of available parallel computing resources from high-performance parallel supercomputers to conventional workstation clusters. NWChem software can handle Biomolecules, nanostructures, and solid-state From quantum to classical, and all combinations

231

Aprun MAN Page  

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

aprun » Aprun MAN Page aprun » Aprun MAN Page Aprun MAN Page aprun [-a arch ] [-b ] [-B] [-cc cpu_list | keyword ] [-cp cpu_placement_file_name ] [-d depth ] [-D value ] [-L node_list ] [-m size[h|hs] ] [-n pes ] [-N pes_per_node ][-F access mode ] [-q ] [-r cores][-S pes_per_numa_node ] [-sl list_of_numa_nodes ] [-sn numa_nodes_per_node ] [-ss ] [-T ] [-t sec ] executable [ arguments_for_executable ] IMPLEMENTATION Cray Linux Environment (CLE) DESCRIPTION To run an application on CNL compute nodes, use the Application Level Placement Scheduler (ALPS) aprun command. The aprun command specifies application resource requirements, requests application placement, and initiates application launch. The aprun utility provides user identity and environment information as part of the application launch so that your login node session can

232

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

233

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

234

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.

235

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

236

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

237

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.

238

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.

239

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

240

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.

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

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

242

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

243

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.

244

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

245

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

246

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

247

THIS PAGE INTENTIONALLY LEFT BLANK  

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

THIS PAGE INTENTIONALLY LEFT BLANK THIS PAGE INTENTIONALLY LEFT BLANK i U.S. DEPARTMENT OF ENERGY CRITICAL MATERIALS STRATEGY DECEMBER 2011 ii THIS PAGE INTENTIONALLY LEFT BLANK iii TABLE OF CONTENTS FOREWORD ........................................................................................................................................................... 1 ACKNOWLEDGEMENTS .......................................................................................................................................... 2 EXECUTIVE SUMMARY ........................................................................................................................................... 3 CHAPTER 1. INTRODUCTION .................................................................................................................................. 8

248

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

249

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

250

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

251

21 briefing pages total  

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

briefing pages total p. 1 briefing pages total p. 1 Reservist Differential Briefing U.S. Office of Personnel Management December 11, 2009 p. 2 Agenda - Introduction of Speakers - Background - References/Tools - Overview of Reservist Differential Authority - Qualifying Active Duty Service and Military Orders - Understanding Military Leave and Earnings Statements p. 3 Background 5 U.S.C. 5538 (Section 751 of the Omnibus Appropriations Act, 2009, March 11, 2009) (Public Law 111-8) Law requires OPM to consult with DOD Law effective first day of first pay period on or after March 11, 2009 (March 15 for most executive branch employees) Number of affected employees unclear p. 4 Next Steps

252

The peculiar phase structure of random graph bisection  

SciTech Connect (OSTI)

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

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

2008-01-01T23:59:59.000Z

253

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

254

Help:Talk pages | Open Energy Information  

Open Energy Info (EERE)

Talk pages Talk pages Jump to: navigation, search Every wiki page has an associated talk page which can be used for discussion and communicating with other users. Talk pages can be accessed by clicking the "discussion" tab at the top of the page. Simply edit the page as normal to add your comment. A talk page is actually very similar to any other wiki page, but it is in the "Talk" namespace, to keep it separate from the articles in the "(Main)" namespace (See Help:namespaces). As with any wiki page, you can edit it, link to it, and view the editing history. Contents 1 Editing conventions on talk pages 1.1 Example 2 Editing discussions 3 Building articles - Discussing articles 4 User talk pages Editing conventions on talk pages Having discussions on a free-form wiki page will seem strange at first. It

255

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

256

Liars domination in graphs  

Science Journals Connector (OSTI)

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

Miranda L. Roden; Peter J. Slater

2009-01-01T23:59:59.000Z

257

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

258

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

259

Synchrophasor Technologies Page ii  

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

August 2013 August 2013 Synchrophasor Technologies Page ii Table of Contents 1. Introduction ................................................................................................................... 1 2. Synchrophasor Technologies .......................................................................................... 1 3. Advanced Applications Software and their Benefits ........................................................ 4 3.1 Online (Near Real-Time Applications) ........................................................................... 5 3.2 Offline (Not real-time) Applications ............................................................................. 8 4. Recovery Act Synchrophasor Projects ............................................................................. 8

260

CONTENTS PAGE INTRODUCTION  

E-Print Network [OSTI]

THE APPLICATIONS AND VALIDITY OF BODE'S LAW CAN WE EXPLAIN BODE'S LAW USING GRAVITY? 8 Law of Gravitation 8 Centre#12;#12;CONTENTS CONTENTS PAGE INTRODUCTION WHO, HOW AND WHEN IS THE BODE'S LAW DISCOVERED? 1 THE BODE'S LAW HOW THE BODE'S LAW SATISFIED URANUS 3 HOW THE BODE'S LAW LED TO THE DISCOVERY OF CERES

Aslaksen, Helmer

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

page 1 1 Introduction  

E-Print Network [OSTI]

#12;#12;#12;#12;#12;#12;page 1 1 Introduction Techniques to recover object shapes from reflectance. The sunlight can be regarded as yellow point light source whose movement is restricted to the ecliptic1 reflection components from the object surface. Reflection from object surfaces may have multiple 1. The great

262

Algorithms and architectures for high performance analysis of semantic graphs.  

SciTech Connect (OSTI)

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

Hendrickson, Bruce Alan

2005-09-01T23:59:59.000Z

263

Help:Copying Page Content to New Page | Open Energy Information  

Open Energy Info (EERE)

Copying Page Content to New Page Copying Page Content to New Page Jump to: navigation, search To copy a page to a new page Go to the page you want to copy Click "Edit" under "Page Actions". Do a "Select all" (Ctrl+A) of the page content in the box and copy (Ctrl-C) the content. In another window or tab, create a new page name using the url. You can use the wiki's URL for creating a new page. The URL to an article of the wiki is usually something like this: http://www.example.net/wiki/ARTICLE If you replace ARTICLE with the name of the page you wish to create, you will be taken to a blank page which indicates that no article of that name exists yet. Clicking the "Create" button at the top of the page will take you to the edit page for that article, where you can create the new page by

264

Help:Special pages | Open Energy Information  

Open Energy Info (EERE)

Special pages are pages that are created by the software on demand. They Special pages are pages that are created by the software on demand. They are located in their own namespace Special: and are not editable directly as other pages. Some special pages depend on the preferences that have been set by a user, e.g. the number of titles which is displayed on a user's watchlist. List of special pages Clicking the link Special:Specialpages will take you to a list of all special pages on a wiki. Such a link is often accessible in the toolbox on the left hand panel. Some special pages can be transcluded. New images (includable) New pages (includable) Preferences Random page Recent changes (includable) Watchlist ... Retrieved from "http://en.openei.org/w/index.php?title=Help:Special_pages&oldid=58510" Categories: Help Special Pages

265

D:\\PRJ\\MER\\MERPUB\\MER8.vp  

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

. . . . . . . . . . . Ann M. Ducca 202-586-6137 ann.ducca@eia.doe.gov Section 5. Oil and Gas Resource Development . . . . . . Robert F. King 202-586-4787 robert.king@eia.doe.gov...

266

2006 Summer Issue Page The Critical Path  

E-Print Network [OSTI]

and one half years late, spent more than a year at the launch base, and overcame incredible obstacles Continued on page 8) GOES N Page 1 Message From The Director Page 2 Tintypes Page 3 Solar-B Mission Page 4-off. In addition, the Solar-B launch is scheduled for September 23. The next launch in our 2006 schedule, THEMIS

Christian, Eric

267

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

268

A graph-based system for network-vulnerability analysis  

SciTech Connect (OSTI)

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

Swiler, L.P.; Phillips, C.

1998-06-01T23:59:59.000Z

269

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

270

Computing the Grothendieck constant of some graph classes  

E-Print Network [OSTI]

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

2011-06-10T23:59:59.000Z

271

Geothermal: Home Page  

Office of Scientific and Technical Information (OSTI)

Home Page Home Page Geothermal Technologies Legacy Collection Help/FAQ | Site Map | Contact Us Home/Basic Search About Publications Advanced Search New Hot Docs News Related Links Search for: (Place phrase in "double quotes") Sort By: Relevance Publication Date System Entry Date Document Type Title Research Org Sponsoring Org OSTI Identifier Report Number DOE Contract Number Ascending Descending Search Quickly and easily search geothermal technical and programmatic reports dating from the 1970's to present day. These "legacy" reports are among the most valuable sources of DOE-sponsored information in the field of geothermal energy technology. See "About" for more information. The Geothermal Technologies Legacy Collection is sponsored by the Geothermal Technologies Program, DOE Energy Efficiency and Renewable Energy

272

WIPP Home Page header  

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

| News & Information | Document Center | Transportation | Opportunities | Contacts | Links | Search | News & Information | Document Center | Transportation | Opportunities | Contacts | Links | Search WWIS Public Inquiry Page Welcome to the WWIS Public Inquiry Page. This service is established in accordance an Agreement between the United States Department of Energy and the New Mexico Environment Department, dated February 11, 2005, Docket Number HWB 04-07 (CO). This service provides a replicate of information stored on the WIPP Waste Information System. Container Data will be available 14 days after emplacement in the WIPP Repository. The last update was Saturday, January 11, 2014 1:17:12 AM . You can find instructions for using this service by selecting the "Instructions" option. Information is available for disposed containers of transuranic (TRU) waste.

273

Activity Six, Student Page  

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

Six -- Observing Magnetic Effects on Particle Beams (Student Page) Six -- Observing Magnetic Effects on Particle Beams (Student Page) An ordinary oscilloscope and two small bar magnets can enable you to see two of the important ways in which particle beams are controlled in accelerators. There is an electron beam in the oscilloscope that moves in a nearly straight line from back to front, as a result of a potential difference of tens of thousands of volts. To show how a magnetic field can deflect a beam of charged particles, set an oscilloscope to produce a well-focused spot near the center of the screen. Position the north pole of one bar magnet directly above the beam of the oscilloscope, and position the south pole of another magnet directly below the beam as shown here. (Be careful to avoid bumping or scratching the screen with the magnets.)

274

Page1of3  

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

Page1of3 Page1of3 .EF.!. . .. Ul l u .s. DEPARTl\IffiNT OF ENERG i'Cy .,..- - - - - - EERE PROJECT MANAGEMENT CENTER NEPA DETERl\fiNATION RECIPIENT:City of Houston PROJECT TITLE : EECBG Program - City of Houston , TX STATE: TX Funding Opportunity Announcement Numbt'r PrO(uumtnt Instrument Number NEPA Control Number CID Number DE-FOZ-OOOOO13 DE-EEOOOO965 GFO -()()()()965-()1 G0965 Based on my review o(the infonnation concerning the propostd adion, as NEPA Compliance Officer (authoriud under DOE Order 451.IA), I have made the following determination: ex, EA, EIS APPENDIX AND NUMBER: Description: 85.1 (a) Actions to conserve energy or water, demoostrate potential energy Of water conservatioo, and promote energy A ctions to efficiency that 'NOU1d not have the potentlal to cause significant changes in the Indoor Of outdoor coocentratJons of

275

Activity Three, Student Page  

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

Three -- Rutherford's Discovery (Student Page) Three -- Rutherford's Discovery (Student Page) In this activity, you and your team members will use the methods pioneered by Ernest Rutherford in the early 1900s and still used by particle physicists in their accelerator experiments today. These methods enable scientists to identify the characteristics of particles that they cannot actually see. You will learn how precise your measurements must be when you can't see what you are studying. On your team's experiment table there is a large wooden board, under which your teacher has placed a flat shape. Your team's job is to identify the shape without ever seeing it. You can only roll marbles against the hidden object and observe the deflected paths that the marbles take. Your team will have five minutes to "observe" a

276

Page 1 of 2  

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

The purpose of this memorandum is to revise the discretionary set-aside authority addressed on The purpose of this memorandum is to revise the discretionary set-aside authority addressed on Page 13 of Acquisition Letter 2004-03 from SSO,(XX) to SIOO,(XX). Questions may be addressed to Steve Zvolensky at (202) 287-1307 or St~hen.zvolensk~@hg.doe.£ov Attachment cc: PP AG Members ;k..t ./ /!k~ --'"' Michael P. Fischetti Acting Director Office of Procurement and Assistance Policy Michael Acting I Office 0 Page 2 of 2 MEMORANDUM FOR DISTRIBUTION 6tfJ FROM: RICHARD H. HOPF, DIRECT~ OFFICE OF PROCUREMENT AND ASSIST ANCE ~ Discretionary Set-Aside A:tho} SUBJECT: The purpose of this memorandum is to revise the discretionary set-aside authority addressed on Page 13 of Acquisition Letter 2004-03 from $50,000 to $100,000. The paragraph entitled, Discretionary Set-Asides, is revised to read:

277

Cover Page of Household Vehicles Energy Use: Latest Data & Trends  

Gasoline and Diesel Fuel Update (EIA)

Household Vehicles Energy Use Cover Page Cover Page of Household Vehicles Energy Use: Latest Data & Trends...

278

Mining Large Heterogeneous Graphs using Cray s Urika  

SciTech Connect (OSTI)

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

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

2013-01-01T23:59:59.000Z

279

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

280

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

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

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

Science Journals Connector (OSTI)

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

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

2014-06-01T23:59:59.000Z

282

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

283

Legal Management Tracking System Page  

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

Legal Management Tracking System Page 1 of 1 Back to Case Costs Contractor Litigation - Law Firm Invoices Office: Richland Operations Office Parties: DWAYNE HALL v. FLUOR HANFORD,...

284

STUDENT ID Page 2 m  

E-Print Network [OSTI]

Write your name, student ID number, recitation instructor's name and recitation time in the space provided above. Also write your name at the top of pages 2, 3,...

285

Department of Energy Home Page  

Office of Scientific and Technical Information (OSTI)

US DEPARTMENT OF ENERGY Search Home Page Contents ABOUT DOE About The Department of Energy (Learn about the Department of Energy, its mission, plans, organizational structure,...

286

Kevin L. Rotz's Web Page  

E-Print Network [OSTI]

Kevin's Page. My name is Kevin L. Rotz, and I am currently a sixth year graduate student in the Purdue University Department of Mathematics. Previously I was...

287

Create reports and graphs | ENERGY STAR Buildings & Plants  

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

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

288

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

289

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

290

COLBY COLLEGE 2011-2012 Introduction Page 3  

E-Print Network [OSTI]

and COOT Page 6 Colby Garden Page 7 Composting Page 8--9 Recycling Page 10 Sustainable Seafood Page 11 a commercial food system works by taking field trips to both organic and conventional farms, restaurants

Wilson, Herb

291

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

292

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

293

Household Vehicles Energy Use Cover Page  

Annual Energy Outlook 2013 [U.S. Energy Information Administration (EIA)]

Household Vehicles Energy Use Cover Page Glossary Home > Households, Buildings & Industry >Transportation Surveys > Household Vehicles Energy Use Cover Page Contact Us * Feedback *...

294

Worden Curriculum Vitae Page 1 Curriculum Vitae  

E-Print Network [OSTI]

Worden ­ Curriculum Vitae Page 1 Curriculum Vitae ALEXANDRA ZOE WORDEN Contact Information Armed Forces Communications and Electronics Association Award #12;Worden ­ Curriculum Vitae Page 2

Worden, Alexandra Z.

295

PAGE I OF __ pAGES STANDARD ~M 135  

E-Print Network [OSTI]

Engineering Exps. Plan '. ~~. Engineering Cask Mount Design Review Status Reports Des~gn Engineering and PDR Monthly Progress Review Specifications/HFE 4 Management Control Plans' . Make or Buy ReliabilityPAGE I OF __ pAGES STANDARD ~M 135 RECORbJ TRANSMITTAL TO BE COMPI , AT FEDERAL RECORDS CENTER JULY

Rathbun, Julie A.

296

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

297

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

298

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

299

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

300

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

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

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

302

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

303

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.

304

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

305

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

306

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

307

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

308

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

309

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

310

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

311

Help:Protected pages | Open Energy Information  

Open Energy Info (EERE)

Protected pages Protected pages Jump to: navigation, search A protected page is a page where normal users are prevented from editing and/or moving at all. Only a user with sysop permissions can edit or move a protected page. Likewise only sysop users can protect a page in the first place, or unprotect the page to lift the restriction. There are several reasons why a particular page might be protected: On public wikis, pages may be protected because they have been repeatedly targeted with vandalism or moved to bad titles, or where it is believed that vandalism or page moves would have a unusually severe impact. On corporate wikis, pages may be protected when they contain statements which have been approved by management, and policy dictates that those statements can't be changed without following a certain approval

312

Page (Total 4) Philadelphia University  

E-Print Network [OSTI]

description: This is an elective course in the old study plane but an obligate course for the new study plane, peptides, proteins - Protein biochemistry and structure. - Proteomics vs. protein biochemistry. Pages 1 Sources: -Recombinant vs. non-recombinant. Pages 51-88 (4) Recombinant Proteins (The different systems

313

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.

314

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

315

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

316

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.

317

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

318

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

319

A graph-based network-vulnerability analysis system  

SciTech Connect (OSTI)

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

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

1998-01-01T23:59:59.000Z

320

A graph-based network-vulnerability analysis system  

SciTech Connect (OSTI)

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

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

1998-05-03T23:59:59.000Z

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

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

322

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.

323

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

324

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.

325

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

326

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.

327

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.

328

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

329

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

330

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

331

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.

332

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

333

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

334

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

335

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

336

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

337

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

338

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.

339

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

340

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

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

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

342

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

343

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

344

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

345

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

346

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

347

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

348

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

349

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

350

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

351

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

352

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

353

Potential-controlled filtering in quantum star graphs  

SciTech Connect (OSTI)

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

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

2013-03-15T23:59:59.000Z

354

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

SciTech Connect (OSTI)

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

Brost, Randolph C.; McLendon, William Clarence,

2013-01-01T23:59:59.000Z

355

Online Tutorial A. Introduction 4 slides (page 3)  

E-Print Network [OSTI]

Online Tutorial 1 #12;A. Introduction ­ 4 slides (page 3) B. eGrades Timeline ­ 5 slides (page 8) C. Accessing eGrades ­ 5 slides (page 14) D. Authorized Graders ­ 22 slides (page 20) E. Submitting Grades ­ 42 slides (page 43) F. Grade changes ­ 19 slides (page 86) G. Importing Grades ­ 29 slides (page 106) H

Tsien, Roger Y.

356

Web Page Error 404.1 Page Cannot be Found  

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

are looking for cannot be found. The Web site you are looking for is unavailable due to its identification configuration settings. Please try the following: If you typed the page...

357

Web Page Error 500 Page Cannot Be Displayed  

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

requested cannot be displayed. There is a problem with the page you are trying to reach and it cannot be displayed. Please try the following: Click the Refresh button, or try again...

358

Page 1 of 2  

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

~ ~ Page 1 of 2 1) This memorandum provides reminders on the proper use of non-DOE contracting vehicles. including Economy Act transactions. Government-wide Acquisition Contracts. and Federal Supply Schedules. The recent discovery of improper use of such contracting vehicles has led to investigations ,:>f procurement activities at the General Services Administration and Department of Defense. Contracting Officers are cautioned to be diligent in the use of other agencies' contracting vehicles. 2) This memorandwn provides an overview of a Biobased Products Procurement Preference Program being developed as a result of the F8ml Security and Rural Development Act of 2002 and a recent rulemaking issued by the U.S. Department of Agriculture. It will highlight

359

TVDG Home Page  

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

for Upton, New York Forecast for Upton, New York Forecast Welcome to TVDG Logo the BNL Tandem Brookhaven National Laboratory's Tandem Van de Graaff Accelerator Facility We have a NEW Home Page. Please try it and let us know about any omissions or additions you would like to see on our new site. Where Can We Go From Here? 10 Steps 10 steps to your Tandem experiment. SEU Availability SEU availability calendar for our facility. Here you can see when the facility is available for running SEU. Species List of ions, energies and LETs that are available at our facility. Reservations Fill-in form that allows registered users to reserve time at our facility via the Web. User Registration Users are required to register before being allowed on site Contacts List of contact people at our facility and how to reach us by phone, fax or e-mail.

360

RMOTC - Articles - Page 2  

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

Geothermal Energy Holds Strong Presence at Renewable Energy World Geothermal Energy Holds Strong Presence at Renewable Energy World Conference Geothermal Energy Weekly, March 5, 2010 (Page 4) Oil Production Waste Stream: A Source of Electrical Power Renewable Energy World, January 2010 Wireline retrievable ESP shuttle could change pump management paradigms (PDF) World Oil, January 2010 Self-cleaning screen improves recovery, avoids costly workovers (PDF) World Oil, October 2009 Low-frequency drillbit seismic while drilling (PDF) World Oil, July 2009 DOE site collaborates w/ community to teach 4-H youth about GIS (PDF) Contact, Wyoming Geological Association, June 2009 New water sensor may allow easy well monitoring (PDF) World Oil, April 2009 Active vibration damper improves performance and reduces drilling costs (PDF) World Oil, September 2008

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

WIPP Stakeholder Information Page  

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

WIPP Stakeholder Information Page Closure of Underground Hazardous Waste Disposal Unit Notification of Panel 6 Closure and Final Waste Emplacement dated November 5, 2013 Notification of Last Waste Emplacement and Intent to Commence Closure of the Waste Isolation Pilot Plant Hazardous Waste Disposal Unit Panel 5 dated March 30, 2011 Submittal of Final Audit Reports Audit Report A-07-16 for INL/CCP RH Waste Characterization Activities dated November 22, 2006 Transmittal of the Certification Audit Report for SRS A-07-01 dated November 21, 2006 CEMRC-CCP Final Audit Report Transmittal dated March 27, 2007 Transmittal of the Final Report of CBFO Recertification Audit A-06-06 of the INL Analytical Laboratories dated June 13, 2007 Transmittal of the Certification Audit Report for the INL/CCP Audit A-07-19 dated June 20, 2007

362

Tank Waste Committee Page 1  

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

Tank Waste Committee Page 2 Final Meeting Summary January 8, 2014 and integrity of the tanks with a focus on tank AY-102. In his presentation, Glyn noted the following points: *...

363

Hosting Web Pages at NERSC  

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

Hosting Webpages Hosting Webpages While PDSF no longer provides a webserver for its users' webpages can be hosted from your group's project directory. To do this put your pages...

364

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

365

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

366

Identity Theft --Appendix 2 Page Page 1 of 3 IDENTITY FRAUD VICTIM WORKSHEET  

E-Print Network [OSTI]

Identity Theft -- Appendix 2 Page Page 1 of 3 IDENTITY FRAUD VICTIM WORKSHEET Credit Bureaus -- Report Fraud Bureau: Equifax Phone Number: 1-800-525-6285 Date Contacted

Oklahoma, University of

367

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

368

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

369

Proximity graphs based multi-scale image segmentation  

SciTech Connect (OSTI)

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

Skurikhin, Alexei N [Los Alamos National Laboratory

2008-01-01T23:59:59.000Z

370

Optimization of de novo transcriptome assembly from high-throughput short read sequencing data improves functional annotation for non-model organisms  

E-Print Network [OSTI]

Background: The k-mer hash length is a key factor affecting the output of de novo transcriptome assembly packages using de Bruijn graph algorithms. Assemblies constructed with varying single k-mer choices might result in ...

Rismani-Yazdi, Hamid

371

Sequoia retains top ranking on Graph 500 for third year running  

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

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

372

Page not found | Department of Energy  

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

41 - 2350 of 26,777 results. 41 - 2350 of 26,777 results. Page Emergency Management Criteria & Review Approach Documents http://energy.gov/hss/emergency-management-criteria-review-approach-documents Page Management Criteria & Review Approach Documents http://energy.gov/hss/management-criteria-review-approach-documents Page Radiation Control Criteria & Review Approach Documents http://energy.gov/hss/radiation-control-criteria-review-approach-documents Page Safety Basis Criteria & Review Approach Documents http://energy.gov/hss/safety-basis-criteria-review-approach-documents Page Training Criteria & Review Approach Documents http://energy.gov/hss/training-criteria-review-approach-documents Page Former Worker Medical Screening Program Related Documents & Links

373

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

374

Time-varying Reeb Graphs for Continuous Space-Time Data  

SciTech Connect (OSTI)

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

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

2008-04-22T23:59:59.000Z

375

Property:Foaf/Page | Open Energy Information  

Open Energy Info (EERE)

Page Page Jump to: navigation, search Property Name Foaf/Page Property Type URL Description Link to an external page discussing the same topic. (URL) It is equivalent to the well-known foaf:page property. Pages using the property "Foaf/Page" Showing 25 pages using this property. (previous 25) (next 25) 1 10 CFR § 1021 + http://en.openei.org/wiki/File:10CFRPart1021.pdf + 2 2-D Magnetotellurics At The Geothermal Site At Soultz-Sous-Forets- Resistivity Distribution To About 3000 M Depth + http://www.sciencedirect.com/science/article/pii/S1631071310001070 + 2.8-Ma Ash-Flow Caldera At Chegem River In The Northern Caucasus Mountains (Russia), Contemporaneous Granites, And Associated Ore Deposits + http://www.sciencedirect.com/science/article/B6VCS-48B5BV5-KK/2/a841cce0d247b754e5163bb62f72dc05 +

376

Knowledge Warehouse Page 1 The Knowledge Warehouse  

E-Print Network [OSTI]

Knowledge Warehouse Page 1 The Knowledge Warehouse: Reusing Knowledge Components Michael Yacci-5416 email: may@it.rit.edu #12;Knowledge Warehouse Page 2 The Knowledge Warehouse: Reusing Knowledge Components Abstract Currently, there is little knowledge reuse across training, documentation

Yacci, Michael

377

Widget:CreatePage | Open Energy Information  

Open Energy Info (EERE)

Widget Edit History Facebook icon Twitter icon Widget:CreatePage Jump to: navigation, search This is a widget containing HTML for creating new pages Parameters none - This is an...

378

Page 1 of 7 DEBORAH K. SMITH  

E-Print Network [OSTI]

Smith - CV Page 1 of 7 DEBORAH K. SMITH Department of Geology and Geophysics, MS 22 Woods Hole-Scale Symposium, Durham, England #12;Smith - CV Page 2 of 7 1994 The Icelandic Plume and its Influence

Smith, Deborah K.

379

Page 1 of 7 DEBORAH K. SMITH  

E-Print Network [OSTI]

Smith - CV Page 1 of 7 DEBORAH K. SMITH Senior Scientist TEL.: (508) 289-2472 Department of Geology, and the Environment: Our Changing Oceans #12;Smith - CV Page 2 of 7 2011 NOAA OER Atlantic Basin Workshop, URI Coastal

Smith, Deborah K.

380

Table of Contents Chapter and Content Pages  

E-Print Network [OSTI]

#12;Page 2 Table of Contents Chapter and Content Pages 1. Field Trip Itinerary ................................................................................. 7 4. Geologic Framework of the Netherlands Antilles 5. Coral Reefs of the Netherlands Antilles

Fouke, Bruce W.

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

Department of Energy Home Page  

Office of Scientific and Technical Information (OSTI)

US DEPARTMENT OF ENERGY Search Home Page Contents US DEPARTMENT OF ENERGY Search Home Page Contents [ABOUT DOE] About The Department of Energy (Learn about the Department of Energy, its mission, plans, organizational structure, accomplishments and the Secretary of Energy Federico Peña.) [DEPARTMENTAL RESOURCES] Departmental Resources (Look for information across the Department, connect to other Departmental Home Pages, or search for scientific and technical information through such systems as the DOE Information Bridge, containing searchable citations of worldwide energy research as well as bibliographic citations with links to DOE sponsored or acquired full-text reports; EnergyFiles, DOE's virtual library environment containing energy-related STI and tools to facilitate information use in the R&D process; and the DOE Reports Bibliographic

382

Bienvenue 3 Page Web du laboratoire 3  

E-Print Network [OSTI]

Sommaire Bienvenue 3 3 Page Web du laboratoire 3 1ère partie : informations pratiques 5 1. Aller et évolution est la bienvenue (thomas.haberkorn@univ-orleans.fr). Page Web du laboratoire De nombreuses informations sont aussi accessibles sur la page Web du labo- ratoire, comme par exemple : · Un plan du Campus

d'Orléans, Université

383

Power Aware Page Allocation Alvin R. Lebeck  

E-Print Network [OSTI]

Power Aware Page Allocation Alvin R. Lebeck Department of Computer Science Duke University alvy@cs.duke.edu http://www.cs.duke.edu/~alvy Milly Watt #12;Power Aware Page Allocation 2© Alvin R. Lebeck, 2001, NSF Research Instrumentation, Intel, Microsoft #12;Power Aware Page Allocation 3© Alvin R. Lebeck

Ellis, Carla

384

Page 1 of 4 Housing Internet Services  

E-Print Network [OSTI]

of Technology #12;Page 2 of 4 Introduction to Curtin Internet Services Internet services from Housing Guide). Access to the Curtin INTRANET (Curtin web pages remains free) Choose an alternative external is provided in setting up your account or choosing an ISP. Access to the Curtin INTRANET (Curtin web pages

385

A Penrose inequality for asymptotically locally hyperbolic graphs  

E-Print Network [OSTI]

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

Levi Lopes de Lima; Frederico Giro

2013-05-14T23:59:59.000Z

386

Notes for Graduate Course "Graphs, Spectral Theory, and  

E-Print Network [OSTI]

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

Miller, Stephen David

387

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

388

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

389

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

390

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

391

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

392

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

393

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

394

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

395

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

396

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

397

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

398

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

399

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

400

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

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

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

402

Pages 21-23 of Penney  

E-Print Network [OSTI]

Note that MATLAB repeats our matrix, indicating that it has understood us. ... the same graph, and axis([-5,5,~5,5]) tells MATLAB to show the range -5 _<_ x g 5.

403

INDDGO: Integrated Network Decomposition & Dynamic programming for Graph Optimization  

SciTech Connect (OSTI)

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

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

2012-10-01T23:59:59.000Z

404

Page 1 of 2 Telecommunications  

E-Print Network [OSTI]

Page 1 of 2 Telecommunications User Agent Telephone Returns Important Note: Before using this form** Color *Most common # of lines: single, 2, 4, 8, 10, 12, 16, and 24. **Optional. Telecommunications, 10, 12, 16, and 24. **Optional. Telecommunications Office Use Only Received by: Date: #12;

405

Web Page Development Company Description  

E-Print Network [OSTI]

Web Page Development Company Description: Service Provider web site Short Project Name: Research support and networking. Company Description: Website Building Company. This company drives traffic to websites through search engines, and optimizes websites over time. Short Project Name: Site Build Project

Dahl, David B.

406

Page 1 of 1 Graduations  

E-Print Network [OSTI]

Page 1 of 1 Graduations Student & Academic Services Melville Hall (12) Canberra ACT 0200 Australia: Contact details, including Mailing Address, must be updated on ISIS by 1 st July/1 st Dec Family Name conferred, specify the awards.) Name of Award 1 2 Student Declaration (all applicants to complete) I hereby

Botea, Adi

407

EERE: Alternative Fuels Data Center Home Page  

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

AFDC AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on Delicious Rank EERE: Alternative Fuels Data Center Home Page on Digg Find More places to share EERE: Alternative Fuels Data Center Home Page on AddThis.com... Fuels & VehiclesMore Fuels & Vehicles Biodiesel Biodiesel Electricity Electricity Ethanol Ethanol Hydrogen Hydrogen Natural Gas Natural Gas Propane Propane Propane Mowers Help National Park Cut Emissions Iphone App Moooving away from petroleum - Smith Dairy is turning to compressed natural gas to cut emissions and fuel costs.

408

Help:Deleting pages | Open Energy Information  

Open Energy Info (EERE)

pages pages Jump to: navigation, search See Category:Proposed deletion for the listing of all articles currently proposed for deletion. Proposed deletion is the way to suggest that an article is a candidate for uncontroversial deletion. If nobody objects, the article is deleted after seven days. An article may not be proposed for deletion ("PRODed") if it has been PRODed before. Proposed deletion is only applicable to mainspace articles, lists, and disambiguation pages; it cannot be used with redirects, userspace pages, templates, categories, or pages in any other namespace. There are three steps to the PROD process An article or disambiguation page is nominated when an editor carefully reviews the article and inserts the {{subst:proposed deletion}} tag by placing {{subst:proposed deletion}} on the page. This lists the

409

EERE: Bioenergy Technologies Office Home Page  

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

Bioenergy Technologies Office Search Bioenergy Technologies Office Search Search Help Bioenergy Technologies Office HOME ABOUT THE PROGRAM RESEARCH & DEVELOPMENT FINANCIAL OPPORTUNITIES INFORMATION RESOURCES NEWS EVENTS EERE » Bioenergy Technologies Office Site Map Printable Version Share this resource Send a link to EERE: Bioenergy Technologies Office Home Page to someone by E-mail Share EERE: Bioenergy Technologies Office Home Page on Facebook Tweet about EERE: Bioenergy Technologies Office Home Page on Twitter Bookmark EERE: Bioenergy Technologies Office Home Page on Google Bookmark EERE: Bioenergy Technologies Office Home Page on Delicious Rank EERE: Bioenergy Technologies Office Home Page on Digg Find More places to share EERE: Bioenergy Technologies Office Home Page on AddThis.com... Biomass is a clean, renewable energy source that can help to significantly

410

EERE: SunShot Initiative Home Page  

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

Energy Energy SunShot Initiative Search Search Help SunShot Initiative HOME ABOUT KEY ACTIVITIES FINANCIAL OPPORTUNITIES INFORMATION RESOURCES NEWS EVENTS EERE » SunShot Initiative Printable Version Share this resource Send a link to EERE: SunShot Initiative Home Page to someone by E-mail Share EERE: SunShot Initiative Home Page on Facebook Tweet about EERE: SunShot Initiative Home Page on Twitter Bookmark EERE: SunShot Initiative Home Page on Google Bookmark EERE: SunShot Initiative Home Page on Delicious Rank EERE: SunShot Initiative Home Page on Digg Find More places to share EERE: SunShot Initiative Home Page on AddThis.com... SunShot U.S. Department of Energy The DOE SunShot Initiative is a national collaborative effort to make solar energy cost-competitive with other forms of electricity by the end of the

411

EERE: SunShot Initiative Home Page  

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

Initiative Initiative Printable Version Share this resource Send a link to EERE: SunShot Initiative Home Page to someone by E-mail Share EERE: SunShot Initiative Home Page on Facebook Tweet about EERE: SunShot Initiative Home Page on Twitter Bookmark EERE: SunShot Initiative Home Page on Google Bookmark EERE: SunShot Initiative Home Page on Delicious Rank EERE: SunShot Initiative Home Page on Digg Find More places to share EERE: SunShot Initiative Home Page on AddThis.com... SunShot U.S. Department of Energy The DOE SunShot Initiative is a national collaborative effort to make solar energy cost-competitive with other forms of electricity by the end of the decade. Learn more. Quick Links Photovoltaics Concentrating Solar Power Systems Integration Soft Balance of Systems High Penetration Solar Portal

412

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.

413

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

414

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

415

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

SciTech Connect (OSTI)

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

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

2010-08-01T23:59:59.000Z

416

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

417

How To Setup EHSS Landing Page As Default Home Page For Internet...  

Energy Savers [EERE]

Internet Explorer How To Setup EHSS Landing Page As Default Home Page For Internet Explorer STEP 1: In Internet Explorer enter the URL http:energy.govehss. Once the EHSS site...

418

How To Setup EA Landing Page As Default Home Page For Internet...  

Energy Savers [EERE]

Internet Explorer How To Setup EA Landing Page As Default Home Page For Internet Explorer STEP 1: In Internet Explorer enter the URL http:energy.goviea. Once the EA site loads,...

419

Janie Page resume 2013 (1)  

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

2010 - present 2010 - present Science/Engineering Associate Project lead: Small Commercial Demand Response study, Home Area Network concept review, Smart Meter electromagnetic field studies for Michigan Public Utilities Commission, Demand response studies for Navy, Demand response in areas impacted by SONGS outage, Coordinated Rooftop Unit study (with PNNL and ORNL) Publications Levy, R., J. Page, C. P. McParland, C. Goldman, M. A. Piette, Assessing Options to Achieve Customer Data Access and Smart Grid Functionality in Home Area Networks. DOE/CEC/LBNL 2013 R. Levy and J. Page, Review of the January 13, 2012 County of Santa Cruz Health Services Agency memorandum: Health Risks Associated with Smart Meters, submitted to Michigan Public Service Commission, April 2012

420

Page not found | Department of Energy  

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

31 - 11440 of 26,764 results. 31 - 11440 of 26,764 results. Page Annual Planning Summaries: Intelligence and Counterintelligence (IN) http://energy.gov/nepa/annual-planning-summaries-intelligence-and-counterintelligence Page Annual Planning Summaries: Health, Safety, and Security (HSS) http://energy.gov/nepa/annual-planning-summaries-health-safety-and-security-hss Page Annual Planning Summaries: Sandia Site Office (SSO) http://energy.gov/nepa/annual-planning-summaries-sandia-site-office-sso Page Annual Planning Summaries: Science (SC) http://energy.gov/nepa/annual-planning-summaries-science-sc Page Annual Planning Summaries: Southeastern Power Administration http://energy.gov/nepa/annual-planning-summaries-southeastern-power-administration Page Annual Planning Summaries: Southwestern Power Administration (SWPA)

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

Help:Editing pages | Open Energy Information  

Open Energy Info (EERE)

pages pages Jump to: navigation, search It's very easy to edit the contents of a wiki. It only takes a few clicks. Click the "Edit" page tab at the top of the page. Make changes to the text. Click the "Save page" button. Simple as that! Contents 1 Editing rules, editing conventions, and formatting 2 Edit Summary 3 Preview 4 Other types of editing 5 Discussion Editing rules, editing conventions, and formatting The number one rule of wiki editing, is to be bold. Dive in and make changes. Other people can correct mistakes later, so have confidence, and give it a try! There can be all kinds of editing conventions, rules, and philosophy governing the editing of wiki pages, but the "be bold" rule overrides these! In general try to write clearly and concisely and make sure you are always

422

Page not found | Department of Energy  

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

71 - 8580 of 26,764 results. 71 - 8580 of 26,764 results. Page Cooperating Agencies Selected documents on the topic of Cooperating Agencies under NEPA. http://energy.gov/nepa/cooperating-agencies Page Analysis of Environmental Impacts Selected documents on the Analysis of Environmental Impacts under NEPA. http://energy.gov/nepa/analysis-environmental-impacts Page Environmental Justice Selected documents on the topic of Environmental Justice under NEPA. http://energy.gov/nepa/environmental-justice Page Public Participation Selected documents on the topic of Public Participation under NEPA. http://energy.gov/nepa/public-participation Page General Guidance on NEPA Selected documents providing General Guidance on NEPA. http://energy.gov/nepa/general-guidance-nepa Page NEPA Implementation Selected documents providing guidance on the implementation of NEPA.

423

Page not found | Department of Energy  

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

21 - 11430 of 26,764 results. 21 - 11430 of 26,764 results. Page Annual Planning Summaries: Golden Field Office (GO) http://energy.gov/nepa/annual-planning-summaries-golden-field-office-go Page Annual Planning Summaries: Idaho Operations Office (ID) http://energy.gov/nepa/annual-planning-summaries-idaho-operations-office-id Page Annual Planning Summaries: Loan Program Office (LPO) http://energy.gov/nepa/annual-planning-summaries-loan-program-office-lpo Page Annual Planning Summaries: Legacy Management (LM) http://energy.gov/nepa/annual-planning-summaries-legacy-management-lm Page Annual Planning Summaries: New Brunswick Laboratory (NBL) http://energy.gov/nepa/annual-planning-summaries-new-brunswick-laboratory-nbl Page Annual Planning Summaries:Nuclear Energy (NE) http://energy.gov/nepa/annual-planning-summariesnuclear-energy-ne

424

Help:Deleting a page | Open Energy Information  

Open Energy Info (EERE)

page page Jump to: navigation, search Contents 1 When not to delete a page 1.1 Proposing changes 1.2 Unlinking a page 2 Deletion itself 3 See also When not to delete a page Typically you would delete a page if the contents are entirely inappropriate and do not match the purposes of the Wiki. In other situations, you would take a less extreme course of action, for example: The page should have a different title -- See Help:Moving a page The contents should have been placed on a different page -- Add the contents to the other page, and then supply a redirect. See Help:Redirects The contents are already on a different page -- Delete the duplicate content and leave a redirect. That way, the page title, which made sense to somebody, will helpfully redirect to the information. See Help:Redirects

425

Page not found | Department of Energy  

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

61 - 12570 of 26,764 results. 61 - 12570 of 26,764 results. Page Categorical Exclusion Determinations: NNSA-Service Center Categorical Exclusion Determinations issued by NNSA-Service Center. http://energy.gov/nepa/categorical-exclusion-determinations-nnsa-service-center Page Categorical Exclusion Determinations: Nevada Site Office Categorical Exclusion Determinations issued by Nevada Site Office. http://energy.gov/nepa/categorical-exclusion-determinations-nevada-site-office Page Categorical Exclusion Determinations: Oak Ridge Office Categorical Exclusion Determinations issued by Oak Ridge Office. http://energy.gov/nepa/categorical-exclusion-determinations-oak-ridge-office-0 Page Categorical Exclusion Determinations: Princeton Site Office Categorical Exclusion Determinations issued by Princeton Site Office.

426

Page not found | Department of Energy  

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

21 - 12530 of 26,764 results. 21 - 12530 of 26,764 results. Page Categorical Exclusion Determinations: New York Categorical Exclusion Determinations issued for actions in New York. http://energy.gov/nepa/categorical-exclusion-determinations-new-york Page Categorical Exclusion Determinations: North Carolina Categorical Exclusion Determinations issued for actions in North Carolina. http://energy.gov/nepa/categorical-exclusion-determinations-north-carolina Page Categorical Exclusion Determinations: North Dakota Categorical Exclusion Determinations issued for actions in North Dakota. http://energy.gov/nepa/categorical-exclusion-determinations-north-dakota Page Categorical Exclusion Determinations: Ohio Categorical Exclusion Determinations issued for actions in Ohio. http://energy.gov/nepa/categorical-exclusion-determinations-ohio

427

Page not found | Department of Energy  

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

21 - 14730 of 26,764 results. 21 - 14730 of 26,764 results. Page Battelle Laboratories-West Jefferson, Former Construction Worker Screening Project Battelle Laboratories-West Jefferson, Former Construction Worker Screening Project http://energy.gov/hss/battelle-laboratories-west-jefferson-former-construction-worker-screening-project Page Fernald, Former Construction Worker Screening Projects Fernald, Former Construction Worker Screening Projects http://energy.gov/hss/fernald-former-construction-worker-screening-projects Page Mound, Former Construction Worker Screening Projects Mound, Former Construction Worker Screening Projects http://energy.gov/hss/mound-former-construction-worker-screening-projects Page Portsmouth Gaseous Diffusion Plant Former Workers, Construction Worker Screening Projects

428

Page not found | Department of Energy  

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

81 - 12590 of 26,764 results. 81 - 12590 of 26,764 results. Page Annual Planning Summaries: National Nuclear Security Administration-Headquarters (NNSA) http://energy.gov/nepa/annual-planning-summaries-national-nuclear-security-administration-headquarters-nnsa Page Annual Planning Summaries: National Nuclear Security Administration-Proliferation Detection (NNSA-PD) http://energy.gov/nepa/annual-planning-summaries-national-nuclear-security-administration-proliferation-detection-nnsa Page Annual Planning Summaries: National Nuclear Security Administration-Defense Science University Programs (NNSA-DSUP) http://energy.gov/nepa/annual-planning-summaries-national-nuclear-security-administration-defense-science-university Page Annual Planning Summaries: Electricity Delivery and Energy Reliability

429

Page not found | Department of Energy  

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

01 - 12510 of 26,764 results. 01 - 12510 of 26,764 results. Page Categorical Exclusion Determinations: Idaho Categorical Exclusion Determinations issued for actions in Idaho. http://energy.gov/nepa/categorical-exclusion-determinations-idaho Page Categorical Exclusion Determinations: Illinois Categorical Exclusion Determinations issued for actions in Illinois. http://energy.gov/nepa/categorical-exclusion-determinations-illinois Page Categorical Exclusion Determinations: Indiana Categorical Exclusion Determinations issued for actions in Indiana. http://energy.gov/nepa/categorical-exclusion-determinations-indiana Page Categorical Exclusion Determinations: Iowa Categorical Exclusion Determinations issued for actions in Iowa. http://energy.gov/nepa/categorical-exclusion-determinations-iowa

430

Page not found | Department of Energy  

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

31 - 12540 of 26,764 results. 31 - 12540 of 26,764 results. Page Categorical Exclusion Determinations: Vermont Categorical Exclusion Determinations issued for actions in Vermont. http://energy.gov/nepa/categorical-exclusion-determinations-vermont Page Categorical Exclusion Determinations: Utah Categorical Exclusion Determinations issued for actions in Utah. http://energy.gov/nepa/categorical-exclusion-determinations-utah Page Categorical Exclusion Determinations: Texas Categorical Exclusion Determinations issued for actions in Texas. http://energy.gov/nepa/categorical-exclusion-determinations-texas Page Categorical Exclusion Determinations: Tennessee Categorical Exclusion Determinations issued for actions in Tennessee. http://energy.gov/nepa/categorical-exclusion-determinations-tennessee

431

Page not found | Department of Energy  

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

61 - 24470 of 29,416 results. 61 - 24470 of 29,416 results. Page Kansas City Plant, Former Production Workers Screening Projects Kansas City Plant, Former Production Workers Screening Projects http://energy.gov/hss/kansas-city-plant-former-production-workers-screening-projects Page Nevada, Former Production Workers Screening Projects Nevada, Former Production Workers Screening Projects http://energy.gov/hss/nevada-former-production-workers-screening-projects Page Princeton Plasma Physics Laboratory, Former Production Workers Screening Projects Princeton Plasma Physics Laboratory, Former Production Workers Screening Projects http://energy.gov/hss/princeton-plasma-physics-laboratory-former-production-workers-screening-projects Page Sandia National Laboratory (NM), Former Production Workers Screening

432

Page not found | Department of Energy  

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

51 - 12560 of 26,764 results. 51 - 12560 of 26,764 results. Page Categorical Exclusion Determinations: Environmental Management Categorical Exclusion Determinations issued by Environmental Management. http://energy.gov/nepa/categorical-exclusion-determinations-environmental-management Page Categorical Exclusion Determinations: Fossil Energy Categorical Exclusion Determinations issued by Fossil Energy. http://energy.gov/nepa/categorical-exclusion-determinations-fossil-energy Page Categorical Exclusion Determinations: Fermi Site Office Categorical Exclusion Determinations issued by Fermi Site Office. http://energy.gov/nepa/categorical-exclusion-determinations-fermi-site-office Page Categorical Exclusion Determinations: Golden Field Office Categorical Exclusion Determinations issued by Golden Field Office.

433

Page not found | Department of Energy  

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

91 - 12500 of 26,764 results. 91 - 12500 of 26,764 results. Page Categorical Exclusion Determinations: Alaska Categorical Exclusion Determinations issued for actions in Alaska. http://energy.gov/nepa/categorical-exclusion-determinations-alaska Page Categorical Exclusion Determinations: Arizona Categorical Exclusion Determinations issued for actions in Arizona. http://energy.gov/nepa/categorical-exclusion-determinations-arizona Page Categorical Exclusion Determinations: Arkansas Categorical Exclusion Determinations issued for actions in Arkansas. http://energy.gov/nepa/categorical-exclusion-determinations-arkansas Page Categorical Exclusion Determinations: California Categorical Exclusion Determinations issued for actions in California. http://energy.gov/nepa/categorical-exclusion-determinations-california

434

Page not found | Department of Energy  

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

21 - 24230 of 28,905 results. 21 - 24230 of 28,905 results. Page Kansas City Plant, Former Production Workers Screening Projects Kansas City Plant, Former Production Workers Screening Projects http://energy.gov/hss/kansas-city-plant-former-production-workers-screening-projects Page Nevada, Former Production Workers Screening Projects Nevada, Former Production Workers Screening Projects http://energy.gov/hss/nevada-former-production-workers-screening-projects Page Princeton Plasma Physics Laboratory, Former Production Workers Screening Projects Princeton Plasma Physics Laboratory, Former Production Workers Screening Projects http://energy.gov/hss/princeton-plasma-physics-laboratory-former-production-workers-screening-projects Page Sandia National Laboratory (NM), Former Production Workers Screening

435

Subsurface Knowledge Reference Page | Department of Energy  

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

Subsurface Knowledge Reference Page Subsurface Knowledge Reference Page Subsurface Knowledge Reference Page The below listing provides additional references related to Subsurface & Groundwater Remediation. The references are categorized by documents types (e.g., Strategic Plans, Groundwater Plume Map Booklets, etc.) and under each "document type", there is a list of documents and/or hyperlinks to a reference. The Subsurface Knowledge Reference Page will continue to reflect additional information as it is identified. Strategic Plans Scientific Opportunities to Reduce Risk in Groundwater and Soil Remediation Scientific Opportunities for Monitoring at Environmental Remediation Sites (SOMERS) Groundwater Plume Map Booklets Groundwater Contamination and Treatment at Department of Energy Sites -

436

Page not found | Department of Energy  

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

71 - 12580 of 26,764 results. 71 - 12580 of 26,764 results. Page Categorical Exclusion Determinations: Southeastern Power Administration Categorical Exclusion Determinations issued by Southeastern Power Administration. http://energy.gov/nepa/categorical-exclusion-determinations-southeastern-power-administration Page Categorical Exclusion Determinations: Southwestern Power Administration Categorical Exclusion Determinations issued by Southwestern Power Administration. http://energy.gov/nepa/categorical-exclusion-determinations-southwestern-power-administration Page Categorical Exclusion Determinations: SLAC Site Office Categorical Exclusion Determinations issued by SLAC Site Office. http://energy.gov/nepa/categorical-exclusion-determinations-slac-site-office Page Annual Planning Summaries: Advanced Research and Projects Agency

437

Page not found | Department of Energy  

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

81 - 9290 of 28,905 results. 81 - 9290 of 28,905 results. Page Categorical Exclusion Determinations: Fermi Site Office Categorical Exclusion Determinations issued by Fermi Site Office. http://energy.gov/nepa/categorical-exclusion-determinations-fermi-site-office Page Categorical Exclusion Determinations: Nevada Site Office Categorical Exclusion Determinations issued by Nevada Site Office. http://energy.gov/nepa/categorical-exclusion-determinations-nevada-site-office Page Categorical Exclusion Determinations: Princeton Site Office Categorical Exclusion Determinations issued by Princeton Site Office. http://energy.gov/nepa/categorical-exclusion-determinations-princeton-site-office Page Categorical Exclusion Determinations: Pantex Site Office Categorical Exclusion Determinations issued by Pantex Site Office.

438

DDR January 2012 Page 1 of 16  

E-Print Network [OSTI]

DDR January 2012 Page 1 of 16 GENERAL TERMS & CONDITIONS Dismantling, Demolition and Removal that are different from or in addition to thos

439

Template:RecipePage | Open Energy Information  

Open Energy Info (EERE)

RecipeDescription - describing the recipe RecipeInstructions - steps to prepare Usage It should be called in the following format: RecipePage |RecipeDescription...

440

Page 1 of 26 INDEPENDENT PROJECT  

E-Print Network [OSTI]

Page 1 of 26 INDEPENDENT PROJECT EVALUATION PROJECT NAME: HIVE PROOF-OF- CONCEPT PROJECT PROJECT ............................................................................................................................................3 The Project..............................................................................................................................................3 Project Objectives and Achievements

Evans, Paul

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

Page 1 of 39 The SANDstorm Hash  

E-Print Network [OSTI]

Nuclear Security Administration under Contract DE-AC04-94AL85000. #12;Page 2 of 39 Table of Contents 1 ............................................................................................................. 25 8. Security Discussions

442

ESPC Task Order Face Page Template  

Broader source: Energy.gov [DOE]

Document provides a face page template for a U.S. Department of Energy task order as part of an energy savings performance contract (ESPC).

443

Page not found | Department of Energy  

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

11 - 12520 of 26,764 results. 11 - 12520 of 26,764 results. Page Categorical Exclusion Determinations: Michigan Categorical Exclusion Determinations issued for actions in Michigan. http://energy.gov/nepa/categorical-exclusion-determinations-michigan Page Categorical Exclusion Determinations: Minnesota Categorical Exclusion Determinations issued for actions in Minnesota. http://energy.gov/nepa/categorical-exclusion-determinations-minnesota Page Categorical Exclusion Determinations: Mississippi Categorical Exclusion Determinations issued for actions in Mississippi. http://energy.gov/nepa/categorical-exclusion-determinations-mississippi Page Categorical Exclusion Determinations: Missouri Categorical Exclusion Determinations issued for actions in Missouri. http://energy.gov/nepa/categorical-exclusion-determinations-missouri

444

Mongolia-Partnership for Action on Green Economy (PAGE) | Open...  

Open Energy Info (EERE)

Green Economy (PAGE) Jump to: navigation, search Name Mongolia-Partnership for Action on Green Economy (PAGE) AgencyCompany Organization United Nations Environment Programme...

445

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

Science Journals Connector (OSTI)

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

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

2011-01-01T23:59:59.000Z

446

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

447

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

448

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

449

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

450

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

451

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

452

Help:Protecting and unprotecting pages | Open Energy Information  

Open Energy Info (EERE)

Protecting and unprotecting pages Protecting and unprotecting pages Jump to: navigation, search Protecting and unprotecting pages is very straightforward, but these operations require sysop permissions. You can designate a page as a protected page by clicking the 'Protect page' tab, and supplying a comment (a brief textual description of why you are protecting the page). There are several reasons why a particular page might be protected. On public wikis, a protected page is usually one which has been repeatedly targeted with vandalism, or where it is believed that any vandalism would have an unusually severe impact. On corporate wikis, a page may be protected when the content has been frozen via an approval process. However there are also many good reasons for not protecting pages. As a sysop you

453

OpenEI:Projects/Geographic Pages | Open Energy Information  

Open Energy Info (EERE)

Pages Pages Jump to: navigation, search This page is used to coordinate the OpenEI project's efforts to optimize our geographic pages. In other words, this project seeks to define and implement the "perfect" page for: Country Energy Profile Pages State Energy Profile Pages City Energy Profile Pages County Energy Profile Pages Congressional District Energy Profile Pages Contents 1 Driving OpenEI Traffic and Impact 2 Tasks 3 Targeted Contents 4 Examples 5 Participants Driving OpenEI Traffic and Impact We believe that improving these pages could lead to significant gains in OpenEI traffic and usefulness. It is very difficult for us to reach a top spot in Google searches for very broad terms like "energy" or "solar" (although do strive to make that happen over time). It is more realistic

454

Help:Moving a page | Open Energy Information  

Open Energy Info (EERE)

Moving a page Moving a page Jump to: navigation, search Moving (renaming) a page means giving it another name. This is done by using "Move" tab at the top. Then simply enter the new name and click "Move page". Normally you would want to leave "Move associated talk page" option ticked. If you move page "A" to a new title "B", this operation will do the following: Renames the title of page "A" as "B" Renames all the editing history of page "A" as of page "B" as well Creates a new page "A", whose content is a redirect to page "B" The second point is important. By using the "Move" feature, you also move the editing history, which is desirable in most situations. The editing

455

Technical Report Documentation Page 1. Report No.  

E-Print Network [OSTI]

As the United States imports more than half of its oil and overall consumption continues to climb, the 1992 Information Service 5285 Port Royal Road Springfield, Virginia 22161 19. Security Classif.(of this report) Unclassified 20. Security Classif.(of this page) Unclassified 21. No. of Pages 54 22. Price Form DOT F 1700

456

Technical Report Documentation Page 1. Report No.  

E-Print Network [OSTI]

and metropolitan areas. Economists have also predicted that oil prices will rise in real terms during the same: National Technical Information Service 5285 Port Royal Road Springfield, Virginia 22161 19. Security Classif. (of this report) Unclassified 20. Security Classif. (of this page) Unclassified 21. No. of Pages

457

Technical Report Documentation Page 1. Report No.  

E-Print Network [OSTI]

been ongoing since the oil crises of the 1970s. While there are some commonalties in the regulatory 5285 Port Royal Road Springfield, Virginia 22161 19. Security Classif.(of this report) Unclassified 20. Security Classif.(of this page) Unclassified 21. No. of Pages 51 22. Price Form DOT F 1700.7 (8

458

Technical Report Documentation Page 1. Report No.  

E-Print Network [OSTI]

of hooked bar anchorage is also included. The review of headed reinforcement includes historical background of pertinent code provisions. The review of strut-and-tie modeling (STM) includes an historical background Classif. (of this page) Unclassified 21. No. of pages 116 22. Price Form DOT F 1700.7 (8-72) Reproduction

Texas at Austin, University of

459

Technical Report Documentation Page 1. Report No.  

E-Print Network [OSTI]

this historical review, a survey of transit agencies regarding recent transit standards was conducted, and with the recent Standard Bus Procurement Guidelines, was investigated. Both the historical review and the survey Classif.(of this page) Unclassified 21. No. of Pages 45 22. Price Form DOT F 1700.7 (8-72) Reproduction

460

CURRICULUM VITAE Page 1 CURRICULUM VITAE  

E-Print Network [OSTI]

CURRICULUM VITAE Page 1 CURRICULUM VITAE Shizuka Koh, M.D. Ph. D. Shizuka Koh, M.D. Ph. D, Ninomiya S, Maeda N, Fujikado T: Tear film break-up #12;CURRICULUM VITAE Page 4 evaluated by real time and Certification Medical license : #6355, 1999, Japan Board of Ophthalmology : #14781, 2004, Japan #12;CURRICULUM

Yoon, Geunyoung

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

Page not found | Department of Energy  

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

Error message Error message The page you requested does not exist. For your convenience, a search was performed using the query sites prod files 11 COMM 11 L 23. You are here Home » Page not found Page not found Oops! The page you are looking for doesn't seem to be available. Did you find a broken link? Tell us and we'll fix it. Or maybe you meant to go somewhere else? Use the search box or links below to help guide you. Enter terms sites prod files 11 COMM 11 L 23 Search Showing 24251 - 24260 of 28,905 results. Page International Electricity Regulation U.S. trade in electric energy with Canada and Mexico is rising, bringing economic and reliability benefits to the United States and its trading partners. Within the Office of Electricity Delivery ... http://energy.gov/oe/services/electricity-policy-coordination-and-implementation/international-electricity-regulation

462

Page not found | Department of Energy  

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

Error message Error message The page you requested does not exist. For your convenience, a search was performed using the query documents WA 04 047 CATERPILLAR INC Waiver of Patent Rights to Inventi. You are here Home » Page not found Page not found Oops! The page you are looking for doesn't seem to be available. Did you find a broken link? Tell us and we'll fix it. Or maybe you meant to go somewhere else? Use the search box or links below to help guide you. Enter terms documents WA 04 047 CATERPILLAR INC Waiver of Patent Rights to Inventi Search Showing 23811 - 23820 of 26,764 results. Page Methane Hydrate Methane hydrate is a cage-like lattice of ice inside of which are trapped molecules of methane, the chief constituent of natural gas. If methane hydrate is either warmed or depressurized, it will...

463

Page not found | Department of Energy  

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

51 - 25160 of 26,764 results. 51 - 25160 of 26,764 results. Page Existing Commercial Reference Buildings Constructed In or After 1980 The files on this page contain commercial reference building models for existing buildings constructed in or after 1980, organized by building type and location. These U.S. Department of Energy ... http://energy.gov/eere/buildings/existing-commercial-reference-buildings-constructed-or-after-1980 Page Existing Commercial Reference Buildings Constructed Before 1980 The files on this page contain commercial reference building models for existing buildings constructed before 1980, organized by building type and location. These U.S. Department of Energy (DOE)... http://energy.gov/eere/buildings/existing-commercial-reference-buildings-constructed-1980 Page EnergyPlus Energy Simulation Software

464

Page not found | Department of Energy  

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

71 - 20680 of 26,764 results. 71 - 20680 of 26,764 results. Page Review Reports http://energy.gov/hss/services/oversight/safety-and-emergency-management-evaluations/review-reports Page Classified Information Training Training http://energy.gov/hss/services/classification/classification-training-institute/classified-information-training Page Unclassified Controlled Nuclear Information Training Training http://energy.gov/hss/services/classification/classification-training-institute/unclassified-controlled-nuclear Page Official Use Only Training Training http://energy.gov/hss/services/classification/classification-training-institute/official-use-only-training Page Resources for OUO The following are materials that may assist you in understanding OUO. http://energy.gov/hss/services/classification/official-use-only-information/resources-ouo

465

Page not found | Department of Energy  

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

Error message Error message The page you requested does not exist. For your convenience, a search was performed using the query Flash2009 19. You are here Home » Page not found Page not found Oops! The page you are looking for doesn't seem to be available. Did you find a broken link? Tell us and we'll fix it. Or maybe you meant to go somewhere else? Use the search box or links below to help guide you. Enter terms Flash2009 19 Search Showing 2401 - 2410 of 9,640 results. Page National SCADA Test Bed Created in 2003, the National SCADA Test Bed (NSTB) is a one-of-a-kind national resource that draws on the integrated expertise and capabilities of the Argonne, Idaho, Lawrence Berkeley, Los Alamos... http://energy.gov/oe/technology-development/energy-delivery-systems-cybersecurity/national-scada-test-bed

466

Page not found | Department of Energy  

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

31 - 13540 of 31,917 results. 31 - 13540 of 31,917 results. Page NEPA and Other Laws Selected documents providing guidance on the relationship between NEPA and other laws. http://energy.gov/nepa/nepa-and-other-laws Page Other NEPA Guidance Selected documents prepared by a variety of agencies that provide guidance on the NEPA process. http://energy.gov/nepa/other-nepa-guidance Page Council on Environmental Quality Selected documents prepared by the Council on Environmental Quality that provide guidance on the NEPA process. http://energy.gov/nepa/council-environmental-quality Page Department of Energy Selected documents prepared by the Department of Energy that provide guidance on the NEPA process. http://energy.gov/nepa/department-energy Page Environmental Protection Agency Selected documents prepared by the Environmental Protection Agency that

467

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

468

Document Icons and Page Thumbnails: Issues in Construction of Document  

E-Print Network [OSTI]

Document Icons and Page Thumbnails: Issues in Construction of Document Thumbnails for Page appropriately. #12;Document Icons and Page Thumbnails: Issues in Construction of Document Thumbnails for Page, called doc- ument icons, are discussed; one algorithm, called log-area, seems most effective. 1

Janssen, Bill

469

BioMed Central Page 1 of 3  

E-Print Network [OSTI]

BioMed Central Page 1 of 3 (page number not for citation purposes) BMC Bioinformatics Open Access, France, Germany, Greece, India, Japan, Korea, the Netherlands, Poland, Sin- gapore, Switzerland, Thailand://www.biomedcentral.com/1471-2105/10/S1/S1 Page 2 of 3 (page number not for citation purposes) the biological contexts of th

470

BioMed Central Page 1 of 16  

E-Print Network [OSTI]

BioMed Central Page 1 of 16 (page number not for citation purposes) BMC Developmental Biology Open Utrecht, The Netherlands and 4Present address : Molecular Oncology and Aging Research, Centre d-213X/7/30 Page 2 of 16 (page number not for citation purposes) Background The retinoblastoma gene (Rb

471

BioMed Central Page 1 of 16  

E-Print Network [OSTI]

BioMed Central Page 1 of 16 (page number not for citation purposes) BMC Genomics Open Access of Leiden, Leiden, The Netherlands and 3Bioinformatics Laboratory, Turku Centre for Biotechnology, Turku-2164/7/130 Page 2 of 16 (page number not for citation purposes) Background The last decade has witnessed

Beldade, Patrícia

472

Page  

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

4 4 Θ c (3100) 0 I (J P ) = 0(? ? ) OMITTED FROM SUMMARY TABLE AKTAS 04A in e ± p reactions at c.m. energies of 300 and 320 GeV NODE=B154 sees the peak in D ∗ (2010) - p and D ∗ (2010) + p mass spectra. The minimum quark content would be u u d d c. However: * SCHAEL 04 in a search in D - p and D ∗- p (and charge conjugate) events from 3.5M Z decays sees no evidence for the peak. * CHEKANOV 04D finds no evidence in D ∗- p (and charge-conjugate) events with more than 60,000 re- constructed D ∗± mesons. * LINK 05D finds no evidence in D - p and D ∗- p (and charge-conjugate) events in a cleaner and 30 times larger sample than that of AKTAS 04A. * AUBERT,B 06I finds no evidence in 125,000 D ∗- p (and charge-conjugate) events produced in e + e - reactions at 10.58 GeV. * DELELLIS 07 finds no evidence in 2262 ν emulsion charged-current events. (This is actually a search for a Θ c below the D - p threshold, not for the Θ c (3100).)

473

Page  

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

2 2 The Diversity Plan guidance provided in Chapter 12 of the Reference Book for Contract Administrators establi:;hes procedural requirements associated with DEAR Clause 970.5226-1, Diversity Plan, which :lS a required clause in all Management m1d Operation (M&O) contracts and provides guidance in the elements and factors to consider in evaluating the contractor's performance against all approved plan. The guidance acts as an assessment tool, linking the Diversity Plan's goal t) obtain contractor commitment to diversity sensitivity and inclusion in all aspects of its business practices, the workplace, and relations with the community at large.)with performed outcome. In addition, Chapter 12 is updated to Questions concerning this Flash should be directed to Denise P. Wright on (202) 586-6217 or via

474

Page  

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

2 2 Θ(1540) + I (J P ) = 0(? ? ) OMITTED FROM SUMMARY TABLE A REVIEW GOES HERE - Check our WWW List of Reviews NODE=B152 Θ(1540) + MASS Θ(1540) + MASS Θ(1540) + MASS Θ(1540) + MASS NODE=B152205 The note below, from the 2006 Review, lists 10 papers on searches for NODE=B152205 the Θ(1540) with negative results. Since then, there have been six more such papers (four of them from the CLAS experiment): AKTAS 06B, DEVITA 06, KUBAROVSKY 06, LINK 06C, MCKINNON 06, and NIC- COLAI 06. Two other papers, MIWA 06 and PANZARASA 06, did find a peak at about the right mass, but only at the 2.5-to-2.7 standard deviation level. We will summarize all these results in a table in the 2008 Review. Since our 2004 edition, there have been several new claimed sightings of the Θ(1540) + (see entries below marked with bars to the right), but there have also been several searches with negative results: * ANTIPOV 04 (SPHINX Collab.)

475

Page  

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

3 3 The follo\\ing item is available via the internet at htm:/ /WWVI .arnet.gov /far/facsframe.html Effective Date: February 24, 2004 Special Emergency Procurement Authority (FAR Case 2003-022) This interim rule amends FAR parts 2, Definition of Words and Tenns, 10, Market Research, 12, Acquisition of Commercial Items, 13, Simplified Acquisition Procedures, 15, Contracting by Negotiation, 19, Small Business Programs, and 25. Foreign Acquisition. The rule- ~ Increases the micro-purchase threshold from $2,500 to $ 15,000, except for construction, for acquisitions of supplies or services that the head of the agency has determined to be used to support a contingency operation or to facilitate defense against or recovery from nuclear, biological, chemical. or radiological attack;

476

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

477

Page not found | Department of Energy  

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

31 - 21540 of 28,560 results. 31 - 21540 of 28,560 results. Page Princeton Plasma Physics Laboratory, Former Production Workers Screening Projects Princeton Plasma Physics Laboratory, Former Production Workers Screening Projects http://energy.gov/hss/princeton-plasma-physics-laboratory-former-production-workers-screening-projects Page Sandia National Laboratory (NM), Former Production Workers Screening Projects Sandia National Laboratory (NM), Former Production Workers Screening Projects http://energy.gov/hss/sandia-national-laboratory-nm-former-production-workers-screening-projects Page Waste Isolation Pilot Plant, Former Production Workers Screening Projects Waste Isolation Pilot Plant, Former Production Workers Screening Projects http://energy.gov/hss/waste-isolation-pilot-plant-former-production-workers-screening-projects

478

Page not found | Department of Energy  

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

31 - 13240 of 26,764 results. 31 - 13240 of 26,764 results. Page Categorical Exclusion Determinations: Pacific Northwest Site Office Categorical Exclusion Determinations issued by Pacific Northwest Site Office. http://energy.gov/nepa/categorical-exclusion-determinations-pacific-northwest-site-office Page Categorical Exclusion Determinations: Portsmouth Paducah Project Office Categorical Exclusion Determinations issued by Portsmouth Paducah Project Office. http://energy.gov/nepa/categorical-exclusion-determinations-portsmouth-paducah-project-office Page Categorical Exclusion Determinations: Civilian Radioactive Waste Management Categorical Exclusion Determinations issued by Civilian Radioactive Waste Management. http://energy.gov/nepa/categorical-exclusion-determinations-civilian-radioactive-waste-management

479

Page not found | Department of Energy  

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

201 - 24210 of 28,905 results. 201 - 24210 of 28,905 results. Page Fermi National Acceleratory Laboratory Former Workers, Construction Worker Screening Projects Fermi National Acceleratory Laboratory Former Workers, Construction Worker Screening Projects http://energy.gov/hss/fermi-national-acceleratory-laboratory-former-workers-construction-worker-screening-projects Page Mallinckrodt Chemical Co., Former Construction Worker Screening Projects Mallinckrodt Chemical Co., Former Construction Workers Screening Projects http://energy.gov/hss/mallinckrodt-chemical-co-former-construction-worker-screening-projects-0 Page Mallinckrodt Chemical Co., Former Construction Worker Screening Projects Mallinckrodt Chemical Co., Former Construction Workers Screening Projects http://energy.gov/hss/mallinckrodt-chemical-co-former-construction-worker-screening-projects

480

Page not found | Department of Energy  

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

61 - 25770 of 28,904 results. 61 - 25770 of 28,904 results. Download Transportation and Program Management Services Overview of Secured Transportation Services (STS) http://energy.gov/em/downloads/transportation-and-program-management-services Page Acquisition Resources http://energy.gov/em/services/program-management/acquisition/acquisition-resources Page Energy Efficiency and Greenhouse Gases The team establishes an energy conservation program as defined in Executive Order (EO) 13423, Strengthening Federal Environmental, Energy, and Transportation Management, and (EO) 13514, Federal... http://energy.gov/lm/services/joint-environmental-management-system-ems/energy-efficiency-and-greenhouse-gases Page Sustainable Acquisition The team establishes a national approach to expand purchases of

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

Page not found | Department of Energy  

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

21 - 14630 of 26,764 results. 21 - 14630 of 26,764 results. Page Categorical Exclusion Determinations: B7.1 B7.1: Emergency measures under the International Energy ProgramPlanning and implementation of emergency measures pursuant to the International Energy Program. http://energy.gov/nepa/categorical-exclusion-determinations-b71 Page Categorical Exclusion Determinations: Advanced Technology Vehicles Manufacturing Loan Program Categorical Exclusion Determinations issued by Advanced Technology Vehicles Manufacturing Loan Program. http://energy.gov/nepa/categorical-exclusion-determinations-advanced-technology-vehicles-manufacturing-loan-program Page Categorical Exclusion Determinations: Office of River Protection-Richland Opperations Office Categorical Exclusion Determinations issued by Office of River

482

Page not found | Department of Energy  

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

21 - 21530 of 28,560 results. 21 - 21530 of 28,560 results. Page Lawrence Berkeley National Laboratory, Former Production Workers Screening Projects Lawrence Berkeley National Laboratory, Former Production Workers Screening Projects http://energy.gov/hss/lawrence-berkeley-national-laboratory-former-production-workers-screening-projects Page Lawrence Livermore National Laboratory, Former Production Workers Screening Projects Lawrence Livermore National Laboratory, Former Production Workers Screening Projects http://energy.gov/hss/lawrence-livermore-national-laboratory-former-production-workers-screening-projects Page Sandia National Laboratory (CA), Former Production Workers Screening Projects Sandia National Laboratory (CA), Former Production Workers Screening Projects http://energy.gov/hss/sandia-national-laboratory-ca-former-production-workers-screening-projects

483

Export.gov - Home page  

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

Hrvatski Hrvatski Register | Manage Account Search Our Site Click to Search Our Site Export.gov Home Opportunities By Industry By Country Market Research Trade Events Trade Leads Free Trade Agreements Solutions International Sales & Marketing International Financing International Logistics Licenses & Regulations Trade Data & Analysis Trade Problems Locations Domestic Offices International Offices FAQ Blog Connect Home > Croatia Local Time: Print | E-mail Page Croatia Croatia Home Doing Business in Croatia Market Research on Croatia Services for U.S. Companies Trade Events Business Service Providers IPR Toolkit Study in the United States Internship with the U.S. Commercial Service Contact Us Our Worldwide Network About Us Press Room Other European Markets Other Worldwide Markets

484

Page not found | Department of Energy  

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

91 - 1600 of 29,416 results. 91 - 1600 of 29,416 results. Page Emergencies and Emergency Actions Selected documents on the topic of Emergencies and Emergency Actions under NEPA. http://energy.gov/nepa/emergencies-and-emergency-actions Page Council on Environmental Quality Selected documents prepared by the Council on Environmental Quality that provide guidance on the NEPA process. http://energy.gov/nepa/council-environmental-quality Page Department of Energy Selected documents prepared by the Department of Energy that provide guidance on the NEPA process. http://energy.gov/nepa/department-energy Page Environmental Protection Agency Selected documents prepared by the Environmental Protection Agency that provide guidance on the NEPA process http://energy.gov/nepa/environmental-protection-agency

485

Page not found | Department of Energy  

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

Error message Error message The page you requested does not exist. For your convenience, a search was performed using the query documents WA 1994 017 GOLDEN TECHNOLOGIES COMPANY Waiver of Domestic a. You are here Home » Page not found Page not found Oops! The page you are looking for doesn't seem to be available. Did you find a broken link? Tell us and we'll fix it. Or maybe you meant to go somewhere else? Use the search box or links below to help guide you. Enter terms documents WA 1994 017 GOLDEN TECHNOLOGIES COMPANY Waiver of Domestic a Search Showing 7651 - 7660 of 31,917 results. Article Small Business Innovation Research Grant Helps Propel Innovative Wind Energy Small Business With the support of $850,000 in Phase I and II Small Business Innovation Research (SBIR) grants from the Department in 2002 and 2003, Wind Tower

486

Page not found | Department of Energy  

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

Error message Error message The page you requested does not exist. For your convenience, a search was performed using the query sites prod files 11 COMM 11 L 23. You are here Home » Page not found Page not found Oops! The page you are looking for doesn't seem to be available. Did you find a broken link? Tell us and we'll fix it. Or maybe you meant to go somewhere else? Use the search box or links below to help guide you. Enter terms sites prod files 11 COMM 11 L 23 Search Showing 16571 - 16580 of 28,905 results. Rebate Income Tax Deduction for Energy-Efficient Products This incentive is available for dishwashers, clothes washers, air conditioners, ceiling fans, compact fluorescent light bulbs, dehumidifiers, programmable thermostats or refrigerators that meet or... http://energy.gov/savings/income-tax-deduction-energy-efficient-products

487

Page not found | Department of Energy  

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

Error message Error message The page you requested does not exist. For your convenience, a search was performed using the query sites prod files 11 COMM 11 L 23. You are here Home » Page not found Page not found Oops! The page you are looking for doesn't seem to be available. Did you find a broken link? Tell us and we'll fix it. Or maybe you meant to go somewhere else? Use the search box or links below to help guide you. Enter terms sites prod files 11 COMM 11 L 23 Search Showing 26171 - 26180 of 28,904 results. Rebate Vectren Energy Delivery of Ohio (Gas)- Commercial Energy Efficiency Rebates Vectren Energy Delivery offers commercial natural gas customers in Ohio rebates for the installation of certain types of efficient natural gas equipment. Prescriptive equipment rebates are...

488

Page not found | Department of Energy  

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

Error message Error message The page you requested does not exist. For your convenience, a search was performed using the query Flash2009 19. You are here Home » Page not found Page not found Oops! The page you are looking for doesn't seem to be available. Did you find a broken link? Tell us and we'll fix it. Or maybe you meant to go somewhere else? Use the search box or links below to help guide you. Enter terms Flash2009 19 Search Showing 1481 - 1490 of 9,640 results. Download EIS-0383: EPA Notice of Availability of the Final Environmental Impact Statement Orlando Gasification Project http://energy.gov/nepa/downloads/eis-0383-epa-notice-availability-final-environmental-impact-statement Download Map Data: State Spending http://energy.gov/downloads/map-data-state-spending

489

Page not found | Department of Energy  

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

Error message Error message The page you requested does not exist. For your convenience, a search was performed using the query documents WA 04 047 CATERPILLAR INC Waiver of Patent Rights to Inventi. You are here Home » Page not found Page not found Oops! The page you are looking for doesn't seem to be available. Did you find a broken link? Tell us and we'll fix it. Or maybe you meant to go somewhere else? Use the search box or links below to help guide you. Enter terms documents WA 04 047 CATERPILLAR INC Waiver of Patent Rights to Inventi Search Showing 7771 - 7780 of 26,764 results. Download Flash2010-28attachmentv1.pdf http://energy.gov/management/downloads/flash2010-28attachmentv1pdf Download Major Communications Report May 7, 2009 This file includes the Department of Energy's major announcements regarding

490

Page not found | Department of Energy  

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

Error message Error message The page you requested does not exist. For your convenience, a search was performed using the query Flash2009 19. You are here Home » Page not found Page not found Oops! The page you are looking for doesn't seem to be available. Did you find a broken link? Tell us and we'll fix it. Or maybe you meant to go somewhere else? Use the search box or links below to help guide you. Enter terms Flash2009 19 Search Showing 1381 - 1390 of 9,640 results. Download Microsoft Word- Attachment 3 Recovery Act notification http://energy.gov/management/downloads/microsoft-word-attachment-3-recovery-act-notification-1 Download Microsoft Word- Attachment 3 Recovery Act notification http://energy.gov/management/downloads/microsoft-word-attachment-3-recovery-act-notification-2

491

Page not found | Department of Energy  

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

Error message Error message The page you requested does not exist. For your convenience, a search was performed using the query sites prod files 11 COMM 11 L 23. You are here Home » Page not found Page not found Oops! The page you are looking for doesn't seem to be available. Did you find a broken link? Tell us and we'll fix it. Or maybe you meant to go somewhere else? Use the search box or links below to help guide you. Enter terms sites prod files 11 COMM 11 L 23 Search Showing 18611 - 18620 of 28,905 results. Article WIPP Receives Top Safety Award CARLSBAD, N.M. - The U.S. Department of Energy's (DOE) Waste Isolation Pilot Plant (WIPP) received top accolades from New Mexico's leading mining organizations. http://energy.gov/em/articles/wipp-receives-top-safety-award Article DOE Extends Public Comment Period for Uranium Program Environmental

492

Page not found | Department of Energy  

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

Error message Error message The page you requested does not exist. For your convenience, a search was performed using the query sites prod files 11 COMM 11 L 23. You are here Home » Page not found Page not found Oops! The page you are looking for doesn't seem to be available. Did you find a broken link? Tell us and we'll fix it. Or maybe you meant to go somewhere else? Use the search box or links below to help guide you. Enter terms sites prod files 11 COMM 11 L 23 Search Showing 25251 - 25260 of 28,904 results. Rebate Peninsula Light Company- Residential Energy Efficiency Rebate Program Peninsula Light Company offers a rebate program for residential customers who want to install energy efficient products in homes. Rebates are provided for window replacements, water heaters, heat...

493

Page not found | Department of Energy  

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

Error message Error message The page you requested does not exist. For your convenience, a search was performed using the query Flash2009 19. You are here Home » Page not found Page not found Oops! The page you are looking for doesn't seem to be available. Did you find a broken link? Tell us and we'll fix it. Or maybe you meant to go somewhere else? Use the search box or links below to help guide you. Enter terms Flash2009 19 Search Showing 1031 - 1040 of 9,640 results. Rebate Black Hills Energy (Gas)- Commercial Energy Efficiency Rebate Programs Black Hills Energy offers commercial and industrial customers incentives to encourage energy efficiency in eligible businesses. Prescriptive rebates are available for furnace and boiler... http://energy.gov/savings/black-hills-energy-gas-commercial-energy-efficiency-rebate-programs

494

Page not found | Department of Energy  

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

Error message Error message The page you requested does not exist. For your convenience, a search was performed using the query documents WA 04 047 CATERPILLAR INC Waiver of Patent Rights to Inventi. You are here Home » Page not found Page not found Oops! The page you are looking for doesn't seem to be available. Did you find a broken link? Tell us and we'll fix it. Or maybe you meant to go somewhere else? Use the search box or links below to help guide you. Enter terms documents WA 04 047 CATERPILLAR INC Waiver of Patent Rights to Inventi Search Showing 16291 - 16300 of 26,764 results. Article Save Energy With A Picnic! Enjoy the summer weather while saving energy with a picnic. http://energy.gov/energysaver/articles/save-energy-picnic Contributor Anne Harkavy Anne Harkavy serves as Deputy General Counsel for Litigation and

495

Page not found | Department of Energy  

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

Error message Error message The page you requested does not exist. For your convenience, a search was performed using the query documents WA 04 047 CATERPILLAR INC Waiver of Patent Rights to Inventi. You are here Home » Page not found Page not found Oops! The page you are looking for doesn't seem to be available. Did you find a broken link? Tell us and we'll fix it. Or maybe you meant to go somewhere else? Use the search box or links below to help guide you. Enter terms documents WA 04 047 CATERPILLAR INC Waiver of Patent Rights to Inventi Search Showing 24331 - 24340 of 26,764 results. Rebate Puerto Rico- Green Energy Fund Tier I Incentive Program (Puerto Rico) NOTE: The third funding cycle closed December 31, 2012. The current funding cycle runs from February 1, 2013 to June 30, 2013. There is $4,823,507

496

Page not found | Department of Energy  

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

Error message Error message The page you requested does not exist. For your convenience, a search was performed using the query documents WA 1994 017 GOLDEN TECHNOLOGIES COMPANY Waiver of Domestic a. You are here Home » Page not found Page not found Oops! The page you are looking for doesn't seem to be available. Did you find a broken link? Tell us and we'll fix it. Or maybe you meant to go somewhere else? Use the search box or links below to help guide you. Enter terms documents WA 1994 017 GOLDEN TECHNOLOGIES COMPANY Waiver of Domestic a Search Showing 6971 - 6980 of 31,917 results. Download ANNUAL FOIA REPORT FOR 2009 The DOE's mission is to advance the national, economic, and energy security of the United States; to promote scientific and technological innovation in support of that mission; and to ensure the...

497

Page not found | Department of Energy  

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

21 - 22130 of 26,764 results. 21 - 22130 of 26,764 results. Page Process Rule The Department of Energy (DOE) conducted a formal effort between 1995 and 1996 to improve the process it used to develop appliance efficiency standards. This effort involved many different... http://energy.gov/eere/buildings/process-rule Page GC NEPA Listserv Subscribe to NEPA Updates http://energy.gov/gc/sign-gc-updates/gc-nepa-listserv Page Electricity Advisory Committee- 2014 Meetings JANUARY 24, 2014 TELECONFERENCE MEETING OF THE ELECTRICITY ADVISORY COMMITTEEDate: Friday, January 24, 2014 2:00 p.m. - 3:05 p.m. ETLocation: EAC committee members will take part in this meeting by... http://energy.gov/oe/services/electricity-advisory-committee-eac/electricity-advisory-committee-2014-meetings Page About Us

498

Page not found | Department of Energy  

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

Error message Error message The page you requested does not exist. For your convenience, a search was performed using the query Flash2009 19. You are here Home » Page not found Page not found Oops! The page you are looking for doesn't seem to be available. Did you find a broken link? Tell us and we'll fix it. Or maybe you meant to go somewhere else? Use the search box or links below to help guide you. Enter terms Flash2009 19 Search Showing 411 - 420 of 9,640 results. Download Project Management Plan Examples 1- 80 The following material has been extracted from several project management plans. The order in which it is presented is arbitrary. The descriptions below should be used to navigate to the subject of... http://energy.gov/em/downloads/project-management-plan-examples-1-80

499

Page not found | Department of Energy  

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

Error message Error message The page you requested does not exist. For your convenience, a search was performed using the query Flash2009 19. You are here Home » Page not found Page not found Oops! The page you are looking for doesn't seem to be available. Did you find a broken link? Tell us and we'll fix it. Or maybe you meant to go somewhere else? Use the search box or links below to help guide you. Enter terms Flash2009 19 Search Showing 591 - 600 of 9,640 results. Download DOE-STD-1158-2010 Self-Assessment Standard for DOE Contractor Criticality Safety Programs This document encompasses all elements of the Contractor Criticality Safety Program at DOE facilities. The effectiveness of the criticality safety program is dependent upon management implementing its roles and

500

Page not found | Department of Energy  

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

Error message Error message The page you requested does not exist. For your convenience, a search was performed using the query documents WA 1994 017 GOLDEN TECHNOLOGIES COMPANY Waiver of Domestic a. You are here Home » Page not found Page not found Oops! The page you are looking for doesn't seem to be available. Did you find a broken link? Tell us and we'll fix it. Or maybe you meant to go somewhere else? Use the search box or links below to help guide you. Enter terms documents WA 1994 017 GOLDEN TECHNOLOGIES COMPANY Waiver of Domestic a Search Showing 8091 - 8100 of 31,917 results. Download CX-005983: Categorical Exclusion Determination Red Bluff Pumping Plant 6-kilovolt Interconnection Project CX(s) Applied: B4.12 Date: 05/24/2011 Location(s): Tehama County, California