Sample records for graphs attachment 3-sampling

  1. Asymptotic Behavior and Distributional Limits of Preferential Attachment Graphs

    E-Print Network [OSTI]

    Chaudhuri, Surajit

    , Christian Borgs, Jennifer T. Chayes and Amin Saberi Mathematics Department, Hebrew University, Jerusalem Alto, CA 94305. e-mail: saberi@stanford August 2009 (revised August 2010) Abstract: We give an explicit;Berger, Borgs, Chayes, Saberi /Preferential attachment limits 2 Earlier, a notion of a weak local limit

  2. RFP RHB-5-52468 Attachment 3 Sample Subcontract

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

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel),Feet) Year Jan Feb Mar Apr MayAtmosphericNuclear Security Administration the1 -the Mid-Infrared at 278, 298, and 323 K.Office ofMayPVREPORTPortal 5

  3. Graph Algorithms Tours in Graphs

    E-Print Network [OSTI]

    Bar-Noy, Amotz

    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

  4. On the limiting absorption principle and spectra of quantum graphs

    E-Print Network [OSTI]

    Beng-Seong Ong

    2005-10-10T23:59:59.000Z

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

  5. EMERGENCY PREPAREDNESS SYLLABUS ATTACHMENT

    E-Print Network [OSTI]

    Chen, Kuan-hua J

    2014-08-22T23:59:59.000Z

    EMERGENCY PREPAREDNESS SYLLABUS ATTACHMENT. EMERGENCY NOTIFICATION PROCEDURES are based on a simple concept Ė if you hear a.

  6. Graphs, Trees Pebbles, Robots

    E-Print Network [OSTI]

    Haas, Ruth

    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

  7. Hyperbolic Graph Generator

    E-Print Network [OSTI]

    Aldecoa, Rodrigo; Krioukov, Dmitri

    2015-01-01T23:59:59.000Z

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

  8. Spectral characterizations of sun graphs and broken sun graphs

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    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

  9. Appendix TFIELD Attachment A: Attachment A: TFIELD-2014 Visualization

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

    Laboratories. ERMS 552391. Table of Contents TFIELD Attachment A-1.0 100 Calibrated Hydraulic Conductivity Model Input Parameter Fields TFIELD Attachment A-2.0 100 Calibrated...

  10. Convex Graph Invariants

    E-Print Network [OSTI]

    2010-12-02T23:59:59.000Z

    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.

  11. Graph Generator Survey

    SciTech Connect (OSTI)

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

    2013-12-01T23:59:59.000Z

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

  12. Graphs associated with semigroups

    E-Print Network [OSTI]

    Baber, Stephen Asa

    2012-06-07T23:59:59.000Z

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

  13. Graph concatenation for quantum codes

    E-Print Network [OSTI]

    Beigi, Salman

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

  14. Micromechanical die attachment surcharge

    DOE Patents [OSTI]

    Filter, William F. (Albuquerque, NM); Hohimer, John P. (Albuquerque, NM)

    2002-01-01T23:59:59.000Z

    An attachment structure is disclosed for attaching a die to a supporting substrate without the use of adhesives or solder. The attachment structure, which can be formed by micromachining, functions purely mechanically in utilizing a plurality of shaped pillars (e.g. round, square or polygonal and solid, hollow or slotted) that are formed on one of the die or supporting substrate and which can be urged into contact with various types of mating structures including other pillars, a deformable layer or a plurality of receptacles that are formed on the other of the die or supporting substrate, thereby forming a friction bond that holds the die to the supporting substrate. The attachment structure can further include an alignment structure for precise positioning of the die and supporting substrate to facilitate mounting the die to the supporting substrate. The attachment structure has applications for mounting semiconductor die containing a microelectromechanical (MEM) device, a microsensor or an integrated circuit (IC), and can be used to form a multichip module. The attachment structure is particularly useful for mounting die containing released MEM devices since these devices are fragile and can otherwise be damaged or degraded by adhesive or solder mounting.

  15. Ceramic blade attachment system

    DOE Patents [OSTI]

    Boyd, Gary L. (Alpine, CA)

    1994-01-01T23:59:59.000Z

    A turbine blade having a preestablished rate of thermal expansion is attached to a turbine wheel having a preestablished rate of thermal expansion being greater than the preestablished rate of thermal expansion of the turbine blade. The turbine blade has a root portion having a pair of recessed portions thereon. The turbine wheel includes a plurality of openings in which the turbine blade is positioned. Each of the openings have a pair of grooves therein in which are positioned a pair of pins having a generally rectangular cross-section and a reaction surface thereon. A pair of cylindrical rollers interposed respective ones of the pair of reaction surfaces and the pair of recessed portions. The attachment system or turbine assembly provides an economical, reliable and effective attachment of a component having a preestablished rate of thermal expansion to a component having a greater preestablished rate of thermal expansion.

  16. Ceramic blade attachment system

    DOE Patents [OSTI]

    Boyd, G.L.

    1994-12-13T23:59:59.000Z

    A turbine blade having a preestablished rate of thermal expansion is attached to a turbine wheel having a preestablished rate of thermal expansion being greater than the preestablished rate of thermal expansion of the turbine blade. The turbine blade has a root portion having a pair of recessed portions thereon. The turbine wheel includes a plurality of openings in which the turbine blade is positioned. Each of the openings have a pair of grooves therein in which are positioned a pair of pins having a generally rectangular cross-section and a reaction surface thereon. A pair of cylindrical rollers interposed respective ones of the pair of reaction surfaces and the pair of recessed portions. The attachment system or turbine assembly provides an economical, reliable and effective attachment of a component having a preestablished rate of thermal expansion to a component having a greater preestablished rate of thermal expansion. 3 figures.

  17. Internal pipe attachment mechanism

    DOE Patents [OSTI]

    Bast, Richard M. (Livermore, CA); Chesnut, Dwayne A. (Pleasanton, CA); Henning, Carl D. (Livermore, CA); Lennon, Joseph P. (Livermore, CA); Pastrnak, John W. (Livermore, CA); Smith, Joseph A. (Livermore, CA)

    1994-01-01T23:59:59.000Z

    An attachment mechanism for repairing or extending fluid carrying pipes, casings, conduits, etc. utilizing one-way motion of spring tempered fingers to provide a mechanical connection between the attachment mechanism and the pipe. The spring tempered fingers flex to permit insertion into a pipe to a desired insertion depth. The mechanical connection is accomplished by reversing the insertion motion and the mechanical leverage in the fingers forces them outwardly against the inner wall of the pipe. A seal is generated by crushing a sealing assembly by the action of setting the mechanical connection.

  18. Magnetically attached sputter targets

    DOE Patents [OSTI]

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

    1994-02-15T23:59:59.000Z

    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.

  19. Internal pipe attachment mechanism

    DOE Patents [OSTI]

    Bast, R.M.; Chesnut, D.A.; Henning, C.D.; Lennon, J.P.; Pastrnak, J.W.; Smith, J.A.

    1994-12-13T23:59:59.000Z

    An attachment mechanism is described for repairing or extending fluid carrying pipes, casings, conduits, etc. utilizing one-way motion of spring tempered fingers to provide a mechanical connection between the attachment mechanism and the pipe. The spring tempered fingers flex to permit insertion into a pipe to a desired insertion depth. The mechanical connection is accomplished by reversing the insertion motion and the mechanical leverage in the fingers forces them outwardly against the inner wall of the pipe. A seal is generated by crushing a sealing assembly by the action of setting the mechanical connection. 6 figures.

  20. Querying graphs with data†

    E-Print Network [OSTI]

    Vrgoc, Domagoj

    2014-06-27T23:59:59.000Z

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

  1. PERSONAL DATA : / / (Attach Photo)

    E-Print Network [OSTI]

    Ejiri, Shinji

    PERSONAL DATA : / / (Attach Photo) Passport / Please fill out in English Passport No Issued /TEL: /Mail : Spouse No Yes residing in Japan Not residing in Japan #12;PERSONAL DATA : / / Contact person & address in your country / Please fill out in English Name Relationship with you

  2. Graph Concatenation for Quantum Codes

    E-Print Network [OSTI]

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

    2010-02-03T23:59:59.000Z

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

  3. Turbine nozzle attachment system

    DOE Patents [OSTI]

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

    1995-10-24T23:59:59.000Z

    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.

  4. Turbine nozzle attachment system

    DOE Patents [OSTI]

    Norton, Paul F. (San Diego, CA); Shaffer, James E. (Maitland, FL)

    1995-01-01T23:59:59.000Z

    A nozzle guide vane assembly having a preestablished rate of thermal expansion is positioned in a gas turbine engine and being 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.

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

  6. Graph dynamics : learning and representation

    E-Print Network [OSTI]

    Ribeiro, Andre Figueiredo

    2006-01-01T23:59:59.000Z

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

  7. Densities in graphs and matroids

    E-Print Network [OSTI]

    Kannan, Lavanya

    2009-05-15T23:59:59.000Z

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

  8. Temporal Representation in Semantic Graphs

    SciTech Connect (OSTI)

    Levandoski, J J; Abdulla, G M

    2007-08-07T23:59:59.000Z

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

  9. Attached sunspace design analysis

    SciTech Connect (OSTI)

    Jones, R.W.; McFarland, R.D.

    1981-01-01T23:59:59.000Z

    An introduction to new design analysis information for attached sunspaces is presented. The 28 sunspace reference designs are described. Note is taken of those designs (the semi-enclosed geometries) analyzed more recently than the previously published reports. The role of sensitivity studies is discussed, and some sample plots of sunspace performance sensitivity to key design parameters are presented. The monthly solar load ratio (SLR) correlations are reviewed with emphasis on the modified SLR used in the sunspace analysis. The application of the sunspace SLR correlations to monthly design analysis is outlined.

  10. Cliques in graphs

    E-Print Network [OSTI]

    Lo, Allan

    2010-10-12T23:59:59.000Z

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

  11. Ceramic blade attachment system

    DOE Patents [OSTI]

    Frey, deceased, Gary A. (late of Poway, CA); Jimenez, Oscar D. (Escondia, CA)

    1996-01-01T23:59:59.000Z

    A turbine blade having a preestablished rate of thermal expansion is attached to a turbine flange having a preestablished rate of thermal expansion being greater than the preestablished rate of thermal expansion of the turbine blade. The turbine flange includes a first upstanding flange and a second upstanding flange having a groove formed therebetween. The turbine flange further includes a recess. Each of the first and second upstanding flanges have a plurality of bores therein. A turbine blade has a first member and a second member positioned in one of the groove and the recess. Each of the first member and the second member have a plurality of bores therein. And, a pin is positioned in respective ones of the plurality of bores in the first and second upstanding members and the first and second members and attach the blade to the turbine flange. The pin has a preestablished rate of thermal expansion being substantially equal to the rate of thermal expansion of the blade.

  12. Ceramic blade attachment system

    DOE Patents [OSTI]

    Frey, G.A.; Jimenez, O.D.

    1996-12-03T23:59:59.000Z

    A turbine blade having a preestablished rate of thermal expansion is attached to a turbine flange having a preestablished rate of thermal expansion being greater than the preestablished rate of thermal expansion of the turbine blade. The turbine flange includes a first upstanding flange and a second upstanding flange having a groove formed between them. The turbine flange further includes a recess. Each of the first and second upstanding flanges have a plurality of bores therein. A turbine blade has a first member and a second member positioned in one of the groove and the recess. Each of the first member and the second member have a plurality of bores therein. A pin is positioned in respective ones of the plurality of bores in the first and second upstanding members and the first and second members and attach the blade to the turbine flange. The pin has a preestablished rate of thermal expansion being substantially equal to the rate of thermal expansion of the blade. 4 figs.

  13. Ceramic blade attachment system

    DOE Patents [OSTI]

    Shaffer, James E. (Maitland, FL)

    1995-01-01T23:59:59.000Z

    A turbine blade having a preestablished rate of thermal expansion is attached to a turbine disc having a preestablished rate of thermal expansion being greater than the preestablished rate of thermal expansion of the turbine blade and forms a turbine assembly. The turbine blade has a root portion defining a pair of sides having a pair of grooves therein. The turbine assembly includes a pair of flanges between which the turbine blades are positioned. Each of the pair of flanges has a plurality of grooves defined therein. The grooves within the pair of flanges are aligned with the grooves in the blades and have a space formed therebetween. A plurality of spherical balls are positioned within the space. The plurality of spherical balls has a preestablished rate of thermal expansion being equal to the preestablished rate of thermal expansion of the turbine blade.

  14. Ceramic blade attachment system

    DOE Patents [OSTI]

    Shaffer, James E. (Maitland, FL)

    1995-01-01T23:59:59.000Z

    A turbine blade having a preestablished rate of thermal expansion is attached to a turbine wheel having a preestablished rate of thermal expansion being greater than the preestablished rate of thermal expansion of the turbine blade. The turbine blade has a root portion having a first groove and a second groove therein. The turbine wheel includes a plurality of openings in which the turbine blade is positioned. Each of the openings has a first groove and a second groove therein. The space or void formed between the first grooves and the second grooves has a plurality of spherical balls positioned therein. The plurality of spherical balls has a preestablished rate of thermal expansion being equal to the preestablished rate of thermal expansion of the turbine blade.

  15. Ceramic blade attachment system

    DOE Patents [OSTI]

    Shaffer, J.E.

    1995-01-10T23:59:59.000Z

    A turbine blade having a preestablished rate of thermal expansion is attached to a turbine wheel having a preestablished rate of thermal expansion being greater than the preestablished rate of thermal expansion of the turbine blade. The turbine blade has a root portion having a first groove and a second groove therein. The turbine wheel includes a plurality of openings in which the turbine blade is positioned. Each of the openings has a first groove and a second groove therein. The space or void formed between the first grooves and the second grooves has a plurality of spherical balls positioned therein. The plurality of spherical balls has a preestablished rate of thermal expansion being equal to the preestablished rate of thermal expansion of the turbine blade. 4 figures.

  16. Ceramic blade attachment system

    DOE Patents [OSTI]

    Shaffer, J.E.

    1995-07-11T23:59:59.000Z

    A turbine blade having a preestablished rate of thermal expansion is attached to a turbine disc having a preestablished rate of thermal expansion being greater than the preestablished rate of thermal expansion of the turbine blade and forms a turbine assembly. The turbine blade has a root portion defining a pair of sides having a pair of grooves therein. The turbine assembly includes a pair of flanges between which the turbine blades are positioned. Each of the pair of flanges has a plurality of grooves defined therein. The grooves within the pair of flanges are aligned with the grooves in the blades and have a space formed therebetween. A plurality of spherical balls are positioned within the space. The plurality of spherical balls has a preestablished rate of thermal expansion being equal to the preestablished rate of thermal expansion of the turbine blade. 4 figs.

  17. Extremal Graph Numbers of Graphs on Few May 4, 2012

    E-Print Network [OSTI]

    Zeilberger, Doron

    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

  18. Graph Coarsening for Path Finding in Cybersecurity Graphs

    SciTech Connect (OSTI)

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

    2013-01-01T23:59:59.000Z

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

  19. Spectral properties of microwave graphs with local absorption

    E-Print Network [OSTI]

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

    2014-03-30T23:59:59.000Z

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

  20. How to Resum Feynman Graphs

    E-Print Network [OSTI]

    Vincent Rivasseau; Zhituo Wang

    2013-09-24T23:59:59.000Z

    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.

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

    E-Print Network [OSTI]

    Fang, Shiaofen

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

  2. Contraction semigroups on metric graphs

    E-Print Network [OSTI]

    Vadim Kostrykin; Jurgen Potthoff; Robert Schrader

    2008-02-26T23:59:59.000Z

    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.

  3. Phylogenetic Toric Varieties on Graphs

    E-Print Network [OSTI]

    Buczynska, Weronika J.

    2010-10-12T23:59:59.000Z

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

  4. Contractions of planar graphs in polynomial time?

    E-Print Network [OSTI]

    Dimitrios, Thilikos

    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

  5. Extremal Graph Problems, Degenerate Extremal Problems,

    E-Print Network [OSTI]

    Simonovits, Miklós

    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

  6. Virasoro Representations on Fusion Graphs

    E-Print Network [OSTI]

    J. Kellendonk; A. Recknagel

    1992-10-01T23:59:59.000Z

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

  7. Standards for graph algorithm primitives

    E-Print Network [OSTI]

    Mattson, Tim

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

  8. Doing time : inducing temporal graphs

    E-Print Network [OSTI]

    Bramsen, Philip James

    2006-01-01T23:59:59.000Z

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

  9. Graph anomalies in cyber communications

    SciTech Connect (OSTI)

    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

    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.

  10. Executive Order 1083 Attachment C

    E-Print Network [OSTI]

    de Lijser, Peter

    Rev 2/2013 Executive Order 1083 Attachment C California Child Abuse and Neglect Reporting Act Penal, an administrator, or an employee of a licensed community care or child day care facility. (11) A Head Start program in Section 11165.11. (13) A public assistance worker. (14) An employee of a child care institution, including

  11. Executive Order 1083 Attachment C

    E-Print Network [OSTI]

    Eirinaki, Magdalini

    Executive Order 1083 Attachment C California Child Abuse and Neglect Reporting Act Penal Code, an administrator, or an employee of a licensed community care or child day care facility. (11) A Head Start program in Section 11165.11. (13) A public assistance worker. (14) An employee of a child care institution, including

  12. XIII.1-Draft ATTACHMENT XIII

    E-Print Network [OSTI]

    Kentucky, University of

    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

  13. Managing Attack Graph Complexity Through Visual Hierarchical Aggregation

    E-Print Network [OSTI]

    Noel, Steven

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

  14. Algebraic connectivity and graph robustness.

    SciTech Connect (OSTI)

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

    2009-07-01T23:59:59.000Z

    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.

  15. Graph Analytics for Signature Discovery

    SciTech Connect (OSTI)

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

    2013-06-01T23:59:59.000Z

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

  16. Optimization in Geometric Graphs: Complexity and Approximation

    E-Print Network [OSTI]

    Kahruman-Anderoglu, Sera

    2011-02-22T23:59:59.000Z

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

  17. A discrete curvature on a planar graph

    E-Print Network [OSTI]

    M. Lorente

    2004-12-20T23:59:59.000Z

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

  18. Percolation in the Secrecy Graph Amites Sarkar

    E-Print Network [OSTI]

    Sarkar, Amites

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

  19. Evan Marshall Trevathan Admissible SC-Graphs

    E-Print Network [OSTI]

    Donnelly, Rob

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

  20. NLS ground states on graphs

    E-Print Network [OSTI]

    Riccardo Adami; Enrico Serra; Paolo Tilli

    2014-06-16T23:59:59.000Z

    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.

  1. A heuristic algorithm for graph isomorphism

    E-Print Network [OSTI]

    Torres Navarro, Luz

    1999-01-01T23:59:59.000Z

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

  2. THE TUKEY ORDER FOR GRAPHS 1. Introduction

    E-Print Network [OSTI]

    Nyikos, Peter J.

    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

  3. ATTACHMENT

    Office of Environmental Management (EM)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel),Feet) Year Jan Feb Mar Apr May Jun Jul(Summary) "of EnergyEnergy Cooperation |South ValleyASGovLtr.pdf ASGovLtr.pdf ASGovLtr.pdf MoreATP3 Algae

  4. ATTACHMENT

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

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel),Feet) Year Jan Feb Mar Apr MayAtmospheric Optical Depth (AOD)Productssondeadjustsondeadjust DocumentationARMStreamsUSBudget AdvancedASSESSING AND9NOV98

  5. Generalized Graph States Based on Hadamard Matrices

    E-Print Network [OSTI]

    Shawn X Cui; Nengkun Yu; Bei Zeng

    2015-02-25T23:59:59.000Z

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

  6. Constrained Graph Optimization: Interdiction and Preservation Problems

    SciTech Connect (OSTI)

    Schild, Aaron V [Los Alamos National Laboratory

    2012-07-30T23:59:59.000Z

    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.

  7. Split ring containment attachment device

    DOE Patents [OSTI]

    Sammel, Alfred G. (Pittsburgh, PA)

    1996-01-01T23:59:59.000Z

    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.

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

    E-Print Network [OSTI]

    Boyer, Edmond

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

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

    E-Print Network [OSTI]

    Fertin, Guillaume

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

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

    E-Print Network [OSTI]

    Fertin, Guillaume

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

  11. Methane production by attached film

    DOE Patents [OSTI]

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

    1981-01-01T23:59:59.000Z

    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.

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

    E-Print Network [OSTI]

    Rostislav Grigorchuk; Paul-Henry Leemann; Tatiana Nagnibeda

    2015-02-24T23:59:59.000Z

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

  13. Nuclear reactor multiphysics via bond graph formalism

    E-Print Network [OSTI]

    Sosnovsky, Eugeny

    2014-01-01T23:59:59.000Z

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

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

  15. Hamilton Decompositions of Graphs with Primitive Complements .

    E-Print Network [OSTI]

    OZKAN, SIBEL

    2007-01-01T23:59:59.000Z

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

  16. Graph algorithms in the titan toolkit.

    SciTech Connect (OSTI)

    McLendon, William Clarence, III; Wylie, Brian Neil

    2009-10-01T23:59:59.000Z

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

  17. Generation of graph-state streams

    E-Print Network [OSTI]

    Daniel Ballester; Jaeyoon Cho; M. S. Kim

    2010-12-08T23:59:59.000Z

    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.

  18. Some algorithmic results in graph imbeddings

    E-Print Network [OSTI]

    Joshi, Sanjay

    1990-01-01T23:59:59.000Z

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

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

    E-Print Network [OSTI]

    Zaslavsky, Thomas

    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

  20. 3D Graph Visualization with the Oculus Rift Virtual Graph Reality

    E-Print Network [OSTI]

    Wismath, Stephen

    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

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

    E-Print Network [OSTI]

    Wu, David

    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

  2. On the Cohen-Macaulay graphs and girth

    E-Print Network [OSTI]

    Hoang, Do Trong; Trung, Tran Nam

    2012-01-01T23:59:59.000Z

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

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

    E-Print Network [OSTI]

    Rostock, Universität

    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

  4. Graph searching and a generalized parking function

    E-Print Network [OSTI]

    Kostic, Dimitrije Nenad

    2009-05-15T23:59:59.000Z

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

  5. Building America Expert Meeting: Cladding Attachment Over Exterior...

    Energy Savers [EERE]

    Expert Meeting: Cladding Attachment Over Exterior Insulation Building America Expert Meeting: Cladding Attachment Over Exterior Insulation Building Science Corporation (BSC) held...

  6. Directed Graphs, Decompositions, and Spatial Linkages

    E-Print Network [OSTI]

    Shai, Offer; Whiteley, Walter

    2010-01-01T23:59:59.000Z

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

  7. Appendix DATA Attachment A: WIPP Borehole Update

    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 A: WIPP Borehole Update Table of Contents DATA-A-1.0 WIPP Boreholes...

  8. Attachment 14 Sample LOO.doc

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

    be designated to assist the CORs. The MEO will perform all work in accordance with the Quality Control Plan (Attachment D). All work and deliverables will be monitored by the CORs...

  9. Information seeking in attachment style romantic relationships

    E-Print Network [OSTI]

    Derrick, Jaye Lindsay

    2013-02-22T23:59:59.000Z

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

  10. Chemomechanics of attached and suspended cells

    E-Print Network [OSTI]

    Maloney, John Mapes

    2012-01-01T23:59:59.000Z

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

  11. Reactive Attachment Disorder: Concepts, Treatment, and Research

    E-Print Network [OSTI]

    Walter, Uta M.; Petr, Chris

    2004-06-01T23:59:59.000Z

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

  12. What Energy Functions Can Be Minimized via Graph Cuts?

    E-Print Network [OSTI]

    Field, David

    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

  13. What Energy Functions can be Minimized via Graph Cuts?

    E-Print Network [OSTI]

    Field, David

    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

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

    E-Print Network [OSTI]

    Noel, Steven

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

  15. A Note on Hamilton Cycles in Kneser Graphs Ian Shields

    E-Print Network [OSTI]

    Savage, Carla D.

    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

  16. Gibbs Measures and Phase Transitions on Sparse Random Graphs

    E-Print Network [OSTI]

    Montanari, Annamaria

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

  17. Discrete Applied Mathematics 121 (2002) 139153 NeST graphs

    E-Print Network [OSTI]

    Hayward, Ryan B.

    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

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

    E-Print Network [OSTI]

    Fertin, Guillaume

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

  19. Revisiting Interval Graphs for Network Science

    E-Print Network [OSTI]

    Loe, Chuan Wen

    2015-01-01T23:59:59.000Z

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

  20. A role for matrices in graph theory

    E-Print Network [OSTI]

    McLean, John Patrick

    1971-01-01T23:59:59.000Z

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

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

    E-Print Network [OSTI]

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

    2015-01-01T23:59:59.000Z

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

  2. Continuous-time quantum walks on star graphs

    SciTech Connect (OSTI)

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

    2009-06-15T23:59:59.000Z

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

  3. Bipartite graph partitioning and data clustering

    SciTech Connect (OSTI)

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

    2001-05-07T23:59:59.000Z

    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.

  4. The Minimum Rank Problem for Outerplanar Graphs.

    E-Print Network [OSTI]

    Sinkovic, John Henry

    2013-01-01T23:59:59.000Z

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

  5. Minimum rank of graphs that allow loops.

    E-Print Network [OSTI]

    Mikkelson, Rana C.

    2008-01-01T23:59:59.000Z

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

  6. On semidefinite programming bounds for graph bandwidth

    E-Print Network [OSTI]

    2011-05-24T23:59:59.000Z

    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.

  7. Graph Implementations for Nonsmooth Convex Programs

    E-Print Network [OSTI]

    2007-09-07T23:59:59.000Z

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

  8. Forced orientation of graphs Babak Farzad

    E-Print Network [OSTI]

    Toronto, University of

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

  9. Hamilton Paths in Generalized Petersen Graphs.

    E-Print Network [OSTI]

    Pensaert, William

    2006-01-01T23:59:59.000Z

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

  10. Graph Summarization with Bounded Error Saket Navlakha

    E-Print Network [OSTI]

    Gruner, Daniel S.

    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

  11. Accelerating semantic graph databases on commodity clusters

    SciTech Connect (OSTI)

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

    2013-10-06T23:59:59.000Z

    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.

  12. 2Cosmic Bar Graphs Galaxy Type

    E-Print Network [OSTI]

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

  13. Graph representation of protein free energy landscape

    SciTech Connect (OSTI)

    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

    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.

  14. Nuclear reactor fuel rod attachment system

    DOE Patents [OSTI]

    Christiansen, David W. (Kennewick, WA)

    1982-01-01T23:59:59.000Z

    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.

  15. Attachment device for an inflatable protective cushion

    DOE Patents [OSTI]

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

    1998-12-08T23:59:59.000Z

    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.

  16. Attachment FY2011-43 OPAM

    Energy Savers [EERE]

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on Delicious RankCombustionImprovement3--Logistical Challenges toReport |2013-04 onAttachment FY2011-41 OPAM Attachment1)

  17. ADULT ATTACHMENT AND EXPLORATION: THE EFFECT OF ATTACHMENT STYLE ON THE EXPERIENCE OF EXPLORATION

    E-Print Network [OSTI]

    Martin, Archibald M.

    2010-07-14T23:59:59.000Z

    According to attachment theory a key moderator in the enjoyment of exploration is the strength of a person's secure base. To study exploration we placed participants in a situation in which they confronted a novel stimulus. We also gathered self...

  18. Combinatorial discovery of polymers resistant to bacterial attachment

    E-Print Network [OSTI]

    Hook, Andrew L

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

  19. Cable attachment for a radioactive brachytherapy source capsule

    DOE Patents [OSTI]

    Gross, Ian G; Pierce, Larry A

    2006-07-18T23:59:59.000Z

    In cancer brachytherapy treatment, a small californium-252 neutron source capsule is attached to a guide cable using a modified crimping technique. The guide cable has a solid cylindrical end, and the attachment employs circumferential grooves micromachined in the solid cable end. The attachment was designed and tested, and hardware fabricated for use inside a radioactive hot cell. A welding step typically required in other cable attachments is avoided.

  20. MadGraph 5 : Going Beyond

    E-Print Network [OSTI]

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

    2011-06-02T23:59:59.000Z

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

  1. Streaming Graph Computations with a Helpful Advisor

    E-Print Network [OSTI]

    Cormode, Graham; Thaler, Justin

    2010-01-01T23:59:59.000Z

    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.

  2. Circuit and bond polytopes on series-parallel graphs$

    E-Print Network [OSTI]

    2014-07-10T23:59:59.000Z

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

  3. An efficient semidefinite programming relaxation for the graph ...

    E-Print Network [OSTI]

    2012-08-28T23:59:59.000Z

    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.

  4. Generating Random Graphs with Large Girth Mohsen Bayati

    E-Print Network [OSTI]

    Saberi, Amin

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

  5. GARNET : a Graphical Attack graph and Reachability Network Evaluation Tool

    E-Print Network [OSTI]

    Williams, Leevar (Leevar Christoff)

    2008-01-01T23:59:59.000Z

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

  6. Codes on Graphs: Duality and MacWilliams Identities

    E-Print Network [OSTI]

    Forney, G. David, Jr.

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

  7. Scalable Parallel Algorithms for Massive Scale-free Graphs

    E-Print Network [OSTI]

    Pearce, Roger Allan

    2013-12-05T23:59:59.000Z

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

  8. Math 564 Graph Theory Fall 2008 Instructor Amites Sarkar

    E-Print Network [OSTI]

    Sarkar, Amites

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

  9. Math 564 Graph Theory Fall 2013 Instructor Amites Sarkar

    E-Print Network [OSTI]

    Sarkar, Amites

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

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

    E-Print Network [OSTI]

    2012-01-31T23:59:59.000Z

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

  11. Problems of Distance-Regular Graphs Hiroshi Suzuki

    E-Print Network [OSTI]

    Xi, Changchang

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

  12. Bose-Einstein condensation on quantum graphs

    E-Print Network [OSTI]

    Jens Bolte; Joachim Kerner

    2014-03-02T23:59:59.000Z

    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.

  13. Hiroshi Ishikawa A Practical Introduction to Graph Cut

    E-Print Network [OSTI]

    Ishikawa, Hiroshi

    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

  14. Hamiltonian Cycles on Symmetrical Graphs Carlo H. Squin

    E-Print Network [OSTI]

    O'Brien, James F.

    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

  15. Optimal IDS Sensor Placement And Alert Prioritization Using Attack Graphs

    E-Print Network [OSTI]

    Noel, Steven

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

  16. Improving Attack Graph Visualization through Data Reduction and Attack Grouping

    E-Print Network [OSTI]

    Ou, Xinming "Simon"

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

  17. Compatible Hamilton cycles in Dirac graphs Michael Krivelevich

    E-Print Network [OSTI]

    Krivelevich, Michael

    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

  18. Infinite Hamilton Cycles in Squares of Locally Finite Graphs

    E-Print Network [OSTI]

    Diestel, Reinhard

    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

  19. Robust Self-assembly of Graphs Stanislav Angelov1

    E-Print Network [OSTI]

    Pennsylvania, University of

    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

  20. Simultaneous Segmentation and Filtering via Reduced Graph Cuts

    E-Print Network [OSTI]

    Malgouyres, François

    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

  1. Cellular Algebras and Graph Invariants Based on Quantum Walks

    E-Print Network [OSTI]

    Jamie Smith

    2011-03-01T23:59:59.000Z

    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.

  2. Inference of Edge Replacement Graph Grammars Jacek P. Kukluk1

    E-Print Network [OSTI]

    Holder, Lawrence B.

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

  3. Bicycles and Left-Right Tours in Locally Finite Graphs

    E-Print Network [OSTI]

    Diestel, Reinhard

    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

  4. Attachment and memory for negative emotional events

    E-Print Network [OSTI]

    Wilson, Carol Leigh

    2012-06-07T23:59:59.000Z

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

  5. Interpersonal violence, drug use, and adult attachment

    E-Print Network [OSTI]

    Murphy, Amy Anne

    2013-02-22T23:59:59.000Z

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

  6. Composite Underbody Attachment | Department of Energy

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

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on Delicious Rank EERE:YearRound-Up fromDepartmentTieCelebrate Earth Codestheatfor Optimized SCRUnderbody Attachment

  7. Cladding Attachment Over Thick Exterior Insulating Sheathing

    SciTech Connect (OSTI)

    Baker, P.; Eng, P.; Lepage, R.

    2014-01-01T23:59:59.000Z

    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. For thick layers of exterior insulation (levels greater than 1.5 inches), the use of wood furring strips attached through the insulation back to the structure has been used by many contractors and designers as a means to provide a convenient cladding attachment location (Straube and Smegal 2009, Pettit 2009, Joyce 2009, Ueno 2010). The research presented in this report is intended to help develop a better understanding of the system mechanics involved and the potential for environmental exposure induced movement between the furring strip and the framing. BSC sought to address the following research questions: 1. What are the relative roles of the mechanisms and the magnitudes of the force that influence the vertical displacement resistance of the system? 2. Can the capacity at a specified deflection be reliably calculated using mechanics based equations? 3. What are the impacts of environmental exposure on the vertical displacement of furring strips attached directly through insulation back to a wood structure?

  8. Dominating Set on Bipartite Graphs Mathieu Liedloff

    E-Print Network [OSTI]

    Liedloff, Mathieu

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

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

  10. Graph-Theoretic Scagnostics Leland Wilkinson

    E-Print Network [OSTI]

    Grossman, Robert

    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

  11. Graph Grammars for Self Assembling Robotic Systems

    E-Print Network [OSTI]

    Ghrist, Robert W.

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

  12. NEST REPRESENTATIONS OF DIRECTED GRAPH ALGEBRAS

    E-Print Network [OSTI]

    Katsoulis, Elias G.

    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

  13. The Web Graph of a Tourism System

    E-Print Network [OSTI]

    Baggio, R

    2006-01-01T23:59:59.000Z

    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.

  14. Flexible Layered Authentication Graph for Multimedia Streaming

    E-Print Network [OSTI]

    Sun, Qibin

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

  15. Lessons 6 Graphs of Functional Models

    E-Print Network [OSTI]

    2013-08-30T23:59:59.000Z

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

  16. Line graphs e contrazioni: un approccio rigoroso alla space syntax

    E-Print Network [OSTI]

    D'Autilia, Roberto

    2015-01-01T23:59:59.000Z

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

  17. Microsoft Word - ATTACHMENT A Suppl 5.doc

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

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on Delicious RankCombustion | Department ofT ib l L d F S i DOE Tribal Leader HOWARD8-04 (02/21/08)ATTACHMENT A: Modeling

  18. Attachment FY2011-55 OPAM

    Energy Savers [EERE]

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on Delicious RankCombustionImprovement3--Logistical Challenges toReport |2013-04 onAttachment FY2011-411, Summary of Small

  19. Data-flow graphs as a model of parallel complexity

    SciTech Connect (OSTI)

    Campbell, M.L.

    1987-01-01T23:59:59.000Z

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

  20. Predicting Envelope Leakage in Attached Dwellings

    SciTech Connect (OSTI)

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

    2013-07-01T23:59:59.000Z

    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.

  1. Statistical Properties of Quantum Graph Spectra

    E-Print Network [OSTI]

    Yu. Dabaghian

    2006-08-09T23:59:59.000Z

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

  2. Analysis of beacon triangulation in random graphs

    E-Print Network [OSTI]

    Kakarlapudi, Geetha

    2005-02-17T23:59:59.000Z

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

  3. Attachment H: Delegation of Authority Memorandum | Department of Energy

    Energy Savers [EERE]

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on Delicious RankCombustionImprovement3--Logistical Challenges toReport |2013-04 onAttachmentAttachmentAttachment

  4. adult attachment style: Topics by E-print Network

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

    Adult Attachment Scale, the Parental Bonding Instrument, the Childhood Experience of Care and Abuse Questionnaire, and the Negativism Dominance Scale. We found that paternal...

  5. Building America Expert Meeting Report: Cladding Attachment Over...

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

    Webinar: High Performance Enclosure Strategies: Part II, New Construction - August 13, 2014 - Cladding Attachment Over Thick Exterior Rigid Insulation Building America Technology...

  6. attachment cronostratigraphy aplied: Topics by E-print Network

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

    Required when Human Subjects is included in Special Review tab; includes Data Weber, David J. 5 Attachment cc: CiteSeer Summary: The referenced letter submitted...

  7. A linear accelerator couch attachment for extended SSD treatments

    SciTech Connect (OSTI)

    Biggs, P.J.; Leong, J.C.

    1983-04-01T23:59:59.000Z

    An attachment to an existing linear accelerator couch is described that extends the range of SSD's at which patients can be treated. This couch attachment, which is mounted on castors for ease of mobility, is attached to and locks into the rail of the accelerator couch such that the axis of the new device is normal to the existing couch. All motions of this assembly are then under the ocntrol of the existing couch. The overall size of the couch attachment is 215 cm x 90 cm, sufficiently large to treat all cleinically used fields.

  8. Certification and Rating of Attachments for Fenestration Technologies...

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

    rate fenestration attachment energy performance and provide accurate and useful product comparison criteria, allowing end users in residential and commercial markets to assess...

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

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

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

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

    E-Print Network [OSTI]

    Perez, Jessica

    2015-01-01T23:59:59.000Z

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

  13. attachable automated injector: Topics by E-print Network

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

    "green". The California Energy Commission establishesAttachment XIII January 2009 City of Hayward Green Building Checklist for Private NonResidential Development For All...

  14. k-Boson Quantum Walks Do Not Distinguish Arbitrary Graphs

    E-Print Network [OSTI]

    Jamie Smith

    2010-04-01T23:59:59.000Z

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

  15. Dynamics of entanglement of bosonic modes on symmetric graphs

    E-Print Network [OSTI]

    F. Ghahhari; V. Karimipour; R. Shahrokhshahi

    2006-11-23T23:59:59.000Z

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

  16. Vacuum die attach for integrated circuits

    DOE Patents [OSTI]

    Schmitt, Edward H. (Livermore, CA); Tuckerman, David B. (Livermore, CA)

    1991-01-01T23:59:59.000Z

    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.

  17. Vacuum die attach for integrated circuits

    DOE Patents [OSTI]

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

    1991-09-10T23:59:59.000Z

    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.

  18. Independent set problems and odd-hole-preserving graph reductions

    E-Print Network [OSTI]

    Warren, Jeffrey Scott

    2009-05-15T23:59:59.000Z

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

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

    E-Print Network [OSTI]

    2006-04-27T23:59:59.000Z

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

  20. Generating Random Graphs with Large Girth Mohsen Bayati

    E-Print Network [OSTI]

    Montanari, Annamaria

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

  1. A notable family of entire intrinsic minimal graph...

    E-Print Network [OSTI]

    2006-09-09T23:59:59.000Z

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

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

    Kepner, Jeremy

    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

  3. Visualization Graph | OpenEI Community

    Open Energy Info (EERE)

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

  4. A positivity-preserving scheme for the simulation of streamer discharges in non-attaching and attaching gases

    E-Print Network [OSTI]

    Zhuang, Chijie

    2013-01-01T23:59:59.000Z

    Assumed having axial symmetry, the streamer discharge is often described by a fluid model in cylindrical coordinate system, which consists of convection dominated (diffusion) equations with source terms, coupled with a Poisson's equation. Without additional care for a stricter CFL condition or special treatment to the negative source term, popular methods used in streamer discharge simulations, e.g., FEM-FCT, FVM, cannot ensure the positivity of the particle densities for the cases in attaching gases. By introducing the positivity-preserving limiter proposed by Zhang and Shu \\cite{ppl} and Strang operator splitting, this paper proposed a finite difference scheme with a provable positivity-preserving property in cylindrical coordinate system, for the numerical simulation of streamer discharges in non-attaching and attaching gases. Numerical examples in non-attaching gas (N$_2$) and attaching gas (SF$_6$) are given to illustrate the effectiveness of the scheme.

  5. Algorithms to Compute Minimum Cycle Basis in Directed Graphs #

    E-Print Network [OSTI]

    Mehlhorn, Kurt

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

  6. Deciding Timed Bisimulation for Timed Automata Using Zone Valuation Graph

    E-Print Network [OSTI]

    Prasad, Sanjiva

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

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

  8. Semidefinite programming and eigenvalue bounds for the graph ...

    E-Print Network [OSTI]

    2013-11-26T23:59:59.000Z

    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.

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

  10. MATLAB Tutorial Getting Started with Calculations, Graphing and Programming

    E-Print Network [OSTI]

    Weinberger, Hans

    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

  11. Understanding Complex Network Attack Graphs through Clustered Adjacency Matrices

    E-Print Network [OSTI]

    Noel, Steven

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

  12. Improving Attack Graph Visualization through Data Reduction and Attack Grouping

    SciTech Connect (OSTI)

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

    2008-09-01T23:59:59.000Z

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

  13. Scaling Semantic Graph Databases in Size and Performance

    SciTech Connect (OSTI)

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

    2014-08-06T23:59:59.000Z

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

  14. A Surface Reconstruction Method Using Global Graph Cut Optimization

    E-Print Network [OSTI]

    Paris, Sylvain

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

  15. A Surface Reconstruction Method Using Global Graph Cut Optimization

    E-Print Network [OSTI]

    Paris, Sylvain

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

  16. A Surface Reconstruction Method Using Global Graph Cut Optimization

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

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

  17. Resource Minimized Static Mapping and Dynamic Scheduling of SDF Graphs

    E-Print Network [OSTI]

    Ha, Soonhoi

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

  18. Synthesis of Parallel Hardware Implementations from Synchronous Dataflow Graph Specifications

    E-Print Network [OSTI]

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

  19. Including Blind Students in Computer Science Through Access to Graphs

    E-Print Network [OSTI]

    Young, R. Michael

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

  20. Video Denoising and Simplification Via Discrete Regularization on Graphs

    E-Print Network [OSTI]

    Paris-Sud XI, Universitť de

    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

  1. VIDEO SUMMARIZATION BY VIDEO STRUCTURE ANALYSIS AND GRAPH OPTIMIZATION

    E-Print Network [OSTI]

    King, Kuo Chin Irwin

    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

  2. Groups generated by bounded automata and their schreier graphs

    E-Print Network [OSTI]

    Bondarenko, Ievgen

    2009-05-15T23:59:59.000Z

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

  3. Bicyclic graphs with exactly two main signless Laplacian eigenvalues

    E-Print Network [OSTI]

    Huang, He

    2012-01-01T23:59:59.000Z

    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.

  4. Motorcycle Graphs and Straight Skeletons Siu-Wing Cheng

    E-Print Network [OSTI]

    Vigneron, Antoine

    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

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

    E-Print Network [OSTI]

    2013-08-08T23:59:59.000Z

    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.

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

  7. E-Print Network 3.0 - attachment cell lines Sample Search Results

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

    (from line 2 above) Return completed form and attachments to your supervisor... -provided cell phonePDA service I have been provided. (Attach payment hereto. Checks should be...

  8. Attachment FY2011-9 | Department of Energy

    Energy Savers [EERE]

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on Delicious RankCombustionImprovement3--Logistical Challenges toReport |2013-04 onAttachmentAttachmentAttachment FY2011-9

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

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

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on Delicious Rank EERE:Year in3.pdfEnergyDepartment ofOil's ImpactAppendix Al Statement of Work forGNT Attachment U

  10. Bifurcations and stability of standing waves in the nonlinear SchrŲdinger equation on the tadpole graph

    E-Print Network [OSTI]

    Diego Noja; Dmitry Pelinovsky; Gaukhar Shaikhova

    2014-12-28T23:59:59.000Z

    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.

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

  12. From: Sent: Subject: Attachments: SNR-Rates, SNR

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

    SNR - Rates From: Sent: Subject: Attachments: SNR-Rates, SNR Friday, August 22, 2014 3:03 PM 2015 Initial Power Restoration Fund Obligation FY 2015 Initial Restoration Fund Letter...

  13. Bicycle-powered attachments : designing for developing countries

    E-Print Network [OSTI]

    Wu, Jodie (Jodie Z.)

    2009-01-01T23:59:59.000Z

    There are 550 million smallholder farmers around the world who earn less than $1/day who could benefit from pedal-powered attachments. This project discusses factors to consider in designing for developing countries and ...

  14. Pressurizer with a mechanically attached surge nozzle thermal sleeve

    DOE Patents [OSTI]

    Wepfer, Robert M

    2014-03-25T23:59:59.000Z

    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.

  15. Attachment of radon progeny to cigarette-smoke aerosols

    SciTech Connect (OSTI)

    Biermann, A.H.; Sawyer, S.R.

    1995-05-01T23:59:59.000Z

    The daughter products of radon gas are now recognized as a significant contributor to radiation exposure to the general public. It is also suspected that a synergistic effect exists with the combination cigarette smoking and radon exposure. We have conducted an experimental investigation to determine the physical nature of radon progeny interactions with cigarette smoke aerosols. The size distributions of the aerosols are characterized and attachment rates of radon progeny to cigarette-smoke aerosols are determined. Both the mainstream and sidestream portions of the smoke aerosol are investigated. Unattached radon progeny are very mobile and, in the presence of aerosols, readily attach to the particle surfaces. In this study, an aerosol chamber is used to contain the radon gas, progeny and aerosol mixture while allowing the attachment process to occur. The rate of attachment is dependent on the size distribution, or diffusion coefficient, of the radon progeny as well as the aerosol size distribution. The size distribution of the radon daughter products is monitored using a graded-screen diffusion battery. The diffusion battery also enables separation of the unattached radon progeny from those attached to the aerosol particles. Analysis of the radon decay products is accomplished using alpha spectrometry. The aerosols of interest are size fractionated with the aid of a differential mobility analyzer and cascade impactor. The measured attachment rates of progeny to the cigarette smoke are compared to those found in similar experiments using an ambient aerosol. The lowest attachment coefficients observed, {approximately}10{sup {minus}6} cm{sup 3}/s, occurred for the ambient aerosol. The sidestream and mainstream smoke aerosols exhibited higher attachment rates in that order. The results compared favorably with theories describing the coagulation process of aerosols.

  16. Relationship of attachment to abuse in incarcerated women

    E-Print Network [OSTI]

    Davis, Brandon Lee

    2004-11-15T23:59:59.000Z

    RELATIONSHIP OF ATTACHMENT TO ABUSE IN INCARCERATED WOMEN A Dissertation by BRANDON LEE DAVIS Submitted to the Office of Graduate Studies of Texas A&M University in partial fulfillment of the requirements for the degree of DOCTOR... OF PHILOSOPHY August 2004 Major Subject: Counseling Psychology RELATIONSHIP OF ATTACHMENT TO ABUSE IN INCARCERATED WOMEN A Dissertation by BRANDON LEE DAVIS Submitted to Texas A&M University in partial fulfillment of the requirements...

  17. Attachment FY2011-40(2) | Department of Energy

    Energy Savers [EERE]

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on Delicious RankCombustionImprovement3--Logistical Challenges toReport |2013-04 on ExecutiveAttachmentAttachment

  18. Attachment FY2011-77 OPAM | Department of Energy

    Energy Savers [EERE]

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on Delicious RankCombustionImprovement3--Logistical Challenges toReport |2013-04 onAttachmentAttachment

  19. Performance estimates for attached-sunspace passive solar heated buildings

    SciTech Connect (OSTI)

    McFarland, R.D.; Jones, R.W.

    1980-01-01T23:59:59.000Z

    Performance predictions have been made for attached-sunspace types of passively solar heated buildings. The predictions are based on hour-by-hour computer simulations using computer models developed in the framework of PASOLE, the Los Alamos Scientific Laboratory (LASL) passive solar energy simulation program. The models have been validated by detailed comparison with actual hourly temperature measurements taken in attached-sunspace test rooms at LASL.

  20. Well performance graph simplifies field calculations

    SciTech Connect (OSTI)

    De Ghetto, G.

    1987-05-01T23:59:59.000Z

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

  1. Community detection in directed acyclic graphs

    E-Print Network [OSTI]

    Speidel, Leo; Masuda, Naoki

    2015-01-01T23:59:59.000Z

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

  2. Efficient broadcast on random geometric graphs

    SciTech Connect (OSTI)

    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

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

  3. Bicyclic graphs with maximal revised Szeged index

    E-Print Network [OSTI]

    Li, Xueliang

    2011-01-01T23:59:59.000Z

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

  4. THE MATCHING ENERGY OF A GRAPH IVAN GUTMAN AND STEPHAN WAGNER

    E-Print Network [OSTI]

    Wagner, Stephan

    (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

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

    E-Print Network [OSTI]

    Gross, Jonathan L.

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

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

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    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

  7. Geodesic Distance in Planar Graphs: An Integrable Approach

    E-Print Network [OSTI]

    P. Di Francesco

    2005-06-27T23:59:59.000Z

    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.

  8. The Graph Laplacian and the Dynamics of Complex Networks

    SciTech Connect (OSTI)

    Thulasidasan, Sunil [Los Alamos National Laboratory

    2012-06-11T23:59:59.000Z

    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.

  9. Methods and materials for nanocrystalline surface coatings and attachment of peptide amphiphile nanofibers thereon

    DOE Patents [OSTI]

    Stupp, Samuel I. (Chicago, IL); Spoerke, Erik D. (Albuquerque, NM); Anthony, Shawn G. (New Stanton, PA); Niece; Krista L. (Evanston, IL)

    2008-06-24T23:59:59.000Z

    Biocompatible composites comprising peptide amphiphiles and surface modified substrates and related methods for attachment thereon.

  10. Diamond graphs and super-reflexivity William B. Johnson

    E-Print Network [OSTI]

    Johnson, William B.

    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

  11. Kron Reduction of Graphs with Applications to Electrical Networks

    E-Print Network [OSTI]

    Dorfler, Florian

    2011-01-01T23:59:59.000Z

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

  12. Drawing a Graph in a Hypercube David R. Wood

    E-Print Network [OSTI]

    Wood, David R.

    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

  13. Drawing a Graph in a Hypercube David R. Wood

    E-Print Network [OSTI]

    Wood, David R.

    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

  14. Exact Solution of Graph Coloring Problems via Constraint ...

    E-Print Network [OSTI]

    2011-09-21T23:59:59.000Z

    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.

  15. New Lower Bounds on the Stability Number of a Graph

    E-Print Network [OSTI]

    2007-06-27T23:59:59.000Z

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

  16. The Asymmetric Traveling Salesman Problem on Graphs with Bounded Genus

    E-Print Network [OSTI]

    Saberi, Amin

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

  17. Random Walks with Lookahead in Power Law Random Graphs

    E-Print Network [OSTI]

    Mihail, Milena

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

  18. Confluence in Data Reduction: Bridging Graph Transformation and Kernelization

    E-Print Network [OSTI]

    Wichmann, Felix

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

  19. Advanced Vulnerability Analysis and Intrusion Detection Through Predictive Attack Graphs

    E-Print Network [OSTI]

    Noel, Steven

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

  20. Modeling modern network attacks and countermeasures using attack graphs

    E-Print Network [OSTI]

    Ingols, Kyle W.

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

  1. Fracture and Fragmentation of Simplicial Finite Elements Meshes using Graphs

    SciTech Connect (OSTI)

    Mota, A; Knap, J; Ortiz, M

    2006-10-18T23:59:59.000Z

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

  2. Local computation algorithms for graphs of non-constant degrees

    E-Print Network [OSTI]

    Yodpinyanee, Anak

    2014-01-01T23:59:59.000Z

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

  3. Parallel Algorithms for Graph Optimization using Tree Decompositions

    SciTech Connect (OSTI)

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

    2012-06-01T23:59:59.000Z

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

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

    E-Print Network [OSTI]

    Marcel K. de Carli Silva and Levent Tuncel

    2011-08-06T23:59:59.000Z

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

  5. Technology Portfolio Planning by Weighted Graph Analysis of System Architectures

    E-Print Network [OSTI]

    de Weck, Olivier L.

    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

  6. Ranking Outlier Nodes in Subspaces of Attributed Graphs

    E-Print Network [OSTI]

    Antwerpen, Universiteit

    . 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

  7. How are Feynman graphs resumed by the Loop Vertex Expansion?

    E-Print Network [OSTI]

    Vincent Rivasseau; Zhituo Wang

    2010-06-23T23:59:59.000Z

    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.

  8. Decoding linear codes via optimization and graph-based techniques

    E-Print Network [OSTI]

    Taghavi, Mohammad H.

    2008-01-01T23:59:59.000Z

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

  9. MacWilliams identities for codes on graphs

    E-Print Network [OSTI]

    Forney, G. David, Jr.

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

  10. The Branching of Graphs in 2-d Quantum Gravity

    E-Print Network [OSTI]

    M. G. Harris

    1996-07-16T23:59:59.000Z

    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.

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

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    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

  12. Multicoloured Random Graphs: The Random Dynamics Program

    E-Print Network [OSTI]

    Sam Tarzi

    2014-07-15T23:59:59.000Z

    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.

  13. Apparatus for attaching a cleaning tool to a robotic manipulator

    DOE Patents [OSTI]

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

    1992-09-22T23:59:59.000Z

    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.

  14. Apparatus for attaching a cleaning tool to a robotic manipulator

    DOE Patents [OSTI]

    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

    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.

  15. Interface structure for hub and mass attachment in flywheel rotors

    DOE Patents [OSTI]

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

    1998-06-02T23:59:59.000Z

    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.

  16. Interface structure for hub and mass attachment in flywheel rotors

    DOE Patents [OSTI]

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

    1998-06-02T23:59:59.000Z

    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.

  17. Apparatus for attaching a cleaning tool to a robotic manipulator

    DOE Patents [OSTI]

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

    1991-01-01T23:59:59.000Z

    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.

  18. Reliability Testing the Die-Attach of CPV Cell Assemblies

    SciTech Connect (OSTI)

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

    2011-02-01T23:59:59.000Z

    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.

  19. Biocompatible implants and methods of making and attaching the same

    DOE Patents [OSTI]

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

    2014-10-07T23:59:59.000Z

    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.

  20. Flash2009-47Attachment.pdf | Department of Energy

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

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on Delicious Rank EERE:YearRound-UpHeat PumpRecordFederal Registry46.pdf.pdf47Attachment.pdf Flash2009-47Attachment.pdf

  1. Flash2009-58Attachment.pdf | Department of Energy

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

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on Delicious Rank EERE:YearRound-UpHeat PumpRecordFederal Registry46.pdf.pdf47Attachment.pdf8Attachment.pdf

  2. Flash2006-03ATTACHMENT.pdf | Department of Energy

    Office of Environmental Management (EM)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel),Feet) Year Jan Feb Mar Apr May Jun Jul(Summary) "of Energy Power SystemsResourcesFLASH2011-11-OPAMFY2.pdf4.pdf3.pdfATTACHMENT.pdf Flash2006-03ATTACHMENT.pdf

  3. Flash2006-12ATTACHMENT.pdf | Department of Energy

    Office of Environmental Management (EM)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel),Feet) Year Jan Feb Mar Apr May Jun Jul(Summary) "of Energy Power SystemsResourcesFLASH2011-11-OPAMFY2.pdf4.pdf3.pdfATTACHMENT.pdf5.pdf11.pdfATTACHMENT.pdf

  4. Flash2006-47Attachment.pdf | Department of Energy

    Office of Environmental Management (EM)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel),Feet) Year Jan Feb Mar Apr May Jun Jul(Summary) "of Energy Power.pdf Flash2006-14.pdf Flash2006-14.pdf MoreAttachment2.doc�3.pdf6.pdfAttachment.pdf

  5. Flash2008-39attachment.pdf | Department of Energy

    Office of Environmental Management (EM)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel),Feet) Year Jan Feb Mar Apr May Jun Jul(Summary) "of Energy Power.pdf Flash2006-14.pdfattachment.pdf Flash2008-39attachment.pdf Flash2008-39attachment.pdf

  6. Attachment FY2011-38 | Department of Energy

    Energy Savers [EERE]

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on Delicious RankCombustionImprovement3--Logistical Challenges toReport |2013-04 on ExecutiveAttachment FY2011-3Attachment

  7. Attachment FY2011-41 OPAM | Department of Energy

    Energy Savers [EERE]

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on Delicious RankCombustionImprovement3--Logistical Challenges toReport |2013-04 onAttachment FY2011-41 OPAM Attachment

  8. Attachment FY2011-51 OPAM | Department of Energy

    Energy Savers [EERE]

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on Delicious RankCombustionImprovement3--Logistical Challenges toReport |2013-04 onAttachment FY2011-41 OPAM2)5)Attachment

  9. Attachment FY2011-66 OPAM | Department of Energy

    Energy Savers [EERE]

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on Delicious RankCombustionImprovement3--Logistical Challenges toReport |2013-04 onAttachment FY2011-411,Attachment

  10. Attachment FY2011-74 OPAM | Department of Energy

    Energy Savers [EERE]

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on Delicious RankCombustionImprovement3--Logistical Challenges toReport |2013-04 onAttachmentAttachment FY2011-74 OPAM

  11. Attachment FY2011-75 OPAM | Department of Energy

    Energy Savers [EERE]

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on Delicious RankCombustionImprovement3--Logistical Challenges toReport |2013-04 onAttachmentAttachment FY2011-74

  12. Attachment FY2011-75 | Department of Energy

    Energy Savers [EERE]

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on Delicious RankCombustionImprovement3--Logistical Challenges toReport |2013-04 onAttachmentAttachment FY2011-74

  13. Attachment_Flash2010-71.pdf | Department of Energy

    Energy Savers [EERE]

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on Delicious RankCombustionImprovement3--Logistical ChallengesAttachmentFlash_2011-81(2).pdfAttachment_Flash2010-71.pdf

  14. Pauli graph and finite projective lines/geometries

    E-Print Network [OSTI]

    Michel R. P. Planat; Metod Saniga

    2007-03-16T23:59:59.000Z

    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.

  15. Kron Reduction of Graphs with Applications to Electrical Networks

    E-Print Network [OSTI]

    Florian Dorfler; Francesco Bullo

    2011-02-15T23:59:59.000Z

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

  16. A graph-based system for network-vulnerability analysis

    SciTech Connect (OSTI)

    Swiler, L.P.; Phillips, C.

    1998-06-01T23:59:59.000Z

    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.

  17. Quantum ergodicity for graphs related to interval maps

    E-Print Network [OSTI]

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

    2006-07-07T23:59:59.000Z

    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.

  18. Bond graph models of electromechanical systems. The AC generator case

    E-Print Network [OSTI]

    Batlle, Carles

    . 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

  19. Sensitization of fullerenes by covalent attachment of a diketopyrrolopyrrole chromophore

    E-Print Network [OSTI]

    Candea, George

    donating unit.14,15 There are a few examples of dye molecules used as sensitizers in BHJ solar cells (theSensitization of fullerenes by covalent attachment of a diketopyrrolopyrrole chromophore Natalie for organic solar cell applications, we have synthesized triads of 3,6-dithien-2-yl-2,5-dialkylpyrrolo[3,4-c

  20. Letter-of-Offer Attachment Work Authorization Documentation --I-9

    E-Print Network [OSTI]

    Sheridan, Jennifer

    Letter-of-Offer Attachment Work Authorization Documentation -- I-9 This offer of employment is contingent upon verification of the appropriate identity and employment eligibility documentation on the Form and the list of acceptable documents, please see the Forms section of the U.S. Citizenship and Immigration

  1. Mining Large Heterogeneous Graphs using Cray s Urika

    SciTech Connect (OSTI)

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

    2013-01-01T23:59:59.000Z

    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.

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

    E-Print Network [OSTI]

    Recanati, Catherine

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

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

    E-Print Network [OSTI]

    Mousavi, Mohammad

    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

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

    E-Print Network [OSTI]

    Mousavi, Mohammad

    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

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

    E-Print Network [OSTI]

    Zhao, Jun; Gligor, Virgil

    2015-01-01T23:59:59.000Z

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

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

    E-Print Network [OSTI]

    Sarkar, Amites

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

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

    E-Print Network [OSTI]

    J. M. Harrison; K. Kirsten

    2010-03-16T23:59:59.000Z

    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.

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

    E-Print Network [OSTI]

    Banaji,. Murad

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

  9. Bounds for mixing time of quantum walks on finite graphs

    E-Print Network [OSTI]

    Vladislav Kargin

    2010-07-21T23:59:59.000Z

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

  10. Bifurcations of mutually coupled equations in random graphs

    E-Print Network [OSTI]

    Eduardo Garibaldi; Tiago Pereira

    2014-09-19T23:59:59.000Z

    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.

  11. Groups generated by bounded automata and their schreier graphs

    E-Print Network [OSTI]

    Bondarenko, Ievgen

    2008-10-10T23:59:59.000Z

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

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

    E-Print Network [OSTI]

    Hook, Andrew L.

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

  13. E-Print Network 3.0 - attachment iii sample Sample Search Results

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

    Search Sample search results for: attachment iii sample Page: << < 1 2 3 4 5 > >> 1 NIH Electronic Applications: Annotated SF 424 (R&R) Form Set Summary: Attach Biographical...

  14. E-Print Network 3.0 - attachment ii sample Sample Search Results

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

    Search Sample search results for: attachment ii sample Page: << < 1 2 3 4 5 > >> 1 NIH Electronic Applications: Annotated SF 424 (R&R) Form Set Summary: Attach Biographical...

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

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

    E-Print Network [OSTI]

    Loebl, Martin

    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

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

    E-Print Network [OSTI]

    Kim, Yong Jung

    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

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

    E-Print Network [OSTI]

    Srinivasan, Aravind

    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

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

    E-Print Network [OSTI]

    Noel, Steven

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

  20. CLAW-FREE 3-CONNECTED P11-FREE GRAPHS ARE HAMILTONIAN

    E-Print Network [OSTI]

    Pfender, Florian

    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

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

    E-Print Network [OSTI]

    Alvarez, Nadir

    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

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

    E-Print Network [OSTI]

    Yu, Alex

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

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

    E-Print Network [OSTI]

    van Vuuren, Jan H.

    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

  4. Accelerated Testing and On-Sun Failure of CPV Die-Attach (Presentation)

    SciTech Connect (OSTI)

    Bosco, N.; Kurtz, S.; Stokes, A.

    2010-10-01T23:59:59.000Z

    Accelerated Testing and On-Sun Failure of CPV Die-attach. Presentation on CPV accelerated reliability testing.

  5. Relative Lifetime Prediction for CPV Die-Attach Layers: Preprint

    SciTech Connect (OSTI)

    Silverman, T. J.; Bosco, N.; Kurtz, S.

    2012-03-01T23:59:59.000Z

    In concentrating photovoltaics (CPV) cell assemblies, a large-area die-attach layer is subjected to thermal cycles, leading to thermomechanical fatigue. This causes cracking and the eventual failure of the CPV cell by thermal runaway. We define a damage metric representing lumped progress toward failure and present a numerical model for computing the accumulation of damage for arbitrary transient temperature conditions. The model is applied to a particular design with a solder die-attach layer. We show that accelerated-test thermal cycles with higher ramp rates cause more damage, both per cycle and per unit time. Outdoor exposure to one entire year in two geographic locations is also simulated, revealing that a year of exposure in Golden, Colorado is equivalent to 1.4 years of exposure in Oak Ridge, Tennessee.

  6. MATLAB Tutorial Getting Started with Calculations, Graphing and Programming

    E-Print Network [OSTI]

    Weinberger, Hans

    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

  7. Analyzing Gene Relationships for Down Syndrome with Labeled Transition Graphs

    E-Print Network [OSTI]

    Brigham Young University

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

  8. Structured Region Graphs: Morphing EP into GBP Max Welling

    E-Print Network [OSTI]

    Welling, Max

    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

  9. Structured Region Graphs: Morphing EP into GBP Max Welling

    E-Print Network [OSTI]

    Welling, Max

    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

  10. Kron Reduction of Graphs with Applications to Electrical Networks

    E-Print Network [OSTI]

    Bullo, Francesco

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

  11. Brain Mapping Using Topology Graphs Obtained by Surface Segmentation

    E-Print Network [OSTI]

    Linsen, Lars

    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

  12. Spectral Decision Diagrams Using Graph Transformations Mitchell Thornton Rolf Drechsler

    E-Print Network [OSTI]

    Thornton, Mitchell

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

  13. Mining Large Graphs And Streams Using Matrix And Tensor Tools

    E-Print Network [OSTI]

    Kolda, Tamara G.

    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

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

  15. An Interchange File Format for Graphs Michael Himsolt

    E-Print Network [OSTI]

    Pentus, Mati

    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

  16. Hamilton cycles in graphs and hypergraphs: an extremal perspective

    E-Print Network [OSTI]

    Osthus, Deryk

    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

  17. HAMILTON CYCLES IN GRAPHS AND HYPERGRAPHS: AN EXTREMAL PERSPECTIVE

    E-Print Network [OSTI]

    Osthus, Deryk

    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

  18. HAMILTON CYCLES IN GRAPHS AND HYPERGRAPHS: AN EXTREMAL PERSPECTIVE

    E-Print Network [OSTI]

    Osthus, Deryk

    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

  19. Compatible Hamilton cycles in random graphs Michael Krivelevich

    E-Print Network [OSTI]

    Sudakov, Benjamin

    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

  20. SEISMIC WAVES ESTIMATION AND WAVE FIELD DECOMPOSITION WITH FACTOR GRAPHS

    E-Print Network [OSTI]

    Loeliger, Hans-Andrea

    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

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

  2. SMITH INVARIANTS AND DUAL GRADED GRAPHS ALEXANDER MILLER

    E-Print Network [OSTI]

    Weinberger, Hans

    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

  3. Evaluation of Multimodal Graphs for Blind People , STEPHEN BREWSTER

    E-Print Network [OSTI]

    Williamson, John

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

  4. Synchronous Black Hole Search in Directed Graphs Adrian Kosowski

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    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

  5. WRIGHT'S CONSTANTS IN GRAPH ENUMERATION AND BROWNIAN EXCURSION AREA

    E-Print Network [OSTI]

    Janson, Svante

    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

  6. WRIGHT'S CONSTANTS IN GRAPH ENUMERATION AND BROWNIAN EXCURSION AREA

    E-Print Network [OSTI]

    Janson, Svante

    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

  7. A graph-based network-vulnerability analysis system

    SciTech Connect (OSTI)

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

    1998-05-03T23:59:59.000Z

    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.

  8. A graph-based network-vulnerability analysis system

    SciTech Connect (OSTI)

    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

    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.

  9. Using Visualization Process Graphs to Improve Visualization Exploration

    E-Print Network [OSTI]

    Jankun-Kelly, T. J.

    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

  10. Graphs, Rewriting and Pathway Reconstruction for Rule-Based Models

    E-Print Network [OSTI]

    Fontana, Walter

    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

  11. Approximating the Diameter of Planar Graphs in Near Linear Time

    E-Print Network [OSTI]

    Yuster, Raphael

    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

  12. A Simple Approach to Abductive Inference using Conceptual Graphs

    E-Print Network [OSTI]

    Pagnucco, Maurice

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

  13. Concept generation of dynamic systems using bond graphs

    E-Print Network [OSTI]

    Krishnan, S

    1990-01-01T23:59:59.000Z

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

  14. Removable, hermetically-sealing, filter attachment system for hostile environments

    DOE Patents [OSTI]

    Mayfield, Glenn L [Richland, WA

    1983-01-01T23:59:59.000Z

    A removable and reusable filter attachment system. A filter medium is fixed o, and surrounded by, a filter frame having a coaxial, longitudinally extending, annular rim. The rim engages an annular groove which surrounds the opening of a filter housing. The annular groove contains a fusible material and a heating mechanism for melting the fusible material. Upon resolidifying, the fusible material forms a hermetic bond with the rim and groove. Remelting allows detachment and replacement of the filter frame.

  15. Attachment working models and false recall: a category structure approach

    E-Print Network [OSTI]

    Wilson, Carol Leigh

    2009-06-02T23:59:59.000Z

    of their social identity (Mikulincer & Florian, 1998; Mikulincer, Florian, & Tolmacz, 1990). Thus the concerns of relational loss and separation from partners, lack of support, potential rejection, death, lack of intimacy, and the negative emotional... immortality and subsequently a lower fear of death relative to insecure attachment (Mikulincer & Florian, 1998; Mikulincer et al., 1990). Because the experience of relational rejection or abandonment (and associated affective responses), and the fear...

  16. Scaling and biomechanics of surface attachment in climbing animals

    E-Print Network [OSTI]

    Labonte, David; Federle, Walter

    2014-01-01T23:59:59.000Z

    detachment, this observation suggests that climbing animals are able to switch between both states. This ability may be an essential prerequisite for combining reliable surface attachment with rapid locomotion, but the detailed underlying mecha- nisms... which peel like Scotch tape [62, 63], as well as for the influence of capillarity and viscosity in Ďwetí adhesive contacts [64, 65, 66, 67]. Each of these models predicts a specific dependence on the dimensions of the contact, and thus the scaling...

  17. 2011-31 Attachment Aquisition Letter | Department of Energy

    Energy Savers [EERE]

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on Delicious RankCombustionImprovement Awardflash2007-42attachment1.pdfmodule(EE) |the Fuel Cell

  18. Pin and roller attachment system for ceramic blades

    DOE Patents [OSTI]

    Shaffer, James E. (Maitland, FL)

    1995-01-01T23:59:59.000Z

    In a turbine, a plurality of blades are attached to a turbine wheel by way of a plurality of joints which form a rolling contact between the blades and the turbine wheel. Each joint includes a pin and a pair of rollers to provide rolling contact between the pin and an adjacent pair of blades. Because of this rolling contact, high stress scuffing between the blades and the turbine wheel reduced, thereby inhibiting catastrophic failure of the blade joints.

  19. Pin and roller attachment system for ceramic blades

    DOE Patents [OSTI]

    Shaffer, J.E.

    1995-07-25T23:59:59.000Z

    In a turbine, a plurality of blades are attached to a turbine wheel by way of a plurality of joints which form a rolling contact between the blades and the turbine wheel. Each joint includes a pin and a pair of rollers to provide rolling contact between the pin and an adjacent pair of blades. Because of this rolling contact, high stress scuffing between the blades and the turbine wheel reduced, thereby inhibiting catastrophic failure of the blade joints. 3 figs.

  20. Attachment FY2011-18 OPAM | Department of Energy

    Energy Savers [EERE]

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on Delicious RankCombustionImprovement3--Logistical Challenges toReport |2013-04 on Executive Compensation |A07Attachment

  1. Attachment FY2011-25 OPAM | Department of Energy

    Energy Savers [EERE]

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on Delicious RankCombustionImprovement3--Logistical Challenges toReport |2013-04 on Executive Compensation2)Attachment

  2. Attachment FY2011-40 | Department of Energy

    Energy Savers [EERE]

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on Delicious RankCombustionImprovement3--Logistical Challenges toReport |2013-04 on ExecutiveAttachment

  3. Attachment FY2011-73 OPAM | Department of Energy

    Energy Savers [EERE]

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on Delicious RankCombustionImprovement3--Logistical Challenges toReport |2013-04 onAttachment

  4. AttachmentFlash_2010-55.pdf | Department of Energy

    Energy Savers [EERE]

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on Delicious RankCombustionImprovement3--Logistical Challenges toReportAttachmentFlash_2010-55.pdf

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

    E-Print Network [OSTI]

    De Bacco, Caterina; Sollich, Peter

    2015-01-01T23:59:59.000Z

    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.

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

    E-Print Network [OSTI]

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

    2007-11-12T23:59:59.000Z

    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.

  7. Method of attaching ceramics to gas-turbine metal components

    SciTech Connect (OSTI)

    Legchilin, P.F.

    1985-01-01T23:59:59.000Z

    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.

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

    SciTech Connect (OSTI)

    Brost, Randolph C.; McLendon, William Clarence,

    2013-01-01T23:59:59.000Z

    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.

  9. Quantitative Analysis of the Full Bitcoin Transaction Graph

    E-Print Network [OSTI]

    Dorit Ron; Adi Shamir

    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.

  10. A graph-separation theorem for quantum causal models

    E-Print Network [OSTI]

    Jacques Pienaar; Caslav Brukner

    2014-10-31T23:59:59.000Z

    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.

  11. Traffic of cytoskeletal motors with disordered attachment rates

    E-Print Network [OSTI]

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

    2008-06-24T23:59:59.000Z

    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.

  12. Policy Flash 2011-2 Attachment 1 | Department of Energy

    Office of Environmental Management (EM)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel),Feet) Year Jan Feb Mar Apr May Jun Jul(Summary) "of Energy Power.pdf11-161-LNG |September 15, 2010Energy6 FronteraMarijuana use |2 Policy Flash2 Attachment 1

  13. Flash2003-18attachment.pdf | Department of Energy

    Office of Environmental Management (EM)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel),Feet) Year Jan Feb Mar Apr May Jun Jul(Summary) "of Energy Power SystemsResourcesFLASH2011-11-OPAMFY 2007 TotalFinalJobs3 Flash 2011-238attachment.pdf

  14. Flash2004-23Attachment_2.pdf | Department of Energy

    Office of Environmental Management (EM)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel),Feet) Year Jan Feb Mar Apr May Jun Jul(Summary) "of Energy Power SystemsResourcesFLASH2011-11-OPAMFY 2007Flash2004-17.pdf2.pdf Flash2004-23Attachment_2.pdf

  15. Flash2005-52ATTACHMENT1.pdf | Department of Energy

    Office of Environmental Management (EM)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel),Feet) Year Jan Feb Mar Apr May Jun Jul(Summary) "of Energy Power SystemsResourcesFLASH2011-11-OPAMFY2.pdf4.pdf Flash2005-44.pdf0.pdfATTACHMENT1.pdf

  16. Flash2006-02ATTACHMENT.pdf | Department of Energy

    Office of Environmental Management (EM)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel),Feet) Year Jan Feb Mar Apr May Jun Jul(Summary) "of Energy Power SystemsResourcesFLASH2011-11-OPAMFY2.pdf4.pdf3.pdf Flash2005-53.pdf8.pdf.pdfATTACHMENT.pdf

  17. Flash2006-14ATTACHMENT.pdf | Department of Energy

    Office of Environmental Management (EM)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel),Feet) Year Jan Feb Mar Apr May Jun Jul(Summary) "of Energy Power.pdf Flash2006-14.pdf Flash2006-14.pdf More Documents & PublicationsATTACHMENT.pdf

  18. Flash2006-23Attachment.doc | Department of Energy

    Office of Environmental Management (EM)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel),Feet) Year Jan Feb Mar Apr May Jun Jul(Summary) "of Energy Power.pdf Flash2006-14.pdf Flash2006-14.pdf More Documents &17.pdfAttachment.doc&#0;

  19. Flash2006-38Attachment.doc | Department of Energy

    Office of Environmental Management (EM)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel),Feet) Year Jan Feb Mar Apr May Jun Jul(Summary) "of Energy Power.pdf Flash2006-14.pdf Flash2006-14.pdf More DocumentsAttachment.doc&#0;

  20. Flash2006-42Attachment2.doc | Department of Energy

    Office of Environmental Management (EM)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel),Feet) Year Jan Feb Mar Apr May Jun Jul(Summary) "of Energy Power.pdf Flash2006-14.pdf Flash2006-14.pdf MoreAttachment2.doc&#0;

  1. Flash2006-45Attachment.doc | Department of Energy

    Office of Environmental Management (EM)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel),Feet) Year Jan Feb Mar Apr May Jun Jul(Summary) "of Energy Power.pdf Flash2006-14.pdf Flash2006-14.pdf MoreAttachment2.doc&#0;3.pdf

  2. Flash2007-06Attachment.pdf | Department of Energy

    Office of Environmental Management (EM)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel),Feet) Year Jan Feb Mar Apr May Jun Jul(Summary) "of Energy Power.pdf Flash2006-14.pdf Flash2006-14.pdf.pdf Flash2006-52.pdf2.pdf3.pdf4.pdf.pdfAttachment.pdf

  3. Flash2008-31Attachment2.pdf | Department of Energy

    Office of Environmental Management (EM)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel),Feet) Year Jan Feb Mar Apr May Jun Jul(Summary) "of Energy Power.pdf Flash2006-14.pdf Flash2006-14.pdf.pdf.pdf6.pdf8.pdf9.pdf.pdfAttachment2.pdf

  4. Flash2008-41Attachment.pdf | Department of Energy

    Office of Environmental Management (EM)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel),Feet) Year Jan Feb Mar Apr May Jun Jul(Summary) "of Energy Power.pdf Flash2006-14.pdfattachment.pdf Flash2008-39attachment.pdf.pdf

  5. Policy Flash 2011-99 Attachment.pdf

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

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel),Feet) Year Jan Feb Mar Apr May Jun Jul(Summary) "ofEarly Careerlumens_placard-green.epsEnergy1.pdfMarket |21, 2015 7:00AM to_attach2.pdf6078 DATE: August

  6. Attachment FY2011-43 OPAM | Department of Energy

    Energy Savers [EERE]

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on Delicious RankCombustion |Energyon ArmedWaste andAccess to OUO Access toEnergy 5 BTOoftheAModificationsAttachment

  7. Attachment FY2011-55 OPAM | Department of Energy

    Energy Savers [EERE]

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on Delicious RankCombustion |Energyon ArmedWaste andAccess to OUO Access toEnergy 5Attachment FY2011-55 OPAM

  8. Attachment FY2011-80 OPAM | Department of Energy

    Energy Savers [EERE]

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on Delicious RankCombustion |Energyon ArmedWaste andAccess to OUO Access toEnergy 5Attachment FY2011-55 OPAM80 OPAM

  9. Attachment FY2011-81 OPAM | Department of Energy

    Energy Savers [EERE]

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on Delicious RankCombustion |Energyon ArmedWaste andAccess to OUO Access toEnergy 5Attachment FY2011-55 OPAM80

  10. Attachment FY2011-82 OPAM | Department of Energy

    Energy Savers [EERE]

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on Delicious RankCombustion |Energyon ArmedWaste andAccess to OUO Access toEnergy 5Attachment FY2011-55 OPAM8082 OPAM

  11. Attachment FY2011-83 OPAM | Department of Energy

    Energy Savers [EERE]

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on Delicious RankCombustion |Energyon ArmedWaste andAccess to OUO Access toEnergy 5Attachment FY2011-55 OPAM8082 OPAM

  12. AttachmentFlash2010-39.pdf | Department of Energy

    Energy Savers [EERE]

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on Delicious RankCombustion |Energyon ArmedWaste andAccess to OUO Access toEnergy 5Attachment FY2011-55 OPAM8082

  13. AttachmentFlash2010-75.pdf | Department of Energy

    Energy Savers [EERE]

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on Delicious RankCombustion |Energyon ArmedWaste andAccess to OUO Access toEnergy 5Attachment FY2011-55

  14. AttachmentFlash_2010-18.pdf | Department of Energy

    Energy Savers [EERE]

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on Delicious RankCombustion |Energyon ArmedWaste andAccess to OUO Access toEnergyAttachmentFlash_2010-18.pdf

  15. Attachment FY2011-3 OPAM | Department of Energy

    Energy Savers [EERE]

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on Delicious RankCombustionImprovement3--Logistical Challenges toReport |2013-04 on ExecutiveAttachment FY2011-3 OPAM

  16. Attachment FY2011-3 OPAM | Department of Energy

    Energy Savers [EERE]

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on Delicious RankCombustionImprovement3--Logistical Challenges toReport |2013-04 on ExecutiveAttachment FY2011-3 OPAM OPAM

  17. Attachment FY2011-3(2) OPAM | Department of Energy

    Energy Savers [EERE]

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on Delicious RankCombustionImprovement3--Logistical Challenges toReport |2013-04 on ExecutiveAttachment FY2011-3 OPAM

  18. Attachment FY2011-3(3) | Department of Energy

    Energy Savers [EERE]

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on Delicious RankCombustionImprovement3--Logistical Challenges toReport |2013-04 on ExecutiveAttachment FY2011-3 OPAM3)

  19. Attachment FY2011-30 OPAM | Department of Energy

    Energy Savers [EERE]

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on Delicious RankCombustionImprovement3--Logistical Challenges toReport |2013-04 on ExecutiveAttachment FY2011-3

  20. Attachment FY2011-44 OPAM | Department of Energy

    Energy Savers [EERE]

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on Delicious RankCombustionImprovement3--Logistical Challenges toReport |2013-04 onAttachment FY2011-41 OPAM

  1. Attachment FY2011-46(2) OPAM | Department of Energy

    Energy Savers [EERE]

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on Delicious RankCombustionImprovement3--Logistical Challenges toReport |2013-04 onAttachment FY2011-41 OPAM2) OPAM

  2. Attachment FY2011-46(3) | Department of Energy

    Energy Savers [EERE]

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on Delicious RankCombustionImprovement3--Logistical Challenges toReport |2013-04 onAttachment FY2011-41 OPAM2) OPAM3)

  3. Attachment FY2011-46(4) OPAM | Department of Energy

    Energy Savers [EERE]

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on Delicious RankCombustionImprovement3--Logistical Challenges toReport |2013-04 onAttachment FY2011-41 OPAM2)

  4. Attachment FY2011-46(5) OPAM | Department of Energy

    Energy Savers [EERE]

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on Delicious RankCombustionImprovement3--Logistical Challenges toReport |2013-04 onAttachment FY2011-41 OPAM2)5) OPAM

  5. Attachment FY2011-50 OPAM | Department of Energy

    Energy Savers [EERE]

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on Delicious RankCombustionImprovement3--Logistical Challenges toReport |2013-04 onAttachment FY2011-41 OPAM2)5)

  6. Attachment FY2011-53 OPAM | Department of Energy

    Energy Savers [EERE]

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on Delicious RankCombustionImprovement3--Logistical Challenges toReport |2013-04 onAttachment FY2011-41

  7. Attachment FY2011-63 OPAM | Department of Energy

    Energy Savers [EERE]

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on Delicious RankCombustionImprovement3--Logistical Challenges toReport |2013-04 onAttachment FY2011-411, Summary of

  8. Attachment FY2011-63 OPAM | Department of Energy

    Energy Savers [EERE]

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on Delicious RankCombustionImprovement3--Logistical Challenges toReport |2013-04 onAttachment FY2011-411, Summary

  9. Attachment FY2011-64 OPAM | Department of Energy

    Energy Savers [EERE]

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on Delicious RankCombustionImprovement3--Logistical Challenges toReport |2013-04 onAttachment FY2011-411,

  10. flash2005-12attachment.pdf | Department of Energy

    Office of Environmental Management (EM)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel),Feet) Year Jan Feb Mar Apr May Jun Jul(Summary) "of EnergyEnergy Cooperation | Department ofEnergy IsTestimonialscompaniesflash2005-12attachment.pdf

  11. Judicious partitions of graphs Bela Bollobas and Alexander Scott

    E-Print Network [OSTI]

    Scott, Alexander Alexander

    , 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

  12. A Spatiotemporal Graph Model for Rainfall Event Identification and Representation

    E-Print Network [OSTI]

    Liu, Weibo

    2014-04-21T23:59:59.000Z

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

  13. Predicting Envelope Leakage in Attached Dwellings (Fact Sheet)

    SciTech Connect (OSTI)

    Not Available

    2013-11-01T23:59:59.000Z

    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.

  14. Nevada Test Site Environmental Report 2008 Attachment A: Site Description

    SciTech Connect (OSTI)

    Cathy A. Wills

    2009-09-01T23:59:59.000Z

    This attachment expands on the general description of the Nevada Test Site (NTS) presented in the Introduction to the Nevada Test Site Environmental Report 2008 (National Security Technologies, LLC [NSTec], 2009a). Included are subsections that summarize the siteís geological, hydrological, climatological, and ecological setting. The cultural resources of the NTS are also presented. The subsections are meant to aid the reader in understanding the complex physical and biological environment of the NTS. An adequate knowledge of the siteís environment is necessary to assess the environmental impacts of new projects, design and implement environmental monitoring activities for current site operations, and assess the impacts of site operations on the public residing in the vicinity of the NTS. The NTS environment contributes to several key features of the site that afford protection to the inhabitants of adjacent areas from potential exposure to radioactivity or other contaminants resulting from NTS operations. These key features include the general remote location of the NTS, restricted access, extended wind transport times, the great depths to slow-moving groundwater, little or no surface water, and low population density. This attachment complements the annual summary of monitoring program activities and dose assessments presented in the main body of this report.

  15. Cladding Attachment Over Thick Exterior Insulating Sheathing (Fact Sheet)

    SciTech Connect (OSTI)

    Not Available

    2013-11-01T23:59:59.000Z

    The addition of insulation to the exterior of buildings is an effective means of increasing the thermal resistance of wood-framed walls and mass masonry wall assemblies. The location of the insulation on 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 airtightness and improved water management. For thick layers of exterior insulation (more than 1.5 in.), the use of wood furring strips attached through the insulation back to the structure has been used by many contractors and designers as a means to provide a convenient cladding attachment location. Although the approach has proven effective, there is significant resistance to its widespread implementation due to a lack of research and understanding of the mechanisms involved in the development of the vertical displacement resistance capacity. In addition, the long-term in-service performance of the system has been questioned due to potential creep effects of the assembly under the sustained dead load of the cladding and effects of varying environmental conditions. In addition, the current International Building Code (IBC) and International Residential Code (IRC) do not have a provision that specifically allows this assembly.

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

    E-Print Network [OSTI]

    Adali, Tulay

    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

  17. E-Print Network 3.0 - attached molecular design Sample Search...

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

    molecular design Search Powered by Explorit Topic List Advanced Search Sample search results for: attached molecular design Page: << < 1 2 3 4 5 > >> 1 This thesis describes the...

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

    E-Print Network [OSTI]

    Bradley, Michael Joshua

    2012-01-01T23:59:59.000Z

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

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

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

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

    E-Print Network [OSTI]

    Boyer, Edmond

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

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

    E-Print Network [OSTI]

    Roames, Renee S

    2015-01-08T23:59:59.000Z

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

  3. A Penrose inequality for asymptotically locally hyperbolic graphs

    E-Print Network [OSTI]

    Levi Lopes de Lima; Frederico Gir„o

    2013-05-14T23:59:59.000Z

    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.

  4. NORTHEASTERN NATURALIST2006 13(1):3538 Sea Lamprey Attached to a Greenland Shark in the

    E-Print Network [OSTI]

    Myers, Ransom A.

    NORTHEASTERN NATURALIST2006 13(1):35≠38 Sea Lamprey Attached to a Greenland Shark in the St fork length, male Somniosus microcephalus (Greenland shark) on 9 October 2004 in Baie St. Pancrace, St observation of a sea lamprey attached to a Somniosus microcephalus (Bloch and Schneider) (Greenland shark

  5. Multilayer friction and attachment effects on energy dissipation in graphene nanoresonators

    E-Print Network [OSTI]

    Lin, Xi

    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

  6. EXPERIMENTS AND MODELLING OF CAVITATING FLOWS IN VENTURI: ATTACHED SHEET CAVITATION

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    1 EXPERIMENTS AND MODELLING OF CAVITATING FLOWS IN VENTURI: ATTACHED SHEET CAVITATION S. Barre* , J and numerical studies were carried out to analyse cavitating flows and to describe the two- phase flow structures of attached sheet cavitation in Venturi geometries. New double optical probe measurements were

  7. VLT Budget Information: FY2004/2005 Attachment 1 2 / 6 / 0 3 Page 1

    E-Print Network [OSTI]

    Draft VLT Budget Information: FY2004/2005 Attachment 1 2 / 6 / 0 3 Page 1 ∑ Program Element: Next of internal RWM coils ∑ Physics Validation Review, respond to generic issues. #12;Draft VLT Budget Information: FY2004/2005 Attachment 1 2 / 6 / 0 3 Page 2 FY2004 ∑ Reference Budget: (same as FY2003) 1901 k

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

    E-Print Network [OSTI]

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

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

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

    E-Print Network [OSTI]

    Andrea Bedini; Jesper Lykke Jacobsen

    2010-08-06T23:59:59.000Z

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

  10. Attaching solar collectors to a structural framework utilizing a flexible clip

    DOE Patents [OSTI]

    Kruse, John S

    2014-03-25T23:59:59.000Z

    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.

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

    E-Print Network [OSTI]

    Deville, Yves

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

  12. Graph Kernels Based on Relevant Patterns and Cycle Information for Chemoinformatics

    E-Print Network [OSTI]

    Boyer, Edmond

    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

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

    E-Print Network [OSTI]

    Bedini, Andrea

    2010-01-01T23:59:59.000Z

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

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

    E-Print Network [OSTI]

    California at Santa Cruz, University of

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

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

    E-Print Network [OSTI]

    Rossi, Francesca

    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

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

    E-Print Network [OSTI]

    Erickson, Jeff

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

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

    E-Print Network [OSTI]

    Schlick, Tamar

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

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

    E-Print Network [OSTI]

    K√ľhn, Daniela

    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

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

    E-Print Network [OSTI]

    Osthus, Deryk

    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

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

    E-Print Network [OSTI]

    Sawada, Joe

    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

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

    E-Print Network [OSTI]

    Markowsky, Greg

    2010-01-01T23:59:59.000Z

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

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

    E-Print Network [OSTI]

    Zollman, Dean

    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

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

    E-Print Network [OSTI]

    Kroese, Dirk P.

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

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

    E-Print Network [OSTI]

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

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

    E-Print Network [OSTI]

    Cameron, Peter

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

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

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

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

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

    E-Print Network [OSTI]

    Schröer, Stefan

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

  8. Graph Mining for Object Tracking in Videos Fabien Diot1,2

    E-Print Network [OSTI]

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

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

    E-Print Network [OSTI]

    Kambhampati, Subbarao

    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

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

    E-Print Network [OSTI]

    Norin, Sergey

    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

  11. INDDGO: Integrated Network Decomposition & Dynamic programming for Graph Optimization

    SciTech Connect (OSTI)

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

    2012-10-01T23:59:59.000Z

    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.

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

    E-Print Network [OSTI]

    Paris-Sud XI, Universitť de

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

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

    E-Print Network [OSTI]

    Williams, Susan

    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

  14. Nevada Test Site Environmental Report 2007 Attachment A: Site Description

    SciTech Connect (OSTI)

    Cathy Wills

    2008-09-01T23:59:59.000Z

    This appendix expands on the general description of the Nevada Test Site (NTS) presented in the Introduction to the Nevada Test Site Environmental Report 2007 (U.S. Department of Energy [DOE], 2008). Included are subsections that summarize the site's geological, hydrological, climatological, and ecological setting. The cultural resources of the NTS are also presented. The subsections are meant to aid the reader in understanding the complex physical and biological environment of the NTS. An adequate knowledge of the site's environment is necessary to assess the environmental impacts of new projects, design and implement environmental monitoring activities for current site operations, and assess the impacts of site operations on the public residing in the vicinity of the NTS. The NTS environment contributes to several key features of the site which afford protection to the inhabitants of adjacent areas from potential exposure to radioactivity or other contaminants resulting from NTS operations. These key features include the general remote location of the NTS, restricted access, extended wind transport times, the great depths to slow-moving groundwater, little or no surface water, and low population density. This attachment complements the annual summary of monitoring program activities and dose assessments presented in the main body of this report.

  15. Methods for attaching polymerizable ceragenins to water treatment membranes using silane linkages

    DOE Patents [OSTI]

    Hibbs, Michael; Altman, Susan J.; Jones, Howland D. T.; Savage, Paul B.

    2013-09-10T23:59:59.000Z

    This invention relates to methods for chemically grafting and attaching ceragenin molecules to polymer substrates; methods for synthesizing ceragenin-containing copolymers; methods for making ceragenin-modified water treatment membranes and spacers; and methods of treating contaminated water using ceragenin-modified treatment membranes and spacers. Ceragenins are synthetically produced antimicrobial peptide mimics that display broad-spectrum bactericidal activity. Alkene-functionalized ceragenins (e.g., acrylamide-functionalized ceragenins) can be attached to polyamide reverse osmosis membranes using amine-linking, amide-linking, UV-grafting, or silane-coating methods. In addition, silane-functionalized ceragenins can be directly attached to polymer surfaces that have free hydroxyls.

  16. A note on QUBO instances defined on Chimera graphs

    E-Print Network [OSTI]

    Sanjeeb Dash

    2013-07-01T23:59:59.000Z

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

  17. Linking SARAH and MadGraph using the UFO format

    E-Print Network [OSTI]

    Staub, Florian

    2012-01-01T23:59:59.000Z

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

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

    SciTech Connect (OSTI)

    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

    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.

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

    E-Print Network [OSTI]

    Rishi Saket

    2013-07-01T23:59:59.000Z

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

  20. A Hydrogen-Evolving Ni(P2N2)2 Electrocatalyst Covalently Attached...

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

    A Hydrogen-Evolving Ni(P2N2)2 Electrocatalyst Covalently Attached to a Glassy Carbon Electrode: Preparation, Characterization, A Hydrogen-Evolving Ni(P2N2)2 Electrocatalyst...

  1. Design Of Heat-Activated Reversible Integral Attachments For Product-Embedded Disassembly

    E-Print Network [OSTI]

    Saitou, Kazuhiro "Kazu"

    Design Of Heat-Activated Reversible Integral Attachments For Product-Embedded Disassembly Ying Li Engineering University of Michigan Ann Arbor, MI 48109-2125, USA {yingli, kazu, kikuchi, skerlos, pyp

  2. Design Of Heat-Activated Reversible Integral Attachments For Product-Embedded Disassembly

    E-Print Network [OSTI]

    Saitou, Kazuhiro "Kazu"

    1 Design Of Heat-Activated Reversible Integral Attachments For Product-Embedded Disassembly Ying Li, MI 48109-2125 Phone: +1-734-763-0036; Fax: +1-734-647-3170 {yingli, kazu, kikuchi}@umich.edu Abstract

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

    E-Print Network [OSTI]

    Sandoval, Erin Leverenz

    2009-05-15T23:59:59.000Z

    ). Attachment security has been related to efficient affect self-regulation (Mallinckrodt, 2000), appraising negative events as less threatening (Mikulincer & Florian, 1995), problem focused modes of coping (Mikulincer & Florian, 1998), seeking and perceiving...

  4. Attached algae of the Lake Erie shoreline near Nanticoke Generating Station

    SciTech Connect (OSTI)

    Kirby, M.K.; Dunford, W.E.

    1981-11-01T23:59:59.000Z

    The distribution, species composition, and standing crop of attached algae were surveyed in the splash zone along the shore of Lake Erie from 1971 to 1978 to determine the impact of construction and operation of the Nanticoke Generating Station, a coal-fired power plant. Station operation has had no apparent influence on the spatial distribution of attached algae in the lake stations. However, the discharge of heated condenser cooling water has resulted in an accelerated growth of attached algae in the immediate vicinity of the station early in the growing season, but the effect was not sustained after May. The species composition at sites near the generating station differed from control areas. Three years after the initial operation of the plant the generating station had a lower percent abundance of Cladophora and a higher percent abundance of weakly attached algal species such as Zygnema; this is perhaps attributable to the sheltered conditions in the discharge area of the generating station.

  5. Attached algae of the Lake Erie shoreline near Nanticoke generating station

    SciTech Connect (OSTI)

    Kirby, M.K.; Dunford, W.E.

    1981-01-01T23:59:59.000Z

    The distribution, species composition and standing crop of attached algae were surveyed in the splash zone along the shore of Lake Erie from 1971 to 1978 to determine the impact of construction and operation of the Nanticoke Generating Station, a coal-fired power plant. Station operation has had no apparent influence on the spatial distribution of attached algae in the lake stations. However, the discharge of heated condenser cooling water has resulted in an accelerated growth of attached algae in the immediate vicinity of the station early in the growing season, but the effect was not sustained after May. The species composition at sites near the generating station differed from control areas. Three years after the initial operation of the plant the generating station had a lower percent abundance of Cladophora and a higher percent abundance of weakly attached algal species such as Zygnema; this is perhaps attributable to the sheltered conditions in the discharge area of the generating station.

  6. SENIOR PROJECT PROPOSAL FORM Attach this completed form to your Honors Senior Proposal

    E-Print Network [OSTI]

    Huang, Haiying

    SENIOR PROJECT PROPOSAL FORM Attach this completed form to your Honors Senior Proposal I. PERSONAL#:________________________________ Anticipated Graduation Date: _____________________________ Date Submitted: ___________________________ Major: __________________________________ II. PROJECT INFORMATION Type of Project: Consult the departmental options informational sheet

  7. E-Print Network 3.0 - attached vibrational probe Sample Search...

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

    2 NEAR-FIELD SCANNING OPTICAL MICRO PROBE INTEGRATED WITH ANANOMETER-SIZED LIGHT EMITTING DIODE Summary: to 93KHz with the probe attached. As the tip approaches the surface of...

  8. The effect of pet ownership/attachment on the stress level of multiple sclerosis patients

    E-Print Network [OSTI]

    Loven, Ashley Marie

    2005-11-01T23:59:59.000Z

    whether or not pet ownership and/or attachment influenced the perceived stress level and number of negative life events experienced by MS patients in the relapsing remitting stage. Participants were given a questionnaire that consisted of 7 surveys...

  9. E-Print Network 3.0 - attachment marks expressed Sample Search...

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

    and in joules. 3 marks 5. What is the speed... September, 2008 Instructions: Answer the questions below in the spaces provided. Attach a completed cover... A of the exposure? 2...

  10. Hydrogen Fuel Infrastructure PON-11-609 Attachment F Local Health Impacts Information

    E-Print Network [OSTI]

    Hydrogen Fuel Infrastructure PON-11-609 Attachment F ­ Local Health Impacts Information Air Quality Percentage of population under 5 years and over 65 years of age #12;Hydrogen Fuel Infrastructure PON-11

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

    E-Print Network [OSTI]

    Alfonso, Laura Magdalena

    2012-06-07T23:59:59.000Z

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

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

    E-Print Network [OSTI]

    Giudici, Michael

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

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

    E-Print Network [OSTI]

    Sagan, Bruce

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

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

    SciTech Connect (OSTI)

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

    2014-01-01T23:59:59.000Z

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

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

    E-Print Network [OSTI]

    Kempton, Mark Condie

    2010-01-01T23:59:59.000Z

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

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

    E-Print Network [OSTI]

    Saberi, Amin

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

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

    E-Print Network [OSTI]

    Steel, Daniel

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

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

    E-Print Network [OSTI]

    Mohar, Bojan

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

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

    E-Print Network [OSTI]

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

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

    E-Print Network [OSTI]

    Banach, Richard

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

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

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

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

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

    E-Print Network [OSTI]

    Lan, Ching Fu

    2006-04-12T23:59:59.000Z

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

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

    E-Print Network [OSTI]

    Fox, Jacob

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

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

    E-Print Network [OSTI]

    Hammer, Mary Elizabeth

    2002-01-01T23:59:59.000Z

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

  5. Exact sampling of graphs with prescribed degree correlations

    E-Print Network [OSTI]

    Bassler, Kevin E; Erd?s, Pťter L; Miklůs, IstvŠn; Toroczkai, ZoltŠn

    2015-01-01T23:59:59.000Z

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

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

    SciTech Connect (OSTI)

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

    2009-01-01T23:59:59.000Z

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

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

    E-Print Network [OSTI]

    V. L. Chernyshev; A. A. Tolchennikov

    2014-10-18T23:59:59.000Z

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

  8. On the Effect of Ramp Rate in Damage Accumulation of the CPV Die-Attach: Preprint

    SciTech Connect (OSTI)

    Bosco, N. S.; Silverman, T. J.; Kurtz, S. R.

    2012-06-01T23:59:59.000Z

    It is commonly understood that thermal cycling at high temperature ramp rates may activate unrepresentative failure mechanisms. Increasing the temperature ramp rate of thermal cycling, however, could dramatically reduce the test time required to achieve an equivalent amount of thermal fatigue damage, thereby reducing overall test time. Therefore, the effect of temperature ramp rate on physical damage in the CPV die-attach is investigated. Finite Element Model (FEM) simulations of thermal fatigue and thermal cycling experiments are made to determine if the amount of damage calculated results in a corresponding amount of physical damage measured to the die-attach for a variety of fast temperature ramp rates. Preliminary experimental results are in good agreement with simulations and reinforce the potential of increasing temperature ramp rates. Characterization of the microstructure and resulting fatigue crack in the die-attach suggest a similar failure mechanism across all ramp rates tested.

  9. Electron attachment to C{sub 2} fluorocarbon radicals at high temperature

    SciTech Connect (OSTI)

    Shuman, Nicholas S.; Miller, Thomas M.; Viggiano, Albert A., E-mail: afrl.rvborgmailbox@kirtland.af.mil [Air Force Research Laboratory, Space Vehicle Directorate, Kirtland Air Force Base, New Mexico 87117 (United States)

    2013-11-14T23:59:59.000Z

    Thermal electron attachment to the radical species C{sub 2}F{sub 3} and C{sub 2}F{sub 5} has been studied over the temperature range 300Ė890 K using the Variable Electron and Neutral Density Attachment Mass Spectrometry technique. Both radicals exclusively undergo dissociative attachment to yield F{sup ?}. The rate constant for C{sub 2}F{sub 5} shows little dependence over the temperature range, remaining ?4 ◊ 10{sup ?9}?cm{sup 3}?s{sup ?1}. The rate constant for C{sub 2}F{sub 3} attachment rises steeply with temperature from 3 ◊ 10{sup ?11} cm{sup 3} s{sup ?1} at 300?K to 1 ◊ 10{sup ?9} cm{sup 3} s{sup ?1} at 890 K. The behaviors of both species at high temperature are in agreement with extrapolations previously made from data below 600?K using a recently developed kinetic modeling approach. Measurements were also made on C{sub 2}F{sub 3}Br and C{sub 2}F{sub 5}Br (used in this work as precursors to the radicals) over the same temperature range, and, for C{sub 2}F{sub 5}Br as a function of electron temperature. The attachment rate constants to both species rise with temperature following Arrhenius behavior. The attachment rate constant to C{sub 2}F{sub 5}Br falls with increasing electron temperature, in agreement with the kinetic modeling. The current data fall in line with past predictions of the kinetic modeling approach, again showing the utility of this simplified approach.

  10. Coherent Resonances Observed in the Dissociative Electron Attachments to Carbon Monoxide

    E-Print Network [OSTI]

    Wang, Xu-Dong; Luo, Yi; Tian, Shan Xi

    2015-01-01T23:59:59.000Z

    Succeeding our previous finding about coherent interference of the resonant states of CO^- formed by the low-energy electron attachment [Phys. Rev. A 88, 012708 (2013)], here we provide more evidences of the coherent interference, in particular, we find the state configuration change in the interference with the increase of electron attachment energy by measuring the completely backward distributions of the O^- fragment ion of the temporary CO^- in an energy range 11.3-12.6 eV. Therefore, different pure states, namely, coherent resonances, can be formed when the close-lying resonant states are coherently superposed by a broad-band electron pulse.

  11. The effects of childhood sexual abuse on adult male attachments in close relationships

    E-Print Network [OSTI]

    Altman, Daniel Rayner

    2006-10-30T23:59:59.000Z

    ) state that since 1990 reported rates for female CSA from the United States ranged from 3.9% to 68.1% with most studies reporting approximately 19.1%, while reported rates for male CSA ranged from 2.7% to 34.3% with most reporting 7.2%. (e.g., Gorey...-cut attachment bonds with others (e.g., 10 father or some other closely related adult) (Ainsworth, 1964). Therefore, what begins as a response to the infant?s natural biological reflexes evolves into an emotional bond between the child and the attachment...

  12. Simulation and Experiment of Thermal Fatigue in the CPV Die Attach: Preprint

    SciTech Connect (OSTI)

    Bosco, N.; Silverman, T.; Kurtz, S.

    2012-05-01T23:59:59.000Z

    FEM simulation and accelerated thermal cycling have been performed for the CPV die attach. Trends in fatigue damage accumulation and equivalent test time are explored and found to be most sensitive to temperature ramp rate. Die attach crack growth is measured through cycling and found to be in excellent agreement with simulations of the inelastic strain energy accumulated. Simulations of an entire year of weather data provides for the relative ranking of fatigue damage between four cites as well as their equivalent accelerated test time.

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

    E-Print Network [OSTI]

    Nayantara Bhatnagar; Allan Sly; Prasad Tetali

    2014-05-23T23:59:59.000Z

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

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

    E-Print Network [OSTI]

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

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

    E-Print Network [OSTI]

    Koubarakis, Manolis

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

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

    E-Print Network [OSTI]

    Brandes, Ulrik

    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

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

    E-Print Network [OSTI]

    Goddard, Wayne

    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

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

    E-Print Network [OSTI]

    Ferrara, Emilio

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

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

    E-Print Network [OSTI]

    Boykov, Yuri

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

  20. Long-term determination of airborne concentrations of unattached and attached radon progeny using stacked LR 115 detector with

    E-Print Network [OSTI]

    Yu, K.N.

    Long-term determination of airborne concentrations of unattached and attached radon progeny using-term measurements Radon progeny a b s t r a c t We developed the theoretical basis for long-term determination of airborne concentrations of unattached and attached radon progeny. The work was separated into two parts

  1. ATTACHMENT IX Review of Air Products Fischer-Tropsch Synthesis Work

    E-Print Network [OSTI]

    Kentucky, University of

    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

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

  3. Recovering "Waste" from "WTEs"? Heat Attaching devices to flues and exhaust pipes could harvest waste heat-

    E-Print Network [OSTI]

    Columbia University

    Kanatzidis argues that wherever heat is generated as part of power generation, thermoelectric devices couldRecovering "Waste" from "WTEs"? Heat Attaching devices to flues and exhaust pipes could harvest waste heat- Mar 16th 2006 | From The Economist print edition HERE is a thought: approximately 60

  4. Ceramic to metal attachment system. [Ceramic electrode to metal conductor in MHD generator

    DOE Patents [OSTI]

    Marchant, D.D.

    1983-06-10T23:59:59.000Z

    A composition and method are described for attaching a ceramic electrode to a metal conductor. A layer of randomly interlocked metal fibers saturated with polyimide resin is sandwiched between the ceramic electrode and the metal conductor. The polyimide resin is then polymerized providing bonding.

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

    E-Print Network [OSTI]

    Eccles, Kate

    2010-01-16T23:59:59.000Z

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

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

    DOE Patents [OSTI]

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

    1985-03-01T23:59:59.000Z

    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.

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

    E-Print Network [OSTI]

    Ma, Gang

    1998-01-01T23:59:59.000Z

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

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

    E-Print Network [OSTI]

    Daly, Samantha

    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

  9. See attached for all notes College of Engineering and Computer Science

    E-Print Network [OSTI]

    Mather, Patrick T.

    and Statistics+ (4)____ 4 SCIENCES (15) CHE150 General Chem. for Engineers (3)____ 3 CHE151 General ChemSee attached for all notes College of Engineering and Computer Science Electrical Engineering Name397 Calculus 3 (4)____ 4 MAT485 Diff. Equations & Matrix Algebra (3)____ 3 CIS321 Probability

  10. No-migration variance petition. Volume 3, Revision 1: Appendix B, Attachments A through D

    SciTech Connect (OSTI)

    Not Available

    1990-03-01T23:59:59.000Z

    Volume III contains the following attachments: TRUPACT-II content codes (TRUCON); TRUPACT-II chemical list; chemical compatibility analysis for Rocky Flats Plant waste forms (Appendix 2.10.12 of TRUPACT-II safety analysis report); and chemical compatibility analyses for waste forms across all sites.

  11. Contents Inquiry Sheet attached (Master Course: Blue sheet, Doctor Course: Light green sheet)

    E-Print Network [OSTI]

    Yamamoto, Hirosuke

    of energy and natural resources and the subsequent production of equally large amount of waste#12;#12; Contents Inquiry Sheet attached (Master Course: Blue sheet, Doctor Course: Light green and waste have lead to serious environmental contamination. The earth system be- comes increasingly

  12. Contents Inquiry Sheet attached (Master Course: Blue sheet, Doctor Course: Light green sheet)

    E-Print Network [OSTI]

    Yamamoto, Hirosuke

    1 #12;#12; Contents Inquiry Sheet attached (Master Course: Blue sheet, Doctor Course: Light green countries, long-term economic growth results in the consumption of a vast amount of energy and natural resources and the subsequent production of equally large amount of waste. In developing countries

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

    E-Print Network [OSTI]

    Gupton, Kevin Thomas

    2003-01-01T23:59:59.000Z

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

  14. Automation of the Dipole Subtraction Method in MadGraph/MadEvent

    E-Print Network [OSTI]

    Rikkert Frederix; Thomas Gehrmann; Nicolas Greiner

    2008-08-15T23:59:59.000Z

    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.

  15. Multiclass Diffuse Interface Models for Semi-Supervised Learning on Graphs

    E-Print Network [OSTI]

    Garcia-Cardona, Cristina; Percus, Allon G

    2012-01-01T23:59:59.000Z

    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.

  16. Attachment security as a predictor of blood glucose control in adolescents with Type 1 Diabetes, when the roles of additional psychological factors are considered†

    E-Print Network [OSTI]

    Henderson, Sally

    2010-11-26T23:59:59.000Z

    Introduction: Key studies have found an association between attachment style and poor diabetes outcomes in the adult diabetic populations. Specifically insecure attachment has been found to predict elevated glycated haemoglobin levels (HbA1c...

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

    E-Print Network [OSTI]

    Chen, Ming-Syan

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

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

    E-Print Network [OSTI]

    Prasanna, Viktor K.

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

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

    E-Print Network [OSTI]

    Coello, Carlos A. Coello

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

  20. On the Number of Cycles in Planar Graphs Kevin Buchin1

    E-Print Network [OSTI]

    Fuchs, Gunter

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