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

graph  

Science Conference Proceedings (OSTI)

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

2013-11-18T23:59:59.000Z

2

PDSF Utilization Graphs  

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

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

3

Page  

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

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)

4

graph drawing  

Science Conference Proceedings (OSTI)

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

2013-11-18T23:59:59.000Z

5

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;

6

EntityAuthority: Semantically Enriched Graph-Based Authority Propagation  

E-Print Network (OSTI)

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

Pennsylvania, University of

7

Motion graphs  

Science Conference Proceedings (OSTI)

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

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

2002-07-01T23:59:59.000Z

8

Tracking the random surfer: empirically measured teleportation parameters in PageRank  

Science Conference Proceedings (OSTI)

PageRank computes the importance of each node in a directed graph under a random surfer model governed by a teleportation parameter. Commonly denoted alpha, this parameter models the probability of following an edge inside the graph or, when the graph ... Keywords: PageRank, Wikipedia, click trail analysis, empirical click probability, teleportation parameter, toolbar data

David F. Gleich; Paul G. Constantine; Abraham D. Flaxman; Asela Gunawardana

2010-04-01T23:59:59.000Z

9

Graph sketcher: extending illustration to quantitative graphs  

Science Conference Proceedings (OSTI)

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

Robin Stewart; m.c. schraefel

2009-04-01T23:59:59.000Z

10

Learning Graph Matching  

E-Print Network (OSTI)

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

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

2008-01-01T23:59:59.000Z

11

Claw-free graphs and line graphs.  

E-Print Network (OSTI)

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

Shao, Yehong, 1976-

2005-01-01T23:59:59.000Z

12

Almost self-centered graphs  

E-Print Network (OSTI)

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

Sandi Klavzar; et al.

2009-01-01T23:59:59.000Z

13

directed acyclic word graph  

Science Conference Proceedings (OSTI)

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

2013-08-23T23:59:59.000Z

14

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

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

Evaluation of MerCAP^TM for Power Plant Mercury Control  

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

Evaluation of MErCaP(tm) for PowEr Plant MErCury Control Background Several technologies are under development for removing mercury from power plant flue gas streams. The mercury...

16

PAGE OF PAGES  

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

17

Undirected Graphs maze exploration  

E-Print Network (OSTI)

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

Sedgewick, Robert

18

Detachments of Complete Graphs  

Science Conference Proceedings (OSTI)

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

Keith Edwards

2005-05-01T23:59:59.000Z

19

Slicibility of rectangular graphs and floorplan optimization  

Science Conference Proceedings (OSTI)

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

Partha S. Dasgupta; Susmita Sur-Kolay

1997-04-01T23:59:59.000Z

20

cover page  

Science Conference Proceedings (OSTI)

Page 1. SUPPLEMENTAL REPORT Department of Commerce, Annual Budget Proposal, FY 2008 Annual Report on Technology Transfer: ...

2010-07-27T23: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.


21

A Semantic Graph Query Language  

Science Conference Proceedings (OSTI)

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

Kaplan, I L

2006-10-16T23:59:59.000Z

22

Crawling Online Social Graphs  

E-Print Network (OSTI)

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

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

2010-01-01T23:59:59.000Z

23

Evaluation of MerCAP for Power Plant Mercury Control  

SciTech Connect

This report is submitted to the U.S. Department of Energy National Energy Technology Laboratory (DOE-NETL) as part of Cooperative Agreement DE-FC26-03NT41993, 'Evaluation of EPRI's MerCAP{trademark} Technology for Power Plant Mercury Control'. This project has investigated the mercury removal performance of EPRI's Mercury Capture by Amalgamation Process (MerCAP{trademark}) technology. Test programs were conducted to evaluate gold-based MerCAP{trademark} at Great River Energy's Stanton Station Unit 10 (Site 1), which fired both North Dakota lignite (NDL) and Power River Basin (PRB) coal during the testing period, and at Georgia Power's Plant Yates Unit 1 (Site 2) [Georgia Power is a subsidiary of The Southern Company] which fires a low sulfur Eastern bituminous coal. Additional tests were carried out at Alabama Power's Plant Miller, which fires Powder River Basin Coal, to evaluate a carbon-based MerCAP{trademark} process for removing mercury from flue gas downstream of an electrostatic precipitator [Alabama Power is a subsidiary of The Southern Company]. A full-scale gold-based sorbent array was installed in the clean-air plenum of a single baghouse compartment at GRE's Stanton Station Unit 10, thereby treating 1/10th of the unit's exhaust gas flow. The substrates that were installed were electroplated gold screens oriented parallel to the flue gas flow. The sorbent array was initially installed in late August of 2004, operating continuously until its removal in July 2006, after nearly 23 months. The initial 4 months of operation were conducted while the host unit was burning North Dakota lignite (NDL). In November 2004, the host unit switched fuel to burn Powder River Basin (PRB) subbituminous coal and continued to burn the PRB fuel for the final 19 months of this program. Tests were conducted at Site 1 to evaluate the impacts of flue gas flow rate, sorbent plate spacing, sorbent pre-cleaning and regeneration, and spray dryer operation on MerCAP{trademark} performance. At Site 2, a pilot-scale array was installed in a horizontal reactor chamber designed to treat approximately 2800 acfm of flue gas obtained from downstream of the plant's flue gas desulfurization (FGD) system. The initial MerCAP{trademark} array was installed at Plant Yates in January 2004, operating continuously for several weeks before a catastrophic system failure resulting from a failed flue gas fan. A second MerCAP{trademark} array was installed in July 2006 and operated for one month before being shut down for a reasons pertaining to system performance and host site scheduling. A longer-term continuous-operation test was then conducted during the summer and fall of 2007. Tests were conducted to evaluate the impacts of flue gas flow rate, sorbent space velocity, and sorbent rinsing frequency on mercury removal performance. Detailed characterization of treated sorbent plates was carried out in an attempt to understand the nature of reactions leading to excessive corrosion of the substrate surfaces.

Carl Richardson

2008-09-30T23:59:59.000Z

24

Graph Transformations in Relational Databases  

E-Print Network (OSTI)

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

Gergely Varró

2004-01-01T23:59:59.000Z

25

Analysis of multilevel graph partitioning  

Science Conference Proceedings (OSTI)

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

George Karypis; Vipin Kumar

1995-12-01T23:59:59.000Z

26

Taxonomy-superimposed graph mining  

Science Conference Proceedings (OSTI)

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

Ali Cakmak; Gultekin Ozsoyoglu

2008-03-01T23:59:59.000Z

27

Algorithms for string and graph layout  

E-Print Network (OSTI)

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

Newman, Alantha.

2004-01-01T23:59:59.000Z

28

Towards graph containment search and indexing  

Science Conference Proceedings (OSTI)

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

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

2007-09-01T23:59:59.000Z

29

Temporal Representation in Semantic Graphs  

Science Conference Proceedings (OSTI)

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

Levandoski, J J; Abdulla, G M

2007-08-07T23:59:59.000Z

30

Errors in graph embedding algorithms  

Science Conference Proceedings (OSTI)

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

Wendy Myrvold; William Kocay

2011-03-01T23:59:59.000Z

31

Extremal graphs without 4-cycles  

Science Conference Proceedings (OSTI)

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

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

2013-05-01T23:59:59.000Z

32

Power domination in block graphs  

Science Conference Proceedings (OSTI)

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

Guangjun Xu; Liying Kang; Erfang Shan; Min Zhao

2006-08-01T23:59:59.000Z

33

Graph theoretic approach to parallel gene assembly  

Science Conference Proceedings (OSTI)

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

Tero Harju; Chang Li; Ion Petre

2008-11-01T23:59:59.000Z

34

Quantum chaos on discrete graphs  

E-Print Network (OSTI)

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

Uzy Smilansky

2007-04-26T23:59:59.000Z

35

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

36

Janie Page  

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

37

Home Page  

Gasoline and Diesel Fuel Update (EIA)

Electronic Access and Related Reports The AEO98 will be available on CD-ROM and the EIA Home Page on the Internet (http:www.eia.govoiafaeo98homepage.html), including text,...

38

Graph Homomorphisms for Quantum Players  

E-Print Network (OSTI)

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

David E. Roberson; Laura Mancinska

2012-12-07T23:59:59.000Z

39

Games on Graphs  

E-Print Network (OSTI)

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

Milos Stojakovic

2005-01-01T23:59:59.000Z

40

Distributed large-scale natural graph factorization  

Science Conference Proceedings (OSTI)

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

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

2013-05-01T23:59:59.000Z

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

On crossing numbers of geometric proximity graphs  

Science Conference Proceedings (OSTI)

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

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

2011-05-01T23:59:59.000Z

42

A history of graph entropy measures  

Science Conference Proceedings (OSTI)

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

Matthias Dehmer; Abbe Mowshowitz

2011-01-01T23:59:59.000Z

43

Energy of graphs and digraphs.  

E-Print Network (OSTI)

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

Jahanbakht, Nafiseh

2010-01-01T23:59:59.000Z

44

Skewed graph partitioning  

Science Conference Proceedings (OSTI)

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

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

1997-02-01T23:59:59.000Z

45

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

Science Conference Proceedings (OSTI)

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

Jaewook Yu; Eric Noel; K. Wendy Tang

2010-11-01T23:59:59.000Z

46

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

Science Conference Proceedings (OSTI)

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

Xinquan Chen

2013-06-01T23:59:59.000Z

47

Robust Hamiltonicity of Dirac graphs  

E-Print Network (OSTI)

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

Krivelevich, Michael; Sudakov, Benny

2012-01-01T23:59:59.000Z

48

Quantum networks modelled by graphs  

Science Conference Proceedings (OSTI)

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

Pavel Exner; Olaf Post

2008-01-01T23:59:59.000Z

49

work page  

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

50

On Generating Random Network Structures: Connected Graphs  

Science Conference Proceedings (OSTI)

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

51

From quantum graphs to quantum random walks  

E-Print Network (OSTI)

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

Gregor Tanner

2005-04-29T23:59:59.000Z

52

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.

53

Graph anomalies in cyber communications  

Science Conference Proceedings (OSTI)

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

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

2011-01-11T23:59:59.000Z

54

NETL: Mercury Emissions Control Technologies - Evaluation of MerCAP for  

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

55

Probe threshold and probe trivially perfect graphs  

Science Conference Proceedings (OSTI)

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

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

2009-11-01T23:59:59.000Z

56

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

Science Conference Proceedings (OSTI)

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

Abdelghani Bellaachia; Mohammed Al-Dhelaan

2012-12-01T23:59:59.000Z

57

page 10  

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

58

Inside PageRank  

Science Conference Proceedings (OSTI)

Although the interest of a Web page is strictly related to its content and to the subjective readers' cultural background, a measure of the page authority can be provided that only depends on the topological structure of the Web. PageRank is a noticeable ... Keywords: Information retrieval, Markov chains, PageRank, Web page scoring, search engines, searching the Web

Monica Bianchini; Marco Gori; Franco Scarselli

2005-02-01T23:59:59.000Z

59

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

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

60

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

E-Print Network (OSTI)

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

Brooks, Josh Daniel

2012-01-01T23:59:59.000Z

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

APPROXIMATING THE CHROMATIC NUMBER OF A GRAPH BY ...  

E-Print Network (OSTI)

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

62

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

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

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

63

Page comments  

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

64

Page not found | Department of Energy  

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

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

65

Positional Games on Random Graphs  

E-Print Network (OSTI)

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

Milos Stojakovic; Tibor Szabo

2005-01-01T23:59:59.000Z

66

A discrete curvature on a planar graph  

E-Print Network (OSTI)

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

M. Lorente

2004-12-20T23:59:59.000Z

67

Graph coloring and related symmetric functions - CECM  

E-Print Network (OSTI)

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

68

0-1 graph partitioning and image segmentation  

E-Print Network (OSTI)

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

Goh, Chun Fan

2008-01-01T23:59:59.000Z

69

User Questionnaire Page  

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

Questionnaire Page 1 of 3 041613 TANDEM FACILITY USER QUESTIONNAIRE Organization: Contact Person:...

70

Mining closed relational graphs with connectivity constraints  

Science Conference Proceedings (OSTI)

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

Xifeng Yan; X. Jasmine Zhou; Jiawei Han

2005-08-01T23:59:59.000Z

71

A Graph Analytical Approach for Topic Detection  

Science Conference Proceedings (OSTI)

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

Hassan Sayyadi, Louiqa Raschid

2013-12-01T23:59:59.000Z

72

Bipartite graph partitioning and data clustering  

Science Conference Proceedings (OSTI)

Many data types arising from data mining applications can be modeled as bipartite graphs, examples include terms and documents in a text corpus, customers and purchasing items in market basket analysis and reviewers and movies in a movie recommender ... Keywords: bipartite graph, correspondence analysis, document clustering, graph partitioning, singular value decomposition, spectral relaxation

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

2001-10-01T23:59:59.000Z

73

Introducing complete graphs in molecular connectivity studies  

Science Conference Proceedings (OSTI)

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

Lionello Pogliani

2005-01-01T23:59:59.000Z

74

Graph partitioning via recurrent multivalued neural networks  

Science Conference Proceedings (OSTI)

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

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

2005-06-01T23:59:59.000Z

75

Drawing graphs nicely using simulated annealing  

Science Conference Proceedings (OSTI)

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

Ron Davidson; David Harel

1996-10-01T23:59:59.000Z

76

Constrained Graph Optimization: Interdiction and Preservation Problems  

SciTech Connect

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

Schild, Aaron V [Los Alamos National Laboratory

2012-07-30T23:59:59.000Z

77

Happy Endings for Flip Graphs  

E-Print Network (OSTI)

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

unknown authors

2006-01-01T23:59:59.000Z

78

Happy Endings for Flip Graphs  

E-Print Network (OSTI)

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

David Eppstein

2007-01-01T23:59:59.000Z

79

Computing Information Value from RDF Graph Properties  

Science Conference Proceedings (OSTI)

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

al-Saffar, Sinan; Heileman, Gregory

2010-11-08T23:59:59.000Z

80

Special pages | Open Energy Information  

Open Energy Info (EERE)

property Semantic search Maps Map editor Other special pages Book sources Copy a page Duplicate a page Edit Count SparqlExtension Retrieved from "http:...

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

EERE: Page Not Found  

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

Site Search Search Help Page Not Found We're sorry, but the page you're looking for may have been removed, has changed, or is unavailable. To find the information you need, you may...

82

David Gates home page  

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

Gates home page http:www.pppl.gov%7EdgatesSiteDr.DavidA.Gates.html (1 of 4) 8302012 9:47:58 AM David Gates home page Dr. David A. Gates Princeton Plasma Physics...

83

Committee Home Page - TMS  

Science Conference Proceedings (OSTI)

The committee home pages are designed to facilitate communication among committee members while simultaneously educating all members about the ...

84

API Requirements for Dynamic Graph Prediction  

SciTech Connect

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

Gallagher, B; Eliassi-Rad, T

2006-10-13T23:59:59.000Z

85

SI Group Scheduling Page  

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

86

Mixture graph based semi-supervised dimensionality reduction  

Science Conference Proceedings (OSTI)

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

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

2010-12-01T23:59:59.000Z

87

LINEAR INEQUALITIES AMONG GRAPH INVARIANTS: USING ...  

E-Print Network (OSTI)

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

88

Graph algorithms in the titan toolkit.  

Science Conference Proceedings (OSTI)

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

McLendon, William Clarence, III; Wylie, Brian Neil

2009-10-01T23:59:59.000Z

89

A copositive programming approach to graph partitioning  

E-Print Network (OSTI)

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

90

3D in Web Pages  

Science Conference Proceedings (OSTI)

3D in Web Pages. This page is currently under construction! Return to Visualization. *. Bookmark and Share. Return to Visualization.

2011-12-05T23:59:59.000Z

91

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

Science Conference Proceedings (OSTI)

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

Robert Kincaid; Heidi Lam

2006-05-01T23:59:59.000Z

92

Multithreaded Algorithms for Graph Coloring  

SciTech Connect

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

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

2012-10-21T23:59:59.000Z

93

Feature Tracking Using Reeb Graphs  

Science Conference Proceedings (OSTI)

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

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

2010-08-02T23:59:59.000Z

94

Scalable modeling of real graphs using Kronecker multiplication  

Science Conference Proceedings (OSTI)

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

Jure Leskovec; Christos Faloutsos

2007-06-01T23:59:59.000Z

95

Generating random graphs with large girth  

Science Conference Proceedings (OSTI)

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

Mohsen Bayati; Andrea Montanari; Amin Saberi

2009-01-01T23:59:59.000Z

96

Collaborative robotic instruction: A graph teaching experience  

Science Conference Proceedings (OSTI)

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

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

2009-09-01T23:59:59.000Z

97

Inflo: collaborative reasoning via open calculation graphs  

Science Conference Proceedings (OSTI)

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

Jonathan Lung; Steve Easterbrook

2012-02-01T23:59:59.000Z

98

Anonymizing bipartite graph data using safe groupings  

Science Conference Proceedings (OSTI)

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

Graham Cormode; Divesh Srivastava; Ting Yu; Qing Zhang

2010-02-01T23:59:59.000Z

99

Expressing graph algorithms using generalized active messages  

Science Conference Proceedings (OSTI)

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

Nick Edmonds; Jeremiah Willcock; Andrew Lumsdaine

2013-08-01T23:59:59.000Z

100

Improved call graph comparison using simulated annealing  

Science Conference Proceedings (OSTI)

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

Orestis Kostakis; Joris Kinable; Hamed Mahmoudi; Kimmo Mustonen

2011-03-01T23:59:59.000Z

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

Graph mining: Laws, generators, and algorithms  

Science Conference Proceedings (OSTI)

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

Deepayan Chakrabarti; Christos Faloutsos

2006-06-01T23:59:59.000Z

102

Quantum Algorithms for Graph Problems -- A Survey  

E-Print Network (OSTI)

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

Sebastian Dörn

2006-01-01T23:59:59.000Z

103

Oriented unicyclic graphs with extremal skew energy  

E-Print Network (OSTI)

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

Yaoping, Hou; Chongyan, Zhang

2011-01-01T23:59:59.000Z

104

Bond Graph Modeling Of Variable Structure Systems  

E-Print Network (OSTI)

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

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

1995-01-01T23:59:59.000Z

105

Geothermal: Home Page  

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

GEOTHERMAL TECHNOLOGIES LEGACY COLLECTION - Home Page Geothermal Technologies Legacy Collection HelpFAQ | Site Map | Contact Us HomeBasic Search About Publications Advanced...

106

Activity Seven, Student Page  

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

Seven -- Picturing Particles (Student Page) Whether they are called atom smashers, accelerators or colliders, the massive devices used for research by particle physicists all...

107

Activity Four, Student Page  

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

Four -- Tracking Unseen Particles (Student Page) This experiment demonstrates how particle detectors work and why they are multi-layered, as shown in the cutaway and schematic...

108

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

Science Conference Proceedings (OSTI)

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

Avraham Ben-Aroya; Amnon Ta-Shma

2008-05-01T23:59:59.000Z

109

Related Frog Web Pages  

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

110

Bond graph modeling of centrifugal compressor system  

E-Print Network (OSTI)

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

Nur Uddin; Jan Tommy Gravdahl

2012-01-01T23:59:59.000Z

111

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

E-Print Network (OSTI)

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

Sopena, Eric

2010-01-01T23:59:59.000Z

112

Page not found | Department of Energy  

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

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

113

Page not found | Department of Energy  

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

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

114

Image segmentation by iterated region merging with localized graph cuts  

Science Conference Proceedings (OSTI)

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

Bo Peng; Lei Zhang; David Zhang; Jian Yang

2011-10-01T23:59:59.000Z

115

The depleted hydrogen atoms in chemical graph theory  

Science Conference Proceedings (OSTI)

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

Lionello Pogliani

2008-12-01T23:59:59.000Z

116

On the density of a graph and its blowup  

Science Conference Proceedings (OSTI)

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

Asaf Shapira; Raphael Yuster

2010-11-01T23:59:59.000Z

117

Theoretical underpinnings for maximal clique enumeration on perturbed graphs  

Science Conference Proceedings (OSTI)

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

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

2010-06-01T23:59:59.000Z

118

Graph Invariants and Large Cycles - a Survey  

E-Print Network (OSTI)

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

Nikoghosyan, Zh G

2010-01-01T23:59:59.000Z

119

Electronic tools for designing charts and graphs  

E-Print Network (OSTI)

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

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

1983-01-01T23:59:59.000Z

120

The Gram dimension of a graph  

E-Print Network (OSTI)

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

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

Continuous Time Group Discovery in Dynamic Graphs  

Science Conference Proceedings (OSTI)

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

Miller, K; Eliassi-Rad, T

2010-11-04T23:59:59.000Z

122

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

E-Print Network (OSTI)

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

Wojciechowski, Jerzy

123

Page 1 of2  

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

Page 1 of2 The DOE Executive Salary Approval parameters contained in AL2000-12 are hereby reinstated pending final issuance of revised DOE Order 350.1 X, Contractor Human Resources...

124

EERE: Multimedia Home Page  

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

on Digg Find More places to share EERE: Multimedia Home Page on AddThis.com... Home Animations Photographs Videos Audio Contacts On this site you'll find links to the animations,...

125

PSFCP -- Home Page  

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

find all documents that are related to this acquisition. List of Supporting Documents (weblink) http:www.directives.doe.gov To return to the Home Page, click on the NNSA logo....

126

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

127

EMIS Quick User Guide Search page (details on page 2)  

E-Print Network (OSTI)

search terms in foreign languages You can enter search terms in foreign languages by: - Using your: Please note that we have a Cyrillic and Arabic keyboards available through the Search page. EnteringEMIS Quick User Guide Search page (details on page 2) The News page: Access the latest news

Shoubridge, Eric

128

Improving accessibility to statistical graphs: the iGraph-Lite system  

Science Conference Proceedings (OSTI)

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

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

2007-10-01T23:59:59.000Z

129

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.

130

Aprun MAN Page  

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

131

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.

132

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

133

Main Page - NWChem  

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

134

On Demand Paging Using  

E-Print Network (OSTI)

The power consumption of the network interface plays a major role in determining the total operating lifetime of wireless handheld devices. On demand paging has been proposed earlier to reduce power consumption in cellular networks. In this scheme, a low power secondary radio is used to wake up the higher power radio, allowing the latter to sleep or remain off for longer periods of time. In this paper we present use of Bluetooth radios to serve as a paging channel for the 802.11 wireless LAN. We have implemented an on-demand paging scheme on a WLAN consisting of iPAQ PDAs equipped with Bluetooth radios and Cisco Aironet wireless networking cards. Our results show power saving ranging from 19% to 46% over the present 802.11b standard operating modes with negligible impact on performance.

Bluetooth Radios On; Yuvraj Agarwal; Rajesh K. Gupta

2003-01-01T23:59:59.000Z

135

GRAPHS AND (Z2) k-ACTIONS  

E-Print Network (OSTI)

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

Zhi L Ü

2005-01-01T23:59:59.000Z

136

Graph clustering with network structure indices  

E-Print Network (OSTI)

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

Matthew J. Rattigan; Marc Maier; David Jensen

2007-01-01T23:59:59.000Z

137

Subgraphs of quasi-random oriented graphs  

E-Print Network (OSTI)

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

Amini, Omid; Huc, Florian

2009-01-01T23:59:59.000Z

138

21 briefing pages total  

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

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

139

Graph Algorithms in the Internet Age  

E-Print Network (OSTI)

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

Stanton, Isabelle Lesley

2012-01-01T23:59:59.000Z

140

A Spectral Algorithm for Improving Graph Partitions  

E-Print Network (OSTI)

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

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

An empirical comparison of some approximate methods for graph coloring  

Science Conference Proceedings (OSTI)

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

Israel Rebollo-Ruiz; Manuel Graña

2012-03-01T23:59:59.000Z

142

Sequoia tops Graph 500 list of 'big data' supercomputers  

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

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

143

Long alternating cycles in edge-colored complete graphs  

Science Conference Proceedings (OSTI)

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

Hao Li; Guanghui Wang; Shan Zhou

2007-08-01T23:59:59.000Z

144

Using constraints to achieve stability in automatic graph layout algorithms  

Science Conference Proceedings (OSTI)

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

Karl-Friedrich Böhringer; Frances Newbery Paulisch

1990-03-01T23:59:59.000Z

145

Efficient algorithms for graph all-matching and containment search.  

E-Print Network (OSTI)

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

Zhu, Gaoping

2012-01-01T23:59:59.000Z

146

The cost of monotonicity in distributed graph searching  

E-Print Network (OSTI)

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

Ilcinkas, David

147

The cost of monotonicity in distributed graph searching  

E-Print Network (OSTI)

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

Paris-Sud XI, Université de

148

FASTEST MIXING MARKOV CHAIN ON GRAPHS WITH SYMMETRIES  

E-Print Network (OSTI)

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

Xiao, Lin

149

Computing maximum non-crossing matching in convex bipartite graphs  

Science Conference Proceedings (OSTI)

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

Danny Z. Chen; Xiaomin Liu; Haitao Wang

2012-05-01T23:59:59.000Z

150

Synchrophasor Technologies Page ii  

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

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

151

CHAPTER CONTENTS Section Page  

E-Print Network (OSTI)

CHAPTER CONTENTS Section Page 13.1 Wooded Wetland Monitoring 13.1-1 13.2 Landfill Soils Gas Left Blank #12;Data Quality Objectives ­ Landfill Gas and Surface Leachate Monitoring Environmental Surveillance X Restoration #12;Data Quality Objectives - Landfill Gas and Surface Leachate Monitoring 13

Homes, Christopher C.

152

A hybrid parallel genetic algorithm approach for graph coloring  

Science Conference Proceedings (OSTI)

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

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

2005-08-01T23:59:59.000Z

153

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

E-Print Network (OSTI)

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

154

Hamiltonian Graphs and the Traveling Salesman Problem  

E-Print Network (OSTI)

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

Dhananjay P. Mehendale

2007-04-27T23:59:59.000Z

155

Multilevel heuristic algorithm for graph partitioning  

Science Conference Proceedings (OSTI)

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

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

2003-04-01T23:59:59.000Z

156

Exploiting graph properties of game trees  

Science Conference Proceedings (OSTI)

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

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

1996-08-01T23:59:59.000Z

157

Suggesting friends using the implicit social graph  

Science Conference Proceedings (OSTI)

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

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

2010-07-01T23:59:59.000Z

158

Graph clustering with network structure indices  

Science Conference Proceedings (OSTI)

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

Matthew J. Rattigan; Marc Maier; David Jensen

2007-06-01T23:59:59.000Z

159

Grid smoothing: a graph-based approach  

Science Conference Proceedings (OSTI)

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

Guillaume Noel; Karim Djouani; Yskandar Hamam

2010-11-01T23:59:59.000Z

160

Graph grammars with string-regulated rewriting  

Science Conference Proceedings (OSTI)

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

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

2011-10-01T23:59:59.000Z

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

Computing role assignments of chordal graphs  

Science Conference Proceedings (OSTI)

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

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

2009-09-01T23:59:59.000Z

162

Diagnosability of star graphs with missing edges  

Science Conference Proceedings (OSTI)

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

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

2012-04-01T23:59:59.000Z

163

Quantum secret sharing with qudit graph states  

Science Conference Proceedings (OSTI)

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

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

2010-12-15T23:59:59.000Z

164

Quantum secret sharing with qudit graph states  

E-Print Network (OSTI)

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

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

2010-04-26T23:59:59.000Z

165

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

166

A graph based method for faster display for distribution networks  

Science Conference Proceedings (OSTI)

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

Mansoor Al-A'ali

2008-06-01T23:59:59.000Z

167

Kinetic and stationary point-set embeddability for plane graphs  

Science Conference Proceedings (OSTI)

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

Zahed Rahmati; Sue H. Whitesides; Valerie King

2012-09-01T23:59:59.000Z

168

Modeling molecular polarizabilities with graph-theoretical concepts  

Science Conference Proceedings (OSTI)

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

Lionello Pogliani

2004-12-01T23:59:59.000Z

169

Discovering informative connection subgraphs in multi-relational graphs  

Science Conference Proceedings (OSTI)

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

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

2005-12-01T23:59:59.000Z

170

EERE: Clean Cities Home Page  

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

Cities Printable Version Share this resource Send a link to EERE: Clean Cities Home Page to someone by E-mail Share EERE: Clean Cities Home Page on Facebook Tweet about EERE: Clean...

171

Image segmentation using quadtree-based similarity graph and normalized cut  

Science Conference Proceedings (OSTI)

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

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

2010-11-01T23:59:59.000Z

172

Jon Borwein's Home Page - CECM  

E-Print Network (OSTI)

Math Research Group. CECM - our Centre. a SunTREC site. Pacific Institute. Jonathan Borwein's Personal Page. Medical Images ...

173

THIS PAGE INTENTIONALLY LEFT BLANK  

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

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

174

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

175

WIPP Home Page header  

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

176

Activity Six, Student Page  

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

177

Page1of3  

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

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

178

Activity Three, Student Page  

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

179

StreamWorks - A system for Dynamic Graph Search  

Science Conference Proceedings (OSTI)

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

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

2013-06-11T23:59:59.000Z

180

Maker Can Construct a Sparse Graph on a Small Board  

E-Print Network (OSTI)

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

Gebauer, Heidi

2010-01-01T23:59:59.000Z

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

Page 1 of 2  

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

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:

182

Implementing Graph Pattern Queries on a Relational Database  

Science Conference Proceedings (OSTI)

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

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

2007-12-26T23:59:59.000Z

183

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

184

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

185

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

186

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

187

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

188

Page not found | Department of Energy  

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

Download Solar Background Document 5 Graph illustrating Chinese Development Bank financing to Chinese solar companies. http:energy.govdownloads...

189

Visibility graph analysis of solar wind velocity  

E-Print Network (OSTI)

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

Suyal, Vinita; Singh, Harinder P

2013-01-01T23:59:59.000Z

190

A Concatenational Graph Evolution Aging Model  

Science Conference Proceedings (OSTI)

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

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

2012-11-01T23:59:59.000Z

191

Graph operations that are good for greedoids  

Science Conference Proceedings (OSTI)

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

Vadim E. Levit; Eugen Mandrescu

2010-07-01T23:59:59.000Z

192

On a base exchange game on graphs  

E-Print Network (OSTI)

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

Stephan Dominique Andres; Winfried Hochstättler; Markus Merkel

2010-01-01T23:59:59.000Z

193

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

194

Modeling and Analysis of Time-Varying Graphs  

E-Print Network (OSTI)

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

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

2010-01-01T23:59:59.000Z

195

Strict inequalities for connective constants of transitive graphs  

E-Print Network (OSTI)

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

Geoffrey R. Grimmett; Zhongyang Li

2013-01-14T23:59:59.000Z

196

Hosting Web Pages at NERSC  

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

Hosting Webpages Hosting Webpages While PDSF no longer provides a webserver for its users webpages can be hosted from NGF. To do this put your pages under projectprojectdirs...

197

EERE: Energy Analysis Home Page  

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

Analysis Search Search Help Energy Analysis HOME ABOUT FEATURED CONTENT EERE Energy Analysis Printable Version Share this resource Send a link to EERE: Energy Analysis Home Page...

198

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

199

NSLS-II Project Pages  

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

NSLS-II Project Pages Project Management Team Project Schedule Integrated Project Team (IPT) Monthly Status Meetings Advisory Committees Project Reviews Documents NSLS-II...

200

TMS Jobs and Careers Page  

Science Conference Proceedings (OSTI)

For information about purchasing classified advertising in JOM, visit the journal's advertising page or reserve a classified space by submitting the Classified ...

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

(Continued on page 2) (Continued on page 2)  

E-Print Network (OSTI)

MAY 2009 (Continued on page 2) (Continued on page 2) WWW.RSMAS.MIAMI.EDU DEAN OTIS BROWN: A LEGACY of his decades of service and dedication to the University of Miami, Brown was awarded the UM Presidents in 2003, the University of Miami Presidents Medal honors individuals for their outstanding leadership

Miami, University of

202

Page 1 of 4 Pages Faculty of Law  

E-Print Network (OSTI)

Page 1 of 4 Pages Faculty of Law FINAL EXAMINATION - APRIL 2003 543:B1 BASIC OIL & GAS LAW (Percy and natural gas lease with Stewart Exploration. The lease included the following terms: To Have And Enjoy, or production of the leased substances or any of them (whether or not in #12;543:A1 BASIC OIL & GAS LAW (Percy

MacMillan, Andrew

203

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

Science Conference Proceedings (OSTI)

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

Jacob Fox; János Pach

2008-06-01T23:59:59.000Z

204

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

Science Conference Proceedings (OSTI)

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

Satoru Watanabe; Satoshi Okawa

2006-03-01T23:59:59.000Z

205

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

Science Conference Proceedings (OSTI)

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

Albert Solé-Ribalta; Francesc Serratosa

2010-08-01T23:59:59.000Z

206

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

E-Print Network (OSTI)

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

207

New Benchmark Instances for the Steiner Problem in Graphs  

E-Print Network (OSTI)

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

208

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

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

209

Joint Spectral Radius and Path-Complete Graph Lyapunov Functions  

E-Print Network (OSTI)

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

210

Finding good nearly balanced cuts in power law graphs  

E-Print Network (OSTI)

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

211

RMOTC - Articles - Page 2  

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

212

WIPP Stakeholder Information Page  

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

213

Page 1 of 2  

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

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

214

TVDG Home Page  

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

215

Combinatorial mobile IP: a new efficient mobility management using minimized paging and local registration  

E-Print Network (OSTI)

Abstract. Combinatorial Mobile IP, a new mobility management scheme for Mobile IP, is proposed and analyzed. We present how to adopt mobility management schemes on cellular networks and adapt them in Mobile IP without disrupting the nature of the Internet. We apply widely used mobility management schemes such as hierarchical architecture and paging in cellular networks to Mobile IP. We restrict paging to the area that has to be paged using local registrations. In this way, we show that the total signaling costs of Combinatorial Mobile IP are reduced compared to other micro-mobility protocols such as Mobile IP Regional Registration and P-MIP. Random walk on a connected graph is used to analyze the performance of Combinatorial Mobile IP.

Taehwan Choi; Laeyoung Kim; Jeongeun Nah; Jooseok Song

2004-01-01T23:59:59.000Z

216

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

217

Page 1 of 3 INSTRUCTIONS  

E-Print Network (OSTI)

/Dean Alts · Click . · Enter SHARE for SetID if not prepopulated. · Search for and select the OMNI Userid/29/2008 The terms "Chair" and "Dean" are used generically to represent unit hierarchy. A new page (Grants. #12;Page 2 of 3 · Do not change Eff Date or Status. · Search for and select the OMNI Userid

McQuade, D. Tyler

218

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

219

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

Science Conference Proceedings (OSTI)

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

Darrel R. Davis

2011-09-01T23:59:59.000Z

220

Noisy evolution of graph-state entanglement  

Science Conference Proceedings (OSTI)

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

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

2010-09-15T23:59:59.000Z

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

On bounding the bandwidth of graphs with symmetry  

E-Print Network (OSTI)

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

222

Cell-graph modeling of salivary gland morphology  

Science Conference Proceedings (OSTI)

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

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

2010-04-01T23:59:59.000Z

223

On the connectivity of extremal Ramsey graphs Andrew Beveridge  

E-Print Network (OSTI)

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

Pikhurko, Oleg

224

Commute-time convolution kernels for graph clustering  

Science Conference Proceedings (OSTI)

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

Normawati A. Rahman; Edwin R. Hancock

2010-08-01T23:59:59.000Z

225

Analyzing uncertainty in TG protection graphs with TG/MC  

Science Conference Proceedings (OSTI)

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

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

2010-09-01T23:59:59.000Z

226

Exclusivity structures and graph representatives of local complementation orbits  

E-Print Network (OSTI)

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

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

2012-11-18T23:59:59.000Z

227

Detecting research topics via the correlation between graphs and texts  

Science Conference Proceedings (OSTI)

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

Yookyung Jo; Carl Lagoze; C. Lee Giles

2007-08-01T23:59:59.000Z

228

Quantum graphs where back-scattering is prohibited  

E-Print Network (OSTI)

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

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

2007-08-06T23:59:59.000Z

229

Quantum graphs: an introduction and a brief survey  

E-Print Network (OSTI)

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

Peter Kuchment

2008-02-23T23:59:59.000Z

230

Embedding of hypercubes into necklace, windmill and snake graphs  

Science Conference Proceedings (OSTI)

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

Indra Rajasingh; Bharati Rajan; R. Sundara Rajan

2012-06-01T23:59:59.000Z

231

Page not found | Department of Energy  

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

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

232

Page not found | Department of Energy  

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

Error message The page you requested does not exist. For your convenience, a search was performed using the query Flash2009 26Attachment2. You are here Home Page not found Page...

233

Page not found | Department of Energy  

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

Error message The page you requested does not exist. For your convenience, a search was performed using the query Flash2009 30. You are here Home Page not found Page not found...

234

Page not found | Department of Energy  

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

Error message The page you requested does not exist. For your convenience, a search was performed using the query Flash2010 25. You are here Home Page not found Page not found...

235

Page not found | Department of Energy  

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

Error message The page you requested does not exist. For your convenience, a search was performed using the query AttachmentFlash2010 55. You are here Home Page not found Page...

236

On Characterizing Game-Perfect Graphs by Forbidden Induced Subgraphs  

E-Print Network (OSTI)

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

Stephan Dominique Andres

2010-01-01T23:59:59.000Z

237

Horizontal Visibility graphs generated by type-II intermittency  

E-Print Network (OSTI)

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

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

2013-10-02T23:59:59.000Z

238

An Experiment on Graph Analysis Methodologies for Scenarios  

Science Conference Proceedings (OSTI)

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

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

2005-09-30T23:59:59.000Z

239

Web Page Error 500 Page Cannot Be Displayed  

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

240

Web Page Error 404.1 Page Cannot be Found  

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

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

LInC Engaged Learning Home Page  

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

for completing. As you work through these pages, you may need Web authoring skills and file transfer skills. Refer to our Technology Home Page for guidance and...

242

Page not found | Department of Energy  

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

national-parks-move-transportation-forward-america-s-great-outdoors Page HRP Handbook Glossary... http:energy.govhsshrp-handbook-11 Page InspectionSampling Schedule Note:...

243

Links to Muon Collider Related Web Pages  

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

Muon Collider related web pages: Muon Collider Feasibility Study ... Fermilab Page MUCOOL Collaboration: Ionization Cooling R&D Snowmass 1996 Feasibility Study Book Brookhaven Muon...

244

Home > Households, Buildings & Industry > Energy Efficiency Page ...  

U.S. Energy Information Administration (EIA)

Home > Households, Buildings & Industry > Energy Efficiency Page > Energy Intensities >Table 7a Glossary U.S. Residential Housing Primary Page Last Revised: July 2009

245

Household Vehicles Energy Use Cover Page  

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

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

246

Home > Households, Buildings & Industry > Energy Efficiency Page ...  

U.S. Energy Information Administration (EIA)

Home > Households, Buildings & Industry > Energy Efficiency Page > Energy Intensities > Table 5c Glossary U.S. Residential Housing Site Page Last Revised: July 2009

247

Page not found | Department of Energy  

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

21 - 4030 of 9,178 results. Page Windows Public Tools Windows http:energy.govciowindows-public-tools Page Utilities Below are resources for Tribes about utilities. http:...

248

Page not found | Department of Energy  

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

Download Solar Background Document 4 Graph illustrating global distribution of solar manufacturing market share from 1990 to 2010. http:energy.govdownloads...

249

Quantum query complexity of some graph problems  

E-Print Network (OSTI)

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

Christoph Durr; Mark Heiligman; Peter Hoyer; Mehdi Mhalla

2004-01-15T23:59:59.000Z

250

Efficient broadcast on random geometric graphs  

Science Conference Proceedings (OSTI)

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

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

2009-01-01T23:59:59.000Z

251

Basic EETD Web Page Design  

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

Basic EETD Web Page Design Speaker(s): Eve Edelson Date: May 27, 2005 - 12:00pm Location: Bldg. 90 Seminar HostPoint of Contact: Allan Chen This talk will provide information...

252

SSRL Accelerator Phycics Home Page  

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

(29047 bytes) ICFA2000t.gif (31362 bytes) Home Page LCLS Accelerator Physics at SSRL The field tha t can be covered by the Accelerator Physics activities at SSRL is limited...

253

Next Linear Collider Home Page  

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

Welcome to the Next Linear Collider NLC Home Page If you would like to learn about linear colliders in general and about this next-generation linear collider project's mission,...

254

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

255

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) Very the mechanical deformations of the mirror's surface are minimized. 3) SiC is a low activation material, so

Tillack, Mark

256

St. Jude Medical utvecklar medicinsk teknik och tjnster som ger mer kontroll t dem som behandlar patienter med kardiologiska och neurologiska sjukdomar  

E-Print Network (OSTI)

St. Jude Medical utvecklar medicinsk teknik och tjänster som ger mer kontroll åt dem som behandlar. Jude Medical:s forskningsstipendium 2011 Stipendiets ändamål är att främja medicinteknisk innovation Sista ansökningsdag är 17 juni 2011 St. Jude Medical develops medical technology and services that focus

257

This book is about fluids containing polyatomic structures such as poly-mer molecules or colloidal grains. Such structured fluids have come to be  

E-Print Network (OSTI)

Preface This book is about fluids containing polyatomic structures such as poly- mer molecules or colloidal grains. Such structured fluids have come to be known as soft condensed matter. The book takes this scaling approach. The book focusses on how to account in the simplest way for the distinctive length, time

Witten, Thomas A.

258

A sequential growth dynamics for a directed acyclic dyadic graph  

E-Print Network (OSTI)

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

Alexey L. Krugly

2011-12-05T23:59:59.000Z

259

Nested cycles in large triangulations and crossing-critical graphs  

E-Print Network (OSTI)

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

Hernandez-Velez, Cesar; Thomas, Robin

2009-01-01T23:59:59.000Z

260

The Graph Laplacian and the Dynamics of Complex Networks  

SciTech Connect

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

Thulasidasan, Sunil [Los Alamos National Laboratory

2012-06-11T23:59:59.000Z

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

Technical Report Documentation Page 1. Report No.  

E-Print Network (OSTI)

Database (eGRID) #12;Page 2 A calcium chloride solution concentrates (regenerates) while passing over

Texas at Austin, University of

262

Effective criteria for web page changes  

Science Conference Proceedings (OSTI)

A number of similarity metrics have been used to measure the degree of web page changes in the literature. In this paper, we define criteria for web page changes to evaluate the effectiveness of the metrics. Using real web pages and synthesized pages, ...

Shin Young Kwon; Sang Ho Lee; Sung Jin Kim

2006-01-01T23:59:59.000Z

263

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

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

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

264

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

Science Conference Proceedings (OSTI)

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

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

1998-03-01T23:59:59.000Z

265

A graph-theoretic model of lexical syntactic acquisition  

Science Conference Proceedings (OSTI)

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

Hinrich Schütze; Michael Walsh

2008-10-01T23:59:59.000Z

266

Effective Graph Clustering for Path Queries in Digital Map Databases  

E-Print Network (OSTI)

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

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

1996-01-01T23:59:59.000Z

267

Chip-Firing and Rotor-Routing on Directed Graphs  

E-Print Network (OSTI)

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

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

2008-01-01T23:59:59.000Z

268

Graph-Theoretic Techniques for Web Content Mining  

Science Conference Proceedings (OSTI)

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

Adam Schenker; Horst Bunke; Mark Last; Abraham Kandel

2005-05-01T23:59:59.000Z

269

Geometry of loop quantum gravity on a graph  

SciTech Connect

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

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

2010-08-15T23:59:59.000Z

270

Investigation of bond graphs for nuclear reactor simulations  

E-Print Network (OSTI)

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

Sosnovsky, Eugeny

2010-01-01T23:59:59.000Z

271

Parallel Algorithms for Graph Optimization using Tree Decompositions  

SciTech Connect

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

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

2012-06-01T23:59:59.000Z

272

Modelling structured domains using description graphs and logic programming  

Science Conference Proceedings (OSTI)

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

Despoina Magka; Boris Motik; Ian Horrocks

2012-05-01T23:59:59.000Z

273

Interactive searching and visualization of patterns in attributed graphs  

Science Conference Proceedings (OSTI)

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

Pierre-Yves Koenig; Faraz Zaidi; Daniel Archambault

2010-05-01T23:59:59.000Z

274

Temporally Scalable Visual SLAM using a Reduced Pose Graph  

E-Print Network (OSTI)

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

Johannsson, Hordur

2012-05-25T23:59:59.000Z

275

On electric resistances for distance-regular graphs  

E-Print Network (OSTI)

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

Koolen, Jack; Park, Jongyook

2011-01-01T23:59:59.000Z

276

Confusability graphs for symmetric sets of quantum states  

E-Print Network (OSTI)

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

Giulio Chiribella; Yuxiang Yang

2013-01-07T23:59:59.000Z

277

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

278

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

Science Conference Proceedings (OSTI)

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

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

2010-07-01T23:59:59.000Z

279

EMIS Quick User Guide Search page (details on page 2)  

E-Print Network (OSTI)

search terms in foreign languages You can enter search terms in foreign languages by: - Using your: Please note that we have a Cyrillic and Arabic keyboards available through the Search page. Entering. For example, to search for articles published between February 01, 2006 and May 30, 2006 enter the following

Shoubridge, Eric

280

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

Science Conference Proceedings (OSTI)

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

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

2012-09-15T23:59:59.000Z

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

Page not found | Department of Energy  

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

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

282

Recognition driven page orientation detection  

Science Conference Proceedings (OSTI)

In document image recognition, orientation detection of the scanned page is necessary for the following procedures to work correctly as they assume that the text is well oriented. Several methods have been proposed, but most of them rely on heuristics ... Keywords: document image processing, image orientation analysis, optical character recognition

Yves Rangoni; Faisal Shafait; Joost Van Beusekom; Thomas M. Breuel

2009-11-01T23:59:59.000Z

283

(continued on page 4) Introduction  

E-Print Network (OSTI)

Survey (USGS). Two separate film formats were acquired, including black-and-white aerial photography Survey The tradition of systematic collection of federal aerial photography has been maintained(continued on page 4) Introduction First-time statewide coverage of vertical aerial photography

Frank, Thomas D.

284

Pages that link to "Biofuel Solutions" | Open Energy Information  

Open Energy Info (EERE)

Edit History Share this page on Facebook icon Twitter icon Pages that link to "Biofuel Solutions" Biofuel Solutions Jump to: navigation, search What links here Page:...

285

Pages that link to "Crouch, Idaho" | Open Energy Information  

Open Energy Info (EERE)

History Share this page on Facebook icon Twitter icon Pages that link to "Crouch, Idaho" Crouch, Idaho Jump to: navigation, search What links here Page: Crouch, Idaho...

286

Pages that link to "Aberdeen, Idaho" | Open Energy Information  

Open Energy Info (EERE)

Share this page on Facebook icon Twitter icon Pages that link to "Aberdeen, Idaho" Aberdeen, Idaho Jump to: navigation, search What links here Page: Aberdeen, Idaho...

287

Pages that link to "Bonners Ferry, Idaho" | Open Energy Information  

Open Energy Info (EERE)

Share this page on Facebook icon Twitter icon Pages that link to "Bonners Ferry, Idaho" Bonners Ferry, Idaho Jump to: navigation, search What links here Page: Bonners...

288

Pages that link to "Caldwell, Idaho" | Open Energy Information  

Open Energy Info (EERE)

Share this page on Facebook icon Twitter icon Pages that link to "Caldwell, Idaho" Caldwell, Idaho Jump to: navigation, search What links here Page: Caldwell, Idaho...

289

Pages that link to "Blackfoot, Idaho" | Open Energy Information  

Open Energy Info (EERE)

Share this page on Facebook icon Twitter icon Pages that link to "Blackfoot, Idaho" Blackfoot, Idaho Jump to: navigation, search What links here Page: Blackfoot,...

290

Pages that link to "Arco, Idaho" | Open Energy Information  

Open Energy Info (EERE)

History Share this page on Facebook icon Twitter icon Pages that link to "Arco, Idaho" Arco, Idaho Jump to: navigation, search What links here Page: Arco, Idaho...

291

Pages that link to "Camas County, Idaho" | Open Energy Information  

Open Energy Info (EERE)

Share this page on Facebook icon Twitter icon Pages that link to "Camas County, Idaho" Camas County, Idaho Jump to: navigation, search What links here Page: Camas...

292

Pages that link to "Banks, Idaho" | Open Energy Information  

Open Energy Info (EERE)

History Share this page on Facebook icon Twitter icon Pages that link to "Banks, Idaho" Banks, Idaho Jump to: navigation, search What links here Page: Banks, Idaho...

293

Pages that link to "Arbon Valley, Idaho" | Open Energy Information  

Open Energy Info (EERE)

Share this page on Facebook icon Twitter icon Pages that link to "Arbon Valley, Idaho" Arbon Valley, Idaho Jump to: navigation, search What links here Page: Arbon...

294

Pages that link to "American Falls, Idaho" | Open Energy Information  

Open Energy Info (EERE)

Share this page on Facebook icon Twitter icon Pages that link to "American Falls, Idaho" American Falls, Idaho Jump to: navigation, search What links here Page: American...

295

Pages that link to "Arimo, Idaho" | Open Energy Information  

Open Energy Info (EERE)

History Share this page on Facebook icon Twitter icon Pages that link to "Arimo, Idaho" Arimo, Idaho Jump to: navigation, search What links here Page: Arimo, Idaho...

296

Pages that link to "Bonner County, Idaho" | Open Energy Information  

Open Energy Info (EERE)

Share this page on Facebook icon Twitter icon Pages that link to "Bonner County, Idaho" Bonner County, Idaho Jump to: navigation, search What links here Page: Bonner...

297

Pages that link to "Ashton, Idaho" | Open Energy Information  

Open Energy Info (EERE)

History Share this page on Facebook icon Twitter icon Pages that link to "Ashton, Idaho" Ashton, Idaho Jump to: navigation, search What links here Page: Ashton, Idaho...

298

Pages that link to "Cascade, Idaho" | Open Energy Information  

Open Energy Info (EERE)

Share this page on Facebook icon Twitter icon Pages that link to "Cascade, Idaho" Cascade, Idaho Jump to: navigation, search What links here Page: Cascade, Idaho...

299

Pages that link to "Basalt, Idaho" | Open Energy Information  

Open Energy Info (EERE)

History Share this page on Facebook icon Twitter icon Pages that link to "Basalt, Idaho" Basalt, Idaho Jump to: navigation, search What links here Page: Basalt, Idaho...

300

Pages that link to "Clayton, Idaho" | Open Energy Information  

Open Energy Info (EERE)

Share this page on Facebook icon Twitter icon Pages that link to "Clayton, Idaho" Clayton, Idaho Jump to: navigation, search What links here Page: Clayton, Idaho...

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

Pages that link to "Idaho Wind Energy" | Open Energy Information  

Open Energy Info (EERE)

Edit History Share this page on Facebook icon Twitter icon Pages that link to "Idaho Wind Energy" Idaho Wind Energy Jump to: navigation, search What links here Page:...

302

Pages that link to "Athol, Idaho" | Open Energy Information  

Open Energy Info (EERE)

History Share this page on Facebook icon Twitter icon Pages that link to "Athol, Idaho" Athol, Idaho Jump to: navigation, search What links here Page: Athol, Idaho...

303

Pages that link to "Ammon, Idaho" | Open Energy Information  

Open Energy Info (EERE)

History Share this page on Facebook icon Twitter icon Pages that link to "Ammon, Idaho" Ammon, Idaho Jump to: navigation, search What links here Page: Ammon, Idaho...

304

Pages that link to "Atomic City, Idaho" | Open Energy Information  

Open Energy Info (EERE)

Share this page on Facebook icon Twitter icon Pages that link to "Atomic City, Idaho" Atomic City, Idaho Jump to: navigation, search What links here Page: Atomic City,...

305

Pages that link to "Chubbuck, Idaho" | Open Energy Information  

Open Energy Info (EERE)

Share this page on Facebook icon Twitter icon Pages that link to "Chubbuck, Idaho" Chubbuck, Idaho Jump to: navigation, search What links here Page: Chubbuck, Idaho...

306

Pages that link to "Council, Idaho" | Open Energy Information  

Open Energy Info (EERE)

Share this page on Facebook icon Twitter icon Pages that link to "Council, Idaho" Council, Idaho Jump to: navigation, search What links here Page: Council, Idaho...

307

Pages that link to "Albion, Idaho" | Open Energy Information  

Open Energy Info (EERE)

History Share this page on Facebook icon Twitter icon Pages that link to "Albion, Idaho" Albion, Idaho Jump to: navigation, search What links here Page: Albion, Idaho...

308

Pages that link to "Clearwater County, Idaho" | Open Energy Informatio...  

Open Energy Info (EERE)

this page on Facebook icon Twitter icon Pages that link to "Clearwater County, Idaho" Clearwater County, Idaho Jump to: navigation, search What links here Page:...

309

Pages that link to "Castleford, Idaho" | Open Energy Information  

Open Energy Info (EERE)

Share this page on Facebook icon Twitter icon Pages that link to "Castleford, Idaho" Castleford, Idaho Jump to: navigation, search What links here Page: Castleford,...

310

Pages that link to "Carey, Idaho" | Open Energy Information  

Open Energy Info (EERE)

History Share this page on Facebook icon Twitter icon Pages that link to "Carey, Idaho" Carey, Idaho Jump to: navigation, search What links here Page: Carey, Idaho...

311

Pages that link to "Bliss, Idaho" | Open Energy Information  

Open Energy Info (EERE)

History Share this page on Facebook icon Twitter icon Pages that link to "Bliss, Idaho" Bliss, Idaho Jump to: navigation, search What links here Page: Bliss, Idaho...

312

Pages that link to "Clark County, Idaho" | Open Energy Information  

Open Energy Info (EERE)

Share this page on Facebook icon Twitter icon Pages that link to "Clark County, Idaho" Clark County, Idaho Jump to: navigation, search What links here Page: Clark...

313

Pages that link to "Challis, Idaho" | Open Energy Information  

Open Energy Info (EERE)

Share this page on Facebook icon Twitter icon Pages that link to "Challis, Idaho" Challis, Idaho Jump to: navigation, search What links here Page: Challis, Idaho...

314

Pages that link to "Bloomington, Idaho" | Open Energy Information  

Open Energy Info (EERE)

Share this page on Facebook icon Twitter icon Pages that link to "Bloomington, Idaho" Bloomington, Idaho Jump to: navigation, search What links here Page: Bloomington,...

315

Pages that link to "Bovill, Idaho" | Open Energy Information  

Open Energy Info (EERE)

History Share this page on Facebook icon Twitter icon Pages that link to "Bovill, Idaho" Bovill, Idaho Jump to: navigation, search What links here Page: Bovill, Idaho...

316

Pages that link to "Burley, Idaho" | Open Energy Information  

Open Energy Info (EERE)

History Share this page on Facebook icon Twitter icon Pages that link to "Burley, Idaho" Burley, Idaho Jump to: navigation, search What links here Page: Burley, Idaho...

317

Pages that link to "Bellevue, Idaho" | Open Energy Information  

Open Energy Info (EERE)

Share this page on Facebook icon Twitter icon Pages that link to "Bellevue, Idaho" Bellevue, Idaho Jump to: navigation, search What links here Page: Bellevue, Idaho...

318

Pages that link to "Bruneau, Idaho" | Open Energy Information  

Open Energy Info (EERE)

Share this page on Facebook icon Twitter icon Pages that link to "Bruneau, Idaho" Bruneau, Idaho Jump to: navigation, search What links here Page: Bruneau, Idaho...

319

Pages that link to "Cambridge, Idaho" | Open Energy Information  

Open Energy Info (EERE)

Share this page on Facebook icon Twitter icon Pages that link to "Cambridge, Idaho" Cambridge, Idaho Jump to: navigation, search What links here Page: Cambridge,...

320

Pages that link to "Bancroft, Idaho" | Open Energy Information  

Open Energy Info (EERE)

Share this page on Facebook icon Twitter icon Pages that link to "Bancroft, Idaho" Bancroft, Idaho Jump to: navigation, search What links here Page: Bancroft, Idaho...

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

Pages that link to "Almo, Idaho" | Open Energy Information  

Open Energy Info (EERE)

History Share this page on Facebook icon Twitter icon Pages that link to "Almo, Idaho" Almo, Idaho Jump to: navigation, search What links here Page: Almo, Idaho...

322

Pages that link to "Qinghai Lighting Ltd" | Open Energy Information  

Open Energy Info (EERE)

Share this page on Facebook icon Twitter icon Pages that link to "Qinghai Lighting Ltd" Qinghai Lighting Ltd Jump to: navigation, search What links here Page:...

323

Pages that link to "Ningbo Liaoyuan Lighting Co" | Open Energy...  

Open Energy Info (EERE)

this page on Facebook icon Twitter icon Pages that link to "Ningbo Liaoyuan Lighting Co" Ningbo Liaoyuan Lighting Co Jump to: navigation, search What links here Page:...

324

Pages that link to "Solar lighting" | Open Energy Information  

Open Energy Info (EERE)

History Share this page on Facebook icon Twitter icon Pages that link to "Solar lighting" Solar lighting Jump to: navigation, search What links here Page: Solar lighting...

325

Pages that link to "Hydrogen Energy Data Book" | Open Energy...  

Open Energy Info (EERE)

this page on Facebook icon Twitter icon Pages that link to "Hydrogen Energy Data Book" Hydrogen Energy Data Book Jump to: navigation, search What links here Page:...

326

Pages that link to "Geothermal/Environment" | Open Energy Information  

Open Energy Info (EERE)

Share this page on Facebook icon Twitter icon Pages that link to "GeothermalEnvironment" GeothermalEnvironment Jump to: navigation, search What links here Page:...

327

Pages that link to "Coal Mining (Iowa)" | Open Energy Information  

Open Energy Info (EERE)

Edit History Share this page on Facebook icon Twitter icon Pages that link to "Coal Mining (Iowa)" Coal Mining (Iowa) Jump to: navigation, search What links here Page:...

328

Pages that link to "Boardman, Oregon" | Open Energy Information  

Open Energy Info (EERE)

Edit History Share this page on Facebook icon Twitter icon Pages that link to "Boardman, Oregon" Boardman, Oregon Jump to: navigation, search What links here Page:...

329

Pages that link to "Boardman, Ohio" | Open Energy Information  

Open Energy Info (EERE)

Edit History Share this page on Facebook icon Twitter icon Pages that link to "Boardman, Ohio" Boardman, Ohio Jump to: navigation, search What links here Page: Boardman,...

330

Pages that link to "Bioethanol Limited" | Open Energy Information  

Open Energy Info (EERE)

Edit History Share this page on Facebook icon Twitter icon Pages that link to "Bioethanol Limited" Bioethanol Limited Jump to: navigation, search What links here Page:...

331

Pages that link to "Energy Savings Store" | Open Energy Information  

Open Energy Info (EERE)

Page Edit History Share this page on Facebook icon Twitter icon Pages that link to "Energy Savings Store" Energy Savings Store Jump to: navigation, search What links here...

332

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 +

333

Winter 2001 LInC Home Page  

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

and Folder Naming Guidelines (TS 80) Configuring your Web Editor (TS 75) Web Editor Animations (Dreamweaver, Composer, FrontPage, PageMill) Staff Development Plan LInC Partnership...

334

EERE: Fuel Cell Technologies Office Home Page  

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

Office Printable Version Share this resource Send a link to EERE: Fuel Cell Technologies Office Home Page to someone by E-mail Share EERE: Fuel Cell Technologies Office Home Page...

335

EERE: Building Technologies Office Home Page  

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

Office Printable Version Share this resource Send a link to EERE: Building Technologies Office Home Page to someone by E-mail Share EERE: Building Technologies Office Home Page on...

336

Page 1 of 30 ANNUAL SECURITY  

E-Print Network (OSTI)

Page 1 of 30 ANNUAL SECURITY AND FIRE SAFETY REPORT SEPTEMBER 2009 DARTMOUTH COLLEGE #12;Page 2 .....................................................................................................................................4 Message from the Director of Safety and Security.....................................................................................................................4 Safety & Security at Dartmouth College

Myers, Lawrence C.

337

Anatomy of a young giant component in the random graph  

E-Print Network (OSTI)

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

Ding, Jian; Lubetzky, Eyal; Peres, Yuval

2009-01-01T23:59:59.000Z

338

Page not found | Department of Energy  

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

Reporting Trends Occurrence Reporting and Processing of Operations Information (ORPS): Five Year Trends http:energy.govhssdownloadsoccurrence-reporting-trends Page...

339

Page not found | Department of Energy  

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

2008transitionbudgetdetailsbookfourpdf Page Plans, Implementation, and Results Glossary Definitions of the office overview, plans, implementation, and results document and...

340

Page not found | Department of Energy  

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

http:energy.govnedownloadsneams-quarterly-report-july-september-2012 Page Presidential Permits and Export Authorizations - Frequently Asked Questions Presidential...

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

Page not found | Department of Energy  

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

http:energy.govsavingscps-energy-commercial-energy-efficiency-rebates Page Presidential Permits and Export Authorizations - Frequently Asked Questions Presidential...

342

Page not found | Department of Energy  

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

tricity-policy-coordination-and-implementationinternational-electricity-regulatio-7 Page Presidential Permits and Export Authorizations - About the Program The Federal...

343

Page not found | Department of Energy  

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

http:energy.govnepadownloadscx-010554-categorical-exclusion-determination Page Presidential Permits and Export Authorizations - Frequently Asked Questions Presidential...

344

Page not found | Department of Energy  

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

http:energy.govnepadownloadscx-010165-categorical-exclusion-determination Page Asset Revitalization Initiative http:energy.govariasset-revitalization-initiative...

345

Page not found | Department of Energy  

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

to Smart Grid Implementation http:energy.govoedownloadscomments-national-rural-electric-cooperative-association-request-information-addressing Page Topic A" Awardee:...

346

Page not found | Department of Energy  

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

Page Other Regulatory Efforts In addition to regulating international electricity trade, the Office of Electricity Delivery and Energy Reliability participates...

347

News page discovery policy for instant crawlers  

Science Conference Proceedings (OSTI)

Many news pages which are of high freshness requirements are published on the internet every day. They should be downloaded immediately by instant crawlers. Otherwise, they will become outdated soon. In the past, instant crawlers only downloaded pages ... Keywords: news page discovery, user behavior analysis, web log

Yong Wang; Yiqun Liu; Min Zhang; Shaoping Ma

2008-01-01T23:59:59.000Z

348

Page 1 of 22 Building Num: Date  

E-Print Network (OSTI)

Check List Page 1 of 22 Building Num: Date: Compressed Gases/WeldingChecklist Title: Action stored away from flammable materials? 1910.252(a)(2)(i) #12;Check List Page 2 of 22 Building Num: Date)(D) Is the insulation material intact on welding machine rod holders? 1910.254(d)(9)(i) #12;Check List Page 3 of 22

Homes, Christopher C.

349

Janie Page resume 2013 (1)  

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

350

Mining Large Heterogeneous Graphs using Cray s Urika  

SciTech Connect

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

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

2013-01-01T23:59:59.000Z

351

Weaving independently generated photons into an arbitrary graph state  

SciTech Connect

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

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

2011-12-15T23:59:59.000Z

352

Weaving independently generated photons into an arbitrary graph state  

E-Print Network (OSTI)

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

Qing Lin; Bing He

2010-11-21T23:59:59.000Z

353

Generalizing GraphPlan by Formulating Planning as a CSP  

E-Print Network (OSTI)

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

Adriana Lopez; Fahiem Bacchus

2003-01-01T23:59:59.000Z

354

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.

355

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

356

Applying a Model Transformation Taxonomy to Graph Transformation Technology  

E-Print Network (OSTI)

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

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

2005-01-01T23:59:59.000Z

357

Create reports and graphs | ENERGY STAR Buildings & Plants  

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

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

358

Graph Based Modeling and Implementation with EER/GRAL  

E-Print Network (OSTI)

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

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

1996-01-01T23:59:59.000Z

359

Page  

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

360

Page  

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

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

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

Page  

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

362

Page  

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

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;

363

Page  

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

FOR THE EASTERN DISTRICT OF WASHINGTON IN UNITED STATES OF AMERICA, Plaintiff, and FLUOR HANFORD, INC., and TRI--CITY INDUSTRIAL DEVELOPMENT COUNCIL, Intervenor Plaintiffs, v....

364

EERE: SunShot Initiative Home Page  

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

365

EERE: Alternative Fuels Data Center Home Page  

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

366

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

367

EERE: Bioenergy Technologies Office Home Page  

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

368

EERE: SunShot Initiative Home Page  

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

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

369

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

Science Conference Proceedings (OSTI)

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

Roger Pearce; Maya Gokhale; Nancy M. Amato

2010-11-01T23:59:59.000Z

370

Graph of words embedding for molecular structure-activity relationship analysis  

Science Conference Proceedings (OSTI)

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

Jaume Gibert; Ernest Valveny; Horst Bunke

2010-11-01T23:59:59.000Z

371

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

E-Print Network (OSTI)

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

Gamarnik, David

372

Graph-based reference table construction to facilitate entity matching  

Science Conference Proceedings (OSTI)

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

Fangda Wang, Hongzhi Wang, Jianzhong Li, Hong Gao

2013-06-01T23:59:59.000Z

373

Tree/Graph Visualization CMSC 436/636  

E-Print Network (OSTI)

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

Rheingans, Penny

374

MML Inference of Decision Graphs with Multi-way Joins  

Science Conference Proceedings (OSTI)

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

Peter J. Tan; David L. Dowe

2002-12-01T23:59:59.000Z

375

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

E-Print Network (OSTI)

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

Ram Band; Idan Oren; Uzy Smilansky

2007-11-21T23:59:59.000Z

376

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

E-Print Network (OSTI)

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

Band, Ram; Smilansky, Uzy

2007-01-01T23:59:59.000Z

377

An unified transition detection based on bipartite graph matching approach  

Science Conference Proceedings (OSTI)

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

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

2010-11-01T23:59:59.000Z

378

Object oriented parallelisation of graph algorithms using parallel iterator  

Science Conference Proceedings (OSTI)

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

Lama Akeila; Oliver Sinnen; Wafaa Humadi

2010-01-01T23:59:59.000Z

379

Simulation of an Electrical Substation Using the Bond Graph Technique  

Science Conference Proceedings (OSTI)

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

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

2008-04-01T23:59:59.000Z

380

Global Maker-Breaker games on sparse graphs  

E-Print Network (OSTI)

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

Dan Hefetz; Michael Krivelevich; Tibor Szabó

2009-01-01T23:59:59.000Z

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

A Winning Strategy for the Ramsey Graph Game  

E-Print Network (OSTI)

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

Aleksandar Pekec

1995-01-01T23:59:59.000Z

382

Weighted graph comparison techniques for brain connectivity analysis  

Science Conference Proceedings (OSTI)

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

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

2013-04-01T23:59:59.000Z

383

Degenerate flag varieties: moment graphs and Schröder numbers  

Science Conference Proceedings (OSTI)

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

Giovanni Cerulli Irelli; Evgeny Feigin; Markus Reineke

2013-08-01T23:59:59.000Z

384

Arbitrary Orientations Of Hamilton Cycles In Oriented Graphs  

E-Print Network (OSTI)

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

Kelly, Luke

2009-01-01T23:59:59.000Z

385

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

Science Conference Proceedings (OSTI)

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

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

2009-01-01T23:59:59.000Z

386

Top-K nearest keyword search on large graphs  

Science Conference Proceedings (OSTI)

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

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

2013-08-01T23:59:59.000Z

387

Component supervision by sensor placement on bond-graph model  

Science Conference Proceedings (OSTI)

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

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

2005-03-01T23:59:59.000Z

388

STRUCTURAL ANNOTATION OF EM IMAGES BY GRAPH CUT  

Science Conference Proceedings (OSTI)

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

Chang, Hang; Auer, Manfred; Parvin, Bahram

2009-05-08T23:59:59.000Z

389

Efficient simulation of hybrid systems: A hybrid bond graph approach  

Science Conference Proceedings (OSTI)

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

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

2011-06-01T23:59:59.000Z

390

Using graph-based program characterization for predictive modeling  

Science Conference Proceedings (OSTI)

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

Eunjung Park; John Cavazos; Marco A. Alvarez

2012-03-01T23:59:59.000Z

391

Teaching graph algorithms to children of all ages  

Science Conference Proceedings (OSTI)

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

J. Paul Gibson

2012-07-01T23:59:59.000Z

392

On-Line Construction of Compact Directed Acyclic Word Graphs  

Science Conference Proceedings (OSTI)

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

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

2001-07-01T23:59:59.000Z

393

Note: A note on power domination in grid graphs  

Science Conference Proceedings (OSTI)

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

Michael Dorfling; Michael A. Henning

2006-04-01T23:59:59.000Z

394

A note on power domination in grid graphs  

Science Conference Proceedings (OSTI)

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

Michael Dorfling; Michael A. Henning

2006-04-01T23:59:59.000Z

395

Graphical and incremental type inference: a graph transformation approach  

Science Conference Proceedings (OSTI)

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

Silvia Clerici; Cristina Zoltan; Guillermo Prestigiacomo

2010-05-01T23:59:59.000Z

396

An extension of secure group communication using key graph  

Science Conference Proceedings (OSTI)

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

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

2006-10-01T23:59:59.000Z

397

Exponential random graph modeling of communication networks to understand organizational crisis  

Science Conference Proceedings (OSTI)

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

Jafar Hamra; Shahadat Uddin; Liaquat Hossain

2011-05-01T23:59:59.000Z

398

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

Science Conference Proceedings (OSTI)

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

Sungpack Hong; Hassan Chafi; Edic Sedlar; Kunle Olukotun

2012-04-01T23:59:59.000Z

399

A multiobjective evolutionary programming framework for graph-based data mining  

Science Conference Proceedings (OSTI)

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

Prakash Shelokar, Arnaud Quirin, íScar CordóN

2013-07-01T23:59:59.000Z

400

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

Science Conference Proceedings (OSTI)

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

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

2009-06-01T23:59:59.000Z

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

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

Science Conference Proceedings (OSTI)

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

Sitaram Asur; Srinivasan Parthasarathy; Duygu Ucar

2009-11-01T23:59:59.000Z

402

Semi-automated derivation of conceptual neighborhood graphs of topological relations  

Science Conference Proceedings (OSTI)

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

Yohei Kurata

2009-09-01T23:59:59.000Z

403

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

Science Conference Proceedings (OSTI)

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

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

2007-08-01T23:59:59.000Z

404

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

Science Conference Proceedings (OSTI)

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

Erion Plaku; Lydia E. Kavraki

2007-03-01T23:59:59.000Z

405

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

Science Conference Proceedings (OSTI)

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

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

2012-10-01T23:59:59.000Z

406

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

407

Page not found | Department of Energy  

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

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.

408

Page not found | Department of Energy  

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

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

409

Page not found | Department of Energy  

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

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)

410

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

411

Page not found | Department of Energy  

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

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

412

Subsurface Knowledge Reference Page | Department of Energy  

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

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 -

413

Page not found | Department of Energy  

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

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

414

Page not found | Department of Energy  

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

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.

415

Consumer Data Page | Data.gov  

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

Data Page Consumer Data Apps Challenges Resources About Blogs Let's Talk Feedback Consumer You are here Data.gov Communities Consumer Smart Disclosure Data These federal...

416

Page not found | Department of Energy  

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

21 - 6630 of 11,722 results. Page Intellectual Property Provisions http:energy.govmanagementoffice-managementoperational-managementgrants-and-assistanceguidance-grants-0...

417

Page not found | Department of Energy  

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

51 - 160 of 6,577 results. Download FAR Acquisition Strategy Team http:energy.govmanagementdownloadsfar-acquisition-strategy-team-0 Page Categorical Exclusion Determinations:...

418

Page not found | Department of Energy  

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

energy.govnepadownloads2011-annual-planning-summary-princeton-site-office-pso Page MANHATTAN PROJECT NATIONAL HISTORICAL PARK The Department, as the direct descendent of the...

419

Page not found | Department of Energy  

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

energy.govnepadownloadsnanomaterials-safety-implementation-plan-ames-laboratory Page Manhattan Project Signature Facilities The Department of Energy, in the mid-1990s,...

420

Page not found | Department of Energy  

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

http:energy.govnepadownloadscx-006885-categorical-exclusion-determination Page MANHATTAN PROJECT The Department of Energy traces its origins to World War II and the...

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

Page not found | Department of Energy  

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

are cost-effective, energy... http:energy.govdiversityeventssolar-decathlon Page Manhattan Project Historical Resources The Department of Energy has developed and made...

422

Page not found | Department of Energy  

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

Authority http:energy.govciodownloadsrequest-records-dispostion-authority Page Manhattan Project Signature Facilities The Department of Energy, in the mid-1990s,...

423

Page not found | Department of Energy  

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

nergy-secretary-chu-epa-administrator-jackson-washington-state-governor-gregoire-and Page Manhattan Project National Historical Park The Department, as the direct descendent of the...

424

Page not found | Department of Energy  

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

31 - 4740 of 9,477 results. Page MANHATTAN PROJECT NATIONAL HISTORICAL PARK The Department, as the direct descendent of the Manhattan Engineer District, owns and manages the...

425

Page not found | Department of Energy  

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

statement-house-energy-and-water Page Community Renewable Energy Success Stories Webinar: District Heating with Renewable Energy (text version) Below is the text version of the...

426

Page not found | Department of Energy  

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

downloadsdoe-hdbk-1145-2001 Page Community Renewable Energy Success Stories Webinar: District Heating with Renewable Energy (text version) Below is the text version of the...

427

Page not found | Department of Energy  

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

stocks are stored in huge underground salt caverns along the coastline of the... http:energy.govfeservicespetroleum-reservesstrategic-petroleum-reserve Page How to Apply...

428

Page not found | Department of Energy  

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

http:energy.govnepadownloadscx-009512-categorical-exclusion-determination Page Shale Gas 101 This webpage has been developed to answer the many questions that people...

429

Page not found | Department of Energy  

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

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

430

Page not found | Department of Energy  

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

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.

431

Page not found | Department of Energy  

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

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

432

Page not found | Department of Energy  

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

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

433

Page not found | Department of Energy  

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

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

434

Page not found | Department of Energy  

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

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

435

Page not found | Department of Energy  

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

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

436

Page not found | Department of Energy  

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

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

437

Page not found | Department of Energy  

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

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.

438

Page not found | Department of Energy  

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

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

439

Page not found | Department of Energy  

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

71 - 4280 of 11,722 results. Page EA-1146: Radioactive Waste Storage at Rocky Flats Environmental Technology Site, Golden, Colorado This EA evaluates the environmental impacts of...

440

Page not found | Department of Energy  

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

tric-frontier-foundation-implementing Page Parking and Garage Parking in the Forrestal Garage http:energy.govmanagementoffice-managementemployee-servicesparking-and-garage...

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

Query-Structure Based Web Page Indexing  

Science Conference Proceedings (OSTI)

... In Proc. 8th International Symposium on String Processing and Information Retrieval (SPIRE 2001), pages 33-45, San Rafael, Chile, 2001. ...

2013-02-12T23:59:59.000Z

442

Page not found | Department of Energy  

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

interested in changing the future of onroad... http:energy.govdiversityeventsclean-cities-internships Page Office of HC Policy, Accountability, and Technology (HC-10) This...

443

Page not found | Department of Energy  

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

Page How to Obtain Authorization to Import andor Export Natural Gas and LNG LNG Exports | Long Terms | Blanket Authorizations | Vacate | Name Change | Contents of...

444

Page not found | Department of Energy  

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

energy.govnepadownloads2013-annual-planning-summary-carlsbad-field-office Page Glossary Alluvial aquifer: The alluvial aquifer is composed of unconsolidated sediments (silt,...

445

Page not found | Department of Energy  

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

-pp-371-northern-pass-comments-michelle Page How to Obtain Authorization to Import andor Export Natural Gas and LNG LNG Exports | Long Terms | Blanket Authorizations | Vacate |...

446

Page not found | Department of Energy  

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

Page Publications on Hawaii Find publications on deploying energy efficiency and renewable energy in Hawaii. http:energy.goveerepublications-hawaii Download Progress...

447

Page not found | Department of Energy  

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

Page Categorical Exclusion Determinations: B5.13 B5.13: Experimental wells for injection of small quantities of carbon dioxideSiting, construction, operation,...

448

Page not found | Department of Energy  

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

cx-009056-categorical-exclusion-determination Page EIS-0467: Hanford Site Natural Gas Pipeline, Richland, WA DOE announces its intent to prepare an EIS for the Acquisition...

449

Page not found | Department of Energy  

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

Page Guidelines for Filing Monthly Reports Importers and exporters of natural gas must file monthly reports on their activities, as required in DOEFE Order No. 2464,...

450

Page not found | Department of Energy  

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

energysaverarticlesoutdoor-solar-lighting Page EM Partnering Initiative: Journey to Excellence Metric No. 3.5 Partnering establishes a collaborative approach among the...

451

Page not found | Department of Energy  

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

rts-success-drive-meet-doe-fleet-reduction-goals Page EM Partnering Initiative: Journey to Excellence Metric No. 3.5 Partnering establishes a collaborative approach among the...

452

Page not found | Department of Energy  

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

downloadscx-009577-categorical-exclusion-determination Page EIS-0493: Corpus Christi LNG Terminal and Pipeline Project, Nueces and San Patricio Counties, Texas The Federal...

453

Page not found | Department of Energy  

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

emarticlesnational-nuclear-security-administration-commends-three-em-employees Page LNG Export Study As part of a broader effort to further inform decisions related to LNG...

454

Page not found | Department of Energy  

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

030814bodbylaws.pdf http:energy.govmanagementdownloads20030814bodbylawspdf Page History Publications List of historical publications available through the Department's...

455

Page not found | Department of Energy  

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

Q&A Booklet Radioactive Materials Transportation and Incident Response Q&A booklet http:energy.govemdownloadsqa-booklet Page History On January 7, 2011, the President signed...

456

Links to Muon Collider Related Web Pages  

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

useful nu-factory related web pages: Nu-FactoryMuon Collider Studies at Fermilab Neutrino Factory Design Study MUCOOL Collaboration: Ionization Cooling R&D Brookhaven Muon...

457

Page not found | Department of Energy  

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

several topics, including optimizing resources for EM's technology challenges. http:energy.govemarticlesadvisory-board-meets-discuss-em-cleanup-s-future Page Clean Coal Power...

458

Page not found | Department of Energy  

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

nepadownloadscx-007165-categorical-exclusion-determination Page Secretary of Energy Advisory Board The Board will provide advice and recommendations to the Secretary of...

459

Online Particle Physics Information - Specialized Subject Pages  

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

of relativity such as: cosmology, black holes, cosmic strings, inflation, and quantum gravity. Provides links to movies, research-level home pages and to Stephen Hawking's Web...

460

Page not found | Department of Energy  

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

bad-field-office-manager-hits-ground-running Page Categorical Exclusion Determinations: SLAC Site Office Categorical Exclusion Determinations issued by SLAC Site Office. http:...

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  

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

ha lifetime loading to the... http:energy.govnepaea-1042-proposed-changes-sanitary-sludge-land-application-program-oak-ridge-reservation-oak Page Leadership http:...

462

Page not found | Department of Energy  

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

Page Major Communications Reports http:energy.govmajor-communications-reports Event Nano-High: Lawrence Berkeley National Laboratory Lecture on the "compassionate instinct"...

463

Page not found | Department of Energy  

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

re-program-management-initiative-pmi-brochure Page Plans, Implementation, and Results Glossary Definitions of the office overview, plans, implementation, and results document and...

464

Page not found | Department of Energy  

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

the Savannah River Site http:energy.govigdownloadsaudit-report-oas-l-10-04 Page Glossary Alluvial aquifer: The alluvial aquifer is composed of unconsolidated sediments (silt,...

465

Page not found | Department of Energy  

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

Annotated 8-7... http:energy.govsavingshazardous-waste-management-arkansas Page Glossary Alluvial aquifer: The alluvial aquifer is composed of unconsolidated sediments (silt,...

466

Page not found | Department of Energy  

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

energy.govnepadownloadscx-003108-categorical-exclusion-determination Page EA-1907: Biogas Anaerobic Digester Facility, Oakley, Kansas This EA evaluates the environmental...

467

Page not found | Department of Energy  

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

and Documentation http:energy.govdownloadsus-doennsa-response-2011-fukushima-incident-data-and-documentation Page EA-1886: Big Sky Regional Carbon Sequestration Partnership -...

468

Page not found | Department of Energy  

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

buffer overflow. http:energy.govcioarticlesu-152-openssl-asn1d2ireadbio-der-format-data-processing-vulnerability Page EA-1886: Big Sky Regional Carbon Sequestration...

469

Page not found | Department of Energy  

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

81 - 4690 of 7,741 results. Page FIMS Data Validation FIMS Data Validation... http:energy.govmanagementoffice-managementoperational-managementfacilities-and-infrastructure...

470

M & O Contract Recompete Site -- Home Page  

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

Site Information Pantex Home Page (weblink) Ten Year Site Plan (weblink) Site Fact Sheet (weblink) Pantex Finance Benchmark Redacted Presentation (pdf, 634 KB) Pantex HR Benchmark...

471

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

472

Page not found | Department of Energy  

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

downloadscx-009693-categorical-exclusion-determination Page Nuclear Fuels Storage & Transportation Planning Project The future of nuclear energy in the United States depends...

473

Page not found | Department of Energy  

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

for the Energy Information Administration since 1977 (before employees had personal computers). http:energy.govarticlesworking-without-pcs-energy-department Page Policy...

474

Page not found | Department of Energy  

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

managementdownloads2010-annual-plan-ultra-deepwater-and-unconventional-natural-gas-and-other Page 10 C.F.R. 851: Worker Safety and Health Program Stakeholders: DOE...

475

Page not found | Department of Energy  

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

state's primary energy... http:energy.govsavingsvirginia-energy-plan-virginia Page MACCS2 Current Central Registry Toolbox Version(s): 1.13.1Code Owner: Sandia National...

476

Page not found | Department of Energy  

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

61 - 170 of 10,268 results. Page Nuclear Liability 1. Price-Anderson Act (PAA) http:energy.govgcnuclear-liability Download Protocol, Technical Qualification Program- October...

477

Page not found | Department of Energy  

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

achieve 50% energy savings compared to base code requirements. Download them free from ASHRAE: http:energy.goveerebuildingsadvanced-energy-design-guides Page Buildings...

478

EERE: Federal Energy Management Program Home Page  

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

send us your comments, report problems, andor ask questions about information on the EERE Federal Energy Management Program site. If it regards a particular page, please provide...

479

Page not found | Department of Energy  

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

http:energy.govnepadownloadscx-007838-categorical-exclusion-determination Page Graphics The Visual Media Department consists of a team of graphic artists, photographers and...

480

Page not found | Department of Energy  

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

after finding Hydac had manufactured and distributed in commerce in the U.S. noncompliant electric motors. http:energy.govgcdownloadshydac-order-2012-se-4107 Page...

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

This page is intentionally left blank.  

U.S. Energy Information Administration (EIA)

U.S. Energy Information Administration/Electric Power Monthly June 2012 1 Executive Summary This page is intentionally left blank.

482

Page not found | Department of Energy  

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

Page EA-1958: Future Development in proximity to the William R. Wiley Environmental Molecular Sciences Laboratory, Pacific Northwest National Laboratory, Richland, Washington...

483

Page not found | Department of Energy  

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

WindEnergyOrdinance.pdf model ordinance for siting wind-energy systems. This nine-page model... http:energy.govsavingsmodel-ordinance-siting-wind-energy-systems Download...

484

Page not found | Department of Energy  

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

cedure-composite-adversary-team-training Page Community Renewable Energy Success Stories: Landfill Gas-to-Energy Projects Webinar (text version) Below is the text version of the...

485

Page not found | Department of Energy  

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

Page Post-Combustion Carbon Capture Research Fossil fuel fired electric generating plants are the cornerstone of America's central power system. Currently, the...

486

Page not found | Department of Energy  

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

http:energy.govdownloadsfinancial-and-activity-report-june-17-2011 Page Presidential Permits - Procedures Executive Order 12038 states that, before a Presidential...

487

Page not found | Department of Energy  

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

Quality Audit http:energy.govciodownloadspreparation-software-quality-audit Page Presidential Permits - Procedures Executive Order 12038 states that, before a Presidential...

488

Page not found | Department of Energy  

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

emdownloadscompleted-sites-listing Page How to Obtain Authorization to Import andor Export Natural Gas and LNG LNG Exports | Long Terms | Blanket Authorizations | Vacate |...

489

Page not found | Department of Energy  

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

line... http:energy.govcontributorsgeorge-malosh Download 2003 National Middle School Science Bowl http:energy.govdownloads2003-national-middle-school-science-bowl Page...

490

Page not found | Department of Energy  

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

fusrap-program-information Page Considered Sites DOE maintains the Considered Sites Database to provide information to the public about sites that were formerly used in...

491

Journal of Electronic Materials Home Page  

Science Conference Proceedings (OSTI)

JEM Home Page. The Journal of Electronic Materials reports on the science and technology of electronic materials while examining new applications for ...

492

Hi, Welcome to Allan Wittkopf's Home Page  

E-Print Network (OSTI)

CECM Personal Pages: Allan Wittkopf. Welcome! to Allan Wittkopf's homepage at the Centre for Experimental and Constructive Mathematics, located at Simon ...

493

Home > Households, Buildings & Industry > Energy Efficiency Page ...  

U.S. Energy Information Administration (EIA)

Home > Households, Buildings & Industry > Energy Efficiency Page > Energy Intensities >Table 7b Glossary U.S. Residential Housing Primary Energy Intensity

494

Home > Households, Buildings & Industry > Energy Efficiency Page ...  

U.S. Energy Information Administration (EIA)

Home > Households, Buildings & Industry > Energy Efficiency Page > Energy Intensities > Table 8b Glossary U.S. Residential Buildings Primary Energy Intensity

495

Page not found | Department of Energy  

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

81 - 1990 of 21,429 results. Page EA-1219: Hoe Creek Underground Coal Gasification Test Site Remediation, Campbell County, Wyoming This EA evaluates the environmental impacts for...

496

Page not found | Department of Energy  

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

challenges collegiate teams to design, build, and operate solar-powered houses that are cost-effective, energy... http:energy.govdiversityeventssolar-decathlon Page EA-1177:...

497

Category:SamplePages | Open Energy Information  

Open Energy Info (EERE)

Category Edit History Facebook icon Twitter icon Category:SamplePages Jump to: navigation, search This category uses the form SampleForm. Note the pluralization. Category names...

498

Page not found | Department of Energy  

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

and Summary Versions are available for download http:energy.govemdownloadsevaluation-system-level-modeling-and-simulation-tools-support Page Metallurgical Laboratory at the...

499

Page not found | Department of Energy  

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

Page DOE Virtual University The Department of Energy Virtual University (DVU) is a central venue for executing, managing, partnering and sharing corporate learning...

500

NETL: Emergency Response and Communications Page  

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

Emergency Response NewsRoom Welcome to the NETL Emergency Response and Communications Page This is NETL's public website for emergency preparedness. Click here to go directly to...