Sample records for time-concentration graphs attachment

  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. 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: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645U.S. DOE Office511041cloth DocumentationProducts (VAP) VAP7-0973 1 Introduction In the design of aD.ATTACHMENT 3 1.

  3. Hamiltonian Dynamics of Preferential Attachment

    E-Print Network [OSTI]

    Zuev, Konstantin; Krioukov, Dmitri

    2015-01-01T23:59:59.000Z

    Prediction and control of network dynamics are grand-challenge problems in network science. The lack of understanding of fundamental laws driving the dynamics of networks is among the reasons why many practical problems of great significance remain unsolved for decades. Here we study the dynamics of networks evolving according to preferential attachment, known to approximate well the large-scale growth dynamics of a variety of real networks. We show that this dynamics is Hamiltonian, thus casting the study of complex networks dynamics to the powerful canonical formalism, in which the time evolution of a dynamical system is described by Hamilton's equations. We derive the explicit form of the Hamiltonian that governs network growth in preferential attachment. This Hamiltonian turns out to be nearly identical to graph energy in the configuration model, which shows that the ensemble of random graphs generated by preferential attachment is nearly identical to the ensemble of random graphs with scale-free degree d...

  4. Attachment K

    Office of Environmental Management (EM)

    Waste Permit October 2013 (This page intentionally blank) Waste Isolation Pilot Plant Hazardous Waste Permit October 2013 PERMIT ATTACHMENT K Page K-i ATTACHMENT K SOLID WASTE...

  5. Hamiltonian Dynamics of Preferential Attachment

    E-Print Network [OSTI]

    Konstantin Zuev; Fragkiskos Papadopoulos; Dmitri Krioukov

    2015-04-29T23:59:59.000Z

    Prediction and control of network dynamics are grand-challenge problems in network science. The lack of understanding of fundamental laws driving the dynamics of networks is among the reasons why many practical problems of great significance remain unsolved for decades. Here we study the dynamics of networks evolving according to preferential attachment, known to approximate well the large-scale growth dynamics of a variety of real networks. We show that this dynamics is Hamiltonian, thus casting the study of complex networks dynamics to the powerful canonical formalism, in which the time evolution of a dynamical system is described by Hamilton's equations. We derive the explicit form of the Hamiltonian that governs network growth in preferential attachment. This Hamiltonian turns out to be nearly identical to graph energy in the configuration model, which shows that the ensemble of random graphs generated by preferential attachment is nearly identical to the ensemble of random graphs with scale-free degree distributions. In other words, preferential attachment generates nothing but random graphs with power-law degree distribution. The extension of the developed canonical formalism for network analysis to richer geometric network models with non-degenerate groups of symmetries may eventually lead to a system of equations describing network dynamics at small scales.

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

  7. ATTACHMENT A

    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: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645 3,625 1,006 492 742 33 1112011AT&T, Inc.'s Reply Comments AT&T, Inc.'s Reply Comments Attachment toA4 TRAFFIC

  8. ATTACHMENT G

    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: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645 3,625 1,006 492 742 33 111 1,613Portsmouth SitePresentations | Department(Revisione'sCONTINGENCY PLAN LosATTACHMENT7

  9. ATTACHMENT L

    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: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645 3,625 1,006 492 742 33 111 1,613Portsmouth SitePresentations | Department(Revisione'sCONTINGENCY PLAN LosATTACHMENT7H

  10. ATTACHMENT L

    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: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645 3,625 1,006 492 742 33 111 1,613Portsmouth SitePresentations | Department(Revisione'sCONTINGENCY PLAN LosATTACHMENT7HO

  11. ATTACHMENT N

    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: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645 3,625 1,006 492 742 33 111 1,613Portsmouth SitePresentations | Department(Revisione'sCONTINGENCY PLAN LosATTACHMENT7HON

  12. ATTACHMENT J

    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: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645U.S. DOE Office511041cloth DocumentationProducts (VAP) VAP7-0973 1 Introduction In the design of aD.ATTACHMENT 3Contract

  13. university-logo Graph Expansions

    E-Print Network [OSTI]

    St Andrews, University of

    university-logo Graph Expansions Green's Relations Closing Remarks Semigroup Graph Expansions January 2009 Rebecca Noonan Heale Semigroup Graph Expansions: #12;university-logo Graph Expansions Green;university-logo Graph Expansions Green's Relations Closing Remarks History Definitions Graph Expansions

  14. Probabilistic regular graphs

    E-Print Network [OSTI]

    Bertrand, Nathalie; 10.4204/EPTCS.39.6

    2010-01-01T23:59:59.000Z

    Deterministic graph grammars generate regular graphs, that form a structural extension of configuration graphs of pushdown systems. In this paper, we study a probabilistic extension of regular graphs obtained by labelling the terminal arcs of the graph grammars by probabilities. Stochastic properties of these graphs are expressed using PCTL, a probabilistic extension of computation tree logic. We present here an algorithm to perform approximate verification of PCTL formulae. Moreover, we prove that the exact model-checking problem for PCTL on probabilistic regular graphs is undecidable, unless restricting to qualitative properties. Our results generalise those of EKM06, on probabilistic pushdown automata, using similar methods combined with graph grammars techniques.

  15. Convex Graph Invariants

    E-Print Network [OSTI]

    2010-12-02T23:59:59.000Z

    Dec 2, 2010 ... Massachusetts Institute of Technology ... testing between graph families, and the generation of graphs with certain desired structural properties.

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

  17. Methods of visualizing graphs

    DOE Patents [OSTI]

    Wong, Pak C. (Richland, WA); Mackey, Patrick S. (Kennewick, WA); Perrine, Kenneth A. (Richland, WA); Foote, Harlan P. (Richland, WA); Thomas, James J. (Richland, WA)

    2008-12-23T23:59:59.000Z

    Methods for visualizing a graph by automatically drawing elements of the graph as labels are disclosed. In one embodiment, the method comprises receiving node information and edge information from an input device and/or communication interface, constructing a graph layout based at least in part on that information, wherein the edges are automatically drawn as labels, and displaying the graph on a display device according to the graph layout. In some embodiments, the nodes are automatically drawn as labels instead of, or in addition to, the label-edges.

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

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

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

  1. Extending graph homomorphism and simulation for real life graph matching 

    E-Print Network [OSTI]

    Wu, Yinghui

    2011-06-30T23:59:59.000Z

    Among the vital problems in a variety of emerging applications is the graph matching problem, which is to determine whether two graphs are similar, and if so, find all the valid matches in one graph for the other, based ...

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

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

  4. Vacuum Energy in Quantum Graphs

    E-Print Network [OSTI]

    Wilson, Justin

    2007-07-14T23:59:59.000Z

    We calculate the vacuum energy in quantum graphs. Vacuum energy arose in quantum physics but has an independent mathematical interest as a functional carrying information about the eigenvalue spectrum of a system. A quantum graph is a metric graph...

  5. Arnold Schwarzenegger ATTACHMENT #13

    E-Print Network [OSTI]

    Arnold Schwarzenegger Governor ATTACHMENT #13 MOLD-RESISTANT CONSTRUCTION TRAINING MATERIALS the potential for enormous financial ramifications ($$$$$$$$) from: · building material damage · building's Guide to Reducing Mold Risk". This guide discusses strategies for mold resistant building construction

  6. Arnold Schwarzenegger ATTACHMENT#2

    E-Print Network [OSTI]

    and Subtask 2.5 Synthesized Mold Incidence Database Prepared for: Neil Leslie Gas Technology Institute 1700Arnold Schwarzenegger Governor ATTACHMENT#2 WATER DAMAGE CLAIM DATABASE MANUAL PIERFINALPROJECTREPORT Prepared For: California Energy Commission Public Interest Energy Research Program Prepared By

  7. Arnold Schwarzenegger ATTACHMENT #12

    E-Print Network [OSTI]

    to Reducing Mold Risk PREFACE Theresearchprojectwhichgeneratedthisreportistitled"Energy- EfficientArnold Schwarzenegger Governor ATTACHMENT #12 A CALIFORNIA BUILDER'S GUIDE TO REDUCING MOLD RISK PIERFINALPROJECTREPORT Prepared For: California Energy Commission Public Interest Energy Research Program Prepared By

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

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

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

  11. A Graph Bottleneck Inequality

    E-Print Network [OSTI]

    Chebotarev, Pavel

    2008-01-01T23:59:59.000Z

    For a weighted multidigraph, let $f_{ij}$ be the total weight of spanning converging forests that have vertex $i$ in a tree converging to $j$. We prove that $f_{ij}f_{jk}=f_{ik}f_{jj}$ if and only if every directed path from $i$ to $k$ contains $j$ (a graph bottleneck equality). Otherwise, $f_{ij}f_{jk}inequality). In a companion paper, this inequality provides the foundation for the construction of a new family of graph distances by ensuring the fulfillment of the triangle inequality. This stems from the fact that the graph bottleneck inequality is a multiplicative analogue of the triangle inequality for proximities.

  12. Efficiently Controllable Graphs

    E-Print Network [OSTI]

    Can Gokler; Kevin Thompson; Peter Shor; Seth Lloyd

    2015-03-18T23:59:59.000Z

    We show that universal quantum computation can be performed efficiently on quantum networks while the fraction of controlled subsystems vanishes as the network grows larger. We provide examples of quantum spin network families admitting polynomial quantum gate complexity with a vanishing fraction of controlled spins. We define a new family of graphs, the efficiently controllable family, which admits efficient computation with vanishing fraction of controls. We explore generalizations to percolation clusters, fractals and random graphs. We show that the classical computational complexity of estimating the ground state of Hamiltonians described by controllable graphs is polynomial in the number of subsystems/qubits.

  13. Graphs associated with semigroups

    E-Print Network [OSTI]

    Baber, Stephen Asa

    1976-01-01T23:59:59.000Z

    to the graph of this system as well. We first consider the question of when G(g ) is a com- 3 19 piete graph. The more general question of connectedness will be considered later' In order to state the next few results we need a definitions A minimal right... tM2. In [2], Clifford and Preston show that any two idempotent elements in an inverse semigroup commute. Thus, complete graph. ele2=e2el e MI()M2. As above, G(4 ) is a In order to show that the four conditions in corollary 4. 3...

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

  15. Ladder attachment platform

    DOE Patents [OSTI]

    Swygert,; Richard, W [Springfield, SC

    2012-08-28T23:59:59.000Z

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

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

  17. Geometry of graph varieties

    E-Print Network [OSTI]

    Martin, Jeremy L.

    2003-01-01T23:59:59.000Z

    (G)isasetofedges, or unordered pairs of distinct verticesfv;wg.Wefrequently abbreviatefv;wgby vw when no confusion can arise (for instance, when the vertices are one-digit positive integers). The vertices v;w are called the endpoints of the edge vw.Asubgraph of G is a graph G 0... =(V 0 ;E 0 )withV 0 V and E 0 E.We de ne K(V 0 )=fvw j v;w2V 0 ;v6= wg and E(V 0 )=E\\K(V 0 ): The complete graph on V is the graph (V;K(V)). We write K n for the complete graph onf1;:::;ng.ForE 0 E and v2V,thevalence of v with respect to E 0 is val...

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

  19. Graph similarity and matching

    E-Print Network [OSTI]

    Zager, Laura (Laura A.)

    2005-01-01T23:59:59.000Z

    Measures of graph similarity have a broad array of applications, including comparing chemical structures, navigating complex networks like the World Wide Web, and more recently, analyzing different kinds of biological data. ...

  20. Graphing at Pepco

    SciTech Connect (OSTI)

    Not Available

    1984-11-01T23:59:59.000Z

    Pepco's $250,000 worth of computer-graphics equipment has let the utility produce 60 to 100 graphs a day, for everyone from engineers to executives. The types and uses of computer graphics equipment are discussed.

  1. Drawing symmetric planar graphs

    E-Print Network [OSTI]

    Meric, Burak Necati

    1998-01-01T23:59:59.000Z

    16 17 19 20 21 22 23 24 25 26 A drawing generated by repeating graphs. Generation of the drawing with the unit cell. Calculation of the converted lines. Rectangular unit cell for hexagonal groups. Construction ofhexagonal cells by using... of pixels requires much computer memories and much powerful processors. Figure 1. A drawing generated by repeating graphs. Drawing uses an object-oriented point of view. In drawing, patterns are created as a collection of objects such as points, lines...

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

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

  7. Densities in graphs and matroids

    E-Print Network [OSTI]

    Kannan, Lavanya

    2009-05-15T23:59:59.000Z

    Certain graphs can be described by the distribution of the edges in its subgraphs. For example, a cycle C is a graph that satisfies |E(H)| |V (H)| < |E(C)| |V (C)| = 1 for all non-trivial subgraphs of C. Similarly, a tree T is a graph that satisfies...

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

  9. Spectral fluctuations of quantum graphs

    SciTech Connect (OSTI)

    Pluha?, Z. [Faculty of Mathematics and Physics, Charles University, 180 00 Praha 8 (Czech Republic); Weidenmüller, H. A. [Max-Planck-Institut für Kernphysik, 69029 Heidelberg (Germany)

    2014-10-15T23:59:59.000Z

    We prove the Bohigas-Giannoni-Schmit conjecture in its most general form for completely connected simple graphs with incommensurate bond lengths. We show that for graphs that are classically mixing (i.e., graphs for which the spectrum of the classical Perron-Frobenius operator possesses a finite gap), the generating functions for all (P,Q) correlation functions for both closed and open graphs coincide (in the limit of infinite graph size) with the corresponding expressions of random-matrix theory, both for orthogonal and for unitary symmetry.

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

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

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

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

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

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

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

  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. The graph bottleneck identity

    E-Print Network [OSTI]

    Chebotarev, Pavel

    2010-01-01T23:59:59.000Z

    A matrix $S=(s_{ij})_{n\\times n}$ is said to determine a \\emph{transitional measure} for a digraph $\\Gamma$ on $n$ vertices if for all $i,j,k\\in\\{1,...,n\\},$ the \\emph{transition inequality} $s_{ij}s_{jk}\\le s_{ik}s_{jj}$ holds and reduces to the equality (called the \\emph{graph bottleneck identity}) if and only if every path in $\\Gamma$ from $i$ to $k$ contains $j$. We show that every positive transitional measure produces a distance by means of a logarithmic transformation. Moreover, the resulting distance $d(\\cdot,\\cdot)$ is \\emph{graph-geodetic}, that is, $d(i,j)+d(j,k)=d(i,k)$ holds if and only if every path from $i$ to $k$ contains $j$. Five types of matrices that determine transitional measures for a strong digraph are considered, namely, the matrices of path weights, connection reliabilities, route weights, and the weights of in-forests and out-forests. The results obtained have undirected counterparts. In [P. Chebotarev, A family of graph distances generalizing both the shortest-path and the resistan...

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

  1. Random rectangular Graphs

    E-Print Network [OSTI]

    Estrada, Ernesto

    2015-01-01T23:59:59.000Z

    A generalization of the random geometric graph (RGG) model is proposed by considering a set of points uniformly and independently distributed on a rectangle of unit area instead of on a unit square \\left[0,1\\right]^{2}. The topological properties, such as connectivity, average degree, average path length and clustering, of the random rectangular graphs (RRGs) generated by this model are then studied as a function of the rectangle sides lengths a and b=1/a, and the radius r used to connect the nodes. When a=1 we recover the RGG, and when a\\rightarrow\\infty the very elongated rectangle generated resembles a one-dimensional RGG. We provided computational and analytical evidence that the topological properties of the RRG differ significantly from those of the RGG. The connectivity of the RRG depends not only on the number of nodes as in the case of the RGG, but also on the side length of the rectangle. As the rectangle is more elongated the critical radius for connectivity increases following first a power-law an...

  2. GRAPH III: a digitizing and graph plotting program

    SciTech Connect (OSTI)

    Selleck, C.B.

    1986-03-01T23:59:59.000Z

    GRAPH is an interactive program that allows the user to perform two functions. The first is to plot two dimensional graphs and the second is to digitize graphs or plots to create data files of points. The program is designed to allow the user to get results quickly and easily. It is written in RATIV (a FORTRAN preprocessor) and is currently in use at Sandia under VMS on a VAX computer and CTSS on a Cray supercomputer. The program provides graphical output through all of the Sandia Virtual Device Interface (VDI) graphics devices. 2 refs., 3 figs., 3 tabs.

  3. Tools for Large Graph Mining Deepayan Chakrabarti

    E-Print Network [OSTI]

    Tools for Large Graph Mining by Deepayan Chakrabarti Submitted to the Center for Automated Learning computer networks to sociology, biology, ecology and many more. How do such "normal" graphs look like? How-graph, which can be both weighted or unweighted. · Ecology: Food webs are self-graphs with each node

  4. Contagious Sets in Random Graphs Uriel Feige

    E-Print Network [OSTI]

    Contagious Sets in Random Graphs Uriel Feige Michael Krivelevich Daniel Reichman August 10, 2014. A contagious set is a set whose activation results with the entire graph being active. Given a graph G, let m(G, 2) be the minimal size of a contagious set. We consider the binomial random graph G := G(n, p

  5. GRAPH THEORY STUDY GUIDE 1. Definitions

    E-Print Network [OSTI]

    Cooper, Joshua N.

    GRAPH THEORY STUDY GUIDE 1. Definitions Definition 1 (Partition of A). A set A = A1, ..., Ak. Definition 2 (Vertex set). The set of vertices in a graph denoted by V (G). Definition 3 (Edge set). The set of edges in a graph denoted by E(G). Definition 4 (Order). the number of vertices of a graph G written |G

  6. A Study on Set-Graphs

    E-Print Network [OSTI]

    Johan Kok; K. P. Chithra; N. K. Sudev; C. Susanth

    2015-04-09T23:59:59.000Z

    A \\textit{primitive hole} of a graph $G$ is a cycle of length $3$ in $G$. The number of primitive holes in a given graph $G$ is called the primitive hole number of that graph $G$. The primitive degree of a vertex $v$ of a given graph $G$ is the number of primitive holes incident on the vertex $v$. In this paper, we introduce the notion of set-graphs and study the properties and characteristics of set-graphs. We also check the primitive hole number and primitive degree of set-graphs. Interesting introductory results on the nature of order of set-graphs, degree of the vertices corresponding to subsets of equal cardinality, the number of largest complete subgraphs in a set-graph etc. are discussed in this study. A recursive formula to determine the primitive hole number of a set-graph is also derived in this paper.

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

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

  10. Summing tree graphs at threshold

    SciTech Connect (OSTI)

    Brown, L.S. (Department of Physics, FM-15, University of Washington, Seattle, Washington 98195 (United States))

    1992-11-15T23:59:59.000Z

    The solution of the classical field equation generates the sum of all tree graphs. We show that the classical equation reduces to an easily solved ordinary differential equation for certain multiparticle threshold amplitudes and compute these amplitudes.

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

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

  13. 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-Tropsch that the common Fischer-Tropsch (FT) catalysts are nickel, cobalt and iron. Nickel is considered to be active recognize that others have used various combinations of metals for Fischer-Tropsch Synthesis (FTS

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

  15. Polynomials associated with graph coloring and orientations

    E-Print Network [OSTI]

    Humpert, Brandon Eugene

    2011-04-26T23:59:59.000Z

    We study colorings and orientations of graphs in two related contexts. Firstly, we generalize Stanley's chromatic symmetric function using the k-balanced colorings of Pretzel to create a new graph invariant. We show that ...

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

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

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

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

  1. ALGORITHMS FOR EMBEDDING GRAPHS IN BOOKS

    E-Print Network [OSTI]

    North Carolina at Chapel Hill, University of

    investigate the problem ol embedding graphs in boob. A book is some number or half- planes (the page

  2. On semidefinite programming bounds for graph bandwidth

    E-Print Network [OSTI]

    Etienne De Klerk

    2011-06-06T23:59:59.000Z

    Jun 6, 2011 ... Keywords: Graph bandwidth, cyclic bandwidth, semidefinite programming, quadratic assignment problem. Category 1: Linear, Cone and ...

  3. Minimal Spanning Trees with Conflict Graphs

    E-Print Network [OSTI]

    symmetric conflict relations by means of an undirected conflict graph, where ..... International Symposium on Mathematical Foundations of Computer. Science ...

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

  5. Effecting Parallel Graph Eigensolvers Through Library Composition

    E-Print Network [OSTI]

    Lumsdaine, Andrew

    is not possible in general. Conventional linear algebra libraries cannot operate on graph data types. Likewise exploitation of this duality. Graph libraries and matrix libraries use different data types, and despiteEffecting Parallel Graph Eigensolvers Through Library Composition Alex Breuer, Peter Gottschling

  6. Graph Decompositions and Secret Sharing Schemes 1

    E-Print Network [OSTI]

    Stinson, Douglas

    Graph Decompositions and Secret Sharing Schemes 1 C. Blundo and A. De Santis Dipartimento di In this paper, we continue a study of secret sharing schemes for access structures based on graphs. Given a graph G, we require that a subset of participants can compute a secret key if they contain an edge of G

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

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

    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: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645U.S. DOE Office511041cloth DocumentationProductsAlternative FuelsSanta3 TableimpurityAppeals8I.1,,Attachment A:

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

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

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

  12. ATTACHMENT

    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: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645 3,625 1,006 492 742Energy China 2015ofDepartmentDepartment of2 of 5) ALARA TrainingANDREW (1, 2015 8:00AM

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

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

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

  16. DNA attachment to support structures

    DOE Patents [OSTI]

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

    2002-01-01T23:59:59.000Z

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

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

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

    E-Print Network [OSTI]

    Rostislav Grigorchuk; Paul-Henry Leemann; Tatiana Nagnibeda

    2015-05-05T23: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$.

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

  20. On graphs whose Laplacian matrix's multipartite separability is invariant under graph isomorphism

    E-Print Network [OSTI]

    Chai Wah Wu

    2009-06-04T23:59:59.000Z

    Normalized Laplacian matrices of graphs have recently been studied in the context of quantum mechanics as density matrices of quantum systems. Of particular interest is the relationship between quantum physical properties of the density matrix and the graph theoretical properties of the underlying graph. One important aspect of density matrices is their entanglement properties, which are responsible for many nonintuitive physical phenomena. The entanglement property of normalized Laplacian matrices is in general not invariant under graph isomorphism. In recent papers, graphs were identified whose entanglement and separability properties are invariant under isomorphism. The purpose of this note is to characterize the set of graphs whose separability is invariant under graph isomorphism. In particular, we show that this set consists of $K_{2,2}$, $\\overline{K_{2,2}}$ and all complete graphs.

  1. A Feasible Graph Partition Framework for Random Walks Implemented by Parallel Computing in Big Graph

    E-Print Network [OSTI]

    Liu, Xiaoming; Guan, Xiaohong

    2015-01-01T23:59:59.000Z

    Graph partition is a fundamental problem of parallel computing for big graph data. Many graph partition algorithms have been proposed to solve the problem in various applications, such as matrix computations and PageRank, etc., but none has pay attention to random walks. Random walks is a widely used method to explore graph structure in lots of fields. The challenges of graph partition for random walks include the large number of times of communication between partitions, lots of replications of the vertices, unbalanced partition, etc. In this paper, we propose a feasible graph partition framework for random walks implemented by parallel computing in big graph. The framework is based on two optimization functions to reduce the bandwidth, memory and storage cost in the condition that the load balance is guaranteed. In this framework, several greedy graph partition algorithms are proposed. We also propose five metrics from different perspectives to evaluate the performance of these algorithms. By running the al...

  2. Multipartite separability of Laplacian matrices of graphs

    E-Print Network [OSTI]

    Chai Wah Wu

    2008-09-04T23:59:59.000Z

    Recently, Braunstein et al. [1] introduced normalized Laplacian matrices of graphs as density matrices in quantum mechanics and studied the relationships between quantum physical properties and graph theoretical properties of the underlying graphs. We provide further results on the multipartite separability of Laplacian matrices of graphs. In particular, we identify complete bipartite graphs whose normalized Laplacian matrix is multipartite entangled under any vertex labeling. Furthermore, we give conditions on the vertex degrees such that there is a vertex labeling under which the normalized Laplacian matrix is entangled. These results address an open question raised in [1]. Finally, we extend some of the results in [1,2] to the multipartite case and show that the Laplacian matrix of any product of graphs (strong, Cartesian, tensor, categorical, etc.) is multipartite separable.

  3. Median graph shift: A new clustering algorithm for graph domain Salim Jouili, Salvatore Tabbone

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    and a comparison with the well-known Kmeans algorithm is provided. I. INTRODUCTION Graphs give a universal

  4. Discussiones Mathematicae Graph Theory 34 (2014) 287307

    E-Print Network [OSTI]

    Al Hanbali, Ahmad

    2014-01-01T23:59:59.000Z

    FOR TRACEABILITY OF BLOCK-CHAINS Binlong Lia,b1, Hajo Broersmab and Shenggui Zhanga2 a Department of Applied at least n-1 in G. A block-chain is a graph whose block graph is a path, i.e., it is either a P1, P2, every traceable graph is a block-chain, but the reverse does not hold. In this paper we characterize all

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

    E-Print Network [OSTI]

    Wismath, Stephen

    reality environment such as a CAVE, or · printed as a physical model with a 3D printer. Early studies3D 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

  6. Spectral statistics of nearly unidirectional quantum graphs

    E-Print Network [OSTI]

    Maram Akila; Boris Gutkin

    2015-03-04T23:59:59.000Z

    The energy levels of a quantum graph with time reversal symmetry and unidirectional classical dynamics are doubly degenerate and obey the spectral statistics of the Gaussian Unitary Ensemble. These degeneracies, however, are lifted when the unidirectionality is broken in one of the graph's vertices by a singular perturbation. Based on a Random Matrix model we derive an analytic expression for the nearest neighbour distribution between energy levels of such systems. As we demonstrate the result agrees excellently with the actual statistics for graphs with a uniform distribution of eigenfunctions. Yet, it exhibits quite substantial deviations for classes of graphs which show strong scarring.

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

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

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

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

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

  12. Operational Equivalence of Graph Transformation Systems

    E-Print Network [OSTI]

    Sarna-Starosta, Beata

    Operational Equivalence of Graph Transformation Systems Frank Raiser and Thom Fr¨uhwirth Faculty. With the growing number of GTS- based applications the comparison of operational equivalence of two GTS becomes an important area of research. This work introduces a notion of operational equivalence for graph

  13. On terminal deltawye reducibility of planar graphs

    E-Print Network [OSTI]

    Sagols, Feliú

    On terminal delta­wye reducibility of planar graphs Isidoro Gitler1 Feli´u Sagols2 Departamento de´exico City, D.F. igitler@math.cinvestav.mx fsagols@math.cinvestav.mx Abstract A graph is terminal - Y -reducible if it can be reduced to a set of terminal vertices by a sequence of series-parallel reductions

  14. A COLUMN GENERATION APPROACH FOR GRAPH COLORING

    E-Print Network [OSTI]

    Grossmann, Ignacio E.

    set in the graph). We use a column generation method for implicit optimization of the linear program based on an integer programming formulation of the graph coloring problem. This formulation, called is an assignment of labels to each vertex such that the endpoints of any edge have different labels. A minimum

  15. A Count of Classical Field Theory Graphs

    E-Print Network [OSTI]

    Gordon Chalmers

    2005-07-28T23:59:59.000Z

    A generating function is derived that counts the number of diagrams in an arbitrary scalar field theory. The number of graphs containing any number $n_j$ of $j$-point vertices is given. The count is also used to obtain the number of classical graphs in gauge theory and gravity.

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

  17. Clustering attributed graphs: models, measures and methods

    E-Print Network [OSTI]

    Bothorel, Cecile; Magnani, Matteo; Micenkova, Barbora

    2015-01-01T23:59:59.000Z

    Clustering a graph, i.e., assigning its nodes to groups, is an important operation whose best known application is the discovery of communities in social networks. Graph clustering and community detection have traditionally focused on graphs without attributes, with the notable exception of edge weights. However, these models only provide a partial representation of real social systems, that are thus often described using node attributes, representing features of the actors, and edge attributes, representing different kinds of relationships among them. We refer to these models as attributed graphs. Consequently, existing graph clustering methods have been recently extended to deal with node and edge attributes. This article is a literature survey on this topic, organizing and presenting recent research results in a uniform way, characterizing the main existing clustering methods and highlighting their conceptual differences. We also cover the important topic of clustering evaluation and identify current open ...

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

  19. Information seeking in attachment style romantic relationships 

    E-Print Network [OSTI]

    Derrick, Jaye Lindsay

    2013-02-22T23:59:59.000Z

    This study examined how a person's attachment style affects the type of information he or she is attuned to within a relationship. Specifically, this study assessed whether an individual is more likely to search for positive or negative information...

  20. Bonneville Power Administration Attachment P Oversupply Management...

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

    following: i. With respect to contracts for the sale of all or part of a facility's output executed on or before March 6, 2012 - Bonneville Power Administration Attachment P...

  1. Adult attachment style and romantic lovestyle orientation 

    E-Print Network [OSTI]

    Gordon, Melanie Nadine

    1990-01-01T23:59:59.000Z

    ADULT ATTACHMENT STYLE AND ROMANTIC LOVESTYLE ORIENTATION A Thesis by MELANIE NADINE GORDON Submitted to the Office of Graduate Studies of Texas A&M University in partial fulfillment of the requirements for the degree of MASTER OF SCIENCE... August 1990 Major Subject: Psychology ADULT ATTACHMENT STYLE AND ROMANTIC LOVESTYLE ORIENTATION A Thesis by MELANIE NADINE GORDON Approved as to style and content by: ry Sxmp on (Ch irido Committee) Sta~ (M mber / Do gla Pal r Me er) Steph...

  2. AUAARHUS UNIVERSITY Adding of attachments Financial Control

    E-Print Network [OSTI]

    , and the picture file from this scan must be saved (on a PC or server) before the file is added to the expense sheet. Important: Attachments must be saved in PDF or TIF format. If the attachment is not added in one address or save the picture file on your PC or a server. Open the file and save it on your PC #12;AUAARHUS

  3. Microsoft Word - Alcoa Extension EBT ROD Attachments - 2010-10...

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

    Analysis ... 16 Attachment F 2012 BPA Rate Case Customer Workshop - AURORA, September 14, 2010 ......

  4. Microsoft Word - Alcoa Extension EBT ROD Attachments - 2010-10...

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

    Analysis ... 7 Attachment D 2012 BPA Rate Case Customer Workshop - AURORA, September 14, 2010 ......

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

  6. Vienna Graph Template Library Version 1.0

    E-Print Network [OSTI]

    Neumaier, Arnold

    .1 Vienna Graph Template Library Modules Here is a list of all modules: Classes and types for external useVienna Graph Template Library Version 1.0 Reference Manual Hermann Schichl University of Vienna.2.14 #12;CONTENTS 1 Contents 1 Introduction 1 2 Vienna Graph Template Library Module Index 2 3 Vienna Graph

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

  8. Graph partitioning advance clustering technique

    E-Print Network [OSTI]

    Madhulatha, T Soni

    2012-01-01T23:59:59.000Z

    Clustering is a common technique for statistical data analysis, Clustering is the process of grouping the data into classes or clusters so that objects within a cluster have high similarity in comparison to one another, but are very dissimilar to objects in other clusters. Dissimilarities are assessed based on the attribute values describing the objects. Often, distance measures are used. Clustering is an unsupervised learning technique, where interesting patterns and structures can be found directly from very large data sets with little or none of the background knowledge. This paper also considers the partitioning of m-dimensional lattice graphs using Fiedler's approach, which requires the determination of the eigenvector belonging to the second smallest Eigenvalue of the Laplacian with K-means partitioning algorithm.

  9. A role for matrices in graph theory

    E-Print Network [OSTI]

    McLean, John Patrick

    1971-01-01T23:59:59.000Z

    Theory are well established areas in mathematics, much remains to be done in the standardization of notation and conventions. Thus we begin by defining terms to be used in this Thesis. 1. ) ~Gh 1'h By the directed graph G(X, r), or simply G, we mean... directed graph is said to be stronglb connected if for each pair of vertices x and x. , there is a path from xi to x ~ If Z is a subset of X and TZ is the subfunction of I' from Z into Z, then G'(Z, "Z) is a subgz'aph of G. The bi-partite graph G(X, Y...

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

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

  12. Werner Trobin, May 26, 2004 The Boost Graph Library -p. 1/48 The Boost Graph Library

    E-Print Network [OSTI]

    Werner Trobin, May 26, 2004 The Boost Graph Library - p. 1/48 The Boost Graph Library Generic Library Design Werner Trobin #12;Introduction The Boost Graph Library Demo References Werner Trobin, May 26, 2004 The Boost Graph Library - p. 2/48 Outline I Introduction to Boost I The Boost

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

  14. On semidefinite programming bounds for graph bandwidth

    E-Print Network [OSTI]

    2011-05-24T23:59:59.000Z

    May 24, 2011 ... the rectangular grid graph Pn × Pm (i.e. the Cartesian product of the paths Pn and Pm) is min{n, m} [6] ...... Ars Combinatoria, 47:147-152, 1997.

  15. Constant time algorithms in sparse graph model

    E-Print Network [OSTI]

    Nguyen, Huy Ngoc, Ph. D. Massachusetts Institute of Technology

    2010-01-01T23:59:59.000Z

    We focus on constant-time algorithms for graph problems in bounded degree model. We introduce several techniques to design constant-time approximation algorithms for problems such as Vertex Cover, Maximum Matching, Maximum ...

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

  17. Support graph preconditioners for sparse linear systems

    E-Print Network [OSTI]

    Gupta, Radhika

    2005-02-17T23:59:59.000Z

    . In this thesis, we develop support graph preconditioners for symmetric positive de?nite matrices that arise from the ?nite element discretization of elliptic partial di?erential equations. An object oriented code is developed for the construction, integration...

  18. Fault-tolerant dynamic task graph scheduling

    SciTech Connect (OSTI)

    Kurt, Mehmet C.; Krishnamoorthy, Sriram; Agrawal, Kunal; Agrawal, Gagan

    2014-11-16T23:59:59.000Z

    In this paper, we present an approach to fault tolerant execution of dynamic task graphs scheduled using work stealing. In particular, we focus on selective and localized recovery of tasks in the presence of soft faults. We elicit from the user the basic task graph structure in terms of successor and predecessor relationships. The work stealing-based algorithm to schedule such a task graph is augmented to enable recovery when the data and meta-data associated with a task get corrupted. We use this redundancy, and the knowledge of the task graph structure, to selectively recover from faults with low space and time overheads. We show that the fault tolerant design retains the essential properties of the underlying work stealing-based task scheduling algorithm, and that the fault tolerant execution is asymptotically optimal when task re-execution is taken into account. Experimental evaluation demonstrates the low cost of recovery under various fault scenarios.

  19. Projective representations from quantum enhanced graph symmetries

    E-Print Network [OSTI]

    2015-03-11T23:59:59.000Z

    Presently, we will label the edges of a graph by elements of a group ...... (a) Read off the matrix ? by putting the G label of a vertex onto the diagonal in the place.

  20. Continuous Time Group Discovery in Dynamic Graphs

    SciTech Connect (OSTI)

    Miller, K; Eliassi-Rad, T

    2010-11-04T23:59:59.000Z

    With the rise in availability and importance of graphs and networks, it has become increasingly important to have good models to describe their behavior. While much work has focused on modeling static graphs, we focus on group discovery in dynamic graphs. We adapt a dynamic extension of Latent Dirichlet Allocation to this task and demonstrate good performance on two datasets. Modeling relational data has become increasingly important in recent years. Much work has focused on static graphs - that is fixed graphs at a single point in time. Here we focus on the problem of modeling dynamic (i.e. time-evolving) graphs. We propose a scalable Bayesian approach for community discovery in dynamic graphs. Our approach is based on extensions of Latent Dirichlet Allocation (LDA). LDA is a latent variable model for topic modeling in text corpora. It was extended to deal with topic changes in discrete time and later in continuous time. These models were referred to as the discrete Dynamic Topic Model (dDTM) and the continuous Dynamic Topic Model (cDTM), respectively. When adapting these models to graphs, we take our inspiration from LDA-G and SSN-LDA, applications of LDA to static graphs that have been shown to effectively factor out community structure to explain link patterns in graphs. In this paper, we demonstrate how to adapt and apply the cDTM to the task of finding communities in dynamic networks. We use link prediction to measure the quality of the discovered community structure and apply it to two different relational datasets - DBLP author-keyword and CAIDA autonomous systems relationships. We also discuss a parallel implementation of this approach using Hadoop. In Section 2, we review LDA and LDA-G. In Section 3, we review the cDTM and introduce cDTMG, its adaptation to modeling dynamic graphs. We discuss inference for the cDTM-G and details of our parallel implementation in Section 4 and present its performance on two datasets in Section 5 before concluding in Section 6.

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

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

  3. Graphs of subgroups of free groups

    E-Print Network [OSTI]

    Louder, Larsen

    2009-01-01T23:59:59.000Z

    We construct an efficient model for graphs of finitely generated subgroups of free groups. Using this we give a very short proof of Dicks's reformulation of the strengthened Hanna Neumann Conjecture as the Amalgamated Graph Conjecture. In addition, we answer a question of Culler and Shalen on ranks of intersections in free groups. The latter has also been done independently by R. P. Kent IV.

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

  5. Intro Algo ring Arbitrary graphs Conclusion PING PONG IN DANGEROUS GRAPHS

    E-Print Network [OSTI]

    Fondements et Applications, Université Paris 7

    Intro Algo ring Arbitrary graphs Conclusion PING PONG IN DANGEROUS GRAPHS Optimal Black Hole Search blocking and destroying any mobile agent entering it. Motivations : Site which is destroyed or dangerous blocking and destroying any mobile agent entering it. Motivations : Site which is destroyed or dangerous

  6. ATTACHMENT 1 Export Control Decision Tree 1

    E-Print Network [OSTI]

    Howitt, Ivan

    ATTACHMENT 1 Export Control Decision Tree 1 for Travel or Shipping to Foreign Countries or Sharing Information with Foreign Nationals United States export controls exist to protect the national security and foreign policy interests of this country. Export controls govern the shipment, transmission, or transfer

  7. Neural network architectures for Prepositional Phrase attachment disambiguation

    E-Print Network [OSTI]

    Belinkov, Yonatan

    2014-01-01T23:59:59.000Z

    This thesis addresses the problem of Prepositional Phrase (PP) attachment disambiguation, a key challenge in syntactic parsing. In natural language sentences, a PP may often be attached to several possible candidates. While ...

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

    National Nuclear Security Administration (NNSA)

    for Department of Homeland Security A018 032907 DOE O 522.1, Attachment 2 CRD 110304 Pricing of Departmental Materials and Services DOE O 534.1B, Attachment 1 CRD 010603...

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

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

  11. Photoswitchable method for the ordered attachment of proteins to surfaces

    DOE Patents [OSTI]

    Camarero, Julio A. (Livermore, CA); DeYoreo, James J. (Clayton, CA); Kwon, Youngeun (Livermore, CA)

    2011-07-05T23:59:59.000Z

    Described herein is a method for the attachment of proteins to any solid support with control over the orientation of the attachment. The method is extremely efficient, not requiring the previous purification of the protein to be attached, and can be activated by UV-light. Spatially addressable arrays of multiple protein components can be generated by using standard photolithographic techniques.

  12. A New Combinatorial Approach for Sparse Graph Problems

    E-Print Network [OSTI]

    Blelloch, Guy E.

    A New Combinatorial Approach for Sparse Graph Problems Guy E. Blelloch, Virginia Vassilevska- totic improvement over O(mn) for all pairs least common ancestors on directed acyclic graphs. 1

  13. Outline of the talk Statistics on Graphs, Exponential Formula and

    E-Print Network [OSTI]

    Poinsot, Laurent

    Outline of the talk Statistics on Graphs, Exponential Formula and Combinatorial Physics G and Complexity" Laurent Poinsot Statistics on Graphs, Exponential Formula and Combinatorial Physics #12;Exponential Formula : Informal Version Ingredients for the exponential formula Partial commutative monoids

  14. On perfect codes in Cartesian product of graphs Michel Mollard

    E-Print Network [OSTI]

    Boyer, Edmond

    ] and others. The existence of perfect codes have also been proved in Towers of Hanoi graphs [6] and Sierpinski on the symmetric group Sn+1 thus are of order (n + 1)!. These families include star graphs, for which the existence

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

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

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

  18. Scalable Parallel Algorithms for Massive Scale-free Graphs

    E-Print Network [OSTI]

    Pearce, Roger Allan

    2013-12-05T23:59:59.000Z

    , distributed, and external memory. This dissertation develops new techniques to parallelize the storage, computation, and communication for scale-free graphs with high-degree vertices. Our work facilitates the processing of large real-world graph datasets...

  19. Scalable Parallel Algorithms for Massive Scale-free Graphs 

    E-Print Network [OSTI]

    Pearce, Roger Allan

    2013-12-05T23:59:59.000Z

    , distributed, and external memory. This dissertation develops new techniques to parallelize the storage, computation, and communication for scale-free graphs with high-degree vertices. Our work facilitates the processing of large real-world graph datasets...

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

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

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

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

  4. The power graph of a group Peter J. Cameron

    E-Print Network [OSTI]

    Burton, Geoffrey R.

    ; graphs are much looser. For example, there are only five different groups with eight elementsThe power graph of a group Peter J. Cameron Queen Mary, University of London LTCC Open Day, 8 January 2010 Groups and graphs A group is an algebraic structure: a set with a bi- nary operation

  5. VGTL (Vienna Graph Template Library) Version 1.1

    E-Print Network [OSTI]

    Schichl, Hermann

    .1 Vienna Graph Template Library Modules Here is a list of all modules: Classes and types for external useVGTL (Vienna Graph Template Library) Version 1.1 Reference Manual Hermann Schichl University June 2003 #12;CONTENTS 1 Contents 1 Introduction 1 2 Vienna Graph Template Library Module Index 2 3

  6. Mining Closed Relational Graphs with Connectivity Constraints X. Jasmine Zhou

    E-Print Network [OSTI]

    Zhou, Xianghong Jasmine

    Mining Closed Relational Graphs with Connectivity Constraints Xifeng Yan X. Jasmine Zhou Jiawei Han relational graphs, how to mine frequent highly connected subgraphs from it? ... G1 G2 Gn pattern Figure 1. Mining Massive Relational Graphs This new problem setting has three major characteristics different from

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

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

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

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

  11. Periodic schedules for Unitary Timed Weighted Event Graphs

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    Event Graph model (TEG also called marked graphs [5]) and dataflow graphs, oftenly used in the computer questions are polynomially solved for ordinary TEG [1], [5], [6], [8]. In particular, it has been shown that if a TEG is live, there always exists a periodic schedule with the optimal throughput (i.e. with the same

  12. Problems of Distance-Regular Graphs Hiroshi Suzuki

    E-Print Network [OSTI]

    Xi, Changchang

    ­328. [14] H. Suzuki, The Terwilliger algebra associated with a set of vertices in a distance-regular graph, J. Alg. Combin. 22 (2005), 5-38. [15] P. Terwilliger, Distance-regular graphs and (s, c, a, k)-graphs, J. Combin. Th. (B) 34 (1983), 151­164. [16] P. Terwilliger, A new inequality for distance

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

  14. Mass and fans in attached sunspaces

    SciTech Connect (OSTI)

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

    1982-01-01T23:59:59.000Z

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

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

    E-Print Network [OSTI]

    Walter, Uta M.; Petr, Chris

    2004-06-01T23:59:59.000Z

    Best Practices in Children’s Mental Health: A Series of Reports Summarizing the Empirical Research on Selected Topics Report #11 “Reactive Attachment Disorder: Concepts, Treatment and Research” June, 2004... Healthcare” Report #8 – October 2003, “Best Practices in Therapeutic Foster Care: Review of the Literature and Local Practices in the State of Kansas” Report #9 – December 2003, “Juveniles with Sexual Offending Behaviors” Report #10-February 2004...

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

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

  18. StreamWorks - A system for Dynamic Graph Search

    SciTech Connect (OSTI)

    Choudhury, Sutanay; Holder, Larry; Chin, George; Ray, Abhik; Beus, Sherman J.; Feo, John T.

    2013-06-11T23:59:59.000Z

    Acting on time-critical events by processing ever growing social media, news or cyber data streams is a major technical challenge. Many of these data sources can be modeled as multi-relational graphs. Mining and searching for subgraph patterns in a continuous setting requires an efficient approach to incremental graph search. The goal of our work is to enable real-time search capabilities for graph databases. This demonstration will present a dynamic graph query system that leverages the structural and semantic characteristics of the underlying multi-relational graph.

  19. Generalized Domination in Graphs with Applications in Wireless Networks

    E-Print Network [OSTI]

    Sung, Je Sang

    2013-12-10T23:59:59.000Z

    ]. Throughout this dissertation, we consider a finite, simple, undirected graph which is denoted by G = (V,E) where V = {1, 2, . . . , n} and (i, j) ? E when vertices i and j are joined by an edge with |E| = m. Order and size of a graph is the number of vertices... vertices. This definition also applies to a complete graph. Menger’s theorem [79] is a basic result of connectivity in finite undirected graph. The vertex-connectivity version of Menger’s theorem for a finite undirected graph G = (V,E) is the following...

  20. Spectral statistics for scaling quantum graphs

    E-Print Network [OSTI]

    Yu. Dabaghian

    2006-08-09T23:59:59.000Z

    The explicit solution to the spectral problem of quantum graphs is used to obtain the exact distributions of several spectral statistics, such as the oscillations of the quantum momentum eigenvalues around the average, $\\delta k_{n}=k_{n}-\\bar k_{n}$, and the nearest neighbor separations, $s_{n}=k_{n}-k_{n-1}$.

  1. Graph-Theoretic Connectivity Control of Mobile

    E-Print Network [OSTI]

    Pappas, George J.

    ]­[23]. This research has given rise to connectivity or topology control algorithms that regulate the transmission powerINVITED P A P E R Graph-Theoretic Connectivity Control of Mobile Robot Networks This paper develops an analysis for groups of vehicles connected by a communication network; control laws are formulated

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

  3. Quantum secret sharing with qudit graph states

    SciTech Connect (OSTI)

    Keet, Adrian; Fortescue, Ben; Sanders, Barry C. [Institute for Quantum Information Science, University of Calgary, Alberta, T2N 1N4 (Canada); Markham, Damian [LTCI-CNRS, Telecom ParisTech, 37/39 rue Dareau, F-75014 Paris (France)

    2010-12-15T23:59:59.000Z

    We present a unified formalism for threshold quantum secret sharing using graph states of systems with prime dimension. We construct protocols for three varieties of secret sharing: with classical and quantum secrets shared between parties over both classical and quantum channels.

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

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

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

  7. The influence of search engines on preferential attachment Alan Frieze

    E-Print Network [OSTI]

    Frieze, Alan

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

  8. Flash2006-54Attachment.rtf

    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 DataDepartment of Energy Your Density Isn't YourTransport inEnergy June 6-7, 2013Flash2005-56ATTACHMENT.pdfCORRECTIONITEM I -52.208-9

  9. Flash2007-02Attachment.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 DataDepartment of Energy Your Density Isn't YourTransport inEnergy June 6-7, 2013Flash2005-56ATTACHMENT.pdfCORRECTIONITEM I

  10. Flash2006-23Attachment.doc

    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 onYou are now leaving Energy.gov You are now leaving Energy.gov You are being directed offOCHCO2: FinalOffers New TrainingFlash2005-13.pdf56ATTACHMENT.pdf4.pdf Flash2006-14.pdfCORRECTION

  11. Flash2006-38Attachment.doc

    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 onYou are now leaving Energy.gov You are now leaving Energy.gov You are being directed offOCHCO2: FinalOffers New TrainingFlash2005-13.pdf56ATTACHMENT.pdf4.pdf

  12. Flash2006-42Attachment2.doc

    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 onYou are now leaving Energy.gov You are now leaving Energy.gov You are being directed offOCHCO2: FinalOffers New TrainingFlash2005-13.pdf56ATTACHMENT.pdf4.pdf.pdf1.6 Project Management

  13. Flash2006-45Attachment.doc

    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 onYou are now leaving Energy.gov You are now leaving Energy.gov You are being directed offOCHCO2: FinalOffers New TrainingFlash2005-13.pdf56ATTACHMENT.pdf4.pdf.pdf1.6 Project

  14. Flash2007-03Attachment.doc

    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 onYou are now leaving Energy.gov You are now leaving Energy.gov You are being directed offOCHCO2: FinalOffers New06-54Attachment.rtf&#0;8 Noncompetitive Financial Assistance a) It is

  15. EXHIBIT G7.0 Attachment 2

    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: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645U.S. DOEThe Bonneville Power AdministrationField Campaign:INEA :Work4/11 ENVIROISSUESEVALUATINGG7.0 Attachment 2 3/2014

  16. Attachments Energy Ratings Council | 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 DataDepartment of Energy Your Density Isn't Your Destiny: The FutureComments from Tarasa OPAMAttachment_Flash2010-71.pdfAttachments Energy

  17. Attachment C … Waste Analysis Plan

    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: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645 3,625 1,006 492 742 33 111 1,613Portsmouth SitePresentationsMarketing CorporationTechnicalDepartment ofAttachment CPLAN

  18. Attachments Energy Ratings Council | 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 onYouTube YouTube Note: Since the YouTube platform is alwaysISOSource HeatEnergy2).pdfAttachments Energy Ratings

  19. Microsoft Word - Attachment_P_2013.doc

    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: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645U.S. DOEThe Bonneville PowerCherries 82981-1cnHighandSWPA / SPRA / USACE SWPAURTeC:8 3. March 3, 20155-1 ATTACHMENT J.5P

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

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

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

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

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

    Office of Environmental Management (EM)

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

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

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

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

  9. Attachment 1: Overview of the Proposed Avista Deemer Settlement

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

    Attachment 1 Overview of the Proposed Avista Deemer Settlement January 28, 2009 I. Background Section 5(c) of the Northwest Power Act established the Residential Exchange Program...

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

  11. Crunching Large Graphs with Commodity Processors

    SciTech Connect (OSTI)

    Nelson, Jacob E.; Myers, Brandon D.; Hunter, Andrew H.; Briggs, Preston; Ceze, Luis; Ebeling, William C.; Grossman, Dan; Kahan, Simon H.; Oskin, Mark

    2011-05-26T23:59:59.000Z

    Crunching large graphs is the basis of many emerging appli- cations, such as social network analysis and bioinformatics. Graph analytics algorithms exhibit little locality and therefore present signi?cant performance challenges. Hardware multi- threading systems (e.g, Cray XMT) show that with enough concurrency, we can tolerate long latencies. Unfortunately, this solution is not available with commodity parts. Our goal is to develop a latency-tolerant system built out of commodity parts and mostly in software. The proposed system includes a runtime that supports a large number of lightweight contexts, full-bit synchronization and a memory manager that provides a high-latency but high-bandwidth global shared memory. This paper lays out the vision for our system, and justi?es its feasibility with a performance analysis of the run- time for latency tolerance.

  12. Local semicircle law for random regular graphs

    E-Print Network [OSTI]

    Roland Bauerschmidt; Antti Knowles; Horng-Tzer Yau

    2015-05-26T23:59:59.000Z

    We consider random $d$-regular graphs on $N$ vertices, with degree $d$ at least $(\\log N)^4$. We prove that the Green's function of the adjacency matrix and the Stieltjes transform of its empirical spectral measure are well approximated by Wigner's semicircle law, down to the optimal scale given by the typical eigenvalue spacing (up to a logarithmic correction). Aside from well-known consequences for the local eigenvalue distribution, this result implies the complete delocalization of all eigenvectors.

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

  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. Nodal Parity Invariants of Knotted Rigid Vertex Graphs

    E-Print Network [OSTI]

    Kauffman, Louis H

    2012-01-01T23:59:59.000Z

    This paper introduces new invariants of rigid vertex graph embeddings by using non-local combinatorial information that is available at each graphical node. The new non-local information that we use in this paper involves parity in the Gauss code of the underlying graph. We apply these methods to graphs in classical and virtual knot theory, and we give formulations for applications to the topology of protein folding.

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

    E-Print Network [OSTI]

    2012-08-28T23:59:59.000Z

    can be computed efficiently for larger graphs that have suitable algebraic symmetry. For a comparison of the SDP bounds for the GEP, see [45]. While the GEP is ...

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

  18. Journal Attachments New in PSoft 9.1 is the ability to attach supporting documentation directly into your GL Journal. Should

    E-Print Network [OSTI]

    Massachusetts at Amherst, University of

    it is posted. If you attach after it has been validated or posted you must remember to click on Save; otherwise an email save it as a HTML, txt, or PDF file. If it is something you don't already have electronically scan and save the document. The Attachment link is on the Journal Header Page; click on Attachments. Attach

  19. Dissociative electron attachment studies on acetone

    SciTech Connect (OSTI)

    Prabhudesai, Vaibhav S., E-mail: vaibhav@tifr.res.in; Tadsare, Vishvesh; Ghosh, Sanat; Gope, Krishnendu; Davis, Daly; Krishnakumar, E. [Tata Institute of Fundamental Research, Homi Bhabha Road, Colaba, Mumbai 400005 (India)

    2014-10-28T23:59:59.000Z

    Dissociative electron attachment (DEA) to acetone is studied in terms of the absolute cross section for various fragment channels in the electron energy range of 0–20 eV. H{sup ?} is found to be the most dominant fragment followed by O{sup ?} and OH{sup ?} with only one resonance peak between 8 and 9 eV. The DEA dynamics is studied by measuring the angular distribution and kinetic energy distribution of fragment anions using Velocity Slice Imaging technique. The kinetic energy and angular distribution of H{sup ?} and O{sup ?} fragments suggest a many body break-up for the lone resonance observed. The ab initio calculations show that electron is captured in the multi-centered anti-bonding molecular orbital which would lead to a many body break-up of the resonance.

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

  1. Graph searching and a generalized parking function

    E-Print Network [OSTI]

    Kostic, Dimitrije Nenad

    2009-05-15T23:59:59.000Z

    sequence (a1,a2,...,an) of non-negative integers for which there exists a permutation pi ?Sn such that 0 ?api(i) ?i?1 for all indexes i. In other words, if we choose a permutation pi such that api(1) ?api(2) ? ...? api(n) then we have (api(1),api(2),...,api... if at the end of this process we have removed all vertices from consideration. More formally, Proposition 7. A vertex function is a G-parking function if and only if there exists an ordering pi(1),pi(2),...,pi(n) of the vertices of a graph G such that for every...

  2. 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 onYou are now leaving Energy.gov You are now leaving Energy.gov You are being directedAnnualProperty Edit withTianlin BaxinUmweltVillageGraph Home Wzeng's picture Submitted by Wzeng(50)

  3. Tables, Graphs, and Problems | ornl.gov

    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: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645U.S. DOE Office of ScienceandMesa del SolStrengthening a solidSynthesis of 2D Alloys &8-5070P3. U.S.7.Tables, Graphs,

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

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

  6. The Parallel BGL: A Generic Library for Distributed Graph Computations

    E-Print Network [OSTI]

    Lumsdaine, Andrew

    ] and written in a style similar to the C++ Standard Template Library (STL) [38, 46], 1 #12;data types providedThe Parallel BGL: A Generic Library for Distributed Graph Computations Douglas Gregor and Andrew,lums}@osl.iu.edu Abstract This paper presents the Parallel BGL, a generic C++ library for distributed graph computation

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

  8. EvoGraphDice : Interactive Evolution for Visual Analytics

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    EvoGraphDice : Interactive Evolution for Visual Analytics Waldo Cancino, Nadia Boukhelifa, especially in frameworks like industrial design, decision making and visual analytics. Interactive Evolution visualization based on scatterplot matrices. EvoGraphDice interactively evolves com- pound additional dimensions

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

    E-Print Network [OSTI]

    2013-11-26T23:59:59.000Z

    Page 1 ... Using what we call the Laplacian algebra of a graph, we ..... Let us now consider graphs with symmetry, and assume that the data matrices of .... constraints (16) and (17) (respectively) don't occur precisely because of the vanishing of.

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

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

  12. Math 304 Handout: Linear algebra, graphs, and networks.

    E-Print Network [OSTI]

    Anshelevich, Michael

    and adjacency matrices. 1 2. Word search 3 3. Ranking the web pages. 4 1. GRAPHS AND ADJACENCY MATRICES. · The World Wide Web is a directed graph, with web pages as vertices and links as edges. · Towns connected column corresponds to a web page, each row to a word, and each entry is 1 if a particular word occurs

  13. Analogical Representation and Graph Comprehension Aidan Feeney and Lara Webber

    E-Print Network [OSTI]

    comprehension make the assumption that viewers build up a wholly propositional description of the graph a scale of two different levels of a variable, one may extract information about the value of each level with the information presented in the graph. A is high on the scale B is low on the scale A is higher on the scale than

  14. The Generic Graph Component Library Dr. Dobb's Journal September 2000

    E-Print Network [OSTI]

    Lumsdaine, Andrew

    .nd.edu, and lumsg@lsc.nd.edu, respectively. The Standard Template Library has established a solid foundation generic programming has to offer. In January, 1999, we did a survey of existing graph libraries. Some.mpi-sb.mpg.de/LEDA/leda.html), the Graph Template Library (GTL) (by Michael Forster, Andreas Pick, and Marcus Raitner, http

  15. On the concurrent semantics of Algebraic Graph Grammars #

    E-Print Network [OSTI]

    Baldan, Paolo

    â??a di Pisa, Italy baldan@dsi.unive.it andrea@di.unipi.it Abstract. Graph grammars are a powerful model. These semantics have served as basis for the development of a variety of modelling and verification techniques graph transformation systems as an alternative model of concurrency, extending Petri nets. The basic

  16. Power Domination in Cylinders, Tori, and Generalized Petersen Graphs

    E-Print Network [OSTI]

    Ferrero, Daniela - Department of Mathematics, Texas State University

    of graphs by Haynes et al. in 2002 [7]. Indeed, an electrical power network can be modeled by a graph where for power system monitoring. The minimum cardi- nality of a PDS of G is its power domination number. INTRODUCTION Electric power companies need to monitor the state of their networks continually. The state

  17. Hierarchical Remote Sensing Image Analysis via Graph Laplacian Energy

    E-Print Network [OSTI]

    Zhou, Jun

    1 Hierarchical Remote Sensing Image Analysis via Graph Laplacian Energy Zhang Huigang, Bai Xiao for an efficient image description, which may cause increased computational complexity. In this paper, we propose a new hierarchical segmentation method that applies graph Laplacian energy as a generic measure

  18. SPATIAL POINT PROCESSES AND GRAPH BASED STATISTICAL FEATURES

    E-Print Network [OSTI]

    Jyväskylä, University of

    2010 2000 Mathematics Subject Classification. 60G55, 62-07, 62M30. ISSN 1457-9235 #12;SPATIAL POINT Classification. 60G55, 62-07, 62M30. 1 #12;Spatial point processes and graph based statistical features Tuomas library has been developed for the computation of the graph-based summaries. Keywords: Spatial point

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

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

  1. Scalability Analysis of Partitioning Strategies for Finite Element Graphs. \\Lambda

    E-Print Network [OSTI]

    Kumar, Vipin

    Scalability Analysis of Partitioning Strategies for Finite Element Graphs. \\Lambda Grama Y. Ananth Y. Grama ananth@cs:umn:edu Abstract Issues of partitioning Finite Element Graphs are central for implementing the Finite Element Method (FEM). Parallel formulations of finite element techniques require

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

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

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

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

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

  7. Albert R Meyer April 1, 2013 sexgraph.1 Graph Theory

    E-Print Network [OSTI]

    Meyer, Albert R.

    1 Albert R Meyer April 1, 2013 sexgraph.1 Graph Theory & Sex Albert R Meyer April 1, 2013 sexgraph women partners Albert R Meyer April 1, 2013 sexgraph.3 Sex in America: Men more Promiscuous? Studies this is nonsense Albert R Meyer April 1, 2013 sexgraph.4 M partners F Sex Partner Graph #12;2 Albert R Meyer April

  8. An Introduction to Game Trees Ross Casebolt --Graph Theory

    E-Print Network [OSTI]

    Laison, Josh

    Ross Casebolt -- Graph Theory Lobsters vs Caterpillars! #12;What is a game? Definition (Game) A game G Theory Lobsters vs Caterpillars! #12;What is a game? Definition (Game) A game G must satisfy Ross Casebolt -- Graph Theory Lobsters vs Caterpillars! #12;What is a game? Definition (Game) A game G

  9. Flash2008-44attachment.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 onYou are now leaving Energy.gov You are now leaving Energy.gov You are being directed offOCHCO2: FinalOffers New06-54Attachment.rtf&#0;88-44attachment.pdf Flash2008-44attachment.pdf

  10. 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: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645 3,625 1,006 492 742 33 1112011 Strategic Plan| Departmentof7.pdfATTACHMENT.pdfATTACHMENT.pdf Flash2006-02ATTACHMENT.pdf

  11. 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: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645 3,625 1,006 492 742 33 1112011 Strategic Plan| Departmentof7.pdfATTACHMENT.pdfATTACHMENT.pdfATTACHMENT.pdf

  12. 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: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645 3,625 1,006 492 742 33 1112011 Strategic Plan|.pdf3.pdf9attachment.pdf Flash2008-39attachment.pdf0.pdfAttachment.pdf

  13. International energy indicators. [Statistical tables and graphs

    SciTech Connect (OSTI)

    Bauer, E.K. (ed.)

    1980-05-01T23:59:59.000Z

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

  14. Noisy entanglement evolution for graph states

    E-Print Network [OSTI]

    L. Aolita; D. Cavalcanti; R. Chaves; C. Dhara; L. Davidovich; A. Acin

    2011-03-29T23:59:59.000Z

    A general method for the study of the entanglement evolution of graph states under the action of Pauli was recently proposed in [Cavalcanti, et al., Phys. Rev. Lett. 103, 030502 (2009)]. This method is based on lower and upper bounds on the entanglement of the entire state as a function only of the state of a considerably-smaller subsystem, which undergoes an effective noise process. This provides a huge simplification on the size of the matrices involved in the calculation of entanglement in these systems. In the present paper we elaborate on this method in details and generalize it to other natural situations not described by Pauli maps. Specifically, for Pauli maps we introduce an explicit formula for the characterization of the resulting effective noise. Beyond Pauli maps, we show that the same ideas can be applied to the case of thermal reservoirs at arbitrary temperature. In the latter case, we discuss how to optimize the bounds as a function of the noise strength. We illustrate our ideas with explicit exemplary results for several different graphs and particular decoherence processes. The limitations of the method are also discussed.

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

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

  17. Mindfulness and Attachment Security as Predictors of Sucess in Therapy

    E-Print Network [OSTI]

    Martin, David Matthew

    2012-08-31T23:59:59.000Z

    This work focuses on the role of mindfulness and attachment security as agents of change in successful therapy. Two studies were conducted to investigate the mechanisms underlying change that may lead to successful therapy - as reflected...

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

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

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

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

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

  3. Interactive Visualization of Genealogical Graphs Michael J. McGuffin Ravin Balakrishnan

    E-Print Network [OSTI]

    McGuffin, Michael J.

    Interactive Visualization of Genealogical Graphs Michael J. McGuffin Ravin Balakrishnan Department of visualizing "family trees", or genealogi- cal graphs, in 2D, is considered. A graph theoretic analysis is given, which identifies why genealogical graphs can be difficult to draw. This motivates some novel

  4. NPDA Transition Graphs To understand NPDAs, it is useful to have a visual representation. This

    E-Print Network [OSTI]

    Bylander, Tom

    NPDA Transition Graphs To understand NPDAs, it is useful to have a visual representation. This document introduces NPDA transition graphs. This type of graph extends the notation for DFA/NFA transition Edition, Addison-Wesley, 2001. In a DFA/NFA transition graph, there is an edge from vertex qi to vertex qj

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

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    by proposing a dual energy model for graphs containing uniquely negative edges, and combining it linearly

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

  7. The elliptic dilogarithm for the sunset graph

    E-Print Network [OSTI]

    Spencer Bloch; Pierre Vanhove

    2014-10-24T23:59:59.000Z

    We study the sunset graph defined as the scalar two-point self-energy at two-loop order. We evaluate the sunset integral for all identical internal masses in two dimensions. We give two calculations for the sunset amplitude; one based on an interpretation of the amplitude as an inhomogeneous solution of a classical Picard-Fuchs differential equation, and the other using arithmetic algebraic geometry, motivic cohomology, and Eisenstein series. Both methods use the rather special fact that the amplitude in this case is a family of periods associated to the universal family of elliptic curves over the modular curve X_1(6). We show that the integral is given by an elliptic dilogarithm evaluated at a sixth root of unity modulo periods. We explain as well how this elliptic dilogarithm value is related to the regulator of a class in the motivic cohomology of the universal elliptic family.

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

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

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

  11. Computing the stability number of a graph via semidefinite and ...

    E-Print Network [OSTI]

    2006-04-27T23:59:59.000Z

    then the vertices of G can be numbered so that E(G8) ? E(G ). Thus G8 is the smallest graph G such that ?(1)(G) > ?(G) = 3. We can extend the above reasoning ...

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

  13. Poster: -Graphs: Flexible Topology Control in Wireless Ad Hoc Networks

    E-Print Network [OSTI]

    Williamson, Carey

    Poster: -Graphs: Flexible Topology Control in Wireless Ad Hoc Networks Ashikur Rahman Department networks. Most algorithms strive to reduce energy consumption by cre- ating a sparse topology with few long of topologies and provides the flexibility to network

  14. The competition number of a graph with exactly two holes

    E-Print Network [OSTI]

    ] as a means of deter- mining the smallest dimension of ecological phase space. Since then, various variations to ecology, the concept of competition graph can be applied to a variety of fields, as summarized in [11

  15. The competition number of a graph with exactly two holes

    E-Print Network [OSTI]

    ] as a means of deter­ mining the smallest dimension of ecological phase space. Since then, various variations to ecology, the concept of competition graph can be applied to a variety of fields, as summarized in [11

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

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

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

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

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

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

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

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

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

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

  6. Finding structural anomalies in graphs by means of quantum walks

    SciTech Connect (OSTI)

    Feldman, Edgar [Department of Mathematics, Graduate Center of the City University of New York, 365 Fifth Avenue, New York, New York 10016 (United States); Hillery, Mark; Zheng, Hongjun [Department of Physics, Hunter College of the City University of New York, 695 Park Avenue, New York, New York 10021 (United States); Lee, Hai-Woong [Department of Physics, Korea Advanced Institute of Science and Technology, Daejeon 305-701 (Korea, Republic of); Reitzner, Daniel; Buzek, Vladimir [Research Center for Quantum Information, Slovak Academy of Sciences, Dubravska cesta 9, 845 11 Bratislava (Slovakia)

    2010-10-15T23:59:59.000Z

    We explore the possibility of using quantum walks on graphs to find structural anomalies, such as extra edges or loops, on a graph. We focus our attention on star graphs, whose edges are like spokes coming out of a central hub. If there are N spokes, we show that a quantum walk can find an extra edge connecting two of the spokes or a spoke with a loop on it in O({radical}(N)) steps. We initially find that if all except one of the spokes have loops, the walk will not find the spoke without a loop, but this can be fixed if we choose the phase with which the particle is reflected from the vertex without the loop. Consequently, quantum walks can, under some circumstances, be used to find structural anomalies in graphs.

  7. Checking and Comparison of WB-Graphs Peter B. Ladkin

    E-Print Network [OSTI]

    Ladkin, Peter B.

    as a running comparison. These graphs were produced by beginners at WBA, namely students in the first semester. It also caused the trauma death of the co-pilot, as well as the loss of consciousness of a passenger, who

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

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

    E-Print Network [OSTI]

    2014-07-10T23:59:59.000Z

    Jul 10, 2014 ... If G is a non trivial 2-connected series-parallel graph, an open nested ear decomposition ... no interior point of an ear Ei belongs to Ej for all j < i,.

  10. Stirling numbers of graphs, and the normal ordering

    E-Print Network [OSTI]

    Mayfield, John

    Stirling numbers of graphs, and the normal ordering problem Galvin earned his PhD in mathematics correlations in discrete random structures. The Stirling number of the second kind ${n \\brace k}$ counts

  11. Central limit theorems, Lee-Yang zeros, and graph-counting polynomials

    E-Print Network [OSTI]

    J. L. Lebowitz; B. Pittel; D. Ruelle; E. R. Speer

    2014-08-18T23:59:59.000Z

    We consider the asymptotic normalcy of families of random variables $X$ which count the number of occupied sites in some large set. We write $Prob(X=m)=p_mz_0^m/P(z_0)$, where $P(z)$ is the generating function $P(z)=\\sum_{j=0}^{N}p_jz^j$ and $z_0>0$. We give sufficient criteria, involving the location of the zeros of $P(z)$, for these families to satisfy a central limit theorem (CLT) and even a local CLT (LCLT); the theorems hold in the sense of estimates valid for large $N$ (we assume that $Var(X)$ is large when $N$ is). For example, if all the zeros lie in the closed left half plane then $X$ is asymptotically normal, and when the zeros satisfy some additional conditions then $X$ satisfies an LCLT. We apply these results to cases in which $X$ counts the number of edges in the (random) set of "occupied" edges in a graph, with constraints on the number of occupied edges attached to a given vertex. Our results also apply to systems of interacting particles, with $X$ counting the number of particles in a box $\\Lambda$ whose size approaches infinity; $P(z)$ is then the grand canonical partition function and its zeros are the Lee-Yang zeros.

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

  13. Noisy entanglement evolution for graph states

    E-Print Network [OSTI]

    Aolita, L; Chaves, R; Dhara, C; Davidovich, L; Acin, A

    2010-01-01T23:59:59.000Z

    A general method for the study of the entanglement evolution of graph states under the action of Pauli was recently proposed in [Cavalcanti, et al., Phys. Rev. Lett. 103, 030502 (2009)]. This method is based on lower and upper bounds on the entanglement of the entire state as a function only of the state of a considerably-smaller subsystem, which undergoes an effective noise process. This provides a huge simplification on the size of the matrices involved in the calculation of entanglement in these systems. In the present paper we elaborate on this method in details and generalize it to other natural situations not described by Pauli maps. Specifically, for Pauli maps we introduce an explicit formula for the characterization of the resulting effective noise. Beyond Pauli maps, we show that the same ideas can be applied to the case of thermal reservoirs at arbitrary temperature. In the latter case, we discuss how to optimize the bounds as a function of the noise strength. We illustrate our ideas with explicit ...

  14. Quantum Vacuum Energy in Graphs and Billiards

    E-Print Network [OSTI]

    L. Kaplan

    2011-01-03T23:59:59.000Z

    The vacuum (Casimir) energy in quantum field theory is a problem relevant both to new nanotechnology devices and to dark energy in cosmology. The crucial question is the dependence of the energy on the system geometry under study. Despite much progress since the first prediction of the Casimir effect in 1948 and its subsequent experimental verification in simple geometries, even the sign of the force in nontrivial situations is still a matter of controversy. Mathematically, vacuum energy fits squarely into the spectral theory of second-order self-adjoint elliptic linear differential operators. Specifically, one promising approach is based on the small-t asymptotics of the cylinder kernel e^(-t sqrt(H)), where H is the self-adjoint operator under study. In contrast with the well-studied heat kernel e^(-tH), the cylinder kernel depends in a non-local way on the geometry of the problem. We discuss some results by the Louisiana-Oklahoma-Texas collaboration on vacuum energy in model systems, including quantum graphs and two-dimensional cavities. The results may shed light on general questions, including the relationship between vacuum energy and periodic or closed classical orbits, and the contribution to vacuum energy of boundaries, edges, and corners.

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

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

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

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

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

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

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

  2. Flash2005-56ATTACHMENT.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 DataDepartment of Energy Your Density Isn't YourTransport inEnergy June 6-7, 2013Flash2005-56ATTACHMENT.pdf Flash2005-56ATTACHMENT.pdf

  3. Flash2008-39attachment.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 DataDepartment of Energy Your Density Isn't YourTransport inEnergy June 6-7,8-39attachment.pdf Flash2008-39attachment.pdf

  4. Flash2010-23Attachment.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 onYou are now leaving Energy.gov You are now leaving Energy.gov You are being directed offOCHCO2: FinalOffers3.pdf Flash2008-63.pdf10-01.pdf23Attachment.pdf Flash2010-23Attachment.pdf

  5. Flash2005-56ATTACHMENT.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: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645 3,625 1,006 492 742 33 1112011 Strategic Plan| Departmentof7.pdfATTACHMENT.pdf Flash2005-56ATTACHMENT.pdf

  6. 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: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645 3,625 1,006 492 742 33 1112011 Strategic Plan|.pdf3.pdf9attachment.pdf Flash2008-39attachment.pdf

  7. Flash2008-57Attachment1.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: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645 3,625 1,006 492 742 33 1112011 Strategic Plan|.pdf3.pdf9attachment.pdf3.pdf Flash2008-43.pdf2.pdf6.pdfAttachment1.pdf

  8. Flash2008-67Attachment1.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: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645 3,625 1,006 492 742 33 1112011 Strategic Plan|.pdf3.pdf9attachment.pdf3.pdf9.pdf Flash2008-59.pdf5.pdfAttachment1.pdf

  9. AttachmentFlash_2010-55.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 DataDepartment of Energy Your Density Isn't Your Destiny: The FutureComments from Tarasa OPAM Attachment6).pdfAttachmentFlash_2010-55.pdf

  10. Experimental entanglement of six photons in graph states

    E-Print Network [OSTI]

    Chao-Yang Lu; Xiao-Qi Zhou; Otfried Gühne; Wei-Bo Gao; Jin Zhang; Zhen-Sheng Yuan; Alexander Goebel; Tao Yang; Jian-Wei Pan

    2006-09-18T23:59:59.000Z

    Graph states are special kinds of multipartite entangled states that correspond to mathematical graphs where the vertices take the role of quantum spin systems and the edges represent interactions. They not only provide an efficient model to study multiparticle entanglement, but also find wide applications in quantum error correction, multi-party quantum communication and most prominently, serve as the central resource in one-way quantum computation. Here we report the creation of two special instances of graph states, the six-photon Greenberger-Horne-Zeilinger states -- the largest photonic Schr\\"{o}dinger cat, and the six-photon cluster states-- a state-of-the-art one-way quantum computer. Flexibly, slight modifications of our method allow creation of many other graph states. Thus we have demonstrated the ability of entangling six photons and engineering multiqubit graph states, and created a test-bed for investigations of one-way quantum computation and studies of multiparticle entanglement as well as foundational issues such as nonlocality and decoherence.

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

  12. attach interconnection technology: Topics by E-print Network

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

    attach interconnection technology First Page Previous Page 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 Next Page Last Page Topic Index 1 Processing and...

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

  14. Designing for emotional attachment to energy James Pierce, Eric Paulos

    E-Print Network [OSTI]

    Paulos, Eric

    for consumption (activation) of energy. In large part, this is because the design of centralized energy systems1 Designing for emotional attachment to energy James Pierce, Eric Paulos Human-Computer Interaction Institute, Carnegie Mellon University Pittsburgh, PA, USA, {jjpierce,paulos}@cs.cmu.edu Abstract: Drawing

  15. PP/OP 02.12 Attachment B

    E-Print Network [OSTI]

    Gelfond, Michael

    PP/OP 02.12 Attachment B 06/12/08 PHYSICAL PLANT ACCIDENT REVIEW ANALYSIS Physical Plant Accident/12/08 ACCIDENT REVIEW ANALYSIS Page Two __________ The task process be modified __________ The employee Review Board EMPLOYEE NAME: ACCIDENT DATE: Answer yes or no. __________ Do you agree with the corrective

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

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

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

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

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

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

  2. Fast Search for Dynamic Multi-Relational Graphs

    SciTech Connect (OSTI)

    Choudhury, Sutanay; Holder, Larry; Chin, George; Feo, John T.

    2013-06-23T23:59:59.000Z

    Acting on time-critical events by processing ever growing social media or news streams is a major technical challenge. Many of these data sources can be modeled as multi-relational graphs. Continuous queries or techniques to search for rare events that typically arise in monitoring applications have been studied extensively for relational databases. This work is dedicated to answer the question that emerges naturally: how can we efficiently execute a continuous query on a dynamic graph? This paper presents an exact subgraph search algorithm that exploits the temporal characteristics of representative queries for online news or social media monitoring. The algorithm is based on a novel data structure called the that leverages the structural and semantic characteristics of the underlying multi-relational graph. The paper concludes with extensive experimentation on several real-world datasets that demonstrates the validity of this approach.

  3. Asymptotic structure and singularities in constrained directed graphs

    E-Print Network [OSTI]

    David Aristoff; Lingjiong Zhu

    2015-02-17T23:59:59.000Z

    We study the asymptotics of large directed graphs, constrained to have certain densities of edges and/or outward $p$-stars. Our models are close cousins of exponential random graph models (ERGMs), in which edges and certain other subgraph densities are controlled by parameters. The idea of directly constraining edge and other subgraph densities comes from Radin and Sadun. Such modeling circumvents a phenomenon first made precise by Chatterjee and Diaconis: that in ERGMs it is often impossible to independently constrain edge and other subgraph densities. In all our models, we find that large graphs have either uniform or bipodal structure. When edge density (resp. $p$-star density) is fixed and $p$-star density (resp. edge density) is controlled by a parameter, we find phase transitions corresponding to a change from uniform to bipodal structure. When both edge and $p$-star density are fixed, we find only bipodal structures and no phase transition.

  4. Regular graphs maximize the variability of random neural networks

    E-Print Network [OSTI]

    Gilles Wainrib; Mathieu Galtier

    2014-12-17T23:59:59.000Z

    In this work we study the dynamics of systems composed of numerous interacting elements interconnected through a random weighted directed graph, such as models of random neural networks. We develop an original theoretical approach based on a combination of a classical mean-field theory originally developed in the context of dynamical spin-glass models, and the heterogeneous mean-field theory developed to study epidemic propagation on graphs. Our main result is that, surprisingly, increasing the variance of the in-degree distribution does not result in a more variable dynamical behavior, but on the contrary that the most variable behaviors are obtained in the regular graph setting. We further study how the dynamical complexity of the attractors is influenced by the statistical properties of the in-degree distribution.

  5. An improved spectral graph partitioning algorithm for mapping parallel computations

    SciTech Connect (OSTI)

    Hendrickson, B.; Leland, R.

    1992-09-01T23:59:59.000Z

    Efficient use of a distributed memory parallel computer requires that the computational load be balanced across processors in a way that minimizes interprocessor communication. We present a new domain mapping algorithm that extends recent work in which ideas from spectral graph theory have been applied to this problem. Our generalization of spectral graph bisection involves a novel use of multiple eigenvectors to allow for division of a computation into four or eight parts at each stage of a recursive decomposition. The resulting method is suitable for scientific computations like irregular finite elements or differences performed on hypercube or mesh architecture machines. Experimental results confirm that the new method provides better decompositions arrived at more economically and robustly than with previous spectral methods. We have also improved upon the known spectral lower bound for graph bisection.

  6. Metric intersection problems in Cayley graphs and the Stirling recursion

    E-Print Network [OSTI]

    Phongpattanacharoen, Teeraphong

    2012-01-01T23:59:59.000Z

    In the symmetric group Sym(n) with n at least 5 let H be a conjugacy class of elements of order 2 and let \\Gamma be the Cayley graph whose vertex set is the group G generated by H (so G is Sym(n) or Alt(n)) and whose edge set is determined by H. We are interested in the metric structure of this graph. In particular, for g\\in G let B_{r}(g) be the metric ball in \\Gamma of radius r and centre g. We show that the intersection numbers \\Phi(\\Gamma; r, g):=|\\,B_{r}(e)\\,\\cap\\,B_{r}(g)\\,| are generalized Stirling functions in n and r. The results are motivated by the study of error graphs and related reconstruction problems.

  7. Graph Applications To know the Seven Bridges of Knigsberg problem and

    E-Print Network [OSTI]

    Liang, Y. Daniel

    the shortest distance between two cities can be modeled using a graph, where the vertices represent cities

  8. Handling Context-Sensitivity in Protein Structures Using Graph Theory: Bona Fide Prediction

    E-Print Network [OSTI]

    Samudrala, Ram

    structure(s).5 METHODS General Description of the Graph-Theoretic Clique-Finding Approach Each possible

  9. Exercise 1: part 1 p Consider the simple web graph shown in slide 72

    E-Print Network [OSTI]

    Ricci, Francesco

    the file and brose the content of the class directory p Transform the input graphs tiny.txt and medium

  10. Approximate Graph Coloring by Semidefinite Programming David Karger \\Lambda Rajeev Motwani y Madhu Sudan z

    E-Print Network [OSTI]

    Sudan z Abstract We consider the problem of coloring k­colorable graphs with the fewest possible colors

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

  12. A Structure Theory of the Sandpile Monoid for Directed Graphs Laszlo Babai

    E-Print Network [OSTI]

    Babai, László

    A Structure Theory of the Sandpile Monoid for Directed Graphs L´aszl´o Babai Evelin Toumpakari June

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

  14. Leaf-to-leaf distances in Catalan tree graphs

    E-Print Network [OSTI]

    Andrew M. Goldsborough; Jonathan M. Fellows; Matthew Bates; S. Alex Rautu; George Rowlands; Rudolf A. Römer

    2015-03-02T23:59:59.000Z

    We study the average leaf-to-leaf path lengths on ordered Catalan tree graphs with $n$ nodes and show that these are equivalent to the average length of paths starting from the root node. We give an explicit analytic formula for the average leaf-to-leaf path length as a function of separation of the leaves and study its asymptotic properties. At the heart of our method is a strategy based on an abstract graph representation of generating functions which we hope can be useful also in other contexts.

  15. Vacuum Energy and Repulsive Casimir Forces in Quantum Star Graphs

    E-Print Network [OSTI]

    S. A. Fulling; L. Kaplan; J. H. Wilson

    2007-03-27T23:59:59.000Z

    Casimir pistons are models in which finite Casimir forces can be calculated without any suspect renormalizations. It has been suggested that such forces are always attractive, but we present several counterexamples, notably a simple type of quantum graph in which the sign of the force depends upon the number of edges. We also show that Casimir forces in quantum graphs can be reliably computed by summing over the classical orbits, and study the rate of convergence of the periodic orbit expansion. In generic situations where no analytic expression is available, the sign and approximate magnitude of Casimir forces can often be obtained using only the shortest classical orbits.

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

  17. Message-passing for Inference and Optimization of Real Variables on Sparse Graphs

    E-Print Network [OSTI]

    Wong, Michael K Y

    Message-passing for Inference and Optimization of Real Variables on Sparse Graphs K. Y. Michael with extensive inter-dependencies among the variables, the graph-based models can be solved by passing messages between neighbouring variables on the graphs. This message-passing approach has gained recent success

  18. Rapid Multipole Graph Drawing on the GPU Apeksha Godiyal*, Jared Hoberock*, Michael Garland

    E-Print Network [OSTI]

    Garland, Michael

    Rapid Multipole Graph Drawing on the GPU Apeksha Godiyal*, Jared Hoberock*, Michael Garland task of drawing large graphs. This paper describes a new parallel anal- ysis of the multipole method of graph drawing to support its efficient GPU implementation. We use a variation of the Fast Multipole

  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. THE MATCHING ENERGY OF A GRAPH IVAN GUTMAN AND STEPHAN WAGNER

    E-Print Network [OSTI]

    Wagner, Stephan

    ) was obtained [4, 13, 20], and recalling the definition of graph energy, Eq. (2), we straightforwardly arrive at. Then, (5) ME(G) = n i=1 |µi|. Eq. (5) could be considered as the definition of matching energyTHE MATCHING ENERGY OF A GRAPH IVAN GUTMAN AND STEPHAN WAGNER Abstract. The energy of a graph G

  1. Effective Graph Classification Based on Topological and Label Attributes , Murat Semerci2

    E-Print Network [OSTI]

    Zaki, Mohammed Javeed

    online 12 June 2012 in Wiley Online Library (wileyonlinelibrary.com). Abstract: Graph classificationEffective Graph Classification Based on Topological and Label Attributes Geng Li1 , Murat Semerci2 propose an alternative approach to graph classification that is based on feature vectors constructed from

  2. The smallest k-regular h-edge-connected graphs without , Douglas B. West

    E-Print Network [OSTI]

    West, Douglas B.

    -regular graph with no cut-edge has a 1-factor. This has many generalizations. Showing that every kThe smallest k-regular h-edge-connected graphs without 1-factors John Ganci , Douglas B. West March-regular (k - 1)-edge-connected graph of even order has a 1-factor is a standard elementary exercise (#3

  3. Loops in Reeb Graphs of 2-Manifolds Kree Cole-McLaughlin

    E-Print Network [OSTI]

    Pascucci, Valerio

    -resolution versions of the Reeb graph have lead to data-base search methods for topologically similar geo- metric and scientific data. Specifically, we study Reeb graphs, which express the connectivity of level sets. These graphs have been used in the past to con- struct data structures and user-interfaces for modeling

  4. Shunt attachment and method for interfacing current collection systems

    DOE Patents [OSTI]

    Denney, P.E.; Iyer, N.C.; Hannan, W.F. III.

    1992-12-08T23:59:59.000Z

    A composite brush to shunt attachment wherein a volatile component of a composite but mostly metallic brush, used for current collection purposes, does not upon welding or brazing, adversely affect the formation of the interfacial bond with a conductive shunt which carries the current from the zone of the brush. The brush to shunt attachment for a brush material of copper-graphite composite and a shunt of copper, or substituting silver for copper as an alternative, is made through a hot isostatic pressing (HIP). The HIP process includes applying high pressure and temperature simultaneously at the brush to shunt interface, after it has been isolated or canned in a metal casing in which the air adjacent to the interface has been evacuated and the interfacial area has been sealed before the application of pressure and temperature. 6 figs.

  5. Shunt attachment and method for interfacing current collection systems

    DOE Patents [OSTI]

    Denney, Paul E. (State College, PA); Iyer, Natraj C. (Columbia, SC); Hannan, III, William F. (Monroeville Boro, PA)

    1992-01-01T23:59:59.000Z

    A composite brush to shunt attachment wherein a volatile component of a composite but mostly metallic brush, used for current collection purposes, does not upon welding or brazing, adversely affect the formation of the interfacial bond with a conductive shunt which carries the current from the zone of the brush. The brush to shunt attachment for a brush material of copper-graphite composite and a shunt of copper, or substituting silver for copper as an alternative, is made through a hot isostatic pressing (HIP). The HIP process includes applying high pressure and temperature simultaneously at the brush to shunt interface, after it has been isolated or canned in a metal casing in which the air adjacent to the interface has been evacuated and the interfacial area has been sealed before the application of pressure and temperature.

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

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

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

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

  10. Tighter Bounds for Graph Steiner Tree Approximation Gabriel Robins

    E-Print Network [OSTI]

    Zelikovsky, Alexander

    of Computer Science, University of Virginia, Charlottesville, VA 22904 robins@cs.virginia.edu, www.cs.virginia of 1.28 within time O(mn2) (m and n are the numbers of terminals and non-terminals in the graph

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

  12. Synchronization Helps Robots to Detect Black Holes in Directed Graphs

    E-Print Network [OSTI]

    Pinotti, Maria Cristina

    nodes are the so called black hole nodes, and once a robot enters in one of them, it is destroyed supported by the Italian CNR Short-Term Mobility Program. #12;1 Introduction The subject of exploring that destroy any entering entity. Such nodes are called black holes, and the exploration of a graph

  13. The TROPOS Analysis Process as Graph Transformation System Paolo Bresciani

    E-Print Network [OSTI]

    Trento-Povo, Italy Abstract Tropos is an agent-oriented methodology that covers soft- ware developmentThe TROPOS Analysis Process as Graph Transformation System Paolo Bresciani ITC-irst via Sommarive of the operational environment of the new software system. In earlier work we have characterized the process of early

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

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

  16. A spectral graph based approach to analyze hyperspectral data

    E-Print Network [OSTI]

    Bertozzi, Andrea L.

    A spectral graph based approach to analyze hyperspectral data Blake Hunter Department of Mathematics, UCLA 520 Portola Plaza Los Angeles, CA 90095 Email: blakehunter@math.ucla.edu Yifei Lou Department of Mathematics, UCLA 520 Portola Plaza Los Angeles, CA 90095 Email: bertozzi

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

  18. Asymmetric Structure-Preserving Subgraph Queries for Large Graphs

    E-Print Network [OSTI]

    Choi, Byron "Koon Kau"

    Asymmetric Structure-Preserving Subgraph Queries for Large Graphs Zhe Fan1 Byron Choi1 Jianliang Xu the novel cyclic group based encryption so that query processing is transformed into a series of private are effective. I. INTRODUCTION Subgraph queries (via subgraph isomorphism) are a fun- damental and powerful

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

  20. A Numerical Optimization Approach to General Graph Drawing

    E-Print Network [OSTI]

    Paul Heckbert Bruce Maggs Omar Ghattas, Civil and Environmental Engineering Mark Wegman, IBM T . J Maggs, and Mark Wegman. I am especially grateful that they allowed me to pursue a dissertation. I owe my interest in graph drawing to Mark Wegman, who introduced me to the area when I was an MIT

  1. Unicyclic graphs with large energy Eric Ould Dadah Andriantiana 1

    E-Print Network [OSTI]

    Wagner, Stephan

    of Mathematical Sciences Mathematics Division Stellenbosch University Private Bag X1, Matieland 7602 South Africa work supported by the National Research Foundation of South Africa under grant number 70560. PreprintUnicyclic graphs with large energy Eric Ould Dadah Andriantiana 1 and Stephan Wagner 2 Department

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

  3. Table of Contents Part 1: Climate Graphs Activity

    E-Print Network [OSTI]

    . Quantity. How much precipitation falls? What is the general trend east to west in Texas concerningTable of Contents Part 1: Climate Graphs Activity Part 2: Texas Climate Handout Maps for transparencies: a. Texas Average Annual Temperature b. Texas Average Annual Precipitation c. Texas Climate

  4. An Approach to Security Policy Configuration Using Semantic Threat Graphs

    E-Print Network [OSTI]

    Foley, Simon

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

  5. Insider Threat Detection using Stream Mining and Graph Mining

    E-Print Network [OSTI]

    Hamlen, Kevin W.

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

  6. Decentralized Semantic Threat Graphs Simon N. Foley1

    E-Print Network [OSTI]

    Foley, Simon

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

  7. Weighted Graph Cuts without Eigenvectors: A Multilevel Approach

    E-Print Network [OSTI]

    to handle data that is not linearly separable; spectral clustering and kernel k-means are two of the main different methods--in particular, a general weighted kernel k-means objective is mathematically equivalent multilevel algorithm removes this restriction by using kernel k-means to optimize weighted graph cuts

  8. Graph Based K-Means Clustering Laurent Galluccioa,c

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    Graph Based K-Means Clustering Laurent Galluccioa,c , Olivier Michelb , Pierre Comona , Alfred O the generalized Lloyd algorithm, also known as k-means, which circumvents its well known initialization problems for estimating of the number of clusters present and determining good centroid locations to initialize the k-means

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

  10. Math 304 Handout: Linear algebra, graphs, and networks.

    E-Print Network [OSTI]

    Anshelevich, Michael

    . · The World Wide Web is a directed graph, with web pages as vertices and links as edges. · Towns connected on the web, all the words that they contain. Again, an efficient way to do this is using a (very, very large) matrix. Each column corresponds to a web page, each row to a word, and each entry is 1 if a particular

  11. A SPATIAL WEB GRAPH MODEL WITH LOCAL INFLUENCE REGIONS

    E-Print Network [OSTI]

    Pralat, Pawel

    mining technique, web pages are often represented as vectors in a word-document space. Using LatentA SPATIAL WEB GRAPH MODEL WITH LOCAL INFLUENCE REGIONS W. AIELLO, A. BONATO, C. COOPER, J. JANSSEN-degree distribution, with exponent in [2, ) depending on the parameters, and with concentration for a wide range of in

  12. Towards Efficient Query Processing on Massive Time-Evolving Graphs

    E-Print Network [OSTI]

    Miller, John A.

    Email: {ar, ara, laks, jam}@cs.uga.edu Abstract--Time evolving graph (TEG) is increasingly being used on massive TEGs is central to building powerful analytic applications for these domains. Unfortunately effective for processing massive TEGs. Towards designing scalable mechanisms for answering TEG queries

  13. Distanceregular graphs having an eigenvalue of small multiplicity

    E-Print Network [OSTI]

    Martin, Bill

    , results of Godsil [12] and Terwilliger [19], to allow computer generation of all feasible intesection of Godsil and Terwilliger and on results in this paper, we now have the diameter bound d Ÿ 3m \\Gamma 8 for m of graph representa­ tions is outlined, theorems of Godsil and Terwilliger are stated and several

  14. On the edgeconnectivity of Cartesian product graphs # Sandi Klavzar

    E-Print Network [OSTI]

    Klavzar, Sandi

    edge cut of G#H, then either S is induced by a minimum edge cut of a factor, or S is a set of edges is given and the structure of minimum edge cuts is described. It is also proved that the connectivity product of graphs; edge­connectivity; minimum edge cuts; AMS subject classification (2000): 05C40 1

  15. Spectra of graphs and semi-conducting polymers

    E-Print Network [OSTI]

    Philipp Schapotschnikow; Sven Gnutzmann

    2008-02-04T23:59:59.000Z

    We study the band gap in some semi-conducting polymers with two models: H\\"uckel molecular orbital theory and the so-called free electron model. The two models are directly related to spectral theory on combinatorial and metric graphs.

  16. Secret sharing schemes on graphs L aszl o Csirmaz

    E-Print Network [OSTI]

    Csirmaz, László

    Secret sharing schemes on graphs L#19;aszl#19;o Csirmaz Mathematical Institute of the Hungarian secret sharing scheme based on G is a method to distribute a secret data among the vertices of G, the participants, so that a subset of participants can recover the secret if they contain an edge of G, otherwise

  17. On Linear Secret Sharing for Connectivity in Directed Graphs

    E-Print Network [OSTI]

    Beimel, Amos

    On Linear Secret Sharing for Connectivity in Directed Graphs Amos Beimel 1 and Anat Paskin 2 1 Dept, Israel. Abstract. In this work we study linear secret sharing schemes for s­t connectivity in directed.e., edges) can reconstruct the secret if it contains a path from node s to node t. We prove that in every

  18. On Linear Secret Sharing for Connectivity in Directed Graphs

    E-Print Network [OSTI]

    Beimel, Amos

    On Linear Secret Sharing for Connectivity in Directed Graphs Amos Beimel1 and Anat Paskin2 1 Dept, Israel. Abstract. In this work we study linear secret sharing schemes for s-t connectivity in directed.e., edges) can reconstruct the secret if it contains a path from node s to node t. We prove that in every

  19. (Co)Algebraic Characterizations of Signal Flow Graphs

    E-Print Network [OSTI]

    Rutten, Jan

    Signal flow graphs are a graphical representation for the analysis, modeling and evaluation of linear as a linear combination of the input and the registers. That is, the dynamics of a circuit can be expressed as a system of linear of equations, one for each register. Since we consider open circuits, the corresponding

  20. THE GROUP OF SYMMETRIES OF THE TOWER OF HANOI GRAPH

    E-Print Network [OSTI]

    Behrstock, Jason

    THE GROUP OF SYMMETRIES OF THE TOWER OF HANOI GRAPH SO EUN PARK The classical Tower of Hanoi puzzle the tower of disks to another peg, moving one topmost disk at a time while never stacking a disk referred to as the Tower of Hanoi problem. Figure 1. Convention for labeling k pegs and n disks

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

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

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

  4. Using Battery Level as Metric for Graph Planarization Jovan Radak, Nathalie Mitton, and David Simplot-Ryl

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    only a subset of its neighborhood by keeping connectivity. Then, a node adjusts its range for scalability and energy efficiency. It is often based on graph reduction performed through the use of Gabriel Graph or Relative Neighborhood Graph. This graph reduction is usually based on geometric values

  5. Constructing and sampling graphs with a given joint degree distribution.

    SciTech Connect (OSTI)

    Pinar, Ali; Stanton, Isabelle (UC Berkeley)

    2010-09-01T23:59:59.000Z

    One of the most influential recent results in network analysis is that many natural networks exhibit a power-law or log-normal degree distribution. This has inspired numerous generative models that match this property. However, more recent work has shown that while these generative models do have the right degree distribution, they are not good models for real life networks due to their differences on other important metrics like conductance. We believe this is, in part, because many of these real-world networks have very different joint degree distributions, i.e. the probability that a randomly selected edge will be between nodes of degree k and l. Assortativity is a sufficient statistic of the joint degree distribution, and it has been previously noted that social networks tend to be assortative, while biological and technological networks tend to be disassortative. We suggest understanding the relationship between network structure and the joint degree distribution of graphs is an interesting avenue of further research. An important tool for such studies are algorithms that can generate random instances of graphs with the same joint degree distribution. This is the main topic of this paper and we study the problem from both a theoretical and practical perspective. We provide an algorithm for constructing simple graphs from a given joint degree distribution, and a Monte Carlo Markov Chain method for sampling them. We also show that the state space of simple graphs with a fixed degree distribution is connected via end point switches. We empirically evaluate the mixing time of this Markov Chain by using experiments based on the autocorrelation of each edge. These experiments show that our Markov Chain mixes quickly on real graphs, allowing for utilization of our techniques in practice.

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

  7. A Simple Method for Finding the Scattering Coefficients of Quantum Graphs

    E-Print Network [OSTI]

    Seth S. Cottrell

    2015-03-01T23:59:59.000Z

    Quantum walks are roughly analogous to classical random walks, and like classical walks they have been used to find new (quantum) algorithms. When studying the behavior of large graphs or combinations of graphs it is useful to find the response of a subgraph to signals of different frequencies. In so doing we can replace an entire subgraph with a single vertex with frequency dependent scattering coefficients. In this paper a simple technique for quickly finding the scattering coefficients of any quantum graph will be presented. These scattering coefficients can be expressed entirely in terms of the characteristic polynomial of the graph's time step operator. Moreover, with these in hand we can easily derive the "impulse response" which is the key to predicting the response of a graph to any signal. This gives us a powerful set of tools for rapidly understanding the behavior of graphs or for reducing a large graph into its constituent subgraphs regardless of how they are connected.

  8. A Mathematical Analysis of the R-MAT Random Graph Generator

    SciTech Connect (OSTI)

    Groer, Christopher S [ORNL; Sullivan, Blair D [ORNL; Poole, Stephen W [ORNL

    2011-01-01T23:59:59.000Z

    The R-MAT graph generator introduced by Chakrabarti, Faloutsos, and Zhan offers a simple, fast method for generating very large directed graphs. These properties have made it a popular choice as a method of generating graphs for objects of study in a variety of disciplines, from social network analysis to high performance computing. We analyze the graphs generated by R-MAT and model the generator in terms of occupancy problems in order to prove results about the degree distributions of these graphs. We prove that the limiting degree distributions can be expressed as a mixture of normal distributions, contradicting the widely held belief that R-MAT degree distributions exhibit the power law or scale free distribution observed in many real world graphs. Additionally, this paper offers an efficient computational technique for computing the exact degree distribution, as well as concise expressions for a number of properties of R-MAT graphs.

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

    E-Print Network [OSTI]

    . "Statistical and Hierarchical Graph Analysis for Cyber Security." SIAM Conference on Discrete Mathematics effort is made possible by the Pacific Northwest National Laboratory through funding provided by the U.S. Department of Energy. For more information on the science you see here, please contact: Sutanay Choudhury

  10. Traffic of cytoskeletal motors with disordered attachment rates

    E-Print Network [OSTI]

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

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

  11. AttachmentFlash2010-80.pdf | Department of Energy

    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: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645 3,625 1,006 492 742 33Frequently20,000 RussianBy:Whether you'reInc.:memo memorializesAttachmentFlash2010-76(1).pdf80.pdf

  12. Flash2006-23Attachment.doc | 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 DataDepartment of Energy Your Density Isn't YourTransport inEnergy June 6-7, 2013Flash2005-56ATTACHMENT.pdfCORRECTION NOTICE

  13. Flash2007-02Attachment.doc | 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 DataDepartment of Energy Your Density Isn't YourTransport inEnergy June 6-7, 2013Flash2005-56ATTACHMENT.pdfCORRECTIONITEM

  14. Flash2009-032attachment.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 DataDepartment of Energy Your Density Isn't YourTransport inEnergy June 6-7,8-39attachment.pdfFlash2008-60.pdf1.pdf

  15. Flash2010-21attachment1.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 DataDepartment of Energy Your Density Isn't YourTransport inEnergy June47Attachment.pdf1.pdf0.pdf Flash2010-20.pdf Flash2010-20.pdf

  16. Flash2010-21attachment2.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 DataDepartment of Energy Your Density Isn't YourTransport inEnergy June47Attachment.pdf1.pdf0.pdf Flash2010-20.pdf

  17. FAL2003-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: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645 3,625 1,006 492 742 33 1112011 Strategic Plan| Department of Energy 088:Energy FACT SHEET:Attachment.pdf

  18. Flash2009-47Attachment.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 onYou are now leaving Energy.gov You are now leaving Energy.gov You are being directed offOCHCO2: FinalOffers3.pdf Flash2008-63.pdf Flash2008-63.pdf MoreFlash2009-08.pdf47Attachment.pdf

  19. Flash2009-58Attachment.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 onYou are now leaving Energy.gov You are now leaving Energy.gov You are being directed offOCHCO2: FinalOffers3.pdf Flash2008-63.pdf Flash2008-63.pdf8Attachment.pdf

  20. Flash2010-16Attachment.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 onYou are now leaving Energy.gov You are now leaving Energy.gov You are being directed offOCHCO2: FinalOffers3.pdf Flash2008-63.pdf10-01.pdf Flash2010-01.pdfFlash2010-16Attachment.pdf

  1. 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: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645 3,625 1,006 492 742 33 1112011 Strategic Plan| Departmentof OhioFirst Annual PostSmart Grid.pdf8attachment.pdf

  2. Flash2005-52ATTACHMENT2.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: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645 3,625 1,006 492 742 33 1112011 Strategic Plan| Departmentof7.pdf Flash2005-27.pdf0.pdfATTACHMENT2.pdf

  3. 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: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645 3,625 1,006 492 742 33 1112011 Strategic Plan|.pdf Flash2006-12.pdf Flash2006-12.pdf41.pdfAttachment2.doc&#0;

  4. 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: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645 3,625 1,006 492 742 33 1112011 Strategic Plan|.pdf Flash2006-12.pdf5Attachment.doc&#0;

  5. 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: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645 3,625 1,006 492 742 33 1112011 Strategic Plan|.pdf Flash2006-12.pdf5Attachment.doc&#0;6.pdf

  6. Flash2008-31Attachment1.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: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645 3,625 1,006 492 742 33 1112011 Strategic Plan|.pdf3.pdf Flash2006-53.pdf6.pdf6.pdf1.pdf9.pdf7.pdf.pdf.pdfAttachment1.pdf

  7. Flash2008-57Attachment_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: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645 3,625 1,006 492 742 33 1112011 Strategic Plan|.pdf3.pdf9attachment.pdf3.pdf

  8. Policy Flash 2010-79 Attachment 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 onYou are now leaving Energy.gov You are now leaving Energy.gov You are being directed offOCHCO Overview OCHCO Overview OCHCO OCHCOControlGuide toPolicy Flash 2010-79 Attachment 2 Policy

  9. Policy Flash 2011-2 Attachment 1 | 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 onYou are now leaving Energy.gov You are now leaving Energy.gov You are being directed offOCHCO Overview OCHCO Overview OCHCO OCHCOControlGuide toPolicy Flash 2010-79 Attachment

  10. 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 onYou are now leaving Energy.gov You are now leaving Energy.gov You are being directed off Energy.gov. Are you0 ARRA NewslettersPartnership ofAttachmentFlash2011-2

  11. 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: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645 3,625 1,006 492 742 33 1112011AT&T,OfficeEnd ofEvaluations inCommittee5-43.pdf6-03ATTACHMENT.pdf

  12. Flash2006-52Attachment.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: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645 3,625 1,006 492 742 33 1112011AT&T,OfficeEnd ofEvaluations6-12.pdf1.6 Project Management As6-52Attachment.pdf

  13. flash2007-42attachment1.pdf | Department of Energy

    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: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645 3,625 1,006 492 742Energy China 2015ofDepartment of EnergyThePatricia2012) |.pdfflash2007-42attachment1.pdf More

  14. flash2005-34attachment.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: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645 3,625 1,006 492 742 33Frequently20,000 Russian Nuclear Warheads|ofEventsWorkshopY-12a5-34attachment.pdf

  15. Attachment FY2011-75 OPAM | 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 DataDepartment of Energy Your Density Isn't Your Destiny: The FutureComments from Tarasa OPAM Attachment FY2011-75 OPAM Federal Supply

  16. Attachment FY2011-75 | 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 DataDepartment of Energy Your Density Isn't Your Destiny: The FutureComments from Tarasa OPAM Attachment FY2011-75 OPAM Federal Supply

  17. Attachment FY2011-77 OPAM | 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 DataDepartment of Energy Your Density Isn't Your Destiny: The FutureComments from Tarasa OPAM Attachment FY2011-75 OPAM Federal Supply7 OPAM

  18. Attachment FY2011-9 | 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 DataDepartment of Energy Your Density Isn't Your Destiny: The FutureComments from Tarasa OPAM Attachment FY2011-75 OPAM Federal Supply7

  19. Attachment H: Delegation of Authority Memorandum | 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 DataDepartment of Energy Your Density Isn't Your Destiny: The FutureComments from Tarasa OPAM Attachment FY2011-75 OPAM Federal Supply7H:

  20. AttachmentFlash2010-34.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 DataDepartment of Energy Your Density Isn't Your Destiny: The FutureComments from Tarasa OPAM Attachment FY2011-75 OPAM Federalto34.pdf

  1. AttachmentFlash2010-39.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 DataDepartment of Energy Your Density Isn't Your Destiny: The FutureComments from Tarasa OPAM Attachment FY2011-75 OPAM

  2. Bonneville Power Administration Attachment P Oversupply Management Protocol

    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: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645U.S. DOE Office511041clothAdvanced Materials Advanced Materials Find FindRewind Generator|December 5, 2011 InAttachment P

  3. AttachmentFlash2010-75.pdf | Department of Energy

    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: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645 3,625 1,006 492 742Energy China U.S. Department of Energy |ArticleAttachmentFlash2010-45(1).pdf More Documents

  4. A Graph Analytic Metric for Mitigating Advanced Persistent Threat

    SciTech Connect (OSTI)

    Johnson, John R.; Hogan, Emilie A.

    2013-06-04T23:59:59.000Z

    This paper introduces a novel graph analytic metric that can be used to measure the potential vulnerability of a cyber network to specific types of attacks that use lateral movement and privilege escalation such as the well known Pass The Hash, (PTH). The metric is computed from an oriented subgraph of the underlying cyber network induced by selecting only those edges for which a given property holds between the two vertices of the edge. The metric with respect to a select node on the subgraph is defined as the likelihood that the select node is reachable from another arbitrary node in the graph. This metric can be calculated dynamically from the authorization and auditing layers during the network security authorization phase and will potentially enable predictive deterrence against attacks such as PTH.

  5. A characterization of Q-polynomial distance-regular graphs

    E-Print Network [OSTI]

    Jurisic, Aleksandar; Zitnik, Arjana

    2009-01-01T23:59:59.000Z

    We obtain the following characterization of $Q$-polynomial distance-regular graphs. Let $\\G$ denote a distance-regular graph with diameter $d\\ge 3$. Let $E$ denote a minimal idempotent of $\\G$ which is not the trivial idempotent $E_0$. Let $\\{\\theta_i^*\\}_{i=0}^d$ denote the dual eigenvalue sequence for $E$. We show that $E$ is $Q$-polynomial if and only if (i) the entry-wise product $E \\circ E$ is a linear combination of $E_0$, $E$, and at most one other minimal idempotent of $\\G$; (ii) there exists a complex scalar $\\beta$ such that $\\theta^*_{i-1}-\\beta \\theta^*_i + \\theta^*_{i+1}$ is independent of $i$ for $1 \\le i \\le d-1$; (iii) $\\theta^*_i \

  6. Qubits from Adinkra Graph Theory via Colored Toric Geometry

    E-Print Network [OSTI]

    Aadel, Y; Benslimane, Z; Sedra, M B; Segui, A

    2015-01-01T23:59:59.000Z

    We develop a new approach to deal with qubit information systems using toric geometry and its relation to Adinkra graph theory. More precisely, we link three different subjects namely toric geometry, Adinkras and quantum information theory. This one to one correspondence may be explored to attack qubit system problems using geometry considered as a powerful tool to understand modern physics including string theory. Concretely, we examine in some details the cases of one, two, and three qubits, and we find that they are associated with \\bf CP^1, \\bf CP^1\\times CP^1 and \\bf CP^1\\times CP^1\\times CP^1 toric varieties respectively. Using a geometric procedure referred to as colored toric geometry, we show that the qubit physics can be converted into a scenario handling toric data of such manifolds by help of Adinkra graph theory. Operations on toric information can produce universal quantum gates.

  7. Deciding Graph MSO Properties: Has it all been told already?

    E-Print Network [OSTI]

    Gajarský, Jakub

    2012-01-01T23:59:59.000Z

    A famous result of Courcelle claims that on graphs of bounded tree-width extensions for the MSO1 case are presented also in [Ganian, IPEC2011]. We take a general approach, proving that the MSO model-checking problem admits an FPT algorithm with an elementary dependence on the formula on all classes of trees of bounded height. This result, via standard logic interpretation, implies that all MSO2 properties \\phi are decidable in FPT with an elemen...

  8. Connection probability for random graphs with given degree sequence

    E-Print Network [OSTI]

    Xinping Xu

    2007-08-20T23:59:59.000Z

    Recently, the classical configuration model for random graphs with given degree distribution has been extensively used as a null model in contraposition to real networks with the same degree distribution. In this paper, we briefly review the applications of this model and derive analytical expression for connection probability by the expanding coefficient method. We also use our expanding coefficient method to obtain the connection probability for the directed configuration model.

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

  10. Strong Integer Additive Set-valued Graphs: A Creative Review

    E-Print Network [OSTI]

    N. K. Sudev; K. A. Germina; K. P. Chithra

    2015-04-23T23:59:59.000Z

    For a non-empty ground set $X$, finite or infinite, the {\\em set-valuation} or {\\em set-labeling} of a given graph $G$ is an injective function $f:V(G) \\to \\mathcal{P}(X)$, where $\\mathcal{P}(X)$ is the power set of the set $X$. A set-indexer of a graph $G$ is an injective set-valued function $f:V(G) \\to \\mathcal{P}(X)$ such that the function $f^{\\ast}:E(G)\\to \\mathcal{P}(X)-\\{\\emptyset\\}$ defined by $f^{\\ast}(uv) = f(u){\\ast} f(v)$ for every $uv{\\in} E(G)$ is also injective., where $\\ast$ is a binary operation on sets. An integer additive set-indexer is defined as an injective function $f:V(G)\\to \\mathcal{P}({\\mathbb{N}_0})$ such that the induced function $g_f:E(G) \\to \\mathcal{P}(\\mathbb{N}_0)$ defined by $g_f (uv) = f(u)+ f(v)$ is also injective, where $\\mathbb{N}_0$ is the set of all non-negative integers and $\\mathcal{P}(\\mathbb{N}_0)$ is its power set. An IASI $f$ is said to be a strong IASI if $|f^+(uv)|=|f(u)|\\,|f(v)|$ for every pair of adjacent vertices $u,v$ in $G$. In this paper, we critically and creatively review the concepts and properties of strong integer additive set-valued graphs.

  11. attached software re-initiation: Topics by E-print Network

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

    attachments. Computer Technologies and Information Sciences Websites Summary: A crisis in adoption which is UK wide Significant reform programmes in Wales and...

  12. Attachment and detachment of microorganisms as related to sampling carcasses and meat products 

    E-Print Network [OSTI]

    Butler, Jacqueline Love

    1980-01-01T23:59:59.000Z

    of Advisory Committee: Dr. C. Vanderzant A model system was developed to study attachment and de- t-chment of' bacteria with pork skin and muscle surfaces of beef and lamb carcasses. The technique involved embedding pork skin and beef and lamb muscle... medium, although in some cases attachment continued to occur over a $0-min period. Gram-negative motile bacteria had greater force of attachment than gram-positive non-motile species. Temperature and pH of the attachment medium had little eff...

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

  14. Nevada Test Site Environmental Report 2009, Attachment A: Site Description

    SciTech Connect (OSTI)

    Cathy Wills, ed.

    2010-09-13T23: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 2009. 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. 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.

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

  17. A sharp lower bound for the Wiener index of a graph

    E-Print Network [OSTI]

    Balakrishnan, R; Iyer, K V

    2010-01-01T23:59:59.000Z

    Given a simple connected undirected graph G, the Wiener index W(G) of G is defined as half the sum of the distances over all pairs of vertices of G. In practice, G corresponds to what is known as the molecular graph of an organic compound. We obtain a sharp lower bound for W(G) of an arbitrary graph in terms of the order, size and diameter of G.

  18. LIGHT SUBGRAPHS IN PLANAR GRAPHS OF MINIMUM DEGREE 4 AND EDGE-DEGREE 9

    E-Print Network [OSTI]

    Mohar, Bojan

    LIGHT SUBGRAPHS IN PLANAR GRAPHS OF MINIMUM DEGREE 4 AND EDGE-DEGREE 9 B. MOHAR , R. SKREKOVSKI vertices of degree 4 are adjacent. A graph H is light in G if there is a constant w such that every graph is w. Then we also write w(H) w. It is proved that the cycle Cs is light if and only if 3 s 6, where

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

  20. Graphs whose normalized Laplacian matrices are separable as density matrices in quantum mechanics

    E-Print Network [OSTI]

    Chai Wah Wu

    2014-07-23T23:59:59.000Z

    Recently normalized Laplacian matrices of graphs are studied as density matrices in quantum mechanics. Separability and entanglement of density matrices are important properties as they determine the nonclassical behavior in quantum systems. In this note we look at the graphs whose normalized Laplacian matrices are separable or entangled. In particular, we show that the number of such graphs is related to the number of 0-1 matrices that are line sum symmetric and to the number of graphs with at least one vertex of degree 1.

  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. Transitive closure and metric inequality of weighted graphs: detecting protein interaction modules using cliques

    E-Print Network [OSTI]

    Ding, Chris; He, Xiaofeng; Xiong, Hui; Peng, Hanchuan; Holbrook, Stephen R.

    2006-01-01T23:59:59.000Z

    Closure and Metric Inequality of Weighted Graphs – Detectingleads to a transitivity inequality which is equivalentto ultra-metric inequality. This can be used to de?ne

  3. Integrative Protein Function Transfer using Factor Graphs and Heterogeneous Data Sources

    E-Print Network [OSTI]

    Mishra, Bud

    Integrative Protein Function Transfer using Factor Graphs and Heterogeneous Data Sources Antonina, translation initiation, enzymatic catalysis, and immune re- sponse. However, for a large portion of proteins

  4. Global Binary Optimization on Graphs for Classification of High-Dimensional Data

    E-Print Network [OSTI]

    Merkurjev, E; Bae, E; Bertozzi, AL; Tai, XC

    2015-01-01T23:59:59.000Z

    J.H. : Convergence and energy landscape for Cheeger cutmax-flow algorithms for energy minimization in vision. IEEER. : Fast approxi- mate energy minimization via graph cuts.

  5. A.V. Technology Manufacturing Page 1 of 4 PON-11-604 Attachment C

    E-Print Network [OSTI]

    A.V. Technology Manufacturing Page 1 of 4 PON-11-604 Attachment C Attachment C Instructions are additional instructions for the items in the Scope of Work. At the end of these instructions that contain a Critical Project Review. Add additional rows as necessary. II. Key Name List List key parties

  6. Improving User Decisions about Opening Potentially Dangerous Attachments in Email Clients

    E-Print Network [OSTI]

    Brustoloni, José Carlos

    Improving User Decisions about Opening Potentially Dangerous Attachments in Email Clients Ricardo Pittsburgh, PA 15213 adbrooks@andrew.cmu.edu ABSTRACT To prevent users from opening potentially dangerous), whereby the email client detects that the user is about to open a potentially dangerous attachment

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

  8. Three-dimensional terminally attached self-avoiding walks and bridges

    E-Print Network [OSTI]

    Nathan Clisby; Andrew R. Conway; Anthony J. Guttmann

    2015-04-08T23:59:59.000Z

    We study terminally attached self-avoiding walks and bridges on the simple-cubic lattice, both by series analysis and Monte Carlo methods. We provide strong numerical evidence supporting a scaling relation between self-avoiding walks, bridges, and terminally attached self-avoiding walks, and posit that a corresponding amplitude ratio is a universal quantity.

  9. Low-Energy (0.1 eV) Electron Attachment SS Bond Cleavage

    E-Print Network [OSTI]

    Simons, Jack

    Low-Energy (0.1 eV) Electron Attachment S­S Bond Cleavage Assisted by Coulomb Stabilization Department of Chemistry, University of Gdansk, Gdansk, Poland Received 12 September 2004; accepted 13 October], very low-energy elec- trons are attached to the gaseous sample, after which specific bonds break

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

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

  12. This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research

    E-Print Network [OSTI]

    Lai, Hong-jian

    with reduced vulnerability to attack and in studying the World Wide Web, and a similar function is useful cases authors are permitted to post their version of the article (e.g. in Word or Tex form 9 June 2010 Keywords: Balanced graphs 1-balanced graphs Cartesian product of graphs Web graphs a b

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

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

  15. Abstract--A wide variety of DSP design tools have been developed that incorporate dataflow graph representations into

    E-Print Network [OSTI]

    Bhattacharyya, Shuvra S.

    framework for construction and manipulation of dataflow graphs for DSP system design. To facilitate design of complex systems, our framework includes a powerful integration of C-based procedural programming topologies increases, textual manipulation of graph specifications becomes increasingly important

  16. Groups generated by bounded automata and their schreier graphs 

    E-Print Network [OSTI]

    Bondarenko, Ievgen

    2009-05-15T23:59:59.000Z

    by Bounded Automata and Their Schreier Graphs. (December 2007) Ievgen Bondarenko, B.S., National Taras Shevchenko University of Kyiv, Ukraine; M.S., National Taras Shevchenko University of Kyiv, Ukraine Chair of Advisory Committee: Dr. Rostislav Grigorchuk... maps In Chapter III we study spectral properties and iterations of piecewise linear maps of the form fK(v) = min A?K Av, v?RN, (1.1) where K is a finite set of nonnegative square matrices of fixed dimension and by ?min? we mean component-wise minimum...

  17. Groups generated by bounded automata and their schreier graphs 

    E-Print Network [OSTI]

    Bondarenko, Ievgen

    2008-10-10T23:59:59.000Z

    by Bounded Automata and Their Schreier Graphs. (December 2007) Ievgen Bondarenko, B.S., National Taras Shevchenko University of Kyiv, Ukraine; M.S., National Taras Shevchenko University of Kyiv, Ukraine Chair of Advisory Committee: Dr. Rostislav Grigorchuk... maps In Chapter III we study spectral properties and iterations of piecewise linear maps of the form fK(v) = min A?K Av, v?RN, (1.1) where K is a finite set of nonnegative square matrices of fixed dimension and by “min” we mean component-wise minimum...

  18. AGE: a distributed environment for creating interactive animations of graphs

    E-Print Network [OSTI]

    Veatch, Timothy Richard

    1990-01-01T23:59:59.000Z

    Facility . 5. Aesthetics B. Enhancements . C. Summary REFERENCES 72 73 75 76 80 81 APPENDIX A: ACCESS TO AGE 86 APPENDIX B: SOURCE CODE SUMMARY 93 APPENDIX C: CLIENT PRIMITIVES 98 1. AGESOCKET CONNECT . 2. AGEJvlESSAGE READ. . . 3... to the object with the mouse and selecting one of the operations from the menu that pops-up. This method proves simple enough for beginners and is quick enough for experts. In order to be useful in many situations, a set of primitive graph operations has been...

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

  20. JACOBIANS OF NEARLY COMPLETE AND THRESHOLD GRAPHS SERGUEI NORINE AND PETER WHALEN

    E-Print Network [OSTI]

    Norin, Sergey

    to it as the sandpile group [7]. Seven years later, Bacher et al referred to it alternatively as the Picard group. The Jacobian of a graph, also known as the Picard Group, Sandpile Group, or Critical Group, is a discrete is odd, where k is such that the order of the group is the number of spanning trees of the graph

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

  2. An Updated Taxonomy of Evolutionary Computation Problems using Graph-based

    E-Print Network [OSTI]

    Ashlock, Dan

    An Updated Taxonomy of Evolutionary Computation Problems using Graph-based Evolutionary Algorithms some other groups of problems scatter across the taxonomy. This paper updates an earlier taxonomy of 23, for the self-avoiding-walk problems corrects, a taxonomy of 23 problems given in [8]. The list of graphs

  3. Contraction decomposition in h-minor-free graphs and algorithmic applications

    E-Print Network [OSTI]

    Demaine, Erik D.

    We prove that any graph excluding a fixed minor can have its edges partitioned into a desired number k of color classes such that contracting the edges in any one color class results in a graph of treewidth linear in k. ...

  4. Fault-Tolerant Exploration of an Unknown Dangerous Graph by Scattered Agents

    E-Print Network [OSTI]

    Flocchini, Paola

    Fault-Tolerant Exploration of an Unknown Dangerous Graph by Scattered Agents Paola Flocchini1 a network where there are dangerous sites (black holes) that eliminate any incoming searcher without leaving a discernible trace. Dangerous graph exploration (Dge) extends the Bhs problem to include dangerous links (black

  5. Management of Security Policy Configuration using a Semantic Threat Graph Approach

    E-Print Network [OSTI]

    Foley, Simon

    Management of Security Policy Configuration using a Semantic Threat Graph Approach Simon N. Foley, in turn, unnec- essarily expose the enterprise to known threats. This paper proposes a threat management Threat Graphs, a variation of the tradi- tional Threat/Attack Tree, extended in order to relate semantic

  6. KOHONEN NETWORKS WITH GRAPH-BASED AUGMENTED METRICS Peter Andras and Olusola Idowu

    E-Print Network [OSTI]

    Andras, Peter

    include: bisecting k-means clustering [2], principal component analysis [3], independent component that is based on the comparison of word consecutiveness graphs of documents. We show that using the proposed distance metric comparison of word frequency vectors. Our results indicate that word consecutiveness graph

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

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

    E-Print Network [OSTI]

    in Combustion Simulations · Application: ­ Simulation of premixed lean hydrogen flames under different levels TVCG, Analyzing and tracking burning structures in lean premixed hydrogen flames] #12;Feature Tracking Using Reeb Graphs 11 Tracking Graph Extraction Pipeline 1. Concatenate to obtain 4D mesh 2. Extract

  9. THE RADIO NUMBERS OF ALL GRAPHS OF ORDER n AND DIAMETER n -2

    E-Print Network [OSTI]

    Tomova, Maggy

    THE RADIO NUMBERS OF ALL GRAPHS OF ORDER n AND DIAMETER n - 2 KATHERINE BENSON, MATTHEW PORTER, AND MAGGY TOMOVA Abstract. A radio labeling of a connected graph G is a function c : V (G) Z+ such that for every two distinct vertices u and v of G distance(u, v) + |c(u) - c(v)| 1 + diameter(G). The radio

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

  11. Scheduling tree-shaped task graphs to minimize memory and makespan

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    Scheduling tree-shaped task graphs to minimize memory and makespan Loris Marchal CNRS experimental evaluation using realistic trees. Keywords-scheduling; makespan-memory tradeoff; tree- shaped task.vivien@inria.fr Abstract--This paper investigates the execution of tree- shaped task graphs using multiple processors. Each

  12. NEW DATA MODEL FOR GRAPH-CUT SEGMENTATION: APPLICATION TO AUTOMATIC MELANOMA DELINEATION

    E-Print Network [OSTI]

    Lezoray, Olivier

    NEW DATA MODEL FOR GRAPH-CUT SEGMENTATION: APPLICATION TO AUTOMATIC MELANOMA DELINEATION R. K but also texture and shape information. For melanoma images, we also introduce skin chromophore features- tion to melanoma delineation compares favorably to manual delineation and related graph

  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. Timed Event Graphs with variable resources: asymptotic behavior, representation in (min,+)

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    -1032" #12;1. Introduction Timed Event Graphs (TEG's), which constitute a subclass of timed Petri nets precisely, we define a class of timed Petri nets, called TEG's with variable resources, which can be likened to linear time-varying systems over ´Ñ Ò ·µ algebra - a particular dioid. These graphs (TEG's on which

  15. Disturbance Decoupling of Timed Event Graphs by output feedback controller Mehdi Lhommeau, Laurent Hardouin, Bertrand Cottenceau

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    .hardouin, bertrand.cottenceau]@istia.univ-angers.fr Abstract This paper deals with control of Timed Event Graphs (TEG). In a first part the disturbance decoupling problem for TEG is defined. In a second part we propose is introduced for a particular class of Discrete Event Dynamic Systems (DEDS) called Timed Event Graphs (TEG

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

  17. Enterprise Social Network Analysis and Modeling: A Tale of Two Graphs

    E-Print Network [OSTI]

    Li, Li Erran

    Enterprise Social Network Analysis and Modeling: A Tale of Two Graphs Jin Cao1, Hongyu Gao2, Li to understand how people are using these social networks. Unlike the public social networks like Facebook social networks are also governed by an organization graph. Based on a six month dataset collected from

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

  19. Covering Cuts in Bridgeless Cubic Graphs Sylvia BOYD, Satoru IWATA, Kenjiro TAKAZAWA

    E-Print Network [OSTI]

    are interested in algorithms for finding 2-factors that cover certain prescribed edge-cuts in bridgeless cubic graphs. We present an algorithm for finding a minimum-weight 2-factor covering all the 3-edge cuts for finding a 2-factor covering all the 3- and 4-edge cuts in bridgeless cubic graphs. Both

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

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

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

  3. Massive Scale Cyber Traffic Analysis: A Driver for Graph Database Research

    SciTech Connect (OSTI)

    Joslyn, Cliff A.; Choudhury, S.; Haglin, David J.; Howe, Bill; Nickless, William K.; Olsen, Bryan K.

    2013-06-19T23:59:59.000Z

    We describe the significance and prominence of network traffic analysis (TA) as a graph- and network-theoretical domain for advancing research in graph database systems. TA involves observing and analyzing the connections between clients, servers, hosts, and actors within IP networks, both at particular times and as extended over times. Towards that end, NetFlow (or more generically, IPFLOW) data are available from routers and servers which summarize coherent groups of IP packets flowing through the network. IPFLOW databases are routinely interrogated statistically and visualized for suspicious patterns. But the ability to cast IPFLOW data as a massive graph and query it interactively, in order to e.g.\\ identify connectivity patterns, is less well advanced, due to a number of factors including scaling, and their hybrid nature combining graph connectivity and quantitative attributes. In this paper, we outline requirements and opportunities for graph-structured IPFLOW analytics based on our experience with real IPFLOW databases. Specifically, we describe real use cases from the security domain, cast them as graph patterns, show how to express them in two graph-oriented query languages SPARQL and Datalog, and use these examples to motivate a new class of "hybrid" graph-relational systems.

  4. Privacy-Preserving Query over Encrypted Graph-Structured Data in Cloud Computing

    E-Print Network [OSTI]

    Hou, Y. Thomas

    Privacy-Preserving Query over Encrypted Graph-Structured Data in Cloud Computing Ning Cao, Zhenyu, Chicago, IL 60616 Email: {cong, kren}@ece.iit.edu Abstract-- In the emerging cloud computing paradigm of privacy-preserving query over encrypted graph-structured data in cloud computing (PPGQ), and establish

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

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

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

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

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

  10. Methods for attaching polymerizable ceragenins to water treatment membranes using amine and amide linkages

    DOE Patents [OSTI]

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

    2013-10-15T23: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.

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

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

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

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

    E-Print Network [OSTI]

    Alfonso, Laura Magdalena

    2000-01-01T23:59:59.000Z

    . Childhood aggression has been linked with both the avoidant and disorganized attachment styles (Lyons-Ruth, 1996; Greenberg, Speltz, DeKlyen & Endriga, 1993; Barnett & Vondra, 1999). This finding has spurred interventions, such as mentoring, that have...

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

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

  17. J. Field Ornithol. 73(3):276280, 2002 Evaluation of two techniques for attaching radio

    E-Print Network [OSTI]

    transmitters to turkey poults Jeff Bowman,1,4 Mark C. Wallace,1 Warren B. Ballard,1 John H. Brunjes IV,1 of transmitter retention times (average 10 to 14 d). Mauser and Jarvis (1991) modified the glue attachment method

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

  19. Adult attachment and self-construal: a cross-cultural analysis 

    E-Print Network [OSTI]

    Friedman, Michael David

    2009-06-02T23:59:59.000Z

    A cross-cultural survey study examined the impact of adult attachment and self-construal on relationship and mental health outcomes in Hong Kong, Mexico, and the United States. Approximately 200 university students (each ...

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