text:
Office of Scientific and Technical Information
Hydrogeologic settings of A/M Area: Framework for groundwater transport: Book 6, Appendix B, Time/concentration graphs A/M Area monitoring wells
Science Conference Proceedings (OSTI)
This document presents the time/concentration graphs for the Savannah River A/M monitoring wells. This Appendix B is part of the determination of the hydrogeologic setting of the A/M Area as a part of ground water transport studies.
Van Pelt, R.; Lewis, S.E.; Aadand, R.K.
... C++). More information. Journal of Combinatorics dynamic surveys DS8 and DS9 are a bibliography and glossary of graphs. ...
graph drawing
... Layout Program (C). Graphviz: Graph Visualization Software (C), consisting of many graph drawing programs, viewers (C, Java, and TCL/TK), etc. ...
Motion graphs
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
Lucas Kovar; Michael Gleicher; Fr�d�ric Pighin
Appendix D Surface Water and Ground Water Time-Concentration Plots,
Office of Legacy Management (LM)
Surface Water and Ground Water Time-Concentration Plots, Surface Water and Ground Water Time-Concentration Plots, Stream Discharge Measurements, Ground Water Level Data, and Ground Water Well Hydrographs This page intentionally left blank Contents Section .................................................................................. Surface Water Time-Concentration Plots D1.O ............................................................................................... Stream Discharge Measurements D2.0 ............................................................. Ground Water Time-Concentration Plots for Uranium D3.0 .......................................................................................................... Ground Water Level Data D4.0 ..............................................................................................
PDSF Utilization Graphs
NLE Websites -- All DOE Office Websites (Extended Search)
Graphs Graphs Utilization Graphs This page contains a series of graphs that use data from the PDSF batch scheduler (SGE) to show the utilization of the cluster over the past 24 hours. The graphs were generated with RRDTool and are updated approximately every 15 minutes. This graph shows the aggregate cluster CPU availablity and usage according to sgeload: 24 hour rolling usage graph (click to see long term averages) This graph shows the number of jobs being run by each group: Rolling 24 Running Jobs by Group (click to see long term averages) This is the same graph as above weighted by the clockspeed (GHz) of the node used for the job: Rolling 24 Running Jobs by Group (click to see long term averages) This graph show the number of pending jobs by group: Rolling 24 Pending Jobs
Graph sketcher: extending illustration to quantitative graphs
Scientists, engineers, and educators commonly need to make graphs that quickly illustrate quantitative ideas yet are not based on specific data sets. We call these graphs quantitative concept diagrams (QCDs). Existing charting and illustration programs ... Keywords: charting, constraint-based layout, illustration, information visualization, planar map coloring, quantitative concept diagrams, snap-dragging
Robin Stewart; m.c. schraefel
Learning Graph Matching
E-Print Network (OSTI)
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...
Caetano, Tiberio S; Cheng, Li; Le, Quoc V; Smola, Alex J
Claw-free graphs and line graphs.
??The research of my dissertation is motivated by the conjecture ofThomassen that every 4-connected line graph is hamiltonian and by the conjecture ofTutte that every� (more)
Shao, Yehong, 1976-
Almost self-centered graphs
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.
Sandi Klavzar; et al.
directed acyclic word graph
... and R. Verin, Direct Construction of Compact Directed Acyclic Word Graphs, 8th Annual Symposium, CPM 97, Aarhus, Denmark, 116-129, 1997. ...
Undirected Graphs maze exploration
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
Sedgewick, Robert
Detachments of Complete Graphs
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 ...
Keith Edwards
Slicibility of rectangular graphs and floorplan optimization
Keywords: floorplanning, graph dualization, heuristic search, nonslicible floorplans, planar graphs, slicible floorplans, very large scale integration
Partha S. Dasgupta; Susmita Sur-Kolay
A Semantic Graph Query Language
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.
Kaplan, I L
Crawling Online Social Graphs
Unbiased sampling of facebook,� 2009. [9] A. Korolova, R.these users. For example, Facebook was ranked as the 4thsample (1M node) of the Facebook graph. The basic idea is
Ye, Shaozhi; Lang, Juan; Wu, S F
Graph Transformations in Relational Databases
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.
Gergely Varr�
Analysis of multilevel graph partitioning
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 ...
George Karypis; Vipin Kumar
Taxonomy-superimposed graph mining
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 ...
Ali Cakmak; Gultekin Ozsoyoglu
Towards graph containment search and indexing
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 ...
Chen Chen; Xifeng Yan; Philip S. Yu; Jiawei Han; Dong-Qing Zhang; Xiaohui Gu
Algorithms for string and graph layout
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 ...
Newman, Alantha.
Temporal Representation in Semantic 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.
Levandoski, J J; Abdulla, G M
Errors in graph embedding algorithms
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
Wendy Myrvold; William Kocay
Extremal graphs without 4-cycles
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
Frank A. Firke, Peter M. Kosek, Evan D. Nash, Jason Williford
Power domination in block graphs
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
Guangjun Xu; Liying Kang; Erfang Shan; Min Zhao
Graph theoretic approach to parallel gene assembly
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
Tero Harju; Chang Li; Ion Petre
Quantum chaos on discrete graphs
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}.
Uzy Smilansky
Games on Graphs
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.
Milos Stojakovic
Graph Homomorphisms for Quantum Players
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.
David E. Roberson; Laura Mancinska
Energy of graphs and digraphs.
??The energy of a graph is the sum of the absolute values of the eigenvalues of its adjacency matrix. The concept is related to the� (more)
Jahanbakht, Nafiseh
Distributed large-scale natural graph factorization
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
Amr Ahmed, Nino Shervashidze, Shravan Narayanamurthy, Vanja Josifovski, Alexander J. Smola
On crossing numbers of geometric proximity graphs
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
Bernardo M. �brego; Ruy Fabila-Monroy; Silvia Fern�ndez-Merchant; David Flores-Pe�aloza; Ferran Hurtado; Vera Sacrist�n; Maria Saumell
A history of graph entropy measures
This survey seeks to describe methods for measuring the entropy of graphs and to demonstrate the wide applicability of entropy measures. Setting the scene with a review of classical measures for determining the structural information content of graphs, ... Keywords: Entropy, Graph complexity, Graph entropy, Graphs, Information inequalities, Information measures, Information theory, Structural complexity
Matthias Dehmer; Abbe Mowshowitz
Skewed graph partitioning
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.
Hendrickson, B.; Leland, R. [Sandia National Labs., Albuquerque, NM (United States); Van Driessche, R. [Alcatel Telecom, Antwerp (Belgium)
A graph theoretic approach to ultrafast information distribution: Borel Cayley graph resizing algorithm
A graph theoretic approach is proposed to formulate communication graphs that enable ultrafast information distribution. In our earlier work, we reported that Borel Cayley graph (BCG) is a promising candidate as a logical topology for fast information ... Keywords: Borel Cayley graph, Cayley graph, Graph theory, Interconnection networks, Network modeling
Jaewook Yu; Eric Noel; K. Wendy Tang
Clustering based on a near neighbor graph and a grid cell graph
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
Xinquan Chen
Robust Hamiltonicity of Dirac graphs
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.
Krivelevich, Michael; Sudakov, Benny
Quantum networks modelled by graphs
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
Pavel Exner; Olaf Post
On Generating Random Network Structures: Connected Graphs
are presented for random generation of connected graphs, sugraphs (sub- graphs on the ... a distribution and take it into account at estimation. Attainability is�...
From quantum graphs to quantum random walks
We give a short overview over recent developments on quantum graphs and outline the connection between general quantum graphs and so-called quantum random walks.
Gregor Tanner
Graph anomalies in cyber communications
Enterprises monitor cyber traffic for viruses, intruders and stolen information. Detection methods look for known signatures of malicious traffic or search for anomalies with respect to a nominal reference model. Traditional anomaly detection focuses on aggregate traffic at central nodes or on user-level monitoring. More recently, however, traffic is being viewed more holistically as a dynamic communication graph. Attention to the graph nature of the traffic has expanded the types of anomalies that are being sought. We give an overview of several cyber data streams collected at Los Alamos National Laboratory and discuss current work in modeling the graph dynamics of traffic over the network. We consider global properties and local properties within the communication graph. A method for monitoring relative entropy on multiple correlated properties is discussed in detail.
Vander Wiel, Scott A [Los Alamos National Laboratory; Storlie, Curtis B [Los Alamos National Laboratory; Sandine, Gary [Los Alamos National Laboratory; Hagberg, Aric A [Los Alamos National Laboratory; Fisk, Michael [Los Alamos National Laboratory
Probe threshold and probe trivially perfect graphs
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
Daniel Bayer; Van Bang Le; H. N. de Ridder
Dec 16, 2005 ... ?(G) of a graph G. We introduce an operator ? mapping any graph parameter ?( G), nested between ...... On the Shannon capacity of a graph.
Time Series Graphs of Global and Hemispheric Temperature Anomalies...
Time Series Graphs of Global and Hemispheric Temperature Anomalies graphics Graph - Global and Hemispheric Annual Temperature Anomalies, 1850-2012 graphics Graph - Northern...
Nested (2,r)-regular graphs and their network properties.
??A graph G is a (t, r)-regular graph if every collection of t independent vertices is collectively adjacent to exactly r vertices. If a graph� (more)
Brooks, Josh Daniel
Groundwater monitoring in china
Groundwater accounts for 1/3 of the water resources in China and is indispensable for water supply and ecological support in many areas, especially in North China. But unreasonable groundwater development has caused some serious geo-environment problems ...
Qingcheng He; Cai Li
Positional Games on Random Graphs
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.
Milos Stojakovic; Tibor Szabo
A discrete curvature on a planar graph
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.
M. Lorente
Graph coloring and related symmetric functions - CECM
metric functions), pa (the power sum symmetric functions), s~ (the Schur functions ), ..... It is true for line graphs (a special class of claw-free graphs) by a result of.
0-1 graph partitioning and image segmentation
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. ...
Goh, Chun Fan
Graph partitioning via recurrent multivalued neural networks
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, ...
Enrique M�rida-Casermeiro; Domingo L�pez-Rodr�guez
A Graph Analytical Approach for Topic Detection
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
Hassan Sayyadi, Louiqa Raschid
Mining closed relational graphs with connectivity constraints
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
Xifeng Yan; X. Jasmine Zhou; Jiawei Han
Introducing complete graphs in molecular connectivity studies
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
Lionello Pogliani
Bipartite graph partitioning and data clustering
Many data types arising from data mining applications can be modeled as bipartite graphs, examples include terms and documents in a text corpus, customers and purchasing items in market basket analysis and reviewers and movies in a movie recommender ... Keywords: bipartite graph, correspondence analysis, document clustering, graph partitioning, singular value decomposition, spectral relaxation
Hongyuan Zha; Xiaofeng He; Chris Ding; Horst Simon; Ming Gu
Drawing graphs nicely using simulated annealing
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
Ron Davidson; David Harel
Constrained Graph Optimization: Interdiction and Preservation Problems
SciTech Connect
The maximum flow, shortest path, and maximum matching problems are a set of basic graph problems that are critical in theoretical computer science and applications. Constrained graph optimization, a variation of these basic graph problems involving modification of the underlying graph, is equally important but sometimes significantly harder. In particular, one can explore these optimization problems with additional cost constraints. In the preservation case, the optimizer has a budget to preserve vertices or edges of a graph, preventing them from being deleted. The optimizer wants to find the best set of preserved edges/vertices in which the cost constraints are satisfied and the basic graph problems are optimized. For example, in shortest path preservation, the optimizer wants to find a set of edges/vertices within which the shortest path between two predetermined points is smallest. In interdiction problems, one deletes vertices or edges from the graph with a particular cost in order to impede the basic graph problems as much as possible (for example, delete edges/vertices to maximize the shortest path between two predetermined vertices). Applications of preservation problems include optimal road maintenance, power grid maintenance, and job scheduling, while interdiction problems are related to drug trafficking prevention, network stability assessment, and counterterrorism. Computational hardness results are presented, along with heuristic methods for approximating solutions to the matching interdiction problem. Also, efficient algorithms are presented for special cases of graphs, including on planar graphs. The graphs in many of the listed applications are planar, so these algorithms have important practical implications.
Schild, Aaron V [Los Alamos National Laboratory
Happy Endings for Flip Graphs
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
unknown authors
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.
David Eppstein
Groundwater and Wells (Nebraska)
Energy.gov (U.S. Department of Energy (DOE))
This section describes regulations relating to groundwater protection, water wells, and water withdrawals, and requires the registration of all water wells in the state.
Computing Information Value from RDF Graph Properties
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.
al-Saffar, Sinan; Heileman, Gregory
API Requirements for Dynamic Graph Prediction
Given a large-scale time-evolving multi-modal and multi-relational complex network (a.k.a., a large-scale dynamic semantic graph), we want to implement algorithms that discover patterns of activities on the graph and learn predictive models of those discovered patterns. This document outlines the application programming interface (API) requirements for fast prototyping of feature extraction, learning, and prediction algorithms on large dynamic semantic graphs. Since our algorithms must operate on large-scale dynamic semantic graphs, we have chosen to use the graph API developed in the CASC Complex Networks Project. This API is supported on the back end by a semantic graph database (developed by Scott Kohn and his team). The advantages of using this API are (i) we have full-control of its development and (ii) the current API meets almost all of the requirements outlined in this document.
Gallagher, B; Eliassi-Rad, T
A copositive programming approach to graph partitioning
Aug 3, 2005 ... the random graph we can determine OPTMC by inspection, see column 3. The last 4 columns .... completeness. Freeman, San Francisco, 1979.
[30] P. Fowler, P. Hansen, G. Caporossi, and A. Soncini, Polyenes with maximum homo-lumo gap. (variable neighborhood search for extremal graphs 7),�...
Graph algorithms in the titan toolkit.
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.
McLendon, William Clarence, III; Wylie, Brian Neil
Mixture graph based semi-supervised dimensionality reduction
Graph structure is crucial to graph based dimensionality reduction. A mixture graph based semi-supervised dimensionality reduction (MGSSDR) method with pairwise constraints is proposed. MGSSDR first constructs multiple diverse graphs on different random ... Keywords: dimensionality reduction, mixture graph, noise, pairwise constraints
G. X. Yu; H. Peng; J. Wei; Q. L. Ma
Line graph explorer: scalable display of line graphs using Focus+Context
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
Robert Kincaid; Heidi Lam
Multithreaded Algorithms for Graph Coloring
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.
Catalyurek, Umit V.; Feo, John T.; Gebremedhin, Assefaw H.; Halappanavar, Mahantesh; Pothen, Alex
Feature Tracking Using Reeb Graphs
Tracking features and exploring their temporal dynamics can aid scientists in identifying interesting time intervals in a simulation and serve as basis for performing quantitative analyses of temporal phenomena. In this paper, we develop a novel approach for tracking subsets of isosurfaces, such as burning regions in simulated flames, which are defined as areas of high fuel consumption on a temperature isosurface. Tracking such regions as they merge and split over time can provide important insights into the impact of turbulence on the combustion process. However, the convoluted nature of the temperature isosurface and its rapid movement make this analysis particularly challenging. Our approach tracks burning regions by extracting a temperature isovolume from the four-dimensional space-time temperature field. It then obtains isosurfaces for the original simulation time steps and labels individual connected 'burning' regions based on the local fuel consumption value. Based on this information, a boundary surface between burning and non-burning regions is constructed. The Reeb graph of this boundary surface is the tracking graph for burning regions.
Weber, Gunther H.; Bremer, Peer-Timo; Day, Marcus S.; Bell, John B.; Pascucci, Valerio
Scalable modeling of real graphs using Kronecker multiplication
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 ...
Jure Leskovec; Christos Faloutsos
Collaborative robotic instruction: A graph teaching experience
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
Rub�n Mitnik; Mat�as Recabarren; Miguel Nussbaum; Alvaro Soto
Inflo: collaborative reasoning via open calculation graphs
Inflo is a web tool that introduces new ways to collaboratively construct and deconstruct logical arguments drawn as visual dataflow graphs. Inflo graphs are dynamic: nodes are logical propositions that can contain computations based on ... Keywords: collaboration, decision making, knowledge curation
Jonathan Lung; Steve Easterbrook
Anonymizing bipartite graph data using safe groupings
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
Graham Cormode; Divesh Srivastava; Ting Yu; Qing Zhang
Expressing graph algorithms using generalized active messages
Recently, graph computation has emerged as an important class of high-performance computing application whose characteristics differ markedly from those of traditional, compute-bound, kernels. Libraries such as BLAS, LAPACK, and others have been successful ... Keywords: active messages, parallel graph algorithms, parallel programming models
Nick Edmonds; Jeremiah Willcock; Andrew Lumsdaine
Improved call graph comparison using simulated annealing
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
Orestis Kostakis; Joris Kinable; Hamed Mahmoudi; Kimmo Mustonen
Graph mining: Laws, generators, and algorithms
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
Deepayan Chakrabarti; Christos Faloutsos
Generating random graphs with large girth
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 ...
Mohsen Bayati; Andrea Montanari; Amin Saberi
Quantum Algorithms for Graph Problems -- A Survey
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.
Sebastian D�rn
Oriented unicyclic graphs with extremal skew energy
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.
Yaoping, Hou; Chongyan, Zhang
Bond Graph Modeling Of Variable Structure Systems
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...
Fran�ois E. Cellier; Martin Otter; Hilding Elmqvist
Bioremediation of contaminated groundwater
DOE Patents (OSTI)
The present invention relates to a method for in situ bioremediation of contaminated soil and groundwater. In particular, the invention relates to remediation of contaminated soil and groundwater by the injection of nutrients to stimulate growth of pollutant-degrading microorganisms. The United States Government has rights in this invention pursuant to Contract No. DE-AC09-89SR18035 between the US Department of Energy and Westinghouse Savannah River Company.
Hazen, T.C.; Fliermans, C.B.
A combinatorial construction of almost-ramanujan graphs using the zig-zag product
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
Avraham Ben-Aroya; Amnon Ta-Shma
Definition: Groundwater Sampling | Open Energy Information
Open Energy Info (EERE)
Dictionary.png Groundwater Sampling Groundwater sampling is done to characterize the chemical, thermal, or hydrological properties of subsurface aqueous systems. Groundwater...
Bond graph modeling of centrifugal compressor system
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.
Nur Uddin; Jan Tommy Gravdahl
Groundwater Sampling | Open Energy Information
Groundwater Sampling Groundwater Sampling Jump to: navigation, search GEOTHERMAL ENERGYGeothermal Home Exploration Technique: Groundwater Sampling Details Activities (3) Areas (2) Regions (0) NEPA(0) Exploration Technique Information Exploration Group: Field Techniques Exploration Sub Group: Field Sampling Parent Exploration Technique: Water Sampling Information Provided by Technique Lithology: Stratigraphic/Structural: Hydrological: Water composition and source of fluids. Determination of mixing ratios between different fluid end-members. Determination of fluid recharge rates and residence times. Thermal: Water temperature. Dictionary.png Groundwater Sampling: Groundwater sampling is done to characterize the chemical, thermal, or hydrological properties of subsurface aqueous systems. Groundwater sampling
Upper oriented chromatic number of undirected graphs and oriented colorings of product graphs
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.
Sopena, Eric
Image segmentation by iterated region merging with localized graph cuts
This paper presents an iterated region merging-based graph cuts algorithm which is a novel extension of the standard graph cuts algorithm. Graph cuts addresses segmentation in an optimization framework and finds a globally optimal solution to a wide ... Keywords: Graph cuts, Image segmentation, Region merging
Bo Peng; Lei Zhang; David Zhang; Jian Yang
The depleted hydrogen atoms in chemical graph theory
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
On the density of a graph and its blowup
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
Asaf Shapira; Raphael Yuster
Theoretical underpinnings for maximal clique enumeration on perturbed graphs
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
William Hendrix; Matthew C. Schmidt; Paul Breimyer; Nagiza F. Samatova
Graph Invariants and Large Cycles - a Survey
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.
Nikoghosyan, Zh G
Electronic tools for designing charts and graphs
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 ...
Jones, Mary, M.S.V.S. Massachusetts Institute of Technology
The Gram dimension of a graph
be a Gram representation of Xi and let U an orthogonal matrix mapping u. (1) j to u. (2) ...... On the Shannon capacity of a graph IEEE Trans. Inform. Th. IT-25:.
Unconventional Groundwater System Proves Effective in Reducing...
Energy.gov (U.S. Department of Energy (DOE)) Indexed Site
Unconventional Groundwater System Proves Effective in Reducing Contamination at West Valley Demonstration Project Unconventional Groundwater System Proves Effective in Reducing...
Continuous Time Group Discovery in Dynamic Graphs
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.
Miller, K; Eliassi-Rad, T
Semiregular Factorization of Simple Graphs A. J. W. Hilton
]. 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
Wojciechowski, Jerzy
Advanced Technology for Groundwater Protection
This report documents the evaluation of automatic and in situ groundwater monitoring technologies for application at nuclear power plant (NPP) sites. The project studies the state of technology of automatic and in situ groundwater monitoring technologies and assesses whether they can be used to enhance the current groundwater monitoring capabilities at NPPs. Technologies for automatically detecting tritium and technologies that monitor non-radiological groundwater characteristics were explored. The abili...
Improving accessibility to statistical graphs: the iGraph-Lite system
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
Leo Ferres; Petro Verkhogliad; Gitte Lindgaard; Louis Boucher; Antoine Chretien; Martin Lachance
Groundwater Database | Department of Energy
Groundwater Database Groundwater Database Groundwater Database DOE has one of the largest ground water contamination problems and subsequent cleanup responsibilities for a single entity in the world, in terms of the sheer volume of affected groundwater, number of plumes, range of hydrogeologic settings, and diversity of contaminant types. The Groundwater Database was developed to provide a centralized location for information relating to groundwater flow, contamination, and remedial approaches across the DOE complex. The database provides DOE management and other interested parties with an easily accessible, high level understanding of the type of contamination, magnitude of contamination, and dynamics of groundwater systems at DOE sites. It also identifies remedial approaches, exit strategies, long-term stewardship requirements, regulatory
GRAPHS AND (Z2) k-ACTIONS
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.
Zhi L �
Subgraphs of quasi-random oriented graphs
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.
Amini, Omid; Huc, Florian
Graph clustering with network structure indices
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.
Matthew J. Rattigan; Marc Maier; David Jensen
Environmental Groundwater Monitoring Report
-460 -460 Environmental Groundwater Monitoring Report Third Quarter, 1997 October 1997 Approved for public release; further dissemination unlimited. Environmental Restoration U.S. Department of Energy Nevada Operations Office This report has been reproduced directly from the best available copy. 1 - I : ~vailablk to DOE and DOE contractors from the. Office of Scientific - and Technical .Information, P.O. Box 62, Oak Ridge, TN 3783 1 ; prices available from (423) 576-840 1. Available to the public from the National Technical Information Service, U.S. Department of Commerce, 5285 Port Royal Rd., Springfield, VA 22 16 1, telephone (703) 487-4650. RULISON SITE GROUNDWATER MONITORING REPORT THIRD QUARTER, 1997 DOE Nevada Operations Office Las Vegas, Nevada
Groundwater Makes a Splash NNSS Groundwater Experts Meet at Devils...
specialists have been examining the effects of contamination from historic underground nuclear testing on groundwater in and around the NNSS. These experts were on hand at the...
Sequoia tops Graph 500 list of 'big data' supercomputers
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, firstname.lastname@example.com 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
An empirical comparison of some approximate methods for graph coloring
The Graph Coloring Problem (GCP) is a classical NP-complete problem for which several approximate solution algorithms have been proposed: Brelaz algorithm, simulated annealing (SA), ant colony optimization (ACO). This paper reports empirical results ... Keywords: graph coloring, gravitational swarm
Israel Rebollo-Ruiz; Manuel Gra�a
Using constraints to achieve stability in automatic graph layout algorithms
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 ...
Karl-Friedrich B�hringer; Frances Newbery Paulisch
Efficient algorithms for graph all-matching and containment search.
??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)
Zhu, Gaoping
Long alternating cycles in edge-colored complete graphs
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
Hao Li; Guanghui Wang; Shan Zhou
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 ...
Xiao, Lin
Computing maximum non-crossing matching in convex bipartite graphs
We consider computing a maximum non-crossing matching in convex bipartite graphs. For a convex bipartite graph of n vertices and m edges, we present an O (n logn ...
Danny Z. Chen; Xiaomin Liu; Haitao Wang
The cost of monotonicity in distributed graph searching
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
Ilcinkas, David
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
Paris-Sud XI, Université de
A hybrid parallel genetic algorithm approach for graph coloring
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
S. N. Sivanandam; S. Sumathi; T. Hamsapriya
We introduce an operator � mapping any graph parameter �( ), nested between the stability number ...... Local chromatic number and Sperner capacity. ?ournal.
Hamiltonian Graphs and the Traveling Salesman Problem
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.
Dhananjay P. Mehendale
Multilevel heuristic algorithm for graph partitioning
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 ...
Raul Ba�os; Consolaci�n Gil; Julio Ortega; Francisco G. Montoya
Suggesting friends using the implicit social graph
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
Maayan Roth; Assaf Ben-David; David Deutscher; Guy Flysher; Ilan Horn; Ari Leichtberg; Naty Leiser; Yossi Matias; Ron Merom
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 ...
Grid smoothing: a graph-based approach
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
Guillaume Noel; Karim Djouani; Yskandar Hamam
Computing role assignments of chordal graphs
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 ...
Pim Van't Hof; Dani�l Paulusma; Johan M. M. Van Rooij
Exploiting graph properties of game trees
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
Aske Plaat; Jonathan Schaeffer; Wim Pijls; Arie de Bruin
Quantum secret sharing with qudit graph states
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.
Keet, Adrian; Fortescue, Ben; Sanders, Barry C. [Institute for Quantum Information Science, University of Calgary, Alberta, T2N 1N4 (Canada); Markham, Damian [LTCI-CNRS, Telecom ParisTech, 37/39 rue Dareau, F-75014 Paris (France)
Adrian Keet; Ben Fortescue; Damian Markham; Barry C. Sanders
Diagnosability of star graphs with missing edges
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
Chieh-Feng Chiang; Guo-Huang Hsu; Lun-Min Shih; Jimmy J. M. Tan
Graph grammars with string-regulated rewriting
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
Daniel Lobo; Francisco J. Vico; J�rgen Dassow
Kinetic and stationary point-set embeddability for plane graphs
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
Zahed Rahmati; Sue H. Whitesides; Valerie King
A graph based method for faster display for distribution networks
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
Mansoor Al-A'ali
Hiroshi Ishikawa A Practical Introduction to Graph Cut
Technology Contents Overview / Brief history Energy minimization Graphs and their minimum cuts Energy Elevation map #12;History Probablistic methods (SA, ICM,...) have been used for energy minimization OR has Overview / Brief history Energy minimization Graphs and their minimum cuts Energy minimization via graph
Ishikawa, Hiroshi
Modeling molecular polarizabilities with graph-theoretical concepts
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
Discovering informative connection subgraphs in multi-relational graphs
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
Cartic Ramakrishnan; William H. Milnor; Matthew Perry; Amit P. Sheth
1.72 Groundwater Hydrology, Fall 2004
Fundamentals of subsurface flow and transport, emphasizing the role of groundwater in the hydrologic cycle, the relation of groundwater flow to geologic structure, and the management of contaminated groundwater. Topics ...
Harvey, Charles
Image segmentation using quadtree-based similarity graph and normalized cut
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
Marco Antonio Garcia De Carvalho; Anselmo Castelo Branco Ferreira; Andr� Luis Costa
Groundwater Projects, Environmental Restoration Division, ERD...
OU I, IV, V, and VI also address groundwater contamination. The BNL Groundwater Status Report is an annual comprehensive summary of data collected from environmental restoration...
Maker Can Construct a Sparse Graph on a Small Board
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.
Gebauer, Heidi
StreamWorks - A system for Dynamic Graph Search
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.
Choudhury, Sutanay; Holder, Larry; Chin, George; Ray, Abhik; Beus, Sherman J.; Feo, John T.
Groundwater in the Great Plains
Groundwater lies hidden beneath the soil, out of sight and largely out of mind. As a result, it�s poorly understood by most who depend on it for drinking water and other uses. Misconceptions about groundwater are common. In 1904, a Texas judge ruled that �the existence, origin and movement of (ground) water...is so secret, occult and concealed...(that) any attempt to administer any set of legal rules in respect to it would be involved in hopeless uncertainty.� In spite of increasing scientific knowledge, groundwater is still perceived in much the same way by the public today. Despite the lack of understanding, groundwater is the most significant water resource for most Americans. Roughly 75% of U.S. cities depend on groundwater for all or part of their water supplies. More than half of all Americans and 95% of all persons in rural areas rely on groundwater as their primary source of drinking water. Throughout the United States and the world, vital aquifers supply irrigation and drinking water for many regions More than 97% of the world�s usable freshwater supply � an estimated 9 trillion acre feet � is groundwater. Despite the seeming abundance of groundwater, there are concerns about how long its supplies will last, especially in areas where water use is high, and whether its quality is being threatened by natural and man-made contaminants.
Jensen, R.
Implementing Graph Pattern Queries on a Relational Database
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.
Kaplan, I L; Abdulla, G M; Brugger, S T; Kohn, S R
Groundwater Protection, Brookhaven National Laboratory
Groundwater Groundwater placeholder DOE, BNL, elected officials, and community leaders mark the opening of the first off-site groundwater treatment system. From the outset, the Department of Energy (DOE) and the Brookhaven National Laboratory (BNL) considered the protection of human health to be the most important goal of the cleanup program. Because exposure to groundwater contamination had the greatest potential to impact human health, the focus was to ensure that local drinking water supplies were clean and safe. Early efforts concentrated on determining the locations of the contamination, installing treatment systems to clean up the groundwater, and remediating sources of contamination like landfills and underground tanks. DOE and the Lab are committed to protecting Long Island's sole-source aquifer, a vital natural resource.
Monitoring probe for groundwater flow
A monitoring probe for detecting groundwater migration. The monitor features a cylinder made of a permeable membrane carrying an array of electrical conductivity sensors on its outer surface. The cylinder is filled with a fluid that has a conductivity different than the groundwater. The probe is placed in the ground at an area of interest to be monitored. The fluid, typically saltwater, diffuses through the permeable membrane into the groundwater. The flow of groundwater passing around the permeable membrane walls of the cylinder carries the conductive fluid in the same general direction and distorts the conductivity field measured by the sensors. The degree of distortion from top to bottom and around the probe is precisely related to the vertical and horizontal flow rates, respectively. The electrical conductivities measured by the sensors about the outer surface of the probe are analyzed to determine the rate and direction of the groundwater flow.
Looney, Brian B. (Aiken, SC); Ballard, Sanford (Albuquerque, NM)
Visibility graph analysis of solar wind velocity
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.
Suyal, Vinita; Singh, Harinder P
A Concatenational Graph Evolution Aging Model
Modeling the long-term face aging process is of great importance for face recognition and animation, but there is a lack of sufficient long-term face aging sequences for model learning. To address this problem, we propose a CONcatenational GRaph Evolution ... Keywords: Aging,Face,Active appearance model,Correlation,Computational modeling,Data models,Muscles,ANOVA,Face aging,aging model evaluation,long-term aging,short-term aging
Jinli Suo; Xilin Chen; Shiguang Shan; Wen Gao; Qionghai Dai
Graph operations that are good for greedoids
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
Vadim E. Levit; Eugen Mandrescu
On a base exchange game on graphs
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.
Stephan Dominique Andres; Winfried Hochst�ttler; Markus Merkel
Disclosed is an apparatus and method for in situ remediation of contaminated subsurface soil or groundwater contaminated by chlorinated hydrocarbons. A nutrient fluid (NF) is selected to simulated the growth and reproduction of indigenous subsurface microorganisms capable of degrading the contaminants; an oxygenated fluid (OF) is selected to create an aerobic environment with anaerobic pockets. NF is injected periodically while OF is injected continuously and both are extracted so that both are drawn across the plume. NF stimulates microbial colony growth; withholding it periodically forces the larger, healthy colony of microbes to degrade the contaminants. Treatment is continued until the subsurface concentration of contaminants is acceptable. NF can be methane and OF be air, for stimulating production of methanotrophs to break down chlorohydrocarbons, especially TCE and tetrachloroethylene.
JGI - Why Sequence Contaminated Groundwater?
Contaminated Groundwater? Contaminated Groundwater? Because the majority of microorganisms in nature have never been cultured, little is known about their genetic properties, biochemical functions, and metabolic characteristics. Although the sequence of the microbial community "genome" can now be determined with high-throughput sequencing technology, the complexity and magnitude of most microbial communities make meaningful data acquisition and interpretation difficult. Thus, the sequence determination of a groundwater microbial community with manageable diversity and complexity (~20 phylotypes) is a timely challenge. The samples for this project come from the Natural and Accelerated Bioremediation Research (NABIR) Field Research Center (FRC), Well FW-010. The overall objective is to provide a fundamental and comprehensive
Modeling and Analysis of Time-Varying 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...
Basu, Prithwish; Ramanathan, Ram; Johnson, Matthew P
Strict inequalities for connective constants of transitive graphs
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.
Geoffrey R. Grimmett; Zhongyang Li
Microsoft Word - Groundwater Discharge Permit
State Renews Groundwater Discharge Permit for WIPP CARLSBAD, N.M., September 11, 2008 - The New Mexico Environment Department (NMED) has renewed the U.S. Department of Energy's (DOE) Waste Isolation Pilot Plant (WIPP) groundwater discharge permit until 2013. The permit regulates the discharge of water from WIPP facilities and operations to lined ponds, which protect groundwater resources. The permit allows WIPP to discharge domestic wastewater, non-hazardous wastewater and storm water into 13 on-site, synthetically-lined ponds. The new permit also provides for increased daily discharge volumes to allow more flexibility in plant operations. "This permit is the result of a positive year-long effort with the New Mexico Groundwater Quality Bureau," said Jody Plum, DOE Carlsbad Field Office Permitting and
Regional Groundwater Evapotranspiration in Illinois
The role of shallow unconfined aquifers in supplying water for evapotranspiration (i.e., groundwater evaporation) is investigated in this paper. Recent results from regional land surface modeling have indicated that in shallow water table areas, ...
Pat J-F. Yeh; J. S. Famiglietti
Groundwater Model Validation
Models have an inherent uncertainty. The difficulty in fully characterizing the subsurface environment makes uncertainty an integral component of groundwater flow and transport models, which dictates the need for continuous monitoring and improvement. Building and sustaining confidence in closure decisions and monitoring networks based on models of subsurface conditions require developing confidence in the models through an iterative process. The definition of model validation is postulated as a confidence building and long-term iterative process (Hassan, 2004a). Model validation should be viewed as a process not an end result. Following Hassan (2004b), an approach is proposed for the validation process of stochastic groundwater models. The approach is briefly summarized herein and detailed analyses of acceptance criteria for stochastic realizations and of using validation data to reduce input parameter uncertainty are presented and applied to two case studies. During the validation process for stochastic models, a question arises as to the sufficiency of the number of acceptable model realizations (in terms of conformity with validation data). Using a hierarchical approach to make this determination is proposed. This approach is based on computing five measures or metrics and following a decision tree to determine if a sufficient number of realizations attain satisfactory scores regarding how they represent the field data used for calibration (old) and used for validation (new). The first two of these measures are applied to hypothetical scenarios using the first case study and assuming field data consistent with the model or significantly different from the model results. In both cases it is shown how the two measures would lead to the appropriate decision about the model performance. Standard statistical tests are used to evaluate these measures with the results indicating they are appropriate measures for evaluating model realizations. The use of validation data to constrain model input parameters is shown for the second case study using a Bayesian approach known as Markov Chain Monte Carlo. The approach shows a great potential to be helpful in the validation process and in incorporating prior knowledge with new field data to derive posterior distributions for both model input and output.
Ahmed E. Hassan
A Graph Theory Package for Maple - CECM - Simon Fraser University
{jfarr,mahdad,skhodada,email@example.com. Abstract. We present a new graph theory package for Maple. The package is presently intended for teaching �...
New Benchmark Instances for the Steiner Problem in Graphs
Sep 26, 2001 ... New Benchmark Instances for the Steiner Problem in Graphs. Isabel Rosseti ( rosseti ***at*** inf.puc-rio.br) Marcus Poggi de Arag�o (poggi�...
Finding good nearly balanced cuts in power law graphs
The green dots in figure 8-A represent cuts that were obtained using Spectral plus Swept Hyperplane .... Fast approximate energy minimization via graph cuts.
GreenArrow� - A New Graph Labeling Technique - Available ...
Search PNNL. PNNL Home; About; Research; Publications; Jobs; News; Contacts; GreenArrow� - A New Graph Labeling Technique. Battelle Number(s): ...
Joint Spectral Radius and Path-Complete Graph Lyapunov Functions
Nov 22, 2011 ... Abstract: We introduce the framework of path-complete graph Lyapunov functions for approximation of the joint spectral radius. The approach is�...
Coloring kk-free intersection graphs of geometric objects in the plane
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
Jacob Fox; J�nos Pach
An extended star graph: a proposal of a new network topology and its fundamental properties
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
Satoru Watanabe; Satoshi Okawa
Graduated assignment algorithm for finding the common labelling of a set of graphs
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
Albert Sol�-Ribalta; Francesc Serratosa
X-701B Groundwater Remedy Portsmouth Ohio | Department of Energy
X-701B Groundwater Remedy Portsmouth Ohio X-701B Groundwater Remedy Portsmouth Ohio Full Document and Summary Versions are available for download X-701B Groundwater Remedy...
Groundwater Manual for the Electric Utility Industry, Second Edition, Volume 1: Groundwater Laws, Geologic Formations, and Groundwat er Aquifers: Volume 1: Groundwater Laws, Geologic Formations, and Groundwater Aquifers
This comprehensive manual brings together hydrogeologic information on subsurface water resources, the fundamentals of aqueous geochemistry, and details on state and federal groundwater laws and regulations. Designed for utility personnel responsible for power plant construction, management, and operation, this manual discusses groundwater management and aquifer protection.
Noisy evolution of graph-state entanglement
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.
Aolita, L.; Dhara, C. [ICFO-Institut de Ciencies Fotoniques, Mediterranean Technology Park, E-08860 Castelldefels, Barcelona (Spain); Cavalcanti, D. [Centre for Quantum Technologies, University of Singapore (Singapore); Chaves, R.; Davidovich, L. [Instituto de Fisica, Universidade Federal do Rio de Janeiro, Caixa Postal 68528, 21941-972 Rio de Janeiro, RJ (Brazil); Acin, A. [ICFO-Institut de Ciencies Fotoniques, Mediterranean Technology Park, E-08860 Castelldefels, Barcelona (Spain); ICREA-Institucio Catalana de Recerca i Estudis Avancats, Lluis Companys 23, E-08010 Barcelona (Spain)
Enhancing graph production skills via programmed instruction: An experimental analysis of the effect of guided-practice on data-based graph production
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
Darrel R. Davis
EntityAuthority: Semantically Enriched Graph-Based Authority Propagation
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
Pennsylvania, University of
On bounding the bandwidth of graphs with symmetry
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.
Embedding of hypercubes into necklace, windmill and snake graphs
Graph embedding problems have gained importance in the field of interconnection networks for parallel computer architectures. In this paper, we determine the exact wirelength of embedding hypercubes into necklace, windmill and snake graphs. Keywords: Congestion, Edge isoperimetric problem, Embedding, Hypercubes, Interconnection networks, Wirelength
Indra Rajasingh; Bharati Rajan; R. Sundara Rajan
On the connectivity of extremal Ramsey graphs Andrew Beveridge
and Computer Science Macalester College Saint Paul, MN 55105 Oleg Pikhurko # Department of Mathematical Sciences Carnegie Mellon University Pittsburgh, PA 15213 Received: 1 December 2006, Accepted: 31 October 2007 Abstract An (r, b)graph is a graph that contains no clique of size r and no independent set
Pikhurko, Oleg
Commute-time convolution kernels for graph clustering
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
Normawati A. Rahman; Edwin R. Hancock
Analyzing uncertainty in TG protection graphs with TG/MC
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
James R. Conrad; Jim Alves-Foss; Sauchi Stephen Lee
Cell-graph modeling of salivary gland morphology
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
Cemal Cagatay Bilgin; Shayoni Ray; William P. Daley; Banu Baydil; Sharon J. Sequeira; B�lent Yener; Melinda Larsen
Exclusivity structures and graph representatives of local complementation orbits
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.
Adan Cabello; Matthew G. Parker; Giannicola Scarpa; Simone Severini
Detecting research topics via the correlation between graphs and texts
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
Yookyung Jo; Carl Lagoze; C. Lee Giles
Quantum graphs where back-scattering is prohibited
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.
J. M. Harrison; U. Smilansky; B. Winn
Quantum graphs: an introduction and a brief survey
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.
Peter Kuchment
On Characterizing Game-Perfect Graphs by Forbidden Induced Subgraphs
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.
Stephan Dominique Andres
Horizontal Visibility graphs generated by type-II intermittency
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.
�ngel M. N��ez; Jos� Patricio G�mez; Lucas Lacasa
An Experiment on Graph Analysis Methodologies for Scenarios
Visual graph representations are increasingly used to represent, display, and explore scenarios and the structure of organizations. The graph representations of scenarios are readily understood, and commercial software is available to create and manage these representations. The purpose of the research presented in this paper is to explore whether these graph representations support quantitative assessments of the underlying scenarios. The underlying structure of the scenarios is the information that is being targeted in the experiment and the extent to which the scenarios are similar in content. An experiment was designed that incorporated both the contents of the scenarios and analysts� graph representations of the scenarios. The scenarios� content was represented graphically by analysts, and both the structure and the semantics of the graph representation were attempted to be used to understand the content. The structure information was not found to be discriminating for the content of the scenarios in this experiment; but, the semantic information was discriminating.
Brothers, Alan J.; Whitney, Paul D.; Wolf, Katherine E.; Kuchar, Olga A.; Chin, George
INTEC Groundwater Monitoring Report 2006
This report summarizes 2006 perched water and groundwater monitoring activities at the Idaho Nuclear Technology and Engineering Center (INTEC) located at the Idaho National Laboratory (INL). During 2006, groundwater samples were collected from a total of 22 Snake River Plain Aquifer (SRPA) monitoring wells, plus six aquifer wells sampled for the Idaho CERCLA Disposal Facility (ICDF) monitoring program. In addition, perched water samples were collected from 21 perched wells and 19 suction lysimeters. Groundwater and perched water samples were analyzed for a suite of radionuclides and inorganic constituents. Laboratory results in this report are compared to drinking water maximum contaminant levels (MCLs). Such comparison is for reference only and it should be noted that the Operable Unit 3-13 Record of Decision does not require that perched water comply with drinking water standards.
J. R. Forbes S. L. Ansley M. Leecaster
Soil & Groundwater Remediation | Department of Energy
Soil & Groundwater Soil & Groundwater Remediation Soil & Groundwater Remediation Soil & Groundwater Remediation The U.S. Department of Energy (DOE) manages the largest groundwater and soil remediation effort in the world. The inventory at the DOE sites includes 6.5 trillion liters of contaminated groundwater, an amount equal to about four times the daily U.S. water consumption, and 40 million cubic meters of soil and debris contaminated with radionuclides, metals, and organics. The Office of Groundwater and Soil Remediation is working with DOE site managers around the country regarding specific technical issues. At the large sites such as Hanford, Savannah River, and Oak Ridge, the Office of Groundwater and Soil Remediation has conducted research and demonstration projects to test new technologies and remediation
Until this past October, Fluor Hanford managed Hanford's integrated groundwater program for the U.S. Department of Energy (DOE). With the new contract awards at the Site, however, the CH2M HILL Plateau Remediation Company (CHPRC) has assumed responsibility for the groundwater-monitoring programs at the 586-square-mile reservation in southeastern Washington State. These programs are regulated by the Resource Conservation and Recovery Act (RCRA) and the Comprehensive Environmental Response Compensation and Liability Act (CERCLA). The purpose of monitoring is to track existing groundwater contamination from past practices, as well as other potential contamination that might originate from RCRA treatment, storage, and disposal (TSD) facilities. An integral part of the groundwater-monitoring program involves taking samples of the groundwater and measuring the water levels in wells scattered across the site. More than 1,200 wells are sampled each year. Historically, field personnel or 'samplers' have been issued pre-printed forms that have information about the well(s) for a particular sampling evolution. This information is taken from the Hanford Well Information System (HWIS) and the Hanford Environmental Information System (HEIS)--official electronic databases. The samplers used these hardcopy forms to document the groundwater samples and well water-levels. After recording the entries in the field, the samplers turned the forms in at the end of the day and the collected information was posted onto a spreadsheet that was then printed and included in a log book. The log book was then used to make manual entries of the new information into the software application(s) for the HEIS and HWIS databases. This is a pilot project for automating this tedious process by providing an electronic tool for automating water-level measurements and groundwater field-sampling activities. The automation will eliminate the manual forms and associated data entry, improve the accuracy of the information recorded, and enhance the efficiency and sampling capacity of field personnel. The goal of the effort is to eliminate 100 percent of the manual input to the database(s) and replace the management of paperwork by the field and clerical personnel with an almost entirely electronic process. These activities will include the following: scheduling the activities of the field teams, electronically recording water-level measurements, electronically logging and filing Groundwater Sampling Reports (GSR), and transferring field forms into the site-wide Integrated Document Management System (IDMS).
Quantum query complexity of some graph problems
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.
Christoph Durr; Mark Heiligman; Peter Hoyer; Mehdi Mhalla
Efficient broadcast on random geometric graphs
A Randon Geometric Graph (RGG) is constructed by distributing n nodes uniformly at random in the unit square and connecting two nodes if their Euclidean distance is at most r, for some prescribed r. They analyze the following randomized broadcast algorithm on RGGs. At the beginning, there is only one informed node. Then in each round, each informed node chooses a neighbor uniformly at random and informs it. They prove that this algorithm informs every node in the largest component of a RGG in {Omicron}({radical}n/r) rounds with high probability. This holds for any value of r larger than the critical value for the emergence of a giant component. In particular, the result implies that the diameter of the giant component is {Theta}({radical}n/r).
Bradonjic, Milan [Los Alamos National Laboratory; Elsasser, Robert [UNIV OF PADERBORN; Friedrich, Tobias [INTERNATIONAL COMPUTER SCI.; Sauerwald, Thomas [INTERNATIONAL COMPUTER SCI.
Groundwater and geothermal: urban district heating applications
DOE Green Energy (OSTI)
This report describes how several cities use groundwater and geothermal energy in district heating systems. It begins with groundwater, introducing the basic technology and techniques of development, and describing two case studies of cities with groundwater-based district heating systems. The second half of the report consists of three case studies of cities with district heating systems using higher temperature geothermal resources.
Mounts, R.; Frazier, A.; Wood, E.; Pyles, O.
A sequential growth dynamics for a directed acyclic dyadic graph
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.
Alexey L. Krugly
Nested cycles in large triangulations and crossing-critical graphs
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$.
Hernandez-Velez, Cesar; Thomas, Robin
The Graph Laplacian and the Dynamics of Complex Networks
In this talk, we explore the structure of networks from a spectral graph-theoretic perspective by analyzing the properties of the Laplacian matrix associated with the graph induced by a network. We will see how the eigenvalues of the graph Laplacian relate to the underlying network structure and dynamics and provides insight into a phenomenon frequently observed in real world networks - the emergence of collective behavior from purely local interactions seen in the coordinated motion of animals and phase transitions in biological networks, to name a few.
Thulasidasan, Sunil [Los Alamos National Laboratory
A new framework for elimination-based data flow analysis using DJ graphs
Keywords: DJ graphs, Tarjan's interval, exhaustive and incremental data flow analysis, irreducible flowgraphs, reducible flowgraphs
Vugranam C. Sreedhar; Guang R. Gao; Yong-Fong Lee
A graph-theoretic model of lexical syntactic acquisition
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 ...
Hinrich Sch�tze; Michael Walsh
Geometry of loop quantum gravity on a graph
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.
Rovelli, Carlo; Speziale, Simone [Centre de Physique Theorique, CNRS-Luminy Case 907, 13288 Marseille Cedex 09 (France)
Investigation of bond graphs for nuclear reactor simulations
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 ...
Sosnovsky, Eugeny
Chip-Firing and Rotor-Routing on Directed Graphs
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.
Holroyd, Alexander E; Meszaros, Karola; Peres, Yuval; Propp, James; Wilson, David B
Graph-Theoretic Techniques for Web Content Mining
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.
Adam Schenker; Horst Bunke; Mark Last; Abraham Kandel
Parallel Algorithms for Graph Optimization using Tree Decompositions
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.
Sullivan, Blair D [ORNL; Weerapurage, Dinesh P [ORNL; Groer, Christopher S [ORNL
Effective Graph Clustering for Path Queries in Digital Map Databases
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....
Yun-Wu Huang; Ning Jing; Elke A. Rundensteiner
Interactive searching and visualization of patterns in attributed graphs
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 ...
Pierre-Yves Koenig; Faraz Zaidi; Daniel Archambault
Modelling structured domains using description graphs and logic programming
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 ...
Despoina Magka; Boris Motik; Ian Horrocks
Temporally Scalable Visual SLAM using a Reduced Pose Graph
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 ...
Johannsson, Hordur
On electric resistances for distance-regular graphs
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.
Koolen, Jack; Park, Jongyook
Confusability graphs for symmetric sets of quantum states
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.
Giulio Chiribella; Yuxiang Yang
Scalable methods for representing, characterizing, and generating large graphs.
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.
Grace, Matthew D.; Dunlavy, Daniel M. (Sandia National Laboratories, Albuquerque, NM); Ray, Jaideep; Pinar, Ali; Hendrickson, Bruce Alan (Sandia National Laboratories, Albuquerque, NM); Phillips, Cynthia Ann (Sandia National Laboratories, Albuquerque, NM); Kolda, Tamara Gibson
Geochemistry of Delaware Basin groundwaters
Fluids from various formations were sampled and analyzed in order to characterize groundwaters in the Delaware Basin. Waters were analyzed for solute content and/or stable isotope ratios (D/H and /sup 18/O//sup 16/O). Three lines of geochemical arguments are summarized, in order to present the natures and probable origins of analyzed fluids: solute chemistry, thermodynamic modelling of low-temperature aqueous species, and stable isotope ratios. (JGB)
Lambert, S.J.
Situ treatment of contaminated groundwater
A system for treating dissolved halogenated organic compounds in groundwater that relies upon electrolytically-generated hydrogen to chemically reduce the halogenated compounds in the presence of a suitable catalyst. A direct current is placed across at least a pair, or an array, of electrodes which are housed within groundwater wells so that hydrogen is generated at the cathode and oxygen at the anode. A pump is located within the well housing in which the cathode(s) is(are) located and draws in groundwater where it is hydrogenated via electrolysis, passes through a well-bore treatment unit, and then transported to the anode well(s) for reinjection into the ground. The well-bore treatment involves a permeable cylinder located in the well bore and containing a packed bed of catalyst material that facilitates the reductive dehalogenation of the halogenated organic compounds by hydrogen into environmentally benign species such as ethane and methane. Also, electro-osmatic transport of contaminants toward the cathode also contributes to contaminant mass removal. The only above ground equipment required are the transfer pipes and a direct circuit power supply for the electrodes. The electrode wells in an array may be used in pairs or one anode well may be used with a plurality of cathode wells. The DC current flow between electrode wells may be periodically reversed which controls the formation of mineral deposits in the alkaline cathode well-bore water, as well as to help rejuvenate the catalysis.
McNab, Jr., Walt W. (Concord, CA); Ruiz, Roberto (Tracy, CA); Pico, Tristan M. (Livermore, CA)
pGraph: Efficient Parallel Construction of Large-Scale Protein Sequence Homology Graphs
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.
Wu, Changjun; Kalyanaraman, Anantharaman; Cannon, William R.
Groundwater Sampling and Analysis Sourcebook for Nuclear Power Plants
This sourcebook provides technical guidance and best practices for groundwater sampling and analysis at nuclear power plants. Robust sampling and analysis protocols are required to ensure accurate characterization of radionuclides in groundwater.BackgroundNuclear power plants implement groundwater protection programs to minimize contamination of on-site soil and groundwater, and to prevent the off-site migration of licensed material through groundwater ...
Proceedings: 2010 EPRI Groundwater Protection Workshop
The 2010 Electric Power Research Institute (EPRI) Groundwater Protection Workshop (in collaboration with the Nuclear Energy Institute [NEI]) was held in San Jose, California, on June 30-July 1, 2010. The workshop focused on nuclear plant leak prevention, groundwater monitoring and remediation techniques, and industry experience. This information will assist nuclear plant operators in the development and implementation of technically sound site groundwater protection programs (GPPs). This proceedings docu...
Proceedings: 2011 EPRI Groundwater Protection Workshop
The 2011 Electric Power Research Institute (EPRI) Groundwater Protection Workshop (in collaboration with the Nuclear Energy Institute [NEI]) was held in Oakbridge (Chicago), Illinois, on June 27�29, 2011. The workshop focused on nuclear plant leak prevention, groundwater monitoring and remediation techniques, and industry experience. This information will assist nuclear plant operators in the development and implementation of technically sound site groundwater protection programs (GPPs). This proceedings...
Groundwater Management Areas (Texas) | Department of Energy
Management Areas (Texas) Management Areas (Texas) Groundwater Management Areas (Texas) < Back Eligibility Utility Fed. Government Commercial Investor-Owned Utility Industrial Construction Municipal/Public Utility Local Government Rural Electric Cooperative Tribal Government Savings Category Alternative Fuel Vehicles Hydrogen & Fuel Cells Buying & Making Electricity Water Home Weatherization Solar Wind Program Info State Texas Program Type Environmental Regulations Provider Texas Commission on Environmental Quality This legislation authorizes the Texas Commission on Environmental Quality and the Texas Water Development Board to establish Groundwater Management Areas to provide for the conservation, preservation, protection, recharging, and prevention of waste of groundwater and groundwater
Groundwater Conservation Districts (Texas) | Department of Energy
Conservation Districts (Texas) Conservation Districts (Texas) Groundwater Conservation Districts (Texas) < Back Eligibility Utility Fed. Government Commercial Investor-Owned Utility Industrial Construction Municipal/Public Utility Local Government Rural Electric Cooperative Tribal Government Savings Category Alternative Fuel Vehicles Hydrogen & Fuel Cells Buying & Making Electricity Water Home Weatherization Solar Wind Program Info State Texas Program Type Environmental Regulations Provider Texas Commission on Environmental Quality Groundwater Conservation Districts, as created following procedures described in Water Code 36, are designed to provide for the conservation, preservation, protection, recharging, and prevention of waste of groundwater, and of groundwater reservoirs or their subdivisions, and to
Metropolitan Groundwater Plans (Minnesota) | Department of Energy
Groundwater Plans (Minnesota) Groundwater Plans (Minnesota) Metropolitan Groundwater Plans (Minnesota) < Back Eligibility Utility Fed. Government Commercial Agricultural Investor-Owned Utility State/Provincial Govt Industrial Construction Municipal/Public Utility Local Government Residential Installer/Contractor Rural Electric Cooperative Tribal Government Low-Income Residential Schools Retail Supplier Institutional Multi-Family Residential Systems Integrator Fuel Distributor Nonprofit General Public/Consumer Transportation Savings Category Alternative Fuel Vehicles Hydrogen & Fuel Cells Buying & Making Electricity Water Home Weatherization Solar Wind Program Info State Minnesota Program Type Environmental Regulations This section gives metropolitan counties the authority to prepare and adopt groundwater plans, or to grant this responsibility to soil and water
Hanford Treats Record Amount of Groundwater
Workers have treated more than 800 million gallons of groundwater at the Hanford Site so far this year, a record annual amount.
Groundwater Use and Reporting Act (South Carolina)
The Department of Health and Environmental Control has established a groundwater management program, requiring entities withdrawing in excess of three million gallons during any one month to obtain...
Compendium of ordinances for groundwater protection
Groundwater is an extremely important resource in the Tennessee Valley. Nearly two-thirds of the Tennessee Valley's residents rely, at least in part, on groundwater supplies for drinking water. In rural areas, approximately ninety-five percent of residents rely on groundwater for domestic supplies. Population growth and economic development increase the volume and kinds of wastes requiring disposal which can lead to groundwater contamination. In addition to disposal which can lead to groundwater contamination. In addition to disposal problems associated with increases in conventional wastewater and solid waste, technological advancements in recent decades have resulted in new chemicals and increased usage in agriculture, industry, and the home. Unfortunately, there has not been comparable progress in identifying the potential long-term effects of these chemicals, in managing them to prevent contamination of groundwater, or in developing treatment technologies for removing them from water once contamination has occurred. The challenge facing residence of the Tennessee Valley is to manage growth and economic and technological development in ways that will avoid polluting the groundwater resource. Once groundwater has been contaminated, cleanup is almost always very costly and is sometimes impractical or technically infeasible. Therefore, prevention of contamination -- not remedial treatment--is the key to continued availability of usable groundwater. This document discusses regulations to aid in this prevention.
Not Available
Anatomy of a young giant component in the random graph
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...
Ding, Jian; Lubetzky, Eyal; Peres, Yuval
Groundwater Resources Assessment under the Pressures of Humanity...
Groundwater Resources Assessment under the Pressures of Humanity and Climate Change (GRAPHIC) Jump to: navigation, search Tool Summary Name: Groundwater Resources Assessment under...
2000 Annual Interim Sanitary Landfill Groundwater Monitoring Report
This report includes a discussion of the groundwater flow direction and rate, the groundwater analytical results, and the methane monitoring results.
Chase, J.A.
Hanford Groundwater Contamination Areas Shrink as EM Exceeds...
Groundwater Contamination Areas Shrink as EM Exceeds Cleanup Goals Hanford Groundwater Contamination Areas Shrink as EM Exceeds Cleanup Goals June 26, 2013 - 12:00pm Addthis The...
Microbial Community Dynamics of Lactate Enriched Hanford Groundwaters
Dynamics of Lactate Enriched Hanford Groundwaters Jenniferof Energy site at Hanford, WA, has been historicallyof lactate-enriched Hanford well H-100 groundwater sample.
Mosher, Jennifer J.
Geology and Groundwater Investigation Many Devils Wash, Shiprock...
Geology and Groundwater Investigation Many Devils Wash, Shiprock Site, New Mexico Geology and Groundwater Investigation Many Devils Wash, Shiprock Site, New Mexico Geology and...
Mining Large Heterogeneous Graphs using Cray s Urika
Pattern discovery and predictive modeling from seemingly related Big Data represented as massive, ad-hoc, heterogeneous networks (e.g., extremely large graphs with complex, possibly unknown structure) is an outstanding problem in many application domains. To address this problem, we are designing graph-mining algorithms capable of discovering relationship-patterns from such data and using those discovered patterns as features for classification and predictive modeling. Specifically, we are: (i) exploring statistical properties, mechanics and generative models of behavior patterns in heterogeneous information networks, (ii) developing novel, automated and scalable graph-pattern discovery algorithms and (iii) applying our relationship-analytics (data science + network science) expertise to domains spanning healthcare to homeland security.
Sukumar, Sreenivas R [ORNL] ORNL; Bond, Nathaniel A [ORNL] ORNL
Weaving independently generated photons into an arbitrary graph state
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.
Lin, Qing [College of Information Science and Engineering, Huaqiao University (Xiamen), Xiamen 361021 (China); He, Bing [University of California, Merced, 5200 North Lake Road, Merced, California 95343 (United States); Institute for Quantum Information Science, University of Calgary, Alberta T2N 1N4 (Canada)
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.
Qing Lin; Bing He
Generalizing GraphPlan by Formulating Planning as a CSP
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.
Adriana Lopez; Fahiem Bacchus
Groundwater Protection Guidelines for Nuclear Power Plants
The nuclear power industry has entered into a voluntary initiative to implement groundwater monitoring programs at all nuclear power plant sites. This EPRI guideline provides essential technical guidance to nuclear power utilities on the necessary elements of a sound groundwater protection program.
The nuclear power industry has undertaken a Groundwater Protection Initiative at the Direction of the NEI Nuclear Strategic Issues Advisory Committee (NSIAC). This EPRI guideline provides essential technical guidance to utilities on the necessary elements of a sound groundwater protection program.
Groundwater Remediation Strategy Using Global Optimization Algorithms
. DOI: 10.1061/ ASCE 0733-9496 2002 128:6 431 CE Database keywords: Ground water; Remedial action; Algorithms; Ground-water management. Introduction The contamination of groundwater is a widespread problem al. 1992 , Jonoski et al. 1997 ; and Willis and Yeh 1987 . However, the fact that the optimization
Neumaier, Arnold
Groundwater Monitoring Guidance for Nuclear Power Plants
Recent experience has shown that the initial design of nuclear power plant groundwater characterization programs can have a significant impact upon the resources needed to demonstrate regulatory compliance. This document provides technical experience and lessons learned in designing an optimized groundwater investigation program.
September 13, 2011 September 13, 2011 Hanford Treats Record Amount of Groundwater RICHLAND, Wash. - Workers have treated more than 800 million gallons of groundwater at the Hanford Site so far this year, a record annual amount. Last year, workers with DOE contractor CH2M HILL Plateau Remediation Company treated 600 mil- lion gallons of groundwater at the site. "It's great to know the amount of treated groundwater is increasing. We are meeting our goals, which means we are protecting the Columbia River," said Bill Barrett, CH2M HILL director of pump and treat operations and maintenance. American Recovery and Reinvestment Act work to expand Hanford's capacity for treating contami- nated groundwater led to the 2011 record amount. The Recovery Act funded the installation of more
Assessment of groundwater management at Hanford
A comprehensive review of the groundwater management and environmental monitoring programs at the Hanford reservation was initiated in 1973. A large number of recommendations made as a result of this review are summarized. The purpose of the Hanford Hydrology Program is to maintain a groundwater surveillance network to assess contamination of the natural water system. Potential groundwater contamination is primarily a function of waste management decisions. The review revealed that although the hydrology program would greatly benefit from additional improvements, it is adequate to predict levels of contaminants present in the groundwater system. Studies are presently underway to refine advanced mathematical models to use results of the hydrologic investigation in forecasting the response of the system to different long-term management decisions. No information was found which indicates that a hazard through the groundwater pathway presently exists as a result of waste operations at Hanford. (CH)
Deju, R.A.
Create reports and graphs | ENERGY STAR Buildings & Plants
Create reports and graphs Create reports and graphs Secondary menu About us Press room Contact Us Portfolio Manager Login Facility owners and managers Existing buildings Commercial new construction Industrial energy management Small business Service providers Service and product providers Verify applications for ENERGY STAR certification Design commercial buildings Energy efficiency program administrators Commercial and industrial program sponsors Associations State and local governments Federal agencies Tools and resources Training In this section Learn the benefits Get started Use Portfolio Manager The new ENERGY STAR Portfolio Manager How Portfolio Manager helps you save The benchmarking starter kit Identify your property type Enter data into Portfolio Manager The data quality checker How Portfolio Manager calculates metrics
Applying a Model Transformation Taxonomy to Graph Transformation Technology
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.
Tom Mens; Pieter Van Gorp; D�niel Varr�; Gabor Karsai
Graph Based Modeling and Implementation with EER/GRAL
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.
J. Ebert; A. Winter; P. Dahm; A. Franzke; R. S�ttenbach
Multithreaded Asynchronous Graph Traversal for In-Memory and Semi-External Memory
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 ...
Roger Pearce; Maya Gokhale; Nancy M. Amato
Graph of words embedding for molecular structure-activity relationship analysis
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 ...
Jaume Gibert; Ernest Valveny; Horst Bunke
PTAS for maximum weight independent set problem with random weights in bounded degree graphs
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 ...
Gamarnik, David
Graph-based reference table construction to facilitate entity matching
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
Fangda Wang, Hongzhi Wang, Jianzhong Li, Hong Gao
Tree/Graph Visualization CMSC 436/636
grid, transportation routes, trade, immigration Connections: relationships, causality, citations, disease transmission vectors, #12;Hierarchical and Relational Data · Conceptually a graph · Key challenges · Distortion mapping Clustering · Group nodes into clusters · Use clusters for layout · Display appropriate
Rheingans, Penny
An extension of secure group communication using key graph
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
Zhang Jun; Zhou Yu; Ma Fanyuan; Gu Dawu; Bai Yingcai
Degenerate flag varieties: moment graphs and Schr�der numbers
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
Giovanni Cerulli Irelli; Evgeny Feigin; Markus Reineke
Arbitrary Orientations Of Hamilton Cycles In Oriented Graphs
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.
Kelly, Luke
Simulation of an Electrical Substation Using the Bond Graph Technique
Simulation and especially computer simulation, is a basic tool since it enables engineers to understand how systems work without actually needing to see them. They can learn how they work in different circumstances and optimize their design with considerably ... Keywords: simulation, electrical substations, elements, electricity, bond graph
Gregorio Romero; Jesus Felez; Joaquin Maroto; Jose Manuel Mera
Global Maker-Breaker games on sparse graphs
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
Dan Hefetz; Michael Krivelevich; Tibor Szab�
A Winning Strategy for the Ramsey Graph Game
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 ...
Aleksandar Pekec
Weighted graph comparison techniques for brain connectivity analysis
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
Basak Alper; Benjamin Bach; Nathalie Henry Riche; Tobias Isenberg; Jean-Daniel Fekete
Nodal domains on graphs - How to count them and why?
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.
Ram Band; Idan Oren; Uzy Smilansky
Band, Ram; Smilansky, Uzy
An unified transition detection based on bipartite graph matching approach
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
Zenilton Kleber Gon�alves Do Patroc�nio, Jr.; Silvio Jamil F. Guimar�es; Henrique Batista Da Silva; Kleber Jacques Ferreira De Souza
Object oriented parallelisation of graph algorithms using parallel iterator
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
Lama Akeila; Oliver Sinnen; Wafaa Humadi
Efficient simulation of hybrid systems: A hybrid bond graph approach
Accurate and efficient simulations facilitate cost-effective design and analysis of large, complex, embedded systems, whose behaviors are typically hybrid, i.e. continuous behaviors interspersed with discrete mode changes. In this paper we present an ... Keywords: component-oriented modeling, dynamic causal assignment, hybrid bond graphs, modeling and simulation environments, simulation of hybrid systems
Indranil Roychoudhury; Matthew J Daigle; Gautam Biswas; Xenofon Koutsoukos
More on graph theoretic software watermarks: Implementation, analysis, and attacks
This paper presents an implementation of the watermarking method proposed by Venkatesan et al. in their paper [R. Venkatesan, V. Vazirani, S. Sinha, A graph theoretic approach to software watermarking, in: Fourth International Information Hiding Workshop, ... Keywords: Software piracy protection, Software protection, Software watermarking, Surreptitious software
Christian Collberg; Andrew Huntwork; Edward Carter; Gregg Townsend; Michael Stepp
Top-K nearest keyword search on large graphs
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 ...
Miao Qiao, Lu Qin, Hong Cheng, Jeffrey Xu Yu, Wentao Tian
MML Inference of Decision Graphs with Multi-way Joins
A decision tree is a comprehensible representation that has been widely used in many machine learning domains. But in the area of supervised learning, decision trees have their limitations. Two notable problems are those of replication and fragmentation. ... Keywords: MDL, MML, decision graphs, decision trees, machine learning, minimum message length, probabilistic prediction, supervised learning
Peter J. Tan; David L. Dowe
Using graph-based program characterization for predictive modeling
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
Eunjung Park; John Cavazos; Marco A. Alvarez
Teaching graph algorithms to children of all ages
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
J. Paul Gibson
Component supervision by sensor placement on bond-graph model
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
M. Khemliche; B. Ould Bouamama; A. Khellaf; M. Mostefa�
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).
Chang, Hang; Auer, Manfred; Parvin, Bahram
On-Line Construction of Compact Directed Acyclic Word Graphs
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 ...
Shunsuke Inenaga; Hiromasa Hoshino; Ayumi Shinohara; Masayuki Takeda; Setsuo Arikawa; Giancarlo Mauri; Giulio Pavesi
Note: A note on power domination in grid graphs
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
Michael Dorfling; Michael A. Henning
A note on power domination in grid graphs
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
Graphical and incremental type inference: a graph transformation approach
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
Silvia Clerici; Cristina Zoltan; Guillermo Prestigiacomo
Environmental implementation plan: Chapter 7, Groundwater protection
The Savannah River Site (SRS) uses large quantities of groundwater for drinking, processing, and non-contact cooling. Continued industrial and residential growth along with additional agricultural irrigation in areas adjacent to SRS will increase the demand for groundwater. This increasing demand will require a comprehensive management system to ensure the needed quality and quantity of groundwater is available for all users. The Groundwater Protection Program and the Waste Management Program establish the overall framework for protecting this resource. Ground water under SRS is monitored extensively for radiological, hazardous, and water quality constituents. Groundwater quality is known to have been affected at 33 onsite locations, but none of the contaminant plumes have migrated offsite. Onsite and offsite drinking water supplies are monitored to ensure they are not impacted. The site has more than 1800 monitoring wells from which groundwater samples are analyzed for radiological and non-radiological constituents. SRS is complying with all applicable regulations related to groundwater protection, waste treatment, and waste disposal. The existing waste storage facilities are permitted or are being permitted. Existing hazardous- and mixed-waste storage facilities are being included in the site Resource Conservation and Recovery Act (RCRA) Part B Permit. Part B permitting has been initiated for many of the planned hazardous- and mixed-waste treatment and disposal facilities.
Wells, D. [comp.
Semi-automated derivation of conceptual neighborhood graphs of topological relations
Conceptual neighborhood graphs are similarity-based schemata of spatial/temporal relations. This paper proposes a semi-automated method for deriving a conceptual neighborhood graph of topological relations, which shows all pairs of relations between ... Keywords: 9+-intersection, conceptual neighborhood graphs, conceptual neighbors, smooth transformation, topological relations
Yohei Kurata
Cleaning random d-regular graphs with brushes using a degree-greedy algorithm
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
Margaret-Ellen Messinger; Pawe? Pra?at; Richard J. Nowakowski; Nicholas Wormald
Green-Marl: a DSL for easy and efficient graph analysis
The increasing importance of graph-data based applications is fueling the need for highly efficient and parallel implementations of graph analysis software. In this paper we describe Green-Marl, a domain-specific language (DSL) whose high level language ... Keywords: domain-specific language, graph, parallel programming
Sungpack Hong; Hassan Chafi; Edic Sedlar; Kunle Olukotun
A multiobjective evolutionary programming framework for graph-based data mining
Subgraph mining is the process of identifying concepts describing interesting and repetitive subgraphs within graph-based data. The exponential number of possible subgraphs makes the problem very challenging. Existing methods apply a single-objective ... Keywords: Evolutionary multiobjective optimization, Frequent subgraph mining, Graph-based data mining, Multiobjective evolutionary programming, Multiobjective graph-based data mining, Pareto optimality
Prakash Shelokar, Arnaud Quirin, �Scar Cord�N
On perturbation theory and an algorithm for maximal clique enumeration in uncertain and noisy graphs
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
An event-based framework for characterizing the evolutionary behavior of interaction graphs
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
Sitaram Asur; Srinivasan Parthasarathy; Duygu Ucar
Shape prior model for media-adventitia border segmentation in IVUS using graph cut
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
Ehab Essa; Xianghua Xie; Igor Sazonov; Perumal Nithiarasu; Dave Smith
Exponential random graph modeling of communication networks to understand organizational crisis
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
Jafar Hamra; Shahadat Uddin; Liaquat Hossain
CLAW-FREE 3-CONNECTED P11-FREE GRAPHS ARE HAMILTONIAN TOMASZ LUCZAK AND FLORIAN PFENDER Abstract. We show that every 3-connected claw-free graph which contains no induced copy of P11 is hamiltonian. Since there ex- ist non-hamiltonian 3-connected claw-free graphs without induced copies of P12
Pfender, Florian
Distributed computation of the knn graph for large high-dimensional point sets
High-dimensional problems arising from robot motion planning, biology, data mining, and geographic information systems often require the computation of k nearest neighbor (knn) graphs. The knn graph of a data set is obtained by connecting each point ... Keywords: Approximate nearest neighbors, Distributed and parallel algorithms, Metric spaces, Nearest neighbors, Range queries, Robotics, knn graphs
Erion Plaku; Lydia E. Kavraki
The Groundwater Performance Assessment Project Quality Assurance Plan
This document provides the quality assurance guidelines that will be followed by the groundwater project.
Walker, Thomas G.
Groundwater Protection Act (Iowa) | Department of Energy
Groundwater Protection Act (Iowa) Groundwater Protection Act (Iowa) Groundwater Protection Act (Iowa) < Back Eligibility Agricultural Commercial Construction Fed. Government Fuel Distributor General Public/Consumer Industrial Installer/Contractor Institutional Investor-Owned Utility Local Government Low-Income Residential Multi-Family Residential Municipal/Public Utility Nonprofit Residential Retail Supplier Rural Electric Cooperative Schools State/Provincial Govt Systems Integrator Transportation Tribal Government Utility Savings Category Buying & Making Electricity Home Weatherization Water Alternative Fuel Vehicles Hydrogen & Fuel Cells Program Info State Iowa Program Type Environmental Regulations Provider Iowa Department of Natural Resources The Commissioner of the Iowa Department of Natural Resources is required to
Recovery Act Supports Construction of Site's Largest Groundwater Treatment
Supports Construction of Site's Largest Groundwater Supports Construction of Site's Largest Groundwater Treatment Facility Recovery Act Supports Construction of Site's Largest Groundwater Treatment Facility Construction of the largest groundwater treatment facility at the Hanford Site – a major American Recovery and Reinvestment Act project – is on schedule and more than 70 percent complete. Recovery Act workers with DOE contractor CH2M HILL Plateau Remediation Company are on pace to finish construction of the 200 West Groundwater Treatment Facility this year. Recovery Act Supports Construction of Site's Largest Groundwater Treatment Facility More Documents & Publications Hanford Treats Record Amount of Groundwater Recovery Act Invests in Cleanup, Preservation of Hanford Site Locomotives,
Groundwater: focusing on the real issue
Most studies of the welfare economics of groundwater have focused mainly on the dichotomy between optimal control of groundwater use and no control at all. This article argues that, under circumstances that generally prevail in semiarid zones, assigning property rights to groundwater and permitting the market to determine the allocation of water use can lead to a second-best solution. An argument is made that if potential users would be allowed to Coasebargain with incumbent users on the issuance of new groundwater rights, the second-best solution is elevated to a Pareto-optimal solution. This article is also a tale of two states: water law and performance in New Mexico and Arizona. 12 references, 3 figures.
Gisser, M.
The Savannah River Site's Groundwater Monitoring Program
This report summarizes the Savannah River Site (SRS) groundwater monitoring program conducted in the first quarter of 1990. It includes the analytical data, field data, well activity data, and the other documentation for this program and provides a record of the program's activities and rationale and an official document of the analytical results. The groundwater monitoring program includes the following activities: installation, maintenance, and abandonment of monitoring wells, environmental soil borings, development of the sampling and analytical schedule, collection and analyses of groundwater samples, review of the analytical data and other data, maintenance of the databases containing groundwater monitoring data and related data, quality assurance (QA) evaluations of laboratory performance, and reports of results to waste-site facility custodians and to the Environmental Protection Section (EPS) of EPD.
Demolition, Groundwater Cleanup Highlight Paducah's 2013 Accomplishmen...
boxed in a container for on-site storage at Paducah. PADUCAH, Ky. - Work to remove two aging, inactive structures and clean up a leading source of groundwater contamination marked...
Arsenic Remediation Technologies for Groundwater and Soil
In October 2003, the Electric Power Research Institute (EPRI) released report 1008881, Arsenic Remediation Technologies for Soils and Groundwater. The report provides a review of available technologies for the remediation of arsenic in soils, groundwater, and surface water, primarily at substation sites. In most cases, the technologies reviewed are applicable to a much wider range of projects. In the six years since the publication of that report, the technologies for the remediation of arsenic have cont...
Accounting for surface-groundwater interactions and their uncertainty in river and groundwater models: A case study in the Namoi River, Australia
Surface-groundwater (SW-GW) interactions constitute a critical proportion of the surface and groundwater balance especially during dry conditions. Conjunctive management of surface and groundwater requires an explicit account of the exchange flux between ... Keywords: Groundwater model, Groundwater pumping, Nonstationarity of low flows, River low flow, River model, Surface-groundwater interaction, Uncertainty analysis, eWater Source
David W. Rassam, Luk Peeters, Trevor Pickett, Ian Jolly, Linda Holz
Orientable embeddings and orientable cycle double covers of projective-planar graphs
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.
Ellingham, M N
Combinatorial Information Theoretical Measurement of the Semantic Significance of Semantic Graph Motifs
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.
Joslyn, Cliff A.; al-Saffar, Sinan; Haglin, David J.; Holder, Larry
LDRD final report : first application of geospatial semantic graphs to SAR image data.
Modeling geospatial information with semantic graphs enables search for sites of interest based on relationships between features, without requiring strong a priori models of feature shape or other intrinsic properties. Geospatial semantic graphs can be constructed from raw sensor data with suitable preprocessing to obtain a discretized representation. This report describes initial work toward extending geospatial semantic graphs to include temporal information, and initial results applying semantic graph techniques to SAR image data. We describe an efficient graph structure that includes geospatial and temporal information, which is designed to support simultaneous spatial and temporal search queries. We also report a preliminary implementation of feature recognition, semantic graph modeling, and graph search based on input SAR data. The report concludes with lessons learned and suggestions for future improvements.
Brost, Randolph C.; McLendon, William Clarence,
Evaluation of sustained release polylactate electron donors for removal of hexavalent chromium from contaminated groundwater
To evaluate the efficacy of bioimmobilization of Cr(VI) in groundwater at the Department of Energy Hanford site, we conducted a series of microcosm experiments using a range of commercial electron donors with varying degrees of lactate polymerization (polylactate). These experiments were conducted using Hanford Formation sediments (coarse sand and gravel) immersed in Hanford groundwater, which were amended with Cr(VI) and several types of lactate-based electron donors (Hydrogen Release Compound, HRC; primer-HRC, pHRC; extended release HRC) and the polylactate-cysteine form (Metal Remediation Compound, MRC). The results showed that polylactate compounds stimulated an increase in bacterial biomass and activity to a greater extent than sodium lactate when applied at equivalent carbon concentrations. At the same time, concentrations of headspace hydrogen and methane increased and correlated with changes in the microbial community structure. Enrichment of Pseudomonas spp. occurred with all lactate additions, and enrichment of sulfate-reducing Desulfosporosinus spp. occurred with almost complete sulfate reduction. The results of these experiments demonstrate that amendment with the pHRC and MRC forms result in effective removal of Cr(VI) from solution most likely by both direct (enzymatic) and indirect (microbially generated reductant) mechanisms.
Brodie, E.L.; Joyner, D. C.; Faybishenko, B.; Conrad, M. E.; Rios-Velazquez, C.; Mork, B.; Willet, A.; Koenigsberg, S.; Herman, D.; Firestone, M. K.; Hazen, T. C.; Malave, Josue; Martinez, Ramon
Stochastic kinetic models: Dynamic independence, modularity and graphs
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...
Bowsher, Clive G
Solving planning-graph by compiling it into CSP
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...
Minh Binh Do; Subbarao Kambhampati
Kids Clean Up 'Polluted' Groundwater at Festival | Department of Energy
Kids Clean Up 'Polluted' Groundwater at Festival Kids Clean Up 'Polluted' Groundwater at Festival Kids Clean Up 'Polluted' Groundwater at Festival May 30, 2013 - 12:00pm Addthis Fifth graders learn about cleaning up groundwater at the Childrenâs Water Festival. Fifth graders learn about cleaning up groundwater at the Children's Water Festival. Kids have fun cleaning up âpollutedâ groundwater at the Childrenâs Water Festival in Grand Junction, Colo. Kids have fun cleaning up "polluted" groundwater at the Children's Water Festival in Grand Junction, Colo. Fifth graders learn about cleaning up groundwater at the Children's Water Festival. Kids have fun cleaning up "polluted" groundwater at the Children's Water Festival in Grand Junction, Colo. GRAND JUNCTION, Colo. - Every spring, about 2,500 fifth graders in
Groundwater Report Goes Online, Interactive | Department of Energy
Groundwater Report Goes Online, Interactive Groundwater Report Goes Online, Interactive Groundwater Report Goes Online, Interactive September 30, 2013 - 12:00pm Addthis A screenshot of Hanford's online groundwater monitoring annual report. A screenshot of Hanford's online groundwater monitoring annual report. RICHLAND, Wash. - EM's Richland Operations Office (RL) has moved its 1,200-page annual report on groundwater monitoring to a fully online and interactive web application. The application allows users to access expert interpretation of groundwater conditions and trends for each of the Hanford site's 12 groundwater interest areas. Users can access the typical content of the paper-based report but can also explore all supporting data using an intuitive map-based interface. Groundwater monitoring is conducted to meet requirements of the DOE, U.S
Every 2-choosable graph is circular consecutive 2-choosable
, 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
Zhu, Xuding
On a base exchange game on bispanning graphs
Sequoia retains top ranking on Graph 500 for third year running
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, email@example.com 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
Unconventional Groundwater System Proves Effective in Reducing
Unconventional Groundwater System Proves Effective in Reducing Unconventional Groundwater System Proves Effective in Reducing Contamination at West Valley Demonstration Project Unconventional Groundwater System Proves Effective in Reducing Contamination at West Valley Demonstration Project July 22, 2013 - 12:00pm Addthis In the two years prior to the operation of the permeable treatment wall, pictured here, WVDP conducted extensive engineering and planning to ensure it would effectively remove strontium-90. In the two years prior to the operation of the permeable treatment wall, pictured here, WVDP conducted extensive engineering and planning to ensure it would effectively remove strontium-90. This 2009 photo shows a trenching machine, which is capable of cutting a continuous trench up to 30 feet deep and 3 feet wide. The machine was used in a pilot study to evaluate the effectiveness of zeolite placement as the trench was dug. This ensured a consistent depth and width for the zeolite placement along the entire length of the permeable treatment wall.
Demolition, Groundwater Cleanup Highlight Paducah's 2013 Accomplishments
Demolition, Groundwater Cleanup Highlight Paducah's 2013 Demolition, Groundwater Cleanup Highlight Paducah's 2013 Accomplishments Demolition, Groundwater Cleanup Highlight Paducah's 2013 Accomplishments December 24, 2013 - 12:00pm Addthis A high-reach shear removes debris from the tallest structure of the C-340 complex at Paducah. Watch a video of this work here. The 120-foot-high Metals Plant was the tallest building at the Paducah site and encompassed about 1.5 million cubic feet, the volume of a football field roughly three stories tall. Demolition debris filled 28 rail cars and was shipped offsite for disposal. A high-reach shear removes debris from the tallest structure of the C-340 complex at Paducah. Watch a video of this work here. The 120-foot-high Metals Plant was the tallest building at the Paducah site and encompassed
X-701B Groundwater Remedy Portsmouth Ohio
X-701B Groundwater Remediation X-701B Groundwater Remediation ETR Report Date: December 2008 ETR-20 United States Department of Energy Office of Environmental Management (DOE-EM) External Technical Review of the X-701B Groundwater Remedy, Portsmouth, Ohio Why DOE-EM Did This Review The Department of Energy (DOE) Portsmouth Paducah Project Office (PPPO) has responsibility for remediation of the X-701B ground water plume with the key contaminant of trichloroethene (TCE). The remedy has been divided into four phases: Phase I- Initial Source Area Treatment, Phase II-Expanded Source Area Treatment, Phase III-Evaluation and Reporting, and Phase IV- Downgradient Remediation and Confirmation of Source Area Treatment. Phase II treatment has injected
Mercury Geochemical, Groundwater Geochemical, And Radiometric Geophysical
Geochemical, Groundwater Geochemical, And Radiometric Geophysical Geochemical, Groundwater Geochemical, And Radiometric Geophysical Signatures At Three Geothermal Prospects In Northern Nevada Jump to: navigation, search GEOTHERMAL ENERGYGeothermal Home Conference Paper: Mercury Geochemical, Groundwater Geochemical, And Radiometric Geophysical Signatures At Three Geothermal Prospects In Northern Nevada Details Activities (14) Areas (3) Regions (0) Abstract: Ground water sampling, desorbed mercury soil geochemical surveys and a radiometric geophysical survey was conducted in conjunction with geological mapping at three geothermal prospects in northern Nevada. Orientation sample lines from 610 m (2000 ft.) to 4575 m (15,000 ft.) in length were surveyed at right angles to known and suspected faults. Scintillometer readings (gamma radiation - total counts / second) were also
Inefficient remediation of ground-water pollution
The problem of trying to remove ground-water pollution by pumping and treating are pointed out. Various Superfund sites are discussed briefly. It is pointed out that many chemicals have been discarded in an undocumented manner, and their place in the groundwater is not known. Results of a remedial program to remove perchloroethylene at a concentration of 6132 parts per billion from groundwater in a site in New Jersey showed that with an average extraction rate of 300 gallons per minute from 1978 to 1984 contamination level was lowered below 100 parts per billion. However, after shutdown of pumping the level rose to 12,588 parts per billion in 1988. These results lead the author to propose that the practical solutions for water supplies may be treatment at the time it enters the system for use.
Abelson, P.H.
Method to Remove Uranium/Vanadium Contamination from Groundwater
A process for removing uranium/vanadium-based contaminants from groundwater using a primary in-ground treatment media and a pretreatment media that chemically adjusts the groundwater contaminant to provide for optimum treatment by the primary treatment media.
Metzler, Donald R.; Morrison Stanley
Method to remove uranium/vanadium contamination from groundwater
Metzler, Donald R. (DeBeque, CO); Morrison, Stanley (Grand Junction, CO)
Rules and Regulations for Groundwater Quality (Rhode Island)
These regulations provide standards for groundwater quality in the state of Rhode Island. The rules are intended to protect and restore the quality of the state's groundwater resources for use as...
Graphical rule of transforming continuous-variable graph states by local homodyne detection
Graphical rule, describing that any single-mode homodyne detection turns a given continuous-variable (CV) graph state into a new one, is presented. Employing two simple graphical rules: local complement operation and vertex deletion (single quadrature-amplitude $\\hat{x}$ measurement), the graphical rule for any single-mode quadrature component measurement can be obtained. The shape of CV weighted graph state may be designed and constructed easily from a given larger graph state by applying this graphical rule.
Jing Zhang
Variable neighborhood search for extremal graphs. 22. Extending bounds for independence to upper irredundance
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
Mustapha Aouchiche; Odile Favaron; Pierre Hansen
Vapor port and groundwater sampling well
A method and apparatus have been developed for combining groundwater monitoring wells with unsaturated-zone vapor sampling ports. The apparatus allows concurrent monitoring of both the unsaturated and the saturated zone from the same well at contaminated areas. The innovative well design allows for concurrent sampling of groundwater and volatile organic compounds (VOCs) in the vadose (unsaturated) zone from a single well, saving considerable time and money. The sample tubes are banded to the outer well casing during installation of the well casing. 10 figs.
Hubbell, J.M.; Wylie, A.H.
A method and apparatus has been developed for combining groundwater monitoring wells with unsaturated-zone vapor sampling ports. The apparatus allows concurrent monitoring of both the unsaturated and the saturated zone from the same well at contaminated areas. The innovative well design allows for concurrent sampling of groundwater and volatile organic compounds (VOCs) in the vadose (unsaturated) zone from a single well, saving considerable time and money. The sample tubes are banded to the outer well casing during installation of the well casing.
Hubbell, Joel M. (Idaho Falls, ID); Wylie, Allan H. (Idaho Falls, ID)
ICDP Complex Groundwater Monitoring Plan REV 5
This Groundwater Monitoring Plan, along with the Quality Assurance Project Plan for Waste Area Groups 1, 2, 3, 4, 5, 6, 7, 10, and Removal Actions, constitutes the sampling and analysis plan for groundwater and perched water monitoring at the Idaho CERCLA Disposal Facility (ICDF). A detection monitoring system was installed in the Snake River Plan Aquifer to comply with substantive requirements of "Releases from Solid Waste Management Units" of the Resource Conservation and Recovery Act. This detection monitoring wells constructed in the Snake River Plain Aquifer.
Cahn, L. S.
Hanford Site Groundwater Monitoring for Fiscal Year 2001
This report provides information on the status of groundwater monitoring at the Hanford Site during fiscal year 2001.
Hartman, Mary J.; Morasch, Launa F.; Webber, William D.
Graph-Theoretic Analysis of Discrete-Phase-Space States for ...
Graph-Theoretic Analysis of Discrete-Phase-Space States for ... Data collected from devices and human condition may be used to forewarn of critical events such as
VLSI floorplan generation and area optimization using AND-OR graph search
Floorplan design based on rectangular dualization is considered in two phases. First, given the adjacency graph and sets of aspect ratios of the blocks, a topology is generated which is likely to yield a minimum-area floorplan during the second phase ... Keywords: AND-OR graph search, VLSI, VLSI floorplan generation, adjacency graph, area optimization, aspect ratios, bottom-up polynomial-time algorithm, circuit layout CAD, circuit optimisation, graph theory, heuristic search method, integrated circuit interconnections, minimum-area floorplan, nonslicible floorplans, optimal sizing, rectangular dualization, search effort, top-down first phase
P. S. Dasgupta; S. Sur-Kolay; B. B. Bhattacharya
ParaGraph-RTS: A parallel reduction-based run-time system
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.
Yantis, B.; Rich, D.; Michelsen, R.
Spectral dimension in graph models of causal quantum gravity
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.
Georgios Giasemidis
Groundwater Quality at Power Plants in West Virginia
As states develop groundwater regulations, utilities are increasingly being required to examine the effects of all facets of power plant operations on groundwater quality. This report summarizes the results of a four-year study of groundwater quality at 12 power plants in West Virginia.
Groundwater Impacts of Radioactive Wastes and Associated Environmental Modeling Assessment
This article provides a review of the major sources of radioactive wastes and their impacts on groundwater contamination. The review discusses the major biogeochemical processes that control the transport and fate of radionuclide contaminants in groundwater, and describe the evolution of mathematical models designed to simulate and assess the transport and transformation of radionuclides in groundwater.
Ma, Rui; Zheng, Chunmiao; Liu, Chongxuan
Improved Complexity Bound of Vertex Cover for Low degree Graph
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.
Yue, Weiya; Cao, Weiwei
Groundwater Protection Plan (West Virginia) | Department of Energy
Groundwater Protection Plan (West Virginia) Groundwater Protection Plan (West Virginia) Groundwater Protection Plan (West Virginia) < Back Eligibility Utility Fed. Government Commercial Agricultural Investor-Owned Utility State/Provincial Govt Industrial Construction Municipal/Public Utility Local Government Residential Installer/Contractor Rural Electric Cooperative Tribal Government Low-Income Residential Schools Retail Supplier Institutional Multi-Family Residential Systems Integrator Fuel Distributor Nonprofit General Public/Consumer Transportation Program Info State West Virginia Program Type Siting and Permitting Provider Department of Environmental Protection Groundwater Protection Plans (GPPs) are required for all facilities having the potential to impact groundwater. They are "preventive maintenance"
Groundwater level status report for 2009, Los Alamos National Laboratory
The status of groundwater level monitoring at Los Alamos National Laboratory in 2009 is provided in this report. This report summarizes groundwater level data for 179 monitoring wells, including 55 regional aquifer wells (including 11 regional/intermediate wells), 26 intermediate wells, 98 alluvial wells, and 12 water supply wells. Pressure transducers were installed in 161 monitoring wells for continuous monitoring of groundwater levels. Time-series hydrographs of groundwater level data are presented along with pertinent construction and location information for each well. The report also summarizes the groundwater temperatures recorded in intermediate and regional aquifer monitoring wells.
Koch, Richard J.; Schmeer, Sarah
Groundwater level status report for 2008, Los Alamos National Laboratory
The status of groundwater level monitoring at Los Alamos National Laboratory in 2008 is provided in this report. This report summarizes groundwater level data for 179 monitoring wells, including 45 regional aquifer wells, 28 intermediate wells, 8 regional/intermediate wells, 106 alluvial wells, and 12 water supply wells. Pressure transducers were installed in 166 monitoring wells for continuous monitoring of groundwater levels. Time-series hydrographs of groundwater level data are presented along with pertinent construction and location information for each well. The report also summarizes the groundwater temperatures recorded in intermediate and regional aquifer monitoring wells.
Groundwater level status report for 2010, Los Alamos National Laboratory
The status of groundwater level monitoring at Los Alamos National Laboratory in 2010 is provided in this report. This report summarizes groundwater level data for 194 monitoring wells, including 63 regional aquifer wells (including 10 regional/intermediate wells), 34 intermediate wells, 97 alluvial wells, and 12 water supply wells. Pressure transducers were installed in 162 monitoring wells for continuous monitoring of groundwater levels. Time-series hydrographs of groundwater level data are presented along with pertinent construction and location information for each well. The report also summarizes the groundwater temperatures recorded in intermediate and regional aquifer monitoring wells and seasonal responses to snowmelt runoff observed in intermediate wells.
Multithreaded Algorithms for Maximum Matching in Bipartite Graphs
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.
Azad, Md Ariful; Halappanavar, Mahantesh; Rajamanickam, Siva; Boman, Erik G.; Khan, Arif; Pothen, Alex
INDDGO: Integrated Network Decomposition & Dynamic programming for Graph Optimization
It is well-known that dynamic programming algorithms can utilize tree decompositions to provide a way to solve some \\emph{NP}-hard problems on graphs where the complexity is polynomial in the number of nodes and edges in the graph, but exponential in the width of the underlying tree decomposition. However, there has been relatively little computational work done to determine the practical utility of such dynamic programming algorithms. We have developed software to construct tree decompositions using various heuristics and have created a fast, memory-efficient dynamic programming implementation for solving maximum weighted independent set. We describe our software and the algorithms we have implemented, focusing on memory saving techniques for the dynamic programming. We compare the running time and memory usage of our implementation with other techniques for solving maximum weighted independent set, including a commercial integer programming solver and a semi-definite programming solver. Our results indicate that it is possible to solve some instances where the underlying decomposition has width much larger than suggested by the literature. For certain types of problems, our dynamic programming code runs several times faster than these other methods.
Groer, Christopher S [ORNL; Sullivan, Blair D [ORNL; Weerapurage, Dinesh P [ORNL
A tree-decomposed transfer matrix for computing exact Potts model partition functions for arbitrary graphs, with applications to planar graph colourings
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.
Andrea Bedini; Jesper Lykke Jacobsen
New Resin Improves Efficiency, Reduces Costs in Hanford Site Groundwater
The new resin was installed at the 100-DX Groundwater Treatment Facility, where it operated over one year without a single resin change. The new resin was installed at the 100-DX Groundwater Treatment Facility, where it operated over one year without a single resin change. The new resin was installed at the 100-DX Groundwater Treatment Facility, where it operated over one year without a single resin change. An operator tests the resin at a 100K Area pump-andtreat system to determine how much hexavelent chromium contamination it has gathered from the groundwater. An operator tests the resin at a 100K Area pump-andtreat system to determine how much hexavelent chromium contamination it has gathered from the groundwater. ResinTech SIR-700 is being implemented at groundwater treatment systems along the Columbia River to increase efficiency and reduce costs. ResinTech SIR-700 is being implemented at groundwater treatment systems
Hanford Groundwater Contamination Areas Shrink as EM Exceeds Cleanup Goals
Groundwater Contamination Areas Shrink as EM Exceeds Groundwater Contamination Areas Shrink as EM Exceeds Cleanup Goals Hanford Groundwater Contamination Areas Shrink as EM Exceeds Cleanup Goals June 26, 2013 - 12:00pm Addthis The 200 West Pump and Treat System is Hanfordâs largest facility for treating contaminated groundwater. The 200 West Pump and Treat System is Hanford's largest facility for treating contaminated groundwater. A graphic showing the 200 West Pump and Treat plumes and well network. A graphic showing the 200 West Pump and Treat plumes and well network. The 200 West Pump and Treat System is Hanford's largest facility for treating contaminated groundwater. A graphic showing the 200 West Pump and Treat plumes and well network. RICHLAND, Wash. - Workers supporting groundwater cleanup for EM's
LM Conducts Groundwater and Soil Investigation at Riverton, Wyoming, in
Conducts Groundwater and Soil Investigation at Riverton, Conducts Groundwater and Soil Investigation at Riverton, Wyoming, in Response to 2010 Flood LM Conducts Groundwater and Soil Investigation at Riverton, Wyoming, in Response to 2010 Flood October 16, 2012 - 10:50am Addthis LM Conducts Groundwater and Soil Investigation at Riverton, Wyoming, in Response to 2010 Flood LM Conducts Groundwater and Soil Investigation at Riverton, Wyoming, in Response to 2010 Flood LM Conducts Groundwater and Soil Investigation at Riverton, Wyoming, in Response to 2010 Flood LM Conducts Groundwater and Soil Investigation at Riverton, Wyoming, in Response to 2010 Flood What does this project do? Goal 1. Protect human health and the environment A team representing two Federal agencies-U.S. Department of Energy (DOE) Office of Legacy Management and U.S. Geological Survey-is evaluating
Report Goes Online, Interactive Report Goes Online, Interactive Groundwater Report Goes Online, Interactive September 30, 2013 - 12:00pm Addthis A screenshot of Hanford's online groundwater monitoring annual report. A screenshot of Hanford's online groundwater monitoring annual report. RICHLAND, Wash. - EM's Richland Operations Office (RL) has moved its 1,200-page annual report on groundwater monitoring to a fully online and interactive web application. The application allows users to access expert interpretation of groundwater conditions and trends for each of the Hanford site's 12 groundwater interest areas. Users can access the typical content of the paper-based report but can also explore all supporting data using an intuitive map-based interface. Groundwater monitoring is conducted to meet requirements of the DOE, U.S
Solving planning-graph by compiling it into CSP Minh Binh Do & Subbarao Kambhampati
Solving planning-graph by compiling it into CSP Minh Binh Do & Subbarao Kambhampati Department to adapt CSP search techniques into the backward search phase of Graphplan. This paper describes GP-CSP, a system that does planning by automati- cally converting Graphplan's planning graph into a CSP encoding
Kambhampati, Subbarao
Fast solution of NP-hard coloring problems on large random graphs
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.
Bedini, Andrea
A Study of Tabu Search for Coloring Random 3-Colorable Graphs Around the Phase Transition
The authors present an experimental investigation of tabu search (TS) to solve the 3-coloring problem (3-COL). Computational results reveal that a basic TS algorithm is able to find proper 3-colorings for random 3-colorable graphs with up to 11000 vertices ... Keywords: 3-Coloring, Phase Transitions, Random Graphs, TS Algorithm, Tabu Search
Jin-Kao Hao; Jean-Philippe Hamiez; Fred W. Glover
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
Slatton, Clint
The Web Graph: an Overview Jean-Loup Guillaume and Matthieu Latapy
The Web Graph: an Overview Jean-Loup Guillaume and Matthieu Latapy LIAFA - Universit´e Paris 7, 2 Chesnay. firstname.lastname@example.com 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
Answering natural language queries over linked data graphs: a distributional semantics approach
This paper demonstrates Treo, a natural language query mechanism for Linked Data graphs. The approach uses a distributional semantic vector space model to semantically match user query terms with data, supporting vocabulary-independent (or ... Keywords: distributional-compositional semantics, knowledge graphs, natural language queries, schema-agnostic queries, semantic search
Andr� Freitas; Fabr�cio F. de Faria; Se�n O'Riain; Edward Curry
Energy of a graph is never an odd integer R. B. Bapat
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
Bapat, Ravindra B.
Facet defining inequalities among graph invariants: The system GraPHedron
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
Hadrien M�lot
A New Conceptual Graph Generated Algorithm for Semi-structured Databases
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 ...
Kam-Fai Wong; Yat Fan Su; Dongqing Yang; Shiwei Tang
L(2, 1)-Labeling of Oriented Planar Graphs T. Calamoneria,1,, B. Sinaimeria,1,
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
Calamoneri, Tiziana
Bond Graph Model of a Vertical U-Tube Steam Condenser Coupled with a Heat Exchanger
Bond Graph Model of a Vertical U-Tube Steam Condenser Coupled with a Heat Exchanger K. Medjaher1+ A and thus the bottom well acts as a heat exchanger. The storage of hydraulic and thermal energies steam condenser; Heat exchanger; Bond graph 1. Introduction Modern process engineering plants
Folksonomy link prediction based on a tripartite graph for tag recommendation
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
Majdi Rawashdeh; Heung-Nam Kim; Jihad Mohamad Alja'Am; Abdulmotaleb Saddik
A Space-Filling Visualization Technique for Multivariate Small World Graphs
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.
Wong, Pak C.; Foote, Harlan P.; Mackey, Patrick S.; Chin, George; Huang, Zhenyu; Thomas, James J.
True costs of cheap labor are hard to measure: edge deletion and VCG payments in graphs
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
Edith Elkind
Regular Article: On the Spectra of Certain Graphs Arising from Finite Fields
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 ...
Nancy Tufts Allen
Parallel Graph Transformation for Model Simulation applied to Timed Transition Petri Nets
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
J. de Lara; C. Ermel; G. Taentzer; K. Ehrig
The graph representation approach to topological field theory in 2 + 1 dimensions
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.
Martin, S.P.
A Methodology for Finding Invariants of Motion for Asymmetric Systems with Gauge-Transformed Umbra Lagrangian Generated by Bond Graphs
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
Amalendu Mukherjee; Vikas Rastogi; Anirvan Dasgupta
Linking SARAH and MadGraph using the UFO format
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.
Staub, Florian
Groundwater Monitoring at NETL-Albany
About NETL About NETL Groundwater Monitoring at NETL-Albany GEO Probe Ground Water Testing Program NETL is committed to the safety and health of its employees and of nearby residents and to protecting the environment. As part of a DOE environmental protection program, NETL initiated a ground water monitoring program in 2001 with the Oregon Department of Environmental Quality (DEQ) to evaluate the groundwater flowing beneath the Albany, OR facility. Ground water monitoring wells were installed at that time, and periodic samples were taken. In March 2005, a newly-installed monitoring well on NETL's property indicated elevated ground water levels of a chemical commonly used as a degreaser or solvent until the late 1970's, trichloroethene (TCE). TCE is of concern because prolonged exposure may cause health problems, and it has been identified as a probable human carcinogen (cancer-causing substance).
81006 81006 WILLOWSTICK TECHNOLOGIES LLC.: ELECTROMAGNETIC GROUNDWATER SURVEY: A demonstration of an Electromagnetic Groundwater Survey to Identify Flowpaths of Injected Water in the Shannon Sandstone, Naval Petroleum Reserve No. 3, Teapot Dome Field, Wyoming Final Report for the Period of July 26 - November 1, 2005 Date Completed: May 19, 2006 By Brian Black Prepared for the United States Department of Energy Office of Fossil Energy Work performed under Rocky Mountain Oilfield Testing Center (RMOTC) CRADA 2005-060 This document may contain protected CRADA information produced under CRADA no. 2005-060 and is not to be further disclosed for a period of 5 years from the date it was produced except as expressly provided for in the CRADA
Modular, multi-level groundwater sampler
Apparatus for taking a multiple of samples of groundwater or pressure measurements from a well simultaneously. The apparatus comprises a series of chambers arranged in an axial array, each of which is dimensioned to fit into a perforated well casing and leave a small gap between the well casing and the exterior of the chamber. Seals at each end of the container define the limits to the axial portion of the well to be sampled. A submersible pump in each chamber pumps the groundwater that passes through the well casing perforations into the gap from the gap to the surface for analysis. The power lines and hoses for the chambers farther down the array pass through each chamber above them in the array. The seals are solid, water-proof, non-reactive, resilient disks supported to engage the inside surface of the well casing. Because of the modular design, the apparatus provides flexibility for use in a variety of well configurations.
Nichols, Ralph L. (812 Plantation Point Dr., N. Augusta, SC 29841); Widdowson, Mark A. (4204 Havana Ct., Columbia, SC 29206); Mullinex, Harry (10 Cardross La., Columbia, SC 29209); Orne, William H. (12 Martha Ct., Sumter, SC 29150); Looney, Brian B. (1135 Ridgemont Dr., Aiken, SC 29803)
Complexity of Groundwater Contaminants at DOE Sites
The U.S. Department of Energy (DOE) is responsible for the remediation and long-term stewardship of one of the world's largest groundwater contamination portfolios, with a significant number of plumes containing various contaminants, and considerable total mass and activity. As of 1999, the DOE's Office of Environmental Management was responsible for remediation, waste management, or nuclear materials and facility stabilization at 144 sites in 31 states and one U.S. territory, out of which 109 sites were expected to require long-term stewardship. Currently, 19 DOE sites are on the National Priority List. The total number of contaminated plumes on DOE lands is estimated to be 10,000. However, a significant number of DOE sites have not yet been fully characterized. The most prevalent contaminated media are groundwater and soil, although contaminated sediment, sludge, and surface water also are present. Groundwater, soil, and sediment contamination are present at 72% of all DOE sites. A proper characterization of the contaminant inventory at DOE sites is critical for accomplishing one of the primary DOE missions -- planning basic research to understand the complex physical, chemical, and biological properties of contaminated sites. Note that the definitions of the terms 'site' and 'facility' may differ from one publication to another. In this report, the terms 'site,' 'facility' or 'installation' are used to identify a contiguous land area within the borders of a property, which may contain more than one plume. The term 'plume' is used here to indicate an individual area of contamination, which can be small or large. Even though several publications and databases contain information on groundwater contamination and remediation technologies, no statistical analyses of the contaminant inventory at DOE sites has been prepared since the 1992 report by Riley and Zachara. The DOE Groundwater Data Base (GWD) presents data as of 2003 for 221 groundwater plumes at 60 DOE sites and facilities. Note that Riley and Zachara analyzed the data from only 18 sites/facilities including 91 plumes. In this paper, we present the results of statistical analyses of the data in the GWD as guidance for planning future basic and applied research of groundwater contaminants within the DOE complex. Our analyses include the evaluation of a frequency and ranking of specific contaminants and contaminant groups, contaminant concentrations/activities and total contaminant masses and activities. We also compared the results from analyses of the GWD with those from the 1992 report by Riley and Zachara. The difference between our results and those summarized in the 1992 report by Riley and Zachara could be caused by not only additional releases, but also by the use of modern site characterization methods, which more accurately reveal the extent of groundwater contamination. Contaminated sites within the DOE complex are located in all major geographic regions of the United States, with highly variable geologic, hydrogeologic, soil, and climatic conditions. We assume that the information from the 60 DOE sites included in the GWD are representative for the whole DOE complex. These 60 sites include the major DOE sites and facilities, such as Rocky Flats Environmental Technology Site, Colorado; Idaho National Laboratory, Idaho; Savannah River Site, South Carolina; Oak Ridge Reservation, Tennessee; and Hanford Reservation, Washington. These five sites alone ccount for 71% of the value of the remediation work.
Hazen, T.C.; Faybishenko, B.; Jordan, P.
Graph fusion algebras of WLM(p,p')
We consider the W-extended logarithmic minimal model WLM(p,p'). As in the rational minimal models, the so-called fundamental fusion algebra of WLM(p,p') is described by a simple graph fusion algebra. The fusion matrices in the regular representation thereof are mutually commuting, but in general not diagonalizable. Nevertheless, we show that they can be brought simultaneously to block-diagonal forms whose blocks are upper-triangular matrices of dimension 1, 3, 5 or 9. The directed graphs associated with the two fundamental modules are described in detail. The corresponding adjacency matrices share a complete set of common generalized eigenvectors organized as a web constructed by interlacing the Jordan chains of the two matrices. This web is here called a Jordan web and it consists of connected subwebs with 1, 3, 5 or 9 generalized eigenvectors. The similarity matrix, formed by concatenating these vectors, simultaneously brings the two fundamental adjacency matrices to Jordan canonical form modulo permutation similarity. The ranks of the participating Jordan blocks are 1 or 3, and the corresponding eigenvalues are given by 2cos(j\\pi/n) where j=0,...,n and n=p,p'. For p>1, only some of the modules in the fundamental fusion algebra of WLM(p,p') are associated with boundary conditions within our lattice approach. The regular representation of the corresponding fusion subalgebra has features similar to the ones in the regular representation of the fundamental fusion algebra, but with dimensions of the upper-triangular blocks and connected Jordan-web components given by 1, 2, 3 or 8. Some of the key results are illustrated for W-extended critical percolation WLM(2,3).
Jorgen Rasmussen
Groundwater protection EIS: Existing environment: Savannah River
Per Groundwater Protection EIS commitments, a baseline of surface water hydrology and chemistry of each onsite stream is needed to define the existing environment of each watershed so that environmental impacts associated with the various waste site closure options can be assessed. This report summarizes the existing water quality of the Savannah River; lists the various waste sites encompassing this watershed; and summarizes the availability of surface water and floodplain sediment monitoring data, both radiochemical and physiochemical, collected from this watershed.
Stejskal, G.F.
Oak Ridge EM Program Collaborates with Regulators on Groundwater Strategy |
Collaborates with Regulators on Groundwater Collaborates with Regulators on Groundwater Strategy Oak Ridge EM Program Collaborates with Regulators on Groundwater Strategy June 26, 2013 - 12:00pm Addthis EM uses data collected at monitoring wells to determine groundwater migration patterns and potential risks. EM uses data collected at monitoring wells to determine groundwater migration patterns and potential risks. OAK RIDGE, Tenn. - The Oak Ridge EM program has joined state and federal regulators in a series of workshops to address contaminated groundwater on the Oak Ridge Reservation. The U.S. Environmental Protection Agency and Tennessee Department of Environment and Conservation are working with Oak Ridge's EM program and other organizations interested in the site's environmental cleanup and quality. Those entities include URS | CH2M Oak Ridge, Oak Ridge's prime
Oak Ridge Removes Laboratory's Greatest Source of Groundwater
Oak Ridge Removes Laboratory's Greatest Source of Groundwater Oak Ridge Removes Laboratory's Greatest Source of Groundwater Contamination Oak Ridge Removes Laboratory's Greatest Source of Groundwater Contamination May 1, 2012 - 12:00pm Addthis Workers remove the 4,000-gallon Tank W-1A, which was ORNLâs greatest source of groundwater contamination. Workers remove the 4,000-gallon Tank W-1A, which was ORNL's greatest source of groundwater contamination. Workers load boxes containing contaminated soil that surrounded Tank W-1A. Workers load boxes containing contaminated soil that surrounded Tank W-1A. The 6,500-pound Tank W-1A is shipped away from ORNL. The 6,500-pound Tank W-1A is shipped away from ORNL. Workers remove the 4,000-gallon Tank W-1A, which was ORNL's greatest source of groundwater contamination. Workers load boxes containing contaminated soil that surrounded Tank W-1A.
Guidelines for the Protection of Surface and Groundwater Resources During
Guidelines for the Protection of Surface and Groundwater Resources During Guidelines for the Protection of Surface and Groundwater Resources During Exploration Drilling Jump to: navigation, search OpenEI Reference LibraryAdd to library Report: Guidelines for the Protection of Surface and Groundwater Resources During Exploration Drilling Author Government of Western Australia Organization Department of Mines and Petroleum Published N/A, 2002 DOI Not Provided Check for DOI availability: http://crossref.org Online Internet link for Guidelines for the Protection of Surface and Groundwater Resources During Exploration Drilling Citation Government of Western Australia (Department of Mines and Petroleum). 2002. Guidelines for the Protection of Surface and Groundwater Resources During Exploration Drilling. N\A: N/A. Retrieved from "http://en.openei.org/w/index.php?title=Guidelines_for_the_Protection_of_Surface_and_Groundwater_Resources_During_Exploration_Drilling&oldid=686528"
New Resin Brings Efficiencies to Groundwater Treatment along Columbia River
Resin Brings Efficiencies to Groundwater Treatment along Resin Brings Efficiencies to Groundwater Treatment along Columbia River at Hanford Site New Resin Brings Efficiencies to Groundwater Treatment along Columbia River at Hanford Site June 1, 2012 - 12:00pm Addthis Dean Neshem, a pump-and-treat operations and maintenance engineer, observes operations at one of the Hanford site's five groundwater treatment facilities. Based on technical recommendations from DOE, CH2M HILL engineers tested and compared multiple resins to determine the products capable of removing contaminants from the groundwater. Dean Neshem, a pump-and-treat operations and maintenance engineer, observes operations at one of the Hanford site's five groundwater treatment facilities. Based on technical recommendations from DOE, CH2M HILL engineers tested and compared multiple resins to determine the products
Oak Ridge EM Program Collaborates with Regulators on Groundwater Oak Ridge EM Program Collaborates with Regulators on Groundwater Strategy Oak Ridge EM Program Collaborates with Regulators on Groundwater Strategy June 26, 2013 - 12:00pm Addthis EM uses data collected at monitoring wells to determine groundwater migration patterns and potential risks. EM uses data collected at monitoring wells to determine groundwater migration patterns and potential risks. OAK RIDGE, Tenn. - The Oak Ridge EM program has joined state and federal regulators in a series of workshops to address contaminated groundwater on the Oak Ridge Reservation. The U.S. Environmental Protection Agency and Tennessee Department of Environment and Conservation are working with Oak Ridge's EM program and other organizations interested in the site's environmental cleanup and
News Release: DOE to Conduct Additional Groundwater Tests at Riverton
to Conduct Additional Groundwater Tests at to Conduct Additional Groundwater Tests at Riverton UMTRCA Site News Release: DOE to Conduct Additional Groundwater Tests at Riverton UMTRCA Site July 30, 2012 - 11:08am Addthis News Contact: Contractor, Judy Miller, S.M. Stoller Corporation Public Affairs (970) 248-6363 firstname.lastname@example.com Tests will indicate progress of current groundwater remediation strategy The U.S. Department of Energy will conduct additional characterization work at the Riverton, WY, Uranium Mill Tailings Radiation Control Act (UMTRCA) Site this summer, including extensive groundwater and soil sampling. The Department will use the sampling results to update the site conceptual model and to develop a revised groundwater flow and transport model to more accurately simulate natural flushing processes.
Least-Cost Groundwater Remediation Using Uncertain Hydrogeological Information
The design of groundwater remediation pump-and-treat well networks under aquifer parameter measurement uncertainty can be addressed using an optimal-design strategy based upon the concept of robust optimization. The robust-optimization approach allows for the admission of design alternatives that do not satisfy all design constraints. However in the selection process the algorithm penalizes such selections based upon the number of constraints violated. The result is a design which balances the importance of reliability with overall project cost. The robust-optimization method has been applied to the problem of groundwater plume containment and risk-based groundwater remediation design. Designs dedicated to groundwater-plume containment assure that the contaminant plume will not extend beyond a prespecified perimeter. Inwardly directed groundwater velocity must be achieved along this perimeter. The outer-approximation optimization technique in combination with a groundwater flow model ( PTC) is used to solve this optimal-design problem.
George F. Pinder; Karen Ricciardi; George P. Karatzas
Modeling the effects of atmospheric emissions on groundwater composition
A composite model of atmospheric, unsaturated and groundwater transport is developed to evaluate the processes determining the distribution of atmospherically derived contaminants in groundwater systems and to test the sensitivity of simulated contaminant concentrations to input parameters and model linkages. One application is to screen specific atmospheric emissions for their potential in determining groundwater age. Temporal changes in atmospheric emissions could provide a recognizable pattern in the groundwater system. The model also provides a way for quantifying the significance of uncertainties in the tracer source term and transport parameters on the contaminant distribution in the groundwater system, an essential step in using the distribution of contaminants from local, point source atmospheric emissions to examine conceptual models of groundwater flow and transport.
Brown, T.J.
A framework for graph-based synthesis, analysis, and visualization of HPC cluster job data.
The monitoring and system analysis of high performance computing (HPC) clusters is of increasing importance to the HPC community. Analysis of HPC job data can be used to characterize system usage and diagnose and examine failure modes and their effects. This analysis is not straightforward, however, due to the complex relationships that exist between jobs. These relationships are based on a number of factors, including shared compute nodes between jobs, proximity of jobs in time, etc. Graph-based techniques represent an approach that is particularly well suited to this problem, and provide an effective technique for discovering important relationships in job queuing and execution data. The efficacy of these techniques is rooted in the use of a semantic graph as a knowledge representation tool. In a semantic graph job data, represented in a combination of numerical and textual forms, can be flexibly processed into edges, with corresponding weights, expressing relationships between jobs, nodes, users, and other relevant entities. This graph-based representation permits formal manipulation by a number of analysis algorithms. This report presents a methodology and software implementation that leverages semantic graph-based techniques for the system-level monitoring and analysis of HPC clusters based on job queuing and execution data. Ontology development and graph synthesis is discussed with respect to the domain of HPC job data. The framework developed automates the synthesis of graphs from a database of job information. It also provides a front end, enabling visualization of the synthesized graphs. Additionally, an analysis engine is incorporated that provides performance analysis, graph-based clustering, and failure prediction capabilities for HPC systems.
Mayo, Jackson R.; Kegelmeyer, W. Philip, Jr.; Wong, Matthew H.; Pebay, Philippe Pierre; Gentile, Ann C.; Thompson, David C.; Roe, Diana C.; De Sapio, Vincent; Brandt, James M.
Groundwater Protection Guidelines for Nuclear Power Plants: Revision 1
The United States nuclear power industry has undertaken a Groundwater Protection Initiative [NEI 07-07] at the direction of the Nuclear Energy Institute (NEI) Nuclear Strategic Issues Advisory Committee (NSIAC). International nuclear power plants implement groundwater protection programs to ensure appropriate management of on-site groundwater and protection of the public and environment. This Electric Power Research Institute (EPRI) guideline provides essential technical guidance to utilities on the ...
Hanford Site Groundwater Monitoring for Fiscal Year 2006
This report presents the results of groundwater monitoring for FY 2006 on DOE's Hanford Site. Results of groundwater remediation, vadose zone monitoring, and characterization are summarized. DOE monitors groundwater at the Hanford Site to fulfill a variety of state and federal regulations, including the Atomic Energy Act (AEA), the Resource Conservation and Recovery Act (RCRA), the Comprehensive Environmental Response, Compensation, and Liability Act (CERCLA), and Washington Administrative Code (WAC).
Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs
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.
Maw-shang Chang
Groundwater Protection Group (GPG), Brookhaven National Laboratory, BNL
EPD Home EPD Home Site Details GPG Home Groundwater Projects Surface Projects Land Use & Institutional Controls Mapping Administrative Record Contacts Reports Other Information Reactor Projects (HFBR & BGRR) Groundwater Protection Group The Groundwater Protection Group (formerly know as the Long Term Response Action (LTRA) Group) was formed in 2004 as part of the Environmental Protection Division. The GPG Group is responsible for the long-term surveillance, monitoring, maintenance, operating, reporting, and community involvement activities required to complete the CERCLA environmental cleanup activities at Brookhaven National Laboratory. Ongoing Projects: g-2 Record of Decision Groundwater Projects Surface Projects Land Use and Institutional Control Five Year Review
Nebraska Groundwater Management and Protection Act (Nebraska) | Department
Nebraska Groundwater Management and Protection Act (Nebraska) Nebraska Groundwater Management and Protection Act (Nebraska) Nebraska Groundwater Management and Protection Act (Nebraska) < Back Eligibility Agricultural Commercial Construction Fed. Government Fuel Distributor General Public/Consumer Industrial Installer/Contractor Institutional Investor-Owned Utility Local Government Low-Income Residential Multi-Family Residential Municipal/Public Utility Nonprofit Residential Retail Supplier Rural Electric Cooperative Schools State/Provincial Govt Systems Integrator Transportation Tribal Government Utility Program Info State Nebraska Program Type Siting and Permitting Provider Natural Resources This section defines broad policy goals concerning the utilization and management of groundwater, and encourages local implementation of these
Georgia Groundwater Use Act (Georgia) | Department of Energy
Groundwater Use Act (Georgia) Groundwater Use Act (Georgia) Georgia Groundwater Use Act (Georgia) < Back Eligibility Agricultural Commercial Construction Developer Fed. Government Fuel Distributor General Public/Consumer Industrial Installer/Contractor Institutional Investor-Owned Utility Local Government Low-Income Residential Multi-Family Residential Municipal/Public Utility Nonprofit Residential Retail Supplier Rural Electric Cooperative Schools State/Provincial Govt Systems Integrator Transportation Tribal Government Utility Savings Category Alternative Fuel Vehicles Hydrogen & Fuel Cells Buying & Making Electricity Water Home Weatherization Solar Wind Program Info State Georgia Program Type Environmental Regulations Siting and Permitting Provider Georgia Department of Natural Resources The purpose of the Georgia Groundwater Use Act is to establish procedures
1997 Comprehensive TNX Area Annual Groundwater and Effectiveness Monitoring Report
Shallow groundwater beneath the TNX Area at the Savannah River Site (SRS) has been contaminated with chlorinated volatile organic compounds (CVOCs) such as trichloroethylene (TCE) and carbon tetrachloride. In November 1994, an Interim Record of Decision (IROD) was agreed to and signed by the U. S. Department of Energy (DOE), the Environmental Protection Agency (EPA), and the South Carolina Department of Health {ampersand} Environmental Control (SCDHEC). The Interim Record of Decision requires the installation of a hybrid groundwater corrective action (HGCA) to stabilize the plume of groundwater contamination and remove CVOCs dissolved in the groundwater. The hybrid groundwater corrective action included a recovery well network, purge water management facility, air stripper, and an airlift recirculation well. The recirculation well was dropped pursuant to a test that indicated it to be ineffective at the TNX Area. Consequently, the groundwater corrective action was changed from a hybrid to a single action, pump-and-treat approach. The Interim Action (IA) T-1 air stripper system began operation on September 16, 1996. a comprehensive groundwater monitoring program was initiated to measure the effectiveness of the system. As of December 31, 1997, the system has treated 32 million gallons of contaminated groundwater removed 32 pounds of TCE. The recovery well network created a `capture zone` that stabilized the plume of contaminated groundwater.
Chase, J.
LM Conducts Groundwater and Soil Investigation at Riverton, Wyoming...
2013 Waste Management Conference. Addthis Related Articles DOE Releases Data Summary Report for Groundwater and Soil Tests Conducted at the Riverton UMTRCA Site News Release: DOE...
Guidelines for the Protection of Surface and Groundwater Resources...
NA, 2002 DOI Not Provided Check for DOI availability: http:crossref.org Online Internet link for Guidelines for the Protection of Surface and Groundwater Resources During...
EA-1331: Remediation of Subsurface and Groundwater Contamination...
Remediation of Subsurface and Groundwater Contamination at the Rock Springs in situ Oil Shale Retort Site, Sweetwater County, Wyoming EA-1331: Remediation of Subsurface and...
Treatment Resin Reduces Costs, Materials in Hanford Groundwater...
Treatment Resin Reduces Costs, Materials in Hanford Groundwater Cleanup - Efficiency delivered more than 6 million in cost savings, 3 million in annual savings Treatment Resin...
Groundwater Age-Dating for Water Resource Characterization
The LLNL Groundwater Noble Gas Mass Spectrometry Facility and Capability offers: Less model-dependent than tritium age dating: Traditional tritium age ...
Y-12 Groundwater Protection Program Groundwater And Surface Water Sampling And Analysis Plan For Calendar Year 2014
This plan provides a description of the groundwater and surface water quality monitoring activities planned for calendar year (CY) 2014 at the U.S. Department of Energy (DOE) Y-12 National Security Complex (Y-12) that will be managed by the Y-12 Groundwater Protection Program (GWPP). Groundwater and surface water monitoring is performed by the GWPP during CY 2014 to achieve the following goals: to protect the worker, the public, and the environment; to maintain surveillance of existing and potential groundwater contamination sources; to provide for the early detection of groundwater contamination and determine the quality of groundwater and surface water where contaminants are most likely to migrate beyond the Oak Ridge Reservation property line; to identify and characterize long-term trends in groundwater quality at Y-12; and to provide data to support decisions concerning the management and protection of groundwater resources. Groundwater and surface water monitoring will be performed in three hydrogeologic regimes at Y-12.
The groundwater modeling tool for GRASS (GMTG): Open source groundwater flow modeling
Geographic Information Systems (GIS) are used to store, manipulate and visualize both spatial and non-spatial data. Because of their data manipulating capabilities, GIS have been linked to different simulation models in different research areas and are ... Keywords: GRASS, Geographic Information Systems, Groundwater modeling, MODFLOW
J. J. Carrera-Hern�ndez; S. J. Gaskin
Proceedings: 2005 EPRI Topical Workshop-Groundwater Contamination Assessment and License Termination Activities
The EPRI Groundwater Workshop focused on the subject of groundwater monitoring related to both operating and decommissioning nuclear plant sites. Groundwater monitoring can have an impact in terms of the time and resources needed to quantify the groundwater contamination and to assure the maintenance of public health and safety. EPRI held this workshop to aid nuclear plant operators in developing robust groundwater monitoring programs. The Workshop presented the latest information on groundwater assessme...
Uses of c-graphs in a prototype for automatic translation
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.) ...
Marco A. Clemente-Salazar
Graph-Based Software Design for Managing Complexity and Enabling Concurrency in Multiphysics PDE Software
Multiphysics simulation software is plagued by complexity stemming from nonlinearly coupled systems of Partial Differential Equations (PDEs). Such software typically supports many models, which may require different transport equations, constitutive ... Keywords: Scientific computing, multiphysics, object-oriented design, task graph
Patrick K. Notz; Roger P. Pawlowski; James C. Sutherland
Storage device sizing for a hybrid railway traction system by means of bicausal bond graphs
(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
Tracing the birth of an osn: Social graph and profile analysis in google
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.
Doris Schi�berg; Fabian Schneider; Harald Schi�berg; Stefan Schmid; Steve Uhlig; Anja Feldmann; Tu Berlin; Telekom Innovation Laboratories
Enhanced modeling : real-time simulation and modeling of graph based problems on interactive workbenches
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 ...
Chak, Daniel, 1980-
Delay of Social Search on Small-world Graphs Hazer Inaltekin a, Mung Chiang b
Delay of Social Search on Small-world Graphs Hazer Inaltekin a, Mung Chiang b H. Vincent Poor b a: email@example.com (Hazer Inaltekin ), email@example.com (Mung Chiang), firstname.lastname@example.com (H
Chiang, Mung
Robust on-line computation of Reeb graphs: simplicity and speed
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 ...
Valerio Pascucci; Giorgio Scorzelli; Peer-Timo Bremer; Ajith Mascarenhas
Source templates for the automatic generation of adjoint code through static call graph reversal
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 ...
Uwe Naumann; Jean Utke
A graph grammar based approach to automated multi-objective analog circuit design
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 ...
Angan Das; Ranga Vemuri
Groundwater Quality Standards (Nebraska) | Department of Energy
Quality Standards (Nebraska) Quality Standards (Nebraska) Groundwater Quality Standards (Nebraska) < Back Eligibility Agricultural Commercial Construction Fed. Government Fuel Distributor General Public/Consumer Industrial Installer/Contractor Institutional Investor-Owned Utility Local Government Low-Income Residential Multi-Family Residential Municipal/Public Utility Nonprofit Residential Retail Supplier Rural Electric Cooperative Schools State/Provincial Govt Systems Integrator Transportation Tribal Government Utility Savings Category Alternative Fuel Vehicles Hydrogen & Fuel Cells Buying & Making Electricity Water Home Weatherization Solar Wind Program Info State Nebraska Program Type Environmental Regulations Provider Environmental Quality These regulations, promulgated by the Department of Environmental Quality,
Y-12 Groundwater Protection Program Groundwater Monitoring Data Compendium, Revision 1
This document is a compendium of water quality and hydrologic characterization data obtained through December 2005 from the network of groundwater monitoring wells and surface water sampling stations (including springs and building sumps) at the U.S. Department of Energy (DOE) Y-12 National Security Complex (Y-12) in Oak Ridge, Tennessee that have been sampled since January 2003. The primary objectives of this document, hereafter referenced as the Y-12 Groundwater Protection Program (GWPP) Compendium, are to: (1) Serve as a single-source reference for monitoring data that meet the requirements of the Y-12 GWPP, as defined in the Y-12 GWPP Management Plan (BWXT Y-12 L.L.C. [BWXT] 2004); (2) Maintain a detailed analysis and evaluation of the monitoring data for each applicable well, spring, and surface water sampling station, with a focus on results for the primary inorganic, organic, and radiological contaminants in groundwater and surface water at Y-12; and (3) Ensure retention of ''institutional knowledge'' obtained over the long-term (>20-year) history of groundwater and surface water monitoring at Y-12 and the related sources of groundwater and surface water contamination. To achieve these goals, the Y-12 GWPP Compendium brings together salient hydrologic, geologic, geochemical, water-quality, and environmental compliance information that is otherwise disseminated throughout numerous technical documents and reports prepared in support of completed and ongoing environmental contamination assessment, remediation, and monitoring activities performed at Y-12. The following subsections provide background information regarding the overall scope and format of the Y-12 GWPP Compendium and the planned approach for distribution and revision (i.e., administration) of this ''living'' document.
EA-1155: Ground-water Compliance Activities at the Uranium Mill...
5: Ground-water Compliance Activities at the Uranium Mill Tailings Site, Spook, Wyoming EA-1155: Ground-water Compliance Activities at the Uranium Mill Tailings Site, Spook,...
Composition, stability, and measurement of reduced uranium phases for groundwater bioremediation at Old Rifle, CO
subsurface bioreduction in a uranium-contaminated aquifer.and measurement of reduced uranium phases for groundwaterGeobacter species to remove uranium from the groundwater of
Campbell, K.M.
P.: On stability of Hamilton-connectedness under the 2-closure in claw-free graphs
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
Zden?k Ryj�?ek; Petr Vr�na
In-situ remediation system for groundwater and soils
The present invention relates to a system for in-situ remediation of contaminated groundwater and soil. In particular the present invention relates to stabilizing toxic metals in groundwater and soil. The United States Government has rights in this invention pursuant to Contract No. DE-AC09-89SR18035 between the US Department of Energy and Westinghouse Savannah River Company.
Corey, J.C.; Kaback, D.S.; Looney, B.B.
Groundwater and Soil Remediation Guidelines for Nuclear Power Plants
The Electric Power Research Institute (EPRI) Groundwater and Soil Remediation Guidelines provides the nuclear power industry with technical guidance for evaluating the need for and timing of remediation of soil and/or groundwater contamination from onsite leaks, spills, or inadvertent releases to a) prevent migration of licensed material off-site and b) minimize decommissioning impacts.
Groundwater and Leachate Monitoring and Sampling at ERDF, CY 2009
This document reports the findings of the groundwater and leachate monitoring and sampling at the Environmental restoration Disposal Facility for calendar year 2009. The purpose of this annual monitoring report is to evaluate the conditions of and identify trends for groundwater beneath the ERDF and report leachate results in fulfillment of the requirements specified in the ERDF ROD and the ERDF Amended ROD.
R.L. Weiss, B.L. Lawrence, D.W. Woolery
An apparatus is described for taking a multiple of samples of groundwater or pressure measurements from a well simultaneously. The apparatus comprises a series of chambers arranged in an axial array, each of which is dimensioned to fit into a perforated well casing and leave a small gap between the well casing and the exterior of the chamber. Seals at each end of the container define the limits to the axial portion of the well to be sampled. A submersible pump in each chamber pumps the groundwater that passes through the well casing perforations into the gap from the gap to the surface for analysis. The power lines and hoses for the chambers farther down the array pass through each chamber above them in the array. The seals are solid, water-proof, non-reactive, resilient disks supported to engage the inside surface of the well casing. Because of the modular design, the apparatus provides flexibility for use in a variety of well configurations. 3 figures.
Nichols, R.L.; Widdowson, M.A.; Mullinex, H.; Orne, W.H.; Looney, B.B.
Evaluation of a multiport groundwater monitoring system
In 1988 and 1989, Pacific Northwest Laboratory installed a multiport groundwater monitoring system in two wells on the Hanford Site: one near the 216-B-3 Pond in the center of the Hanford Site and one just north of the 300 Area near the Columbia River. The system was installed to provide the US Department of Energy with needed three-dimensional data on the vertical distribution of contaminants and hydraulic heads on the Hanford Site. This study evaluates the ability of the multiport system to obtain hydrogeologic data at multiple points vertically in a single borehole, and addresses the representativeness of the data. Data collected from the two wells indicate that the multiport system is well suited for groundwater monitoring networks requiring three-dimensional characterization of the hydrogeologic system. A network of these systems could provide valuable information on the hydrogeologic environment. However, the advantages of the multiport system diminish when the system is applied to long-term monitoring networks (30+ years) and to deeper wells (<300 ft). For shallow wells, the multiport system provides data in a cost-effective manner that would not be reasonably obtainable with the conventional methods currently in use at the Hanford Site. 17 refs., 28 figs., 6 tabs.
Gilmore, T.J.; Hall, S.H.; Olsen, K.B.; Spane, F.A. Jr.
Recovery Act Funds Expand Groundwater Treatment at Hanford Site: Contractor
Funds Expand Groundwater Treatment at Hanford Site: Funds Expand Groundwater Treatment at Hanford Site: Contractor CH2M HILL drills record number of wells Recovery Act Funds Expand Groundwater Treatment at Hanford Site: Contractor CH2M HILL drills record number of wells May 26, 2011 - 12:00pm Addthis Media Contacts Andre Armstrong CH2M HILL Plateau Remediation Company (509) 376-6773 email@example.com Geoff Tyree, DOE (509) 376-4171 firstname.lastname@example.com RICHLAND, Wash. - Workers at the Hanford Site have surpassed goals for drilling wells to detect and remove contamination from groundwater. The groundwater was contaminated by radioactive waste and chemicals generated during decades of producing plutonium for the Cold War at the Hanford Site in southeast Washington State. The Department of Energy (DOE) had set a goal for its contractor, CH2M HILL
Community College Highlights Paducah Site Groundwater Model | Department of
Community College Highlights Paducah Site Groundwater Model Community College Highlights Paducah Site Groundwater Model Community College Highlights Paducah Site Groundwater Model May 8, 2013 - 12:00pm Addthis Steve Hampson of the University of Kentucky, left to right, West Kentucky Community & Technical College President Dr. Barbara Veazey, Paducah Junior College Board of Trustees member Ken Wheeler and Buz Smith of the DOE Paducah Site Office examine a DOE Paducah Site groundwater model exhibit at the West Kentucky Community & Technical College Emerging Technology Center. Steve Hampson of the University of Kentucky, left to right, West Kentucky Community & Technical College President Dr. Barbara Veazey, Paducah Junior College Board of Trustees member Ken Wheeler and Buz Smith of the DOE Paducah Site Office examine a DOE Paducah Site groundwater model exhibit at
New Groundwater Treatment Facility Begins Operation: Boost in Cleanup
New Groundwater Treatment Facility Begins Operation: Boost in New Groundwater Treatment Facility Begins Operation: Boost in Cleanup Accelerated by Recovery Act Funding New Groundwater Treatment Facility Begins Operation: Boost in Cleanup Accelerated by Recovery Act Funding January 19, 2011 - 12:00pm Addthis Media Contacts Andre Armstrong, CH2M HILL (509)376-6773 email@example.com Geoff Tyree, DOE (509) 376-4171 email@example.com RICHLAND, WASH. - The U.S. Department of Energy (DOE) is boosting its capacity for treating groundwater to remove chromium near the Columbia River by 40 percent with the recent completion of a new treatment facility. Contractor CH2M HILL Plateau Remediation Company (CH2M HILL) finished building and started operating the new 100-DX groundwater treatment facility in December. The facility is located near the D and DR Reactors on
Groundwater Resources Assessment under the Pressures of Humanity and
Groundwater Resources Assessment under the Pressures of Humanity and Groundwater Resources Assessment under the Pressures of Humanity and Climate Change (GRAPHIC) Jump to: navigation, search Tool Summary LAUNCH TOOL Name: Groundwater Resources Assessment under the Pressures of Humanity and Climate Change (GRAPHIC) Agency/Company /Organization: United Nations Educational Scientific and Cultural Organization Sector: Climate, Water Topics: Co-benefits assessment, Resource assessment Resource Type: Publications Website: unesdoc.unesco.org/images/0015/001507/150730e.pdf References: Groundwater Resources Assessment under the Pressures of Humanity and Climate Change (GRAPHIC)[1] "The GRAPHIC project seeks to improve our understanding of how groundwater contributes to the global water cycle and thus how it supports ecosystems
Hanford Site Treating Record Amount of Contaminated Groundwater |
Hanford Site Treating Record Amount of Contaminated Groundwater Hanford Site Treating Record Amount of Contaminated Groundwater Hanford Site Treating Record Amount of Contaminated Groundwater July 15, 2013 - 12:00pm Addthis Media Contacts Geoff Tyree, DOE (509) 376-4171 firstname.lastname@example.com Tania Reyes, CHPRC (509) 373-6828 email@example.com Department of Energy goal for fiscal year 2013 met early Note: Photos and graphics are available for downloading on our website link: http://ow.ly/mO5cT RICHLAND, Wash. - U.S. Department of Energy (DOE) contractor CH2M HILL Plateau Remediation Company (CH2M HILL) has exceeded this year's goal for treating 1.4 billion gallons of contaminated groundwater at the Hanford Site in Washington state. "In the last few years, DOE built three new groundwater treatment facilities, and now we are seeing the results," said Briant Charboneau,
Arsenic Removal from Groundwater Using Iron Electrocoagulation: Effect of
Arsenic Removal from Groundwater Using Iron Electrocoagulation: Effect of Arsenic Removal from Groundwater Using Iron Electrocoagulation: Effect of Charge Dosage Rate Title Arsenic Removal from Groundwater Using Iron Electrocoagulation: Effect of Charge Dosage Rate Publication Type Journal Article Refereed Designation Refereed LBNL Report Number LBNL-6221E Year of Publication 2013 Authors Amrose, Susan, Ashok J. Gadgil, Venkat Srinivasan, Kristin Kowolik, Marc Muller, Jessica Huang, and Robert Kostecki Journal Joournal of Environmental Science and Health, Part A: Toxic/Hazardous Substances and Environmental Engineering Volume 48 Issue 9 Pagination 1019-1030 Date Published 04/2013 Keywords arsenic, bangladesh, Cambodia, dosage rate, electrocoagulation, india, water treatment Abstract We demonstrate that electrocoagulation (EC) using iron electrodes can reduce arsenic below 10 μg/L in synthetic Bangladesh groundwater and in real groundwater from Bangladesh and Cambodia while investigating the effect of operating parameters that are often overlooked, such as charge dosage rate. We measure arsenic removal performance
Rocky Flats Site Expands Solar Power for Treating Groundwater | Department
Rocky Flats Site Expands Solar Power for Treating Groundwater Rocky Flats Site Expands Solar Power for Treating Groundwater Rocky Flats Site Expands Solar Power for Treating Groundwater April 17, 2013 - 1:26pm Addthis Subcontractor personnel install solar panels and other infrastructure on a 40-foot conex box that houses the batteries and control equipment for the 6 kilowatt photovoltaic system that powers the ETPTS groundwater treatment system. Subcontractor personnel install solar panels and other infrastructure on a 40-foot conex box that houses the batteries and control equipment for the 6 kilowatt photovoltaic system that powers the ETPTS groundwater treatment system. DOE was able to minimize impacts to the habitat of a federally protected mouse and provide the potential for relatively easy relocation by mounting the solar panels on the side of the conex box that houses the batteries and other system equipment.
Portsmouth Site Feeds Bacteria to Render Hazardous Groundwater Waste
Portsmouth Site Feeds Bacteria to Render Hazardous Groundwater Portsmouth Site Feeds Bacteria to Render Hazardous Groundwater Waste Harmless Portsmouth Site Feeds Bacteria to Render Hazardous Groundwater Waste Harmless April 2, 2012 - 12:00pm Addthis Neil Smith puts a trained eye on the pressure and flow of a food-grade com¬pound being injected into an under¬ground plume of hazardous waste near the X-720 Maintenance Facility at the DOE Piketon Site. The sodium lactate compound promotes bacterial growth in the groundwater that turns hazardous waste into harmless end-products. Neil Smith puts a trained eye on the pressure and flow of a food-grade com¬pound being injected into an under¬ground plume of hazardous waste near the X-720 Maintenance Facility at the DOE Piketon Site. The sodium lactate compound promotes bacterial growth in the groundwater that turns
Treating Record Amount of Contaminated Groundwater Treating Record Amount of Contaminated Groundwater Hanford Site Treating Record Amount of Contaminated Groundwater July 15, 2013 - 12:00pm Addthis Media Contacts Geoff Tyree, DOE (509) 376-4171 email@example.com Tania Reyes, CHPRC (509) 373-6828 firstname.lastname@example.com Department of Energy goal for fiscal year 2013 met early Note: Photos and graphics are available for downloading on our website link: http://ow.ly/mO5cT RICHLAND, Wash. - U.S. Department of Energy (DOE) contractor CH2M HILL Plateau Remediation Company (CH2M HILL) has exceeded this year's goal for treating 1.4 billion gallons of contaminated groundwater at the Hanford Site in Washington state. "In the last few years, DOE built three new groundwater treatment facilities, and now we are seeing the results," said Briant Charboneau,
Fusion categories in terms of graphs and relations
Every fusion category C that is k-linear over a suitable field k, is the category of finite-dimensional comodules of a Weak Hopf Algebra H. This Weak Hopf Algebra is finite-dimensional, cosemisimple and has commutative bases. It arises as the universal coend with respect to the long canonical functor \\omega:C->Vect_k. We show that H is a quotient H=H[G]/I of a Weak Bialgebra H[G] which has a combinatorial description in terms of a finite directed graph G that depends on the choice of a generator M of C and on the fusion coefficients of C. The algebra underlying H[G] is the path algebra of the quiver GxG, and so the composability of paths in G parameterizes the truncation of the tensor product of C. The ideal I is generated by two types of relations. The first type enforces that the tensor powers of the generator M have the appropriate endomorphism algebras, thus providing a Schur-Weyl dual description of C. If C is braided, this includes relations of the form `RTT=TTR' where R contains the coefficients of the braiding on \\omega M\\otimes\\omega M, a generalization of the construction of Faddeev-Reshetikhin-Takhtajan to Weak Bialgebras. The second type of relations removes a suitable set of group-like elements in order to make the category of finite-dimensional comodules equivalent to C over all tensor powers of the generator M. As examples, we treat the modular categories associated with U_q(sl_2).
Hendryk Pfeiffer
Hanford Site ground-water monitoring for 1994
This report presents the results of the Ground-Water Surveillance Project monitoring for calendar year 1994 on the Hanford Site, Washington. Hanford Site operations from 1943 onward produced large quantities of radiologic and chemical waste that have impacted ground-water quality on the Site. Monitoring of water levels and ground-water chemistry is performed to track the extent of contamination and trends in contaminant concentrations. The 1994 monitoring was also designed to identify emerging ground-water quality problems. The information obtained is used to verify compliance with applicable environmental regulations and to evaluate remedial actions. Data from other monitoring and characterization programs were incorporated to provide an integrated assessment of Site ground-water quality. Additional characterization of the Site`s geologic setting and hydrology was performed to support the interpretation of contaminant distributions. Numerical modeling of sitewide ground-water flow also supported the overall project goals. Water-level monitoring was performed to evaluate ground-water flow directions, to track changes in water levels, and to relate such changes to changes in site disposal practices. Water levels over most of the Hanford Site continued to decline between June 1993 and June 1994. These declines are part of the continued response to the cessation of discharge to U Pond and other disposal facilities. The low permeability in this area which enhanced mounding of waste-water discharge has also slowed the response to the reduction of disposal.
Dresel, P.E.; Thorne, P.D.; Luttrell, S.P. [and others
The Environmental Monitoring Section of the Environmental and Health Protection (EHP) Department administers the Savannah River Site's Groundwater Monitoring Program. During fourth quarter 1989 (October--December), EHP conducted routine sampling of monitoring wells and drinking water locations. EHP collected the drinking water samples from Savannah River Site (SRS) drinking water systems supplied by wells. EHP established two sets of flagging criteria in 1986 to assist in the management of sample results. The flagging criteria aid personnel in sample scheduling, interpretation of data, and trend identification. An explanation of flagging criteria for the fourth quarter is presented in the Flagging Criteria section of this document. All analytical results from fourth quarter 1989 are listed in this report, which is distributed to all waste-site custodians.
Alluvial Groundwater -- Upgradient -- 92-05&
09 09 This page intentionally left blank Alluvial Groundwater -- Upgradient -- 92-05 a,b ______________________________________________________________ Analyte Unit 10/30/00 04/11/01 07/20/01 10/10/01 ______________________________________________________________ Field Measurements Alkalinity mg/L -- 270 321 303 Conductivity c μmhos/cm 1520 1250 1366 1350 DO c mg/L -- 7.7 -- -- ORP c mV 84 71 -- 38 pH c s.u. 7.05 7.66 6.42 6.99 Temperature c C 9.4 7.7 9.7 10 Turbidity c NTU 42.6 4.05 60.3 70.5 Common Ions Ca mg/L 266 214 206 207
Waste Isolation Pilot Plant Groundwater Protection Management Program Plan
The DOE established the Groundwater Monitoring Program (GMP) (WP 02-1) to monitor groundwater resources at WIPP. In the past, the GMP was conducted to establish background data of existing conditions of groundwater quality and quantity in the WIPP vicinity, and to develop and maintain a water quality database as required by regulation. Today the GMP is conducted consistent with 204.1.500 NMAC (New MexicoAdministrative Code), "Adoption of 40 CFR [Code of Federal Regulations] Part 264,"specifically 40 CFR �264.90 through �264.101. These sections of 20.4.1 NMAC provide guidance for detection monitoring of groundwater that is, or could be, affected by waste management activities at WIPP. Detection monitoring at WIPP is designed to detect contaminants in the groundwater long before the general population is exposed. Early detection will allow cleanup efforts to be accomplished before any exposure to the general population can occur. Title 40 CFR Part 264, Subpart F, stipulates minimum requirements of Resource Conservation and Recovery Act of 1976 (42 United States Code [U.S.C.] �6901 et seq.) (RCRA) groundwater monitoring programs including the number and location of monitoring wells; sampling and reporting schedules; analytical methods and accuracy requirements; monitoring parameters; and statistical treatment of monitoring data. This document outlines how WIPP intends to protect and preserve groundwater within the WIPP Land Withdrawal Area (WLWA). Groundwater protection is just one aspect of the WIPP environmental protection effort. An overview of the entire environmental protection effort can be found in DOE/WIPP 99-2194, Waste Isolation Pilot Plant Environmental Monitoring Plan. The WIPP GMP is designed to statistically determine if any changes are occurring in groundwater characteristics within and surrounding the WIPP facility. If a change is noted, the cause will then be determined and the appropriate corrective action(s) initiated.
Washington Regulatory and Environmental Services
Evaluation of Groundwater Resource in Huaian Region of Jiangsu Province, China
With the development of industry and agriculture in Huaian of Jiangsu Province, China, the demand of high quality groundwater becomes larger and larger in recent years. Many problems, such as subsidence and groundwater level decreasing, appear more frequently ... Keywords: Groundwater resources, Evaluation, Groundwater depression
Gong-xin Chen; JinHui Liu
Analysis and Geochemical Modeling of Vanadium Contamination in Groundwater New Rifle Processing Site, Colorado
Isotopes of helium, hydrogen, and carbon as groundwater tracers in aquifers along the Colorado River
isotope studies in the Mojave Desert, California: implications for groundwater chronology and regional seismicity, Chemical Geology.
Haber, Samuel Ainsworth
Surface Water and Groundwater Use and Protection (Mississippi) | Department
Surface Water and Groundwater Use and Protection (Mississippi) Surface Water and Groundwater Use and Protection (Mississippi) Surface Water and Groundwater Use and Protection (Mississippi) < Back Eligibility Agricultural Commercial Construction Developer Fed. Government Fuel Distributor General Public/Consumer Industrial Installer/Contractor Institutional Investor-Owned Utility Local Government Low-Income Residential Multi-Family Residential Municipal/Public Utility Nonprofit Residential Retail Supplier Rural Electric Cooperative Schools State/Provincial Govt Systems Integrator Transportation Tribal Government Utility Savings Category Alternative Fuel Vehicles Hydrogen & Fuel Cells Buying & Making Electricity Water Home Weatherization Solar Wind Program Info State Mississippi Program Type Environmental Regulations Siting and Permitting
Martin Marietta Energy Systems, Inc., Groundwater Program Management Plan
The purpose of the Martin Marietta Energy Systems, Inc., (Energy Systems) Groundwater Program Management Plan is to define the function, organizational structure (including associated matrix organizations), interfaces, roles and responsibilities, authority, and relationship to the Department of Energy for the Energy Systems Groundwater Program Office (GWPO). GWPO is charged with the responsibility of coordinating all components of the groundwater program for Energy Systems. This mandate includes activities at the three Oak Ridge facilities [Oak Ridge National Laboratory, the Oak Ridge Y-12 Plant, and the Oak Ridge K-25 Site], as well as the Paducah and Portsmouth Gaseous Diffusion Plants.
Early, T.O.
Sulfate Reduction in Groundwater: Characterization and Applications for Remediation
Sulfate is ubiquitous in groundwater, with both natural and anthropogenic sources. Sulfate reduction reactions play a significant role in mediating redox conditions and biogeochemical processes for subsurface systems. They also serve as the basis for innovative in-situ methods for groundwater remediation. An overview of sulfate reduction in subsurface environments is provided, with a specific focus on implications for groundwater remediation. A case study presenting the results of a pilot-scale ethanol injection test illustrates the advantages and difficulties associated with the use of electron-donor amendments for sulfate remediation.
Miao, Z.; Brusseau, M. L.; Carroll, Kenneth C.; Carreon-Diazconti, C.; Johnson, B.
Split and Join: Strong Partitions and Universal Steiner Trees for Graphs
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...
Busch, Costas; Radhakrishnan, Jaikumar; Rajaraman, Rajmohan; Srinivasagopalan, Srivathsan
Structure Discovery in Large Semantic Graphs Using Extant Ontological Scaling and Descriptive Statistics
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;
al-Saffar, Sinan; Joslyn, Cliff A.; Chappell, Alan R.
Combining a Multithreaded Scene Graph System with a Tiled Display Environment
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.
Frank, R; Bethel, W
EA-1331: Remediation of Subsurface and Groundwater Contamination at the
331: Remediation of Subsurface and Groundwater Contamination at 331: Remediation of Subsurface and Groundwater Contamination at the Rock Springs in situ Oil Shale Retort Site, Sweetwater County, Wyoming EA-1331: Remediation of Subsurface and Groundwater Contamination at the Rock Springs in situ Oil Shale Retort Site, Sweetwater County, Wyoming SUMMARY This EA evaluates the environmental impacts for the proposal for the Rock Springs In-Situ Oil Shale Retort Test Site remediation that would be performed at the Rock Springs site in Sweetwater County, Wyoming. PUBLIC COMMENT OPPORTUNITIES None available at this time. DOCUMENTS AVAILABLE FOR DOWNLOAD July 31, 2000 EA-1331: Finding of No Significant Impact Remediation of Subsurface and Groundwater Contamination at the Rock Springs in situ Oil Shale Retort Site July 31, 2000 EA-1331: Final Environmental Assessment
Resin Improves Efficiency, Reduces Costs in Hanford Site Resin Improves Efficiency, Reduces Costs in Hanford Site Groundwater Treatment New Resin Improves Efficiency, Reduces Costs in Hanford Site Groundwater Treatment March 1, 2012 - 12:00pm Addthis RICHLAND, Wash. - A new resin EM, the Richland Operations Office, and contractor CH2M HILL Plateau Remediation Company are using in contaminated groundwater treatment is expected to increase efficiency and reduce costs in the operation of pump-and-treat facilities along the Columbia River at the Hanford site. The higher performance resin, SIR-700, is expected to reduce DOE's estimated operation and maintenance costs over the lifetime of the 100-DX Groundwater Treatment Facility by approximately $20 million. In comparison to this expected cost savings, the construction cost for the treatment
Comment on "Arsenic Mobility and Groundwater Extraction in
solids accompanying the influx of fresh, labile car- bon-laden recharge water. They further con- cluded and hydro- gen isotope compositions of shallow groundwaters between 1979 and 1999. This indicates
Basu, Asish R.
and R. L. Klausing, 1969, Land subsidence due to groundwater7612-10874 Fig. S. Land subsidence at Pixley, California:Symposium on Land Subsidence, Anaheim, CA, December 10-
Narasimhan, T.N.
Model Reduction and Parameter Estimation in Groundwater Modeling
Professor William W-G. Yeh, Chair Water resources systemsWilliam W-G. Yeh. Systems analysis in ground-water planningYeh (2012), Reduced order parameter estimation using quasilinearization and quadratic programming, Water
Siade, Adam
Groundwater Contamination and Treatment at Department of Energy Sites � 2008
The purpose of this document is to provide DOE Program/Project Managers, upper management, and other interested parties with a snapshot in time of the status of major groundwater contamination and...
Groundwater Contamination and Treatment at Department of Energy Sites � 2009
This document provides DOE Program/Project Managers, senior management, and other interested parties with a snapshot in time of the status of major groundwater contamination and remedial approaches...
Groundwater Contamination and Treatment at Department of Energy Sites
Groundwater Constraints on Simulated Transpiration Variability over Southeastern Australian Forests
A land surface scheme with and without groundwater�vegetation interactions is used to explore the impact of rainfall variability on transpiration over drought-vulnerable regions of southeastern Australia. The authors demonstrate that if ...
M. Decker; A. J. Pitman; J. P. Evans
Relations between Precipitation and Shallow Groundwater in Illinois
The statistical relationships between monthly precipitation (P) and shallow groundwater levels (GW) in 20 wells scattered across Illinois with data for 1960�84 were defined using autoregressive integrated moving average (ARIMA) modeling. A lag of ...
Stanley A. Changnon; Floyd A. Huff; Chin-Fei Hsu
Hanford Site Groundwater Monitoring for Fiscal Year 2004
This document presents the results of groundwater and vadose zone monitoring for fiscal year 2004 (October 2003 through September 2004)on the U.S. Department of Energy's Hanford Site in southeast Washington State.
Groundwater decline and the preservation of property in Boston
There is a slow-motion disaster underway below the city of Boston. The levels of groundwater have been steadily decreasing over the past eighty years and the structural integrity of the city's older buildings is in jeopardy. ...
Shoham, Tamar
A multilayer groundwater sampler for characterizing contaminant plumes
This final report describes activities related to the design and initial demonstration of a passive multilayer groundwater sampling system. The apparatus consists of remotely controlled cylinders filled with deionized water which are connected in tandem. Vertical fine structure of contaminants are easily defined. Using the apparatus in several wells may lead to three dimensional depictions of groundwater contamination, thereby providing the information necessary for site characterization and remediation.
Kaplan, E.; Heiser, J.
A multilayer groundwater sampler for characterizing contaminant plumes. Final report
Groundwater Closure Strategy for Former Manufactured Gas Plant Sites
Utilities responsible for Manufactured Gas Plant (MGP) remediation must navigate numerous challenges in order to attain regulatory closure. Typically, the first strategic focus is on source remediation: to locate, treat or remove MGP residuals that constitute ongoing sources of impacts to receptors (e.g., direct contact, soil vapor, or groundwater). Often the last compliance piece that must fall into place is compliance with regulatory criteria for groundwater. The state-specific regulatory closure ...
Least-Cost Groundwater Remediation Design Using Uncertain Hydrogeological Information
The research conducted by at the Research Center for Groundwater Remediation Design at the University of Vermont funded by the Department of Energy continues to focus on the implementation of a new method of including uncertainty into the optimal design of groundwater remediation systems. The uncertain parameter is the hydraulic conductivity of an aquifer. The optimization method utilized for this project is called robust optimization. The uncertainty of the hydraulic conductivity is described by a probability density function, PDF.
Pinder, George F.
Hanford Site groundwater monitoring for fiscal year 1996
This report presents the results of groundwater and vadose-zone monitoring for fiscal year (FY) 1996 on the Hanford Site, Washington. Hanford Site operations from 1943 onward produced large quantities of radiological and chemical waste that affected groundwater quality on the site. Characterization and monitoring of the vadose zone during FY 1996 comprised primarily spectral gamma logging, soil-gas monitoring, and electrical resistivity tomography. Water-level monitoring was performed to evaluate groundwater-flow directions, to track changes in water levels, and to relate such changes to evolving disposal practices. Water levels over most of the Hanford Site continued to decline between June 1995 and June 1996. Groundwater chemistry was monitored to track the extent of contamination, to note trends, and to identify emerging groundwater-quality problems. The most widespread radiological contaminant plumes were tritium and iodine-129. Smaller plumes of strontium-90, technetium-99, and plutonium also were present at levels above the U.S. Environmental Protection Agency or State of Washington interim drinking water standards. Uranium concentrations greater than the proposed drinking water standard were also observed. Nitrate, fluoride, chromium, carbon tetrachloride, chloroform, trichloroethylene, and cis-1,2-dichlomethylene were present in groundwater samples at levels above their U.S. Environmental Protection Agency or State of Washington maximum contaminant levels. The nitrate plume is the most extensive. Three-dimensional, numerical, groundwater models were applied to the Hanford Site to predict contaminant-flow paths and the impact of operational changes on site groundwater conditions. Other models were applied to assess the performance of three separate pump-and-treat systems.
Hartman, M.J.; Dresel, P.E.; Borghese, J.V. [eds.] [and others] [eds.; and others
Environmental Sciences Division Groundwater Program Office. Annual report, 1993
This first edition of the Martin Marietta Energy Systems, Inc., (Energy Systems) Groundwater Program Annual Report summarizes the work carried out by the Energy Systems GWPO for fiscal year (FY) 1993. This introductory section describes the GWPO`s staffing, organization, and funding sources. The GWPO is responsible for coordination and oversight for all components of the groundwater program at the three Oak Ridge facilities [ORNL, the Oak Ridge Y-12 Plant, and the Oak Ridge K-25 Site], and the PGDP and PORTS, respectively. Several years ago, Energy systems senior management recognized that the manner in which groundwater activities were conducted at the five facilities could result in unnecessary duplication of effort, inadequate technical input to decisions related to groundwater issues, and could create a perception within the regulatory agencies of a confusing and inconsistent approach to groundwater issues at the different facilities. Extensive interactions among management from Environmental Compliance, Environmental Restoration (ER), Environmental Sciences Division, Environmental Safety and Health, and the five facilities ultimately led to development of a net technical umbrella organization for groundwater. On April 25, 1991, the GWPO was authorized to be set up within ORNL thereby establishing a central coordinating office that would develop a consistent technical and administrative direction for the groundwater programs of all facilities and result in compliance with all relevant U.S. Environmental Protection Agency (EPA) regulations such as RCRA and Comprehensive Environmental Restoration, Compensation and Liability Act (CERCLA) as well as U.S. Department of Energy (DOE) regulations and orders. For example, DOE Order 5400.1, issued on November 9, 1988, called for each DOE facility to develop an environmental monitoring program for all media (e.g., air, surface water, and groundwater).
Groundwater maps of the Hanford Site, June 1992
The Groundwater Maps of the Hanford Site, June 1992 is an update to the series of reports that document the configuration of the water table in the unconsolidated sediments beneath the Hanford Site (Figure 1). Water level measurements for these reports are collected from site groundwater monitoring wells each June and December. The groundwater data are portrayed on a series of maps to illustrate the hydrologic conditions at the Hanford Site and are also tabulated in an appendix. The purpose of this report series is to document the changes in the groundwater level at Hanford as the site transitions from a nuclear material production role to environmental restoration and remediation. In addition, these reports provide water level data in support of the site characterization and groundwater monitoring programs on the Hanford Site. Groundwater maps of the Hanford Site are prepared for the US Department of Energy, Office of Environmental Restoration and Waste Management, by the Hanford Site Operations and Engineering Contractor, Westinghouse Hanford Company (WHC).
Kasza, G.L.; Hartman, M.J.; Hodges, F.N.; Weekes, D.C.
Groundwater surveillance plan for the Oak Ridge Reservation
US Department of Energy (DOE) Order 5400.1 requires the preparation of environmental monitoring plans and implementation of environmental monitoring programs for all DOE facilities. The order identifies two distinct components of environmental monitoring, namely effluent monitoring and environmental surveillance. In general, effluent monitoring has the objectives of characterizing contaminants and demonstrating compliance with applicable standards and permit requirements, whereas environmental surveillance has the broader objective of monitoring the effects of DOE activities on on- and off-site environmental and natural resources. The purpose of this document is to support the Environmental Monitoring Plan for the Oak Ridge Reservation (ORR) by describing the groundwater component of the environmental surveillance program for the DOE facilities on the ORR. The distinctions between groundwater effluent monitoring and groundwater surveillance have been defined in the Martin Marietta Energy Systems, Inc., Groundwater Surveillance Strategy. As defined in the strategy, a groundwater surveillance program consists of two parts, plant perimeter surveillance and off-site water well surveillance. This document identifies the sampling locations, parameters, and monitoring frequencies for both of these activities on and around the ORR and describes the rationale for the program design. The program was developed to meet the objectives of DOE Order 5400.1 and related requirements in DOE Order 5400.5 and to conform with DOE guidance on environmental surveillance and the Energy Systems Groundwater Surveillance Strategy.
Forstrom, J.M. [Oak Ridge K-25 Site, TN (United States); Smith, E.D.; Winters, S.L. [Oak Ridge National Lab., TN (United States). Environmental Sciences Div.; Haase, C.S.; King, H.L. [Oak Ridge Y-12 Plant, TN (United States); McMaster, W.M. [McMaster (W.M.), Heiskell, TN (United States)
Reaching site closure for groundwater under multiple regulatory agencies
Groundwater at the Connecticut Yankee Atomic Power Company (CYAPCO) Haddam Neck Plant (HNP) has been impacted by both radionuclides and chemical constituents. Furthermore, the cleanup standards and closure requirements for HNP are regulated both by federal and state agencies. The only consistent requirement is the development of a site conceptual model and an understanding of the hydrogeologic conditions that will govern contaminant transport and identify potential receptors. The cleanup criteria to reach site closure for radionuclides is regulated by both the Nuclear Regulatory Commission (NRC) and the Connecticut Department of Environmental Protection (CTDEP) Bureau of Air Management, Radiological Division. For license termination under the NRC, the total effective dose equivalent (TEDE) for all media can not exceed 25 milli-Rem per year (mRem/yr) plus As Low as Reasonably Achievable (ALARA). The CTDEP has a similar requirement with the TEDE not to exceed 19 mRem/yr plus ALARA. To reach these criteria, derived concentration guideline levels (DCGLs) were developed for radiological exposures from three (3) media components; soil, existing groundwater and future groundwater from left-in place foundations or footings. Based on current conditions, the target dose contribution from existing and future groundwater is not to exceed 2 mRem/yr TEDE. After source (soil) remediation is complete, the NRC requires two (2) years of quarterly monitoring to demonstrate that groundwater quality meets the DCGLs and does not show an upward trend. CYAPCO's NRC License Termination Plan (LTP) specifies a minimum 18-month period of groundwater monitoring, as long as samples are collected during two spring/high water seasons, to verify the efficacy of remedial actions at HNP. In addition to the 19 mRem/yr criteria, the CTDEP also requires groundwater to be in compliance with the Remediation Standards Regulation (RSRs). There are no published criteria for radionuclides in the RSRs, however CTDEP has approved the United States Environmental Protection Agency's (USEPA's) Maximum Contaminant Levels (MCLs) as the clean up standards for individual constituents. After remediation of an identified contamination source, the RSRs require that at least one groundwater monitoring well, hydraulically down-gradient of the remediation area, be sampled to confirm that the remediation has not impacted groundwater quality. After four quarters of groundwater monitoring with results below the MCLs, additional groundwater sampling must continue for up to three years to reach site closure in accordance with the RSRs. The cleanup criteria for chemical constituents, including boron, are regulated by the USEPA under the Resource Conservation and Recovery Act (RCRA) and the CTDEP Bureau of Water Protection and Land Reuse. The USEPA, however, has accepted the CTDEP RSRs as the cleanup criteria for RCRA. Therefore attainment of the CTDEP RSRs is the only set of criteria needed to reach closure, but both agencies retain oversight, interpretation, and closure authority. As stated above, under the RSRs, groundwater must be monitored following a source remediation for a minimum of four quarters. After demonstrating that the remediation was successful, then additional groundwater sampling is required for up to three additional years. However, the number of monitoring wells and frequency of sampling are not defined in the RSRs and must be negotiated with CTDEP. To successfully reach closure, the conceptual site model, groundwater transport mechanisms, and potential receptors must be defined. Once the hydrogeology is understood, a long term groundwater monitoring program can then be coordinated to meet each agencies requirement to both terminate the NRC license and reach site closure under RCRA. (authors)
Glucksberg, N. [MACTEC, Inc., Portland, ME (United States); Couture, B. [Connecticut Yankee Atomic Power Company, East Ham (United States)
Min-cuts and Shortest Cycles in Planar Graphs in O(n log log n) Time
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.
\\L\\kacki, Jakub
Decision support system for water distribution systems based on neural networks and graphs theory for leakage detection
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
Corneliu T. C. Arsene; Bogdan Gabrys; David Al-Dabass
Identifying Calcium-Binding Sites with Oxygen-Carbon Shell Geometric and Chemic Criteria-A Graph-Based Approach
Identifying calcium-binding sites in proteins help acknowledge protein functions. We thus developed a graph theory and geometry approach to improve the accuracy for predicting calcium-binding sites, we enhance our previous approach at a high level to ... Keywords: calcium-binding sites, graph theory, maximal cliques, prediction
Hui Liu; Hai Deng
Using Battery Level as Metric for Graph Planarization Jovan Radak, Nathalie Mitton, and David Simplot-Ryl
Using Battery Level as Metric for Graph Planarization Jovan Radak, Nathalie Mitton, and David. In this paper we tackle the prob- lem of possible connectivity loss in the reduced graph by applying a battery the energy consumption over nodes. Keywords: RNG, topology control, wireless sensor networks, battery
An incremental learning algorithm based on the K-associated graph for non-stationary data classification
Non-stationary classification problems concern the changes on data distribution over a classifier lifetime. To face this problem, learning algorithms must conciliate essential, but difficult to gather, attributes like good classification performance, ... Keywords: Concept drift, Graph-based learning, Incremental learning, K-associated graph, Non-stationary classification, Purity measure
Jo�O Roberto Bertini, Jr, Liang Zhao, Alneu A. Lopes
A fast parallel algorithm for finding a most reliable source on a general ring-tree graph with unreliable edges
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
Wei Ding; Guoliang Xue
Numerical Simulation of Groundwater Withdrawal within the Mercury Valley Administrative Groundwater Basin, Nevada
A detailed, transient, three-dimensional, finite-difference groundwater flow model was created for the Mercury Valley Administrative Groundwater Basin (MVB). The MVB is a distinct groundwater basin as defined by the State of Nevada and is located partially within the boundary of the Nevada Test Site. This basin is being studied as a potential location for new industrial facilities and therefore would be subject to Nevada water-use limitations. The MVB model was used to estimate the volume of water that could be withdrawn from Mercury Valley without inducing laterally or vertically extensive water-table effects. In each model simulation, water-table drawdown was limited to a maximum of 0.5 m at the boundary of the basin and held within the screened interval of the well. Water withdrawal from Nevada groundwater basins is also limited to the State-defined perennial yield for that area. The perennial yield for the MVB is 27,036 m{sup 3}/day. The one existing water-supply well in Mercury Valley is capable of sustaining significantly higher withdrawal rates than it currently produces. Simulations showed this single well could produce 50 percent of the basin?s perennial yield with limited water-table drawdown. Pumping from six hypothetical water-supply wells was also simulated. Each hypothetical well was placed in an area of high hydraulic conductivity and far from the basin's boundaries. Each of these wells was capable of producing at least 50 percent of the basin's perennial yield. One of the hypothetical wells could simulate 100 percent of the perennial yield while staying within drawdown limitations. Multi-well simulations where two or more water-supply wells were simultaneously pumping were also conducted. These simulations almost always resulted in very limited lateral and vertical drawdown and produced 100 percent of Mercury Valley's perennial yield. A water-budget analysis was also conducted for each of the various stress simulations. Each of the stress scenarios was compared to a baseline scenario where existing water-supply wells in the model domain were pumped at 2003-2004 average pumping rates. Water-budget analyses showed increased flow from the constant-head boundaries on the north, east, and west sides of the model. Flow to the southern, head-dependent boundary and to springs in the Ash Meadows area remained unchanged.
A.B. Gilliam; R.W.H. Carroll; G. Pohll; R.L. Hershey
Stable isotope and groundwater flow dynamics of agricultural irrigation recharge into groundwater resources of the Central Valley, California
Intensive agricultural irrigation and overdraft of groundwater in the Central Valley of California profoundly affect the regional quality and availability of shallow groundwater resources. In the natural state, the {delta}{sup 18}O values of groundwater were relatively homogeneous (mostly -7.0 {+-} 0.5{per_thousand}), reflecting local meteoric recharge that slowly (1-3m/yr) flowed toward the valley axis. Today, on the west side of the valley, the isotope distribution is dominated by high {sup 18}O enclosures formed by recharge of evaporated irrigation waters, while the east side has bands of low {sup 18}O groundwater indicating induced recharge from rivers draining the Sierra Nevada mountains. Changes in {delta}{sup 18}O values caused by the agricultural recharge strongly correlate with elevated nitrate concentrations (5 to >100 mg/L) that form pervasive, non-point source pollutants. Small, west-side cities dependent solely on groundwater resources have experienced increases of >1.0 mg/L per year of nitrate for 10-30 years. The resultant high nitrates threaten the economical use of the groundwater for domestic purposes, and have forced some well shut-downs. Furthermore, since >80% of modern recharge is now derived from agricultural irrigation, and because modern recharge rates are {approximately}10 times those of the natural state, agricultural land retirement by urbanization will severely curtail the current safe-yields and promote overdraft pumping. Such overdrafting has occurred in the Sacramento metropolitan area for {approximately}40 years, creating cones of depression {approximately}25m deep. Today, groundwater withdrawal in Sacramento is approximately matched by infiltration of low {sup 18}O water (-11.0{per_thousand}) away from the Sacramento and American Rivers, which is estimated to occur at 100-300m/year from the sharp {sup 18}O gradients in our groundwater isotope map.
Davisson, M.L.; Criss, R.E.
Groundwater Data Modeling for Arc Hydro
During the years 1999�2002, a consortium for geographic information systems (GIS) in water resources, led by the Center for Research in Water Resources (CRWR) and the Environmental Systems Research Institute (ESRI), developed a data model, named Arc Hydro, for the presentation of surface water data in ArcGIS. This model was published in the summer of 2002 (Maidment, 2002) and has since been adopted as a common framework by data producing agencies, such as the USGS, and by creators of hydrologic models requiring GIS data such as the Hydrologic Engineering Center and the Danish Hydraulic Institute. The Design of Arc Hydro revealed that it is possible to define a �hydrologic information system � which is a synthesis of geospatial and temporal data supporting hydrologic analysis and modeling (Maidment, 2002). This is an exciting new concept because rather than simply applying GIS in water resources, it provides a new way of thinking about how information technology can be used to support water resources planning, modeling and management. While the first Arc Hydro data model focused on describing surface water behavior, it has become apparent that a similar effort is needed to define an ArcGIS data model for groundwater, as part of Arc Hydro. This need is emphasized by the lack of a well understood and generally agreed
Hanford Site Groundwater Monitoring for Fiscal Year 2005
This report is one of the major products and deliverables of the Groundwater Remediation and Closure Assessment Projects detailed work plan for FY 2006, and reflects the requirements of The Groundwater Performance Assessment Project Quality Assurance Plan (PNNL-15014). This report presents the results of groundwater and vadose zone monitoring and remediation for fiscal year 2005 on the U.S. Department of Energy's Hanford Site, Washington. The most extensive contaminant plumes in groundwater are tritium, iodine-129, and nitrate, which all had multiple sources and are very mobile in groundwater. The largest portions of these plumes are migrating from the central Hanford Site to the southeast, toward the Columbia River. Carbon tetrachloride and associated organic constituents form a relatively large plume beneath the west-central part of the Hanford Site. Hexavalent chromium is present in plumes beneath the reactor areas along the river and beneath the central part of the site. Strontium-90 exceeds standards beneath all but one of the reactor areas. Technetium-99 and uranium plumes exceeding standards are present in the 200 Areas. A uranium plume underlies the 300 Area. Minor contaminant plumes with concentrations greater than standards include carbon-14, cesium-137, cis-1,2-dichloroethene, cyanide, fluoride, plutonium, and trichloroethene. Monitoring for the Comprehensive Environmental Response, Compensation, and Liability Act of 1980 is conducted in 11 groundwater operable units. The purpose of this monitoring is to define and track plumes and to monitor the effectiveness of interim remedial actions. Interim groundwater remediation in the 100 Areas continued with the goal of reducing the amount of chromium (100-K, 100-D, and 100-H) and strontium-90 (100-N) reaching the Columbia River. The objective of two interim remediation systems in the 200 West Area is to prevent the spread of carbon tetrachloride and technetium-99/uranium plumes. Resource Conservation and Recovery Act of 1976 groundwater monitoring continued at 25 waste management areas during fiscal year 2005: 15 under interim or final status detection programs and data indicate that they are not adversely affecting groundwater, 8 under interim status groundwater quality assessment programs to assess contamination, and 2 under final status corrective-action programs. During calendar year 2005, drillers completed 27 new monitoring wells, and decommissioned (filled with grout) 115 unneeded wells. Vadose zone monitoring, characterization, and remediation continued in fiscal year 2005. Remediation and associated monitoring continued at a soil-vapor extraction system in the 200 West Area, which removes gaseous carbon tetrachloride from the vadose zone. DOE uses geophysical methods to monitor potential movement of contamination beneath former waste sites.
Hanford Site ground-water monitoring for 1993
This report presents the results of the Ground-Water Surveillance Project monitoring for calendar year 1993 on the Hanford Site, Washington. Hanford Site operations from 1943 onward produced large quantities of radiological and chemical waste that have impacted ground-water quality on the Site. Monitoring of water levels and ground-water chemistry is performed to track the extent of contamination and trends in contaminant concentrations. The 1993 monitoring was also designed to identify emerging ground-water quality problems. The information obtained is used to verify compliance with applicable environmental regulations and to evaluate remedial actions. Data from other monitoring and characterization programs were incorporated to provide an integrated assessment of Site ground-water quality. Additional characterization of the Site`s geologic setting and hydrology was performed to support the interpretation of contaminant distributions. Numerical modeling of sitewide ground-water flow also supported the overall project goals. Water-level monitoring was performed to evaluate ground-water flow directions, to track changes in water levels, and to relate such changes to changes in site disposal practices. Water levels over most of the Hanford Site continued to decline between June 1992 and June 1993. The greatest declines occurred in the 200-West Area. These declines are part of the continued response to the cessation of discharge to U Pond and other disposal facilities. The low permeability in this area which enhanced mounding of waste-water discharge has also slowed the response to the reduction of disposal. Water levels remained nearly constant in the vicinity of B Pond, as a result of continued disposal to the pond. Water levels measured from wells in the unconfined aquifer north and east of the Columbia River indicate that the primary source of recharge is irrigation practices.
Dresel, P.E.; Luttrell, S.P.; Evans, J.C. [and others
Multivariate statistical analyses of groundwater surrounding Forty mile wash
Groundwater chemistry data from 211 sampling locations in the vicinity of Yucca Mountain, Nevada are analyzed using multivariate statistical methods in order to better understand groundwater chemical evolution, ascertain potential flow paths and determine hydrochemical facies. Correspondence analysis of the major ion chemistry is used to define relationships between and among major ions and sampling locations. A k-means cluster analysis is used to determine hydrochemical facies based on correspondence analysis dimensions. The derived dimensions and hydrochemical facies are presented as bi-plots and overlaid on a digital elevation model of the region giving a visual picture of potential interactions and flow paths. A distinct signature of the groundwater chemistry along the extended flow path of Fortymile Wash can be observed along with some potential interaction at possible fault lines near Highway I-95. The signature from Fortymile Wash is believed to represent the relict of water that infiltrated during past pluvial periods when the amount of runoff in the wash was significantly larger than during the current drier period. This hypothesis appears to be supported by hydrogen-2 and oxygen-18 data which indicate that younger groundwater is found in the upper part of the wash near Yucca Mountain and older groundwater is found in the lower region of the wash near Amargosa River. The range of the hydrogen-2 data corresponds to precipitation in a period of relatively cold climate and has a similar spatial signature to the oxygen-18 data. If the hypothesis that current groundwater chemistry primarily reflects past focused infiltration of surface runoff rather than regional groundwater migration is correct, then saturated zone transport from Yucca Mountain may be much slower than is currently anticipated. (authors)
Woocay, A.; Walton, J.C. [El Paso Univ. of Texas, Environmental Science and Engineering, TX (United States)
Parse, price and cut: delayed column and row generation for graph based parsers
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 ...
Sebastian Riedel; David Smith; Andrew McCallum
Modeling and Dynamic Simulation of Electric Power Steering System of Automobile Using Bond Graph Technique
Electric Power Steering (EPS) systems have many merits over traditional hydraulic power steering systems in fuel economy, variable assist capabilities and favorable road feeling by virtue of adjustment assist characteristic with adopting assist motor ... Keywords: electric power steering system, bond graph, modeling, simulation
Lin-an Wang; Qiang Li; Xiao-juan Liang
Graph-based ranking algorithms for e-mail expertise analysis
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
Byron Dom; Iris Eiron; Alex Cozzi; Yi Zhang
Building a generic graph-based descriptor set for use in drug discovery
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
Phillip Lock; Nicolas Le Mercier; Jiuyong Li; Markus Stumptner
Yang-Lee Zeros of the Ising model on Random Graphs of Non Planar Topology
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.
D'Albuquerque, L C; Dalmazi, D; Albuquerque, Luiz C. de; Alves, Nelson A.
Luiz C. de Albuquerque; Nelson A. Alves; D. Dalmazi
Exact algorithms for maximum acyclic subgraph on a superclass of cubic 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 ...
Henning Fernau; Daniel Raible
Battery Aware Dynamic Scheduling For Periodic Task Graphs Venkat Rao1
Battery Aware Dynamic Scheduling For Periodic Task Graphs Venkat Rao1 , Nicolas Navet1 , Gaurav. of Electrical Engineering firstname.lastname@example.com firstname.lastname@example.com Abstract Battery lifetime, a primary profile. This paper ex- plores how scheduling guidelines from battery models can help in extending battery
A revision of Minty's algorithm for finding a maximum weight stable set of a clawfree graph
Daishin Nakamurayand Akihisa Tamuraz y Department of Computer Sciences, University of ElectroCommunications, Tokyo 1828585, Japan. z Research Institute for Mathematical Sciences, Kyoto University, Kyoto 606, Minty's algorithm construct the Edmonds' graph Ed(G; S; w) defined as below. Let x 1 ; : : : ; x r
The greedy algorithm for domination in graphs of maximum degree 3
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
Suzanne M. Seager
Absence of Zeros for the Chromatic Polynomial on Bounded Degree Graphs
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 ...
Christian Borgs
Lower bounds on the OBDD size of two fundamental functions' graphs
Ordered Binary Decision Diagrams (OBDDs) are a data structure for Boolean functions which supports many useful operations. Among others it finds applications in CAD, model checking, and symbolic graph algorithms. Nevertheless, many simple functions are ... Keywords: Analysis of algorithms, Computational complexity, Data structures, Theory of computation
Daniel Sawitzki
Fuzzy lattice reasoning (FLR) type neural computation for weighted graph partitioning
The fuzzy lattice reasoning (FLR) neural network was introduced lately based on an inclusion measure function. This work presents a novel FLR extension, namely agglomerative similarity measure FLR, or asmFLR for short, for clustering based on a similarity ... Keywords: Clustering, Fuzzy lattices, Graph partitioning, Measurable path, Metric, Similarity measure
Vassilis G. Kaburlasos; Lefteris Moussiades; Athena Vakali
NE-Rank: A Novel Graph-Based Keyphrase Extraction in Twitter
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
Abdelghani Bellaachia; Mohammed Al-Dhelaan
The spectral shift function and Levinson's theorem for quantum star graphs
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.
Demirel, Semra [University of Stuttgart, Department of Mathematics, Pfaffenwaldring 57, D-70569 Stuttgart (Germany)
Querying Graphs in Protein-Protein Interactions Networks Using Feedback Vertex Set
Recent techniques increase rapidly the amount of our knowledge on interactions between proteins. The interpretation of these new information depends on our ability to retrieve known substructures in the data, the Protein-Protein Interactions (PPIs) networks. ... Keywords: Graph query, pattern matching, dynamic programming, protein-protein interactions networks.
Guillaume Blin; Florian Sikora; Stephane Vialette
Domain-independent data cleaning via analysis of entity-relationship graph
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
Dmitri V. Kalashnikov; Sharad Mehrotra
Shortest Paths in Fuzzy Weighted Graphs Chris Cornelis,* Peter De Kesel,
and fuzzy logic--Theory and applications. Upper Saddle River, NJ: Prentice Hall; 1995. 15. Campos L, Muñoz A;12:213227. 5. Dubois D, Prade H. Fuzzy sets and systems: Theory and applications. New York: Aca- demic PressShortest Paths in Fuzzy Weighted Graphs Chris Cornelis,* Peter De Kesel, Etienne E. Kerre
Gent, Universiteit
Graph-based reasoning in collaborative knowledge management for industrial maintenance
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
Bernard Kamsu-Foguem, Daniel Noyes
Tracing the Birth of an OSN: Social Graph and Profile Analysis in Google+
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
Schmid, Stefan
Software architecture graphs as complex networks: A novel partitioning scheme to measure stability and evolution
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
S. Jenkins; S. R. Kirk
Conservation laws for a gauge-variant umbra-Lagrangian in classical mechanics using bond graphs
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
Vikas Rastogi; Amalendu Mukherjee
The Dominating Set Problem is Fixed Parameter Tractable for Graphs of Bounded Genus
, 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
Ellis, John
Heat-ray: combating identity snowball attacks using machinelearning, combinatorial optimization and attack graphs
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
John Dunagan; Alice X. Zheng; Daniel R. Simon
Absolutely continuous spectrum implies ballistic transport for quantum particles in a random potential on tree graphs
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.
Aizenman, Michael [Departments of Physics and Mathematics, Princeton University, Princeton, New Jersey 08544 (United States); Warzel, Simone [Zentrum Mathematik, TU Munich, Boltzmannstr. 3, 85747 Garching (Germany)
A Fuzzy Graph-Based Model for Selecting Knowledge Management Tools in Innovation Processes
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
Kouroush Jenab; Ahmad R. Sarfaraz
A random graph model of kidney exchanges: efficiency, individual-rationality and incentives
In kidney exchanges, hospitals share patient lists and receive transplantations. A kidney-paired donation (KPD) mechanism needs to promote full sharing of information about donor-patient pairs, and identify a Pareto efficient outcome that also satisfies ... Keywords: individual rationality, kidney exchange, maximum matching, mechanism design, random graph theory
Panagiotis Toulis; David C. Parkes
Fast discrete Fourier transform computations using the reduced adder graph technique
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 ...
Uwe Meyer-B�se; Hariharan Natarajan; Andrew G. Dempster
An Empirical Analysis of Some Heuristic Features for Planning through Local Search and Action Graphs
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
Alfonso Gerevini; Alessandro Saetti; Ivan Serina
Universal Design of Auditory Graphs: A Comparison of Sonification Mappings for Visually Impaired and Sighted Listeners
Determining patterns in data is an important and often difficult task for scientists and students. Unfortunately, graphing and analysis software typically is largely inaccessible to users with vision impairment. Using sound to represent data (i.e., sonification ... Keywords: Magnitude estimation, auditory display, visually impaired
B. N. Walker; L. M. Mauney
Graph-based simulation of quantum computation in the density matrix representation
Quantum-mechanical phenomena are playing an increasing role in information processing, as transistor sizes approach the nanometer level, and quantum circuits and data encoding methods appear in the securest forms of communication. Simulating such phenomena ... Keywords: QuIDDs, decision diagrams, density matrices, graph data structures, quantum algorithms, quantum circuits, quantum errors, simulation
George F. Viamontes; Igor L. Markov; John P. Hayes
A Guide for Using the Transient Ground-Water Flow Model of the Death Valley Regional Ground-Water Flow System, Nevada and California
This report is a guide for executing numerical simulations with the transient ground-water flow model of the Death Valley regional ground-water flow system, Nevada and California using the U.S. Geological Survey modular finite-difference ground-water flow model, MODFLOW-2000. Model inputs, including observations of hydraulic head, discharge, and boundary flows, are summarized. Modification of the DVRFS transient ground-water model is discussed for two common uses of the Death Valley regional ground-water flow system model: predictive pumping scenarios that extend beyond the end of the model simulation period (1998), and model simulations with only steady-state conditions.
Joan B. Blainey; Claudia C. Faunt, and Mary C. Hill
Modeling the Vulnerability of an Urban Groundwater System due to the Combined Impacts of Climate Change and Management Scenarios
Climate change impact on a groundwater-dependent small urban town has been investigated in the semiarid hard rock aquifer in southern India. A distributed groundwater model was used to simulate the groundwater levels in the study region for the ...
M. Sekhar; M. Shindekar; Sat K. Tomer; P. Goswami
Institutional Arrangements for Effective Groundwater Management to Halt Land Subsidence
In the Upper Galveston Bay region of the Texas coastal zone, water from naturally replenished underground aquifers provides much of the freshwater supply for municipal, industrial and agricultural needs. The availability of these easily accessible low cost freshwater supplies has contributed to the building of a strong and dynamic economic base. However use of these common water supplies in excess of natural replenishment has resulted in a gradual but accelerated and irreversible subsidence of the land surface throughout the region. The cause is long term and due to collective use of groundwater. This natural phenomenon generally exhibits the range of characteristics expected when the carrying capacity of valuable common property resources is exceeded under dynamic socio-economic use pressures. These characteristics include competing and conflicting resource use, externalities (socioeconomic and environmental impacts) and complex social, legal and political dilemmas. Regional use of groundwater in excess of the "safe" production potential of the underground water bearing system has caused physical and economic losses in the coastal areas. Surface subsidence in excess of 8.5 feet has resulted in serious socio-economic and environmental impacts because of the loss of land elevations in already low shoreland areas. Bay waters have permanently inundated previously valuable commercial, industrial, recreational, municipal and private property. Subsidence has increased the susceptibility of much of the region to destruction through tidal surges generated by tropical storms and hurricanes. Conceivably, the somewhat inchoate interests of approximately 350,000 persons and large numbers of state and private enterprises located in susceptible coastal areas are affected. The natural phenomenon of subsidence, and its technical solution decreased groundwater use and/or use of alternative surface water supplies, pose difficult institutional questions and equity issues both to public and private sectors that as yet remain unanswered and unresolved. Traditionally, groundwater has been treated as a free good or at least a relatively cheap one. Since owners of private property overlying the water bearing system are afforded legal proprietary interest in the water in Texas, the regional groundwater resources have been developed and used primarily on an individual, uncoordinated basis with little or no concern for the relationship between extraction and natural replenishment, or regard for any collateral effects of groundwater use. Social costs are unregistered under such an arrangement and only private costs are considered by users. Institutions governing the use and allocation of groundwater resources were primitive or nonexistent. Therefore, effective action to arrest the ever increasing overdraft was absent. With increased water use, however, subsidence related costs have become apparent. For many years the majority of groundwater users ignored the subsidence problem since it was thought to affect and indeed was only felt by a minority of local land owners and waters users bordering on coastal bays and other water courses. Even though the implication (for example, hurricane threat) of subsidence to the region was recognized, an internal cost differential between groundwater and surface water sources hindered voluntary conversion to the higher cost surface water by the collectivity of groundwater users. Aggregate social costs generated by overuse of groundwater exceeded the aggregate price differential, but these social costs were largely unregistered. They were felt only by a minority of community interests in a manner disproportionate to their use of the groundwater. Logically, therefore, intensive use of inexpensive groundwater continued. Although industrial, municipal, agricultural and private interests were interrelated through the common use of the aquifer, a basis for collective action was difficult because of conflicting interests. In the early 1970's a movement bega
Brah, W. L.; Jones, L. L.
A study of radon-222 concentrations in North Carolina groundwater
The groundwater of 400 North Carolina homes was sampled to ascertain the distribution and extent of {sup 222}Rn in North Carolina groundwater. Arithmetic mean (AM) and geometric mean (GM) concentrations of 1,816 pCi L{sup {minus}1} and 656 pCi L{sup {minus}1} were found for the state. These results indicate that two-thirds of 114{degree}C. homes served by groundwater exceed the EPA proposed 300 pCi L{sup {minus}1} maximum contaminant level (MCL). Only 2% of NC homes exceeded 10,000 pCi L-1. The Eastern region had the lowest radon concentrations by far, with a GM of 2-)0 pCi L{sup {minus}1}. The Central region and Western region had GM`s of 794 pCi L{sup {minus}1} and 1,032 pCi L{sup {minus}1} respectively. The groundwater data approached a log normal distribution. No consistent trends were noted in the relationship between indoor radon concentrations and groundwater radon concentrations. A correlation coefficient of 0.00921 revealed a very weak linear relationship.
Evans, J.P.
Hanford Site Groundwater Monitoring for Fiscal Year 2000
This report presents the results of groundwater and vadose zone monitoring and remediation for fiscal year 2000 on the U.S. Department of Energy's Hanford Site, Washington. The most extensive contaminant plumes are tritium, iodine-129, and nitrate, which all had multiple sources and are very mobile in groundwater. Carbon tetrachloride and associated organic constituents form a relatively large plume beneath the central part of the Site. Hexavalent chromium is present in smaller plumes beneath the reactor areas along the river and beneath the central part of the site. Strontium-90 exceeds standards beneath each of the reactor areas, and technetium-99 and uranium are present in the 200 Areas. RCRA groundwater monitoring continued during fiscal year 2000. Vadose zone monitoring, characterization, remediation, and several technical demonstrations were conducted in fiscal year 2000. Soil gas monitoring at the 618-11 burial ground provided a preliminary indication of the location of tritium in the vadose zone and in groundwater. Groundwater modeling efforts focused on 1) identifying and characterizing major uncertainties in the current conceptual model and 2) performing a transient inverse calibration of the existing site-wide model. Specific model applications were conducted in support of the Hanford Site carbon tetrachloride Innovative Treatment Remediation Technology; to support the performance assessment of the Immobilized Low-Activity Waste Disposal Facility; and in development of the System Assessment Capability, which is intended to predict cumulative site-wide effects from all significant Hanford Site contaminants.
Tracing And Quantifying Magmatic Carbon Discharge In Cold Groundwaters-
source source History View New Pages Recent Changes All Special Pages Semantic Search/Querying Get Involved Help Apps Datasets Community Login | Sign Up Search Page Edit History Facebook icon Twitter icon » Tracing And Quantifying Magmatic Carbon Discharge In Cold Groundwaters- Lessons Learned From Mammoth Mountain, Usa Jump to: navigation, search GEOTHERMAL ENERGYGeothermal Home Journal Article: Tracing And Quantifying Magmatic Carbon Discharge In Cold Groundwaters- Lessons Learned From Mammoth Mountain, Usa Details Activities (3) Areas (1) Regions (0) Abstract: A major campaign to quantify the magmatic carbon discharge in cold groundwaters around Mammoth Mountain volcano in eastern California was carried out from 1996 to 1999. The total water flow from all sampled cold springs was >=1.8_107 m3/yr draining an area that receives an estimated
Treatment Resin Reduces Costs, Materials in Hanford Groundwater Cleanup -
Treatment Resin Reduces Costs, Materials in Hanford Groundwater Treatment Resin Reduces Costs, Materials in Hanford Groundwater Cleanup - Efficiency delivered more than $6 million in cost savings, $3 million in annual savings Treatment Resin Reduces Costs, Materials in Hanford Groundwater Cleanup - Efficiency delivered more than $6 million in cost savings, $3 million in annual savings June 4, 2013 - 12:00pm Addthis Media Contacts Geoff Tyree, DOE firstname.lastname@example.com (509) 376-4171 Dee Millikin, CHPRC email@example.com (509) 376-1297 RICHLAND, Wash. - U.S. Department of Energy (DOE) contractor CH2M HILL Plateau Remediation Company is using a treatment material that has delivered more than $6 million in cost savings to date and is delivering more than $3 million in annual cost savings and efficiencies in treatment
EIS-0198: Uranium Mill Tailings Remedial Action Groundwater Project |
198: Uranium Mill Tailings Remedial Action Groundwater Project 198: Uranium Mill Tailings Remedial Action Groundwater Project EIS-0198: Uranium Mill Tailings Remedial Action Groundwater Project SUMMARY This EIS assesses the potential programmatic impacts of conducting the Ground Water Project, provides a method for determining the site-specific ground water compliance strategies, and provides data and information that can be used to prepare site-specific environmental impacts analyses more efficiently. PUBLIC COMMENT OPPORTUNITIES None available at this time. DOCUMENTS AVAILABLE FOR DOWNLOAD April 28, 1997 EIS-0198: Record of Decision Uranium Mill Tailings Remedial Action (UMTRA) Ground Water Project (April 1997) December 1, 1996 EIS-0198: Programmatic Environmental Impact Statement Uranium Mill Tailings Remedial Action (UMTRA) Ground Water Project
Groundwater Protection Rules Coal Mining Operations (West Virginia) |
Protection Rules Coal Mining Operations (West Virginia) Protection Rules Coal Mining Operations (West Virginia) Groundwater Protection Rules Coal Mining Operations (West Virginia) < Back Eligibility Utility Commercial Investor-Owned Utility Industrial Municipal/Public Utility Local Government Rural Electric Cooperative Tribal Government Institutional Nonprofit Program Info State West Virginia Program Type Siting and Permitting Provider Department of Environmental Protection These rules establish a series of practices for the protection of groundwater which are to be followed by any person who conducts coal mining operations subject to the provisions of West Virginia Groundwater Protection Act and subject to regulation under the West Virginia Coal Mining and Reclamation Act and/or under West Virginia Water Pollution
Paducah Site Undergoing Steady Groundwater Cleanup with Variety of Methods
Site Undergoing Steady Groundwater Cleanup with Variety of Site Undergoing Steady Groundwater Cleanup with Variety of Methods Paducah Site Undergoing Steady Groundwater Cleanup with Variety of Methods June 1, 2012 - 12:00pm Addthis The yellow outline depicts an area southeast of the C-400 Cleaning Building, background, where electrical resistance heating will be used to remove trichloroethene (TCE) down to 60 feet below ground. Electrodes will heat the chemical into a vapor that can be pumped to the surface and treated in the white structure, center. The yellow outline depicts an area southeast of the C-400 Cleaning Building, background, where electrical resistance heating will be used to remove trichloroethene (TCE) down to 60 feet below ground. Electrodes will heat the chemical into a vapor that can be pumped to the surface and
Groundwater Classification and Standards (North Carolina) | Department of
Classification and Standards (North Carolina) Classification and Standards (North Carolina) Groundwater Classification and Standards (North Carolina) < Back Eligibility Commercial Industrial Construction Transportation Savings Category Alternative Fuel Vehicles Hydrogen & Fuel Cells Buying & Making Electricity Water Home Weatherization Solar Wind Program Info State North Carolina Program Type Environmental Regulations Siting and Permitting Provider Department of Environment and Natural Resources The rules established in this Subchapter 2L of North Carolina Administrative Code Title 15A are intended to maintain and preserve the quality of the groundwaters, prevent and abate pollution and contamination of the waters of the state, protect public health, and permit management of the groundwaters for their best usage by the citizens of North Carolina. It
Groundwater Monitoring Report Project Shoal Area, Corrective Action Unit 447
This report presents the 2007 groundwater monitoring results collected by the U.S. Department of Energy (DOE) Office of Legacy Management (LM) at the Project Shoal Area (PSA) Corrective Action Unit (CAU) 447 located in Churchill County, Nevada. Responsibility for the environmental site restoration of the PSA was transferred from the DOE Office of Environmental Management (DOE-EM) to DOE-LM on October 1, 2006. Requirements for CAU 447, as specified in the Federal Facility Agreement and Consent Order (FFACO 2005) entered into by DOE, the U.S. Department of Defense (DOD), and the State of Nevada, includes groundwater monitoring in support of site closure. This is the first groundwater monitoring report prepared by DOE-LM for the PSA.
Hanford Site Groundwater Monitoring for Fiscal Year 2003
This report presents the results of groundwater and vadose zone monitoring and remediation for fiscal year 2003 (October 2002 through September 2003) on the U.S. Department of Energy's Hanford Site, Washington. The most extensive contaminant plumes in groundwater are tritium, iodine-129, and nitrate, which all had multiple sources and are very mobile in groundwater. The largest portions of these plumes are migrating from the central Hanford Site to the southeast, toward the Columbia River. Concentrations of tritium, nitrate, and some other contaminants continued to exceed drinking water standards in groundwater discharging to the river in some locations. However, contaminant concentrations in river water remained low and were far below standards. Carbon tetrachloride and associated organic constituents form a relatively large plume beneath the central part of the Hanford Site. Hexavalent chromium is present in smaller plumes beneath the reactor areas along the river and beneath the central part of the site. Strontium-90 exceeds standards beneath all but one of the reactor areas, and technetium-99 and uranium are present in the 200 Areas. Uranium exceeds standards in the 300 Area in the south part of the Hanford Site. Minor contaminant plumes with concentrations greater than standards include carbon-14, cesium-137, cis-1,2-dichloroethene, cyanide, fluoride, plutonium, and trichloroethene. Monitoring for the ''Comprehensive Environmental Response, Compensation, and Liability Act'' is conducted in 11 groundwater operable units. The purpose of this monitoring is to define and track plumes and to monitor the effectiveness of interim remedial actions. Interim groundwater remediation in the 100 Areas continued with the goal of reducing the amount of chromium (100-K, 100-D, and 100-H) and strontium-90 (100-N) reaching the Columbia River. The objective of two interim remediation systems in the 200 West Area is to prevent the spread of carbon tetrachloride and technetium-99/uranium plumes. ''Resource Conservation and Recovery Act'' groundwater monitoring continued at 24 waste management areas during fiscal year 2003: 15 under interim or final status detection programs and data indicate that they are not adversely affecting groundwater; 7 under interim status groundwater quality assessment programs to assess contamination; and 2 under final status corrective-action programs. During calendar year 2003, drillers completed seven new RCRA monitoring wells, nine wells for CERCLA, and two wells for research on chromate bioremediation. Vadose zone monitoring, characterization, and remediation continued in fiscal year 2003. Remediation and associated monitoring continued at a soil-vapor extraction system in the 200 West Area, which removes gaseous carbon tetrachloride from the vadose zone. Soil vapor also was sampled to locate carbon tetrachloride sites with the potential to impact groundwater in the future. DOE uses geophysical methods to monitor potential movement of contamination beneath single-shell tank farms. During fiscal year 2003, DOE monitored selected boreholes within each of the 12 single-shell tank farms. In general, the contaminated areas appeared to be stable over time. DOE drilled new boreholes at the T Tank Farm to characterize subsurface contamination near former leak sites. The System Assessment Capability is a set of computer modules simulating movement of contaminants from waste sites through the vadose zone and groundwater. In fiscal year 2003, it was updated with the addition of an atmospheric transport module and with newer versions of models including an updated groundwater flow and transport model.
Expediting Groundwater Sampling at Hanford and Making It Safer
The CH2M HILL Plateau Remediation Company (CHPRC) manages the groundwatermonitoring programs at the Department of Energy's 586-square-mile Hanford site in southeastern Washington state. These programs are regulated by the Resource Conservation and Recovery Act (RCRA), the Comprehensive Environmental Response Compensation and Liability Act (CERCLA), and the Atomic Energy Act (AEA). The purpose of monitoring is to track existing groundwater contamination from past practices, as well as other potential contamination that might originate from RCRA treatment, storage, and disposal (TSD) facilities. An integral part of the groundwater-monitoring program involves taking samples of the groundwater and measuring the water levels in wells scattered across the site. Each year, more than 1,500 wells are accessed for a variety of reasons.
Connell, Carl W. Jr. [CH2M HILL Plateau Remediation Company, Richland, WA (United States); Carr, Jennifer S. [CH2M HILL Plateau Remediation Company, Richland, WA (United States); Hildebrand, R. Douglas [Department of Energy - Richland Operations Office, Richland, WA (United States); Schatz, Aaron L. [CH2M HILL Plateau Remediation Company, Richland, WA (United States); Conley, S. F. [CH2M HILL Plateau Remediation Company, Richland, WA (United States); Brown, W. L. [Lockheed Martin Systems Information, Richland, WA (United States)
Monitoring Plan for RCRA Groundwater Assessment at the 216-U-12 Crib
This plan provides updates the ongoing RCRA interim status groundwater monitoring program for the U-12 crib and provides a proposed RCRA final status post-closure groundwater monitoring program.
Williams, Bruce A.; Chou, Charissa J.
Seasonal dynamics in costal aquifers : investigation of submarine groundwater discharge through field measurements and numerical models
The fresh and saline groundwater flowing from coastal aquifers into the ocean comprise submarine groundwater discharge (SGD). This outflow is an important pathway for the transport of nutrients and contaminants, and has ...
Michael, Holly Anne, 1976-
Distribution and Geochemical Evolution of Fluoride in Groundwater of Taiyuan Basin, China
Hydrogeochemistry data were utilized to understand origin, distribution, and geochemical evolution of the high-fluoride groundwater in Taiyuan basin, China. In the study area, the spatial distribution of the high fluoride groundwater are strictly controlled ... Keywords: fluoride, geochemical mechanism
Xiangquan Li; Xinwei Hou; Zhichao Zhou; Lingxia Liu
A radiocarbon method and multi-tracer approach to quantifying groundwater discharge to coastal waters
Groundwater discharge into estuaries and the coastal ocean is an important mechanism for the transport of dissolved chemical species to coastal waters. Because many dissolved species are present in groundwater in concentrations ...
Gramling, Carolyn M
A Quasi-Three-Dimensional Variably Saturated Groundwater Flow Model for Climate Modeling
In this study, a quasi-three-dimensional, variably saturated groundwater flow model was developed by approximately dividing the three-dimensional soil water and groundwater flow into an unsaturated vertical soil water flow and a horizontal ...
Zhenghui Xie; Zhenhua Di; Zhendong Luo; Qian Ma
Effect of hydrological flow pattern on groundwater arsenic concentration in Bangladesh by Khandaker Ashfaque.
Widespread arsenic contamination of groundwater has become a major concern in Bangladesh since the water supply, particularly in rural areas, is heavily dependent on groundwater. However, relative to the extent of research ...
Ashfaque, Khandaker
The Effect of Groundwater Inflow on Evaporation from a Saline Lake
A decade study of the hydrometeorology of Big Quill Lake in Saskatchewan, a saline prairie lake, has effectively used remote sensing to delineate groundwater inflow. The lake covers an area of 250 square kilometers with the groundwater seeping ...
Jeffrey M. Whiting