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

Attachment  

E-Print Network [OSTI]

Nuclear Power Station by incorporating an Alternative Source Term (AST) methodology into the facility's licensing basis. The supplemental information consisted of two reports regarding the seismic verification of the Alternative Leakage Treatment pathway. The reports were prepared by ABS Group Consulting, Inc. under contract to VY and bear a copyright by ABS Group Consulting, Inc. Attachment 1 to this letter is a copyright and proprietary information release that permits the NRC to reproduce copies of the subject reports. It is not the intent of either VY or ABS Group Consulting, Inc. that the reports be treated as proprietary information. The information provided herewith does not expand the scope or change the conclusions of the original application for a license amendment, and the prior determination of no significant hazards consideration is unchanged. If you have any questions in this regard, please contact Mr. Len Gucwa at (802) 258-4225. Sincerely,

Vermont Yankee; James M. Devincentis

2003-01-01T23:59:59.000Z

2

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

3

Measuring extremal dependencies in Web graphs Yana Volkovich  

E-Print Network [OSTI]

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

Boucherie, Richard J.

4

Measuring Extremal Dependencies in Web Graphs Yana Volkovich  

E-Print Network [OSTI]

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

Boucherie, Richard J.

5

Attachment 1  

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

May, 2003 May, 2003 1 Attachment 1 Sensitive Foreign Nations Controls SENSITIVE SUBJECTS Rev. 0 May, 2003 2 This is a list of areas of technical subject matter or technologies containing "sensitive" information. The list identifies subjects related to the development and production of weapons of mass destruction (nuclear, chemical, and biological) and their delivery systems (including missiles), conventional weapons, and other technologies deemed significant to the national security of the United States. Department of Energy (DOE) hosts of foreign visitor, DOE travelers, and others holding information on these subjects should be aware of all constraints on releasing information. They should also be cautious

6

Graph Algorithms Special Sets in Graphs  

E-Print Network [OSTI]

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

Bar-Noy, Amotz

7

Graph Algorithms Edge Coloring  

E-Print Network [OSTI]

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

Bar-Noy, Amotz

8

Graph Algorithms Robert Elsasser  

E-Print Network [OSTI]

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

Elsässer, Robert

9

PDSF Utilization Graphs  

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

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

10

Graph Visualization API Library for Application Builders  

Science Journals Connector (OSTI)

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

Franois Bertault; Wendy Feng; Uli Feier; Gabe Grigorescu

2002-01-01T23:59:59.000Z

11

Graph Algorithms Vertex Coloring  

E-Print Network [OSTI]

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

Bar-Noy, Amotz

12

Graph algorithms experimentation facility  

E-Print Network [OSTI]

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

Sonom, Donald George

2012-06-07T23:59:59.000Z

13

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

14

Parasupersymmetry in Quantum Graphs  

E-Print Network [OSTI]

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

Satoshi Ohya

2012-10-29T23:59:59.000Z

15

Parasupersymmetry in Quantum Graphs  

E-Print Network [OSTI]

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

Ohya, Satoshi

2012-01-01T23:59:59.000Z

16

Graph Algorithms Robert Elsasser  

E-Print Network [OSTI]

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

Elsässer, Robert

17

High Performance Window Attachments  

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

High Performance Window High Performance Window Attachments D. Charlie Curcija Lawrence Berkeley National Laboratory dccurcija@lbl.gov 510-495-2602 April 4, 2013 2 | Building Technologies Office eere.energy.gov Purpose & Objectives Impact of Project: * Motivate manufacturers to make improvements in Window systems U-Factors, SHGC and daylighting utilization * Increase awareness of benefits from energy efficient window attachments Problem Statement: * A wide range of residential window attachments are available, but they have widely unknown

18

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

19

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

20

Spectral Graph Theory  

E-Print Network [OSTI]

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

*D. J. Kelleher

2011-09-30T23:59:59.000Z

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

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

22

Quantum graph as a quantum spectral filter  

SciTech Connect (OSTI)

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

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

2013-03-15T23:59:59.000Z

23

GraphState - a tool for graph identification and labelling  

E-Print Network [OSTI]

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

Batkovich, D; Kompaniets, M; Novikov, S

2014-01-01T23:59:59.000Z

24

GraphState - a tool for graph identification and labelling  

E-Print Network [OSTI]

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

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

2014-09-29T23:59:59.000Z

25

Magnetically attached sputter targets  

DOE Patents [OSTI]

An improved method and assembly for attaching sputtering targets to cathode assemblies of sputtering systems which includes a magnetically permeable material is described. The magnetically permeable material is imbedded in a target base that is brazed, welded, or soldered to the sputter target, or is mechanically retained in the target material. Target attachment to the cathode is achieved by virtue of the permanent magnets and/or the pole pieces in the cathode assembly that create magnetic flux lines adjacent to the backing plate, which strongly attract the magnetically permeable material in the target assembly. 11 figures.

Makowiecki, D.M.; McKernan, M.A.

1994-02-15T23:59:59.000Z

26

Ladder attachment platform  

DOE Patents [OSTI]

A ladder attachment platform is provided that includes a base for attachment to a ladder that has first and second side rails and a plurality of rungs that extend between in a lateral direction. Also included is a user platform for having a user stand thereon that is carried by the base. The user platform may be positioned with respect to the ladder so that it is not located between a first plane that extends through the first side rail and is perpendicular to the lateral direction and a second plane that extends through the second side rail and is perpendicular to the lateral direction.

Swygert,; Richard, W [Springfield, SC

2012-08-28T23:59:59.000Z

27

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

28

Graph degree linkage: agglomerative clustering on a directed graph  

Science Journals Connector (OSTI)

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

Wei Zhang; Xiaogang Wang; Deli Zhao; Xiaoou Tang

2012-10-01T23:59:59.000Z

29

Turbine nozzle attachment system  

DOE Patents [OSTI]

A nozzle guide vane assembly having a preestablished rate of thermal expansion is positioned in a gas turbine engine and is attached to conventional metallic components. The nozzle guide vane assembly includes a pair of legs extending radially outwardly from an outer shroud and a pair of mounting legs extending radially inwardly from an inner shroud. Each of the pair of legs and mounting legs have a pair of holes therein. A plurality of members attached to the gas turbine engine have a plurality of bores therein which axially align with corresponding ones of the pair of holes in the legs. A plurality of pins are positioned within the corresponding holes and bores radially positioning the nozzle guide vane assembly about a central axis of the gas turbine engine. 3 figs.

Norton, P.F.; Shaffer, J.E.

1995-10-24T23:59:59.000Z

30

Kinetic Pie Delaunay Graph and Its Applications  

Science Journals Connector (OSTI)

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

Mohammad Ali Abam; Zahed Rahmati; Alireza Zarei

2012-01-01T23:59:59.000Z

31

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

32

Supercritical Fluid Attachment of Palladium Nanoparticles on...  

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

Attachment of Palladium Nanoparticles on Aligned Carbon Nanotubes. Supercritical Fluid Attachment of Palladium Nanoparticles on Aligned Carbon Nanotubes. Abstract: Nanocomposite...

33

Exploring the role of graph spectra in graph coloring algorithm performance  

Science Journals Connector (OSTI)

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

Kate Smith-Miles, Davaatseren Baatar

2014-10-01T23:59:59.000Z

34

Exact algorithm for graph homomorphism and locally injective graph homomorphism  

Science Journals Connector (OSTI)

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

Pawe? Rzewski

2014-07-01T23:59:59.000Z

35

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

36

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

37

ATTACHMENT J - APPENDIX I  

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

0140 0140 Contract No.: DE-AC02-09CH11466 Section J - Appendix I J-I-1 ATTACHMENT J.9 APPENDIX I DOE DIRECTIVES / LIST B Applicable to the Operation of PPPL Contract No. DE-AC02-09CH11466 Modification 0140 Contract No.: DE-AC02-09CH11466 Section J - Appendix I J-I-2 DOE Directive Date Title ES&H O 150.1 05/08/08 Continuity Program O 151.1C 11/02/05 Comprehensive Emergency Management System O 210.2A 04/08/11 DOE Corporate Operating Experience Program O 225.1B 03/04/11 Accident Investigations O 231.1B Chg. 1 06/27/11 11/28/12 Environment, Safety and Health Reporting (10 CFR 851, DOE Worker Safety and Health Program Rule, incorporates DOE M 231.1-1A by reference and remains applicable until reference is removed from 10 CFR 851.)

38

Fast iterative graph computation with block updates  

Science Journals Connector (OSTI)

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

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

2013-09-01T23:59:59.000Z

39

Attachment C - Summary GHG Emissions Data FINAL | Department...  

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

Attachment C - Summary GHG Emissions Data FINAL Attachment C - Summary GHG Emissions Data FINAL Attachment-C-Summary-GHG-Emissions-Data-FINAL.xlsx Description Attachment C -...

40

Attachment 4: Unrevised SFO Paragraphs Reissued | Department...  

Energy Savers [EERE]

Documents & Publications Attachment 2: Solicitation for Offers with New and Revised Green Lease Text Attachment 1: Green Lease Policies and Procedures for Lease Acquisition...

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

Nuclear Energy Institute (NEI) Attachment, Integrated Safety...  

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

Energy Institute (NEI) Attachment, Integrated Safety Analysis Nuclear Energy Institute (NEI) Attachment, Integrated Safety Analysis This paper addresses why the use of an...

42

Audio attachment for a simple scaler  

Science Journals Connector (OSTI)

Audio attachment for a simple scaler ... Presents a circuit diagram and parts list for an audio attachment for a simple scaler. ...

Mitchell L. Borke; Alex Murray

1966-01-01T23:59:59.000Z

43

L21: "Irregular" Graph Algorithms  

E-Print Network [OSTI]

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

Hall, Mary W.

44

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

45

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

46

Energy Savings from Window Attachments  

Broader source: Energy.gov [DOE]

This study presents energy-modeling results for a large number of window combinations with window attachments in typical residential buildings and in varied climates throughout the United States.

47

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

48

Some Remarks on Definability of Process Graphs  

E-Print Network [OSTI]

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

Klop, Jan Willem

49

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

50

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

E-Print Network [OSTI]

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

Deville, Yves

51

Transforming a graph into a 1-balanced graph  

Science Journals Connector (OSTI)

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

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

2009-01-01T23:59:59.000Z

52

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

53

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

54

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

Science Journals Connector (OSTI)

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

Jolie Bell; Jim Davies

2010-01-01T23:59:59.000Z

55

Energy Savings from Window Attachments  

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

from from Window Attachments October 2013 Prepared for: Building Technologies Office Office of Energy Efficiency and Renewable Energy U.S. Department of Energy Prepared by: Lawrence Berkeley National Laboratory October 2013 Prepared for: Building Technologies Office Office of Energy Efficiency and Renewable Energy U.S. Department of Energy Prepared By: Lawrence Berkeley National Laboratory One Cyclotron Road, MS 90R3111 Berkeley, CA 94720 Authors: D. Charlie Curcija Mehry Yazdanian Christian Kohler Robert Hart Robin Mitchell Simon Vidanovic 1 ENERGY SAVINGS FROM WINDOW ATTACHMENTS TABLE OF CONTENTS: TABLE OF CONTENTS:................................................................................................... 1 1. EXECUTIVE SUMMARY ......................................................................................... 3

56

Energy Savings from Window Attachments  

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

from from Window Attachments October 2013 Prepared for: Building Technologies Office Office of Energy Efficiency and Renewable Energy U.S. Department of Energy Prepared by: Lawrence Berkeley National Laboratory October 2013 Prepared for: Building Technologies Office Office of Energy Efficiency and Renewable Energy U.S. Department of Energy Prepared By: Lawrence Berkeley National Laboratory One Cyclotron Road, MS 90R3111 Berkeley, CA 94720 Authors: D. Charlie Curcija Mehry Yazdanian Christian Kohler Robert Hart Robin Mitchell Simon Vidanovic 1 ENERGY SAVINGS FROM WINDOW ATTACHMENTS TABLE OF CONTENTS: TABLE OF CONTENTS:................................................................................................... 1 1. EXECUTIVE SUMMARY ......................................................................................... 3

57

Multilevel spectral clustering : graph partitions and image segmentation  

E-Print Network [OSTI]

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

Kong, Tian Fook

2008-01-01T23:59:59.000Z

58

XIII.1-Draft ATTACHMENT XIII  

E-Print Network [OSTI]

XIII.1-Draft ATTACHMENT XIII Review of Fischer-Tropsch Work by Statoil Three patents on Fischer are summarized below (XIII.1-XIII.3). These individuals summarize the background for their invention. Anderson amount (0.1 - 5%, preferably 0.1 to 2 wt.%) of a metal #12;XIII.3-Draft oxide promoter in addition

Kentucky, University of

59

XII.1-Draft ATTACHMENT XII  

E-Print Network [OSTI]

XII.1-Draft ATTACHMENT XII Review of Fischer-Tropsch Work by Gulf Oil The Gulf-Badger process leads analysis conducted by Gulf Oil, and later the process and engineering design provided by Badger (XII.1). A simplified process scheme is shown in XII.1 (XII.2). The process was first discovered from exploratory work

Kentucky, University of

60

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

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

SLQ: a user-friendly graph querying system  

Science Journals Connector (OSTI)

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

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

2014-06-01T23:59:59.000Z

62

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

63

On Edge Szeged Index of Bridge Graphs  

Science Journals Connector (OSTI)

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

Fuqin Zhan; Youfu Qiao

2013-01-01T23:59:59.000Z

64

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

65

Hybrid motion graph for character motion synthesis  

Science Journals Connector (OSTI)

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

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

2014-02-01T23:59:59.000Z

66

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.

67

ATTACHMENT  

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

Policy Policy Act N E P A PROCEDURES for SUBMITTING DOCUMENTS for POSTING on the DOE NEPA WEBSITE www.gc.energy.gov/NEPA August 2008 U.S. Department of Energy Office of General Counsel Office of NEPA Policy and Compliance U.S. Department of Energy, Office of NEPA Policy and Compliance August 2008 1 PREFACE The DOE NEPA Website has served as the focal point for DOE NEPA practice since it was created in 1993. A reorganization in which the Office of NEPA Policy and Compliance became part of the Office of the General Counsel provided an opportunity to modernize the original DOE NEPA Website. Therefore, the Office of NEPA Policy and Compliance recently launched a brand new DOE NEPA Website at a new internet address: www.gc.energy.gov/NEPA/. The new DOE NEPA Website contains all of the

68

Attachment  

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

Ivan'kovskoe Reservoir Ivan'kovskoe reservoir was created in 1938 by closing the Volga river waterway in the area of the town of Dubna. Major Specifications Type: River-like Water surface area: 3,278.0 km 2 Volume: 1.12 km 3 Length: 133 km Maximum width: 8.0 km Average depth: 3.4 m Maximum depth: 20.0 m Average annual water intake: through Ivan'kovskaya HPP 7.74 km 3 through Moscow Channel 6.82 km 3 Annual water exchange coefficient: 13 The major HPP facilities include the following: locks for navigation, concrete dam with eight openings designed for the maximum flow rate of 7,350 m 3 /sec and the hydroelectric station itself. The Ivan'kovskaya HPP is a low head facility, with the

69

ATTACHMENT  

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

SCIENTIFICTECHNICAL REPORTING (ReportsProducts must be submitted with appropriate DOE F 241. The 241 forms are available at www.osti.govelink) ReportProduct Form Final...

70

flash2004-18attachment1.pdf | Department of Energy  

Energy Savers [EERE]

attachment1.pdf flash2004-18attachment1.pdf flash2004-18attachment1.pdf More Documents & Publications flash2004-18attachment2.pdf flash2004-18.pdf Financial Management Handbook...

71

Attachment FY2011-74 OPAM | Department of Energy  

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

4 OPAM Attachment FY2011-74 OPAM Acquisition Letter AL 2011-05 FAL 2011-01 Attachment FY2011-74 OPAM More Documents & Publications Attachment FY2011-74 OPAM Attachment FY2011-74...

72

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

73

DNA attachment to support structures  

SciTech Connect (OSTI)

Microscopic beads or other structures are attached to nucleic acids (DNA) using a terminal transferase. The transferase adds labeled dideoxy nucleotide bases to the ends of linear strands of DNA. The labels, such as the antigens digoxigenin and biotin, bind to the antibody compounds or other appropriate complementary ligands, which are bound to the microscopic beads or other support structures. The method does not require the synthesis of a synthetic oligonucleotide probe. The method can be used to tag or label DNA even when the DNA has an unknown sequence, has blunt ends, or is a very large fragment (e.g., >500 kilobase pairs).

Balhorn, Rodney L. (Livermore, CA); Barry, Christopher H. (Fresno, CA)

2002-01-01T23:59:59.000Z

74

Split ring containment attachment device  

DOE Patents [OSTI]

A containment attachment device 10 for operatively connecting a glovebag 200 to plastic sheeting 100 covering hazardous material. The device 10 includes an inner split ring member 20 connected on one end 22 to a middle ring member 30 wherein the free end 21 of the split ring member 20 is inserted through a slit 101 in the plastic sheeting 100 to captively engage a generally circular portion of the plastic sheeting 100. A collar potion 41 having an outer ring portion 42 is provided with fastening means 51 for securing the device 10 together wherein the glovebag 200 is operatively connected to the collar portion 41.

Sammel, Alfred G. (Pittsburgh, PA)

1996-01-01T23:59:59.000Z

75

Methane production by attached film  

DOE Patents [OSTI]

A method for purifying wastewater of biodegradable organics by converting the organics to methane and carbon dioxide gases is disclosed, characterized by the use of an anaerobic attached film expanded bed reactor for the reaction process. Dilute organic waste material is initially seeded with a heterogeneous anaerobic bacteria population including a methane-producing bacteria. The seeded organic waste material is introduced into the bottom of the expanded bed reactor which includes a particulate support media coated with a polysaccharide film. A low-velocity upward flow of the organic waste material is established through the bed during which the attached bacterial film reacts with the organic material to produce methane and carbon dioxide gases, purified water, and a small amount of residual effluent material. The residual effluent material is filtered by the film as it flows upwardly through the reactor bed. In a preferred embodiment, partially treated effluent material is recycled from the top of the bed to the bottom of the bed for further treatment. The methane and carbon dioxide gases are then separated from the residual effluent material and purified water.

Jewell, William J. (202 Eastwood Ave., Ithaca, NY 14850)

1981-01-01T23:59:59.000Z

76

Aspects on damper-attachment compliance  

Science Journals Connector (OSTI)

This paper investigates how attachment compliance coming from mounting bushings or brackets affects damper efficiency. Analyses with a simple mass-spring-damper system show that compliance in damper-attachment points reduces the damper efficiency. If however vibration isolation of the mass is considered, it may be seen that compliance increases low frequency vibrations but reduces high frequency vibrations. Through analyses of this system, the relative damping ratio is studied as a function of excitation frequency and attachment stiffness. Numerical values of typical damper-attachment stiffness in heavy vehicles are furthermore obtained from both static finite element (FE) analysis of the chassis frame and from dynamic FE analysis of a tractor. The effect damper-attachment compliance has on vehicle behaviour is finally quantified with MBS simulations of a tractor semi trailer combination. It is found that attachment stiffness should be considered when simulating load cases containing high frequency inputs.

Peter Holen; Mathias Zellinger

2006-01-01T23:59:59.000Z

77

Bonneville Power Administration Attachment P Oversupply Management...  

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

Transmission Provider will displace all such Generators on a pro-rata basis. Bonneville Power Administration Attachment P Oversupply Management Protocol Open Access Transmission...

78

Knot Theory For Spatial Graphs Attached To A Surface Akio Kawauchi  

E-Print Network [OSTI]

such as a virus of EBOLA haemorrhagic fever in Figure 3 1 are scientific examples. In a research of proteins number are explained for a 1 http://www.scumdoctor.com/Japanese/disease-prevention/infectious- diseases/virus/ebola /Pictures-Of-The-Effects-Of-Ebola.html #12;Figure 2: Topological models of prion proteins Figure 3: A string

Kawauchi, Akio

79

Security of graph data: hashing schemes and definitions  

Science Journals Connector (OSTI)

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

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

2014-03-01T23:59:59.000Z

80

Attachment 1-SF 18.doc  

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

QUOTATIONS QUOTATIONS This Notice of Small Business-Small-Purchase Set-Aside on the Attachment 1 PAGE OF PAGES (THIS IS NOT AN ORDER) reverse of this form is not applicable. 1 1 REQUEST NO. DE-RQ01-04ME90001 DATE ISSUED June 16,2004 18. REQUISITION/PURCHASE REQUEST NO. 01-04ME90001.000 18. CERT. FOR NAT.DEF. UNDER BDSA REG.2 AND/OR DMS REG. 1 ⇒ RATING 5A. ISSUED BY 6. DELIVER BY (Date) U.S. Department of Energy Office of Headquarters Procurement Services, ME-641.2 1000 Independence Avenue, SW Washington, D.C. 20585 7. DELIVERY 5B. FOR INFORMATION CALL: (Name and telephone no.) (No collect calls) Debbie Draper (202) 287-1437 FOB OTHER

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

Locating-total domination in graphs  

Science Journals Connector (OSTI)

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

Michael A. Henning; Nader Jafari Rad

2012-01-01T23:59:59.000Z

82

API Requirements for Dynamic Graph Prediction  

SciTech Connect (OSTI)

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

Gallagher, B; Eliassi-Rad, T

2006-10-13T23:59:59.000Z

83

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

E-Print Network [OSTI]

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

Dave

2012-03-20T23:59:59.000Z

84

On real number labelings and graph invertibility  

Science Journals Connector (OSTI)

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

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

2012-10-01T23:59:59.000Z

85

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

86

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.

87

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

88

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

89

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

90

ATTACHMENT A - CHECKLIST FOR SELF ASSESSMENT  

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

ATTACHMENT A - CHECKLIST FOR SELF ASSESSMENT ATTACHMENT A - CHECKLIST FOR SELF ASSESSMENT Site: Federal or Contractor Program: Name: ____________________________________________ Title:______________________________________________ Organization:_______________________________________ Address: __________________________________________ Bldg and Room Number _____________________________ Phone Number __________________ E-Mail ________________________________ Years of Records Management experience? Length of time in current position? Training? __________________________________________________________________ Signature: Date: 02/03/2010 2 INSTITUTIONALIZATION

91

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

92

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

93

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

94

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

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

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

95

ATTACHMENT J.3 - APPENDIX C  

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

M060 M060 Contract No.: DE-AC02-09CH11466 Section J - Appendix C J-C-1 ATTACHMENT J.3 APPENDIX C SPECIAL FINANCIAL INSTITUTION ACCOUNT AGREEMENT Applicable to the Operation of PPPL Contract No. DE-AC02-09CH11466 Modification No. M060 Contract No.: DE-AC02-09CH11466 Section J - Appendix C J-C-2 Modification No. M060 Contract No.: DE-AC02-09CH11466 Section J - Appendix C J-C-3 Modification No. M060 Contract No.: DE-AC02-09CH11466 Section J - Appendix C J-C-4 Modification No. M060 Contract No.: DE-AC02-09CH11466 Section J - Appendix C J-C-5 Modification No. M060 Contract No.: DE-AC02-09CH11466 Section J - Appendix C J-C-6 Modification No. M060 Contract No.: DE-AC02-09CH11466 Section J - Appendix C J-C-7 Modification No. M060 Contract No.: DE-AC02-09CH11466

96

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

National Nuclear Security Administration (NNSA)

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

97

Flash2004-23Attachment_2.pdf | Department of Energy  

Office of Environmental Management (EM)

Flash2004-23Attachment2.pdf Flash2004-23Attachment2.pdf More Documents & Publications December 12, 2013 Business Opportunity Session Presentations Attachment FY2011-28 OPAM...

98

Attachment FY2011-77 OPAM | Department of Energy  

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

7 OPAM Attachment FY2011-77 OPAM Data Quality Plan Attachment FY2011-77 OPAM More Documents & Publications Policy Flash 2011-77 Attachment 2 Source Selection Guide Source Selection...

99

flash2004-18attachment2.pdf | Department of Energy  

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

flash2004-18attachment2.pdf flash2004-18attachment2.pdf More Documents & Publications flash2004-18attachment1.pdf Financial Management Handbook AcqGuide70pt4.doc&0;...

100

Attachment FY2011-73 OPAM | Department of Energy  

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

73 OPAM Attachment FY2011-73 OPAM Acquisition Letter AL-2011-04 Attachment FY2011-73 OPAM More Documents & Publications Policy Flash 2011-73 G Attachment FY2011-68...

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

Attachment FY2011-68 OPAM | Department of Energy  

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

68 OPAM Attachment FY2011-68 OPAM Acquisition Letter AL-2011-04 Attachment FY2011-68 OPAM More Documents & Publications Flash2011-68 OPAM Policy Flash 2011-73 Attachment FY2011-73...

102

LD-graphs and global location-domination in bipartite graphs  

Science Journals Connector (OSTI)

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

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

2014-01-01T23:59:59.000Z

103

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

104

Extremal optimization for graph partitioning Stefan Boettcher*  

E-Print Network [OSTI]

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

Percus, Allon

105

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

106

Feature Tracking Using Reeb Graphs  

SciTech Connect (OSTI)

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

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

2010-08-02T23:59:59.000Z

107

Path Integral on Star Graph  

E-Print Network [OSTI]

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

Satoshi Ohya

2011-04-28T23:59:59.000Z

108

Path Integral on Star Graph  

E-Print Network [OSTI]

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

Ohya, Satoshi

2011-01-01T23:59:59.000Z

109

Attachment FY2011-25 OPAM | Department of Energy  

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

OPAM Attachment FY2011-25 OPAM Federal Leadership in Environmental, Energy, and Economic Performance Attachment FY2011-25 OPAM More Documents & Publications Chapter 23 -...

110

Information seeking in attachment style romantic relationships  

E-Print Network [OSTI]

about a relationship when in a stressful situation and offered either a supportive or unsupportive note from a romantic partner. As hypothesized, a high degree of attachment ambivalence and an unsupportive note predicted more negative information...

Derrick, Jaye Lindsay

2013-02-22T23:59:59.000Z

111

Chemomechanics of attached and suspended cells  

E-Print Network [OSTI]

Chemomechanical coupling in single eukaryotic animal cells is investigated in the con- text of the attached (substratum-adhered) and the suspended (free-floating) states. These dichotomous configurations determine behavioral ...

Maloney, John Mapes

2012-01-01T23:59:59.000Z

112

EXHIBIT G7.0 Attachment 2  

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

G7.0 Attachment 2 32014 Page 1 SUBCONTRACTOR CYBER SECURITY PLAN Vendor Name (if Applicable): Subcontract No. PR- Ex. G dated: XXXXXX Rev. No.: 7 Pursuant to the requirements in...

113

Reactive Attachment Disorder: Concepts, Treatment, and Research  

E-Print Network [OSTI]

Reactive Attachment Disorder (RAD) is a disorder characterized by controversy, both with respect to its definition and its treatment. By definition, the RAD diagnosis attempts to characterize and explain the origin of ...

Walter, Uta M.; Petr, Chris

2004-06-01T23:59:59.000Z

114

Approximate von Neumann entropy for directed graphs  

Science Journals Connector (OSTI)

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

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

2014-05-12T23:59:59.000Z

115

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

116

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

117

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.

118

Optimal acyclic edge colouring of grid like graphs  

Science Journals Connector (OSTI)

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

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

2010-11-01T23:59:59.000Z

119

Discrete Mathematics Algebraic and Topological Methods in Graph Theory  

E-Print Network [OSTI]

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

Mohar, Bojan

120

Fibonacci-like cubes as Z-transformation graphs  

Science Journals Connector (OSTI)

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

Heping Zhang, Lifeng Ou, Haiyuan Yao

2009-04-01T23:59:59.000Z

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

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.

122

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

123

3-Rainbow Domination Number in Graphs  

Science Journals Connector (OSTI)

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

Kung-Jui Pai; Wei-Jai Chiu

2013-01-01T23:59:59.000Z

124

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.

125

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

126

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

127

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

128

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

129

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

130

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

131

Progressive transitions using body part motion graphs  

Science Journals Connector (OSTI)

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

Adso Fernndez-Baena; David Miralles

2011-12-01T23:59:59.000Z

132

A Faster Algorithm for Computing Motorcycle Graphs  

Science Journals Connector (OSTI)

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

Antoine Vigneron, Lie Yan

2014-10-01T23:59:59.000Z

133

About equivalent interval colorings of weighted graphs  

Science Journals Connector (OSTI)

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

Mathieu Bouchard; Mirjana angalovi?; Alain Hertz

2009-10-01T23:59:59.000Z

134

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

135

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

136

Nuclear reactor fuel rod attachment system  

DOE Patents [OSTI]

A reusable system for removably attaching a nuclear reactor fuel rod (12) to a support member (14). A locking cap (22) is secured to the fuel rod (12) and a locking strip (24) is fastened to the support member (14). The locking cap (22) has two opposing fingers (24a and 24b) shaped to form a socket having a body portion (26). The locking strip has an extension (36) shaped to rigidly attach to the socket's body portion (26). The locking cap's fingers are resiliently deflectable. For attachment, the locking cap (22) is longitudinally pushed onto the locking strip (24) causing the extension (36) to temporarily deflect open the fingers (24a and 24b) to engage the socket's body portion (26). For removal, the process is reversed.

Christiansen, David W. (Kennewick, WA)

1982-01-01T23:59:59.000Z

137

Attachment device for an inflatable protective cushion  

DOE Patents [OSTI]

An inflatable cushion assembly for use with an inflator comprises an inflatable cushion having an inner surface, outer surface, and at least one protrusion extending from one of the inner or outer surfaces. The inflatable cushion defines an opening between the inner surface and the outer surface for receiving the inflator. An attachment member contacts the one of the inner or outer surfaces adjacent the opening and includes a groove for receiving the protrusion, the attachment member securing the inflator within the opening. 22 figs.

Nelsen, J.M.; Luna, D.A.; Gwinn, K.W.

1998-12-08T23:59:59.000Z

138

Topology induced bifurcations for the NLS on the tadpole graph  

E-Print Network [OSTI]

In this paper we give the complete classification of solitons for a cubic NLS equation on the simplest network with a non-trivial topology: the tadpole graph, i.e. a ring with a half-line attached to it and free boundary conditions at the junction. The model, although simple, exhibits a surprisingly rich behavior and in particular we show that it admits: 1) a denumerable family of continuous branches of embedded solitons bifurcating from linear eigenstates and threshold resonances of the system; 2) a continuous branch of edge solitons displaying a pitchfork symmetry breaking bifurcation at the threshold of the continuous spectrum; 3) a finite family of continuous branches of solitons without linear analogue. All the solutions are explicitly constructed in terms of elliptic Jacobian functions. Moreover we show that families of nonlinear bound states of the above kind continue to exist in the presence of a uniform magnetic field orthogonal to the plane of the ring when a well definite flux quantization condition holds true. Finally we highlight the role of resonances in the linearization as a signature of the occurrence of bifurcations of solitons from the continuous spectrum.

C. Cacciapuoti; D. Finco; D. Noja

2014-05-14T23:59:59.000Z

139

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

E-Print Network [OSTI]

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

Durocher, Stephane

140

Perchlorate Reduction by Autotrophic Bacteria Attached to  

E-Print Network [OSTI]

). For the treatment of perchlorate-contaminated ground- water, biological remediation is the preferred technology attached to ZVI. Overall, the process appears to be a promising alternative for perchlorate remediation in surface water and groundwater. Perchlorate disrupts the production of thyroid

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

ATTACHMENT A PROJECT PERFORMANCE METRICS (DRAFT)  

E-Print Network [OSTI]

metrics submission. The focus areas are: weather, climate change and variability, atmospheric compositionATTACHMENT A PROJECT PERFORMANCE METRICS (DRAFT) REASoN projects are required to collect and report on the metrics noted in Table A. These data will be reported from the projects on a monthly basis with six month

Christian, Eric

142

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

143

Combinatorial discovery of polymers resistant to bacterial attachment  

E-Print Network [OSTI]

Bacterial attachment and subsequent biofilm formation pose key challenges to the optimal performance of medical devices. In this study, we determined the attachment of selected bacterial species to hundreds of polymeric ...

Hook, Andrew L

144

Microsoft Word - Policy Flash 2010-81 Attachment 1 | Department...  

Energy Savers [EERE]

Flash 2010-81 Attachment 1 Microsoft Word - Policy Flash 2010-81 Attachment 2 Policy Flash 2014-13 AL 2014-03: Allowability of Contractor Litigation Defense and Settlement Costs...

145

Attachment FY2011-12 | Department of Energy  

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

12 Attachment FY2011-12 Indirect Cost Rate Administration Attachment FY2011-12 More Documents & Publications AcqGuide42pt1.doc&0; Department of Energy Chapter 42 - Contract...

146

Sequoia tops Graph 500 list of 'big data' supercomputers  

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

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

147

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

148

Synthesis of Parallel Hardware Implementations from Synchronous Dataflow Graph Specifications  

E-Print Network [OSTI]

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

149

Synthesis of Parallel Hardware Implementations from Synchronous Dataflow Graph Specifications  

E-Print Network [OSTI]

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

150

Towards a Query-by-Example System for Knowledge Graphs  

Science Journals Connector (OSTI)

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

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

2014-06-01T23:59:59.000Z

151

Graph Expansion, Tseitin Formulas and Resolution Proofs for CSP  

Science Journals Connector (OSTI)

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

Dmitry Itsykson; Vsevolod Oparin

2013-01-01T23:59:59.000Z

152

Graph isomorphism and adiabatic quantum computing  

Science Journals Connector (OSTI)

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

Frank Gaitan and Lane Clark

2014-02-28T23:59:59.000Z

153

BAG: a graph theoretic sequence clustering algorithm  

Science Journals Connector (OSTI)

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

Sun Kim; Jason Lee

2006-01-01T23:59:59.000Z

154

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

155

Entanglement of graph states up to 8 qubits  

E-Print Network [OSTI]

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

Xiao-yu Chen

2009-09-09T23:59:59.000Z

156

A survey of models of the web graph Anthony Bonato  

E-Print Network [OSTI]

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

Bonato, Anthony

157

Comparison of coarsening schemes for multilevel graph partitioning  

E-Print Network [OSTI]

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

Safro, Ilya

158

On minimum balanced bipartitions of triangle-free graphs  

Science Journals Connector (OSTI)

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

Haiyan Li; Yanting Liang; Muhuo Liu; Baogang Xu

2014-04-01T23:59:59.000Z

159

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

160

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.

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

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

162

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

163

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

164

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

165

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

166

EFFECTIVE RESISTANCE ON GRAPHS AND THE EPIDEMIC QUASIMETRIC  

E-Print Network [OSTI]

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

Poggi-Corradini, Pietro

167

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

168

Attachment 7 - Solicitation Provisions.doc  

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

Attachment 7 Attachment 7 1 FAR CLAUSES 52.204-7 Central Contractor Registration (Oct 2003) (a) Definitions. As used in this clause- "Central Contractor Registration (CCR) database" means the primary Government repository for Contractor information required for the conduct of business with the Government. "Data Universal Numbering System (DUNS) number" means the 9-digit number assigned by Dun and Bradstreet, Inc. (D&B) to identify unique business entities. "Data Universal Numbering System +4 (DUNS+4) number" means the DUNS number assigned by D&B plus a 4-character suffix that may be assigned by a business concern. (D&B has no affiliation with this 4-character suffix.) This 4-character suffix may be assigned at the discretion

169

Mass and fans in attached sunspaces  

SciTech Connect (OSTI)

The effect of thermal storage mass on the performance of an attached sunspace is investigated for a particular design in Boston. Mass in the sunspace and in the adjoining building are compared. Performance is evaluated in terms of temperature conditions in the sunspace and delivery of useful solar heat to the adjoining building. The dependence of the results on the manner of heat delivery is studied. Both natural convection and fan-forced air flow are included.

Jones, R.W.; McFarland, R.D.; Lazarus, G.S.

1982-01-01T23:59:59.000Z

170

Attachment and memory for negative emotional events  

E-Print Network [OSTI]

Control of Emotions on Explicit Memory. . . . . . Interaction of Anxiety X EEQ Positive Affect on Explicit Memory. . 50 51 51 Mediation Model 52 Interaction of Anxiety X Video Mood on Explicit Memory 52 Interaction of Avoidance X Sex on Imphcit... monitored their responses to the video content through a hidden camera in the laboratory room. The video clip, which came from the Swedish film Autumn Sonata directed by Ingmar Bergman, was selected on the basis of its negative, attachment-relevant content...

Wilson, Carol Leigh

2012-06-07T23:59:59.000Z

171

Interpersonal violence, drug use, and adult attachment  

E-Print Network [OSTI]

Gruder et al. (1996), nearly third (31. 75'/0) of their sample reported at least one negative sexual experience. Sexual trauma may create the inost severe and long-lasting effects. In a study by Valentiner, Foa, Riggs, and Gershuny (1996), PTSD symptoms.... Interpersonal Violence 23 References American Psychiatric Association. (1994). Dia ostic and Statistical Manual Fou h Edition. Bowlby, J. (1980). Attachment and Loss: Volume 3. Loss Sadness and de ression. New York: Basic Books. Brondy, T. , & Davidson, E...

Murphy, Amy Anne

2013-02-22T23:59:59.000Z

172

Parameterized Algorithms for Graph Partitioning Problems  

E-Print Network [OSTI]

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

Shachnai, Hadas

173

Algorithms for Graphs (Locally) Bounded Treewidth  

E-Print Network [OSTI]

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

Hajiaghayi, Mohammad

174

Graph Domination, Coloring and Cliques in Telecommunications  

E-Print Network [OSTI]

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

Butenko, Sergiy

175

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

176

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

177

Connected obstructions to full graph homomorphisms  

Science Journals Connector (OSTI)

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

Pavol Hell, Ale Pultr

2014-10-01T23:59:59.000Z

178

Graph Processing on an "almost" Relational Database  

Science Journals Connector (OSTI)

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

Ramesh Subramonian

2014-06-01T23:59:59.000Z

179

Betti Numbers of Graph Sean Jacques  

E-Print Network [OSTI]

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

Katzman, Moty

180

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

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

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.

182

Policy_Flash_2011-85__Attachment_2.pdf | Department of Energy  

Energy Savers [EERE]

PolicyFlash2011-85Attachment2.pdf PolicyFlash2011-85Attachment2.pdf PolicyFlash2011-85Attachment2.pdf More Documents & Publications Attachment FY2011-46(1) OPAM...

183

The influence of search engines on preferential attachment Alan Frieze  

E-Print Network [OSTI]

Abstract There is much current interest in the evolution of social networks, in particular, the Web graph the observed power-law degree distribution of the Web graph reasonably well. However, existing evolution models do not include the significant influence of search engines on how Web page authors find existing

Frieze, Alan

184

Attachment 10 - SCA Washington.doc  

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

-1183 37 Elevator Services [8] DE-RQ01-04ME90001 -1183 37 Elevator Services [8] DE-RQ01-04ME90001 ATTACHMENT 10 REGISTER OF WAGE DETERMINATIONS UNDER ³ U.S. DEPARTMENT OF LABOR THE SERVICE CONTRACT ACT ³ EMPLOYMENT STANDARDS ADMINISTRATION By direction of the Secretary of Labor ³ WAGE AND HOUR DIVISION ³ WASHINGTON, D.C. 20210 ³ ³ William W. Gross Division of Wage ³ Wage Determination No: 1978-1183 Director Determinations ³ Revision No: 37 ³ Date Of Revision: 06/02/2003 --------------------------------------------------------------------------------

185

al99-06attachment.doc  

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

------------------------------- ------------------------------- -------------------------AL-99-06[DATED 8/27/99] ATTACHMENT MODEL PROJECT AGREEMENT FOR PARTNER PROJECTS BETWEEN THE INTERNATIONAL SCIENCE AND TECHNOLOGY CENTER, INSTITUTIONS IN THE RUSSIAN FEDERATION AND OTHER INTERESTED STATES OF THE CIS AND PARTNER/DOE NATIONAL LABORATORIES 2 PROJECT AGREEMENT between THE INTERNATIONAL SCIENCE AND TECHNOLOGY CENTER, (NAME OF RECIPIENT), and (NAME OF PARTNER) The International Science and Technology Center (hereinafter referred to as "Center"), _____________ (name of Institute in the Russian Federation or other interested State of the Commonwealth of Independent States or CIS) (hereinafter referred to as "Recipient") and _______________ (name of Partner)

186

ATTACHMENT L-__ PAST PERFORMANCE INFORMATION QUESTIONNAIRE  

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

PAST PERFORMANCE INFORMATION QUESTIONNAIRE PAST PERFORMANCE INFORMATION QUESTIONNAIRE COVER LETTER (JUL 2010) Date Dear:_______________ The Department of Energy is seeking your assistance on a very important procurement. __[insert name of offeror]___________________________is participating in a proposal for a DOE contract. _[insert name of offeror]____________has identified you as someone who is familiar with their past performance on similar work. We are asking you to complete the attached Past Performance Information Questionnaire to help DOE evaluate __[insert name of offeror]_________________'s past performance. We greatly appreciate your time and assistance in completing this questionnaire. In accordance with Part 15.506 of the Federal Acquisition Regulation, the names of

187

Attachment 9 - SCA Oregon.doc  

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

439 OR,EUGENE DE-RQ01-04ME90001 439 OR,EUGENE DE-RQ01-04ME90001 ATTACHMENT 9 WAGE DETERMINATION NO: 94-2439 REV (20) AREA: OR,EUGENE HEALTH AND WELFARE LEVEL - INSURANCE ONLY **OTHER WELFARE LEVEL WD: 94-2440** ****************************************************************************** REGISTER OF WAGE DETERMINATIONS UNDER | U.S. DEPARTMENT OF LABOR THE SERVICE CONTRACT ACT | EMPLOYMENT STANDARDS ADMINISTRATION By direction of the Secretary of Labor | WAGE AND HOUR DIVISION | WASHINGTON D.C. 20210 | | | | Wage Determination No.: 1994-2439

188

Attachment 8 - SCA Washington.doc  

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

103 DC,DISTRICT-WIDE DE-RQ01-04ME90001 103 DC,DISTRICT-WIDE DE-RQ01-04ME90001 ATTACHMENT 8 WAGE DETERMINATION NO: 94-2103 REV (30) AREA: DC,DISTRICT-WIDE HEALTH AND WELFARE LEVEL - INSURANCE ONLY **OTHER WELFARE LEVEL WD: 94-2104** ****************************************************************************** REGISTER OF WAGE DETERMINATIONS UNDER | U.S. DEPARTMENT OF LABOR THE SERVICE CONTRACT ACT | EMPLOYMENT STANDARDS ADMINISTRATION By direction of the Secretary of Labor | WAGE AND HOUR DIVISION | WASHINGTON D.C. 20210 | | | | Wage Determination No.: 1994-2103

189

PART III -LIST OF DOCUMENTS, EXHIBITS AND OTHER ATTACHMENTS SECTION J -LIST OF ATTACHMENTS  

E-Print Network [OSTI]

are located in the ORNL Human Resources Operating Plan (HROP). (b) The Contractor shall select, manage APPENDIX A PERSONNEL COSTS AND RELATED EXPENSES Attached to this Appendix A is the parties advanced ABSENCE FROM THE WORKPLACE 11 IX. EMPLOYEE TRAINING, EDUCATION AND DEVELOPMENT 12 X. EMPLOYEE PROGRAMS 13

190

Microsoft Word - ATTACHMENT A Suppl 5.doc  

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

ATTACHMENT A: ATTACHMENT A: Modeling in Support of Additional Two-Unit Operating Configurations Unit 1 & Unit 2 Operation - SO2 Table Mirant Potomac, Alexandria, Virginia Maximum Impacts Predicted by AERMOD-PRIME Compliance Based on Highest, Second-Highest Short-term and Highest Annual Concentrations Units 1 & 2 on 24 hrs/day @ Max load SO2 = 0.31 lb/MBtu for both units. AERMOD- PRIME Monitored Background AERMOD-PRIME + Background NAAQS Distance Direction Ground Elevation Flagpole Elevation X (m) Y (m) m deg m m 3-hour 608 238.4 847 1300 322770.8 4298791.5 182.7 349 6.1 39.6 24-hour 330 27.0 357 365 322880.8 4298542.5 102.7 133 6.7 0.0 Annual* 31 15.7 47 80 322880.8 4298542.5 102.7 133 6.7 0.0 3-hour 651 238.4 889 1300 322770.8 4298791.5 182.7 349 6.1 39.6 24-hour 327 27.0 354 365 322880.8 4298542.5 102.7 133 6.7

191

Predicting Envelope Leakage in Attached Dwellings  

SciTech Connect (OSTI)

The most common method for measuring air leakage is to use a single blower door to pressurize and/or depressurize the test unit. In detached housing, the test unit is the entire home and the single blower door measures air leakage to the outside. In attached housing, this 'single unit', 'total', or 'solo' test method measures both the air leakage between adjacent units through common surfaces as well air leakage to the outside. Measuring and minimizing this total leakage is recommended to avoid indoor air quality issues between units, reduce energy losses to the outside, reduce pressure differentials between units, and control stack effect. However, two significant limitations of the total leakage measurement in attached housing are: for retrofit work, if total leakage is assumed to be all to the outside, the energy benefits of air sealing can be significantly over predicted; for new construction, the total leakage values may result in failing to meet an energy-based house tightness program criterion. The scope of this research is to investigate an approach for developing a viable simplified algorithm that can be used by contractors to assess energy efficiency program qualification and/or compliance based upon solo test results.

Faakye, O.; Arena, L.; Griffiths, D.

2013-07-01T23:59:59.000Z

192

A Parallel Graph Partitioner for STAPL  

E-Print Network [OSTI]

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

Castet, Nicolas

2013-04-26T23:59:59.000Z

193

Policy Flash 2011-2 Attachment 1 | Department of Energy  

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

1 Policy Flash 2011-2 Attachment 1 During election seasons, questions arise regarding political activities on DOE facilities or using DOE email addresses. The General Counsel has...

194

A Low Cost Spectrographic Attachment for an Echelle Spectrometer  

Science Journals Connector (OSTI)

The report describes a simple, low cost photographic attachment for an echelle spectrometer. The crossed dispersion prism/echelle grating system provides a high resolution spectrum...

Brackett, John M; Mitchell, Joel C; Vickers, Thomas J

1983-01-01T23:59:59.000Z

195

ATTACHMENT A - CHECKLIST FOR SELF ASSESSMENT | Department of...  

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

ASSESSMENT ATTACHMENT A - CHECKLIST FOR SELF ASSESSMENT More Documents & Publications Assessment B - Program Criteria Assessment C-Site Visit Protocol Records Management Handbook...

196

Safety Culture at the WTP White Paper: Potential Attachment for...  

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

292011 Page 1 of 6 Safety Culture at the WTP White Paper: Potential Attachment for Advice on Waste Treatment Plant Safety Culture Introduction This white paper provides context...

197

Building America Expert Meeting: Cladding Attachment Over Exterior Insulation  

Broader source: Energy.gov [DOE]

This expert meeting was conducted by Building Science Corporation on July 28, 2012 and focused on issues surrounding cladding attachment and performance of walls with exterior insulating sheathing.

198

Attachment 2: Solicitation for Offers with New and Revised Green...  

Office of Environmental Management (EM)

2: Solicitation for Offers with New and Revised Green Lease Text Attachment 2: Solicitation for Offers with New and Revised Green Lease Text Solicitation for Offers Paragraphs with...

199

Attachment 1: Green Lease Policies and Procedures for Lease Acquisitio...  

Office of Environmental Management (EM)

1: Green Lease Policies and Procedures for Lease Acquisition Attachment 1: Green Lease Policies and Procedures for Lease Acquisition Green Lease Policies and Procedures for Lease...

200

Attachment 3: Instructions for Use of Green Lease Solicitation...  

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

3: Instructions for Use of Green Lease Solicitation Paragraph Reference Chart Attachment 3: Instructions for Use of Green Lease Solicitation Paragraph Reference Chart...

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

Attachment C Summary GHG Emissions Data FINAL | Department of...  

Office of Environmental Management (EM)

Documents & Publications Attachment C - Summary GHG Emissions Data FINAL Amendment: Energy and Emissions Benefit Table (December 30, 2008) Output-Based Regulations: A Handbook...

202

Attachment informed relationship education: An integrated approach to relationship education.  

E-Print Network [OSTI]

??ABSTRACT ATTACHMENT INFORMED RELATIONSHIP EDUCATION: AN INTEGRATED APPROACH TO RELATIONSHIP EDUCATION By Jessica A. Perez Master of Science in Counseling, Marriage and Family Therapy This (more)

Perez, Jessica

2015-01-01T23:59:59.000Z

203

Locating-total domination in claw-free cubic graphs  

Science Journals Connector (OSTI)

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

Michael A. Henning; Christian Lwenstein

2012-01-01T23:59:59.000Z

204

Sharp thresholds for Hamiltonicity in random intersection graphs  

Science Journals Connector (OSTI)

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

Charilaos Efthymiou; Paul G. Spirakis

2010-09-01T23:59:59.000Z

205

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

206

Ising-like models on arbitrary graphs : the Hadamard way  

E-Print Network [OSTI]

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

Mosseri, Rmy

2014-01-01T23:59:59.000Z

207

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

208

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

209

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

E-Print Network [OSTI]

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

2011-03-17T23:59:59.000Z

210

Isomorphism testing for circulant graphs Cn(a, b)  

E-Print Network [OSTI]

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

2010-03-10T23:59:59.000Z

211

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

212

Attachment 13 - DB Oregon.doc  

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

OR030001 02/13/2004 OR1 DE-RQ01-04ME90001 OR030001 02/13/2004 OR1 DE-RQ01-04ME90001 ATTACHMENT 13 Superseded General Decision Number: OR020001 State: Oregon Construction Types: Building Counties: Baker, Benton, Clackamas, Clatsop, Columbia, Crook, Deschutes, Gilliam, Grant, Harney, Hood River, Jackson, Jefferson, Klamath, Lake, Lane, Lincoln, Linn, Malheur, Marion, Morrow, Multnomah, Polk, Sherman, Tillamook, Umatilla, Union, Wallowa, Wasco, Washington, Wheeler and Yamhill Counties in Oregon. BUILDING CONSTRUCTION PROJECTS (does not include residential construction consisting of single family homes and apartments up to and including 4 stories) Modification Number Publication Date 0 06/13/2003 1 02/06/2004

213

Attachment FY2011-55 OPAM  

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

1, Summary of Small Business 1, Summary of Small Business Administration and Department of Energy Partnership Agreement Reference: FAR 19.8 Overview Recently, the Secretary and the Administrator of the Small Business Administration (SBA) executed a Partnership Agreement to expedite the award of requirements pursuant to section 8(a) of the Small Business Act. It will remain in effect through September 30, 2012. A copy is attached. This section discusses the effects of that Partnership Agreement on the way Department of Energy (DOE) contracting officers process awards under the 8(a) Program. Background Section 8(a) of the Small Business Act provides for the award of contracts to the SBA and the award of a subcontract to a small disadvantaged businesses accepted into the SBA's 8(a)

214

Predicting Envelope Leakage in Attached Dwellings  

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

Predicting Envelope Leakage in Predicting Envelope Leakage in Attached Dwellings Dianne Griffiths April 30, 2013 Presentation Outline * Objectives * What we accomplished last year * What we plan to do this year Why do we do blower door testing? * Compliance to some standard * Identify opportunity for reducing energy use * Identify opportunity for improving IAQ * Measure implementation verification Total (or Solo) Leakage Test P = 50 Pa P = 50 Pa P = 50 Pa P = 50 Pa Open windows, open doors, same test pressure across whole envelope. If pressure across envelope at any point is different from test pressure by less than 5 Pa, not neccessary. "Fully" Guarded Test P = 0 Pa P = 0 Pa P = 50 Pa P = 0 Pa Isolates exterior leakage What's the big deal? * How we measure depends on why we're

215

Vacuum die attach for integrated circuits  

DOE Patents [OSTI]

A thin film eutectic bond for attaching an integrated circuit die to a circuit substrate is formed by coating at least one bonding surface on the die and substrate with an alloying metal, assembling the die and substrate under compression loading, and heating the assembly to an alloying temperature in a vacuum. A very thin bond, 10 microns or less, which is substantially void free, is produced. These bonds have high reliability, good heat and electrical conduction, and high temperature tolerance. The bonds are formed in a vacuum chamber, using a positioning and loading fixture to compression load the die, and an IR lamp or other heat source. For bonding a silicon die to a silicon substrate, a gold silicon alloy bond is used. Multiple dies can be bonded simultaneously. No scrubbing is required. 1 figure.

Schmitt, E.H.; Tuckerman, D.B.

1991-09-10T23:59:59.000Z

216

Attachment 11 - DB Washington.doc  

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

DC030003 01/02/2004 DC3 DE-RQ01-04ME90001 DC030003 01/02/2004 DC3 DE-RQ01-04ME90001 ATTACHMENT 11 Superseded General Decision Number: DC020003 State: District of Columbia Construction Type: Building County: District of Columbia Statewide. BUILDING CONSTRUCTION PROJECTS (Does not include single family homes and apartments up to and including 4 stories) Modification Number Publication Date 0 06/13/2003 1 10/03/2003 2 10/31/2003 3 01/02/2004 ASBE0024-001 03/01/2003 Rates Fringes Asbestos Worker/Heat and Frost Insulator Includes application of all insulating materials, protective coverings, coatings and

217

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

218

Ising models on power-law random graphs Sander Dommers  

E-Print Network [OSTI]

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

Hofstad, Remco van der

219

GRAPH THEORY AND PFAFFIAN REPRESENTATIONS OF ISING PARTITION FUNCTION.  

E-Print Network [OSTI]

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

Recanati, Catherine

220

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

Science Journals Connector (OSTI)

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

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

2011-02-01T23:59:59.000Z

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

Local algorithms for the prime factorization of strong product graphs  

E-Print Network [OSTI]

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

Stadler, Peter F.

222

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

223

A SPATIAL WEB GRAPH MODEL WITH LOCAL INFLUENCE REGIONS  

E-Print Network [OSTI]

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

Pralat, Pawel

224

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

225

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

226

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

227

New approximation algorithms for minimum cycle bases of graphs  

Science Journals Connector (OSTI)

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

Telikepalli Kavitha; Kurt Mehlhorn; Dimitrios Michail

2007-02-01T23:59:59.000Z

228

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

229

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

230

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

231

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

232

Fast top-k simple shortest paths discovery in graphs  

Science Journals Connector (OSTI)

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

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

2010-10-01T23:59:59.000Z

233

Some Remarks on Factor Graphs Hans-Andrea Loeliger  

E-Print Network [OSTI]

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

Loeliger, Hans-Andrea

234

Which Codes Have Cycle-Free Tanner Graphs?  

E-Print Network [OSTI]

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

Karpovsky, Mark

235

Graph-based Image Segmentation Using Weighted Color Patch  

E-Print Network [OSTI]

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

Paris-Sud XI, Université de

236

THE ELECTRICAL RESISTANCE OF A GRAPH CAPTURES ITS  

E-Print Network [OSTI]

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

Borenstein, Elhanan

237

A COMBINATORIAL PROOF OF RAYLEIGH MONOTONICITY FOR GRAPHS  

E-Print Network [OSTI]

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

238

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

239

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

240

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

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

International energy indicators. [Statistical tables and graphs  

SciTech Connect (OSTI)

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

Bauer, E.K. (ed.)

1980-05-01T23:59:59.000Z

242

An Experiment on Graph Analysis Methodologies for Scenarios  

SciTech Connect (OSTI)

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

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

2005-09-30T23:59:59.000Z

243

Policy_Flash_2011-59__Attachment.pdf | Department of Energy  

Energy Savers [EERE]

PolicyFlash2011-59Attachment.pdf PolicyFlash2011-59Attachment.pdf PolicyFlash2011-59Attachment.pdf More Documents & Publications PartnershipAgreementsTraining&0;...

244

AttachmentFlash2011-2 -(2)-OPAM | Department of Energy  

Energy Savers [EERE]

AttachmentFlash2011-2 -(2)-OPAM AttachmentFlash2011-2 -(2)-OPAM REQUESTS BY POLITICAL CANDIDATES TO TOUR DOE FACILITIES AttachmentFlash2011-2 -(2)-OPAM More Documents &...

245

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

E-Print Network [OSTI]

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

Jing Zhang

2008-10-08T23:59:59.000Z

246

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

247

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

Science Journals Connector (OSTI)

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

Zhisong Fu; Michael Personick; Bryan Thompson

2014-06-01T23:59:59.000Z

248

E-Print Network 3.0 - attachment place-identity belonging Sample...  

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

to which the model attach face belongs is modified... WITH ATTACHMENTS Eelco van den Berg Faculty of Electrical Engineering, Mathematics and Computer Science Delft... in which...

249

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

250

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

251

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

252

Expert Meeting Report: Cladding Attachment Over Exterior Insulation |  

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

Cladding Attachment Over Exterior Insulation Cladding Attachment Over Exterior Insulation Expert Meeting Report: Cladding Attachment Over Exterior Insulation The addition of insulation to the exterior of buildings is an effective means of increasing the thermal resistance of both wood framed walls as well as mass masonry wall assemblies. The location of the insulation to the exterior of the structure has many direct benefits including better effective R-value from reduced thermal bridging, better condensation resistance, reduced thermal stress on the structure, as well as other commonly associated improvements such as increased air tightness and improved water management (Hutcheon 1964, Lstiburek 2007). The intent of the meeting was to review the current state of industry knowledge regarding cladding attachment over exterior insulation with a specific focus on: 1.

253

Attachment E: Emergency Response Activities | Department of Energy  

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

Attachment E: Emergency Response Activities Attachment E: Emergency Response Activities Attachment E: Emergency Response Activities Emergency Response Activities States may or may not elect to fund emergency management activities with AIP money. If they do, the AIP should include an Emergency Management section. This section may be implemented at any time - when the AIP is first negotiated, at renewal, or through amendment. This Attachment provides examples of items that might be appropriate in an AIP's Emergency Management section (most have come directly from existing AIPs). These items should be considered neither requirements or restrictions. Since funding is not available to support all of these activities, the AIP should be tailored to reflect the State's most urgent and realistic needs in order

254

Attachment F: Summary Checklist of Model AIP Provisions and Program  

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

F: Summary Checklist of Model AIP Provisions and Program F: Summary Checklist of Model AIP Provisions and Program Policies Attachment F: Summary Checklist of Model AIP Provisions and Program Policies Summary Checklist of Model AIP Provisions and Program Policies In response to concerns expressed by DOE and State AIP program representatives, the Office of Environmental Activities has developed a list of mandatory and non-mandatory model language provisions for new and renegotiated AIPs. The underlying concepts for the mandatory provisions are set forth in Attachment A. Other program policies are set forth in a question and answer format in Attachment B. The texts of the optional provisions and mandatory provisions that may be applicable are provided in Attachments C and D respectively. Suggested language related to emergency

255

Property:NEPA ApplicationAttachments | Open Energy Information  

Open Energy Info (EERE)

ApplicationAttachments ApplicationAttachments Jump to: navigation, search Property Name NEPA ApplicationAttachments Property Type Page Description FONSI files for NEPA Docs. For example: Cover letters, Plan of Operations, Maps. This is a property of type Page. It links to pages that use the form NEPA_Doc. Pages using the property "NEPA ApplicationAttachments" Showing 25 pages using this property. (previous 25) (next 25) D DOI-BLM-NV-C010-2009-0030-CX + 87401 - Proposed Action.pdf +, 87402 - Proposed Action.pdf +, 87400 - Proposed Action.pdf +, ... DOI-BLM-NV-C010-2010-0008-CX + 88211 - Proposed Action.pdf + DOI-BLM-NV-C010-2011-0514-EA + Figure 1 Project Location 032111.pdf +, Figure 2 Project Boundary Leases and Land Status 032111.pdf +, Figure 3 Proposed Disturbance 060211.pdf +, ...

256

Attachment 2 NSTX Data Usage and Publication Agreement  

E-Print Network [OSTI]

Attachment 2 NSTX Data Usage and Publication Agreement NSTX Research is carried out by a multi agrees to adhere to the following guidelines of the NSTX data usage and results publication. 1

Princeton Plasma Physics Laboratory

257

Attachment 2 NSTX Data Usage and Publication Agreement  

E-Print Network [OSTI]

Attachment 2 NSTX Data Usage and Publication Agreement NSTX is an open, fundamental research of the NSTX data usage and results publication. 1) No Research Team member will be given direct access

Princeton Plasma Physics Laboratory

258

Attachment A PP/OP 03.08  

E-Print Network [OSTI]

Attachment A PP/OP 03.08 Page 1 04/02/2010 STANDARDS OF APPRENTICESHIP FOR Texas Tech University a trade as outlined in these standards. "Apprenticeship Committee" shall mean a twelve-member group.............................................................................................3 HVAC Mechanic

Gelfond, Michael

259

Part III - List of Documents, Exhibits, and Other Attachments  

National Nuclear Security Administration (NNSA)

Modification No. 229 Attachment 1 Page 1 of 7 PART III - SECTION J APPENDIX G May 13, 2013 Modified by Modification No. A009, A015, A018, A019, A021, A027, M033, M041, M042,...

260

A Scalable Video Server Using Intelligent Network Attached Storage  

Science Journals Connector (OSTI)

This paper proposes a new architecture, called intelligent network attached storage, for building a distributed video server. In this architecture, the data intensive and high overhead processing tasks such as data packaging and transmitting are handled ...

Guang Tan; Hai Jin; Liping Pang

2002-10-01T23:59:59.000Z

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

Appendix DATA Attachment B: WIPP Waste Containers and Emplacement  

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

Energy Waste Isolation Pilot Plant Carlsbad Field Office Carlsbad, New Mexico Appendix DATA-2014 Attachment B: WIPP Waste Containers and Emplacement Table of Contents DATA-B-1.0...

262

Attached Bacterial Populations Shared by Four Species of Aquatic Angiosperms  

Science Journals Connector (OSTI)

...are attached to aquatic angiosperms...and estuarine ecosystems, and a major...reestablishment of aquatic angiosperm beds...terrestrial plant restoration (20, 65...could be used for aquatic angiosperm restoration efforts. Application...

Byron C. Crump; Evamaria W. Koch

2008-08-01T23:59:59.000Z

263

Attached cultivation technology of microalgae for efficient biomass feedstock production  

Science Journals Connector (OSTI)

The potential of microalgae biofuel has not been realized because of low productivity and high costs associated with the current cultivation systems. In this paper, an attached cultivation method was introduced, in which microalgae cells grew on the surface of vertical artificial supporting material to form algal film. Multiple of the algal films were assembled in an array fashion to dilute solar irradiation to facilitate high photosynthetic efficiency. Results showed that a broad range of microalgae species can grow with this attached method. A biomass productivity of 5080gm?2d?1 was obtained outdoors for Scenedesmus obliquus, corresponding to the photosynthetic efficiency of 5.28.3% (total solar radiation). This attached method also offers lots of possible advantages over traditional open ponds, such as on water saving, harvesting, contamination controlling and scale-up. The attached cultivation represents a promising technology for economically viable production of microalgae biofuels.

Tianzhong Liu; Junfeng Wang; Qiang Hu; Pengfei Cheng; Bei Ji; Jinli Liu; Yu Chen; Wei Zhang; Xiaoling Chen; Lin Chen; Lili Gao; Chunli Ji; Hui Wang

2013-01-01T23:59:59.000Z

264

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

265

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

266

Multiclass Diffuse Interface Models for Semi-supervised Learning on Graphs  

E-Print Network [OSTI]

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

Percus, Allon

267

Pressurizer with a mechanically attached surge nozzle thermal sleeve  

DOE Patents [OSTI]

A thermal sleeve is mechanically attached to the bore of a surge nozzle of a pressurizer for the primary circuit of a pressurized water reactor steam generating system. The thermal sleeve is attached with a series of keys and slots which maintain the thermal sleeve centered in the nozzle while permitting thermal growth and restricting flow between the sleeve and the interior wall of the nozzle.

Wepfer, Robert M

2014-03-25T23:59:59.000Z

268

The dynamics of knotted strings attached to D-branes  

Science Journals Connector (OSTI)

We extend the general solution to the Cauchy problem for the relativistic closed string (Phys. Lett. B 404 (1997) 57) to the case of open strings attached to Dp-branes, including the cases where the initial data has a knotlike topology. We use this extended solution to derive intrinsic dynamical properties of open and closed relativistic strings attached to Dp-branes. We also study the singularity structure and the oscillating periods of this extended solution.

Ricardo Schiappa; Rui Dilo

1998-01-01T23:59:59.000Z

269

Locating and paired-dominating sets in graphs  

Science Journals Connector (OSTI)

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

John McCoy; Michael A. Henning

2009-01-01T23:59:59.000Z

270

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

271

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

272

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

E-Print Network [OSTI]

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

Jing Zhang

2008-08-14T23:59:59.000Z

273

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

274

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

275

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.

276

Probabilistic flooding for efficient information dissemination in random graph topologies  

Science Journals Connector (OSTI)

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

Konstantinos Oikonomou; Dimitrios Kogias; Ioannis Stavrakakis

2010-07-01T23:59:59.000Z

277

A description of dynamical graphs associated to elementary regulatory circuits  

Science Journals Connector (OSTI)

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

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

2003-09-01T23:59:59.000Z

278

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.

279

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.

280

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

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

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.

282

Probabilistic Flooding for Efficient Information Dissemination in Random Graph  

E-Print Network [OSTI]

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

Stavrakakis, Ioannis

283

Solving Steiner Tree Problems in Graphs with Lagrangian Relaxation  

Science Journals Connector (OSTI)

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

Laura Bahiense; Francisco Barahona; Oscar Porto

2003-09-01T23:59:59.000Z

284

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.

285

Circuit and bond polytopes on series-parallel graphs$  

E-Print Network [OSTI]

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

2014-07-10T23:59:59.000Z

286

Graph Model for Carbon Dioxide Emissions from Metallurgical Plants  

Science Journals Connector (OSTI)

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

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

2013-03-01T23:59:59.000Z

287

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

288

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

289

K-theory of locally finite graph C Natalia Iyudu  

E-Print Network [OSTI]

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

290

Alliance Partition Number in Graphs Department of Mathematics  

E-Print Network [OSTI]

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

Gera, Ralucca

291

The peculiar phase structure of random graph bisection  

SciTech Connect (OSTI)

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

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

2008-01-01T23:59:59.000Z

292

Mining the inner structure of the Web graph  

Science Journals Connector (OSTI)

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

Debora Donato; Stefano Leonardi; Stefano Millozzi; Panayiotis Tsaparas

2008-01-01T23:59:59.000Z

293

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

294

Liars domination in graphs  

Science Journals Connector (OSTI)

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

Miranda L. Roden; Peter J. Slater

2009-01-01T23:59:59.000Z

295

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

296

Alliance free sets in Cartesian product graphs  

E-Print Network [OSTI]

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

Yero, Ismael G; Bermudo, Sergio

2011-01-01T23:59:59.000Z

297

On the Degree Distribution of P\\'{o}lya Urn Graph Processes  

E-Print Network [OSTI]

This paper presents a tighter bound on the degree distribution of arbitrary P\\'{o}lya urn graph processes, proving that the proportion of vertices with degree $d$ obeys a power-law distribution $P(d) \\propto d^{-\\gamma}$ for $d \\leq n^{\\frac{1}{6}-\\epsilon}$ for any $\\epsilon > 0$, where $n$ represents the number of vertices in the network. Previous work by Bollob\\'{a}s et al. formalized the well-known preferential attachment model of Barab\\'{a}si and Albert, and showed that the power-law distribution held for $d \\leq n^{\\frac{1}{15}}$ with $\\gamma = 3$. Our revised bound represents a significant improvement over existing models of degree distribution in scale-free networks, where its tightness is restricted by the Azuma-Hoeffding concentration inequality for martingales. We achieve this tighter bound through a careful analysis of the first set of vertices in the network generation process, and show that the newly acquired is at the edge of exhausting Bollob\\'as model in the sense that the degree expectation ...

Tutunov, Rasul; Jadbabaie, Ali; Eaton, Eric

2014-01-01T23:59:59.000Z

298

Algorithms and architectures for high performance analysis of semantic graphs.  

SciTech Connect (OSTI)

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

Hendrickson, Bruce Alan

2005-09-01T23:59:59.000Z

299

Nuclear Energy Institute (NEI) Attachment, Integrated Safety Analysis |  

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

Nuclear Energy Institute (NEI) Attachment, Integrated Safety Nuclear Energy Institute (NEI) Attachment, Integrated Safety Analysis Nuclear Energy Institute (NEI) Attachment, Integrated Safety Analysis This paper addresses why the use of an Integrated Safety Analysis ("ISA") is appropriate for fuel recycling facilities1 which would be licensed under new regulations currently being considered by NRC. The use of the ISA for fuel facilities under Part 70 is described and compared to the use of a Probabilistic Risk Assessment ("PRA") for reactor facilities. A basis is provided for concluding that future recycling facilities - which will possess characteristics similar to today's fuel cycle facilities and distinct from reactors - can best be assessed using established qualitative or semi-quantitative ISA techniques to achieve and

300

Attachment H: Delegation of Authority Memorandum | Department of Energy  

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

Attachment H: Delegation of Authority Memorandum Attachment H: Delegation of Authority Memorandum Attachment H: Delegation of Authority Memorandum United States Department of Energy Memorandum DATE: August 14, 1994 REPLY TO ATTN OF: EM-16 SUBJECT: Delegation of Authority TO: Manager, DOE Operations Offices Manager, Fernald Field Office Manager, Rocky Flats Office Manager, Golden Office On April 21, 1994, a memorandum delegating certain authorities related to financial assistance agreements was sent to you. I am expanding the original delegation to include additional categories of financial assistance to facilitate and streamline the award process. Relevant portions of the original memorandum and modifications are provided below. In accordance with provisions of the Financial Assistance Rules, the Office of Environmental Management (EM) has determined that providing EM funding

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

Attachment D: Mandatory Provisions if Applicable | Department of Energy  

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

D: Mandatory Provisions if Applicable D: Mandatory Provisions if Applicable Attachment D: Mandatory Provisions if Applicable Mandatory Provisions if Applicable This attachment contains provisions that may be mandatory for an AIP if the State: (1) chooses to develop an emergency response program but does not want to use the suggested language in Attachment E; (2) receives DOE grant funding for both AIP and monitoring activities conducted under the Comprehensive Environmental Response, Compensation and Liability Act (CERCLA); and (3) if the parties anticipate that a state's sampling activities will generate hazardous waste mixed with radioactive materials. If emergency response activities will be included in a new or renegotiated AIP but the AIP does not incorporate the suggested model provisions related

302

Microsoft Word - Policy Flash 2010-73 Attachment 5  

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

Attachment L-___ Past Performance Information Questionnaire (JUL 2010) Attachment L-___ Past Performance Information Questionnaire (JUL 2010) 4 = Outstanding Performance was substantially and consistently above contract requirements. Contractor displayed an overall superior understanding of contract requirements, and used innovative approaches leading to enhanced performance. 3 = Good Performance was above minimum contract requirements. Contractor displayed a thorough understanding of contract requirements. 2 = Satisfactory Performance met minimum contract requirements. 1 = Marginal Performance was below minimum contract requirements. Contractor displayed a lack of thorough understanding of contract requirements in one or more significant performance areas. 0 = Unsatisfactory Performance completely failed to meet the minimum contract requirements.

303

Microsoft Word - AL2000-05Attachment.doc  

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

Attachment to Attachment to AL-2000-05 (05/17/00) MODEL PROJECT AGREEMENT FOR PARTNER PROJECTS BETWEEN THE THE SCIENCE AND TECHNOLOGY CENTER IN UKRAINE, INSTITUTIONS IN UKRAINE AND OTHER INTERESTED STATES OF THE CIS PARTNER/DOE NATIONAL LABORATORIES Παγε 1 οφ 49 PROJECT AGREEMENT between THE SCIENCE AND TECHNOLOGY CENTER IN UKRAINE, (NAME OF RECIPIENT), and (NAME OF PARTNER) The Science and Technology Center in Ukraine (hereinafter referred to as "Center"), ______________________ (name of Institute in Ukraine or other interested State of the Commonwealth of Independent States or CIS) (hereinafter referred to as "Recipient") and ______________________ (name of Partner) (hereinafter referred to as "Partner"),

304

Biocompatible implants and methods of making and attaching the same  

DOE Patents [OSTI]

The invention provides a biocompatible silicone implant that can be securely affixed to living tissue through interaction with integral membrane proteins (integrins). A silicone article containing a laser-activated surface is utilized to make the implant. One example is an implantable prosthesis to treat blindness caused by outer retinal degenerative diseases. The device bypasses damaged photoreceptors and electrically stimulates the undamaged neurons of the retina. Electrical stimulation is achieved using a silicone microelectrode array (MEA). A safe, protein adhesive is used in attaching the MEA to the retinal surface and assist in alleviating focal pressure effects. Methods of making and attaching such implants are also provided.

Rowley, Adrian P; Laude, Lucien D; Humayun, Mark S; Weiland, James D; Lotfi, Atoosa; Markland, Jr., Francis S

2014-10-07T23:59:59.000Z

305

Reliability Testing the Die-Attach of CPV Cell Assemblies  

SciTech Connect (OSTI)

Results and progress are reported for a course of work to establish an efficient reliability test for the die-attach of CPV cell assemblies. Test vehicle design consists of a ~1 cm2 multijunction cell attached to a substrate via several processes. A thermal cycling sequence is developed in a test-to-failure protocol. Methods of detecting a failed or failing joint are prerequisite for this work; therefore both in-situ and non-destructive methods, including infrared imaging techniques, are being explored as a method to quickly detect non-ideal or failing bonds.

Bosco, N.; Sweet, C.; Kurtz, S.

2011-02-01T23:59:59.000Z

306

Apparatus for attaching a cleaning tool to a robotic manipulator  

DOE Patents [OSTI]

An apparatus is described for connecting a cleaning tool to a robotic manipulator so that the tool can be used in contaminated areas on horizontal, vertical and sloped surfaces. The apparatus comprises a frame and a handle, with casters on the frame to facilitate movement. The handle is pivotally and releasibly attached to the frame at a preselected position of a plurality of attachment positions. The apparatus is specifically configured for the Kelly Vacuum System but can be modified for use with any standard mobile robot and cleaning tool. 14 figs.

Killian, M.A.; Zollinger, W.T.

1992-09-22T23:59:59.000Z

307

Apparatus for attaching a cleaning tool to a robotic manipulator  

DOE Patents [OSTI]

An apparatus for connecting a cleaning tool to a robotic manipulator so that the tool can be used in contaminated areas on horizontal, vertical and sloped surfaces. The apparatus comprises a frame and a handle, with casters on the frame to facilitate movement. The handle is pivotally and releasibly attached to the frame at a preselected position of a plurality of attachment positions. The apparatus is specifically configured for the KELLY VACUUM SYSTEM but can be modified for use with any standard mobile robot and cleaning tool.

Killian, Mark A. (102 Foxhunt Dr., North Augusta, SC 29841); Zollinger, W. Thor (3927 Almon Dr., Martinez, GA 30907)

1992-01-01T23:59:59.000Z

308

Interface structure for hub and mass attachment in flywheel rotors  

DOE Patents [OSTI]

An interface structure for hub and mass attachment in flywheel rotors. The interface structure efficiently transmits high radial compression forces and withstands both large circumferential elongation and local stresses generated by mass-loading and hub attachments. The interface structure is comprised of high-strength fiber, such as glass and carbon, woven into an angle pattern which is about 45.degree. with respect to the rotor axis. The woven fiber is bonded by a ductile matrix material which is compatible with and adheres to the rotor material. This woven fiber is able to elongate in the circumferential direction to match the rotor growth during spinning.

Deteresa, Steven J. (Livermore, CA); Groves, Scott E. (Brentwood, CA)

1998-06-02T23:59:59.000Z

309

Interface structure for hub and mass attachment in flywheel rotors  

DOE Patents [OSTI]

An interface structure is described for hub and mass attachment in flywheel rotors. The interface structure efficiently transmits high radial compression forces and withstands both large circumferential elongation and local stresses generated by mass-loading and hub attachments. The interface structure is comprised of high-strength fiber, such as glass and carbon, woven into an angle pattern which is about 45{degree} with respect to the rotor axis. The woven fiber is bonded by a ductile matrix material which is compatible with and adheres to the rotor material. This woven fiber is able to elongate in the circumferential direction to match the rotor growth during spinning. 2 figs.

Deteresa, S.J.; Groves, S.E.

1998-06-02T23:59:59.000Z

310

Apparatus for attaching a cleaning tool to a robotic manipulator  

DOE Patents [OSTI]

This invention is comprised of an apparatus for connecting a cleaning tool to a robotic manipulator so that the tool can be used in contaminated areas on horizontal, vertical and sloped surfaces. The apparatus comprises a frame and a handle, with casters on the frame to facilitate movement. The handle is pivotally and releasibly attached to the frame at a preselected position of a plurality of attachment positions. The apparatus is specifically configured for the KELLY VACUUM SYSTEM but can be modified for use with any standard mobile robot and cleaning tool.

Killian, M.A.; Zollinger, W.T.

1991-01-01T23:59:59.000Z

311

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

312

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

313

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

314

Bond graph models of electromechanical systems. The AC generator case  

E-Print Network [OSTI]

. After reviewing electromechanical energy conversion and torque gener- ation, the core element present in any electromechanical system is introduced, and the corresponding electrical and mechanical ports are attached to it. No modulated elements are necessary, since the energy representation

Batlle, Carles

315

ATTACHMENTS Consultation on Proposed Updates and Changes to the  

E-Print Network [OSTI]

and Site Investigation Manual (MARSSIM) Attachment A MARSSIM, Revision 1 (August 2000) including June 2001-Agency Radiation Survey and Site Investigation Manual (MARSSIM) provides detailed guidance for planning of compliance during the final status survey following scoping, characterization, and any necessary remedial

316

The fish tail motion forms an attached leading edge vortex  

Science Journals Connector (OSTI)

...research-article Research articles 1001 25 18 The fish tail motion forms an attached leading edge...of the most prominent characteristics of fishes, and the analysis of the flow pattern...this mechanism has not been reported in fish-like swimming probably owing to the overemphasis...

Iman Borazjani; Mohsen Daghooghi

2013-01-01T23:59:59.000Z

317

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

318

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

319

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

320

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

Science Journals Connector (OSTI)

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

Patricia Iglesias Snchez; Emmanuel Mller; Oretta Irmler; Klemens Bhm

2014-06-01T23:59:59.000Z

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

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

Science Journals Connector (OSTI)

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

Yingqian Wang; Ping Sheng

2014-04-01T23:59:59.000Z

322

Create reports and graphs | ENERGY STAR Buildings & Plants  

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

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

323

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

324

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

325

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

326

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

E-Print Network [OSTI]

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

Kardos, Frantisek; Volec, Jan

2011-01-01T23:59:59.000Z

327

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

E-Print Network [OSTI]

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

Smirnova-Nagnibeda, Tatiana

328

Labeling Products of Complete Graphs with a Condition at Distance Two  

Science Journals Connector (OSTI)

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

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

2001-01-01T23:59:59.000Z

329

On generalized Petersen graphs labeled with a condition at distance two  

Science Journals Connector (OSTI)

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

John P. Georges; David W. Mauro

2002-12-01T23:59:59.000Z

330

PARTITIONING HYPERGRAPHS IN SCIENTIFIC COMPUTING APPLICATIONS THROUGH VERTEX SEPARATORS ON GRAPHS  

E-Print Network [OSTI]

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

Pinar, Ali

331

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

E-Print Network [OSTI]

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

Hendrickson, Bruce

332

Correlation and Contrast Link Formation Patterns in a Time Evolving Graph  

Science Journals Connector (OSTI)

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

Tomonobu Ozaki; Minoru Etoh

2011-12-01T23:59:59.000Z

333

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

Science Journals Connector (OSTI)

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

Tomonobu Ozaki; Minoru Etoh

2011-03-01T23:59:59.000Z

334

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.

335

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

Science Journals Connector (OSTI)

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

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

2014-03-01T23:59:59.000Z

336

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

337

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

338

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

339

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

340

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

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

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

Science Journals Connector (OSTI)

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

Marjan Abdeyazdan; Saeed Parsa; Amir Masoud Rahmani

2013-04-01T23:59:59.000Z

342

T-534: Vulnerability in the PDF distiller of the BlackBerry Attachment...  

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

PDF distiller of the BlackBerry Attachment Service for the BlackBerry Enterprise Server T-534: Vulnerability in the PDF distiller of the BlackBerry Attachment Service for the...

343

Insecure Attachment Attitudes in the Onset of Problematic Internet Use Among Late Adolescents  

Science Journals Connector (OSTI)

Studies on the role played by attachment attitudes among late adolescents who show Problematic Internet Use (PIU) are still lacking. Three ... measures concerning attachment attitudes, childhood experiences of abuse

Adriano Schimmenti; Alessia Passanisi

2014-10-01T23:59:59.000Z

344

Discovery of Novel Materials with Broad Resistance to Bacterial Attachment Using Combinatorial Polymer Microarrays  

E-Print Network [OSTI]

A new class of bacteria-attachment-resistant materials is discovered using a multi-generation polymer microarray methodology that reduces bacterial attachment by up to 99.3% compared with a leading commercially available ...

Hook, Andrew L.

345

Attached is Policy Flash 2013-34 Department of Energy Acquisition...  

Energy Savers [EERE]

Attached is Policy Flash 2013-34 Department of Energy Acquisition Letter 2013-04 on Executive Compensation Attached is Policy Flash 2013-34 Department of Energy Acquisition Letter...

346

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.

347

MML Inference of Decision Graphs with Multi-way Joins  

Science Journals Connector (OSTI)

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

Peter J. Tan; David L. Dowe

2002-12-01T23:59:59.000Z

348

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

349

Even-Hole-Free Graphs Part II: Recognition Algorithm  

E-Print Network [OSTI]

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

Cornuejols, Gerard P.

350

Finding good decompositions for dynamic programming on dense graphs  

Science Journals Connector (OSTI)

It is well-known that for graphs with high edge density the tree-width is always high while the clique-width can be low. Boolean-width is a new parameter that is never higher than tree-width or clique-width and can in fact be as small as logarithmic ...

Eivind Magnus Hvidevold; Sadia Sharmin; Jan Arne Telle; Martin Vatshelle

2011-09-01T23:59:59.000Z

351

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

352

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

353

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

354

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

355

Lesson Summary Students will graph past sea level data obtained  

E-Print Network [OSTI]

World Numbers Symbolic Relationships Habits of Mind Communication Skills NSES Science Standards Science History and Nature of Science Nature of Science NCGE Geography Standards The Uses of Geography Standard 17 Teaching Time: 20 ­ 30 minutes Materials · Graph paper · Ruler · Pen or pencil Advanced Planning

Mojzsis, Stephen J.

356

Describing bond graph models of hydraulic components in Modelica  

Science Journals Connector (OSTI)

In this paper we discuss an object oriented description of bond graph models of hydraulic components by means of the unified modeling language Modelica. A library which is still under development is briefly described and models of some standard hydraulic components are given for illustration. In particular we address the modeling of hydraulic orifices.

W. Borutzky; B. Barnard; J.U. Thoma

2000-01-01T23:59:59.000Z

357

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.

358

Compact Routing on Internet-Like Graphs Dmitri Krioukov  

E-Print Network [OSTI]

Compact Routing on Internet-Like Graphs Dmitri Krioukov Email: dima@krioukov.net Kevin Fall Intel and simulation, we derive the stretch distribution of this routing scheme on Internet-like interdomain topologies that the average TZ stretch is quite low and virtually independent of . In particular, for the Internet interdomain

Yang, Xiaowei

359

Proc. AAAI-13 1 Concurrent Reasoning with Inference Graphs  

E-Print Network [OSTI]

Proc. AAAI-13 1 Concurrent Reasoning with Inference Graphs Daniel R. Schlegel and Stuart C. Shapiro Department of Computer Science and Engineering University at Buffalo, Buffalo NY, 14260 shapiro complex problem (Shapiro 1989). Parallelizing Datalog has been more successful, but it is a less

Shapiro, Stuart C.

360

Proc. GKR 2013 Concurrent Reasoning with Inference Graphs  

E-Print Network [OSTI]

Proc. GKR 2013 Concurrent Reasoning with Inference Graphs Daniel R. Schlegel and Stuart C. Shapiro Department of Computer Science and Engineering University at Buffalo shapiro>@buffalo.edu Abstract [Shapiro, 1989], largely because there is no persistent underlying representation of the relationships be

Shapiro, Stuart C.

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

Simulation of an Electrical Substation Using the Bond Graph Technique  

Science Journals Connector (OSTI)

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

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

2008-04-01T23:59:59.000Z

362

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

363

The Optimal Rescue Path Set Problem in Undirected Graphs  

Science Journals Connector (OSTI)

This paper proposes the optimal rescue path set problem in an undirected graph G?=?(V,E), in which some vehicles have to go from a source node s to a destination node t. However, during the traveling of the vehic...

Huili Zhang; Yinfeng Xu

2013-01-01T23:59:59.000Z

364

Insider Threat Detection using Stream Mining and Graph Mining  

E-Print Network [OSTI]

Insider Threat Detection using Stream Mining and Graph Mining Pallabi Parveen, Jonathan Evans threats who attempt to conceal their activities by varying their behaviors over time. This paper applies of insider threat detection, demonstrating that the ensemble-based approach is significantly more effective

Hamlen, Kevin W.

365

An Approach to Security Policy Configuration Using Semantic Threat Graphs  

E-Print Network [OSTI]

An Approach to Security Policy Configuration Using Semantic Threat Graphs Simon N. Foley, in turn, unnecessarily expose the enterprise to known threats. This paper pro- poses a threat management- nomic configuration of security mechanisms. This knowledge is mod- eled in terms of Semantic Threat

Foley, Simon

366

Decentralized Semantic Threat Graphs Simon N. Foley1  

E-Print Network [OSTI]

Decentralized Semantic Threat Graphs Simon N. Foley1 William M. Fitzgerald1 Cork Constraint.foley@cs.ucc.ie wfitzgerald@4c.ucc.ie Abstract. Threat knowledge-bases such as those maintained by MITRE and NIST provide a basis with which to mitigate known threats to an enterprise. These centralised knowledge-bases assume

Foley, Simon

367

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

368

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

369

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

370

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

371

Classification of Adinkra Graphs A Senior Project submitted to  

E-Print Network [OSTI]

. We compute an invariant on the graphs: a sequence of natural numbers called Betti numbers given that gives the sequence of Betti numbers for any Adinkra. The equation depends only on N, the number Expression for the Betti Numbers . . . . . . . . . . . . . . . . . . 28 3.9 Computing the Betti Polynomial

Landweber, Gregory D.

372

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

373

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

374

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

375

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

376

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

377

Graph and matrix approaches to rough sets through matroids  

Science Journals Connector (OSTI)

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

Shiping Wang; Qingxin Zhu; William Zhu; Fan Min

2014-01-01T23:59:59.000Z

378

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

379

User's search behavior graph for aiding personalized web search  

Science Journals Connector (OSTI)

The www is a dynamic environment and it is difficult to capture the user preferences and interests without interfering with the normal activity of the user. Hence to improve user searching in the World Wide Web, we have proposed a personalized search ... Keywords: personalization, user conceptual index, user's search behavior graph, web information retrieval, web search

S. Sendhilkumar; T. V. Geetha

2007-12-01T23:59:59.000Z

380

Heat kernel estimates and related inequalities on metric graphs  

E-Print Network [OSTI]

We consider metric graphs with Kirchhoff boundary conditions. We study the intrinsic metric, volume doubling and a Poincar\\'e inequality. This enables us to prove a parabolic Harnack inequality. The proof involves various techniques from the theory of strongly local Dirichlet forms. Along our way we show Sobolev and Nash type inequalities and related heat kernel estimates.

Sebastian Haeseler

2011-01-15T23:59:59.000Z

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

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

382

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

383

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

384

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

385

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

386

Attachment C: Optional AIP Provisions | Department of Energy  

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

C: Optional AIP Provisions C: Optional AIP Provisions Attachment C: Optional AIP Provisions Optional AIP Provisions This attachment contains sample language for a number of optional provisions that sites may choose to include or not to include in their AIPs. Optional AIP provisions are not mandatory and the language presented is a sample which may be used as is, serve as a guideline for the creation of a modified provision to suit the site-specific needs of a particular AIP program, or not included in a new or renegotiated AIP. 1. Public Participation/Public Accountability in the DOE Planning Process "The DOE will make available to the public in a timely manner all environmental planning documents that require public comment. The DOE will promptly reply to, and confirm receipt of, requests for information

387

Attachment B: Other AIP Program Policies | Department of Energy  

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

B: Other AIP Program Policies B: Other AIP Program Policies Attachment B: Other AIP Program Policies Other AIP Program Policies Question #1: What is the role of local governments in AIP program emergency management planning activities? Answer: As indicated in the suggested model provisions related to emergency response in Attachment E, it is DOE policy that AIP provisions regarding emergency management planning activities encourage active participation by applicable local governments. Question #2: Which AIP provisions should be addressed through the development of site-specific procedures and protocol? Answer: Generally, site-specific procedures and protocols should be developed to address AIP program concerns that must be tailored to site conditions, such as: State generation of hazardous and/or radioactive wastes; on-site

388

Microsoft Word - ARRAGuideAttachment10v1.doc  

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

Attachment 10 Attachment 10 BUY AMERICAN ISSUES IN THE RECOVERY ACT FOR FINANCIAL ASSISTANCE AGREEMENTS The Office of Management and Budget (OMB) issued interim guidance for financial assistance actions funded by the Recovery Act in March 2009. Public comments on the interim guidance have been received and are currently being analyzed by OMB. The following questions and answers address many issues that are expected to be clarified in OMB's final guidance, and will be updated as needed. 1. What are the Buy American restrictions in the Recovery Act? The Buy American provision in the Recovery Act (section 1605 of Title XI), directs that, subject to certain exceptions, no funds appropriated or otherwise made available for a project may be used for the construction, alteration, or repair of a public building or public work unless all the

389

Expert Meeting Report: Cladding Attachment Over Exterior Insulation  

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

Cladding Attachment Over Cladding Attachment Over Exterior Insulation P. Baker Building Science Corporation October 2013 NOTICE This report was prepared as an account of work sponsored by an agency of the United States government. Neither the United States government nor any agency thereof, nor any of their employees, subcontractors, or affiliated partners makes any warranty, express or implied, or assumes any legal liability or responsibility for the accuracy, completeness, or usefulness of any information, apparatus, product, or process disclosed, or represents that its use would not infringe privately owned rights. Reference herein to any specific commercial product, process, or service by trade name, trademark, manufacturer, or otherwise does not necessarily constitute or imply its endorsement, recommendation, or

390

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

391

Potential-controlled filtering in quantum star graphs  

SciTech Connect (OSTI)

We study the scattering in a quantum star graph with a Fueloep-Tsutsui coupling in its vertex and with external potentials on the lines. We find certain special couplings for which the probability of the transmission between two given lines of the graph is strongly influenced by the potential applied on another line. On the basis of this phenomenon we design a tunable quantum band-pass spectral filter. The transmission from the input to the output line is governed by a potential added on the controlling line. The strength of the potential directly determines the passband position, which allows to control the filter in a macroscopic manner. Generalization of this concept to quantum devices with multiple controlling lines proves possible. It enables the construction of spectral filters with more controllable parameters or with more operation modes. In particular, we design a band-pass filter with independently adjustable multiple passbands. We also address the problem of the physical realization of Fueloep-Tsutsui couplings and demonstrate that the couplings needed for the construction of the proposed quantum devices can be approximated by simple graphs carrying only {delta} potentials. - Highlights: Black-Right-Pointing-Pointer Spectral filtering devices based on quantum graphs are designed theoretically. Black-Right-Pointing-Pointer The passband is controlled by the application of macroscopic potentials on lines. Black-Right-Pointing-Pointer The filters are built upon special Fulop-Tsutsui type couplings at graph vertices. Black-Right-Pointing-Pointer A method of construction of Fulop-Tsutsui vertices from delta potentials is devised.

Turek, Ondrej, E-mail: ondrej.turek@kochi-tech.ac.jp; Cheon, Taksu, E-mail: taksu.cheon@kochi-tech.ac.jp

2013-03-15T23:59:59.000Z

392

Ultralow Protein Adsorbing Coatings from Clickable PEG Nanogel Solutions: Bene ts of Attachment under Salt-Induced Phase  

E-Print Network [OSTI]

Ultralow Protein Adsorbing Coatings from Clickable PEG Nanogel Solutions: Bene ts of Attachment nanogel solutions attached with salt adsorbed signi cantly less brinogen than other 100% PEG coatings

Mitra, Rob

393

Absorption spectrum of Ca atoms attached to $^4$He nanodroplets  

E-Print Network [OSTI]

Within density functional theory, we have obtained the structure of $^4$He droplets doped with neutral calcium atoms. These results have been used, in conjunction with newly determined {\\it ab-initio} $^1\\Sigma$ and $^1\\Pi$ Ca-He pair potentials, to address the $4s4p$ $^1$P$_1 \\leftarrow 4s^2$ $^1$S$_0$ transition of the attached Ca atom, finding a fairly good agreement with absorption experimental data. We have studied the drop structure as a function of the position of the Ca atom with respect of the center of mass of the helium moiety. The interplay between the density oscillations arising from the helium intrinsic structure and the density oscillations produced by the impurity in its neighborhood plays a role in the determination of the equilibrium state, and hence in the solvation properties of alkaline earth atoms. In a case of study, the thermal motion of the impurity within the drop surface region has been analyzed in a semi-quantitative way. We have found that, although the atomic shift shows a sizeable dependence on the impurity location, the thermal effect is statistically small, contributing by about a 10% to the line broadening. The structure of vortices attached to the calcium atom has been also addressed, and its effect on the calcium absorption spectrum discussed. At variance with previous theoretical predictions, we conclude that spectroscopic experiments on Ca atoms attached to $^4$He drops will be likely unable to detect the presence of quantized vortices in helium nanodrops.

Alberto Hernando; Manuel Barranco; Marek Kro?nicki; Ricardo Mayol; Mart Pi

2007-11-12T23:59:59.000Z

394

Method of attaching ceramics to gas-turbine metal components  

SciTech Connect (OSTI)

When attaching ceramics to metal gas-turbine parts, an interlayer of lowmodulus fiber metal is recommended as a buffer layer to compensate for the different coefficients of thermal expansion. This elastic interlayer, made of matted and sintered metallic fibers, is actually a woven mat with 90% of the volume taken up by porosity. Nickel alloys, Hastelloy-X, Inconel-600, FeCrAlSi, and FeCrAlY can be used for the interlayer. However, the last two alloys provide optimum oxidation and high-temperature-corrosion resistance. The interlayers are attached to the component metal by normal brazing, while the ceramic is attached by plasma spraying. The bond between the ceramic and the interlayer is formed by the penetration and condensation of the sprayed powder in the interlayer pores. This joining method can be most efficiently used in high-pressure-turbine seals; combustion-chamber facings; facings of slag hoppers and boosted steamboiler combustion chambers; coal gasification equipment, including valves, cyclones, transport main pipelines and exhaust valves; cylinder heads; and diesel engine pistons.

Legchilin, P.F.

1985-01-01T23:59:59.000Z

395

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

396

C:\Eco-SSLs\Final Guidance November 2003\Attachments\Attachment 1-2 Microbial Processes\Final Eco-SSL Guidance Attachment 1-2.w  

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

2 2 Guidance for Developing Ecological Soil Screening Levels (Eco-SSLs) Assessment of Whether to Develop Ecological Soil Screening Levels for Microbes and Microbial Processes OSWER Directive 92857-55 November 2003 This page left intentionally blank Guidance for Developing Eco-SSLs Attachment 1-2 November 2003 1 Assessment of Whether to Develop Ecological Soil Screening Levels for Microbes and Microbial Processes Executive Summary Bacteria and fungi (i.e., microbes) are essential components of soil systems and the importance of microbial processes in terrestrial systems is well recognized. The Eco-SSL workgroup had lengthy discussions as to the merits of deriving microbial Eco-SSLs, and the potential significance of either having or not having Eco-SSLs for microbes in this guidance. As an

397

C:\Eco-SSLs\Final Guidance November 2003\Attachments\Attachment 4-4\Final Eco-SSL Attachment 4-4.wpd  

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

4 4 Guidance for Developing Ecological Soil Screening Levels (Eco-SSLs) Eco-SSL Standard Operating Procedure (SOP) # 5: Wildlife TRV Data Evaluation OSWER Directive 92857-55 November 2003 This page intentionally left blank Attachment 4-4 Standard Operating Procedure (SOP) #5: Wildlife Toxicity Reference Value Data Evaluation for Ecological Soil Screening Levels (Eco-SSLs) OSWER Directive 92857-55 November 2003 Prepared for USEPA Region 8 by Syracuse Research Corporation 999 18th Street, Suite 1975 North Tower Denver, CO 80202 TABLE OF CONTENTS 1.0 INTRODUCTION . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 2.0 PURPOSE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 3.0 THE SCORING SYSTEM . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 4.0 EVALUATION AND SCORING OF STUDY ATTRIBUTES .

398

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

399

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

400

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

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

A Tutte polynomial which distinguishes rooted unicyclic graphs  

Science Journals Connector (OSTI)

Let @C"@r be a rooted graph. For any subset S of E(@C) let C"@r(S) be the component of S containing @r. Define r(S)=|V(C"@r(S))|-1, nul"k(S)=|C"@r(S)|-r(S), and nul(S)=|S|-r(S). With these, define the three-variable greedoid Tutte polynomial of @C"@r, ...

Steven J. Tedford

2009-02-01T23:59:59.000Z

402

Microsoft Word - Policy Flash 2011-2 Attachment 1  

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

activities on DOE facilities or using DOE email addresses. The General Counsel has issued guidance on this issue for federal employees [see attached]. The following Q&A relates to contractors' use of Government property for political activity. Please ensure that your contractors are aware of and respect these limitations. Contractor Political Activity Q: Are DOE contractors permitted to use Government property or facilities to conduct political activity? A: No, political activity is not an authorized use of Government property or facilities and the Contracting Officer will not approve or allow its use. Q: Does DOE Order 203.1, which is entitled, "Limited Personal use of Government

403

Traffic of cytoskeletal motors with disordered attachment rates  

E-Print Network [OSTI]

Motivated by experimental results on the interplay between molecular motors and tau proteins, we extend lattice-based models of intracellular transport to include a second species of particle which locally influences the motor-filament attachment rate. We consider various exactly solvable limits of a stochastic multi-particle model before focusing on the low-motor-density regime. Here, an approximate treatment based on the random walk behaviour of single motors gives good quantitative agreement with simulation results for the tau-dependence of the motor current. Finally, we discuss the possible physiological implications of our results.

H. Grzeschik; R. J. Harris; L. Santen

2008-06-24T23:59:59.000Z

404

Proximity graphs based multi-scale image segmentation  

SciTech Connect (OSTI)

We present a novel multi-scale image segmentation approach based on irregular triangular and polygonal tessellations produced by proximity graphs. Our approach consists of two separate stages: polygonal seeds generation followed by an iterative bottom-up polygon agglomeration into larger chunks. We employ constrained Delaunay triangulation combined with the principles known from the visual perception to extract an initial ,irregular polygonal tessellation of the image. These initial polygons are built upon a triangular mesh composed of irregular sized triangles and their shapes are ad'apted to the image content. We then represent the image as a graph with vertices corresponding to the polygons and edges reflecting polygon relations. The segmentation problem is then formulated as Minimum Spanning Tree extraction. We build a successive fine-to-coarse hierarchy of irregular polygonal grids by an iterative graph contraction constructing Minimum Spanning Tree. The contraction uses local information and merges the polygons bottom-up based on local region-and edge-based characteristics.

Skurikhin, Alexei N [Los Alamos National Laboratory

2008-01-01T23:59:59.000Z

405

Sequoia retains top ranking on Graph 500 for third year running  

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

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

406

Attachment1_Overview_Spreadsheet_Aug_2011_final.xlsx  

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

Attachment 1: Overview of Department/Agency NEPA Status as of June 30, 2011 Attachment 1: Overview of Department/Agency NEPA Status as of June 30, 2011 # of ARRA Funded Projects NEPA Does Not Apply Categorical Exclusions (CE) CE Pending CE Done Environmental Assessments (EA) EA Pending EA Done Environmental Impact Statements (EIS) EIS Pending EIS Done All NEPA Actions All Withdrawn Actions All Pending NEPA Actions All Completed NEPA Actions OVERALL TOTALS: 274,757 4,277 183,785 92 183,693 7,171 184 6,987 863 29 834 191,819 1,899 305 191,514 Department of Agriculture (USDA): 184,856 254 96,784 1 96,783 1,498 0 1,498 150 0 150 98,432 395 1 98,431 Agricultural Research Service (ARS) 41 2 38 0 38 1 0 1 0 0 0 39 0 0 39 Farm Service Agency (FSA) 87,487 0 4 0 4 0 0 0 0 0 0 4 0 0 4 Food and Nutrition Service (FNS) 251 0 4 0 4 0 0 0 0 0 0 4

407

Predicting Envelope Leakage in Attached Dwellings (Fact Sheet)  

SciTech Connect (OSTI)

The most common method of measuring air leakage is to perform single (or solo) blower door pressurization and/or depressurization test. In detached housing, the single blower door test measures leakage to the outside. In attached housing, however, this "solo" test method measures both air leakage to the outside and air leakage between adjacent units through common surfaces. Although minimizing leakage to neighboring units is highly recommended to avoid indoor air quality issues between units, reduce pressure differentials between units, and control stack effect, the energy benefits of air sealing can be significantly overpredicted if the solo air leakage number is used in the energy analysis. Guarded blower door testing is more appropriate for isolating and measuring leakage to the outside in attached housing. This method uses multiple blower doors to depressurize adjacent spaces to the same level as the unit being tested. Maintaining a neutral pressure across common walls, ceilings, and floors acts as a "guard" against air leakage between units. The resulting measured air leakage in the test unit is only air leakage to the outside. Although preferred for assessing energy impacts, the challenges of performing guarded testing can be daunting.

Not Available

2013-11-01T23:59:59.000Z

408

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

E-Print Network [OSTI]

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

Jing Zhang

2010-06-21T23:59:59.000Z

409

USNWG EVSE 15-17 JAN 2013 MTG AGENDA Attachment 1 Page 1 of 3  

E-Print Network [OSTI]

USNWG EVSE ­ 15-17 JAN 2013 MTG AGENDA Attachment 1 Page 1 of 3 U.S. National Work Group Measuring the system call your telephone number. If that process does not work dial the number and enter the pass code topics. #12;USNWG EVSE ­ 15-17 JAN 2013 MTG AGENDA Attachment 1 Page 2 of 3 ATTACHMENTS: No. Agenda Item

410

Time-varying Reeb Graphs for Continuous Space-Time Data  

SciTech Connect (OSTI)

The Reeb graph is a useful tool in visualizing real-valued data obtained from computational simulations of physical processes. We characterize the evolution of the Reeb graph of a time-varying continuous function defined in three-dimensional space. We show how to maintain the Reeb graph over time and compress the entire sequence of Reeb graphs into a single, partially persistent data structure, and augment this data structure with Betti numbers to describe the topology of level sets and with path seeds to assist in the fast extraction of level sets for visualization.

Edelsbrunner, H; Harer, J; Mascarenhas, A; Pascucci, V; Snoeyink, J

2008-04-22T23:59:59.000Z

411

Part VII: Section J: List of Documents, Exhibits, and Other Attachment...  

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

T DE-AC36-08GO28308 Modification M801 Attachment T Human Resources Workforce Plan Incorporated by Reference In Modification M009...

412

E-Print Network 3.0 - attachment network model Sample Search...  

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

Sciences, University of Bath Collection: Mathematics 84 Feedback Circuits in Evolving Networks: Micro-Macro Linkages for Biases in Attachment, Routing and Distance Decay...

413

Comparing Place Attachment and Environmental Ethics of Visitors and State Park Employees in Oklahoma.  

E-Print Network [OSTI]

??This research examines the relationship between place attachment and environmental ethics of state parks visitors and employees in Oklahoma. Furthermore, this research also examines differences (more)

Bradley, Michael Joshua

2012-01-01T23:59:59.000Z

414

Mission Support Contract Attachment J.10 Contract No. DE-AC06...  

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

Pavement Breaker, Hydra-hammer and similar; Power Broom; Spray Curing Machine (concrete); Spreader Box Mission Support Contract Attachment J.10 Contract No....

415

NON RESIDENT ALIEN REQUIRED DOCUMENTS CLASSIFICATION REQUIRED ATTACHEMENTS MUST BE SUBMITTED WITH THE  

E-Print Network [OSTI]

NON RESIDENT ALIEN REQUIRED DOCUMENTS CLASSIFICATION REQUIRED ATTACHEMENTS MUST BE SUBMITTED WITH THE PAYROLL DOCUMENTS AND CITIZENSHIP STATUS FORM Permanent Resident Resident Alien Card, or I-551 Stamped

Adali, Tulay

416

Part VII: Section J: List of Documents, Exhibits, and Other Attachment...  

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

J Performance Evaluation And Measurement Plan The Performance Evaluation and Measurement Plan, Version 1.0, dated October 31, 2013 is hereby incorporated as Attachment J of the...

417

Direct attach cable assembly specification analysis from 8 port S-parameters.  

E-Print Network [OSTI]

??This thesis focuses on test and characterization of the Direct Attach passive cables by 8 port s-parameter analysis. The setup comprises of the Network Analyzer, (more)

Paithankar, Shachi

2011-01-01T23:59:59.000Z

418

Attachment Implementation Procedures to Report Deferred, Actual, and Required Maintenance  

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

Final July 01, 2010 Final July 01, 2010 1 Attachment Implementation Procedures to Report Deferred, Actual, and Required Maintenance On Real Property 1. The following is the FY 2010 implementation procedures for the field offices/sites to determine and report deferred maintenance on real property as required by the Statement of Federal Financial Accounting Standards (SFFAS) No. 6, Accounting for Property, Plant, and Equipment (PP&E) and DOE Order 430.1B, Real Property Asset Management (RPAM). a. This document is intended to assist field offices/sites in consistently and accurately applying the appropriate methods to determine and report deferred maintenance estimates and reporting of annual required and actual maintenance costs. b. This reporting satisfies the Department's obligation to recognize and record deferred

419

Attachment 7, NETL Assurance, Non-Construction Programs  

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

38# 38# (12/1999) OPI=PS10 (Previous Editions Obsolete) Attachment 7 NETL ASSURANCE, NON-CONSTRUCTION PROGRAMS Identify and complete the assurances, representations, and certifications below that are applicable to your project or program. Questions or comments should be addressed to the awarding agency. __ Standard Form 424B# "Assurances - Non-Construction Programs" __ NETL F 4220.35# "Additional Representations and Certifications for Federal Financial Assistance" __ Standard Form LLL # "Disclosure of Lobbying Activities" __ DOE F 1600.5 # "U. S. Department of Energy Assurance of Compliance Nondiscrimination in Federally Assisted Programs, OMB Burden Disclosure" Applicant Certification The Applicant certifies that it has complied, or that, within 90 days of the date of the grant or cooperative agreement, it will comply with

420

Attachment A.1: Summary of Mandatory Language Provisions | Department of  

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

A.1: Summary of Mandatory Language Provisions A.1: Summary of Mandatory Language Provisions Attachment A.1: Summary of Mandatory Language Provisions SUMMARY OF MANDATORY LANGUAGE PROVISIONS 1. Regulatory and non-regulatory activities "The parties to this Agreement further understand that the oversight activities authorized by this Agreement are intended to supplement activities conducted under applicable environmental laws and regulations, but not to support specific State regulatory, permitting, and legally-required environmental oversight activities, such as issuance of regulatory permits, the review of DOE regulatory submissions when such review serves primarily as the basis for State action under regulatory programs, required regulatory inspections, required monitoring, issuance of regulatory notices of violation and other citations, nor to support the

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

Attachment 5 Volume II Pricing Matrix.xls  

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

PRICE MATRIX PRICE MATRIX ATTACHMENT 5 VOLUME II SUMMARY Logistics Services A-76 Study - Service Provider Price Offer for Phase in Period, Volume III. Service Provider Name: GSA Schedule Contract Number: Expiration Date of GSA Schedule Contract: Duration Base Period: 3 Calendar Years SUMMARY FORRESTAL Term of Performance TOTAL PROPOSED COST Phase-in Period 10/01/2004 - 06/30/2004 $ Base Period Year One 07/01/2005 - 06/30/2006 $ Year Two 07/01/2006 - 06/30/2007 $ Period Three 07/01/2007 - 09/30/2007 $ $ Option Period Year One 10/01/2007 - 09/30/2008 $ Period Two 10/01/2008 - 09/30/2009 $ $ SUMMARY GERMANTOWN Term of Performance TOTAL PROPOSED COST Phase-in Period 10/01/2004 - 06/30/2004 $ Base Period Year One

422

Attachment Implementation Procedures to Report Deferred, Actual, and Required Maintenance  

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

Draft July 9, 2009 Draft July 9, 2009 1 Attachment Implementation Procedures to Report Deferred, Actual, and Required Maintenance On Real Property 1. The following is the FY 2009 implementation procedures for the field offices/sites to determine and report deferred maintenance on real property as required by the Statement of Federal Financial Accounting Standards (SFFAS) No. 6, Accounting for Property, Plant, and Equipment (PP&E) and DOE Order 430.1B, Real Property Asset Management (RPAM). a. This document is intended to assist field offices/sites in consistently and accurately applying the appropriate methods to determine and report deferred maintenance estimates and reporting of annual required and actual maintenance costs. b. This reporting satisfies the Department's obligation to recognize and record deferred

423

Attachment G: Guidance on Headquarters Approval of State  

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

G: Guidance on Headquarters Approval of State G: Guidance on Headquarters Approval of State Agreements-in-Principle Attachment G: Guidance on Headquarters Approval of State Agreements-in-Principle Guidance on Headquarters Approval of State Agreements-in-Principle Introduction: In December 1993, the Office of Environmental Management (EM) informed states that the Department intended to extend the existing Agreements-in-Principle (AIPs) for another five-year term and would continue to negotiate new AIPs. The purpose of this memorandum is to provide guidance on Headquarters approval of State AIPs in the EM program. This guidance applies to both new and renegotiated AIPs. All Operations and Field Offices are directed to involve appropriate Headquarters organizations early in the negotiations to assure that draft agreements

424

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

425

C:\Eco-SSLs\Final Guidance November 2003\Attachments\Attachment 4-3\Revised TRV SOP 12012002.wpd  

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

3 3 Guidance for Developing Ecological Soil Screening Levels (Eco-SSLs) Eco-SSL Standard Operating Procedure (SOP) #4: Wildlife Toxicity Reference Value Literature Review, Data Extraction and Coding OSWER Directive 92857-55 Issued November 2003 Revised October 2005 This page left intentionally blank Attachment 4-3 Standard Operating Procedure (SOP) #4: Wildlife Toxicity Reference Value Literature Review, Data Extraction and Coding for Ecological Soil Screening Levels (Eco-SSLs) OSWER Directive 92857-55 October 2005 Prepared for USEPA Region 8 by Syracuse Research Corporation Denver, Colorado 80123 maintained by Computer Sciences Corporation Duluth, Minnesota 55804 Contract 68-W01-032, Task Order No. 24 This page left intentionally blank i TABLE OF CONTENTS 1.0 INTRODUCTION

426

Labor/Tuition Cost Transfers Involving Sponsored Funds Labor Cost Transfer (Attach Labor Redistribution Worksheet)  

E-Print Network [OSTI]

Labor/Tuition Cost Transfers Involving Sponsored Funds Labor Cost Transfer (Attach Labor Redistribution Worksheet) Tuition Cost Transfer Greater Than 90 days or Cross Semesters (Attach BRIO Query) Date state that all cost transfers should be requested within 90 days of the original expenditure

Salama, Khaled

427

Multilayer friction and attachment effects on energy dissipation in graphene nanoresonators  

E-Print Network [OSTI]

Multilayer friction and attachment effects on energy dissipation in graphene nanoresonators Sung graphene monolayers, as well as extrinsic attachment or clamping strength between graphene and a model silicon substrate on the energy dissipation Q-factors of oscillating graphene nanoresonators. Both

Lin, Xi

428

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

429

Random even graphs and the Ising model Geo#rey Grimmett # , Svante Janson +  

E-Print Network [OSTI]

Random even graphs and the Ising model Geo#rey Grimmett # , Svante Janson + September 19, 2007 Abstract We explore the relationship between the Ising model with inverse temperature #, the q = 2 random. For a planar graph G, the boundary edges of the + clusters of the Ising model on the planar dual of G forms

Janson, Svante

430

The Multivariate Ising Polynomial of a Graph Daniel Andren and Klas Markstrom  

E-Print Network [OSTI]

The Multivariate Ising Polynomial of a Graph Daniel Andr´en and Klas Markstr¨om Abstract. In this paper we discuss the two variable Ising polyno- mial in a graph theoretical setting. This polynomial has its origin in physics as the partition function of the Ising model with an external field. We prove

Markström, Klas

431

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

432

Perfect Graphs Edited by J.L. RAMIREZ ALFONSIN and B.A. REED  

E-Print Network [OSTI]

York . Brisbane . Toronto . Singapore #12; 1 The Theta Body and Imperfection F.B. Shepherd FundamentalPerfect Graphs Edited by J.L. RAMIREZ ALFONSIN and B.A. REED JOHN WILEY & SONS Chichester . New). Perfect Graphs. Editor J.L. Ram'irez Alfons'in and B.A. Reed c fl2000 John Wiley & Sons Ltd. #12; 2

Shepherd, Bruce

433

On Regular Graphs Optimally Labeled with a Condition at Distance Two  

Science Journals Connector (OSTI)

For positive integers $j \\geq k$, the $\\lambda_{j,k}$-number of graph G is the smallest span among all integer labelings of V(G) such that vertices at distance two receive labels which differ by at least k and adjacent vertices ... Keywords: $L(j, k)$-labeling, prism, regular graph

John P. Georges; David W. Mauro

2004-02-01T23:59:59.000Z

434

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

435

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

436

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

437

Modeling and Recognition of Landmark Image Collections Using Iconic Scene Graphs  

E-Print Network [OSTI]

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

Lazebnik, Svetlana

438

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

439

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

440

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

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

Improved group-theoretical method for eigenvalue problems of special symmetric structures, using graph theory  

Science Journals Connector (OSTI)

Group-theoretical methods for decomposition of eigenvalue problems of skeletal structures with symmetry employ the symmetry group of the structures and block-diagonalize their matrices. In some special cases, such decompositions can further be continued. ... Keywords: Decomposition, Eigenvalues, Group theory, Laplacian matrix, Mass graph, Natural frequency, Representation theory, Stiffness graph, Symmetry

A. Kaveh; M. Nikbakht

2010-01-01T23:59:59.000Z

442

Memory Bounds for the Distributed Execution of a Hierarchical Synchronous Data-Flow Graph  

E-Print Network [OSTI]

Memory Bounds for the Distributed Execution of a Hierarchical Synchronous Data-Flow Graph Karol analysis tech- nique to define the boundary of shared memory requirements of Multiprocessor System of transformations to the SDF graph so as to reveal its memory characteristics. These transformations produce

Paris-Sud XI, Université de

443

Attaching solar collectors to a structural framework utilizing a flexible clip  

DOE Patents [OSTI]

Methods and apparatuses described herein provide for the attachment of solar collectors to a structural framework in a solar array assembly. A flexible clip is attached to either end of each solar collector and utilized to attach the solar collector to the structural framework. The solar collectors are positioned to allow a member of the framework to engage a pair of flexible clips attached to adjacent solar collectors during assembly of the solar array. Each flexible clip may have multiple frame-engaging portions, each with a flange on one end to cause the flexible clip to deflect inward when engaged by the framework member during assembly and to guide each of the frame-engaging portions into contact with a surface of the framework member for attachment.

Kruse, John S

2014-03-25T23:59:59.000Z

444

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

445

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

E-Print Network [OSTI]

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

Kschischang, Frank R.

446

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

447

Fusion Activation through Attachment Protein Stalk Domains Indicates a Conserved Core Mechanism of Paramyxovirus Entry into Cells  

Science Journals Connector (OSTI)

...research-article Structure and Assembly Fusion Activation through Attachment Protein...viral integral membrane glycoproteins (fusion [F] and attachment [HN, H, or G...receptor recognition, followed by the fusion of viral and cellular membranes, resulting...

Sayantan Bose; Albert S. Song; Theodore S. Jardetzky; Robert A. Lamb

2014-01-22T23:59:59.000Z

448

Attachment method for stacked integrated circuit (IC) chips  

DOE Patents [OSTI]

An attachment method for stacked integrated circuit (IC) chips. The method involves connecting stacked chips, such as DRAM memory chips, to each other and/or to a circuit board. Pads on the individual chips are rerouted to form pads on the side of the chip, after which the chips are stacked on top of each other whereby desired interconnections to other chips or a circuit board can be accomplished via the side-located pads. The pads on the side of a chip are connected to metal lines on a flexible plastic tape (flex) by anisotropically conductive adhesive (ACA). Metal lines on the flex are likewise connected to other pads on chips and/or to pads on a circuit board. In the case of a stack of DRAM chips, pads to corresponding address lines on the various chips may be connected to the same metal line on the flex to form an address bus. This method has the advantage of reducing the number of connections required to be made to the circuit board due to bussing; the flex can accommodate dimensional variation in the alignment of chips in the stack; bonding of the ACA is accomplished at low temperature and is otherwise simpler and less expensive than solder bonding; chips can be bonded to the ACA all at once if the sides of the chips are substantially coplanar, as in the case for stacks of identical chips, such as DRAM.

Bernhardt, Anthony F. (Berkeley, CA); Malba, Vincent (Livermore, CA)

1999-01-01T23:59:59.000Z

449

Attachment method for stacked integrated circuit (IC) chips  

DOE Patents [OSTI]

An attachment method for stacked integrated circuit (IC) chips is disclosed. The method involves connecting stacked chips, such as DRAM memory chips, to each other and/or to a circuit board. Pads on the individual chips are rerouted to form pads on the side of the chip, after which the chips are stacked on top of each other whereby desired interconnections to other chips or a circuit board can be accomplished via the side-located pads. The pads on the side of a chip are connected to metal lines on a flexible plastic tape (flex) by anisotropically conductive adhesive (ACA). Metal lines on the flex are likewise connected to other pads on chips and/or to pads on a circuit board. In the case of a stack of DRAM chips, pads to corresponding address lines on the various chips may be connected to the same metal line on the flex to form an address bus. This method has the advantage of reducing the number of connections required to be made to the circuit board due to bussing; the flex can accommodate dimensional variation in the alignment of chips in the stack; bonding of the ACA is accomplished at low temperature and is otherwise simpler and less expensive than solder bonding; chips can be bonded to the ACA all at once if the sides of the chips are substantially coplanar, as in the case for stacks of identical chips, such as DRAM. 12 figs.

Bernhardt, A.F.; Malba, V.

1999-08-03T23:59:59.000Z

450

Attached is Policy Flash 2013-34 Department of Energy Acquisition Letter 2013-04 on Executive Compensation  

Broader source: Energy.gov [DOE]

Attached is Policy Flash 2013-34 Department of Energy Acquisition Letter 2013-04 on Executive Compensation

451

Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes  

Science Journals Connector (OSTI)

Abstract An identifying code is a subset of vertices of a graph with the property that each vertex is uniquely determined (identified) by its nonempty neighbourhood within the identifying code. When only vertices out of the code are asked to be identified, we get the related concept of a locating-dominating set. These notions are closely related to a number of similar and well-studied concepts such as the one of a test cover. In this paper, we study the decision problems Identifying Code and Locating-Dominating Set (which consist in deciding whether a given graph admits an identifying code or a locating-dominating set, respectively, with a given size) and their minimization variants Minimum Identifying Code and Minimum Locating-Dominating Set. These problems are known to be NP-hard, even when the input graph belongs to a number of specific graph classes such as planar bipartite graphs. Moreover, it is known that they are approximable within a logarithmic factor, but hard to approximate within any sub-logarithmic factor. We extend the latter result to the case where the input graph is bipartite, split or co-bipartite: both problems remain hard in these cases. Among other results, we also show that for bipartite graphs of bounded maximum degree (at least 3), the two problems are hard to approximate within some constant factor, a question which was open. We summarize all known results in the area, and we compare them to the ones for the related problem Dominating Set. In particular, our work exhibits important graph classes for which Dominating Set is efficiently solvable, but Identifying Code and Locating-Dominating Set are hard (whereas in all previous works, their complexity was the same). We also introduce graph classes for which the converse holds, and for which the complexities of Identifying Code and Locating-Dominating Set differ.

Florent Foucaud

2014-01-01T23:59:59.000Z

452

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

453

Graph fusion algebras of WLM(p,p')  

E-Print Network [OSTI]

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

Jorgen Rasmussen

2009-11-17T23:59:59.000Z

454

E-Print Network 3.0 - anger preoccupied attachment Sample Search...  

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

preoccupied attachment Page: << < 1 2 3 4 5 > >> 1 Journal of Personality and Social Psychology Copyright 1997 by the American PsychologicalAssociation, Inc. 1997, Vol. 73, No. 6,...

455

The attachment of amino fragment to purine: inner-shell structures and spectra  

Science Journals Connector (OSTI)

The impact of the amino fragment attachment on the inner-shell structures and spectra of unsubstituted purine and the purine ring of adenine is studied using density functional theory.

Saha, S.

2008-02-19T23:59:59.000Z

456

Certification and Rating of Attachments for Fenestration Technologies (DE-FOA-0001000)  

Broader source: Energy.gov [DOE]

Closed Total DOE Funding: $1.6 million Deadline: February 5, 2014 Through this Funding Opportunity Announcement (FOA) the Building Technologies Office (BTO) seeks to establish a performance rating mechanism for assessing the energy performance of fenestration attachments.

457

M&V Plan and Savings Calculations Methods Outline (IDIQ Attachment...  

Office of Environmental Management (EM)

M&V Plan and Savings Calculations Methods Outline (IDIQ Attachment J-8) Document outlines measurement and verification (M&V) planning and savings calculation methods for an energy...

458

E-Print Network 3.0 - attachment cronostratigraphy aplied Sample...  

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

of San Carlos Summary: to stiff clumps which attach on hard surfaces near the low tide limit down to 2 m deep. During blooms... . 1996a. Lifetime energy budget in the sea...

459

Part VII: Section J: List of Documents, Exhibits, and Other Attachment...  

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

Vehicles Attachment E DE-AC36-08GO28308 Modification M801 40 CFR 110 - Discharge of Oil 40 CFR 112 - Oil Pollution Prevention 40 CFR 113 - Liability Limits for Small Onshore...

460

Numerical computation of electric arc with annular attachment on the cathode butt end  

Science Journals Connector (OSTI)

The results of computing a stationary arc with annular attachment on the butt end of a solid cylindrical cathode are presented. The influence of the discharge external parameters on the characteristics of arc ...

A. Zh. Zhainakov; R. M. Urusov; T. E. Urusova

2006-12-01T23:59:59.000Z

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

Conflict and quality in the mentoring relationship: the role of mentor attachment  

E-Print Network [OSTI]

of aggressive behavior. The aggressive child is on a potentially dangerous trajectory heading towards social incompetence, academic failure, substance abuse, mental health problems, and criminality (Coie, Lochman, Terry, & Hyman, 1992; Loeber, 1990; Stattin...) proposed that conditions of theat to the relationship activate the attachment system and elicit attachment behavior. Pistole (1989) suggests that conflict is a potential threat to a relationship and may be one of the vehicles through which the quality...

Alfonso, Laura Magdalena

2012-06-07T23:59:59.000Z

462

Advances in model transformations by graph transformation: specification, execution and analysis  

Science Journals Connector (OSTI)

Model transformations are a core technology of today's model-driven software development processes. Graph transformations provide a state-of-the-art formalism to specify and execute such transformations in practice. This was the case in the SENSORIA ...

Gbor Bergmann; Artur Boronat; Reiko Heckel; Paolo Torrini; Istvn Rth; Dniel Varr

2011-01-01T23:59:59.000Z

463

On Zero-Sum \\({\\mathbb{Z}_k}\\) -Magic Labelings of 3-Regular Graphs  

Science Journals Connector (OSTI)

Let G = (V, E) be a finite loopless graph and let (A,+) be an abelian group with identity 0. Then an A-magic labeling of G is a function ...

Jeong-Ok Choi; J. P. Georges; David Mauro

2013-05-01T23:59:59.000Z

464

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

465

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

466

GrIDS A GRAPH BASED INTRUSION DETECTION SYSTEM FOR LARGE NETWORKS  

E-Print Network [OSTI]

or groups of hosts. By analyzing the characteristics of the activity graphs, GrIDS detects and reports under contract DOD DABT 63-93-C-0045. intra-networks intranets to share and disseminate internal

California at Davis, University of

467

Novel approaches for solving large-scale optimization problems on graphs  

E-Print Network [OSTI]

This dissertation considers a class of closely related NP-hard otpimization problems on graphs that arise in many important applications, including network-based data mining, analysis of the stock market, social networks, coding theory, fault...

Trukhanov, Svyatoslav

2009-05-15T23:59:59.000Z

468

The effects of non-thermal atmospheric pressure plasma jet on attachment of osteoblast  

Science Journals Connector (OSTI)

Despite the high success rate of dental implant surgery, the failures are still being reported and investigation have been undergone to improve attachment of osteoblast on the surface of implant material. With increasing interest in non-thermal atmospheric pressure plasma jet (NTAPPJ), the effects of it on the cellular mechanisms have been previously reported. Hence in this experiment, effects of NTAPPJ on osteoblast for improved attachment and possible application in dental implant surgery were investigated. Mouse osteoblast cells of MC3T3-E1 were first directly treated with NTAPPJ with air for various durations. Also to investigate the effects by culture media, culture media were separately treated with NTAPPJ for the same durations. Cell attachments were then assessed following 4 and 24h of cell culture using Water Soluble Tetrazolium salt (WST) assay and confirmed by automated cell counter and examining under confocal laser microscope. The results showed that there was significantly improved osteoblast attachment with relatively short duration of NTAPPJ treatment. Also results indicated that NTAPPJ possibly improved osteoblast attachment through interactions with proteins in culture media that in turn interacted with cells. Hence the application of NTAPPJ on osteoblast improves cellular attachment and would be useful tool for dental implant surgery.

Jae-Sung Kwon; Yong Hee Kim; Eun Ha Choi; Kyoung-Nam Kim

2013-01-01T23:59:59.000Z

469

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

470

Fusion categories in terms of graphs and relations  

E-Print Network [OSTI]

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

Hendryk Pfeiffer

2009-12-02T23:59:59.000Z

471

Translation of Graph-based Knowledge Representation in Multi-agent System  

Science Journals Connector (OSTI)

Abstract Agents provide a feasible mean for maintaining and manipulating large scale data. This paper deals with the problem of information exchange between different agents. It uses graph based formalism for the representation of knowledge maintained by an agent and graph transformations as a mean of knowledge exchange. Such a rigorous formalism ensures the cohesion of graph-based knowledge held by agents after each modification and exchange action. The approach presented in this paper is illustrated by a case study dealing with the problem of personal data held in different places (maintained by different agents) and the process of transmitting such information.11 Financial support for this study was provided from resources of National Center for Research and Development, the grant number \\{NCBiR\\} 0021/R/ID2/2011/01.

Leszek Kotulski; Adam S?dziwy; Barbara Strug

2014-01-01T23:59:59.000Z

472

Influence of geometry and topology of quantum graphs on their nonlinear optical properties  

Science Journals Connector (OSTI)

We analyze the nonlinear optics of quasi-one-dimensional quantum graphs and manipulate their topology and geometry to generate nonlinearities in a simple system approaching the fundamental limits of the first and second hyperpolarizabilities. We explore a huge configuration space in order to determine whether the fundamental limits may be approached for specific topologies, independent of molecular details, when the geometry is manipulated to maximize the intrinsic response. Changes in geometry result in smooth variations of the nonlinearities. Topological changes between geometrically similar systems cause profound changes in the nonlinear susceptibilities that include a discontinuity due to abrupt changes in the boundary conditions. We demonstrate the same universal scaling behavior for quantum graphs that is predicted for general quantum nonlinear optical systems near their fundamental limits, indicating that our results for quantum graphs may reflect general structure-property relationships for globally optimized nonlinear optical systems.

Rick Lytel; Shoresh Shafei; Julian H. Smith; Mark G. Kuzyk

2013-04-17T23:59:59.000Z

473

Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard  

Science Journals Connector (OSTI)

Let G = (V,E) be an undirected graph and C a subset of vertices. If the sets Br(?) ? C, ? ? V (respectively, ? ? V\\C), are all nonempty and different, where Br(?) ... Keywords: NP-completeness, coding theory, complexity, graph, identifying code, locating-dominating code

Irne Charon; Olivier Hudry; Antoine Lobstein

2003-01-01T23:59:59.000Z

474

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

475

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

476

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

477

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

478

Low-cost conversion of a coaxial nozzle arrangement into a stationary low-temperature attachment  

Science Journals Connector (OSTI)

An easily assembled stationary nozzle accessory designed for the Siemens/Nicolet LTII low-temperature device with standard coaxial nozzle arrangement is described. The attachment significantly improves the efficiency of the cooling device as well as the versatility of the diffractometer.

Kottke, T.

1996-08-01T23:59:59.000Z

479

ATTACHMENT TO FORM 8233 (For use by students of Egypt who are claiming Tax Treaty exemption).  

E-Print Network [OSTI]

ATTACHMENT TO FORM 8233 (For use by students of Egypt who are claiming Tax Treaty exemption). 1. I was a resident of Egypt on the date of my arrival in the United States. I am not a United States citizen. I have the United States and Egypt in an amount not in excess of $3000 for any taxable year. I have not previously

Daly, Samantha

480

Secure attachment, self-esteem, and optimism as predictors of positive body mage in women  

E-Print Network [OSTI]

, self-esteem and optimism were found to be moderately correlated. Self-esteem and optimism were not significantly related to body image in the SEM analysis and therefore the overall proposed model was not supported. In this sample, secure attachment...

Sandoval, Erin Leverenz

2009-05-15T23:59:59.000Z

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

The Effects of Volunteering on the Development of Place Attachment and Stewardship of Natural Places  

E-Print Network [OSTI]

The purpose of this study was to explore how volunteers engaged in natural-area based projects develop attachments to the resource and act as stewards for these resources. The context of this study was the National Park Service's All Taxa...

Eccles, Kate

2010-01-16T23:59:59.000Z

482

ATTACHMENT IX Review of Air Products Fischer-Tropsch Synthesis Work  

E-Print Network [OSTI]

IX.1-Draft ATTACHMENT IX Review of Air Products Fischer-Tropsch Synthesis Work During the 1980s, Air Products & Chemicals worked on several aspects of the Fischer-Tropsch synthesis. These included, exhibited similar activity and product selectivity, showing that the preparative method was reproducible

Kentucky, University of

483

Electronic Structure and Spectra of Catechol and Alizarin in the Gas Phase and Attached to Titanium  

E-Print Network [OSTI]

Electronic Structure and Spectra of Catechol and Alizarin in the Gas Phase and Attached to Titanium surfaces plays a key role in a number of important applications, including photoca- talysis-to-electron energy conversion yield; low photovoltage, however, remains a limiting factor. Due to electron relaxation

484

IRB-HSR GRANT APPLICATION SUMMARY FORM Please attach a Grant Information Form with this document.  

E-Print Network [OSTI]

IRB-HSR GRANT APPLICATION SUMMARY FORM Please attach a Grant Information Form with this document_______________________________________________________________________________ Principal Investigator_____________________________(This must be the PI as listed on Grant Application. Briefly explain how this will be accomplished in the protocols in this grant application: Is this item

Acton, Scott

485

General Grant Terms and Conditions Rev. January 10, 2012 (Attachment K)  

E-Print Network [OSTI]

General Grant Terms and Conditions Rev. January 10, 2012 (Attachment K) EXHIBIT C TERMSU ............................................................................... 24 #12;General Grant Terms and Conditions Rev. January 10, 2012 1 TERMS AND CONDITIONS 1. 0BGrant Agreement This project is being funded with a grant from the California Energy Commission (Commission

486

Single molecule high-resolution colocalization of Cy3 and Cy5 attached to macromolecules measures  

E-Print Network [OSTI]

Single molecule high-resolution colocalization of Cy3 and Cy5 attached to macromolecules measures, 2004 Here we present a technique called single-molecule high-resolution colocalization (SHREC's lower resolution limit lies at the upper resolution limit of single molecule FRET (smFRET) microscopy

Spudich, James A.

487

Protective interior wall and attaching means for a fusion reactor vacuum vessel  

DOE Patents [OSTI]

The wall basically consists of an array of small rectangular plates attached to the existing walls with threaded fasteners. The protective wall effectively conceals and protects all mounting hardware beneath the plate array, while providing a substantial surface area that will absorb plasma energy.

Phelps, R.D.; Upham, G.A.; Anderson, P.M.

1985-03-01T23:59:59.000Z

488

An evaluation of the storage systems based on network-attached disks  

E-Print Network [OSTI]

show that (a) The advantages of distributing the server's network processing workload to disks may be offset by the decreased cache hit ratios in a file system based on network-attached disks. (b) Performance can be significantly improved in a Web...

Ma, Gang

1998-01-01T23:59:59.000Z

489

Analytical Model for Rates of Electron Attachment and Intramolecular Electron Transfer in Electron Transfer  

E-Print Network [OSTI]

. As a result, in ECD the primary source of excess energy is the recombination energy released when the electronAnalytical Model for Rates of Electron Attachment and Intramolecular Electron Transfer in Electron-mail: simons@chem.utah.edu Abstract: A new physical model is put forth to allow the prediction of electron

Simons, Jack

490

Proceedings of the 2010 Northeastern Recreation Research Symposium GTR-NRS-P-94 141 HOW PLACE ATTACHMENTS INFLUENCE RECREATION CONFLICT  

E-Print Network [OSTI]

Proceedings of the 2010 Northeastern Recreation Research Symposium GTR-NRS-P-94 141 HOW PLACE ATTACHMENTS INFLUENCE RECREATION CONFLICT AND COPING BEHAVIOR Cheng-PingWang DepartmentofTourism Shih.--Thepurposeofthisstudywastoexplore how place attachment influences recreation conflict andcopingbehaviorsbasedontheTransactional Stress

491

44 IEEE TRANSACTIONS ON PLASMA SCIENCE, VOL. 27, NO. 1, FEBRUARY 1999 Ultraviolet Imaging of the Anode Attachment  

E-Print Network [OSTI]

of the Anode Attachment in Transferred-Arc Plasma Cutting Byron L. Bemis and Gary S. Settles Abstract-- The anode phenomena occurring at the location of current transfer from the plasma jet to the plate affects imaging technique was used to visualize the anode attachment spot under various cut- ting conditions

Settles, Gary S.

492

EERE Award No. DE-EE000____ to ____________ Attachment 2 EERE Intellectual Property Provisions: Nonresearch and Development Awards ("NRD")  

E-Print Network [OSTI]

EERE Award No. DE-EE000____ to ____________ Attachment 2 ­ EERE Intellectual Property Provisions: Nonresearch and Development Awards ("NRD") EERE 175: IP Provision ­ Nonresearch and Development Version 1 Last Updated July 2013 ATTACHMENT 2: EERE INTELLECTUAL PROPERTY PROVISIONS: NONRESEARCH AND DEVELOPMENT

493

Measurement of electron-attachment line shapes, cross sections, and rate constants in HI and DI at ultralow electron energies  

Science Journals Connector (OSTI)

Electron-attachment cross sections are reported in the electron energy range 0150 meV, at an energy resolution of 6.5 meV (full width at half maximum) for the molecules HI and DI. Use is made of the Kr photoionization method to obtain cross sections for HI, and a signal intercomparison technique to obtain cross sections and the thermal-attachment rate constant for DI. Attachment properties of the two molecules are very similar. The ratio of attachment cross sections is discussed in terms of the reduced-mass dependence of the dissociation width and the survival probability, and in terms of spectroscopic thresholds and rotational populations for attachment at 300 K. Approximate potential-energy curves for the lowest states of the neutral molecule and negative ion are given.

S. H. Alajajian and A. Chutjian

1988-05-15T23:59:59.000Z

494

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

495

Graph analysis of functional brain networks: practical issues in translational neuroscience  

Science Journals Connector (OSTI)

...Theme Issue Complex network theory and the brain compiled and edited by David Papo, Javier...Bullmore Graph analysis of functional brain networks: practical issues in translational...Theme Issue Complex network theory and the brain . The brain can be regarded as a network...

2014-01-01T23:59:59.000Z

496

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

Science Journals Connector (OSTI)

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

John P. Georges; David W. Mauro

2005-05-01T23:59:59.000Z

497

Notes: A note on collections of graphs with non-surjective lambda labelings  

Science Journals Connector (OSTI)

The @l-number of a graph G, denoted @l(G), is the smallest integer k such that there exists a function from V(G) into {0,1,2,...,k} under which adjacent vertices receive integers which differ by at least 2 and vertices at distance two receive integers ... Keywords: ?-Labeling, ?-Number, 05C, L(2,1)-Labeling, Surjective

John P. Georges; David W. Mauro

2005-02-01T23:59:59.000Z

498

On the $\\lambda$-Number of $Q_n$ and Related Graphs  

Science Journals Connector (OSTI)

An $L(2, l)$-labeling of graph $G$ is an integer labeling of $V(G)$ such that adjacent vertices have labels that differ by at least 2 and such that vertices distance 2 apart have labels that differ by at least 1. The $\\lambda$-number of $G, \\lambda(G)$, ... Keywords: $\\lambda$-labeling, $n$-cube, vertex labeling

Marshall A. Whittlesey; John P. Georges; David W. Mauro

1995-11-01T23:59:59.000Z

499

A note on collections of graphs with non-surjective lambda labelings  

Science Journals Connector (OSTI)

The ?-number of a graph G, denoted ?(G), is the smallest integer k such that there exists a function from V(G) into {0, 1, 2,..., k} under which adjacent vertices receive integers which differ by at least ... Keywords: ?-labeling, ?-number, L(2, 1)-labeling, surjective

John P. Georges; David W. Mauro

2005-02-01T23:59:59.000Z

500

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