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


1

VIEW ALL MAPS  

Science Conference Proceedings (OSTI)

Use these following maps and floor plans to help locate where you need to go. If you need assistance, ask any TMS Staff member or stop by the Membership ...

2

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

3

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

4

list-view-maps | Data.gov  

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

Where Does my Money Go? Average categorical breakdown of annual US residential energy costs. Maps 10312011 What Drives Crude Oil Prices? Graphic exploring the relation of oil...

5

View  

E-Print Network (OSTI)

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

6

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

7

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

Science Conference Proceedings (OSTI)

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

B. N. Walker; L. M. Mauney

2010-03-01T23:59:59.000Z

8

Integrated Google Maps and Smooth Street View Videos for Route Planning National Taiwan University  

E-Print Network (OSTI)

Integrated Google Maps and Smooth Street View Videos for Route Planning Chi Peng National Taiwan that takes start and end points as the input, and will automatically connect to the Google Maps with Street a smooth scenic video from the starting point to the destination, which combines the Google Maps to provide

Ouhyoung, Ming

9

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

Science Conference Proceedings (OSTI)

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

Abhinav Bhatele; Laxmikant V. Kale

2011-09-01T23:59:59.000Z

10

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.

11

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

12

Undirected Graphs maze exploration  

E-Print Network (OSTI)

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

Sedgewick, Robert

13

View  

E-Print Network (OSTI)

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

14

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

15

Alternative Fuels Data Center: Maps and Data  

Alternative Fuels and Advanced Vehicles Data Center (EERE)

Laws & Incentives Laws & Incentives All Categories Vehicles AFVs and HEVs Fuel Consumption and Efficiency Vehicle Market Driving Patterns Fuels & Infrastructure Fuel Trends Emissions Alternative Fueling Stations Idle Reduction Transportation Infrastructure Biofuels Production Laws & Incentives Regulated Fleets Federal Fleets State & Alt Fuel Providers Clean Cities Vehicles Petroleum Use Reduction Program OR Go Sort by: Category Most Recent Most Popular 11 results - Biodiesel_li_by_state Biodiesel Incentives and Laws, by State Biodiesel_li_by_state View Map Graph L_i-electric Electric Vehicle Incentives and Laws, by State L_i-electric View Map Graph L_i-ethanol Ethanol Incentives and Laws, by State L_i-ethanol View Map Graph Generated_thumb20130810-31804-1h8ookf Fuel Taxes by Country Generated_thumb20130810-31804-1h8ookf

16

Alternative Fuels Data Center: Maps and Data  

Alternative Fuels and Advanced Vehicles Data Center (EERE)

Idle Reduction Idle Reduction All Categories Vehicles AFVs and HEVs Fuel Consumption and Efficiency Vehicle Market Driving Patterns Fuels & Infrastructure Fuel Trends Emissions Alternative Fueling Stations Idle Reduction Transportation Infrastructure Biofuels Production Laws & Incentives Regulated Fleets Federal Fleets State & Alt Fuel Providers Clean Cities Vehicles Petroleum Use Reduction Program OR Go Sort by: Category Most Recent Most Popular 2 results Generated_thumb20130810-31804-cpho29 Truck Stop Electrification Sites Generated_thumb20130810-31804-cpho29 Trend of TSE sites by state from 2006-2012 Last update November 2012 View Graph Graph Download Data Map_thumbnail Truckstop Electrification Facilities Map_thumbnail Last update May 2013 View Graph Graph Truck Stop Electrification Sites

17

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

18

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.

19

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

20

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

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


21

Istanbul viewed : the representation of the city in Ottoman maps of the sixteenth and seventeenth centuries  

E-Print Network (OSTI)

Starting from the premise that maps are essentially about visualizing space, this dissertation examines what the Ottoman maps of Istanbul reveal about the city's perception, as it evolved in connection to urban development ...

Orbay, ?ffet

2001-01-01T23:59:59.000Z

22

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

23

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

24

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

25

Quantifying and Mapping the Digital Divide from an Internet Point of View  

Science Conference Proceedings (OSTI)

Quantitative knowledge of the magnitude, extent and trends of the Digital Divide are critical to understand and identify the regions most in need of help, to make rational decisions on how to address the problems and to make cases for executives, funding agencies and politicians. We report on a project (PingER) to measure the Digital Divide from the point of view of Internet performance. The PingER project has been measuring Internet performance since 1995 and with the increased emphasis on measuring and tracking the Digital Divide, it now covers over 700 hosts in over 150 countries that between them contain over 99% of the world's Internet connected population. In this paper we will describe the how PingER works, it deployment, the data analysis, and presentation. We also introduce a new PingER visualization tool (ViPER) that provides a more appealing interactive visualization of the PingER data and also works on mobile PDAs. We will also show results from PingER that illustrate the magnitude, extent and trends for the Digital Divide, and also compare PingER results with some human development and technology indices.

Cottrell, R.Les; /SLAC; Khan, Shahryar; /NUST, Rawalpindi; Williams, Jerrod; /SLAC; Mehdi, Akbar; Kalim, Umar; Ali, Arshad; /NUST, Rawalpindi

2008-09-18T23:59:59.000Z

26

Maps  

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

Maps Maps Maps Los Alamos is located in Northern New Mexico about 35 miles (about 40 minutes drive) northwest of Santa Fe and 1 hour and 45 minutes drive from Albuquerque. Contact LANL Directory 667-5061 Badge Office (505) 667-6901 Email Institutional Visits and Events (505) 667-2222 Location and directions How to get to LANL Los Alamos is located in Northern New Mexico about 35 miles (about 40 minutes drive) northwest of Santa Fe and 1 hour and 45 minutes drive from Albuquerque. Laboratory facilities can be found in 50 different work areas that are spread across 36 square miles. Below is the general location of the Otowi Building, Badge Office, cafeteria, and Research Library. V Screen reader users: click here for plain HTML Go to Google Maps Home Casa Grande Drive, Los Alamos, NM

27

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

28

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

29

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.

30

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

31

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

32

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

33

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

34

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

35

Long lifetime, low intensity light source for use in nighttime viewing of equipment maps and other writings  

DOE Patents (OSTI)

A long-lifetime light source is discussed with sufficiently low intensity to be used for reading a map or other writing at nightime, while not obscuring the user's normal night vision. This light source includes a diode electrically connected in series with a small power source and a lens properly positioned to focus at least a portion of the light produced by the diode.

Frank, A.M.; Edwards, W.R.

1982-03-23T23:59:59.000Z

36

Long lifetime, low intensity light source for use in nighttime viewing of equipment maps and other writings  

DOE Patents (OSTI)

A long-lifetime light source with sufficiently low intensity to be used for reading a map or other writing at nighttime, while not obscuring the user's normal night vision is disclosed. This light source includes a diode electrically connected in series with a small power source and a lens properly positioned to focus at least a portion of the light produced by the diode. 1 fig.

Frank, A.M.; Edwards, W.R.

1983-10-11T23:59:59.000Z

37

Long lifetime, low intensity light source for use in nighttime viewing of equipment maps and other writings  

DOE Patents (OSTI)

A long-lifetime light source with sufficiently low intensity to be used for reading a map or other writing at nighttime, while not obscuring the user's normal night vision. This light source includes a diode electrically connected in series with a small power source and a lens properly positioned to focus at least a portion of the light produced by the diode.

Frank, Alan M. (Livermore, CA); Edwards, William R. (Modesto, CA)

1983-01-01T23:59:59.000Z

38

Alternative Fuels Data Center: Maps and Data  

Alternative Fuels and Advanced Vehicles Data Center (EERE)

Biofuels Production Biofuels Production All Categories Vehicles AFVs and HEVs Fuel Consumption and Efficiency Vehicle Market Driving Patterns Fuels & Infrastructure Fuel Trends Emissions Alternative Fueling Stations Idle Reduction Transportation Infrastructure Biofuels Production Laws & Incentives Regulated Fleets Federal Fleets State & Alt Fuel Providers Clean Cities Vehicles Petroleum Use Reduction Program OR Go Sort by: Category Most Recent Most Popular 17 results Generated_thumb20130810-31804-ue59qa Advanced Fuels RFS2 Mandates and Consumption Generated_thumb20130810-31804-ue59qa Last update August 2012 View Graph Graph Download Data Biofuelsatlas BioFuels Atlas Biofuelsatlas BioFuels Atlas is an interactive map for comparing biomass feedstocks and biofuels by location. This tool helps users select from and apply biomass

39

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

40

Alternative Fuels Data Center: Maps and Data  

Alternative Fuels and Advanced Vehicles Data Center (EERE)

Alternative Fueling Stations Alternative Fueling Stations All Categories Vehicles AFVs and HEVs Fuel Consumption and Efficiency Vehicle Market Driving Patterns Fuels & Infrastructure Fuel Trends Emissions Alternative Fueling Stations Idle Reduction Transportation Infrastructure Biofuels Production Laws & Incentives Regulated Fleets Federal Fleets State & Alt Fuel Providers Clean Cities Vehicles Petroleum Use Reduction Program OR Go Sort by: Category Most Recent Most Popular 13 results Arra-thumb ARRA Electrification Projects Arra-thumb Last update November 2012 View Map Graph Biofuelsatlas BioFuels Atlas Biofuelsatlas BioFuels Atlas is an interactive map for comparing biomass feedstocks and biofuels by location. This tool helps users select from and apply biomass data layers to a map, as well as query and download biofuels and feedstock

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


41

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

42

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

43

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

44

Manhattan Project: Maps  

Office of Scientific and Technical Information (OSTI)

MAPS MAPS Resources Scroll down to view thumbnails of each map. Leslie Groves looks at a map of Japan. Manhattan Project: General Manhattan Project Facilities Places map "Signature Facilities of the MED" map Hanford Hanford map Hanford (black and white) map Hanford Site Diagram Hanford Site Location Map Hanford: Native Peoples map Hanford: Town map Los Alamos Map of Los Alamos, New Mexico Los Alamos: "Tech Area" map Oak Ridge Map of Clinton Engineer Works, Oak Ridge Clinton Engineer Works, Oak Ridge (black and white) map Oak Ridge: Projected Site for Atomic Production Plants, 1942, map Other Flight paths for Hiroshima and Nagasaki missions map Map of the Trinity Test Site Post-War U.S. Nuclear Tests map Manhattan Project Facilities Manhattan Project Facilities

45

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

46

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

47

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

48

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

49

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

50

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

51

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

52

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

53

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

54

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

55

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

56

Alternative Fuels Data Center: Maps and Data  

Alternative Fuels and Advanced Vehicles Data Center (EERE)

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

57

Alternative Fuels Data Center: Maps and Data  

Alternative Fuels and Advanced Vehicles Data Center (EERE)

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

58

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

59

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

60

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

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


61

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

62

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

63

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

64

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

65

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

66

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

67

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

68

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

69

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

70

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

71

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

72

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

73

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

74

MAPPING HVAC SYSTEMS FOR SIMULATION IN ENERGYPLUS  

E-Print Network (OSTI)

LBNL-XXXXX MAPPING HVAC SYSTEMS FOR SIMULATION IN ENERGYPLUSof California. MAPPING HVAC SYSTEMS FOR SIMULATION INpresent a conventional view of HVAC systems to the user, and

Basarkar, Mangesh

2013-01-01T23:59:59.000Z

75

NREL: Dynamic Maps, GIS Data, and Analysis Tools - Geothermal...  

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

for maps has never been easier. A screen capture of the MapSearch Map view option Geothermal Maps These maps show existing and developing geothermal power plants, geothermal...

76

Every 2-choosable graph is circular consecutive 2-choosable  

E-Print Network (OSTI)

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

Zhu, Xuding

77

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

78

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

79

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

80

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

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


81

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.

82

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

83

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

84

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

85

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

86

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

87

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

88

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

89

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

90

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

91

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

92

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

93

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.

94

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

95

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

96

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

97

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

98

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

99

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

100

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

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


101

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

102

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

103

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

104

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

105

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

106

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

107

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

108

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

109

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

110

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

111

Alternative Fuels Data Center: Maps and Data  

Alternative Fuels and Advanced Vehicles Data Center (EERE)

Program Program All Categories Vehicles AFVs and HEVs Fuel Consumption and Efficiency Vehicle Market Driving Patterns Fuels & Infrastructure Fuel Trends Emissions Alternative Fueling Stations Idle Reduction Transportation Infrastructure Biofuels Production Laws & Incentives Regulated Fleets Federal Fleets State & Alt Fuel Providers Clean Cities Vehicles Petroleum Use Reduction Program OR Go Sort by: Category Most Recent Most Popular 3 results Cc-coalitions-thumb Clean Cities Coalitions Cc-coalitions-thumb Last update December 2012 View Image Graph Generated_thumb20130810-31804-vrlv1v Clean Cities Funding Generated_thumb20130810-31804-vrlv1v Trend of budgets, stakeholder grants, and matching funds from 1998-2010 Last update December 2012 View Graph Graph Download Data Generated_thumb20130810-31804-1374mkv

112

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

113

A Searchable Knowledge Map Based on Ontology  

Science Conference Proceedings (OSTI)

Knowledge visualization and retrieval are the key techniques to implement effective knowledge management. Traditional research on knowledge map emphasizes on building global view of knowledge base, but ignores its support to knowledge retrieval. In this ... Keywords: knowledge map, search, ontology

Qi Xiong; Yingling Wang; Jianmei Guo; Guilin Wu

2008-12-01T23:59:59.000Z

114

Fault Mapping | Open Energy Information  

Open Energy Info (EERE)

form form View source History View New Pages Recent Changes All Special Pages Semantic Search/Querying Get Involved Help Apps Datasets Community Login | Sign Up Search Page Edit with form History Facebook icon Twitter icon » Fault Mapping Jump to: navigation, search GEOTHERMAL ENERGYGeothermal Home Exploration Technique: Fault Mapping Details Activities (2) Areas (2) Regions (0) NEPA(0) Exploration Technique Information Exploration Group: Field Techniques Exploration Sub Group: Data Collection and Mapping Parent Exploration Technique: Data Collection and Mapping Information Provided by Technique Lithology: Stratigraphic/Structural: Locates active faults in the area of interest Hydrological: Can reveal whether faults are circulating hydrothermal fluids Thermal: Dictionary.png

115

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

Science Conference Proceedings (OSTI)

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

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

2011-07-18T23:59:59.000Z

116

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

117

NREL: Dynamic Maps, GIS Data, and Analysis Tools - Marine & Hydrokinet...  

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

easier. A screen capture of the MapSearch Map view option Marine & Hydrokinetic Maps Hydropower already provides 6-7% of the nation's electricity, and the ocean represents a...

118

Beamlines Map | Advanced Photon Source  

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

Map For a table view of basic technical capabilities of a particular beamline go to the APS Beamline Directory. Note that only BMs and IDs available for the general user program...

119

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

120

Image segmentation by iterated region merging with localized graph cuts  

Science Conference Proceedings (OSTI)

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

Bo Peng; Lei Zhang; David Zhang; Jian Yang

2011-10-01T23:59:59.000Z

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


121

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

122

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

123

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

124

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

125

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

126

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

127

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

128

Spectral dimension in graph models of causal quantum gravity  

E-Print Network (OSTI)

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

Georgios Giasemidis

2013-10-30T23:59:59.000Z

129

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

130

Directions and Maps  

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

Directions & Maps Directions & Maps Plan Your Visit Visit About the Museum Museum Hours Directions & Maps When to Visit Arrange for a Visit Around Los Alamos Contact Us invisible utility element Directions and Maps Aerial View of Los Alamos Aerial approach to the Los Alamos airport Where we're located Los Alamos (elevation 7,355 feet) is perched high atop the Pajarito Plateau in the Jemez Mountains, 35 miles northwest of Santa Fe. The Bradbury Science Museum is located in downtown Los Alamos at the corner of Central Avenue and 15th Street. If you're driving here and using GPS navigation, our address is 1350 Central Avenue, Los Alamos, NM 87544. How to get here From Albuquerque take I-25 north to Santa Fe (take NM 599 for most direct route), then US 84/285 north to Pojoaque. At Pojoaque take the NM 502 exit

131

Chisolm View | Open Energy Information  

Open Energy Info (EERE)

Chisolm View Chisolm View Jump to: navigation, search Name Chisolm View Facility Chisolm View Sector Wind energy Facility Type Commercial Scale Wind Facility Status In Service Owner GE Energy Financial Service / Enel Green Power North America Developer TradeWind Energy Energy Purchaser Alabama Power Company Location Hunter OK Coordinates 36.59527057°, -97.54501104° Loading map... {"minzoom":false,"mappingservice":"googlemaps3","type":"ROADMAP","zoom":14,"types":["ROADMAP","SATELLITE","HYBRID","TERRAIN"],"geoservice":"google","maxzoom":false,"width":"600px","height":"350px","centre":false,"title":"","label":"","icon":"","visitedicon":"","lines":[],"polygons":[],"circles":[],"rectangles":[],"copycoords":false,"static":false,"wmsoverlay":"","layers":[],"controls":["pan","zoom","type","scale","streetview"],"zoomstyle":"DEFAULT","typestyle":"DEFAULT","autoinfowindows":false,"kml":[],"gkml":[],"fusiontables":[],"resizable":false,"tilt":0,"kmlrezoom":false,"poi":true,"imageoverlays":[],"markercluster":false,"searchmarkers":"","locations":[{"text":"","title":"","link":null,"lat":36.59527057,"lon":-97.54501104,"alt":0,"address":"","icon":"","group":"","inlineLabel":"","visitedicon":""}]}

132

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

133

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

134

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

135

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

136

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

137

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

138

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

139

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

140

FASTEST MIXING MARKOV CHAIN ON GRAPHS WITH SYMMETRIES  

E-Print Network (OSTI)

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

Xiao, Lin

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


141

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

142

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

143

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

144

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

145

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

146

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

147

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

148

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

149

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

150

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

151

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

152

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

153

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

154

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

155

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

156

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

157

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

158

Ocean Map Regional | Data.gov  

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

Regional Regional Ocean Data Tools Technical Guide Map Gallery Regional Planning Feedback Ocean You are here Data.gov » Communities » Ocean Featured Maps The following maps are from data sources that are regional in scope. These are some of the data sources available in the Ocean Community that are most useful in the identified region. This includes several of the human use atlases now available. Regional/State Maps .view-map-gallery .views-row { float: inherit; margin: 0; } .map-align { float: left; margin: 0 20px; } .map-gallery-thumbnail{width:202px;height:133px;} .pane-map-gallery h2.pane-title { color: #284A78 !important; font: bold 16px Georgia,"Times New Roman",Serif !important; margin-left: 25px !important; } Oregon Submarine Cables Marine Reserves and Protected areas of Oregon

159

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

160

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 "view map graph" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


161

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

162

List View | Data.gov  

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

List View List View Safety Data/Tools Apps Challenges Resources Blogs Let's Talk Safety You are here Data.gov » Communities » Safety List View Interactive applications that visually display large datasets provide a portal to explore data and make discoveries. Federal agencies collect information on energy production, use, natural resources, and energy infrastructure logistics and this data can be used to create calculators, interactive maps, and other applications that leverage this data. These applications provide user communities the ability to highlight the energy issues that are occurring within their communities, aid businesses plan and analyze their proposed projects, and provide a baseline for analyzing how energy resources can be most optimally and efficiently used. This page

163

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

164

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

165

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

166

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

167

Bi-criteria Pipeline Mappings for Parallel Image Processing  

E-Print Network (OSTI)

Mapping workflow applications onto parallel platforms is a challenging problem, even for simple application patterns such as pipeline graphs. Several antagonistic criteria should be optimized, such as throughput and latency (or a combination). Typical applications include digital image processing, where images are processed in steady-state mode. In this paper, we study the mapping of a particular image processing application, the JPEG encoding. Mapping pipelined JPEG encoding onto parallel platforms is useful for instance for encoding Motion JPEG images. As the bi-criteria mapping problem is NP-complete, we concentrate on the evaluation and performance of polynomial heuristics.

Benoit, Anne; Rehn-Sonigo, Veronika; Robert, Yves

2008-01-01T23:59:59.000Z

168

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

169

View-Augmented Abstractions  

Science Conference Proceedings (OSTI)

This paper introduces view-augmented abstractions, which specialize an underlying numeric domain to focus on a particular expression or set of expressions. A view-augmented abstraction adds a set of materialized views to the original domain. View augmentation ... Keywords: Numeric abstract domains, abstract-interpretation precision, view maintenance

Matt Elder; Denis Gopan; Thomas Reps

2010-10-01T23:59:59.000Z

170

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

171

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

172

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

173

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

174

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.

175

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

176

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

177

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

178

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

179

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

180

Mountain View Grand | Open Energy Information  

Open Energy Info (EERE)

Grand Grand Jump to: navigation, search Name Mountain View Grand Facility Mountain View Grand Sector Wind energy Facility Type Small Scale Wind Facility Status In Service Owner Mountain View Grand Developer Sustainable Energy Developments Energy Purchaser Mountain View Grand Location Mountain View Grand Resort & Spa NH Coordinates 44.397987°, -71.590306° Loading map... {"minzoom":false,"mappingservice":"googlemaps3","type":"ROADMAP","zoom":14,"types":["ROADMAP","SATELLITE","HYBRID","TERRAIN"],"geoservice":"google","maxzoom":false,"width":"600px","height":"350px","centre":false,"title":"","label":"","icon":"","visitedicon":"","lines":[],"polygons":[],"circles":[],"rectangles":[],"copycoords":false,"static":false,"wmsoverlay":"","layers":[],"controls":["pan","zoom","type","scale","streetview"],"zoomstyle":"DEFAULT","typestyle":"DEFAULT","autoinfowindows":false,"kml":[],"gkml":[],"fusiontables":[],"resizable":false,"tilt":0,"kmlrezoom":false,"poi":true,"imageoverlays":[],"markercluster":false,"searchmarkers":"","locations":[{"text":"","title":"","link":null,"lat":44.397987,"lon":-71.590306,"alt":0,"address":"","icon":"","group":"","inlineLabel":"","visitedicon":""}]}

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


181

Alternative Fuels Data Center: Maps and Data  

Alternative Fuels and Advanced Vehicles Data Center (EERE)

Driving Patterns Driving Patterns All Categories Vehicles AFVs and HEVs Fuel Consumption and Efficiency Vehicle Market Driving Patterns Fuels & Infrastructure Fuel Trends Emissions Alternative Fueling Stations Idle Reduction Transportation Infrastructure Biofuels Production Laws & Incentives Regulated Fleets Federal Fleets State & Alt Fuel Providers Clean Cities Vehicles Petroleum Use Reduction Program OR Go Sort by: Category Most Recent Most Popular 9 results Generated_thumb20130810-31804-1cr1wpv Annual Vehicle Miles Traveled in the U.S. Generated_thumb20130810-31804-1cr1wpv Trend of Vehicle-Miles Traveled in the U.S. from 1970-2013 Last update April 2013 View Graph Graph Download Data Generated_thumb20130810-31804-pe0nga Average Vehicle Trip Length by Purpose Generated_thumb20130810-31804-pe0nga

182

Alternative Fuels Data Center: Maps and Data  

Alternative Fuels and Advanced Vehicles Data Center (EERE)

Petroleum Use Reduction Petroleum Use Reduction All Categories Vehicles AFVs and HEVs Fuel Consumption and Efficiency Vehicle Market Driving Patterns Fuels & Infrastructure Fuel Trends Emissions Alternative Fueling Stations Idle Reduction Transportation Infrastructure Biofuels Production Laws & Incentives Regulated Fleets Federal Fleets State & Alt Fuel Providers Clean Cities Vehicles Petroleum Use Reduction Program OR Go Sort by: Category Most Recent Most Popular 4 results Generated_thumb20131211-30676-7w9hmt Clean Cities Cumulative Petroleum Savings Generated_thumb20131211-30676-7w9hmt Trend of displacement by all fuel and technology types from 1994-2012 Last update December 2013 View Graph Graph Download Data Generated_thumb20131211-30676-1y0adz7 Clean Cities Petroleum Savings by AFV Type

183

Alternative Fuels Data Center: Maps and Data  

Alternative Fuels and Advanced Vehicles Data Center (EERE)

AFVs and HEVs AFVs and HEVs All Categories Vehicles AFVs and HEVs Fuel Consumption and Efficiency Vehicle Market Driving Patterns Fuels & Infrastructure Fuel Trends Emissions Alternative Fueling Stations Idle Reduction Transportation Infrastructure Biofuels Production Laws & Incentives Regulated Fleets Federal Fleets State & Alt Fuel Providers Clean Cities Vehicles Petroleum Use Reduction Program OR Go Sort by: Category Most Recent Most Popular 21 results Generated_thumb20130810-31804-1ch454p AFV Acquisitions by Regulated Fleets (by Fleet Type) Generated_thumb20130810-31804-1ch454p Trend of S&FP AFV acquisitions by fleet type from 1992-2010 Last update May 2011 View Graph Graph Download Data Generated_thumb20130810-31804-14nv4j5 AFV Acquisitions by Regulated Fleets (by Fuel Type)

184

Alternative Fuels Data Center: Maps and Data  

Alternative Fuels and Advanced Vehicles Data Center (EERE)

Federal Fleets Federal Fleets All Categories Vehicles AFVs and HEVs Fuel Consumption and Efficiency Vehicle Market Driving Patterns Fuels & Infrastructure Fuel Trends Emissions Alternative Fueling Stations Idle Reduction Transportation Infrastructure Biofuels Production Laws & Incentives Regulated Fleets Federal Fleets State & Alt Fuel Providers Clean Cities Vehicles Petroleum Use Reduction Program OR Go Sort by: Category Most Recent Most Popular 1 result Generated_thumb20130810-31804-rbol8w AFV Acquisitions, Requirements, and Credits for Federal Agencies Generated_thumb20130810-31804-rbol8w Last update May 2012 View Graph Graph Download Data AFV Acquisitions, Requirements, and Credits for Federal Agencies 2000 2001 2002 2003 2004 2005 2006 2007 2008 2009 2010 2011 AFV Requirements 15606 16182 13555 19874 13827 13953 13702 13153 12321 14581 14059 12519

185

Alternative Fuels Data Center: Maps and Data  

Alternative Fuels and Advanced Vehicles Data Center (EERE)

Trends Trends All Categories Vehicles AFVs and HEVs Fuel Consumption and Efficiency Vehicle Market Driving Patterns Fuels & Infrastructure Fuel Trends Emissions Alternative Fueling Stations Idle Reduction Transportation Infrastructure Biofuels Production Laws & Incentives Regulated Fleets Federal Fleets State & Alt Fuel Providers Clean Cities Vehicles Petroleum Use Reduction Program OR Go Sort by: Category Most Recent Most Popular 9 results Generated_thumb20131212-30432-1q2ycmx Average Retail Fuel Prices in the U.S. Generated_thumb20131212-30432-1q2ycmx Trend of alternative and traditional motor fuel prices from 2000-2013 Last update December 2013 View Graph Graph Download Data Generated_thumb20130810-31804-eaiva6 Consumption of Natural Gas in the U.S. Generated_thumb20130810-31804-eaiva6

186

Alternative Fuels Data Center: Maps and Data  

Alternative Fuels and Advanced Vehicles Data Center (EERE)

Clean Cities Clean Cities All Categories Vehicles AFVs and HEVs Fuel Consumption and Efficiency Vehicle Market Driving Patterns Fuels & Infrastructure Fuel Trends Emissions Alternative Fueling Stations Idle Reduction Transportation Infrastructure Biofuels Production Laws & Incentives Regulated Fleets Federal Fleets State & Alt Fuel Providers Clean Cities Vehicles Petroleum Use Reduction Program OR Go Sort by: Category Most Recent Most Popular 10 results Petroleum Use Reduction - Generated_thumb20131211-30676-7w9hmt Clean Cities Cumulative Petroleum Savings Generated_thumb20131211-30676-7w9hmt Trend of displacement by all fuel and technology types from 1994-2012 Last update December 2013 View Graph Graph Download Data Generated_thumb20131211-30676-1y0adz7 Clean Cities Petroleum Savings by AFV Type

187

Alternative Fuels Data Center: Maps and Data  

Alternative Fuels and Advanced Vehicles Data Center (EERE)

State & Alt Fuel Providers State & Alt Fuel Providers All Categories Vehicles AFVs and HEVs Fuel Consumption and Efficiency Vehicle Market Driving Patterns Fuels & Infrastructure Fuel Trends Emissions Alternative Fueling Stations Idle Reduction Transportation Infrastructure Biofuels Production Laws & Incentives Regulated Fleets Federal Fleets State & Alt Fuel Providers Clean Cities Vehicles Petroleum Use Reduction Program OR Go Sort by: Category Most Recent Most Popular 6 results Generated_thumb20130810-31804-1ch454p AFV Acquisitions by Regulated Fleets (by Fleet Type) Generated_thumb20130810-31804-1ch454p Trend of S&FP AFV acquisitions by fleet type from 1992-2010 Last update May 2011 View Graph Graph Download Data Generated_thumb20130810-31804-14nv4j5 AFV Acquisitions by Regulated Fleets (by Fuel Type)

188

Alternative Fuels Data Center: Maps and Data  

Alternative Fuels and Advanced Vehicles Data Center (EERE)

Consumption and Efficiency Consumption and Efficiency All Categories Vehicles AFVs and HEVs Fuel Consumption and Efficiency Vehicle Market Driving Patterns Fuels & Infrastructure Fuel Trends Emissions Alternative Fueling Stations Idle Reduction Transportation Infrastructure Biofuels Production Laws & Incentives Regulated Fleets Federal Fleets State & Alt Fuel Providers Clean Cities Vehicles Petroleum Use Reduction Program OR Go Sort by: Category Most Recent Most Popular 13 results Generated_thumb20130810-31804-1ox6tpc Average Annual Fuel Use of Major Vehicle Categories Generated_thumb20130810-31804-1ox6tpc Comparison of fuel use, miles traveled, and fuel economy among vehicle types Last update April 2013 View Graph Graph Download Data Generated_thumb20130810-31804-ufdolp Average Annual Vehicle Miles Traveled of Major Vehicle Categories

189

Alternative Fuels Data Center: Maps and Data  

Alternative Fuels and Advanced Vehicles Data Center (EERE)

Emissions Emissions All Categories Vehicles AFVs and HEVs Fuel Consumption and Efficiency Vehicle Market Driving Patterns Fuels & Infrastructure Fuel Trends Emissions Alternative Fueling Stations Idle Reduction Transportation Infrastructure Biofuels Production Laws & Incentives Regulated Fleets Federal Fleets State & Alt Fuel Providers Clean Cities Vehicles Petroleum Use Reduction Program OR Go Sort by: Category Most Recent Most Popular 3 results Generated_thumb20130810-31804-53z5da Carbon Intensity of Alternative Fuels in California Heavy-Duty Vehicles Generated_thumb20130810-31804-53z5da California Low Carbon Fuel Program's assessment of lifecycle GHG emissions from alternative fuels Last update March 2011 View Graph Graph Download Data Generated_thumb20130810-31804-1b2rnlz

190

Alternative Fuels Data Center: Maps and Data  

Alternative Fuels and Advanced Vehicles Data Center (EERE)

Regulated Fleets Regulated Fleets All Categories Vehicles AFVs and HEVs Fuel Consumption and Efficiency Vehicle Market Driving Patterns Fuels & Infrastructure Fuel Trends Emissions Alternative Fueling Stations Idle Reduction Transportation Infrastructure Biofuels Production Laws & Incentives Regulated Fleets Federal Fleets State & Alt Fuel Providers Clean Cities Vehicles Petroleum Use Reduction Program OR Go Sort by: Category Most Recent Most Popular 7 results Federal Fleets - Generated_thumb20130810-31804-rbol8w AFV Acquisitions, Requirements, and Credits for Federal Agencies Generated_thumb20130810-31804-rbol8w Last update May 2012 View Graph Graph Download Data State & Alt Fuel Providers - Generated_thumb20130810-31804-1ch454p AFV Acquisitions by Regulated Fleets (by Fleet Type)

191

Alternative Fuels Data Center: Maps and Data  

Alternative Fuels and Advanced Vehicles Data Center (EERE)

Fuels & Infrastructure Fuels & Infrastructure All Categories Vehicles AFVs and HEVs Fuel Consumption and Efficiency Vehicle Market Driving Patterns Fuels & Infrastructure Fuel Trends Emissions Alternative Fueling Stations Idle Reduction Transportation Infrastructure Biofuels Production Laws & Incentives Regulated Fleets Federal Fleets State & Alt Fuel Providers Clean Cities Vehicles Petroleum Use Reduction Program OR Go Sort by: Category Most Recent Most Popular 49 results Fuel Trends - Generated_thumb20131212-30432-1q2ycmx Average Retail Fuel Prices in the U.S. Generated_thumb20131212-30432-1q2ycmx Trend of alternative and traditional motor fuel prices from 2000-2013 Last update December 2013 View Graph Graph Download Data Generated_thumb20130810-31804-eaiva6 Consumption of Natural Gas in the U.S.

192

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

193

Site Map  

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

Home » Site Map Home » Site Map Site Map Home About Overview NERSC Mission Contact us Staff Center Leadership Sudip Dosanjh Select Publications Jeff Broughton Katie Antypas John Shalf Francesca Verdier Center Administration James Craw Norma Early Jeff Grounds Betsy MacGowan Zaida McCunney Lynn Rippe Suzanne Stevenson David Tooker Center Communications Jon Bashor Linda Vu Margie Wylie Kathy Kincade Advanced Technologies Group Nicholas Wright Brian Austin Research Projects Matthew Cordery Christopher Daley Analytics Group Peter Nugent David Camp Hank Childs Harinarayan Krishnan Burlen Loring Joerg Meyer Prabhat Oliver Ruebel Daniela Ushizima Gunther Weber Yushu Yao Computational Systems Group Jay Srinivasan James Botts Scott Burrow Tina Butler Nick Cardo Tina Declerck Ilya Malinov David Paul Larry Pezzaglia Iwona Sakrejda

194

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

195

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

196

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

197

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

198

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

199

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

200

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

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


201

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

202

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

203

User_ViewRecords  

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

User Records User Records © 2011 SuccessFactors, Inc. - 1 - SuccessFactors Learning Confidential. All rights reserved. Job Aid: Viewing User Records Purpose The purpose of this job aid is to guide users through the step-by-step process of viewing their records. Each task demonstrates viewing of different records. Task A. View To-Do List Enter the web address (URL) of the user application into your browser Address field and press the Enter key. Enter your user ID in the User ID textbox. Enter your password in the Password textbox. Click Sign In. View To-Do List (filter, view) 7 Steps Task A View Completed Work 8 Steps Task B View Curriculum Status and Details 11 Steps Task C 3 3 1 2 2 1 SuccessFactors Learning v 6.4 User Job Aid Viewing User Records

204

states apps list view | Data.gov  

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

states apps list view states apps list view States Data Apps Challenges Policies States You are here Data.gov » Communities » States List View Showing 1 - 5 of 5 results. Resources sort ascending Type Last Updated On TrashBackwards Trash Backwards will connect you with current recycling information, Do It Yourself reuse and upcycle tutorials that are easy to follow, reliable articles and infographics, upcycled products and durable alternatives to common single-use items, and links to non-profits and other groups who will benefit greatly from the stuff you're done with. Currently includes Massachusetts and Washington. Apps 02/27/2013 MoDOT's Traveler Information Map App With the launch of MoDOT's new Traveler Information Map mobile app, Missouri travelers can get the latest information on road conditions, work zones, flooding and incidents on their iPhones and Androids. Mobile 05/22/2013

205

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

206

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

207

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

208

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

209

Transactional process views  

Science Conference Proceedings (OSTI)

To enable effective interorganisational collaborations, process providers have to disclose relevant parts of their local business processes in public process views. A public process view has to be consistent with the underlying private process. Local ...

Rik Eshuis; Jochem Vonk; Paul Grefen

2011-10-01T23:59:59.000Z

210

Isotone maps on lattices  

E-Print Network (OSTI)

Let (L_i : i\\in I) be a family of lattices in a nontrivial lattice variety V, and let \\phi_i: L_i --> M, for i\\in I, be isotone maps (not assumed to be lattice homomorphisms) to a common lattice M (not assumed to lie in V). We show that the maps \\phi_i can be extended to an isotone map \\phi: L --> M, where L is the free product of the L_i in V. This was known for V the variety of all lattices (Yu. I. Sorkin 1952). The above free product L can be viewed as the free lattice in V on the partial lattice P formed by the disjoint union of the L_i. The analog of the above result does not, however, hold for the free lattice L on an arbitrary partial lattice P. We show that the only codomain lattices M for which that more general statement holds are the complete lattices. On the other hand, we prove the analog of our main result for a class of partial lattices P that are not-quite-disjoint unions of lattices. We also obtain some results similar to our main one, but with the relationship lattices:orders replaced either...

Bergman, G M

2011-01-01T23:59:59.000Z

211

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

Science Conference Proceedings (OSTI)

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

Djamé Seddah; Bertrand Gaiffe

2005-04-01T23:59:59.000Z

212

Lake View Geothermal Facility | Open Energy Information  

Open Energy Info (EERE)

Page Page Edit with form History Facebook icon Twitter icon » Lake View Geothermal Facility Jump to: navigation, search GEOTHERMAL ENERGYGeothermal Home Lake View Geothermal Facility General Information Name Lake View Geothermal Facility Facility Lake View Sector Geothermal energy Location Information Location The Geysers, California Coordinates 38.823527148671°, -122.78173327446° Loading map... {"minzoom":false,"mappingservice":"googlemaps3","type":"ROADMAP","zoom":14,"types":["ROADMAP","SATELLITE","HYBRID","TERRAIN"],"geoservice":"google","maxzoom":false,"width":"600px","height":"350px","centre":false,"title":"","label":"","icon":"","visitedicon":"","lines":[],"polygons":[],"circles":[],"rectangles":[],"copycoords":false,"static":false,"wmsoverlay":"","layers":[],"controls":["pan","zoom","type","scale","streetview"],"zoomstyle":"DEFAULT","typestyle":"DEFAULT","autoinfowindows":false,"kml":[],"gkml":[],"fusiontables":[],"resizable":false,"tilt":0,"kmlrezoom":false,"poi":true,"imageoverlays":[],"markercluster":false,"searchmarkers":"","locations":[{"text":"","title":"","link":null,"lat":38.823527148671,"lon":-122.78173327446,"alt":0,"address":"","icon":"","group":"","inlineLabel":"","visitedicon":""}]}

213

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

214

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

215

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

216

ORNL DAAC Site Map  

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

Site Map ORNL DAAC Site Map About Us About ORNL DAAC Who We Are User Working Group Biogeochemical Dynamics Data Citation Policy News Newsletters Workshops Site Map Products...

217

Alternative Fuels Data Center  

Alternative Fuels and Advanced Vehicles Data Center (EERE)

Go Go Generated_thumb20130810-31804-12g76v6 Incentive and Law Additions by Targeted Agent Generated_thumb20130810-31804-12g76v6 Trend of state incentive and law enactments listed by the targeted agent from 2002-2010 Last update March 2013 View Graph Graph Download Data Natural-gas-stations Natural Gas Fueling Stations by State Natural-gas-stations View Map Graph Map_thumbnail Workplace Charging Challenge Partner Stations Map_thumbnail View Graph Graph Lng-stations Liquefied Natural Gas Fueling Stations by State Lng-stations View Map Graph L_i-electric Electric Vehicle Incentives and Laws, by State L_i-electric View Map Graph Propane_li_by_state Propane Incentives and Laws, by State Propane_li_by_state View Map Graph Generated_thumb20130810-31804-1f4rg7 On-Road AFVs Made Available by Year

218

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

219

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

220

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

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


221

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

222

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

223

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

224

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

225

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

226

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

227

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

228

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

229

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

230

Fermilab Map Instructions  

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

Fermilab interactive map is actually a series of maps. The first map in the series--the map that you just clicked on to get this window--is an overview of the entire Fermilab site....

231

map_legend  

Gasoline and Diesel Fuel Update (EIA)

c c Natural Gas Market Hub a Surface Congressional District (113th) Underground b Coal Mines U.S. States Map Legend County Boundary Power Plants K A B C E 0 G L H I J Biomass Coal Geothermal Market Hubs Transmission and Pipelines Hydro Natural Gas Other Fossil Gases Petroleum Pumped Storage Solar Wind Wood Petroleum Import Site f Northeast Home Heating Oil Reserve Site 4 j Petroleum Refinery h DOT NPMS Gas Transmission Pipeline Due to security constraints, only a single county's pipelines can be shown at a time for this layer. The natural gas interstate, intrastate, and gathering pipelines layer (see below) can be viewed across larger geographic areas, but is not as accurate or complete. DOT NPMS Hazardous Liquid Pipeline Hazardous liquids include crude oil, product, liquid petroleum gas, natural gas liquid, hydrogen gas,

232

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

233

Maps and Shuttle - TMS  

Science Conference Proceedings (OSTI)

TMS 2008 Conference Maps and Shuttle Information. Ernest N. Morial Convention Center Maps All conference events, including registration, technical sessions ...

234

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

235

Valley View Wind Farm | Open Energy Information  

Open Energy Info (EERE)

Wind Farm Wind Farm Jump to: navigation, search Name Valley View Wind Farm Facility Valley View Sector Wind energy Facility Type Commercial Scale Wind Facility Status In Service Owner Juhl Wind Developer Valley View Transmission Energy Purchaser Xcel Energy Location Outside Chandler MN Coordinates 43.905808°, -96.020508° Loading map... {"minzoom":false,"mappingservice":"googlemaps3","type":"ROADMAP","zoom":14,"types":["ROADMAP","SATELLITE","HYBRID","TERRAIN"],"geoservice":"google","maxzoom":false,"width":"600px","height":"350px","centre":false,"title":"","label":"","icon":"","visitedicon":"","lines":[],"polygons":[],"circles":[],"rectangles":[],"copycoords":false,"static":false,"wmsoverlay":"","layers":[],"controls":["pan","zoom","type","scale","streetview"],"zoomstyle":"DEFAULT","typestyle":"DEFAULT","autoinfowindows":false,"kml":[],"gkml":[],"fusiontables":[],"resizable":false,"tilt":0,"kmlrezoom":false,"poi":true,"imageoverlays":[],"markercluster":false,"searchmarkers":"","locations":[{"text":"","title":"","link":null,"lat":43.905808,"lon":-96.020508,"alt":0,"address":"","icon":"","group":"","inlineLabel":"","visitedicon":""}]}

236

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

237

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

E-Print Network (OSTI)

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

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

2007-01-01T23:59:59.000Z

238

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

E-Print Network (OSTI)

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

Wieland, Shannon Christine

2007-01-01T23:59:59.000Z

239

Taking the long view  

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

Taking the long view Taking the long view Taking the long view on environmental stewardship A newly articulated mission for environmental stewardship at the Laboratory can be summed up in a simple phrase: clean up the past, control current operations, and create a sustainable future. March 20, 2012 Los Alamos Aerial Aerial view of a canyon in Los Alamos, New Mexico. Contact Environmental Communication & Public Outreach P.O. Box 1663 MS M996 Los Alamos, NM 87545 (505) 667-0216 Email "The future viability of the Lab hinges on demonstrating to public that we protect human health and the environment." Environmental stewardship strategy looks 50 years into the future As a way of integrating environmental protection activities into a comprehensive strategy, Kevin Smith, manager of the U.S. Department of

240

A View from Elsewhere  

E-Print Network (OSTI)

Arcadia Project Review - A View From Elsewhere Tony Hirst Department of Communication and Systems, The Open University a.j.hirst@open.ac.uk Summary This report provides an overview of activities carried out during Michaelmas Term...

Hirst, Tony

2009-01-01T23:59:59.000Z

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


241

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

242

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

243

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

244

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

245

Nearly Euclidean Thurston maps  

E-Print Network (OSTI)

We introduce and study a class of Thurston maps from the 2-sphere to itself which we call nearly Euclidean Thurston (NET) maps. These are simple generalizations of Euclidean Thurston maps.

Cannon, James W; Parry, Walter R; Pilgrim, Kevin M

2012-01-01T23:59:59.000Z

246

Berkeley Lab Site Map  

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

Location Building - Map Location Building - Map Location Building - Map Location Advanced Light Source (Bldg. 6) - C3, C4 Bldg. 50 Auditorium - C2 Bldg. 66 Auditorium - D6...

247

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

248

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

249

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

250

Maps of Selected State Subdivisions  

Gasoline and Diesel Fuel Update (EIA)

Crude Oil, Natural Gas, and Natural Gas Liquids Proved Reserves Summary Maps of Selected State Subdivisions Map 1: Alaska Map 2: California Map 3: Louisiana Map 4: New Mexico Map...

251

Geothermal: Site Map  

Office of Scientific and Technical Information (OSTI)

GEOTHERMAL TECHNOLOGIES LEGACY COLLECTION - Site Map Geothermal Technologies Legacy Collection HelpFAQ | Site Map | Contact Us | Admin Log On HomeBasic Search About Publications...

252

TMS 2011: Maps  

Science Conference Proceedings (OSTI)

TMS 2011: Maps February 27 - March 3, 2011 • San Diego, California. Use these following maps and floor plans to help locate where you need to go.

253

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

254

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

255

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

256

Allinea MAP at NERSC  

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

MAP MAP MAP MAP from Allinea Software is a parallel profiler with a simple graphical user interface. It is installed on Hopper, Edison and Carver. Note that the performance of the X Windows-based MAP Graphical User Interface can be greatly improved if used in conjunction with the free NX software. Introduction Allinea MAP is a parallel profiler with simple Graphical User Interface. MAP can be run with up to 512 processors, to profile serial, OpenMP and MPI codes. The Allinea MAP web page and 'Allinea DDT and MAP User Guide' (available as $ALLINEA_TOOLS_DOCDIR/userguide.pdf after loading an allineatools module) are good resources for learning more about some of the advanced MAP features. Loading the Allinea Tools Module To use MAP, first load the 'allineatools' module to set the correct

257

Prarie View RDF  

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

PRAIRIE VIEW RDF PRAIRIE VIEW RDF 2 Prairie View RDF  Located at JAAP (approx. 40 miles southwest of Chicago), 223 acres on 455 Acre Parcel  Will County Owner; Waste Management, Operator  Maximum 23-Year Life WM/Will County Methane to Energy Plant  Landfill Contract Signed w/WM in 1997 w/Gas-to- Energy Plant Clause  County Retains Gas Rights &WM Installs Gas Collection System  WM owns Methane to Energy Plant &Tax Credits 3 CONTRACT PHASE  DOE Grant Applied 6/09  County Board Approves DOE EECBG Strategy 11/09  1 Million DOE Funds to Methane to Energy Plant  Schiff Harden Hired to Negotiate Gas to Energy Contract  February 2010 County Board Authorizes Contract Execution 4 5 METHANE TO ENERGY PLANT DETAILS  Waste Management Required To

258

Definition: Field Mapping-Structural Analysis | Open Energy Information  

Open Energy Info (EERE)

Field Mapping-Structural Analysis Field Mapping-Structural Analysis Jump to: navigation, search Dictionary.png Field Mapping-Structural Analysis Field mapping involves sending one or more geologist to a geothermal site of interest to collect and map surficial hydrologic, geologic and structural information that might be useful in identifying a hydrothermal system. View on Wikipedia Wikipedia Definition A geologic map or geological map is a special-purpose map made to show geological features. Rock units or geologic strata are shown by color or symbols to indicate where they are exposed at the surface. Bedding planes and structural features such as faults, folds, foliations, and lineations are shown with strike and dip or trend and plunge symbols which give these features' three-dimensional orientations. Stratigraphic contour

259

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

260

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

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


261

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

262

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

263

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

264

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

265

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

266

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

267

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

268

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

269

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

270

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

271

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

272

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

273

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

274

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

275

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

276

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

277

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

278

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

279

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

280

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

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


281

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

282

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

283

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

284

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

285

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

286

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

287

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

288

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

289

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

290

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

291

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

292

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

293

Quantization of Anosov maps  

SciTech Connect

Cat maps, linear automorphisms of the torus, are standard examples of classically chaotic systems, but they are periodic when quantized, leading to many untypical consequences. Anosov maps are topologically equivalent to cat maps despite being nonlinear. Generalizing the original quantization of cat maps, we establish that quantum Anosov maps have typical spectral fluctuations for classically chaotic systems. The periodic orbit theory for the spectra of quantum Anosov maps is not exact, as it is for cat maps. Nonetheless our calculations verify that the semiclassical trace of the propagator is accurate well beyond any ``log time`` cutoff. {copyright} 1995 Academic Press, Inc.

Basilio de Matos, M.; Ozorio de Almeida, A.M. [IF, Universidade Estadual de Campinas, 13081, Campinas, SP (Brazil)

1995-01-01T23:59:59.000Z

294

Emergency Exit Maps | Stanford Synchrotron Radiation Lightsource  

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

Emergency Exit Maps SSRL Exit Maps Exit map 219 exit map trailer 274 exit map 450 trailers exit map trailer 271 exit map trailer 270 exit map trailer 294 exit maps 118 & 117 exit...

295

consumer apps list view | Data.gov  

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

consumer apps list view consumer apps list view Consumer Data Apps Challenges Resources About Blogs Let's Talk Feedback Consumer You are here Data.gov » Communities » Consumer Smart Disclosure Apps This page highlights apps and websites that use Smart Disclosure-style data to empower consumers to make better informed choices. The purpose is to illustrate the kinds of innovative apps-web- and mobile-based-that Smart Disclosure can fuel. The galleries below include both government-produced apps and apps created by innovators outside government that have won Federal challenges. Showing 1 - 19 of 19 results. Resources sort ascending Type Last Updated On Smart Traveler Smart Traveler, the official State Department app for U.S. travelers, invites you to see the world with easy access to frequently updated official country information, travel alerts, travel warnings, maps, U.S. embassy locations, and more. Mobile 09/14/2012

296

Iterated maps for clarinet-like systems  

E-Print Network (OSTI)

The dynamical equations of clarinet-like systems are known to be reducible to a non-linear iterated map within reasonable approximations. This leads to time oscillations that are represented by square signals, analogous to the Raman regime for string instruments. In this article, we study in more detail the properties of the corresponding non-linear iterations, with emphasis on the geometrical constructions that can be used to classify the various solutions (for instance with or without reed beating) as well as on the periodicity windows that occur within the chaotic region. In particular, we find a regime where period tripling occurs and examine the conditions for intermittency. We also show that, while the direct observation of the iteration function does not reveal much on the oscillation regime of the instrument, the graph of the high order iterates directly gives visible information on the oscillation regime (characterization of the number of period doubligs, chaotic behaviour, etc.).

Pierre-André Taillard; Jean Kergomard; Franck Laloë

2009-12-12T23:59:59.000Z

297

ParaView at NERSC  

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

ParaView ParaView ParaView Introduction ParaView is an open-source, multi-platform data analysis and visualization application. ParaView users can quickly build visualizations to analyze their data using qualitative and quantitative techniques. The data exploration can be done interactively in 3D or programmatically using ParaView's batch processing capabilities. ParaView was developed to analyze extremely large datasets using distributed memory computing resources. It can be run on supercomputers to analyze datasets of terascale as well as on laptops for smaller data. Remote Visualization with ParaView ParaView is a client-server application. The ParaView client (or simply paraview) will run on your desktop while the server will run at the remote supercomputing site. The following describes the steps you will take to

298

Alternative Fuels Data Center: Maps and Data  

Alternative Fuels and Advanced Vehicles Data Center (EERE)

Transportation Infrastructure Transportation Infrastructure All Categories Vehicles AFVs and HEVs Fuel Consumption and Efficiency Vehicle Market Driving Patterns Fuels & Infrastructure Fuel Trends Emissions Alternative Fueling Stations Idle Reduction Transportation Infrastructure Biofuels Production Laws & Incentives Regulated Fleets Federal Fleets State & Alt Fuel Providers Clean Cities Vehicles Petroleum Use Reduction Program OR Go Sort by: Category Most Recent Most Popular 5 results Freight_tons_thumbnail Daily Truck Freight Tons Freight_tons_thumbnail Last update February 2013 View Image Graph Generated_thumb20130810-31804-v750g6 Miles of U.S. Transportation Infrastructure Generated_thumb20130810-31804-v750g6 Distance covered by different types of transportation infrastructure Last update April 2013

299

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

E-Print Network (OSTI)

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

Ellingham, M N

2009-01-01T23:59:59.000Z

300

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

Science Conference Proceedings (OSTI)

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

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

2011-06-14T23:59:59.000Z

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


301

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

SciTech Connect

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

Brost, Randolph C.; McLendon, William Clarence,

2013-01-01T23:59:59.000Z

302

Stereoscopic optical viewing system  

DOE Patents (OSTI)

An improved optical system which provides the operator with a stereoscopic viewing field and depth of vision, particularly suitable for use in various machines such as electron or laser beam welding and drilling machines. The system features two separate but independently controlled optical viewing assemblies from the eyepiece to a spot directly above the working surface. Each optical assembly comprises a combination of eye pieces, turning prisms, telephoto lenses for providing magnification, achromatic imaging relay lenses and final stage pentagonal turning prisms. Adjustment for variations in distance from the turning prisms to the workpiece, necessitated by varying part sizes and configurations and by the operator's visual accuity, is provided separately for each optical assembly by means of separate manual controls at the operator console or within easy reach of the operator.

Tallman, C.S.

1986-05-02T23:59:59.000Z

303

Parabolic-like maps  

E-Print Network (OSTI)

In this paper we introduce the notion of parabolic-like mapping, which is an object similar to a polynomial-like mapping, but with a parabolic external class, i.e. an external map with a parabolic fixed point. We prove a straightening theorem for parabolic-like maps, which states that any parabolic-like map of degree 2 is hybrid conjugate to a member of the family Per_1(1), and this member is unique (up to holomorphic conjugacy) if the filled Julia set of the parabolic-like map is connected.

Lomonaco, Luciana Luna Anna

2011-01-01T23:59:59.000Z

304

Stochastic kinetic models: Dynamic independence, modularity and graphs  

E-Print Network (OSTI)

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

Bowsher, Clive G

2010-01-01T23:59:59.000Z

305

Solving planning-graph by compiling it into CSP  

E-Print Network (OSTI)

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

Minh Binh Do; Subbarao Kambhampati

2000-01-01T23:59:59.000Z

306

Decoding linear codes via optimization and graph-based techniques  

E-Print Network (OSTI)

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

Taghavi, Mohammad H.

2008-01-01T23:59:59.000Z

307

On a base exchange game on bispanning graphs  

E-Print Network (OSTI)

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

Stephan Dominique Andres; Winfried Hochstättler; Markus Merkel

2011-01-01T23:59:59.000Z

308

COBE Sky Map  

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

COBE sky map COBE sky map This map of the ancient sky shows the minute variations in the microwave background discovered by the team led by Lawrence Berkeley Laboratory astrophysicist George Smoot. As seen in the map, vast regions of space have minute variations in temperature. Over billions of years, gravity magnified these small differences into the clusters of galaxies we observe today. Displayed horizontally across the middle of the map is the Milky Way galaxy. The image, a 360-degree map of the whole sky, shows the relic radiation from the Big Bang. The map was derived from one year of data taken by the Differential Microwave Radiometers onboard NASA's Cosmic Background Explorer satellite. Using Galactic coordinates, the map shows the plane of the Milky Way galaxy horizontally and the center of our galaxy at its

309

Automated reaction mapping  

Science Conference Proceedings (OSTI)

Automated reaction mapping is a fundamental first step in the analysis of chemical reactions and opens the door to the development of sophisticated chemical kinetic tools. This article formulates the reaction mapping problem as an optimization problem. ... Keywords: Cheminformatics, mechanisms

John D. Crabtree; Dinesh P. Mehta

2009-02-01T23:59:59.000Z

310

NREL: Dynamic Maps, GIS Data, and Analysis Tools - Solar Maps  

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

the Solar Maps Development - How the Maps Were Made page. Thumbnail image of the national solar photovoltaics (PV) resource potential in the United States map. Thumbnail image of...

311

Dynamic View Management System for Query Prediction to View Materialization  

Science Conference Proceedings (OSTI)

On-Line Analytical Processing OLAP systems based on data warehouses are the main systems for managerial decision making and must have a quick response time. Several algorithms have been presented to select the proper set of data and elicit suitable structured ... Keywords: Data Warehousing, Dynamic View Materialization, OLAP, Probabilistic Reasoning Approaches, View Prediction, View Selection

Negin Daneshpour; Ahmad Abdollahzadeh Barfourosh

2011-04-01T23:59:59.000Z

312

Quadtree relief mapping  

Science Conference Proceedings (OSTI)

Relief mapping is an image based technique for rendering surface details. It simulates depth on a polygonal model using a texture that encodes surface height. The presented method incorporates a quadtree structure to achieve a theoretically proven performance ... Keywords: image based rendering, pixel based displacement mapping, quadtree, relief mapping, surface details

M. F. A. Schroders; R. v. Gulik

2006-09-01T23:59:59.000Z

313

Quantitative DNA fiber mapping  

DOE Patents (OSTI)

The present invention relates generally to the DNA mapping and sequencing technologies. In particular, the present invention provides enhanced methods and compositions for the physical mapping and positional cloning of genomic DNA. The present invention also provides a useful analytical technique to directly map cloned DNA sequences onto individual stretched DNA molecules.

Gray, Joe W. (San Francisco, CA); Weier, Heinz-Ulrich G. (Oakland, CA)

1998-01-01T23:59:59.000Z

314

The View from HQ  

National Nuclear Security Administration (NNSA)

A publication of the Office of Advanced Simulation & Computing, NNSA Defense Programs A publication of the Office of Advanced Simulation & Computing, NNSA Defense Programs NA-ASC-500-07-Issue 3 May 2007 The View from HQ by Dimitri Kusnezov I have been spending much of my time these days thinking about science, technology and engineering and the role of the laboratories and how that will be reflected in the Complex of the future. This is on my mind for two reasons: one is my responsibility to

315

Informative Views and Active Recognition  

E-Print Network (OSTI)

Informative Views and Active Recognition Tal Arbel, Frank P. Ferrie, and Peter Whaite TR-CIM-94-7897 Email: cim@cim.mcgill.ca #12;Informative Views and Active Recognition Tal Arbel, Frank P. Ferrie

Dudek, Gregory

316

Ocean Map | Data.gov  

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

Map Ocean Data Tools Technical Guide Map Gallery Regional Planning Feedback Ocean You are here Data.gov Communities Ocean Map Gallery Planning for ocean, coastal, and Great...

317

maps | OpenEI Community  

Open Energy Info (EERE)

- 15:22 Multicolor Maps from Compound Queries ask queries compound queries developer Google maps maps multicolor result formats results Semantic Mediawiki Hi all, Recently, a...

318

Historical Maps Online  

E-Print Network (OSTI)

For 20 years, David Rumsey assembled a collection of more than 150,000 historical maps of the Americas and the world. Motivated by a desire to make his private map collection a free public resource, Rumsey then created an online map library, http://www.davidrumsey.com/, which currently has over 10,000 high resolution images of maps from his collection. He has also built a suite of tools for users to experience and interpret the maps online. These include GIS, which allows users to combine historical maps with modern geospatial data to see change over time. The online map collection can be accessed over the Internet from search engines, library catalogs, GIS databases and many other entry points. Rumsey continues to add new content to the online collection and develops new tools that improve both the user experience and the online library architecture.

Rumsey, David Y.

2005-01-31T23:59:59.000Z

319

Sequoia retains top ranking on Graph 500 for third year running  

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

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

320

Prairie View Gas Recovery Biomass Facility | Open Energy Information  

Open Energy Info (EERE)

Prairie View Gas Recovery Biomass Facility Prairie View Gas Recovery Biomass Facility Jump to: navigation, search Name Prairie View Gas Recovery Biomass Facility Facility Prairie View Gas Recovery Sector Biomass Facility Type Landfill Gas Location St. Joseph County, Indiana Coordinates 41.6228085°, -86.3376761° Loading map... {"minzoom":false,"mappingservice":"googlemaps3","type":"ROADMAP","zoom":14,"types":["ROADMAP","SATELLITE","HYBRID","TERRAIN"],"geoservice":"google","maxzoom":false,"width":"600px","height":"350px","centre":false,"title":"","label":"","icon":"","visitedicon":"","lines":[],"polygons":[],"circles":[],"rectangles":[],"copycoords":false,"static":false,"wmsoverlay":"","layers":[],"controls":["pan","zoom","type","scale","streetview"],"zoomstyle":"DEFAULT","typestyle":"DEFAULT","autoinfowindows":false,"kml":[],"gkml":[],"fusiontables":[],"resizable":false,"tilt":0,"kmlrezoom":false,"poi":true,"imageoverlays":[],"markercluster":false,"searchmarkers":"","locations":[{"text":"","title":"","link":null,"lat":41.6228085,"lon":-86.3376761,"alt":0,"address":"","icon":"","group":"","inlineLabel":"","visitedicon":""}]}

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


321

Logan View Public Schools Wind Project | Open Energy Information  

Open Energy Info (EERE)

View Public Schools Wind Project View Public Schools Wind Project Jump to: navigation, search Name Logan View Public Schools Wind Project Facility Logan View Public Schools Sector Wind energy Facility Type Community Wind Location NE Coordinates 41.651546°, -96.50457° Loading map... {"minzoom":false,"mappingservice":"googlemaps3","type":"ROADMAP","zoom":14,"types":["ROADMAP","SATELLITE","HYBRID","TERRAIN"],"geoservice":"google","maxzoom":false,"width":"600px","height":"350px","centre":false,"title":"","label":"","icon":"","visitedicon":"","lines":[],"polygons":[],"circles":[],"rectangles":[],"copycoords":false,"static":false,"wmsoverlay":"","layers":[],"controls":["pan","zoom","type","scale","streetview"],"zoomstyle":"DEFAULT","typestyle":"DEFAULT","autoinfowindows":false,"kml":[],"gkml":[],"fusiontables":[],"resizable":false,"tilt":0,"kmlrezoom":false,"poi":true,"imageoverlays":[],"markercluster":false,"searchmarkers":"","locations":[{"text":"","title":"","link":null,"lat":41.651546,"lon":-96.50457,"alt":0,"address":"","icon":"","group":"","inlineLabel":"","visitedicon":""}]}

322

Protective laser beam viewing device  

SciTech Connect

A protective laser beam viewing system or device including a camera selectively sensitive to laser light wavelengths and a viewing screen receiving images from the laser sensitive camera. According to a preferred embodiment of the invention, the camera is worn on the head of the user or incorporated into a goggle-type viewing display so that it is always aimed at the area of viewing interest to the user and the viewing screen is incorporated into a video display worn as goggles over the eyes of the user.

Neil, George R.; Jordan, Kevin Carl

2012-12-18T23:59:59.000Z

323

The View from HQ  

National Nuclear Security Administration (NNSA)

  NA-ASC-500-07 Issue 2 January 2007 The View from HQ Sitting in airports and planes is risky beyond the obvious dangers now in the news. Uninter- rupted time to think may lead to new ideas. Instinct instructs us that when we hear Wash- ington has some new ideas, the result must be bad. After all, ideas suggest change, which is inherently disruptive. Today the notion of predictivity is on my mind as I am leaving the V&V 2007 meeting in Los Alamos. Predictivity is on my short list of overused, ill-defined words. Washington main- tains a full lexicon of such words-a fair number of which find their way into common usage.

324

False color viewing device  

DOE Patents (OSTI)

This invention consists of a viewing device for observing objects in near-infrared false-color comprising a pair of goggles with one or more filters in the apertures, and pads that engage the face for blocking stray light from the sides so that all light reaching, the user`s eyes come through the filters. The filters attenuate most visible light and pass near-infrared (having wavelengths longer than approximately 700 nm) and a small amount of blue-green and blue-violet (having wavelengths in the 500 to 520 nm and shorter than 435 nm, respectively). The goggles are useful for looking at vegetation to identify different species and for determining the health of the vegetation, and to detect some forms of camouflage.

Kronberg, J.W.

1991-05-08T23:59:59.000Z

325

False color viewing device  

DOE Patents (OSTI)

A viewing device for observing objects in near-infrared false-color comprising a pair of goggles with one or more filters in the apertures, and pads that engage the face for blocking stray light from the sides so that all light reaching the user's eyes come through the filters. The filters attenuate most visible light and pass near-infrared (having wavelengths longer than approximately 700 nm) and a small amount of blue-green and blue-violet (having wavelengths in the 500 to 520 nm and shorter than 435 nm, respectively). The goggles are useful for looking at vegetation to identify different species and for determining the health of the vegetation, and to detect some forms of camouflage.

Kronberg, James W. (108 Independent Blvd., Aiken, SC 29801)

1992-01-01T23:59:59.000Z

326

False color viewing device  

DOE Patents (OSTI)

A viewing device for observing objects in near-infrared false-color comprising a pair of goggles with one or more filters in the apertures, and pads that engage the face for blocking stray light from the sides so that all light reaching the user's eyes come through the filters. The filters attenuate most visible light and pass near-infrared (having wavelengths longer than approximately 700 nm) and a small amount of blue-green and blue-violet (having wavelengths in the 500 to 520 nm and shorter than 435 nm, respectively). The goggles are useful for looking at vegetation to identify different species and for determining the health of the vegetation, and to detect some forms of camouflage. 7 figs.

Kronberg, J.W.

1992-10-20T23:59:59.000Z

327

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

E-Print Network (OSTI)

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

Jing Zhang

2010-06-21T23:59:59.000Z

328

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

Science Conference Proceedings (OSTI)

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

Mustapha Aouchiche; Odile Favaron; Pierre Hansen

2009-10-01T23:59:59.000Z

329

Maps of Selected State Subdivisions  

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

Crude Oil, Natural Gas, and Natural Gas Liquids Crude Oil, Natural Gas, and Natural Gas Liquids Proved Reserves Summary Maps of Selected State Subdivisions Map 1: Alaska Map 2: California Map 3: Louisiana Map 4: New Mexico Map 5: Texas Map 6: Western Planning Area, Gulf of Mexico Map 7: Central Planning Area, Gulf of Mexico Map 8: Eastern Planning Area, Gulf of Mexico Map 1: Alaska AK 50 - North Onshore and Offshore AK 10 - South Onshore AK 05 - South State Offshore AK 00 - South Federal Offshore Map 2: California CA 50 - Coastal Region Onshore CA 90 - Los Angeles Basin Onshore CA 10 - San Joaquin Basin Onshore

330

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

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

331

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

Science Conference Proceedings (OSTI)

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

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

1995-01-01T23:59:59.000Z

332

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

Science Conference Proceedings (OSTI)

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

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

1989-01-01T23:59:59.000Z

333

Improved Complexity Bound of Vertex Cover for Low degree Graph  

E-Print Network (OSTI)

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

Yue, Weiya; Cao, Weiwei

2010-01-01T23:59:59.000Z

334

On Thurston's pullback map  

E-Print Network (OSTI)

Let f: P^1 \\to P^1 be a rational map with finite postcritical set P_f. Thurston showed that f induces a holomorphic map \\sigma_f of the Teichmueller space T modelled on P_f to itself fixing the basepoint corresponding to the identity map (P^1, P_f) \\to (P^1, P_f). We give explicit examples of such maps f showing that the following cases may occur: (1) the basepoint is an attracting fixed point, the image of \\sigma_f is open and dense, and the map \\sigma_f is a covering map onto its image; (2) the basepoint is a superattracting fixed point, \\sigma is surjective, and \\sigma is a ramified Galois covering, (3) \\sigma_f is constant.

Buff, Xavier; Koch, Sarah; Pilgrim, Kevin

2011-01-01T23:59:59.000Z

335

Zoomable map of poplar proteins | ornl.gov  

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

'Zoomable' map of poplar proteins offers new view of bioenergy crop 'Zoomable' map of poplar proteins offers new view of bioenergy crop January 29, 2013 An extensive molecular map of poplar tree proteins from Oak Ridge National Laboratory offers new insight into the plant's biological processes. Knowing how poplar trees alter their proteins to change and adapt to environmental surroundings could help bioenergy researchers develop plants better suited to biofuel production. The study is featured on the cover of January's Molecular and Cellular Proteomics. Researchers seeking to improve production of ethanol from woody crops have a new resource in the form of an extensive molecular map of poplar tree proteins, published by a team from the Department of Energy's Oak Ridge National Laboratory (DOE ORNL). Populus, a fast-growing perennial tree, holds potential as a bioenergy crop

336

The Map Comparison Kit  

Science Conference Proceedings (OSTI)

Comparing maps is an important issue in environmental research. There are many reasons to compare maps: (i) to detect temporal/spatial changes or hot-spots, (ii) to compare different models, methodologies or scenarios, (iii) to calibrate, validate land-use ... Keywords: Calibration, Fuzzy kappa, Fuzzy-set map comparison, Geographic Information System, Hierarchical fuzzy pattern matching, Kappa, Land-use models, Remote sensing

H. Visser; T. de Nijs

2006-03-01T23:59:59.000Z

337

Maps | Department of Energy  

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

About Energy.gov » News & Blog » Maps About Energy.gov » News & Blog » Maps Maps Map Title Topics - Any - Tax Credits, Rebates, Savings Energy Efficiency -Homes --Heating & Cooling ---Heating ---Cooling ---Heat Pumps --Water Heating ---Swimming Pool Heaters --Home Weatherization ---Home Energy Audits ---Insulation ---Sealing Your Home ---Ventilation --Saving Electricity ---Lighting ---Appliances & Electronics ---Buying & Making Electricity --Design & Remodeling ---Windows, Doors, & Skylights --Landscaping -Vehicles --Alternative Fuel Vehicles --Fuel Economy --Batteries --Biofuels --Clean Cities -Building Design --Construction --Commercial Weatherization --Commercial Heating & Cooling --Commercial Lighting --Solar Decathlon -Manufacturing Energy Sources -Renewables --Solar ---SunShot --Wind --Water

338

Maps | Department of Energy  

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

About Energy.gov » News & Blog » Maps About Energy.gov » News & Blog » Maps Maps Map Title Topics - Any - Tax Credits, Rebates, Savings Energy Efficiency -Homes --Heating & Cooling ---Heating ---Cooling ---Heat Pumps --Water Heating ---Swimming Pool Heaters --Home Weatherization ---Home Energy Audits ---Insulation ---Sealing Your Home ---Ventilation --Saving Electricity ---Lighting ---Appliances & Electronics ---Buying & Making Electricity --Design & Remodeling ---Windows, Doors, & Skylights --Landscaping -Vehicles --Alternative Fuel Vehicles --Fuel Economy --Batteries --Biofuels --Clean Cities -Building Design --Construction --Commercial Weatherization --Commercial Heating & Cooling --Commercial Lighting --Solar Decathlon -Manufacturing Energy Sources -Renewables --Solar ---SunShot --Wind --Water

339

RMOTC RMOTC -Site Map  

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

Site Map Home About Us About Us Staff Field Info History Photo Gallery Awards & Testimonials Safety Initiatives Outreach & Community News Latest News Newsletters Press Releases...

340

Multithreaded Algorithms for Maximum Matching in Bipartite Graphs  

Science Conference Proceedings (OSTI)

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

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

2012-05-31T23:59:59.000Z

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


341

INDDGO: Integrated Network Decomposition & Dynamic programming for Graph Optimization  

SciTech Connect

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

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

2012-10-01T23:59:59.000Z

342

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

E-Print Network (OSTI)

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

Andrea Bedini; Jesper Lykke Jacobsen

2010-03-25T23:59:59.000Z

343

Positioning using local maps  

Science Conference Proceedings (OSTI)

It is often useful to know the positions of nodes in a network. However, in a large network it is impractical to build a single global map. In this paper, we present a new approach for distributed localization called Positioning using Local Maps (PLM). ... Keywords: Localization, Multidimensional scaling, Multilateration, Relative position estimation

Yi Shang; Wheeler Ruml; Markus P. J. Fromherz

2006-03-01T23:59:59.000Z

344

National Magnetic Anomaly Map  

DOE Green Energy (OSTI)

A record of the conclusions of a three-day meeting and workshop of the Committee for a National Magnetic Anomaly Map held in February 1976 is presented. The purpose of he workshop was to prepare a statement of the benefits, objectives, specifications, and requirements of a NMAM and establish a working plan for producing the map. (ACR)

Not Available

1976-01-01T23:59:59.000Z

345

Integrated Management Requirements mapping  

Science Conference Proceedings (OSTI)

This document contains five appendices documenting how Sandia implemented the DOE Conduct of Operations (5480.19) and DOE Quality Assurance (5700.6C) orders. It provides a mapping of the Sandia integrated requirements to the specific requirements of each Order and a mapping to Sandia's approved program for implementing the Conduct of Operations Order.

Holmes, J.T.; Andrews, N.S.

1992-06-01T23:59:59.000Z

346

Mountain View IV | Open Energy Information  

Open Energy Info (EERE)

IV IV Facility Mountain View IV Sector Wind energy Facility Type Commercial Scale Wind Facility Status In Service Owner AES Wind Generation Developer AES Wind Generation Energy Purchaser Southern California Edison Co Location White Water CA Coordinates 33.95475187°, -116.7015839° Loading map... {"minzoom":false,"mappingservice":"googlemaps3","type":"ROADMAP","zoom":14,"types":["ROADMAP","SATELLITE","HYBRID","TERRAIN"],"geoservice":"google","maxzoom":false,"width":"600px","height":"350px","centre":false,"title":"","label":"","icon":"","visitedicon":"","lines":[],"polygons":[],"circles":[],"rectangles":[],"copycoords":false,"static":false,"wmsoverlay":"","layers":[],"controls":["pan","zoom","type","scale","streetview"],"zoomstyle":"DEFAULT","typestyle":"DEFAULT","autoinfowindows":false,"kml":[],"gkml":[],"fusiontables":[],"resizable":false,"tilt":0,"kmlrezoom":false,"poi":true,"imageoverlays":[],"markercluster":false,"searchmarkers":"","locations":[{"text":"","title":"","link":null,"lat":33.95475187,"lon":-116.7015839,"alt":0,"address":"","icon":"","group":"","inlineLabel":"","visitedicon":""}]}

347

E-print Network : Main View : Deep Federated Search  

Office of Scientific and Technical Information (OSTI)

E-print Network E-print Network Search Powered By Deep Web Technologies New Search Preferences E-print Network E-print Network Skip to main content FAQ * HELP * SITE MAP * CONTACT US Home * About * Advanced Search * Browse by Discipline * Scientific Societies * E-print Alerts * Add E-prints Powered by Deep Web Technologies E-print Network E-print Network Skip to main content FAQ * HELP * SITE MAP * CONTACT US Home * About * Advanced Search * Browse by Discipline * Scientific Societies * E-print Alerts * Add E-prints Main View This view is used for searching all possible sources. Due to the varied configuration and diversity of web pages and databases searched by E-prints, Full Record will search whatever data is searchable at each site. Multiple arXiv sites under one general heading are combined

348

map | OpenEI  

Open Energy Info (EERE)

map map Dataset Summary Description (Abstract): A map depicting model estimates of monthly average daily total radiation using inputs derived from satellite and surface observations of cloud cover, aerosol optical depth, precipitable water vapor, albedo, atmospheric pressure and ozone sampled at a 40km resolution. (Purpose): A visual depiction of solar energy resource for photovoltaic power systems. Source NREL Date Released December 11th, 2003 (11 years ago) Date Updated October 30th, 2007 (7 years ago) Keywords Cuba GEF GHI map NREL solar SWERA UNEP Data application/pdf icon Download Maps (pdf, 1.3 MiB) Quality Metrics Level of Review Some Review Comment Temporal and Spatial Coverage Frequency Time Period License License Open Data Commons Attribution License Comment Please cite NREL and UNEP SWERA.

349

maps | OpenEI  

Open Energy Info (EERE)

maps maps Dataset Summary Description (Abstract): 50 m wind power density (W/m2) maps of Sri Lanka (Purpose): To provide information on the wind resource potential within Sri Lanka, with supplemental information on political boundaries, transmission lines, roads, and terrain relief. Source NREL Date Released June 30th, 2004 (10 years ago) Date Updated November 01st, 2007 (7 years ago) Keywords GEF GIS maps NREL Sri Lanka SWERA UNEP wind Data application/zip icon Download Maps (zip, 799.1 KiB) Quality Metrics Level of Review Some Review Comment Temporal and Spatial Coverage Frequency Time Period License License Open Data Commons Public Domain Dedication and Licence (PDDL) Comment Rate this dataset Usefulness of the metadata Average vote Your vote Usefulness of the dataset

350

Solving planning-graph by compiling it into CSP Minh Binh Do & Subbarao Kambhampati  

E-Print Network (OSTI)

Solving planning-graph by compiling it into CSP Minh Binh Do & Subbarao Kambhampati Department to adapt CSP search techniques into the backward search phase of Graphplan. This paper describes GP-CSP, a system that does planning by automati- cally converting Graphplan's planning graph into a CSP encoding

Kambhampati, Subbarao

351

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

E-Print Network (OSTI)

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

Bedini, Andrea

2010-01-01T23:59:59.000Z

352

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

Science Conference Proceedings (OSTI)

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

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

2010-10-01T23:59:59.000Z

353

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

E-Print Network (OSTI)

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

Slatton, Clint

354

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

E-Print Network (OSTI)

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

Paris-Sud XI, Université de

355

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

Science Conference Proceedings (OSTI)

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

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

2013-07-01T23:59:59.000Z

356

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

E-Print Network (OSTI)

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

Bapat, Ravindra B.

357

Facet defining inequalities among graph invariants: The system GraPHedron  

Science Conference Proceedings (OSTI)

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

Hadrien Mélot

2008-05-01T23:59:59.000Z

358

A New Conceptual Graph Generated Algorithm for Semi-structured Databases  

Science Conference Proceedings (OSTI)

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

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

2001-10-01T23:59:59.000Z

359

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

E-Print Network (OSTI)

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

Calamoneri, Tiziana

360

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

E-Print Network (OSTI)

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

Paris-Sud XI, Université de

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


361

Folksonomy link prediction based on a tripartite graph for tag recommendation  

Science Conference Proceedings (OSTI)

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

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

2013-04-01T23:59:59.000Z

362

A Space-Filling Visualization Technique for Multivariate Small World Graphs  

Science Conference Proceedings (OSTI)

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

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

2012-03-15T23:59:59.000Z

363

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

Science Conference Proceedings (OSTI)

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

Edith Elkind

2005-06-01T23:59:59.000Z

364

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

Science Conference Proceedings (OSTI)

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

Nancy Tufts Allen

1998-10-01T23:59:59.000Z

365

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

Science Conference Proceedings (OSTI)

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

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

2004-12-01T23:59:59.000Z

366

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

SciTech Connect

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

Martin, S.P.

1991-02-01T23:59:59.000Z

367

Alternative Fuels Data Center  

Alternative Fuels and Advanced Vehicles Data Center (EERE)

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

368

Informative Views and Sequential Recognition  

E-Print Network (OSTI)

Informative Views and Sequential Recognition Tal Arbel and Frank P. Ferrie TR-CIM-95-10 Nov. 1995 3 Telephone: 514 398-6319 Telex: 05 268510 FAX: 514 398-7348 Email: cim@cim.mcgill.ca #12;Informative Views

Dudek, Gregory

369

Bartlett's Ocean View Wind Farm | Open Energy Information  

Open Energy Info (EERE)

Bartlett's Ocean View Wind Farm Bartlett's Ocean View Wind Farm Jump to: navigation, search Name Bartlett's Ocean View Wind Farm Facility Bartlett's Ocean View Wind Farm Sector Wind energy Facility Type Community Wind Facility Status In Service Owner Bartlett's Ocean View Wind Farm Energy Purchaser Bartlett's Ocean View Wind Farm Location Nantucket MA Coordinates 41.259168°, -70.131913° Loading map... {"minzoom":false,"mappingservice":"googlemaps3","type":"ROADMAP","zoom":14,"types":["ROADMAP","SATELLITE","HYBRID","TERRAIN"],"geoservice":"google","maxzoom":false,"width":"600px","height":"350px","centre":false,"title":"","label":"","icon":"","visitedicon":"","lines":[],"polygons":[],"circles":[],"rectangles":[],"copycoords":false,"static":false,"wmsoverlay":"","layers":[],"controls":["pan","zoom","type","scale","streetview"],"zoomstyle":"DEFAULT","typestyle":"DEFAULT","autoinfowindows":false,"kml":[],"gkml":[],"fusiontables":[],"resizable":false,"tilt":0,"kmlrezoom":false,"poi":true,"imageoverlays":[],"markercluster":false,"searchmarkers":"","locations":[{"text":"","title":"","link":null,"lat":41.259168,"lon":-70.131913,"alt":0,"address":"","icon":"","group":"","inlineLabel":"","visitedicon":""}]}

370

NREL: Dynamic Maps, GIS Data, and Analysis Tools - MapSearch  

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

Bookmark and Share Bookmark and Share MapSearch MapSearch Logo is a computer monitor with a magnifying glass suspended in the air before it. Use our MapSearch to easily search our collection of maps created by the Geographic Information System (GIS) team. Please use the search box and the filters on the left and right of the screen to limit results. Notice: The current tool works best in Firefox and may result in errors if opened using Microsoft Internet Explorer. June 2013 - The NREL GIS team has released a new beta version of the Mapsearch tool. This new beta version should eliminate some of the browser issues experienced with the current tool. The beta version is designed to work with NREL's OpenEI so users will have one site to search and view NREL created maps. If you have any feeback or comments on this new beta site, contact the Webmaster. While testing is done on this new beta version, the current MapSearch tool is still available. The following instructions apply to the current tool. launch

371

Site Map - Pantex Plant  

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

Site Map Site Map Site Map Page Content Pantex.com Mission & Strategies Mission National Security Nuclear Explosive Operations Nuclear Material Operations HE Operations Strategies Advance HE Center of Excellence Exemplify a High Reliability Organization Health & Safety Safety Training Occupational Medicine Contractor Safety Environment Environmental Projects & Operations Regulatory Compliance Waste Operations Environmental Management System Environmental Document Library Public Meetings Doing Business With Pantex Procurement How We Buy Subcontracting Opportunities Supplier Information Profile Suspect/Counterfiet Items Business Definitions Documents and Forms Accounts Payable Work for Others Our Capabilities How to do Business with the Pantex eXMC Employee Information Benefits

372

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

Science Conference Proceedings (OSTI)

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

Amalendu Mukherjee; Vikas Rastogi; Anirvan Dasgupta

2006-04-01T23:59:59.000Z

373

Linking SARAH and MadGraph using the UFO format  

E-Print Network (OSTI)

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

Staub, Florian

2012-01-01T23:59:59.000Z

374

Graph fusion algebras of WLM(p,p')  

E-Print Network (OSTI)

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

Jorgen Rasmussen

2009-11-17T23:59:59.000Z

375

Improved Mapping of Tropospheric Delays  

Science Conference Proceedings (OSTI)

The authors compare several methods to map the a priori tropospheric delay of global positioning system (GPS) signals from the zenith direction to lower elevations. This is commonly achieved with so-called mapping functions. Dry mapping functions ...

Christian Rocken; Sergey Sokolovskiy; James M. Johnson; Doug Hunt

2001-07-01T23:59:59.000Z

376

Semantic mapping using mobile robots  

Science Conference Proceedings (OSTI)

Robotic mapping is the process of automatically constructing an environment representation using mobile robots. We address the problem of semantic mapping, which consists of using mobile robots to create maps that represent not only metric occupancy ...

Denis Fernando Wolf / Gaurav S. Sukhatme

2006-01-01T23:59:59.000Z

377

Web Site Map  

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

Help » Web Site Map Help » Web Site Map Web Site Map The links listed below include all pages on the site except document topic pages. Home Privacy/Security Help Web Site Map Mailing Services Remove me from the List Contact Us About Us News and Events News Archives News/Media FAQs Internet Resources Documents DUF6 EIS Historical Context What is an EIS? Why EIS is Needed Who is Responsible? EIS Process EIS Topics EIS Alternatives EIS Schedule Public Involvement Opportunities Public Comment Form For More Info DUF6 Management and Uses Management Responsibilities DUF6 Storage How DUF6 is Stored Where DUF6 is Stored Cylinder Leakage DUF6 Storage Safety DUF6 PEIS Cylinder Surveillance and Maintenance Conversion Potential DU Uses "Business Case" for R&D on Beneficial Uses of DU Catalysts for Destruction of Air Pollutants

378

Maps & Directions | ORNL  

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

Maps & Directions ORNL is located in Roane County, Tennessee, about 7 miles from the center of the city of Oak Ridge and about 25 miles from the McGhee Tyson Airport near...

379

ARM - Instrument - maps  

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

govInstrumentsmaps Documentation MAPS : XDC documentation ARM Data Discovery Browse Data Comments? We would love to hear from you Send us a note below or call us at...

380

CistromeMap  

Science Conference Proceedings (OSTI)

Summary: Transcription and chromatin regulators, and histone modifications play essential roles in gene expression regulation. We have created CistromeMap as a web server to provide a comprehensive knowledgebase of all of the publicly available ...

Bo Qin; Meng Zhou; Ying Ge; Len Taing; Tao Liu; Qian Wang; Su Wang; Junsheng Chen; Lingling Shen; Xikun Duan; Sheng'en Hu; Wei Li; Henry Long; Yong Zhang; X. Shirley Liu

2012-05-01T23:59:59.000Z

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


381

NREL: MapSearch  

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

to easily search our collection of maps created by the Geographic Information System (GIS) team. Please use the search box and the filters on the left of the screen to limit...

382

Space Mapping - Optimization Online  

E-Print Network (OSTI)

Thus, we can usec oP–to locally minimize the surrogatecoP that the space. mappingP provides for the fine model“.An alternative surrogate introduced byMadsen ...

383

Wind Resource Maps (Postcard)  

DOE Green Energy (OSTI)

The U.S. Department of Energy's Wind Powering America initiative provides high-resolution wind maps and estimates of the wind resource potential that would be possible from development of the available windy land areas after excluding areas unlikely to be developed. This postcard is a marketing piece that stakeholders can provide to interested parties; it will guide them to Wind Powering America's online wind energy resource maps.

Not Available

2011-07-01T23:59:59.000Z

384

Map Data: State Spending | Department of Energy  

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

Spending Map Data: State Spending sedsstatespendingpc2009.csv More Documents & Publications Map Data: Renewable Production Map Data: State Consumption...

385

Map Data: State Consumption | Department of Energy  

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

Consumption Map Data: State Consumption stateconsumptionpc2009.csv More Documents & Publications Map Data: Renewable Production Map Data: State Spending...

386

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

Science Conference Proceedings (OSTI)

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

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

2010-08-01T23:59:59.000Z

387

Evolving Views of Pectin Biosynthesis  

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

BIOSYNTHESIS DURING PRIMARY AND SECONDARY WALL FORMATION Multiple lines of evidence have led to a new view of primary wall architecture and the role of pectin therein. Dick-P...

388

Risk View Software Functional Specification  

Science Conference Proceedings (OSTI)

This report defines the functional requirements for a new Risk View software product to be developed as part of the Electric Power Research Institute's (EPRI's) Operations and Maintenance Excellence (OMX) initiative. plant information sources.

2010-09-30T23:59:59.000Z

389

Map Data: DOE Facilities | Department of Energy  

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

DOE Facilities Map Data: DOE Facilities doefacilities.csv More Documents & Publications Map Data: Renewable Production Map Data: State Spending Map Data: State Consumption...

390

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

E-Print Network (OSTI)

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

Maw-shang Chang

1998-01-01T23:59:59.000Z

391

Site Map - Energy Innovation Portal  

Energy Innovation Portal. Home. Site Map; ... Solar Thermal; Startup America; ... National Aeronautics and Space Administration;

392

Site Map - EERE Commercialization Office  

Quick Links. Energy Innovation Portal; Site Map Commercialization Home Page. About. Success Stories; Legacy Initiatives

393

SRNL - Directions and Maps  

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

Map of SRS, with Georgia and South Carolina Map of SRS, with Georgia and South Carolina Directions and Maps The Savannah River National Laboratory is located at the Savannah River Site , a 310 square mile site located in the southeastern coastal area of the United States in the state of South Carolina. It is bordered to the west by the Savannah River and Georgia, and is close to several major cities, including Augusta and Savannah (Ga.), Columbia, Greenville, and Charleston (S.C.). It is in an area residents refer to as the Central Savannah River Area, or CSRA. The Aiken County Technology Laboratory (which houses SRNL's biotechnology laboratories and certain waste treatment technology laboratories) and the Center for Hydrogen Research are located at Aiken County's Savannah River Research Campus, located adjacent to SRS.

394

Mapping the Nanoscale Landscape  

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

Mapping the Nanoscale Landscape Print Mapping the Nanoscale Landscape Print For the first time, researchers have successfully mapped the chemical structure of conjugated polymer blend films with a spatial resolution of better than 50 nm using scanning transmission x-ray microscopy (STXM). This is not just another application of STXM. It is a breakthrough experiment on several levels. Correlating local composition to electronic/optical device characteristics will pave the way to characterizing a whole new class of materials with STXM-multicomponent organic electronic devices that have intrinsically nanoscale dimensions. Understanding where charge transport and recombination occur in these materials helps explain the efficient performance of polymer-based light-emitting diodes (LEDs) and will lead to a new avenue of research on organic electronic devices, supporting emerging technologies such as molecular computing and promoting increased efficiencies in existing organic technologies (organic LEDs and solar cells).

395

mapping | OpenEI  

Open Energy Info (EERE)

mapping mapping Dataset Summary Description (Abstract): Latitude Tilt Irradiance NASA Surface meteorology and Solar Energy (SSE) Release 6.0 Data Set (Jan 2008)22-year Monthly & Annual Average (July 1983 - June 2005) Parameter: Latitude Tilt Radiation (kWh/m^2/day) Internet: http://eosweb.larc.nasa.gov/sse/ Note 1: SSE Methodology & Accuracy sections online Source U.S. National Aeronautics and Space Administration (NASA), Surface meteorology and Solar Energy (SSE) Date Released March 31st, 2009 (5 years ago) Date Updated April 01st, 2009 (5 years ago) Keywords GIS global irradiance latitude mapping NASA renewable energy solar solar PV SWERA TILT UNEP Data text/csv icon Latitude Tilt Radiation (kWh/m^2/day) (csv, 11.8 MiB) application/zip icon Download Shapefile (zip, 5 MiB)

396

Mapping the Nanoscale Landscape  

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

Mapping the Nanoscale Landscape Print Mapping the Nanoscale Landscape Print For the first time, researchers have successfully mapped the chemical structure of conjugated polymer blend films with a spatial resolution of better than 50 nm using scanning transmission x-ray microscopy (STXM). This is not just another application of STXM. It is a breakthrough experiment on several levels. Correlating local composition to electronic/optical device characteristics will pave the way to characterizing a whole new class of materials with STXM-multicomponent organic electronic devices that have intrinsically nanoscale dimensions. Understanding where charge transport and recombination occur in these materials helps explain the efficient performance of polymer-based light-emitting diodes (LEDs) and will lead to a new avenue of research on organic electronic devices, supporting emerging technologies such as molecular computing and promoting increased efficiencies in existing organic technologies (organic LEDs and solar cells).

397

Mapping the Nanoscale Landscape  

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

Mapping the Nanoscale Landscape Print Mapping the Nanoscale Landscape Print For the first time, researchers have successfully mapped the chemical structure of conjugated polymer blend films with a spatial resolution of better than 50 nm using scanning transmission x-ray microscopy (STXM). This is not just another application of STXM. It is a breakthrough experiment on several levels. Correlating local composition to electronic/optical device characteristics will pave the way to characterizing a whole new class of materials with STXM-multicomponent organic electronic devices that have intrinsically nanoscale dimensions. Understanding where charge transport and recombination occur in these materials helps explain the efficient performance of polymer-based light-emitting diodes (LEDs) and will lead to a new avenue of research on organic electronic devices, supporting emerging technologies such as molecular computing and promoting increased efficiencies in existing organic technologies (organic LEDs and solar cells).

398

Manhattan Project: Site Map  

Office of Scientific and Technical Information (OSTI)

SITE MAP SITE MAP Resources > Site Map THE MANHATTAN PROJECT Events 1890s-1939: Atomic Discoveries A Miniature Solar System, 1890s-1919 Exploring the Atom, 1919-1932 Atomic Bombardment, 1932-1938 The Discovery of Fission, 1938-1939 Fission Comes to America, 1939 1939-1942: Early Government Support Einstein's Letter, 1939 Early Uranium Research, 1939-1941 Piles and Plutonium, 1939-1941 Reorganization and Acceleration, 1940-1941 The MAUD Report, 1941 A Tentative Decision to Build the Bomb, 1941-1942 1942: Difficult Choices More Uranium Research, 1942 More Piles and Plutonium, 1942 Enter the Army, 1942 Groves and the MED, 1942 Picking Horses, November 1942 Final Approval to Build the Bomb, December 1942 1942-1944: The Uranium Path to the Bomb Y-12: Design, 1942-1943 Y-12: Construction, 1943

399

Uses of c-graphs in a prototype for automatic translation  

Science Conference Proceedings (OSTI)

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

Marco A. Clemente-Salazar

1984-07-01T23:59:59.000Z

400

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

Science Conference Proceedings (OSTI)

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

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

2012-11-01T23:59:59.000Z

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


401

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

E-Print Network (OSTI)

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

Paris-Sud XI, Université de

402

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

E-Print Network (OSTI)

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

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

2012-01-01T23:59:59.000Z

403

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

E-Print Network (OSTI)

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

Chak, Daniel, 1980-

2004-01-01T23:59:59.000Z

404

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

E-Print Network (OSTI)

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

Chiang, Mung

405

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

Science Conference Proceedings (OSTI)

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

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

2007-08-01T23:59:59.000Z

406

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

Science Conference Proceedings (OSTI)

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

Uwe Naumann; Jean Utke

2005-05-01T23:59:59.000Z

407

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

Science Conference Proceedings (OSTI)

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

Angan Das; Ranga Vemuri

2009-04-01T23:59:59.000Z

408

On occult period maps  

E-Print Network (OSTI)

We consider the "occult" period maps into ball quotients which exist for the moduli spaces of cubic surfaces, cubic threefolds, non-hyperelliptic curves of genus three and four. These were constructed in the work of Allcock/Carlson/Toledo, Looijenga/Swierstra, and Kondo. We interpret these maps as morphisms into moduli spaces of polarized abelian varieties of Picard type, and show that these morphisms, whose initial construction is transcendental, are defined over the natural field of definition of the spaces involved. This paper is extracted from section 15 of our paper arXiv:0912.3758, and differs from it only in some points of exposition.

Kudla, Stephen

2012-01-01T23:59:59.000Z

409

NREL: Dynamic Maps, GIS Data, and Analysis Tools - Maps  

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

Bookmark and Share Bookmark and Share Maps NREL's GIS team develops maps for various renewable resources and for specific projects. As a benefit to the public, a majority of static maps are offered and Google Map (KML/KMZ) files on a tool called MapSearch. Biomass Maps Maps showing the biomass resources available in the United States by county. Feedstock categories include crop residues; forest residues; primary and secondary mill residues; urban wood waste; and methane emissions from manure management, landfills, and domestic wastewater treatment. Federal Energy Management Program The Federal Energy Management Program (FEMP) teamed with Geospatial Analysis staff at NREL to update the analysis for this project and created an interactive FEMP Screening Map application. The previous maps have been

410

Maps and inverse maps in open quantum dynamics  

Science Conference Proceedings (OSTI)

Two kinds of maps that describe evolution of states of a subsystem coming from dynamics described by a unitary operator for a larger system, maps defined for fixed mean values and maps defined for fixed correlations, are found to be quite different for the same unitary dynamics in the same situation in the larger system. An affine form is used for both kinds of maps to find necessary and sufficient conditions for inverse maps. All the different maps with the same homogeneous part in their affine forms have inverses if and only if the homogeneous part does. Some of these maps are completely positive; others are not, but the homogeneous part is always completely positive. The conditions for an inverse are the same for maps that are not completely positive as for maps that are. For maps defined for fixed mean values, the homogeneous part depends only on the unitary operator for the dynamics of the larger system, not on any state or mean values or correlations. Necessary and sufficient conditions for an inverse are stated several different ways: in terms of the maps of matrices, basis matrices, density matrices, or mean values. The inverse maps are generally not tied to the dynamics the way the maps forward are. A trace-preserving completely positive map that is unital cannot have an inverse that is obtained from any dynamics described by any unitary operator for any states of a larger system.

Jordan, Thomas F., E-mail: tjordan@d.umn.ed [Physics Department, University of Minnesota, Duluth, MN 55812 (United States)

2010-10-15T23:59:59.000Z

411

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

E-Print Network (OSTI)

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

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

2009-01-01T23:59:59.000Z

412

Field Mapping At Cascades Region (Ingebritsen & Mariner, 2010) | Open  

Open Energy Info (EERE)

source source History View New Pages Recent Changes All Special Pages Semantic Search/Querying Get Involved Help Apps Datasets Community Login | Sign Up Search Page Edit History Facebook icon Twitter icon » Field Mapping At Cascades Region (Ingebritsen & Mariner, 2010) Jump to: navigation, search GEOTHERMAL ENERGYGeothermal Home Exploration Activity: Field Mapping At Cascades Region (Ingebritsen & Mariner, 2010) Exploration Activity Details Location Cascades Geothermal Region Exploration Technique Field Mapping Activity Date Usefulness not indicated DOE-funding Unknown References S. E. Ingebritsen, R. H. Mariner (2010) Hydrothermal Heat Discharge In The Cascade Range, Northwestern United States Retrieved from "http://en.openei.org/w/index.php?title=Field_Mapping_At_Cascades_Region_(Ingebritsen_%26_Mariner,_2010)&oldid=510730"

413

Definition: Data Collection and Mapping | Open Energy Information  

Open Energy Info (EERE)

Definition Definition Edit with form History Facebook icon Twitter icon » Definition: Data Collection and Mapping Jump to: navigation, search Dictionary.png Data Collection and Mapping Data collection and mapping techniques include a broad array of methods used for collecting information about a geothermal area directly in the field. Surface mapping, shallow temperature probe surveys, and portable XRF/XRD analysis represent a valuable set of basic, cost effective tools for evaluating geothermal prospects. These methods can provide a geothermal exploration program with considerable information about a hydrothermal system prior to the application of expensive laboratory analysis or exploration drilling techniques.[3] View on Wikipedia Wikipedia Definition Powder diffraction is a scientific technique using X-ray, neutron,

414

Interactive Maps from the Great Basin Center for Geothermal Energy  

DOE Data Explorer (OSTI)

The Great Basin Center for Geothermal Energy, part of the University of Nevada, Reno, conducts research towards the establishment of geothermal energy as an economically viable energy source within the Great Basin. The Center specializes in collecting and synthesizing geologic, geochemical, geodetic, geophysical, and tectonic data, and using Geographic Information System (GIS) technology to view and analyze this data and to produce favorability maps of geothermal potential. The interactive maps are built with layers of spatial data that are also available as direct file downloads (see DDE00299). The maps allow analysis of these many layers, with various data sets turned on or off, for determining potential areas that would be favorable for geothermal drilling or other activity. They provide information on current exploration projects and leases, Bureau of Land Management land status, and map presentation of each type of scientific spatial data: geothermal, geophysical, geologic, geodetic, groundwater, and geochemical.

415

battery, map parcel, med  

E-Print Network (OSTI)

Attic *** book teachest Servant dictionary scarf [11] Winery demijohn battery, map AuntLair X] EastAnnex battery[4] Cupboard2 [2] mask DeadEnd rucksack AlisonWriting [16] TinyBalcony [17] gold key. [2] Need new torch battery (see [4]) to enter. Then get painting. [3] To please aunt, must move

Rosenthal, Jeffrey S.

416

Servant dictionary battery, map  

E-Print Network (OSTI)

Attic *** book teachest Servant dictionary scarf [11] Winery demijohn battery, map AuntLair X] EastAnnex battery[4] Cupboard2 [2] mask DeadEnd rucksack AlisonWriting [16] TinyBalcony [17] gold key. [2] Need new torch battery (see [4]) to enter. Then get painting. [3] To please aunt, must move

Rosenthal, Jeffrey S.

417

Lighting for remote viewing systems  

SciTech Connect

Scenes viewed by television do not provide the same channels of information for judgment of distances as scenes viewed directly, since television eliminates or degrades several depth perception cues. However, it may be possible to improve depth perception of televised scenes by enhancing the information available through depth cues that are available from lighting. A literature survey and expert opinions were integrated to design a remote lighting arrangement which could enhance depth perception of operators performing remote handling operations. This paper describes the lighting arrangement and discusses some of its advantages and disadvantages. 10 references, 2 figures.

Draper, J.V.

1984-01-01T23:59:59.000Z

418

Lighting for remote viewing systems  

SciTech Connect

Scenes viewed by television do not provide the same channels of information for judgement of distances as scenes viewed directly, since television eliminates or degrades several depth perception cues. However, it may be possible to improve depth perception of televised scenes by enhancing the information available through depth cues that are available from lighting. A literature survey and expert opinions were integrated to design a remote lighting arrangement which could enhance depth perception of operators performing remote handling operations. This paper describes the lighting arrangement and discusses some of its advantages and disadvantages. 10 references, 2 figures.

Draper, J.V.

1984-01-01T23:59:59.000Z

419

View  

E-Print Network (OSTI)

NSAs have to guarantee that no private information from ...... tive to complementary cell suppression, manuscript, Energy Information Admin- istration

420

View  

E-Print Network (OSTI)

and algorithms in this area, as well as several application areas where ...... solver reached assignment for proof timeout) found of SAT. Gap. 269. 51. 2. 20. 664.

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


421

View  

E-Print Network (OSTI)

1.2 Notation and organization of the paper ... This paper is organized as follows. ..... i is the i-th eigenvalue of C. Then, letting ˜R := QT RQ and ˜H := QT HQ, we.

422

View  

Science Conference Proceedings (OSTI)

Aug 6, 2010 ... (doi:10.1007/s00134-010-1979-1) contains supplementary material, which is .... The visual inspection of the distribution of the EQ-5D scores ...

423

View  

Science Conference Proceedings (OSTI)

Feb 16, 1998 ... temperatures and quenched by injecting helium gas. All processes ..... retrofitted with “mushroom” shaped TiB2-G cathode elements and op- erated for ..... same time improving the formability of alloys and reducing the natural aging rate. .... of many magnesium die castings in production vehicles. In order for ...

424

View  

E-Print Network (OSTI)

Oct 30, 2002 ... Turing machine model, our analysis yields an O(n. 3.5 .... analysis of Vavasis and Ye's algorithm is based on the notion of crossover event,.

425

View  

E-Print Network (OSTI)

May 12, 2005 ... Our algorithm is a result of the combination of stochastic ap- proximation ideas ... 2EDF R&D ... 3EDF R&D ..... Let us state the main result of this section: ..... IEEE Transactions on Systems, Science and Cybernetics, 5:307. 14.

426

View  

E-Print Network (OSTI)

1France Télécom R&D, 38-40 rue du gl Leclerc, 92130 Issy-les-Moulineaux, France ... The results obtained outperform many methods based on earlier literature. ...... Linear programming under uncertainty, Management Science, 1 (

427

View  

E-Print Network (OSTI)

Sep 22, 2006 ... minimizing the cost of the thermal power production if the hydro-power plant cannot supply the demand completely. Dynamic programming is a ...

428

View  

Science Conference Proceedings (OSTI)

Jul 13, 2012 ... Current emphasis: visualization, data mining and applications in oil and ..... Internships. Agreement Enhancements. • Discount on indirect costs.

429

View  

E-Print Network (OSTI)

Jan 27, 2011 ... Cost Horizons and Certainty Equivalents: An Approach to Stochastic Programming of Heating Oil. Management Science, 4(3):253–. 263, 1958.

430

View  

E-Print Network (OSTI)

Optimization Technical Report. ISyE Department, University of Wisconsin- Madison. Oktay Günlük1 · Jeff Linderoth2. Perspective Reformulations of Mixed Integer.

431

View  

Science Conference Proceedings (OSTI)

Red Herring Dec 2001. “ Nanotechnology is the understanding and control of matter at dimensions of roughly 1 to. 100 nanometers, where unique phenomena .

432

View  

E-Print Network (OSTI)

We tested these formu- ... and finding radiation treatment plans in the presence of organ motion. ...... We report the number instances for which the heuristic.

433

View  

E-Print Network (OSTI)

Jul 18, 2008 ... Let us define the energy product and corresponding energy norm with respect to an ...... 3.2 Shape optimization in 3D for EIT and DC resistivity.

434

View  

E-Print Network (OSTI)

2003. The Solver Manuals. GAMS Development Corporation, Washington, DC, USA. Gilbert, J. 2007a. Organization of the Modulopt collection of optimization ...

435

View  

E-Print Network (OSTI)

erwin@gams.com. GAMS Development Corp. Washington DC. 19th June 2001. Abstract. The `Progressive Party Problem' [9] has long been considered a prob-.

436

View  

E-Print Network (OSTI)

Oct 6, 2004... and Systems Engineering, Georgia Institute of Technology, Atlanta, .... The methods described in this paper reduce the energy function (1) at ...

437

View  

E-Print Network (OSTI)

digital communication networks. .... bound. IEEE Transactions on Communications, 52:632–642, 2004. ... uscript, Georgia Institute of Technology, 2007.

438

View  

E-Print Network (OSTI)

It models optimal placement of communications relay nodes in the pres- ence of obstacles. This problem ...... tion Technology (CENIIT). The authors would like to

439

View  

E-Print Network (OSTI)

Abstract—We consider the classical problem of estimating ... (a) to provide an estimate fn of f such that the first 2n+1 .... course at a higher computational cost.

440

View  

E-Print Network (OSTI)

an astutely selected small working set does not significantly increase the total number of iterations required to solve the problem, and sometimes even reduces it ...

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


441

View  

E-Print Network (OSTI)

Introduction. Consider the linear programming problem in the standard form [5, 14] minimize ... row index, say i, has to be determined such that ?j = min {¯bl/¯al,j  ...

442

View  

E-Print Network (OSTI)

As is known to us, Cognition process is the instinct learning ability of human being, ..... What's more, to alleviate the undesirable effects of estimation error in the ...

443

View  

E-Print Network (OSTI)

M? denotes the solar mass. which mimic the corresponding natural processes, ..... Gravitational radiation. In S. W. Hawking and W. Israel, editors,. 300 Years of ...

444

View  

Science Conference Proceedings (OSTI)

Energy Conversion – Photovoltaic, Concentrating Solar Power, and Thermoelectric ... Green Technologies for Materials Manufacturing and Processing IV.

445

View  

Science Conference Proceedings (OSTI)

Feb 15, 2011 ... cost for low power plant ... Fitness for small electricity grids, reduced .... Need a factory to make the price attractive, need an attractive price to.

446

View  

E-Print Network (OSTI)

tioning, clearly identify the utility function that characterizes their attitude toward risk. The use of expected ...... with largest fixed interest rate. Alternatively, our ...

447

View  

E-Print Network (OSTI)

to the performance of the exact method of [1]. They are very comparable to those of [8], although have a higher rate of increase with dimension d and/or number ...

448

View  

E-Print Network (OSTI)

breakpoint at ?, and given by the two lines L1 and L2. Clearly, if ?L(v) ..... overhead which would be, for example, incurred at every node of a branch- and-

449

View  

Science Conference Proceedings (OSTI)

availability-manufacturing, processing, fabrication joining, uniformity, balance of properties (what properties are important limiting), qualification, codes, safety ...

450

View  

E-Print Network (OSTI)

Aug 30, 2004 ... (where s?1 denotes the vector of reciprocals of the components of s), so that necessarily x = µs?1 > 0, ... be written in the more symmetrical form.

451

View  

E-Print Network (OSTI)

The colon cancer dataset contains 22 normal and 40 colon cancer tissues ..... P. Wolfe, An algorithm for quadratic programming, Naval Research Logistics.

452

View  

E-Print Network (OSTI)

May 22, 2003 ... although the corresponding proximity function does not have a ..... Suppose that the statement of the lemma does not hold, i.e., ...... 397–413.

453

View  

E-Print Network (OSTI)

Naive exploration of this neighborhood is computationally ..... Table 2: Problem Sizes for Production Planning Test Instances. In both Table 1 and Table 2, the ...

454

View  

E-Print Network (OSTI)

Note to Practitioners—In practice, production scheduling is a crucial task at ..... the search when the exploration is close to the root, and thus makes cutoff less ...

455

View  

E-Print Network (OSTI)

Mar 1, 2007 ... Some of the most successful methods are: Tabu search in [Gho03], a combination of Tabu ... equality constraints are dualized as before, but they also enter the ... term it is possible to avoid fast increase of the Lagrangian dual ...

456

View  

E-Print Network (OSTI)

of image reconstruction from projections in [26], significant and valuable ac- ... ods, which makes them successful in real-world applications, is computa-. 4 ...

457

View  

E-Print Network (OSTI)

[23]T. S. Motzkin. The arithmetic-geometric inequality. In Inequalities ( Proceedings of Symposium Wright. Patterson Air Force Base, Ohio, 1965), pages 205–224.

458

View  

E-Print Network (OSTI)

each component is non-zero precisely once in every cycle of n iterations. Thus, ... and these may not inherit the overall rate of the combined pair. Similarly, in.

459

View  

E-Print Network (OSTI)

Sep 18, 2009 ... telecommunication industry [49] which can be reformulated as a two-stage ...... problem under equilibrium constraints in electricity spot market ...

460

View  

Science Conference Proceedings (OSTI)

Jun 6, 2012 ... fossil fuels and chart a new course on energy in this country, we are condemning future generations to global catastrophe.” Senator Obama ...

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


461

View  

E-Print Network (OSTI)

Oct 19, 2010 ... In aircraft routing, maintenance events replenish aircrafts' ability to fly. In .... with several different label data structure and treatment strategies.

462

View  

E-Print Network (OSTI)

of an extension of the Fundamental Theorem of Linear Programming, and proved , in ..... with ?v for v = [0,..., 0, 1] ? Rn (it does not matter that Nowak drops the last row and ...... Handbook of Combinatorial Optimization (supp. Vol. A), 1–74.

463

View  

E-Print Network (OSTI)

and Boyd (1996), Todd (2001), the SDP handbook edited by Wolkowicz et al. ..... cut polytope CHULL(G) does not admit a polynomial time separation oracle, but ...... problem. In cutting plane algorithms it is of fundamental importance that re-.

464

View  

E-Print Network (OSTI)

s k C bakc D s k C bas a.s k/c s k C bas .s k/c D s k C as .s k/ D as; the claim follows. Lemma A.2 (Chernoff bounds, see Mitzenmacher and Upfal [17]). Let X1;:

465

View  

E-Print Network (OSTI)

In order to increase the search capability of MBH, a population framework has been proposed ... The key idea is to avoid new individuals to enter the population if someone similar (in a ..... We measure the efficiency in terms of number of (two-.

466

View  

E-Print Network (OSTI)

These plugins have two essential callbacks that are called .... assigned to opened facilities so that the total sum of connection distances is minimized and the ...

467

View  

E-Print Network (OSTI)

Feb 28, 2012 ... assumed to be essential and the only decision criterion is the travel distance. The portion ... On the other side, customers choose the facilities to.

468

View  

E-Print Network (OSTI)

Rep., Argonne National Laboratory, Argonne,. Illinois, USA, 1992. [2] A. Borzi and K. Kunisch, A globalization strategy for the multigrid solution of elliptic optimal ...

469

View  

E-Print Network (OSTI)

one additional order of magnitude) by finding the best axis-parallel ellipsoid, which is however too expensive to be done (outside the root node) within our ...

470

View  

E-Print Network (OSTI)

[8] J. Eckstein and M. Fukushima, Some reformulation and applications of the alternating ... [10] M. Fukushima, Application of the alternating direction method of

471

View  

E-Print Network (OSTI)

Feb 5, 2002 ... environment (“profile”) of an amino acid in terms of its contact shells. ..... that in order to use the MaxF heuristic we need to be able to load all.

472

View  

E-Print Network (OSTI)

However, numerical simulations allow us to conjecture ... property of the optimal weights a?0,...,a?n and also an illustrative example of ... Let us define the weighted sum of exponential functions for a ? RN+1 and h ...... be two azimuth angles. ... [2] A. Labeyrie, Resolved imaging of extra-solar planets with future 10-

473

View  

E-Print Network (OSTI)

trajectories, dissipative dynamical systems, Lyapunov analysis, weak .... the link with some classical results concerning semi-groups of contractions generated.

474

View  

E-Print Network (OSTI)

borhood and a curve is built by linking all the points. The coordinates of ..... Learning algorithms could also be used to automatically guide the search through ...

475

View  

E-Print Network (OSTI)

by learning mathematical principles, and subsequent implementation of mathematical ... area under a curve as a sum of areas of rectangles as the width of each ...

476

View  

E-Print Network (OSTI)

does not apply here because the objective function of LFMP may be unbounded ...... Handbook of Global Optimization, Kluwer Academic Publishers, 495-608.

477

View  

E-Print Network (OSTI)

Department of Applied Mathematics, Beijing Jiaotong University, Beijing ... (SDP), plays a fundamental role in mathematical programming, see, e.g., [21, 2, 7]. ...... [ 21] H. Wolkowicz, R. Saigal, L. Vandenberghe: Handbook of Semidefinite ...

478

View  

E-Print Network (OSTI)

Feb 22, 2002 ... This problem is of fundamental importance in mathematics and physical sciences ... ?Department of Mathematics and Statistics, University of Guelph, Ontario N1G 2W1, Canada. Email: ...... Handbook of Semidefinite Program-.

479

View  

E-Print Network (OSTI)

G as a road system, T as petrol stations and a driver who wants to go from u to v. Then B(u, v) is ..... [9] (gas distribution) provide instances where almost all ...

480

Field Mapping | Open Energy Information  

Open Energy Info (EERE)

Field Mapping Field Mapping Jump to: navigation, search GEOTHERMAL ENERGYGeothermal Home Exploration Technique: Field Mapping Details Activities (59) Areas (35) Regions (6) NEPA(0) Exploration Technique Information Exploration Group: Field Techniques Exploration Sub Group: Data Collection and Mapping Parent Exploration Technique: Data Collection and Mapping Information Provided by Technique Lithology: Map surface geology and hydrothermal alteration. Stratigraphic/Structural: Map fault and fracture patterns, kinematic information. Hydrological: Map surface manifestations of geothermal systems. Thermal: Map surface temperature. Cost Information Low-End Estimate (USD): 400.0040,000 centUSD 0.4 kUSD 4.0e-4 MUSD 4.0e-7 TUSD / hour Median Estimate (USD): 600.0060,000 centUSD

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


481

Census and viewing of organisms  

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

Census and viewing of organisms Census and viewing of organisms Name: m hariaczyi Status: N/A Age: N/A Location: N/A Country: N/A Date: Around 1993 Question: How many organisms exist in the world today? What is the most powerful microscope that could be used for viewing organism? Replies: The most powerful microscope is called an electron microscope, which can be used for viewing entire organisms, although few organisms are small enough to see all of them at high magnifications allowed by this microscope. So most often its used to look at fixed sections of organisms. Since the electron microscope only works in a vacuum, with no air, you cannot look at live organisms. To do that, probably the most powerful microscope is called a Nomarski, or in technical terms, a "differential interference contrast" microscope. This is a modification of a normal light microscope that allows better contrast in living tissue. It is not any more powerful than a light microscope, and is much less powerful than an electron microscope, but it allows you to see living things much better.

482

Bayesian networks: A teacher's view  

Science Conference Proceedings (OSTI)

Teachers viewing Bayesian network-based proficiency estimates from a classroom full of students face a different problem from a tutor looking at one student at a time. Fortunately, individual proficiency estimates can be aggregated into classroom and ... Keywords: Aggregation, Bayesian networks, Computer graphics, Probabilities

Russell G. Almond; Valerie J. Shute; Jody S. Underwood; Juan-Diego Zapata-Rivera

2009-03-01T23:59:59.000Z

483

Digital Geologic Field Mapping Using Arcpad, In: Digital Mapping Techniques  

Open Energy Info (EERE)

Digital Geologic Field Mapping Using Arcpad, In: Digital Mapping Techniques Digital Geologic Field Mapping Using Arcpad, In: Digital Mapping Techniques '02- Workshop Proceedings Jump to: navigation, search OpenEI Reference LibraryAdd to library Report: Digital Geologic Field Mapping Using Arcpad, In: Digital Mapping Techniques '02- Workshop Proceedings Abstract Research into the practicality of digital mapping by Placer Dome Exploration identified hardware and software solutions to enhance the efficiency and accuracy of field work. The goal of the research was to find a lightweight hardware-software system that allows the user to build a digital map from field observations in much the same way as pen and paper methods. The focus of the research was to minimize the size and weight of computer systems. Systems identified consist of a wearable PC or handheld

484

Fusion categories in terms of graphs and relations  

E-Print Network (OSTI)

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

Hendryk Pfeiffer

2009-12-02T23:59:59.000Z

485

NREL: Dynamic Maps, GIS Data, and Analysis Tools - Data Visualization &  

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

MapSearch Searching for maps has never been easier. A screen capture of the MapSearch Map view option Bookmark and Share Data Visualization & Geospatial Tools NREL's Geographic Information System (GIS) Team has developed tools that allow users to apply these data. These tools help determine things such as how much electricity can be produced from solar systems on a house or what renewable resources are available in a specific areas. Please visit http://maps.nrel.gov/ for the most current list of available NREL's GIS tools. If you have difficulty using these tools because of a disability, please contact the Webmaster. General Interactive Mapping Tools Access RE Atlas, Solar Power Prospector, PVWatts, and other popular tools that dynamically generate maps of renewable energy resources.

486

On the computation of relational view complements  

Science Conference Proceedings (OSTI)

Views as a means to describe parts of a given data collection play an important role in many database applications. In dynamic environments where data is updated, not only information provided by views, but also information provided by data sources yet ... Keywords: Relational algebra, data warehouses, minimal complements, self-maintainability, view complements, views

Jens Lechtenbörger; Gottfried Vossen

2003-06-01T23:59:59.000Z

487

NDB Site Map  

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

Site map NDB Home Search Structures Search DNA Search RNA Advanced Search Nucleic acid tools RNA 3D motif atlas Non-redundant lists RNA base triples atlas WebFR3D R3D Align Contact NDB Mailing Address About NDB NDB Members Goal References Publications Site map Tools Software Standards Standard Reference Supplementary Information Ideal Geometries X-PLOR Parameters Valence Geometries RNA Ontology Consortium mmCIF Resources PDBML Resources Education Introduction to Nucleic Acids: DNA Definition of terms RNA Base Pair Families RNA Base-Phosphate Families Base Stacking Interactions Non Redundant list Equivalence classes RNA 3D Motifs Relative Frequency Introduction to Nucleic Acids: RNA Nucleic Acid Highlight (PDB): DNA DNA Polymerase Nucleosome Transfer RNA RNA Polymerase Self-splicing RNA

488

Technology Transfer: Site Map  

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

Site Map Site Map About Us About Technology Transfer Contact Us Available Technologies Advanced Materials Biofuels Biotechnology and Medicine Developing World Energy Environmental Technologies Imaging and Lasers Ion Sources and Beam Technologies Nanotechnology and Microtechnology Software and Information Technology For Industry Licensing Overview Frequently Asked Questions Partnering with Berkeley Lab Licensing Interest Form Receive New Tech Alerts For Researchers What You Need to Know and Do The Tech Transfer Process Forms Record of Invention (Word doc -- please do not use earlier PDF version of the form) Software Disclosure and Abstract (PDF, use Adobe Acrobat or Adobe Reader 9 and up ONLY to complete the form) Policies Conflict of Interest Outside Empolyment Export Control FAQs for Researchers

489

The Collagen Protein Viewed at Unprecedented Detail | Advanced Photon  

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

Assembling Nanoparticles the Easy DNA-Way Assembling Nanoparticles the Easy DNA-Way Better, cleaner fuel injectors for automobiles? Poxvirus Potency Uncovered in New Atomic Map Striking Nano Gold Oldest Known Magnet's Secrets Revealed Under High Pressures Science Highlights Archives: 2013 | 2012 | 2011 | 2010 2009 | 2008 | 2007 | 2006 2005 | 2004 | 2003 | 2002 2001 | 2000 | 1998 | Subscribe to APS Science Highlights rss feed The Collagen Protein Viewed at Unprecedented Detail FEBRUARY 26, 2008 Bookmark and Share A view of a rat tail tendon using second-harmonic generation microscopy. The collagen fibers show up in green and red. The structure and behavior of one of the most common proteins in our bodies has been resolved at a level of detail never before seen, thanks to new research performed at the Advanced Photon Source (APS) at the U.S.

490

City View, South Carolina: Energy Resources | Open Energy Information  

Open Energy Info (EERE)

View, South Carolina: Energy Resources View, South Carolina: Energy Resources Jump to: navigation, search Equivalent URI DBpedia Coordinates 34.8615064°, -82.4315121° Loading map... {"minzoom":false,"mappingservice":"googlemaps3","type":"ROADMAP","zoom":14,"types":["ROADMAP","SATELLITE","HYBRID","TERRAIN"],"geoservice":"google","maxzoom":false,"width":"600px","height":"350px","centre":false,"title":"","label":"","icon":"","visitedicon":"","lines":[],"polygons":[],"circles":[],"rectangles":[],"copycoords":false,"static":false,"wmsoverlay":"","layers":[],"controls":["pan","zoom","type","scale","streetview"],"zoomstyle":"DEFAULT","typestyle":"DEFAULT","autoinfowindows":false,"kml":[],"gkml":[],"fusiontables":[],"resizable":false,"tilt":0,"kmlrezoom":false,"poi":true,"imageoverlays":[],"markercluster":false,"searchmarkers":"","locations":[{"text":"","title":"","link":null,"lat":34.8615064,"lon":-82.4315121,"alt":0,"address":"","icon":"","group":"","inlineLabel":"","visitedicon":""}]}

491

East Pleasant View, Colorado: Energy Resources | Open Energy Information  

Open Energy Info (EERE)

View, Colorado: Energy Resources View, Colorado: Energy Resources Jump to: navigation, search Equivalent URI DBpedia Coordinates 39.7276261°, -105.1573284° Loading map... {"minzoom":false,"mappingservice":"googlemaps3","type":"ROADMAP","zoom":14,"types":["ROADMAP","SATELLITE","HYBRID","TERRAIN"],"geoservice":"google","maxzoom":false,"width":"600px","height":"350px","centre":false,"title":"","label":"","icon":"","visitedicon":"","lines":[],"polygons":[],"circles":[],"rectangles":[],"copycoords":false,"static":false,"wmsoverlay":"","layers":[],"controls":["pan","zoom","type","scale","streetview"],"zoomstyle":"DEFAULT","typestyle":"DEFAULT","autoinfowindows":false,"kml":[],"gkml":[],"fusiontables":[],"resizable":false,"tilt":0,"kmlrezoom":false,"poi":true,"imageoverlays":[],"markercluster":false,"searchmarkers":"","locations":[{"text":"","title":"","link":null,"lat":39.7276261,"lon":-105.1573284,"alt":0,"address":"","icon":"","group":"","inlineLabel":"","visitedicon":""}]}

492

National Library of Energy : Main View : Deep Federated Search  

Office of Scientific and Technical Information (OSTI)

National Library of Energy National Library of Energy Search Powered By Deep Web Technologies Modify Search Preferences Powered by Deep Web Technologies HOME About NLE Communications FAQs Help Site Map Feedback/Contact Us Main View This view is used for searching all possible sources. SEARCH OPTIONS Additional Information Keyword: Title: Additional Information Author: Fields to Match: All Any Field(s) Additional Information Date Range: Beginning Date Range Pick Year 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1999 1998 1997 1996 1995 1994 1993 1992 1991 1990 toEnding Date Range Pick Year 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1999 1998 1997 1996 1995 1994 1993 1992 1991 1990 Search Clear All Help Simple Search Expand Category All Sources

493

Automatic annotation of geographic maps  

Science Conference Proceedings (OSTI)

In this paper, we describe an approach to generate semantic descriptions of entities in city maps so that they can be presented through accessible interfaces. The solution we present processes bitmap images containing city map excerpts. Regions of interest ...

Mirko Horstmann; Wilko Heuten; Andrea Miene; Susanne Boll

2006-07-01T23:59:59.000Z

494

book review: Climate change mapped  

E-Print Network (OSTI)

6596  news and update  book review  Climate change mapped atlas is more than just a book of maps.  By  that criterion than  just  a  science  book.   It  also covers climate 

Shanahan, Mike

2012-01-01T23:59:59.000Z

495

Site Map - Energy Innovation Portal  

Energy Innovation Portal Technologies. ... Home. Site Map; Printable Version; Share this resource. About; Search; Categories (15) Advanced Materials; Biomass and ...

496

The metro map layout problem  

Science Conference Proceedings (OSTI)

We initiate a new problem of automatic metro map layout. In general, a metro map consists of a set of lines which have intersections or overlaps. We define a set of aesthetic criteria for good metro map layouts and present a method to produce ...

Seok-Hee Hong; Damian Merrick; Hugo A. D. do Nascimento

2004-09-01T23:59:59.000Z

497

Bayesian inference with optimal maps  

Science Conference Proceedings (OSTI)

We present a new approach to Bayesian inference that entirely avoids Markov chain simulation, by constructing a map that pushes forward the prior measure to the posterior measure. Existence and uniqueness of a suitable measure-preserving map is established ... Keywords: Bayesian inference, Inverse problems, Measure-preserving maps, Numerical optimization, Optimal transport, Polynomial chaos

Tarek A. El Moselhy; Youssef M. Marzouk

2012-10-01T23:59:59.000Z

498

User hints for map labelling  

Science Conference Proceedings (OSTI)

The Map Labelling Problem appears in several applications, mainly in Cartography. Although much research on this problem has been done, it is interesting to note that map-labelling processes in commercial fields are very often executed manually ... Keywords: combinatorial optimisation, map labelling, user hints

Hugo A. D. do Nascimento; Peter Eades

2003-02-01T23:59:59.000Z

499

Views of the solar system  

SciTech Connect

Views of the Solar System has been created as an educational tour of the solar system. It contains images and information about the Sun, planets, moons, asteroids and comets found within the solar system. The image processing for many of the images was done by the author. This tour uses hypertext to allow space travel by simply clicking on a desired planet. This causes information and images about the planet to appear on screen. While on a planet page, hyperlinks travel to pages about the moons and other relevant available resources. Unusual terms are linked to and defined in the Glossary page. Statistical information of the planets and satellites can be browsed through lists sorted by name, radius and distance. History of Space Exploration contains information about rocket history, early astronauts, space missions, spacecraft and detailed chronology tables of space exploration. The Table of Contents page has links to all of the various pages within Views Of the Solar System.

Hamilton, C.

1995-02-01T23:59:59.000Z

500

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

E-Print Network (OSTI)

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

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

2011-01-01T23:59:59.000Z