National Library of Energy BETA

Sample records for graphs attachment 3-sampling

  1. Hamiltonian Dynamics of Preferential Attachment

    E-Print Network [OSTI]

    Zuev, Konstantin; Krioukov, Dmitri

    2015-01-01

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

  2. Graph500 [1] Graph500

    E-Print Network [OSTI]

    ab cBFSd ab 64 64 cBFSd bKernel 1c 14 Web VLSI Graph500 [1] Graph500 Top 500 Graph (Compressed Sparse Row)CSC (Compressed SparseColumn)cBFS BFSBFSdBFS BFS 1 5 2-2 BFS Graph500 OpenMP MPICrayExpand CQ C CQ CQPREDNQ CQ FoldPRED FoldCQCQ Fold CQ Fold Expand (R-1)fold(C-1) 2 3 Graph500 3 Graph

  3. Hamiltonian Dynamics of Preferential Attachment

    E-Print Network [OSTI]

    Konstantin Zuev; Fragkiskos Papadopoulos; Dmitri Krioukov

    2015-04-29

    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.

  4. Graphs in machine learning: an introduction

    E-Print Network [OSTI]

    Latouche, Pierre

    2015-01-01

    Graphs are commonly used to characterise interactions between objects of interest. Because they are based on a straightforward formalism, they are used in many scientific fields from computer science to historical sciences. In this paper, we give an introduction to some methods relying on graphs for learning. This includes both unsupervised and supervised methods. Unsupervised learning algorithms usually aim at visualising graphs in latent spaces and/or clustering the nodes. Both focus on extracting knowledge from graph topologies. While most existing techniques are only applicable to static graphs, where edges do not evolve through time, recent developments have shown that they could be extended to deal with evolving networks. In a supervised context, one generally aims at inferring labels or numerical values attached to nodes using both the graph and, when they are available, node characteristics. Balancing the two sources of information can be challenging, especially as they can disagree locally or globall...

  5. ATTACHMENT G

    Office of Environmental Management (EM)

    Grid Locations G.7-2 Technical Area 54, Area G, Pad 3 Outdoor Container Storage Unit Drainage Sampling Locations v Attachment G.7--TA-54 Area G Pad 3 Outdoor Closure Plan Los...

  6. Graph Theory

    SciTech Connect (OSTI)

    Sanfilippo, Antonio P.

    2005-12-27

    Graph theory is a branch of discrete combinatorial mathematics that studies the properties of graphs. The theory was pioneered by the Swiss mathematician Leonhard Euler in the 18th century, commenced its formal development during the second half of the 19th century, and has witnessed substantial growth during the last seventy years, with applications in areas as diverse as engineering, computer science, physics, sociology, chemistry and biology. Graph theory has also had a strong impact in computational linguistics by providing the foundations for the theory of features structures that has emerged as one of the most widely used frameworks for the representation of grammar formalisms.

  7. Utilization Graphs

    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: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity ofkandz-cm11 Outreach Home RoomPreservationBio-Inspired SolarAbout /Two0 -Using supercritical carbon dioxide as aGraphs

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

    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.

  9. Graphs, matrices, and the GraphBLAS: Seven good reasons

    SciTech Connect (OSTI)

    Kepner, Jeremy; Bader, David; Buluç, Ayd?n; Gilbert, John; Mattson, Timothy; Meyerhenke, Henning

    2015-01-01

    The analysis of graphs has become increasingly important to a wide range of applications. Graph analysis presents a number of unique challenges in the areas of (1) software complexity, (2) data complexity, (3) security, (4) mathematical complexity, (5) theoretical analysis, (6) serial performance, and (7) parallel performance. Implementing graph algorithms using matrix-based approaches provides a number of promising solutions to these challenges. The GraphBLAS standard (istcbigdata.org/GraphBlas) is being developed to bring the potential of matrix based graph algorithms to the broadest possible audience. The GraphBLAS mathematically defines a core set of matrix-based graph operations that can be used to implement a wide class of graph algorithms in a wide range of programming environments. This paper provides an introduction to the GraphBLAS and describes how the GraphBLAS can be used to address many of the challenges associated with analysis of graphs.

  10. Graphs, matrices, and the GraphBLAS: Seven good reasons

    DOE Public Access Gateway for Energy & Science Beta (PAGES Beta)

    Kepner, Jeremy; Bader, David; Buluç, Ayd?n; Gilbert, John; Mattson, Timothy; Meyerhenke, Henning

    2015-01-01

    The analysis of graphs has become increasingly important to a wide range of applications. Graph analysis presents a number of unique challenges in the areas of (1) software complexity, (2) data complexity, (3) security, (4) mathematical complexity, (5) theoretical analysis, (6) serial performance, and (7) parallel performance. Implementing graph algorithms using matrix-based approaches provides a number of promising solutions to these challenges. The GraphBLAS standard (istcbigdata.org/GraphBlas) is being developed to bring the potential of matrix based graph algorithms to the broadest possible audience. The GraphBLAS mathematically defines a core set of matrix-based graph operations that can be used to implementmore »a wide class of graph algorithms in a wide range of programming environments. This paper provides an introduction to the GraphBLAS and describes how the GraphBLAS can be used to address many of the challenges associated with analysis of graphs.« less

  11. Dismantling sparse random graphs

    E-Print Network [OSTI]

    Janson, Svante

    2007-01-01

    We consider the number of vertices that must be removed from a graph G in order that the remaining subgraph has no component with more than k vertices. Our principal observation is that, if G is a sparse random graph or a random regular graph on n vertices with n tending to infinity, then the number in question is essentially the same for all values of k such that k tends to infinity but k=o(n).

  12. Graph Generator Survey

    SciTech Connect (OSTI)

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

    2013-12-01

    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.

  13. Spectral Graph Theory

    E-Print Network [OSTI]

    *D. J. Kelleher

    2011-09-30

    Spectral Graph Theory. *D. J. Kelleher2. 2Department of Mathematics. University of Connecticut. UConn— SIGMA Seminar — Fall 2011. D. J. Kelleher. Spectral ...

  14. Vacuum Energy in Quantum Graphs 

    E-Print Network [OSTI]

    Wilson, Justin

    2007-07-14

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

  15. Attachment H1

    Office of Environmental Management (EM)

    ATTACHMENT H1 Page H1-ii LIST OF FIGURES Figure Title Figure H1-1 Spatial View of WIPP Surface and Underground Facilities Figure H1-2 Standard Waste Box and Seven-Pack...

  16. Switching Graphs Jan Friso Groote

    E-Print Network [OSTI]

    Groote, Jan Friso

    Switching Graphs Jan Friso Groote J.F.Groote@tue.nl Bas Ploeger S.C.W.Ploeger@tue.nl Department The Netherlands Abstract Switching graphs are graphs containing switches. By using boolean functions called switch settings, these switches can be put in a fixed direction to obtain an ordinary graph. For many problems

  17. Graph Automatic Semigroups Rachael Carey

    E-Print Network [OSTI]

    St Andrews, University of

    Graph Automatic Semigroups Rachael Carey NBSAN St Andrews 22/04/2015 Rachael Carey NBSAN St Andrews Graph Automatic Semigroups #12;Regular languages An alphabet is a set of symbols.The elements are accepted by finite state automata. Rachael Carey NBSAN St Andrews Graph Automatic Semigroups #12;Graph

  18. A Characterization of Seymour Graphs

    E-Print Network [OSTI]

    Kostochka, Alexandr V.

    A Characterization of Seymour Graphs A. A. Ageev and A. V. Kostochka,* INSTITUTE OF MATHEMATICS undirected graph G is called a Seymour graph if the maximum number of edge disjoint T-cuts is equal to be subfamilies of Seymour graphs (Seymour J. Comb. Theory B 49 (1990), 189­222; Proc. London Math. Soc. Ser. (3

  19. Micromechanical die attachment surcharge

    DOE Patents [OSTI]

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

    2002-01-01

    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.

  20. A Graph Bottleneck Inequality

    E-Print Network [OSTI]

    Chebotarev, Pavel

    2008-01-01

    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.

  1. Graph similarity and matching

    E-Print Network [OSTI]

    Zager, Laura (Laura A.)

    2005-01-01

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

  2. Graph Grammars Matilde Marcolli

    E-Print Network [OSTI]

    Marcolli, Matilde

    to computer science, Lecture Notes in Computer Science, Vol. 532, Springer, 1990. G. Rozenberg, Handbook Grammars H. Ehrig, K. Ehrig, U. Prange, G. Taentzer, Fundamentals of algebraic graph transformation. New

  3. Ceramic blade attachment system

    DOE Patents [OSTI]

    Boyd, Gary L. (Alpine, CA)

    1994-01-01

    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.

  4. Ceramic blade attachment system

    DOE Patents [OSTI]

    Boyd, G.L.

    1994-12-13

    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.

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

    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.

  6. Magnetically attached sputter targets

    DOE Patents [OSTI]

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

    1994-02-15

    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.

  7. Phylogenetic Toric Varieties on Graphs 

    E-Print Network [OSTI]

    Buczynska, Weronika J.

    2010-10-12

    We define the phylogenetic model of a trivalent graph as a generalization of a binary symmetric model of a trivalent phylogenetic tree. If the underlining graph is a tree, the model has a parametrization that can be expressed ...

  8. Open Graphs and Computational Reasoning 

    E-Print Network [OSTI]

    Dixon, Lucas; Ross, Duncan; Aleks, Kissinger

    2010-01-01

    We present a form of algebraic reasoning for computational objects which are expressed as graphs. Edges describe the flow of data between primitive operations which are represented by vertices. These graphs have an interface ...

  9. Subdominant pseudoultrametric on graphs

    SciTech Connect (OSTI)

    Dovgoshei, A A; Petrov, E A

    2013-08-31

    Let (G,w) be a weighted graph. We find necessary and sufficient conditions under which the weight w:E(G)?R{sup +} can be extended to a pseudoultrametric on V(G), and establish a criterion for the uniqueness of such an extension. We demonstrate that (G,w) is a complete k-partite graph, for k?2, if and only if for any weight that can be extended to a pseudoultrametric, among all such extensions one can find the least pseudoultrametric consistent with w. We give a structural characterization of graphs for which the subdominant pseudoultrametric is an ultrametric for any strictly positive weight that can be extended to a pseudoultrametric. Bibliography: 14 titles.

  10. Temporal Representation in Semantic Graphs

    SciTech Connect (OSTI)

    Levandoski, J J; Abdulla, G M

    2007-08-07

    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.

  11. Self-testing graph states

    E-Print Network [OSTI]

    Matthew McKague

    2010-10-11

    We give a construction for a self-test for any connected graph state. In other words, for each connected graph state we give a set of non-local correlations that can only be achieved (quantumly) by that particular graph state and certain local measurements. The number of correlations considered is small, being linear in the number of vertices in the graph. We also prove robustness for the test.

  12. Geometry of graph varieties

    E-Print Network [OSTI]

    Martin, Jeremy L.

    2003-01-01

    TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 355, Number 10, Pages 4151{4169 S 0002-9947(03)03321-X Article electronically published on May 15, 2003 GEOMETRY OF GRAPH VARIETIES JEREMY L. MARTIN Abstract. A picture P of a graph G =(V...;E) consists of a point P(v)foreach vertex v2V and a line P(e)foreachedgee2E, all lying in the projective plane over a eld k and subject to containment conditions corresponding to incidence in G.Agraph variety is an algebraic set whose points parametrize...

  13. Ramsey Minimal Graphs Bela Bollobas

    E-Print Network [OSTI]

    Kohayakawa, Yoshiharu

    Ramsey Minimal Graphs B´ela Bollob´as Department of Mathematical Sciences University of Memphis of the edges of contains a red copy of G or a blue copy of H. A pair of graphs (G, H) is said to be Ramsey- connected graph that does not contain induced cycles of length at least , then the pair (Ck , H) is Ramsey

  14. Densities in graphs and matroids 

    E-Print Network [OSTI]

    Kannan, Lavanya

    2009-05-15

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

  15. Figure 1. Schematic of initial air pump design Design of Air Pump System Using Bond Graph

    E-Print Network [OSTI]

    Fernandez, Thomas

    , is presented in Figure 1. It is a vibratory pump in which an electromagnetic circuit drives a small permanent magnet attached to a pivoted lever that, in turn, drives a rubber bellows pump. The bellows pump has an embryo bond graph model. Parameters for the GP search process must be set to control both the generation

  16. Turbine nozzle attachment system

    DOE Patents [OSTI]

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

    1995-01-01

    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.

  17. Turbine nozzle attachment system

    DOE Patents [OSTI]

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

    1995-10-24

    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.

  18. Quantum chaos on discrete graphs

    E-Print Network [OSTI]

    Uzy Smilansky

    2007-04-26

    Adapting a method developed for the study of quantum chaos on {\\it quantum (metric)} graphs \\cite {KS}, spectral $\\zeta$ functions and trace formulae for {\\it discrete} Laplacians on graphs are derived. This is achieved by expressing the spectral secular equation in terms of the periodic orbits of the graph, and obtaining functions which belongs to the class of $\\zeta$ functions proposed originally by Ihara \\cite {Ihara}, and expanded by subsequent authors \\cite {Stark,Sunada}. Finally, a model of "classical dynamics" on the discrete graph is proposed. It is analogous to the corresponding classical dynamics derived for quantum graphs \\cite {KS}.

  19. Finite Prime Distance Graphs and 2-Odd Graphs Joshua D. Laison, Colin Starr, and Andrea Walker

    E-Print Network [OSTI]

    Laison, Josh

    that trees, cycles, and bipartite graphs are prime distance graphs, and that Dutch windmill graphs and paper, Vinogradov's Theorem, and Ramar´e's Theorem, respectively; and we show that Dutch windmill graphs and paper

  20. The graph bottleneck identity

    E-Print Network [OSTI]

    Chebotarev, Pavel

    2010-01-01

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

  1. Clitic Attachment in Brazilian Portuguese

    E-Print Network [OSTI]

    Simoes, Antonio Roberto Monteiro

    2006-05-01

    Theoretical Linguistics Prepared by Stanley Whitley Clitic Attachment in Brazilian Portuguese Antonio R. M. Simoes University of Kansas Abstract: Teaching and learning the placement of clitics in Brazilian Portuguese is a challenge, especially... style, can be represented phonetically as follows: Simoes, Antonio R. M. "Clitic Attachment in Brazilian Portuguese" Hispania 89.2 (2006): 380-389 Clitic Attachment in Brazilian Port tig a ese 381 TaWe 1 Peninsular Portuguese (port gal] ( VCX ( VC...

  2. Ceramic blade attachment system

    DOE Patents [OSTI]

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

    1996-12-03

    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.

  3. Ceramic blade attachment system

    DOE Patents [OSTI]

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

    1996-01-01

    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.

  4. Attachment 6 - Government Property List

    National Nuclear Security Administration (NNSA)

    2 EQUIPMENT - HANDHELD COMPUTER - WIRELESS WHEEL LOAD SYSTEM 1 EQUIPMENT - HEAT STRESS MONITOR 5 EQUIPMENT - HOIST - PORTABLE 1 November 20, 2013 DE-SOL-0005982 Attachment 6...

  5. Adventures in Graph Ramsey Theory /

    E-Print Network [OSTI]

    Parrish, Andrew T.

    2013-01-01

    1.1 Additive Ramsey theory . . . . . . . . . . .3.1 Large Ramsey . . . . . . . . . . . . . . .additive- and graph-Ramsey theory 1.3 The compactness

  6. Laplacian spectral characterization of products of complete graphs with trees, unicyclic graphs, and bicyclic graphs

    E-Print Network [OSTI]

    Wang, Suijie

    2010-01-01

    In this paper, we give a Laplacian characterization of the product of the complete graphs $K_m$ with trees, unicyclic graphs, and bicyclic graphs. More precisely, let $G$ be a connected graph with at most two independent cycles. If $G$ is neither $C_{6}$ nor $\\Theta_{3,2,5}$ and determined by its Laplacain spectrum, then the product $G\\times K_{m}$ is also a graph determined by its Laplacian spectrum. In addition, we find the cosepctral graphs of $C_{6}\\times K_{m}$ and $\\Theta_{3,2,5}\\times K_{m}$, where the case $m=1$ is shown in Figure \\ref{F1} and \\ref{F2}.

  7. Ceramic blade attachment system

    DOE Patents [OSTI]

    Shaffer, J.E.

    1995-07-11

    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.

  8. Ceramic blade attachment system

    DOE Patents [OSTI]

    Shaffer, James E. (Maitland, FL)

    1995-01-01

    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.

  9. Ceramic blade attachment system

    DOE Patents [OSTI]

    Shaffer, James E. (Maitland, FL)

    1995-01-01

    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.

  10. Ceramic blade attachment system

    DOE Patents [OSTI]

    Shaffer, J.E.

    1995-01-10

    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.

  11. Graph Algorithms in the Internet Age

    E-Print Network [OSTI]

    Stanton, Isabelle Lesley

    2012-01-01

    5.2 Classic Matching Algorithms . . . . . . . . . . . . .4.3 Analysis of Algorithms on Random Graphs . . . . . . . .Graph Problems 5 An Introduction to Matching Algorithms 5.1

  12. Generating Reports & Graphs in Portfolio Manager | Department...

    Energy Savers [EERE]

    Generating Reports & Graphs in Portfolio Manager Generating Reports & Graphs in Portfolio Manager This presentation, given through the DOE's Technical Assitance Program (TAP),...

  13. Chromatic scheduling of dynamic data-graph computations

    E-Print Network [OSTI]

    Kaler, Tim (Tim F. S.)

    2013-01-01

    Data-graph computations are a parallel-programming model popularized by programming systems such as Pregel, GraphLab, PowerGraph, and GraphChi. A fundamental issue in parallelizing data-graph computations is the avoidance ...

  14. Constrained Ramsey Numbers of Graphs

    E-Print Network [OSTI]

    Jiang, Tao

    Constrained Ramsey Numbers of Graphs Robert E. Jamison,1 Tao Jiang,2* and Alan C. H. Ling3 1-like trees. � 2002 Wiley Periodicals, Inc. J Graph Theory 42: 1­16, 2003 Keywords: Ramsey; monochromatic edges have the same color and rainbow iff all of its edges have different colors. In classical Ramsey

  15. Doorway mechanism for Dissociative Electron attachment

    E-Print Network [OSTI]

    Simons, Jack

    Doorway mechanism for Dissociative Electron attachment Thomas Sommerfeld Southeastern Louisiana University Hammond, LA Hammond, LA #12;Doorway mechanism for Dissociative Electron attachment Outline Dissociative Electron attachment Doorway mechanism for electron capture Electroninduced Waterloss from

  16. Random rectangular Graphs

    E-Print Network [OSTI]

    Estrada, Ernesto

    2015-01-01

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

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

  18. Attachment 1 - Performance Work Statement

    National Nuclear Security Administration (NNSA)

    including TTR. Waste acceptance services will be performed at the NNSS and at waste generator sites. DE-SOL-0005982 Attachment 1 Page 1 2. Scope of Work 2.1 Requirement: The EPS...

  19. A Study on Set-Graphs

    E-Print Network [OSTI]

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

    2015-04-09

    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.

  20. Rainbow Connection Number of Graph Power and Graph Products

    E-Print Network [OSTI]

    Basavaraju, Manu; Rajendraprasad, Deepak; Ramaswamy, Arunselvan

    2011-01-01

    Rainbow connection number, $rc(G)$, of a connected graph G is the minimum number of colors needed to color its edges, so that every pair of vertices is connected by at least one path in which no two edges are colored the same. In this paper we study the rainbow connection number with respect to three important graph product operations (cartesian product, lexicographic product and strong product) and the operation of graph powering. More specifically we show the following: (Here, $r(G)$ denotes the radius of $G$, an obvious lower bound for $rc(G)$) (1.) For a connected graph $G$, let $G^{k}$ be the k-th power of $G$. We show that for $k \\ge 2$, $r(G^{k}) \\le rc(G^{k}) \\le 2r(G^{k}) + 1$. The upper bound is tight up to an additive constant of 1. (2.) For two-connected, non-trivial graphs $G$ and $H$, let $G \\Box H$ be the Cartesian Product of $G$ and $H$. We show that $r(G \\Box H) \\le rc(G \\Box H)$ $\\le$ $2r(G \\Box H)$. The bound is tight. (3.) For two graphs $G$ and $H$ such that $G$ is a connected, non-trivia...

  1. 38 Chapteri - Functions and Graphs

    E-Print Network [OSTI]

    a) Predict the pollution in 2007, 2010, and 2020. b) Graph the function over the interval [0, 50]. At most, how many y-intercepts can a function have? Explain.

  2. Approximate Graph Products Marc Hellmutha

    E-Print Network [OSTI]

    Stadler, Peter F.

    Approximate Graph Products Marc Hellmutha , Wilfried Imrichb , Werner Kl¨ocklb , Peter F. Stadlera or fingers) can vary independently of other traits, or Email addresses: marc@bioinf.uni-leipzig.de (Marc

  3. Doing time : inducing temporal graphs

    E-Print Network [OSTI]

    Bramsen, Philip James

    2006-01-01

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

  4. Some algorithmic results in graph imbeddings 

    E-Print Network [OSTI]

    Joshi, Sanjay

    1990-01-01

    , is constructed by: 1. joining vertez us in graph G to vertez vr in H by an edge b, and 8. joining vertez uq in graph G to vertez vq in H by an edge V. The figure 2. 2 on the following page shows the double bar amalgamation of graphs Gq and Gq. We select a... vertex pair (un u2) in the graph Gq which are connected by an edge and similar vertex pair (vr, vq) on the graph Gz. The connecting bars b and b' join these two graphs at the selected vertices. 93 From the previous lemmas we can now prove, the mair...

  5. Exploring the Graph of Graphs: Network Evolution and Centrality Distances

    E-Print Network [OSTI]

    Pignolet, Yvonne Anne; Schmid, Stefan; Tredan, Gilles

    2015-01-01

    The topological structure of complex networks has fascinated researchers for several decades, and today we have a fairly good understanding of the types and reoccurring characteristics of many different complex networks. However, surprisingly little is known today about models to compare complex graphs, and quantitatively measure their similarity and dynamics. In the past a variety of node centralities, i.e., functions which assign values to nodes to represent their importance in the graph. Based on such centralities we propose a natural similarity measure for complex networks: the centrality distance $d_C$, the difference between two graphs with respect to a given node centrality $C$. Centrality distances can take the specific roles of the different nodes in the network into account, and have many interesting applications. As a case study, we investigate the evolution of networks with respect to centrality distances and their approximations based on closeness, betweenness, pagerank, clustering and degree cen...

  6. Detecting Tampering in Random Graphs

    E-Print Network [OSTI]

    Pinsky, Ross G

    2012-01-01

    Let $\\mathcal{G}_n=(V_n,E_n)$ be a growing sequence of deterministic finite graphs, with $V_n$ denoting the vertices and $E_n$ denoting the edges. Consider the random graph $\\mathcal{G}_n(p_n)=(V_n, E_n(p_n))$ obtained by including any given edge with probability $p_n$, independent of other edges, and let $P_n^{p_n}$ denote the corresponding probability measure on $\\mathcal{G}_n$. Now tamper with the random graph in some regular way. For example, if $\\mathcal{G}_n$ is the complete graph on $n$ vertices, so that $\\mathcal{G}_n(p_n)$ is the Erdos-Renyi graph, then one might tamper with it by disconnecting all the edges of a randomly chosen vertex, or by adding all the edges of a randomly chosen Hamiltonian path from $\\mathcal{G}_n$, or by adding all the edges of a randomly chosen clique of order $k_n$ from $\\mathcal{G}_n$. Denote the resulting induced measure on $\\mathcal{G}_n$ by $P_n^{p_n,\\text{tamper}}$. The tampering is called \\it detectable\\rm\\ if $\\lim_{n\\to\\infty}||P_n^{p_n,\\text{tamper}}-P_n^{p_n}||_{\\t...

  7. On the Recognition of Four-Directional Orthogonal Ray Graphs

    E-Print Network [OSTI]

    Felsner, Stefan

    class of graphs is also known as grid intersection graphs (GIG), see [9]. The recognition of GIGs is NP

  8. Decidability, Behavioural Equivalences and Infinite Transition Graphs 

    E-Print Network [OSTI]

    Hüttel, Hans

    This thesis studies behavioural equivalences on labelled infinite transition graphs and the role that they can play in the context of modal logics and notions from language theory. A natural class of such infinite graphs ...

  9. Optimization in Geometric Graphs: Complexity and Approximation 

    E-Print Network [OSTI]

    Kahruman-Anderoglu, Sera

    2011-02-22

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

  10. Cops and Robber on Circulant Graphs

    E-Print Network [OSTI]

    Bonato, Anthony

    Edward Island #12;Cops and Robber Played on a finite, simple graph Cops have perfect information TwoCops and Robber on Circulant Graphs Shannon Fitzpatrick John Paul Larkin University of Prince

  11. XII.1-Draft ATTACHMENT XII

    E-Print Network [OSTI]

    Kentucky, University of

    from the catalysis research work on Fischer- Tropsch synthesis work and the reaction engineering. Because of its experience with others in the Fischer-Tropsch Synthesis, the Badger Company was invitedXII.1-Draft ATTACHMENT XII Review of Fischer-Tropsch Work by Gulf Oil The Gulf-Badger process leads

  12. Attachment FY2011-75 OPAM | Department of Energy

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

    OPAM Attachment FY2011-75 OPAM Federal Supply Schedules Attachment FY2011-75 OPAM More Documents & Publications Chapter 8 - Required Sources of Supplies and Services Attachment...

  13. Attached is Policy Flash 2013-44 Acquisition Guide- Allowability...

    Energy Savers [EERE]

    Attached is Policy Flash 2013-44 Acquisition Guide- Allowability of Incurred Costs Attached is Policy Flash 2013-44 Acquisition Guide- Allowability of Incurred Costs Attached is...

  14. Microsoft Word - Policy Flash 2010-77 Attachment | Department...

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

    7 Attachment Microsoft Word - Policy Flash 2010-77 Attachment Microsoft Word - Policy Flash 2010-77 Attachment More Documents & Publications Microsoft Word - Policy Flash 2010-78...

  15. Microsoft Word - Attachment 3 Recovery Act notification | Department...

    Energy Savers [EERE]

    Microsoft Word - Attachment 3 Recovery Act notification Microsoft Word - Attachment 3 Recovery Act notification More Documents & Publications Microsoft Word - Attachment 3 Recovery...

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

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

    1 Attachment 1 Microsoft Word - Policy Flash 2010-81 Attachment 1 Microsoft Word - Policy Flash 2010-81 Attachment 1 More Documents & Publications Microsoft Word - Policy Flash...

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

  18. Some problems in Graph Ramsey Theory

    E-Print Network [OSTI]

    Grinshpun, Andrey Vadim

    2015-01-01

    A graph G is r-Ramsey minimal with respect to a graph H if every r-coloring of the edges of G yields a monochromatic copy of H, but the same is not true for any proper subgraph of G. The study of the properties of graphs ...

  19. Semester Thesis Virus Inoculation on Social Graphs -

    E-Print Network [OSTI]

    Schmid, Stefan

    Semester Thesis Virus Inoculation on Social Graphs - The Friendship Factor Dominic Meier meierdo introduce friendship between neighbors while looking at a virus inoculation game which is played and in the star graph. #12;Virus Inoculation on Social Graphs - The Windfall of Friendship page 2 1 Introduction

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

  1. A heuristic algorithm for graph isomorphism 

    E-Print Network [OSTI]

    Torres Navarro, Luz

    1999-01-01

    polynomial time algorithm O(n?), ISO-MT, that seems' to solve the graph isomorphism decision problem correctly for all classes of graphs. Our algorithm is extremely useful from the practical point of view since counter examples (pairs of graphs for which our...

  2. The Joys of Graph Transformation Arend Rensink

    E-Print Network [OSTI]

    Rensink, Arend

    The Joys of Graph Transformation Arend Rensink Department of Computer Science, University of Twente, the things being changed are graphs. A fundamental assumption in studying such changes, the handbook [21] is a 1 #12;Figure 1: Two graphs with a matching good source); rather, we want to illustrate

  3. River Corridor Closure Contract Section J, Attachment...

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

    DE-AC06-05RL14655 Mod 459 1 ATTACHMENT J-6 ADVANCE AGREEMENT, PERSONNEL, AND RELATED COSTS This attachment will be prepared subsequent to Contract award pursuant to Clause H.15,...

  4. Inf-2101 -Algoritmer Graph Search

    E-Print Network [OSTI]

    Bongo, Lars Ailo

    Inf-2101 - Algoritmer Graph Search John Markus Bjørndalen 2010-09-02 Some foils are adapted from the book and the book's homepage. John Markus Bjørndalen () Inf-2101 - Algoritmer 2010-09-02 1 / 25 #12 John Markus Bjørndalen () Inf-2101 - Algoritmer 2010-09-02 2 / 25 #12;Breadth-first search Depth

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

    E-Print Network [OSTI]

    Rostislav Grigorchuk; Paul-Henry Leemann; Tatiana Nagnibeda

    2015-05-05

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

  6. 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: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity ofkandz-cm11 OutreachProductswsicloudwsicloudden Documentation DataStreamsTotalproposals duenationalMeeting - JuneCOMMISSION

  7. 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: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity of Natural GasAdjustmentsShirleyEnergyTher i n c i p a l De p u t y A s sconveyance of9, 2013 ASERATI Allegheny

  8. Inf-2101 -Algoritmer Graph Search

    E-Print Network [OSTI]

    Bongo, Lars Ailo

    Inf-2101 - Algoritmer Graph Search John Markus Bjørndalen 2011-09-01 Some foils are adapted from the book and the book's homepage. John Markus Bjørndalen () Inf-2101 - Algoritmer 2011-09-01 1 / 16 #12 in the maze. Foil from Sedgewick/Wayne John Markus Bjørndalen () Inf-2101 - Algoritmer 2011-09-01 2 / 16 #12

  9. ON RAMSEY MINIMAL GRAPHS V. R ODL AND M. SIGGERS

    E-Print Network [OSTI]

    Siggers, Mark H.

    ON RAMSEY MINIMAL GRAPHS V. R ¨ODL AND M. SIGGERS Abstract. A graph G is r-ramsey on at most n vertices, each of which is r-ramsey-minimal with respect to the complete graph Kk. Furthermore of graph theory is determining the ramsey number for a graph H. This is the minimum number n such that any

  10. A Characterization of Seymour Graphs A. A. Ageev

    E-Print Network [OSTI]

    Szigeti, Zoltán

    A Characterization of Seymour Graphs A. A. Ageev , A. V. Kostochka and Z. Szigeti Abstract Following Gerards [1] we say that a connected undirected graph G is a Seymour graph if the maximum number (G). Several families of graphs have been shown to be subfamilies of Seymour graphs (Seymour [4

  11. Models of random graph hierarchies

    E-Print Network [OSTI]

    Paluch, Robert; Holyst, Janusz

    2015-01-01

    We introduce two models of inclusion hierarchies: Random Graph Hierarchy (RGH) and Limited Random Graph Hierarchy (LRGH). In both models a set of nodes at a given hierarchy level is connected randomly, as in the Erd\\H{o}s-R\\'{e}nyi random graph, with a fixed average degree equal to a system parameter $c$. Clusters of the resulting network are treated as nodes at the next hierarchy level and they are connected again at this level and so on, until the process cannot continue. In the RGH model we use all clusters, including those of size $1$, when building the next hierarchy level, while in the LRGH model clusters of size $1$ stop participating in further steps. We find that in both models the number of nodes at a given hierarchy level $h$ decreases approximately exponentially with $h$. The height of the hierarchy $H$, i.e. the number of all hierarchy levels, increases logarithmically with the system size $N$, i.e. with the number of nodes at the first level. The height $H$ decreases monotonically with the conne...

  12. Split ring containment attachment device

    DOE Patents [OSTI]

    Sammel, Alfred G. (Pittsburgh, PA)

    1996-01-01

    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.

  13. Counting matchings in irregular bipartite graphs

    E-Print Network [OSTI]

    Marc Lelarge

    2015-07-16

    We give a sharp lower bound on the number of matchings of a given size in a bipartite graph. When specialized to regular bipartite graphs, our results imply Friedland's Lower Matching Conjecture and Schrijver's theorem. It extends the recent work of Csikv\\'ari done for regular and bi-regular bipartite graphs. Moreover, our lower bounds are order optimal as they are attained for a sequence of $2$-lifts of the original graph. We then extend our results to permaments and subpermanents sums. For permanents, we are able to recover the lower bound of Schrijver recently proved by Gurvits using stable polynomials. We provide new lower bounds for subpermanents sums. Our proof borrows ideas from the theory of local weak convergence of graphs, statistical physics and covers of graphs.

  14. Fast generation of sparse random kernel graphs

    DOE Public Access Gateway for Energy & Science Beta (PAGES Beta)

    Hagberg, Aric; Lemons, Nathan; Du, Wen -Bo

    2015-09-10

    The development of kernel-based inhomogeneous random graphs has provided models that are flexible enough to capture many observed characteristics of real networks, and that are also mathematically tractable. We specify a class of inhomogeneous random graph models, called random kernel graphs, that produces sparse graphs with tunable graph properties, and we develop an efficient generation algorithm to sample random instances from this model. As real-world networks are usually large, it is essential that the run-time of generation algorithms scales better than quadratically in the number of vertices n. We show that for many practical kernels our algorithm runs in timemore »at most ?(n(logn)²). As an example, we show how to generate samples of power-law degree distribution graphs with tunable assortativity.« less

  15. Discussiones Mathematicae Graph Theory 34 (2014) 287307

    E-Print Network [OSTI]

    Al Hanbali, Ahmad

    2014-01-01

    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

  16. Maximum Estrada Index of Bicyclic Graphs

    E-Print Network [OSTI]

    Wang, Long; Wang, Yi

    2012-01-01

    Let $G$ be a simple graph of order $n$, let $\\lambda_1(G),\\lambda_2(G),...,\\lambda_n(G)$ be the eigenvalues of the adjacency matrix of $G$. The Esrada index of $G$ is defined as $EE(G)=\\sum_{i=1}^{n}e^{\\lambda_i(G)}$. In this paper we determine the unique graph with maximum Estrada index among bicyclic graphs with fixed order.

  17. Adult attachment style and romantic lovestyle orientation 

    E-Print Network [OSTI]

    Gordon, Melanie Nadine

    1990-01-01

    This study explores the link between attachment theory, developed by Bowlby, Ainsworth, and others, and the adult romantic lovestyle theory developed by Alan Lee. It was hypothesized that one's attachment style to mother, father, and romantic love partner... be correlated with one's lovestyle. Hazan and Shaver's (1987) adult attachment measure and Hendrick, Hendrick, Foote, and Slapion-Foote's (1984) Love Attitudes Scale were employed. In addition, a 36-item Likert-type scale was developed to quantify...

  18. Spectral statistics of nearly unidirectional quantum graphs

    E-Print Network [OSTI]

    Maram Akila; Boris Gutkin

    2015-08-19

    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.

  19. Generation of graph-state streams

    E-Print Network [OSTI]

    Daniel Ballester; Jaeyoon Cho; M. S. Kim

    2010-12-08

    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.

  20. Nuclear reactor multiphysics via bond graph formalism

    E-Print Network [OSTI]

    Sosnovsky, Eugeny

    2014-01-01

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

  1. Methane production by attached film

    DOE Patents [OSTI]

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

    1981-01-01

    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.

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

    E-Print Network [OSTI]

    Zaslavsky, Thomas

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

  3. Appendix DATA Attachment A: WIPP Borehole Update

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

    A: WIPP Borehole Update United States Department of Energy Waste Isolation Pilot Plant Carlsbad Field Office Carlsbad, New Mexico Appendix DATA-2014 Attachment A: WIPP Borehole...

  4. Star graphs and Seba billiards

    E-Print Network [OSTI]

    G. Berkolaiko; E. B. Bogomolny; J. P. Keating

    2000-10-26

    We derive an exact expression for the two-point correlation function for quantum star graphs in the limit as the number of bonds tends to infinity. This turns out to be identical to the corresponding result for certain Seba billiards in the semiclassical limit. Reasons for this are discussed. The formula we derive is also shown to be equivalent to a series expansion for the form factor - the Fourier transform of the two-point correlation function - previously calculated using periodic orbit theory.

  5. A matrix representation of graphs and its spectrum as a graph invariant

    E-Print Network [OSTI]

    David Emms; Edwin R. Hancock; Simone Severini; Richard C. Wilson

    2006-04-05

    We use the line digraph construction to associate an orthogonal matrix with each graph. From this orthogonal matrix, we derive two further matrices. The spectrum of each of these three matrices is considered as a graph invariant. For the first two cases, we compute the spectrum explicitly and show that it is determined by the spectrum of the adjacency matrix of the original graph. We then show by computation that the isomorphism classes of many known families of strongly regular graphs (up to 64 vertices) are characterized by the spectrum of this matrix. We conjecture that this is always the case for strongly regular graphs and we show that the conjecture is not valid for general graphs. We verify that the smallest regular graphs which are not distinguished with our method are on 14 vertices.

  6. Sex, attachment, and the development of reproductive

    E-Print Network [OSTI]

    Maestripieri, Dario

    an integrated evolutionary model of the development of attachment and human reproductive strategies In this article, I present an integrated evolutionary model of the development of attachment and reproductive strat- egies in humans. The model is built on the foundations of life history theory, parental

  7. Ramsey Minimal Graphs B ela Bollob as

    E-Print Network [OSTI]

    Kohayakawa, Yoshiharu

    Ramsey Minimal Graphs B#19;ela Bollob#19;as #3; Department of Mathematical Sciences University to be Ramsey-in#12;nite if there are in#12;nitely many minimal graphs for which we have ! (G; H). Let ` #21; 4 `, then the pair (C k ; H) is Ramsey- in#12;nite for any k #21; `, where C k denotes the cycle of length k

  8. Diagonal Ramsey Numbers in Multipartite Graphs

    E-Print Network [OSTI]

    van Vuuren, Jan H.

    Diagonal Ramsey Numbers in Multipartite Graphs AP Burger , PJP Grobler , EH Stipp & JH van Vuuren September 17, 2003 Abstract The notion of a graph theoretic Ramsey number is generalised by assuming definition. Some small multipartite Ramsey numbers are found, while upper and lower bounds are established

  9. Induced Graph Ramsey Theory Marcus Schaefer

    E-Print Network [OSTI]

    Schaefer, Marcus

    Induced Graph Ramsey Theory Marcus Schaefer School of CTI DePaul University 243 South Wabash Avenue for all graphs, and good upper bounds on induced Ramsey numbers in general, and for particular families (path on four vertices). The proof is a standard Ramsey theory argu­ ment: fix one vertex u of the K 5

  10. Diagonal Ramsey Numbers in Multipartite Graphs

    E-Print Network [OSTI]

    van Vuuren, Jan H.

    Diagonal Ramsey Numbers in Multipartite Graphs AP Burger + , PJP Grobler # , EH Stipp # & JH van Vuuren # September 17, 2003 Abstract The notion of a graph theoretic Ramsey number is generalised as in the classical definition. Some small multipartite Ramsey numbers are found, while upper and lower bounds

  11. DISTRIBUTED PLANNING THROUGH GRAPH MERGING Damien Pellier

    E-Print Network [OSTI]

    Pellier, Damien

    DISTRIBUTED PLANNING THROUGH GRAPH MERGING Damien Pellier Universit´e Paris Descartes, Laboratoire.pellier@parisdescartes.fr Keywords: distributed problem solving, cooperation, coordination, multi-agent planning, planning graphs technics. Abstract: In this paper, we introduce a generic and fresh model for distributed planning called

  12. On the spectra of simplicial rook graphs

    E-Print Network [OSTI]

    Martin, Jeremy L.; Wagner, Jennifer D.

    2014-05-05

    The \\emph{simplicial rook graph} $\\SR(d,n)$ is the graph whose vertices are the lattice points in the $n$th dilate of the standard simplex in $\\mathbb{R}^d$, with two vertices adjacent if they differ in exactly two coordinates. We prove...

  13. Small Alliances in Graphs Rodolfo Carvajal1

    E-Print Network [OSTI]

    Rapaport, Iván

    Small Alliances in Graphs Rodolfo Carvajal1 , Mart´in Matamala1,2 , Ivan Rapaport1,2 , and Nicolas is a (strong defensive) alliance of G if every node in S has at least as many neighbors in S than in V \\S typically belong to small alliances. Despite the fact that finding the smallest alliance in a graph is NP

  14. ACL HLT 2011 TextGraphs-6

    E-Print Network [OSTI]

    Proceedings of the Workshop 23 June, 2011 Portland, Oregon, USA #12;Production and Manufacturing by Omnipress of related graph-based methods. This workshop series is aimed at fostering an exchange of ideas, thanks also to the special theme of this year in the area of machine learning, i.e. Graphs in Structured

  15. Clustering attributed graphs: models, measures and methods

    E-Print Network [OSTI]

    Bothorel, Cecile; Magnani, Matteo; Micenkova, Barbora

    2015-01-01

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

  16. Graph Mining Meets the Semantic Web

    SciTech Connect (OSTI)

    Lee, Sangkeun (Matt) [ORNL; Sukumar, Sreenivas R [ORNL; Lim, Seung-Hwan [ORNL

    2015-01-01

    The Resource Description Framework (RDF) and SPARQL Protocol and RDF Query Language (SPARQL) were introduced about a decade ago to enable flexible schema-free data interchange on the Semantic Web. Today, data scientists use the framework as a scalable graph representation for integrating, querying, exploring and analyzing data sets hosted at different sources. With increasing adoption, the need for graph mining capabilities for the Semantic Web has emerged. We address that need through implementation of three popular iterative Graph Mining algorithms (Triangle count, Connected component analysis, and PageRank). We implement these algorithms as SPARQL queries, wrapped within Python scripts. We evaluate the performance of our implementation on 6 real world data sets and show graph mining algorithms (that have a linear-algebra formulation) can indeed be unleashed on data represented as RDF graphs using the SPARQL query interface.

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

    Energy Savers [EERE]

    Attachment FY2011-46(4) OPAM Attachment FY2011-46(4) OPAM Types of Compliance Requirements Chart Attachment FY2011-46(4) OPAM More Documents & Publications For-Profit Audit...

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

    Energy Savers [EERE]

    3) Attachment FY2011-46(3) PROGRAM-SPECIFIC COMPLIANCE SUPPLEMENTS Attachment FY2011-46(3) More Documents & Publications FLASH2011-46-OPAM Attachment FY2011-46(1) OPAM...

  19. Attachment FY2011-83 OPAM | Department of Energy

    Office of Environmental Management (EM)

    3 OPAM Attachment FY2011-83 OPAM Federal Supply Schedules Attachment FY2011-83 OPAM More Documents & Publications Chapter 8 - Required Sources of Supplies and Services Attachment...

  20. Microsoft Word - Policy Flash 2010-81 Attachment 2 | Department...

    Office of Environmental Management (EM)

    81 Attachment 2 Microsoft Word - Policy Flash 2010-81 Attachment 2 Microsoft Word - Policy Flash 2010-81 Attachment 2 More Documents & Publications ATTACHMENTFLASH2010.81(2)-OPAM...

  1. Microsoft Word - Policy Flash 2011-2 Attachment 1 | Department...

    Energy Savers [EERE]

    Microsoft Word - Policy Flash 2011-2 Attachment 1 Microsoft Word - Policy Flash 2011-2 Attachment 1 Microsoft Word - Policy Flash 2011-2 Attachment 1 More Documents & Publications...

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

    Energy Savers [EERE]

    Microsoft Word - Policy Flash 2010-81 Attachment 1 Microsoft Word - Policy Flash 2010-81 Attachment 1 Microsoft Word - Policy Flash 2010-81 Attachment 1 More Documents &...

  3. Microsoft Word - Policy Flash 2010-67 Attachment 1 | Department...

    Office of Environmental Management (EM)

    67 Attachment 1 Microsoft Word - Policy Flash 2010-67 Attachment 1 Microsoft Word - Policy Flash 2010-67 Attachment 1 More Documents & Publications Acquisition Letter 2009-03...

  4. Attachment FY2011-77 OPAM | Department of Energy

    Office of Environmental Management (EM)

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

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

    Energy Savers [EERE]

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

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

    Energy Savers [EERE]

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

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

    Energy Savers [EERE]

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

  8. Department of Psychology, University of Melbourne Introduction to graph theory

    E-Print Network [OSTI]

    ©Department of Psychology, University of Melbourne Introduction to graph theory Graphs Size and weak components Centrality for directed graphs Some special directed graphs ©Department of Psychology,6),(6,7)} 4 5 6 7 #12;©Department of Psychology, University of Melbourne Size and order The size of G

  9. Minimal comparability completions of arbitrary graphs Pinar Heggernes

    E-Print Network [OSTI]

    Heggernes, Pinar

    Minimal comparability completions of arbitrary graphs Pinar Heggernes Federico Mancini Charis for which completion of arbitrary graphs can be achieved through such a vertex incremental approach. 1 to an arbitrary graph is called a comparability completion of the input graph. Unfortunately, computing

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

  11. DIMACS Technical Report 200337 Perfect interval filament graphs

    E-Print Network [OSTI]

    DIMACS Technical Report 2003­37 Perfect interval filament graphs by Fanica GAVRIL 1 DIMACS, Rutgers are disjoint, their curves do not intersect; FI={ f i | iÎI} is a family of interval filaments and its intersection graph is an interval filament graph. The interval filament graphs contain the polygon

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

    E-Print Network [OSTI]

    Field, David

    What Energy Functions Can Be Minimized via Graph Cuts? Vladimir Kolmogorov, Member, IEEE, and Ramin been developed to solve energy minimization problems in computer vision. Each of these techniques constructs a graph such that the minimum cut on the graph also minimizes the energy. Yet, because these graph

  13. Information inequalities and Generalized Graph Entropies

    E-Print Network [OSTI]

    Sivakumar, Lavanya

    2012-01-01

    In this article, we discuss the problem of establishing relations between information measures assessed for network structures. Two types of entropy based measures namely, the Shannon entropy and its generalization, the R\\'{e}nyi entropy have been considered for this study. Our main results involve establishing formal relationship, in the form of implicit inequalities, between these two kinds of measures when defined for graphs. Further, we also state and prove inequalities connecting the classical partition-based graph entropies and the functional-based entropy measures. In addition, several explicit inequalities are derived for special classes of graphs.

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

  15. Information seeking in attachment style romantic relationships 

    E-Print Network [OSTI]

    Derrick, Jaye Lindsay

    2013-02-22

    seeking about relationship items. No hypotheses were formed for attachment avoidance, and the degree of avoidance alone did not significantly predict information seeking. However, not condition and relationship satisfaction contributed to several...

  16. Chemomechanics of attached and suspended cells

    E-Print Network [OSTI]

    Maloney, John Mapes

    2012-01-01

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

  17. ATTACHMENT 1 Washington State University Vancouver

    E-Print Network [OSTI]

    ATTACHMENT 1 Washington State University Vancouver Stormwater Management Program (SWMP) WSU PERMIT VANCOUVER STORMWATER MANAGEMENT PROGRAM TABLE OF CONTENTS S6.A Stormwater Management Program (SWMP Site Stormwater Runoff Control_______________________ 8 S6.D.5 Post-Construction Stormwater Management

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

    E-Print Network [OSTI]

    Walter, Uta M.; Petr, Chris

    2004-06-01

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

  19. Configurations of polymers attached to probes

    E-Print Network [OSTI]

    Bubis, Roy

    We study polymers attached to spherical (circular) or paraboloidal (parabolic) probes in three (two) dimensions. Both self-avoiding and random walks are examined numerically. The behavior of a polymer of size R[subscript ...

  20. Aggressive children's memory for attachment relevant information 

    E-Print Network [OSTI]

    Collie, Claire Futamase

    2004-09-30

    MEMORY FOR ATTACHMENT RELEVANT INFORMATION A Dissertation by CLAIRE FUTAMASE COLLIE Submitted to the Office of Graduate Studies of Texas A&M University in partial fulfillment of the requirements for the degree of DOCTOR... OF PHILOSOPHY May 2004 Major Subject: Psychology AGGRESSIVE CHILDREN?S MEMORY FOR ATTACHMENT RELEVANT INFORMATION A Dissertation by CLAIRE FUTAMASE COLLIE Submitted to Texas A&M University in partial...

  1. Thermal electron attachment to SO3

    SciTech Connect (OSTI)

    Miller, T.M.; Viggiano, A.A.; Arnold, S.T.; Jayne, J.T.

    1995-04-15

    The rate constant for electron attachment to SO3 is 3 + or - 1 x 10(exp-9) cu cm/s at 300 K, measured in helium gas at pressures from 53 to 160 Pa (0.4 to 1.2 torr). The sole product of attachment is SO3(-) under these conditions. The same rate constant and ionic product were obtained at 400 and 505 K. The measurements were carried out using a flowing-afterglow Langmuir-probe apparatus.

  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. SCALABLE REACHABILITY INDEXING FOR VERY LARGE GRAPHS

    E-Print Network [OSTI]

    Zaki, Mohammed Javeed

    . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 34 iii #12;3. GRAIL: Scalable Reachability Index for Large Graphs . . . . . . . . . . . . . 36 3 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 37 3.3 GRAIL Approach . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 39 3.3.1 Index GRAIL . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 51 4.1 Topological Level Filter

  4. Fault-tolerant dynamic task graph scheduling

    SciTech Connect (OSTI)

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

    2014-11-16

    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.

  5. On semidefinite programming bounds for graph bandwidth

    E-Print Network [OSTI]

    2011-05-24

    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.

  6. Projective representations from quantum enhanced graph symmetries

    E-Print Network [OSTI]

    2015-03-11

    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.

  7. Densities of Minor-Closed Graph Families

    E-Print Network [OSTI]

    Eppstein, David

    2010-01-01

    N. Robertson and P. D. Seymour. Graph Minors. XX. Wagner’sChudnovsky, B. Reed, and P. Seymour. The edge-density for KReferences [1] N. Alon, P. Seymour, and R. Thomas. A

  8. Graph representation of protein free energy landscape

    SciTech Connect (OSTI)

    Li, Minghai; Duan, Mojie; Fan, Jue; Huo, Shuanghong; Han, Li

    2013-11-14

    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.

  9. Random key graphs can have many more triangles than Erdos-Renyi graphs

    E-Print Network [OSTI]

    Yagan, Osman

    , and in the First Workshop on Applications of Graph Theory in Wireless Ad hoc Networks and Sensor Networks (GRAPH-HOC 2009), Chennai (India), December 2009. O. Yagan was with the Department of Electrical and Computer is now with Department of Electrical and Computer Engineering and CyLab, Carnegie Mellon University

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

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

    E-Print Network [OSTI]

    Wu, David

    1 Graph-Theoretic Generation of Assembly Plans Part I: Correct Generation of Precedence Graphs Lehigh University Bethlehem, Pennsylvania Abstract Automatic generation and selection of assembly plans is a problem of great practical importance with many significant cost implications. In this paper, we focus

  12. Composite attachment: the Trek bottom bracket 

    E-Print Network [OSTI]

    Mallard, David

    2013-02-22

    to b'e attached to the frame. The: ='-rr, , ;j, ,tie~. ' =-;, ""~ jj, , ', ' bottom bracket attachment fails the most. often. 's, ~;, . s' C r tp; rac e&j' g~tn f, e'. ' " - -:--'=. '- e. x eii yc i oads, . ; a n n, enforce, applie'd to. 'the...'g the geometry tools, :. The r'esultant'surfaces were ', ' , '~"'", -'1Id~aterial properties were a lied to'each eleme' t of the, 'inodel The material wa's defined, a)ered compo e A' tuiii a tlayer). pro, e "j'as"'Ilefinedeand then the compyoesite...

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

  15. On the topology of graph picture spaces

    E-Print Network [OSTI]

    Martin, Jeremy L.

    2005-03-01

    V and edges E. The d-dimensional picture space Xd(G) is de ned as the projective algebraic set whose points are pictures of G in complex projective d-space Pd = PdC. A picture P consists of a point P(v) 2 Pd for each vertex v of G and a line P...(e) for each edge e, subject to the conditions P(v) 2 P(e) whenever v is an endpoint of e. Two fundamental operations of graph theory are deletion and contraction: given a graph G and an edge e, we may delete e to form a graph G e, or identify the end- points...

  16. MadGraph 5 : Going Beyond

    E-Print Network [OSTI]

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

    2011-06-02

    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.

  17. Methods of attaching erosion-resistant nonmetallic panels

    SciTech Connect (OSTI)

    Girzhel, A.M.

    1984-01-01

    Attachment methods for panels of wear-resistant nonmetallic materials, e.g. cast stone and slag, devitrified slag, and erosion-resistant and heat-resistant concretes to protect hopper, chute, and trough structures at metallurgical and coal industries have been investigated. Attachment methods can be divided into two groups, attachment by adhesives and by mechanical attachment. A new method of mechanical attachment, considered to be much superior to adhesive attachment, provides for reliable fastening without damage to the protected metal structure. Various panel designs may be used depending on the operating conditions.

  18. ON HIGHLY RAMSEY INFINITE GRAPHS M. H. SIGGERS

    E-Print Network [OSTI]

    Siggers, Mark H.

    ON HIGHLY RAMSEY INFINITE GRAPHS M. H. SIGGERS Abstract. We show that, for k 3, there exists that are 2-ramsey-minimal for the odd cycle C2k+1. 1. Introduction A graph G is r-ramsey for a graph H if any r-colouring of the edges of G yields a monochromatic copy of the graph H. G is r-ramsey

  19. A Note on Ramsey Size-Linear Graphs

    E-Print Network [OSTI]

    Simonovits, Miklós

    A Note on Ramsey Size-Linear Graphs P.N. Balister,1 R.H. Schelp,1 and M. Simonovits1,2 1 DEPARTMENT is a Ramsey size-linear graph and x,y 2 V(G ) then if we add a sufficiently long path between x and y we obtain a new Ramsey size-linear graph. As a consequence we show that if G is any graph such that every

  20. Evaluating Graph Coloring on Pascal Grosset, Peihong Zhu, Shusen Liu,

    E-Print Network [OSTI]

    Hall, Mary W.

    any relevant related works for graph coloring on GPUs · Main inspiration: o Gebremedhin and Manne o (G

  1. Discrete Lagrangian Systems on Graphs. Symplecto-Topological Properties

    E-Print Network [OSTI]

    S. P. Novikov; A. S. Schwarz

    2000-04-11

    Discrete Lagrangian Systems on graphs are considered. Vector-valued closed differential 2-form on the space of solutions is constructed. This form takes values in the first homology group of the graph. This construction generalizes the Symplectic Wronskian for the linear self-adjoint operators on graphs found in 1997 by the first author and used for the needs of the Scattering Theory for graphs with tails

  2. 1st Graph Searching in Canada (GRASCan) Workshop

    E-Print Network [OSTI]

    Bonato, Anthony

    Fitzpatrick, University of Prince Edward Island Cops and Robber on Circulant Graphs 11:30 - 12:00 Kieka

  3. VACUUM ENERGY IN QUANTUM GRAPHS A Senior Honors Thesis

    E-Print Network [OSTI]

    VACUUM ENERGY IN QUANTUM GRAPHS A Senior Honors Thesis by JUSTIN HOWARD WILSON Submitted ABSTRACT Vacuum Energy in Quantum Graphs. (April 2007) Justin Howard Wilson Department of Physics the vacuum energy in quantum graphs. Vacuum energy arose in quantum physics but has an independent

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

  5. Realization of some local unitary operations by graph switching

    E-Print Network [OSTI]

    Supriyo Dutta; Bibhas Adhikari; Subhashish Banerjee

    2015-02-27

    In this work we implement a graph theoretical realization of local unitary transformations, implemented by single qubit Pauli gates, by adapting techniques of graph switching. This leads to the concept of local unitary equivalent graphs. We illustrate our method by a few, well known, local unitary transformations implemented by single qubit Pauli and Hadamard gates.

  6. The case against specialized graph analytics engines University of Wisconsin

    E-Print Network [OSTI]

    Willett, Rebecca

    the performance perspec- tive. We present Grail ­ a syntactic layer for querying graph in a vertex-centric way compare Grail to GraphLab and Giraph, and examine the performance implications of using Grail, showing.e. Grail) that presents such a syntactic mapping layer. We present how graph analytics queries using

  7. GRAIL: Scalable Reachability Index for Large Graphs Hilmi Yildirim

    E-Print Network [OSTI]

    Zaki, Mohammed Javeed

    GRAIL: Scalable Reachability Index for Large Graphs Hilmi Yildirim Rensselaer Polytechnic large real-world graphs. We present a very simple, but scalable reachability index, called GRAIL on small graphs, GRAIL is the only index that can scale to millions of nodes and edges. GRAIL has linear

  8. SQLGraph: An Efficient Relational-Based Property Graph , Achille Fokoue

    E-Print Network [OSTI]

    Cortes, Corinna

    [Database Management]: Systems General Terms Property graphs; Gremlin Keywords Property graphs; Relational Storage; Gremlin 1. INTRODUCTION There is increased interest in graph data management re- cently, fueled literature has been on RDF data management (e.g., [39, 18, 27, 24, 6, 25, 16]). Much of this work targets

  9. A Visualization System for Correctness Proofs of Graph Algorithms

    E-Print Network [OSTI]

    Metaxas, Takis

    A Visualization System for Correctness Proofs of Graph Algorithms P.A. Gloor1, D.B. Johnson2, F. Makedon2, P. Metaxas3 Feb. 28, 1993 Running head: Proof Visualization of Graph Algorithms Correspondence proofs of graph algorithms. The system has been demonstrated for a greedy algorithm, Prim's algorithm

  10. A Static Analysis Technique for Graph Transformation Systems

    E-Print Network [OSTI]

    Baldan, Paolo

    A Static Analysis Technique for Graph Transformation Systems Paolo Baldan, Andrea Corradini,andrea,koenigb}@di.unipi.it Abstract. In this paper we introduce a static analysis technique for graph transformation systems. We in a direct and intuitive way. Graph Transformation Systems (GTSs) [18] add to the static description given

  11. Making arbitrary graphs transitively orientable: Minimal comparability completions

    E-Print Network [OSTI]

    Papadopoulos, Charis

    Making arbitrary graphs transitively orientable: Minimal comparability completions Pinar Heggernes to an arbitrary graph is called a comparability completion of the input graph. Unfortunately, computing a comparability completion with the minimum number of added edges (called a minimum completion) is an NP

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

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

  14. Multivariate Graphs in Software Engineering and A. Telea2

    E-Print Network [OSTI]

    Telea, Alexandru C.

    Multivariate Graphs in Software Engineering S. Diehl1 and A. Telea2 1 Department of Computer, the Netherlands Abstract. Multivariate networks, or graphs, are an essential element of various activities. In this chapter, we present the specific context in which multivariate graphs occur in software engineering

  15. Cellular Algebras and Graph Invariants Based on Quantum Walks

    E-Print Network [OSTI]

    Jamie Smith

    2011-03-01

    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.

  16. On Sum--Connectivity Index of Bicyclic Graphs

    E-Print Network [OSTI]

    Du, Zhibin

    2009-01-01

    We determine the minimum sum--connectivity index of bicyclic graphs with $n$ vertices and matching number $m$, where $2\\le m\\le \\lfloor\\frac{n}{2}\\rfloor$, the minimum and the second minimum, as well as the maximum and the second maximum sum--connectivity indices of bicyclic graphs with $n\\ge 5$ vertices. The extremal graphs are characterized.

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

    E-Print Network [OSTI]

    Diestel, Reinhard

    Bicycles and Left-Right Tours in Locally Finite Graphs von Melanie Win Myint, M. S. Dem Department-Right Tours 29 6 LRTs Generate the Bicycle Space 43 7 The ABL Planarity Criterion 53 8 Pedestrian Graphs 69 bicycles and some other concepts they relate to, such as left- right tours and pedestrian graphs

  18. Large Mesh Deformation Using the Volumetric Graph Laplacian

    E-Print Network [OSTI]

    Kazhdan, Michael

    Large Mesh Deformation Using the Volumetric Graph Laplacian Kun Zhou1 Jin Huang2 John Snyder3 Related Work Deformation on Volumetric Graphs Deformation from 2D curves Results Conclusions #12;11/21/2007 Bhaskar Kishore 3 Outline Introduction Related Work Deformation on Volumetric Graphs Deformation from

  19. ATTACHMENT 1 Export Control Decision Tree 1

    E-Print Network [OSTI]

    Jiang, Jiancheng

    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

  20. ATTACHMENT 2 UNC Charlotte Export Control Checklist

    E-Print Network [OSTI]

    Jiang, Jiancheng

    ATTACHMENT 2 UNC Charlotte Export Control Checklist [FOR FOREIGN TRAVEL WITH UNIVERSITY OWNED EQUIPMENT] License Exception TMP (Temporary Exports) This checklist summarizes the requirements for an export license exception for temporary export of a laptop, PDA, cell phone, or digital storage device

  1. Page 1 of 5 ATTACHMENT 4

    E-Print Network [OSTI]

    Page 1 of 5 ATTACHMENT 4 NREL Guidelines for Preparing a Subcontractor's Health and Safety Plan ­ Non-Construction NREL requires that all activities at the NREL facilities shall be conducted at the NREL facilities shall be required to submit a site specific safety plan that addresses environment

  2. IT Operational Oversight Committee Canvas Report Attachment

    E-Print Network [OSTI]

    Pittendrigh, Barry

    IT Operational Oversight Committee Canvas Report Attachment May 20, 2014 Investigate the Canvas Technologist, ITaP George McCabe Professor, Department of Statistics and Associate Dean, College of Science and maintenance during planned cycles. Its wide-spread use on campus requires careful consideration when looking

  3. Quantization of a string with attached mass

    E-Print Network [OSTI]

    A. Lewis Licht

    2011-08-02

    A simple model of a relativistic open string with a point mass attached at one end is quantized. The normal modes are derived and used to construct expressions for the operator commutators. Light cone gauge is used to find the mass squared operator. The singular part of the operator product expansion is derived.

  4. THERMOPHILE ENDOSPORES HAVE RESPONSIVE EXOSPORIUM FOR ATTACHMENT

    SciTech Connect (OSTI)

    PANESSA-WARREN,B.; TORTORA,G.T.; WARREN,J.; SABATINI,R.

    1999-08-01

    Recently studies examining the colonization of Clostridial pathogens on agar and human tissue culture cells, demonstrated that (C. sporogenes ATCC 3584, C. difficile ATCC 43594 [patient isolate], C. difficile ATCC 9689 [non-clinical], C. clostridioforme [patient isolate]) bacterial spores (endospores) of the genus Clostridia have an outer membrane that becomes responsive at activation and exhibits extensions of the exosporial membrane that facilitate and maintain spore attachment to a nutritive substrate during germination and initial outgrowth of the newly developed bacterial cell. Therefore this attachment phenomenon plays an important role in insuring bacterial colonization of a surface and the initial stages of the infective process. To see if other non-clinical members of this genus also have this ability to attach to a substrate or food-source during spore germination, and how this attachment process in environmental thermophiles compares to the clinical paradigm (in relation to time sequence, exosporial membrane structure, type of attachment structures, composition of the membrane etc...), sediment samples were collected in sterile transport containers at 4 geothermal sites at Yellowstone National Park in Wyoming. Because spore forming bacteria will produce spores when conditions are unfavorable for growth, the samples were sealed and stored at 4 C. After 8 months the samples were screened for the presence of spores by light microscope examination using malachite green/safranin, and traditional endospores were identified in significant quantities from the Terrace Spring site (a 46 C lake with bacterial mats and a rapidly moving run-off channel leading to a traditional hot spring). The highest spore population was found in the top sediment and benthic water of the run-off channel, pH 8.1.

  5. Attachment FY2011-12 | Department of Energy

    Office of Environmental Management (EM)

    2 Attachment FY2011-12 Indirect Cost Rate Administration Attachment FY2011-12 More Documents & Publications AcqGuide42pt1.doc&0; Acquisition Letter No. AL 2008-02 Department of...

  6. Dual-shank attachment design for omega seals

    DOE Patents [OSTI]

    Sattinger, Stanley S. (Pittsburgh, PA)

    1978-01-01

    An improved apparatus and process for attaching welded omega seal segments to reactor heads, standpipes, mechanisms, and plugs comprises a first shank in combination with a second shank to attach an omega seal at a metal-to-metal interface.

  7. Flash2010-16Attachment.pdf | Department of Energy

    Energy Savers [EERE]

    ash2010-16Attachment.pdf Flash2010-16Attachment.pdf More Documents & Publications Flash2010-16.pdf Federal Acquisition Regulation; Federal Acquisition Circular Policy Flash 2012-56...

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

    E-Print Network [OSTI]

    Wilson, Carol Leigh

    2009-06-02

    Two studies were conducted to test the central hypothesis that internal working models of attachment will influence false memory in a model-congruent pattern. Participants in both studies were first primed with a relationship-specific attachment...

  9. Attachment FY2011-06 OPAM | Department of Energy

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

    SUMMARY OF PUBLIC LAW 111-240, THE SMALL BUSINESS JOBS ACT OF 2010 Attachment FY2011-06 OPAM More Documents & Publications Attachment FY2011-28 OPAM Chapter 19 - Small Business...

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

    E-Print Network [OSTI]

    M&Ms4Graphs: Multi-scale, Multi-dimensional Graph Analytics Tools for Cyber-Security Objective We-of-Networks Framework for Cyber Security." IEEE Intelligence and Security Informatics, 2013. 2. "Towards a Multiscale. "Statistical and Hierarchical Graph Analysis for Cyber Security." SIAM Conference on Discrete Mathematics

  11. CPM: A Graph Pattern Matching Kernel with Diffusion for Accurate Graph Classification

    E-Print Network [OSTI]

    Kansas, University of

    (the Molecular Library Initiative project) that aims to determine and publicize the biological activ chemical structure data sets and have compared our methods to all major graph kernel functions that we know

  12. Cable attachment for a radioactive brachytherapy source capsule

    DOE Patents [OSTI]

    Gross, Ian G; Pierce, Larry A

    2006-07-18

    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.

  13. Three Theorems Regarding Testing Graph Properties*

    E-Print Network [OSTI]

    Trevisan, Luca

    Three Theorems Regarding Testing Graph Properties* Oded Goldreich,1, Luca Trevisan2 1 Department-mail: luca@eecs.berkeley.edu Received 9 December 2001; accepted 18 September 2002 DOI 10.1002/rsa.10078 ABSTRACT: Property testing is a relaxation of decision problems in which it is required to distinguish YES

  14. Graph Coloring with Quantum Heuristics Alex Fabrikant

    E-Print Network [OSTI]

    Fabrikant, Alex

    empirically with small graphs near a phase transition in search performance. It im- proves on two prior and physical phase transitions [4, 23, 19], which has led to new heuristics for conventional machines [12, 8 a conventional machine eval- uates just one. Hence one might expect high performance for problems having a rapid

  15. Understanding Design Patterns with Design Rationale Graphs

    E-Print Network [OSTI]

    Baniassad, Elisa

    Understanding Design Patterns with Design Rationale Graphs Elisa Baniassad and Gail C. Murphy christa.schwanninger@mchp.siemens.de ABSTRACT A Design Pattern presents a proven solution to a common design problem using a combination of informal text, diagrams, and examples. Often, to suitably describe

  16. Parsimonious Flooding in Dynamic Graphs Herv Baumann

    E-Print Network [OSTI]

    Fondements et Applications, Université Paris 7

    Parsimonious Flooding in Dynamic Graphs Hervé Baumann University Paris Diderot herve bounds on their flooding time -- flooding is the basic mechanism in which every node becoming aware. In this paper, we establish tight bounds on the complexity of flooding for all possible birth rates and death

  17. Spectral statistics for scaling quantum graphs

    E-Print Network [OSTI]

    Yu. Dabaghian

    2006-08-09

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

  18. Expander Graph Arguments for Message Passing Algorithms

    E-Print Network [OSTI]

    Burshtein, David

    Expander Graph Arguments for Message Passing Algorithms David Burshtein and Gadi Miller Dept arguments may be used to prove that message passing algorithms can correct a linear number of erroneous a message passing algorithm has corrected a sufficiently large fraction of the errors, it will eventually

  19. Minimum Spanning Trees weighted graph API

    E-Print Network [OSTI]

    Wu, Xiaolin

    on the complete graph on V vertices. #12;4 MST Origin Otakar Boruvka (1926). · Electrical Power Company of Western Moravia in Brno. · Most economical construction of electrical power network. · Concrete engineering;5 Applications MST is fundamental problem with diverse applications. · Network design. telephone, electrical

  20. Atomic Representations of Rank 2 Graph Algebras

    E-Print Network [OSTI]

    Davidson, Ken

    Atomic Representations of Rank 2 Graph Algebras Kenneth R. Davidson a , Stephen C. Power b , Dilian University, Lancaster LA1 4YF, U.K. Abstract We provide a detailed analysis of atomic -representations- posed into a direct sum or direct integral of irreducible atomic representations. The building blocks

  1. Solving the Graph Isomorphism Problem with a Quantum Annealer

    E-Print Network [OSTI]

    Itay Hen; A. P. Young

    2012-08-08

    We propose a novel method using a quantum annealer -- an analog quantum computer based on the principles of quantum adiabatic evolution -- to solve the Graph Isomorphism problem, in which one has to determine whether two graphs are isomorphic (i.e., can be transformed into each other simply by a relabeling of the vertices). We demonstrate the capabilities of the method by analyzing several types of graph families, focusing on graphs with particularly high symmetry called strongly regular graphs (SRG's). We also show that our method is applicable, within certain limitations, to currently available quantum hardware such as "D-Wave One".

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

    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.

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

    DOE Patents [OSTI]

    Camarero, Julio A.; De Yoreo, James J.; Kwon, Youngeun

    2010-04-20

    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.

  4. Graph processing platforms at scale: practices and experiences

    SciTech Connect (OSTI)

    Lim, Seung-Hwan; Lee, Sangkeun; Brown, Tyler C; Sukumar, Sreenivas R; Ganesh, Gautam

    2015-01-01

    Graph analysis unveils hidden associations of data in many phenomena and artifacts, such as road network, social networks, genomic information, and scientific collaboration. Unfortunately, a wide diversity in the characteristics of graphs and graph operations make it challenging to find a right combination of tools and implementation of algorithms to discover desired knowledge from the target data set. This study presents an extensive empirical study of three representative graph processing platforms: Pegasus, GraphX, and Urika. Each system represents a combination of options in data model, processing paradigm, and infrastructure. We benchmarked each platform using three popular graph operations, degree distribution, connected components, and PageRank over a variety of real-world graphs. Our experiments show that each graph processing platform shows different strength, depending the type of graph operations. While Urika performs the best in non-iterative operations like degree distribution, GraphX outputforms iterative operations like connected components and PageRank. In addition, we discuss challenges to optimize the performance of each platform over large scale real world graphs.

  5. Frequent Subgraph Discovery in Large Attributed Streaming Graphs

    SciTech Connect (OSTI)

    Ray, Abhik; Holder, Larry; Choudhury, Sutanay

    2014-08-13

    The problem of finding frequent subgraphs in large dynamic graphs has so far only consid- ered a dynamic graph as being represented by a series of static snapshots taken at various points in time. This representation of a dynamic graph does not lend itself well to real time processing of real world graphs like social networks or internet traffic which consist of a stream of nodes and edges. In this paper we propose an algorithm that discovers the frequent subgraphs present in a graph represented by a stream of labeled nodes and edges. Our algorithm is efficient and consists of tunable parameters that can be tuned by the user to get interesting patterns from various kinds of graph data. In our model updates to the graph arrive in the form of batches which contain new nodes and edges. Our algorithm con- tinuously reports the frequent subgraphs that are estimated to be found in the entire graph as each batch arrives. We evaluate our system using 5 large dynamic graph datasets: the Hetrec 2011 challenge data, Twitter, DBLP and two synthetic. We evaluate our approach against two popular large graph miners, i.e., SUBDUE and GERM. Our experimental re- sults show that we can find the same frequent subgraphs as a non-incremental approach applied to snapshot graphs, and in less time.

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

    E-Print Network [OSTI]

    D'Autilia, Roberto

    2015-01-01

    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. Microsoft Word - Flash2008-09Attachment.doc | Department of Energy

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

    9Attachment.doc More Documents & Publications Flash2007-02Attachment.doc&0; Microsoft Word - AL2000-05Attachment.doc Flash2007-03Attachment.doc&0;...

  8. Interpersonal violence, drug use, and adult attachment 

    E-Print Network [OSTI]

    Murphy, Amy Anne

    2013-02-22

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

  9. Cladding Attachment Over Thick Exterior Insulating Sheathing

    SciTech Connect (OSTI)

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

    2014-01-01

    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?

  10. Cladding Attachment Over Thick Exterior Insulating Sheathing

    SciTech Connect (OSTI)

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

    2014-01-01

    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?

  11. Local semicircle law for random regular graphs

    E-Print Network [OSTI]

    Roland Bauerschmidt; Antti Knowles; Horng-Tzer Yau

    2015-05-26

    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.

  12. Approximating the minimum clique cover and other hard problems in subtree filament graphs

    E-Print Network [OSTI]

    Stewart, Lorna

    Approximating the minimum clique cover and other hard problems in subtree filament graphs J. Mark Keil Lorna Stewart March 20, 2006 Abstract Subtree filament graphs are the intersection graphs of subtree filaments in a tree. This class of graphs contains subtree overlap graphs, interval filament

  13. A Characterization of Seymour Graphs A. A. Ageev A. V. Kostochka Z. Szigeti y

    E-Print Network [OSTI]

    Ageev, Alexandr

    A Characterization of Seymour Graphs A. A. Ageev #3; A. V. Kostochka #3; Z. Szigeti y Abstract Following Gerards [1] we say that a connected undirected graph G is a Seymour graph if the maximum number). Several families of graphs have been shown to be subfamilies of Seymour graphs (Seymour [4][5], Gerards [1

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

  15. Parameters of Integral Circulant Graphs and Periodic Quantum Dynamics

    E-Print Network [OSTI]

    Nitin Saxena; Simone Severini; Igor Shparlinski

    2007-03-26

    The intention of the paper is to move a step towards a classification of network topologies that exhibit periodic quantum dynamics. We show that the evolution of a quantum system, whose hamiltonian is identical to the adjacency matrix of a circulant graph, is periodic if and only if all eigenvalues of the graph are integers (that is, the graph is integral). Motivated by this observation, we focus on relevant properties of integral circulant graphs. Specifically, we bound the number of vertices of integral circulant graphs in terms of their degree, characterize bipartiteness and give exact bounds for their diameter. Additionally, we prove that circulant graphs with odd order do not allow perfect state transfer.

  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 Data Center Home Page on Delicious Rank EERE:FinancingPetroleum Based Fuels Research atDepartment ofAtlanta CommunityProposedA PageAttachments

  17. Microsoft Word - ATTACHMENT A Suppl 5.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 on Google Bookmark EERE: Alternative Fuels Data Center Home Page on DeliciousMathematicsEnergyInterested Parties - WAPAEnergy May2.doc Microsoft Word -5.docATTACHMENT A: Modeling

  18. Large induced forests in sparse graphs , Dhruv Mubayi

    E-Print Network [OSTI]

    Shamir, Ron

    (G) of G. Given a graph G, let NG(v) or simply N(v) denote the set of neighbors of vertex v. For sets

  19. On the Adequacy of Program Dependence Graphs for Representing Programs

    E-Print Network [OSTI]

    Reps, Thomas W.

    introduced by Kuck as an intermediate program representation well suited for performing optimizations are strongly equivalent. 1. Introduction Program dependence graphs were introduced by Kuck as an intermediate

  20. Computing the Stretch of an Embedded Graph Sergio Cabello

    E-Print Network [OSTI]

    Cabello, Sergio

    . GIG/11/E023. 1 #12;Here, len() denotes the number of edges in and a cycle is a closed walk in a graph

  1. ON THE GAUSS MAP OF MINIMAL GRAPHS Daoud Bshouty, Dept ...

    E-Print Network [OSTI]

    1910-70-82

    Technology, 3200 Haifa, Israel, and Allen Weitsman, Dept. of Mathematics, Purdue University, W. Lafayette, IN 47907. Abstract. We consider graphs of solutions ...

  2. Quasiperiodic graphs: structural design, scaling and entropic properties

    E-Print Network [OSTI]

    Bartolo Luque; Fernando J. Ballesteros; Ángel M. Núñez; Alberto Robledo

    2012-03-16

    A novel class of graphs, here named quasiperiodic, are constructed via application of the Horizontal Visibility algorithm to the time series generated along the quasiperiodic route to chaos. We show how the hierarchy of mode-locked regions represented by the Farey tree is inherited by their associated graphs. We are able to establish, via Renormalization Group (RG) theory, the architecture of the quasiperiodic graphs produced by irrational winding numbers with pure periodic continued fraction. And finally, we demonstrate that the RG fixed-point degree distributions are recovered via optimization of a suitably defined graph entropy.

  3. Stochastic processes on graphs with cycles : geometric and variational approaches

    E-Print Network [OSTI]

    Wainwright, Martin J. (Martin James), 1973-

    2002-01-01

    Stochastic processes defined on graphs arise in a tremendous variety of fields, including statistical physics, signal processing, computer vision, artificial intelligence, and information theory. The formalism of graphical ...

  4. course web site Note: For all homework assignments, when graphs and plots are

    E-Print Network [OSTI]

    Palmeri, Thomas

    PSY318! Week 4 #12;course web site #12;Note: For all homework assignments, when graphs and plots web site is a simple example of some Matlab code for creating line and bar graphs: Graph

  5. The structure of claw-free graphs Maria Chudnovsky and Paul Seymour

    E-Print Network [OSTI]

    Chudnovsky, Maria

    The structure of claw-free graphs Maria Chudnovsky and Paul Seymour Abstract A graph is claw a graph G is prismatic if for every triangle T of G, every vertex of G #12;2 M. Chudnovsky & P. Seymour

  6. Predicting Envelope Leakage in Attached Dwellings

    SciTech Connect (OSTI)

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

    2013-07-01

    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.

  7. FLASH2003-12attachment.pdf | Department of Energy

    Office of Environmental Management (EM)

    FLASH2003-12attachment.pdf More Documents & Publications Flash2004-19.pdf Document DOE Princeton Plasma Physics Laboratory Purchase Power Agreement Request for Proposal...

  8. Attachment FY2011-44 OPAM | Department of Energy

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

    "Myth-Busting": Addressing Misconceptions to Improve Communication with Industry during the Acquisition Process Attachment FY2011-44 OPAM More Documents & Publications Policy Flash...

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

    Office of Environmental Management (EM)

    The successful applicant will also develop a Program to rate fenestration attachment energy performance and provide accurate and useful product comparison criteria, allowing...

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

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

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

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

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

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

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

    Energy Savers [EERE]

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

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

    National Nuclear Security Administration (NNSA)

    Nuclear Facilities 150 100510 DOE O 426.2, Attachment 1 CRD 042110 Personnel Selection, Training, Qualification, and Certification Requirements for DOE Nuclear Facilities...

  14. Microsoft Word - Policy Flash 2010-82 Attachment 1 | Department...

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

    2 Attachment 1 More Documents & Publications Policy Flash 2010-82 Microsoft Word - Policy Flash 2008-07.doc Microsoft Word - Policy Flash 2008-10.doc...

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

    E-Print Network [OSTI]

    Wismath, Stephen

    stereo experi- ence with head tracking and display of appropriate left and right eye information The low on the effectiveness of head-mounted VR systems vs. fish tank VR noted that the hardware suffered from latency- braries permit its use as the main engine for creating the virtual (graph) world. Head tracking

  16. TextGraphs-5 2010 Workshop on Graph-based Methods

    E-Print Network [OSTI]

    Proceedings of the Workshop 16 July 2010 Uppsala University Uppsala, Sweden #12;Production and Manufacturing-based methods. This workshop is aimed at fostering an exchange of ideas by facilitating a discussion about both-theoretical methods for text processing tasks, this year we invited papers on a special theme "Graph Methods

  17. Graph Transformation and Intuitionistic Linear Logic

    E-Print Network [OSTI]

    Ulidowski, Irek

    ; } } CISA ­ p. #12;L1 L2 x y pt t L3 pt pt nx L1 L2 x y pt t L3 pt pt nx pt nx pt nx l[0] NULLx x y L1 L3L1y x L2 pt pt nx L3 L2 y nxpt pt pointer cell nx pt INITIAL STATE TYPE GRAPH RULE 1 RULE 2 CISA ­ p. #12;ILL representation Definitions ptlist(x, l) pt(x, Hd(l)) list(l) list(h#l) nx(h, Hd(l)) list

  18. Spectral properties of magnetic chain graphs

    E-Print Network [OSTI]

    Pavel Exner; Stepan Manko

    2015-07-02

    We discuss spectral properties of a charged quantum particle confined to a chain graph consisting of an infinite array of rings under influence of a magnetic field assuming a $\\delta$-coupling at the points where the rings touch. We start with the situation when the system has a translational symmetry and analyze spectral consequences of perturbations of various kind, such as a local change of the magnetic field, of the coupling constant, or of a ring circumference. A particular attention is paid to weak perturbations, both local and periodic; for the latter we prove a version of Saxon-Hutner conjecture.

  19. Performance Analysis of the Hierarchical Layer Graph for Wireless Networks

    E-Print Network [OSTI]

    Schindelhauer, Christian

    a distributed, localized and resource-efficient algorithm for constructing the HL graph. We have implemented introduced and analyzed by Meyer auf der Heide et al. 2004. This graph can be used as a topology for wireless networks with variable trans- mission ranges. In this paper we present a distributed, localized

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

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

  2. Generalized Graph Products for Network Design and Analysis

    E-Print Network [OSTI]

    Roughan, Matthew

    Generalized Graph Products for Network Design and Analysis Eric Parsonage, Hung X. Nguyen, Rhys--Network design, as it is currently practiced, involves putting devices together to create a network. However as a whole object. In this paper we develop generalized graph products that allow the mathematical design

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

    E-Print Network [OSTI]

    Lumsdaine, Andrew

    by Jeremy G. Siek and Andrew Lumsdaine). The most important aspect of designing the library was to defineThe Generic Graph Component Library Dr. Dobb's Journal September 2000 Generic programming for graph.nd.edu, and lumsg@lsc.nd.edu, respectively. The Standard Template Library has established a solid foundation

  4. Rapidly mixing Markov chains for dismantleable constraint graphs

    E-Print Network [OSTI]

    Dyer, Martin

    Rapidly mixing Markov chains for dismantleable constraint graphs Martin Dyer Mark Jerrum Eric adjacency. Brightwell and Winkler introduced the notion of dismantleable constraint graph to characterize proportional to vVG ((v)). We prove, for each dismantleable H, that there exist positive constant fugacities

  5. Statistical Inference on Graphs Gerard BIAU # and Kevin BLEAKLEY

    E-Print Network [OSTI]

    Biau, Gérard

    to reconstruct networks have been proposed and tested so far, ranging from Bayesian or Petri networks applications including communication networks and systems biology, we propose a general model for studying deals with problems that have a graph (or network) structure. In this context an (undirected) graph

  6. SGor: Trust graph based onion routing Peng Zhou a,

    E-Print Network [OSTI]

    Ives, Zachary G.

    routers pose a serious threat to existing onion routing networks (e.g., the Tor network [14]). To thwartSGor: Trust graph based onion routing Peng Zhou a, , Xiapu Luo a , Ang Chen b,1 , Rocky K.C. Chang August 2013 Available online 24 August 2013 Keywords: Trust graph Anonymity Onion routing a b s t r a c

  7. Graph Ramsey Theory and the Polynomial Hierarchy Marcus Schaefer

    E-Print Network [OSTI]

    Schaefer, Marcus

    Graph Ramsey Theory and the Polynomial Hierarchy Marcus Schaefer School of CTI DePaul University In the Ramsey theory of graphs F # (G, H) means that for every way of coloring the edges of F red and blue F, a priori, that such a number even exists. Frank Ramsey [Ram30, GRS90] showed in 1930 that the number

  8. Planar Ramsey Numbers for Small Graphs Andrzej Dudek

    E-Print Network [OSTI]

    Ruciñski, Andrzej

    Planar Ramsey Numbers for Small Graphs Andrzej Dudek Department of Mathematics and Computer Science Adam Mickiewicz University Pozna´n, Poland Abstract Given two graphs G1 and G2, the planar Ramsey a copy of G1 or its complement contains a copy of G2. So far, the planar Ramsey numbers have been deter

  9. Querying RDF Data from a Graph Database Perspective

    E-Print Network [OSTI]

    Baeza-Yates, Ricardo

    }@dcc.uchile.cl Agenda · Motivations, Problem and Proposal · Database Models · Graph Database Models · RDF as data model of data model with inherent graph structure. · Database models and query languages should support its that a query language for RDF should provide. Database Models Data structures Operators and Query Language

  10. Priority Algorithms for Graph Optimization Problems Allan Borodin

    E-Print Network [OSTI]

    Larsen, Kim Skak

    Priority Algorithms for Graph Optimization Problems Allan Borodin University of Toronto bor of priority or "greedy-like" algorithms as initiated in [10] and as extended to graph theoretic problems, there are several natural input formulations for a given problem and we show that priority algorithm bounds

  11. Critical behavior in inhomogeneous random graphs Remco van der Hofstad

    E-Print Network [OSTI]

    Hofstad, Remco van der

    Critical behavior in inhomogeneous random graphs Remco van der Hofstad June 10, 2010 Abstract We study the critical behavior of inhomogeneous random graphs where edges are present independently but with unequal edge occupation probabilities. The edge probabilities are moderated by vertex weights

  12. Generating Fast Code from Concurrent Program Dependence Graphs

    E-Print Network [OSTI]

    such synchronous concurrent specifications. Starting from a concurrent program dependence graph generated fromGenerating Fast Code from Concurrent Program Dependence Graphs Jia Zeng Cristian Soviani Stephen A, this approach can be unpredictable and difficult to debug. Synchronous concurrency, in which a sys- tem marches

  13. Grid Intersection Graphs and Order Dimension Steven Chaplick

    E-Print Network [OSTI]

    Felsner, Stefan

    in Figure 2. A grid intersection graph (GIG) is an intersection graph of horizontal and vertical segments intersects, some authors prefer to call this class pure-GIG. If G admits a grid Supported by ESF Euro Structures' (GRK 1408) 1 #12;bipartite permutation Stick 3-DORG UGIGStabGIG GIG 4-DORG SegRay 2-DORG Bip

  14. GRAPH THEORETIC APPROACHES TO INJECTIVITY IN CHEMICAL REACTION SYSTEMS

    E-Print Network [OSTI]

    Craciun, Gheorghe

    GRAPH THEORETIC APPROACHES TO INJECTIVITY IN CHEMICAL REACTION SYSTEMS MURAD BANAJI AND GHEORGHE algebraic and graph theoretic conditions for injectivity of chemical reaction systems. After developing the possibility of multiple equilibria in the systems in question. Key words. Chemical reactions; Injectivity; SR

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

  16. An Experimental Comparison of Pregel-like Graph Processing Systems

    E-Print Network [OSTI]

    Daudjee, Khuzaima

    Attribution- NonCommercial-NoDerivs 3.0 Unported License. To view a copy of this li- cense, visit http://creativecommons.org/licenses/by-nc Apache Hama [2], Apache Giraph [1], Catch the Wind (CatchW) [34], GPS [32], GraphLab [28] (which now incorporates PowerGraph [18]), and Mizan [23]. The relative performance characteristics of such systems

  17. Linear-Time Algorithms for Proportional Contact Graph Representations

    E-Print Network [OSTI]

    Kobourov, Stephen G.

    Linear-Time Algorithms for Proportional Contact Graph Representations Technical Report CS-2011. In a proportional contact representation of a planar graph, each vertex is represented by a simple polygon with area proportional to a given weight, and edges are represented by adjacencies between the corresponding pairs

  18. On global offensive k-alliances in graphs

    E-Print Network [OSTI]

    Bermudo, Sergio; Sigarreta, Jose M; Yero, Ismael G

    2008-01-01

    We investigate the relationship between global offensive $k$-alliances and some characteristic sets of a graph including $r$-dependent sets and $\\tau$-dominating sets. As a consequence of the study, we obtain bounds on the global offensive $k$-alliance number in terms of several parameters of the graph.

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

  20. Bicyclic graphs with exactly two main signless Laplacian eigenvalues

    E-Print Network [OSTI]

    Huang, He

    2012-01-01

    A signless Laplacian eigenvalue of a graph $G$ is called a main signless Laplacian eigenvalue if it has an eigenvector the sum of whose entries is not equal to zero. In this paper, all connected bicyclic graphs with exactly two main eigenvalues are determined.

  1. Universal random semi-directed graphs Anthony Bonato

    E-Print Network [OSTI]

    Bonato, Anthony

    , are of smaller order than the order of the graph). For example, power laws and the small world prop- erty have. Abstract Motivated by models for real-world networks such as the web graph, we consider digraphs formed by adding new vertices joined to a fixed constant m number of existing vertices of prescribed type. We

  2. Statistical Selection of Congruent Subspaces for Mining Attributed Graphs

    E-Print Network [OSTI]

    Antwerpen, Universiteit

    Statistical Selection of Congruent Subspaces for Mining Attributed Graphs Patricia Iglesias S (KIT), Germany University of Antwerp, Belgium {patricia.iglesias, emmanuel.mueller, fabian.laforet, fabian.keller, klemens.boehm}@kit.edu Abstract--Current mining algorithms for attributed graphs exploit

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

    E-Print Network [OSTI]

    Wagner, Stephan

    Unicyclic graphs with large energy Eric Ould Dadah Andriantiana 1 and Stephan Wagner 2 Department Abstract We study the energy (i.e., the sum of the absolute values of all eigenvalues) of so- called on the largest and second-largest energy of a unicyclic graph due to Caporossi, Cvetkovi´c, Gutman and Hansen

  4. Dissociative electron attachment studies on acetone

    SciTech Connect (OSTI)

    Prabhudesai, Vaibhav S. Tadsare, Vishvesh; Ghosh, Sanat; Gope, Krishnendu; Davis, Daly; Krishnakumar, E.

    2014-10-28

    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.

  5. Vacuum die attach for integrated circuits

    DOE Patents [OSTI]

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

    1991-09-10

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

  6. An Experiment on Graph Analysis Methodologies for Scenarios

    SciTech Connect (OSTI)

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

    2005-09-30

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

  7. Noisy entanglement evolution for graph states

    E-Print Network [OSTI]

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

    2011-03-29

    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.

  8. Adiabatic graph-state quantum computation

    E-Print Network [OSTI]

    Bobby Antonio; Damian Markham; Janet Anders

    2014-12-19

    Measurement-based quantum computation (MBQC) and holonomic quantum computation (HQC) are two very different computational methods. The computation in MBQC is driven by adaptive measurements executed in a particular order on a large entangled state. In contrast in HQC the system starts in the ground subspace of a Hamiltonian which is slowly changed such that a transformation occurs within the subspace. Following the approach of Bacon and Flammia, we show that any measurement-based quantum computation on a graph state with \\emph{gflow} can be converted into an adiabatically driven holonomic computation, which we call \\emph{adiabatic graph-state quantum computation} (AGQC). We then investigate how properties of AGQC relate to the properties of MBQC, such as computational depth. We identify a trade-off that can be made between the number of adiabatic steps in AGQC and the norm of $\\dot{H}$ as well as the degree of $H$, in analogy to the trade-off between the number of measurements and classical post-processing seen in MBQC. Finally the effects of performing AGQC with orderings that differ from standard MBQC are investigated.

  9. International energy indicators. [Statistical tables and graphs

    SciTech Connect (OSTI)

    Bauer, E.K. (ed.)

    1980-05-01

    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.

  10. Component evolution in general random intersection graphs

    SciTech Connect (OSTI)

    Bradonjic, Milan [Los Alamos National Laboratory; Hagberg, Aric [Los Alamos National Laboratory; Hengartner, Nick [Los Alamos National Laboratory; Percus, Allon G [CLAREMONT GRADUATE UNIV.

    2010-01-01

    We analyze component evolution in general random intersection graphs (RIGs) and give conditions on existence and uniqueness of the giant component. Our techniques generalize the existing methods for analysis on component evolution in RIGs. That is, we analyze survival and extinction properties of a dependent, inhomogeneous Galton-Watson branching process on general RIGs. Our analysis relies on bounding the branching processes and inherits the fundamental concepts from the study on component evolution in Erdos-Renyi graphs. The main challenge becomes from the underlying structure of RIGs, when the number of offsprings follows a binomial distribution with a different number of nodes and different rate at each step during the evolution. RIGs can be interpreted as a model for large randomly formed non-metric data sets. Besides the mathematical analysis on component evolution, which we provide in this work, we perceive RIGs as an important random structure which has already found applications in social networks, epidemic networks, blog readership, or wireless sensor networks.

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

    Journal Attachments New in PSoft 9.1 is the ability to attach supporting documentation directly into your GL Journal. Should you chose this option you would not need to print your Journals as the support is electronically attached. Attachments to Journals can be done at any time; while creating the Journal or after

  12. Microsoft Word - Flash2008-08attachmentFAC22.doc | Department...

    Energy Savers [EERE]

    Flash2008-08attachmentFAC22.doc Microsoft Word - Flash2008-08attachmentFAC22.doc Microsoft Word - Flash2008-08attachmentFAC22.doc More Documents & Publications Policy Flash 2013-75...

  13. UC Santa Barbara Attachment 5150 C Issuing Unit: Administrative Services Date: September 1, 1982

    E-Print Network [OSTI]

    by law. Page 1 of 25150 Payment to Aliens (Attachment C) 9/17/2007http to Aliens (Attachment C) 9/17/2007http://www.policy.ucsb.edu/vcas/accounting/5150_attach_c.html #12;

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

    E-Print Network [OSTI]

    Diego Noja; Dmitry Pelinovsky; Gaukhar Shaikhova

    2014-12-28

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

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

  16. A characterization of K2,4-minor-free graphs M. N. Ellingham1

    E-Print Network [OSTI]

    Ellingham, Mark

    A characterization of K2,4-minor-free graphs M. N. Ellingham1 Emily A. Marshall1,2 Department structural characterization of K2,4-minor-free graphs. The 3-connected K2,4- minor-free graphs consist many forbidden minors. So characterizations of graphs without one or two specific minors form natural

  17. The Generic Graph Component Library LieQuan Lee Jeremy G. Siek Andrew Lumsdaine

    E-Print Network [OSTI]

    Lumsdaine, Andrew

    The Generic Graph Component Library Lie­Quan Lee Jeremy G. Siek Andrew Lumsdaine Laboratory In this paper we present the Generic Graph Component Library (GGCL), a generic programming framework for graph data struc­ tures and graph algorithms. Following the theme of the Standard Template Library (STL

  18. 2-Source Dispersers for no(1) Entropy, and Ramsey Graphs Beating

    E-Print Network [OSTI]

    Shaltiel, Ronen

    2-Source Dispersers for no(1) Entropy, and Ramsey Graphs Beating the Frankl-Wilson Construction of a bipartite graph, this gives an explicit construction of a bipartite K-Ramsey graph of 2N vertices [BKS+ 05]. As a corollary, we get a construction of a 22log1-0 n (non bipartite) Ramsey graph of 2n

  19. Online Ramsey Theory for Bounded Degree Graphs Jane Butterfield, Tracy Grauman, William B. Kinnersley,

    E-Print Network [OSTI]

    West, Douglas B.

    On­line Ramsey Theory for Bounded Degree Graphs Jane Butterfield, Tracy Grauman, William B. Abstract When graph Ramsey theory is viewed as a game, ``Painter'' 2­colors the edges of a graph presented­line degree Ramsey number š R# (G) is the least k such that Builder wins (G, H) when H is the class of graphs

  20. On-line Ramsey Theory for Bounded Degree Graphs Jane Butterfield, Tracy Grauman, William B. Kinnersley,

    E-Print Network [OSTI]

    West, Douglas B.

    On-line Ramsey Theory for Bounded Degree Graphs Jane Butterfield, Tracy Grauman, William B When graph Ramsey theory is viewed as a game, "Painter" 2-colors the edges of a graph presented-line degree Ramsey number °R(G) is the least k such that Builder wins (G, H) when H is the class of graphs

  1. Constructing Ramsey graphs from small probability spaces IBM Almaden Research Center

    E-Print Network [OSTI]

    Naor, Moni

    Constructing Ramsey graphs from small probability spaces Moni Naor IBM Almaden Research Center 650 Harry Road San­Jose CA 95120 naor@almaden.ibm.com Abstract The problem of explicitly constructing Ramsey of all graphs in a distribution that is known to have mostly Ramsey graphs. Keywords: Ramsey Graphs

  2. Constructing Ramsey graphs from small probability spaces IBM Almaden Research Center

    E-Print Network [OSTI]

    Naor, Moni

    Constructing Ramsey graphs from small probability spaces Moni Naor IBM Almaden Research Center 650 Harry Road San-Jose CA 95120 naor@almaden.ibm.com Abstract The problem of explicitly constructing Ramsey of all graphs in a distribution that is known to have mostly Ramsey graphs. Keywords: Ramsey Graphs

  3. A Graph-Based Data Model and its Ramifications Mark Levene and George Loizou

    E-Print Network [OSTI]

    Levene, Mark

    A Graph-Based Data Model and its Ramifications Mark Levene and George Loizou Abstract- Currently candidate for for- malising hypertext. We then compare it with other graph-based data models and with set-based as a paradigm for graph-based data modelling, we show how to bridge the gap between graph-based and set-based

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

    E-Print Network [OSTI]

    Toronto, University of

    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

  5. The Incidence Hopf Algebra of Graphs

    E-Print Network [OSTI]

    Humpert, Brandon; Martin, Jeremy L.

    2012-05-03

    ), unit u(1) = K 0 , comultiplication ?(G) = ? T?V (G) G|T ?G|T , and counit #3;(G) = { 1 if n(G) = 0, 0 if n(G) > 0. The graph algebra is commutative and cocommutative; in particular, its character group X(G) is abelian. As proved by Schmitt [Sch94, (12.1...) counts the number of k-colorings of G such that every color-induced subgraph is H-free. As an extreme example, if G = H , then P?G(G; k) = k n(G) ? k, because the non-G-free colorings are precisely those using only one color. If H = Km,1, then Pm(G; k...

  6. Bicyclic graphs with maximal revised Szeged index

    E-Print Network [OSTI]

    Li, Xueliang

    2011-01-01

    The revised Szeged index $Sz^*(G)$ is defined as $Sz^*(G)=\\sum_{e=uv \\in E}(n_u(e)+ n_0(e)/2)(n_v(e)+ n_0(e)/2),$ where $n_u(e)$ and $n_v(e)$ are, respectively, the number of vertices of $G$ lying closer to vertex $u$ than to vertex $v$ and the number of vertices of $G$ lying closer to vertex $v$ than to vertex $u$, and $n_0(e)$ is the number of vertices equidistant to $u$ and $v$. Hansen used the AutoGraphiX and made the following conjecture about the revised Szeged index for a connected bicyclic graph $G$ of order $n \\geq 6$:

  7. The normalized Laplacian spectrum of subdivisions of a graph

    E-Print Network [OSTI]

    Pinchen Xie; Zhongzhi Zhang; Francesc Comellas

    2015-10-07

    Determining and analyzing the spectra of graphs is an important and exciting research topic in theoretical computer science. The eigenvalues of the normalized Laplacian of a graph provide information on its structural properties and also on some relevant dynamical aspects, in particular those related to random walks. In this paper, we give the spectra of the normalized Laplacian of iterated subdivisions of simple connected graphs. As an example of application of these results we find the exact values of their multiplicative degree-Kirchhoff index, Kemeny's constant and number of spanning trees.

  8. Filament attachment dynamics in actin-based propulsion

    E-Print Network [OSTI]

    J. I. Katz; A. E. Carlsson

    2005-05-26

    Theory and experiment have established that F-actin filaments are strongly attached to the intracellular parasites (such as Listeria) they propel with ``comet tails''. We consider the implications of these observations for propulsion. By calculating the motion produced in various models of attachment and comparing to experiment we demonstrate that the attachment must be sliding rather than hinged. By modeling experiments on ActA-coated spheres we draw conclusions regarding the interaction between F-actin and their surfaces that may also be applicable to living systems.

  9. Probabilistic Flooding for Efficient Information Dissemination in Random Graph

    E-Print Network [OSTI]

    Stavrakakis, Ioannis

    Probabilistic Flooding for Efficient Information Dissemination in Random Graph Topologies 1 & Telecommunications, Athens, Greece Abstract Probabilistic flooding has been frequently considered as a suitable) flooding approaches that are used to disseminate globally information in unstructured peer

  10. Cell-Graph Mining for Breast Tissue Modelling and Classification

    E-Print Network [OSTI]

    Bystroff, Chris

    metrics for tissue characteriza- tion and classification. We segmented the digital images of histopaCell-Graph Mining for Breast Tissue Modelling and Classification C.C¸ agatay Bilgin a, C¸ igdem

  11. Support graph preconditioning for elliptic finite element problems 

    E-Print Network [OSTI]

    Wang, Meiqiu

    2009-05-15

    A relatively new preconditioning technique called support graph preconditioning has many merits over the traditional incomplete factorization based methods. A major limitation of this technique is that it is applicable to ...

  12. 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 architecture selection and technology investment decisions will constrain the system to certain regions architectures, with a view to enabling robustness to technology portfolio realization and later architectural

  13. Temporally Scalable Visual SLAM using a Reduced Pose Graph

    E-Print Network [OSTI]

    Johannsson, Hordur

    2012-05-25

    In this paper, we demonstrate a system for temporally scalable visual SLAM using a reduced pose graph representation. Unlike previous visual SLAM approaches that use keyframes, our approach continually uses new measurements ...

  14. Scalable Parallel Algorithms for Massive Scale-free Graphs 

    E-Print Network [OSTI]

    Pearce, Roger Allan

    2013-12-05

    Efficiently storing and processing massive graph data sets is a challenging problem as researchers seek to leverage “Big Data” to answer next-generation scientific questions. New techniques are required to process large ...

  15. On Graphs that are not PCGs Stephane Durocher1

    E-Print Network [OSTI]

    Durocher, Stephane

    the graph classes that arise from using the intervals [0, dmax] (LPG) and [dmin, ] (mLPG). They proved LPG, mLPG and PCG are similar to the leaf powers and their variants, which have been extensively

  16. Temporally scalable visual SLAM using a reduced pose graph

    E-Print Network [OSTI]

    Johannsson, Hordur

    In this paper, we demonstrate a system for temporally scalable visual SLAM using a reduced pose graph representation. Unlike previous visual SLAM approaches that maintain static keyframes, our approach uses new measurements ...

  17. Quantum Graphs: Applications to Quantum Chaos and Universal Spectral Statistics

    E-Print Network [OSTI]

    Sven Gnutzmann; Uzy Smilansky

    2006-12-15

    During the last years quantum graphs have become a paradigm of quantum chaos with applications from spectral statistics to chaotic scattering and wave function statistics. In the first part of this review we give a detailed introduction to the spectral theory of quantum graphs and discuss exact trace formulae for the spectrum and the quantum-to-classical correspondence. The second part of this review is devoted to the spectral statistics of quantum graphs as an application to quantum chaos. Especially, we summarise recent developments on the spectral statistics of generic large quantum graphs based on two approaches: the periodic-orbit approach and the supersymmetry approach. The latter provides a condition and a proof for universal spectral statistics as predicted by random-matrix theory.

  18. Generalized Domination in Graphs with Applications in Wireless Networks 

    E-Print Network [OSTI]

    Sung, Je Sang

    2013-12-10

    The objective of this research is to study practical generalization of domination in graphs and explore the theoretical and computational aspects of models arising in the design of wireless networks. For the construction of a virtual backbone of a...

  19. Spectral problems of optical waveguides and quantum graphs 

    E-Print Network [OSTI]

    Ong, Beng Seong

    2006-10-30

    In this dissertation, we consider some spectral problems of optical waveguide and quantum graph theories. We study spectral problems that arise when considerating optical waveguides in photonic band-gap (PBG) materials. Specifically, we address...

  20. Graph Coloring on a Coarse Grained Multiprocessor (extended abstract)

    E-Print Network [OSTI]

    Gebremedhin, Assefaw Hadish

    Graph Coloring on a Coarse Grained Multiprocessor (extended abstract) Assefaw Hadish Gebremedhin1 Allwright et al. (1995). However, in a recent result, Gebremedhin and Manne (1999a, 1999b) present

  1. Speeding up Parallel Graph Coloring Assefaw H. Gebremedhin1,

    E-Print Network [OSTI]

    Manne, Fredrik

    Speeding up Parallel Graph Coloring Assefaw H. Gebremedhin1, , Fredrik Manne2 , and Tom Woods2 1. Gebremedhin, Fredrik Manne, and Tom Woods However, in practice greedy sequential coloring heuristics have been

  2. SEMANTICS OF PROGRAM REPRESENTATION GRAPHS G. RAMALINGAM and THOMAS REPS

    E-Print Network [OSTI]

    Reps, Thomas W.

    dependence graphs (PDGs) [Kuck81, Ferr87, Horw89]. They have also been used in a new algorithm for merging representation in various appli­ cations such as vectorization, parallelization [Kuck81], and merging program

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

    E-Print Network [OSTI]

    Batlle, Carles

    Bond graph models of electromechanical systems. The AC generator case Carles Batlle Department. After reviewing electromechanical energy conversion and torque gener- ation, the core element present in any electromechanical system is introduced, and the corresponding electrical and mechanical ports

  4. Parallel Algorithms for Graph Optimization using Tree Decompositions

    SciTech Connect (OSTI)

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

    2012-06-01

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

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

    E-Print Network [OSTI]

    2006-04-27

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

  6. APPROXIMATING SPECTRAL INVARIANTS OF HARPER OPERATORS ON GRAPHS II

    E-Print Network [OSTI]

    Schick, Thomas

    APPROXIMATING SPECTRAL INVARIANTS OF HARPER OPERATORS ON GRAPHS II VARGHESE MATHAI, THOMAS SCHICK;2 VARGHESE MATHAI, THOMAS SCHICK, AND STUART YATES subset E+ of these edges in which each combinatorial edge

  7. Efficient graphlet kernels for large graph comparison Nino Shervashidze

    E-Print Network [OSTI]

    Mehlhorn, Kurt

    Efficient graphlet kernels for large graph comparison Nino Shervashidze MPI for Biological such as gSpan (Yan & Han, 2003) have been developed for this task, which use el- egant data structures

  8. Automated Inclusive Design Heuristics Generation with Graph Mining 

    E-Print Network [OSTI]

    Sangelkar, Shraddha Chandrakant

    2013-08-01

    from existing inclusive products. Formalization results show that, the rate of rule generation decreases as more products are added to the dataset. The automated method is particularly helpful in the developmental stages of graph mining applications...

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

    E-Print Network [OSTI]

    Yodpinyanee, Anak

    2014-01-01

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

  10. Predictive Mutual Cuts in Graphs: Learning in Bioinformatics

    E-Print Network [OSTI]

    . De Moor K.U. Leuven, ESAT, SCD/SISTA, Kasteelpark Arenberg 10, B-3001, Leuven, Belgium Recent work (mutual graph cuts). Specifically, the problem of mining for correspondances between mi- croarray

  11. (1) in the attached material, we take a = 1

    E-Print Network [OSTI]

    1910-00-81

    Lab 4. Prior to Lab. Read the material on the back page. During the lab. In formula (1) in the attached material, we take a = 1, b = .5, c = .75 and d = .25. Thus, the ...

  12. Attachment FY2011-31 OPAM | Department of Energy

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

    attachment 3 flow chart of new 17.5 FAR Team update based on FAC2005-47 Dec 13, 2010 More Documents & Publications Flash2011-31 OPAM Flash2011-26 OPAM ATTACHMENTFLASH2011-26-OPAM...

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

  14. Microsoft Word - Policy Flash 2010-78 Attachment 1 Unsuccessful...

    Office of Environmental Management (EM)

    1 Unsuccessful Offeror Letter Template-Final 8-17-10 Microsoft Word - Policy Flash 2010-78 Attachment 1 Unsuccessful Offeror Letter Template-Final 8-17-10 Microsoft Word -...

  15. Microsoft Word - Policy Flash 2010-78 Attachment 3 Conflicts...

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

    3 Conflicts of Interest Cert- template-Final 8-17-10 Microsoft Word - Policy Flash 2010-78 Attachment 3 Conflicts of Interest Cert- template-Final 8-17-10 Microsoft Word -...

  16. Microsoft Word - Policy Flash 2010-78 Attachment 2 Confidentiality...

    Energy Savers [EERE]

    2 Confidentiality Cert template-Final 8-17-10 Microsoft Word - Policy Flash 2010-78 Attachment 2 Confidentiality Cert template-Final 8-17-10 Microsoft Word - Policy Flash...

  17. Microsoft Word - Policy Flash 2010-78 Attachment 4 Successful...

    Office of Environmental Management (EM)

    4 Successful Offeror Letter Template-Final 8-17-10 Microsoft Word - Policy Flash 2010-78 Attachment 4 Successful Offeror Letter Template-Final 8-17-10 Microsoft Word - Policy...

  18. Bicycle-powered attachments : designing for developing countries

    E-Print Network [OSTI]

    Wu, Jodie (Jodie Z.)

    2009-01-01

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

  19. Attachment FY2011-58 OPAM | Department of Energy

    Energy Savers [EERE]

    INFORMATION REPORTING Attachment FY2011-58 OPAM More Documents & Publications Chapter 35 - Research and Development Contracting AcqGuide35pt1rev2.doc&0; Federal Assistance...

  20. A note on light geometric graphs Eyal Ackerman

    E-Print Network [OSTI]

    Fox, Jacob

    A note on light geometric graphs Eyal Ackerman Jacob Fox Rom Pinchasi March 19, 2012 Abstract Let G be a geometric graph on n vertices in general position in the plane. We say that G is k-light if no edge e of G than k edges of G. We extend the previous result in [1] and with a shorter argument show that every k-light

  1. Relationship of attachment to abuse in incarcerated women 

    E-Print Network [OSTI]

    Davis, Brandon Lee

    2004-11-15

    a combination of traits of preoccupied and dismissing attachment styles. The fear of rejection is common in both fearful and preoccupied attachment styles. When Alexander (1993) administered questionnaires to 112 female incest survivors, she found... among female incest survivors. This study used 92 of 112 women from an earlier study by Alexander (1993). Alexander et al. (1998) found elevations on the avoidant scale of the MCMI-II more likely among women with fearful styles than with secure...

  2. Pressurizer with a mechanically attached surge nozzle thermal sleeve

    DOE Patents [OSTI]

    Wepfer, Robert M

    2014-03-25

    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.

  3. Scaling and biomechanics of surface attachment in climbing animals

    E-Print Network [OSTI]

    Labonte, David; Federle, Walter

    2014-01-01

    -Type text/plain; charset=UTF-8 Review Cite this article: Labonte D, Federle W. 2015 Scaling and biomechanics of surface attach- ment in climbing animals. Phil. Trans. R. Soc. B 370: 20140027. http://dx.doi.org/10.1098/rstb.2014.0027 One contribution... of 19 to a discussion meeting issue ‘Cell adhesion century: culture breakthrough’. Subject Areas: biomaterials, biomechanics, biophysics Scaling and biomechanics of surface attachment in climbing animals on July 15, 2015http...

  4. Copying Maple graphs into Word Once you create a graph with Maple, you can copy and paste it into Word pretty

    E-Print Network [OSTI]

    Zirbel, Craig L.

    Copying Maple graphs into Word Once you create a graph with Maple, you can copy and paste it into Word pretty easily. However, you might be unhappy with the result, if it looks like this: This image to get the image into Word in a better way. Below are two Maple graphs. On a Macintosh, you can click

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

    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.

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

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

  7. Noisy entanglement evolution for graph states

    E-Print Network [OSTI]

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

    2010-01-01

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

  8. Quantum Vacuum Energy in Graphs and Billiards

    E-Print Network [OSTI]

    L. Kaplan

    2011-01-03

    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.

  9. Alliance free sets in Cartesian product graphs

    E-Print Network [OSTI]

    Yero, Ismael G; Bermudo, Sergio

    2011-01-01

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

  10. Green's function approach for quantum graphs: an overview

    E-Print Network [OSTI]

    Fabiano M. Andrade; Alexandre G. M. Schmidt; Eduardo Vicentini; Bin K. Cheng; Marcos G. E. da Luz

    2016-01-05

    Here we review the many interesting aspects and distinct phenomena associated to quantum dynamics on general graph structures. For so, we discuss such class of systems under the energy domain Green's function ($G$) framework. Such approach is particularly interesting because $G$ can be written as a sum over classical-like paths, where local quantum effects are taking into account through the scattering matrix amplitudes (basically, transmission and reflection coefficients) defined on each one of the graph vertices. So, the {\\em exact} $G$ has the functional form of a generalized semiclassical formula, which through different calculation techniques (addressed in details here) always can be cast into a closed analytic expression. This allows to solve exactly arbitrary large (although finite) graphs in a recursive and fast way. Using the Green's function method, we survey many properties for open and closed quantum graphs, like scattering solutions for the former and eigenspectrum and eigenstates for the latter, also addressing quasi-bound states. Concrete examples, like cube, binary trees and Sierpi\\'nski-like, topologies are considered. Along the work, possible distinct applications using the Green's function methods for quantum graphs are outlined.

  11. Conformational mechanism for the stability of microtubule-kinetochore attachments

    E-Print Network [OSTI]

    Zsolt Bertalan; Caterina A. M. La Porta; Helder Maiato; Stefano Zapperi

    2014-07-21

    Regulating the stability of microtubule(MT)-kinetochore attachments is fundamental to avoiding mitotic errors and ensure proper chromosome segregation during cell division. While biochemical factors involved in this process have been identified, its mechanics still needs to be better understood. Here we introduce and simulate a mechanical model of MT-kinetochore interactions in which the stability of the attachment is ruled by the geometrical conformations of curling MT-protofilaments entangled in kinetochore fibrils. The model allows us to reproduce with good accuracy in vitro experimental measurements of the detachment times of yeast kinetochores from MTs under external pulling forces. Numerical simulations suggest that geometrical features of MT-protofilaments may play an important role in the switch between stable and unstable attachments.

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

    E-Print Network [OSTI]

    Zhao, Jun; Gligor, Virgil

    2015-01-01

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

  13. Regular graphs maximize the variability of random neural networks

    E-Print Network [OSTI]

    Gilles Wainrib; Mathieu Galtier

    2014-12-17

    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.

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

    SciTech Connect (OSTI)

    Hendrickson, B.; Leland, R.

    1992-09-01

    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.

  15. A Regularized Graph Layout Framework for Dynamic Network Visualization

    E-Print Network [OSTI]

    Xu, Kevin S; Hero, Alfred O

    2012-01-01

    Many real-world networks, including social and information networks, are dynamic structures that evolve over time. Such dynamic networks are typically visualized using a sequence of static graph layouts. In addition to providing a visual representation of the network topology at each time step, the sequence should preserve the mental map between layouts of consecutive time steps to allow a human to interpret the temporal evolution of the network. In this paper, we propose a framework for dynamic network visualization using regularized graph layouts. Regularization encourages stability of the layouts over time, thus preserving the mental map. The proposed framework involves optimizing a modified cost function that augments the cost function of a static graph layout algorithm with a grouping penalty, which encourages nodes to stay close to other nodes belonging to the same group, and a temporal penalty, which encourages smooth movements of the nodes over time. We introduce two dynamic layout algorithms under th...

  16. On the mixing time of geographical threshold graphs

    SciTech Connect (OSTI)

    Bradonjic, Milan

    2009-01-01

    In this paper, we study the mixing time of random graphs generated by the geographical threshold graph (GTG) model, a generalization of random geometric graphs (RGG). In a GTG, nodes are distributed in a Euclidean space, and edges are assigned according to a threshold function involving the distance between nodes as well as randomly chosen node weights. The motivation for analyzing this model is that many real networks (e.g., wireless networks, the Internet, etc.) need to be studied by using a 'richer' stochastic model (which in this case includes both a distance between nodes and weights on the nodes). We specifically study the mixing times of random walks on 2-dimensional GTGs near the connectivity threshold. We provide a set of criteria on the distribution of vertex weights that guarantees that the mixing time is {Theta}(n log n).

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

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

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

    DOE Patents [OSTI]

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

    1992-09-22

    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.

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

    DOE Patents [OSTI]

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

    1991-01-01

    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.

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

    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.

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

    SciTech Connect (OSTI)

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

    2011-02-01

    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.

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

    DOE Patents [OSTI]

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

    1998-06-02

    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.

  3. A HYBRID GRASP WITH PERTURBATIONS AND ADAPTIVE PATH-RELINKING FOR THE STEINER PROBLEM IN GRAPHS

    E-Print Network [OSTI]

    Makarychev, Konstantin

    with weight perturbations and adaptive path-relinking heuristic (HGP-PR) for the Steiner problem in graphs

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

    E-Print Network [OSTI]

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

    2007-03-27

    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.

  5. Spectra of magnetic chain graphs: coupling constant perturbations

    E-Print Network [OSTI]

    Pavel Exner; Stepan S. Manko

    2014-12-18

    We analyze spectral properties of a quantum graph in the form of a ring chain with a $\\delta$ coupling in the vertices exposed to a homogeneous magnetic field perpendicular to the graph plane. We find the band spectrum in the case when the chain exhibits a translational symmetry and study the discrete spectrum in the gaps resulting from changing a finite number of vertex coupling constants. In particular, we discuss in details some examples such as perturbations of one or two vertices, weak perturbation asymptotics, and a pair of distant perturbations.

  6. Faster Quantum Walk Search on a Weighted Graph

    E-Print Network [OSTI]

    Thomas G. Wong

    2015-07-27

    A randomly walking quantum particle evolving by Schr\\"odinger's equation searches for a unique marked vertex on the "simplex of complete graphs" in time $\\Theta(N^{3/4})$. In this paper, we give a weighted version of this graph that preserves vertex-transitivity, and we show that the time to search on it can be reduced to nearly $\\Theta(\\sqrt{N})$. To prove this, we introduce two novel extensions to degenerate perturbation theory: an adjustment that distinguishes the weights of the edges, and a method to determine how precisely the jumping rate of the quantum walk must be chosen.

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

    E-Print Network [OSTI]

    Warren, Jeffrey Scott

    2009-05-15

    . Independent Set Problems For a graph G = (V;E), S V is an independent set if no vertices in S are adjacent. The maximum independent set (MIS) problem is to find an independent set of largest cardinality in a given graph. The maximum weight independent set... for determining the optimality of a best known solution of the master problem. Many have worked to solve both the MIS and MWIS problems exactly. Tech- niques include explicit enumeration of maximal independent sets [4], combinato- rial branch-and-bound [5, 6, 7, 8...

  8. Graph-theoretic design and analysis of key predistribution schemes Michelle Kendall Keith M. Martin

    E-Print Network [OSTI]

    International Association for Cryptologic Research (IACR)

    Graph-theoretic design and analysis of key predistribution schemes Michelle Kendall Keith M. Martin, a general understanding of the design prin- ciples on which to base such constructions is somewhat lacking as a sound design principle. Second, we propose the use of incidence graphs and concurrence graphs as tools

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

  10. Intermediate statistics for a system with symplectic symmetry: the Dirac rose graph

    E-Print Network [OSTI]

    statistics formed of a gas of energy levels interacting with a logarithmic potential. Spectral statisticsIntermediate statistics for a system with symplectic symmetry: the Dirac rose graph J.M. Harrison1 Abstract We study the spectral statistics of the Dirac operator on a rose-shaped graph-- a graph

  11. Two levels interchange format in XML for Petri Nets and other graph-based formalisms

    E-Print Network [OSTI]

    Gribaudo, Marco

    to describe Petri Nets and other graph-based formalisms such as queueing networks and Markov chains. TwoTwo levels interchange format in XML for Petri Nets and other graph-based formalisms Andrea Valente to model Petri Nets and other graph based model speci cation formalismsis presented. In particular

  12. Diameter of the NEPS of Bipartite Graphs Richard A. Brualdi and Jian Shen y

    E-Print Network [OSTI]

    Brualdi, Richard A.

    Diameter of the NEPS of Bipartite Graphs Richard A. Brualdi #3; and Jian Shen y Department 4, 2000 Abstract We prove that, if connected, the NEPS of connected, bipartite graphs has diameter-complete, extended p-sum, abbreviated NEPS, of G 1 ; G 2 ; : : : ; G n with basis B is the graph (see e.g. [1]) G

  13. I/O-Efficient Algorithms for Contour Line Extraction and Planar Graph Blocking

    E-Print Network [OSTI]

    Agarwal, Pankaj K.; Arge, Lars; Murali, T. M.; Kasturi R., Varadarajan; Vitter, Jeffrey Scott

    1998-01-01

    improved algorithm for a more general problem of blocking bounded-degree planar graphs such as TINS (i.e., storing them on disk so that any graph traversal algorithm can traverse the graph in an I/O-efficient manner), and apply it to two problms that arise...

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

  15. Ramsey Minimal Graphs B'ela Bollob'as* Jair Donadelliy and Yoshiharu Kohayak*

    E-Print Network [OSTI]

    Kohayakawa, Yoshiharu

    Ramsey Minimal Graphs B'ela Bollob'as* Jair.lAepairtofus say that a Ramsey gra* *ph for (G, H) is critical if graphs (G, H) is said to be Ramsey-infinite ifnthereoareproper subgraph of it i* *s Ramsey for (G, H). A pair infinitely many minimal graphs for which

  16. NON-BIPARTITE PAIRS OF 3-CONNECTED GRAPHS ARE HIGHLY RAMSEY-INFINITE

    E-Print Network [OSTI]

    Siggers, Mark H.

    NON-BIPARTITE PAIRS OF 3-CONNECTED GRAPHS ARE HIGHLY RAMSEY-INFINITE MARK SIGGERS ABSTRACT. A pair of graphs (Hb,Hr) is highly Ramsey-infinite if there is some constant c such that for large enough n. We show that a pair of 3-connected graphs is highly Ramsey-infinite if and only if at least one

  17. Directed acyclic graphs, su cient causes and the properties of conditioning on a

    E-Print Network [OSTI]

    Directed acyclic graphs, su¢ cient causes and the properties of conditioning on a common e #12;Abstract Su¢ cient-component causes are incorporated into the directed acyclic graph (DAG) causal su¢ cient causes on a graph, it is possible to detect conditional independencies within strata

  18. Universality for distances in power-law random graphs Remco van der Hofstad1,a

    E-Print Network [OSTI]

    Hofstad, Remco van der

    classical random graphs such as the Erds­Rényi random graph. It is often suggested that the behavior with similar degree sequences share similar behavior. We survey the available results on graph distances of the occupation status of the other ed

  19. Light Edges in Degree-Constrained Graphs Prosenjit Bose Michiel Smid David R. Wood

    E-Print Network [OSTI]

    Wismath, Stephen

    Light Edges in Degree-Constrained Graphs #3; Prosenjit Bose Michiel Smid David R. Wood School of a graph with bounded degree end-points is said to be light. The primary result of this paper is that ev- ery degree-constrained graph has a light edge, where the degree bound depends on the minimum and aver

  20. Computing web page importance without storing the graph of the web

    E-Print Network [OSTI]

    Abiteboul, Serge

    Computing web page importance without storing the graph of the web (extended abstract) S. Abiteboul dynamic graph has recently attracted a lot of attention because of the web. Page importance or page rank estimate of page importance while the web/graph is visited. When the web changes, page importance changes

  1. On Finding the Maximum Number of Disjoint Cuts in Seymour Graphs ?

    E-Print Network [OSTI]

    Ageev, Alexandr

    On Finding the Maximum Number of Disjoint Cuts in Seymour Graphs ? Alexander A. Ageev Sobolev. In this paper we prove that the problem is polynomially solvable on Seymour graphs which include both all bipar is polynomially solvable when restricted to the family of Seymour graphs. To present a rigorous definition

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

    E-Print Network [OSTI]

    Wagner, Stephan

    ,28,32,33,37]. #12;2 IVAN GUTMAN AND STEPHAN WAGNER 2. A mathematical route to matching energy The right hand side, the right hand side of Eq. (3) is not the graph energy, but a quantity which we will call "matching energyTHE MATCHING ENERGY OF A GRAPH IVAN GUTMAN AND STEPHAN WAGNER Abstract. The energy of a graph G

  3. Attached-sunspace designs: a nationwide economic appraisal

    SciTech Connect (OSTI)

    Roach, F.; Kirschner, C.

    1980-01-01

    Performance estimates for attached-sunspace passive solar heated residences have recently been incorporated into the Los Alamos/UNM EASE III model. These estimates are used to analyze the economic performance of a fixed dimension sunspace design when attached to a pre-existing single family residential unit. The sunspace is a passive design which can be easily and effectively adapted to a retrofit situation. Several key parameters are carefully evaluated for the sunspace retrofit design. These include loan or mortgage terms, ownership period, resale potential and competing conventional fuel prices. General economic and design parameters are combined in a variant of life cycle costing to evaluate the feasibility of both owner-built and contractor-built attached sunspaces for 220 regions in the contiguous United States. This evaluation is made for two conventional fuel types - natural gas and electric resistance - and for three resale values - 0%, 100%, and 200%. Results show that the prospect for conventional fuel displacement through retrofit of attached sunspaces is very good with the design's economic performance enhanced in regions with expensive conventional fuel alternatives.

  4. ATTACHMENT E NOTIFICATION UNDER FERPA OF STUDENT RIGHTS

    E-Print Network [OSTI]

    Johnson Jr.,, Ray

    ATTACHMENT E NOTIFICATION UNDER FERPA OF STUDENT RIGHTS CONCERNING EDUCATION RECORDS AND DIRECTORY to their education records. See Section "6" below on your right to prevent the disclosure of directory information;2 contracted as its agent to provide a service instead of using University employees or officials, a person

  5. An Empirical Comparison of "Wiimote" Gun Attachments for Pointing Tasks

    E-Print Network [OSTI]

    MacKenzie, Scott

    An Empirical Comparison of "Wiimote" Gun Attachments for Pointing Tasks Victoria McArthur, Steven J, a plastic gun-shaped shell designed for shooter games, the Wii Wheel, designed for driving games is to investigate whether gun- shaped peripherals help or hinder pointing performance with the Wiimote

  6. Thesauruses for Prepositional Phrase Attachment Mark McLauchlan

    E-Print Network [OSTI]

    Thesauruses for Prepositional Phrase Attachment Mark McLauchlan Department of Informatics is estimated with informa- tion from similar examples generated using a thesaurus. Three thesauruses are compared on this task: two existing generic thesauruses and a new specialist PP thesaurus tailored

  7. Payment Request Description Supplier (Yes/No) Attachments Needed

    E-Print Network [OSTI]

    Griggs, Jerrold R.

    Payment Request Description Supplier (Yes/No) Attachments Needed (All in ONE document) Yes 1- Cash Advance Form Use the Employee/Student Supplier Form Yes 1 - Travel Advance Form Use the Employee/Student Supplier Form Yes 1 - Royalty Agreement/Amount Calculation W-9 or W-8(International) Yes W-9 or W-8

  8. Determining Vision Graphs for Distributed Camera Networks Using Feature Digests

    E-Print Network [OSTI]

    Radke, Rich

    1 Determining Vision Graphs for Distributed Camera Networks Using Feature Digests Zhaolin Cheng and the length of each feature descriptor are substantially reduced to form a fixed-length "feature digest" that is broadcast to the rest of the network. Each receiver camera decompresses the feature digest to recover

  9. Invariant random graphs with iid degrees in a general geography

    E-Print Network [OSTI]

    Jonasson, Johan

    expectation). It is shown that if G has either polynomial growth or rapid growth, then such a random graph ball containing more than n vertices. With rapid growth we mean that the number of vertices in a ball or rapid growth. It is believed that no other growth rates are possible. When G has rapid growth

  10. Approximability of Partitioning Graphs with Supply and Demand

    E-Print Network [OSTI]

    Demaine, Erik

    Approximability of Partitioning Graphs with Supply and Demand Takehiro Ito a,, Erik D. Demaine b vertex or a demand vertex and is assigned a positive real number, called the supply or the demand. Each demand vertex can receive "power" from at most one supply vertex through edges in G. One thus wishes

  11. Approximability of Partitioning Graphs with Supply and Demand

    E-Print Network [OSTI]

    Demaine, Erik

    Approximability of Partitioning Graphs with Supply and Demand (Extended Abstract) Takehiro Ito1 vertex or a demand vertex and is assigned a positive real number, called the supply or the demand. Each demand vertex can receive "power" from at most one supply vertex through edges in G. One thus wishes

  12. Approximability of Partitioning Graphs with Supply and Demand

    E-Print Network [OSTI]

    Demaine, Erik

    Approximability of Partitioning Graphs with Supply and Demand (Extended Abstract) Takehiro Ito 1 vertex or a demand vertex and is assigned a positive real number, called the supply or the demand. Each demand vertex can receive ``power'' from at most one supply vertex through edges in G. One thus wishes

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

  15. The switch Markov chain for sampling irregular graphs

    E-Print Network [OSTI]

    Greenhill, Catherine

    The switch Markov chain for sampling irregular graphs Catherine Greenhill School of Mathematics approach to this problem uses a simple Markov chain, which we call the switch chain, to perform the sampling. The switch chain is known to be rapidly mixing for regular degree sequences. We prove

  16. Selectivity Estimation for SPARQL Graph Pattern Faculty of ICT

    E-Print Network [OSTI]

    Liu, Chengfei

    , for an arbitrary composite SPARQL graph pattern, we maximally combines the results of the star and chain patterns with different properties sharing the same subject (an example is shown in Figure 1). For estimating' Income 'Prof.' Position 'Advance d course' (Adc) TeacherOf ?Z, Income, '

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

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

  19. Lesson Summary Students graph and analyze raw data for

    E-Print Network [OSTI]

    Mojzsis, Stephen J.

    energy balance equation? What ultimate effect will this have on the energy balance of the Earth? 8 Setting The Earth The Mathematical World Symbolic Relationships Common Themes Constancy and Change NSES://www.strategies.org/index.aspx #12;Earth's Energy Budget or Can You Spare a Sun? Activity 8: Greenhouse Gases Objective: To graph

  20. Ramsey Numbers for Triangles Almost-Complete Graphs

    E-Print Network [OSTI]

    Radziszowski, Stanislaw P.

    Ramsey Numbers for Triangles versus Almost-Complete Graphs To the fond memory of Paul Erd on the corresponding Ramsey number, R(K 3 ; K 10 e) #20; 38. The new lower bound of 37 for this number is established by one the best previously known lower and upper bounds. We also give the bounds for the next Ramsey

  1. On Pattern Ramsey Numbers of Graphs Robert E. Jamison

    E-Print Network [OSTI]

    West, Douglas B.

    On Pattern Ramsey Numbers of Graphs Robert E. Jamison Mathematical Sciences Clemson University is a Ramsey family if there is some integer N such that every edge- coloring of KN has a copy of some pattern in F. The smallest such N is the (pattern) Ramsey number R(F) of F. The classical Canonical Ramsey

  2. On Pattern Ramsey Numbers of Graphs Robert E. Jamison

    E-Print Network [OSTI]

    West, Douglas B.

    On Pattern Ramsey Numbers of Graphs Robert E. Jamison Mathematical Sciences Clemson University is a Ramsey family if there is some integer N such that every edge- coloring of KN has a copy of some pattern in F . The smallest such N is the (pattern) Ramsey number R(F ) of F . The classical Canonical Ramsey

  3. Shannon Capacity and Ramsey Numbers from Product of Graphs

    E-Print Network [OSTI]

    Radziszowski, Stanislaw P.

    Bounds on Shannon Capacity and Ramsey Numbers from Product of Graphs Xiaodong Xu Guangxi Academy Abstract In this paper we study Shannon capacity of channels in the context of classical Ramsey numbers. We by Abbott and Song and thus establish new lower bounds for a special type of multicolor Ramsey numbers. We

  4. Efficient Query Processing on Graph Databases JAMES CHENG

    E-Print Network [OSTI]

    Ng, Wilfred Siu Hung

    . In this article, we propose an efficient index, FG*-index, to solve this problem. The cost of processing a subgraph query using most existing indexes mainly consists of two parts, the index probing cost and the candidate verification cost. Index probing is to find the query in the index, or to find the graphs from

  5. Tighter Bounds for Graph Steiner Tree Approximation Gabriel Robins

    E-Print Network [OSTI]

    Zelikovsky, Alexander

    and properties. In Section 3 we present our main algorithm, called k-LCA. The basic approximation result for k-LCA is proved in Section 4. In Sections 5 and 6 we prove an approximation ratio of the k-LCA algorithm in general graphs, and estimate the performance of the Iterated 1-Steiner and k-LCA heuristics in qu

  6. Fast-Mixed Searching and Related Problems on Graphs

    E-Print Network [OSTI]

    Bonato, Anthony

    Fast-Mixed Searching and Related Problems on Graphs Boting Yang Department of Computer Science University of Regina May 27, 2012 1GRASCan 2012, Ryerson University #12;Outline Fast searching and mixed searching Induced-path cover Fast-mixed searching vs fast searching Fast-mixed searching vs mixed

  7. Energy and Laplacian on Hanoi-type fractal quantum graphs

    E-Print Network [OSTI]

    Patricia Alonso Ruiz; Daniel J. Kelleher; Alexander Teplyaev

    2015-07-31

    This article studies potential theory and spectral analysis on compact metric spaces, which we refer to as fractal quantum graphs. These spaces can be represented as a (possibly infinite) union of 1-dimensional intervals and a totally disconnected (possibly uncountable) compact set, which roughly speaking represents the set of junction points. Classical quantum graphs and fractal spaces such as the Hanoi attractor are included among them. We begin with proving the existence of a resistance form on the Hanoi attractor, and go on to establish heat kernel estimates and upper and lower bounds on the eigenvalue counting function of Laplacians corresponding to weakly self-similar measures on the Hanoi attractor. These estimates and bounds rely heavily on the relation between the length and volume scaling factors of the fractal. We then state and prove a necessary and sufficient condition for the existence of a resistance form on a general fractal quantum graph. Finally, we extend our spectral results to a large class of weakly self-similar fractal quantum graphs.

  8. Exploring Blog Graphs Patterns and a Model for Information

    E-Print Network [OSTI]

    1 Exploring Blog Graphs Patterns and a Model for Information Propagation Mary Mc characterize individual blogs? #12;3 Why blogs? Blogs are a widely used medium of information for many topics and have become an important mode of communication. Blogs cite one another, creating a record of how

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

  10. Reasoning With Discrete Factor Graph Indar Sugiarto(1)

    E-Print Network [OSTI]

    Kuehnlenz, Kolja

    .sugiarto@tum.de (3) conradt@tum.de (2) Bernstein Center for Computational Neuroscience Munich Center for Sensorimotor intelligence and machine learning which emerges from the combination of graph theory and probability theory originating from one of those Bayesian Networks, it is straight forward to use standard exact inference

  11. Proportional Contact Representations of Planar Graphs Md. J. Alam1

    E-Print Network [OSTI]

    Kobourov, Stephen G.

    Proportional Contact Representations of Planar Graphs Md. J. Alam1 , T. Biedl2 , S. Felsner3 , M-contact between the corresponding polygons. Specifically, we consider proportional contact representations, where, the cartographic error, and the unused area. We describe construc- tive algorithms for proportional contact

  12. k-Connectivity in Random Key Graphs with Unreliable Links

    E-Print Network [OSTI]

    Yagan, Osman

    of Eschenauer and Gligor for securing wireless sensor network (WSN) communications. Random key graphs have real-world networks; e.g., with secure WSN application in mind, link unreliability can be attributed for securing WSN communications is the random predistribution of cryptographic keys to sensor nodes

  13. Computing global offensive alliances in Cartesian product graphs

    E-Print Network [OSTI]

    Yero, Ismael G

    2012-01-01

    A global offensive alliance in a graph $G$ is a set $S$ of vertices with the property that every vertex not belonging to $S$ has at least one more neighbor in $S$ than it has outside of $S$. The global offensive alliance number of $G$, $\\gamma_o(G)$, is the minimum cardinality of a global offensive alliance in $G$. A set $S$ of vertices of a graph $G$ is a dominating set for $G$ if every vertex not belonging to $S$ has at least one neighbor in $S$. The domination number of $G$, $\\gamma(G)$, is the minimum cardinality of a dominating set of $G$. In this work we obtain closed formulas for the global offensive alliance number of several families of Cartesian product graphs, we also prove that $\\gamma_o(G\\square H)\\ge \\frac{\\gamma(G)\\gamma_o(H)}{2}$ for any graphs $G$ and $H$ and we show that if $G$ has an efficient dominating set, then $\\gamma_o(G\\square H)\\ge \\gamma(G)\\gamma_o(H).$ Moreover, we present a Vizing-like conjecture for the global offensive alliance number and we prove it for several families of grap...

  14. Partitioning a graph into defensive k-alliances

    E-Print Network [OSTI]

    Yero, Ismael G; Rodriguez-Velazquez, Juan A; Sigarreta, Jose M

    2009-01-01

    A defensive $k$-alliance in a graph is a set $S$ of vertices with the property that every vertex in $S$ has at least $k$ more neighbors in $S$ than it has outside of $S$. A defensive $k$-alliance $S$ is called global if it forms a dominating set. In this paper we study the problem of partitioning the vertex set of a graph into (global) defensive $k$-alliances. The (global) defensive $k$-alliance partition number of a graph $\\Gamma=(V,E)$, ($\\psi_{k}^{gd}(\\Gamma)$) $\\psi_k^{d}(\\Gamma)$, is defined to be the maximum number of sets in a partition of $V$ such that each set is a (global) defensive $k$-alliance. We obtain tight bounds on $\\psi_k^{d}(\\Gamma)$ and $\\psi_{k}^{gd}(\\Gamma)$ in terms of several parameters of the graph including the order, size, maximum and minimum degree, the algebraic connectivity and the isoperimetric number. Moreover, we study the close relationships that exist among partitions of $\\Gamma_1\\times \\Gamma_2$ into (global) defensive $(k_1+k_2)$-alliances and partitions of $\\Gamma_i$ into...

  15. Offensive Alliances in Graphs Odile Favaron, Universite Paris-Sud

    E-Print Network [OSTI]

    Goddard, Wayne

    Offensive Alliances in Graphs Odile Favaron, Universit´e Paris-Sud Gerd Fricke, Morehead State Duane Skaggs, Morehead State University Abstract A set S is an offensive alliance if for every vertex v. The offensive alliance number is the minimum cardi- nality of an offensive alliance. In this paper we explore

  16. Graph-based Navigation Strategies for Heterogeneous Spatial Data Sets

    E-Print Network [OSTI]

    Rodríguez-Tastets, Maria Andrea

    Graph-based Navigation Strategies for Heterogeneous Spatial Data Sets Andrea Rodr´iguez1 the information contribution of data sets based on correspondence relations outperform a strategy that considers- base representation, this work describes strategies that optimize the navigation of data sets

  17. Terminological Logics and Conceptual Graphs: An Historical Perspective?

    E-Print Network [OSTI]

    Schmidt, Renate A.

    expressive ones, like KL of [6]. The history of these algebras can be traced back to the work of Boole, De be traced, as far back, as the nineteenth century, to the beginnings of algebraic logic and quantification on the existential graphs of Peirce. It is less well-known tha* *t, in essence, Peirce also developed the algebraic

  18. Graph Embeddings and the Robertson-Seymour Ekaterina Nepomnyashchaya

    E-Print Network [OSTI]

    Morrow, James A.

    Graph Embeddings and the Robertson-Seymour Theorem Ekaterina Nepomnyashchaya June 4, 2011 Contents . . . . . . . . . . . . . . . . . . . . . . . . 9 4 Overview of the Robertson-Seymour Theorem 10 4.1 Excluded Minors motivation for Robertson and Seymour's work. We cover embed- dings in general, but focus on the understanding

  19. Level of Repair Analysis and Minimum Cost Homomorphisms of Graphs

    E-Print Network [OSTI]

    Gutin, Gregory

    of Lillian Barros Abstract. Level of Repair Analysis (LORA) is a prescribed procedure for defence logistics, LORA seeks to determine an optimal provision of repair and maintenance facilities to minimize overall on bipartite graphs is polynomial time solvable. Keywords: Computational Logistics; Level of Repair Analysis

  20. Spectra of graphs and semi-conducting polymers

    E-Print Network [OSTI]

    Philipp Schapotschnikow; Sven Gnutzmann

    2008-02-04

    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.

  1. Discrete dragline attachment induces aggregation in spiderlings of a solitary species

    E-Print Network [OSTI]

    Theraulaz, Guy

    Discrete dragline attachment induces aggregation in spiderlings of a solitary species RAPHAEL and the experimental data shows that the discrete pattern of silk dragline attachment is the key mechanism involved

  2. Attached is Policy Flash 2013-43 DOE F 4220.2 Small Business...

    Office of Environmental Management (EM)

    43 DOE F 4220.2 Small Business Review Form Attached is Policy Flash 2013-43 DOE F 4220.2 Small Business Review Form Attached is Policy Flash 2013-43 DOE F 4220.2 Small Business...

  3. NEAR MINIMAL WEIGHTED WORD GRAPHS FOR POST-PROCESSING SPEECH Michael T. Johnson and Mary P. Harper

    E-Print Network [OSTI]

    Johnson, Michael T.

    NEAR MINIMAL WEIGHTED WORD GRAPHS FOR POST-PROCESSING SPEECH Michael T. Johnson and Mary P. Harper for representing large numbers of acoustic hypotheses compactly. Word graphs or lattices generated by acoustic the graph. 1. INTRODUCTION Many recognition systems use word lattices or graphs as mechanisms

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

    SciTech Connect (OSTI)

    Brost, Randolph C.; McLendon, William Clarence,

    2013-01-01

    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.

  5. MILLING-GRINDING-DRILLING AND SLOTTING ATTACHMENT (VERSA-M IL)

    E-Print Network [OSTI]

    Gellman, Andrew J.

    TC 9-524 Chapter 9 MILLING-GRINDING-DRILLING AND SLOTTING ATTACHMENT (VERSA-M IL) GENERAL DESCRIPTION The milling-grinding-drilling and slotting attachment is commonly referred to as a Versa-purpose machines. With the different attachments that are available with the unit, drilling, shaping, milling

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

    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.

  7. Pin and roller attachment system for ceramic blades

    DOE Patents [OSTI]

    Shaffer, J.E.

    1995-07-25

    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.

  8. Pin and roller attachment system for ceramic blades

    DOE Patents [OSTI]

    Shaffer, James E. (Maitland, FL)

    1995-01-01

    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. Attachment 4 DOCUMENT NUMBER ICCAT SWORDFISH RE-EXPORT CERTIFICATE

    E-Print Network [OSTI]

    Attachment 4 DOCUMENT NUMBER ICCAT SWORDFISH RE-EXPORT CERTIFICATE RE-EXPORT SECTION: 1. RE-EXPORTING COUNTRY/ENTITY/FISHING ENTITY 2. POINT OF RE-EXPORT 3. DESCRIPTION OF IMPORTED FISH Product Type(*) F OF FISH FOR RE-EXPORT Product Type(*) F/FR RD/GG/DR/ST/FL/OT Net Weight (Kg) * F=FRESH, FR=Frozen, RD

  10. There exist graphs with super-exponential Ramsey multiplicity The Ramsey multiplicity M(G; n) of a graph G is the minimum number of monochromatic

    E-Print Network [OSTI]

    Fox, Jacob

    There exist graphs with super-exponential Ramsey multiplicity constant Jacob Fox Abstract The Ramsey multiplicity M(G; n) of a graph G is the minimum number of monochromatic copies of G over all 2, it is natural to define the Ramsey multiplicity constant C(G) to be limn M(G;n)a v!(n v) , which is the limit

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

    E-Print Network [OSTI]

    Jurisic, Aleksandar; Zitnik, Arjana

    2009-01-01

    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 \

  12. A Graph Analytic Metric for Mitigating Advanced Persistent Threat

    SciTech Connect (OSTI)

    Johnson, John R.; Hogan, Emilie A.

    2013-06-04

    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.

  13. Average Interpolating Wavelets on Point Clouds and Graphs

    E-Print Network [OSTI]

    Rustamov, Raif M

    2011-01-01

    We introduce a new wavelet transform suitable for analyzing functions on point clouds and graphs. Our construction is based on a generalization of the average interpolating refinement scheme of Donoho. The most important ingredient of the original scheme that needs to be altered is the choice of the interpolant. Here, we define the interpolant as the minimizer of a smoothness functional, namely a generalization of the Laplacian energy, subject to the averaging constraints. In the continuous setting, we derive a formula for the optimal solution in terms of the poly-harmonic Green's function. The form of this solution is used to motivate our construction in the setting of graphs and point clouds. We highlight the empirical convergence of our refinement scheme and the potential applications of the resulting wavelet transform through experiments on a number of data stets.

  14. On relaxing the constraints in pairwise compatibility graphs

    E-Print Network [OSTI]

    Calamoneri, Tiziana

    subclasses resulting from the the cases where dmin = 0 (LPG) and dmax = + (mLPG). In particular, we show that the union of LPG and mLPG does not coincide with the whole class PCG, their intersection is not empty, and that neither of the classes LPG and mLPG is contained in the other. Finally, as the graphs we deal with belong

  15. Balanced Cayley graphs and balanced planar Joy Morris 1

    E-Print Network [OSTI]

    Morris, Joy

    University of Lethbridge Department of Mathematics and Computer Science 4401 University Drive, Lethbridge of the complete graph Kt, i.e. Kt has t vertices and no edges. Further, we denote by Cl the cycle of length l with Kt is called an (l, t)-cycle. Fig. 1.1. (8, 3)-cycle Figure 1.1 shows the example of an (8, 3)-cycle

  16. The $Z$-invariant massive Laplacian on isoradial graphs

    E-Print Network [OSTI]

    Cédric Boutillier; Béatrice de Tilière; Kilian Raschel

    2015-04-03

    We introduce a one-parameter family of massive Laplacian operators $(\\Delta^{m(k)})_{k\\in[0,1)}$ defined on isoradial graphs, involving elliptic functions. We prove an explicit formula for minus the inverse of $\\Delta^{m(k)}$, the massive Green function, which has the remarkable property of only depending on the local geometry of the graph, and compute its asymptotics. We study the corresponding statistical mechanics model of random rooted spanning forests. We prove an explicit local formula for an infinite volume Boltzmann measure, and for the free energy of the model. We show that the model undergoes a second order phase transition at $k=0$, thus proving that spanning trees corresponding to the Laplacian introduced by Kenyon are critical. We prove that the massive Laplacian operators $(\\Delta^{m(k)})_{k\\in(0,1)}$ provide a one-parameter family of $Z$-invariant rooted spanning forest models. When the isoradial graph is moreover $\\mathbb{Z}^2$-periodic, we consider the spectral curve $\\mathcal{C}^k$ of the characteristic polynomial of the massive Laplacian. We provide an explicit parametrization of the curve and prove that it is Harnack and has genus 1. We further show that every Harnack curve of genus 1 with $(z,w)\\leftrightarrow(z^{-1},w^{-1})$ symmetry arises from such a massive Laplacian.

  17. Encoding and analyzing aerial imagery using geospatial semantic graphs

    SciTech Connect (OSTI)

    Watson, Jean-Paul; Strip, David R.; McLendon, William C.; Parekh, Ojas D.; Diegert, Carl F.; Martin, Shawn Bryan; Rintoul, Mark Daniel

    2014-02-01

    While collection capabilities have yielded an ever-increasing volume of aerial imagery, analytic techniques for identifying patterns in and extracting relevant information from this data have seriously lagged. The vast majority of imagery is never examined, due to a combination of the limited bandwidth of human analysts and limitations of existing analysis tools. In this report, we describe an alternative, novel approach to both encoding and analyzing aerial imagery, using the concept of a geospatial semantic graph. The advantages of our approach are twofold. First, intuitive templates can be easily specified in terms of the domain language in which an analyst converses. These templates can be used to automatically and efficiently search large graph databases, for specific patterns of interest. Second, unsupervised machine learning techniques can be applied to automatically identify patterns in the graph databases, exposing recurring motifs in imagery. We illustrate our approach using real-world data for Anne Arundel County, Maryland, and compare the performance of our approach to that of an expert human analyst.

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

    E-Print Network [OSTI]

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

    2015-04-23

    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.

  19. Principal Patterns on Graphs: Discovering Coherent Structures in Datasets

    E-Print Network [OSTI]

    Benzi, Kirell; Vandergheynst, Pierre

    2015-01-01

    In this work, we propose a fast, robust and scalable method for retrieving and analyzing recurring patterns of activity induced by a causal process, typically modeled as time series on a graph. We introduce a particular type of multilayer graph as a model for the data. This graph is structured for emphasizing causal relations between connected nodes and their successive time series values. Within the data, the patterns of activity are assumed to be dynamic, sparse or small compared to the size of the network. For some applications they are also expected to appear in a repeated manner over time but are allowed to differ from an exact copy. The analysis of the activity within a social network and within a transportation network illustrates the power and efficiency of the method. Relevant information can be extracted, giving insights on the behavior of group of persons in social networks and on traffic congestion patterns. Moreover, in this era of big data, it is crucial to design tools able to handle large data...

  20. Long cycles in critical graphs Noga Alon Michael Krivelevich y Paul Seymour z

    E-Print Network [OSTI]

    Krivelevich, Michael

    ) Therefore, any k-critical graph on n vertices contains a path of length at least log(n 1)= log(k 2 that there are in#12;nitely many values of n for which there is a k-critical graph on n vertices with no pathLong cycles in critical graphs Noga Alon #3; Michael Krivelevich y Paul Seymour z Abstract

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

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

    E-Print Network [OSTI]

    Roames, Renee S

    2015-01-08

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

  3. THE GEOMETRY OF BRAUER GRAPH ALGEBRAS AND CLUSTER ROBERT J. MARSH AND SIBYLLE SCHROLL

    E-Print Network [OSTI]

    Marsh, Robert J.

    author. 1 #12;2 MARSH AND SCHROLL sense. We may also consider the dual graph of the m-angulation, which

  4. First Steps toward Automated Design of Mechatronic Systems Using Bond Graphs and Genetic Programming

    E-Print Network [OSTI]

    Fernandez, Thomas

    First Steps toward Automated Design of Mechatronic Systems Using Bond Graphs and Genetic for mechatronic systems. The domain of mechatronic systems includes mixtures of, for example, electrical

  5. Choosability of the square of planar subcubic graphs with large girth

    E-Print Network [OSTI]

    Bermond, Jean-Claude

    is at most 5. 1 Introduction Let G be a (simple) graph. The neighbourhood of a vertex v of G, denoted NG(v

  6. Motivation Overview Automatic Segmentation Algorithm Building Colour Models Volumetric Graph-Cut Results Conclusion Automatic 3D Object Segmentation in Multiple

    E-Print Network [OSTI]

    Esteban, Carlos Hernández

    Motivation Overview Automatic Segmentation Algorithm Building Colour Models Volumetric Graph Segmentation in Multiple Views using Volumetric Graph-Cuts #12;Motivation Overview Automatic Segmentation Algorithm Building Colour Models Volumetric Graph-Cut Results Conclusion Motivation Neill Campbell, George

  7. Traffic of cytoskeletal motors with disordered attachment rates

    E-Print Network [OSTI]

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

    2010-02-19

    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.

  8. 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: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity ofkandz-cm11 OutreachProductswsicloudwsiclouddenDVA N C E D B L O OLaura|BilayerBiomimetic DyeBlue Gene/QENT2.0.0 Attachment P

  9. Property:NEPA ApplicationAttachments | Open Energy Information

    Open Energy Info (EERE)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on QA:QA J-E-1 SECTION JEnvironmental Jump to: navigation,PropertyPartner7WebsiteCertReqsApplicationAttachments Jump to:

  10. Section L - Attachment D - Past-Performance Information Form

    National Nuclear Security Administration (NNSA)

    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 Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity of NaturalDukeWakefield Municipal GasAdministration Medal ofNational Nuclear SecuritySecurityriver siteL, Attachment E,

  11. Section L - Attachment D - Past-Performance Information Form

    National Nuclear Security Administration (NNSA)

    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 Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity of NaturalDukeWakefield Municipal GasAdministration Medal ofNational Nuclear SecuritySecurityriver siteL, Attachment E,E,

  12. Section L Attachment G - Management Team Cost Sheet.xlsx

    National Nuclear Security Administration (NNSA)

    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 Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity of NaturalDukeWakefield Municipal GasAdministration Medal ofNational Nuclear SecuritySecurityriver siteL, Attachment E,E,G

  13. Attachment F - Bibliography and References | 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: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity of Natural GasAdjustmentsShirleyEnergyTher i n c i p a l De p u tCorporationIt'sDOE Phasedare listed in Attachment F -

  14. Attachment FY2011-9 | 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: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity of Natural GasAdjustmentsShirleyEnergyTher i n c i p a l De p u tCorporationIt'sDOE Phasedare listed in Attachment F -FFRDC

  15. Attachment H: Delegation of Authority Memorandum | 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: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity of Natural GasAdjustmentsShirleyEnergyTher i n c i p a l De p u tCorporationIt'sDOE Phasedare listed in Attachment F -FFRDC

  16. AttachmentFlash_2010-55.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: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity of Natural GasAdjustmentsShirleyEnergyTher i n c i p a l De p u tCorporationIt'sDOE Phasedare listed in Attachment

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

    E-Print Network [OSTI]

    Sandoval, Erin Leverenz

    2009-05-15

    ; Pistole, 1993). Attachment style affects how people interpret interpersonal stimuli, ?the nature of the emotional experiences triggered, and the memories that are retrieved? (Fonagy, 1998, p. 148). These primary patterns of attachment, developed... in childhood, are postulated to translate into attachment styles, secure or insecure, occurring in adult relationships (Hazan & Shaver, 1987). M. Carole Pistole explains that ?it?s the central caregiving relationship (which is usually with the mother...

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

    SciTech Connect (OSTI)

    Cathy A. Wills

    2009-09-01

    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.

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

    SciTech Connect (OSTI)

    Cathy Wills, ed.

    2010-09-13

    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.

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

    SciTech Connect (OSTI)

    Not Available

    2013-11-01

    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.

  1. Attachment A: Modeling in Support of Additional Two-Unit Operating...

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

    Plan of Mirant Potomac River, LLC Attachment A: Modeling in Support of Additional Two-Unit Operating Configurations More Documents & Publications Mirant Potomac, Alexandria,...

  2. Attachment A: AIP Program Principles (Questions and Answers 1-12)

    Broader source: Energy.gov [DOE]

    This attachment contains twelve questions and answers that designate the mandatory AIP provisions that shall be included in new and renegotiated agreements and discusses the principles underlying...

  3. Social Perception, Emotional Intelligence and Attachment Style: Does A Correlation Exist? 

    E-Print Network [OSTI]

    Kamran, Emma Z

    2008-06-27

    Abstract This study investigated whether correlations existed between social perception (SP), emotional intelligence (EI) and attachment styles (AS). The sample consisted of 92 Caucasian participants recruited from the ...

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

    Office of Environmental Management (EM)

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

  5. Attachment 5 Volume II Pricing Matrix.xls | Department of Energy

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

    Attachment 5 Volume II Pricing Matrix.xls&0; More Documents & Publications Microsoft Word - FY07AnnualReport.doc CX-005455: Categorical Exclusion Determination Microsoft Word -...

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

    E-Print Network [OSTI]

    Butler, Jacqueline Love

    1980-01-01

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

  7. Vacuum energy and repulsive Casimir forces in quantum star graphs 

    E-Print Network [OSTI]

    Fulling, Stephen; Kaplan, L.; Wilson, J. H.

    2007-01-01

    Vacuum energy and repulsive Casimir forces in quantum star graphs S. A. Fulling,1,* L. Kaplan,2,? and J. H. Wilson1,? 1Departments of Mathematics and Physics, Texas A&M University, College Station, Texas 77843-3368, USA 2Department of Physics... vacuum en- ergy in the region outside the box, and it involves ?renormal- ization? in the sense of discarding divergent terms associated with the boundary although #1;unlike the case of parallel plates, or any calculation of forces between rigid...

  8. Groups generated by bounded automata and their schreier graphs 

    E-Print Network [OSTI]

    Bondarenko, Ievgen

    2008-10-10

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

  9. Random Procedures for Dominating Sets in Graphs Sarah Artmann1

    E-Print Network [OSTI]

    of a vertex u V in the graph G is the set NG(u) = {v V | uv E} and the closed neighbourhood of u in G is NG[u] = NG(u){u}. The degree of u in G is the number dG(u) = |NG(u)| of its neighbours. For a set U V let NG[U] = uU NG[U] and NG(U) = NG[U] \\ U. A set of vertices D V of G is dominating, if every vertex in V \\ D

  10. New Developments in MadGraph/MadEvent

    SciTech Connect (OSTI)

    Alwall, Johan; Artoisenet, Pierre; de Visscher, Simon; Duhr, Claude; Frederix, Rikkert; Herquet, Michel; Mattelaer, Olivier; /IBA, Louvain-la-Neuve

    2011-11-08

    We here present some recent developments of MadGraph/MadEvent since the latest published version, 4.0. These developments include: Jet matching with Pythia parton showers for both Standard Model and Beyond the Standard Model processes, decay chain functionality, decay width calculation and decay simulation, process generation for the Grid, a package for calculation of quarkonium amplitudes, calculation of Matrix Element weights for experimental events, automatic dipole subtraction for next-to-leading order calculations, and an interface to FeynRules, a package for automatic calculation of Feynman rules and model files from the Lagrangian of any New Physics model.

  11. Zeros of Eigenfunctions of the Schrodinger Operator on Graphs and Their Relation to the Spectrum of the Magnetic Schrodinger Operator 

    E-Print Network [OSTI]

    Weyand, Tracy Kathleen

    2014-07-07

    on infinite periodic graphs by analyzing the eigenvalues of the magnetic Schrödinger operator on a fundamental domain. Here we consider both discrete and quantum graphs. We find a characterization of critical points of the dispersion relation that occur inside...

  12. Well-quasi-ordering Binary Matroids The Graph Minors Project of Robertson and Seymour is one of the highlights

    E-Print Network [OSTI]

    Banaji,. Murad

    Well-quasi-ordering Binary Matroids The Graph Minors Project of Robertson and Seymour is one with the matroid; thus it is not hard to see that matroids generalise graphs. Robertson and Seymour always believed

  13. A memory-efficient algorithm to obtain splicing graphs and de novo expression estimates from de Bruijn graphs of RNA-Seq data 

    E-Print Network [OSTI]

    Sze, Sing-Hoi; Tarone, Aaron M

    2014-07-14

    The recent advance of high-throughput sequencing makes it feasible to study entire transcriptomes through the application of de novo sequence assembly algorithms. While a popular strategy is to first construct an intermediate de Bruijn graph...

  14. Goal Modular Scene Graph Architecture Classes of Algorithms to create a conceptual framework for based on Open Inventor scene graph stroke based methods

    E-Print Network [OSTI]

    for based on Open Inventor scene graph stroke based methods ·non-photorealistic rendering (NPR) architecture· end user: looks at created renditions or · designer interaction uses applications Open Inventor

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

  16. Cross-Domain Fault Localization: A Case for a Graph Digest Approach

    E-Print Network [OSTI]

    Cross-Domain Fault Localization: A Case for a Graph Digest Approach William D. Fischer Naval an inference-graph-digest based formulation of the problem. The formulation not only explicitly models propagation can use a function to create a digest representation of their network state and dependencies

  17. Construction of abstract state graphs with PVS Susanne Graf and Hassen Saidi

    E-Print Network [OSTI]

    Grosu, Radu

    Construction of abstract state graphs with PVS Susanne Graf and Hassen Saidi VERIMAG Centre at the address http:://www.imag.fr/VERIMAG/PEOPLE/Hassen.Saidi/BRP 2 #12; Construction of abstract state graphs of infinite systems with PVS Susanne Graf and Hassen Saidi VERIMAG 1 Abstract In this paper, we propose

  18. On Self-Assembling Graphs in vitro The Molecular Computing Group

    E-Print Network [OSTI]

    Deaton, Russell J.

    On Self-Assembling Graphs in vitro The Molecular Computing Group Max H. Garzon, Rusell J. Deaton in vitro by self-regulating molecular processes. This type of structure, the so-called automatic graphs how the navigator can be implemented as a moleculethat directs the self-assembly process to build

  19. Qualitative Modelling of Genetic Networks: From Logical Regulatory Graphs to Standard

    E-Print Network [OSTI]

    Ruet, Paul

    Qualitative Modelling of Genetic Networks: From Logical Regulatory Graphs to Standard Petri Nets, a systematic rewriting of logical genetic reg- ulatory graphs in terms of standard Petri net models is proposed. We show that, in the Boolean case, the combination of the logical approach with the standard Petri

  20. ISIT 1998, Cambridge, MA. USA, August 16 -August 21 On Tanner Graphs of Lattices and Codes

    E-Print Network [OSTI]

    Gulak, P. Glenn

    and cross section of A on Wi, 2) deriv- ing a simple Tanner graph for the corresponding label code of A. Banihashemi, Frank R. Kschischang, and P. Glenn Gulak Dept. of Electrical and Computer Engineering, University- complexity Tanner graph for an n-dimensional (n-D)lattice A, it is reasonable to divide the problem into two

  1. 12 Trees and Graphs 12.1 Rooted and Unrooted Trees

    E-Print Network [OSTI]

    Goddard, Wayne

    , here is a representation of butane: four carbons and ten hydrogen. c Wayne Goddard, Clemson University, and 3 carbon atoms respectively), but there are two isomers of butane. For you to do! 1. Draw the other isomer of butane. 12.2 Graphs A (simple) graph is a collection of vertices and edges such that each edge

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

  3. Discrete Applied Mathematics 95 (1999) 241249 Note on a helicopter search problem on graphs

    E-Print Network [OSTI]

    Fomin, Fedor V.

    1999-01-01

    Discrete Applied Mathematics 95 (1999) 241­249 Note on a helicopter search problem on graphs Fedor 1998 Abstract We consider a search game on a graph in which one cop in a helicopter ying from vertex . In the ÿrst step, Cop occupies some vertex of G. In each of the following steps, Cop moves ( ies by helicopter

  4. The freezing threshold for k-colourings of a random graph Michael Molloy

    E-Print Network [OSTI]

    Molloy, Mike

    The freezing threshold for k-colourings of a random graph Michael Molloy March 9, 2012 Abstract We rigorously determine the exact freezing threshold, rf k , for k-colourings of a random graph. We prove using the non-rigorous cavity method. It has been hypothesized that the freezing threshold is the cause

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

  6. Degree Ramsey numbers of graphs William B. Kinnersley # , Kevin G. Milans + , Douglas B. West #

    E-Print Network [OSTI]

    West, Douglas B.

    Degree Ramsey numbers of graphs William B. Kinnersley # , Kevin G. Milans + , Douglas B. West class. Let the s­color degree Ramsey number of a graph G, written R# (G; s), be min{#(H) : H s # G that are re­ lated to degree Ramsey numbers of paths. Finally, for cycles we show that R# (C 2k+1 ; s) # 2

  7. Combining Bond-Graphs with Genetic Programming for Unified/Automated Design of Mechatronic or

    E-Print Network [OSTI]

    Fernandez, Thomas

    Combining Bond-Graphs with Genetic Programming for Unified/Automated Design of Mechatronic or Multi of a mechatronic system makes it difficult to model using a single modeling technique over the whole system and polymorphic modeling and simulation technique. Bond-Graph model of the mechatronic system can be directly

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

  9. Perfect Completion and Deletion in Random Graphs Assaf Natanzon \\Lambda Ron Shamir \\Lambda y

    E-Print Network [OSTI]

    Shamir, Ron

    Perfect Completion and Deletion in Random Graphs Assaf Natanzon \\Lambda Ron Shamir \\Lambda y Abstract In the Perfect Completion problem one wishes to add the fewest possible edges to a graph in order Introduction Edge Completion/Deletion problems call for making minimum changes to the edge set of an input

  10. Multi-rate Estimation of Coloured Noise Models in Graph-Based Estimation Algorithms

    E-Print Network [OSTI]

    Nelson, James

    Multi-rate Estimation of Coloured Noise Models in Graph-Based Estimation Algorithms Simon J. Julier. In this paper, we consider how coloured noise models can be efficiently incorporated within graph position, three velocity, three orientation). The GPS noise model introduces an extra six states (second

  11. c 2003 Association for Computational Linguistics Graph-Based Generation of Referring

    E-Print Network [OSTI]

    for the generation of referring expressions; and (4) the combined use of graphs and cost functions paves the wayc 2003 Association for Computational Linguistics Graph-Based Generation of Referring Expressions Eindhoven University of Technology This article describes a new approach to the generation of referring

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

  13. ForPeerReview Bond graph model of a switched reluctance machine

    E-Print Network [OSTI]

    Batlle, Carles

    Keywords: Electric machines, Reluctance machines, Modeling Are any of authors IEEE Member?: No Are any the electromechanical energy transformation in electrical machines, is used for a SRM. The bond graph modelForPeerReview Bond graph model of a switched reluctance machine Journal: Transactions on Industrial

  14. Termination Graphs for Java Bytecode M. Brockschmidt, C. Otto, C. von Essen, and J. Giesl

    E-Print Network [OSTI]

    Ábrahám, Erika

    Termination Graphs for Java Bytecode M. Brockschmidt, C. Otto, C. von Essen, and J. Giesl LuFG Informatik 2, RWTH Aachen University, Germany Abstract. To prove termination of Java Bytecode (JBC) automatically, we transform JBC to finite termination graphs which represent all pos- sible runs of the program

  15. Fundamenta Informaticae 33(2), 1998, 201{209 1 Termination of graph rewriting is undecidable

    E-Print Network [OSTI]

    Plump, Detlef

    Fundamenta Informaticae 33(2), 1998, 201{209 1 IOS Press Termination of graph rewriting pushout approach") is terminating. The proof is by a reduction of the Post Correspondence Problem or of the termination problem for string rewriting systems to the present problem. Keywords: graph rewriting

  16. A Rule-Based Quasi-Static Scheduling Approach for Static Islands in Dynamic Dataflow Graphs

    E-Print Network [OSTI]

    Teich, Jürgen

    A A Rule-Based Quasi-Static Scheduling Approach for Static Islands in Dynamic Dataflow Graphs-Nuremberg In this article, an efficient rule-based clustering algorithm for static dataflow subgraphs in a dynamic dataflow graph is presented. The clustered static dataflow actors are quasi-statically scheduled, in such a way

  17. A COVERING-GRAPH APPROACH TO EPIDEMICS ON SIS AND SIS-LIKE NETWORKS

    E-Print Network [OSTI]

    Floyd, William

    without first passing to the sus- ceptible state. We use a covering graph construction to compare SIR, SIS of infectives. The same covering graph construction allows us to characterize the recurrent states in a SIS on the stochastic SIS model, so that asymptotic behavior is uninteresting; we consider certain long-lived states

  18. Sand Drawings and Gaussian Graphs Erik D. Demaine Martin L. Demaine

    E-Print Network [OSTI]

    Demaine, Erik

    Sand Drawings and Gaussian Graphs Erik D. Demaine Martin L. Demaine Computer Science and AI@cs.mcgill.ca Abstract Sand drawings form a part of many cultural artistic traditions. Depending on the part of the world uncover a bridge between sand drawings and Gaussian graphs, leading to a variety of new mathematical

  19. System-Level Synthesis of MEMS via Genetic Programming and Bond Graphs

    E-Print Network [OSTI]

    Hu, Jianjun

    System-Level Synthesis of MEMS via Genetic Programming and Bond Graphs Zhun Fan+ , Kisung Seo for automatic synthesis of MEMS system-level lumped parameter models using genetic programming and bond graphs. This paper first dis- cusses the necessity of narrowing the problem of MEMS synthesis into a certain specific

  20. The domination number of on-line social networks and random geometric graphs

    E-Print Network [OSTI]

    Pralat, Pawel

    of graphs in the Facebook 100 data set, and these bounds are well-correlated with those predicted geometric graphs. 1. Introduction On-line social networks (or OSNs) such as Facebook have emerged as a hot-demographics are closer together in the space. We give the precise definition of the GEO-P model (actually, one of its

  1. People Search within an Online Social Network: Large Scale Analysis of Facebook Graph Search Query Logs

    E-Print Network [OSTI]

    Karahalios, Karrie G.

    People Search within an Online Social Network: Large Scale Analysis of Facebook Graph Search Query and Facebook2 , Menlo Park, CA 94025 {spirin2,kkarahal}@illinois.edu and {jfh,miked,maxime}@fb.com ABSTRACT Facebook in- troduced its innovative Graph Search product with the goal to take the OSN search experience

  2. A solid solution to a conjecture on the maximal energy of bipartite bicyclic graphs

    E-Print Network [OSTI]

    Huo, Bofeng; Li, Xueliang; Shi, Yongtang

    2011-01-01

    The energy of a simple graph $G$, denoted by $E(G)$, is defined as the sum of the absolute values of all eigenvalues of its adjacency matrix. Let $C_n$ denote the cycle of order $n$ and $P^{6,6}_n$ the graph obtained from joining two cycles $C_6$ by a path $P_{n-12}$ with its two leaves. Let $\\mathscr{B}_n$ denote the class of all bipartite bicyclic graphs but not the graph $R_{a,b}$, which is obtained from joining two cycles $C_a$ and $C_b$ ($a, b\\geq 10$ and $a \\equiv b\\equiv 2\\, (\\,\\textmd{mod}\\, 4)$) by an edge. In [I. Gutman, D. Vidovi\\'{c}, Quest for molecular graphs with maximal energy: a computer experiment, {\\it J. Chem. Inf. Sci.} {\\bf41}(2001), 1002--1005], Gutman and Vidovi\\'{c} conjectured that the bicyclic graph with maximal energy is $P^{6,6}_n$, for $n=14$ and $n\\geq 16$. In [X. Li, J. Zhang, On bicyclic graphs with maximal energy, {\\it Linear Algebra Appl.} {\\bf427}(2007), 87--98], Li and Zhang showed that the conjecture is true for graphs in the class $\\mathscr{B}_n$. However, they could not...

  3. A Space-Filling Visualization Technique for Multivariate Small World Graphs

    SciTech Connect (OSTI)

    Wong, Pak C.; Foote, Harlan P.; Mackey, Patrick S.; Chin, George; Huang, Zhenyu; Thomas, James J.

    2012-03-15

    We introduce an information visualization technique, known as GreenCurve, for large sparse graphs that exhibit small world properties. Our fractal-based design approach uses spatial cues to approximate the node connections and thus eliminates the links between the nodes in the visualization. The paper describes a sophisticated algorithm to order the neighboring nodes of a large sparse graph by solving the Fiedler vector of its graph Laplacian, and then fold the graph nodes into a space-filling fractal curve based on the Fiedler vector. The result is a highly compact visualization that gives a succinct overview of the graph with guaranteed visibility of every graph node. We show in the paper that the GreenCurve technology is (1) theoretically sustainable by introducing an error estimation metric to measure the fidelity of the new graph representation, (2) empirically rigorous by conducting a usability study to investigate its strengths and weaknesses against the traditional graph layout, and (3) pragmatically feasible by applying it to analyze stressed conditions of the large scale electric power grid on the west coast.

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

  5. The structure of graphs with a vital linkage of Dillon Mayhew

    E-Print Network [OSTI]

    Whittle, Geoff

    The structure of graphs with a vital linkage of order 2 Dillon Mayhew Geoff Whittle Stefan H. M, each of which is a path. A linkage is vital if it spans all vertices, and no other linkage connects the same pairs of end vertices. We give a charac- terization of the graphs with a vital linkage of order 2

  6. A lower bound for the tree-width of planar graphs with vital linkages

    E-Print Network [OSTI]

    Adler, Isolde

    A lower bound for the tree-width of planar graphs with vital linkages Isolde Adler, Philipp Klaus implementable. The algorithm uses a bound on the tree- width of graphs with vital linkages, and deletion with vital linkages, and for the size of the grid necessary for finding irrelevant vertices. 1 Introduction

  7. Existence and stability of standing waves for the NLS equation on a tadpole graph

    E-Print Network [OSTI]

    Pelinovsky, Dmitry

    Existence and stability of standing waves for the NLS equation on a tadpole graph Dmitry Pelinovsky.00455. Series of papers on star graphs by Adami-Cacciapuoti-Finco-Noja: Scattering of solitons; Standing waves.Banica-L.Ignat (2011-2014). Classification of standing waves and computations of the bifurcation diagram on tadpole

  8. Existence and stability of standing waves for the NLS equation on a tadpole graph

    E-Print Network [OSTI]

    Pelinovsky, Dmitry

    Existence and stability of standing waves for the NLS equation on a tadpole graph Dmitry Pelinovsky of solitons; Standing waves and stability (2011-14). Recent work by Adami-Serra-Tilli on nonexistence on trees (including star graphs) in V.Banica-L.Ignat (2011-2014). Classification of standing waves

  9. AN SDP-BASED DIVIDE-AND-CONQUER ALGORITHM FOR LARGE SCALE NOISY ANCHOR-FREE GRAPH REALIZATION

    E-Print Network [OSTI]

    Chuan, Toh Kim

    -HANG Z. LEUNG AND KIM-CHUAN TOH Abstract. We propose the DISCO algorithm for graph realization in Rd

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

    E-Print Network [OSTI]

    Williams, Susan

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

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

    E-Print Network [OSTI]

    Silver, Dan

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

  12. Discrete Mathematical Approaches to Graph-Based Traffic Analysis

    SciTech Connect (OSTI)

    Joslyn, Cliff A.; Cowley, Wendy E.; Hogan, Emilie A.; Olsen, Bryan K.

    2014-04-01

    Modern cyber defense and anlaytics requires general, formal models of cyber systems. Multi-scale network models are prime candidates for such formalisms, using discrete mathematical methods based in hierarchically-structured directed multigraphs which also include rich sets of labels. An exemplar of an application of such an approach is traffic analysis, that is, observing and analyzing connections between clients, servers, hosts, and actors within IP networks, over time, to identify characteristic or suspicious patterns. 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. In this paper, we consider traffic analysis of Netflow using both basic graph statistics and two new mathematical measures involving labeled degree distributions and time interval overlap measures. We do all of this over the VAST test data set of 96M synthetic Netflow graph edges, against which we can identify characteristic patterns of simulated ground-truth network attacks.

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

    SciTech Connect (OSTI)

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

    2012-10-01

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

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

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

    E-Print Network [OSTI]

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

    2015-07-24

    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.

  16. Mlp2p, A Component of Nuclear Pore Attached Intranuclear Filaments, Associates with Nic96p*

    E-Print Network [OSTI]

    Panté, Nelly

    Mlp2p, A Component of Nuclear Pore Attached Intranuclear Filaments, Associates with Nic96p is localized at the terminal ring of the nuclear basket. When Nic96p was affinity purified from glutaraldehyde- logues, which form the nuclear pore-attached intranu- clear filaments (Strambio-de-Castillia, C., Blobel

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

    DOE Patents [OSTI]

    Kruse, John S

    2014-03-25

    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.

  18. Cycle structure in SR and DSR graphs: implications for multiple equilibria and stable oscillation in chemical reaction networks

    E-Print Network [OSTI]

    Banaji, Murad

    2010-01-01

    Associated with a chemical reaction network is a natural labelled bipartite multigraph termed an SR graph, and its directed version, the DSR graph. These objects are closely related to Petri nets. The construction of SR and DSR graphs for chemical reaction networks is presented. Conclusions about asymptotic behaviour of the associated dynamical systems which can be drawn easily from the graphs are discussed. In particular, theorems on ruling out the possibility of multiple equilibria or stable oscillation in chemical reaction networks based on computations on SR/DSR graphs are presented. These include both published and new results. The power and limitations of such results are illustrated via several examples.

  19. Remedial action plan and site design for stabilization of the inactive uranium processing site at Naturita, Colorado. Appendix B of Attachment 3: Groundwater hydrology report, Attachment 4: Water resources protection strategy, Final

    SciTech Connect (OSTI)

    Not Available

    1994-03-01

    Attachment 3 Groundwater Hydrology Report describes the hydrogeology, water quality, and water resources at the processing site and Dry Flats disposal site. The Hydrological Services calculations contained in Appendix A of Attachment 3, are presented in a separate report. Attachment 4 Water Resources Protection Strategy describes how the remedial action will be in compliance with the proposed EPA groundwater standards.

  20. Linking SARAH and MadGraph using the UFO format

    E-Print Network [OSTI]

    Staub, Florian

    2012-01-01

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