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

Brain Mapping Using Topology Graphs Obtained by Surface Segmentation  

E-Print Network (OSTI)

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

Linsen, Lars

2

Quantum ergodicity for graphs related to interval maps  

E-Print Network (OSTI)

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

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

2006-07-07T23:59:59.000Z

3

Street Light View: Enriching Navigable Panoramic Street View Maps with Informative Illumination Thumbnails  

E-Print Network (OSTI)

1 Street Light View: Enriching Navigable Panoramic Street View Maps with Informative Illumination, Stony Brook University ABSTRACT Google Street View is a technology featured in Google Maps and Google Earth that provides panoramic and immersive views of street scenes in many cities around the world

Mueller, Klaus

4

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

E-Print Network (OSTI)

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

Rostock, Universität

5

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

Science Journals Connector (OSTI)

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

Zhisong Fu; Michael Personick; Bryan Thompson

2014-06-01T23:59:59.000Z

6

View  

E-Print Network (OSTI)

Aug 19, 2009 ... linear-algebraic and graph theoretic properties of this matrix class. The con- ..... The MatLab solvers linprog and quadprog were used.

2010-03-14T23:59:59.000Z

7

View  

E-Print Network (OSTI)

function, and the nuclear norm. The support function is based on the graph of the product of a matrix with its transpose. Closed form expressions for the support ...

2014-08-28T23:59:59.000Z

8

Scheduling and mapping of conditional task graph for the synthesis of low power embedded systems  

E-Print Network (OSTI)

and mapping technique is investigated and results are reported. 1 Introduction Energy efficiency is becoming, such an accurate system representation also offers the potential of efficient implementations in terms of energy, which optimises both the mapping and schedule towards energy efficiency by abetting the exploitation

Zhao, Yuxiao

9

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

10

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

11

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

12

Exact algorithm for graph homomorphism and locally injective graph homomorphism  

Science Journals Connector (OSTI)

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

Pawe? Rzewski

2014-07-01T23:59:59.000Z

13

Graph Algorithms Tours in Graphs  

E-Print Network (OSTI)

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

Bar-Noy, Amotz

14

Mapping  

Science Journals Connector (OSTI)

Mapping is a creative method that invites participants to visually represent or depict the aspect of their lives that is under investigation. The underlying aim of a mapping exercise is to elicit a full, holis...

Valerie A. Futch

2014-01-01T23:59:59.000Z

15

Standards for graph algorithm primitives  

E-Print Network (OSTI)

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

Mattson, Tim

16

A heuristic algorithm for graph isomorphism  

E-Print Network (OSTI)

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

Torres Navarro, Luz

1999-01-01T23:59:59.000Z

17

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

18

Evidential cognitive maps  

Science Journals Connector (OSTI)

In order to handle uncertain information, this paper proposes evidential cognitive maps (ECMs), similar to the fuzzy cognitive maps (FCMs). ECMs are uncertain-graph structures for representing causal reasoning through the combination of cognitive maps ... Keywords: Data fusion, Decision making, Evidence theory, Evidential cognitive maps, Fuzzy cognitive maps

Bingyi Kang; Yong Deng; Rehan Sadiq; Sankaran Mahadevan

2012-11-01T23:59:59.000Z

19

Graph anomalies in cyber communications  

SciTech Connect

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

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

2011-01-11T23:59:59.000Z

20

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

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

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

22

WIPP Projects Interative Map  

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

View WIPP Projects in a larger map. To report corrections, please email WeatherizationInnovation@ee.doe.gov.

23

SERC Grants Interactive Map  

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

View SERC Grants in a larger map. To report corrections, please email SustainableEnergyWAP@ee.doe.gov.

24

Graph Algorithms Special Sets in Graphs  

E-Print Network (OSTI)

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

Bar-Noy, Amotz

25

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

26

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

27

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

28

Graph Algorithms Edge Coloring  

E-Print Network (OSTI)

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

Bar-Noy, Amotz

29

Graph Algorithms Robert Elsasser  

E-Print Network (OSTI)

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

Elsässer, Robert

30

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

31

Graph Visualization API Library for Application Builders  

Science Journals Connector (OSTI)

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

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

2002-01-01T23:59:59.000Z

32

Graph Algorithms Vertex Coloring  

E-Print Network (OSTI)

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

Bar-Noy, Amotz

33

Fuzzy cognitive maps in GIS data analysis  

Science Journals Connector (OSTI)

?Fuzzy cognitive maps (FCMs) are graphs that provide a...functional...systems. We have developed a system based on contextual fuzzy cognitive maps (CFCMs) for geographic information systems (GIS) using both spati...

Z.-Q. Liu

2003-05-01T23:59:59.000Z

34

Groups generated by bounded automata and their schreier graphs  

E-Print Network (OSTI)

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

Bondarenko, Ievgen

2009-05-15T23:59:59.000Z

35

Graph algorithms experimentation facility  

E-Print Network (OSTI)

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

Sonom, Donald George

2012-06-07T23:59:59.000Z

36

Graphs, Trees Pebbles, Robots  

E-Print Network (OSTI)

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

Haas, Ruth

37

Parasupersymmetry in Quantum Graphs  

E-Print Network (OSTI)

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

Satoshi Ohya

2012-10-29T23:59:59.000Z

38

Parasupersymmetry in Quantum Graphs  

E-Print Network (OSTI)

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

Ohya, Satoshi

2012-01-01T23:59:59.000Z

39

Graph Algorithms Robert Elsasser  

E-Print Network (OSTI)

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

Elsässer, Robert

40

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

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

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

42

Modeling and Recognition of Landmark Image Collections Using Iconic Scene Graphs  

E-Print Network (OSTI)

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

Lazebnik, Svetlana

43

Spectral characterizations of sun graphs and broken sun graphs  

E-Print Network (OSTI)

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

Paris-Sud XI, Université de

44

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

E-Print Network (OSTI)

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

Kschischang, Frank R.

45

Convex Graph Invariants  

E-Print Network (OSTI)

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

2010-12-02T23:59:59.000Z

46

Spectral Graph Theory  

E-Print Network (OSTI)

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

*D. J. Kelleher

2011-09-30T23:59:59.000Z

47

Graphs associated with semigroups  

E-Print Network (OSTI)

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

Baber, Stephen Asa

2012-06-07T23:59:59.000Z

48

GraphState - a tool for graph identification and labelling  

E-Print Network (OSTI)

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

Batkovich, D; Kompaniets, M; Novikov, S

2014-01-01T23:59:59.000Z

49

GraphState - a tool for graph identification and labelling  

E-Print Network (OSTI)

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

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

2014-09-29T23:59:59.000Z

50

Path Integral on Star Graph  

E-Print Network (OSTI)

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

Satoshi Ohya

2011-04-28T23:59:59.000Z

51

Path Integral on Star Graph  

E-Print Network (OSTI)

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

Ohya, Satoshi

2011-01-01T23:59:59.000Z

52

Querying graphs with data   

E-Print Network (OSTI)

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

Vrgoc, Domagoj

2014-06-27T23:59:59.000Z

53

Graph Kernels Based on Relevant Patterns and Cycle Information for Chemoinformatics  

E-Print Network (OSTI)

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

Boyer, Edmond

54

Graph degree linkage: agglomerative clustering on a directed graph  

Science Journals Connector (OSTI)

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

Wei Zhang; Xiaogang Wang; Deli Zhao; Xiaoou Tang

2012-10-01T23:59:59.000Z

55

Kinetic Pie Delaunay Graph and Its Applications  

Science Journals Connector (OSTI)

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

Mohammad Ali Abam; Zahed Rahmati; Alireza Zarei

2012-01-01T23:59:59.000Z

56

Densities in graphs and matroids  

E-Print Network (OSTI)

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

Kannan, Lavanya

2009-05-15T23:59:59.000Z

57

Exploring the role of graph spectra in graph coloring algorithm performance  

Science Journals Connector (OSTI)

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

Kate Smith-Miles, Davaatseren Baatar

2014-10-01T23:59:59.000Z

58

Groups generated by bounded automata and their schreier graphs  

E-Print Network (OSTI)

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

Bondarenko, Ievgen

2008-10-10T23:59:59.000Z

59

Extremal Graph Numbers of Graphs on Few May 4, 2012  

E-Print Network (OSTI)

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

Zeilberger, Doron

60

How to Resum Feynman Graphs  

E-Print Network (OSTI)

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

Vincent Rivasseau; Zhituo Wang

2013-09-24T23:59:59.000Z

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

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

62

Fast iterative graph computation with block updates  

Science Journals Connector (OSTI)

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

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

2013-09-01T23:59:59.000Z

63

L21: "Irregular" Graph Algorithms  

E-Print Network (OSTI)

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

Hall, Mary W.

64

Phylogenetic Toric Varieties on Graphs  

E-Print Network (OSTI)

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

Buczynska, Weronika J.

2010-10-12T23:59:59.000Z

65

Contraction semigroups on metric graphs  

E-Print Network (OSTI)

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

Vadim Kostrykin; Jurgen Potthoff; Robert Schrader

2008-02-26T23:59:59.000Z

66

U.S. States - Maps - U.S. Energy Information Administration ...  

Annual Energy Outlook 2012 (EIA)

U.S. Energy Mapping System Full Screen Locate Views Remove all layers Map details and data Send map questions, comments and suggestions to: mapping@eia.gov Welcome to the U.S....

67

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":""}]}

68

Extension maps  

E-Print Network (OSTI)

We define extension maps as maps that extend a system (through adding ancillary systems) without changing the state in the original system. We show, using extension maps, why a completely positive operation on an initially entangled system results in a non positive mapping of a subsystem. We also show that any trace preserving map, either positive or negative, can be decomposed in terms of an extension map and a completely positive map.

Aik-meng Kuah; E. C. G. Sudarshan

2005-03-12T23:59:59.000Z

69

Contractions of planar graphs in polynomial time?  

E-Print Network (OSTI)

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

Dimitrios, Thilikos

70

Some Remarks on Definability of Process Graphs  

E-Print Network (OSTI)

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

Klop, Jan Willem

71

Extremal Graph Problems, Degenerate Extremal Problems,  

E-Print Network (OSTI)

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

Simonovits, Miklós

72

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

E-Print Network (OSTI)

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

Deville, Yves

73

Transforming a graph into a 1-balanced graph  

Science Journals Connector (OSTI)

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

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

2009-01-01T23:59:59.000Z

74

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

75

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

Science Journals Connector (OSTI)

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

Jolie Bell; Jim Davies

2010-01-01T23:59:59.000Z

76

Location Map  

SciTech Connect

Map file package containing shaded relief base with Hot Pot project area, major roads, railroads, and rivers. The inset map shows regional Paleozoic structural elements.

Lane, Michael

2013-06-27T23:59:59.000Z

77

Location Map  

DOE Data Explorer (OSTI)

Map file package containing shaded relief base with Hot Pot project area, major roads, railroads, and rivers. The inset map shows regional Paleozoic structural elements.

Lane, Michael

78

Multilevel spectral clustering : graph partitions and image segmentation  

E-Print Network (OSTI)

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

Kong, Tian Fook

2008-01-01T23:59:59.000Z

79

View Consistency in Architectures for Cyber-Physical Systems  

Science Journals Connector (OSTI)

Current methods for modeling, analysis, and design of cyber-physical systems lack a unifying framework due to the complexity and heterogeneity of the constituent elements and their interactions. Our approach is to define relationships between system ... Keywords: system architecture, view consistency, graph morphism, multi-domain modeling, cyber-physical systems

Ajinkya Bhave; Bruce H. Krogh; David Garlan; Bradley Schmerl

2011-04-01T23:59:59.000Z

80

Graph and matrix approaches to rough sets through matroids  

Science Journals Connector (OSTI)

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

Shiping Wang; Qingxin Zhu; William Zhu; Fan Min

2014-01-01T23:59:59.000Z

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

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

82

Maps, languages, and manguages: Rival cognitive architectures?  

E-Print Network (OSTI)

Maps, languages, and manguages: Rival cognitive architectures? Kent Johnson Provided we agree about, section VII Map-like representations are frequently invoked as an alternative type of representational vehicle to a language of thought. This view presupposes that map-systems and languages form legitimate

Stanford, Kyle

83

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

84

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

85

A rigidity result for the graph case of the Penrose inequality  

E-Print Network (OSTI)

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

Levi Lopes de Lima; Frederico Girão

2012-06-25T23:59:59.000Z

86

Algebraic connectivity and graph robustness.  

SciTech Connect

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

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

2009-07-01T23:59:59.000Z

87

SLQ: a user-friendly graph querying system  

Science Journals Connector (OSTI)

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

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

2014-06-01T23:59:59.000Z

88

Extremes are better: investigating mental map preservation in dynamic graphs  

E-Print Network (OSTI)

Purchase,H.C. Samra,A. Proceedings of the 5th International Conference on Diagrammatic Representation and Inference pp 60-73

Purchase, H.C.

89

NLS ground states on graphs  

E-Print Network (OSTI)

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

Riccardo Adami; Enrico Serra; Paolo Tilli

2014-06-16T23:59:59.000Z

90

On Edge Szeged Index of Bridge Graphs  

Science Journals Connector (OSTI)

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

Fuqin Zhan; Youfu Qiao

2013-01-01T23:59:59.000Z

91

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

Science Journals Connector (OSTI)

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

John P. Georges; David W. Mauro

2005-05-01T23:59:59.000Z

92

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

Science Journals Connector (OSTI)

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

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

2009-12-01T23:59:59.000Z

93

Hybrid motion graph for character motion synthesis  

Science Journals Connector (OSTI)

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

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

2014-02-01T23:59:59.000Z

94

THE TUKEY ORDER FOR GRAPHS 1. Introduction  

E-Print Network (OSTI)

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

Nyikos, Peter J.

95

Landscape Maps for Enterprise Architectures L. van der Torre1  

E-Print Network (OSTI)

Landscape Maps for Enterprise Architectures L. van der Torre1 , M.M. Lankhorst2 , H. ter Doest2 , J, the Netherlands 3 Ordina, the Netherlands 4 CWI, Amsterdam, the Netherlands Abstract. Landscape maps of an easy to understand 2D 'map'. A landscape map view on architectures provides non-technical stake

van der Torre, Leon

96

3 D interactive pictorial maps  

E-Print Network (OSTI)

of simplififcation and exaggeration.. . . . . . . . . . . . . . 21 8 3 D polygonal text in Maya. . . . . . . . . . . . . . . . . . . . . . . . 22 9 Final 3 D model of Italy with text. . . . . . . . . . . . . . . . . . . . 23 10 Top view of 3 D model of France... the files in a format that is suitable for web viewing. 15 CHAPTER IV METHODOLOGY There are three major steps to making an interactive pictorial map. The fifrst step is to build the 3 D model using a modeling software, Maya. The second step is to apply...

Naz, Asma

2005-02-17T23:59:59.000Z

97

D-branes and Azumaya/matrix noncommutative differential geometry,II: Azumaya/matrix supermanifolds and differentiable maps therefrom -- with a view toward dynamical fermionic D-branes in string theory  

E-Print Network (OSTI)

In this Part II of D(11), we introduce new objects: super-$C^k$-schemes and Azumaya super-$C^k$-manifolds with a fundamental module (or, synonymously, matrix super-$C^k$-manifolds with a fundamental module), and extend the study in D(11.1) ([L-Y3], arXiv:1406.0929 [math.DG]) to define the notion of `differentiable maps from an Azumaya/matrix supermanifold with a fundamental module to a real manifold or supermanifold'. This allows us to introduce the notion of `fermionic D-branes' in two different styles, one parallels Ramond-Neveu-Schwarz fermionic string and the other Green-Schwarz fermionic string. A more detailed discussion on the Higgs mechanism on dynamical D-branes in our setting, taking maps from the D-brane world-volume to the space-time in question and/or sections of the Chan-Paton bundle on the D-brane world-volume as Higgs fields, is also given for the first time in the D-project. Finally note that mathematically string theory begins with the notion of a differentiable map from a string world-sheet...

Liu, Chien-Hao

2014-01-01T23:59:59.000Z

98

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

99

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":""}]}

100

Career Map: Attorney | Department of Energy  

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

Attorney Career Map: Attorney A smiling female attorney stands by the window in a high rise building, with a view of the other buildings outside. Attorney Position Title Attorney...

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

A Transformational View of Cartography W. R. Tobler  

E-Print Network (OSTI)

A Transformational View of Cartography W. R. Tobler ABSTRACT. Cartographic transformations aliases are between points, lines, and areas. Substantive transformations occur in map interpolation transformational grammars, as originally devised for linguistics.2, 4 A similar, though less ambitious, attempt

Clarke, Keith

102

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

103

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

104

Security of graph data: hashing schemes and definitions  

Science Journals Connector (OSTI)

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

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

2014-03-01T23:59:59.000Z

105

Presented by Scalable Graph Decompositions  

E-Print Network (OSTI)

Approach #12;4 Managed by UT-Battelle for the U.S. Department of Energy Sullivan_MapD_SC10 Tree by UT-Battelle for the U.S. Department of Energy Sullivan_MapD_SC10 Finding a tree decomposition · Tree.S. Department of Energy Sullivan_MapD_SC10 Yeast Protein Interaction Network Motivation · Massive data

106

Locating-total domination in graphs  

Science Journals Connector (OSTI)

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

Michael A. Henning; Nader Jafari Rad

2012-01-01T23:59:59.000Z

107

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

108

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

E-Print Network (OSTI)

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

Dave

2012-03-20T23:59:59.000Z

109

On real number labelings and graph invertibility  

Science Journals Connector (OSTI)

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

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

2012-10-01T23:59:59.000Z

110

Some algorithmic results in graph imbeddings  

E-Print Network (OSTI)

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

Joshi, Sanjay

1990-01-01T23:59:59.000Z

111

Generating Reports & Graphs in Portfolio Manager  

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

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

112

Nuclear reactor multiphysics via bond graph formalism  

E-Print Network (OSTI)

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

Sosnovsky, Eugeny

2014-01-01T23:59:59.000Z

113

Hamilton Decompositions of Graphs with Primitive Complements .  

E-Print Network (OSTI)

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

OZKAN, SIBEL

2007-01-01T23:59:59.000Z

114

Generation of graph-state streams  

E-Print Network (OSTI)

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

Daniel Ballester; Jaeyoon Cho; M. S. Kim

2010-12-08T23:59:59.000Z

115

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

E-Print Network (OSTI)

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

Zaslavsky, Thomas

116

3D Graph Visualization with the Oculus Rift Virtual Graph Reality  

E-Print Network (OSTI)

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

Wismath, Stephen

117

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

E-Print Network (OSTI)

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

Wu, David

118

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

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

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

119

From Entity Relationship to XML Schema: A Graph-Theoretic Approach  

Science Journals Connector (OSTI)

We propose a mapping from the Enhanced Entity Relationship conceptual model to the W3C XML Schema Language with the following properties: information and integrity constraints are preserved, no redundance is introduced, different hierarchical views of ...

Massimo Franceschet; Donatella Gubiani; Angelo Montanari; Carla Piazza

2009-08-01T23:59:59.000Z

120

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":""}]}

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

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

National Nuclear Security Administration (NNSA)

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

122

LD-graphs and global location-domination in bipartite graphs  

Science Journals Connector (OSTI)

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

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

2014-01-01T23:59:59.000Z

123

Extremal optimization for graph partitioning Stefan Boettcher*  

E-Print Network (OSTI)

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

Percus, Allon

124

Graph searching and a generalized parking function  

E-Print Network (OSTI)

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

Kostic, Dimitrije Nenad

2009-05-15T23:59:59.000Z

125

Feature Tracking Using Reeb Graphs  

SciTech Connect

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

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

2010-08-02T23:59:59.000Z

126

Maps and Mapping Page 1 of 7  

E-Print Network (OSTI)

Maps and Mapping Page 1 of 7 OBJECTIVES This exercise covers map projection, the systematic rendering of the earth's round, three-dimensional surface onto a flat map. Any map projection inherently, and orientation of the earth's surface features. You will use Flex Projector to evaluate various map projections

Clarke, Keith

127

Maps and Mapping Page 1 of 11  

E-Print Network (OSTI)

Maps and Mapping Page 1 of 11 OBJECTIVES Online mapping is redefining the concept of maps in our culture. Cartographic mash-ups, mapping applications that combine content from multiple sources. The relative ease with which anyone can add location based information to a map has inspired a mash

Clarke, Keith

128

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

129

Views on Automation  

Science Journals Connector (OSTI)

Views on Automation ... Industrial managements, he feels, must allay workers' fears by showing how they can take pride in the greater accomplishment of automated plants. ...

1957-07-29T23:59:59.000Z

130

Approximate von Neumann entropy for directed graphs  

Science Journals Connector (OSTI)

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

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

2014-05-12T23:59:59.000Z

131

Measuring extremal dependencies in Web graphs Yana Volkovich  

E-Print Network (OSTI)

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

Boucherie, Richard J.

132

Measuring Extremal Dependencies in Web Graphs Yana Volkovich  

E-Print Network (OSTI)

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

Boucherie, Richard J.

133

What Energy Functions Can Be Minimized via Graph Cuts?  

E-Print Network (OSTI)

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

Field, David

134

What Energy Functions can be Minimized via Graph Cuts?  

E-Print Network (OSTI)

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

Field, David

135

A Note on Hamilton Cycles in Kneser Graphs Ian Shields  

E-Print Network (OSTI)

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

Savage, Carla D.

136

Optimal acyclic edge colouring of grid like graphs  

Science Journals Connector (OSTI)

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

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

2010-11-01T23:59:59.000Z

137

Discrete Mathematics Algebraic and Topological Methods in Graph Theory  

E-Print Network (OSTI)

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

Mohar, Bojan

138

Fibonacci-like cubes as Z-transformation graphs  

Science Journals Connector (OSTI)

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

Heping Zhang, Lifeng Ou, Haiyuan Yao

2009-04-01T23:59:59.000Z

139

Discrete Applied Mathematics 121 (2002) 139153 NeST graphs  

E-Print Network (OSTI)

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

Hayward, Ryan B.

140

A role for matrices in graph theory  

E-Print Network (OSTI)

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

McLean, John Patrick

1971-01-01T23:59:59.000Z

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

NEWS & VIEWS Glass dynamics  

E-Print Network (OSTI)

NEWS & VIEWS Glass dynamics Diverging views on glass transition Gregory B. mc.mckenna@ttu.edu T he glass transition is one of the most intriguing phenomena in the world of soft condensed matter. Despite decades of study, many aspects of the behaviour of glass-forming liquids remain elusive

Weeks, Eric R.

142

News and Views  

Science Journals Connector (OSTI)

......Model 8600 and 8700 gas chromatographs to...untended operation of the gas chromatograph under...0325) 311044. 133 News and Views Macintosh-compatible...speed of the Apple drives and a software incompatibility...for a corporate 134 News and Views licence...that Chem-X was the natural choice: 'Chem-X......

Alan H. Fielding

1990-04-01T23:59:59.000Z

143

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

144

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

145

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)

146

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

147

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

148

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

149

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)

150

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

151

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

152

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)

153

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.

154

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":""}]}

155

GIS Surface Effects Map Archive, Nevada Test Site, Nevada  

SciTech Connect

The GIS Surface Effects Map Archive contains a comprehensive collection of maps showing the surface effects produced by underground nuclear testing at the Nevada Test Site. From 1951 to 1992, scientists with the U.S. Geological Survey and agencies of the U.S. Department of Energy used field and aerial-photo mapping techniques to painstakingly map such surface effects as collapse sinks, craters, cracks, fractures, faults, and pressure ridges. Shortly after each test, a complex surface effects map was produced. Of the more than 920 underground detonations conducted at the Nevada Test Site, 688 were mapped for surface effects. This archive preserves these original maps in digital format. A Geographic Information System (GIS) was used to digitally reproduce each original, hand-drawn surface effects map and to assemble these maps into the digital data sets of this archive. The archive was designed to allow easy access to the maps, while preserving the original maps for perpetuity. Users can query the detonation sites database; prepare, view, and print individual or composite maps; and perform various types of scientific analysis and management tasks. Spatial analyses and queries can be performed on detonation sites and related surface effects in conjunction with other chronological, geographical, geological, or hydrological information via links to external maps and databases. This browser interface provides information about the archive, the history of surface effects mapping at the Nevada Test Site, the methods used to produce the digital surface effects maps, and links to published reports, data tables, and maps. Location maps show testing areas, operational areas, and detonation sites. Demonstration maps illustrate the methods used to produce the digital surface effects maps and exhibit some of the characteristics and uses for these data. Use the links below to view and print individual surface effects maps, retrieve information about the detonations and types of surface effects produced, and to learn about the organization and intended use of the map data contained in the archive.

Grasso, Dennis N.

2003-08-28T23:59:59.000Z

156

3-Rainbow Domination Number in Graphs  

Science Journals Connector (OSTI)

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

Kung-Jui Pai; Wei-Jai Chiu

2013-01-01T23:59:59.000Z

157

Graph Summarization with Bounded Error Saket Navlakha  

E-Print Network (OSTI)

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

Gruner, Daniel S.

158

On semidefinite programming bounds for graph bandwidth  

E-Print Network (OSTI)

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

2011-05-24T23:59:59.000Z

159

Graph Implementations for Nonsmooth Convex Programs  

E-Print Network (OSTI)

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

2007-09-07T23:59:59.000Z

160

The Minimum Rank Problem for Outerplanar Graphs.  

E-Print Network (OSTI)

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

Sinkovic, John Henry

2013-01-01T23:59:59.000Z

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

Minimum rank of graphs that allow loops.  

E-Print Network (OSTI)

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

Mikkelson, Rana C.

2008-01-01T23:59:59.000Z

162

Bipartite graph partitioning and data clustering  

SciTech Connect

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

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

2001-05-07T23:59:59.000Z

163

Hamilton Paths in Generalized Petersen Graphs.  

E-Print Network (OSTI)

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

Pensaert, William

2006-01-01T23:59:59.000Z

164

Progressive transitions using body part motion graphs  

Science Journals Connector (OSTI)

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

Adso Fernández-Baena; David Miralles

2011-12-01T23:59:59.000Z

165

A Faster Algorithm for Computing Motorcycle Graphs  

Science Journals Connector (OSTI)

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

Antoine Vigneron, Lie Yan

2014-10-01T23:59:59.000Z

166

About equivalent interval colorings of weighted graphs  

Science Journals Connector (OSTI)

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

Mathieu Bouchard; Mirjana angalovi?; Alain Hertz

2009-10-01T23:59:59.000Z

167

Accelerating semantic graph databases on commodity clusters  

SciTech Connect

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

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

2013-10-06T23:59:59.000Z

168

Graph representation of protein free energy landscape  

SciTech Connect

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

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

2013-11-14T23:59:59.000Z

169

Site Map | DOEpatents  

Office of Scientific and Technical Information (OSTI)

Site Map Site Map Home Basic Search Advanced Search DOEpatents FAQ About DOEpatents Site Map Contact Us Website PoliciesImportant Links...

170

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

171

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,

172

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

E-Print Network (OSTI)

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

Durocher, Stephane

173

View - Optimization Online  

E-Print Network (OSTI)

[56] W.F. Stinespring, Positive functions on C. ?. -algebras, Proc. Amer. Math. Soc. 6(1955), 211–216. [57] E. Stømer, Extension of positive maps into B(H), ...

2012-03-15T23:59:59.000Z

174

Fermilab Map Instructions  

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

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

175

Maps and Mapping Lab 6: Terrain Representation  

E-Print Network (OSTI)

Maps and Mapping Lab 6: Terrain Representation OBJECTIVES Representing the earth's relief on a two. In this exercise, we will examine some ways that terrain can be represented on a map and in digital form. You exaggeration using Google Earth. MATERIALS USGS Quadrangle map, Ruler, Pencil, Calculator, Google Earth (4

Clarke, Keith

176

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

177

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

178

View dependent fluid dynamics  

E-Print Network (OSTI)

VIEW DEPENDENT FLUID DYNAMICS A Thesis by BRIAN ARTHUR BARRAN Submitted to the Office of Graduate Studies of Texas A&M University in partial fulfillment of the requirements for the degree of MASTER OF SCIENCE May 2006 Major Subject: Visualization... Sciences VIEW DEPENDENT FLUID DYNAMICS A Thesis by BRIAN ARTHUR BARRAN Submitted to the Office of Graduate Studies of Texas A&M University in partial fulfillment of the requirements for the degree of MASTER OF SCIENCE Approved by: Chair of Committee, Donald...

Barran, Brian Arthur

2006-08-16T23:59:59.000Z

179

Streaming Graph Computations with a Helpful Advisor  

E-Print Network (OSTI)

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

Cormode, Graham; Thaler, Justin

2010-01-01T23:59:59.000Z

180

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

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

An efficient semidefinite programming relaxation for the graph ...  

E-Print Network (OSTI)

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

2012-08-28T23:59:59.000Z

182

Synthesis of Parallel Hardware Implementations from Synchronous Dataflow Graph Specifications  

E-Print Network (OSTI)

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

183

Synthesis of Parallel Hardware Implementations from Synchronous Dataflow Graph Specifications  

E-Print Network (OSTI)

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

184

Towards a Query-by-Example System for Knowledge Graphs  

Science Journals Connector (OSTI)

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

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

2014-06-01T23:59:59.000Z

185

Graph Expansion, Tseitin Formulas and Resolution Proofs for CSP  

Science Journals Connector (OSTI)

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

Dmitry Itsykson; Vsevolod Oparin

2013-01-01T23:59:59.000Z

186

Graph isomorphism and adiabatic quantum computing  

Science Journals Connector (OSTI)

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

Frank Gaitan and Lane Clark

2014-02-28T23:59:59.000Z

187

BAG: a graph theoretic sequence clustering algorithm  

Science Journals Connector (OSTI)

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

Sun Kim; Jason Lee

2006-01-01T23:59:59.000Z

188

Bose-Einstein condensation on quantum graphs  

E-Print Network (OSTI)

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

Jens Bolte; Joachim Kerner

2014-03-02T23:59:59.000Z

189

Entanglement of graph states up to 8 qubits  

E-Print Network (OSTI)

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

Xiao-yu Chen

2009-09-09T23:59:59.000Z

190

Tips for Key Maps / Inset Maps How Do I Add a Key Maps or Inset Maps  

E-Print Network (OSTI)

Tips for Key Maps / Inset Maps How Do I Add a Key Maps or Inset Maps You need a new data frame o the properties/look of the extent rectangle Tips Index Map o Should be a simplified version of the map o Should cover at least 5X the area of the main map o Should have its own scale/coordinates/title o Main coverage

Brownstone, Rob

191

News and Views  

Science Journals Connector (OSTI)

... -16. The discussions on road lighting, from the point of view both of the pedestrian and the car driver, were valuable, as they show how complex the problem is ... problem is, depending as it does on difficult questions of physiology and psychology. The pedestrian wants to see small obstructions on the road and the numbers on the houses; ...

1928-07-28T23:59:59.000Z

192

A survey of models of the web graph Anthony Bonato  

E-Print Network (OSTI)

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

Bonato, Anthony

193

Comparison of coarsening schemes for multilevel graph partitioning  

E-Print Network (OSTI)

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

Safro, Ilya

194

On minimum balanced bipartitions of triangle-free graphs  

Science Journals Connector (OSTI)

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

Haiyan Li; Yanting Liang; Muhuo Liu; Baogang Xu

2014-04-01T23:59:59.000Z

195

Hamiltonian Cycles on Symmetrical Graphs Carlo H. Squin  

E-Print Network (OSTI)

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

O'Brien, James F.

196

Compatible Hamilton cycles in Dirac graphs Michael Krivelevich  

E-Print Network (OSTI)

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

Krivelevich, Michael

197

Infinite Hamilton Cycles in Squares of Locally Finite Graphs  

E-Print Network (OSTI)

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

Diestel, Reinhard

198

Robust Self-assembly of Graphs Stanislav Angelov1  

E-Print Network (OSTI)

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

Pennsylvania, University of

199

Simultaneous Segmentation and Filtering via Reduced Graph Cuts  

E-Print Network (OSTI)

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

Malgouyres, François

200

Cellular Algebras and Graph Invariants Based on Quantum Walks  

E-Print Network (OSTI)

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

Jamie Smith

2011-03-01T23:59:59.000Z

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

EFFECTIVE RESISTANCE ON GRAPHS AND THE EPIDEMIC QUASIMETRIC  

E-Print Network (OSTI)

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

Poggi-Corradini, Pietro

202

Bicycles and Left-Right Tours in Locally Finite Graphs  

E-Print Network (OSTI)

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

Diestel, Reinhard

203

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

204

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

205

A New View of the Cosmic Landscape  

E-Print Network (OSTI)

In this scenario, a generic meta-stable deSitter vacuum site in the cosmic landscape in string theory has a very short lifetime. Typically, the smaller is the vacuum energy of a meta-stable site, the longer is its lifetime. This view of the landscape can provide a qualitative dynamical explanation why the dark energy of our universe is so small. The argument for this scenario is based on resonance tunneling, a well-known quantum mechanical phenomenon, the topography of the landscape, and the vastness of the cosmic landscape. Mapping the topography of the landscape, even if only in a small region, will test the validity of this scenario.

S. -H. Henry Tye

2007-04-16T23:59:59.000Z

206

Parameterized Algorithms for Graph Partitioning Problems  

E-Print Network (OSTI)

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

Shachnai, Hadas

207

Algorithms for Graphs (Locally) Bounded Treewidth  

E-Print Network (OSTI)

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

Hajiaghayi, Mohammad

208

Graph Domination, Coloring and Cliques in Telecommunications  

E-Print Network (OSTI)

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

Butenko, Sergiy

209

Optimizing Path Query Performance: Graph Clustering Strategies  

E-Print Network (OSTI)

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

210

The Web Graph of a Tourism System  

E-Print Network (OSTI)

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

Baggio, R

2006-01-01T23:59:59.000Z

211

Connected obstructions to full graph homomorphisms  

Science Journals Connector (OSTI)

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

Pavol Hell, Aleš Pultr

2014-10-01T23:59:59.000Z

212

Graph Processing on an "almost" Relational Database  

Science Journals Connector (OSTI)

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

Ramesh Subramonian

2014-06-01T23:59:59.000Z

213

Betti Numbers of Graph Sean Jacques  

E-Print Network (OSTI)

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

Katzman, Moty

214

Graph-Theoretic Scagnostics Leland Wilkinson  

E-Print Network (OSTI)

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

Grossman, Robert

215

NEST REPRESENTATIONS OF DIRECTED GRAPH ALGEBRAS  

E-Print Network (OSTI)

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

Katsoulis, Elias G.

216

A solution to the next best view problem based on D-Spheres for 3D object recognition  

Science Journals Connector (OSTI)

This paper describes a new strategy of optimal view point selection for 3D object recognition purposes. Feature vectors of an object viewed from specific viewpoints are mapped on the nodes of a tessellated sphere which we call D-Sphere. The next best ... Keywords: 3D recognition, active recognition system, next best view

Elizabeth González; Antonio Adán; Vicente Feliú; Luis Sánchez

2008-02-01T23:59:59.000Z

217

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

218

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

219

Maps and Plans  

E-Print Network (OSTI)

shrouded door to box seats. Rose / Maps and Plans Re-Placing Places 20.1 Rose / Maps and Plans Re-Placing PlacesMaps and Plans Thomas Rose Architectural plans create the

Rose, Thomas

2008-01-01T23:59:59.000Z

220

Holomorphic segre preserving maps  

E-Print Network (OSTI)

for holomorphic Segre maps. Math. Ann. 337, 457-478, (2007).There are no holomorphic maps satisfying criteria (1.37). (j ? C\\{0}, the family of maps given by H = c 1 z 1 , . . . ,

Angle, Robert Blair

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


221

On the degree distribution of horizontal visibility graphs associated to Markov processes and dynamical systems: diagrammatic and variational approaches  

E-Print Network (OSTI)

Dynamical processes can be transformed into graphs through a family of mappings called visibility algorithms, enabling the possibility of (i) making empirical data analysis and signal processing and (ii) characterising classes of dynamical systems and stochastic processes using the tools of graph theory. Recent works show that the degree distribution of these graphs encapsulates much information on the signals variability, and therefore constitutes a fundamental feature for statistical learning purposes. However, exact solutions for the degree distributions are only known in a few cases, such as for uncorrelated random processes. Here we analytically explore these distributions in a list of situations. We present a diagrammatic formalism which computes for all degrees their corresponding probability as a series expansion in a coupling constant which is the number of hidden variables. We offer a constructive solution for general Markovian stochastic processes and deterministic maps. As case tests we focus on Ornstein-Uhlenbeck processes, fully chaotic and quasiperiodic maps. Whereas only for certain degree probabilities can all diagrams be summed exactly, in the general case we show that the perturbation theory converges. In a second part, we make use of a variational technique to predict the complete degree distribution for special classes of Markovian dynamics with fast-decaying correlations. In every case we compare the theory with numerical experiments.

Lucas Lacasa

2014-02-21T23:59:59.000Z

222

Site Map | ScienceCinema  

Office of Scientific and Technical Information (OSTI)

Site Map Site Map Home Audio Search Fielded Search About Help Site Map Contact Us Website PoliciesImportant Links...

223

Historical Network Maps  

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

Publications and Presentations Galleries ESnet Awards and Honors ESnet Live Blog Home Engineering Services The Network Network Maps Historical Network Maps Engineering...

224

“Deep Maps”: A Brief for Digital Palimpsest Mapping Projects (DPMPs, or “Deep Maps”)  

E-Print Network (OSTI)

DEEP  MAPS”:  A  Brief  for   Digital  Palimpsest  DPMPs,  or  “Deep  Maps”)   SHELLEY  FISHER  FISHKIN  paintings,   drawings,   maps,   photos,   books,  

Fishkin, Shelley Fisher

2011-01-01T23:59:59.000Z

225

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

226

Social image tagging using graph-based reinforcement on multi-type interrelated objects  

Science Journals Connector (OSTI)

Social image tagging is becoming increasingly popular with the development of social website, where images are annotated with arbitrary keywords called tags. Most of present image tagging approaches are mainly based on the visual similarity or mapping between visual feature and tags. However, in the social media environment, images are always associated with multi-type of object information (i.e., visual content, tags, and user contact information) which makes this task more challenging. In this paper, we propose to fuse multi-type of information to tag social image. Specifically, we model social image tagging as a “ranking and reinforcement” problem, and a novel graph-based reinforcement algorithm for interrelated multi-type objects is proposed. When a user issue a tagging request for a query image, a candidate tag set is derived and a set of friends of the query user is selected. Then a graph which contains three types of objects (i.e., visual features of the query image, candidate tags, and friend users) is constructed, and each type of objects are initially ranked based on their weight and intra-relation. Finally, candidate tags are re-ranked by our graph-based reinforcement algorithm which takes into consideration both inter-relation with visual features and friend users, and the top ranked tags are saved. Experiments on real-life dataset demonstrate that our algorithm significantly outperforms state-of-the-art algorithms.

Xiaoming Zhang; Xiaojian Zhao; Zhoujun Li; Jiali Xia; Ramesh Jain; Wenhan Chao

2013-01-01T23:59:59.000Z

227

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

228

NUPlans Budgeting Grant Input View  

E-Print Network (OSTI)

NUPlans Budgeting Grant Input View FMS704 NUPlansGrantInputViewV2 Last updated 4/7/2014 - rb © 2014 Northwestern University FMS704 NUPlans Contributor Budgeting 1 of 5 NUPlans Grant Input View NUPlans enables schools and units with grant projects to input grant expense estimates per project for the next fiscal

Shull, Kenneth R.

229

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":""}]}

230

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":""}]}

231

Quantum graph as a quantum spectral filter  

SciTech Connect

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

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

2013-03-15T23:59:59.000Z

232

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

233

Career Map: Instrumentation Coordinator  

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

The Wind Program's Career Map provides job description information for Instrumentation Coordinator positions.

234

Career Map: Engineering Manager  

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

The Wind Program's Career Map provides job description information for Engineering Manager positions.

235

Career Map: Environmental Scientist  

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

The Wind Program's Career Map provides job description information for Environmental Scientist positions.

236

Career Map: Construction Worker  

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

The Wind Program's Career Map provides job description information for Construction Worker positions.

237

Career Map: Industrial Engineer  

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

The Wind Program's Career Map provides job description information for Industrial Engineer positions.

238

Career Map: Mechanical Engineer  

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

The Wind Program's Career Map provides job description information for Mechanical Engineer positions.

239

Career Map: Aerospace Engineer  

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

The Wind Program's Career Map provides job description information for Aerospace Engineer positions.

240

Career Map: Resource Scientist  

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

The Wind Program's Career Map provides job description information for Resource Scientist positions.

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

Career Map: Electrical Engineer  

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

The Wind Program's Career Map provides job description information for Electrical Engineer positions.

242

Career Map: Research Scientist  

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

The Wind Program's Career Map provides job description information for Research Scientist positions.

243

Career Map: Transportation Worker  

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

The Wind Program's Career Map provides job description information for Transportation Worker positions.

244

Career Map: Meteorological Technician  

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

The Wind Program's Career Map provides job description information for Meteorological Technician positions.

245

A Parallel Graph Partitioner for STAPL  

E-Print Network (OSTI)

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

Castet, Nicolas

2013-04-26T23:59:59.000Z

246

Differential maps, difference maps, interpolated maps, and long term prediction  

SciTech Connect

Mapping techniques may be thought to be attractive for the long term prediction of motion in accelerators, especially because a simple map can approximately represent an arbitrarily complicated lattice. The intention of this paper is to develop prejudices as to the validity of such methods by applying them to a simple, exactly solveable, example. It is shown that a numerical interpolation map, such as can be generated in the accelerator tracking program TEAPOT, predicts the evolution more accurately than an analytically derived differential map of the same order. Even so, in the presence of appreciable'' nonlinearity, it is shown to be impractical to achieve accurate'' prediction beyond some hundreds of cycles of oscillation. This suggests that the value of nonlinear maps is restricted to the parameterization of only the leading'' deviation from linearity. 41 refs., 6 figs.

Talman, R.

1988-06-01T23:59:59.000Z

247

Protective laser beam viewing device  

DOE Patents (OSTI)

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

248

Parallel Chip-Firing on the Complete Graph: Devil's Staircase and Poincare Rotation Number  

E-Print Network (OSTI)

We study how parallel chip-firing on the complete graph K_n changes behavior as we vary the total number of chips. Surprisingly, the activity of the system, defined as the average number of firings per time step, does not increase smoothly in the number of chips; instead it remains constant over long intervals, punctuated by sudden jumps. In the large n limit we find a "devil's staircase" dependence of activity on the number of chips. The proof proceeds by reducing the chip-firing dynamics to iteration of a self-map of the circle S^1, in such a way that the activity of the chip-firing state equals the Poincare rotation number of the circle map. The stairs of the devil's staircase correspond to periodic chip-firing states of small period.

Levine, Lionel

2008-01-01T23:59:59.000Z

249

Locating-total domination in claw-free cubic graphs  

Science Journals Connector (OSTI)

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

Michael A. Henning; Christian Löwenstein

2012-01-01T23:59:59.000Z

250

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.

251

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

252

Sharp thresholds for Hamiltonicity in random intersection graphs  

Science Journals Connector (OSTI)

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

Charilaos Efthymiou; Paul G. Spirakis

2010-09-01T23:59:59.000Z

253

k-Boson Quantum Walks Do Not Distinguish Arbitrary Graphs  

E-Print Network (OSTI)

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

Jamie Smith

2010-04-01T23:59:59.000Z

254

Ising-like models on arbitrary graphs : the Hadamard way  

E-Print Network (OSTI)

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

Mosseri, Rémy

2014-01-01T23:59:59.000Z

255

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

E-Print Network (OSTI)

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

2006-04-27T23:59:59.000Z

256

Independent set problems and odd-hole-preserving graph reductions  

E-Print Network (OSTI)

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

Warren, Jeffrey Scott

2009-05-15T23:59:59.000Z

257

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

E-Print Network (OSTI)

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

2011-03-17T23:59:59.000Z

258

Isomorphism testing for circulant graphs Cn(a, b)  

E-Print Network (OSTI)

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

2010-03-10T23:59:59.000Z

259

A notable family of entire intrinsic minimal graph...  

E-Print Network (OSTI)

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

2006-09-09T23:59:59.000Z

260

Thematic Maps 9 Thematic Maps: Visualizing  

E-Print Network (OSTI)

Thematic Maps 9 Thematic Maps: Visualizing Spatial Variability and Shared Benefits SSSSSpatial Agreements Figure 5. GIS and visualization: from bottom to top -- topography, social water stress index and Mexico..... By superimposing several different data sets within a Geographic Information System (GIS

Wolf, Aaron

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

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

E-Print Network (OSTI)

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

Kepner, Jeremy

262

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

Open Energy Info (EERE)

Field Mapping Using Arcpad, In: Digital Mapping Techniques '02- Workshop Proceedings Abstract Research into the practicality of digital mapping by Placer Dome Exploration...

263

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

264

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

265

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

266

Memory-mapped transactions  

E-Print Network (OSTI)

Memory-mapped transactions combine the advantages of both memory mapping and transactions to provide a programming interface for concurrently accessing data on disk without explicit I/O or locking operations. This interface ...

Sukha, Jim

2005-01-01T23:59:59.000Z

267

Integrable quantum mappings  

Science Journals Connector (OSTI)

A quantum R-matrix structure is presented for a family of exactly integrable multidimensional rational mappings related to lattice versions of the Korteweg–de Vries equation. It is shown that these mappings possess a commuting family of invariants.

F. W. Nijhoff; H. W. Capel; V. G. Papageorgiou

1992-08-15T23:59:59.000Z

268

National Hydropower Map  

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

High-resolution map produced by Oak Ridge National Laboratory showing hydropower resources throughout the United States.

269

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":""}]}

270

A graph-based approach enhancing correctness and speed of web services composition through explicit specification of functional semantics  

Science Journals Connector (OSTI)

Since most of studies on the automated composition of web services do not consider the functional semantics of services, unsatisfied results may be generated against users' intentions. Their time complexity is very high since every possible combination of available services must be considered. To enhance the correctness and speed of the composition of services, we propose a graph-based composition method, which explicitly specifies and uses the functional semantics of web services. A representative action, which represents what a service actually does, is identified. Data dependencies among available services are organised and stored as an AND/OR graph, on which service composition is performed. Rules are devised to map a service onto an appropriate action and to combine service actions. Effective pruning rules are also proposed. The experimental results demonstrate the superiority of the proposed method in terms of the correctness and speed of service composition.

Dong-Hoon Shin; Kyong-Ho Lee; Fuyuki Ishikawa

2014-01-01T23:59:59.000Z

271

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ë

2010-05-31T23:59:59.000Z

272

MAPS MANUAL 2010 PROTOCOL  

E-Print Network (OSTI)

MAPS MANUAL 2010 PROTOCOL INSTRUCTIONS FOR THE ESTABLISHMENT AND OPERATION OF CONSTANT-EFFORT BIRD-BANDING STATIONS AS PART OF THE MONITORING AVIAN PRODUCTIVITY AND SURVIVORSHIP (MAPS) PROGRAM David F. De;ACKNOWLEDGEMENTS We thank MAPS biologists Eric Feuss, Denise Jones, Sara Martin, Eric (Zed) Ruhlen, Hillary Smith

DeSante, David F.

273

MAPS MANUAL 2014 PROTOCOL  

E-Print Network (OSTI)

MAPS MANUAL 2014 PROTOCOL INSTRUCTIONS FOR THE ESTABLISHMENT AND OPERATION OF CONSTANT-EFFORT BIRD-BANDING STATIONS AS PART OF THE MONITORING AVIAN PRODUCTIVITY AND SURVIVORSHIP (MAPS) PROGRAM David F. De;ACKNOWLEDGEMENTS We thank MAPS biologists Eric Feuss, Denise Jones, Sara Martin, Eric (Zed) Ruhlen, Hillary Smith

DeSante, David F.

274

MAPS MANUAL 2008 PROTOCOL  

E-Print Network (OSTI)

MAPS MANUAL 2008 PROTOCOL INSTRUCTIONS FOR THE ESTABLISHMENT AND OPERATION OF CONSTANT-EFFORT BIRD-BANDING STATIONS AS PART OF THE MONITORING AVIAN PRODUCTIVITY AND SURVIVORSHIP (MAPS) PROGRAM David F. De;ACKNOWLEDGEMENTS We thank MAPS biologists Eric Feuss, Denise Jones, Sara Martin, Eric (Zed) Ruhlen, Jim Saracco

DeSante, David F.

275

MAPS MANUAL 2013 PROTOCOL  

E-Print Network (OSTI)

MAPS MANUAL 2013 PROTOCOL INSTRUCTIONS FOR THE ESTABLISHMENT AND OPERATION OF CONSTANT-EFFORT BIRD-BANDING STATIONS AS PART OF THE MONITORING AVIAN PRODUCTIVITY AND SURVIVORSHIP (MAPS) PROGRAM David F. De;ACKNOWLEDGEMENTS We thank MAPS biologists Eric Feuss, Denise Jones, Sara Martin, Eric (Zed) Ruhlen, Hillary Smith

DeSante, David F.

276

MAPS MANUAL 2011 PROTOCOL  

E-Print Network (OSTI)

MAPS MANUAL 2011 PROTOCOL INSTRUCTIONS FOR THE ESTABLISHMENT AND OPERATION OF CONSTANT-EFFORT BIRD-BANDING STATIONS AS PART OF THE MONITORING AVIAN PRODUCTIVITY AND SURVIVORSHIP (MAPS) PROGRAM David F. De;ACKNOWLEDGEMENTS We thank MAPS biologists Eric Feuss, Denise Jones, Sara Martin, Eric (Zed) Ruhlen, Hillary Smith

DeSante, David F.

277

MAPS MANUAL 2012 PROTOCOL  

E-Print Network (OSTI)

MAPS MANUAL 2012 PROTOCOL INSTRUCTIONS FOR THE ESTABLISHMENT AND OPERATION OF CONSTANT-EFFORT BIRD-BANDING STATIONS AS PART OF THE MONITORING AVIAN PRODUCTIVITY AND SURVIVORSHIP (MAPS) PROGRAM David F. De;ACKNOWLEDGEMENTS We thank MAPS biologists Eric Feuss, Denise Jones, Sara Martin, Eric (Zed) Ruhlen, Hillary Smith

DeSante, David F.

278

Real-Time Traffic Maps  

E-Print Network (OSTI)

d. (2007). Barcelona Traffic Map. Barcelona. 2007. Berendt,Spatial Thinking with Geographic Maps: An Empirical Study.Data on Choropleth Maps in Series." Annals of the

Goldsberry, Kirk Patrick

2007-01-01T23:59:59.000Z

279

Site Map - EERE Commercialization Office  

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

Site Map Site Map Printable Version Share this resource Quick Links Energy Innovation Portal Site Map Commercialization Home Page About Success Stories Legacy Initiatives Small...

280

Site Map | DOE Data Explorer  

Office of Scientific and Technical Information (OSTI)

Site Map Site Map Home Basic Search Advanced Search DDE FAQ About DDE Site Map Data ID Service Contact Us Website PoliciesImportant Links...

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

Ising models on power-law random graphs Sander Dommers  

E-Print Network (OSTI)

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

Hofstad, Remco van der

282

GRAPH THEORY AND PFAFFIAN REPRESENTATIONS OF ISING PARTITION FUNCTION.  

E-Print Network (OSTI)

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

Recanati, Catherine

283

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

Science Journals Connector (OSTI)

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

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

2011-02-01T23:59:59.000Z

284

Local algorithms for the prime factorization of strong product graphs  

E-Print Network (OSTI)

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

Stadler, Peter F.

285

A SPATIAL WEB GRAPH MODEL WITH LOCAL INFLUENCE REGIONS  

E-Print Network (OSTI)

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

Pralat, Pawel

286

Semidefinite programming and eigenvalue bounds for the graph ...  

E-Print Network (OSTI)

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

2013-11-26T23:59:59.000Z

287

ADAGE: A software package for analyzing graph evolution  

E-Print Network (OSTI)

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

288

MATLAB Tutorial Getting Started with Calculations, Graphing and Programming  

E-Print Network (OSTI)

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

Weinberger, Hans

289

New approximation algorithms for minimum cycle bases of graphs  

Science Journals Connector (OSTI)

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

Telikepalli Kavitha; Kurt Mehlhorn; Dimitrios Michail

2007-02-01T23:59:59.000Z

290

Rank Synopses for Efficient Time Travel on the Web Graph  

E-Print Network (OSTI)

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

291

Algorithms to Compute Minimum Cycle Basis in Directed Graphs #  

E-Print Network (OSTI)

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

Mehlhorn, Kurt

292

VIDEO SUMMARIZATION BY VIDEO STRUCTURE ANALYSIS AND GRAPH OPTIMIZATION  

E-Print Network (OSTI)

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

King, Kuo Chin Irwin

293

Video Denoising and Simplification Via Discrete Regularization on Graphs  

E-Print Network (OSTI)

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

Paris-Sud XI, Université de

294

Fast top-k simple shortest paths discovery in graphs  

Science Journals Connector (OSTI)

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

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

2010-10-01T23:59:59.000Z

295

Some Remarks on Factor Graphs Hans-Andrea Loeliger  

E-Print Network (OSTI)

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

Loeliger, Hans-Andrea

296

Which Codes Have Cycle-Free Tanner Graphs?  

E-Print Network (OSTI)

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

Karpovsky, Mark

297

Graph-based Image Segmentation Using Weighted Color Patch  

E-Print Network (OSTI)

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

Paris-Sud XI, Université de

298

THE ELECTRICAL RESISTANCE OF A GRAPH CAPTURES ITS  

E-Print Network (OSTI)

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

Borenstein, Elhanan

299

A COMBINATORIAL PROOF OF RAYLEIGH MONOTONICITY FOR GRAPHS  

E-Print Network (OSTI)

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

300

Bicyclic graphs with exactly two main signless Laplacian eigenvalues  

E-Print Network (OSTI)

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

Huang, He

2012-01-01T23:59:59.000Z

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

Motorcycle Graphs and Straight Skeletons Siu-Wing Cheng  

E-Print Network (OSTI)

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

Vigneron, Antoine

302

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

E-Print Network (OSTI)

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

2013-08-08T23:59:59.000Z

303

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

304

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":""}]}

305

International energy indicators. [Statistical tables and graphs  

SciTech Connect

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

Bauer, E.K. (ed.)

1980-05-01T23:59:59.000Z

306

Maps & Web Mapping: An Introduction to Cartography Edition (2015)  

E-Print Network (OSTI)

Maps & Web Mapping: An Introduction to Cartography 1st Edition (2015) By Keith Clarke Links Showcase Site http://www.pearsonhighered.com/clarke-1e-info/index.html Catalog Link Maps & Web Mapping

Clarke, Keith

307

An Experiment on Graph Analysis Methodologies for Scenarios  

SciTech Connect

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

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

2005-09-30T23:59:59.000Z

308

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

E-Print Network (OSTI)

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

Jing Zhang

2008-10-08T23:59:59.000Z

309

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

E-Print Network (OSTI)

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

310

ARMO: Adaptive Road Map Optimization for Large Robot Teams Alexander Kleiner*, Dali Sun* and Daniel Meyer-Delius*  

E-Print Network (OSTI)

in static environments [4] that compute during a pre-processing phase a connectivity graph in freeARMO: Adaptive Road Map Optimization for Large Robot Teams Alexander Kleiner*, Dali Sun* and Daniel Meyer-Delius* Abstract-- Autonomous robot teams that simultaneously dis- patch transportation tasks

Nebel, Bernhard

311

Aeromagnetic map | Open Energy Information  

Open Energy Info (EERE)

map Jump to: navigation, search OpenEI Reference LibraryAdd to library Map: Aeromagnetic mapInfo GraphicMapChart Cartographer Zietz and Kirby Published U.S. Geological Survey,...

312

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

313

Efficient broadcast on random geometric graphs  

SciTech Connect

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

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

2009-01-01T23:59:59.000Z

314

Bicyclic graphs with maximal revised Szeged index  

E-Print Network (OSTI)

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

Li, Xueliang

2011-01-01T23:59:59.000Z

315

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

E-Print Network (OSTI)

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

Paris-Sud XI, Université de

316

THE MATCHING ENERGY OF A GRAPH IVAN GUTMAN AND STEPHAN WAGNER  

E-Print Network (OSTI)

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

Wagner, Stephan

317

Multiclass Diffuse Interface Models for Semi-supervised Learning on Graphs  

E-Print Network (OSTI)

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

Percus, Allon

318

Generalized qudit Choi maps  

E-Print Network (OSTI)

Following the linear programming prescription of Ref. \\cite{PRA72}, the $d\\otimes d$ Bell diagonal entanglement witnesses are provided. By using Jamiolkowski isomorphism, it is shown that the corresponding positive maps are the generalized qudit Choi maps. Also by manipulating particular $d\\otimes d$ Bell diagonal separable states and constructing corresponding bound entangled states, it is shown that thus obtained $d\\otimes d$ BDEW's (consequently qudit Choi maps) are non-decomposable in certain range of their parameters.

M. A. Jafarizadeh; M. Rezaeen; S. Ahadpour

2006-07-24T23:59:59.000Z

319

Dot Density Maps Dot density maps, or dot maps, portray the geographic distribution of discrete phenomena  

E-Print Network (OSTI)

Dot Density Maps Dot density maps, or dot maps, portray the geographic distribution of discrete for representing geographic patterns. Dot density maps are particularly useful for understanding global distribution of the mapped phenomenon and comparing relative densities of different regions on the map. Dot

Klippel, Alexander

320

Locating and paired-dominating sets in graphs  

Science Journals Connector (OSTI)

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

John McCoy; Michael A. Henning

2009-01-01T23:59:59.000Z

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

Geodesic Distance in Planar Graphs: An Integrable Approach  

E-Print Network (OSTI)

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

P. Di Francesco

2005-06-27T23:59:59.000Z

322

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

323

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

324

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

325

Maps of Svalbard  

Science Journals Connector (OSTI)

... NORGES SVALBARD og Ishavs-undersokelser, now known as Norsk Polarinstitutt, has begun the issue of a detailed map of Svalbard in folded sheets, ...

1948-07-03T23:59:59.000Z

326

GPU-based Scalable Volumetric Reconstruction for Multi-view Stereo  

SciTech Connect

We present a new scalable volumetric reconstruction algorithm for multi-view stereo using a graphics processing unit (GPU). It is an effectively parallelized GPU algorithm that simultaneously uses a large number of GPU threads, each of which performs voxel carving, in order to integrate depth maps with images from multiple views. Each depth map, triangulated from pair-wise semi-dense correspondences, represents a view-dependent surface of the scene. This algorithm also provides scalability for large-scale scene reconstruction in a high resolution voxel grid by utilizing streaming and parallel computation. The output is a photo-realistic 3D scene model in a volumetric or point-based representation. We demonstrate the effectiveness and the speed of our algorithm with a synthetic scene and real urban/outdoor scenes. Our method can also be integrated with existing multi-view stereo algorithms such as PMVS2 to fill holes or gaps in textureless regions.

Kim, H; Duchaineau, M; Max, N

2011-09-21T23:59:59.000Z

327

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

E-Print Network (OSTI)

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

Jing Zhang

2008-08-14T23:59:59.000Z

328

Printed 3D Multi-View Images  

Science Journals Connector (OSTI)

The technique to produce full-parallax 3D multi-view still pictures is described. The matrix of source views (from 6x6 to 15x15 views) is built from computer-generated images or...

Kim, Sung-Sik; Son, Kwang-Hun; Saveljev, V V; Son, Jung-Young

2001-01-01T23:59:59.000Z

329

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

330

Relief Mapping of Non-Height-Field Surface Details Fabio Policarpo  

E-Print Network (OSTI)

. Teapot with a weave pattern (left). Close-up views of the teapot's body (center and right) reveal vector units, and is easier to implement. Figure 1(left) shows a teapot mapped with a weave pattern rendered with our technique. Close-up views of the teapot's body revealing the details of the pattern

Oliveira, Manuel M.

331

Exact Solution of Graph Coloring Problems via Constraint ...  

E-Print Network (OSTI)

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

2011-09-21T23:59:59.000Z

332

New Lower Bounds on the Stability Number of a Graph  

E-Print Network (OSTI)

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

2007-06-27T23:59:59.000Z

333

Modeling modern network attacks and countermeasures using attack graphs  

E-Print Network (OSTI)

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

Ingols, Kyle W.

334

Probabilistic flooding for efficient information dissemination in random graph topologies  

Science Journals Connector (OSTI)

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

Konstantinos Oikonomou; Dimitrios Kogias; Ioannis Stavrakakis

2010-07-01T23:59:59.000Z

335

A description of dynamical graphs associated to elementary regulatory circuits  

Science Journals Connector (OSTI)

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

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

2003-09-01T23:59:59.000Z

336

Drawing a Graph in a Hypercube David R. Wood  

E-Print Network (OSTI)

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

Wood, David R.

337

Drawing a Graph in a Hypercube David R. Wood  

E-Print Network (OSTI)

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

Wood, David R.

338

Ranking Outlier Nodes in Subspaces of Attributed Graphs  

E-Print Network (OSTI)

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

Antwerpen, Universiteit

339

Diamond graphs and super-reflexivity William B. Johnson  

E-Print Network (OSTI)

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

Johnson, William B.

340

Probabilistic Flooding for Efficient Information Dissemination in Random Graph  

E-Print Network (OSTI)

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

Stavrakakis, Ioannis

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

Solving Steiner Tree Problems in Graphs with Lagrangian Relaxation  

Science Journals Connector (OSTI)

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

Laura Bahiense; Francisco Barahona; Oscar Porto

2003-09-01T23:59:59.000Z

342

Technology Portfolio Planning by Weighted Graph Analysis of System Architectures  

E-Print Network (OSTI)

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

de Weck, Olivier L.

343

Circuit and bond polytopes on series-parallel graphs$  

E-Print Network (OSTI)

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

2014-07-10T23:59:59.000Z

344

Graph Model for Carbon Dioxide Emissions from Metallurgical Plants  

Science Journals Connector (OSTI)

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

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

2013-03-01T23:59:59.000Z

345

How are Feynman graphs resumed by the Loop Vertex Expansion?  

E-Print Network (OSTI)

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

Vincent Rivasseau; Zhituo Wang

2010-06-23T23:59:59.000Z

346

Integrated Management Requirements mapping  

SciTech Connect

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

347

Integrated Management Requirements mapping  

SciTech Connect

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

348

Enridged contour maps  

Science Journals Connector (OSTI)

The visualization of scalar functions of two variables is a classic and ubiquitous application. We present a new method to visualize such data. The method is based on a non-linear mapping of the function to a height field, followed by visualization as ... Keywords: contours, flow visualization, height fields, mapping, multivariate visualization

Jarke J. van Wijk; Alexandru Telea

2001-10-01T23:59:59.000Z

349

Maps & Geographic Information  

E-Print Network (OSTI)

Geog 380 Maps & Geographic Information Geog 488/588 GIS 1: Introduction to GIS Geog 475/575 Digital 495/595 Maps, Models & GIS Geog 489/589 Building a GIS Data Base with GPS Geog 492/592 GIS 2: Advanced Compilation & Data Base Design Geog 490/590 GIS Programming Geog 410/510 Applied GIS: 3-D Visualization Geog

350

Introgression & mapping Fiber cell  

E-Print Network (OSTI)

Germplasm Introgression Genomics & mapping Fiber cell initiation Radiation hybrid (RH) mapping and breeding. Research activities commonly include plant breeding, genetics, genomics, cytogenetics, molecular methods. (C, S) · Contribute uniquely to genomics and its relevance to genetic improvement (C,S) · Harness

351

Using Process Mining to Generate Accurate and Interactive Business Process Maps  

E-Print Network (OSTI)

Aalst Eindhoven University of Technology P.O. Box 513, NL-5600 MB, Eindhoven, The Netherlands. w these maps and the actual behavior recorded in event logs. This will allow for high-quality process models, and be able to view maps that can be customized in various ways (zoom-in/zoom- out, show fuel stations, speed

van der Aalst, Wil

352

The Branching of Graphs in 2-d Quantum Gravity  

E-Print Network (OSTI)

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

M. G. Harris

1996-07-16T23:59:59.000Z

353

K-theory of locally finite graph C Natalia Iyudu  

E-Print Network (OSTI)

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

354

Alliance Partition Number in Graphs Department of Mathematics  

E-Print Network (OSTI)

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

Gera, Ralucca

355

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.

356

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

357

The peculiar phase structure of random graph bisection  

SciTech Connect

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

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

2008-01-01T23:59:59.000Z

358

Mining the inner structure of the Web graph  

Science Journals Connector (OSTI)

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

Debora Donato; Stefano Leonardi; Stefano Millozzi; Panayiotis Tsaparas

2008-01-01T23:59:59.000Z

359

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

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

the MapSearch site. For information on how the 50m maps were developed, access the GIS Data Background page. For information on how some of the other wind maps were...

360

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

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

For more PV resource maps, access the MapSearch site. For Geographic Information System (GIS) solar resource data, access the Data Resources page. For interactive maps and tools...

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

An Alternate Career Choice for the Geography Major: Map, GIS, Geographic Information Librarianship  

E-Print Network (OSTI)

SWAAG 2007 An Alternate Career Choice for the Geography Major: Map, GIS, Geographic Information Librarianship Katherine H. Weimer Texas A&M University Libraries k-weimer@tamu.edu Map and GIS Projects in Texas Libraries Portal to Texas...} Global Planner World-wide GIS data set available to view, select and display using ArcIMS. http://library.tamu.edu ( Collections ( General Collections ( Maps ( Tobin Global Planner University of Texas at Arlington, Geographic Information Systems http://library.uta.edu/gis...

Weimer, Katherine

2007-11-03T23:59:59.000Z

362

Wide field of view telescope  

DOE Patents (OSTI)

A wide field of view telescope having two concave and two convex reflective surfaces, each with an aspheric surface contour, has a flat focal plane array. Each of the primary, secondary, tertiary, and quaternary reflective surfaces are rotationally symmetric about the optical axis. The combination of the reflective surfaces results in a wide field of view in the range of approximately 3.8.degree. to approximately 6.5.degree.. The length of the telescope along the optical axis is approximately equal to or less than the diameter of the largest of the reflective surfaces.

Ackermann, Mark R. (Albuquerque, NM); McGraw, John T. (Placitas, NM); Zimmer, Peter C. (Albuquerque, NM)

2008-01-15T23:59:59.000Z

363

Unit I-2 Linear Maps 1 Linear maps  

E-Print Network (OSTI)

Unit I-2 Linear Maps 1 Unit I-2 Linear maps Unit I-2 Linear Maps 2 Linear map · V & U are vector spaces over the same scalars · a function f: VU is a linear map if it preserves the vector space transformation [particularly when f: RnRm] ­ linear operator when f: V V [same v.s.] ­ linear mapping ­ linear

Birkett, Stephen

364

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

E-Print Network (OSTI)

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

Paris-Sud XI, Université de

365

Liar’s domination in graphs  

Science Journals Connector (OSTI)

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

Miranda L. Roden; Peter J. Slater

2009-01-01T23:59:59.000Z

366

Multicoloured Random Graphs: The Random Dynamics Program  

E-Print Network (OSTI)

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

Sam Tarzi

2014-07-15T23:59:59.000Z

367

Alliance free sets in Cartesian product graphs  

E-Print Network (OSTI)

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

Yero, Ismael G; Bermudo, Sergio

2011-01-01T23:59:59.000Z

368

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

369

Fractional Standard Map  

E-Print Network (OSTI)

Properties of the phase space of the standard map with memory are investigated. This map was obtained from a kicked fractional differential equation. Depending on the value of the parameter of the map and the fractional order of the derivative in the original differential equation this nonlinear dynamical system demonstrates attractors (fixed points, stables periodic trajectories, slow converging and slow diverging trajectories, ballistic trajectories, and fractal-like structures) and/or chaotic trajectories. At least one type of fractal-like sticky attractors in the chaotic sea was observed.

Mark Edelman; Vasily E. Tarasov

2009-11-24T23:59:59.000Z

370

Dynamics of acyclic interval maps  

E-Print Network (OSTI)

Vol. 6 (2009) Dynamics of acyclic interval maps [16] D.orbits and bifurcation of maps of the interval. SIAM J.Dynamics of acyclic interval maps Morris W. Hirsch He who

Hirsch, Morris W

2009-01-01T23:59:59.000Z

371

Maps of Selected State Subdivisions  

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

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

372

Algorithms and architectures for high performance analysis of semantic graphs.  

SciTech Connect

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

Hendrickson, Bruce Alan

2005-09-01T23:59:59.000Z

373

Limited View Angle Iterative CT Reconstruction  

E-Print Network (OSTI)

;Some Prior Literature in Limited View Tomography CT with limited-angle data and few views IRR algorithm Iterative Reconstruction-Reprojection (IRR) : An Algorithm for Limited Data Cardiac- Computed-views and limited-angle data in divergent-beam CT by E. Y. Sidky, CM Kao, and X. Pan (2006) Few-View Projection

374

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.

375

GoddardView Welcome Home!  

E-Print Network (OSTI)

GoddardView Welcome Home! Pg 2 - 3 History's Greatest Comet Hunter Pg 8 Employee Spotlight: Ernest Program Ends Amid Kudos - 6 Engineers Organize With A Desire To Inspire - 7 History's Greatest Comet on the runway at Edwards Air Force Base, California, after a safe landing August 9, 2005. Photo Credit: NASA 02

Christian, Eric

376

View  

Science Journals Connector (OSTI)

Mn, the concentration gradient that drives the diffusion is maintained by the precipitation of insoluble oxides. In the case of Cd, ... Cientifica e Tecnologica (

2000-10-07T23:59:59.000Z

377

View  

E-Print Network (OSTI)

May 18, 2012 ... bottleneck, long-time production simulations will be severely hampered ...... t ¼ 0.975, (g) t ¼ 1.0, (h) t ¼ 1.025, (i) t ¼ 1.275, (j) t ¼ 1.525, (k) t ¼ ...

S. Dong

2012-06-21T23:59:59.000Z

378

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

andrea,,,

379

View  

E-Print Network (OSTI)

May 31, 2005 ... Robert M. Freund: MIT Sloan School of Management, 50 Memorial Drive, Cambridge, Massachusetts 02139-4307, ...... the transition kernel.

2005-05-30T23:59:59.000Z

380

View  

Science Journals Connector (OSTI)

89-l 1268) ran the carbon analysis of the sediment trap material ..... vehicle camera system were analyzed with a ... tribution of distances with the computer pro-.

1999-12-21T23: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

View  

E-Print Network (OSTI)

obtained by using different uncertainty sets estimated using simulated and ... Given a fixed mix of electric power plants (nuclear, thermal, hydroelectric, and ...

2011-01-28T23:59:59.000Z

382

View  

E-Print Network (OSTI)

Mar 14, 2006 ... ... of the paper is devoted to the development of background material for ..... Note that the optimization problem in the correction phase is solved over ...... In Phase I

2006-03-31T23:59:59.000Z

383

View  

E-Print Network (OSTI)

Mar 1, 2007 ... 2The logarithmic barrier for the half space {u ? Rn | a · u ? b} is ..... in the Uncapacitated Falicity Location Library (UflLib) [Hoe06]. .... For our test we use 36 unsolved UFL instances that come from two public sets of instances.

2007-03-01T23:59:59.000Z

384

View  

E-Print Network (OSTI)

cT w tj (cj z) + o (1) = wti (z) + o (1), since c-Ow(cz) = w(z) for any w E W and c > 0. We have obtained a contradiction with (2.29), which proves (2.28). If w t = w(' ...

2004-12-25T23:59:59.000Z

385

View  

Science Journals Connector (OSTI)

Apr 15, 1976 ... terms of Hairston's hypothesis, to find that only the ... be a component of the search by grazers .... to stop searching and to enter into a state.

2000-01-05T23:59:59.000Z

386

View  

E-Print Network (OSTI)

which has a 0 infimum, but does not attain it. Here the certificates of the bad behavior of the system in (3.32) are. Z = (. 1 0. 0 0. ) , V = (. 0 1. 1 0. ) . Example 2.

2014-05-14T23:59:59.000Z

387

View  

E-Print Network (OSTI)

1. Introduction. The purpose of the present paper is to develop some new directions of investigation in ..... For each i = 1, ..., m, and g = (x1, ..., xr,mr ), we have.

2003-09-25T23:59:59.000Z

388

View  

E-Print Network (OSTI)

Definition 1 The persistency of a variable xi is defined to be the probability that xi = 1 in the ..... i , we know a limited set of marginal moments mr i . We let ? ...

2005-04-19T23:59:59.000Z

389

View  

E-Print Network (OSTI)

In [4], Devinatz, Hopkins, and Smith proved the nilpotence theorem, a remark- able result which provides algebraic means for detecting nilpotence in the ...

1997-12-15T23:59:59.000Z

390

View  

Science Journals Connector (OSTI)

carbon (C) and increased mixing energies, making CO, limitation less likely. .... Verde Reef (Vera Cruz, Mexico). ..... solar energy is more important in deter-.

2000-03-03T23:59:59.000Z

391

View  

E-Print Network (OSTI)

Sep 3, 2003 ... Superconductors are able to carry equilibrium currents without resistance. .... by an Ohm's law where ? is the electric conductivity and b1 is a ...

1910-31-00T23:59:59.000Z

392

Viewed  

Science Journals Connector (OSTI)

Oct 27, 1982 ... study area does not contain indigenous io- .... Zn Handbook ofgeochemistry. V. 7, part 4. Spring ... Lakes-physics, chemistry, geology. Springer.

2000-02-09T23:59:59.000Z

393

View  

Science Journals Connector (OSTI)

This lake is in the Kigezi Highlands, western Uganda, in a narrow steep-sided branching river valley about 20 km long that has been dammed and drowned by a.

Orcas

394

View  

Science Journals Connector (OSTI)

1943. Treatment of experimental data. Wiley,. New York, N.Y. 344 p. ZIIIN-ELDIN, Z. P. 1961. Plankton pigments in. East Lagoon, Galveston, Texas. Trans. Am.

Orcas

395

View  

E-Print Network (OSTI)

GLEV train, a new bullet train under development in Japan, is formulated as the ... conservation law and v ? c represents a constraint on the maximum capacity at each ... Railways Technical Research Institute, Kokubunji, Tokyo 185-8540 Japan ... optimization since 1984 when Karmarkar proposed the projective scaling ...

2002-10-31T23:59:59.000Z

396

View  

E-Print Network (OSTI)

the random consequences of the chosen action, h(x, ?), are preferred to those of a baseline random variable Z for all utility ...... Ground truth. Envelope. Figure 3: ...

2012-06-29T23:59:59.000Z

397

View  

E-Print Network (OSTI)

A major challenge in using optimization to make risk-averse decisions in the face of uncertainty is how to specify an acceptable level of risk. Recently, Dentcheva ...

2011-06-22T23:59:59.000Z

398

View  

E-Print Network (OSTI)

maximum acceptable risk that one is willing to take. ... of initial wealth allocated to the assets, CVaR?(?T x) measures the risk of a given allocation x, b. 1 ...

2009-03-26T23:59:59.000Z

399

View  

E-Print Network (OSTI)

acceptable level of risk. As shown in [2], Problem (3) is a difficult, in fact NP-hard, combinatorial problem. Following [17] and [21], we choose to tackle it by ...

2010-02-08T23:59:59.000Z

400

View  

E-Print Network (OSTI)

allowed to be violated an “acceptable” amount of time. There are no ... optimal investment strategies with a certain level of risk [10]. Up to this point most research ...

2008-05-24T23: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

View  

E-Print Network (OSTI)

in the primal problem. As it can be seen by the number of floating point operations needed to generate the approximation to the set of efficient points, the strategy.

402

View  

E-Print Network (OSTI)

Oct 29, 2008 ... serial machine in floating point is well below our needs. 3 Notation. We are given an m × d design matrix P of floating point numbers and an.

2008-10-28T23:59:59.000Z

403

View  

E-Print Network (OSTI)

the results of [8] to obtain, for each natural number n, a simple nuclear C?- algebra An whose ordered K0-group is order isomorphic to Zn. This result was further ...

2008-02-01T23:59:59.000Z

404

View  

E-Print Network (OSTI)

the UCT and reproves Huaxin Lin's theorem on the classification of nuclear tracially AF ... A deep conjecture of Elliott asserts that the simple separable nuclear ...

2004-06-29T23:59:59.000Z

405

View  

E-Print Network (OSTI)

Q we have yi = Gdi and the G–orthogonality condition of vectors si, si+1 can be written as ?isT i Gsi+1 = yT i si+1 = 0 (we assume that ?i = 0). This together with ...

2009-03-10T23:59:59.000Z

406

View  

E-Print Network (OSTI)

job Ji is a function of its completion time, usually denoted by Ci. ..... For any t > max(P, d), there exists a value ? > 0 and a job index i? ? {1,...,n} such that, for any ...

2006-03-29T23:59:59.000Z

407

View  

E-Print Network (OSTI)

Feb 28, 2006 ... Abstract. The major focus of this work is to compare several methods for computing the proximal point of a nonconvex function via numerical ...

2006-02-28T23:59:59.000Z

408

View  

E-Print Network (OSTI)

Our original motivating application is in Electronics and arises in the development of pulse ...... In 8th International Symposium on Fundamentals of Computa-.

Christoph Buchheim,,,

409

View  

E-Print Network (OSTI)

Feb 28, 2012 ... and P. Dorta-González. Departamento de Métodos Cuantitativos en Econom?a y Gestión. Universidad de Las Palmas de Gran Canaria (Spain).

2012-02-28T23:59:59.000Z

410

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":""}]}

411

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

412

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.

413

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":""}]}

414

Metrology/viewing system for next generation fusion reactors  

SciTech Connect

Next generation fusion reactors require accurate measuring systems to verify sub-millimeter alignment of plasma-facing components in the reactor vessel. A metrology system capable of achieving such accuracy must be compatible with the vessel environment of high gamma radiation, high vacuum, elevated temperature, and magnetic field. This environment requires that the system must be remotely deployed. A coherent, frequency modulated laser radar system is being integrated with a remotely operated deployment system to meet these requirements. The metrology/viewing system consists of a compact laser transceiver optics module which is linked through fiber optics to the laser source and imaging units that are located outside of the harsh environment. The deployment mechanism is a telescopic-mast positioning system. This paper identifies the requirements for the International Thermonuclear Experimental Reactor metrology and viewing system, and describes a remotely operated precision ranging and surface mapping system.

Spampinato, P.T.; Barry, R.E.; Chesser, J.B.; Menon, M.M. [Oak Ridge National Lab., TN (United States); Dagher, M.A. [Boeing Rocketdyne Div., Canoga Park, CA (United States)

1997-02-01T23:59:59.000Z

415

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

416

Surveying & Mapping Surveying  

E-Print Network (OSTI)

in many states. Tuition Discount Residents from New Hampshire, Vermont, Massachusetts services involve locating boundaries, land development, and mapping. Most careers. Employers Graduates work for both private firms and public agencies. The Bureau

Thomas, Andrew

417

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

418

RMOTC - Contact Us - Maps  

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

Maps M ap - RMOTCs testing facility is located 35 miles north of Casper, Wyoming RMOTC's test site, NPR-3, is located about 35 miles north of Casper, Wyoming. For driving...

419

Dating the Vinland Map  

ScienceCinema (OSTI)

Scientists from Brookhaven National Laboratory, the University of Arizona, and the Smithsonian Institution used carbon-dating technology to determine the age of a controversial parchment that might be the first-ever map of North America.

None

2013-07-17T23:59:59.000Z

420

SRNL Site Map  

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

DOE DOE-EM DOE-SR NNSA SRS SRNS Site Map Disclaimer Legal Information SRNL * Aiken * SC * 29808-0001 * SRNL Operator: 803-725-6211 SRNL is the DOE Office of Environmental...

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

Logistic Map Potentials  

E-Print Network (OSTI)

We develop and illustrate methods to compute all single particle potentials that underlie the logistic map, x --> sx(1-x) for 02. We illustrate the methods numerically for the cases s=5/2 and s=10/3.

Thomas Curtright; Andrzej Veitia

2010-05-27T23:59:59.000Z

422

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

423

Wind Career Map  

K-12 Energy Lesson Plans and Activities Web site (EERE)

This wind career map explores an expanding universe of wind energy occupations, describing diverse jobs across the industry, charting possible progression between them, and identifying the high-quality training necessary to do them well.

424

Wind Career Map: Resource List  

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

The following resources were used in the development of the Wind Career Map, associated job profile information, or are potential resources for interested Wind Career Map viewers.

425

Fatty Acid Carcass Mapping  

E-Print Network (OSTI)

FATTY ACID CARCASS MAPPING A Thesis by STACEY NICOLE TURK Submitted to the Office of Graduate Studies of Texas A&M University in partial fulfillment of the requirements for the degree of MASTER OF SCIENCE May 2008... Major Subject: Animal Science FATTY ACID CARCASS MAPPING A Thesis by STACEY NICOLE TURK Submitted to the Office of Graduate Studies of Texas A&M University in partial fulfillment of the requirements for the degree of MASTER OF SCIENCE...

Turk, Stacey N.

2010-01-14T23:59:59.000Z

426

Wind Resource Maps (Postcard)  

SciTech Connect

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

427

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

428

Geosemble Combines Satellite Views With Data By BOOYEON LEE -10/29/2007  

E-Print Network (OSTI)

Security. In recent months, the company has received grants from the National Science Foundation, DefenseGeosemble Combines Satellite Views With Data Resources By BOOYEON LEE - 10/29/2007 Los Angeles Business Journal Staff Thanks to Google Maps you can zoom onto a satellite image of just about any office

Valero-Cuevas, Francisco

429

Diffusion Maps for Changing Data Diffusion Maps for Changing Data  

E-Print Network (OSTI)

Diffusion Maps for Changing Data Diffusion Maps for Changing Data Matthew J. Hirn Department;Diffusion Maps for Changing Data Collaborators Ronald Coifman (Yale University) Roy Lederman (Yale University) #12;Diffusion Maps for Changing Data How to compare images across sensors? Figure: Sokolov Mine

Hirn, Matthew

430

Diffusion Maps for Changing Data Diffusion Maps for Changing Data  

E-Print Network (OSTI)

Diffusion Maps for Changing Data Diffusion Maps for Changing Data Matthew J. Hirn Department of Mathematics Yale University July 26, 2012 Bell Labs #12;Diffusion Maps for Changing Data Collaborators Joint work with Ronald Coifman and Roy Lederman. #12;Diffusion Maps for Changing Data Overview 1 High

Hirn, Matthew

431

THE SCALE PROBLEM FOR OLD MAPS (and mental maps)  

E-Print Network (OSTI)

THE SCALE PROBLEM FOR OLD MAPS (and mental maps) Waldo Tobler From the theory of cartography we know that the instantaneous scale at a point on any map is always represented by the equation: dS2 /ds2 = g cos2 + 2g cos sin + g sin2 . This shows that the scale on a map is generally different in all

Tobler, Waldo

432

Diffusion Maps for Changing Data Diffusion Maps for Changing Data  

E-Print Network (OSTI)

Diffusion Maps for Changing Data Diffusion Maps for Changing Data Matthew J. Hirn Department of Mathematics Yale University November 29, 2012 Kansas State University Colloquium #12;Diffusion Maps;Diffusion Maps for Changing Data How to compare images across sensors? Figure: Sokolov Mine in 2009 and 2010

Hirn, Matthew

433

Diffusion Maps for Changing Data Diffusion Maps for Changing Data  

E-Print Network (OSTI)

Diffusion Maps for Changing Data Diffusion Maps for Changing Data Matthew J. Hirn Department in Honor of the 70th Birthday of David R. Larson #12;Diffusion Maps for Changing Data Collaborators Joint work with Ronald Coifman and Roy Lederman. #12;Diffusion Maps for Changing Data High Dimensional Data

Hirn, Matthew

434

Diffusion Maps for Changing Data Diffusion Maps for Changing Data  

E-Print Network (OSTI)

Diffusion Maps for Changing Data Diffusion Maps for Changing Data Matthew J. Hirn September 3, 2013 #12;Diffusion Maps for Changing Data Collaborators Simon Adar, Tel Aviv University Eyal Ben Dor, Tel, Clarkson University Yoel Shkolnisky, Tel Aviv University #12;Diffusion Maps for Changing Data Heat equation

Hirn, Matthew

435

A graph-based system for network-vulnerability analysis  

SciTech Connect

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

Swiler, L.P.; Phillips, C.

1998-06-01T23:59:59.000Z

436

Pauli graph and finite projective lines/geometries  

E-Print Network (OSTI)

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

Michel R. P. Planat; Metod Saniga

2007-03-16T23:59:59.000Z

437

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"

438

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,

439

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.

440

Career Map: Assembler and Fabricator  

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

The Wind Program's Career Map provides job description information for Assembler and Fabricator positions.

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

Career Map: Analyst/Researcher  

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

The Wind Program's Career Map provides job description information for Analyst/Researcher positions.

442

Career Map: Land Acquisition Specialist  

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

The Wind Program's Career Map provides job description information for Land Acquisition Specialist positions.

443

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

444

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

E-Print Network (OSTI)

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

Mousavi, Mohammad

445

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

E-Print Network (OSTI)

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

Mousavi, Mohammad

446

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

Science Journals Connector (OSTI)

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

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

2014-06-01T23:59:59.000Z

447

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

Science Journals Connector (OSTI)

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

Yingqian Wang; Ping Sheng

2014-04-01T23:59:59.000Z

448

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.

449

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

450

Bifurcations of mutually coupled equations in random graphs  

E-Print Network (OSTI)

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

Eduardo Garibaldi; Tiago Pereira

2014-09-19T23:59:59.000Z

451

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.

452

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

453

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

454

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)

455

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

456

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

457

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

E-Print Network (OSTI)

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

J. M. Harrison; K. Kirsten

2010-03-16T23:59:59.000Z

458

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

459

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

E-Print Network (OSTI)

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

Kardos, Frantisek; Volec, Jan

2011-01-01T23:59:59.000Z

460

Maps and inverse maps in open quantum dynamics  

SciTech Connect

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

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

Maps and inverse maps in open quantum dynamics  

E-Print Network (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 can not have an inverse that is obtained from any dynamics described by any unitary operator for any states of a larger system.

Thomas F. Jordan

2008-07-08T23:59:59.000Z

462

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

E-Print Network (OSTI)

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

Smirnova-Nagnibeda, Tatiana

463

Labeling Products of Complete Graphs with a Condition at Distance Two  

Science Journals Connector (OSTI)

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

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

2001-01-01T23:59:59.000Z

464

On generalized Petersen graphs labeled with a condition at distance two  

Science Journals Connector (OSTI)

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

John P. Georges; David W. Mauro

2002-12-01T23:59:59.000Z

465

PARTITIONING HYPERGRAPHS IN SCIENTIFIC COMPUTING APPLICATIONS THROUGH VERTEX SEPARATORS ON GRAPHS  

E-Print Network (OSTI)

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

Pinar, Ali

466

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

E-Print Network (OSTI)

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

Hendrickson, Bruce

467

Correlation and Contrast Link Formation Patterns in a Time Evolving Graph  

Science Journals Connector (OSTI)

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

Tomonobu Ozaki; Minoru Etoh

2011-12-01T23:59:59.000Z

468

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

Science Journals Connector (OSTI)

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

Tomonobu Ozaki; Minoru Etoh

2011-03-01T23:59:59.000Z

469

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

E-Print Network (OSTI)

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

van Vuuren, Jan H.

470

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

Science Journals Connector (OSTI)

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

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

2014-03-01T23:59:59.000Z

471

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

E-Print Network (OSTI)

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

Loebl, Martin

472

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

E-Print Network (OSTI)

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

Kim, Yong Jung

473

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

E-Print Network (OSTI)

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

Srinivasan, Aravind

474

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

475

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

E-Print Network (OSTI)

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

Alvarez, Nadir

476

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

Science Journals Connector (OSTI)

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

Marjan Abdeyazdan; Saeed Parsa; Amir Masoud Rahmani

2013-04-01T23:59:59.000Z

477

Better Buildings Network View | November 2014  

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

The Better Buildings Network View monthly newsletter from the U.S. Department of Energy's Better Buildings Residential Network.

478

Better Buildings Network View | October 2014  

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

The Better Buildings Network View monthly newsletter from the U.S. Department of Energy's Better Buildings Residential Network.

479

Better Buildings Network View | September 2014  

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

The Better Buildings Network View monthly newsletter from the U.S. Department of Energy's Better Buildings Residential Network.

480

Better Buildings Network View | January 2015  

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

The Better Buildings Network View monthly newsletter from the U.S. Department of Energy's Better Buildings Residential Network.

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

Better Buildings Network View | December 2014  

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

The Better Buildings Network View monthly newsletter from the U.S. Department of Energy's Better Buildings Residential Network.

482

The Better Buildings Neighborhood View- Fall 2011  

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

Better Buildings Neighborhood View, from the Better Buildings Neighborhood Program of the U.S. Department of Energy.

483

Better Buildings Network View | February 2014  

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

The Better Buildings Network View monthly newsletter from the U.S. Department of Energy's Better Buildings Residential Network.

484

California's Energy Future - The View to 2050  

E-Print Network (OSTI)

Energy Future - The View to 2050 Bin Biofuel Technology Hydrogen Ethanol from sugar and starch (e.g. , corn,

2011-01-01T23:59:59.000Z

485

The Better Buildings Neighborhood View- July 2012  

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

The Better Buildings Neighborhood View monthly newsletter from the U.S. Department of Energy's Better Buildings Neighborhood Program.

486

Better Buildings Network View | April 2014  

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

The Better Buildings Network View monthly newsletter from the U.S. Department of Energy's Better Buildings Residential Network.

487

Better Buildings Network View | May 2014  

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

The Better Buildings Network View monthly newsletter from the U.S. Department of Energy's Better Buildings Residential Network.

488

Better Buildings Network View | March 2014  

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

The Better Buildings Network View monthly newsletter from the U.S. Department of Energy's Better Buildings Residential Network.

489

Better Buildings Network View | June 2014  

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

The Better Buildings Network View monthly newsletter from the U.S. Department of Energy's Better Buildings Residential Network.

490

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

491

Genetic algorithm eclipse mapping  

E-Print Network (OSTI)

In this paper we analyse capabilities of eclipse mapping technique, based on genetic algorithm optimization. To model of accretion disk we used the "fire-flies" conception. This model allows us to reconstruct the distribution of radiating medium in the disk using less number of free parameters than in other methods. Test models show that we can achieve good approximation without optimizing techniques.

Halevin, A V

2008-01-01T23:59:59.000Z

492

PARKING MAP Sales Office  

E-Print Network (OSTI)

PARKING MAP BayDr. Main Entrance Parking Sales Office Main Entrance Kiosk East Remote Lot, B, C111, MC, N, NC, , Medical M 2hr 112 Core West Structure A, B, EV, MC, N, NC, , Medical P 2hr 113

Wilmers, Chris

493

Historical Maps Online  

E-Print Network (OSTI)

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

Rumsey, David Y.

2005-01-31T23:59:59.000Z

494

Assessment and Mapping of the Riverine Hydrokinetic Resource in the  

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 » Assessment and Mapping of the Riverine Hydrokinetic Resource in the Continental United States Jump to: navigation, search OpenEI Reference LibraryAdd to library Report: Assessment and Mapping of the Riverine Hydrokinetic Resource in the Continental United States Abstract This report describes the methodology and results of the most rigorous assessment to date of the riverine hydrokinetic energy resource in the contiguous 48 states and Alaska, excluding tidal waters. The assessment provides estimates of the gross, naturally available resource, termed the

495

Mapping Hydrothermal Upwelling and Outflow Zones: Preliminary Results from  

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 » Mapping Hydrothermal Upwelling and Outflow Zones: Preliminary Results from Two-Meter Temperature Data and Geologic Analysis at Lee Allen Springs and Salt Wells Basin Jump to: navigation, search OpenEI Reference LibraryAdd to library Conference Paper: Mapping Hydrothermal Upwelling and Outflow Zones: Preliminary Results from Two-Meter Temperature Data and Geologic Analysis at Lee Allen Springs and Salt Wells Basin Abstract Two-meter temperature surveys have been conducted at Salt Wells Basin and Lee-Allen Springs geothermal areas with the objective of distinguishing and

496

Imperial Sea View Hot Springs Pool & Spa Low Temperature Geothermal  

Open Energy Info (EERE)

Sea View Hot Springs Pool & Spa Low Temperature Geothermal Sea View Hot Springs Pool & Spa Low Temperature Geothermal Facility Jump to: navigation, search Name Imperial Sea View Hot Springs Pool & Spa Low Temperature Geothermal Facility Facility Imperial Sea View Hot Springs Sector Geothermal energy Type Pool and Spa Location Niland, California Coordinates 33.2400366°, -115.5188756° 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":[]}

497

Using Visualization Process Graphs to Improve Visualization Exploration  

E-Print Network (OSTI)

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

Jankun-Kelly, T. J.

498

MML Inference of Decision Graphs with Multi-way Joins  

Science Journals Connector (OSTI)

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

Peter J. Tan; David L. Dowe

2002-12-01T23:59:59.000Z

499

Graphs, Rewriting and Pathway Reconstruction for Rule-Based Models  

E-Print Network (OSTI)

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

Fontana, Walter

500

Even-Hole-Free Graphs Part II: Recognition Algorithm  

E-Print Network (OSTI)

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

Cornuejols, Gerard P.