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

Resource Minimized Static Mapping and Dynamic Scheduling of SDF Graphs  

E-Print Network [OSTI]

Resource Minimized Static Mapping and Dynamic Scheduling of SDF Graphs Jinwoo Kim, Tae-ho Shin than the previous approaches. Keywords-Mapping, buffer size minimization, SDF graph, dynamic scheduling a model-based approach based on SDF (synchronous data flow) model. Since the parallelism of an application

Ha, Soonhoi

2

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

3

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

4

Multiple Coordinated Views for Network Attack Graphs Steven Noel Michael Jacobs Pramod Kalapa Sushil Jajodia  

E-Print Network [OSTI]

Multiple Coordinated Views for Network Attack Graphs Steven Noel Michael Jacobs Pramod Kalapa graph-based representations have been developed for modeling combinations of low-level network attacks, relatively little attention has been paid to effective techniques for visualizing such attack graphs

Noel, Steven

5

GeoTriples: a Tool for Publishing Geospatial Data as RDF Graphs Using R2RML Mappings  

E-Print Network [OSTI]

GeoTriples: a Tool for Publishing Geospatial Data as RDF Graphs Using R2RML Mappings Kostis the linked data paradigm. Therefore, Earth Ob- servation data and other kinds of geospatial data and geospatial data into RDF graphs. GeoTriples goes beyond the state of the art by extending the R2RML mapping

Koubarakis, Manolis

6

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

7

GeoTriples: a Tool for Publishing Geospatial Data as RDF Graphs Using R2RML Mappings  

E-Print Network [OSTI]

GeoTriples: a Tool for Publishing Geospatial Data as RDF Graphs Using R2RML Mappings Kostis the tool GeoTriples that allows the transformation of Earth Observation data and geospatial data into RDF of geospatial data. GeoTriples is a semi- automated tool that transforms geospatial information into RDF follow

Koubarakis, Manolis

8

Semi-classical measures on Quantum graphs and the Gau map of the determinant manifold  

E-Print Network [OSTI]

believed that QE does not hold in general for a FIXED quantum graph. This is proved for star graphs in [BKW to what people do in several papers like [BG00, BKW04, BW08, Ba12, BB13]. Let

Recanati, Catherine

9

Semi-classical measures on Quantum graphs and the Gau map of the determinant manifold  

E-Print Network [OSTI]

believed that QE does not hold in general for a FIXED quantum graph. In [BKW04], it is proved that QE does

Boyer, Edmond

10

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

11

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

12

Multi-view kernel construction  

E-Print Network [OSTI]

5157-z Multi-view kernel construction Virginia R. de Sa ∑multiple different graph construction algorithms. The Ng et

Sa, Virginia R.; Gallagher, Patrick W.; Lewis, Joshua M.; Malave, Vicente L.

2010-01-01T23:59:59.000Z

13

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

14

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

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  

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

AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel),Feet) Year Jan Feb Mar Apr MayAtmospheric Optical Depth7-1D: VegetationEquipment Surfaces andMapping the Nanoscale Landscape Print For the firstMaps Sign In About |

18

Maps  

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

AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel),Feet) Year Jan Feb Mar Apr May Jun Jul(Summary)morphinanInformation Desert Southwest Region serviceMissionreal-time informationScience &Maps Maps Los

19

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

20

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

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

Graph anomalies in cyber communications  

SciTech Connect (OSTI)

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

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

2011-01-11T23:59:59.000Z

22

WIPP Projects Interative Map  

Broader source: Energy.gov [DOE]

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

23

SERC Grants Interactive Map  

Broader source: Energy.gov [DOE]

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

24

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

DOE Patents [OSTI]

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

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

1983-10-11T23:59:59.000Z

25

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

DOE Patents [OSTI]

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

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

1982-03-23T23:59:59.000Z

26

HETEROGENEOUS MULTIPROCESSOR MAPPING FOR REAL-TIME STREAMING SYSTEMS  

E-Print Network [OSTI]

address the problem of multi-objective mapping of SDF graphs onto heterogeneous multi-processor platforms can be modeled by synchronous data flow (SDF) graphs [1]. Multiprocessor mapping of an SDF graph were focused on SDF mapping on homogeneous multiprocessors [1][2]. More recent ap- proaches have

Gerstlauer, Andreas

27

Synthesis of Parallel Hardware Implementations from Synchronous Dataflow Graph Specifications  

E-Print Network [OSTI]

of automated register­transfer level (RTL) VHDL code generation from synchronous dataflow (SDF) graph for mapping applications specified in SDF to parallel digital hardware implementations. Two styles synthesis from SDF graphs is presented. In order to minimize cost while meeting performance require­ ments

28

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

29

Mapping onto mesh connected multiprocessors  

E-Print Network [OSTI]

partitioning of the task graph in order to determine the processor assignment of a task incrementally. Since the mesh architecture lends itself well to a recursive definition, a recursive divide-and-conquer strategy, is used to map the partitioned task graph...

Hangal, Prashant L

1993-01-01T23:59:59.000Z

30

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

31

MAPPING HVAC SYSTEMS FOR SIMULATION IN ENERGYPLUS  

E-Print Network [OSTI]

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

Basarkar, Mangesh

2013-01-01T23:59:59.000Z

32

Hyperbolic Graph Generator  

E-Print Network [OSTI]

Networks representing many complex systems in nature and society share some common structural properties like heterogeneous degree distributions and strong clustering. Recent research on network geometry has shown that those real networks can be adequately modeled as random geometric graphs in hyperbolic spaces. In this paper, we present a computer program to generate such graphs. Besides real-world-like networks, the program can generate random graphs from other well-known graph ensembles, such as the soft configuration model, random geometric graphs on a circle, or Erd\\H{o}s-R\\'enyi random graphs. The simulations show a good match between the expected values of different network structural properties and the corresponding empirical values measured in generated graphs, confirming the accurate behavior of the program.

Aldecoa, Rodrigo; Krioukov, Dmitri

2015-01-01T23:59:59.000Z

33

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

34

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

35

Graph Generator Survey  

SciTech Connect (OSTI)

The benchmarking effort within the Extreme Scale Systems Center at Oak Ridge National Laboratory seeks to provide High Performance Computing benchmarks and test suites of interest to the DoD sponsor. The work described in this report is a part of the effort focusing on graph generation. A previously developed benchmark, SystemBurn, allowed the emulation of dierent application behavior profiles within a single framework. To complement this effort, similar capabilities are desired for graph-centric problems. This report examines existing synthetic graph generator implementations in preparation for further study on the properties of their generated synthetic graphs.

Lothian, Josh [ORNL; Powers, Sarah S [ORNL; Sullivan, Blair D [ORNL; Baker, Matthew B [ORNL; Schrock, Jonathan [ORNL; Poole, Stephen W [ORNL

2013-12-01T23:59:59.000Z

36

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

37

Graph concatenation for quantum codes  

E-Print Network [OSTI]

Graphs are closely related to quantum error-correcting codes: every stabilizer code is locally equivalent to a graph code and every codeword stabilized code can be described by a graph and a classical code. For the ...

Beigi, Salman

38

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

39

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

40

Graph Concatenation for Quantum Codes  

E-Print Network [OSTI]

Graphs are closely related to quantum error-correcting codes: every stabilizer code is locally equivalent to a graph code, and every codeword stabilized code can be described by a graph and a classical code. For the construction of good quantum codes of relatively large block length, concatenated quantum codes and their generalizations play an important role. We develop a systematic method for constructing concatenated quantum codes based on "graph concatenation", where graphs representing the inner and outer codes are concatenated via a simple graph operation called "generalized local complementation." Our method applies to both binary and non-binary concatenated quantum codes as well as their generalizations.

Salman Beigi; Isaac Chuang; Markus Grassl; Peter Shor; Bei Zeng

2010-02-03T23: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.


41

Graph dynamics : learning and representation  

E-Print Network [OSTI]

Graphs are often used in artificial intelligence as means for symbolic knowledge representation. A graph is nothing more than a collection of symbols connected to each other in some fashion. For example, in computer vision ...

Ribeiro, Andre Figueiredo

2006-01-01T23:59:59.000Z

42

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

43

Temporal Representation in Semantic Graphs  

SciTech Connect (OSTI)

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

Levandoski, J J; Abdulla, G M

2007-08-07T23:59:59.000Z

44

Cliques in graphs  

E-Print Network [OSTI]

Cliques in Graphs Siu Lun Allan Lo Christís College University of Cambridge A thesis submitted for the degree of Doctor of Philosophy 2010 Declaration This dissertation is the result of my own work and includes nothing which is the outcome of work...

Lo, Allan

2010-10-12T23:59:59.000Z

45

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

46

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

47

Graph Coarsening for Path Finding in Cybersecurity Graphs  

SciTech Connect (OSTI)

n the pass-the-hash attack, hackers repeatedly steal password hashes and move through a computer network with the goal of reaching a computer with high level administrative privileges. In this paper we apply graph coarsening in network graphs for the purpose of detecting hackers using this attack or assessing the risk level of the network's current state. We repeatedly take graph minors, which preserve the existence of paths in the graph, and take powers of the adjacency matrix to count the paths. This allows us to detect the existence of paths as well as find paths that have high risk of being used by adversaries.

Hogan, Emilie A.; Johnson, John R.; Halappanavar, Mahantesh

2013-01-01T23:59:59.000Z

48

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

49

Graph/Network Visualization Data model: graph structures (relations,  

E-Print Network [OSTI]

of physics #12;8 The Spring Model Using springs to represent node-node relations. Minimizing energy1 1 Graph/Network Visualization Data model: graph structures (relations, knowledge) and networks hierarchies #12;7 Sugiyama : Building Hierarchy Domain knowledge based. Designing heuristic, e.g. minimizing

Fang, Shiaofen

50

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

51

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

52

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

53

Location Map  

SciTech Connect (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

2013-06-27T23:59:59.000Z

54

Location Map  

DOE Data Explorer [Office of Scientific and Technical Information (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

55

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

56

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

57

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

58

Virasoro Representations on Fusion Graphs  

E-Print Network [OSTI]

For any non-unitary model with central charge c(2,q) the path spaces associated to a certain fusion graph are isomorphic to the irreducible Virasoro highest weight modules.

J. Kellendonk; A. Recknagel

1992-10-01T23:59:59.000Z

59

Doing time : inducing temporal graphs  

E-Print Network [OSTI]

We consider the problem of constructing a directed acyclic graph that encodes temporal relations found in a text. The unit of our analysis is a temporal segment, a fragment of text that maintains temporal coherence. The ...

Bramsen, Philip James

2006-01-01T23:59:59.000Z

60

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

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

Managing Attack Graph Complexity Through Visual Hierarchical Aggregation  

E-Print Network [OSTI]

Managing Attack Graph Complexity Through Visual Hierarchical Aggregation Steven Noel Center a framework for managing network attack graph complexity through interactive visualization, which includes hierarchical aggregation of graph elements. Aggregation collapses non-overlapping subgraphs of the attack graph

Noel, Steven

62

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

63

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

64

Algebraic connectivity and graph robustness.  

SciTech Connect (OSTI)

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

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

2009-07-01T23:59:59.000Z

65

Graph Analytics for Signature Discovery  

SciTech Connect (OSTI)

Within large amounts of seemingly unstructured data it can be diffcult to find signatures of events. In our work we transform unstructured data into a graph representation. By doing this we expose underlying structure in the data and can take advantage of existing graph analytics capabilities, as well as develop new capabilities. Currently we focus on applications in cybersecurity and communication domains. Within cybersecurity we aim to find signatures for perpetrators using the pass-the-hash attack, and in communications we look for emails or phone calls going up or down a chain of command. In both of these areas, and in many others, the signature we look for is a path with certain temporal properties. In this paper we discuss our methodology for finding these temporal paths within large graphs.

Hogan, Emilie A.; Johnson, John R.; Halappanavar, Mahantesh; Lo, Chaomei

2013-06-01T23:59:59.000Z

66

Optimization in Geometric Graphs: Complexity and Approximation  

E-Print Network [OSTI]

We consider several related problems arising in geometric graphs. In particular, we investigate the computational complexity and approximability properties of several optimization problems in unit ball graphs and develop algorithms to find exact...

Kahruman-Anderoglu, Sera

2011-02-22T23:59:59.000Z

67

A discrete curvature on a planar graph  

E-Print Network [OSTI]

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

M. Lorente

2004-12-20T23:59:59.000Z

68

Percolation in the Secrecy Graph Amites Sarkar  

E-Print Network [OSTI]

Percolation in the Secrecy Graph Amites Sarkar Martin Haenggi July 8, 2011 Abstract Secrecy graphs. Department of Mathematics, Western Washington University, Bellingham, WA 98225, USA. Email: amites.sarkar

Sarkar, Amites

69

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.

70

Evan Marshall Trevathan Admissible SC-Graphs  

E-Print Network [OSTI]

Evan Marshall Trevathan Admissible SC-Graphs Page 1 Admissible SC-Graphs Define: ( , )G ( 2)nB n ( 4)nD n ( 6,7,8)nE n 4F 2G 2H 3H #12;Evan Marshall Trevathan Admissible SC-Graphs Page 2 the form of a #12;Evan Marshall Trevathan Admissible SC-Graphs Page 3 "loop", like ,with no other

Donnelly, Rob

71

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

72

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.

73

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

74

Generalized Graph States Based on Hadamard Matrices  

E-Print Network [OSTI]

Graph states are widely used in quantum information theory, including entanglement theory, quantum error correction, and one-way quantum computing. Graph states have a nice structure related to a certain graph, which is given by either a stabilizer group or an encoding circuit, both can be directly given by the graph. To generalize graph states, whose stabilizer groups are abelian subgroups of the Pauli group, one approach taken is to study non-abelian stabilizers. In this work, we propose to generalize graph states based on the encoding circuit, which is completely determined by the graph and a Hadamard matrix. We study the entanglement structures of these generalized graph states, and show that they are all maximally mixed locally. We also explore the relationship between the equivalence of Hadamard matrices and local equivalence of the corresponding generalized graph states. This leads to a natural generalization of the Pauli $(X,Z)$ pairs, which characterizes the local symmetries of these generalized graph states. Our approach is also naturally generalized to construct graph quantum codes which are beyond stabilizer codes.

Shawn X Cui; Nengkun Yu; Bei Zeng

2015-02-25T23:59:59.000Z

75

Constrained Graph Optimization: Interdiction and Preservation Problems  

SciTech Connect (OSTI)

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

Schild, Aaron V [Los Alamos National Laboratory

2012-07-30T23:59:59.000Z

76

Acyclic Coloring of Graphs of Maximum Degree Five: Nine Colors are Enough  

E-Print Network [OSTI]

graphs with "large" girth [BKW99], 1-planar graphs [BKRS01], outerplanar graphs (see for instance [Sop97

Boyer, Edmond

77

EuroComb 2005 DMTCS proc. AE, 2005, 389396 Acyclic Coloring of Graphs of Maximum  

E-Print Network [OSTI]

for several families F of graphs such as planar graphs [Bor79], planar graphs with "large" girth [BKW99], 1

Fertin, Guillaume

78

Acyclic Coloring of Graphs of Maximum Degree Five: Nine Colors are Enough  

E-Print Network [OSTI]

graphs with ``large'' girth [BKW99], 1­planar graphs [BKRS01], outerplanar graphs (see for instance [Sop

Fertin, Guillaume

79

Lamplighter groups, de Bruijn graphs, spider-web graphs and their spectra  

E-Print Network [OSTI]

We describe the infinite family of spider-web graphs $S_{k,M,N }$, $k \\geq 2$, $M \\geq 1$ and $N \\geq 0$, studied in physical literature as tensor products of well-known de Brujin graphs $B_{k,N}$ and cyclic graphs $C_M$ and show that these graphs are Schreier graphs of the lamplighter groups $L_k = Z/kZ \\wr Z$. This allows us to compute their spectra and to identify the infinite limit of $S_{k,M,N}$, as $N, M \\to\\infty$, with the Cayley graph of the lamplighter group $L_k$.

Rostislav Grigorchuk; Paul-Henry Leemann; Tatiana Nagnibeda

2015-02-24T23:59:59.000Z

80

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

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

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

82

Generating Reports & Graphs in Portfolio Manager  

Broader source: Energy.gov [DOE]

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

83

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

84

Graph algorithms in the titan toolkit.  

SciTech Connect (OSTI)

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

McLendon, William Clarence, III; Wylie, Brian Neil

2009-10-01T23:59:59.000Z

85

Generation of graph-state streams  

E-Print Network [OSTI]

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

Daniel Ballester; Jaeyoon Cho; M. S. Kim

2010-12-08T23:59:59.000Z

86

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

87

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

E-Print Network [OSTI]

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

Zaslavsky, Thomas

88

3D Graph Visualization with the Oculus Rift Virtual Graph Reality  

E-Print Network [OSTI]

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

Wismath, Stephen

89

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

E-Print Network [OSTI]

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

Wu, David

90

On the Cohen-Macaulay graphs and girth  

E-Print Network [OSTI]

In this paper we investigate the Cohen-Macaulay property of graphs versus girth. In particular, we classify Cohen-Macaulay graphs of girth at least five and planar Gorenstein graphs of girth four.

Hoang, Do Trong; Trung, Tran Nam

2012-01-01T23:59:59.000Z

91

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

92

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

93

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

94

Directed Graphs, Decompositions, and Spatial Linkages  

E-Print Network [OSTI]

The decomposition of a system of constraints into small basic components is an important tool of design and analysis. Specifically, the decomposition of a linkage into minimal components is a central tool of analysis and synthesis of linkages. In this paper we prove that every pinned 3-isostatic (minimally rigid) graph (grounded linkage) has a unique decomposition into minimal strongly connected components (in the sense of directed graphs) which we call 3-Assur graphs. This analysis extends the Assur decompositions of plane linkages previously studied in the mathematical and the mechanical engineering literature. These 3-Assur graphs are the central building blocks for all kinematic linkages in 3-space. They share a number of key combinatorial and geometric properties with the 2-Assur graphs, including an associated lower block-triangular decomposition of the pinned rigidity matrix which provides a format for extending the motion induced by inserting one driver in a bottom Assur linkage to the joints of the e...

Shai, Offer; Whiteley, Walter

2010-01-01T23:59:59.000Z

95

Graph Databases for Large-Scale Healthcare Systems: A Framework for Efficient Data Management and Data Services  

SciTech Connect (OSTI)

Designing a database system for both efficient data management and data services has been one of the enduring challenges in the healthcare domain. In many healthcare systems, data services and data management are often viewed as two orthogonal tasks; data services refer to retrieval and analytic queries such as search, joins, statistical data extraction, and simple data mining algorithms, while data management refers to building error-tolerant and non-redundant database systems. The gap between service and management has resulted in rigid database systems and schemas that do not support effective analytics. We compose a rich graph structure from an abstracted healthcare RDBMS to illustrate how we can fill this gap in practice. We show how a healthcare graph can be automatically constructed from a normalized relational database using the proposed 3NF Equivalent Graph (3EG) transformation.We discuss a set of real world graph queries such as finding self-referrals, shared providers, and collaborative filtering, and evaluate their performance over a relational database and its 3EG-transformed graph. Experimental results show that the graph representation serves as multiple de-normalized tables, thus reducing complexity in a database and enhancing data accessibility of users. Based on this finding, we propose an ensemble framework of databases for healthcare applications.

Park, Yubin [University of Texas at Austin] [University of Texas at Austin; Shankar, Mallikarjun [ORNL] [ORNL; Park, Byung H [ORNL] [ORNL; Ghosh, Dr. Joydeep [University of Texas at Austin] [University of Texas at Austin

2014-01-01T23:59:59.000Z

96

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

97

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

98

Attack Graphs for Sensor Placement, Alert Prioritization, and Attack Response  

E-Print Network [OSTI]

1 Attack Graphs for Sensor Placement, Alert Prioritization, and Attack Response Steven Noel of IDS alarms, using attack graph analysis. Our attack graphs predict the various possible ways and attacker exploits provides an attack graph showing all possible paths to critical assets. We then place IDS

Noel, Steven

99

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.

100

Gibbs Measures and Phase Transitions on Sparse Random Graphs  

E-Print Network [OSTI]

regular graphs . . . . . . . . . . . . . . 87 6.2 Hyper-loops, hypergraphs, cores and a peeling algorithm

Montanari, Annamaria

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

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.

102

EuroComb 2005 DMTCS proc. AE, 2005, 389--396 Acyclic Coloring of Graphs of Maximum  

E-Print Network [OSTI]

for several families F of graphs such as planar graphs [Bor79], planar graphs with ``large'' girth [BKW99], 1

Fertin, Guillaume

103

Revisiting Interval Graphs for Network Science  

E-Print Network [OSTI]

The vertices of an interval graph represent intervals over a real line where overlapping intervals denote that their corresponding vertices are adjacent. This implies that the vertices are measurable by a metric and there exists a linear structure in the system. The generalization is an embedding of a graph onto a multi-dimensional Euclidean space and it was used by scientists to study the multi-relational complexity of ecology. However the research went out of fashion in the 1980s and was not revisited when Network Science recently expressed interests with multi-relational networks known as multiplexes. This paper studies interval graphs from the perspective of Network Science.

Loe, Chuan Wen

2015-01-01T23:59:59.000Z

104

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

105

From graphs to signals and back: Identification of graph structures using spectral analysis  

E-Print Network [OSTI]

Many systems comprising entities in interactions can be represented as graphs, whose structure gives significant insights about how these systems work. Network theory has undergone further developments, in particular in relation to detection of communities in graphs, to catch this structure. Recently, an approach has been proposed to transform a graph into a collection of signals: Using a multidimensional scaling technique on a distance matrix representing relations between vertices of the graph, points in a Euclidean space are obtained and interpreted as signals, indexed by the vertices. In this article, we propose several extensions to this approach, developing a framework to study graph structures using signal processing tools. We first extend the current methodology, enabling us to highlight connections between properties of signals and graph structures, such as communities, regularity or randomness, as well as combinations of those. A robust inverse transformation method is next described, taking into ac...

Hamon, Ronan; Flandrin, Patrick; Robardet, Cťline

2015-01-01T23:59:59.000Z

106

Continuous-time quantum walks on star graphs  

SciTech Connect (OSTI)

In this paper, we investigate continuous-time quantum walk on star graphs. It is shown that quantum central limit theorem for a continuous-time quantum walk on star graphs for N-fold star power graph, which are invariant under the quantum component of adjacency matrix, converges to continuous-time quantum walk on K{sub 2} graphs (complete graph with two vertices) and the probability of observing walk tends to the uniform distribution.

Salimi, S. [Department of Physics, University of Kurdistan, P.O. Box 66177-15175, Sanandaj (Iran, Islamic Republic of)], E-mail: shsalimi@uok.ac.ir

2009-06-15T23:59:59.000Z

107

Bipartite graph partitioning and data clustering  

SciTech Connect (OSTI)

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

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

2001-05-07T23:59:59.000Z

108

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

109

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

110

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

111

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

112

Forced orientation of graphs Babak Farzad  

E-Print Network [OSTI]

Forced orientation of graphs Babak Farzad Mohammad Mahdian Ebad S. Mahmoodian Amin Saberiß Bardia, USA. (saberi@cc.gatech.edu) ∂ Department of Computer Science, UIUC, Urbana, USA. (sadri@cs.uiuc.edu) 1

Toronto, University of

113

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

114

Graph Summarization with Bounded Error Saket Navlakha  

E-Print Network [OSTI]

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

Gruner, Daniel S.

115

Accelerating semantic graph databases on commodity clusters  

SciTech Connect (OSTI)

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

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

2013-10-06T23:59:59.000Z

116

2Cosmic Bar Graphs Galaxy Type  

E-Print Network [OSTI]

in the cluster are spirals? Problem 2 ­ Gamma-ray bursts happen about once each day. The bar graph to the right there are 160 total galaxies, the fraction of spirals is 137/160 = 0.86, or equivalently 86%. Problem 2 ­ Gamma-ray2Cosmic Bar Graphs 0 20 40 60 80 100 S E SB I Galaxy Type Number 0 200 400 600 800 1000 FB SB Burst

117

Forward viewing OCT endomicroscopy  

E-Print Network [OSTI]

A forward viewing fiber optic-based imaging probe device was designed and constructed for use with ultrahigh speed optical coherence tomography in the human gastrointestinal tract. The light source was a MEMS-VCSEL at 1300 ...

Liang, Kaicheng

2014-01-01T23:59:59.000Z

118

Graph representation of protein free energy landscape  

SciTech Connect (OSTI)

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

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

2013-11-14T23:59:59.000Z

119

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

120

Site Map  

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

AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel),Feet) Year Jan Feb Mar Apr May Jun Jul(Summary)morphinanInformation Desert Southwest RegionatSearchScheduled System Highlights Success Stories ContactSite Map

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

Site Map  

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

AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel),Feet) Year Jan Feb Mar Apr May JunDatastreamsmmcrcalgovInstrumentsrucLas ConchasPassiveSubmitted forHighlightsSeminarsSiliconSite Map TUNL pdf's | FAS pdf's | HTML |

122

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

123

Viewing biology in action | EMSL  

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

Viewing biology in action Viewing biology in action DOE-funded pilot program will create mesoscale biological imaging platform James Evans EMSL received first-year funding of...

124

SPEECH ENHANCEMENT USING A STATISTICALLY DERIVED FILTER MAPPING  

E-Print Network [OSTI]

SPEECH ENHANCEMENT USING A STATISTICALLY DERIVED FILTER MAPPING Yan Ming Cheng, Douglas, Quebec H3E 1H6 Canada Abstract We view the speech enhancement task in two aspects: reduc- tion Mapping (NISSM) to estimate a speech enhancement Wiener filter. NISSM consists of a noise

Kabal, Peter

125

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

126

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

127

Geologic Maps Geology 200  

E-Print Network [OSTI]

Geologic Maps Geology 200 Geology for Environmental Scientists #12;Geologic Map of the US #12;Symbols found on geologic maps #12;Horizontal Strata #12;Geologic map of part of the Grand Canyon. Each color represents a different formation. #12;Inclined Strata #12;Dome #12;Geologic map of the Black Hills

Kammer, Thomas

128

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

129

MadGraph 5 : Going Beyond  

E-Print Network [OSTI]

MadGraph 5 is the new version of the MadGraph matrix element generator, written in the Python programming language. It implements a number of new, efficient algorithms that provide improved performance and functionality in all aspects of the program. It features a new user interface, several new output formats including C++ process libraries for Pythia 8, and full compatibility with FeynRules for new physics models implementation, allowing for event generation for any model that can be written in the form of a Lagrangian. MadGraph 5 builds on the same philosophy as the previous versions, and its design allows it to be used as a collaborative platform where theoretical, phenomenological and simulation projects can be developed and then distributed to the high-energy community. We describe the ideas and the most important developments of the code and illustrate its capabilities through a few simple phenomenological examples.

Johan Alwall; Michel Herquet; Fabio Maltoni; Olivier Mattelaer; Tim Stelzer

2011-06-02T23:59:59.000Z

130

Streaming Graph Computations with a Helpful Advisor  

E-Print Network [OSTI]

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

Cormode, Graham; Thaler, Justin

2010-01-01T23:59:59.000Z

131

Circuit and bond polytopes on series-parallel graphs$  

E-Print Network [OSTI]

Jul 10, 2014 ... M0 = IS, for some star decomposition S of G, and Mi?Ni is a cut of G, for i = 1,..., k. 2. Circuit polytope on series-parallel graphs. Given a graph G†...

2014-07-10T23:59:59.000Z

132

An efficient semidefinite programming relaxation for the graph ...  

E-Print Network [OSTI]

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

2012-08-28T23:59:59.000Z

133

Generating Random Graphs with Large Girth Mohsen Bayati  

E-Print Network [OSTI]

Generating Random Graphs with Large Girth Mohsen Bayati Andrea Montanari Amin Saberi Abstract We; saberi@stanford.edu. 1 #12;free graphs are close to bipartite. We show that our new algorithm guarantees

Saberi, Amin

134

GARNET : a Graphical Attack graph and Reachability Network Evaluation Tool  

E-Print Network [OSTI]

Attack graphs are valuable tools in the assessment of network security, revealing potential attack paths an adversary could use to gain control of network assets. Creating an effective visualization for attack graphs is ...

Williams, Leevar (Leevar Christoff)

2008-01-01T23:59:59.000Z

135

Codes on Graphs: Duality and MacWilliams Identities  

E-Print Network [OSTI]

A conceptual framework involving partition functions of normal factor graphs is introduced, paralleling a similar recent development by Al-Bashabsheh and Mao. The partition functions of dual normal factor graphs are shown ...

Forney, G. David, Jr.

136

Scalable Parallel Algorithms for Massive Scale-free Graphs  

E-Print Network [OSTI]

Efficiently storing and processing massive graph data sets is a challenging problem as researchers seek to leverage ďBig DataĒ to answer next-generation scientific questions. New techniques are required to process large scale-free graphs in shared...

Pearce, Roger Allan

2013-12-05T23:59:59.000Z

137

Math 564 Graph Theory Fall 2008 Instructor Amites Sarkar  

E-Print Network [OSTI]

Math 564 Graph Theory Fall 2008 Instructor Amites Sarkar Text Pearls in Graph Theory (Dover Edition and Fridays, in 216 Bond Hall. My phone number is 650 7569 and my e-mail is amites.sarkar@wwu.edu #12;

Sarkar, Amites

138

Math 564 Graph Theory Fall 2013 Instructor Amites Sarkar  

E-Print Network [OSTI]

Math 564 Graph Theory Fall 2013 Instructor Amites Sarkar Text Modern Graph Theory B¬īela Bollob, Tuesdays, Wednesdays and Fridays, in 216 Bond Hall. My phone number is 650 7569 and my e-mail is amites.sarkar

Sarkar, Amites

139

Reformulation of a model for hierarchical divisive graph modularity ...  

E-Print Network [OSTI]

Agarwal, G., & Kempe, D. (2008). Modularity-maximizing graph communities via mathematical program- ming. The European Physical Journal B - Condensed†...

2012-01-31T23:59:59.000Z

140

Problems of Distance-Regular Graphs Hiroshi Suzuki  

E-Print Network [OSTI]

. Biggs, Algebraic Graph Theory Second Edition, Cambridge U. P., Cambridge 1993. [16] N. L. Biggs, A. G

Xi, Changchang

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

Bose-Einstein condensation on quantum graphs  

E-Print Network [OSTI]

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

Jens Bolte; Joachim Kerner

2014-03-02T23:59:59.000Z

142

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

143

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

144

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.

145

Optimal IDS Sensor Placement And Alert Prioritization Using Attack Graphs  

E-Print Network [OSTI]

1 Optimal IDS Sensor Placement And Alert Prioritization Using Attack Graphs Steven Noel and Sushil optimally place intrusion detection system (IDS) sensors and prioritize IDS alerts using attack graph. The set of all such paths through the network constitutes an attack graph, which we aggregate according

Noel, Steven

146

Improving Attack Graph Visualization through Data Reduction and Attack Grouping  

E-Print Network [OSTI]

Improving Attack Graph Visualization through Data Reduction and Attack Grouping John Homer1 Laboratory, USA Abstract. Various tools exist to analyze enterprise network systems and to produce attack graphs detailing how attackers might penetrate into the system. These attack graphs, however, are often

Ou, Xinming "Simon"

147

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

148

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

149

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

150

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

151

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

152

Inference of Edge Replacement Graph Grammars Jacek P. Kukluk1  

E-Print Network [OSTI]

Inference of Edge Replacement Graph Grammars Jacek P. Kukluk1 , Lawrence B. Holder2 , and Diane J@eecs.wsu.edu Abstract We describe an algorithm and experiments for inference of edge replacement graph grammars for inference of Node Replacement Recursive Graph Grammars [7]. In this paper we describe an approach

Holder, Lawrence B.

153

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

154

ď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

155

Stereoscopic optical viewing system  

DOE Patents [OSTI]

An improved optical system which provides the operator 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, Clifford S. (Walnut Creek, CA)

1987-01-01T23:59:59.000Z

156

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

157

Dominating Set on Bipartite Graphs Mathieu Liedloff  

E-Print Network [OSTI]

.5263n ) time algorithm using polynomial space and an O(1.5137n ) time algorithm using exponential space ) time and polynomial space algorithm, and an O(1.5063n ) time algorithm that uses exponential space. We]). Known results. Given a graph G = (V, E), a subset D V is a dominating set of G if every vertex of V

Liedloff, Mathieu

158

Optimizing Path Query Performance: Graph Clustering Strategies  

E-Print Network [OSTI]

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

159

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

160

Graph Grammars for Self Assembling Robotic Systems  

E-Print Network [OSTI]

Graph Grammars for Self Assembling Robotic Systems Eric Klavins Electrical Engineering University numbers of objects so that they perform some global task. Nevertheless, there are examples of sophisticated machines, such as the ribosome or the mechanical motor in the bacterial flagellum, that seem

Ghrist, Robert W.

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

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.

162

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

163

Flexible Layered Authentication Graph for Multimedia Streaming  

E-Print Network [OSTI]

With the increasing demand on multimedia streaming in more and more applications, security issues such as integrity side, lost packets are dropped from the graph and a packet is verifiable if it has a path and all subsequent packets become not verifiable. EMSS [4] makes a great improvement by building multiple

Sun, Qibin

164

Lessons 6 Graphs of Functional Models  

E-Print Network [OSTI]

Aug 30, 2013 ... One of the problems (#1) illustrates the principle of supply and demand, ... All of the problems involve building up a function model (see Lesson 5) ... Granite Management rents out several apartment complexes in the .... Side. 0.001 per cm2. Bottom. 0.005 per cm2. Lessons 6 Graphs of Functional Models.

2013-08-30T23:59:59.000Z

165

Line graphs e contrazioni: un approccio rigoroso alla space syntax  

E-Print Network [OSTI]

The methods of the space syntax have been the subject of extensive discussion, and several techniques to identify the axis lines have been proposed. The space syntax can be represented in terms of line graph, a graphs defined on the edge of a given primary graph. By means of the line graph algorithms, a system of labels defined on the edges of the primary graph is transformed into a system of labels on the vertices of the line graph. The contraction of adjacent edges with the same label allows to build a more general graph than those generated with the methods of the space syntax. By means of the functions implemented in Mathematica is therefore possible to redefine the space syntax on any system of urban quantities (labels) and reproduce the results of the axial lines as a special case. As an example is discussed a possible application of the method to the urban noise analysis.

D'Autilia, Roberto

2015-01-01T23:59:59.000Z

166

Career Map: Instrumentation Coordinator  

Broader source: Energy.gov [DOE]

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

167

Historical Maps Online  

E-Print Network [OSTI]

and the online library architecture. Keywords: historical maps, maps, GIS, Geographic Information Systems, online libraries, Luna Imaging, Insight, North America, South America, atlases, globes, school geographies, maritime charts, children?s maps, wall maps..., this option would not allow people to truly study the original maps. With my growing interest in software and the Internet, around 1997 I decided to create a software program that would display my collection via the Internet, through collaboration with Luna...

Rumsey, David Y.

2005-01-31T23:59:59.000Z

168

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

169

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

170

Data-flow graphs as a model of parallel complexity  

SciTech Connect (OSTI)

A new model of parallel computation based on data-flow graphs is introduced, which is specifically oriented towards complexity theory. Data-flow graphs are capable of illustrating properties of synchronous, asynchronous, and nondeterministic computations. Sufficient conditions are derived for asynchronous data-flow graphs to be determinate, i.e., all possible computations are finite and yield the same result. For determinate graphs, it is shown that the synchronous computation is as fast as any asynchronous computation. An algorithm is presented that transforms a nondeterminate data-flow graphs into a synchronous determinate one. The basic data-flow graph idea is extended into a model with greater potential parallelism, called the Uniform Data Flow Graph Family (UDFGF) Model. It is proved that time and space for the UDFGF model are polynomially related to reversal and space for the Turing Machine model, in both the deterministic and nondeterministic cases. In addition to forming an abstract computational model, data-flow graphs are parallel programs for real multiprocessors. Given a data flow graph program and a multiprocessor, each node of the graph must be assigned to one of the processors. It is proved that this problem is intractable, and a practical algorithm to find approximate solutions for it is presented.

Campbell, M.L.

1987-01-01T23:59:59.000Z

171

Statistical Properties of Quantum Graph Spectra  

E-Print Network [OSTI]

A general analytical approach to the statistical description of quantum graph spectra based on the exact periodic orbit expansions of quantum levels is discussed. The exact and approximate expressions obtained in \\cite{Anima} for the probability distribution functions using the spectral hierarchy method are analyzed. In addition, the mechanism of appearance of the universal statistical properties of spectral fluctuations of quantum-chaotic systems is considered in terms of the semiclassical theory of periodic orbits.

Yu. Dabaghian

2006-08-09T23:59:59.000Z

172

Analysis of beacon triangulation in random graphs  

E-Print Network [OSTI]

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 53 viii LIST OF TABLES TABLE Page I Beacons needed for different n to avoid conflicts . . . . . . . . . . . . 13 II Beacons needed for different n to make pu(n) equal to one for lambda = 10 from our model and simulation... . . . . . . . . . . . . . . . . . 25 III Beacons needed for different n to make pu(n) equal to one for lambda = 10 from our simulation data for G(n,p) graph and uniform distribution case . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 26 IV Beacons needed for different n...

Kakarlapudi, Geetha

2005-02-17T23:59:59.000Z

173

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

174

False color viewing device  

DOE Patents [OSTI]

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

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

1992-01-01T23:59:59.000Z

175

False color viewing device  

DOE Patents [OSTI]

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

Kronberg, J.W.

1992-10-20T23:59:59.000Z

176

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

177

Dynamics of entanglement of bosonic modes on symmetric graphs  

E-Print Network [OSTI]

We investigate the dynamics of an initially disentangled Gaussian state on a general finite symmetric graph. As concrete examples we obtain properties of this dynamics on mean field graphs of arbitrary sizes. In the same way that chains can be used for transmitting entanglement by their natural dynamics, these graphs can be used to store entanglement. We also consider two kinds of regular polyhedron which show interesting features of entanglement sharing.

F. Ghahhari; V. Karimipour; R. Shahrokhshahi

2006-11-23T23:59:59.000Z

178

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

179

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

180

Independent set problems and odd-hole-preserving graph reductions  

E-Print Network [OSTI]

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

Warren, Jeffrey Scott

2009-05-15T23:59:59.000Z

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

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

182

Generating Random Graphs with Large Girth Mohsen Bayati  

E-Print Network [OSTI]

Generating Random Graphs with Large Girth Mohsen Bayati Andrea Montanari Amin Saberi Abstract We for Computational and Mathematical Engineering, Stanford University; saberi@stanford.edu. knowledge

Montanari, Annamaria

183

A notable family of entire intrinsic minimal graph...  

E-Print Network [OSTI]

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

2006-09-09T23:59:59.000Z

184

National Hydropower Map  

Broader source: Energy.gov [DOE]

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

185

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.

186

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.

187

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.

188

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.

189

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.

190

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.

191

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

192

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

193

Visualization Graph | OpenEI Community  

Open Energy Info (EERE)

AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on Office of InspectorConcentrating SolarElectric Coop,Save EnergyGlouster,Winside, Nebraska (UtilityVirginiaNoGraph Home

194

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

195

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

196

Deciding Timed Bisimulation for Timed Automata Using Zone Valuation Graph  

E-Print Network [OSTI]

Deciding Timed Bisimulation for Timed Automata Using Zone Valuation Graph Shibashis Guha, Chinmay was first proved to be decidable for timed automata by Cerans using a product construction method on region graph. Several other methods have been proposed in the literature since then for decid- ing timed

Prasad, Sanjiva

197

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

198

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

199

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

200

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

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

Understanding Complex Network Attack Graphs through Clustered Adjacency Matrices  

E-Print Network [OSTI]

Understanding Complex Network Attack Graphs through Clustered Adjacency Matrices Steven Noel}@gmu.edu Abstract We apply adjacency matrix clustering to network attack graphs for attack correlation, prediction, and hypothesizing. We self-multiply the clustered adjacency matrices to show attacker reachability across

Noel, Steven

202

Improving Attack Graph Visualization through Data Reduction and Attack Grouping  

SciTech Connect (OSTI)

Various tools exist to analyze enterprise network systems and to produce attack graphs detailing how attackers might penetrate into the system. These attack graphs, however, are often complex and difficult to comprehend fully, and a human user may find it problematic to reach appropriate configuration decisions. This paper presents methodologies that can 1) automatically identify portions of an attack graph that do not help a user to understand the core security problems and so can be trimmed, and 2) automatically group similar attack steps as virtual nodes in a model of the network topology, to immediately increase the understandability of the data. We believe both methods are important steps toward improving visualization of attack graphs to make them more useful in configuration management for large enterprise networks. We implemented our methods using one of the existing attack-graph toolkits. Initial experimentation shows that the proposed approaches can 1) significantly reduce the complexity of attack graphs by trimming a large portion of the graph that is not needed for a user to understand the security problem, and 2) significantly increase the accessibility and understandability of the data presented in the attack graph by clearly showing, within a generated visualization of the network topology, the number and type of potential attacks to which each host is exposed.

John Homer; Ashok Varikuti; Xinming Ou; Miles A. McQueen

2008-09-01T23:59:59.000Z

203

Scaling Semantic Graph Databases in Size and Performance  

SciTech Connect (OSTI)

In this paper we present SGEM, a full software system for accelerating large-scale semantic graph databases on commodity clusters. Unlike current approaches, SGEM addresses semantic graph databases by only employing graph methods at all the levels of the stack. On one hand, this allows exploiting the space efficiency of graph data structures and the inherent parallelism of graph algorithms. These features adapt well to the increasing system memory and core counts of modern commodity clusters. On the other hand, however, these systems are optimized for regular computation and batched data transfers, while graph methods usually are irregular and generate fine-grained data accesses with poor spatial and temporal locality. Our framework comprises a SPARQL to data parallel C compiler, a library of parallel graph methods and a custom, multithreaded runtime system. We introduce our stack, motivate its advantages with respect to other solutions and show how we solved the challenges posed by irregular behaviors. We present the result of our software stack on the Berlin SPARQL benchmarks with datasets up to 10 billion triples (a triple corresponds to a graph edge), demonstrating scaling in dataset size and in performance as more nodes are added to the cluster.

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

2014-08-06T23:59:59.000Z

204

A Surface Reconstruction Method Using Global Graph Cut Optimization  

E-Print Network [OSTI]

SAR (China) 1 sparis@csail.mit.edu -- Sylvain Paris has worked on this project during his PhD at ARTIS calibrated images mainly has been approached using local methods, either as a continuous optimization problem of a pixel. Index Terms Graph flow, graph cut, 3D reconstruction from calibrated cameras, discontinuities

Paris, Sylvain

205

A Surface Reconstruction Method Using Global Graph Cut Optimization  

E-Print Network [OSTI]

SAR (China) 1sparis@csail.mit.edu ­ Sylvain Paris has worked on this project during his PhD at ARTIS calibrated images mainly has been approached using local methods, either as a continuous optimization problem of a pixel. Index Terms Graph flow, graph cut, 3D reconstruction from calibrated cameras, discontinuities

Paris, Sylvain

206

A Surface Reconstruction Method Using Global Graph Cut Optimization  

E-Print Network [OSTI]

SAR (China) 1sparis@csail.mit.edu ­ Sylvain Paris has worked on this project during his PhD at ARTIS reconstruction from multiple calibrated images mainly has been approached using local methods, either to 1/10th of a pixel. Index Terms Graph flow, graph cut, 3D reconstruction from calibrated cameras

Paris-Sud XI, Université de

207

Including Blind Students in Computer Science Through Access to Graphs  

E-Print Network [OSTI]

Including Blind Students in Computer Science Through Access to Graphs Suzanne Balik, Sean Mealin SKetching tool, GSK, to provide blind and sighted people with a means to create, examine, and share graphs (node-link diagrams) in real-time. GSK proved very effective for one blind computer science student

Young, R. Michael

208

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

209

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

210

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

211

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

212

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

213

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

214

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

215

GPU-based Scalable Volumetric Reconstruction for Multi-view Stereo  

SciTech Connect (OSTI)

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

216

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

217

A Regulator's View of Cogeneration  

E-Print Network [OSTI]

of the total national electric generation. In view of the energy requirements of Pennsylvania's industry and the impact of increasing energy costs on employment the Commission directed its technical staff to investigate the potential for industrial cogeneration...

Shanaman, S. M.

1982-01-01T23:59:59.000Z

218

MAPPING HVAC SYSTEMS FOR SIMULATION IN Author(s), Mangesh Basarkar, James O'Donnell, Philip  

E-Print Network [OSTI]

LBNL-5565E MAPPING HVAC SYSTEMS FOR SIMULATION IN ENERGYPLUS Author(s), Mangesh Basarkar, James O Government or any agency thereof or The Regents of the University of California. #12;MAPPING HVAC SYSTEMS tools to be accessible to designers, tool interfaces should present a conventional view of HVAC systems

219

Interactive Texture Mapping Jer^ome Maillot , Hussein Yahiaz, Anne Verroustz  

E-Print Network [OSTI]

function we view the map- ping as an energy-minimization process. We have constructed an interactive objects. CR Categories and subject descriptors: I.3.3 [Computer Graphics] Pic- ture/Image Generation. I.3.7 [Computer Graphics] Graphics and Realism - Color, Shading and Texture. Additional Keywords: Texture Mapping

Frey, Pascal

220

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

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

Mapping in the Cloud: Working with Google Maps and other Mapping Services  

E-Print Network [OSTI]

:document.getElementById('map'), /*ID of element on the page where you want the map added*/ zoom:10, /*initial zoom level of map*/ latLng:{lat:39.743943, lng:-105.020089}, /*center of map in latitude/longitude*/ mtype...:'map' /*map type (map)*/ }; /*Construct an instance of MQA.TileMap with the options object*/ window.map = new MQA.TileMap(options); /*An example using the MQA.Poi constructor. You will need to pass in an object containing the lat (Latitude) and lng (Longitude...

Peterson, Michael

2014-11-19T23:59:59.000Z

222

Approximation of Harmonic Maps and Wave Maps Soren Bartels  

E-Print Network [OSTI]

Approximation of Harmonic Maps and Wave Maps S¨oren Bartels Partial differential equations to certain boundary condtions. If X = then critical points u : N are called harmonic maps into N, ·) = u0, tu(0, ·) = v0. To approximate harmonic maps or wave maps we consider a regular triangula- tion

Bartels, Soeren

223

Well performance graph simplifies field calculations  

SciTech Connect (OSTI)

Graphic Methods are widely employed in order to understand overall well behavior using only surface parameters. The authors propose a new graphic method, used successfully by Agip for oil and gas wells in Italy, Libya, Nigeria and Tunisia. The well performance graph helps solve many production problems, including estimation of: inflow performance relationship; causes of rate decline throughout well life; and production rate and bottomhole flowing pressure for various pressures upstream of the surface choke, and vice-versa. This method differs from others by using flow behavior through the choke for both critical and subcritical conditions. Equations describing flow through the formation, string and surface choke are also used. Results are quite reliable when these theoretical equations are calibrated with field data, either from the well concerned or from nearby wells producing the same fluid. This article describes the technique as it applies to oil wells. The methodology for gas wells is similar.

De Ghetto, G.

1987-05-01T23:59:59.000Z

224

Community detection in directed acyclic graphs  

E-Print Network [OSTI]

Some temporal networks, most notably citation networks, are naturally represented as directed acyclic graphs (DAGs). To detect communities in DAGs, we propose a modularity for DAGs by defining an appropriate null model (i.e., randomized network) respecting the order of nodes. We implement a spectral method to approximately maximize the proposed modularity measure and test the method on citation networks and other DAGs. We find that the attained values of the modularity for DAGs are similar for partitions that we obtain by maximizing the proposed modularity (designed for DAGs), the modularity for undirected networks and that for general directed networks. In other words, if we neglect the order imposed on nodes (and the direction of links) in a given DAG and maximize the conventional modularity measure, the obtained partition is close to the optimal one in the sense of the modularity for DAGs.

Speidel, Leo; Masuda, Naoki

2015-01-01T23:59:59.000Z

225

Efficient broadcast on random geometric graphs  

SciTech Connect (OSTI)

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

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

2009-01-01T23:59:59.000Z

226

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

227

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

228

Embeddings of Cubic Halin Graphs A Surface-by-Surface Inventory  

E-Print Network [OSTI]

Embeddings of Cubic Halin Graphs A Surface-by-Surface Inventory Jonathan L. Gross Columbia@cs.columbia.edu; http://www.cs.columbia.edu/gross/. 1 #12;Embeddings of Cubic Halin Graphs: An Inventory 2 1 graph for a 14-vertex tree with 8 leaves. #12;Embeddings of Cubic Halin Graphs: An Inventory 3

Gross, Jonathan L.

229

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

230

Integrated Management Requirements mapping  

SciTech Connect (OSTI)

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

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

1992-06-01T23:59:59.000Z

231

Integrated Management Requirements mapping  

SciTech Connect (OSTI)

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

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

1992-06-01T23:59:59.000Z

232

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

233

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

234

The Graph Laplacian and the Dynamics of Complex Networks  

SciTech Connect (OSTI)

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

Thulasidasan, Sunil [Los Alamos National Laboratory

2012-06-11T23:59:59.000Z

235

Viewing device for electron-beam equipment  

SciTech Connect (OSTI)

Viewing devices are used to observe melting, welding, and so on in vacuum systems, an it is necessary to protect the windows from droplets and vapor. A viewing device for electron-beam equipment is described in which the viewing tube and mounting flange are made as a tubular ball joint enclosed in a steel bellows, which render the viewing device flexible. Bending the viewing tube in the intervals between observations protects the viewing window from sputtering and from drops of molten metal.

Nasyrov, R.S.

1985-06-01T23:59:59.000Z

236

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

237

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.

238

Kron Reduction of Graphs with Applications to Electrical Networks  

E-Print Network [OSTI]

Consider a weighted and undirected graph, possibly with self-loops, and its corresponding Laplacian matrix, possibly augmented with additional diagonal elements corresponding to the self-loops. The Kron reduction of this graph is again a graph whose Laplacian matrix is obtained by the Schur complement of the original Laplacian matrix with respect to a subset of nodes. The Kron reduction process is ubiquitous in classic circuit theory and in related disciplines such as electrical impedance tomography, smart grid monitoring, transient stability assessment in power networks, or analysis and simulation of induction motors and power electronics. More general applications of Kron reduction occur in sparse matrix algorithms, multi-grid solvers, finite--element analysis, and Markov chains. The Schur complement of a Laplacian matrix and related concepts have also been studied under different names and as purely theoretic problems in the literature on linear algebra. In this paper we propose a general graph-theoretic f...

Dorfler, Florian

2011-01-01T23:59:59.000Z

239

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.

240

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.

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

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

242

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

243

The Asymmetric Traveling Salesman Problem on Graphs with Bounded Genus  

E-Print Network [OSTI]

Saberi Abstract We give a constant factor approximation algorithm for the asymmetric traveling salesman:{shayan, saberi}@stanford.edu. 1 #12;Thin trees were first defined in the graph embedding literature in an attempt

Saberi, Amin

244

Random Walks with Lookahead in Power Law Random Graphs  

E-Print Network [OSTI]

1 Random Walks with Lookahead in Power Law Random Graphs Milena Mihail Amin Saberi Prasad Tetali Georgia Institute of Technology Email: mihail, saberi° @cc.gatech.edu tetali@math.cc.gatech.edu Abstract

Mihail, Milena

245

Confluence in Data Reduction: Bridging Graph Transformation and Kernelization  

E-Print Network [OSTI]

Ermel Falk H¨uffner Rolf Niedermeier Olga Runge Institut f¨ur Softwaretechnik und Theoretische of critical pair analysis from graph transformation theory, supported by the AGG software tool. These results

Wichmann, Felix

246

Advanced Vulnerability Analysis and Intrusion Detection Through Predictive Attack Graphs  

E-Print Network [OSTI]

Advanced Vulnerability Analysis and Intrusion Detection Through Predictive Attack Graphs Steven, without considering how they contribute to overall attack risk. Similarly, intrusion alarms are logged threats, complexity of security data, and network growth. Our approach to network defense applies attack

Noel, Steven

247

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.

248

Fracture and Fragmentation of Simplicial Finite Elements Meshes using Graphs  

SciTech Connect (OSTI)

An approach for the topological representation of simplicial finite element meshes as graphs is presented. It is shown that by using a graph, the topological changes induced by fracture reduce to a few, local kernel operations. The performance of the graph representation is demonstrated and analyzed, using as reference the 3D fracture algorithm by Pandolfi and Ortiz [22]. It is shown that the graph representation initializes in O(N{sub E}{sup 1.1}) time and fractures in O(N{sub I}{sup 1.0}) time, while the reference implementation requires O(N{sub E}{sup 2.1}) time to initialize and O(N{sub I}{sup 1.9}) time to fracture, where NE is the number of elements in the mesh and N{sub I} is the number of interfaces to fracture.

Mota, A; Knap, J; Ortiz, M

2006-10-18T23:59:59.000Z

249

Local computation algorithms for graphs of non-constant degrees  

E-Print Network [OSTI]

In the model of local computation algorithms (LCAs), we aim to compute the queried part of the output by examining only a small (sublinear) portion of the input. Many recently developed LCAs on graph problems achieve time ...

Yodpinyanee, Anak

2014-01-01T23:59:59.000Z

250

Parallel Algorithms for Graph Optimization using Tree Decompositions  

SciTech Connect (OSTI)

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

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

2012-06-01T23:59:59.000Z

251

Min-Max Theorems Related to Geometric Representationsof Graphs ...  

E-Print Network [OSTI]

Oct 27, 2010 ... 1. Introduction. Geometric representations of graphs is a beautiful area where combina- ..... We shall use the following construction to get hypersphere ...... This is not surprising, as SDP duality theory is more complex than LP.

Marcel K. de Carli Silva and Levent Tuncel

2011-08-06T23:59:59.000Z

252

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.

253

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

254

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

255

Decoding linear codes via optimization and graph-based techniques  

E-Print Network [OSTI]

2.2.1 Linear Codes on1.1.2 Graph-Based Codes 1.2 Dissertation Overview . . .versus the length of the code for (3,6)-regular LDPC codes (

Taghavi, Mohammad H.

2008-01-01T23:59:59.000Z

256

MacWilliams identities for codes on graphs  

E-Print Network [OSTI]

The MacWilliams identity for linear time-invariant convolutional codes that has recently been found by Gluesing-Luerssen and Schneider is proved concisely, and generalized to arbitrary group codes on graphs. A similar ...

Forney, G. David, Jr.

257

On the limiting absorption principle and spectra of quantum graphs  

E-Print Network [OSTI]

The main result of the article is validity of the limiting absorption principle and thus absence of the singular continuous spectrum for compact quantum graphs with several infinite leads attached. The technique used involves Dirichlet-to-Neumann operators.

Beng-Seong Ong

2005-10-10T23:59:59.000Z

258

Maps of Selected State Subdivisions  

Broader source: All U.S. Department of Energy (DOE) Office Webpages (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...

259

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

260

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

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

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

262

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

263

Affine maps of density matrices  

E-Print Network [OSTI]

For quantum systems described by finite matrices, linear and affine maps of matrices are shown to provide equivalent descriptions of evolution of density matrices for a subsystem caused by unitary Hamiltonian evolution in a larger system; an affine map can be replaced by a linear map, and a linear map can be replaced by an affine map. There may be significant advantage in using an affine map. The linear map is generally not completely positive, but the linear part of an equivalent affine map can be chosen to be completely positive and related in the simplest possible way to the unitary Hamiltonian evolution in the larger system.

Thomas F. Jordan

2004-11-21T23:59:59.000Z

264

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

265

Mapping healthcare information technology  

E-Print Network [OSTI]

In this thesis I have developed a map of Healthcare Information Technology applications used in the United States for care delivery, healthcare enterprise management, clinical support, research and patient engagement. No ...

Crawford, William Charles Richards

2010-01-01T23:59:59.000Z

266

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

267

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

268

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

269

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

270

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

271

Wind Resource Maps (Postcard)  

SciTech Connect (OSTI)

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

Not Available

2011-07-01T23:59:59.000Z

272

Interactive Maps from the Great Basin Center for Geothermal Energy  

DOE Data Explorer [Office of Scientific and Technical Information (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.

273

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

274

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

275

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

276

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

277

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

278

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

279

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

280

View  

E-Print Network [OSTI]

all real solutions of a given system of polynomial equations. ... A crucial ingredient is a semidefinite characterization of the real radical ideal ...... The options.

2010-08-12T23:59:59.000Z

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


281

View  

E-Print Network [OSTI]

flow equation is discretized in space using a control volume finite-element technique .... The control volume finite-element method is selected .... parallel plates.

2003-07-16T23:59:59.000Z

282

View  

E-Print Network [OSTI]

based on median finding, variable fixing, and secant techniques. Keywords: ..... arithmetic operations, the overall complexity is O(n2). D. The worst case bound in ..... always work on its rated clock speed, we turned force the Linux system to use the ..... dimensionally equidistributed uniform pseudo-random number generator.

2013-10-14T23:59:59.000Z

283

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

284

View  

E-Print Network [OSTI]

Sep 3, 2003 ... Landau (TDGL) equation, the Maxwell equations, and an energy equation ... varying currents and magnetic fields generate thermal energy,†...

1910-31-00T23:59:59.000Z

285

View  

E-Print Network [OSTI]

Let fbe a meromorphic function satisfying condition (1.2), and let rj be a sequence with property (2.5). Then the set S is finite and for some subsequence of†...

2004-12-25T23:59:59.000Z

286

View  

E-Print Network [OSTI]

project of the classification of (simple) nuclear separable C*-algebras [E]. Let C? denote the category of separable C*-algebras and ?-homomorphisms.

2010-07-30T23:59:59.000Z

287

View  

E-Print Network [OSTI]

the classification results of Kirchberg and Phillips using the notion of nuclear absorbing ... A simple purely infinite nuclear separable C*-algebra is called.

2006-07-11T23:59:59.000Z

288

View  

E-Print Network [OSTI]

a battery of benchmark instances of up to 200 nodes are reported. These seem to be the largest instances that have been solved exactly for this problem.

2008-07-07T23:59:59.000Z

289

View  

E-Print Network [OSTI]

author would also like to acknowledge the Center for High Performance Computing at VCU for providing computational infrastructure and support. 1†...

2009-05-07T23:59:59.000Z

290

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

291

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

292

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

293

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

294

View  

E-Print Network [OSTI]

May 12, 2005 ... We propose in this paper to study the problem of estimating the cost-to- ... and have been proposed in the context of econometry in [Chen and White, 1998]. .... Rearranging terms, we see that the last relation can be written as.

2005-05-12T23:59:59.000Z

295

View  

E-Print Network [OSTI]

May 14, 2010 ... Generally, even testing whether a matrix is in C? is co-NP-complete [23]. ...... One concrete example is the following: ?. ?. ?. ?. ?. ?. 1 1/3 1/3†...

2011-06-21T23:59:59.000Z

296

The Destruction of Tori in Volume-Preserving Maps  

E-Print Network [OSTI]

Invariant tori are prominent features of symplectic and volume preserving maps. From the point of view of chaotic transport the most relevant tori are those that are barriers, and thus have codimension one. For an $n$-dimensional volume-preserving map, such tori are prevalent when the map is nearly "integrable," in the sense of having one action and $n-1$ angle variables. As the map is perturbed, numerical studies show that the originally connected image of the frequency map acquires gaps due to resonances and domains of nonconvergence due to chaos. We present examples of a three-dimensional, generalized standard map for which there is a critical perturbation size, $\\epsilon_c$, above which there are no tori. Numerical investigations to find the "last invariant torus" reveal some similarities to the behavior found by Greene near a critical invariant circle for area preserving maps: the crossing time through the newly destroyed torus appears to have a power law singularity at $\\epsilon_c$, and the local phase space near the critical torus contains many high-order resonances.

J. D. Meiss

2011-02-28T23:59:59.000Z

297

Views of the solar system  

SciTech Connect (OSTI)

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

Hamilton, C.

1995-02-01T23:59:59.000Z

298

Chisolm View | Open Energy Information  

Open Energy Info (EERE)

AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on Office of InspectorConcentrating SolarElectricEnergyCTBarreisVolcanic National Park |Chile:CooperationChisolm View Jump

299

For current viewing resistor loads  

DOE Patents [OSTI]

The invention comprises a terminal unit for a flat cable comprising a BNC-PCB connector having a pin for electrically contacting one or more conducting elements of a flat cable, and a current viewing resistor having an opening through which the pin extends and having a resistor face that abuts a connector face of the BNC-PCB connector, wherein the device is a terminal unit for the flat cable.

Lyons, Gregory R. (Tijeras, NM); Hass, Jay B. (Lee's Summit, MO)

2011-04-19T23:59:59.000Z

300

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

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

Kron Reduction of Graphs with Applications to Electrical Networks  

E-Print Network [OSTI]

Consider a weighted and undirected graph, possibly with self-loops, and its corresponding Laplacian matrix, possibly augmented with additional diagonal elements corresponding to the self-loops. The Kron reduction of this graph is again a graph whose Laplacian matrix is obtained by the Schur complement of the original Laplacian matrix with respect to a subset of nodes. The Kron reduction process is ubiquitous in classic circuit theory and in related disciplines such as electrical impedance tomography, smart grid monitoring, transient stability assessment in power networks, or analysis and simulation of induction motors and power electronics. More general applications of Kron reduction occur in sparse matrix algorithms, multi-grid solvers, finite--element analysis, and Markov chains. The Schur complement of a Laplacian matrix and related concepts have also been studied under different names and as purely theoretic problems in the literature on linear algebra. In this paper we propose a general graph-theoretic framework for Kron reduction that leads to novel and deep insights both on the mathematical and the physical side. We show the applicability of our framework to various practical problem setups arising in engineering applications and computation. Furthermore, we provide a comprehensive and detailed graph-theoretic analysis of the Kron reduction process encompassing topological, algebraic, spectral, resistive, and sensitivity analyses. Throughout our theoretic elaborations we especially emphasize the practical applicability of our results.

Florian Dorfler; Francesco Bullo

2011-02-15T23:59:59.000Z

302

A graph-based system for network-vulnerability analysis  

SciTech Connect (OSTI)

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

Swiler, L.P.; Phillips, C.

1998-06-01T23:59:59.000Z

303

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

304

Maps and inverse maps in open quantum dynamics  

SciTech Connect (OSTI)

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

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

2010-10-15T23:59:59.000Z

305

Mapping the Nanoscale Landscape  

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

AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel),Feet) Year Jan Feb Mar Apr MayAtmospheric Optical Depth7-1D: VegetationEquipment Surfaces andMapping the Nanoscale Landscape Print For the first time,Mapping the

306

Mapping the Nanoscale Landscape  

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

AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel),Feet) Year Jan Feb Mar Apr MayAtmospheric Optical Depth7-1D: VegetationEquipment Surfaces andMapping the Nanoscale Landscape Print For the first time,Mapping

307

Site Map | DOEpatents  

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

AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel),Feet) Year Jan Feb Mar Apr May JunDatastreamsmmcrcalgovInstrumentsrucLas ConchasPassiveSubmitted forHighlightsSeminarsSiliconSite Map TUNL pdf's | FAS pdf's |Site Map

308

Site Monitoring Area Maps  

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

AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel),Feet) Year Jan Feb Mar Apr May JunDatastreamsmmcrcalgovInstrumentsrucLas ConchasPassiveSubmitted forHighlightsSeminarsSiliconSite Map TUNL pdf's | FAS pdf's |SiteMaps

309

Mining Large Heterogeneous Graphs using Cray s Urika  

SciTech Connect (OSTI)

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

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

2013-01-01T23:59:59.000Z

310

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

311

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

312

Random intersection graphs and their applications in security, wireless communication, and social networks  

E-Print Network [OSTI]

Random intersection graphs have received much interest and been used in diverse applications. They are naturally induced in modeling secure sensor networks under random key predistribution schemes, as well as in modeling the topologies of social networks including common-interest networks, collaboration networks, and actor networks. Simply put, a random intersection graph is constructed by assigning each node a set of items in some random manner and then putting an edge between any two nodes that share a certain number of items. Broadly speaking, our work is about analyzing random intersection graphs, and models generated by composing it with other random graph models including random geometric graphs and Erd\\H{o}s-R\\'enyi graphs. These compositional models are introduced to capture the characteristics of various complex natural or man-made networks more accurately than the existing models in the literature. For random intersection graphs and their compositions with other random graphs, we study properties su...

Zhao, Jun; Gligor, Virgil

2015-01-01T23:59:59.000Z

313

Math 497E/564 Graph Theory Winter 2012 Instructor Amites Sarkar  

E-Print Network [OSTI]

Math 497E/564 Graph Theory Winter 2012 Instructor Amites Sarkar Text Modern Graph Theory B, in 216 Bond Hall. My phone number is 650 7569 and my e-mail is amites.sarkar@wwu.edu #12;

Sarkar, Amites

314

CAERs's mine mapping program and Kentucky's mine mapping initiative  

SciTech Connect (OSTI)

Since 1884 the Kentucky Department of Mines and Minerals (KDMM now OMSL) has had a mine mapping function as it relates to mine safety. The CAER's Mine Mapping Program has provided this service to that agency since 1972. The program has been in continuous operation under the current staff and management over that period. Functions include operating the Mine Map Repository/Mine Map Information Center of the OMSL; and receiving and processing all annual coal mine license maps, old maps, and related data. The Kentucky Mine Mapping Initiative's goal is to ensure that every underground and surface mine map in Kentucky is located, digitized and online. The Kentucky mine mapping website plays a vital role in the safety of Kentuckians. The purpose of the web service is to make available electronic maps of mined out areas and approximately 32,000 engineering drawings of operating or closed mines that are located in the state. Future phases of the project will include the archival scanning of all submitted mine maps; the recovery from outside sources of maps that were destroyed in a 1948 fire; and the development of further technology to process maps and related data. 7 photos.

Hiett, J. [University of Kentucky Center for Applied Energy Research, Lexington, KY (United States). Mine Map Repository and Mine Map Information Systems

2007-07-01T23:59:59.000Z

315

Servant dictionary battery, map  

E-Print Network [OSTI]

Attic *** book teachest Servant dictionary scarf [11] Winery demijohn battery, map AuntLair X Cupboard1 wireless Potting gloves aunt[3] Storage dumbwaiter wrench OldFurn parcel, med whistle Over] EastAnnex battery[4] Cupboard2 [2] mask DeadEnd rucksack AlisonWriting [16] TinyBalcony [17] gold key

Rosenthal, Jeffrey S.

316

battery, map parcel, med  

E-Print Network [OSTI]

Attic *** book teachest Servant dictionary scarf [11] Winery demijohn battery, map AuntLair X Cupboard1 wireless Potting gloves aunt[3] Storage dumbwaiter wrench OldFurn parcel, med whistle Over] EastAnnex battery[4] Cupboard2 [2] mask DeadEnd rucksack AlisonWriting [16] TinyBalcony [17] gold key

Rosenthal, Jeffrey S.

317

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

318

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

319

Highly Connected Random Geometric Graphs Paul Balister #+ Bela Bollobas +# Amites Sarkar + Mark Walters #  

E-Print Network [OSTI]

Highly Connected Random Geometric Graphs Paul Balister #+ B‚??ela Bollob‚??as +#¬ß Amites Sarkar +¬∂ Mark

Banaji,. Murad

320

Bounds for mixing time of quantum walks on finite graphs  

E-Print Network [OSTI]

Several inequalities are proved for the mixing time of discrete-time quantum walks on finite graphs. The mixing time is defined differently than in Aharonov, Ambainis, Kempe and Vazirani (2001) and it is found that for particular examples of walks on a cycle, a hypercube and a complete graph, quantum walks provide no speed-up in mixing over the classical counterparts. In addition, non-unitary quantum walks (i.e., walks with decoherence) are considered and a criterion for their convergence to the unique stationary distribution is derived.

Vladislav Kargin

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


321

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

322

Designing a graph-based approach to landscape ecological assessment of linear infrastructures  

SciTech Connect (OSTI)

The development of major linear infrastructures contributes to landscape fragmentation and impacts natural habitats and biodiversity in various ways. To anticipate and minimize such impacts, landscape planning needs to be capable of effective strategic environmental assessment (SEA) and of supporting environmental impact assessment (EIA) decisions. To this end, species distribution models (SDMs) are an effective way of making predictive maps of the presence of a given species. In this paper, we propose to combine SDMs and graph-based representation of landscape networks to integrate the potential long-distance effect of infrastructures on species distribution. A diachronic approach, comparing distribution before and after the linear infrastructure is constructed, leads to the design of a species distribution assessment (SDA), taking into account population isolation. The SDA makes it possible (1) to estimate the local variation in probability of presence and (2) to characterize the impact of the infrastructure in terms of global variation in presence and of distance of disturbance. The method is illustrated by assessing the impact of the construction of a high-speed railway line on the distribution of several virtual species in Franche-Comtť (France). The study shows the capacity of the SDA to characterize the impact of a linear infrastructure either as a research concern or as a spatial planning challenge. SDAs could be helpful in deciding among several scenarios for linear infrastructure routes or for the location of mitigation measures. -- Highlights: ē Graph connectivity metrics were integrated into a species distribution model. ē SDM was performed before and after the implementation of linear infrastructure. ē The local variation of presence provides spatial indicators of the impact.

Girardet, Xavier, E-mail: xavier.girardet@univ-fcomte.fr; FoltÍte, Jean-Christophe, E-mail: jean-christophe.foltete@univ-fcomte.fr; Clauzel, Cťline, E-mail: celine.clauzel@univ-fcomte.fr

2013-09-15T23:59:59.000Z

323

Relativism and views in a conceptual data base model  

SciTech Connect (OSTI)

In a core schema that attempted to faithfully represent the inter-connectedness of the real world, each class role would need to be made explicit, naming its respectively associated classes and mappings. From each role a characteristic family of derived views can be inferred. In practice, this program need not be fully carried out as there are always connections in the real world which we choose not to model. But it is interesting to imagine an information system that behaved as if all (or at least all obvious) possible views had been automatically defined. It appears that humans have a system for doing some such automatic schema transformation in our natural semantic model of the world. As we constantly shift perspectives we seem always to be able to readily call up whatever role is appropriate for any given object in (mental) view. The work described falls in an area that is just on the edge of currently developing DB technologies. It is motivated by a desire to achieve systems that are more natural, more intelligent, and which better complement and support our own intellectual activity in the management and modelling of complex environments. There are, of course, many issues involved here which are far from the arena of cognitive science (especially the more purely technical issues of physical system implementation.) But there are many aspects of the interface toward which these efforts are aimed which remain open questions that AI and cognitive science in general can help to clarify.

Kreps, P.

1980-04-01T23:59:59.000Z

324

ParaView at NERSC  

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

AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel),Feet) Year Jan Feb Mar Apr May JunDatastreamsmmcrcalgovInstrumentsrucLas Conchas recoveryLaboratorySpeedingOptimizingToolsto control intensePageveterans4 - ParaView

325

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

326

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

327

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

328

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

329

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

330

Between automation and exploration: SAS graphing techniques for visualization of survey data  

E-Print Network [OSTI]

Between automation and exploration: SAS graphing techniques for visualization of survey data Chong of survey data. There is always a tension between automation and exploration. Automation is a common to automate the graphing processes via SAS/Macros and SAS/Graph. However, hidden patterns of the data may

Yu, Alex

331

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.

332

Speed Map for Autonomous Rovers over Rough Terrain  

E-Print Network [OSTI]

Grid Map . . . . . . . . . . . . . . . . . . . . . . . . . . . . .considered obstacles [27] Grid Map showing Tile Size, Cellspeed map. It also covers grid maps and terrain roughness,

Loh, Jonathan Edau

2012-01-01T23:59:59.000Z

333

The dimension of semialgebraic subdifferential graphs. 1 Introduction  

E-Print Network [OSTI]

Feb 18, 2011 ... Consider a semi-algebraic set Q and a finite-to-one, con- tinuous, semi-algebraic map ?: Q ? Rm. Then the map ? does not decrease.

2011-02-18T23:59:59.000Z

334

Spectral conditions for positive maps  

E-Print Network [OSTI]

We provide a partial classification of positive linear maps in matrix algebras which is based on a family of spectral conditions. This construction generalizes celebrated Choi example of a map which is positive but not completely positive. It is shown how the spectral conditions enable one to construct linear maps on tensor products of matrix algebras which are positive but only on a convex subset of separable elements. Such maps provide basic tools to study quantum entanglement in multipartite systems.

Dariusz Chruscinski; Andrzej Kossakowski

2008-09-29T23:59:59.000Z

335

MATLAB Tutorial Getting Started with Calculations, Graphing and Programming  

E-Print Network [OSTI]

MATLAB Tutorial Getting Started with Calculations, Graphing and Programming Nicholas R. Kirchner University of Minnesota Thursday, August 30, 2012 #12;Outline 1 MATLAB installation NRK (University of Minnesota) MATLAB 2012.08.30 2 / 28 #12;Outline 1 MATLAB installation 2 The MATLAB UI NRK (University

Weinberger, Hans

336

Analyzing Gene Relationships for Down Syndrome with Labeled Transition Graphs  

E-Print Network [OSTI]

Analyzing Gene Relationships for Down Syndrome with Labeled Transition Graphs Neha Rungta, Hyrum changes in gene expres- sion and physical characteristics associated with Down syndrome is not well understood. Chromosome 21 genes interact with non- chromosome 21 genes to produce Down syndrome

Brigham Young University

337

Structured Region Graphs: Morphing EP into GBP Max Welling  

E-Print Network [OSTI]

Structured Region Graphs: Morphing EP into GBP Max Welling Dept. of Computer Science UC Irvine@eecs.berkeley.edu Abstract GBP and EP are two successful algo­ rithms for approximate probabilistic infer­ ence, which on these structures allow conversion between EP and GBP free ener­ gies. Thus it is revealed that all EP ap

Welling, Max

338

Structured Region Graphs: Morphing EP into GBP Max Welling  

E-Print Network [OSTI]

Structured Region Graphs: Morphing EP into GBP Max Welling Dept. of Computer Science UC Irvine@eecs.berkeley.edu Abstract GBP and EP are two successful algo- rithms for approximate probabilistic infer- ence, which on these structures allow conversion between EP and GBP free ener- gies. Thus it is revealed that all EP ap

Welling, Max

339

Kron Reduction of Graphs with Applications to Electrical Networks  

E-Print Network [OSTI]

1 Kron Reduction of Graphs with Applications to Electrical Networks Florian D¨orfler Francesco work supported by NSF grants IIS- 0904501 and CPS-1135819. Florian D¨orfler and Francesco Bullo Barbara, CA 93106, {dorfler, bullo}@engineering.ucsb.edu we consider the circuit naturally associated

Bullo, Francesco

340

Spectral Decision Diagrams Using Graph Transformations Mitchell Thornton Rolf Drechsler  

E-Print Network [OSTI]

Spectral Decision Diagrams Using Graph Transformations #3; Mitchell Thornton Rolf Drechsler Department of Electrical and Computer Engineering Siemens AG Mississippi State University Corporate Technology Mississippi State, MS 39762 81730 Munich, Germany mitch@ece.msstate.edu rolf.drechsler@mchp.siemens

Thornton, Mitchell

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

Mining Large Graphs And Streams Using Matrix And Tensor Tools  

E-Print Network [OSTI]

RESULTS The graphs at right show overall variability distribution estimated for the Pentium D 800 where a core no longer works properly. In the Sun T1 Niagara cores this is done with a built-in- self processors we record the temperature at which the failure occurred and adjust to the frequencies

Kolda, Tamara G.

342

Optimizing Path Query Performance: Graph Clustering Strategies \\Lambda  

E-Print Network [OSTI]

.J. Watson Labs ywh@us.ibm.com Ning Jing z Changsha Institute of Technology jning@eecs.umich.edu Elke A because it does not incur any run­time cost, requires no auxiliary data structures, and is complimentary evaluation of the performance of these graph clustering techniques using an actual city road network as well

343

An Interchange File Format for Graphs Michael Himsolt  

E-Print Network [OSTI]

graphical information. It is designed as an extendible format and provides facilities such that other be as flexible and extensible as possible. Other programs should be able to write graph files with low overhead Ascii). Since end of line is encoded differ­ ently on different platform, we choose not to use end­of­line

Pentus, Mati

344

Hamilton cycles in graphs and hypergraphs: an extremal perspective  

E-Print Network [OSTI]

Hamilton cycles in graphs and hypergraphs: an extremal perspective Abstract. As one of the most fundamental and well-known NP-complete problems, the Hamilton cycle problem has been the subject of intensive and the study of Hamilton cycles in hypergraphs. We survey these developments and highlight open problems

Osthus, Deryk

345

HAMILTON CYCLES IN GRAPHS AND HYPERGRAPHS: AN EXTREMAL PERSPECTIVE  

E-Print Network [OSTI]

HAMILTON CYCLES IN GRAPHS AND HYPERGRAPHS: AN EXTREMAL PERSPECTIVE DANIELA K¨UHN AND DERYK OSTHUS Abstract. As one of the most fundamental and well-known NP-complete problems, the Hamilton cycle problem emerged, such as resilience, robustness and the study of Hamilton cycles in hypergraphs. We survey

Osthus, Deryk

346

HAMILTON CYCLES IN GRAPHS AND HYPERGRAPHS: AN EXTREMAL PERSPECTIVE  

E-Print Network [OSTI]

HAMILTON CYCLES IN GRAPHS AND HYPERGRAPHS: AN EXTREMAL PERSPECTIVE DANIELA K¨UHN AND DERYK OSTHUS Abstract. As one of the most fundamental and well-known NP-complete prob- lems, the Hamilton cycle problem emerged, such as resilience, robustness and the study of Hamilton cycles in hypergraphs. We survey

Osthus, Deryk

347

Compatible Hamilton cycles in random graphs Michael Krivelevich  

E-Print Network [OSTI]

Compatible Hamilton cycles in random graphs Michael Krivelevich Choongbum Lee Benny Sudakov, there exists a properly colored Hamilton cycle. Furthermore, our proof can be easily modified to show, there exists a Hamilton cycle in which all edges have distinct colors (i.e., a rainbow Hamilton cycle). 1

Sudakov, Benjamin

348

SEISMIC WAVES ESTIMATION AND WAVE FIELD DECOMPOSITION WITH FACTOR GRAPHS  

E-Print Network [OSTI]

SEISMIC WAVES ESTIMATION AND WAVE FIELD DECOMPOSITION WITH FACTOR GRAPHS Stefano Maran√≤ Christoph, Dept. Information Technology & Electr. Eng., 8092 Z√ľrich ABSTRACT Physical wave fields are often from sensors of different kinds. In this paper we propose a technique for the analysis of vector wave

Loeliger, Hans-Andrea

349

Quantitative Analysis of the Full Bitcoin Transaction Graph  

E-Print Network [OSTI]

Quantitative Analysis of the Full Bitcoin Transaction Graph Dorit Ron and Adi Shamir Department.ron,adi.shamir}@weizmann.ac.il Abstract. The Bitcoin scheme is a rare example of a large scale global payment system in which all and how they spend their bitcoins, the balance of bitcoins they keep in their accounts, and how they move

350

SMITH INVARIANTS AND DUAL GRADED GRAPHS ALEXANDER MILLER  

E-Print Network [OSTI]

SMITH INVARIANTS AND DUAL GRADED GRAPHS ALEXANDER MILLER Abstract. The aim of this paper the Smith invariants immediately, as the eigenvalues are completely understood [3, 15]. Furthermore, we. Background 1 1.1. Differential posets 1 1.2. Eigenvalues 3 1.3. Smith invariants 3 2. Conjecture for r

Weinberger, Hans

351

Evaluation of Multimodal Graphs for Blind People , STEPHEN BREWSTER  

E-Print Network [OSTI]

sense on people's fingers. Tactile diagrams exist in many forms and they mainly differEvaluation of Multimodal Graphs for Blind People WAI YU 1 , STEPHEN BREWSTER 2 1 Virtual visualisation system and its evaluations. This system is designed to improve blind and visually impaired people

Williamson, John

352

Synchronous Black Hole Search in Directed Graphs Adrian Kosowski  

E-Print Network [OSTI]

Synchronous Black Hole Search in Directed Graphs Adrian Kosowski Alfredo Navarra Cristina M called black hole nodes, and once a robot enters in one of them, it is destroyed. The goal is to find supported by the Italian CNR Short-Term Mobility Program. A. Kosowski was supported Polish Ministry Grant N

Paris-Sud XI, Université de

353

WRIGHT'S CONSTANTS IN GRAPH ENUMERATION AND BROWNIAN EXCURSION AREA  

E-Print Network [OSTI]

WRIGHT'S CONSTANTS IN GRAPH ENUMERATION AND BROWNIAN EXCURSION AREA SVANTE JANSON Abstract - 1) = n n-2 for every n # 1. Wright [19] proved that for any fixed k # -1, we have the analoguous) Note the equivalent recursion formula # k+1 = 3k + 2 2 # k + k # j=0 # j # k-j , k # -1. (4) Wright

Janson, Svante

354

WRIGHT'S CONSTANTS IN GRAPH ENUMERATION AND BROWNIAN EXCURSION AREA  

E-Print Network [OSTI]

WRIGHT'S CONSTANTS IN GRAPH ENUMERATION AND BROWNIAN EXCURSION AREA SVANTE JANSON Abstract n 1. Wright [19] proved that for any fixed k -1, we have the analoguous asymptotic formula C(n, n-j, k -1. (4) Wright gives in the later paper [20] the same result in the form k = 2(1-5k)/23k1/2(k - 1

Janson, Svante

355

A graph-based network-vulnerability analysis system  

SciTech Connect (OSTI)

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

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

1998-05-03T23:59:59.000Z

356

A graph-based network-vulnerability analysis system  

SciTech Connect (OSTI)

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

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

1998-01-01T23:59:59.000Z

357

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.

358

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

359

Approximating the Diameter of Planar Graphs in Near Linear Time  

E-Print Network [OSTI]

common starting vertex. Let Gin (resp. Gout) be the subgraph of G induced by C and all interior (resp. exterior) vertices to C. Let d(Gin, Gout, G) denote the largest distance in the graph G between a marked vertex in V (Gin) and a marked vertex in V (Gout). In the beginning, all vertices of G are marked and we

Yuster, Raphael

360

A Simple Approach to Abductive Inference using Conceptual Graphs  

E-Print Network [OSTI]

A Simple Approach to Abductive Inference using Conceptual Graphs Maurice Pagnucco Knowledge Systems, Australia. email: morri@cs.su.oz.au fax : +61­2­692­3838 Abstract Abductive reasoning (or simply abduction) is a form of logical in­ ference that aims to derive plausible explanations for data. The term ``abduction

Pagnucco, Maurice

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

Concept generation of dynamic systems using bond graphs  

E-Print Network [OSTI]

REPRESENTATIONS OF IMMITTANCES . . . Immittance synthesis in design Conventional immit tance synthesis techniques by Foster and Cauer Immittance synthesis with bond graphs . . . . . . . . . . . . . Example - Synthesis of two frequency absorber... . . . . . . . . . 35 . 35 . 38 . . . . . . 40 . . . . . . 49 TABLE OF CONTENTS (Continued) CHAPTER Page V PHYSICAL REPRESENTATIONS OF TRANSFER FUNCTIONS Transfer function synthesis in design . . . . . . . . . . . General procedure Conditions for passive...

Krishnan, S

1990-01-01T23:59:59.000Z

362

DOCUMENT MAPS FOR COMPETENCE MANAGEMENT  

E-Print Network [OSTI]

DOCUMENT MAPS FOR COMPETENCE MANAGEMENT Timo Honkela Helsinki University of Technology Neural area of the document maps, i.e., competence management. The document map approach has approved The WEBSOM is a method for analyzing and visualizing large document col- lections. In the WEBSOM method

Honkela, Timo

363

Power Maps in Algebra and  

E-Print Network [OSTI]

Power Maps in Algebra and Topology Kathryn Hess Preface The case of commutative algebras The Hochschild complex of a twisting cochain Power maps on the Hochschild complex Topological relevance Power Compostela, 17 September 2008 #12;Power Maps in Algebra and Topology Kathryn Hess Preface The case

Thévenaz, Jacques

364

Husimi Maps in Graphene  

E-Print Network [OSTI]

We present a method for bridging the gap between the Dirac effective field theory and atomistic simulations in graphene based on the Husimi projection, allowing us to depict phenomena in graphene at arbitrary scales. This technique takes the atomistic wavefunction as an input, and produces semiclassical pictures of quasiparticles in the two Dirac valleys. We use the Husimi tech- nique to produce maps of the scattering behavior of boundaries, giving insight into the properties of wavefunctions at energies both close to and far from the Dirac point. Boundary conditions play a significant role to the rise of Fano resonances, which we examine using the Husimi map to deepen our understanding of bond currents near resonance.

Douglas J. Mason; Mario F. Borunda; Eric J. Heller

2012-06-08T23:59:59.000Z

365

Mapping Biomass Distribution Potential  

E-Print Network [OSTI]

Mapping Biomass Distribution Potential Michael Schaetzel Undergraduate ? Environmental Studies ? University of Kansas L O C A T S I O N BIOMASS ENERGY POTENTIAL o According to DOE, Biomass has the potential to provide 14% of... the nationís power o Currently 1% of national power supply o Carbon neutral? combustion of biomass is part of the natural carbon cycle o Improved crop residue management has potential to benefit environment, producers, and economy Biomass Btu...

Schaetzel, Michael

2010-11-18T23:59:59.000Z

366

The average number of distinct sites visited by a random walker on random graphs  

E-Print Network [OSTI]

We study the linear large $n$ behavior of the average number of distinct sites $S(n)$ visited by a random walker after $n$ steps on a large random graph. An expression for the graph topology dependent prefactor $B$ in $S(n) = Bn$ is proposed. We use generating function techniques to relate this prefactor to the graph adjacency matrix and then devise message-passing equations to calculate its value. Numerical simulations are performed to evaluate the agreement between the message passing predictions and random walk simulations on random graphs. Scaling with system size and average graph connectivity are also analysed.

De Bacco, Caterina; Sollich, Peter

2015-01-01T23:59:59.000Z

367

Better Buildings Network View | November 2014 | Department of...  

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

November 2014 More Documents & Publications Better Buildings Network View | July-August 2014 Better Buildings Network View | December 2014 Better Buildings Network View | January...

368

The Better Buildings Neighborhood View - August 2012 | Department...  

Energy Savers [EERE]

The Better Buildings Neighborhood View - August 2012 The Better Buildings Neighborhood View - August 2012 The Better Buildings Neighborhood View monthly newsletter from the U.S....

369

Cosmology: a bird's eye view  

E-Print Network [OSTI]

In this essay we discuss the difference in views of the Universe as seen by two different observers. While one of the observers follows a geodesic congruence defined by the geometry of the cosmological model, the other observer follows the fluid flow lines of a perfect fluid with a linear equation of state. We point out that the information these observers collect regarding the state of the Universe can be radically different; while one observes a non-inflating ever-expanding ever-lasting universe, the other observer can experience a dynamical behaviour reminiscent to that of quintessence or even that of a phantom cosmology leading to a 'big rip' singularity within finite time (but without the need for exotic forms of matter).

Alan A. Coley; Sigbjorn Hervik; Woei Chet Lim

2006-05-15T23:59:59.000Z

370

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

SciTech Connect (OSTI)

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

Brost, Randolph C.; McLendon, William Clarence,

2013-01-01T23:59:59.000Z

371

Site Map - Cyclotron Institute  

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

AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel),Feet) Year Jan Feb Mar Apr May Jun Jul(Summary)morphinanInformation Desert Southwest RegionatSearchScheduled System Highlights Success Stories ContactSite MapSite

372

Site map | Jefferson Lab  

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

AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel),Feet) Year Jan Feb Mar Apr May Jun Jul(Summary)morphinanInformation Desert Southwest RegionatSearchScheduled System Highlights Success StoriesSite Map Site

373

MAP | Open Energy Information  

Open Energy Info (EERE)

AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on Office of InspectorConcentrating Solar Powerstories on climateJunoMedanos EnergyM Communications Smart Grid ProjectMAP

374

Mapping the Nanoscale Landscape  

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

AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel),Feet) Year Jan Feb Mar Apr MayAtmospheric Optical Depth7-1D: VegetationEquipment Surfaces andMapping the Nanoscale Landscape Print For the first time, researchers

375

Mapping the Nanoscale Landscape  

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

AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel),Feet) Year Jan Feb Mar Apr MayAtmospheric Optical Depth7-1D: VegetationEquipment Surfaces andMapping the Nanoscale Landscape Print For the first time,

376

Fermilab Site Map  

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

AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel),Feet) Year Jan Feb Mar Apr May JunDatastreamsmmcrcalgovInstrumentsruc DocumentationP-Series toESnet4:Epitaxial ThinFORFALL NEWSFemtosecondSystemsthis map as a

377

Map to CAMD  

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

AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel),Feet) Year Jan Feb Mar Apr May JunDatastreamsmmcrcalgovInstrumentsrucLas Conchas recovery challenge fund LasDubey selected as Fulbright-Nehru FellowMap of

378

Mapping the Nanoscale Landscape  

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

AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel),Feet) Year Jan Feb Mar Apr May JunDatastreamsmmcrcalgovInstrumentsrucLas Conchas recovery challenge fund LasDubey selected as Fulbright-NehruMapping the March

379

Mapping the Nanoscale Landscape  

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

AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel),Feet) Year Jan Feb Mar Apr May JunDatastreamsmmcrcalgovInstrumentsrucLas Conchas recovery challenge fund LasDubey selected as Fulbright-NehruMapping the

380

Maps & Directions | ORNL  

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

AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel),Feet) Year Jan Feb Mar Apr May JunDatastreamsmmcrcalgovInstrumentsrucLas Conchas recovery challenge fund LasDubey selected as Fulbright-NehruMapping

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

An unconstrained Lagrangian formulation and conservation laws for the SchrŲdinger map system  

E-Print Network [OSTI]

We consider energy-critical Schr\\"odinger maps from R^2 into the sphere and hyperbolic plane. Viewing such maps with respect to orthonormal frames on the pullback bundle provides a gauge field formulation of the evolution. We show that this gauge field system is the set of Euler-Lagrange equations corresponding to an action that includes a Chern-Simons term. We also introduce the stress-energy tensor and derive conservation laws. In conclusion we offer comparisons between Schr\\"odinger maps and the closely related Chern-Simons-Schr\\"odinger system.

Paul Smith

2014-04-14T23:59:59.000Z

382

An unconstrained Lagrangian formulation and conservation laws for the SchrŲdinger map system  

SciTech Connect (OSTI)

We consider energy-critical SchrŲdinger maps from R{sup 2} into S{sup 2} and H{sup 2}. Viewing such maps with respect to orthonormal frames on the pullback bundle provides a gauge field formulation of the evolution. We show that this gauge field system is the set of Euler-Lagrange equations corresponding to an action that includes a Chern-Simons term. We also introduce the stress-energy tensor and derive conservation laws. In conclusion we offer comparisons between SchrŲdinger maps and the closely related Chern-Simons-SchrŲdinger system.

Smith, Paul, E-mail: smith@math.berkeley.edu [Department of Mathematics, University of California, Berkeley, California 94720 (United States)] [Department of Mathematics, University of California, Berkeley, California 94720 (United States)

2014-05-15T23:59:59.000Z

383

Fibrations and universal view updatability Michael Johnson  

E-Print Network [OSTI]

Fibrations and universal view updatability Michael Johnson Computing Department, Macquarie methods to manage the complexity. Dampney and Johnson [25] first showed how data models based on entity

Johnson, Michael

384

Fibrations and universal view updatability Michael Johnson  

E-Print Network [OSTI]

Fibrations and universal view updatability Michael Johnson Computing Department, Macquarie and Johnson [25] first showed how data models based on entity-relationship (ER) diagrams [10] are enhanced

Rosebrugh, Robert

385

Better Buildings Network View | May 2014 | Department of Energy  

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

May 2014 More Documents & Publications Better Buildings Network View | July-August 2014 Better Buildings Network View | June...

386

Defect mapping system  

DOE Patents [OSTI]

Apparatus for detecting and mapping defects in the surfaces of polycrystalline materials in a manner that distinguishes dislocation pits from grain boundaries includes a laser for illuminating a wide spot on the surface of the material, a light integrating sphere with apertures for capturing light scattered by etched dislocation pits in an intermediate range away from specular reflection while allowing light scattered by etched grain boundaries in a near range from specular reflection to pass through, and optical detection devices for detecting and measuring intensities of the respective intermediate scattered light and near specular scattered light. A center blocking aperture or filter can be used to screen out specular reflected light, which would be reflected by nondefect portions of the polycrystalline material surface. An X-Y translation stage for mounting the polycrystalline material and signal processing and computer equipment accommodate rastor mapping, recording, and displaying of respective dislocation and grain boundary defect densities. A special etch procedure is included, which prepares the polycrystalline material surface to produce distinguishable intermediate and near specular light scattering in patterns that have statistical relevance to the dislocation and grain boundary defect densities. 20 figures.

Sopori, B.L.

1995-04-11T23:59:59.000Z

387

Quantitative Analysis of the Full Bitcoin Transaction Graph  

E-Print Network [OSTI]

Abstract. The Bitcoin scheme is a rare example of a large scale global payment system in which all the transactions are publicly accessible (but in an anonymous way). We downloaded the full history of this scheme, and analyzed many statistical properties of its associated transaction graph. In this paper we answer for the first time a variety of interesting questions about the typical behavior of users, how they acquire and how they spend their bitcoins, the balance of bitcoins they keep in their accounts, and how they move bitcoins between their various accounts in order to better protect their privacy. In addition, we isolated all the large transactions in the system, and discovered that almost all of them are closely related to a single large transaction that took place in November 2010, even though the associated users apparently tried to hide this fact with many strange looking long chains and fork-merge structures in the transaction graph.

Dorit Ron; Adi Shamir

388

A graph-separation theorem for quantum causal models  

E-Print Network [OSTI]

A causal model is an abstract representation of a physical system as a directed acyclic graph (DAG), where the statistical dependencies are encoded using a graphical criterion called `d-separation'. Recent work by Wood & Spekkens shows that causal models cannot, in general, provide a faithful representation of quantum systems. Since d-separation encodes a form of Reichenbach's Common Cause Principle (RCCP), whose validity is questionable in quantum mechanics, we propose a generalised graph separation rule that does not assume the RCCP. We prove that the new rule faithfully captures the statistical dependencies between observables in a quantum network, encoded as a DAG, and is consistent with d-separation in a classical limit. We note that the resulting model is still unable to give a faithful representation of correlations stronger than quantum mechanics, such as the Popescu-Rorlich box.

Jacques Pienaar; Caslav Brukner

2014-10-31T23:59:59.000Z

389

Spectral properties of microwave graphs with local absorption  

E-Print Network [OSTI]

The influence of absorption on the spectra of microwave graphs has been studied experimentally. The microwave networks were made up of coaxial cables and T junctions. First, absorption was introduced by attaching a 50 Ohm load to an additional vertex for graphs with and without time-reversal symmetry. The resulting level-spacing distributions were compared with a generalization of the Wigner surmise in the presence of open channels proposed recently by Poli et al. [Phys. Rev. Lett. 108, 174101 (2012)]. Good agreement was found using an effective coupling parameter. Second, absorption was introduced along one individual bond via a variable microwave attenuator, and the influence of absorption on the length spectrum was studied. The peak heights in the length spectra corresponding to orbits avoiding the absorber were found to be independent of the attenuation, whereas, the heights of the peaks belonging to orbits passing the absorber once or twice showed the expected decrease with increasing attenuation.

M. Allgaier; S. Gehler; S. Barkhofen; H. -J. StŲckmann; U. Kuhl

2014-03-30T23:59:59.000Z

390

Map Data: Alternative Fuel Stations  

Broader source: Energy.gov [DOE]

The geospatial vector data has been compressed into one file.† You will need to uncompress it before using a geographic information systems (GIS) program to view the data.

391

Judicious partitions of graphs Bela Bollobas and Alexander Scott  

E-Print Network [OSTI]

, and for any graph G, there is a partition V (G) = k i=1 Vi such that e(G[Vi]) e(G)/ k+1 2 for i = 1 demand 1 #12;that e(G[Vi]) be fairly close to e(G)/k2 , for i = 1, . . . , k, and that e(Vi, Vj) be fairly close to 2e(G)/k2 , for 1 i

Scott, Alexander Alexander

392

A Spatiotemporal Graph Model for Rainfall Event Identification and Representation  

E-Print Network [OSTI]

of a storm ? The spread of a wildfire ? Other dynamic geographic phenomena from time series of snapshot datasets 3Research Objectives Identify the whole lifecycle of rainstorms from time series of snapshot datasets; Represent and analyze the rainstorms... based on a spatiotemporal graph model; Analyze the spatiotemporal characteristics of rainstorms. Data ? NEXRAD (Next generation Radar) ? Hourly precipitation estimate ? Cover more than 2/3 of the nation Rainstormsí Lifecycle Identification Delineate...

Liu, Weibo

2014-04-21T23:59:59.000Z

393

On the harmonic map equation  

E-Print Network [OSTI]

A generalized harmonic map equation is presented based on the proposed action functional in the Weyl space (PLA, 135, 315, 1989).

S. C. Tiwari

2007-06-09T23:59:59.000Z

394

Wave maps on a wormhole  

E-Print Network [OSTI]

We consider equivariant wave maps from a wormhole spacetime into the three-sphere. This toy-model is designed for gaining insight into the dissipation-by-dispersion phenomena, in particular the soliton resolution conjecture. We first prove that for each topological degree of the map there exists a unique static solution (harmonic map) which is linearly stable. Then, using the hyperboloidal formulation of the initial value problem, we give numerical evidence that every solution starting from smooth initial data of any topological degree evolves asymptotically to the harmonic map of the same degree. The late-time asymptotics of this relaxation process is described in detail.

Piotr Bizo?; Micha? Kahl

2014-12-17T23:59:59.000Z

395

The Metro Map Problem Existing metro maps, produced by professional  

E-Print Network [OSTI]

optimization methods to find a minimal energy state 20 Force directed method for metro map visualization artists, are excellent examples of network visualization Can we produce good metro maps automatically Virtual Environments Case Study - Stock Market MS-Guidelines MS-Process MS-Taxonomy Software Engineering

Hong,Seokhee

396

Materials for Math 13900 Bring to class each day: graph paper ...  

E-Print Network [OSTI]

Materials for Math 13900. Bring to class each day: graph paper isometric dot paper unlined paper cm ruler. We will also be using: compass small scissors.

Roames, Renee S

2015-01-08T23:59:59.000Z

397

Adaptive Composite Map Projections Bernhard Jenny  

E-Print Network [OSTI]

Adaptive Composite Map Projections Bernhard Jenny Abstract--All major web mapping services use.The proposed composite map projection combines several projections that are recommended in cartographic.The composite projection adapts the maps geometry to scale, to the maps height-to-width ratio

Jenny, Bernhard

398

JOBAID-VIEWING AN EMPLOYEE MATRIX (SUPERVISOR)  

Broader source: Energy.gov [DOE]

The purpose of this job aid is to guide†supervisor†users through the step-by-step process of viewing an employee matrix within SuccessFactors Learning.

399

The new option view of investment  

E-Print Network [OSTI]

This paper provides a simple introduction to the new option view of investment. We explain the shortcomings of the orthodox theory, and then outline the basic ideas behind the option framework. Several industry examples ...

Dixit, Avinash K.

1995-01-01T23:59:59.000Z

400

Incorporating video into Google Mobile Street View  

E-Print Network [OSTI]

Mobile Street View is a compelling application but suffers from significant latency problems, especially in limited bandwidth circumstances. Currently, the application uses static images to display street level information. ...

Wright, Christina (Christina E.)

2010-01-01T23:59:59.000Z

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


401

MAPS BETWEEN CLASSIFYING SPACES AND APPLICATIONS by  

E-Print Network [OSTI]

MAPS BETWEEN CLASSIFYING SPACES AND APPLICATIONS space map(BG, BH) can be reduced to the case of simply connected Lie groups. Th* *is reduc- tion method allows some applications. For example a homotopy classificatio* *n of self maps BG

Notbohm, Dietrich

402

Jefferson and Hamilton as viewed by historians  

E-Print Network [OSTI]

JEFFERSON AND HAMILTON AS VIEHED BY HISTORIANS A Thesis Paul Edward Jungmeyer Submitted to the Graduate College of Texas A&M University in ' partial fulfillment of the requirement for the degree of MASTER OF ARTS August, 1970 Major Subject...: History JEFFERSON AND HAMILTON AS VIEWED BY HISTORIANS A Thesis by Paul Edward Jungmeyer Approved as to style and content by: (Chairman of Committee d i~) (Member) (M er) August, 1970 ABSTRACT JEFFERSON AND HAMILTON AS VIEWED BY HISTORIANS...

Jungmeyer, Paul Edward

1970-01-01T23:59:59.000Z

403

Mapping (USPTO) Patent Data using Overlays to Google Maps  

E-Print Network [OSTI]

The paper describes a technique to use patent information available online (at the US Patent and Trademark Office) for the generation of Google Maps that indicate both the quantity and quality of patents granted at the city level. The resulting maps are relevant for technological innovation policies and R&D management because the US market can be considered as the leading market for patenting and patent competition. Quantitative data is made available by the mapping routines for more detailed statistical analysis, and the non-parametric statistics for significance testing are specified. The new mapping approach is explored for the cases of the emerging technologies of "RNA interference" and "nanotechnology" as specific examples. Perspectives for further developments of this technique (other databases and network analysis of co-inventions) are specified.

Leydesdorff, Loet

2011-01-01T23:59:59.000Z

404

A Penrose inequality for asymptotically locally hyperbolic graphs  

E-Print Network [OSTI]

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

Levi Lopes de Lima; Frederico Gir„o

2013-05-14T23:59:59.000Z

405

Conclusions and future work We have pointed out the importance of proximity graphs as scaffolds for clustering  

E-Print Network [OSTI]

have introduced two new types of proximity graphs based on ensembles of minimum spanning trees, which for non-Euclidean data; study stochastic graphs. 7 Results: dimens. reduction (Isomap) Ellipse, high noise

Carreira-Perpi√Ī√°n, Miguel √Ā.

406

Optimizing the Layout of Proportional Symbol Maps  

E-Print Network [OSTI]

Abstract. Proportional symbol maps are a cartographic tool to assist ... opaque disks on a map with the objective of maximizing the total visible border of all disks

2010-11-10T23:59:59.000Z

407

Locating Restricted Facilities on Binary Maps  

E-Print Network [OSTI]

welfare optimization, when the area map is encoded as a binary (0,1) mxn matrix. ... of connected components in binary maps and in Section 7 we conclude.

Mugurel

2008-09-20T23:59:59.000Z

408

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

E-Print Network [OSTI]

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

Andrea Bedini; Jesper Lykke Jacobsen

2010-08-06T23:59:59.000Z

409

Actes JFPC 2008 LS(Graph): Un cadre de recherche locale pour des  

E-Print Network [OSTI]

le diam`etre d'un arbre) parce que ceux-ci sont d¬īej`a impl¬īement¬īes dans LS(Graph). Le program- meur recherche heu- ristiques et metaheuristiques. LS(Graph) est con¬łcu et impl¬īement¬īe en COMET (le code source

Deville, Yves

410

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

E-Print Network [OSTI]

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

Bedini, Andrea

2010-01-01T23:59:59.000Z

411

MadGraph/MadEvent 4 SUSY, new models, matching and more!  

E-Print Network [OSTI]

Alwall - MadGraph/MadEvent 4 513 Mar 2007 What is new in MG/ME 4? Web-oriented, modular software banner #12;Johan Alwall - MadGraph/MadEvent 4 713 Mar 2007 Whole chain on web or downloaded and run locally Cards filled on the web or uploaded (reusable) Modular structure ­ easy to interface to other

California at Santa Cruz, University of

412

Possible and necessary winners in voting trees: majority graphs vs. profiles  

E-Print Network [OSTI]

Possible and necessary winners in voting trees: majority graphs vs. profiles Maria Silvia Pini like those of Gibbard and Sattertwhaite demonstrate that, under weak assumptions like an election in voting trees: majority graphs vs. profiles, Maria Silvia Pini, Francesca Rossi, Kristen Brent Venable

Rossi, Francesca

413

A near-optimal approximation algorithm for Asymmetric TSP1 on embedded graphs2  

E-Print Network [OSTI]

algorithm of Oveis Gharan and Saberi [SODA 2011], which applies only to graphs15 with orientable genus g and Saberi [11] described a polynomial-time9 O( g log g)-approximation algorithm when the input includes and Saberi [11] applies only to23 graphs embedded on orientable surfaces.24 Chekuri and Sidiropoulos [3

Erickson, Jeff

414

DATABASE Open Access RAG: An update to the RNA-As-Graphs resource  

E-Print Network [OSTI]

DATABASE Open Access RAG: An update to the RNA-As-Graphs resource Joseph A Izzo1 , Namhee Kim1 utilize the benefits of relational database, and improvements to several of the utilities such as directed/labeled graphs and a subgraph search program. Conclusions: The RAG updates presented here augment the database

Schlick, Tamar

415

A SURVEY ON HAMILTON CYCLES IN DIRECTED GRAPHS DANIELA KUHN AND DERYK OSTHUS  

E-Print Network [OSTI]

A SURVEY ON HAMILTON CYCLES IN DIRECTED GRAPHS DANIELA K¨UHN AND DERYK OSTHUS Abstract. We survey some recent results on long-standing conjectures regard- ing Hamilton cycles in directed graphs towards Kelly's conjecture on Hamilton decompositions of regular tournaments: the edges of every regular

K√ľhn, Daniela

416

EDGE-DISJOINT HAMILTON CYCLES IN GRAPHS DEMETRES CHRISTOFIDES, DANIELA KUHN AND DERYK OSTHUS  

E-Print Network [OSTI]

EDGE-DISJOINT HAMILTON CYCLES IN GRAPHS DEMETRES CHRISTOFIDES, DANIELA K¨UHN AND DERYK OSTHUS at least n/8 edge-disjoint Hamilton cycles. More generally, we give an asymptotically best possible answer for the number of edge-disjoint Hamilton cycles that a graph G with minimum degree must have. We also prove

Osthus, Deryk

417

Bent Hamilton Cycles in d-Dimensional Grid Graphs Department of Computer Science  

E-Print Network [OSTI]

Bent Hamilton Cycles in d-Dimensional Grid Graphs F. Ruskey Department of Computer Science Classifications: 05C45, 05C38 Abstract A bent Hamilton cycle in a grid graph is one in which each edge Hamilton cycle if some dimension is even and d 3, and does not have a bent Hamilton cycle if all

Sawada, Joe

418

A conjecture of Biggs concerning the resistance of a distance-regular graph  

E-Print Network [OSTI]

Previously, Biggs has conjectured that the resistance between any two points on a distance-regular graph of valency greater than 2 is bounded by twice the resistance between adjacent points. We prove this conjecture, give the sharp constant for the inequality, and display the graphs for which the conjecture most nearly fails. Some necessary background material is included, as well as some consequences.

Markowsky, Greg

2010-01-01T23:59:59.000Z

419

Dig-ta Video, Learn-ng Styes, and Student Understanding of Kinematics Graphs  

E-Print Network [OSTI]

Dig-ta Video, Learn-ng Styes, and Student Understanding of Kinematics Graphs Teresa Larkin Video, Learning Styles, and Student Understanding of Kinematics Graphs Introduction Student learning interactive digital video as well preferences and student understanding and their ability to interpret motion

Zollman, Dean

420

Graph-based simulated annealing: A hybrid approach to stochastic modeling of complex  

E-Print Network [OSTI]

of the system, where the energy is associated with its surface area. The advantage is that for model fittingGraph-based simulated annealing: A hybrid approach to stochastic modeling of complex is based on a hybrid approach, where in a first step a graph model is developed using ideas from stochastic

Kroese, Dirk P.

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

Compositionality in Synchronous Data Flow: Modular Code Generation from Hierarchical SDF Graphs  

E-Print Network [OSTI]

Compositionality in Synchronous Data Flow: Modular Code Generation from Hierarchical SDF Graphs in Synchronous Data Flow: Modular Code Generation from Hierarchical SDF Graphs Stavros Tripakis, Dai Bui, Bert of California, Berkeley stavros, daib, eal@eecs.berkeley.edu October 20, 2009 Abstract Hierarchical SDF models

422

The power graph of a finite group, II Peter J. Cameron  

E-Print Network [OSTI]

The power graph of a finite group, II Peter J. Cameron School of Mathematical Sciences Queen Mary, University of London Mile End Road London E1 4NS, U.K. Abstract The directed power graph of a group G is the digraph with vertex set G, having an arc from y to x whenever x is a power of y; the undirected power

Cameron, Peter

423

Energy Models for Drawing Signed Graphs Anne-Marie Kermarrec and Afshin Moin  

E-Print Network [OSTI]

Energy Models for Drawing Signed Graphs Anne-Marie Kermarrec and Afshin Moin INRIA Rennes Bretagne-dimensional space. Energy models are the prevalent approach to graph drawing. In this paper, we propose energy) or as negative (repulsive). The existent energy models do not discriminate against edge sign. Hence, they do

Paris-Sud XI, Université de

424

WILD QUOTIENT SURFACE SINGULARITIES WHOSE DUAL GRAPHS ARE NOT STAR-SHAPED  

E-Print Network [OSTI]

WILD QUOTIENT SURFACE SINGULARITIES WHOSE DUAL GRAPHS ARE NOT STAR-SHAPED HIROYUKI ITO AND STEFAN- zini on wild quotient singularities in dimension two. Using Kato's theory of log structures and log of Heisenberg groups lead to examples of wild quotient singularities where the dual graph contains at least two

Schröer, Stefan

425

Graph Mining for Object Tracking in Videos Fabien Diot1,2  

E-Print Network [OSTI]

Graph Mining for Object Tracking in Videos Fabien Diot1,2 , Elisa Fromont1 , Baptiste Jeudy1 of graph mining for tracking objects in videos with moving cameras and without any contextual information on the objects to track. To make the mining algorithm efficient, we benefit from a video representation based

426

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

E-Print Network [OSTI]

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

Kambhampati, Subbarao

427

K6 MINORS IN LARGE 6-CONNECTED GRAPHS Ken-ichi Kawarabayashi  

E-Print Network [OSTI]

Princeton, NJ 08544, USA Robin Thomas2 School of Mathematics Georgia Institute of Technology Atlanta-20146 Hamburg, Germany ABSTRACT J√łrgensen conjectured that every 6-connected graph G with no K6 minor hand, Conjecture 1.1 provides a nice and clean statement for 6-connected graphs. Unfortunately, it, too

Norin, Sergey

428

Graph Coloring in the Estimation of Sparse Derivative Matrices ...  

E-Print Network [OSTI]

Mar 15, 2004 ... taining nonzero entries in the column positions mapped by the column segments. A(wėi,q) and A(wėp,j) for all ėp = ėi. This is done for every pair†...

2004-03-15T23:59:59.000Z

429

A map of the universe  

SciTech Connect (OSTI)

We have produced a new conformal map of the universe illustrating recent discoveries, ranging from Kuiper belt objects in the Solar system, to the galaxies and quasars from the Sloan Digital Sky Survey. This map projection, based on the logarithm map of the complex plane, preserves shapes locally, and yet is able to display the entire range of astronomical scales from the Earth s neighborhood to the cosmic microwave background. The conformal nature of the projection, preserving shapes locally, may be of particular use for analyzing large scale structure. Prominent in the map is a Sloan Great Wall of galaxies 1.37 billion light years long, 80 percent longer than the Great Wall discovered by Geller and Huchra and therefore the largest observed structure in the universe.

Gott III, J. Richard; Juric, Mario; Schlegel, David; Hoyle, Fiona; Vogeley, Michael; Tegmark, Max; Bahcall, Neta; Brinkmann, Jon

2003-10-20T23:59:59.000Z

430

MAPPING CLIMATE CHANGE EXPOSURES, VULNERABILITIES,  

E-Print Network [OSTI]

MAPPING CLIMATE CHANGE EXPOSURES, VULNERABILITIES, AND ADAPTATION TO PUBLIC HEALTH RISKS's California Climate Change Center JULY 2012 CEC5002012041 Prepared for: California Energy Commission of California. #12; ii ABSTRACT This study reviewed first available frameworks for climate change adaptation

431

Protein folding using contact maps  

E-Print Network [OSTI]

We present the development of the idea to use dynamics in the space of contact maps as a computational approach to the protein folding problem. We first introduce two important technical ingredients, the reconstruction of a three dimensional conformation from a contact map and the Monte Carlo dynamics in contact map space. We then discuss two approximations to the free energy of the contact maps and a method to derive energy parameters based on perceptron learning. Finally we present results, first for predictions based on threading and then for energy minimization of crambin and of a set of 6 immunoglobulins. The main result is that we proved that the two simple approximations we studied for the free energy are not suitable for protein folding. Perspectives are discussed in the last section.

Michele Vendruscolo; Eytan Domany

1999-01-21T23:59:59.000Z

432

Mapping Indigenous Depth of Place  

E-Print Network [OSTI]

AMERICAN INDIAN CULTURE AND RESEARCH JOURNAL 32:3 (2008) 107Ė126 107 Mapping Indigenous Depth of Place MARGARET WICKENS PEARCE AND RENEE PUALANI LOUIS INTRODUCTION Indigenous communities have successfully used Western geospatial technolo- gies (GT... of geog- raphy at Ohio University in Athens, Ohio. Renee Pualani Louis is Hawaiian and recently completed her doctorate in geography at the University of HawaiĎi at MaĮnoa, Honolulu, HawaiĎi. Published as M. Pearce and R. Louis. Mapping Indigenous depth...

Pearce, Margaret Wickens; Louis, Renee Pualani

2008-11-01T23:59:59.000Z

433

INDDGO: Integrated Network Decomposition & Dynamic programming for Graph Optimization  

SciTech Connect (OSTI)

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

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

2012-10-01T23:59:59.000Z

434

Bond Graph Modeling of Current Diffusion in Magnetic Cores Herv Morel, Bruno Allard, Sabrine M'Rad, Cyril Buttay  

E-Print Network [OSTI]

Bond Graph Modeling of Current Diffusion in Magnetic Cores Hervť Morel, Bruno Allard, Sabrine M, F-69621 Villeurbanne Cedex, France KEYBOARD: Bond Graphs, Variational approximation, Diffusive with the diffusion representation. Both approaches yield a same bond graph representation. 2. MODELING CURRENT

Paris-Sud XI, Universitť de

435

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

E-Print Network [OSTI]

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

Williams, Susan

436

Better Buildings Network View | April 2014 | Department of Energy  

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

April 2014 More Documents & Publications Better Buildings Network View | December 2014 Better Buildings Residential Network Orientation Better Buildings Network View | November...

437

Better Buildings Network View | February 2014 | Department of...  

Energy Savers [EERE]

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

438

Better Buildings Network View | January 2015 | Department of...  

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

5 More Documents & Publications Better Buildings Network View | December 2014 Better Buildings Network View | November 2014 Better Buildings Residential Network Orientation...

439

Better Buildings Network View | June 2014 | Department of Energy  

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

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

440

Better Buildings Network View | March 2014 | Department of Energy  

Energy Savers [EERE]

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

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

Better Buildings Network View | December 2014 | Department of...  

Energy Savers [EERE]

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

442

Better Buildings Network View | January 2014 | Department of...  

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

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

443

Better Buildings Network View | October 2014 | Department of...  

Energy Savers [EERE]

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

444

Better Buildings Network View | February 2015 | Department of...  

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

5 More Documents & Publications Better Buildings Network View | November 2014 Better Buildings Network View | September 2014 Better Buildings Residential Network Case Study:...

445

Residential Windows and Window Coverings: A Detailed View of...  

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

Residential Windows and Window Coverings: A Detailed View of the Installed Base and User Behavior Residential Windows and Window Coverings: A Detailed View of the Installed Base...

446

Nonlinear Data Transformation with Diffusion Map  

E-Print Network [OSTI]

) Others: Laplacian eigenmaps, Hessian eigenmaps, LTSA We apply the diffusion map (Coifman & Lafon 2006

447

Autodesk MapGuide Working with Resources  

E-Print Network [OSTI]

Autodesk MapGuideģ Enterprise Working with Resources Autodesk MapGuideģ Enterprise software has a powerful API (application programming interface) for manipulating resources such as feature and drawing sources, maps, layers, and layouts. Using the Resource Service API, MapGuide-based applications can

Ahmad, Sajjad

448

Local control of area-preserving maps  

E-Print Network [OSTI]

We present a method of control of chaos in area-preserving maps. This method gives an explicit expression of a control term which is added to a given area-preserving map. The resulting controlled map which is a small and suitable modification of the original map, is again area-preserving and has an invariant curve whose equation is explicitly known.

Cristel Chandre; Michel Vittot; Guido Ciraolo

2008-09-01T23:59:59.000Z

449

MEDIEVAL DISTORTIONS: THE PROJECTIONS OF ANCIENT MAPS  

E-Print Network [OSTI]

MEDIEVAL DISTORTIONS: THE PROJECTIONS OF ANCIENT MAPS W.R TOBLER University of Michigan, Ann Arbor ABSTRACT. Estimates of the map projection employed for an ancient map is a prerequisite for a variety for the Hereford map and illustrated the agreement of a portolan chart with an oblique Mercator projection

Tobler, Waldo

450

Combinatorial Maps with Normalized Knot Dainis ZEPS  

E-Print Network [OSTI]

Combinatorial Maps with Normalized Knot Dainis ZEPS Abstract We consider combinatorial maps's normalization doesn't affect combinatorial map what concerns its generality. Knot's normalization leads to more concise numeration of corners in maps, e.g., odd or even corners allow easy to follow distinguished cycles

Paris-Sud XI, Université de

451

Schmidt states and positivity of linear maps  

E-Print Network [OSTI]

Using pure entangled Schmidt states, we show that m-positivity of a map is bounded by the ranks of its negative Kraus matrices. We also give an algebraic condition for a map to be m-positive. We interpret these results in the context of positive maps as entanglement witnesses, and find that only 1-positive maps are needed for testing entanglement.

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

2005-06-13T23:59:59.000Z

452

Positive maps, majorization, entropic inequalities, and detection of entanglement  

E-Print Network [OSTI]

In this paper, we discuss some general connections between the notions of positive map, weak majorization and entropic inequalities in the context of detection of entanglement among bipartite quantum systems. First, basing on the fact that any positive map $\\Lambda:M_{d}(\\mathbb{C})\\to M_{d}(\\mathbb{C})$ can be written as the difference between two completely positive maps $\\Lambda=\\Lambda_{1}-\\Lambda_{2}$, we propose a possible way to generalize the Nielsen--Kempe majorization criterion. Then we present two methods of derivation of some general classes of entropic inequalities useful for the detection of entanglement. While the first one follows from the aforementioned generalized majorization relation and the concept of the Schur--concave decreasing functions, the second is based on some functional inequalities. What is important is that, contrary to the Nielsen--Kempe majorization criterion and entropic inequalities, our criteria allow for the detection of entangled states with positive partial transposition when using indecomposable positive maps. We also point out that if a state with at least one maximally mixed subsystem is detected by some necessary criterion based on the positive map $\\Lambda$, then there exist entropic inequalities derived from $\\Lambda$ (by both procedures) that also detect this state. In this sense, they are equivalent to the necessary criterion $[I\\ot\\Lambda](\\varrho_{AB})\\geq 0$. Moreover, our inequalities provide a way of constructing multi--copy entanglement witnesses and therefore are promising from the experimental point of view. Finally, we discuss some of the derived inequalities in the context of recently introduced protocol of state merging and possibility of approximating the mean value of a linear entanglement witness.

Remigiusz Augusiak; Julia Stasi?ska

2009-07-09T23:59:59.000Z

453

Figure 1. Elevation View of TPX Core including IR TV locations and view of plasma  

E-Print Network [OSTI]

stabilizer plates PPPL-3130 - Preprint Date: August 1995 TPX Diagnostics for Tokamak Operation, Plasma. First plasma is scheduled for mid-2001. Diagnostics are required for real time plasma control, physicsFigure 1. Elevation View of TPX Core including IR TV locations and view of plasma through

454

All maps equivalent to a given map, completely positive or not  

E-Print Network [OSTI]

A dynamical map is a map which takes one density operator to another. Such a map can be written in an operator-sum representation (OSR) using a spectral decomposition. The method of the construction applies to more general maps which need not be completely positive. The OSR not unique; there is a freedom to choose the set of operators in the OSR differently, yet still obtain the same map. Here we identify all maps which are equivalent to a given map. Whereas the freedom for completely positive maps is unitary, the freedom for maps which are not necessarily completely positive is pseudo-unitary.

Yong-Cheng Ou; Mark S. Byrd

2010-04-29T23:59:59.000Z

455

Making Google Maps A comprehensive user guide for creating and using your own online Google Maps  

E-Print Network [OSTI]

1 Making Google Maps A comprehensive user guide for creating and using your own online Google Maps Mashups! What are mashups? Like all maps, mashups display locations chosen by the map's creator, but unlike most maps, anybody with access to the internet can create a personalized mashup. Mashups live

Wright, Dawn Jeannine

456

Unimodal Maps as Boundary-Restrictions of Two-Dimensional Full-Folding Maps  

E-Print Network [OSTI]

Unimodal Maps as Boundary-Restrictions of Two-Dimensional Full-Folding Maps Hideki TSUIKI tsuiki-75-753-6744, Fax:+81-75-753-6694 Abstract It is shown that every unimodal map is realized as a restriction of a simple map defined on the unit disc to a part of its boundary. Our two-dimensional map is called a full

Tsuiki, Hideki

457

BLUE VIEW VISION INSIGHT! Good news--your vision plan  

E-Print Network [OSTI]

WELCOME TO BLUE VIEW VISION INSIGHT! Good news--your vision plan is flexible and easy to use, your discounts, and much more! Blue View Vision InsightSM University of California Student Health Insurance Plan (UC SHIP) 2013/14 Your Blue View Vision Insight Network Blue View Vision Insight offers you

California at Santa Cruz, University of

458

BLUE VIEW VISION INSIGHT! Good news--your vision plan  

E-Print Network [OSTI]

WELCOME TO BLUE VIEW VISION INSIGHT! Good news--your vision plan is flexible and easy to use, your discounts, and much more! Blue View Vision InsightSM University of California Student Health Insurance Plan (UC SHIP) 2012/13 Your Blue View Vision Insight Network Blue View Vision Insight offers you

Barrett, Jeffrey A.

459

A note on QUBO instances defined on Chimera graphs  

E-Print Network [OSTI]

McGeoch and Wang (2013) recently obtained optimal or near-optimal solutions to some quadratic unconstrained boolean optimization (QUBO) problem instances using a 439 qubit D-Wave Two quantum computing system in much less time than with the IBM ILOG CPLEX mixed-integer quadratic programming (MIQP) solver. The problems studied by McGeoch and Wang are defined on subgraphs -- with up to 439 nodes -- of Chimera graphs. We observe that after a standard reformulation of the QUBO problem as a mixed-integer linear program (MILP), the specific instances used by McGeoch and Wang can be solved to optimality with the CPLEX MILP solver in much less time than the time reported in McGeoch and Wang for the CPLEX MIQP solver. However, the solution time is still more than the time taken by the D-Wave computer in the McGeoch-Wang tests.

Sanjeeb Dash

2013-07-01T23:59:59.000Z

460

Linking SARAH and MadGraph using the UFO format  

E-Print Network [OSTI]

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

Staub, Florian

2012-01-01T23:59:59.000Z

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

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

SciTech Connect (OSTI)

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

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

2010-08-01T23:59:59.000Z

462

BrainMap `95 workshop  

SciTech Connect (OSTI)

The fourth annual BrainMap workshop was held at La Mansion del Rio Hotel in San Antonio December 3--4, 1995. The conference title was ``Human Brain Mapping and Modeling.`` The meeting was attended by 137 registered participants and 30 observers from 82 institutions representing 12 countries. The meeting focused on the technical issues associated with brain mapping and modeling. A total of 23 papers were presented covering the following topics: spatial normalization and registration; functional image analysis; metanalysis and modeling; and new horizons in biological databases. The full program with abstracts was available on the Research Imaging Center`s web site. A book will be published by John Wiley and Sons prior to the end of 1998.

NONE

1995-12-31T23:59:59.000Z

463

NEWS & VIEWS Radiation SouRCES  

E-Print Network [OSTI]

NEWS & VIEWS Radiation SouRCES Electrons and lasers sing THz tune gwyn P. Williams is in the Free Bielawski and colleagues describe the ability to coherently control the radiative behaviour of the electrons a bright, tunable source of radiation in the difficult-to-reach terahertz region of the electromagnetic

Loss, Daniel

464

Friction in full view A. P. Merklea  

E-Print Network [OSTI]

Friction in full view A. P. Merklea and L. D. Marksb Materials Science and Engineering proposed friction mechanisms explaining the unique tribological properties of graphite. Wear of graphite chemical or struc- tural information from the interface during a friction experi- ment. Examples

Marks, Laurence D.

465

INVESTIGATION Retrospective View of North American Potato  

E-Print Network [OSTI]

INVESTIGATION Retrospective View of North American Potato (Solanum tuberosum L.) Breeding in the 20, Madison, Wisconsin, 53706 ABSTRACT Cultivated potato (Solanum tuberosum L.), a vegetatively propagated explore the effects of potato breeding at the genome level, we used 8303 single-nucleotide polymorphism

Douches, David S.

466

Project Title: Older People's View of  

E-Print Network [OSTI]

/AGECONCERN/10/NP Age Concern Canterbury provides support for older people, many of whom face loneliness, lowProject Title: Older People's View of Community Support Bachelor of Arts Internship Company information, support and advocacy, to enable older people in Canterbury to have real choices". (http

Hickman, Mark

467

Year in Review 2007 GoddardView  

E-Print Network [OSTI]

Year in Review 2007 GoddardView National Aeronautics and Space Administration www.nasa.gov Volume 4, to stunning images from the highest-resolution satellite data products ever realized, to a visit from Security staff did a marvelous job in planning and coordinating the efforts of at least six different

Christian, Eric

468

Global Food Security Programme Exploring public views  

E-Print Network [OSTI]

Global Food Security Programme ­ Exploring public views #12;©TNS June 2012 -1- Executive Summary significant public policy issues of this century. This scoping study for the Global Food Security programme. The project involved a total of 44 people in a two stage workshop process in London, Edinburgh and Aberystwyth

469

Evolution of self-incompatibility: Early Views  

E-Print Network [OSTI]

Evolution of self-incompatibility: Early Views: Whitehouse (1950): 1. Sudden rise of angiosperms by Whitehouse (1950). Isolation of components of the self-incompatibilities paved the way to study the evolution of SIs Matton et al. (1994): Molecular data supports Bateman. Three self-incompatibility systems

Bhattacharyya, Madan Kumar

470

A PTAS for the Classical Ising Spin Glass Problem on the Chimera Graph Structure  

E-Print Network [OSTI]

We present a polynomial time approximation scheme (PTAS) for the minimum value of the classical Ising Hamiltonian with linear terms on the Chimera graph structure as defined in the recent work of McGeoch and Wang. The result follows from a direct application of the techniques used by Bansal, Bravyi and Terhal who gave a PTAS for the same problem on planar and, in particular, grid graphs. We also show that on Chimera graphs, the trivial lower bound is within a constant factor of the optimum.

Rishi Saket

2013-07-01T23:59:59.000Z

471

Appearance-Based Navigation, Localization, Mapping, and Map Merging for Heterogeneous Teams of Robots  

E-Print Network [OSTI]

merging of an occupancy grid map and an appearance- basedmerging of an occupancy grid map and an appearance- basedW. Burgard. Improved techniques for grid map- ping with rao-

Erinc, Gorkem

2013-01-01T23:59:59.000Z

472

Regular maps with almost Sylow-cyclic automorphism groups, and classification of regular maps with Euler  

E-Print Network [OSTI]

Regular maps with almost Sylow-cyclic automorphism groups, and classification of regular maps with Euler characteristic -p2 Marston Abstract A regular map M is a cellular decomposition of a surface such that its * *automor

Conder, Marston

473

Large Mesh Deformation Using the Volumetric Graph Laplacian  

E-Print Network [OSTI]

VGL can impose volume constraints Volumetric constraints are represented by a quadric energy function volume constraints Volumetric constraints are represented by a quadric energy function #12 destination A quadric energy function is generated ≠ Minimum maps the points to their specified destination

Kazhdan, Michael

474

Unit I-4 More about linear maps 1 More about linear maps  

E-Print Network [OSTI]

Unit I-4 More about linear maps 1 Unit I-4 More about linear maps Unit I-4 More about linear maps 2 Using bases to define linear maps · V, U vector spaces · a unique linear map T: V U is determined · if v = a1v1 + ... + anvn then T(v) = a1T(v1) + ... + anT(vn) Unit I-4 More about linear maps 3 Example

Birkett, Stephen

475

Digital Soil Mapping: Interactions with  

E-Print Network [OSTI]

Chapter 21 Digital Soil Mapping: Interactions with and Applications for Hydropedology J.A. Thompson,1, * S. Roecker,2 S. Grunwald3 and P.R. Owens4 ABSTRACT Spatial information on soils, particularly hydrologic and hydromorphic soil properties, is used to understand and assess soil water retention, flooding

Grunwald, Sabine

476

SIVE Workshop '95 Building Map  

E-Print Network [OSTI]

SIVE Workshop '95 Building Map Workshop . Room W401 in Pappajohn Business Administration Building RIVERSIDE DRIVE (HIGHWAYS 1 & 6) Highways 1 & 6 (from Coralville) Riverside Drive RIVER IOWA ART BUILDING 1234567890 1234567890 1234567890 1234567890 Pappajohn Business Administration Building IMU RAMP DUBUQUE ST

Cremer, James

477

Counting Bitangents with Stable Maps  

E-Print Network [OSTI]

This paper is an elementary introduction to the theory of moduli spaces of curves and maps. As an application to enumerative geometry, we show how to count the number of bitangent lines to a projective plane curve of degree $d$ by doing intersection theory on moduli spaces.

David Ayala; Renzo Cavalieri

2005-12-22T23:59:59.000Z

478

Technical Note Engineering Soils Maps  

E-Print Network [OSTI]

Technical Note Engineering Soils Maps PAUL M. SANTI Department of Geology and Geological database. In this technique, rose-pie charts provide an overall assessment of soils hazards structures such as pipelines, power lines, and roads; and regional evaluations of sources of ag- gregate

479

Homogeneous Factorisations of Graphs and Michael Giudici a, Cai Heng Li a  

E-Print Network [OSTI]

Homogeneous Factorisations of Graphs and Digraphs Michael Giudici a, Cai Heng Li a Primoz Potocnik@maths.uwa.edu.au (Michael Giudici), li@maths.uwa.edu.au (Cai Heng Li), primoz.potocnik@fmf.uni-lj.si (Primoz Preprint

Giudici, Michael

480

Maximal Independent Sets In Graphs With At Most r Goh Chee Ying  

E-Print Network [OSTI]

Maximal Independent Sets In Graphs With At Most r Cycles Goh Chee Ying Department of Mathematics National University of Singapore Singapore goh chee ying@moe.edu.sg Koh Khee Meng Department of Mathematics

Sagan, Bruce

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

Omega: an Overlap-graph de novo Assembler for Meta-genomics  

SciTech Connect (OSTI)

Motivation: Metagenomic sequencing allows reconstruction of mi-crobial genomes directly from environmental samples. Omega (overlap-graph metagenome assembler) was developed here for assembling and scaffolding Illumina sequencing data of microbial communities. Results: Omega found overlaps between reads using a prefix/suffix hash table. The overlap graph of reads was simplified by removing transitive edges and trimming small branches. Unitigs were generat-ed based on minimum cost flow analysis of the overlap graph. Obtained unitigs were merged to contigs and scaffolds using mate-pair information. Omega was compared with two de Bruijn graph assemblers, SOAPdenovo and IDBA-UD, using a publically-available Illumina sequencing dataset of a 64-genome mock com-munity. The assembly results were verified by their alignment with reference genomes. The overall performances of the three assem-blers were comparable and each assembler provided best results for a subset of genomes.

Haider, Bahlul [ORNL; Ahn, Tae-Hyuk [ORNL; Bushnell, Brian [U.S. Department of Energy, Joint Genome Institute; Chai, JJ [ORNL; Copeland, Alex [U.S. Department of Energy, Joint Genome Institute; Pan, Chongle [ORNL

2014-01-01T23:59:59.000Z

482

The Minimum Rank, Inverse Inertia, and Inverse Eigenvalue Problems for Graphs.  

E-Print Network [OSTI]

??For a graph G we define S(G) to be the set of all real symmetric n by n matrices whose off-diagonal zero/nonzero pattern is describedÖ (more)

Kempton, Mark Condie

2010-01-01T23:59:59.000Z

483

Forced Orientation of Graphs B. FARZAD , M. MAHDIAN y , E.S. MAHMOODIAN z ,  

E-Print Network [OSTI]

Forced Orientation of Graphs B. FARZAD #3; , M. MAHDIAN y , E.S. MAHMOODIAN z , A. SABERI x , AND B, Georgia Institute of Technology, Atlanta, USA. (saberi@cc.gatech.edu) { Department of Computer Science

Saberi, Amin

484

A New Approach to Argument by Analogy: Extrapolation and Chain Graphs Daniel Steel  

E-Print Network [OSTI]

A New Approach to Argument by Analogy: Extrapolation and Chain Graphs Daniel Steel Department of Philosophy 503 S Kedzie Hall East Lansing, MI 48824-1032 steel@msu.edu #12;1. Introduction. In order to make

Steel, Daniel

485

THE SPECTRAL RADIUS OF INFINITE GRAPHS N. L. BIGGS, BOJAN MOHAR AND JOHN SHAWE-TAYLOR  

E-Print Network [OSTI]

THE SPECTRAL RADIUS OF INFINITE GRAPHS N. L. BIGGS, BOJAN MOHAR AND JOHN SHAWE-TAYLOR 1 follows from Theorem 2.2. #12;118 N. L. BIGGS, B. MOHAR AND J. SHAWE-TAYLOR 3. The expanding case

Mohar, Bojan

486

Feedback vertex sets and disjoint cycles in planar (di)graphs  

E-Print Network [OSTI]

graph has a feedback vertex set of cardinality at most k then its treewidth. is bounded ... in linear time, and this is used to nd an algorithm computing a feedback.

487

The usefulness of the generalised computational model of Term Graph Rewriting Systems (TGRS) for designing and  

E-Print Network [OSTI]

of programs written in UFO ([8,9]), a state-of-the-art object- oriented functional language, onto equivalent as follows: the next two sections introduce MONSTR and UFO and provide Term Graph Rewriting

Banach, Richard

488

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

E-Print Network [OSTI]

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

Paris-Sud XI, Université de

489

Design techniques for graph-based error-correcting codes and their applications  

E-Print Network [OSTI]

by channels afterward. The discovery of turbo codes and rediscovery of Low Density Parity Check codes (LDPC) have revived the research in channel coding with novel ideas and techniques on code concatenation, iterative decoding, graph-based construction...

Lan, Ching Fu

2006-04-12T23:59:59.000Z

490

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

E-Print Network [OSTI]

Coloring Kk-free intersection graphs of geometric objects in the plane Jacob Fox Department that copies are not made or distributed for profit or commercial advantage and that copies bear this notice

Fox, Jacob

491

Mathematical misconceptions in graphing and central tendency among sixth grade and undergraduate students  

E-Print Network [OSTI]

of the requirements for the degree of MASTER OF SCIENCE August 2002 Major Subject: Curriculum and Instruction MATHEMATICAL MISCONCEPTIONS IN GRAPHING AND CENTRAL TENDENCY AMONG SIXTH GRADE AND UNDERGRADUATE STUDENTS A Thesis by MARY ELIZABETH HAMMER... lfeldt / Head of De artment) August 2002 Major Subject: Curriculum and Instruction 111 ABSTRACT Mathematical Misconceptions in Graphing and Central Tendency Among Sixth Grade and Undergraduate Students. (August 2002) Mary Elizabeth Hammer, B. A...

Hammer, Mary Elizabeth

2002-01-01T23:59:59.000Z

492

Video imaging system and thermal mapping of the molten hearth in an electron beam melting furnace  

SciTech Connect (OSTI)

This project was initiated to develop an enhanced video imaging system for the Liquid Metal Processing Laboratory Electron Beam Melting (EB) Furnace at Sandia and to use color video images to map the temperature distribution of the surface of the molten hearth. In a series of test melts, the color output of the video image was calibrated against temperatures measured by an optical pyrometer and CCD camera viewing port above the molten pool. To prevent potential metal vapor deposition onto line-of-sight optical surfaces above the pool, argon backfill was used along with a pinhole aperture to obtain the vide image. The geometry of the optical port to the hearth set the limits for the focus lens and CCD camera`s field of view. Initial melts were completed with the pyrometer and pinhole aperture port in a fixed position. Using commercially available vacuum components, a second flange assembly was constructed to provide flexibility in choosing pyrometer target sights on the hearth and to adjust the field of view for the focus lens/CCD combination. RGB video images processed from the melts verified that red wavelength light captured with the video camera could be calibrated with the optical pyrometer target temperatures and used to generate temperature maps of the hearth surface. Two color ratio thermal mapping using red and green video images, which has theoretical advantages, was less successful due to probable camera non-linearities in the red and green image intensities.

Miszkiel, M.E.; Davis, R.A.; Van Den Avyle, J.A. [Sandia National Laboratories, Albuquerque, NM (United States)] [and others

1995-12-31T23:59:59.000Z

493

A genetic linkage map of buffelgrass  

E-Print Network [OSTI]

Details of apomixis at levels of the gene, chromosome, and genome can be obtained with a comprehensive restriction fragment length polymorphism (RFLP) linkage map. The objective of this research was construction of a genetic linkage map...

Jessup, Russell William

1999-01-01T23:59:59.000Z

494

Sense of Place Evoked by Interactive Maps  

E-Print Network [OSTI]

Maps are essential tools for providing tourism information. Hence, it is imperative for tourism marketers to understand how tourists perceive spatial information and sense physical places virtually presented in digital maps. Based on sense of place...

Go, Hanyoung

2012-07-16T23:59:59.000Z

495

Digital Mapping Of Structurally Controlled Geothermal Features...  

Open Energy Info (EERE)

to resolve structural patterns and details not shown on pre-existing maps. The cost of digital mapping technology can be relatively inexpensive, yet it can greatly speed the...

496

Optimizing MapReduce for Multicore Architectures  

E-Print Network [OSTI]

MapReduce is a programming model for data-parallel programs originally intended for data centers. MapReduce simplifies parallel programming, hiding synchronization and task management. These properties make it a promising ...

Kaashoek, Frans

2010-05-02T23:59:59.000Z

497

SNL-CRCV Map-580 to CRCV  

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

to be badged Sandia National Laboratories 7011 East Avenue Livermore, CA 94551 Parking Tesla Road CRF Parking 904 906 From OaklandSan Francisco Map Not to Scale Map Not to Scale...

498

Fractional Zaslavsky and Henon Discrete Maps  

E-Print Network [OSTI]

This paper is devoted to the memory of Professor George M. Zaslavsky passed away on November 25, 2008. In the field of discrete maps, George M. Zaslavsky introduced a dissipative standard map which is called now the Zaslavsky map. G. Zaslavsky initialized many fundamental concepts and ideas in the fractional dynamics and kinetics. In this paper, starting from kicked damped equations with derivatives of non-integer orders we derive a fractional generalization of discrete maps. These fractional maps are generalizations of the Zaslavsky map and the Henon map. The main property of the fractional differential equations and the correspondent fractional maps is a long-term memory and dissipation. The memory is realized by the fact that their present state evolution depends on all past states with special forms of weights.

Vasily E. Tarasov

2011-07-26T23:59:59.000Z

499

Best first search algorithm for optimal PLA folding and its implementation on virtual bit map processor  

SciTech Connect (OSTI)

Folding is a PLA optimization technique that constructs a physical PLA that minimizes silicon area by structural reorganization, exploiting a particular input and output format of the PLA. The technique entails the physical splitting of a line into two or more segments so that different signals may share a single vertical (or horizontal) track. The objective of a folding algorithm is to determine the permutations of rows and/or columns that permit a maximal set of columns and/or rows to be implemented in a physical line, such that the original functions can be implemented in the smallest physical array. This thesis also addresses the algorithm design on a bit slice, two dimensional array VLSI computing structure, called the Virtual Bit Map Processor (VBMP), for the implementation of the proposed algorithm. Utilizing the unique features of the VBMP to handle the bit map data, such as virtual data mapping capability, columnwise and rowwise global memories, and regional and data dependent masking schemes for execution control of each processing element, several classes of algorithms are designed, which include data manipulating functions, graph and associative search algorithms. The use of the VBMP system to solve several classes of problems is discussed.

Hwang, S.Y.

1986-01-01T23:59:59.000Z

500

Building Science-Based Climate Maps - Building America Top Innovation...  

Energy Savers [EERE]

Building Science-Based Climate Maps - Building America Top Innovation Building Science-Based Climate Maps - Building America Top Innovation Photo showing climate zone maps based on...