Powered by Deep Web Technologies
Note: This page contains sample records for the topic "time-concentration graphs surface" 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

Appendix D Surface Water and Ground Water Time-Concentration Plots,  

Office of Legacy Management (LM)

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) "ofEarlyEnergyDepartment ofDepartment ofofOxford SiteToledo SiteTonawanda North Site This pageSurface Water

2

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.

3

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

4

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

5

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

6

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

7

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

8

Surface Reconstruction with Feature Preservation based on Graph-cuts  

E-Print Network [OSTI]

features. The effectiveness of the weighted minimal surface model E(S) is examined in the tetrahedral mesh is a very close approximation to the global minimum of EC (S). Various examples show the effectiveness Sciences, Nanyang Technological University, Singapore 637371. E-mail: wanm0003@e.ntu.edu.sg, {desheng,xctai}@ntu

Soatto, Stefano

9

To be published in Computers & Graphics, vol. 28, no. 6, 2004. Point Cloud Surfaces using Geometric Proximity Graphs  

E-Print Network [OSTI]

Proximity Graphs Jan Klein a and Gabriel Zachmann b aHeinz Nixdorf Institute and Institute of Computer@cs.uni-bonn.de (Gabriel Zachmann). In this paper, we present a new definition of a surface over a given point cloud

Behnke, Sven

10

To be published in Computers & Graphics, vol. 28, no. 6, 2004. Point Cloud Surfaces using Geometric Proximity Graphs  

E-Print Network [OSTI]

Proximity Graphs Jan Klein a and Gabriel Zachmann b a Heinz Nixdorf Institute and Institute of Computer@cs.uni­bonn.de (Gabriel Zachmann). In this paper, we present a new definition of a surface over a given point cloud

Zachmann, Gabriel

11

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

12

A notable family of entire intrinsic minimal graph...  

E-Print Network [OSTI]

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

2006-09-09T23:59:59.000Z

13

Some algorithmic results in graph imbeddings  

E-Print Network [OSTI]

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

Joshi, Sanjay

1990-01-01T23:59:59.000Z

14

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

15

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

16

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

17

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

18

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

19

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

20

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

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

Surfaces  

E-Print Network [OSTI]

Surfaces is a collection of four individual essays which focus on the characteristics and tactile qualities of surfaces within a variety of perceived landscapes. Each essay concentrates on a unique surface theme and purpose; ...

DeMaio, Ernest Vincent, 1964-

1989-01-01T23:59:59.000Z

22

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

23

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

24

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

25

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

26

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

27

Cliques in graphs  

E-Print Network [OSTI]

Cliques in Graphs Siu Lun Allan Lo Christs 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

28

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

29

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

30

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

31

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

32

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.

33

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

34

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

35

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

36

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

37

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

38

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

39

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

40

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

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

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

42

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

43

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

44

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

45

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

46

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

47

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

48

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

49

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

50

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

51

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

52

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.

53

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

54

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

55

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

56

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

57

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

58

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

59

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

60

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.

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

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

62

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

63

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

64

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

65

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

66

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

67

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

68

antero-posterior support surface: Topics by E-print Network  

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

perfect graph Laplacians, and computing surface tells us how to remesh shapes by self-supporting quad meshes with planar faces. This guides steelglass application of the...

69

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

70

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

71

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

72

arXiv:cond-mat/0305430v119May2003 Shearing or Compressing a Soft Glass in 2D: Time-concentration superposition  

E-Print Network [OSTI]

arXiv:cond-mat/0305430v119May2003 Shearing or Compressing a Soft Glass in 2D: Time dimensional monolayers should be regarded as being close to a soft glass state. PACS numbers: 68.18.-g, 83.60.bc The rheology of systems with very large surface to vol- ume ratios, such as foams or emulsions

Cicuta, Pietro

73

A Penrose inequality for asymptotically locally hyperbolic graphs  

E-Print Network [OSTI]

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

Levi Lopes de Lima; Frederico Giro

2013-05-14T23:59:59.000Z

74

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

75

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

76

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

77

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.

78

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

79

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.

80

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

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

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

82

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

83

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

2015-01-01T23:59:59.000Z

84

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

85

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

86

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

87

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

88

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

89

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

90

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

91

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

92

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.

93

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

94

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

95

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

96

Proximity Graphs for Defining Surfaces over Point Clouds  

E-Print Network [OSTI]

over Point Clouds Gabriel Zachmann University of Bonn Germany Jan Klein University of Paderborn Germany

Behnke, Sven

97

Global Minimum Cuts in Surface Embedded Graphs Jeff Erickson  

E-Print Network [OSTI]

contract no. DE-AC05-06OR23100. Portions of this work were done while this author was visiting Toyota

Erickson, Jeff

98

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

99

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

100

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

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

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

102

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

103

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

104

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.

105

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

106

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

107

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

108

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

109

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

110

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

111

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

112

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.

113

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

114

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"

115

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

116

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

117

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

118

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

119

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

120

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.

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

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

122

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

123

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

124

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

125

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.

126

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.

127

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

128

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

129

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

130

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

131

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

132

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

133

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

134

WILD QUOTIENT SINGULARITIES OF SURFACES DINO LORENZINI  

E-Print Network [OSTI]

WILD QUOTIENT SINGULARITIES OF SURFACES DINO LORENZINI Abstract. Let (B, MB) be a noetherian in this article three structural properties of wild quotient singularities, which suggest that in general, one exhibit explicitly the resolution graphs of an infinite set of wild Z/2Z-singularities, using some results

Lorenzini, Dino J.

135

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

136

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

137

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

138

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

139

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

140

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

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

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

142

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

143

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

144

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

145

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

146

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

147

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

148

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

149

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

150

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

151

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

152

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

153

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

154

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

155

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

156

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

157

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

158

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

159

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

160

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

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

Eigenfunctions of Unbounded Support for Embedded Eigenvalues of Locally Perturbed Periodic Graph Operators  

E-Print Network [OSTI]

It is known that, if a locally perturbed periodic self-adjoint operator on a combinatorial or quantum graph admits an eigenvalue embedded in the continuous spectrum, then the associated eigenfunction is compactly supported--that is, if the Fermi surface is irreducible, which occurs generically in dimension two or higher. This article constructs a class of operators whose Fermi surface is reducible for all energies by coupling several periodic systems. The components of the Fermi surface correspond to decoupled spaces of hybrid states, and in certain frequency bands, some components contribute oscillatory hybrid states (corresponding to spectrum) and other components contribute only exponential ones. This separation allows a localized defect to suppress the oscillatory (radiation) modes and retain the evanescent ones, thereby leading to embedded eigenvalues whose associated eigenfunctions decay exponentially but are not compactly supported.

Stephen P. Shipman

2014-04-24T23:59:59.000Z

162

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

163

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

164

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

165

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

166

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

167

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

168

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

169

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.

170

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

171

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.

172

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.

173

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

174

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

175

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

176

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

177

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

178

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

179

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.

180

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

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

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

182

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

183

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

184

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.

185

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

186

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

187

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

188

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.

189

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

190

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

191

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

192

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

193

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

194

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

195

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

196

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

197

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

198

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

199

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

200

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

E-Print Network [OSTI]

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

Mousavi, Mohammad

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

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

202

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

203

Surface Soil  

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

Surface Soil Surface Soil We compare local soil samples with samples collected from northern New Mexico locations that are beyond the range of potential influence from normal...

204

Orbifold Riemann surfaces and geodesic algebras  

E-Print Network [OSTI]

We study the Teichm\\"uller theory of Riemann surfaces with orbifold points of order two using the fat graph technique. The previously developed technique of quantization, classical and quantum mapping-class group transformations, and Poisson and quantum algebras of geodesic functions is applicable to the surfaces with orbifold points. We describe classical and quantum braid group relations for particular sets of geodesic functions corresponding to $A_n$ and $D_n$ algebras and describe their central elements for the Poisson and quantum algebras.

L. O. Chekhov

2009-11-01T23:59:59.000Z

205

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

206

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

207

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

208

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

209

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

210

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

211

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

212

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

213

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

214

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

215

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

216

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

217

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.

218

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

219

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

220

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

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

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

222

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

223

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

224

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.

225

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

226

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

227

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

228

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

229

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

230

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

231

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

232

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

233

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

234

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

235

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

236

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

237

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

238

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

239

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

240

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.

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

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

242

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

243

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

244

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

245

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

246

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

247

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

248

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

249

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. Stckmann; U. Kuhl

2014-03-30T23:59:59.000Z

250

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

251

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

252

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

253

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

254

Programmable surfaces  

E-Print Network [OSTI]

Robotic vehicles walk on legs, roll on wheels, are pulled by tracks, pushed by propellers, lifted by wings, and steered by rudders. All of these systems share the common character of momentum transport across their surfaces. ...

Sun, Amy (Amy Teh-Yu)

2012-01-01T23:59:59.000Z

255

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

256

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

257

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

258

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

259

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

260

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

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

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

262

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

263

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

264

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

265

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

266

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

267

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

268

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

269

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

270

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

271

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

272

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

273

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

274

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

275

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

276

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

277

Relation Between Surface Codes and Hypermap-Homology Quantum Codes  

E-Print Network [OSTI]

Recently, a new class of quantum codes based on hypermaps were proposed. These codes are obtained from embeddings of hypergraphs as opposed to surface codes which are obtained from the embeddings of graphs. It is natural to compare these two classes of codes and their relation to each other. In this context two related questions are addressed in this paper: Can the parameters of hypermap-homology codes be superior to those of surface codes and what is precisely the relation between these two classes of quantum codes? We show that a canonical hypermap code is identical to a surface code while a noncanonical hypermap code can be transformed to a surface code by CNOT gates alone. Our approach is constructive; we construct the related surface code and the transformation involving CNOT gates.

Pradeep Sarvepalli

2014-03-14T23:59:59.000Z

278

AiR surface: AiR surface 1  

E-Print Network [OSTI]

AiR surface: 1 PDA AiR surface 1 1: AiR surface () () 2 [1] [2] 3 AiR surface AiR surface surface surface surface 3.1 surface [3]( 3 ) surface 3.2 surface surface AiR surface 4 AiR surface surface AiR surface: Virtual Touch Panel

Tanaka, Jiro

279

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

280

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


281

A 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

282

SIMPLICIAL EMBEDDINGS BETWEEN PANTS GRAPHS Javier Aramayona 1  

E-Print Network [OSTI]

is induced by a surface homeomorphism. More concretely, let be a compact orientable surface whose every, the group of homotopy classes of self-homeomorphisms of . Note that Mod() acts on P() by simplicial]: Theorem 1 ([Mar]). If is a compact, connected, orientable surface with () > 0, then the natural

Aramayona, Javier

283

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

284

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

285

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

286

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

287

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

288

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

289

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

290

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

291

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.

292

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

293

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

294

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

295

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

296

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

297

Exact sampling of graphs with prescribed degree correlations  

E-Print Network [OSTI]

Many real-world networks exhibit correlations between the node degrees. For instance, in social networks nodes tend to connect to nodes of similar degree. Conversely, in biological and technological networks, high-degree nodes tend to be linked with low-degree nodes. Degree correlations also affect the dynamics of processes supported by a network structure, such as the spread of opinions or epidemics. The proper modelling of these systems, i.e., without uncontrolled biases, requires the sampling of networks with a specified set of constraints. We present a solution to the sampling problem when the constraints imposed are the degree correlations. In particular, we develop an efficient and exact method to construct and sample graphs with a specified joint-degree matrix, which is a matrix providing the number of edges between all the sets of nodes of a given degree, for all degrees, thus completely specifying all pairwise degree correlations, and additionally, the degree sequence itself. Our algorithm always pro...

Bassler, Kevin E; Erd?s, Pter L; Mikls, Istvn; Toroczkai, Zoltn

2015-01-01T23:59:59.000Z

298

Hierarchical graphs for better annotations of rule-based models of biochemical systems  

SciTech Connect (OSTI)

In the graph-based formalism of the BioNetGen language (BNGL), graphs are used to represent molecules, with a colored vertex representing a component of a molecule, a vertex label representing the internal state of a component, and an edge representing a bond between components. Components of a molecule share the same color. Furthermore, graph-rewriting rules are used to represent molecular interactions, with a rule that specifies addition (removal) of an edge representing a class of association (dissociation) reactions and with a rule that specifies a change of vertex label representing a class of reactions that affect the internal state of a molecular component. A set of rules comprises a mathematical/computational model that can be used to determine, through various means, the system-level dynamics of molecular interactions in a biochemical system. Here, for purposes of model annotation, we propose an extension of BNGL that involves the use of hierarchical graphs to represent (1) relationships among components and subcomponents of molecules and (2) relationships among classes of reactions defined by rules. We illustrate how hierarchical graphs can be used to naturally document the structural organization of the functional components and subcomponents of two proteins: the protein tyrosine kinase Lck and the T cell receptor (TCR)/CD3 complex. Likewise, we illustrate how hierarchical graphs can be used to document the similarity of two related rules for kinase-catalyzed phosphorylation of a protein substrate. We also demonstrate how a hierarchical graph representing a protein can be encoded in an XML-based format.

Hu, Bin [Los Alamos National Laboratory; Hlavacek, William [Los Alamos National Laboratory

2009-01-01T23:59:59.000Z

299

How the permutation of edges of a metric graph affects the number of points moving along the edges  

E-Print Network [OSTI]

We consider a dynamical system on a metric graph, that corresponds to a semiclassical solution of a time-dependent Schr\\"odinger equation. We omit all details concerning mathematical physics and work with a purely discrete problem. We find a weak inequality representation for the number of points coming out of the vertex of an arbitrary tree graph. We apply this construction to an "H-junction" graph. We calculate the difference between numbers of moving points corresponding to the permutation of edges. Then we find a symmetrical difference of the number of points moving along the edges of a metric graph.

V. L. Chernyshev; A. A. Tolchennikov

2014-10-18T23:59:59.000Z

300

Surface Energy,Surface Energy, Surface Tension & Shape of CrystalsSurface Tension & Shape of Crystals  

E-Print Network [OSTI]

Surface Energy,Surface Energy, Surface Tension & Shape of CrystalsSurface Tension & Shape of shapes of crystals are important: (i) growth shape and (ii) equilibrium shape Surface/interface energy surfaces. The joining of two phases creates an interface. (Two orientations of the same crystalline phase

Subramaniam, Anandh

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

Decay of Correlations for the Hardcore Model on the $d$-regular Random Graph  

E-Print Network [OSTI]

A key insight from statistical physics about spin systems on random graphs is the central role played by Gibbs measures on trees. We determine the local weak limit of the hardcore model on random regular graphs asymptotically until just below its condensation threshold, showing that it converges in probability locally in a strong sense to the free boundary condition Gibbs measure on the tree. As a consequence we show that the reconstruction threshold on the random graph, indicative of the onset of point to set spatial correlations, is equal to the reconstruction threshold on the $d$-regular tree for which we determine precise asymptotics. We expect that our methods will generalize to a wide range of spin systems for which the second moment method holds.

Nayantara Bhatnagar; Allan Sly; Prasad Tetali

2014-05-23T23:59:59.000Z

302

17Solar Storm Energy and Pie Graphs The pie charts below show approximately how various forms of energy  

E-Print Network [OSTI]

17Solar Storm Energy and Pie Graphs The pie charts below show approximately how various forms of energy are involved in a solar flare. Flares occur when stored magnetic energy is suddenly released magnetic energy Graph of solar flare energy forms Problem 1 - About what percentages of each of the four

303

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

304

Graph Data Format Workshop Report Ulrik Brandes 1 , M. Scott Marshall 2 , and Stephen C. North 3  

E-Print Network [OSTI]

Graph Data Format Workshop Report Ulrik Brandes 1 , M. Scott Marshall 2 , and Stephen C. North 3 1, The Netherlands. scott@cwi.nl 3 AT&T Research, 180 Park Ave., Bldg. 103, Florham Park, NJ 07932-0971, U.S.A. north workshop was held in conjunction with Graph Drawing 2000. The participants identi#12;ed requirements

Brandes, Ulrik

305

The Elusive Hamilton Problem for Cayley Graphs--an 28th Clemson Mini-Conference on Discrete Mathematics and Algorithms  

E-Print Network [OSTI]

The Elusive Hamilton Problem for Cayley Graphs--an Overview 28th Clemson Mini State University October 3, 2013 Erik Westlund (KSU) Elusive Hamilton Problem for Cayley Graphs October} Cay(Z12; {2, 3, 4} ) Cay(D4; {a, b} ) Cay(Z4 2; S ) Erik Westlund (KSU) Elusive Hamilton Problem

Goddard, Wayne

306

Analyzing the Facebook friendship graph S. Catanese1, P. De Meo2, E. Ferrara3, G. Fiumara1  

E-Print Network [OSTI]

Analyzing the Facebook friendship graph S. Catanese1, P. De Meo2, E. Ferrara3, G. Fiumara1 1Dept Internet 20 September 2010, Berlin Catanese, De Meo, Ferrara, Fiumara () Analyzing the Facebook friendship Issues Catanese, De Meo, Ferrara, Fiumara () Analyzing the Facebook friendship graph MIFI 2010, 20

Ferrara, Emilio

307

In "Handbook of Mathematical Models in Computer Vision", Springer, 2006 p.1 Graph Cuts in Vision and Graphics  

E-Print Network [OSTI]

and Graphics: Theories and Applications Yuri Boykov and Olga Veksler Computer Science, The University the corresponding graph. Thus, many applications in vision and graphics use min-cut algorithms as a tool for computing optimal hypersurfaces. Secondly, graph-cuts also work as a powerful energy minimization tool

Boykov, Yuri

308

Improved vertex cover algorithms for fixed genus graphs through genus reduction and planar separation  

E-Print Network [OSTI]

, problems are restricted to decision problems? problems with yes/no answers. The VERTEX CovER problem formulated as a decision problem is "Given a graph G = (V, E) and positive cover k, does there exist a vertex cover of G whose size is at most k...: "Given a graph G = (V, E) and parameter k, does there exist a vertex cover C c: V for G such that C~ & k?" As a decision problem, Karp first demonstrated quantitatively how "hard" VERTEx CovER is to solve by showing that vERTEx covER is NP-complete [16...

Gupton, Kevin Thomas

2003-01-01T23:59:59.000Z

309

Automation of the Dipole Subtraction Method in MadGraph/MadEvent  

E-Print Network [OSTI]

We present the implementation of the dipole subtraction formalism for the real radiation contributions to any next-to-leading order QCD process in the MadGraph/MadEvent framework. Both massless and massive dipoles are considered. Starting from a specific (n+1)-particle process the package provides a Fortran code for all possible dipoles to all Born processes that constitute the subtraction term to the (n+1)-particle process. The output files are given in the usual "MadGraph StandAlone" style using helicity amplitudes.

Rikkert Frederix; Thomas Gehrmann; Nicolas Greiner

2008-08-15T23:59:59.000Z

310

Multiclass Diffuse Interface Models for Semi-Supervised Learning on Graphs  

E-Print Network [OSTI]

We present a graph-based variational algorithm for multiclass classification of high-dimensional data, motivated by total variation techniques. The energy functional is based on a diffuse interface model with a periodic potential. We augment the model by introducing an alternative measure of smoothness that preserves symmetry among the class labels. Through this modification of the standard Laplacian, we construct an efficient multiclass method that allows for sharp transitions between classes. The experimental results demonstrate that our approach is competitive with the state of the art among other graph-based algorithms.

Garcia-Cardona, Cristina; Percus, Allon G

2012-01-01T23:59:59.000Z

311

surface science | EMSL  

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

surface science surface science Leads No leads are available at this time. Nonlinear Photoemission Electron Micrographs of Plasmonic Nanoholes in Gold Thin Films. Abstract:...

312

Exploring Aggregate Effect with Weighted Transcoding Graphs for Efficient Cache Replacement in Transcoding Proxies  

E-Print Network [OSTI]

Exploring Aggregate Effect with Weighted Transcoding Graphs for Efficient Cache Replacement University Taipei, Taiwan, ROC E-mail: {cychang@arbor.ee.ntu.edu.tw; mschen@cc.ee.ntu.edu.tw} Abstract This paper explores the aggregate effect when caching multiple versions of the same Web object

Chen, Ming-Syan

313

Optimizing Graph Algorithms for Improved Cache Performance*+ Joon-Sang Park  

E-Print Network [OSTI]

. For these algorithms, we demonstrate up to 2? improvement in real execution time by using a simple cache- friendly graphs. We show performance improvements of 2? - 3? in real execution time by using the technique N and C are the problem size and cache size respectively. Experimental results show that this cache

Prasanna, Viktor K.

314

A Genetic Algorithm based Approach for Multi-Objective Data-Flow Graph Optimization  

E-Print Network [OSTI]

that the correct- ness of algebraic transformations realized by the underlying genetic operators selection shown for power optimization. In order to avoid inferior results caused by the counteracting demandsA Genetic Algorithm based Approach for Multi-Objective Data-Flow Graph Optimization Birger Landwehr

Coello, Carlos A. Coello

315

On the Number of Cycles in Planar Graphs Kevin Buchin1  

E-Print Network [OSTI]

technique. Combining both, we show that there is no planar graph with more than 2.8927n simple cycles cycles can be obtained by combining an upper bound on the number of triangulations with an upper bound spanning cycles on n points with an alternative approach. This bound is better than the combined bound

Fuchs, Gunter

316

Development of the TIGRE This describes the TIGRE method for combinator graph reduction.  

E-Print Network [OSTI]

been previously implemented for the G-Ma- chine graph reduction implementation on a VAX (Peyton Jones 1987). In VAX assembly language, unwinding a node while traversing the stack requires four instructions, on average, processing nodes for stack unwinding costs: (4 * 1.38) + 7 = 12.52 VAX instructions per

Koopman, Philip

317

Planar Hop Spanners for Unit Disk Graphs Nicolas Catusse, Victor Chepoi, and Yann Vax`es  

E-Print Network [OSTI]

Planar Hop Spanners for Unit Disk Graphs Nicolas Catusse, Victor Chepoi, and Yann Vax`es Marseille Cedex 9, France {nicolas.catusse,victor.chepoi,yann.vaxes}@lif.univ-mrs.fr Abstract. The simplest;2 Nicolas Catusse, Victor Chepoi, and Yann Vax`es factors (see [9], for instance), the problem

Chepoi, Victor

318

Muller's ratchet in random graphs and scale-free networks Paulo R. A. Campos,1,  

E-Print Network [OSTI]

Muller's ratchet in random graphs and scale-free networks Paulo R. A. Campos,1, * Jaime Combadão,2 manuscript received 1 September 2006; published 4 October 2006 Muller's ratchet is an evolutionary process study the speed of Muller's ratchet in a population subdivided into many small subpopulations connected

Dionisio, Francisco

319

Absolutely continuous spectrum implies ballistic transport for quantum particles in a random potential on tree graphs  

SciTech Connect (OSTI)

We discuss the dynamical implications of the recent proof that for a quantum particle in a random potential on a regular tree graph absolutely continuous (ac) spectrum occurs non-perturbatively through rare fluctuation-enabled resonances. The main result is spelled in the title.

Aizenman, Michael [Departments of Physics and Mathematics, Princeton University, Princeton, New Jersey 08544 (United States); Warzel, Simone [Zentrum Mathematik, TU Munich, Boltzmannstr. 3, 85747 Garching (Germany)

2012-09-15T23:59:59.000Z

320

Fully Distributed Trust Model based on Trust Graph for Mobile Ad hoc Networks  

E-Print Network [OSTI]

Fully Distributed Trust Model based on Trust Graph for Mobile Ad hoc Networks Mawloud Omar, Yacine University of Technology, France. bouabdal@hds.utc.fr Abstract A mobile ad hoc network (MANET) is a wireless that defines who trusts who and how. Our work aims to provide a fully distributed trust model for mobile ad hoc

Paris-Sud XI, Université de

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

A Methodology for Empirical Analysis of Brain Connectivity through Graph Mining  

E-Print Network [OSTI]

A Methodology for Empirical Analysis of Brain Connectivity through Graph Mining Jiang Bian, Josh M Informatics Brain Imaging Research Center, Psychiatric Research Institute University of Arkansas for Medical and functional brain connectivity networks and has helped researchers conceive the effects of neurological

Xie, Mengjun

322

Intro. to Linear Algebra 250C Extra Credit Project 2 ---Graphs and Markov Processes  

E-Print Network [OSTI]

of the week? How do you write this in matrix form? Use MATLAB to do the calculations. We are now interested A is called the transition matrix for the process. 9. Using MATLAB, find A k for k = 1, 2, 3, 5, 10, 20, 50Intro. to Linear Algebra 250­C Extra Credit Project 2 --- Graphs and Markov Processes Introduction

Woodward, Christopher

323

Intro. to Linear Algebra 250-C Extra Credit Project 2 --Graphs and Markov Processes  

E-Print Network [OSTI]

that each column of A should sum up to 1 (why?). Use MATLAB to create the vectors x, y and the matrix A. 3 of the week? How do you write this in matrix form? Use MATLAB to do the calculations. We are now interestedIntro. to Linear Algebra 250-C Extra Credit Project 2 -- Graphs and Markov Processes Introduction

Woodward, Christopher

324

Novel approaches for solving large-scale optimization problems on graphs  

E-Print Network [OSTI]

. . . . . . . . . . . . . . . . . . . . . . . 97 8 Parameters of calculated weighted diversified portfolios correspon- ding to 500-day trading periods . . . . . . . . . . . . . . . . . . . . . 110 9 Graph parameters for small test-bed . . . . . . . . . . . . . . . . . . 126 10 Number of k... . . . . . . . . . . . . . . . . . . 29 5 Crown structure . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 44 6 t-hat structure . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 50 7 2-club and 2-clique example . . . . . . . . . . . . . . . . . . . . . . . 54 8...

Trukhanov, Svyatoslav

2009-05-15T23:59:59.000Z

325

Time-varying Reeb Graphs for Continuous Space-Time Data Herbert Edelsbrunner  

E-Print Network [OSTI]

and/or a fee. SOCG '04 New York City, New York USA Copyright 2004 ACM ?? . . . $4.99. of dataTime-varying Reeb Graphs for Continuous Space-Time Data Herbert Edelsbrunner , John Harer , Ajith the evolving sequence into a single, partially persistent data structure. We envision this data structure

Pascucci, Valerio

326

1 Introduction 1 1.1 Graphs, digraphs, and homomorphisms 1  

E-Print Network [OSTI]

CONTENTS 1 Introduction 1 1.1 Graphs, digraphs, and homomorphisms 1 1.2 Homomorphisms preserve adjacency 3 1.3 Homomorphisms generalize colourings 6 1.4 The existence of homomorphisms 10 1.5 Homomorphisms generalize isomorphisms 16 1.6 Homomorphic equivalence 18 1.7 The composition of homomorphisms 20

Hell, Pavol

327

Graphs of models for exploring design spaces in the engineering of Human Computer Interaction  

E-Print Network [OSTI]

Graphs of models for exploring design spaces in the engineering of Human Computer Interaction +33 (0)4 76 51 48 54 gaelle.calvary@imag.fr ABSTRACT Model Driven Engineering (MDE) has focused creativity in the early phases. Our research aims at stretching MDE all over the design process including

Paris-Sud XI, Université de

328

Kronk, Hudson V., Associate Professor, PhD, 1964, Michigan State University: Graph theory.  

E-Print Network [OSTI]

227 Kronk, Hudson V., Associate Professor, PhD, 1964, Michigan State University: Graph theory) Schick, Anton, Associate Professor, PhD, 1983, Michigan State University: Statistics, probability. (1984, conformal field theory. (1979) Ferry, Steven, Distinguished Professor, PhD, 1973, University of Michigan

Suzuki, Masatsugu

329

Hamilton Cycles which Extend Transposition Matchings in Cayley Graphs of S n  

E-Print Network [OSTI]

Hamilton Cycles which Extend Transposition Matchings in Cayley Graphs of S n Frank Ruskey \\Lambda matching M b in Cay(B : S n ). We show here when n ? 4 that for any b 2 B, there is a Hamilton cycle in Cay only a Hamilton path, the question is still open and is, in fact, a special case of the more general

Savage, Carla D.

330

Hamilton Cycles Containing Randomly Selected Edges in Random Regular Graphs \\Lambda  

E-Print Network [OSTI]

Hamilton Cycles Containing Randomly Selected Edges in Random Regular Graphs \\Lambda R. W. Robinson oriented root edges have been randomly specified for the cycle to contain. The Hamilton cycle must be orientable to agree with all of the orientations on the j root edges. It is shown that the requisite Hamilton

Robinson, Robert W.

331

EDGE-DISJOINT HAMILTON CYCLES IN RANDOM GRAPHS FIACHRA KNOX, DANIELA KUHN AND DERYK OSTHUS  

E-Print Network [OSTI]

EDGE-DISJOINT HAMILTON CYCLES IN RANDOM GRAPHS FIACHRA KNOX, DANIELA K¨UHN AND DERYK OSTHUS a collection of (G)/2 edge-disjoint Hamilton cycles in G Gn,p, plus an additional edge-disjoint matching of Frieze and Krivelevich. 1. Introduction The question of how many edge-disjoint Hamilton cycles one can

Kühn, Daniela

332

The critical group of a graph Texas State U., San Marcos, March 21th, 2014.  

E-Print Network [OSTI]

-firing game (Björner-Lovasz-Shor, Gabrielov, Biggs); #12;This talk is about the critical group, a finite-Tang-Wiesenfeld, Dhar); its combinatorial variant: the Chip-firing game (Björner-Lovasz-Shor, Gabrielov, Biggs-Lovasz-Shor, Gabrielov, Biggs); in arithmetic geometry: Picard group, graph Jacobian (Lorenzini). We'll consider

Sin, Peter

333

The critical group of a graph Millican Colloquium, UNT, March 24th, 2014.  

E-Print Network [OSTI]

-firing game (Björner-Lovasz-Shor, Gabrielov, Biggs); #12;This talk is about the critical group, a finite-Tang-Wiesenfeld, Dhar); its combinatorial variant: the Chip-firing game (Björner-Lovasz-Shor, Gabrielov, Biggs-Lovasz-Shor, Gabrielov, Biggs); in arithmetic geometry: Picard group, graph Jacobian (Lorenzini). We'll consider

Sin, Peter

334

A functional central limit theorem for interacting particle systems on transitive graphs  

E-Print Network [OSTI]

A finite range interacting particle system on a transitive graph is considered. Assuming that the dynamics and the initial measure are invariant, the normalized empirical distribution process converges in distribution to a centered diffusion process. As an application, a central limit theorem for certain hitting times, interpreted as failure times of a coherent system in reliability, is derived.

Paul Doukhan; Gabriel Lang; Sana Louhichi; Bernard Ycart

2007-04-12T23:59:59.000Z

335

NLS ground states on graphs Riccardo Adami # , Enrico Serra + , Paolo Tilli  

E-Print Network [OSTI]

Abstract We investigate the existence of ground states for the subcritical NLS energy on metric graphs. In particular, we find out a topologi­ cal 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

336

The Effect of Neighbor Graph Connectivity on Coverage Redundancy in Wireless Sensor Networks  

E-Print Network [OSTI]

that the network field is covered by these nodes at the desired ratio while the usage of the energy by the sensorThe Effect of Neighbor Graph Connectivity on Coverage Redundancy in Wireless Sensor Networks problems in wireless sensor networks. To reduce the energy consumption that arises when the high number

Varela, Carlos

337

A Discriminative Model-Constrained Graph Cuts Approach to Fully Automated Pediatric  

E-Print Network [OSTI]

A Discriminative Model-Constrained Graph Cuts Approach to Fully Automated Pediatric Brain Tumor of Radiology, University Medical Center, Erlangen, Germany 4 Siemens, CT SE SCR 2, Erlangen, Germany Abstract. In this paper we present a fully automated approach to the segmentation of pediatric brain tumors in multi

Carneiro, Gustavo

338

LOOP TRANSFORMATIONS FOR INTERFACE-BASED HIERARCHIES IN SDF GRAPHS Jonathan Piat1  

E-Print Network [OSTI]

LOOP TRANSFORMATIONS FOR INTERFACE-BASED HIERARCHIES IN SDF GRAPHS Jonathan Piat1 , Shuvra S processing (DSP) applica- tions. A restricted version of data-flow, termed synchronous data-flow (SDF of hierarchy (Interface-based SDF) has been proposed allowing more expressivity while maintaining its

Bhattacharyya, Shuvra S.

339

Back to Basics: Homogeneous Representations of Multi-Rate Synchronous Dataflow Graphs  

E-Print Network [OSTI]

Synchronous dataflow (SDF) [1] is a popular class of models of computation and is used to model the temporal are particularly useful in the design of systems where worst-case guarantees on performance must be given. An SDF and processing elements. The class of SDF graphs that we focus on in this paper are called multi-rate SDF (MRSDF

Al Hanbali, Ahmad

340

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 Giro

2012-06-25T23:59:59.000Z

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

Factor Graphs for Universal Portfolios Andrew J. Bean and Andrew C. Singer  

E-Print Network [OSTI]

transaction costs while taking advantage of side information. We introduce factor graphs as a computational of sequentially investing in a stock market where we have access to a side information sequence and we also must the ratio of the opening price of the jth stock on the (t + 1)th trading period to the opening price

Singer, Andrew C

342

Semantics Guided Filtering of Combinatorial Graph Transformations in Declarative Equation-Based Languages.  

E-Print Network [OSTI]

required to get the simulation working. The paper is organized as follows: Section 2 introduces Modelica, a new equation-based declarative language. Some specific Modelica language constructs necessary using Modelica. Section 5 gives some preliminary definitions related to the concept of bipartite graphs

Burns, Peter

343

Roots xk(y) of a formal power series with applications to graph enumeration  

E-Print Network [OSTI]

the n(y) are formal power series with invertible constant term (coefficients lying in a commutative ringRoots xk(y) of a formal power series f(x, y) = n=0 an(y) xn with applications to graph enumeration and q-series Alan Sokal New York University / University College London Lectures at Queen Mary -- 11, 18

Banaji,. Murad

344

Affine Nested Loop Programs and their Binary Parameterized Dataflow Graph Counterparts  

E-Print Network [OSTI]

Affine Nested Loop Programs and their Binary Parameterized Dataflow Graph Counterparts Ed F Parameterized static affine nested loop programs can be automatically converted to input-output equivalent Kahn affine nested loop programs which are nested loop programs in which the loop boundaries, the conditions

Bhattacharyya, Shuvra S.

345

VIDEO SUMMARIZATION BY SPATIAL-TEMPORAL GRAPH OPTIMIZATION Shi Lu, Michael R. Lyu, Irwin King  

E-Print Network [OSTI]

VIDEO SUMMARIZATION BY SPATIAL-TEMPORAL GRAPH OPTIMIZATION Shi Lu, Michael R. Lyu, Irwin King SAR {slu, lyu, king}@cse.cuhk.edu.hk ABSTRACT In this paper we present a novel approach for video sum-temporal content cov- erage and visual coherence of the video summary. The ap- proach has three stages. First

King, Kuo Chin Irwin

346

Introduction to Physical Systems Modelling with Bond Graphs Jan F. Broenink  

E-Print Network [OSTI]

on energy and energy exchange. Analogies between domains are more than just equations being analogous and directed graphs, in which the vertices represent submodels and the edges represent an ideal energy connection between power ports. The vertices are idealised descriptions of physical phenomena

Batlle, Carles

347

Finite propagation speed for solutions of the wave equation on metric graphs  

E-Print Network [OSTI]

We provide a class of self-adjoint Laplace operators on metric graphs with the property that the solutions of the associated wave equation satisfy the finite propagation speed property. The proof uses energy methods, which are adaptions of corresponding methods for smooth manifolds.

Vadim Kostrykin; Jrgen Potthoff; Robert Schrader

2011-06-04T23:59:59.000Z

348

Linear Prediction Models with Graph Regularization for Web-page Categorization  

E-Print Network [OSTI]

! Inc. New York City, NY, USA tzhang@yahoo-inc.com Alexandrin Popescul Yahoo! Inc. Santa Clara, CA, USA popescul@yahoo- inc.com Byron Dom Yahoo! Inc. Santa Clara, CA, USA bdom@yahoo-inc.com ABSTRACT We present that classes of graph neighbors seeded with a text only classifier and further re- fined with an EM

Zhang, Tong

349

Graph-based Criteria for Spectrum-Aware Clustering in Cognitive Radio Milan Bradonjica, Loukas Lazosb,  

E-Print Network [OSTI]

Graph-based Criteria for Spectrum-Aware Clustering in Cognitive Radio Networks Milan Bradonji, Arizona Email: llazos@ece.arizona.edu Abstract Cognitive radios (CRs) can exploit vacancies in licensed. 1. Introduction Under a fixed spectrum allocation paradigm, frequency bands are licensed

Lazos, Loukas

350

The stackelberg minimum spanning tree game on planar and bounded-treewidth graphs  

E-Print Network [OSTI]

The Stackelberg Minimum Spanning Tree Game is a two-level combinatorial pricing problem introduced at WADS07. The game is played on a graph, whose edges are colored either red or blue, and where the red edges have a given ...

Cardinal, Jean

351

A Distributed Polylogarithmic Time Algorithm for Self-Stabilizing Skip Graphs  

E-Print Network [OSTI]

A Distributed Polylogarithmic Time Algorithm for Self-Stabilizing Skip Graphs Riko Jacob Dept. Computer Science Technische Universität München D-85748 Garching bei München, Germany jacob or commercial advantage and that copies bear this notice and the full citation on the first page. To copy

Richa, Andrea Werneck

352

Design and Verification of Instantiable Compliance Rule Graphs in Process-Aware  

E-Print Network [OSTI]

against imposed compliance rules. Tab. 1 summarizes quality compliance rules imposed on the software. Nevertheless, for quality assurance, it could be desired to verify c2 over the development process. ThusDesign and Verification of Instantiable Compliance Rule Graphs in Process-Aware Information Systems

Pfeifer, Holger

353

Predicting Protein Folds with Structural Repeats Using a Chain Graph Model  

E-Print Network [OSTI]

Predicting Protein Folds with Structural Repeats Using a Chain Graph Model Yan Liu yanliu, Carnegie Mellon University, Pittsburgh, PA 15213 USA Abstract Protein fold recognition is a key step to to accurately identify protein folds aris- ing from typical spatial arrangements of well-defined secondary

Xing, Eric P.

354

On covering planar graphs with a fixed number of balls Victor Chepoi, Bertrand Estellon, Yann Vax`es  

E-Print Network [OSTI]

On covering planar graphs with a fixed number of balls Victor Chepoi, Bertrand Estellon, Yann Vax`es´editerran´ee, F-13288 Marseille Cedex 9, France, {chepoi,estellon,vaxes}@lif.univ-mrs.fr Abstract. In this note

Chepoi, Victor

355

Characterization of Trivalent Graphs with Minimal Eigenvalue Gap* Clemens Brand,a Barry Guiduli,b,** and Wilfried Imrichc,***  

E-Print Network [OSTI]

Characterization of Trivalent Graphs with Minimal Eigenvalue Gap* Clemens Brand,a Barry Guiduli is the mirror image of one of these blocks. Each interior block is of the type: or (2) We will refer

Babai, László

356

Lower bounds on the obstacle number of graphs Padmini Mukkamala1, Janos Pach2, and Domotor Palvolgyi3  

E-Print Network [OSTI]

Lower bounds on the obstacle number of graphs Padmini Mukkamala1, J´anos Pach2, and D¨om¨ot¨or P are extensively studied and used in computational geometry, robot motion planning, computer vision, sensor

Pach, János

357

The relationship between graphing calculator use and the development of classroom norms in an exemplay teacher's college algebra course  

E-Print Network [OSTI]

to explore the question: What happens when an exemplary teacher uses graphing calculators in a college algebra class? The purposively selected participants were the teacher and eleven students of a Texas community college algebra course. All 29 classes...

Gerren, Sally Sue

2008-10-10T23:59:59.000Z

358

Discrete Mathematics and Theoretical Computer Science DMTCS vol. 12:3, 2010, 6374 Covering codes in Sierpinski graphs  

E-Print Network [OSTI]

Discrete Mathematics and Theoretical Computer Science DMTCS vol. 12:3, 2010, 63­74 Covering codesth May 2010. For a graph G and integers a and b, an (a, b)-code of G is a set C of vertices. In this paper we classify integers a and b for which there exist (a, b)-codes in Sierpi´nski graphs. Keywords

Paris-Sud XI, Université de

359

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

360

surface chemistry | EMSL  

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

surface chemistry surface chemistry Leads No leads are available at this time. FeSSZ-13 as an NH3-SCR Catalyst: A Reaction Kinetics and FTIRMssbauer Spectroscopic Study....

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

Instability of Bose-Einstein condensation on quantum graphs under repulsive perturbations  

E-Print Network [OSTI]

In this Note we investigate Bose-Einstein condensation in interacting quantum many-particle systems on graphs. We extend previous results obtained for particles on an interval and show that even arbitrarily small repulsive two-particle interactions destroy a condensate in the non-interacting Bose gas. Our results also cover singular two-particle interactions, such as the well-known Lieb-Lininger model, in the thermodynamic limit.

Jens Bolte; Joachim Kerner

2014-11-26T23:59:59.000Z

362

Dynamic Motion Graphs Bjrn Krger1, Arno Zinke2, Andreas Weber1  

E-Print Network [OSTI]

Dynamic Motion Graphs Björn Krüger1, Arno Zinke2, Andreas Weber1 1Institute of Computer Science II, University of Bonn 2GfaR mbH, Bonn e-mail: {kruegerb, zinke, weber}@cs.uni-bonn.de Introduction Method result. [KTWZ10] KR?GER, B., TAUTGES, J., WEBER, A., AND ZINKE, A. Fast local and global similarity

Bonn, Universität

363

ISOPERIMETRIC CONSTANT OF A k-REGULAR GRAPH (A NOTE ON A THEOREM OF  

E-Print Network [OSTI]

ISOPERIMETRIC CONSTANT OF A k-REGULAR GRAPH (A NOTE ON A THEOREM OF BIGGS, MOHAR, AND SHAWE.2 in the paper [BMS] of Biggs, Mohar, and Shawe-Taylor we have instead of (1) and (2): i #21; 4(1 #26;) , #26 that #26; #20; q 1 i 2 k 2 . References BMS. N. Biggs, B. Mohar, J. Shawe-Taylor, The spectral radius of in

Smirnova-Nagnibeda, Tatiana

364

Efficient Graph Based Assembly of Short-Read Sequences on Hybrid Core Architecture  

SciTech Connect (OSTI)

Advanced architectures can deliver dramatically increased throughput for genomics and proteomics applications, reducing time-to-completion in some cases from days to minutes. One such architecture, hybrid-core computing, marries a traditional x86 environment with a reconfigurable coprocessor, based on field programmable gate array (FPGA) technology. In addition to higher throughput, increased performance can fundamentally improve research quality by allowing more accurate, previously impractical approaches. We will discuss the approach used by Convey?s de Bruijn graph constructor for short-read, de-novo assembly. Bioinformatics applications that have random access patterns to large memory spaces, such as graph-based algorithms, experience memory performance limitations on cache-based x86 servers. Convey?s highly parallel memory subsystem allows application-specific logic to simultaneously access 8192 individual words in memory, significantly increasing effective memory bandwidth over cache-based memory systems. Many algorithms, such as Velvet and other de Bruijn graph based, short-read, de-novo assemblers, can greatly benefit from this type of memory architecture. Furthermore, small data type operations (four nucleotides can be represented in two bits) make more efficient use of logic gates than the data types dictated by conventional programming models.JGI is comparing the performance of Convey?s graph constructor and Velvet on both synthetic and real data. We will present preliminary results on memory usage and run time metrics for various data sets with different sizes, from small microbial and fungal genomes to very large cow rumen metagenome. For genomes with references we will also present assembly quality comparisons between the two assemblers.

Sczyrba, Alex; Pratap, Abhishek; Canon, Shane; Han, James; Copeland, Alex; Wang, Zhong; Brewer, Tony; Soper, David; D'Jamoos, Mike; Collins, Kirby; Vacek, George

2011-03-22T23:59:59.000Z

365

Memorial University of Newfoundland Department of Mathematics and Statistics Bellman's Algorithm for Acyclic Directed Graphs  

E-Print Network [OSTI]

time O(n 2 ). And each iteration of step (3) takes times O(n); with up to n iterations, step (3. A canonical ordering of the vertices is generated by the following algorithm (the output of which is either of a directed graph takes time O(n 2 ). How- ever, the algorithm presented has time O(n 3 ). In step (2), which

deYoung, Brad

366

Resumes de textes par extraction de phrases, algorithmes de graphe et energie textuelle  

E-Print Network [OSTI]

R´esum´es de textes par extraction de phrases, algorithmes de graphe et ´energie textuelle Silvia. Lorsqu'il s'agit de r´esumer automatiquement une large quantit´e de texte, l'approche actuellement la´en´eralement effectu´es sur la matrice mots ? phrases. Le r´esum´e reprend alors les n phrases les plus lourdes dans l

San-Juan, Eric

367

Experimental investigation of Wigner's reaction matrix for irregular graphs with absorption  

E-Print Network [OSTI]

We use tetrahedral microwave networks consisting of coaxial cables and attenuators connected by T-joints to make an experimental study of Wigner's reaction K matrix for irregular graphs in the presence of absorption. From measurements of the scattering matrix S for each realization of the microwave network we obtain distributions of the imaginary and real parts of K. Our experimental results are in good agreement with theoretical predictions.

Oleh Hul; Oleg Tymoshchuk; Szymon Bauch; Peter M. Koch; Leszek Sirko

2009-03-12T23:59:59.000Z

368

SURFACE TENSION DRIVEN CONVECTION  

E-Print Network [OSTI]

SURFACE TENSION DRIVEN CONVECTION DIJKSTRA, SENGUL, WANG INTRODUCTION LINEAR THEORY MAIN THEOREMS CONCLUDING REMARKS DYNAMIC TRANSITIONS OF SURFACE TENSION DRIVEN CONVECTION H.Dijkstra T. Sengul S. Wang #12;SURFACE TENSION DRIVEN CONVECTION DIJKSTRA, SENGUL, WANG INTRODUCTION LINEAR THEORY MAIN THEOREMS

Wang, Shouhong

369

Surface cleanliness measurement procedure  

DOE Patents [OSTI]

A procedure and tools for quantifying surface cleanliness are described. Cleanliness of a target surface is quantified by wiping a prescribed area of the surface with a flexible, bright white cloth swatch, preferably mounted on a special tool. The cloth picks up a substantial amount of any particulate surface contamination. The amount of contamination is determined by measuring the reflectivity loss of the cloth before and after wiping on the contaminated system and comparing that loss to a previous calibration with similar contamination. In the alternative, a visual comparison of the contaminated cloth to a contamination key provides an indication of the surface cleanliness.

Schroder, Mark Stewart (Hendersonville, NC); Woodmansee, Donald Ernest (Simpsonville, SC); Beadie, Douglas Frank (Greenville, SC)

2002-01-01T23:59:59.000Z

370

GR via Characteristic Surfaces  

E-Print Network [OSTI]

We reformulate the Einstein equations as equations for families of surfaces on a four-manifold. These surfaces eventually become characteristic surfaces for an Einstein metric (with or without sources). In particular they are formulated in terms of two functions on R4xS2, i.e. the sphere bundle over space-time, - one of the functions playing the role of a conformal factor for a family of associated conformal metrics, the other function describing an S2's worth of surfaces at each space-time point. It is from these families of surfaces themselves that the conformal metric - conformal to an Einstein metric - is constructed; the conformal factor turns them into Einstein metrics. The surfaces are null surfaces with respect to this metric.

Simonetta Frittelli; Carlos Kozameh; Ted Newman

1995-02-11T23:59:59.000Z

371

A finite difference model for free surface gravity drainage  

SciTech Connect (OSTI)

The unconfined gravity flow of liquid with a free surface into a well is a classical well test problem which has not been well understood by either hydrologists or petroleum engineers. Paradigms have led many authors to treat an incompressible flow as compressible flow to justify the delayed yield behavior of a time-drawdown test. A finite-difference model has been developed to simulate the free surface gravity flow of an unconfined single phase, infinitely large reservoir into a well. The model was verified with experimental results in sandbox models in the literature and with classical methods applied to observation wells in the Groundwater literature. The simulator response was also compared with analytical Theis (1935) and Ramey et al. (1989) approaches for wellbore pressure at late producing times. The seepage face in the sandface and the delayed yield behavior were reproduced by the model considering a small liquid compressibility and incompressible porous medium. The potential buildup (recovery) simulated by the model evidenced a different- phenomenon from the drawdown, contrary to statements found in the Groundwater literature. Graphs of buildup potential vs time, buildup seepage face length vs time, and free surface head and sand bottom head radial profiles evidenced that the liquid refills the desaturating cone as a flat moving surface. The late time pseudo radial behavior was only approached after exaggerated long times.

Couri, F.R.; Ramey, H.J. Jr.

1993-09-01T23:59:59.000Z

372

Threshold error rates for the toric and surface codes  

E-Print Network [OSTI]

The surface code scheme for quantum computation features a 2d array of nearest-neighbor coupled qubits yet claims a threshold error rate approaching 1% (NJoP 9:199, 2007). This result was obtained for the toric code, from which the surface code is derived, and surpasses all other known codes restricted to 2d nearest-neighbor architectures by several orders of magnitude. We describe in detail an error correction procedure for the toric and surface codes, which is based on polynomial-time graph matching techniques and is efficiently implementable as the classical feed-forward processing step in a real quantum computer. By direct simulation of this error correction scheme, we determine the threshold error rates for the two codes (differing only in their boundary conditions) for both ideal and non-ideal syndrome extraction scenarios. We verify that the toric code has an asymptotic threshold of p = 15.5% under ideal syndrome extraction, and p = 7.8 10^-3 for the non-ideal case, in agreement with prior work. Simulations of the surface code indicate that the threshold is close to that of the toric code.

D. S. Wang; A. G. Fowler; A. M. Stephens; L. C. L. Hollenberg

2009-05-05T23:59:59.000Z

373

EMSL - surface chemistry  

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

surface-chemistry en FeSSZ-13 as an NH3-SCR Catalyst: A Reaction Kinetics and FTIRMssbauer Spectroscopic Study. http:www.emsl.pnl.govemslwebpublications...

374

Concrete Pavement Surface Characteristics  

E-Print Network [OSTI]

, Broom, Belt, Carpet) Shot Peened Exposed Aggregate Porous (Pervious) Concrete Milled HMA and SurfaceImproving Concrete Pavement Surface Characteristics Pooled Fund TPF-5(139) National Concrete do with this knowledge? #12;Better Design and Construction Practices for Texturing Concrete Pavement

375

On the Irreps of the N-Extended Supersymmetric Quantum Mechanics and Their Fusion Graphs  

E-Print Network [OSTI]

In this talk we review the classification of the irreducible representations of the algebra of the N-extended one-dimensional supersymmetric quantum mechanics presented in hep-th/0511274. We answer some issues raised in hep-th/0611060, proving the agreement of the results here contained with those in hep-th/0511274. We further show that the fusion algebra of the 1D N-extended supersymmetric vacua introduced in hep-th/0511274 admits a graphical presentation. The N=2 graphs are here explicitly presented for the first time.

Francesco Toppan

2006-12-27T23:59:59.000Z

376

Some observations on Goldberg-Trajan's Maximum Flow algorithm on Bipartite Graphs  

E-Print Network [OSTI]

) is a direct graph with two distinguished vertices s (the source) and t (the sink). Each edge [u, v] in G is associated with a positive integer cap(u, v), called the capacity of the edge. If there is no edge from vertex u to vertex v. then we define... cap(u, v) = 0. Intuitively, a flow in a flow network should satisfy the following three conditions: (1) the amount of flow along an edge should not exceed the capacity of the edge (capacity constraint); (2) a flow from a vertex u to a vertex v can...

Yang, Bencai

1997-01-01T23:59:59.000Z

377

Planning Graph as a (Dynamic) CSP: Exploiting EBL, DDB and other CSP Search Techniques in Graphplan  

E-Print Network [OSTI]

This paper reviews the connections between Graphplan's planning-graph and the dynamic constraint satisfaction problem and motivates the need for adapting CSP search techniques to the Graphplan algorithm. It then describes how explanation based learning, dependency directed backtracking, dynamic variable ordering, forward checking, sticky values and random-restart search strategies can be adapted to Graphplan. Empirical results are provided to demonstrate that these augmentations improve Graphplan's performance significantly (up to 1000x speedups) on several benchmark problems. Special attention is paid to the explanation-based learning and dependency directed backtracking techniques as they are empirically found to be most useful in improving the performance of Graphplan.

Kambhampati, S

2011-01-01T23:59:59.000Z

378

MadDM v.1.0: Computation of Dark Matter Relic Abundance Using MadGraph5  

E-Print Network [OSTI]

We present MadDM v.1.0, a numerical tool to compute dark matter relic abundance in a generic model. The code is based on the existing MadGraph 5 architecture and as such is easily integrable into any MadGraph collider study. A simple Python interface offers a level of user-friendliness characteristic of MadGraph 5 without sacrificing functionality. MadDM is able to calculate the dark matter relic abundance in models which include a multi-component dark sector, resonance annihilation channels and co-annihilations. We validate the code in a wide range of dark matter models by comparing the relic density results from MadDM to the existing tools and literature.

Mihailo Backovic; Kyoungchul Kong; Mathew McCaskey

2014-04-24T23:59:59.000Z

379

Experimental and numerical investigation of the reflection coefficient and the distributions of Wigner's reaction matrix for irregular graphs with absorption  

E-Print Network [OSTI]

We present the results of experimental and numerical study of the distribution of the reflection coefficient P(R) and the distributions of the imaginary P(v) and the real P(u) parts of the Wigner's reaction K matrix for irregular fully connected hexagon networks (graphs) in the presence of strong absorption. In the experiment we used microwave networks, which were built of coaxial cables and attenuators connected by joints. In the numerical calculations experimental networks were described by quantum fully connected hexagon graphs. The presence of absorption introduced by attenuators was modelled by optical potentials. The distribution of the reflection coefficient P(R) and the distributions of the reaction K matrix were obtained from the measurements and numerical calculations of the scattering matrix S of the networks and graphs, respectively. We show that the experimental and numerical results are in good agreement with the exact analytic ones obtained within the framework of random matrix theory (RMT).

Michal Lawniczak; Oleh Hul; Szymon Bauch; Petr Seba; Leszek Sirko

2009-03-18T23:59:59.000Z

380

A preliminary version appeared in Advances in Cryptology --Asiacrypt'02. This is a revised version. The Provable Security of GraphBased OneTime Signatures and  

E-Print Network [OSTI]

A preliminary version appeared in Advances in Cryptology -- Asiacrypt'02. This is a revised version based on ``graphs of oneway functions''. Bleichen bacher and Maurer thoroughly analyze graph based . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 3 The GBOTS construction 7 4 The Reduction 8 4.1 Inverting H

Hevia, Alejandro

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


381

A preliminary version appeared in Advances in Cryptology Asiacrypt'02. This is a revised version. The Provable Security of Graph-Based One-Time Signatures and  

E-Print Network [OSTI]

A preliminary version appeared in Advances in Cryptology Asiacrypt'02. This is a revised version based on "graphs of one-way functions". Bleichen- bacher and Maurer thoroughly analyze graph based . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 3 The GBOTS construction 7 4 The Reduction 8 4.1 Inverting H

Hevia, Alejandro

382

de Sitter Extremal Surfaces  

E-Print Network [OSTI]

We study extremal surfaces in de Sitter space in the Poincare slicing in the upper patch, anchored on spatial subregions at the future boundary ${\\cal I}^+$, restricted to constant boundary Euclidean time slices (focussing on strip subregions). We find real extremal surfaces of minimal area as the boundaries of past lightcone wedges of the subregions in question: these are null surfaces with vanishing area. We find also complex extremal surfaces as complex extrema of the area functional, and the area is not always real-valued. In $dS_4$ the area is real and has some structural resemblance with entanglement entropy in a dual $CFT_3$. There are parallels with analytic continuation from the Ryu-Takayanagi expressions for holographic entanglement entropy in $AdS$. We also discuss extremal surfaces in the $dS$ black brane and the de Sitter "bluewall" studied previously. The $dS_4$ black brane complex surfaces exhibit a real finite cutoff-independent extensive piece. In the bluewall geometry, there are real surface...

Narayan, K

2015-01-01T23:59:59.000Z

383

Sharpness of the phase transition and exponential decay of the subcritical cluster size for percolation on quasi-transitive graphs  

E-Print Network [OSTI]

We study homogeneous, independent percolation on general quasi-transitive graphs. We prove that in the disorder regime where all clusters are finite almost surely, in fact the expectation of the cluster size is finite. This extends a well-known theorem by Menshikov and Aizenman & Barsky to all quasi-transitive graphs. Moreover we deduce that in this disorder regime the cluster size distribution decays exponentially, extending a result of Aizenman & Newman. Our results apply to both edge and site percolation, as well as long range (edge) percolation. The proof is based on a modification of the Aizenman & Barsky method.

Ton?i Antunovi?; Ivan Veseli?

2007-11-12T23:59:59.000Z

384

Mathematical Proofs of Two Conjectures: The Four Color Problem and The Uniquely 4-colorable Planar Graph  

E-Print Network [OSTI]

The famous four color theorem states that for all planar graphs, every vertex can be assigned one of 4 colors such that no two adjacent vertices receive the same color. Since Francis Guthrie first conjectured it in 1852, it is until 1976 with electronic computer that Appel and Haken first gave a proof by finding and verifying 1936 reducible unavoidable sets, and a simplified proof of Robertson, Sanders, Seymour and Thomas in 1997 only involved 633 reducible unavoidable sets, both proofs could not be realized effectively by hand. Until now, finding the reducible unavoidable sets remains the only successful method to use, which came from Kempe's first "proof" of the four color problem in 1879. An alternative method only involving 4 reducible unavoidable sets for proving the four color theorem is used in this paper, which takes form of mathematical proof rather than a computer-assisted proof and proves both the four color conjecture and the uniquely 4-colorable planar graph conjecture by mathematical method.

Jin Xu

2012-01-18T23:59:59.000Z

385

Pattern analysis of directed graphs using DEDICOM: an application to Enron email.  

SciTech Connect (OSTI)

DEDICOM is a linear algebra model for analyzing intrinsically asymmetric relationships, such as trade among nations or the exchange of emails among individuals. DEDICOM decomposes a complex pattern of observed relations among objects into a sum of simpler patterns of inferred relations among latent components of the objects. Three-way DEDICOM is a higher-order extension of the model that incorporates a third mode of the data, such as time, giving it stronger uniqueness properties and consequently enhancing interpretability of solutions. In this paper, we present algorithms for computing these decompositions on large, sparse data as well as a variant for computing an asymmetric nonnegative factorization. When we apply these techniques to adjacency arrays arising from directed graphs with edges labeled by time, we obtain a smaller graph on latent semantic dimensions and gain additional information about their changing relationships over time. We demonstrate these techniques on the Enron email corpus to learn about the social networks and their transient behavior. The mixture of roles assigned to individuals by DEDICOM showed strong correspondence with known job classifications and revealed the patterns of communication between these roles. Changes in the communication pattern over time, e.g., between top executives and the legal department, were also apparent in the solutions.

Bader, Brett William; Harshman, Richard A. (University of Western Ontario London, Ontario, Canada); Kolda, Tamara Gibson (Sandia National Labs, Livermore, CA)

2006-12-01T23:59:59.000Z

386

Surface wave interferometry  

E-Print Network [OSTI]

This thesis concerns the application of seismic interferometry to surface waves. Seismic interferometry is the process by which the wavefield between two recording locations is estimated, resulting in new recordings at ...

Halliday, David Fraser

2009-01-01T23:59:59.000Z

387

A surface ionization source  

E-Print Network [OSTI]

The main part of the work described herein is the development and testing of a surface ionization source for use on a collinear fast beam laser spectroscopy apparatus. A description of the previously existing fast beam apparatus is given...

Buzatu, Daniel J.

1995-01-01T23:59:59.000Z

388

Structured surfaces for hemocompatibility  

E-Print Network [OSTI]

The rise of micro- and nano-technologies has brought to light intriguing examples of scale-driven performance in a diverse array of fields. The quest to create highly hydrophobic surfaces is one such field. The application ...

Schrauth, Anthony J

2005-01-01T23:59:59.000Z

389

SURFACE NONLINEAR OPTICS  

E-Print Network [OSTI]

B. de Castro, and Y. R. Shen, Optics Lett. i, 393 See, for3, 1980 SURFACE NONLINEAR OPTICS Y.R. Shen, C.K. Chen, andde Janiero SURFRACE NONLINEAR OPTICS Y. R. Shen, C. K. Chen,

Shen, Y.R.

2010-01-01T23:59:59.000Z

390

Entropy and surfaceness  

E-Print Network [OSTI]

The layer of the Earth's atmosphere which contains clouds and weather systems is a thin thermoregulatory surface. It maintains an exact energy budget between the Earth and the Sun. Recent work in theoretical physics is ...

Casper, James Kyle

1997-01-01T23:59:59.000Z

391

Asteroid Surface Geophysics  

E-Print Network [OSTI]

The regolith-covered surfaces of asteroids preserve records of geophysical processes that have occurred both at their surfaces and sometimes also in their interiors. As a result of the unique micro-gravity environment that these bodies posses, a complex and varied geophysics has given birth to fascinating features that we are just now beginning to understand. The processes that formed such features were first hypothesised through detailed spacecraft observations and have been further studied using theoretical, numerical and experimental methods that often combine several scientific disciplines. These multiple approaches are now merging towards a further understanding of the geophysical states of the surfaces of asteroids. In this chapter we provide a concise summary of what the scientific community has learned so far about the surfaces of these small planetary bodies and the processes that have shaped them. We also discuss the state of the art in terms of experimental techniques and numerical simulations that...

Murdoch, Naomi; Schwartz, Stephen R; Miyamoto, Hideaki

2015-01-01T23:59:59.000Z

392

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

393

Introduction to Network Science 1 Spectral Methods (aka Algebraic Graph Theory, see Chapter 14 in [BE] "Network analysis")  

E-Print Network [OSTI]

Introduction to Network Science 1 Spectral Methods (aka Algebraic Graph Theory, see Chapter 14 #12;Introduction to Network Science 2 #12;Introduction to Network Science 3 Homework: Prove any 2 out of 3 in Theorem 3 (submit by 3/6/2014) #12;Introduction to Network Science 4 There exists some nonzero

Safro, Ilya

394

Introduction to Network Analysis 1 Spectral Methods (aka Algebraic Graph Theory, see Chapter 14 in *BE+ "Network analysis")  

E-Print Network [OSTI]

Introduction to Network Analysis 1 Spectral Methods (aka Algebraic Graph Theory, see Chapter 14 in *BE+ "Network analysis") Three main objects of interest: adjacency matrix, Laplacian, and normalized to Network Analysis 12 original reverse Cuthill-McKee spectral Matlab demo #12;Introduction to Network

Safro, Ilya

395

Surface Water Quality Standards (Kansas)  

Broader source: Energy.gov [DOE]

This act states regulations for the quality of surface water in the state. It also states designated uses of classified surface waters, surface water quality criteria and an antidegradation policy...

396

Surface Water Management Areas (Virginia)  

Broader source: Energy.gov [DOE]

This legislation establishes surface water management areas, geographically defined surface water areas in which the State Water Control Board has deemed the levels or supply of surface water to be...

397

Dual surface interferometer  

DOE Patents [OSTI]

A double-pass interferometer is provided which allows direct measurement of relative displacement between opposed surfaces. A conventional plane mirror interferometer may be modified by replacing the beam-measuring path cube-corner reflector with an additional quarterwave plate. The beam path is altered to extend to an opposed plane mirrored surface and the reflected beam is placed in interference with a retained reference beam split from dual-beam source and retroreflected by a reference cube-corner reflector mounted stationary with the interferometer housing. This permits direct measurement of opposed mirror surfaces by laser interferometry while doubling the resolution as with a conventional double-pass plane mirror laser interferometer system.

Pardue, R.M.; Williams, R.R.

1980-09-12T23:59:59.000Z

398

Large Magnetization at Carbon Surfaces  

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

Large Magnetization at Carbon Surfaces Large Magnetization at Carbon Surfaces Print Wednesday, 31 August 2011 00:00 From organic matter to pencil lead, carbon is a versatile...

399

Approximate inference on planar graphs using loop calculus and belief progagation  

SciTech Connect (OSTI)

We introduce novel results for approximate inference on planar graphical models using the loop calculus framework. The loop calculus (Chertkov and Chernyak, 2006b) allows to express the exact partition function Z of a graphical model as a finite sum of terms that can be evaluated once the belief propagation (BP) solution is known. In general, full summation over all correction terms is intractable. We develop an algorithm for the approach presented in Chertkov et al. (2008) which represents an efficient truncation scheme on planar graphs and a new representation of the series in terms of Pfaffians of matrices. We analyze in detail both the loop series and the Pfaffian series for models with binary variables and pairwise interactions, and show that the first term of the Pfaffian series can provide very accurate approximations. The algorithm outperforms previous truncation schemes of the loop series and is competitive with other state-of-the-art methods for approximate inference.

Chertkov, Michael [Los Alamos National Laboratory; Gomez, Vicenc [RADBOUD UNIV; Kappen, Hilbert [RADBOUD UNIV

2009-01-01T23:59:59.000Z

400

Understanding resonance graphs using Easy Java Simulations (EJS) and why we use EJS  

E-Print Network [OSTI]

This paper reports a computer model- simulation created using Easy Java Simulation (EJS) for learners to visualize how the steady-state amplitude of a driven oscillating system varies with the frequency of the periodic driving force. The simulation shows (N=100) identical spring-mass systems being subjected to (1) periodic driving force of equal amplitude but different driving frequencies and (2) different amount of damping. The simulation aims to create a visually intuitive way of understanding how the series of amplitude versus driving frequency graphs are obtained by showing how the displacement of the system changes over time as it transits from the transient to the steady state. A suggested how to use the model is added to help educators and students in their teaching and learning, where we explained the theoretical steady state equation, time conditions when the model starts allowing data recording of maximum amplitudes to closely match the theoretical equation and steps to collect different runs of deg...

Wee, Loo Kang; Chew, Charles; Wong, Darren; Tan, Samuel

2015-01-01T23:59:59.000Z

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

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

402

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; Foltte, Jean-Christophe, E-mail: jean-christophe.foltete@univ-fcomte.fr; Clauzel, Cline, E-mail: celine.clauzel@univ-fcomte.fr

2013-09-15T23:59:59.000Z

403

Bifurcations and stability of standing waves in the nonlinear Schrdinger equation on the tadpole graph  

E-Print Network [OSTI]

We develop a detailed rigorous analysis of edge bifurcations of standing waves in the nonlinear Schr\\"odinger (NLS) equation on a tadpole graph (a ring attached to a semi-infinite line subject to the Kirchhoff boundary conditions at the junction). It is shown in the recent work [7] by using explicit Jacobi elliptic functions that the cubic NLS equation on a tadpole graph admits a rich structure of standing waves. Among these, there are different branches of localized waves bifurcating from the edge of the essential spectrum of an associated Schr\\"odinger operator. We show by using a modified Lyapunov-Schmidt reduction method that the bifur- cation of localized standing waves occurs for every positive power nonlinearity. We distinguish a primary branch of never vanishing standing waves bifurcating from the trivial solution and an infinite sequence of higher branches with oscillating behavior in the ring. The higher branches bifurcate from the branches of degenerate standing waves with vanishing tail outside the ring. Moreover, we analyze stability of bifurcating standing waves. Namely, we show that the primary branch is composed by orbitally stable standing waves for subcritical power nonlinearities, while all nontrivial higher branches are linearly unstable near the bifurcation point. The stability character of the degenerate branches remains inconclusive at the analytical level, whereas heuristic arguments based on analysis of embedded eigenvalues of negative Krein signatures support the conjecture of their linear instability at least near the bifurcation point. Numerical results for the cubic NLS equation show that this conjecture is valid and that the degenerate branches become spectrally stable far away from the bifurcation point.

Diego Noja; Dmitry Pelinovsky; Gaukhar Shaikhova

2014-12-28T23:59:59.000Z

404

Decontaminating metal surfaces  

DOE Patents [OSTI]

Radioactively contaminated surfaces can be electrolytically decontaminated with greatly increased efficiencies by using electrolytes containing higher than heretofore conventional amounts of nitrate, e.g., >600 g/1 of NaNO/sub 3/, or by using nitrate-containing electrolytes which are acidic, e.g., of a pH < 6.

Childs, E.L.

1984-01-23T23:59:59.000Z

405

Decontaminating metal surfaces  

DOE Patents [OSTI]

Radioactively contaminated surfaces can be electrolytically decontaminated with greatly increased efficiencies by using electrolytes containing higher than heretofore conventional amounts of nitrate, e.g.,>600 g/l of NaNO.sub.3, or by using nitrate-containing electrolytes which are acidic, e.g., of a pH<6.

Childs, Everett L. (Boulder, CO)

1984-11-06T23:59:59.000Z

406

Onset of surface superconductivity  

SciTech Connect (OSTI)

We examine the onset of superconductivity in the surface region of a metal. Surface effects are particularly important in systems with a short bulk coherence length {xi}{sub 0}. We show that, to the accuracy of the calculation, the surface transition temperature {ital T}{sub {ital c}{ital S}} equals the bulk transition temperature {ital T}{sub {ital c}{ital B}} if the electron-electron interaction is of the standard BCS form, i.e., a single attractive square well, extending up to some critical energy {omega}{sub 0} much smaller than the Fermi energy {var epsilon}{sub {ital F}}. If one takes into account, in addition, the repulsive part of the interaction extending beyond {omega}{sub 0} up to energies of order {var epsilon}{sub {ital F}}, then one may have {ital T}{sub {ital c}{ital S}}{gt}{ital T}{sub {ital c}{ital B}} in certain cases, although, due to restrictions imposed on the parameter values by various physical conditions, the relative increase of {ital T}{sub {ital c}} is very small, typically 10{sup {minus}3}, at least in the weak coupling limit. However, we also find a considerable gap enhancement, of order 20%, near the surface which could be of interest for critical-current measurements. Therefore we suggest an experimental reexamination of systems with short {xi}{sub 0}, i.e., superconducting degenerate semiconductors and the new high-{ital T}{sub {ital c}} oxides in confined geometries where the surface-to-volume ratio is non-negligible.

Giamarchi, T.; Beal-Monod, M.T. (Laboratoire de Physique des Solides, Universite Paris-Sud 91405 Orsay, (France)); Valls, O.T. (Laboratoire de Physique des Solides, Universite Paris-Sud, 91405 Orsay, (France) Center for the Science and Application of Superconductivity, School of Physics and Astronomy, University of Minnesota, Minneapolis, Minnesota 55455 (USA))

1990-06-01T23:59:59.000Z

407

Smart, passive sun facing surfaces  

DOE Patents [OSTI]

An article adapted for selectively utilizing solar radiation comprises an absorptive surface and a reflective surface, the absorptive surface and the reflective surface oriented to absorb solar radiation when the sun is in a relatively low position, and to reflect solar radiation when the sun is in a relatively high position. 17 figs.

Hively, L.M.

1996-04-30T23:59:59.000Z

408

Smart, passive sun facing surfaces  

DOE Patents [OSTI]

An article adapted for selectively utilizing solar radiation comprises an absorptive surface and a reflective surface, the absorptive surface and the reflective surface oriented to absorb solar radiation when the sun is in a relatively low position, and to reflect solar radiation when the sun is in a relatively high position.

Hively, Lee M. (Knoxville, TN)

1996-01-01T23:59:59.000Z

409

Surface decontamination compositions and methods  

DOE Patents [OSTI]

Clay-based compositions capable of absorbing contaminants from surfaces or objects having surface faces may be applied to a surface and later removed, the removed clay-based compositions absorbing at least a portion of the contaminant from the surface or object to which it was applied.

Wright; Karen E. (Idaho Falls, ID); Cooper, David C. (Idaho Falls, ID); Peterman, Dean R. (Idaho Falls, ID); Demmer, Ricky L. (Idaho Falls, ID); Tripp, Julia L. (Pocatello, ID); Hull, Laurence C. (Idaho Falls, ID)

2011-03-29T23:59:59.000Z

410

Pocked surface neutron detector  

DOE Patents [OSTI]

The detection efficiency, or sensitivity, of a neutron detector material such as of Si, SiC, amorphous Si, GaAs, or diamond is substantially increased by forming one or more cavities, or holes, in its surface. A neutron reactive material such as of elemental, or any compound of, .sup.10 B, .sup.6 Li, .sup.6 LiF, U, or Gd is deposited on the surface of the detector material so as to be disposed within the cavities therein. The portions of the neutron reactive material extending into the detector material substantially increase the probability of an energetic neutron reaction product in the form of a charged particle being directed into and detected by the neutron detector material.

McGregor, Douglas (Whitmore Lake, MI); Klann, Raymond (Bolingbrook, IL)

2003-04-08T23:59:59.000Z

411

Retracts of products of chordal graphs B. Bresar1, J. Chalopin2, V. Chepoi2, M. Kovse1, A. Labourel2, and Y. Vax`es2  

E-Print Network [OSTI]

2, and Y. Vax`es2 1Faculty of Natural Sciences and Mathematics University of Maribor, Koroska cesta {chalopin,chepoi,labourel,vaxes}@lif.univ-mrs.fr Abstract. In this note, we characterize the graphs G

Chepoi, Victor

412

Surface profiling interferometer  

DOE Patents [OSTI]

The design of a long-trace surface profiler for the non-contact measurement of surface profile, slope error and curvature on cylindrical synchrotron radiation (SR) mirrors. The optical system is based upon the concept of a pencil-beam interferometer with an inherent large depth-of-field. The key feature of the optical system is the zero-path-difference beam splitter, which separates the laser beam into two colinear, variable-separation probe beams. A linear array detector is used to record the interference fringe in the image, and analysis of the fringe location as a function of scan position allows one to reconstruct the surface profile. The optical head is mounted on an air bearing slide with the capability to measure long aspheric optics, typical of those encountered in SR applications. A novel feature of the optical system is the use of a transverse "outrigger" beam which provides information on the relative alignment of the scan axis to the cylinder optic symmetry axis.

Takacs, Peter Z. (P.O. Box 385, Upton, NY 11973); Qian, Shi-Nan (Hefei Synchrotron Radiation Laboratory, University of Science and, Hefei, Anhui, CN)

1989-01-01T23:59:59.000Z

413

Surface forces: Surface roughness in theory and experiment  

SciTech Connect (OSTI)

A method of incorporating surface roughness into theoretical calculations of surface forces is presented. The model contains two chief elements. First, surface roughness is represented as a probability distribution of surface heights around an average surface height. A roughness-averaged force is determined by taking an average of the classic flat-surface force, weighing all possible separation distances against the probability distributions of surface heights. Second the model adds a repulsive contact force due to the elastic contact of asperities. We derive a simple analytic expression for the contact force. The general impact of roughness is to amplify the long range behaviour of noncontact (DLVO) forces. The impact of the elastic contact force is to provide a repulsive wall which is felt at a separation between surfaces that scales with the root-mean-square (RMS) roughness of the surfaces. The model therefore provides a means of distinguishing between true zero, where the separation between the average centres of each surface is zero, and apparent zero, defined by the onset of the repulsive contact wall. A normal distribution may be assumed for the surface probability distribution, characterised by the RMS roughness measured by atomic force microscopy (AFM). Alternatively the probability distribution may be defined by the histogram of heights measured by AFM. Both methods of treating surface roughness are compared against the classic smooth surface calculation and experimental AFM measurement.

Parsons, Drew F., E-mail: Drew.Parsons@anu.edu.au; Walsh, Rick B.; Craig, Vincent S. J. [Department of Applied Mathematics, Research School of Physical Sciences and Engineering, Australian National University, Canberra, ACT 0200 (Australia)] [Department of Applied Mathematics, Research School of Physical Sciences and Engineering, Australian National University, Canberra, ACT 0200 (Australia)

2014-04-28T23:59:59.000Z

414

Relating Doubly-Even Error-Correcting Codes, Graphs, and Irreducible Representations of N-Extended Supersymmetry  

E-Print Network [OSTI]

Previous work has shown that the classification of indecomposable off-shell representations of N-supersymmetry, depicted as Adinkras, may be factored into specifying the topologies available to Adinkras, and then the height-assignments for each topological type. The latter problem being solved by a recursive mechanism that generates all height-assignments within a topology, it remains to classify the former. Herein we show that this problem is equivalent to classifying certain (1) graphs and (2) error-correcting codes.

C. F. Doran; M. G. Faux; S. J. Gates Jr; T. Hubsch; K. M. Iga; G. D. Landweber

2008-05-31T23:59:59.000Z

415

Test surfaces useful for calibration of surface profilometers  

DOE Patents [OSTI]

The present invention provides for test surfaces and methods for calibration of surface profilometers, including interferometric and atomic force microscopes. Calibration is performed using a specially designed test surface, or the Binary Pseudo-random (BPR) grating (array). Utilizing the BPR grating (array) to measure the power spectral density (PSD) spectrum, the profilometer is calibrated by determining the instrumental modulation transfer.

Yashchuk, Valeriy V; McKinney, Wayne R; Takacs, Peter Z

2013-12-31T23:59:59.000Z

416

surface science ELSEVIER Surface Science384 (1997) 192 200  

E-Print Network [OSTI]

surface science ELSEVIER Surface Science384 (1997) 192 200 An ab initio Hartree-Fock study Laboratory, Daresbury, Warrington, WA4 4AD, UK Received 3June 1996;acceptedfor publication 27 March 1997 arrangement is found consisting of localisedspinson the surface titanium atoms. © 1997Elsevier

417

Sweet Surface Area  

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 ConchasPassiveSubmittedStatus TomAbout »LabSustainability Ames Laboratory isSweet Surface

418

Enhancement of Topological Insulators Surface Conduction  

E-Print Network [OSTI]

Enhancement of Topological Insulators Surface Conduction AEnhancement of Topological Insulators Surface Conduction byTopological Insulator

Yu, Xinxin

2012-01-01T23:59:59.000Z

419

A New Method for Minimizing Buffer Sizes for Cyclo-Static Dataflow Graphs  

E-Print Network [OSTI]

. This paper presents an original methodology to minimize the global surface of the buffers for a Cyclo for real life problems. The resolution of the optimization problem for a Reed- Solomon Decoder application that the methodology developed in [5] to minimize the surface of the buffers for a minimum fixed throughput for a SDF

Paris-Sud XI, Université de

420

Understanding and Evaluating Extended Surfaces  

E-Print Network [OSTI]

Extended surfaces are widely used in heat transfer equipment in power and process plants. While various types of extended surfaces are used in the industry, this paper will limit the discussions to the widely used configurations in heat recovery...

Ganapathy, V.

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

$K$-theory and homotopies of 2-cocycles on higher-rank graphs.  

E-Print Network [OSTI]

This paper continues our investigation into the question of when a homotopy $\\omega = {\\omega_t}_{t \\in [0,1]}$ of 2-cocycles on a locally compact Hausdorff groupoid $\\mathcal{G}$ gives rise to an isomorphism of the $K$-theory groups of the twisted groupoid $C^*$-algebras: $K_*(C^*(\\mathcal{G}, \\omega_0)) \\cong K_*(C^*(\\mathcal{G}, \\omega_1)).$ In particular, we build on work by Kumjian, Pask, and Sims to show that if $\\mathcal{G} = \\mathcal{G}_\\Lambda$ is the infinite path groupoid associated to a row-finite higher-rank graph $\\Lambda$ with no sources, and ${c_t}_{t \\in [0,1]}$ is a homotopy of 2-cocycles on $\\Lambda$, then $K_*(C^*(\\mathcal{G}_\\Lambda, \\sigma_{c_0})) \\cong K_*(C^*(\\mathcal{G}_\\Lambda, \\sigma_{c_1})),$ where $\\sigma_{c_t}$ denotes the 2-cocycle on $\\mathcal{G}_\\Lambda$ associated to the 2-cocycle $c_t$ on $\\Lambda$. We also prove a technical result (Theorem 3.5), namely that a homotopy of 2-cocycles on a locally compact Hausdorff groupoid $\\mathcal{G}$ gives rise to an upper semi-continuous $C^*$-bundle.

Elizabeth Gillaspy

422

Complete-Graph Tensor Network States: A New Fermionic Wave Function Ansatz for Molecules  

E-Print Network [OSTI]

We present a new class of tensor network states that are specifically designed to capture the electron correlation of a molecule of arbitrary structure. In this ansatz, the electronic wave function is represented by a Complete-Graph Tensor Network (CGTN) ansatz which implements an efficient reduction of the number of variational parameters by breaking down the complexity of the high-dimensional coefficient tensor of a full-configuration-interaction (FCI) wave function. We demonstrate that CGTN states approximate ground states of molecules accurately by comparison of the CGTN and FCI expansion coefficients. The CGTN parametrization is not biased towards any reference configuration in contrast to many standard quantum chemical methods. This feature allows one to obtain accurate relative energies between CGTN states which is central to molecular physics and chemistry. We discuss the implications for quantum chemistry and focus on the spin-state problem. Our CGTN approach is applied to the energy splitting of states of different spin for methylene and the strongly correlated ozone molecule at a transition state structure. The parameters of the tensor network ansatz are variationally optimized by means of a parallel-tempering Monte Carlo algorithm.

Konrad H Marti; Bela Bauer; Markus Reiher; Matthias Troyer; Frank Verstraete

2010-04-29T23:59:59.000Z

423

SUPER HARD SURFACED POLYMERS  

SciTech Connect (OSTI)

High energy ion beam surface treatments were applied to a selected group of polymers. Of the six materials in the present study, four were thermoplastics (polycarbonate, polyethylene, polyethylene terephthalate, and polystyrene) and two were thermosets (epoxy and polyimide). The particular epoxy evaluated in this work is one of the resins used in formulating fiber reinforced composites for military helicopter blades. Measures of mechanical properties of the near surface regions were obtained by nanoindentation hardness and pin on disk wear. Attempts were also made to measure erosion resistance by particle impact. All materials were hardness tested. Pristine materials were very soft, having values in the range of approximately 0.1 to 0.5 GPa. Ion beam treatment increased hardness by up to 50 times compared to untreated materials. For reference, all materials were hardened to values higher than those typical of stainless steels. Wear tests were carried out on three of the materials, PET, PI and epoxy. On the ion beam treated epoxy no wear could be detected, whereas the untreated material showed significant wear.

Mansur, Louis K [ORNL] [ORNL; Bhattacharya, R [UES, Incorporated, Dayton, OH] [UES, Incorporated, Dayton, OH; Blau, Peter Julian [ORNL] [ORNL; Clemons, Art [ORNL] [ORNL; Eberle, Cliff [ORNL] [ORNL; Evans, H B [UES, Incorporated, Dayton, OH] [UES, Incorporated, Dayton, OH; Janke, Christopher James [ORNL] [ORNL; Jolly, Brian C [ORNL] [ORNL; Lee, E H [Consultant, Milpitas, CA] [Consultant, Milpitas, CA; Leonard, Keith J [ORNL] [ORNL; Trejo, Rosa M [ORNL] [ORNL; Rivard, John D [ORNL] [ORNL

2010-01-01T23:59:59.000Z

424

Method for lubricating contacting surfaces  

DOE Patents [OSTI]

A method is provided for tribological lubrication of sliding contact surfaces, where two surfaces are in contact and in motion relative to each other, operating in a vapor-phase environment containing at least one alcohol compound at a concentration sufficiently high to provide one monolayer of coverage on at least one of the surfaces, where the alcohol compound continuously reacts at the surface to provide lubrication.

Dugger, Michael T. (Tijeras, NM); Ohlhausen, James A. (Albuquerque, NM); Asay, David B. (Boalsburg, PA); Kim, Seong H. (State College, PA)

2011-12-06T23:59:59.000Z

425

Chemical enhancement of surface deposition  

DOE Patents [OSTI]

A method and apparatus for increasing the deposition of ions onto a surface, such as the adsorption of uranium ions on the detecting surface of a radionuclide detector. The method includes the step of exposing the surface to a complexing agent, such as a phosphate ion solution, which has an affinity for the dissolved species to be deposited on the surface. This provides, for example, enhanced sensitivity of the radionuclide detector.

Patch, Keith D. (Lexington, MA); Morgan, Dean T. (Sudbury, MA)

1997-07-29T23:59:59.000Z

426

Chemical enhancement of surface deposition  

DOE Patents [OSTI]

A method and apparatus are disclosed for increasing the deposition of ions onto a surface, such as the adsorption of uranium ions on the detecting surface of a radionuclide detector. The method includes the step of exposing the surface to a complexing agent, such as a phosphate ion solution, which has an affinity for the dissolved species to be deposited on the surface. This provides, for example, enhanced sensitivity of the radionuclide detector. 16 figs.

Patch, K.D.; Morgan, D.T.

1997-07-29T23:59:59.000Z

427

THE GEODESIC RAY TRANSFORM ON RIEMANNIAN SURFACES ...  

E-Print Network [OSTI]

the geodesic ?(y, ?, t) is never zero, we get that the (3n ? 2) (2n ? 1) matrix J has maximal .... a graph of the canonical map C defined in (3.10). ..... We use the code developed in Matlab by the first author, whose detail may be found in [22].

2014-11-24T23:59:59.000Z

428

6, 1205712120, 2006 Surface tension  

E-Print Network [OSTI]

ACPD 6, 12057­12120, 2006 Surface tension: measurement, modelling and cloud activation D. O a Creative Commons License. Atmospheric Chemistry and Physics Discussions Surface tensions of multi­12120, 2006 Surface tension: measurement, modelling and cloud activation D. O. Topping et al. Title Page

Paris-Sud XI, Université de

429

1, 351383, 2007 Greenland surface  

E-Print Network [OSTI]

TCD 1, 351383, 2007 Greenland surface mass balance at the end of this century G. Krinner and N-resolution simulations of the surface mass balance of Greenland at the end of this century G. Krinner and N. Julien LGGE Correspondence to: G. Krinner (krinner@ujf-grenoble.fr) 351 #12;TCD 1, 351383, 2007 Greenland surface mass

Paris-Sud XI, Universit de

430

Tools for measuring surface cleanliness  

DOE Patents [OSTI]

A procedure and tools for quantifying surface cleanliness are described. Cleanliness of a target surface is quantified by wiping a prescribed area of the surface with a flexible, bright white cloth swatch, preferably mounted on a special tool. The cloth picks up a substantial amount of any particulate surface contamination. The amount of contamination is determined by measuring the reflectivity loss of the cloth before and after wiping on the contaminated system and comparing that loss to a previous calibration with similar contamination. In the alternative, a visual comparison of the contaminated cloth to a contamination key provides an indication of the surface cleanliness.

Schroder, Mark Stewart (Hendersonville, NC); Woodmansee, Donald Ernest (Simpsonville, SC); Beadie, Douglas Frank (Greenville, SC)

2002-01-01T23:59:59.000Z

431

Tunable surface plasmon devices  

DOE Patents [OSTI]

A tunable extraordinary optical transmission (EOT) device wherein the tunability derives from controlled variation of the dielectric constant of a semiconducting material (semiconductor) in evanescent-field contact with a metallic array of sub-wavelength apertures. The surface plasmon resonance wavelength can be changed by changing the dielectric constant of the dielectric material. In embodiments of this invention, the dielectric material is a semiconducting material. The dielectric constant of the semiconducting material in the metal/semiconductor interfacial region is controllably adjusted by adjusting one or more of the semiconductor plasma frequency, the concentration and effective mass of free carriers, and the background high-frequency dielectric constant in the interfacial region. Thermal heating and/or voltage-gated carrier-concentration changes may be used to variably adjust the value of the semiconductor dielectric constant.

Shaner, Eric A. (Rio Rancho, NM); Wasserman, Daniel (Lowell, MA)

2011-08-30T23:59:59.000Z

432

Friction surfaced Stellite6 coatings  

SciTech Connect (OSTI)

Solid state Stellite6 coatings were deposited on steel substrate by friction surfacing and compared with Stellite6 cast rod and coatings deposited by gas tungsten arc and plasma transferred arc welding processes. Friction surfaced coatings exhibited finer and uniformly distributed carbides and were characterized by the absence of solidification structure and compositional homogeneity compared to cast rod, gas tungsten arc and plasma transferred coatings. Friction surfaced coating showed relatively higher hardness. X-ray diffraction of samples showed only face centered cubic Co peaks while cold worked coating showed hexagonally close packed Co also. - Highlights: Black-Right-Pointing-Pointer Stellite6 used as coating material for friction surfacing. Black-Right-Pointing-Pointer Friction surfaced (FS) coatings compared with casting, GTA and PTA processes. Black-Right-Pointing-Pointer Finer and uniformly distributed carbides in friction surfaced coatings. Black-Right-Pointing-Pointer Absence of melting results compositional homogeneity in FS Stellite6 coatings.

Rao, K. Prasad; Damodaram, R. [Department of Metallurgical and Materials Engineering - Indian Institute of Technology Madras, Chennai 600 036 (India); Rafi, H. Khalid, E-mail: khalidrafi@gmail.com [Department of Metallurgical and Materials Engineering, Indian Institute of Technology Madras, Chennai 600 036 (India); Ram, G.D. Janaki [Department of Metallurgical and Materials Engineering, Indian Institute of Technology Madras, Chennai 600 036 (India); Reddy, G. Madhusudhan [Metal Joining Group, Defence Metallurgical Research Laboratory (DMRL) Kanchanbagh, Hyderabad 500 058 (India); Nagalakshmi, R. [Welding Research Institute, Bharat Heavy Electricals Limited, Tiruchirappalli 620 014 (India)

2012-08-15T23:59:59.000Z

433

Surface Water Quality Standards (Nebraska)  

Broader source: Energy.gov [DOE]

These regulations, promulgated by the Department of Environmental Quality, contain surface water quality standards, stream classifications, discussion of lakes and impounded basins, and water...

434

Graph-theoretic analysis of discrete-phase-space states for condition change detection and quantification of information  

SciTech Connect (OSTI)

Data collected from devices and human condition may be used to forewarn of critical events such as machine/structural failure or events from brain/heart wave data stroke. By monitoring the data, and determining what values are indicative of a failure forewarning, one can provide adequate notice of the impending failure in order to take preventive measures. This disclosure teaches a computer-based method to convert dynamical numeric data representing physical objects (unstructured data) into discrete-phase-space states, and hence into a graph (structured data) for extraction of condition change.

Hively, Lee M.

2014-09-16T23:59:59.000Z

435

Surface alloying of immiscible metals induced by surface state shift  

E-Print Network [OSTI]

* Department of Physics, Fudan University, Shanghai 200433, People's Republic of China Received 24 April 2003, and topography; Silver; Gold; Copper; Tungsten; Molybdenum 1. Introduction Surface alloying has been a subject, because sur- face alloying is believed very important for many surface processes. It has been reported

Che, Jingguang

436

Renewable Surface Fluorescence Sandwich Immunoassay Biosensor...  

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

Renewable Surface Fluorescence Sandwich Immunoassay Biosensor for Rapid Sensitive Botulinum Toxin Detection in an Automated Renewable Surface Fluorescence Sandwich Immunoassay...

437

Lorentzian Metrics from Characteristic Surfaces  

E-Print Network [OSTI]

The following issue is raised and discussed; when do families of foliations by hypersurfaces on a given four dimensional manifold become the null surfaces of some unknown, but to be determined, metric $g_{ab}(x)$? It follows from these results that one can use these surfaces as fundamental variables for GR.

Simonetta Frittelli; Carlos Kozameh; Ted Newman

1995-02-11T23:59:59.000Z

438

Background canceling surface alpha detector  

DOE Patents [OSTI]

A background canceling long range alpha detector which is capable of providing output proportional to both the alpha radiation emitted from a surface and to radioactive gas emanating from the surface. The detector operates by using an electrical field between first and second signal planes, an enclosure and the surface or substance to be monitored for alpha radiation. The first and second signal planes are maintained at the same voltage with respect to the electrically conductive enclosure, reducing leakage currents. In the presence of alpha radiation and radioactive gas decay, the signal from the first signal plane is proportional to both the surface alpha radiation and to the airborne radioactive gas, while the signal from the second signal plane is proportional only to the airborne radioactive gas. The difference between these two signals is proportional to the surface alpha radiation alone. 5 figs.

MacArthur, D.W.; Allander, K.S.; Bounds, J.A.

1996-06-11T23:59:59.000Z

439

A Graph-theoretic Algorithm for Comparative Modeling of Protein Structure  

E-Print Network [OSTI]

are the same (Chothia & Lesk, 1986). This is the case now for about 30% of the general sequences entering for doing this is usually termed comparative or homology modeling. In contrast to progress in generating effects makes the energy surface extremely discontinuous, so that search methods that make semi

Samudrala, Ram

440

Feature Tracking Using Reeb Graphs Gunther H. Weber1,2, Peer-Timo Bremer3,  

E-Print Network [OSTI]

surface" · Fuel not evenly consumed: Burning cells separated by extinction regions · Interested in Combustion Simulations · Application: ­ Simulation of premixed lean hydrogen flames under different levels Goal: ­ Understanding the temporal evolution of burning cells ­ Influence of turbulence #12;Feature

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

Surface enhanced Raman spectroscopy on a flat graphene surface  

E-Print Network [OSTI]

Surface enhanced Raman spectroscopy (SERS) is an attractive analytical technique, which enables single-molecule sensitive detection and provides its special chemical fingerprints. During the past decades, researchers have ...

Xu, Weigao

442

Dropwise Condensation of Low Surface Tension Fluids on Omniphobic Surfaces  

E-Print Network [OSTI]

Compared to the significant body of work devoted to surface engineering for promoting dropwise condensation heat transfer of steam, much less attention has been dedicated to fluids with lower interfacial tension. A vast ...

Rykaczewski, Konrad

443

Surface Power Radiative Cooling Tests  

SciTech Connect (OSTI)

Terrestrial nuclear power plants typically maintain their temperature through convective cooling, such as water and forced air. However, the space environment is a vacuum environment, typically 10-8 Torr pressure, therefore in proposed missions to the lunar surface, power plants would have to rely on radiative cooling to remove waste heat. Also, the Martian surface has a very tenuous atmosphere (e.g. {approx}5 Torr CO2), therefore, the main heat transfer method on the Martian surface is also radiative. Because of the lack of atmosphere on the Moon and the tenuous atmosphere on Mars, surface power systems on both the Lunar and Martian surface must rely heavily on radiative heat transfer. Because of the large temperature swings on both the lunar and the Martian surfaces, trying to radiate heat is inefficient. In order to increase power system efficiency, an effort is underway to test various combinations of materials with high emissivities to demonstrate their ability to survive these degrading atmospheres to maintain a constant radiator temperature improving surface power plant efficiency. An important part of this effort is the development of a unique capability that would allow the determination of a materials emissivity at high temperatures. A description of the test capability as well as initial data is presented.

Vaughn, Jason; Schneider, Todd [Environmental Effects Branch, EM50, NASA Marshall Space Flight Center, AL 35812 (United States)

2006-01-20T23:59:59.000Z

444

Embedded fiducials in optical surfaces  

DOE Patents [OSTI]

Embedded fiducials are provided in optical surfaces and a method for embedding the fiducials. Fiducials, or marks on a surface, are important for optical fabrication and alignment, particularly when individual optical elements are aspheres. Fiducials are used during the course of the polishing process to connect interferometric data, and the equation describing the asphere, to physical points on the optic. By embedding fiducials below the surface of the optic and slightly outside the clear aperture of the optic, the fiducials are not removed by polishing, do not interfere with the polishing process, and do not affect the performance of the finished optic.

Sommargren, Gary E. (Santa Cruz, CA)

2000-01-01T23:59:59.000Z

445

SURFACE SCIENCE INVESTIGATION OF CORROSION  

E-Print Network [OSTI]

SURFACE SCIENCE INVESTIGATION OF CORROSION PROCESSES Danielle Haynes Professor Steve Bernasek August 3rd, 2009 #12;Outline Introduction Corrosion Processes AnalyticalTechnique (XPS) Motivation Methodology Preliminary Results Summary / FutureWork #12;Corrosion Process What is Corrosion? Degradation

Petta, Jason

446

Spectral processing for surface meshes  

E-Print Network [OSTI]

of W 's row sums. The Eigendecomposition: K = UUT Mesh y as linear sum of eigenvectors: y = U or y = u1 [Liu & Zhang 04, 05, 07] Surface reconstruction: grouping "inside" and "outside" tetrahedra [Kullori et

Zhang, Richard "Hao"

447

Sustaining dry surfaces under water  

E-Print Network [OSTI]

Rough surfaces immersed under water remain practically dry if the liquid-solid contact is on roughness peaks, while the roughness valleys are filled with gas. Mechanisms that prevent water from invading the valleys are well studied. However, to remain practically dry under water, additional mechanisms need consideration. This is because trapped gas (e.g. air) in the roughness valleys can dissolve into the water pool, leading to invasion. Additionally, water vapor can also occupy the roughness valleys of immersed surfaces. If water vapor condenses, that too leads to invasion. These effects have not been investigated, and are critically important to maintain surfaces dry under water. In this work, we identify the critical roughness scale below which it is possible to sustain the vapor phase of water and/or trapped gases in roughness valleys - thus keeping the immersed surface dry. Theoretical predictions are consistent with molecular dynamics simulations and experiments.

Paul R. Jones; Xiuqing Hao; Eduardo R. Cruz-Chu; Konrad Rykaczewski; Krishanu Nandy; Thomas M. Schutzius; Kripa K. Varanasi; Constantine M. Megaridis; Jens H. Walther; Petros Koumoutsakos; Horacio D. Espinosa; Neelesh A. Patankar

2014-09-29T23:59:59.000Z

448

Surface trap for ytterbium ions  

E-Print Network [OSTI]

We conducted an experiment to load a shallow planar ion trap from a cold atom source of Ytterbium using photoionization. The surface trap consisted of a three-rod radio frequency Paul trap fabricated using standard printed ...

Campbell, Jonathan A. (Jonathan Alan)

2006-01-01T23:59:59.000Z

449

Water Rights: Surface Water (Indiana)  

Broader source: Energy.gov [DOE]

The Indiana Department of Natural Resources regulates the use and diversion of surface waters. An entity that creates additional stream volumes by releases from impoundments built and financed by...

450

Surface Coal Mining Regulations (Mississippi)  

Broader source: Energy.gov [DOE]

The Surface Coal Mining Regulations are a combination of permitting requirements and environmental regulations that limit how, where and when coal can be mined. It protects lands that are under...

451

Corrosion-resistant metal surfaces  

DOE Patents [OSTI]

The present invention relates to metal surfaces having thereon an ultrathin (e.g., less than ten nanometer thickness) corrosion-resistant film, thereby rendering the metal surfaces corrosion-resistant. The corrosion-resistant film includes an at least partially crosslinked amido-functionalized silanol component in combination with rare-earth metal oxide nanoparticles. The invention also relates to methods for producing such corrosion-resistant films.

Sugama, Toshifumi (Wading River, NY)

2009-03-24T23:59:59.000Z

452

arXiv:1104.0081v2[math.CO]4Apr2011 CAYLEY GRAPHS OF ORDER 16p ARE HAMILTONIAN  

E-Print Network [OSTI]

is prime. We show that if S is any generating set of G, then there is a hamiltonian cycle.2(1) of [10]. Namely, several of the main results of that paper combine to show: Every connected Cayley graph on G has a hamiltonian cycle if |G| = kp, where p is prime, 1 k

Morris, Joy

453

The Twelfth IEEE International Conference on Computer Vision, Kyoto, Japan. September 27 -October 4, 2009. Higher-Order Gradient Descent by Fusion-Move Graph Cut  

E-Print Network [OSTI]

, us- ing the reduction[6, 14] then available. The more recent reduction[10] for energies of even 4, 2009. Higher-Order Gradient Descent by Fusion-Move Graph Cut Hiroshi Ishikawa Nagoya City) the fusion move algorithm, ii) the reduction of higher-order binary energy minimization to first

Ishikawa, Hiroshi

454

The graphs at right show overall variability distribution estimated for the Pentium D 800 series (near) and the T1 Niagara (far) using the FPGA data  

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

Renau, Jose

455

Surface Tension Tzong-Shyng Leu  

E-Print Network [OSTI]

1 Fluidics Surface Tension Tzong-Shyng Leu IAA ­ Institute of Aeronautics and Astranautics surface tension. Cohesion and Surface Tension Molecular concept of origin of surface tension: Fluidics The cohesive forces between liquid molecules are responsible for the phenomenon known as surface tension

Leu, Tzong-Shyng "Jeremy"

456

Design and analysis of algorithms and data structures for the efficient solution of graph theoretic problems on MIMD computers  

SciTech Connect (OSTI)

The problem of developing efficient algorithms and data structures to solve graph theoretic problems on tightly-coupled MIMD comuters is addressed. Several approaches to parallelizing a serial algorithm are examined. A technique is developed which allows the prediction of the expected execution time of some kinds of parallel algorithms. This technique can be used to determine which parallel algorithm is best for a particular application. Two parallel approximate algorithms for the Euclidean traveling salesman problem are designed and analyzed. The algorithms are parallelizations of the farthest-insertion heuristic and Karp's partitioning algorithm. Software lockout, the delay of processes due to contention for shared data structure, can be a significant hindrance to obtaining satisfactory speedup. Using the tactics of indirection and replication, new data structures are devised which can reduce the severity of software lockout. Finally, an upper bound to the speedup of parallel branch-and-bound algorithms which use the best-bound search strategy is determined.

Quinn, M.J.

1983-01-01T23:59:59.000Z

457

The Need to Support of Data Flow Graph Visualization of Forensic Lucid Programs, Forensic Evidence, and their Evaluation by GIPSY  

E-Print Network [OSTI]

Lucid programs are data-flow programs and can be visually represented as data flow graphs (DFGs) and composed visually. Forensic Lucid, a Lucid dialect, is a language to specify and reason about cyberforensics cases. It includes the encoding of the evidence (representing the context of evaluation) and the crime scene modeling in order to validate claims against the model and perform event reconstruction, potentially within large swaths of digital evidence. To aid investigators to model the scene and evaluate it, instead of typing a Forensic Lucid program, we propose to expand the design and implementation of the Lucid DFG programming onto Forensic Lucid case modeling and specification to enhance the usability of the language and the system.

Mokhov, Serguei A; Debbabi, Mourad

2010-01-01T23:59:59.000Z

458

Pancake bouncing on superhydrophobic surfaces  

E-Print Network [OSTI]

Engineering surfaces that promote rapid drop detachment is of importance to a wide range of applications including anti-icing, dropwise condensation6, and self-cleaning. Here we show how superhydrophobic surfaces patterned with lattices of submillimetre-scale posts decorated with nano-textures can generate a counter-intuitive bouncing regime: drops spread on impact and then leave the surface in a flattened, pancake shape without retracting. This allows for a four-fold reduction in contact time compared to conventional complete rebound. We demonstrate that the pancake bouncing results from the rectification of capillary energy stored in the penetrated liquid into upward motion adequate to lift the drop. Moreover, the timescales for lateral drop spreading over the surface and for vertical motion must be comparable. In particular, by designing surfaces with tapered micro/nanotextures which behave as harmonic springs, the timescales become independent of the impact velocity, allowing the occurrence of pancake bouncing and rapid drop detachment over a wide range of impact velocities.

Yahua Liu; Lisa Moevius; Xinpeng Xu; Tiezheng Qian; Julia M Yeomans; Zuankai Wang

2014-06-12T23:59:59.000Z

459

Optimization of Single and Layered Surface Texturing  

E-Print Network [OSTI]

In visualization problems, surface shape is often a piece of data that must be shown effectively. One factor that strongly affects shape perception is texture. For example, patterns of texture on a surface can show the surface orientation from...

Bair, Alethea S.

2010-07-14T23:59:59.000Z

460

Beta particle monitor for surfaces  

DOE Patents [OSTI]

A beta radiation detector which is capable of reliably detecting beta radiation emitted from a surface. An electrically conductive signal collector is adjustably mounted inside an electrically conductive enclosure which may define a single large opening for placing against a surface. The adjustable mounting of the electrically conductive signal collector can be based on the distance from the surface or on the expected beta energy range. A voltage source is connected to the signal collector through an electrometer or other display means for creating an electric field between the signal collector and the enclosure. Air ions created by the beta radiation are collected and the current produced is indicated on the electrometer or other display means. 2 figs.

MacArthur, D.W.

1997-10-21T23:59:59.000Z

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

Beta particle monitor for surfaces  

DOE Patents [OSTI]

A beta radiation detector which is capable of reliably detecting beta radiation emitted from a surface. An electrically conductive signal collector is adjustably mounted inside an electrically conductive enclosure which may define a single large opening for placing against a surface. The adjustable mounting of the electrically conductive signal collector can be based on the distance from the surface or on the expected beta energy range. A voltage source is connected to the signal collector through an electrometer or other display means for creating an electric field between the signal collector and the enclosure. Air ions created by the beta radiation are collected and the current produced is indicated on the electrometer or other display means.

MacArthur, Duncan W. (Los Alamos, NM)

1997-01-01T23:59:59.000Z

462

Device for inspecting vessel surfaces  

DOE Patents [OSTI]

A portable, remotely-controlled inspection crawler for use along the walls of tanks, vessels, piping and the like. The crawler can be configured to use a vacuum chamber for supporting itself on the inspected surface by suction or a plurality of magnetic wheels for moving the crawler along the inspected surface. The crawler is adapted to be equipped with an ultrasonic probe for mapping the structural integrity or other characteristics of the surface being inspected. Navigation of the crawler is achieved by triangulation techniques between a signal transmitter on the crawler and a pair of microphones attached to a fixed, remote location, such as the crawler's deployment unit. The necessary communications are established between the crawler and computers external to the inspection environment for position control and storage and/or monitoring of data acquisition.

Appel, D. Keith (Aiken, SC)

1995-01-01T23:59:59.000Z

463

Surface Water Quality Standards (New Jersey)  

Broader source: Energy.gov [DOE]

These standards establish the designated uses and antidegradation categories of the State's surface waters, classify surface waters based on those uses (i.e., stream classifications), and specify...

464

Electrochemical, Structural and Surface Characterization of Nickel...  

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

Electrochemical, Structural and Surface Characterization of NickelZirconia Solid Oxide Fuel Cell Anodes in Coal Gas Containing Electrochemical, Structural and Surface...

465

Materials Characterization Capabilities at the HTML: Surface...  

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

density analysis of forming samples using advanced characterization techniques Materials Characterization Capabilities at the HTML: SurfaceSub-surface dislocation density...

466

Sum Frequency Generation for Surface Vibrational Spectroscopy...  

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

Sum Frequency Generation for Surface Vibrational Spectroscopy Sum Frequency Generation for Surface Vibrational Spectroscopy This customized SFG-VS spectrometer incorporates unique...

467

Arkansas Surface Coal Mining Reclamation Act (Arkansas)  

Broader source: Energy.gov [DOE]

The Arkansas Surface Coal Mining Reclamation Act authorizes the state to develop, adopt, issue and amend rules and regulations pertaining to surface coal mining and reclamation operations. These...

468

Surface modification to prevent oxide scale spallation  

DOE Patents [OSTI]

A surface modification to prevent oxide scale spallation is disclosed. The surface modification includes a ferritic stainless steel substrate having a modified surface. A cross-section of the modified surface exhibits a periodic morphology. The periodic morphology does not exceed a critical buckling length, which is equivalent to the length of a wave attribute observed in the cross section periodic morphology. The modified surface can be created using at least one of the following processes: shot peening, surface blasting and surface grinding. A coating can be applied to the modified surface.

Stephens, Elizabeth V; Sun, Xin; Liu, Wenning; Stevenson, Jeffry W; Surdoval, Wayne; Khaleel, Mohammad A

2013-07-16T23:59:59.000Z

469

Surface rheology and interface stability.  

SciTech Connect (OSTI)

We have developed a mature laboratory at Sandia to measure interfacial rheology, using a combination of home-built, commercially available, and customized commercial tools. An Interfacial Shear Rheometer (KSV ISR-400) was modified and the software improved to increase sensitivity and reliability. Another shear rheometer, a TA Instruments AR-G2, was equipped with a du Nouey ring, bicone geometry, and a double wall ring. These interfacial attachments were compared to each other and to the ISR. The best results with the AR-G2 were obtained with the du Nouey ring. A Micro-Interfacial Rheometer (MIR) was developed in house to obtain the much higher sensitivity given by a smaller probe. However, it was found to be difficult to apply this technique for highly elastic surfaces. Interfaces also exhibit dilatational rheology when the interface changes area, such as occurs when bubbles grow or shrink. To measure this rheological response we developed a Surface Dilatational Rheometer (SDR), in which changes in surface tension with surface area are measured during the oscillation of the volume of a pendant drop or bubble. All instruments were tested with various surfactant solutions to determine the limitations of each. In addition, foaming capability and foam stability were tested and compared with the rheology data. It was found that there was no clear correlation of surface rheology with foaming/defoaming with different types of surfactants, but, within a family of surfactants, rheology could predict the foam stability. Diffusion of surfactants to the interface and the behavior of polyelectrolytes were two subjects studied with the new equipment. Finally, surface rheological terms were added to a finite element Navier-Stokes solver and preliminary testing of the code completed. Recommendations for improved implementation were given. When completed we plan to use the computations to better interpret the experimental data and account for the effects of the underlying bulk fluid.

Yaklin, Melissa A.; Cote, Raymond O.; Moffat, Harry K.; Grillet, Anne Mary; Walker, Lynn; Koehler, Timothy P.; Reichert, Matthew D. (Carnegie Mellon University, Pittsburgh, PA); Castaneda, Jaime N.; Mondy, Lisa Ann; Brooks, Carlton, F.

2010-11-01T23:59:59.000Z

470

Polishing compound for plastic surfaces  

DOE Patents [OSTI]

A polishing compound for plastic surfaces is disclosed. The compound contains by weight approximately 4 to 17 parts at least one petroleum distillate lubricant, 1 to 6 parts mineral spirits, 2.5 to 15 parts abrasive particles, and 2.5 to 10 parts water. The abrasive is tripoli or a similar material that contains colloidal silica. Preferably, most of the abrasive particles are less than approximately 10 microns, more preferably less than approximately 5 microns in size. The compound is used on PLEXIGLAS{sup TM}, LEXAN{sup TM}, LUCITE{sup TM}, polyvinyl chloride (PVC) and similar plastic materials whenever a smooth, clear polished surface is desired.

Stowell, M.S.

1993-01-01T23:59:59.000Z

471

Polishing compound for plastic surfaces  

DOE Patents [OSTI]

A polishing compound for plastic surfaces is disclosed. The compound contains by weight approximately 4 to 17 parts at least one petroleum distillate lubricant, 1 to 6 parts mineral spirits, 2.5 to 15 parts abrasive particles, and 2.5 to 10 parts water. The abrasive is tripoli or a similar material that contains fine particles silica. Preferably, most of the abrasive particles are less than approximately 10 microns, more preferably less than approximately 5 microns in size. The compound is used on PLEXIGLAS{trademark}, LEXAN{trademark}, LUCITE{trademark}, polyvinyl chloride (PVC) and similar plastic materials whenever a smooth, clear polished surface is desired. 5 figs.

Stowell, M.S.

1995-08-22T23:59:59.000Z

472

Method of passivating semiconductor surfaces  

DOE Patents [OSTI]

A method of passivating Group III-V or II-VI semiconductor compound surfaces. The method includes selecting a passivating material having a lattice constant substantially mismatched to the lattice constant of the semiconductor compound. The passivating material is then grown as an ultrathin layer of passivating material on the surface of the Group III-V or II-VI semiconductor compound. The passivating material is grown to a thickness sufficient to maintain a coherent interface between the ultrathin passivating material and the semiconductor compound. In addition, a device formed from such method is also disclosed.

Wanlass, Mark W. (Golden, CO)

1990-01-01T23:59:59.000Z

473

Method of passivating semiconductor surfaces  

SciTech Connect (OSTI)

A method is described for passivating Group III-V or II-VI semiconductor compound surfaces. The method includes selecting a passivating material having a lattice constant substantially mismatched to the lattice constant of the semiconductor compound. The passivating material is then grown as an ultrathin layer of passivating material on the surface of the Group III-V or II-VI semiconductor compound. The passivating material is grown to a thickness sufficient to maintain a coherent interface between the ultrathin passivating material and the semiconductor compound. In addition, a device formed from such method is also disclosed.

Wanlass, M.W.

1990-06-19T23:59:59.000Z

474

Polishing compound for plastic surfaces  

DOE Patents [OSTI]

A polishing compound for plastic surfaces. The compound contains by weight approximately 4 to 17 parts at least one petroleum distillate lubricant, 1 to 6 parts mineral spirits, 2.5 to 15 parts abrasive particles, and 2.5 to 10 parts water. The abrasive is tripoli or a similar material that contains fine particles silica. Preferably, most of the abrasive particles are less than approximately 10 microns, more preferably less than approximately 5 microns in size. The compound is used on PLEXIGLAS.TM., LEXAN.TM., LUCITE.TM., polyvinyl chloride (PVC) and similar plastic materials whenever a smooth, clear polished surface is desired.

Stowell, Michael S. (New Ellenton, SC)

1995-01-01T23:59:59.000Z

475

Surface layering of liquids: Is surface tension the dominant factor? Oleg Shpyrko,1  

E-Print Network [OSTI]

Surface layering of liquids: Is surface tension the dominant factor? Oleg Shpyrko,1 Masafumi Fukuto near a hard flat surface and at first it is tempt- ing to think that the large surface tension that the free surface of water, which has nearly the same surface tension as K, does not exhibit SL features

Fukuto, Masafumi

476

Texas Surface Water Quality Standards  

E-Print Network [OSTI]

1 Texas Surface Water Quality Standards 30 TAC Chapter 307 Lori Hamilton Water Quality Standards of the water quality standards for a water body will be conducted Types of UAAs Aquatic Life Use (ALU) UAAs 2 procedures in conjunction with Standards revision Before Conducting a UAA Coordinate with your TCEQ project

477

General Session I Surface Multiplasmonics  

E-Print Network [OSTI]

. Emerging applications of surface multiplasmonics include solar-energy harvesting as well as optical sensing design and verification of large-scale photonic integrated circuits. Importantly, the simulation approaches. We show that fully passive photonic circuits can be efficiently modeled in the frequency domain

Lakhtakia, Akhlesh

478

Symmetry Energy in Nuclear Surface  

E-Print Network [OSTI]

Interplay between the dependence of symmetry energy on density and the variation of nucleonic densities across nuclear surface is discussed. That interplay gives rise to the mass dependence of the symmetry coefficient in an energy formula. Charge symmetry of the nuclear interactions allows to introduce isoscalar and isovector densities that are approximately independent of the magnitude of neutron-proton asymmetry.

Pawel Danielewicz; Jenny Lee

2008-12-25T23:59:59.000Z

479

Symmetry Energy in Nuclear Surface  

E-Print Network [OSTI]

Interplay between the dependence of symmetry energy on density and the variation of nucleonic densities across nuclear surface is discussed. The interplay leads to a dependence of the symmetry coefficient, in energy formula, on nuclear mass. Charge symmetry of nuclear interactions allows to introduce isoscalar and isovector densities that are approximately independent of neutron-proton asymmetry.

Danielewicz, Pawel

2008-01-01T23:59:59.000Z

480

Second Harmonic Generation From Surfaces  

E-Print Network [OSTI]

Second Harmonic Generation From Surfaces Nicolas Tancogne-Dejean, Valérie Véniard Condensed Matter/DSM European Theoretical Spectroscopy Facility #12;2 Outline Nonlinear optic and second harmonic generation;4 Second harmonic generation First nonlinear term Centrosymmetric material : (2) = 0 (3)First nonlinear

Botti, Silvana

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

Representing and Modifying Complex Surfaces  

E-Print Network [OSTI]

. Bernardini. Sharp features on multiresolution subdivision surfaces. In 9th Pacific Conference on Com- puter-form solids. In Proceedings of ACM SIGGRAPH 2001, Computer Graphics Proceedings, Annual Conference Series SIGGRAPH 2000, Computer Graphics Proceedings, Annual Conference Series, pages 113­ 120. ACM Press / ACM

Mohri, Mehryar

482

Theoretical Surface Science Wintersemester 2007/08  

E-Print Network [OSTI]

. Introduction Surfaces · Processes on surfaces play an enormous- ly important technological role · Harmful processes: 1. Rust, corrosion 2. Wear · Advantageous processes: 1. Production of chemicals 2. Conversion) DFT surface band structure M F M 0 5 -10 -5 Energy(eV) Cu(111): Band gas and parabolic surface band

Pfeifer, Holger

483

Biomass Surface Characterization Laboratory (Fact Sheet)  

SciTech Connect (OSTI)

This fact sheet provides information about Biomass Surface Characterization Laboratory capabilities and applications at NREL.

Not Available

2012-04-01T23:59:59.000Z

484

Energy conservation potential of surface modification technologies  

SciTech Connect (OSTI)

This report assesses the energy conservation impact of surface modification technologies on the metalworking industries. The energy conservation impact of surface modification technologies on the metalworking industries is assessed by estimating their friction and wear tribological sinks and the subsequent reduction in these sinks when surface modified tools are used. Ion implantation, coatings, and laser and electron beam surface modifications are considered.

Le, H.K.; Horne, D.M.; Silberglitt, R.S.

1985-09-01T23:59:59.000Z

485

A surface definition code for turbine blade surfaces  

SciTech Connect (OSTI)

A numerical interpolation scheme has been developed for generating the three-dimensional geometry of wind turbine blades. The numerical scheme consists of (1) creating the frame of the blade through the input of two or more airfoils at some specific spanwise stations and then scaling and twisting them according to the prescribed distributions of chord, thickness, and twist along the span of the blade; (2) transforming the physical coordinates of the blade frame into a computational domain that complies with the interpolation requirements; and finally (3) applying the bi-tension spline interpolation method, in the computational domain, to determine the coordinates of any point on the blade surface. Detailed descriptions of the overall approach to and philosophy of the code development are given along with the operation of the code. To show the usefulness of the bi-tension spline interpolation code developed, two examples are given, namely CARTER and MICON blade surface generation. Numerical results are presented in both graphic data forms. The solutions obtained in this work show that the computer code developed can be a powerful tool for generating the surface coordinates for any three-dimensional blade.

Yang, S.L. (Michigan Technological Univ., Houghton, MI (United States)); Oryang, D.; Ho, M.J. (Tuskegee Univ., AL (United States))

1992-05-01T23:59:59.000Z

486

Method for protecting a surface  

DOE Patents [OSTI]

The invention includes a method of producing a hard metallic material by forming a mixture containing at least 55% iron and at least one of B, C, Si and P. The mixture is formed into an alloy and cooled to form a metallic material having a hardness of greater than about 9.2 GPa. The invention includes a method of forming a wire by combining a metal strip and a powder. The strip and the powder are rolled to form a wire containing at least 55% iron and from 27 additional elements including at lease one of C, Si and B. The invention also includes a method of forming a hardened surface on a substrate by processing a solid mass to form a power, applying the powder to a surface to form a layer containing metallic glass, and converting the glass to a crystalline material having a nanocrystalline grain size.

Branagan, Daniel J.

2006-06-27T23:59:59.000Z

487

Ultrasonic cleaning of interior surfaces  

DOE Patents [OSTI]

An ultrasonic cleaning apparatus is described for cleaning the interior surfaces of tubes. The apparatus includes an ultrasonic generator and reflector each coupled to opposing ends of the open-ended, fluid-filled tube. Fluid-tight couplings seal the reflector and generator to the tube, preventing leakage of fluid from the interior of the tube. The reflector and generator are operatively connected to actuators, whereby the distance between them can be varied. When the distance is changed, the frequency of the sound waves is simultaneously adjusted to maintain the resonant frequency of the tube so that a standing wave is formed in the tube, the nodes of which are moved axially to cause cavitation along the length of the tube. Cavitation maximizes mechanical disruption and agitation of the fluid, dislodging foreign material from the interior surface. 3 figures.

MacKenzie, D.; Odell, C.

1994-03-01T23:59:59.000Z

488

Ultrasonic cleaning of interior surfaces  

DOE Patents [OSTI]

An ultrasonic cleaning method for cleaning the interior surfaces of tubes. The method uses an ultrasonic generator and reflector each coupled to opposing ends of the open-ended, fluid-filled tube. Fluid-tight couplings seal the reflector and generator to the tube, preventing leakage of fluid from the interior of the tube. The reflector and generator are operatively connected to actuators, whereby the distance between them can be varied. When the distance is changed, the frequency of the sound waves is simultaneously adjusted to maintain the resonant frequency of the tube so that a standing wave is formed in the tube, the nodes of which are moved axially to cause cavitation along the length of the tube. Cavitation maximizes mechanical disruption and agitation of the fluid, dislodging foreign material from the interior surface.

Odell, D. MacKenzie C. (Aiken, SC)

1996-01-01T23:59:59.000Z

489

Ultrasonic cleaning of interior surfaces  

DOE Patents [OSTI]

An ultrasonic cleaning apparatus for cleaning the interior surfaces of tubes. The apparatus includes an ultrasonic generator and reflector each coupled to opposing ends of the open-ended, fluid-filled tube. Fluid-tight couplings seal the reflector and generator to the tube, preventing leakage of fluid from the interior of the tube. The reflector and generator are operatively connected to actuators, whereby the distance between them can be varied. When the distance is changed, the frequency of the sound waves is simultaneously adjusted to maintain the resonant frequency of the tube so that a standing wave is formed in the tube, the nodes of which are moved axially to cause cavitation along the length of the tube. Cavitation maximizes mechanical disruption and agitation of the fluid, dislodging foreign material from the interior surface.

Odell, D. MacKenzie C. (Aiken, SC)

1994-01-01T23:59:59.000Z

490

Magnetic Bottles on Riemann Surfaces  

E-Print Network [OSTI]

Yves Colin de Verdiere's quantization formalism of magnetic bottles on Riemann surfaces of non null genus is shown to be affected, owing to the Homotopy Superselection Rule, by the phenomenon of the existence of multiple inequivalent quantizations mathematically analogous to the phenomenon of the existence of multiple inequivalent prequantizations of a multiply-connected symplectic manifold in the framework of Souriau-Kostant's Geometric Quantization.

Gavriel Segre

2011-01-17T23:59:59.000Z

491

ARM - Lesson Plans: Surface Currents  

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 Documentation RUC : XDCResearch Related InformationAcid Rain OutreachMovingReasonSurface

492

SURFACE GEOPHYSICAL EXPLORATION - COMPENDIUM DOCUMENT  

SciTech Connect (OSTI)

This report documents the evolution of the surface geophysical exploration (SGE) program and highlights some of the most recent successes in imaging conductive targets related to past leaks within and around Hanford's tank farms. While it is noted that the SGE program consists of multiple geophysical techniques designed to (1) locate near surface infrastructure that may interfere with (2) subsurface plume mapping, the report will focus primarily on electrical resistivity acquisition and processing for plume mapping. Due to the interferences from the near surface piping network, tanks, fences, wells, etc., the results of the three-dimensional (3D) reconstruction of electrical resistivity was more representative of metal than the high ionic strength plumes. Since the first deployment, the focus of the SGE program has been to acquire and model the best electrical resistivity data that minimizes the influence of buried metal objects. Toward that goal, two significant advances have occurred: (1) using the infrastructure directly in the acquisition campaign and (2) placement of electrodes beneath the infrastructure. The direct use of infrastructure was successfully demonstrated at T farm by using wells as long electrodes (Rucker et al., 2010, 'Electrical-Resistivity Characterization of an Industrial Site Using Long Electrodes'). While the method was capable of finding targets related to past releases, a loss of vertical resolution was the trade-off. The burying of electrodes below the infrastructure helped to increase the vertical resolution, as long as a sufficient number of electrodes are available for the acquisition campaign.

RUCKER DF; MYERS DA

2011-10-04T23:59:59.000Z

493

A splitting method for numerical simulation of free surface flows of incompressible fluids with surface tension  

E-Print Network [OSTI]

with surface tension Kirill D. Nikitin Maxim A. Olshanskii Kirill M. Terekhov Yuri V. Vassilevski§ Abstract to surface tension forces. The method splits one time step into a semi-Lagrangian treatment of the surface models a free surface flow of viscous incompressible fluid subject to surface tension forces. Further

Olshanskii, Maxim A.

494

Effect of surface tension on swell-induced surface instability of substrate-confined hydrogel layers  

E-Print Network [OSTI]

, the physics of surface instability may be harnessed in the design of responsive ``smart'' surfaces for novel with Biot's periodic surface wave analysis. Several theoretical models have also been proposed for swelling due to inhomogeneous transient state of swelling.16,17 Second, the effect of surface energy or surface

Huang, Rui

495

Surface wave chemical detector using optical radiation  

DOE Patents [OSTI]

A surface wave chemical detector comprising at least one surface wave substrate, each of said substrates having a surface wave and at least one measurable surface wave parameter; means for exposing said surface wave substrate to an unknown sample of at least one chemical to be analyzed, said substrate adsorbing said at least one chemical to be sensed if present in said sample; a source of radiation for radiating said surface wave substrate with different wavelengths of said radiation, said surface wave parameter being changed by said adsorbing; and means for recording signals representative of said surface wave parameter of each of said surface wave substrates responsive to said radiation of said different wavelengths, measurable changes of said parameter due to adsorbing said chemical defining a unique signature of a detected chemical.

Thundat, Thomas G.; Warmack, Robert J.

2007-07-17T23:59:59.000Z

496

Surface structure of cleaved (001) USb2 single crystal surface  

SciTech Connect (OSTI)

We have achieved what we believe to be the first atomic resolution scanning tunneling microscopy (STM) images for a uranium compound USb2 taken at room temperature. The a, b, and c lattice parameters in the images confirm that the tetragonal USb2 crystals cleave on the (001) basal plane as expected. Our calculations indicate a symmetric cut between Sb planes to be the most favorable cleavage plane and U atoms to be responsible for most of the density of states measured by STM. Since the spacing between Sb atoms and between U atoms is the same, STM topography alone cannot unambiguously identify the surface atom species.

Chen, Shao-ping [Los Alamos National Laboratory

2008-01-01T23:59:59.000Z

497

Method of sputter etching a surface  

DOE Patents [OSTI]

The surface of a target is textured by co-sputter etching the target surface with a seed material adjacent thereto, while the target surface is maintained at a pre-selected temperature. By pre-selecting the temperature of the surface while sputter etching, it is possible to predetermine the reflectance properties of the etched surface. The surface may be textured to absorb sunlight efficiently and have minimal emittance in the infrared region so as to be well-suited for use as a solar absorber for photothermal energy conversion.

Henager, Jr., Charles H. (Seattle, WA)

1984-01-01T23:59:59.000Z

498

Method of sputter etching a surface  

DOE Patents [OSTI]

The surface of a target is textured by co-sputter etching the target surface with a seed material adjacent thereto, while the target surface is maintained at a pre-selected temperature. By pre-selecting the temperature of the surface while sputter etching, it is possible to predetermine the reflectance properties of the etched surface. The surface may be textured to absorb sunlight efficiently and have minimal emittance in the infrared region so as to be well-suited for use as a solar absorber for photothermal energy conversion. 4 figs.

Henager, C.H. Jr.

1984-02-14T23:59:59.000Z

499

Surface Contamination Surface contamination from radioactive isotopes is a source of background in the Borex-  

E-Print Network [OSTI]

Chapter 5 Surface Contamination Surface contamination from radioactive isotopes is a source contamination is primarily a problem because the radioactive contaminants can be trans- ferred from the surfaces detector components that come in contact with the scintillator. Preventing radioactive contamination

500

Surface-micromachined microfluidic devices  

DOE Patents [OSTI]

Microfluidic devices are disclosed which can be manufactured using surface-micromachining. These devices utilize an electroosmotic force or an electromagnetic field to generate a flow of a fluid in a microchannel that is lined, at least in part, with silicon nitride. Additional electrodes can be provided within or about the microchannel for separating particular constituents in the fluid during the flow based on charge state or magnetic moment. The fluid can also be pressurized in the channel. The present invention has many different applications including electrokinetic pumping, chemical and biochemical analysis (e.g. based on electrophoresis or chromatography), conducting chemical reactions on a microscopic scale, and forming hydraulic actuators.

Galambos, Paul C. (Albuquerque, NM); Okandan, Murat (Albuquerque, NM); Montague, Stephen (Albuquerque, NM); Smith, James H. (Redmond, WA); Paul, Phillip H. (Livermore, CA); Krygowski, Thomas W. (Cortlandt Manor, NY); Allen, James J. (Albuquerque, NM); Nichols, Christopher A. (Hauppauge, NY); Jakubczak, II, Jerome F. (Rio Rancho, NM)

2003-01-01T23:59:59.000Z