Sample records for graphs attachment 3-sampling from the National Library of Energy Beta (NLEBeta)

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

In this paper we present a novel method for creating realistic, controllable motion. Given a corpus of motion capture data, we automatically construct a directed graph called a motion graph that encapsulates connections among the database. The ... Keywords: animation with constraints, motion capture, motion synthesis

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

The present invention includes an attachment apparatus comprising a rotation limiting member adapted to be threaded onto a threaded member; and a preload nut adapted to be threaded onto the threaded member. The rotation limiting member comprises a plurality of pins; and the preload nut comprises plurality of slots, preferably wherein the plurality of pins and the plurality of slots are the same in number, which is preferably three. The plurality of pins of the rotation limiting member are filled into a corresponding plurality of slots of the preload nut to form a rotatable unit adapted to be threaded onto the threaded member. In use, the rotatable unit is threaded onto the threaded member. The present invention thus provides a unitized removable device for holes, including holes other than circular in shape, which have an established depth before an end of, or before an enlargement of the hole. The configuration of some exposed part of the device, or the head, is shaped and formed for its intended purpose, such as clamping, anchor points, eye bolts, stud anchor, and the like. The device allows for the installation, preloading and removal of all components of the device, as a unit, without damage to the member for which attachment is required by simple rotations of some exposed part of the device.

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

As a fundamental problem in pattern recognition, graph matching has applications in a variety of fields, from computer vision to computational biology. In graph matching, patterns are modeled as graphs and pattern recognition amounts to finding a correspondence between the nodes of different graphs. Many formulations of this problem can be cast in general as a quadratic assignment problem, where a linear term in the objective function encodes node compatibility and a quadratic term encodes edge compatibility. The main research focus in this theme is about designing efficient algorithms for approximately solving the quadratic assignment problem, since it is NP-hard. In this paper we turn our attention to a different question: how to estimate compatibility functions such that the solution of the resulting graph matching problem best matches the expected solution that a human would manually provide. We present a method for learning graph matching: the training examples are pairs of graphs and the `labels' are ma...

The center of a graph is the set of vertices with minimum eccentricity. Graphs in which all vertices are central are called self-centered graphs. In this paper almost self-centered (ASC) graphs are introduced as the graphs with exactly two non-central vertices. The block structure of these graphs is described and constructions for generating such graphs are proposed. Embeddings of arbitrary graphs into ASC graphs are studied. In particular it is shown that any graph can be embedded into an ASC graph of prescribed radius. Embeddings into ASC graphs of radius two are studied in more detail. Embedding index of a graph G is introduced as the smallest number of vertices needed to add to G such that G is an induced subgraph of an ASC graph.

and Adar, 2004 corporate e-mail #12;5 Power transmission grid of Western US Reference: Duncan Watts #12 The Internet as mapped by The Opte Project http://www.opte.org #12;8 Graph terminology #12;9 Some graph

A detachment of a graph $G$ is formed by splitting each vertex into one or more subvertices, and sharing the incident edges arbitrarily among the subvertices. In this paper we consider the question of whether a graph $H$ is a detachment of some complete ...

Semantic graphs can be used to organize large amounts of information from a number of sources into one unified structure. A semantic query language provides a foundation for extracting information from the semantic graph. The graph query language described here provides a simple, powerful method for querying semantic graphs.

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.

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.

Sample records for graphs attachment 3-sampling from the National Library of Energy Beta (NLEBeta)

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

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.

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

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.

Given a set of model graphs D and a query graph q, containment search aims to find all model graphs g ? D such that q contains g (q ? g). Due to the wide adoption of graph models, fast containment search ...

Many graph optimization problems can be viewed as graph layout problems. A layout of a graph is a geometric arrangement of the vertices subject to given constraints. For example, the vertices of a graph can be arranged on ...

The theory of graph transformation [2] was originally developed as a generalization of Chomsky grammars from strings to graphs. Methods, techniques, and tools from the area of graph transformations have already been studied and applied in many fields of computer science such as formal language theory, pattern recognition and generation, compiler construction, software engineering, etc. Despite the large variety of existing graph transformation tools, the implementation of their graph transformation engine typically follows the same principle. In this respect, first a matching occurrence of the left-hand side (LHS) of the graph transformation rule is being found by some sophisticated graph pattern matching algorithm. Then the engine performs some local modifications to add or remove graph elements to the matching pattern, and the entire process starts all over again. Since graph pattern matching leads to the subgraph isomorphism problem that is known to be NPcomplete in general, this step is considered to be the most crucial in the overall performance of a graph transformation engine. Current tools (e.g., PROGRES [4]) use different efficient strategies for the graph pattern matching phase. However, I argue that the overall complexity of a graph transformation engine is not necessarily equal to the complexity of the graph pattern matching phase, especially for long transformation sequences.

New graph structures where node labels are members of hierarchically organized ontologies or taxonomies have become commonplace in different domains, e.g., life sciences. It is a challenging task to mine for frequent patterns in this new graph model ...

Recently, a number of researchers have investigated a class of algorithms that are based on multilevel graph partitioning that have moderate computational complexity, and provide excellent graph partitions. However, there exists little theoretical analysis ...

We study parallel complexity of signed graphs motivated by the highly complex genetic recombination processes in ciliates. The molecular gene assembly operations have been modeled by operations of signed graphs, i.e., graphs where the vertices have a ... Keywords: Double-split graphs, Gene assembly, Local complement, Parallel assembly, Perfect matching, Signed graphs, Split graphs

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.

One major area of difficulty in developing an algorithm for embedding a graph on a surface is handling bridges which have more than one possible placement. This paper addresses a number of published algorithms where this has not been handled correctly. ... Keywords: Algorithm, Graph embedding, Graph genus, Torus

We prove an upper bound for the number of edges a C"4-free graph on q^2+q vertices can contain for q even. This upper bound is achieved whenever there is an orthogonal polarity graph of a plane of even order q. Keywords: Extremal graph, Polarity, Projective plane

The problem of monitoring an electric power system by placing as few measurement devices in the system as possible is closely related to the well-known domination problem in graphs. In 2002, Haynes et al. considered the graph theoretical representation ... Keywords: algorithm, block graphs, electric power system, power dominating set

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.

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.

We provide a complete description of the giant component of the Erd\\H{o}s-R\\'enyi random graph $G(n,p)$ as soon as it emerges from the scaling window, i.e., for $p = (1+\\epsilon)/n$ where $\\epsilon^3 n \\to \\infty$ and $\\epsilon=o(1)$. Our description is particularly simple for $\\epsilon = o(n^{-1/4})$, where the giant component $C_1$ is contiguous with the following model (i.e., every graph property that holds with high probability for this model also holds w.h.p. for $C_1$). Let $Z$ be normal with mean $\\frac23 \\epsilon^3 n$ and variance $\\epsilon^3 n$, and let $K$ be a random 3-regular graph on $2\\lfloor Z\\rfloor$ vertices. Replace each edge of $K$ by a path, where the path lengths are i.i.d. geometric with mean $1/\\epsilon$. Finally, attach an independent Poisson($1-\\epsilon$)-Galton-Watson tree to each vertex. A similar picture is obtained for larger $\\epsilon=o(1)$, in which case the random 3-regular graph is replaced by a random graph with $N_k$ vertices of degree $k$ for $k\\geq 3$, where $N_k$ has mean...

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

A homomorphism from a graph X to a graph Y is an adjacency preserving mapping f:V(X)->V(Y). We consider a nonlocal game in which Alice and Bob are trying to convince a verifier with certainty that a graph X admits a homomorphism to Y. This is a generalization of the well-studied graph coloring game. Via systematic study of quantum homomorphisms we prove new results for graph coloring. Most importantly, we show that the Lovasz theta number of the complement lower bounds the quantum chromatic number, which itself is not known to be computable. We also show that other quantum graph parameters, such as quantum independence number, can differ from their classical counterparts. Finally, we show that quantum homomorphisms closely relate to zero-error channel capacity. In particular, we use quantum homomorphisms to construct graphs for which entanglement-assistance increases their one-shot zero-error capacity.

Sample records for graphs attachment 3-sampling from the National Library of Energy Beta (NLEBeta)

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

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

We introduce and study Maker-Breaker positional games on random graphs. Our goal is to determine the threshold probability pF for the existence of Maker's strategy to claim a member of F in the unbiased (one-on-one) game played on the edges of the random graph G(n; p), for various target families F of winning sets. More generally, for each probability above this threshold we study the smallest bias b such that Maker wins the (1: b) biased game. We investigate these functions for a number of basic games, like the connectivity game, the perfect matching game, the clique game, the Hamiltonian cycle game and the tree game. Particular attention is devoted to unbiased games, when b = 1. Next, we consider the planarity game and the k-coloring game on the complete graph on n vertices. In the planarity game the winning sets are all non-planar subgraphs, and in the k-coloring game the winning sets are all non-k-colorable subgraphs. For both of the games we look at a (1: b) biased game. We are interested in determining the largest bias b such that Maker wins the Maker-Breaker version of the game. On the other hand, we want to find the largest bias b such that Forcer wins the Avoider-Forcer version of the game. Finally, we deal with balanced online games on the random graph process. The game is played by a player called Painter. Edges in the random graph process are introduced two at a time. For each pair of edges Painter immediately and irrevocably chooses one of the two possibilities to color one of them red and the other one blue. His goal is to avoid creating a monochromatic copy of a prescribed fixed graph H, for as long as possible. We study the threshold mH for the number of edges to be played to know that Painter almost surely will create a monochromatic copy of H, for H being a cycle, a path and a star.

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.

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.

Natural graphs, such as social networks, email graphs, or instant messaging patterns, have become pervasive through the internet. These graphs are massive, often containing hundreds of millions of nodes and billions of edges. While some theoretical models ... Keywords: asynchronous algorithms, distributed optimization, graph algorithms, graph factorization, large-scale machine learning, matrix factorization

Let P be a set of n points in the plane. A geometric proximity graph on P is a graph where two points are connected by a straight-line segment if they satisfy some prescribed proximity rule. We consider four classes of higher order proximity graphs, ... Keywords: Crossing number, Geometric graphs, Proximity graphs

This paper presents two novel graph-clustering algorithms, Clustering based on a Near Neighbor Graph (CNNG) and Clustering based on a Grid Cell Graph (CGCG). CNNG algorithm inspired by the idea of near neighbors is an improved graph-clustering method ... Keywords: Clustering, Grid Cell Graph, Grid cell, Near Neighbor Graph, Near neighbor point set

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.

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.

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.

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.

Attachment J TERMS AND CONDITIONS AWARD # PON-10-603 #12;TERMS AND CONDITIONS TABLE OF CONTENTS ............................................................................... 24 i #12;TERMS AND CONDITIONS 1. Grant Agreement This project is being funded with a grant from is comprised of the grant funding award, the Terms and Conditions, and all attachments. These Terms

Attachment K TERMS AND CONDITIONS AWARD # #12;TERMS AND CONDITIONS TABLE OF CONTENTS SECTION PAGE ............................................................................... 24 i #12;TERMS AND CONDITIONS 1. Grant Agreement This project is being funded with a grant from, the Terms and Conditions, and all attachments. These Terms and Conditions are standard requirements

Graph partitioning is an important abstraction used in solving many scientific computing problems. Unfortunately, the standard partitioning model does not incorporate considerations that are important in many settings. We address this by describing a generalized partitioning model which incorporates the notion of partition skew and is applicable to a variety of problems. We then develop enhancements to several important partitioning algorithms necessary to solve the generalized partitioning problem. Finally we demonstrate the benefit of employing several of these generalized methods to static decomposition of parallel computing problems.

Sample records for graphs attachment 3-sampling from the National Library of Energy Beta (NLEBeta)

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

Quantum networks are often modelled using Schrödinger operators on metric graphs. To give meaning to such models one has to know how to interpret the boundary conditions which match the wave functions at the graph vertices. In this article we give a survey

A graph is Hamiltonian if it contains a cycle which passes through every vertex of the graph exactly once. A classical theorem of Dirac from 1952 asserts that every graph on $n$ vertices with minimum degree at least $n/2$ is Hamiltonian. We refer to such graphs as Dirac graphs. In this paper we extend Dirac's theorem in two directions and show that Dirac graphs are robustly Hamiltonian in a very strong sense. First, we consider a random subgraph of a Dirac graph obtained by taking each edge independently with probability $p$, and prove that there exists a constant $C$ such that if $p \\ge C \\log n / n$, then a.a.s. the resulting random subgraph is still Hamiltonian. Second, we prove that if a $(1:b)$ Maker-Breaker game is played on a Dirac graph, then Maker can construct a Hamiltonian subgraph as long as the bias $b$ is at most $cn /\\log n$ for some absolute constant $c > 0$. Both of these results are tight up to a constant factor, and are proved under one general framework.

An undirected graph G=(V,E) is a probeC graph if its vertex set can be partitioned into two sets, N (nonprobes) and P (probes) where N is independent and there exists E^'@?NxN such that G^'=(V,E@?E^') is a C graph. In this article we investigate probe ... Keywords: 2-SAT, Graph class, Probe graphs, Probe interval, Probe threshold, Probe trivially perfect

Enterprises monitor cyber traffic for viruses, intruders and stolen information. Detection methods look for known signatures of malicious traffic or search for anomalies with respect to a nominal reference model. Traditional anomaly detection focuses on aggregate traffic at central nodes or on user-level monitoring. More recently, however, traffic is being viewed more holistically as a dynamic communication graph. Attention to the graph nature of the traffic has expanded the types of anomalies that are being sought. We give an overview of several cyber data streams collected at Los Alamos National Laboratory and discuss current work in modeling the graph dynamics of traffic over the network. We consider global properties and local properties within the communication graph. A method for monitoring relative entropy on multiple correlated properties is discussed in detail.

Graph partitioning is the grouping of all the nodes in a graph into two or more partitions based on certain criteria. Graph cut techniques are used to partition a graph. The Minimum Cut method gives imbalanced partitions. ...

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

We introduce and study Maker/Breaker-type positional games on random graphs. Our main concern is to determine the threshold probability pF for the existence of Maker's strategy to claim a member of in the unbiased game played on the edges of random graph G(n, p), for various target families of winning sets. More generally, for each probability above this threshold we study the smallest bias b such that Maker wins the (1: b) biased game. We investigate these functions for a number of basic games, like the connectivity game, the perfect matching game, the clique game and the Hamiltonian cycle game.

A design project was carried out which began with the study and critique of office paper attachment systems, such as paperclips and staples. A set of criteria for an ideal system of attachment was then developed. This led ...

Relational graphs are widely used in modeling large scale networks such as biological networks and social networks. In this kind of graph, connectivity becomes critical in identifying highly associated groups and clusters. In this paper, we investigate ... Keywords: closed pattern, connectivity, graph

In this work, the well-known Graph Partitioning (GP) problem for undirected weighted graphs has been studied from two points of view: maximizing (MaxCut) or minimizing (MinCut) the cost of the cut induced in the graph by the partition. An unified model, ...

Sample records for graphs attachment 3-sampling from the National Library of Energy Beta (NLEBeta)

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

The mathematical model of the molecular polarizability of fifty-four organic compounds, of the lattice enthalpy of twenty metal halides, and of the partition coefficient of twenty-five organic compounds has been used to test four different complete graph, ... Keywords: Mathematical model, algorithms, chemical graphs, complete graphs, core electrons, molecular connectivity, polarizability

Topic detection with large and noisy data collections such as social media must address both scalability and accuracy challenges. KeyGraph is an efficient method that improves on current solutions by considering keyword cooccurrence. We show that KeyGraph ... Keywords: KeyGraph-based Topic Detection, Topic detection, community detection, network analysis

The paradigm of simulated annealing is applied to the problem of drawing graphs nicely. Our algorithm deals with general undirected graphs with straight-line edges, and employs several simple criteria for the aesthetic quality of the result. ... Keywords: aesthetics, graph drawing, simulated annealing

A containment attachment device is described for operatively connecting a glovebag to plastic sheeting covering hazardous material. The device includes an inner split ring member connected on one end to a middle ring member wherein the free end of the split ring member is inserted through a slit in the plastic sheeting to captively engage a generally circular portion of the plastic sheeting. A collar portion having an outer ring portion is provided with fastening means for securing the device together wherein the glovebag is operatively connected to the collar portion. Hazardous material such as radioactive waste may be sealed in plastic bags for small items or wrapped in plastic sheeting for large items. Occasionally the need arises to access the hazardous material in a controlled manner, that is, while maintaining total containment. Small items could be placed entirely inside a containment glovebag. However, it may not be possible or practical to place large items inside a containment; instead, one or more glovebags could be attached to the plastic sheeting covering the hazardous material. It is this latter application for which the split ring containment attachment device is intended.

The maximum flow, shortest path, and maximum matching problems are a set of basic graph problems that are critical in theoretical computer science and applications. Constrained graph optimization, a variation of these basic graph problems involving modification of the underlying graph, is equally important but sometimes significantly harder. In particular, one can explore these optimization problems with additional cost constraints. In the preservation case, the optimizer has a budget to preserve vertices or edges of a graph, preventing them from being deleted. The optimizer wants to find the best set of preserved edges/vertices in which the cost constraints are satisfied and the basic graph problems are optimized. For example, in shortest path preservation, the optimizer wants to find a set of edges/vertices within which the shortest path between two predetermined points is smallest. In interdiction problems, one deletes vertices or edges from the graph with a particular cost in order to impede the basic graph problems as much as possible (for example, delete edges/vertices to maximize the shortest path between two predetermined vertices). Applications of preservation problems include optimal road maintenance, power grid maintenance, and job scheduling, while interdiction problems are related to drug trafficking prevention, network stability assessment, and counterterrorism. Computational hardness results are presented, along with heuristic methods for approximating solutions to the matching interdiction problem. Also, efficient algorithms are presented for special cases of graphs, including on planar graphs. The graphs in many of the listed applications are planar, so these algorithms have important practical implications.

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

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

Information value has been implicitly utilized and mostly non-subjectively computed in information retrieval (IR) systems. We explicitly define and compute the value of an information piece as a function of two parameters, the first is the potential semantic impact the target information can subjectively have on its recipient's world-knowledge, and the second parameter is trust in the information source. We model these two parameters as properties of RDF graphs. Two graphs are constructed, a target graph representing the semantics of the target body of information and a context graph representing the context of the consumer of that information. We compute information value subjectively as a function of both potential change to the context graph (impact) and the overlap between the two graphs (trust). Graph change is computed as a graph edit distance measuring the dissimilarity between the context graph before and after the learning of the target graph. A particular application of this subjective information valuation is in the construction of a personalized ranking component in Web search engines. Based on our method, we construct a Web re-ranking system that personalizes the information experience for the information-consumer.

Abstract. We show that the triangulations of a finite point set form a flip graph that can be embedded isometrically into a hypercube, if and only if the point set has no empty convex pentagon. Point sets of this type include convex subsets of lattices, points on two lines, and several other infinite families. As a consequence, flip distance in such point sets can be computed efficiently. 1

We show that the triangulations of a finite point set form a flip graph that can be embedded isometrically into a hypercube, if and only if the point set has no empty convex pentagon. Point sets of this type include intersections of lattices with convex sets, points on two lines, and several other infinite families. As a consequence, flip distance in such point sets can be computed efficiently.

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.

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

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

Sample records for graphs attachment 3-sampling from the National Library of Energy Beta (NLEBeta)

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

Scientific measurements are often depicted as line graphs. State-of-the-art high throughput systems in life sciences, telemetry and electronics measurement rapidly generate hundreds to thousands of such graphs. Despite the increasing volume and ubiquity ... Keywords: Focus+Context, line graph

Given a large, real graph, how can we generate a synthetic graph that matches its properties, i.e., it has similar degree distribution, similar (small) diameter, similar spectrum, etc? We propose to use "Kronecker graphs", which naturally obey ...

Reingold, Vadhan and Wigderson [21] introduced the graph zig-zag product. This product combines a large graph and a small graph into one graph, such that the resulting graph inherits its size from the large graph, its degree from the small graph ... Keywords: expander graphs, zig-zag product

Private data often come in the form of associations between entities, such as customers and products bought from a pharmacy, which are naturally represented in the form of a large, sparse bipartite graph. As with tabular data, it is desirable to be able ... Keywords: Graph, Microdata, Privacy, Query answering

The amount of suspicious binary executables submitted to Anti-Virus (AV) companies are in the order of tens of thousands per day. Current hash-based signature methods are easy to deceive and are inefficient for identifying known malware that have undergone ... Keywords: call graph, graph edit distance, malware, simulated annealing, static analysis

In this survey we give an overview about important methods to construct quantum algorithms and quantum lower bounds for graph problems. We show how to use these methods, and we give a summary about the quantum complexity of the most important graph problems. At the end of our paper, we give some interesting questions in this research area.

Let $\\G$ be an oriented graph of order $n$ and $\\a_1,\\a_2,..., \\a_n$ denote all the eigenvalues of the skew-adjacency matrix of $\\G.$ The skew energy $\\displaystyle{\\cal E}_s(\\G)= \\sum_{i=1}^{n} |\\a_i|.$ In this paper, the oriented unicyclic graphs with minimal and maximal skew energy are determined.

How does the Web look? How could we tell an abnormal social network from a normal one? These and similar questions are important in many fields where the data can intuitively be cast as a graph; examples range from computer networks to sociology to biology ... Keywords: Generators, graphs, patterns, social networks

We present a simple and efficient algorithm for randomly generating simple graphs without small cycles. These graphs can be used to design high performance Low-Density Parity-Check (LDPC) codes. For any constant k, ? ? 1/2k(k ...

Graphing is a key skill in the study of Physics. Drawing and interpreting graphs play a key role in the understanding of science, while the lack of these has proved to be a handicap and a limiting factor in the learning of scientific concepts. It has ... Keywords: Face-to-face computer supported collaborative learning, Intelligent tutoring systems, Interactive learning environments, Robotic assisted teaching

The problem of describing variable structure models in a compact, object--oriented fashion is revisited and analyzed from the perspective of bond graph modeling. Traditionally, bond graphs have always been used to describe continuous-- time physical processes with a fixed structure. Yet, this paper shall demonstrate that bond graphs are equally suitable to describe variable structure models as fixed structure models. Moreover, a bond graph description of variable structure models can teach us a lot about the essential properties of variable structure models, properties that are not easily visible when other modeling approaches are taken. The paper discusses issues related to causality reassignment and conditional index changes as a consequence of switching in a physical system. Keywords: Bond graphs, variable structure system, computational causality, conditional index change, switching, object--oriented modeling, Dymola. INTRODUCTION When the causality strokes were added to the forme...

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

Graph algorithms are challenging to parallelize when high performance and scalability are primary goals. Low concurrency, poor data locality, irregular access pattern, and high data access to computation ratio are among the chief reasons for the challenge. The performance implication of these features is exasperated on distributed memory machines. More success is being achieved on shared-memory, multi-core architectures supporting multithreading. We consider a prototypical graph problem, coloring, and show how a greedy algorithm for solving it can be e*ectively parallelized on multithreaded architectures. We present in particular two di*erent parallel algorithms. The first relies on speculation and iteration, and is suitable for any shared-memory, multithreaded system. The second uses data ow principles and is targeted at the massively multithreaded Cray XMT system. We benchmark the algorithms on three di*erent platforms and demonstrate scalable runtime performance. In terms of quality of solution, both algorithms use nearly the same number of colors as the serial algorithm.

Sample records for graphs attachment 3-sampling from the National Library of Energy Beta (NLEBeta)

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

Competition in markets is ubiquitous: cell-phone providers, computer manufacturers, and sport gear brands all vie for customers. Though several coexisting competitors are often observed in empirical data, many current theoretical models of competition on small-world networks predict a single winner taking over the majority of the network. We introduce a new model of product adoption that focuses on word-of-mouth recommendations to provide an explanation for this coexistence of competitors. The key property of our model is that customer choices evolve simultaneously with the network of customers. When a new node joins the network, it chooses neighbors according to preferential attachment, and then chooses its type based on the number of initial neighbors of each type. This can model a new cell-phone user choosing a cell-phone provider, a new student choosing a laptop, or a new athletic team member choosing a gear provider. We provide a detailed analysis of the new model; in particular, we determine the possibl...

It is well known that, of all graphs with edge-density p, the random graph G(n,p) contains the smallest density of copies of K"t","t, the complete bipartite graph of size 2t. Since K"t","t is a t-blowup of an edge, the following intriguing open question ... Keywords: Blowup, Graph density, Triangle density

The problem of enumerating the maximal cliques of a graph is a computationally expensive problem with applications in a number of different domains. Sometimes the benefit of knowing the maximal clique enumeration (MCE) of a single graph is worth investing ... Keywords: Graph algorithms, Graph perturbation theory, Maximal clique enumeration, Uncertain and noisy data

A new algorithm which explicitly describes the depleted hydrogen atoms is proposed for chemical graph computations, and especially for molecular connectivity model studies. The new algorithm continues to be centred on the concepts of complete graphs ... Keywords: General chemical graphs, complete graphs, hydrogen perturbation, molecular connectivity computations

system, active surge control. A novel method of modeling centrifugal compression systems for surge control purposes by using bond graphs is presented. By using the bond graph method, we get a simple description of compression systems based on physical phenomena and it is straight forward to get the dynamic equations. It is demonstrated that several active surge control methods can be represented by the same bond graph. It is also shown how methods for active surge control can be classified using energy flow in terms of upstream energy injection or downstream energy dissipation. A model of a compression system with recycle flow is derived in this work. 1.

The oriented chromatic number of an oriented graph $\\vec G$ is the minimum order of an oriented graph $\\vev H$ such that $\\vec G$ admits a homomorphism to $\\vev H$. The oriented chromatic number of an undirected graph $G$ is then the greatest oriented chromatic number of its orientations. In this paper, we introduce the new notion of the upper oriented chromatic number of an undirected graph $G$, defined as the minimum order of an oriented graph $\\vev U$ such that every orientation $\\vec G$ of $G$ admits a homomorphism to $\\vec U$. We give some properties of this parameter, derive some general upper bounds on the ordinary and upper oriented chromatic numbers of Cartesian, strong, direct and lexicographic products of graphs, and consider the particular case of products of paths.

We present a small set of attachment heuristics for postnominal PPs occurring in full-text articles related to enzymes. A detailed analysis of the results suggests their utility for extraction of relations expressed by nominalizations (often with several ...

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

]. A (d, d + 1)-graph is said to be semiregular. An (r, r + 1)-factorization of a graph is a decomposition of the graph into edge-disjoint (r, r + 1)-factors. We discuss here the state of knowledge about (r, r +1)-factorizations of d-regular graphs and of (d, d + 1)-graphs. For r, s 0, let (r, s) be the least integer

Sample records for graphs attachment 3-sampling from the National Library of Energy Beta (NLEBeta)

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

Graph invariants are the best and single tools for investigation of abstract structures of graphs. They, combined in convenient relations, carry global and general information about a graph and its various substructures (cycle structures, factors, colorings, coverings, and so on). In this survey paper we have attempted to bring together all direct (pure) relations between basic invariants of a graph and its large cycle structures, perhaps the most important cycle structures, namely Hamilton, longest, dominating and some generalized cycles including Hamilton and dominating cycles as special cases. These very few relations actually form a source (basis) from which nearly all possible hamiltonian results can be developed further based on generalized and extended invariants, extended list of path or cycle structures and additional structural limitations.

This thesis explores the issues involved in designing an interactive chart and graph making system, especially tailored to the needs of the graphic designer. It defines a set of user interface requirements and describe the ...

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

Information is often presented in graphical form. Unfortunately, current assistive technologies such as screen readers are not well-equipped to handle these representations. To provide accessibility to graphs published in ``The Daily" (Statistics Canada's ... Keywords: accessibility (blind and visually impaired), natural language interaction, statistical graphs

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

Graph clustering has become ubiquitous in the study of relational data sets. We examine two simple algorithms: a new graphical adaptation of the k-medoids algorithm and the Girvan-Newman method based on edge betweenness centrality. We show that they can be effective at discovering the latent groups or communities that are defined by the link structure of a graph. However, both approaches rely on prohibitively expensive computations, given the size of modern relational data sets. Network structure indices (NSIs) are a proven technique for indexing network structure and efficiently finding short paths. We show how incorporating NSIs into these graph clustering algorithms can overcome these complexity limitations. We also present promising quantitative and qualitative evaluations of the modified algorithms on synthetic and real data sets. 1.

Abstract. Let (?, M n) be an effective smooth action of (Z2) k on an n-dimensional smooth closed connected manifold having a finite fixed set. One can associate to this action a regular graph of valency n. If the action is nonbounding one uses this graph to obtain a lower bound for the number of fixed points. Furthermore, this result is applied to a general nonbounding (Z2) k-action fixing a finite fixed set. With the help of graphs and the Kosniowski-Stong formula, up to cobordism all (Z2) k-actions fixing three isolated points (resp. four isolated points) are classified completely, and at the same time, the Smith problem for (Z2) k-actions fixing three isolated points (resp. four isolated points) is also solved. 1.

One cannot guarantee the presence of an oriented four-cycle in an oriented graph $D$ simply by demanding it has many edges, as an acyclic orientation of the complete graph on $n$ vertices has $\\binom{n}{2}$ edges -- the most possible -- but contains no oriented cycle. We show that a simple quasi-randomness condition on the orientation of $D$ does allow one to guarantee the presence of an oriented four-cycle. Significantly our results work even for sparse oriented graphs. Furthermore, we give examples which show that, in a sense, our result is best possible. We also prove a result concerning oriented six-cycles and a more general result in the case $D$ is dense. Finally, we raise a number of questions and conjectures related to these results.

Let Knc denote a complete graph on n vertices whose edges are colored in an arbitrary way. And let ?(Knc) denote the maximum number of edges of the same ... Keywords: alternating cycle, color degree, edge-colored graph

We show how to exploit symmetries of a graph to efficiently compute the fastest mixing Markov chain on the graph (i.e., find the transition probabilities on the edges to minimize the second-largest eigenvalue modulus of ...

??Recent advances in database research have shown the potential of graph in modelling complicated data. Graph data have pervaded many modern applications including bio-informatics, chem-informatics, (more)

are placed at a particular vertex of the graph, called the homebase. Moreover, this sequence of moves must is aiming at clearing the whole network. Given a graph G and a homebase v0 V (G), the search problem

of the graph, called the homebase. Moreover, this sequence of moves must satisfy that recontamination never network. Given a graph G and a homebase v0 V (G), the search problem consists in designing a distributed

Automatic layout algorithms are commonly used when displaying graphs on the screen because they provide a nice drawing of the graph without user intervention. There are, however, a couple of disadvantages to automatic layout. Without user ...

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

Attachment 14 Exhibit D Special Terms and Conditions Exhbit D PON-12-605 Special Terms. By accepting this grant, Recipient as a material term of this agreement shall be fully responsible wage. Therefore, as a material term of this grant, Recipient must either: (a) Proceed on the assumption

The graph cuts in image segmentation have been widely used in recent years because it regards the problem of image partitioning as a graph partitioning issue, a well-known problem in graph theory. The normalized cut approach uses spectral graph properties ... Keywords: graph partitioning, image segmentation, quadtree, spectral graph

Sample records for graphs attachment 3-sampling from the National Library of Energy Beta (NLEBeta)

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

Graph-Coloring problem (GCP) deals with assigning labels (colors) to the vertices of a graph such that adjacent vertices do not get the same color. Coloring a graph with minimum number of colors is a well-known NP-hard problem. In this paper a new permutation ... Keywords: Graph coloring problem, message passing interface (MPI), migration model, parallel genetic algorithm, static wavelength assignment

Discovering patterns in graphs has long been an area of interest. In most approaches to such pattern discovery either quantitative anomalies, frequency of substructure or maximum flow is used to measure the interestingness of a pattern. In this paper ... Keywords: multi-relational graphs, semantic pattern discovery in RDF graphs, subgraph discovery

A model study of the molecular polarizabilities of a wide heterogeneous class of organic compounds was carried out. The model of this property was based on graph-theoretical molecular connectivity and pseudoconnectivity basis indices, including the corresponding ... Keywords: complete graphs, core electrons, graph-theoretical connectivity indices, molecular polarizabilities

We investigate a kinetic version of point-set embeddability. Given a plane graph G(V,E) where |V|=n, and a set P of n moving points where the trajectory of each point is an algebraic function of constant ... Keywords: kinetic algorithm, kinetic graph drawing, plane graph, point-set embeddability

This paper presents our logical display approach for Distribution Networks based on the concept of Microsoft graphs. We demonstrate that by using Microsoft graphs we do not have to redraw the circuits after each switching operation or after a change ... Keywords: algorithms, distribution, graphs, logical display, network systems

Although users of online communication tools rarely categorize their contacts into groups such as "family", "co-workers", or "jogging buddies", they nonetheless implicitly cluster contacts, by virtue of their interactions with them, forming implicit ... Keywords: contact group clustering, implicit social graph, tie strength

Graph clustering has become ubiquitous in the study of relational data sets. We examine two simple algorithms: a new graphical adaptation of the k-medoids algorithm and the Girvan-Newman method based on edge betweenness centrality. We show that ...

In the past few years, mesh representation of images has attracted a lot of research interest due to its wide area of applications in image processing. In the mesh framework, an image is represented by a graph in which the nodes represent the pixels ... Keywords: content adaptative mesh, grid smoothing, image coding, non-linear optimisation

In social network theory, a simple graph G is called k-role assignable if there is a surjective mapping that assigns a number from {1,...,k} called a role to each vertex of G such that any two vertices with the same role have ...

A new characterization of Hamiltonian graphs using f-cutset matrix is proposed. A new exact polynomial time algorithm for the traveling salesman problem (TSP) based on this new characterization is developed. We then define so called ordered weighted adjacency list for given weighted complete graph and proceed to the main result of the paper, namely, the exact algorithm based on utilization of ordered weighted adjacency list and the simple properties that any path or circuit must satisfy. This algorithm performs checking of sub-lists, containing (p-1) entries (edge pairs) for paths and p entries (edge pairs) for circuits, chosen from ordered adjacency list in a well defined sequence to determine exactly the shortest Hamiltonian path and shortest Hamiltonian circuit in a weighted complete graph of p vertices. The procedure has intrinsic advantage of landing on the desired solution in quickest possible time and even in worst case in polynomial time. A new characterization of shortest Hamiltonian tour for a weighted complete graph satisfying triangle inequality (i.e. for tours passing through every city on a realistic map of cities where cities can be taken as points on a Euclidean plane) is also proposed. Finally, we discuss a novel classical algorithm for unstructured search and its effect on any of the NP-Complete problems.

Many real applications involve optimisation problems where more than one objective has to be optimised at the same time. One of these kinds of problems is graph partitioning, that appears in applications such as VLSI design, data-mining, efficient disc ...

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

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

In this paper, we study the system diagnosis on an n-dimensional star under the comparison model. Following the concept of local diagnosability [3], the strong local diagnosability property [7] is discussed; this property describes the equivalence of ... Keywords: Comparison diagnosis model, Extended star structure, Local diagnosability, MM* diagnosis model, Star graph, Strong local diagnosability property

Multicellular organisms undergo a complex developmental process, orchestrated by the genetic information in their cells, in order to form a newborn individual from a fertilized egg. This complex process, not completely understood yet, is believed to ... Keywords: Development, Expressive power, Genetic regulation, Graph grammars, Regulated rewriting

Sample records for graphs attachment 3-sampling from the National Library of Energy Beta (NLEBeta)

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

The state space of most adversary games is a directed graph. However, due to the success of simple recursive algorithms based on Alpha-Beta, theoreticians and practitioners have concentrated on the traversal of trees, giving the field the name "game-tree ... Keywords: game playing, search

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.

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

We study Maker/Breaker games on the edges of sparse graphs. Maker and Breaker take turns in claiming previously unclaimed edges of a given graph H. Maker aims to occupy a given target graph G and Breaker tries to prevent Maker from achieving his goal. We define a function f and show that for every d-regular graph G on n vertices there is a graph H with at most f(d)n edges such that Maker can occupy a copy of G in the game on H.

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

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

We propose to make nodes in a cluster double as compute nodes and network attached storage (NAS) nodes. This allows for a flexible and customizable storage system as the NAS control software is handled by regular workstations. The nodes can still be efficient compute nodes if networks with remote DMA capabilities are used, as such networks remove the processor from the data forwarding loop. We demonstrate this through measurements of a prototype implementation.

Trunnions on elbows are generally used as supports and are also used in some applications as anchors. The qualification of trunnions is an important item in the design and fitness-for-service of many piping systems. This report provides equations, based on experimental and test data, for determining the stress indices, B and C, and the flexibility factor, k, for elbows with hollow circular cross-section attachments (trunnions). The report contains explicit modifications to ASME Code Cases 391 and 392 for...

When a graph database is implemented on top of a relational database, queries in the graph query language are translated into relational SQL queries. Graph pattern queries are an important feature of a graph query language. Translating graph pattern queries into single SQL statements results in very poor query performance. By taking into account the pattern query structure and generating multiple SQL statements, pattern query performance can be dramatically improved. The performance problems encountered with the single SQL statements generated for pattern queries reflects a problem in the SQL query planner and optimizer. Addressing this problem would allow relational databases to better support semantic graph databases. Relational database systems that provide good support for graph databases may also be more flexible platforms for data warehouses.

We analyze in situ measurements of solar wind velocity obtained by Advanced Composition Explorer (ACE) spacecraft and Helios spacecraft during the years 1998-2012 and 1975-1983 respectively. The data belong to mainly solar cycle 23 (1996-2008) and solar cycle 21 (1976-1986) respectively. We use Directed Horizontal Visibility graph (DHVg) algorithm and estimate a graph functional, namely, the degree distance (D) as the Kullback-Leibler divergence (KLD) argument to understand time irreversibility of solar wind time series. We estimate this degree distance irreversibility parameter for these time series at different phases of solar activity cycle. Irreversibility parameter is first established for known dynamical data and then applied for solar wind velocity time series. It is observed that irreversibility in solar wind velocity fluctuations show similar behaviour at 0.3 AU (Helios data) and 1 AU (ACE data). Moreover it changes over the different phases of solar activity cycle.

S is a local maximum stable set of a graph G, and we write S@?@J(G), if the set S is a maximum stable set of the subgraph induced by S@?N(S), where N(S) is the neighborhood of S. In Levit and Mandrescu (2002) [5] we have proved that @J(G) is a greedoid ... Keywords: Corona, Greedoid, Local maximum stable set, Zykov sum

We consider the following maker-breaker game on a graph G that has a partition of the edge set E into two spanning trees E1 and E2. Initially the edges of E1 are purple and the edges of E2 blue. Maker and breaker move alternately. In a move of the maker a blue edge is coloured purple. The breaker then has to recolour a different edge blue in such a way that the purple and the blue edges are spanning trees again. The goal of the maker is to exchange all colours, i.e. to make E1 blue and E2 purple. We prove that a sufficient but not necessary condition for the breaker to win is that the graph contains an induced K4. Furthermore we characterize the structure of a partition of a wheel into two spanning trees and show that the maker wins on wheels Wn with n ? 4 and provide an example of a graph where, for some partitions, the maker wins, for some others, the breaker wins.

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

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

The intersection graph of a collection C of sets is a graph on the vertex set C, in which C1,C2 ? C are joined by an edge if and only if C1 ? C2 ... Keywords: chromatic number, intersection graph, quasi-planar, string graph, topological graph

In pattern recognition applications, it is useful to represent objects by attributed graphs considering their structural properties. Besides, some graph matching problems need a Common Labelling between vertices of a set of graphs. Computing this Common ... Keywords: graduated assignment, graph common labelling, inconsistent labelling, multiple graph matching, softassign

Sample records for graphs attachment 3-sampling from the National Library of Energy Beta (NLEBeta)

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

In the past years, various network architectures for parallel computers have been proposed, for example, hyper cubes or star graphs. These classes of networks are known as Cayley graphs. In recent years, there have been some proposals of new families ... Keywords: Cayley graphs, degree four Cayley graphs, diameter, hypercubes, interconnection networks, network topology, routing algorithms, star graphs

We live in a world increasingly dominated by networks -- communications, social, information, biological etc. A central attribute of many of these networks is that they are dynamic, that is, they exhibit structural changes over time. While the practice of dynamic networks has proliferated, we lag behind in the fundamental, mathematical understanding of network dynamism. Existing research on time-varying graphs ranges from preliminary algorithmic studies (e.g., Ferreira's work on evolving graphs) to analysis of specific properties such as flooding time in dynamic random graphs. A popular model for studying dynamic graphs is a sequence of graphs arranged by increasing snapshots of time. In this paper, we study the fundamental property of reachability in a time-varying graph over time and characterize the latency with respect to two metrics, namely store-or-advance latency and cut-through latency. Instead of expected value analysis, we concentrate on characterizing the exact probability distribution of routing l...

The connective constant of a graph is the exponential growth rate of the number of self-avoiding walks starting at a given vertex. Strict inequalities are proved for connective constants of vertex-transitive graphs. Firstly, the connective constant decreases strictly when the graph is replaced by a non-trivial quotient graph. Secondly, the connective constant increases strictly when a quasi-transitive family of new edges is added. These results have the following implications for Cayley graphs. The connective constant of a Cayley graph decreases strictly when a new relator is added to the group, and increases strictly when a non-trivial group element is declared to be a generator.

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.

A computer-based graphing simulator used tutorial modules to teach 61 undergraduate college students how to create cumulative graphs from sets of data. One group was required to complete the steps of constructing an appropriate graph within a computer-provided ... Keywords: Computer-based instruction, Graphing, Programmed instruction, Simulation

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

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.

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.

Sample records for graphs attachment 3-sampling from the National Library of Energy Beta (NLEBeta)

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

Branching morphogenesis is a developmental process shared by many organs, including the submandibular salivary gland. During morphogenesis, cells within the gland undergo rearrangements to cause changes in the overall tissue morphology. This work presents ... Keywords: branching morphogenesis, cell-graphs, graph-mining, salivary gland

We describe a construction that maps any connected graph G on three or more vertices into a larger graph, H(G), whose independence number is strictly smaller than its Lov\\'asz number which is equal to its fractional packing number. The vertices of H(G) represent all possible events consistent with the stabilizer group of the graph state associated with G, and exclusive events are adjacent. Mathematically, the graph H(G) corresponds to the orbit of G under local complementation. Physically, the construction translates into graph-theoretic terms the connection between a graph state and a Bell inequality maximally violated by quantum mechanics. In the context of zero-error information theory, the construction suggests a protocol achieving the maximum rate of entanglement-assisted capacity, a quantum mechanical analogue of the Shannon capacity, for each H(G). The violation of the Bell inequality is expressed by the one-shot version of this capacity being strictly larger than the independence number. Finally, given the correspondence between graphs and exclusivity structures, we are able to compute the independence number for certain infinite families of graphs with the use of quantum non-locality, therefore highlighting an application of quantum theory in the proof of a purely combinatorial statement.

embedded in the text of Web pages, and to transform the page-level graph into a generalized data graph- ply be Page, InfoUnit, or richer concept names such as Person, Organization, etc., that can. Thus each node in the EWG corresponds to ei- ther a Web page or an information unit (InfoUnit for short

transmission can be formulated as the bandwidth problem for the ... [6], the hypercube graph [23], the grid graph [7], the complete k-level t-ary tree [39], the .... The 'diag' operator maps an n × n matrix to the n-vector given by its diagonal, while.

We describe a new class of scattering matrices for quantum graphs in which back-scattering is prohibited. We discuss some properties of quantum graphs with these scattering matrices and explain the advantages and interest in their study. We also provide two methods to build the vertex scattering matrices needed for their construction.

The purpose of this text is to set up a few basic notions concerning quantum graphs, to indicate some areas addressed in the quantum graph research, and to provide some pointers to the literature. The pointers in many cases are secondary, i.e. they refer to other surveys.

In this paper we address the problem of detecting topics in large-scale linked document collections. Recently, topic detection has become a very active area of research due to its utility for information navigation, trend analysis, and high-level description ... Keywords: citation graphs, correlation of text and links, graph mining, probabilistic measure, topic detection

We introduce TG/MC, a Monte Carlo approach for evaluating the impact of uncertainty about vulnerabilities upon forecasts of security for a real-world system modeled by a protection graph. A TG/MC model defines a vulnerability as a potential change to ... Keywords: Monte Carlo, TG, Take-Grant, protection graph, security

Commute time has proved to be a powerful attribute for clustering and characterising graph structure, and which is easily computed from the Laplacian spectrum. Moreover, commute time is robust to deletions of random edges and noisy edge weights. In this ... Keywords: commute times, convolution kernel, graph kernel, laplacian

Total electron attachment rate constants and cross sections for halomethane and haloethane (freon) compounds are summarized and new results are reported for haloethylenes. The relationship between the electron attachment cross section and the breakdown strength of dielectric gases reported earlier is further discussed.

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.

A graph G is called g-perfect if, for any induced subgraph H of G, the game chromatic number of H equals the clique number of H. A graph G is called g-col-perfect if, for any induced subgraph H of G, the game coloring number of H equals the clique number of H. In this paper we characterize the classes of g-perfect resp. g-col-perfect graphs by a set of forbidden induced subgraphs and explicitly. Moreover, we study similar notions for variants of the game chromatic number, namely B-perfect and [A, B]-perfect graphs, and for several variants of the game coloring number, and characterize the classes of these graphs.

In this contribution we study the onset of chaos via type-II intermittency within the framework of Horizontal Visibility graph theory. We construct graphs associated to time series generated by an iterated map close to a Neimark-Sacker bifurcation and study, both numerically and analytically, their main topological properties. We find well defined equivalences between the main statistical properties of intermittent series (scaling of laminar trends and Lyapunov exponent) and those of the resulting graphs, and accordingly construct a graph theoretical description of type-II intermittency. We finally recast this theory into a graph-theoretical renormalization group framework, and show that the fixed point structure of RG flow diagram separates regular, critical and chaotic dynamics.

A general method for the study of the entanglement evolution of graph states under the action of Pauli maps was recently proposed in Cavalcanti et al. [Phys. Rev. Lett. 103, 030502 (2009)]. This method is based on lower and upper bounds to the entanglement of the entire state as a function only of the state of a (typically) considerably smaller subsystem undergoing an effective noise process related to the original map. This provides a huge decrease in the size of the matrices involved in the calculation of entanglement in these systems. In the present paper we elaborate on this method in detail 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.

Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for the bounded error quantum query complexity of Connectivity, Strong Connectivity, Minimum Spanning Tree, and Single Source Shortest Paths. For example we show that the query complexity of Minimum Spanning Tree is in Theta(n^{3/2}) in the matrix model and in Theta(sqrt{nm}) in the array model, while the complexity of Connectivity is also in Theta(n^{3/2}) in the matrix model, but in Theta(n) in the array model. The upper bounds utilize search procedures for finding minima of functions under various conditions.

A Randon Geometric Graph (RGG) is constructed by distributing n nodes uniformly at random in the unit square and connecting two nodes if their Euclidean distance is at most r, for some prescribed r. They analyze the following randomized broadcast algorithm on RGGs. At the beginning, there is only one informed node. Then in each round, each informed node chooses a neighbor uniformly at random and informs it. They prove that this algorithm informs every node in the largest component of a RGG in {Omicron}({radical}n/r) rounds with high probability. This holds for any value of r larger than the critical value for the emergence of a giant component. In particular, the result implies that the diameter of the giant component is {Theta}({radical}n/r).

Sample records for graphs attachment 3-sampling from the National Library of Energy Beta (NLEBeta)

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

A model of discrete spacetime on a microscopic level is considered. It is a directed acyclic dyadic graph. This is the particular case of a causal set. The goal of this model is to describe particles as some repetitive symmetrical self-organized structures of the graph without any reference to continuous spacetime. The dynamics of the model is considered. This dynamics is stochastic sequential additions of new vertexes. Growth of the graph is a Markovian process. This dynamics is a consequence of a causality principle.

We show that every sufficiently large plane triangulation has a large collection of nested cycles that either are pairwise disjoint, or pairwise intersect in exactly one vertex, or pairwise intersect in exactly two vertices. We apply this result to show that for each fixed positive integer $k$, there are only finitely many $k$-crossing-critical simple graphs of average degree at least six. Combined with the recent constructions of crossing-critical graphs given by Bokal, this settles the question of for which numbers $q>0$ there is an infinite family of $k$-crossing-critical simple graphs of average degree $q$.

In this talk, we explore the structure of networks from a spectral graph-theoretic perspective by analyzing the properties of the Laplacian matrix associated with the graph induced by a network. We will see how the eigenvalues of the graph Laplacian relate to the underlying network structure and dynamics and provides insight into a phenomenon frequently observed in real world networks - the emergence of collective behavior from purely local interactions seen in the coordinated motion of animals and phase transitions in biological networks, to name a few.

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

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

Electron attachment to chlorine azide (ClN{sub 3}) was studied using a flowing-afterglow Langmuir-probe apparatus. Electron attachment rates were measured to be 3.5x10{sup -8} and 4.5x10{sup -8} cm{sup 3} s{sup -1} at 298 and 400 K, respectively, with an estimated 35% absolute accuracy. Cl{sup -} was the sole ion product of the attachment reaction; weak ion signals were observed for other anions and attributed to impurities and secondary ion-molecule reactions. Assuming a relative uncertainty of {+-}10% for these data, an activation energy for the attachment reaction may be given as 24{+-}10 meV.

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

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

We give a rigorous and self-contained survey of the abelian sandpile model and rotor-router model on finite directed graphs, highlighting the connections between them. We present several intriguing open problems.

Describing exciting new opportunities for utilizing robust graph representations of data with common machine learning algorithms, this book demonstrates and investigates these novel techniques through the domain of web content mining.

Although OWL 2 is widely used to describe complex objects such as chemical molecules, it cannot represent structural' features of chemical entities (e.g., having a ring). A combination of rules and description graphs (DGs) has been proposed ...

This paper presents a graph-theoretic model of the acquisition of lexical syntactic representations. The representations the model learns are non-categorical or graded. We propose a new evaluation methodology of syntactic acquisition in the framework ...

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

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.

Searching for patterns in graphs and visualizing the search results is an active area of research with numerous applications. With the continual growth of database size, querying these databases often results in multiple solutions. Text-based systems ...

This work proposes a simple and effective approach to modeling multiphysics nuclear reactor problems using bond graphs. The conventional method of modeling the coupled multiphysics transients in nuclear reactors is operator ...

In this paper, we present an experimental evaluation of graph clustering strategies in terms of their effectiveness in optimizing I/O for path query processing in digital map databases. Clustering optimization is attractive because it does not incurs any run-time cost, and is complimentary to many of the existing techniques in path query optimization. We first propose a novel graph clustering technique, called Spatial Partition Clustering (SPC), that creates balanced partitions of links based on the spatial proximity of their origin nodes. We then select three alternative clustering techniques from the literature, namely two-way partitioning, approximately topological clustering, and random clustering, to compare their performance in path query processing with SPC. Experimental evaluation indicates that our SPC performs the best for the high-locality graphs (such as GIS maps), whereas the two-way partitioning approach performs the best for no-locality random graphs. 1 Introduction 1....

Sample records for graphs attachment 3-sampling from the National Library of Energy Beta (NLEBeta)

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

We discuss the meaning of geometrical constructions associated to loop quantum gravity states on a graph. In particular, we discuss the 'twisted geometries' and derive a simple relation between these and Regge geometries.

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

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

We investigate the behavior of electric potentials on distance-regular graphs, and extend some results of a prior paper. Our main result, Theorem 4, shows(together with Corollary 3) that if distance is measured by the electric resistance between points then all points are close to being equidistant on a distance-regular graph with large valency. A number of auxiliary results are also presented.

For a set of quantum states generated by the action of a group, we consider the graph obtained by considering two group elements adjacent whenever the corresponding states are non-orthogonal. We analyze the structure of the connected components of the graph and show two applications to the optimal estimation of an unknown group action and to the search for decoherence free subspaces of quantum channels with symmetry.

Goal - design methods to characterize and identify a low dimensional representation of graphs. Impact - enabling predictive simulation; monitoring dynamics on graphs; and sampling and recovering network structure from limited observations. Areas to explore are: (1) Enabling technologies - develop novel algorithms and tailor existing ones for complex networks; (2) Modeling and generation - Identify the right parameters for graph representation and develop algorithms to compute these parameters and generate graphs from these parameters; and (3) Comparison - Given two graphs how do we tell they are similar? Some conclusions are: (1) A bad metric can make anything look good; (2) A metric that is based an edge-by edge prediction will suffer from the skewed distribution of present and absent edges; (3) The dominant signal is the sparsity, edges only add a noise on top of the signal, the real signal, structure of the graph is often lost behind the dominant signal; and (4) Proposed alternative: comparison based on carefully chosen set of features, it is more efficient, sensitive to selection of features, finding independent set of features is an important area, and keep an eye on us for some important results.

Subject of this paper is the thermal investigation of epoxy (EDA) and solder (SDA) die attaches by a comparison of an ASIC with multiple heat sources in different package assemblies. Static and transient thermal measurements and simulations were performed to investigate the thermal behavior of two samples in a state of the art QFP power package differing only in the die attach material (EDA and SDA).

Detecting sequence homology between protein sequences is a fundamental problem in computational molecular biology, with a pervasive application in nearly all analyses that aim to structurally and functionally characterize protein molecules. While detecting the homology between two protein sequences is relatively inexpensive, detecting pairwise homology for a large number of protein sequences can become computationally prohibitive for modern inputs, often requiring millions of CPU hours. Yet, there is currently no robust support to parallelize this kernel. In this paper, we identify the key characteristics that make this problemparticularly hard to parallelize, and then propose a new parallel algorithm that is suited for detecting homology on large data sets using distributed memory parallel computers. Our method, called pGraph, is a novel hybrid between the hierarchical multiple-master/worker model and producer-consumer model, and is designed to break the irregularities imposed by alignment computation and work generation. Experimental results show that pGraph achieves linear scaling on a 2,048 processor distributed memory cluster for a wide range of inputs ranging from as small as 20,000 sequences to 2,560,000 sequences. In addition to demonstrating strong scaling, we present an extensive report on the performance of the various system components and related parametric studies.

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

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

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.

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

A positioning and locking device for fuel pin to grid attachment provides an inexpensive means of positively positioning and locking the individual fuel pins which make up the driver fuel assemblies used in nuclear reactors. The device can be adapted for use with a currently used attachment grid assembly design and insures that the pins remain in their proper position throughout the in-reactor life of the assembly. This device also simplifies fuel bundle assembly in that a complete row of fuel pins can be added to the bundle during each step of assembly.

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.

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.

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

Sample records for graphs attachment 3-sampling from the National Library of Energy Beta (NLEBeta)

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

The controlled-Z (cz) operations acting separately on pairs of qubits are commonly adopted in the schemes of generating graph states, the multipartite entangled states for the one-way quantum computing. For this purpose, we propose a setup of cascade cz operation on a whole group of qubits in sequence. The operation of the setup starts with entangling an ancilla photon with the first photon as qubit, and this ancilla automatically moves from one entanglement link to another in assisting the formation of a string in graph states. The generation of some special types of graph states, such as the three-dimensional ones, can be greatly simplified in this approach. The setup presented uses weak nonlinearities, but an implementation using probabilistic linear optics is also possible.

The controlled Z (CZ) operations acting separately on pairs of qubits are commonly adopted in the schemes of generating graph states, the multi-partite entangled states for the one-way quantum computing. For this purpose, we propose a setup of cascade CZ operation on a whole group of qubits in sequence. The operation of the setup starts with entangling an ancilla photon to the first photon as qubit, and this ancilla automatically moves from one entanglement link to another in assisting the formation of a string in graph states. The generation of some special types of graph states, such as the three-dimensional ones, can be greatly simplified in this approach. The setup presented uses weak nonlinearities, but an implementation using probabilistic linear optics is also possible.

We examine the approach of encoding planning problems as CSPs more closely. First we present a simple CSP encoding for planning problems and then a set of transformations that can be used to eliminate variables and add new constraints to the encoding. We show that our transformations uncover additional structure in the planning problem, structure that subsumes the structure uncovered by GRAPHPLAN planning graphs. We solve the CSP encoded planning problem by using standard CSP algorithms. Empirical evidence is presented to validate the effectiveness of this approach to solving planning problems, and to show that even a prototype implementation is more effective than standard GRAPHPLAN. Our prototype is even competitive with far more optimized planning graph based implementations. We also demonstrate that this approach can be more easily lifted to more complex types of planning than can planning graphs. In particular, we show that the approach can be easily extended to planning with resources.

Processing large graphs is becoming increasingly important for many domains such as social networks, bioinformatics, etc. Unfortunately, many algorithms and implementations do not scale with increasing graph sizes. As a result, researchers have attempted ...

Structure-Activity relationship analysis aims at discovering chemical activity of molecular compounds based on their structure. In this article we make use of a particular graph representation of molecules and propose a new graph embedding procedure ...

Finding the largest independent set in a graph is a notoriously difficult NP-complete combinatorial optimization problem. Moreover, even for graphs with largest degree 3, no polynomial time approximation algorithm exists ...

A taxonomy of model transformations was introduced in [16]. Among others, such a taxonomy can help developers in deciding which language, forma lism, tool or mechanism is best suited to carry out a particular model transformation activity. In this paper we apply the taxonomy to the technique of graph transformation, and we exemplify it by referring to four representative graph transformation tools. As a byproduct of our analysis, we discuss how well each of the considered tools carry out the activity of model transformation.

This paper gives a cohesive approach to modeling and implementation with graphs. This approach uses extended entity relationship (EER) diagrams supplemented with the Z-like constraint language GRAL. Due to the foundation of EER/GRAL on Z a common formal basis exists. EER/GRAL descriptions give conceptual models which can be implemented in a seamless manner by efficient data structures using the GraLab graph library. Descriptions of four medium size EER/GRAL-applications conclude the paper to demonstrate the usefulness of the approach in practice.

The maximal clique enumeration (MCE) problem can be used to find very tightly-coupled collections of objects inside a network or graph of relationships. However, when such networks are based on noisy or uncertain data, the solutions to the MCE problem ... Keywords: biological applications, graph algorithms, graph perturbation theory, maximal clique enumeration

Interaction graphs are ubiquitous in many fields such as bioinformatics, sociology and physical sciences. There have been many studies in the literature targeted at studying and mining these graphs. However, almost all of them have studied these graphs ... Keywords: Dynamic interaction networks, diffusion of innovations, evolutionary analysis

We present a shape prior based graph cut method which does not require user initialisation. The shape prior is generalised from multiple training shapes, rather than using singular templates as priors. Weighted directed graph construction is used to ... Keywords: IVUS, graph cut, image segmentation, shape prior

CLAW-FREE 3-CONNECTED P11-FREE GRAPHS ARE HAMILTONIAN TOMASZ LUCZAK AND FLORIAN PFENDER Abstract. We show that every 3-connected claw-free graph which contains no induced copy of P11 is hamiltonian. Since there ex- ist non-hamiltonian 3-connected claw-free graphs without induced copies of P12

In recent social network studies, exponential random graph models have been used comprehensively to model global social network structure as a function of their local features. In this study, we describe the exponential random graph models and demonstrate ... Keywords: email communications, exponential random graph models, organizational disintegration, p* models, social networks, statistical models for social networks

In the recently introduced model for cleaning a graph with brushes, we use a degree-greedy algorithm to clean a random d-regular graph on n vertices (with dn even). We then use a differential equations method to find the (asymptotic) ... Keywords: cleaning process, degree--greedy algorithm, differential equations method, random d-regular graphs

Sample records for graphs attachment 3-sampling from the National Library of Energy Beta (NLEBeta)

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

1 Designing for emotional attachment to energy James Pierce, Eric Paulos Human-Computer Interaction a perspective on energy-as-materiality and employing a designerly approach of materializing energy [1]. Building on a framework for approaching energy as materiality, we discuss several design explorations around emotional

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.

Drawing on attachment theory, the present study examines the attachment styles of individuals relative to two ways of building social capital - bonding social capital and bridging social capital. In trying to relate attachment theory to the use of SNS, ... Keywords: Attachment style, Attachment theory, Social capital, Social networking site (SNS)

The purpose of the present manuscript is to collect known results and present some new ones relating to nodal domains on graphs, with special emphasize on nodal counts. Several methods for counting nodal domains will be presented, and their relevance as a tool in spectral analysis will be discussed.

The purpose of the present manuscript is to collect known results and present some new ones relating to nodal domains on graphs, with special emphasize on nodal counts. Several methods for counting nodal domains will be presented, and their relevance as a tool in spectral analysis will be discussed.

This paper addresses transition detection which consists in identifying the boundary between consecutive shots. In this work, we propose an approach to cope with transition detection in which we define and use a new dissimilarity measure based on the ... Keywords: bipartite graph matching, cut, gradual transition

Multi-core machines are becoming widely used which, as a consequence, forces parallel computing to move from research labs to being adopted everywhere. Due to the fact that developing parallel code is a significantly complex process, the main focus of ... Keywords: graph algorithms, object oriented parallelisation, parallel computing, parallel iterator

Biological images have the potential to reveal complex signatures that may not be amenable to morphological modeling in terms of shape, location, texture, and color. An effective analytical method is to characterize the composition of a specimen based on user-defined patterns of texture and contrast formation. However, such a simple requirement demands an improved model for stability and robustness. Here, an interactive computational model is introduced for learning patterns of interest by example. The learned patterns bound an active contour model in which the traditional gradient descent optimization is replaced by the more efficient optimization of the graph cut methods. First, the energy function is defined according to the curve evolution. Next, a graph is constructed with weighted edges on the energy function and is optimized with the graph cut algorithm. As a result, the method combines the advantages of the level set method and graph cut algorithm, i.e.,"topological" invariance and computational efficiency. The technique is extended to the multi-phase segmentation problem; the method is validated on synthetic images and then applied to specimens imaged by transmission electron microscopy(TEM).

It is quite common for networks emerging nowadays to have labels or textual contents on the nodes. On such networks, we study the problem of top-k nearest keyword (k-NK) search. In a network G modeled as an undirected graph, each node is ...

Entity matching plays a crucial role in information integration among heterogeneous data sources, and numerous solutions have been developed. Entity resolution based on reference table has the benefits of high efficiency and being easy to update. In ... Keywords: Entity matching, Graph clustering, Reference table

With the continuously emerging of Internet applications based on secure group communication, the design of secure group communication becomes an important Internet design topic. Group key management is important for secure group communication. Previous ... Keywords: Batch rekey, Group security, Key graph, Rekey

A Compact Directed Acyclic Word Graph (CDAWG) is a space-efficient text indexing structure, that can be used in several different string algorithms, especially in the analysis of biological sequences. In this paper, we present a new on-line algorithm ...

The problem of monitoring an electric power system by placing as few measurement devices in the system as possible is closely related to the well known vertex covering and dominating set problems in graphs (see [T.W. Haynes, S.M. Hedetniemi, S.T. Hedetniemi, ... Keywords: Grid, Power domination

The problem of monitoring an electric power system by placing as few measurement devices in the system as possible is closely related to the well known vertex covering and dominating set problems in graphs (see [T.W. Haynes, S.M. Hedetniemi, S.T. Hedetniemi, ... Keywords: grid, power domination

We present a graph grammar based type inference system for a totally graphic development language. NiMo (Nets in Motion) can be seen as a graphic equivalent to Haskell that acts as an on-line tracer and debugger. Programs are process networks that evolve ... Keywords: graphical language, process networks, type inference, type visualization

Using machine learning has proven effective at choosing the right set of optimizations for a particular program. For machine learning techniques to be most effective, compiler writers have to develop expressive means of characterizing the program being ... Keywords: compiler optimization, graph-based program characterization, iterative compilation, machine learning, support vector machine

We report on our experiences in teaching graph theory and algorithms to school children, aged 5 to 17. Our objectives were to demonstrate that children can discover quite complex mathematical concepts, and are able to work with abstractions and use computation ... Keywords: abstraction, computational thinking, k-12 education, modelling, problem based learning

Sample records for graphs attachment 3-sampling from the National Library of Energy Beta (NLEBeta)

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

The analysis of brain connectivity is a vast field in neuroscience with a frequent use of visual representations and an increasing need for visual analysis tools. Based on an in-depth literature review and interviews with neuroscientists, we explore ... Keywords: brain connectivity analysis, brain connectivity visualization, graph comparison

The component supervision procedure consists of the comparison of the actual behaviour with the reference behaviour which describes the normal mode. The analytical redundancy has to find relations between known variables of the system. These relations ... Keywords: bond graphs, causal paths, modelling, sensors placement, supervision

We study geometric and combinatorial properties of the degenerate flag varieties of type A. These varieties are acted upon by the automorphism group of a certain representation of a type A quiver, containing a maximal torus T. Using the group ... Keywords: Flag varieties, Moment graphs, Quiver Grassmannians, Schröder numbers

We use a randomised embedding method to prove that for all \\alpha>0 any sufficiently large oriented graph G with minimum in-degree and out-degree \\delta^+(G),\\delta^-(G)\\geq (3/8+\\alpha)|G| contains every possible orientation of a Hamilton cycle. This confirms a conjecture of H\\"aggkvist and Thomason.

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

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

In this paper we consider Maker-Breaker games, played on the edges of sparse graphs. For a given graph property P we seek a graph (board of the game) with the smallest number of edges on which Maker can build a subgraph that satisfies P. In this paper we focus on global properties. We prove the following results: 1) for the positive minimum degree game, there is a winning board with n vertices and about 10n/7 edges, on the other hand, at least 11n/8 edges are required; 2) for the spanning k-connectivity game, there is a winning board with n vertices and (1+ok(1))kn edges; 3) for the Hamiltonicity game, there is a winning board of constant average degree; 4) for a tree T on n vertices of bounded maximum degree ?, there is a graph G on n vertices and at most f(?) · n edges, on which Maker can construct a copy of T. We also discuss biased versions on these games and argue that the picture changes quite drastically there. 1

We consider a "Maker-Breaker" version of the Ramsey Graph Game, RG(n), and present a winning strategy for Maker requiring at most (n 0 3)2 n01 + n + 1 moves. This is the fastest winning strategy known so far. We also demonstrate how the ideas presented can be used to develop winning strategies for some related combinatorial games. Keywords: Combinatorial Games, Algorithms on Graphs, Ramsey Theory 1 Introduction The Ramsey Graph Game, RG(n), on a complete graph on N vertices, KN , is considered. Two players, Maker (red) and Breaker (blue) alternately color the edges of KN . Maker is first to play, and the players color one edge per move. Maker wins the game if there is a red Kn . Breaker wins if there is no red Kn after all the N (N 0 1)=2 edges have been colored. Let R(n; n) denote the n-th Ramsey number, i.e., the smallest number R such that for every two-coloring of the edges of KR there exsist a monochromatic Kn ae KR . Maker has a simple winning strategy if N 2R(n; n). Note ...

Given an arbitrary semantic graph data set, perhaps one lacking in explicit ontological information, we wish to first identify its significant semantic structures, and then measure the extent of their significance. Casting a semantic graph dataset as an edge-labeled, directed graph, this task can be built on the ability to mine frequent {\\em labeled} subgraphs in edge-labeled, directed graphs. We begin by considering the fundamentals of the enumerative combinatorics of subgraph motif structures in edge-labeled directed graphs. We identify its frequent labeled, directed subgraph motif patterns, and measure the significance of the resulting motifs by the information gain relative to the expected value of the motif based on the empirical frequency distribution of the link types which compose them, assuming indpendence. We illustrate the method on a small test graph, and discuss results obtained for small linear motifs (link type bigrams and trigrams) in a larger graph structure.

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.

In a closed 2-cell embedding of a graph each face is homeomorphic to an open disk and is bounded by a cycle in the graph. The Orientable Strong Embedding Conjecture says that every 2-connected graph has a closed 2-cell embedding in some orientable surface. This implies both the Cycle Double Cover Conjecture and the Strong Embedding Conjecture. In this paper we prove that every 2-connected projective-planar cubic graph has a closed 2-cell embedding in some orientable surface. The three main ingredients of the proof are (1) a surgical method to convert nonorientable embeddings into orientable embeddings; (2) a reduction for 4-cycles for orientable closed 2-cell embeddings, or orientable cycle double covers, of cubic graphs; and (3) a structural result for projective-planar embeddings of cubic graphs. We deduce that every 2-edge-connected projective-planar graph (not necessarily cubic) has an orientable cycle double cover.

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

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

The Buried Waste Integrated Demonstration (BWID) supports the applied research, development, demonstration, and evaluation of a suite of advanced technologies that form a comprehensive remediation system for the effective and efficient remediation of buried waste. Their efforts are identified and coordinated in support of the U.S. Department of Energy (DOE), Environmental Restoration and Waste Management (ER&WM) Department`s needs and objectives. The present focus of BWID is to support retrieval and ex-situ treatment configuration options. Future activities will explore and support containment, and stabilization efforts in addition to the retrieval/ex situ treatment options. This report presents a literature search on the state-of-the-art in end effectors and attachments in support of excavator of buried transuranic waste. Included in the report are excavator platforms and a discussion of the various attachments. Also included is it list of vendors and specifications.

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

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

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

Sample records for graphs attachment 3-sampling from the National Library of Energy Beta (NLEBeta)

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

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.

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.

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

This report provides equations based on experimental and test data for determining B and C stress indices and the flexibility factor, k, for straight pipe with trunnions (or hollow circular cross-section welded attachments). The report contains explicit modifications to ASME Code Cases 391 and 392 for qualification of trunnions on pipe. It also provides flexibility equations for a more accurate evaluation of these configurations.

The dynamic properties and independence structure of stochastic kinetic models (SKMs) are analyzed. An SKM is a highly multivariate jump process used to model chemical reaction networks, particularly those in biochemical and cellular systems. We identify SKM subprocesses with the corresponding counting processes and propose a directed, cyclic graph (the kinetic independence graph or KIG) that encodes the local independence structure of their conditional intensities. Given a partition $[A,D,B]$ of the vertices, the graphical separation $A\\perp B|D$ in the undirected KIG has an intuitive chemical interpretation and implies that $A$ is locally independent of $B$ given $A\\cup D$. It is proved that this separation also results in global independence of the internal histories of $A$ and $B$ conditional on a history of the jumps in $D$ which, under conditions we derive, corresponds to the internal history of $D$. The results enable mathematical definition of a modularization of an SKM using its implied dynamics. Gra...

Although the deep affinity between Graphplan's backward search, and the process of solving constraint satisfaction problems has been noted earlier, these relations have hither-to been primarily used to adapt CSP search techniques into the backward search phase of Graphplan. This paper describes GP-CSP, a system that does planning by automatically converting Graphplan's planning graph into a CSP encoding, and solving the CSP encoding using standard CSP solvers. Our comprehensive empirical evaluation of GP-CSP demonstrates that it is quite competitive with both standard Graphplan and Blackbox system, which compiles planning graphs into SAT encodings. We discuss the many advantages offered by focusing on CSP encodings rather than SAT encodings, including the fact that by exploiting implicit constraint representations, GP-CSP tends to be less susceptible to memory blow-up associated with methods that compile planning problems into SAT encodings. Our work is inspired by t...

, 2008 Abstract Suppose G is a graph, r is a positive real number and S(r) is a circle of perimeter r. For a positive real number t r, a (t, r)- circular consecutive colour-list assignment L is a mapping that assigns to each vertex v of G an interval L(v) of S(r) of length t. A circular L-colouring of G

We consider the following maker-breaker game on a graph G that has a partition of the edge set E into two spanning trees E1 and E2. Initially the edges of E1 are purple and the edges of E2 blue. Maker and breaker move alternately. In a move of the maker a blue edge is coloured purple. The breaker then has to recolour a different edge blue in such a way that the purple and the blue edges are spanning trees again. The goal of the maker is to exchange all colours, i.e. to make E1 blue and E2 purple. We prove that a sufficient but not necessary condition for the breaker to win is that the graph contains an induced K4. Furthermore we characterize the structure of a partition of a wheel into two spanning trees and show that the maker wins on wheels Wn with n ? 4 and provide an example of a graph where, for some partitions, the maker wins, for some others, the breaker wins.

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

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

Electron attachment rate constants, as a function of pressure-reduced electric field, were measured in mixtures with nitrogen for CCl/sub 3/F, CCl/sub 2/F/sub 2/, and CClF/sub 3/ using the electron swarm method. From these data total electron attachment cross sections sigma/sub a/(epsilon) as a function of electron energy epsilon were determined for the chlorofluoromethanes using the electron-swarm unfolding technique and a new set of electron energy distribution functions for N/sub 2/. For CCl/sub 3/F and CCl/sub 2/F/sub 2/ three maxima in sigma/sub a/(epsilon) were found at thermal energy, 0.25 and 0.75 eV and at 0.07, 0.30, and 0.93 eV, respectively. Only one pronounced maximum in sigma/sub a/(epsilon) for CClF/sub 3/ was observed at 1.4 eV. The thermal values of the attachment rate constant for CCl/sub 3/F, CCl/sub 2/F/sub 2/, and CClF/sub 3/ are, respectively, 3.90 x 10/sup 8/, 4.00 x 10/sup 7/, and 6.05 x 10/sup 3/ sec/sup -1/ Torr/sup -1/. Additionally, comparisons are made between the sigma/sub a/(epsilon) calculated for these and other molecules using both the new electron energy distribution functions for N/sub 2/ and those determined earlier. Substituent effects on the number and position of negative ion states and on the magnitude of sigma/sub a/(epsilon) for the chlorofluoromethanes are discussed.

A set of vertices S in a graph G is independent if no neighbor of a vertex of S belongs to S. A set of vertices U in a graph G is irredundant if each vertex v of U has a private neighbor, which may be v itself, i.e., a neighbor of v which is not a neighbor ... Keywords: AGX, Extremal graph, Invariant, Upper irredundance

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

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.

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

We are investigating the use of the functional programming paradigm on multiprocessor computers. We have developed a parallel graph reduction run-time system called ParaGraph-RTS (Parallel Graph Reduction) that provides both significant amounts of exploitable parallelism and the robustness to support development of large scientific codes. This system allows us to empirically investigate the functional programming paradigm within computationally intensive application domains. In this paper, we describe an implementation of ParaGraph-RTS on a shared-memory multiprocessor. The implementation strategy reflects insights gained through performance characterizations of the reduction process. Preliminary performance results and analyses are presented. 8 refs., 4 figs.

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

Sample records for graphs attachment 3-sampling from the National Library of Energy Beta (NLEBeta)

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

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.

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.

The disk rim blade attachment area is one of the most highly stressed components of the steam turbine rotor. Reliable and accurate inspection of the disk rim blade attachment area is essential for the determination of rotor operability and remaining life. The purpose of the Electric Power Research Institute's (EPRI's) Phased Array Performance Demonstration for Axial Entry Blade Attachment Inspection Project is to determine the inspection performance levels of commercial entities offering these inspection...

The phenomenon of scale dependent spectral dimension has attracted special interest in the quantum gravity community over the last eight years. It was first observed in computer simulations of the causal dynamical triangulation (CDT) approach to quantum gravity and refers to the reduction of the spectral dimension from 4 at classical scales to 2 at short distances. Thereafter several authors confirmed a similar result from different approaches to quantum gravity. Despite the contribution from different approaches, no analytical model was proposed to explain the numerical results as the continuum limit of CDT. In this thesis we introduce graph ensembles as toy models of CDT and show that both the continuum limit and a scale dependent spectral dimension can be defined rigorously. First we focus on a simple graph ensemble, the random comb. It does not have any dynamics from the gravity point of view, but serves as an instructive toy model to introduce the characteristic scale of the graph, study the continuum limit and define the scale dependent spectral dimension. Having defined the continuum limit, we study the reduction of the spectral dimension on more realistic toy models, the multigraph ensembles, which serve as a radial approximation of CDT. We focus on the (recurrent) multigraph approximation of the two-dimensional CDT whose ensemble measure is analytically controlled. The latter comes from the critical Galton-Watson process conditioned on non-extinction. Next we turn our attention to transient multigraph ensembles, corresponding to higher-dimensional CDT. Firstly we study their fractal properties and secondly calculate the scale dependent spectral dimension and compare it to computer simulations. We comment further on the relation between Horava-Lifshitz gravity, asymptotic safety, multifractional spacetimes and CDT-like models.

In this paper, we use a new method to decrease the parameterized complexity bound for finding the minimum vertex cover of connected max-degree-3 undirected graphs. The key operation of this method is reduction of the size of a particular subset of edges which we introduce in this paper and is called as "real-cycle" subset. Using "real-cycle" reductions alone we compute a complexity bound $O(1.15855^k)$ where $k$ is size of the optimal vertex cover. Combined with other techniques, the complexity bound can be further improved to be $O(1.1504^k)$. This is currently the best complexity bound.

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

Energy of a graph is never an odd integer R. B. Bapat Indian Statistical Institute New Delhi, 781039 Abstract It is shown that if the energy of a graph is rational then it must be an even integer. We the diagonal. An interesting quantity in HÂ¨uckel theory is the sum of the energies of all the electrons

We present a new computer system, called GraPHedron, which uses a polyhedral approach to help the user to discover optimal conjectures in graph theory. We define what should be optimal conjectures and propose a formal framework allowing to identify them. ... Keywords: Computer-assisted system, Conjecture, GraPHedron, Graph

As the World Wide Web grows dramatically in recent years, there is increasing interest in semi-structured data on the web. Semi-structured data are usually represented in graph format, many graph schemas have then been proposed to extract schemas from ...

L(2, 1)-Labeling of Oriented Planar Graphs T. Calamoneria,1,, B. Sinaimeria,1, a Department, the maximum (D), over all D C is denoted (C). In this paper we study the L(2, 1)-labeling problem on oriented planar graphs providing some upper bounds on . Then we focus on some spe- cific subclasses of oriented

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

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

DYNAMIC FACTOR GRAPHS: A NOVEL FRAMEWORK FOR MULTIPLE FEATURES DATA FUSION Kittipat Kampa, Jose C and fusion are combined in the same framework. The new framework is built on 2 main ideas; 1) flexible segmentation and fusion with linear Gaussian model assumption. Index Terms-- dynamic factor graphs, sum

We address the problem of lowering the buyer's expected payments in shortest path auctions, where the buyer's goal is to purchase a path in a graph in which edges are owned by selfish agents. We show that by deleting some of the edges of the graph, one ... Keywords: auction, mechanism design, shortest paths

Cayley graphs on a subgroup ofGL(3,p),p>3 a prime, are defined and their properties, particularly their spectra, studied. It is shown that these graphs are connected, vertex-transitive, nonbipartite, and regular, and their degrees are computed. The eigenvalues ...

Nowadays social tagging has become a popular way to annotate, search, navigate and discover online resources, in turn leading to the sheer amount of user-generated metadata. This paper addresses the problem of recommending suitable tags during folksonomy ... Keywords: Folksonomy, Graph-based ranking, Link prediction, Social tagging, Tag recommendation, Tripartite graph

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.

This work discusses the use of parallel graph transformation systems for (multi-formalism) modeling and simulation and their implementation in the meta-modeling tool AToM^3. As an example, a simulator for Timed Transition Petri Nets (TTPN) is modeled ... Keywords: model simulation, parallel graph transformation, timed transition Petri nets

Sample records for graphs attachment 3-sampling from the National Library of Energy Beta (NLEBeta)

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

The Web Graph: an Overview Jean-Loup Guillaume and Matthieu Latapy LIAFA - UniversitÂ´e Paris 7, 2 Chesnay. Matthieu.Latapy@inria.fr We propose here an overview of the questions which arise about the Web discuss some general facts about the Web graph: its size, its evolution rate, and other problems which

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

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

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

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

An alternative definition of topological quantum field theory in 2+1 dimensions is discussed. The fundamental objects in this approach are not gauge fields as in the usual approach, but non-local observables associated with graphs. The classical theory of graphs is defined by postulating a simple diagrammatic rule for computing the Poisson bracket of any two graphs. The theory is quantized by exhibiting a quantum deformation of the classical Poisson bracket algebra, which is realized as a commutator algebra on a Hilbert space of states. The wavefunctions in this graph representation'' approach are functionals on an appropriate set of graphs. This is in contrast to the usual connection representation'' approach in which the theory is defined in terms of a gauge field and the wavefunctions are functionals on the space of flat spatial connections modulo gauge transformations.

AbstractWe design, implement, and evaluate algorithms for computing a matching of maximum cardinality in a bipartite graph on multi-core and massively multithreaded computers. As computers with larger number of slower cores dominate the commodity processor market, the design of multithreaded algorithms to solve large matching problems becomes a necessity. Recent work on serial algorithms based on searching for augmenting paths for this problem have shown that their performance is sensitive to the order in which the vertices are processed for matching. In a multithreaded environment, imposing a serial order in which vertices are considered for matching would lead to loss of concurrency and performance. But this raises the question: Would parallel matching algorithms on multithreaded machines improve performance over a serial algorithm? We answer this question in the affirmative. We report efficient multithreaded implementations of two key algorithms (Hopcroft- Karp based on breadth-first-search, and Pothen-Fan based on depth-first-search) and their variants, combined with the Karp- Sipser initialization algorithm. We report extensive results and insights using three shared-memory platforms (a 48-core AMD Opteron, a 32-core Intel Nehalem, and a 128-processor Cray XMT) on a representative set of real-world and synthetic graphs. To the best of our knowledge, this is the first extensive study of augmentation-based parallel algorithms for bipartite cardinality matching.

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.

The purpose of this article is to obtain conservation laws (invariants of motion) for different energy domains through the extended Noether theorem and bond graphs. Bond graphs are profitably used in representing the physics of a system as well as obtaining ... Keywords: Bond graphs, Noether's theorem, gauge-transformed umbra-Lagrangian, invariants of motion, umbra-Lagrangian

Attachment to Joint Declaration of the Ministerial Meeting for ITER Moscow, 28th June 2005 Joint will be decided jointly, based upon the wishes of the non-Host as long as this serves the goal of promoting 5 May 2005 #12;Attachment to Joint Declaration of the Ministerial Meeting for ITER Moscow, 28th June

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.

The monitoring and system analysis of high performance computing (HPC) clusters is of increasing importance to the HPC community. Analysis of HPC job data can be used to characterize system usage and diagnose and examine failure modes and their effects. This analysis is not straightforward, however, due to the complex relationships that exist between jobs. These relationships are based on a number of factors, including shared compute nodes between jobs, proximity of jobs in time, etc. Graph-based techniques represent an approach that is particularly well suited to this problem, and provide an effective technique for discovering important relationships in job queuing and execution data. The efficacy of these techniques is rooted in the use of a semantic graph as a knowledge representation tool. In a semantic graph job data, represented in a combination of numerical and textual forms, can be flexibly processed into edges, with corresponding weights, expressing relationships between jobs, nodes, users, and other relevant entities. This graph-based representation permits formal manipulation by a number of analysis algorithms. This report presents a methodology and software implementation that leverages semantic graph-based techniques for the system-level monitoring and analysis of HPC clusters based on job queuing and execution data. Ontology development and graph synthesis is discussed with respect to the domain of HPC job data. The framework developed automates the synthesis of graphs from a database of job information. It also provides a front end, enabling visualization of the synthesized graphs. Additionally, an analysis engine is incorporated that provides performance analysis, graph-based clustering, and failure prediction capabilities for HPC systems.

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.

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

Sample records for graphs attachment 3-sampling from the National Library of Energy Beta (NLEBeta)

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

Abstract. This paper first presents a unified approach to design efficient algorithms for the weighted domination problem and its three variants, i.e., the weighted independent, connected, and total domination problems, on interval graphs. Given an interval model with endpoints sorted, these algorithms run in time O(n) orO(n log log n) where n is the number of vertices. The results are then extended to solve the same problems on circular-arc graphs in O(n + m) time where m is the number of edges of the input graph.

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

Using the velocity map imaging technique, we studied and characterized the process of Dissociative Electron Attachment (DEA) in polyatomic molecules like Water, Hydrogen Sulphide, Ammonia, Methane, Formic Acid and Propyl Amine. We present the details of these studies in a series of 5 articles. In the first article here, we discuss the DEA process in gas phase water ($H_{2}O$ and $D_{2}O$) molecules. Electrons of 6.5 eV, 8.5 eV and 12 eV are captured by water molecules in neutral ground state to form $H_{2}O^{-*}$ ($D_{2}O^{-*}$) resonant states which dissociate into an anion fragment and one or more neutrals. Kinetic energy and angular distributions of the fragment anions $H^{-}$($D^{-}$) and $O^{-}$ produced from the three negative ion resonant states in the entire $2\\pi$ scattering range are obtained. Unique angular distribution patterns are observed at the 8.5 eV and 11.8 eV resonances showing dissociation dynamics beyond the axial recoil approximation.

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

This paper presents a prototype, not completely operational, that is intended to use c-graphs in the translation of assemblers. Firstly, the formalization of the structure and its principal notions (substructures, classes of substructures, order, etc.) ...

This paper leverages the unique opportunity of Google launching the Google+ OSN. Through multiple crawls of the Google+ OSN, before and after the official public release of the network, our results provide insights into the social graph dynamics of the birth of an OSN. Our findings underline the impact of peculiar aspects of Google+ such as (a) Googles large initial user base taken over from other Google products and (b) Google+s provision for asymmetric friendships, on its graph structure, especially in light of previously studied OSN graphs. In addition, we study the geographic distribution of the users and links of Google+, and correlate the social graph with additional information available from the public profiles.

This thesis presents a methodology and framework for designing systems that apply real-time simulation of computational models throughout the modeling and parameter modification stages of problem solving for graph based ...

We present a new approach to the automatic generation of adjoint codes using automatic differentiation by source transformation. Our method relies on static checkpointing techniques applied to an extended version of the program's call graph. A code ...

Reeb graphs are a fundamental data structure for understanding and representing the topology of shapes. They are used in computer graphics, solid modeling, and visualization for applications ranging from the computation of similarities and finding defects ...

This paper introduces a graph grammar based approach to automated topology synthesis of analog circuits. A grammar is developed to generate circuits through production rules, that are encoded in the form of a derivation tree. The synthesis has been sped ...

We show that, in a claw-free graph, Hamilton-connectedness is preserved under the operation of local completion performed at a vertex with 2-connected neighborhood. This result proves a conjecture by Bollobás et al. 1 Notation and terminology In this paper, by a graph we mean a finite simple undirected graph G = (V (G), E(G)). For a vertex x ? V (G), NG(x) denotes the neighborhood of x in G, i.e. NG(x) = {y ? V (G) | xy ? E(G)}, and NG[x] denotes the closed neighborhood of x in G, i.e. NG[x] = NG(x) ? {x}. If G, H are graphs, then H ? G means that H is a subgraph of G. The induced subgraph of G on a set M ? V (G) is denoted ?M?G. By a clique we mean a (not necessarily maximal) complete subgraph of G. A vertex x ? V (G) for which ?NG(x)?G is a connected graph (k-connected graph, clique) is said to be locally connected (locally k-connected, simplicial), respectively. A path with endvertices a, b will be referred to as an (a, b)-path. If P is an (a, b)-path and u ? V (P), then u ?(P) and u +(P) denotes the predecessor and successor of u on P (always considered in the orientation from a to b). If no confusion can arise we simply write u ? and u +. If P is a path

Most of the domestic turbine fleet has reached the 50,000-hour range of service operation. Unfortunately, above this level of operational hours, a number of turbines have begun to experience low-pressure (LP) rim-attachment cracking. A computer code developed by EPRI, LPRimLife, provides utilities with a methodology for assessing the remaining life of LP rim attachments with known or suspected cracking.

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

We study the problem of constructing universal Steiner trees for undirected graphs. Given a graph $G$ and a root node $r$, we seek a single spanning tree $T$ of minimum stretch, where the stretch of $T$ is defined to be the maximum ratio, over all subsets of terminals $X$, of the ratio of the cost of the sub-tree $T_X$ that connects $r$ to $X$ to the cost of an optimal Steiner tree connecting $X$ to $r$. Universal Steiner trees (USTs) are important for data aggregation problems where computing the Steiner tree from scratch for every input instance of terminals is costly, as for example in low energy sensor network applications. We provide a polynomial time UST construction for general graphs with $2^{O(\\sqrt{\\log n})}$-stretch. We also give a polynomial time polylogarithmic-stretch construction for minor-free graphs. One basic building block in our algorithm is a hierarchy of graph partitions, each of which guarantees small strong cluster diameter and bounded local neighbourhood intersections. Our partition h...

This case study highlights the technical challenges of creating an application that uses a multithreaded scene graph toolkit for rendering and uses a software environment for management of tiled display systems. Scene graph toolkits simplify and streamline graphics applications by providing data management and rendering services. Software for tiled display environments typically performs device and event management by opening windows on displays, by gathering and processing input device events, and by orchestrating the execution of application rendering code. These environments serve double-duty as frameworks for creating parallel rendering applications. We explore technical issues related to interfacing scene graph systems with software that manages tiled projection systems in the context of an implementation, and formulate suggestions for the future growth of such systems.

As semantic datasets grow to be very large and divergent, there is a need to identify and exploit their inherent semantic structure for discovery and optimization. Towards that end, we present here a novel methodology to identify the semantic structures inherent in an arbitrary semantic graph dataset. We first present the concept of an extant ontology as a statistical description of the semantic relations present amongst the typed entities modeled in the graph. This serves as a model of the underlying semantic structure to aid in discovery and visualization. We then describe a method of ontological scaling in which the ontology is employed as a hierarchical scaling filter to infer different resolution levels at which the graph structures are to be viewed or analyzed. We illustrate these methods on three large and publicly available semantic datasets containing more than one billion edges each. Keywords-Semantic Web; Visualization; Ontology; Multi-resolution Data Mining;

The complete test results for a flat plate with two closely spaced nozzles attached are presented. Test loadings were 1:1, 1:2, and 2:1 biaxial planar tension loadings on the plate, axial thrust loadings applied separately to the nozzles, and bending moment loadings applied to the nozzles both within and normal to the plane of symmetry containing the nozzle axes. The test plate was 36 x 36 x 0.375 in., and the attached nozzles had outer diameters of 2.625 in. and wall thicknesses of 0.250 in. The nozzles were located in the center of the plate with their centers 3.0 in. apart and were considered to be free of weld distortions and irregularities in the junction region. 6 references. (auth)

Sample records for graphs attachment 3-sampling from the National Library of Energy Beta (NLEBeta)

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

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

We present a deterministic O(n log log n) time algorithm for finding shortest cycles and minimum cuts in planar graphs. The algorithm improves the previously known fastest algorithm by Italiano et al. in STOC'11 by a factor of log n. This speedup is obtained through the use of dense distance graphs combined with a divide-and-conquer approach.

Given an unreliable communication network, we aim to find a most reliable source (MRS) on the network, which maximizes the expected number of nodes that are reachable from it. Although the problem of finding an MRS on general graphs is #P-hard, it is ... Keywords: complementary dynamic programming, general ring-tree graph, most reliable source, parallel algorithm

This paper presents an efficient and effective decision support system (DSS) for operational monitoring and control of water distribution systems based on a three layer General Fuzzy Min-Max Neural Network (GFMMNN) and graph theory. The operational monitoring ... Keywords: Decision support system, Graph theory, Loop corrective flows equations, Modeling and simulation, Neural network, Operational control of water distribution systems

Recent basic studies on electron attachment to laser-excited molecules show that electron attachment to electronically-excited states can have orders of magnitude larger cross sections compared to the respective ground electronic states. Even though systematic studies have not been conducted, there are indications that electronically-excited states may play a significant role in negative ion formation in gas discharges. The high-lying Rydberg states could be of particular significance since, (i) their production efficiencies are high, and (ii) they have comparatively long lifetimes. Such states could be populated in discharge sources via direct electron impact or via excitation transfer from metastable states of inert gases.

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

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

Protein immobilization on surfaces is of great importance in numerous applications in biology and biophysics. The key for the success of all these applications relies on the immobilization technique employed to attach the protein to the corresponding surface. Protein immobilization can be based on covalent or noncovalent interaction of the molecule with the surface. Noncovalent interactions include hydrophobic interactions, hydrogen bonding, van der Waals forces, electrostatic forces, or physical adsorption. However, since these interactions are weak, the molecules can get denatured or dislodged, thus causing loss of signal. They also result in random attachment of the protein to the surface. Site-specific covalent attachment of proteins onto surfaces, on the other hand, leads to molecules being arranged in a definite, orderly fashion and uses spacers and linkers to help minimize steric hindrances between the protein surface. This work reviews in detail some of the methods most commonly used as well as the latest developments for the site-specific covalent attachment of protein to solid surfaces.

Momentum imaging experiments on dissociative electron attachment (DEA) to CO{sub 2} are combined with the results of ab initio calculations to provide a detailed and consistent picture of the dissociation dynamics through the 8.2 eV resonance, which is the major channel for DEA in CO{sub 2}. The present study resolves several puzzling misconceptions about this system.

Designing for Emotional Attachment to Energy Approaching energy as materiality Design exploration: Energy Mementos We have been developing a perspective on energy-as-materiality and employing a designerly approach of materializing energy exploration in order to understand what energy is and how we are and could

The sum of chemical and mechanical bonding limits the adhesive strength of die-attach and substrate-attach layers. This is also true for sintered silver joints whose development and employment are underway in the electronic packaging community. Chemical bonding is dictated by numerous parameters associated with the compatibility of the metallurgical bond of the two mating surfaces and the processing history that brings them together. However, the efficacy of mechanical bonding is likely affected by the topographies (e.g., roughness) of the two adjoined surfaces and also perhaps the shape of the attachment layer itself (e.g., circles, squares, and sizes thereof). In this study the mechanical bonding component is examined through the modification of the copper cladding surface on direct bonded copper (DBC) substrates, the shape of the silver pad attachment bonded to it, and the use of a joined 'DBC sandwich' that facilitates their study. It was found that simple employment of both surface topography control and printed pad geometry can affect and improve shear strength of silver sintered joints, and that there is logic to perhaps hybridize their effects. This is an important observation as more future attention is devoted to joining constituents with larger areas (> 100 mm2) in electronic packages.

PON-12-502 ATTACHMENT 12 California-Based Entity (CBE) and/or Government Entity in California Requirement Pursuant to AB 2267 (Fuentes, 2008), the California Energy Commission's Public Interest Energy Research Program must give a priority to "California-based entities" (CBEs) when making awards. An entity

Momentum imaging measurements from two experiments are presented and interpreted with the aid of new ab initio theoretical calculations to describe the dissociative electron attachment (DEA) dynamics. We address the problem of how the 4 eV ^2\\Pi_u shape resonance in CO_2 proceeds to dissociate to CO(^1\\Sigma^+) + O^-(^2P) by DEA.

In this paper a novel method is presented to investigate lightning stroke attachment to earthed overhead transmission line structures. This method is based on the dynamic simulation of lightning downward leader movement toward the ground in three dimensions. ... Keywords: charge simulation method, downward leader, lightning, transmission line, upward leader

Sample records for graphs attachment 3-sampling from the National Library of Energy Beta (NLEBeta)

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

Capitalization and sharing of lessons learned play an essential role in managing the activities of industrial systems. This is particularly the case for the maintenance management, especially for distributed systems often associated with collaborative ... Keywords: Case-based reasoning, Conceptual graph rule, Experience feedback, Expert knowledge, Fleet considerations, Maintenance management

The ability to predict drug activity from molecular structure is an important field of research both in academia and in the pharmaceutical industry. Raw 3D structure data is not in a form suitable for identifying properties using machine learning so ... Keywords: QSAR, drug discovery, machine learning, molecular graphs, simple paths

We obtain in a closed form the 1/N^2 contribution to the free energy of the two Hermitian N\\times N random matrix model with non symmetric quartic potential. From this result, we calculate numerically the Yang-Lee zeros of the 2D Ising model on dynamical random graphs with the topology of a torus up to n=16 vertices. They are found to be located on the unit circle on the complex fugacity plane. In order to include contributions of even higher topologies we calculated analytically the nonperturbative (sum over all genus) partition function of the model Z_n = \\sum_{h=0}^{\\infty} \\frac{Z_n^{(h)}}{N^{2h}} for the special cases of N=1,2 and graphs with n\\le 20 vertices. Once again the Yang-Lee zeros are shown numerically to lie on the unit circle on the complex fugacity plane. Our results thus generalize previous numerical results on random graphs by going beyond the planar approximation and strongly indicate that there might be a generalization of the Lee-Yang circle theorem for dynamical random graphs.

We obtain in a closed form the 1/N^2 contribution to the free energy of the two Hermitian N\\times N random matrix model with non symmetric quartic potential. From this result, we calculate numerically the Yang-Lee zeros of the 2D Ising model on dynamical random graphs with the topology of a torus up to n=16 vertices. They are found to be located on the unit circle on the complex fugacity plane. In order to include contributions of even higher topologies we calculated analytically the nonperturbative (sum over all genus) partition function of the model Z_n = \\sum_{h=0}^{\\infty} \\frac{Z_n^{(h)}}{N^{2h}} for the special cases of N=1,2 and graphs with n\\le 20 vertices. Once again the Yang-Lee zeros are shown numerically to lie on the unit circle on the complex fugacity plane. Our results thus generalize previous numerical results on random graphs by going beyond the planar approximation and strongly indicate that there might be a generalization of the Lee-Yang circle theorem for dynamical random graphs.

Finding a maximum acyclic subgraph is on the list of problems that seem to be hard to tackle from a parameterized perspective. We develop two quite efficient algorithms (one is exact, the other parameterized) for (1, n)-graphs, a class containing ...

We show that for a connected graph with n nodes and e edges and maximum degree at most 3, the size of the dominating set found by the greedy algorithm is at most 10n - 2e/13 if e ? 11/10n, 11n - ... Keywords: algorithms, dominating set, maximum size

In this paper, I give a short proof of a recent result by Sokal, showing that all zeros of the chromatic polynomial $P_G(q)$ of a finite graph $G$ of maximal degree $D$ lie in the disk $|q|< K D$, where $K$ is a constant that is strictly smaller than ...

Graph-based dependency parsers suffer from the sheer number of higher order edges they need to (a) score and (b) consider during optimization. Here we show that when working with LP relaxations, large fractions of these edges can be pruned before they ...

The evolution of organization, management, and production processes is moving towards more complexity every day. An improvement of the performance by the recovery and reuse of resources can be reached by going beyond traditional boundaries and by enforcing ... Keywords: Conflict Resolution, Fuzzy Linguistic Aggregation, Graph Theory, Knowledge Management, Process Innovation

It has recently been shown that the n-dimensional reduced adder graph (RAG-n) technique is beneficial for many DSP applications such as for FIR and IIR filters, where multipliers can be grouped in multiplier blocks. This paper highlights ...

The massive growth of the micro-blogging service Twitter has shed the light on the challenging problem of summarizing a collection of large number of tweets. This paper attempts to extract topical key phrases that would represent topics in tweets. Due ... Keywords: Keyphrase Extraction, Graph-based Ranking, Hashtag, Twitter, PageRank, TextRank, NE-Rank

Tracing the Birth of an OSN: Social Graph and Profile Analysis in Google+ Doris SchiÂ¨oberg Fabian of Google launch- ing the Google+ OSN. Through multiple crawls of the Google+ OSN, before and after of the birth of an OSN. Our findings underline the impact of peculiar aspects of Google+ such as (a) Google

Sample records for graphs attachment 3-sampling from the National Library of Energy Beta (NLEBeta)

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

In this paper we study graph--based ranking measures for the purpose of using them to rank email correspondents according to their degree of expertise on subjects of interest. While this complete expertise analysis consists of several steps, in this ... Keywords: digraph node ranking, expert finding, ordered list distance, social network analysis

The stability and evolution of the structure of consecutive versions of a series of software architecture graphs are analysed using the theory of complex networks. Brief comparisons are drawn between the scale-free behaviour and second order phase transitions. ... Keywords: Complexity, Directed network, Lehman's laws, Power law, Scale-free, Software measurement, Software metric

In this article, conservation laws (invariants of motion) have been derived from symmetry operations for different energy domains. The formulation has been derived through an extended Noetherâ??s theorem and the bond graphs. An additional time-like ... Keywords: Noether's theorem, gauge transformation, radiation thermal system, time variant stiffness, umbra-Lagrangian

, planar, black and white graph, because b 1 b 3 can be added in F and the addition can not activate any be added to the face without destroying planarity. Since we assume the white node is already of degree linear in k. In this paper, using the search tree approach, we show that the dominating set problem

As computers have become ever more interconnected, the complexity of security configuration has exploded. Management tools have not kept pace, and we show that this has made identity snowball attacks into a critical danger. Identity snowball attacks ... Keywords: access control, attack graph, authentication, combinatorial optimization, identity snowball, machine learning, sparsest cut, support vector machine

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

Planning through local search and action graphs is a powerful approach to fully-automated planning which is implemented in the well-known LPG planner. The approach is based on a stochastic local search procedure exploring a space of partial plans and ... Keywords: Automated planning, domain-independent planning, efficient planning, experimental evaluation of planning techniques

We consider the Schroedinger operator on a star shaped graph with n edges joined at a single vertex. We derive an expression for the trace of the difference of the perturbed and unperturbed resolvent in terms of a Wronskian. This leads to representations for the perturbation determinant and the spectral shift function, and to an analog of Levinson's formula.

In this article, we address the problem of reference disambiguation. Specifically, we consider a situation where entities in the database are referred to using descriptions (e.g., a set of instantiated attributes). The objective of reference disambiguation ... Keywords: Connection strength, RelDC, data cleaning, entity resolution, graph analysis, reference disambiguation, relationship analysis

., San Francisco, 1979. [8] G. Kant. Drawing planar graphs using the lmcÂ­ordering. In Proc. 33rd Symp by inspection of the pointer manipulations. Since the xÂ­coordinate of a vertex v equals to the sum

A: AIP Program Principles (Questions and Answers 1-12) A: AIP Program Principles (Questions and Answers 1-12) Attachment A: AIP Program Principles (Questions and Answers 1-12) AIP Program Principles 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 these requirements. Headquarters approval is required if mandatory language is not included in a new or renegotiated AIP. Question #1: Can States use AIP funds to support State regulatory activities? Answer: No, States cannot use AIP funds to support their regulatory activities. The Office of Management and Budget and the Department's congressional oversight committees have consistently indicated that the Environmental Protection Agency (EPA) and the states are required to use their current

An attachment for placement between a test specimen and a remote clip gage extensometer providing improved fracture toughness tests of materials at elevated temperature is described. Using a cylindrical tube and axial rod in new relationship, the device transfers the displacement signal of the fracture toughness test specimen directly to a clip gage extensometer located outside the high temperature furnace. Virtually frictionless operation is assured by having the test specimen center one end of the rod in one end of the tube, while the clip gage extensometer arms center the other end of the rod in the other end of the tube. By providing positive control over both ends of both rod and tube, the attachment may be operated in orientations other than vertical. 1 figure.

Research has been conducted on the attached-greenhouse type of passive solar heating system in the north-central region. The thermal performance of attached-greenhouse buildings was analyzed in order to determine the component sizes and configurations which optimize performance. The analytical method is dynamic computer simulation using a thermal network model and actual hourly meteorological and solar radiation data from the north-central region. The project has consisted of a large number of computer simulation runs and resulting performance estimates for certain designs. Conclusions on design guidelines emerge from the results. The overall result of the project is the development of specific design guidelines useful to architects and builders.

Research is being conducted on the attached-greenhouse type of passive solar heating system in the north-central region. The thermal performance of attached-greenhouse buildings is being analyzed in order to determine the component sizes and configurations which optimize performance. The analytical method is dynamic computer simulation using a thermal network model and actual hourly meteorological and solar radiation data from the north-central region. Progress has consisted of a large number of computer simulation runs resulting in performance estimates for certain designs. Preliminary conclusions on design guidelines are suggested by the results. The overall aim of the project is the development of specific design guidelines useful to architects and builders.

Attachment 1 Attachment 1 Project Area XX Program/Project Title For Office of Electricity Delivery and Energy Reliability Research and Development Division In Response To RC-CEDS-2012-02 Program Manager: XXXX Technical POC: XXXX 1. PROJECT SUMMARY [The project summary/abstract must contain a summary of the proposed activity suitable for dissemination to the public. It should be a self-contained document that identifies the lead National Laboratory and other team members, the project director/principal investigator(s), the project title, the objectives of the project, a description of the project, outcomes) This document must not include any proprietary or sensitive business information as DOE may make it available to the public.] 2. PROPOSAL TECHNICAL CONTENT

Sample records for graphs attachment 3-sampling from the National Library of Energy Beta (NLEBeta)

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

I: Approval of Agreement-in-Principal with the State of I: Approval of Agreement-in-Principal with the State of Alaska Attachment I: Approval of Agreement-in-Principal with the State of Alaska US Department of Energy Memorandum DATE: January 31, 1995 REPLY TO ATTN OF: EM-22 (C. Smoot, 202/586-2352) SUBJECT: Approval of Agreement-in-Principle with the State of Alaska TO: Manager, Nevada Operations Office Thank you for providing the draft Agreement-in-Principle with the State of Alaska for review and approval. I approve the execution of the Agreement-in-Principle and related grant, contingent on modification of the agreement to reflect the attached comments. Of special note, the agreement should be modified to include (1) language that requires state quarterly performance reporting as part of the grant requirements and (2) language

ATTACHMENTATTACHMENT FLOODPLAIN STATEMENT OF FINDINGS FOR DEPARTMENT OF ENERGY LOAN GUARANTEE TO SEMPRA GENERATION FOR THE MESQUITE SOLAR ENERGY FACILITY NEAR GILLESPIE, ARIZONA The U.S. Department of Energy (DOE) has conducted an environmental assessment (EA) that analyzed the reasonably foreseeable environmental impacts associated with the nominal 400 megawatt (MW) photovoltaic solar power project and associated interconnection transmission line proposed by Sempra Generation (Sempra) for the Mesquite Solar Energy Facility (Mesquite) in Maricopa County, Arizona. The proposed project would utilize a photovoltaic (PV) solar panel technology that converts sunlight into direct current (DC) electricity. Inverters convert the DC power to alternating current (AC) power, and the AC power then flows to transformers

In vitro biocompatibility tests have been carried out with model cell lines to demonstrate that near surface implantation of silver in Glassy Polymeric Carbon (GPC) can completely inhibit cell attachment on implanted areas while leaving adjacent areas unaffected. Patterned ion implantation permits precise control of tissue growth on medical applications of GPC. We have shown that silver ion implantation or argon ion assisted surface deposition of silver inhibits cell growth on GPC, a desirable improvement of current cardiac implants.

Abstract. In this paper we present a model for the study of the total balancedness of packing and covering games, concerning some aspects of graph theory. We give an alternative proof of van Velzens characterization of totally balanced covering games. We introduce new types of graph perfection, which allows us to give another approach to the open problem of characterizing totally balanced packing games. 1.

Implanted biomedical prosthetic devices are intended to perform safely, reliably and effectively in the human body thus the materials used for orthopedic devices should have good biocompatibility. Ultra High Molecular Weight Poly Ethylene (UHMWPE) has been commonly used for total hip joint replacement because of its very good properties. In this work, UHMWPE samples were Ag and Ag+N ion implanted by using the Metal-Vapor Vacuum Arc (MEVVA) ion implantation technique. Samples were implanted with a fluency of 1017 ion/cm2 and extraction voltage of 30 kV. Rutherford Backscattering Spectrometry (RBS) was used for surface studies. RBS showed the presence of Ag and N on the surface. Cell attachment properties investigated with model cell lines (L929 mouse fibroblasts) to demonstrate that the effect of Ag and Ag+N ion implantation can favorably influence the surface of UHMWPE for biomedical applications. Scanning electron microscopy (SEM) was used to demonstrate the cell attachment on the surface. Study has shown that Ag+N ion implantation represents more effective cell attachment properties on the UHMWPE surfaces.

4: Vulnerability in the PDF distiller of the BlackBerry 4: Vulnerability in the PDF distiller of the BlackBerry Attachment Service for the BlackBerry Enterprise Server T-534: Vulnerability in the PDF distiller of the BlackBerry Attachment Service for the BlackBerry Enterprise Server January 13, 2011 - 2:30pm Addthis PROBLEM: Vulnerability in the PDF distiller of the BlackBerry Attachment Service for the BlackBerry Enterprise Server. PLATFORM: * BlackBerry Enterprise Server Express version 5.0.1 and 5.0.2 for Microsoft Exchange * BlackBerry Enterprise Server Express version 5.0.2 for IBM Lotus Domino * BlackBerry Enterprise Server versions 4.1.3 through 5.0.2 for Microsoft Exchange and IBM Lotus Domino * BlackBerry Enterprise Server versions 4.1.3 through 5.0.1 for Novell GroupWise * BlackBerry Professional Software version 4.1.4 for Microsoft Exchange and

Although the deep affinity between Graphplan's backward search, and the process of solving constraint satisfaction problems has been noted earlier, these relations have hither-to been primarily used to adapt CSP search techniques into the backward search phase of Graphplan. This paper describes GP-CSP, a system that does planning by automatically converting Graphplan's planning graph into a CSP encoding, and solving the CSP encoding using standard CSP solvers. Our comprehensive empirical evaluation of GP-CSP demonstrates that it is superior to both standard Graphplan and Blackbox system, which compiles planning graphs into SAT encodings. Our results show that CSP encodings outperform SAT encodings in terms of both space and time requirements. The space reduction is particularly important as it makes GP-CSP less susceptible to the memory blow-up associated with SAT compilation methods. Our work is inspired by the success of van Beek & Chen's CPLAN system. However, in contrast...

Two sharp lower bounds for the length of a longest cycle $C$ of a graph $G$ are presented in terms of the lengths of a longest path and a longest cycle of $G-C$, denoted by $\\overline{p}$ and $\\overline{c}$, respectively, combined with minimum degree $\\delta$: (1) $|C|\\geq(\\overline{p}+2)(\\delta-\\overline{p})$ and (2) $|C|\\geq(\\overline{c}+1)(\\delta-\\overline{c}+1)$.

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

Measurement-based quantum computation (MBQC) and adiabatic quantum computation (AQC) are two very different computational methods. While in MBQC computation is driven by adaptive measurements on a large entangled state, in AQC it is the adiabatic transition to a ground state holding the solution to the problem which results in computation. In this paper we combine MBQC on graph states with AQC and investigate how properties, such as computational depth, energy gap and Hamiltonian degree, translate into each other. Following an approach proposed by Bacon and Flammia, we show that any measurement-based quantum computation on a graph state with gflow can be converted into an adiabatic computation, which we call adiabatic graph-state quantum computation (AGQC). We then identify how a trade-off can be made between computational depth and Hamiltonian degree, and clarify the effects of out-of-order measurements in the adiabatic computation. In the extreme case, we present a translation to AGQC where all computations can be carried out in constant time, at the expense of having high degree starting Hamiltonian. This leads to a natural conjecture for a lower bound on the cost of simulating large degree operators using smaller degree operators.

The technique of model compound immobilization by covalent surface attachment is being employed to investigate the potential impact of restricted diffusional mobility on the thermal reactivity of coal. This restricted mobility may be imposed in coal as a consequence of its cross-linked, macromolecular structure. Thermolysis studies at 345--400{degree}C of model coal structures covalently attached to a silica surface have shown that significant perturbations in free-radical reaction mechanisms can occur, and result in altered reaction rates and product distributions compared with corresponding fluid phase behavior. In the current study, we are beginning to probe the influence of the structure of co-attached aromatic molecules such as biphenyl and diphenylmethane on the reaction rate and regioselectivity in the thermolysis of surface-attached 1,3-diphenylpropane. 6 refs., 1 tab.

ENHANCING THE ENVIRONMENTAL PERFORMANCE OF COAL- ENHANCING THE ENVIRONMENTAL PERFORMANCE OF COAL- FIRED POWER PLANTS - DOE'S INNOVATIONS FOR EXISTING PLANTS PROGRAM Thomas J. Feeley, III Technology Manager Innovations for Existing Plants Program National Energy Technology Laboratory Office of Fossil Energy U.S. Department of Energy ABSTRACT The U. S. Department of Energy (DOE) has established a set of national priorities that includes the goal to promote secure, competitive, and environmentally responsible energy systems that serve the needs of the public. The Innovations for Existing Plants (IEP) program, managed by the Office of Fossil Energy's National Energy Technology Laboratory (NETL), provides technological solutions to the myriad of environmental issues (air, solid, and water) affecting the existing fleet of coal-based