ab cBFSd ab 64 64 cBFSd bKernel 1c 14 Web VLSI Graph500 [1] Graph500 Top 500 Graph (Compressed Sparse Row)CSC (Compressed SparseColumn)cBFS BFSBFSdBFS BFS 1 5 2-2 BFS Graph500 OpenMP MPICrayExpand CQ C CQ CQPREDNQ CQ FoldPRED FoldCQCQ Fold CQ Fold Expand (R-1)fold(C-1) 2 3 Graph500 3 Graph
Sanfilippo, Antonio P.
2005-12-27
Graph theory is a branch of discrete combinatorial mathematics that studies the properties of graphs. The theory was pioneered by the Swiss mathematician Leonhard Euler in the 18th century, commenced its formal development during the second half of the 19th century, and has witnessed substantial growth during the last seventy years, with applications in areas as diverse as engineering, computer science, physics, sociology, chemistry and biology. Graph theory has also had a strong impact in computational linguistics by providing the foundations for the theory of features structures that has emerged as one of the most widely used frameworks for the representation of grammar formalisms.
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity ofkandz-cm11 Outreach Home RoomPreservationBio-Inspired SolarAbout /Two0 -Using supercritical carbon dioxide as aGraphs
Wong, Pak C. (Richland, WA); Mackey, Patrick S. (Kennewick, WA); Perrine, Kenneth A. (Richland, WA); Foote, Harlan P. (Richland, WA); Thomas, James J. (Richland, WA)
2008-12-23
Methods for visualizing a graph by automatically drawing elements of the graph as labels are disclosed. In one embodiment, the method comprises receiving node information and edge information from an input device and/or communication interface, constructing a graph layout based at least in part on that information, wherein the edges are automatically drawn as labels, and displaying the graph on a display device according to the graph layout. In some embodiments, the nodes are automatically drawn as labels instead of, or in addition to, the label-edges.
Graphs, matrices, and the GraphBLAS: Seven good reasons
Kepner, Jeremy; Bader, David; Buluç, Ayd?n; Gilbert, John; Mattson, Timothy; Meyerhenke, Henning
2015-01-01
The analysis of graphs has become increasingly important to a wide range of applications. Graph analysis presents a number of unique challenges in the areas of (1) software complexity, (2) data complexity, (3) security, (4) mathematical complexity, (5) theoretical analysis, (6) serial performance, and (7) parallel performance. Implementing graph algorithms using matrix-based approaches provides a number of promising solutions to these challenges. The GraphBLAS standard (istcbigdata.org/GraphBlas) is being developed to bring the potential of matrix based graph algorithms to the broadest possible audience. The GraphBLAS mathematically defines a core set of matrix-based graph operations that can be used to implement a wide class of graph algorithms in a wide range of programming environments. This paper provides an introduction to the GraphBLAS and describes how the GraphBLAS can be used to address many of the challenges associated with analysis of graphs.
Graphs, matrices, and the GraphBLAS: Seven good reasons
DOE Public Access Gateway for Energy & Science Beta (PAGES Beta)
Kepner, Jeremy; Bader, David; Buluç, Ayd?n; Gilbert, John; Mattson, Timothy; Meyerhenke, Henning
2015-01-01
The analysis of graphs has become increasingly important to a wide range of applications. Graph analysis presents a number of unique challenges in the areas of (1) software complexity, (2) data complexity, (3) security, (4) mathematical complexity, (5) theoretical analysis, (6) serial performance, and (7) parallel performance. Implementing graph algorithms using matrix-based approaches provides a number of promising solutions to these challenges. The GraphBLAS standard (istcbigdata.org/GraphBlas) is being developed to bring the potential of matrix based graph algorithms to the broadest possible audience. The GraphBLAS mathematically defines a core set of matrix-based graph operations that can be used to implementmore »a wide class of graph algorithms in a wide range of programming environments. This paper provides an introduction to the GraphBLAS and describes how the GraphBLAS can be used to address many of the challenges associated with analysis of graphs.« less
Dismantling sparse random graphs
Janson, Svante
2007-01-01
We consider the number of vertices that must be removed from a graph G in order that the remaining subgraph has no component with more than k vertices. Our principal observation is that, if G is a sparse random graph or a random regular graph on n vertices with n tending to infinity, then the number in question is essentially the same for all values of k such that k tends to infinity but k=o(n).
Lothian, Josh; Powers, Sarah S; Sullivan, Blair D; Baker, Matthew B; Schrock, Jonathan; Poole, Stephen W
2013-12-01
The benchmarking effort within the Extreme Scale Systems Center at Oak Ridge National Laboratory seeks to provide High Performance Computing benchmarks and test suites of interest to the DoD sponsor. The work described in this report is a part of the effort focusing on graph generation. A previously developed benchmark, SystemBurn, allowed the emulation of dierent application behavior profiles within a single framework. To complement this effort, similar capabilities are desired for graph-centric problems. This report examines existing synthetic graph generator implementations in preparation for further study on the properties of their generated synthetic graphs.
*D. J. Kelleher
2011-09-30
Spectral Graph Theory. *D. J. Kelleher2. 2Department of Mathematics. University of Connecticut. UConn— SIGMA Seminar — Fall 2011. D. J. Kelleher. Spectral ...
Vacuum Energy in Quantum Graphs
Wilson, Justin
2007-07-14
We calculate the vacuum energy in quantum graphs. Vacuum energy arose in quantum physics but has an independent mathematical interest as a functional carrying information about the eigenvalue spectrum of a system. A quantum graph is a metric graph...
Switching Graphs Jan Friso Groote
Groote, Jan Friso
Switching Graphs Jan Friso Groote J.F.Groote@tue.nl Bas Ploeger S.C.W.Ploeger@tue.nl Department The Netherlands Abstract Switching graphs are graphs containing switches. By using boolean functions called switch settings, these switches can be put in a fixed direction to obtain an ordinary graph. For many problems
Graph Automatic Semigroups Rachael Carey
St Andrews, University of
Graph Automatic Semigroups Rachael Carey NBSAN St Andrews 22/04/2015 Rachael Carey NBSAN St Andrews Graph Automatic Semigroups #12;Regular languages An alphabet is a set of symbols.The elements are accepted by finite state automata. Rachael Carey NBSAN St Andrews Graph Automatic Semigroups #12;Graph
A Characterization of Seymour Graphs
Kostochka, Alexandr V.
A Characterization of Seymour Graphs A. A. Ageev and A. V. Kostochka,* INSTITUTE OF MATHEMATICS undirected graph G is called a Seymour graph if the maximum number of edge disjoint T-cuts is equal to be subfamilies of Seymour graphs (Seymour J. Comb. Theory B 49 (1990), 189Â222; Proc. London Math. Soc. Ser. (3
Chebotarev, Pavel
2008-01-01
For a weighted multidigraph, let $f_{ij}$ be the total weight of spanning converging forests that have vertex $i$ in a tree converging to $j$. We prove that $f_{ij}f_{jk}=f_{ik}f_{jj}$ if and only if every directed path from $i$ to $k$ contains $j$ (a graph bottleneck equality). Otherwise, $f_{ij}f_{jk}inequality). In a companion paper, this inequality provides the foundation for the construction of a new family of graph distances by ensuring the fulfillment of the triangle inequality. This stems from the fact that the graph bottleneck inequality is a multiplicative analogue of the triangle inequality for proximities.
Zager, Laura (Laura A.)
2005-01-01
Measures of graph similarity have a broad array of applications, including comparing chemical structures, navigating complex networks like the World Wide Web, and more recently, analyzing different kinds of biological data. ...
Graph Grammars Matilde Marcolli
Marcolli, Matilde
to computer science, Lecture Notes in Computer Science, Vol. 532, Springer, 1990. G. Rozenberg, Handbook Grammars H. Ehrig, K. Ehrig, U. Prange, G. Taentzer, Fundamentals of algebraic graph transformation. New
Phylogenetic Toric Varieties on Graphs
Buczynska, Weronika J.
2010-10-12
We define the phylogenetic model of a trivalent graph as a generalization of a binary symmetric model of a trivalent phylogenetic tree. If the underlining graph is a tree, the model has a parametrization that can be expressed ...
Open Graphs and Computational Reasoning
Dixon, Lucas; Ross, Duncan; Aleks, Kissinger
2010-01-01
We present a form of algebraic reasoning for computational objects which are expressed as graphs. Edges describe the flow of data between primitive operations which are represented by vertices. These graphs have an interface ...
Subdominant pseudoultrametric on graphs
Dovgoshei, A A; Petrov, E A
2013-08-31
Let (G,w) be a weighted graph. We find necessary and sufficient conditions under which the weight w:E(G)?R{sup +} can be extended to a pseudoultrametric on V(G), and establish a criterion for the uniqueness of such an extension. We demonstrate that (G,w) is a complete k-partite graph, for k?2, if and only if for any weight that can be extended to a pseudoultrametric, among all such extensions one can find the least pseudoultrametric consistent with w. We give a structural characterization of graphs for which the subdominant pseudoultrametric is an ultrametric for any strictly positive weight that can be extended to a pseudoultrametric. Bibliography: 14 titles.
Temporal Representation in Semantic Graphs
Levandoski, J J; Abdulla, G M
2007-08-07
A wide range of knowledge discovery and analysis applications, ranging from business to biological, make use of semantic graphs when modeling relationships and concepts. Most of the semantic graphs used in these applications are assumed to be static pieces of information, meaning temporal evolution of concepts and relationships are not taken into account. Guided by the need for more advanced semantic graph queries involving temporal concepts, this paper surveys the existing work involving temporal representations in semantic graphs.
Matthew McKague
2010-10-11
We give a construction for a self-test for any connected graph state. In other words, for each connected graph state we give a set of non-local correlations that can only be achieved (quantumly) by that particular graph state and certain local measurements. The number of correlations considered is small, being linear in the number of vertices in the graph. We also prove robustness for the test.
Martin, Jeremy L.
2003-01-01
TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 355, Number 10, Pages 4151{4169 S 0002-9947(03)03321-X Article electronically published on May 15, 2003 GEOMETRY OF GRAPH VARIETIES JEREMY L. MARTIN Abstract. A picture P of a graph G =(V...;E) consists of a point P(v)foreach vertex v2V and a line P(e)foreachedgee2E, all lying in the projective plane over a eld k and subject to containment conditions corresponding to incidence in G.Agraph variety is an algebraic set whose points parametrize...
Ramsey Minimal Graphs Bela Bollobas
Kohayakawa, Yoshiharu
Ramsey Minimal Graphs BÂ´ela BollobÂ´as Department of Mathematical Sciences University of Memphis of the edges of contains a red copy of G or a blue copy of H. A pair of graphs (G, H) is said to be Ramsey- connected graph that does not contain induced cycles of length at least , then the pair (Ck , H) is Ramsey
Densities in graphs and matroids
Kannan, Lavanya
2009-05-15
Certain graphs can be described by the distribution of the edges in its subgraphs. For example, a cycle C is a graph that satisfies |E(H)| |V (H)| < |E(C)| |V (C)| = 1 for all non-trivial subgraphs of C. Similarly, a tree T is a graph that satisfies...
Quantum chaos on discrete graphs
Uzy Smilansky
2007-04-26
Adapting a method developed for the study of quantum chaos on {\\it quantum (metric)} graphs \\cite {KS}, spectral $\\zeta$ functions and trace formulae for {\\it discrete} Laplacians on graphs are derived. This is achieved by expressing the spectral secular equation in terms of the periodic orbits of the graph, and obtaining functions which belongs to the class of $\\zeta$ functions proposed originally by Ihara \\cite {Ihara}, and expanded by subsequent authors \\cite {Stark,Sunada}. Finally, a model of "classical dynamics" on the discrete graph is proposed. It is analogous to the corresponding classical dynamics derived for quantum graphs \\cite {KS}.
Finite Prime Distance Graphs and 2-Odd Graphs Joshua D. Laison, Colin Starr, and Andrea Walker
Laison, Josh
that trees, cycles, and bipartite graphs are prime distance graphs, and that Dutch windmill graphs and paper, Vinogradov's Theorem, and Ramar´e's Theorem, respectively; and we show that Dutch windmill graphs and paper
Chebotarev, Pavel
2010-01-01
A matrix $S=(s_{ij})_{n\\times n}$ is said to determine a \\emph{transitional measure} for a digraph $\\Gamma$ on $n$ vertices if for all $i,j,k\\in\\{1,...,n\\},$ the \\emph{transition inequality} $s_{ij}s_{jk}\\le s_{ik}s_{jj}$ holds and reduces to the equality (called the \\emph{graph bottleneck identity}) if and only if every path in $\\Gamma$ from $i$ to $k$ contains $j$. We show that every positive transitional measure produces a distance by means of a logarithmic transformation. Moreover, the resulting distance $d(\\cdot,\\cdot)$ is \\emph{graph-geodetic}, that is, $d(i,j)+d(j,k)=d(i,k)$ holds if and only if every path from $i$ to $k$ contains $j$. Five types of matrices that determine transitional measures for a strong digraph are considered, namely, the matrices of path weights, connection reliabilities, route weights, and the weights of in-forests and out-forests. The results obtained have undirected counterparts. In [P. Chebotarev, A family of graph distances generalizing both the shortest-path and the resistan...
Adventures in Graph Ramsey Theory /
Parrish, Andrew T.
2013-01-01
1.1 Additive Ramsey theory . . . . . . . . . . .3.1 Large Ramsey . . . . . . . . . . . . . . .additive- and graph-Ramsey theory 1.3 The compactness
Wang, Suijie
2010-01-01
In this paper, we give a Laplacian characterization of the product of the complete graphs $K_m$ with trees, unicyclic graphs, and bicyclic graphs. More precisely, let $G$ be a connected graph with at most two independent cycles. If $G$ is neither $C_{6}$ nor $\\Theta_{3,2,5}$ and determined by its Laplacain spectrum, then the product $G\\times K_{m}$ is also a graph determined by its Laplacian spectrum. In addition, we find the cosepctral graphs of $C_{6}\\times K_{m}$ and $\\Theta_{3,2,5}\\times K_{m}$, where the case $m=1$ is shown in Figure \\ref{F1} and \\ref{F2}.
Graph Algorithms in the Internet Age
Stanton, Isabelle Lesley
2012-01-01
5.2 Classic Matching Algorithms . . . . . . . . . . . . .4.3 Analysis of Algorithms on Random Graphs . . . . . . . .Graph Problems 5 An Introduction to Matching Algorithms 5.1
Generating Reports & Graphs in Portfolio Manager | Department...
Generating Reports & Graphs in Portfolio Manager Generating Reports & Graphs in Portfolio Manager This presentation, given through the DOE's Technical Assitance Program (TAP),...
Chromatic scheduling of dynamic data-graph computations
Kaler, Tim (Tim F. S.)
2013-01-01
Data-graph computations are a parallel-programming model popularized by programming systems such as Pregel, GraphLab, PowerGraph, and GraphChi. A fundamental issue in parallelizing data-graph computations is the avoidance ...
Constrained Ramsey Numbers of Graphs
Jiang, Tao
Constrained Ramsey Numbers of Graphs Robert E. Jamison,1 Tao Jiang,2* and Alan C. H. Ling3 1-like trees. Ă? 2002 Wiley Periodicals, Inc. J Graph Theory 42: 1Â16, 2003 Keywords: Ramsey; monochromatic edges have the same color and rainbow iff all of its edges have different colors. In classical Ramsey
Estrada, Ernesto
2015-01-01
A generalization of the random geometric graph (RGG) model is proposed by considering a set of points uniformly and independently distributed on a rectangle of unit area instead of on a unit square \\left[0,1\\right]^{2}. The topological properties, such as connectivity, average degree, average path length and clustering, of the random rectangular graphs (RRGs) generated by this model are then studied as a function of the rectangle sides lengths a and b=1/a, and the radius r used to connect the nodes. When a=1 we recover the RGG, and when a\\rightarrow\\infty the very elongated rectangle generated resembles a one-dimensional RGG. We provided computational and analytical evidence that the topological properties of the RRG differ significantly from those of the RGG. The connectivity of the RRG depends not only on the number of nodes as in the case of the RGG, but also on the side length of the rectangle. As the rectangle is more elongated the critical radius for connectivity increases following first a power-law an...
Theoretical Computer Science 332 (2005) 6381 www.elsevier.com/locate/tcs
Chen, Peter
2005-01-01
Theoretical Computer Science 332 (2005) 6381 www.elsevier.com/locate/tcs New bounds for randomized be decreased from (n) to (n/ w) in the case of a complete graph. Additionally, we introduce a class of graphs called r-partite directed collars and obtain analogous bounds on the expected delivery time
Contagious Sets in Random Graphs Uriel Feige
Contagious Sets in Random Graphs Uriel Feige Michael Krivelevich Daniel Reichman August 10, 2014. A contagious set is a set whose activation results with the entire graph being active. Given a graph G, let m(G, 2) be the minimal size of a contagious set. We consider the binomial random graph G := G(n, p
Johan Kok; K. P. Chithra; N. K. Sudev; C. Susanth
2015-04-09
A \\textit{primitive hole} of a graph $G$ is a cycle of length $3$ in $G$. The number of primitive holes in a given graph $G$ is called the primitive hole number of that graph $G$. The primitive degree of a vertex $v$ of a given graph $G$ is the number of primitive holes incident on the vertex $v$. In this paper, we introduce the notion of set-graphs and study the properties and characteristics of set-graphs. We also check the primitive hole number and primitive degree of set-graphs. Interesting introductory results on the nature of order of set-graphs, degree of the vertices corresponding to subsets of equal cardinality, the number of largest complete subgraphs in a set-graph etc. are discussed in this study. A recursive formula to determine the primitive hole number of a set-graph is also derived in this paper.
Rainbow Connection Number of Graph Power and Graph Products
Basavaraju, Manu; Rajendraprasad, Deepak; Ramaswamy, Arunselvan
2011-01-01
Rainbow connection number, $rc(G)$, of a connected graph G is the minimum number of colors needed to color its edges, so that every pair of vertices is connected by at least one path in which no two edges are colored the same. In this paper we study the rainbow connection number with respect to three important graph product operations (cartesian product, lexicographic product and strong product) and the operation of graph powering. More specifically we show the following: (Here, $r(G)$ denotes the radius of $G$, an obvious lower bound for $rc(G)$) (1.) For a connected graph $G$, let $G^{k}$ be the k-th power of $G$. We show that for $k \\ge 2$, $r(G^{k}) \\le rc(G^{k}) \\le 2r(G^{k}) + 1$. The upper bound is tight up to an additive constant of 1. (2.) For two-connected, non-trivial graphs $G$ and $H$, let $G \\Box H$ be the Cartesian Product of $G$ and $H$. We show that $r(G \\Box H) \\le rc(G \\Box H)$ $\\le$ $2r(G \\Box H)$. The bound is tight. (3.) For two graphs $G$ and $H$ such that $G$ is a connected, non-trivia...
38 Chapteri - Functions and Graphs
a) Predict the pollution in 2007, 2010, and 2020. b) Graph the function over the interval [0, 50]. At most, how many y-intercepts can a function have? Explain.
Approximate Graph Products Marc Hellmutha
Stadler, Peter F.
Approximate Graph Products Marc Hellmutha , Wilfried Imrichb , Werner Kl¨ocklb , Peter F. Stadlera or fingers) can vary independently of other traits, or Email addresses: marc@bioinf.uni-leipzig.de (Marc
Doing time : inducing temporal graphs
Bramsen, Philip James
2006-01-01
We consider the problem of constructing a directed acyclic graph that encodes temporal relations found in a text. The unit of our analysis is a temporal segment, a fragment of text that maintains temporal coherence. The ...
Some algorithmic results in graph imbeddings
Joshi, Sanjay
1990-01-01
, is constructed by: 1. joining vertez us in graph G to vertez vr in H by an edge b, and 8. joining vertez uq in graph G to vertez vq in H by an edge V. The figure 2. 2 on the following page shows the double bar amalgamation of graphs Gq and Gq. We select a... vertex pair (un u2) in the graph Gq which are connected by an edge and similar vertex pair (vr, vq) on the graph Gz. The connecting bars b and b' join these two graphs at the selected vertices. 93 From the previous lemmas we can now prove, the mair...
Exploring the Graph of Graphs: Network Evolution and Centrality Distances
Pignolet, Yvonne Anne; Schmid, Stefan; Tredan, Gilles
2015-01-01
The topological structure of complex networks has fascinated researchers for several decades, and today we have a fairly good understanding of the types and reoccurring characteristics of many different complex networks. However, surprisingly little is known today about models to compare complex graphs, and quantitatively measure their similarity and dynamics. In the past a variety of node centralities, i.e., functions which assign values to nodes to represent their importance in the graph. Based on such centralities we propose a natural similarity measure for complex networks: the centrality distance $d_C$, the difference between two graphs with respect to a given node centrality $C$. Centrality distances can take the specific roles of the different nodes in the network into account, and have many interesting applications. As a case study, we investigate the evolution of networks with respect to centrality distances and their approximations based on closeness, betweenness, pagerank, clustering and degree cen...
Detecting Tampering in Random Graphs
Pinsky, Ross G
2012-01-01
Let $\\mathcal{G}_n=(V_n,E_n)$ be a growing sequence of deterministic finite graphs, with $V_n$ denoting the vertices and $E_n$ denoting the edges. Consider the random graph $\\mathcal{G}_n(p_n)=(V_n, E_n(p_n))$ obtained by including any given edge with probability $p_n$, independent of other edges, and let $P_n^{p_n}$ denote the corresponding probability measure on $\\mathcal{G}_n$. Now tamper with the random graph in some regular way. For example, if $\\mathcal{G}_n$ is the complete graph on $n$ vertices, so that $\\mathcal{G}_n(p_n)$ is the Erdos-Renyi graph, then one might tamper with it by disconnecting all the edges of a randomly chosen vertex, or by adding all the edges of a randomly chosen Hamiltonian path from $\\mathcal{G}_n$, or by adding all the edges of a randomly chosen clique of order $k_n$ from $\\mathcal{G}_n$. Denote the resulting induced measure on $\\mathcal{G}_n$ by $P_n^{p_n,\\text{tamper}}$. The tampering is called \\it detectable\\rm\\ if $\\lim_{n\\to\\infty}||P_n^{p_n,\\text{tamper}}-P_n^{p_n}||_{\\t...
On the Recognition of Four-Directional Orthogonal Ray Graphs
Felsner, Stefan
class of graphs is also known as grid intersection graphs (GIG), see [9]. The recognition of GIGs is NP
Decidability, Behavioural Equivalences and Infinite Transition Graphs
Hüttel, Hans
This thesis studies behavioural equivalences on labelled infinite transition graphs and the role that they can play in the context of modal logics and notions from language theory. A natural class of such infinite graphs ...
Optimization in Geometric Graphs: Complexity and Approximation
Kahruman-Anderoglu, Sera
2011-02-22
We consider several related problems arising in geometric graphs. In particular, we investigate the computational complexity and approximability properties of several optimization problems in unit ball graphs and develop ...
Cops and Robber on Circulant Graphs
Bonato, Anthony
Edward Island #12;Cops and Robber Played on a finite, simple graph Cops have perfect information TwoCops and Robber on Circulant Graphs Shannon Fitzpatrick John Paul Larkin University of Prince
Minimal Spanning Trees with Conflict Graphs
symmetric conflict relations by means of an undirected conflict graph, where ..... International Symposium on Mathematical Foundations of Computer. Science ...
Some problems in Graph Ramsey Theory
Grinshpun, Andrey Vadim
2015-01-01
A graph G is r-Ramsey minimal with respect to a graph H if every r-coloring of the edges of G yields a monochromatic copy of H, but the same is not true for any proper subgraph of G. The study of the properties of graphs ...
Semester Thesis Virus Inoculation on Social Graphs -
Schmid, Stefan
Semester Thesis Virus Inoculation on Social Graphs - The Friendship Factor Dominic Meier meierdo introduce friendship between neighbors while looking at a virus inoculation game which is played and in the star graph. #12;Virus Inoculation on Social Graphs - The Windfall of Friendship page 2 1 Introduction
Effecting Parallel Graph Eigensolvers Through Library Composition
Lumsdaine, Andrew
is not possible in general. Conventional linear algebra libraries cannot operate on graph data types. Likewise exploitation of this duality. Graph libraries and matrix libraries use different data types, and despiteEffecting Parallel Graph Eigensolvers Through Library Composition Alex Breuer, Peter Gottschling
A heuristic algorithm for graph isomorphism
Torres Navarro, Luz
1999-01-01
polynomial time algorithm O(n?), ISO-MT, that seems' to solve the graph isomorphism decision problem correctly for all classes of graphs. Our algorithm is extremely useful from the practical point of view since counter examples (pairs of graphs for which our...
The Joys of Graph Transformation Arend Rensink
Rensink, Arend
The Joys of Graph Transformation Arend Rensink Department of Computer Science, University of Twente, the things being changed are graphs. A fundamental assumption in studying such changes, the handbook [21] is a 1 #12;Figure 1: Two graphs with a matching good source); rather, we want to illustrate
Library Locations Locations other than Main Library
Library Locations Locations other than Main Library Example: Feminist Studies HQ1410 .U54 2009 ............................................................2 Central Call Number Main Library Location Main Library Example: Main Library HQ1410 .U54 2009 See Center (ATC) Classroom 1575 Building Operations Main Entrance Map and Imagery Laboratory (MIL
Library Locations Locations other than Main Library
Library Locations Locations other than Main Library Example: Feminist Studies HQ1410 .U54 2009 these from the library catalog: www.library.ucsb.edu/depts/access/howinprocess.html Main: Items located in the Main Library, Davidson Main Serials Reading Area: 2 North Map & Imagery Lab: 1 North Media Collection
Inf-2101 -Algoritmer Graph Search
Bongo, Lars Ailo
Inf-2101 - Algoritmer Graph Search John Markus BjĂ¸rndalen 2010-09-02 Some foils are adapted from the book and the book's homepage. John Markus BjĂ¸rndalen () Inf-2101 - Algoritmer 2010-09-02 1 / 25 #12 John Markus BjĂ¸rndalen () Inf-2101 - Algoritmer 2010-09-02 2 / 25 #12;Breadth-first search Depth
Locative Inversion In Cantonese
Mok, Sui-Sang
1992-01-01
This paper proposes that locative inversion is a widespread syntactic process in Cantonese. The sentence-initial locative phrases in the Locative Inversion sentences are argued to be subjects which come from the postverbal complement position...
Lamplighter groups, de Bruijn graphs, spider-web graphs and their spectra
Rostislav Grigorchuk; Paul-Henry Leemann; Tatiana Nagnibeda
2015-05-05
We describe the infinite family of spider-web graphs $S_{k,M,N }$, $k \\geq 2$, $M \\geq 1$ and $N \\geq 0$, studied in physical literature as tensor products of well-known de Brujin graphs $B_{k,N}$ and cyclic graphs $C_M$ and show that these graphs are Schreier graphs of the lamplighter groups $L_k = Z/kZ \\wr Z$. This allows us to compute their spectra and to identify the infinite limit of $S_{k,M,N}$, as $N, M \\to\\infty$, with the Cayley graph of the lamplighter group $L_k$.
Accommodation Location(s) Cologne -Ehrenfeld.
Molinari, Marc
Accommodation Location(s) Cologne - Ehrenfeld. Price of rent Sub-let, cost roughly 300 euros a month inc bills. Organisation of accommodation/gas/electricity/internet/phones Because I lived with Telekom for phone/internet as they just try to rip you off! Germany COLOGNE Language Assistantship Travel
Inf-2101 -Algoritmer Graph Search
Bongo, Lars Ailo
Inf-2101 - Algoritmer Graph Search John Markus BjĂ¸rndalen 2011-09-01 Some foils are adapted from the book and the book's homepage. John Markus BjĂ¸rndalen () Inf-2101 - Algoritmer 2011-09-01 1 / 16 #12 in the maze. Foil from Sedgewick/Wayne John Markus BjĂ¸rndalen () Inf-2101 - Algoritmer 2011-09-01 2 / 16 #12
ON RAMSEY MINIMAL GRAPHS V. R ODL AND M. SIGGERS
Siggers, Mark H.
ON RAMSEY MINIMAL GRAPHS V. R Â¨ODL AND M. SIGGERS Abstract. A graph G is r-ramsey on at most n vertices, each of which is r-ramsey-minimal with respect to the complete graph Kk. Furthermore of graph theory is determining the ramsey number for a graph H. This is the minimum number n such that any
A Characterization of Seymour Graphs A. A. Ageev
Szigeti, ZoltĂˇn
A Characterization of Seymour Graphs A. A. Ageev , A. V. Kostochka and Z. Szigeti Abstract Following Gerards [1] we say that a connected undirected graph G is a Seymour graph if the maximum number (G). Several families of graphs have been shown to be subfamilies of Seymour graphs (Seymour [4
Models of random graph hierarchies
Paluch, Robert; Holyst, Janusz
2015-01-01
We introduce two models of inclusion hierarchies: Random Graph Hierarchy (RGH) and Limited Random Graph Hierarchy (LRGH). In both models a set of nodes at a given hierarchy level is connected randomly, as in the Erd\\H{o}s-R\\'{e}nyi random graph, with a fixed average degree equal to a system parameter $c$. Clusters of the resulting network are treated as nodes at the next hierarchy level and they are connected again at this level and so on, until the process cannot continue. In the RGH model we use all clusters, including those of size $1$, when building the next hierarchy level, while in the LRGH model clusters of size $1$ stop participating in further steps. We find that in both models the number of nodes at a given hierarchy level $h$ decreases approximately exponentially with $h$. The height of the hierarchy $H$, i.e. the number of all hierarchy levels, increases logarithmically with the system size $N$, i.e. with the number of nodes at the first level. The height $H$ decreases monotonically with the conne...
Counting matchings in irregular bipartite graphs
Marc Lelarge
2015-07-16
We give a sharp lower bound on the number of matchings of a given size in a bipartite graph. When specialized to regular bipartite graphs, our results imply Friedland's Lower Matching Conjecture and Schrijver's theorem. It extends the recent work of Csikv\\'ari done for regular and bi-regular bipartite graphs. Moreover, our lower bounds are order optimal as they are attained for a sequence of $2$-lifts of the original graph. We then extend our results to permaments and subpermanents sums. For permanents, we are able to recover the lower bound of Schrijver recently proved by Gurvits using stable polynomials. We provide new lower bounds for subpermanents sums. Our proof borrows ideas from the theory of local weak convergence of graphs, statistical physics and covers of graphs.
Fast generation of sparse random kernel graphs
DOE Public Access Gateway for Energy & Science Beta (PAGES Beta)
Hagberg, Aric; Lemons, Nathan; Du, Wen -Bo
2015-09-10
The development of kernel-based inhomogeneous random graphs has provided models that are flexible enough to capture many observed characteristics of real networks, and that are also mathematically tractable. We specify a class of inhomogeneous random graph models, called random kernel graphs, that produces sparse graphs with tunable graph properties, and we develop an efficient generation algorithm to sample random instances from this model. As real-world networks are usually large, it is essential that the run-time of generation algorithms scales better than quadratically in the number of vertices n. We show that for many practical kernels our algorithm runs in timemore »at most ?(n(logn)˛). As an example, we show how to generate samples of power-law degree distribution graphs with tunable assortativity.« less
Graphs in machine learning: an introduction
Latouche, Pierre
2015-01-01
Graphs are commonly used to characterise interactions between objects of interest. Because they are based on a straightforward formalism, they are used in many scientific fields from computer science to historical sciences. In this paper, we give an introduction to some methods relying on graphs for learning. This includes both unsupervised and supervised methods. Unsupervised learning algorithms usually aim at visualising graphs in latent spaces and/or clustering the nodes. Both focus on extracting knowledge from graph topologies. While most existing techniques are only applicable to static graphs, where edges do not evolve through time, recent developments have shown that they could be extended to deal with evolving networks. In a supervised context, one generally aims at inferring labels or numerical values attached to nodes using both the graph and, when they are available, node characteristics. Balancing the two sources of information can be challenging, especially as they can disagree locally or globall...
Discussiones Mathematicae Graph Theory 34 (2014) 287307
Al Hanbali, Ahmad
2014-01-01
FOR TRACEABILITY OF BLOCK-CHAINS Binlong Lia,b1, Hajo Broersmab and Shenggui Zhanga2 a Department of Applied at least n-1 in G. A block-chain is a graph whose block graph is a path, i.e., it is either a P1, P2, every traceable graph is a block-chain, but the reverse does not hold. In this paper we characterize all
Maximum Estrada Index of Bicyclic Graphs
Wang, Long; Wang, Yi
2012-01-01
Let $G$ be a simple graph of order $n$, let $\\lambda_1(G),\\lambda_2(G),...,\\lambda_n(G)$ be the eigenvalues of the adjacency matrix of $G$. The Esrada index of $G$ is defined as $EE(G)=\\sum_{i=1}^{n}e^{\\lambda_i(G)}$. In this paper we determine the unique graph with maximum Estrada index among bicyclic graphs with fixed order.
Spectral statistics of nearly unidirectional quantum graphs
Maram Akila; Boris Gutkin
2015-08-19
The energy levels of a quantum graph with time reversal symmetry and unidirectional classical dynamics are doubly degenerate and obey the spectral statistics of the Gaussian Unitary Ensemble. These degeneracies, however, are lifted when the unidirectionality is broken in one of the graph's vertices by a singular perturbation. Based on a Random Matrix model we derive an analytic expression for the nearest neighbour distribution between energy levels of such systems. As we demonstrate the result agrees excellently with the actual statistics for graphs with a uniform distribution of eigenfunctions. Yet, it exhibits quite substantial deviations for classes of graphs which show strong scarring.
Generation of graph-state streams
Daniel Ballester; Jaeyoon Cho; M. S. Kim
2010-12-08
We propose a protocol to generate a stream of mobile qubits in a graph state through a single stationary parent qubit and discuss two types of its physical implementation, namely, the generation of photonic graph states through an atom-like qubit and those of flying atoms through a cavity-mode photonic qubit. The generated graph states fall into an important class that can hugely reduce the resource requirement of fault-tolerant linear optics quantum computation, which was previously known to be far from realistic. In regard to the flying atoms, we also propose a heralded generation scheme, which allows for high-fidelity graph states even under the photon loss.
Nuclear reactor multiphysics via bond graph formalism
Sosnovsky, Eugeny
2014-01-01
This work proposes a simple and effective approach to modeling nuclear reactor multiphysics problems using bond graphs. Conventional multiphysics simulation paradigms normally use operator splitting, which treats the ...
On Products and Line Graphs of Signed Graphs, their Eigenvalues and Energy
Zaslavsky, Thomas
On Products and Line Graphs of Signed Graphs, their Eigenvalues and Energy K.A. Germina, Shahul and Laplacian matrices and their eigenvalues and energies of the general product (non-complete extended p- sum product and the eigenvalues and energy of the product in terms of those of the factor graphs
MOBILE DEVICE LOCATION INFORMATION ACQUISITION FRAMEWORK FOR DEVELOPMENT OF LOCATION
Dustdar, Schahram
MOBILE DEVICE LOCATION INFORMATION ACQUISITION FRAMEWORK FOR DEVELOPMENT OF LOCATION INFORMATION, 1040 Vienna, Austria dustdar@infosys.tuwien.ac.at Keywords: Mobile device location information, location information based services, location information acquisition. Abstract: Mobile device location
Knezev, Maja
2008-10-10
sequence of events newly obtained recording belongs. Software prototype of the proposed automated fault location analysis is developed using Java programming language. Fault location analysis is automatically triggered by appearance of new event files in a...
Star graphs and Seba billiards
G. Berkolaiko; E. B. Bogomolny; J. P. Keating
2000-10-26
We derive an exact expression for the two-point correlation function for quantum star graphs in the limit as the number of bonds tends to infinity. This turns out to be identical to the corresponding result for certain Seba billiards in the semiclassical limit. Reasons for this are discussed. The formula we derive is also shown to be equivalent to a series expansion for the form factor - the Fourier transform of the two-point correlation function - previously calculated using periodic orbit theory.
A matrix representation of graphs and its spectrum as a graph invariant
David Emms; Edwin R. Hancock; Simone Severini; Richard C. Wilson
2006-04-05
We use the line digraph construction to associate an orthogonal matrix with each graph. From this orthogonal matrix, we derive two further matrices. The spectrum of each of these three matrices is considered as a graph invariant. For the first two cases, we compute the spectrum explicitly and show that it is determined by the spectrum of the adjacency matrix of the original graph. We then show by computation that the isomorphism classes of many known families of strongly regular graphs (up to 64 vertices) are characterized by the spectrum of this matrix. We conjecture that this is always the case for strongly regular graphs and we show that the conjecture is not valid for general graphs. We verify that the smallest regular graphs which are not distinguished with our method are on 14 vertices.
Ramsey Minimal Graphs B ela Bollob as
Kohayakawa, Yoshiharu
Ramsey Minimal Graphs B#19;ela Bollob#19;as #3; Department of Mathematical Sciences University to be Ramsey-in#12;nite if there are in#12;nitely many minimal graphs for which we have ! (G; H). Let ` #21; 4 `, then the pair (C k ; H) is Ramsey- in#12;nite for any k #21; `, where C k denotes the cycle of length k
Diagonal Ramsey Numbers in Multipartite Graphs
van Vuuren, Jan H.
Diagonal Ramsey Numbers in Multipartite Graphs AP Burger , PJP Grobler , EH Stipp & JH van Vuuren September 17, 2003 Abstract The notion of a graph theoretic Ramsey number is generalised by assuming definition. Some small multipartite Ramsey numbers are found, while upper and lower bounds are established
Induced Graph Ramsey Theory Marcus Schaefer
Schaefer, Marcus
Induced Graph Ramsey Theory Marcus Schaefer School of CTI DePaul University 243 South Wabash Avenue for all graphs, and good upper bounds on induced Ramsey numbers in general, and for particular families (path on four vertices). The proof is a standard Ramsey theory arguÂ ment: fix one vertex u of the K 5
Diagonal Ramsey Numbers in Multipartite Graphs
van Vuuren, Jan H.
Diagonal Ramsey Numbers in Multipartite Graphs AP Burger + , PJP Grobler # , EH Stipp # & JH van Vuuren # September 17, 2003 Abstract The notion of a graph theoretic Ramsey number is generalised as in the classical definition. Some small multipartite Ramsey numbers are found, while upper and lower bounds
DISTRIBUTED PLANNING THROUGH GRAPH MERGING Damien Pellier
Pellier, Damien
DISTRIBUTED PLANNING THROUGH GRAPH MERGING Damien Pellier UniversitÂ´e Paris Descartes, Laboratoire.pellier@parisdescartes.fr Keywords: distributed problem solving, cooperation, coordination, multi-agent planning, planning graphs technics. Abstract: In this paper, we introduce a generic and fresh model for distributed planning called
On the spectra of simplicial rook graphs
Martin, Jeremy L.; Wagner, Jennifer D.
2014-05-05
The \\emph{simplicial rook graph} $\\SR(d,n)$ is the graph whose vertices are the lattice points in the $n$th dilate of the standard simplex in $\\mathbb{R}^d$, with two vertices adjacent if they differ in exactly two coordinates. We prove...
Small Alliances in Graphs Rodolfo Carvajal1
Rapaport, Iván
Small Alliances in Graphs Rodolfo Carvajal1 , Mart´in Matamala1,2 , Ivan Rapaport1,2 , and Nicolas is a (strong defensive) alliance of G if every node in S has at least as many neighbors in S than in V \\S typically belong to small alliances. Despite the fact that finding the smallest alliance in a graph is NP
Proceedings of the Workshop 23 June, 2011 Portland, Oregon, USA #12;Production and Manufacturing by Omnipress of related graph-based methods. This workshop series is aimed at fostering an exchange of ideas, thanks also to the special theme of this year in the area of machine learning, i.e. Graphs in Structured
Clustering attributed graphs: models, measures and methods
Bothorel, Cecile; Magnani, Matteo; Micenkova, Barbora
2015-01-01
Clustering a graph, i.e., assigning its nodes to groups, is an important operation whose best known application is the discovery of communities in social networks. Graph clustering and community detection have traditionally focused on graphs without attributes, with the notable exception of edge weights. However, these models only provide a partial representation of real social systems, that are thus often described using node attributes, representing features of the actors, and edge attributes, representing different kinds of relationships among them. We refer to these models as attributed graphs. Consequently, existing graph clustering methods have been recently extended to deal with node and edge attributes. This article is a literature survey on this topic, organizing and presenting recent research results in a uniform way, characterizing the main existing clustering methods and highlighting their conceptual differences. We also cover the important topic of clustering evaluation and identify current open ...
Graph Mining Meets the Semantic Web
Lee, Sangkeun (Matt) [ORNL; Sukumar, Sreenivas R [ORNL; Lim, Seung-Hwan [ORNL
2015-01-01
The Resource Description Framework (RDF) and SPARQL Protocol and RDF Query Language (SPARQL) were introduced about a decade ago to enable flexible schema-free data interchange on the Semantic Web. Today, data scientists use the framework as a scalable graph representation for integrating, querying, exploring and analyzing data sets hosted at different sources. With increasing adoption, the need for graph mining capabilities for the Semantic Web has emerged. We address that need through implementation of three popular iterative Graph Mining algorithms (Triangle count, Connected component analysis, and PageRank). We implement these algorithms as SPARQL queries, wrapped within Python scripts. We evaluate the performance of our implementation on 6 real world data sets and show graph mining algorithms (that have a linear-algebra formulation) can indeed be unleashed on data represented as RDF graphs using the SPARQL query interface.
Reversible micromachining locator
Salzer, L.J.; Foreman, L.R.
1999-08-31
This invention provides a device which includes a locator, a kinematic mount positioned on a conventional tooling machine, a part carrier disposed on the locator and a retainer ring. The locator has disposed therein a plurality of steel balls, placed in an equidistant position circumferentially around the locator. The kinematic mount includes a plurality of magnets which are in registry with the steel balls on the locator. In operation, a blank part to be machined is placed between a surface of a locator and the retainer ring (fitting within the part carrier). When the locator (with a blank part to be machined) is coupled to the kinematic mount, the part is thus exposed for the desired machining process. Because the locator is removably attachable to the kinematic mount, it can easily be removed from the mount, reversed, and reinserted onto the mount for additional machining. Further, the locator can likewise be removed from the mount and placed onto another tooling machine having a properly aligned kinematic mount. Because of the unique design and use of magnetic forces of the present invention, positioning errors of less than 0.25 micrometer for each machining process can be achieved. 7 figs.
Department of Psychology, University of Melbourne Introduction to graph theory
©Department of Psychology, University of Melbourne Introduction to graph theory Graphs Size and weak components Centrality for directed graphs Some special directed graphs ©Department of Psychology,6),(6,7)} 4 5 6 7 #12;©Department of Psychology, University of Melbourne Size and order The size of G
Minimal comparability completions of arbitrary graphs Pinar Heggernes
Heggernes, Pinar
Minimal comparability completions of arbitrary graphs Pinar Heggernes Federico Mancini Charis for which completion of arbitrary graphs can be achieved through such a vertex incremental approach. 1 to an arbitrary graph is called a comparability completion of the input graph. Unfortunately, computing
Vienna Graph Template Library Version 1.0
Neumaier, Arnold
.1 Vienna Graph Template Library Modules Here is a list of all modules: Classes and types for external useVienna Graph Template Library Version 1.0 Reference Manual Hermann Schichl University of Vienna.2.14 #12;CONTENTS 1 Contents 1 Introduction 1 2 Vienna Graph Template Library Module Index 2 3 Vienna Graph
DIMACS Technical Report 200337 Perfect interval filament graphs
DIMACS Technical Report 200337 Perfect interval filament graphs by Fanica GAVRIL 1 DIMACS, Rutgers are disjoint, their curves do not intersect; FI={ f i | iÎI} is a family of interval filaments and its intersection graph is an interval filament graph. The interval filament graphs contain the polygon
What Energy Functions Can Be Minimized via Graph Cuts?
Field, David
What Energy Functions Can Be Minimized via Graph Cuts? Vladimir Kolmogorov, Member, IEEE, and Ramin been developed to solve energy minimization problems in computer vision. Each of these techniques constructs a graph such that the minimum cut on the graph also minimizes the energy. Yet, because these graph
Information inequalities and Generalized Graph Entropies
Sivakumar, Lavanya
2012-01-01
In this article, we discuss the problem of establishing relations between information measures assessed for network structures. Two types of entropy based measures namely, the Shannon entropy and its generalization, the R\\'{e}nyi entropy have been considered for this study. Our main results involve establishing formal relationship, in the form of implicit inequalities, between these two kinds of measures when defined for graphs. Further, we also state and prove inequalities connecting the classical partition-based graph entropies and the functional-based entropy measures. In addition, several explicit inequalities are derived for special classes of graphs.
Werner Trobin, May 26, 2004 The Boost Graph Library -p. 1/48 The Boost Graph Library
Werner Trobin, May 26, 2004 The Boost Graph Library - p. 1/48 The Boost Graph Library Generic Library Design Werner Trobin #12;Introduction The Boost Graph Library Demo References Werner Trobin, May 26, 2004 The Boost Graph Library - p. 2/48 Outline I Introduction to Boost I The Boost
SCALABLE REACHABILITY INDEXING FOR VERY LARGE GRAPHS
Zaki, Mohammed Javeed
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 34 iii #12;3. GRAIL: Scalable Reachability Index for Large Graphs . . . . . . . . . . . . . 36 3 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 37 3.3 GRAIL Approach . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 39 3.3.1 Index GRAIL . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 51 4.1 Topological Level Filter
Fault-tolerant dynamic task graph scheduling
Kurt, Mehmet C.; Krishnamoorthy, Sriram; Agrawal, Kunal; Agrawal, Gagan
2014-11-16
In this paper, we present an approach to fault tolerant execution of dynamic task graphs scheduled using work stealing. In particular, we focus on selective and localized recovery of tasks in the presence of soft faults. We elicit from the user the basic task graph structure in terms of successor and predecessor relationships. The work stealing-based algorithm to schedule such a task graph is augmented to enable recovery when the data and meta-data associated with a task get corrupted. We use this redundancy, and the knowledge of the task graph structure, to selectively recover from faults with low space and time overheads. We show that the fault tolerant design retains the essential properties of the underlying work stealing-based task scheduling algorithm, and that the fault tolerant execution is asymptotically optimal when task re-execution is taken into account. Experimental evaluation demonstrates the low cost of recovery under various fault scenarios.
On semidefinite programming bounds for graph bandwidth
2011-05-24
May 24, 2011 ... the rectangular grid graph Pn × Pm (i.e. the Cartesian product of the paths Pn and Pm) is min{n, m} [6] ...... Ars Combinatoria, 47:147-152, 1997.
Projective representations from quantum enhanced graph symmetries
2015-03-11
Presently, we will label the edges of a graph by elements of a group ...... (a) Read off the matrix ? by putting the G label of a vertex onto the diagonal in the place.
Densities of Minor-Closed Graph Families
Eppstein, David
2010-01-01
N. Robertson and P. D. Seymour. Graph Minors. XX. Wagner’sChudnovsky, B. Reed, and P. Seymour. The edge-density for KReferences [1] N. Alon, P. Seymour, and R. Thomas. A
Graph representation of protein free energy landscape
Li, Minghai; Duan, Mojie; Fan, Jue; Huo, Shuanghong; Han, Li
2013-11-14
The thermodynamics and kinetics of protein folding and protein conformational changes are governed by the underlying free energy landscape. However, the multidimensional nature of the free energy landscape makes it difficult to describe. We propose to use a weighted-graph approach to depict the free energy landscape with the nodes on the graph representing the conformational states and the edge weights reflecting the free energy barriers between the states. Our graph is constructed from a molecular dynamics trajectory and does not involve projecting the multi-dimensional free energy landscape onto a low-dimensional space defined by a few order parameters. The calculation of free energy barriers was based on transition-path theory using the MSMBuilder2 package. We compare our graph with the widely used transition disconnectivity graph (TRDG) which is constructed from the same trajectory and show that our approach gives more accurate description of the free energy landscape than the TRDG approach even though the latter can be organized into a simple tree representation. The weighted-graph is a general approach and can be used on any complex system.
Mankins, Matthew William David, 1975-
2003-01-01
This work builds an infrastructure called Location Linked Information that offers a means to associate digital information with public, physical places. This connection creates a hybrid virtual/physical space, called glean ...
Locating Heat Recovery Opportunities
Waterland, A. F.
1981-01-01
Basic concepts of heat recovery are defined as they apply to the industrial community. Methods for locating, ranking, and developing heat recovery opportunities are presented and explained. The needs for useful heat 'sinks' are emphasized as equal...
Theoretical Computer Science 263 (2001) 235245 www.elsevier.com/locate/tcs
Nielsen, Frank
2001-01-01
), and in a district of the city of Geneva (b). The black zone represents the served area. The paper is organized are discretized on a regular grid, and the cells are computed by a radio wave propagation prediction tool. Fig. 1 to have huge size when many geographic locations are allowed. A smart way to reduce the graph size without
Consistent Graph Layout for Weighted Graphs Dana Vrajitoru
Vrajitoru, Dana
of years from now aliens discover traces of human civilization on Earth and they at- tempt to recover our, and that all that the aliens can find is a sched- ule of an airline company featuring the duration of various flights from a location to another. The question is, can the aliens reconstruct the current map
Random key graphs can have many more triangles than Erdos-Renyi graphs
Yagan, Osman
, and in the First Workshop on Applications of Graph Theory in Wireless Ad hoc Networks and Sensor Networks (GRAPH-HOC 2009), Chennai (India), December 2009. O. Yagan was with the Department of Electrical and Computer is now with Department of Electrical and Computer Engineering and CyLab, Carnegie Mellon University
Intro Algo ring Arbitrary graphs Conclusion PING PONG IN DANGEROUS GRAPHS
Fondements et Applications, Université Paris 7
Intro Algo ring Arbitrary graphs Conclusion PING PONG IN DANGEROUS GRAPHS Optimal Black Hole Search blocking and destroying any mobile agent entering it. Motivations : Site which is destroyed or dangerous blocking and destroying any mobile agent entering it. Motivations : Site which is destroyed or dangerous
Graph-Theoretic Generation of Assembly Plans Part I: Correct Generation of Precedence Graphs
Wu, David
1 Graph-Theoretic Generation of Assembly Plans Part I: Correct Generation of Precedence Graphs Lehigh University Bethlehem, Pennsylvania Abstract Automatic generation and selection of assembly plans is a problem of great practical importance with many significant cost implications. In this paper, we focus
Outline of the talk Statistics on Graphs, Exponential Formula and
Poinsot, Laurent
Outline of the talk Statistics on Graphs, Exponential Formula and Combinatorial Physics G and Complexity" Laurent Poinsot Statistics on Graphs, Exponential Formula and Combinatorial Physics #12;Exponential Formula : Informal Version Ingredients for the exponential formula Partial commutative monoids
A New Combinatorial Approach for Sparse Graph Problems
Blelloch, Guy E.
A New Combinatorial Approach for Sparse Graph Problems Guy E. Blelloch, Virginia Vassilevska- totic improvement over O(mn) for all pairs least common ancestors on directed acyclic graphs. 1
On the topology of graph picture spaces
Martin, Jeremy L.
2005-03-01
V and edges E. The d-dimensional picture space Xd(G) is de ned as the projective algebraic set whose points are pictures of G in complex projective d-space Pd = PdC. A picture P consists of a point P(v) 2 Pd for each vertex v of G and a line P...(e) for each edge e, subject to the conditions P(v) 2 P(e) whenever v is an endpoint of e. Two fundamental operations of graph theory are deletion and contraction: given a graph G and an edge e, we may delete e to form a graph G e, or identify the end- points...
Johan Alwall; Michel Herquet; Fabio Maltoni; Olivier Mattelaer; Tim Stelzer
2011-06-02
MadGraph 5 is the new version of the MadGraph matrix element generator, written in the Python programming language. It implements a number of new, efficient algorithms that provide improved performance and functionality in all aspects of the program. It features a new user interface, several new output formats including C++ process libraries for Pythia 8, and full compatibility with FeynRules for new physics models implementation, allowing for event generation for any model that can be written in the form of a Lagrangian. MadGraph 5 builds on the same philosophy as the previous versions, and its design allows it to be used as a collaborative platform where theoretical, phenomenological and simulation projects can be developed and then distributed to the high-energy community. We describe the ideas and the most important developments of the code and illustrate its capabilities through a few simple phenomenological examples.
ON HIGHLY RAMSEY INFINITE GRAPHS M. H. SIGGERS
Siggers, Mark H.
ON HIGHLY RAMSEY INFINITE GRAPHS M. H. SIGGERS Abstract. We show that, for k 3, there exists that are 2-ramsey-minimal for the odd cycle C2k+1. 1. Introduction A graph G is r-ramsey for a graph H if any r-colouring of the edges of G yields a monochromatic copy of the graph H. G is r-ramsey
A Note on Ramsey Size-Linear Graphs
Simonovits, MiklĂłs
A Note on Ramsey Size-Linear Graphs P.N. Balister,1 R.H. Schelp,1 and M. Simonovits1,2 1 DEPARTMENT is a Ramsey size-linear graph and x,y 2 V(G ) then if we add a sufficiently long path between x and y we obtain a new Ramsey size-linear graph. As a consequence we show that if G is any graph such that every
Evaluating Graph Coloring on Pascal Grosset, Peihong Zhu, Shusen Liu,
Hall, Mary W.
any relevant related works for graph coloring on GPUs · Main inspiration: o Gebremedhin and Manne o (G
Discrete Lagrangian Systems on Graphs. Symplecto-Topological Properties
S. P. Novikov; A. S. Schwarz
2000-04-11
Discrete Lagrangian Systems on graphs are considered. Vector-valued closed differential 2-form on the space of solutions is constructed. This form takes values in the first homology group of the graph. This construction generalizes the Symplectic Wronskian for the linear self-adjoint operators on graphs found in 1997 by the first author and used for the needs of the Scattering Theory for graphs with tails
1st Graph Searching in Canada (GRASCan) Workshop
Bonato, Anthony
Fitzpatrick, University of Prince Edward Island Cops and Robber on Circulant Graphs 11:30 - 12:00 Kieka
VACUUM ENERGY IN QUANTUM GRAPHS A Senior Honors Thesis
VACUUM ENERGY IN QUANTUM GRAPHS A Senior Honors Thesis by JUSTIN HOWARD WILSON Submitted ABSTRACT Vacuum Energy in Quantum Graphs. (April 2007) Justin Howard Wilson Department of Physics the vacuum energy in quantum graphs. Vacuum energy arose in quantum physics but has an independent
Problems of Distance-Regular Graphs Hiroshi Suzuki
Xi, Changchang
Â328. [14] H. Suzuki, The Terwilliger algebra associated with a set of vertices in a distance-regular graph, J. Alg. Combin. 22 (2005), 5-38. [15] P. Terwilliger, Distance-regular graphs and (s, c, a, k)-graphs, J. Combin. Th. (B) 34 (1983), 151Â164. [16] P. Terwilliger, A new inequality for distance
Realization of some local unitary operations by graph switching
Supriyo Dutta; Bibhas Adhikari; Subhashish Banerjee
2015-02-27
In this work we implement a graph theoretical realization of local unitary transformations, implemented by single qubit Pauli gates, by adapting techniques of graph switching. This leads to the concept of local unitary equivalent graphs. We illustrate our method by a few, well known, local unitary transformations implemented by single qubit Pauli and Hadamard gates.
The case against specialized graph analytics engines University of Wisconsin
Willett, Rebecca
the performance perspec- tive. We present Grail a syntactic layer for querying graph in a vertex-centric way compare Grail to GraphLab and Giraph, and examine the performance implications of using Grail, showing.e. Grail) that presents such a syntactic mapping layer. We present how graph analytics queries using
GRAIL: Scalable Reachability Index for Large Graphs Hilmi Yildirim
Zaki, Mohammed Javeed
GRAIL: Scalable Reachability Index for Large Graphs Hilmi Yildirim Rensselaer Polytechnic large real-world graphs. We present a very simple, but scalable reachability index, called GRAIL on small graphs, GRAIL is the only index that can scale to millions of nodes and edges. GRAIL has linear
SQLGraph: An Efficient Relational-Based Property Graph , Achille Fokoue
Cortes, Corinna
[Database Management]: Systems General Terms Property graphs; Gremlin Keywords Property graphs; Relational Storage; Gremlin 1. INTRODUCTION There is increased interest in graph data management re- cently, fueled literature has been on RDF data management (e.g., [39, 18, 27, 24, 6, 25, 16]). Much of this work targets
A Visualization System for Correctness Proofs of Graph Algorithms
Metaxas, Takis
A Visualization System for Correctness Proofs of Graph Algorithms P.A. Gloor1, D.B. Johnson2, F. Makedon2, P. Metaxas3 Feb. 28, 1993 Running head: Proof Visualization of Graph Algorithms Correspondence proofs of graph algorithms. The system has been demonstrated for a greedy algorithm, Prim's algorithm
A Static Analysis Technique for Graph Transformation Systems
Baldan, Paolo
A Static Analysis Technique for Graph Transformation Systems Paolo Baldan, Andrea Corradini,andrea,koenigb}@di.unipi.it Abstract. In this paper we introduce a static analysis technique for graph transformation systems. We in a direct and intuitive way. Graph Transformation Systems (GTSs) [18] add to the static description given
Making arbitrary graphs transitively orientable: Minimal comparability completions
Papadopoulos, Charis
Making arbitrary graphs transitively orientable: Minimal comparability completions Pinar Heggernes to an arbitrary graph is called a comparability completion of the input graph. Unfortunately, computing a comparability completion with the minimum number of added edges (called a minimum completion) is an NP
VGTL (Vienna Graph Template Library) Version 1.1
Schichl, Hermann
.1 Vienna Graph Template Library Modules Here is a list of all modules: Classes and types for external useVGTL (Vienna Graph Template Library) Version 1.1 Reference Manual Hermann Schichl University June 2003 #12;CONTENTS 1 Contents 1 Introduction 1 2 Vienna Graph Template Library Module Index 2 3
The power graph of a group Peter J. Cameron
Burton, Geoffrey R.
; graphs are much looser. For example, there are only five different groups with eight elementsThe power graph of a group Peter J. Cameron Queen Mary, University of London LTCC Open Day, 8 January 2010 Groups and graphs A group is an algebraic structure: a set with a bi- nary operation
Multivariate Graphs in Software Engineering and A. Telea2
Telea, Alexandru C.
Multivariate Graphs in Software Engineering S. Diehl1 and A. Telea2 1 Department of Computer, the Netherlands Abstract. Multivariate networks, or graphs, are an essential element of various activities. In this chapter, we present the specific context in which multivariate graphs occur in software engineering
Cellular Algebras and Graph Invariants Based on Quantum Walks
Jamie Smith
2011-03-01
We consider two graph invariants inspired by quantum walks- one in continuous time and one in discrete time. We will associate a matrix algebra called a cellular algebra with every graph. We show that, if the cellular algebras of two graphs have a similar structure, then they are not distinguished by either of the proposed invariants.
On Sum--Connectivity Index of Bicyclic Graphs
Du, Zhibin
2009-01-01
We determine the minimum sum--connectivity index of bicyclic graphs with $n$ vertices and matching number $m$, where $2\\le m\\le \\lfloor\\frac{n}{2}\\rfloor$, the minimum and the second minimum, as well as the maximum and the second maximum sum--connectivity indices of bicyclic graphs with $n\\ge 5$ vertices. The extremal graphs are characterized.
Bicycles and Left-Right Tours in Locally Finite Graphs
Diestel, Reinhard
Bicycles and Left-Right Tours in Locally Finite Graphs von Melanie Win Myint, M. S. Dem Department-Right Tours 29 6 LRTs Generate the Bicycle Space 43 7 The ABL Planarity Criterion 53 8 Pedestrian Graphs 69 bicycles and some other concepts they relate to, such as left- right tours and pedestrian graphs
Large Mesh Deformation Using the Volumetric Graph Laplacian
Kazhdan, Michael
Large Mesh Deformation Using the Volumetric Graph Laplacian Kun Zhou1 Jin Huang2 John Snyder3 Related Work Deformation on Volumetric Graphs Deformation from 2D curves Results Conclusions #12;11/21/2007 Bhaskar Kishore 3 Outline Introduction Related Work Deformation on Volumetric Graphs Deformation from
King, Paul E. (Corvallis, OR); Woodside, Charles Rigel (Corvallis, OR)
2012-02-07
The disclosure herein provides an apparatus for location of a quantity of current vectors in an electrical device, where the current vector has a known direction and a known relative magnitude to an input current supplied to the electrical device. Mathematical constants used in Biot-Savart superposition equations are determined for the electrical device, the orientation of the apparatus, and relative magnitude of the current vector and the input current, and the apparatus utilizes magnetic field sensors oriented to a sensing plane to provide current vector location based on the solution of the Biot-Savart superposition equations. Description of required orientations between the apparatus and the electrical device are disclosed and various methods of determining the mathematical constants are presented.
M&Ms4Graphs: Multi-scale, Multi-dimensional Graph Analytics Tools for Cyber-Security
M&Ms4Graphs: Multi-scale, Multi-dimensional Graph Analytics Tools for Cyber-Security Objective We-of-Networks Framework for Cyber Security." IEEE Intelligence and Security Informatics, 2013. 2. "Towards a Multiscale. "Statistical and Hierarchical Graph Analysis for Cyber Security." SIAM Conference on Discrete Mathematics
CPM: A Graph Pattern Matching Kernel with Diffusion for Accurate Graph Classification
Kansas, University of
(the Molecular Library Initiative project) that aims to determine and publicize the biological activ chemical structure data sets and have compared our methods to all major graph kernel functions that we know
Final Exam Location and Time. Math 162 Fall 2001. Date: Wednesday December 12, 2001. Time: 7:00 pm -9:00 pm. Location: Lambert Fieldhouse ...
Final Exam Location and Time. Math 161 Fall 2001. Date: Friday December 14, 2001. Time: 8:00 am -10:00 am. Location: Lambert Fieldhouse ...
Three Theorems Regarding Testing Graph Properties*
Trevisan, Luca
Three Theorems Regarding Testing Graph Properties* Oded Goldreich,1, Luca Trevisan2 1 Department-mail: luca@eecs.berkeley.edu Received 9 December 2001; accepted 18 September 2002 DOI 10.1002/rsa.10078 ABSTRACT: Property testing is a relaxation of decision problems in which it is required to distinguish YES
Graph Coloring with Quantum Heuristics Alex Fabrikant
Fabrikant, Alex
empirically with small graphs near a phase transition in search performance. It im- proves on two prior and physical phase transitions [4, 23, 19], which has led to new heuristics for conventional machines [12, 8 a conventional machine eval- uates just one. Hence one might expect high performance for problems having a rapid
Understanding Design Patterns with Design Rationale Graphs
Baniassad, Elisa
Understanding Design Patterns with Design Rationale Graphs Elisa Baniassad and Gail C. Murphy christa.schwanninger@mchp.siemens.de ABSTRACT A Design Pattern presents a proven solution to a common design problem using a combination of informal text, diagrams, and examples. Often, to suitably describe
Parsimonious Flooding in Dynamic Graphs Herv Baumann
Fondements et Applications, Université Paris 7
Parsimonious Flooding in Dynamic Graphs Hervé Baumann University Paris Diderot herve bounds on their flooding time -- flooding is the basic mechanism in which every node becoming aware. In this paper, we establish tight bounds on the complexity of flooding for all possible birth rates and death
Spectral statistics for scaling quantum graphs
Yu. Dabaghian
2006-08-09
The explicit solution to the spectral problem of quantum graphs is used to obtain the exact distributions of several spectral statistics, such as the oscillations of the quantum momentum eigenvalues around the average, $\\delta k_{n}=k_{n}-\\bar k_{n}$, and the nearest neighbor separations, $s_{n}=k_{n}-k_{n-1}$.
Expander Graph Arguments for Message Passing Algorithms
Burshtein, David
Expander Graph Arguments for Message Passing Algorithms David Burshtein and Gadi Miller Dept arguments may be used to prove that message passing algorithms can correct a linear number of erroneous a message passing algorithm has corrected a sufficiently large fraction of the errors, it will eventually
Minimum Spanning Trees weighted graph API
Wu, Xiaolin
on the complete graph on V vertices. #12;4 MST Origin Otakar Boruvka (1926). · Electrical Power Company of Western Moravia in Brno. · Most economical construction of electrical power network. · Concrete engineering;5 Applications MST is fundamental problem with diverse applications. · Network design. telephone, electrical
Atomic Representations of Rank 2 Graph Algebras
Davidson, Ken
Atomic Representations of Rank 2 Graph Algebras Kenneth R. Davidson a , Stephen C. Power b , Dilian University, Lancaster LA1 4YF, U.K. Abstract We provide a detailed analysis of atomic -representations- posed into a direct sum or direct integral of irreducible atomic representations. The building blocks
Solving the Graph Isomorphism Problem with a Quantum Annealer
Itay Hen; A. P. Young
2012-08-08
We propose a novel method using a quantum annealer -- an analog quantum computer based on the principles of quantum adiabatic evolution -- to solve the Graph Isomorphism problem, in which one has to determine whether two graphs are isomorphic (i.e., can be transformed into each other simply by a relabeling of the vertices). We demonstrate the capabilities of the method by analyzing several types of graph families, focusing on graphs with particularly high symmetry called strongly regular graphs (SRG's). We also show that our method is applicable, within certain limitations, to currently available quantum hardware such as "D-Wave One".
Graph processing platforms at scale: practices and experiences
Lim, Seung-Hwan; Lee, Sangkeun; Brown, Tyler C; Sukumar, Sreenivas R; Ganesh, Gautam
2015-01-01
Graph analysis unveils hidden associations of data in many phenomena and artifacts, such as road network, social networks, genomic information, and scientific collaboration. Unfortunately, a wide diversity in the characteristics of graphs and graph operations make it challenging to find a right combination of tools and implementation of algorithms to discover desired knowledge from the target data set. This study presents an extensive empirical study of three representative graph processing platforms: Pegasus, GraphX, and Urika. Each system represents a combination of options in data model, processing paradigm, and infrastructure. We benchmarked each platform using three popular graph operations, degree distribution, connected components, and PageRank over a variety of real-world graphs. Our experiments show that each graph processing platform shows different strength, depending the type of graph operations. While Urika performs the best in non-iterative operations like degree distribution, GraphX outputforms iterative operations like connected components and PageRank. In addition, we discuss challenges to optimize the performance of each platform over large scale real world graphs.
Frequent Subgraph Discovery in Large Attributed Streaming Graphs
Ray, Abhik; Holder, Larry; Choudhury, Sutanay
2014-08-13
The problem of finding frequent subgraphs in large dynamic graphs has so far only consid- ered a dynamic graph as being represented by a series of static snapshots taken at various points in time. This representation of a dynamic graph does not lend itself well to real time processing of real world graphs like social networks or internet traffic which consist of a stream of nodes and edges. In this paper we propose an algorithm that discovers the frequent subgraphs present in a graph represented by a stream of labeled nodes and edges. Our algorithm is efficient and consists of tunable parameters that can be tuned by the user to get interesting patterns from various kinds of graph data. In our model updates to the graph arrive in the form of batches which contain new nodes and edges. Our algorithm con- tinuously reports the frequent subgraphs that are estimated to be found in the entire graph as each batch arrives. We evaluate our system using 5 large dynamic graph datasets: the Hetrec 2011 challenge data, Twitter, DBLP and two synthetic. We evaluate our approach against two popular large graph miners, i.e., SUBDUE and GERM. Our experimental re- sults show that we can find the same frequent subgraphs as a non-incremental approach applied to snapshot graphs, and in less time.
Line graphs e contrazioni: un approccio rigoroso alla space syntax
D'Autilia, Roberto
2015-01-01
The methods of the space syntax have been the subject of extensive discussion, and several techniques to identify the axis lines have been proposed. The space syntax can be represented in terms of line graph, a graphs defined on the edge of a given primary graph. By means of the line graph algorithms, a system of labels defined on the edges of the primary graph is transformed into a system of labels on the vertices of the line graph. The contraction of adjacent edges with the same label allows to build a more general graph than those generated with the methods of the space syntax. By means of the functions implemented in Mathematica is therefore possible to redefine the space syntax on any system of urban quantities (labels) and reproduce the results of the axial lines as a special case. As an example is discussed a possible application of the method to the urban noise analysis.
2009-01-01
location, location: utilizing pipelines and services to morebut also to create pipelines integrated with humanbecome available [8]. These pipelines can be developed to
Local semicircle law for random regular graphs
Roland Bauerschmidt; Antti Knowles; Horng-Tzer Yau
2015-05-26
We consider random $d$-regular graphs on $N$ vertices, with degree $d$ at least $(\\log N)^4$. We prove that the Green's function of the adjacency matrix and the Stieltjes transform of its empirical spectral measure are well approximated by Wigner's semicircle law, down to the optimal scale given by the typical eigenvalue spacing (up to a logarithmic correction). Aside from well-known consequences for the local eigenvalue distribution, this result implies the complete delocalization of all eigenvectors.
Approximating the minimum clique cover and other hard problems in subtree filament graphs
Stewart, Lorna
Approximating the minimum clique cover and other hard problems in subtree filament graphs J. Mark Keil Lorna Stewart March 20, 2006 Abstract Subtree filament graphs are the intersection graphs of subtree filaments in a tree. This class of graphs contains subtree overlap graphs, interval filament
A Characterization of Seymour Graphs A. A. Ageev A. V. Kostochka Z. Szigeti y
Ageev, Alexandr
A Characterization of Seymour Graphs A. A. Ageev #3; A. V. Kostochka #3; Z. Szigeti y Abstract Following Gerards [1] we say that a connected undirected graph G is a Seymour graph if the maximum number). Several families of graphs have been shown to be subfamilies of Seymour graphs (Seymour [4][5], Gerards [1
The Cricket indoor location system
Priyantha, Nissanka Bodhi, 1968-
2005-01-01
Indoor environments present opportunities for a rich set of location-aware applications such as navigation tools for humans and robots, interactive virtual games, resource discovery, asset tracking, location-aware sensor ...
Search Text Based on Locations
Zhang, Weiwei
2014-11-21
locations, which contributes to the Geographical Information Retrieval (GIR) systems. In addition to the traditional applications of GIR systems, which are used for finding locations in documents, GIR can be applied to other fields as well. Firstly, it can...
Parameters of Integral Circulant Graphs and Periodic Quantum Dynamics
Nitin Saxena; Simone Severini; Igor Shparlinski
2007-03-26
The intention of the paper is to move a step towards a classification of network topologies that exhibit periodic quantum dynamics. We show that the evolution of a quantum system, whose hamiltonian is identical to the adjacency matrix of a circulant graph, is periodic if and only if all eigenvalues of the graph are integers (that is, the graph is integral). Motivated by this observation, we focus on relevant properties of integral circulant graphs. Specifically, we bound the number of vertices of integral circulant graphs in terms of their degree, characterize bipartiteness and give exact bounds for their diameter. Additionally, we prove that circulant graphs with odd order do not allow perfect state transfer.
Large induced forests in sparse graphs , Dhruv Mubayi
Shamir, Ron
(G) of G. Given a graph G, let NG(v) or simply N(v) denote the set of neighbors of vertex v. For sets
On the Adequacy of Program Dependence Graphs for Representing Programs
Reps, Thomas W.
introduced by Kuck as an intermediate program representation well suited for performing optimizations are strongly equivalent. 1. Introduction Program dependence graphs were introduced by Kuck as an intermediate
Computing the Stretch of an Embedded Graph Sergio Cabello
Cabello, Sergio
. GIG/11/E023. 1 #12;Here, len() denotes the number of edges in and a cycle is a closed walk in a graph
ON THE GAUSS MAP OF MINIMAL GRAPHS Daoud Bshouty, Dept ...
1910-70-82
Technology, 3200 Haifa, Israel, and Allen Weitsman, Dept. of Mathematics, Purdue University, W. Lafayette, IN 47907. Abstract. We consider graphs of solutions ...
Quasiperiodic graphs: structural design, scaling and entropic properties
Bartolo Luque; Fernando J. Ballesteros; Ángel M. Núńez; Alberto Robledo
2012-03-16
A novel class of graphs, here named quasiperiodic, are constructed via application of the Horizontal Visibility algorithm to the time series generated along the quasiperiodic route to chaos. We show how the hierarchy of mode-locked regions represented by the Farey tree is inherited by their associated graphs. We are able to establish, via Renormalization Group (RG) theory, the architecture of the quasiperiodic graphs produced by irrational winding numbers with pure periodic continued fraction. And finally, we demonstrate that the RG fixed-point degree distributions are recovered via optimization of a suitably defined graph entropy.
Stochastic processes on graphs with cycles : geometric and variational approaches
Wainwright, Martin J. (Martin James), 1973-
2002-01-01
Stochastic processes defined on graphs arise in a tremendous variety of fields, including statistical physics, signal processing, computer vision, artificial intelligence, and information theory. The formalism of graphical ...
course web site Note: For all homework assignments, when graphs and plots are
Palmeri, Thomas
PSY318! Week 4 #12;course web site #12;Note: For all homework assignments, when graphs and plots web site is a simple example of some Matlab code for creating line and bar graphs: Graph
The structure of claw-free graphs Maria Chudnovsky and Paul Seymour
Chudnovsky, Maria
The structure of claw-free graphs Maria Chudnovsky and Paul Seymour Abstract A graph is claw a graph G is prismatic if for every triangle T of G, every vertex of G #12;2 M. Chudnovsky & P. Seymour
Fowlie, Meredith
and renewable energy resources. We eval- uate renewable energy (RE) and energy efficiency (EE) technologiesLocation, location, location: The variable value of renewable energy and demand-side efficiency mitigation efforts in the electricity sector emphasize accelerated deployment of energy efficiency measures
3D Graph Visualization with the Oculus Rift Virtual Graph Reality
Wismath, Stephen
stereo experi- ence with head tracking and display of appropriate left and right eye information The low on the effectiveness of head-mounted VR systems vs. fish tank VR noted that the hardware suffered from latency- braries permit its use as the main engine for creating the virtual (graph) world. Head tracking
TextGraphs-5 2010 Workshop on Graph-based Methods
Proceedings of the Workshop 16 July 2010 Uppsala University Uppsala, Sweden #12;Production and Manufacturing-based methods. This workshop is aimed at fostering an exchange of ideas by facilitating a discussion about both-theoretical methods for text processing tasks, this year we invited papers on a special theme "Graph Methods
Graph Transformation and Intuitionistic Linear Logic
Ulidowski, Irek
; } } CISA Â p. #12;L1 L2 x y pt t L3 pt pt nx L1 L2 x y pt t L3 pt pt nx pt nx pt nx l[0] NULLx x y L1 L3L1y x L2 pt pt nx L3 L2 y nxpt pt pointer cell nx pt INITIAL STATE TYPE GRAPH RULE 1 RULE 2 CISA Â p. #12;ILL representation Definitions ptlist(x, l) pt(x, Hd(l)) list(l) list(h#l) nx(h, Hd(l)) list
Spectral properties of magnetic chain graphs
Pavel Exner; Stepan Manko
2015-07-02
We discuss spectral properties of a charged quantum particle confined to a chain graph consisting of an infinite array of rings under influence of a magnetic field assuming a $\\delta$-coupling at the points where the rings touch. We start with the situation when the system has a translational symmetry and analyze spectral consequences of perturbations of various kind, such as a local change of the magnetic field, of the coupling constant, or of a ring circumference. A particular attention is paid to weak perturbations, both local and periodic; for the latter we prove a version of Saxon-Hutner conjecture.
Hiding Location Information from Location-Based Services
Hengartner, Urs
that the architecture is powerful enough to support existing location- based services. Our architecture exploits Trusted-specific information is being accessed. I. INTRODUCTION The ubiquity of cellphones has lead to the introduction of a cellphone user (e.g., directions to a target location or a list of interesting, nearby places). Another
Commencement Ceremony Department Time Location Department and Major Time Location
Kaji, Hajime
Engineering 15:30 Bldg. 63 Classroom 01 (2nd Fl.) Industrial and Management Systems Engineering 15:30 Bldg. 63 and Management 15:30 Bldg. 63 Classroom 01 (2nd Fl.) Department Time Location Department and Major Time Location:30 Bldg. 57 202 Modern Mechanical Engineering 10:30 Bldg. 57 202 Industrial and Management Systems
Performance Analysis of the Hierarchical Layer Graph for Wireless Networks
Schindelhauer, Christian
a distributed, localized and resource-efficient algorithm for constructing the HL graph. We have implemented introduced and analyzed by Meyer auf der Heide et al. 2004. This graph can be used as a topology for wireless networks with variable trans- mission ranges. In this paper we present a distributed, localized
SPATIAL POINT PROCESSES AND GRAPH BASED STATISTICAL FEATURES
Jyväskylä, University of
2010 2000 Mathematics Subject Classification. 60G55, 62-07, 62M30. ISSN 1457-9235 #12;SPATIAL POINT Classification. 60G55, 62-07, 62M30. 1 #12;Spatial point processes and graph based statistical features Tuomas library has been developed for the computation of the graph-based summaries. Keywords: Spatial point
On the concurrent semantics of Algebraic Graph Grammars #
Baldan, Paolo
â??a di Pisa, Italy baldan@dsi.unive.it andrea@di.unipi.it Abstract. Graph grammars are a powerful model. These semantics have served as basis for the development of a variety of modelling and verification techniques graph transformation systems as an alternative model of concurrency, extending Petri nets. The basic
Generalized Graph Products for Network Design and Analysis
Roughan, Matthew
Generalized Graph Products for Network Design and Analysis Eric Parsonage, Hung X. Nguyen, Rhys--Network design, as it is currently practiced, involves putting devices together to create a network. However as a whole object. In this paper we develop generalized graph products that allow the mathematical design
The Generic Graph Component Library Dr. Dobb's Journal September 2000
Lumsdaine, Andrew
by Jeremy G. Siek and Andrew Lumsdaine). The most important aspect of designing the library was to defineThe Generic Graph Component Library Dr. Dobb's Journal September 2000 Generic programming for graph.nd.edu, and lumsg@lsc.nd.edu, respectively. The Standard Template Library has established a solid foundation
Rapidly mixing Markov chains for dismantleable constraint graphs
Dyer, Martin
Rapidly mixing Markov chains for dismantleable constraint graphs Martin Dyer Mark Jerrum Eric adjacency. Brightwell and Winkler introduced the notion of dismantleable constraint graph to characterize proportional to vVG ((v)). We prove, for each dismantleable H, that there exist positive constant fugacities
Statistical Inference on Graphs Gerard BIAU # and Kevin BLEAKLEY
Biau, GĂ©rard
to reconstruct networks have been proposed and tested so far, ranging from Bayesian or Petri networks applications including communication networks and systems biology, we propose a general model for studying deals with problems that have a graph (or network) structure. In this context an (undirected) graph
SGor: Trust graph based onion routing Peng Zhou a,
Ives, Zachary G.
routers pose a serious threat to existing onion routing networks (e.g., the Tor network [14]). To thwartSGor: Trust graph based onion routing Peng Zhou a, , Xiapu Luo a , Ang Chen b,1 , Rocky K.C. Chang August 2013 Available online 24 August 2013 Keywords: Trust graph Anonymity Onion routing a b s t r a c
Graph Ramsey Theory and the Polynomial Hierarchy Marcus Schaefer
Schaefer, Marcus
Graph Ramsey Theory and the Polynomial Hierarchy Marcus Schaefer School of CTI DePaul University In the Ramsey theory of graphs F # (G, H) means that for every way of coloring the edges of F red and blue F, a priori, that such a number even exists. Frank Ramsey [Ram30, GRS90] showed in 1930 that the number
Planar Ramsey Numbers for Small Graphs Andrzej Dudek
RuciĂ±ski, Andrzej
Planar Ramsey Numbers for Small Graphs Andrzej Dudek Department of Mathematics and Computer Science Adam Mickiewicz University PoznaÂ´n, Poland Abstract Given two graphs G1 and G2, the planar Ramsey a copy of G1 or its complement contains a copy of G2. So far, the planar Ramsey numbers have been deter
Querying RDF Data from a Graph Database Perspective
Baeza-Yates, Ricardo
}@dcc.uchile.cl Agenda · Motivations, Problem and Proposal · Database Models · Graph Database Models · RDF as data model of data model with inherent graph structure. · Database models and query languages should support its that a query language for RDF should provide. Database Models Data structures Operators and Query Language
Priority Algorithms for Graph Optimization Problems Allan Borodin
Larsen, Kim Skak
Priority Algorithms for Graph Optimization Problems Allan Borodin University of Toronto bor of priority or "greedy-like" algorithms as initiated in [10] and as extended to graph theoretic problems, there are several natural input formulations for a given problem and we show that priority algorithm bounds
Critical behavior in inhomogeneous random graphs Remco van der Hofstad
Hofstad, Remco van der
Critical behavior in inhomogeneous random graphs Remco van der Hofstad June 10, 2010 Abstract We study the critical behavior of inhomogeneous random graphs where edges are present independently but with unequal edge occupation probabilities. The edge probabilities are moderated by vertex weights
Generating Fast Code from Concurrent Program Dependence Graphs
such synchronous concurrent specifications. Starting from a concurrent program dependence graph generated fromGenerating Fast Code from Concurrent Program Dependence Graphs Jia Zeng Cristian Soviani Stephen A, this approach can be unpredictable and difficult to debug. Synchronous concurrency, in which a sys- tem marches
Grid Intersection Graphs and Order Dimension Steven Chaplick
Felsner, Stefan
in Figure 2. A grid intersection graph (GIG) is an intersection graph of horizontal and vertical segments intersects, some authors prefer to call this class pure-GIG. If G admits a grid Supported by ESF Euro Structures' (GRK 1408) 1 #12;bipartite permutation Stick 3-DORG UGIGStabGIG GIG 4-DORG SegRay 2-DORG Bip
GRAPH THEORETIC APPROACHES TO INJECTIVITY IN CHEMICAL REACTION SYSTEMS
Craciun, Gheorghe
GRAPH THEORETIC APPROACHES TO INJECTIVITY IN CHEMICAL REACTION SYSTEMS MURAD BANAJI AND GHEORGHE algebraic and graph theoretic conditions for injectivity of chemical reaction systems. After developing the possibility of multiple equilibria in the systems in question. Key words. Chemical reactions; Injectivity; SR
The Parallel BGL: A Generic Library for Distributed Graph Computations
Lumsdaine, Andrew
] and written in a style similar to the C++ Standard Template Library (STL) [38, 46], 1 #12;data types providedThe Parallel BGL: A Generic Library for Distributed Graph Computations Douglas Gregor and Andrew,lums}@osl.iu.edu Abstract This paper presents the Parallel BGL, a generic C++ library for distributed graph computation
An Experimental Comparison of Pregel-like Graph Processing Systems
Daudjee, Khuzaima
Attribution- NonCommercial-NoDerivs 3.0 Unported License. To view a copy of this li- cense, visit http://creativecommons.org/licenses/by-nc Apache Hama [2], Apache Giraph [1], Catch the Wind (CatchW) [34], GPS [32], GraphLab [28] (which now incorporates PowerGraph [18]), and Mizan [23]. The relative performance characteristics of such systems
Linear-Time Algorithms for Proportional Contact Graph Representations
Kobourov, Stephen G.
Linear-Time Algorithms for Proportional Contact Graph Representations Technical Report CS-2011. In a proportional contact representation of a planar graph, each vertex is represented by a simple polygon with area proportional to a given weight, and edges are represented by adjacencies between the corresponding pairs
On global offensive k-alliances in graphs
Bermudo, Sergio; Sigarreta, Jose M; Yero, Ismael G
2008-01-01
We investigate the relationship between global offensive $k$-alliances and some characteristic sets of a graph including $r$-dependent sets and $\\tau$-dominating sets. As a consequence of the study, we obtain bounds on the global offensive $k$-alliance number in terms of several parameters of the graph.
Scalability Analysis of Partitioning Strategies for Finite Element Graphs. \\Lambda
Kumar, Vipin
Scalability Analysis of Partitioning Strategies for Finite Element Graphs. \\Lambda Grama Y. Ananth Y. Grama ananth@cs:umn:edu Abstract Issues of partitioning Finite Element Graphs are central for implementing the Finite Element Method (FEM). Parallel formulations of finite element techniques require
Bicyclic graphs with exactly two main signless Laplacian eigenvalues
Huang, He
2012-01-01
A signless Laplacian eigenvalue of a graph $G$ is called a main signless Laplacian eigenvalue if it has an eigenvector the sum of whose entries is not equal to zero. In this paper, all connected bicyclic graphs with exactly two main eigenvalues are determined.
Universal random semi-directed graphs Anthony Bonato
Bonato, Anthony
, are of smaller order than the order of the graph). For example, power laws and the small world prop- erty have. Abstract Motivated by models for real-world networks such as the web graph, we consider digraphs formed by adding new vertices joined to a fixed constant m number of existing vertices of prescribed type. We
Statistical Selection of Congruent Subspaces for Mining Attributed Graphs
Antwerpen, Universiteit
Statistical Selection of Congruent Subspaces for Mining Attributed Graphs Patricia Iglesias S (KIT), Germany University of Antwerp, Belgium {patricia.iglesias, emmanuel.mueller, fabian.laforet, fabian.keller, klemens.boehm}@kit.edu Abstract--Current mining algorithms for attributed graphs exploit
Unicyclic graphs with large energy Eric Ould Dadah Andriantiana 1
Wagner, Stephan
Unicyclic graphs with large energy Eric Ould Dadah Andriantiana 1 and Stephan Wagner 2 Department Abstract We study the energy (i.e., the sum of the absolute values of all eigenvalues) of so- called on the largest and second-largest energy of a unicyclic graph due to Caporossi, Cvetkovi´c, Gutman and Hansen
Location Management for Mobile Devices
Wilde, Erik
2008-01-01
general, and wireless and mobile devices in particular. Thelocation-enabled mobile devices and location-based services.information from mobile devices and making it available to
An Experiment on Graph Analysis Methodologies for Scenarios
Brothers, Alan J.; Whitney, Paul D.; Wolf, Katherine E.; Kuchar, Olga A.; Chin, George
2005-09-30
Visual graph representations are increasingly used to represent, display, and explore scenarios and the structure of organizations. The graph representations of scenarios are readily understood, and commercial software is available to create and manage these representations. The purpose of the research presented in this paper is to explore whether these graph representations support quantitative assessments of the underlying scenarios. The underlying structure of the scenarios is the information that is being targeted in the experiment and the extent to which the scenarios are similar in content. An experiment was designed that incorporated both the contents of the scenarios and analysts’ graph representations of the scenarios. The scenarios’ content was represented graphically by analysts, and both the structure and the semantics of the graph representation were attempted to be used to understand the content. The structure information was not found to be discriminating for the content of the scenarios in this experiment; but, the semantic information was discriminating.
Noisy entanglement evolution for graph states
L. Aolita; D. Cavalcanti; R. Chaves; C. Dhara; L. Davidovich; A. Acin
2011-03-29
A general method for the study of the entanglement evolution of graph states under the action of Pauli was recently proposed in [Cavalcanti, et al., Phys. Rev. Lett. 103, 030502 (2009)]. This method is based on lower and upper bounds on the entanglement of the entire state as a function only of the state of a considerably-smaller subsystem, which undergoes an effective noise process. This provides a huge simplification on the size of the matrices involved in the calculation of entanglement in these systems. In the present paper we elaborate on this method in details and generalize it to other natural situations not described by Pauli maps. Specifically, for Pauli maps we introduce an explicit formula for the characterization of the resulting effective noise. Beyond Pauli maps, we show that the same ideas can be applied to the case of thermal reservoirs at arbitrary temperature. In the latter case, we discuss how to optimize the bounds as a function of the noise strength. We illustrate our ideas with explicit exemplary results for several different graphs and particular decoherence processes. The limitations of the method are also discussed.
Adiabatic graph-state quantum computation
Bobby Antonio; Damian Markham; Janet Anders
2014-12-19
Measurement-based quantum computation (MBQC) and holonomic quantum computation (HQC) are two very different computational methods. The computation in MBQC is driven by adaptive measurements executed in a particular order on a large entangled state. In contrast in HQC the system starts in the ground subspace of a Hamiltonian which is slowly changed such that a transformation occurs within the subspace. Following the approach of Bacon and Flammia, we show that any measurement-based quantum computation on a graph state with \\emph{gflow} can be converted into an adiabatically driven holonomic computation, which we call \\emph{adiabatic graph-state quantum computation} (AGQC). We then investigate how properties of AGQC relate to the properties of MBQC, such as computational depth. We identify a trade-off that can be made between the number of adiabatic steps in AGQC and the norm of $\\dot{H}$ as well as the degree of $H$, in analogy to the trade-off between the number of measurements and classical post-processing seen in MBQC. Finally the effects of performing AGQC with orderings that differ from standard MBQC are investigated.
International energy indicators. [Statistical tables and graphs
Bauer, E.K. (ed.)
1980-05-01
International statistical tables and graphs are given for the following: (1) Iran - Crude Oil Capacity, Production and Shut-in, June 1974-April 1980; (2) Saudi Arabia - Crude Oil Capacity, Production, and Shut-in, March 1974-Apr 1980; (3) OPEC (Ex-Iran and Saudi Arabia) - Capacity, Production and Shut-in, June 1974-March 1980; (4) Non-OPEC Free World and US Production of Crude Oil, January 1973-February 1980; (5) Oil Stocks - Free World, US, Japan, and Europe (Landed, 1973-1st Quarter, 1980); (6) Petroleum Consumption by Industrial Countries, January 1973-December 1979; (7) USSR Crude Oil Production and Exports, January 1974-April 1980; and (8) Free World and US Nuclear Generation Capacity, January 1973-March 1980. Similar statistical tables and graphs included for the United States include: (1) Imports of Crude Oil and Products, January 1973-April 1980; (2) Landed Cost of Saudi Oil in Current and 1974 Dollars, April 1974-January 1980; (3) US Trade in Coal, January 1973-March 1980; (4) Summary of US Merchandise Trade, 1976-March 1980; and (5) US Energy/GNP Ratio, 1947 to 1979.
Component evolution in general random intersection graphs
Bradonjic, Milan [Los Alamos National Laboratory; Hagberg, Aric [Los Alamos National Laboratory; Hengartner, Nick [Los Alamos National Laboratory; Percus, Allon G [CLAREMONT GRADUATE UNIV.
2010-01-01
We analyze component evolution in general random intersection graphs (RIGs) and give conditions on existence and uniqueness of the giant component. Our techniques generalize the existing methods for analysis on component evolution in RIGs. That is, we analyze survival and extinction properties of a dependent, inhomogeneous Galton-Watson branching process on general RIGs. Our analysis relies on bounding the branching processes and inherits the fundamental concepts from the study on component evolution in Erdos-Renyi graphs. The main challenge becomes from the underlying structure of RIGs, when the number of offsprings follows a binomial distribution with a different number of nodes and different rate at each step during the evolution. RIGs can be interpreted as a model for large randomly formed non-metric data sets. Besides the mathematical analysis on component evolution, which we provide in this work, we perceive RIGs as an important random structure which has already found applications in social networks, epidemic networks, blog readership, or wireless sensor networks.
Mobile Alternative Fueling Station Locator
Not Available
2009-04-01
The Department of Energy's Alternative Fueling Station Locator is available on-the-go via cell phones, BlackBerrys, or other personal handheld devices. The mobile locator allows users to find the five closest biodiesel, electricity, E85, hydrogen, natural gas, and propane fueling sites using Google technology.
Guide to the Library Locations
Massachusetts at Amherst, University of
Guide to the Libraries #12;Library Locations W.E.B. DU BOIS LIBRARY www.library.umass.edu 154 Hicks Way (413) 545-0150, (413) 545-2622 The Du Bois Library is the primary location for resources in education, geography, the humanities and fine arts, nursing, management, medicine, public health, and social
Energy Models for Drawing Signed Graphs Anne-Marie Kermarrec and Afshin Moin
Paris-Sud XI, Université de
by proposing a dual energy model for graphs containing uniquely negative edges, and combining it linearly
A characterization of K2,4-minor-free graphs M. N. Ellingham1
Ellingham, Mark
A characterization of K2,4-minor-free graphs M. N. Ellingham1 Emily A. Marshall1,2 Department structural characterization of K2,4-minor-free graphs. The 3-connected K2,4- minor-free graphs consist many forbidden minors. So characterizations of graphs without one or two specific minors form natural
The Generic Graph Component Library LieQuan Lee Jeremy G. Siek Andrew Lumsdaine
Lumsdaine, Andrew
The Generic Graph Component Library LieQuan Lee Jeremy G. Siek Andrew Lumsdaine Laboratory In this paper we present the Generic Graph Component Library (GGCL), a generic programming framework for graph data struc tures and graph algorithms. Following the theme of the Standard Template Library (STL
2-Source Dispersers for no(1) Entropy, and Ramsey Graphs Beating
Shaltiel, Ronen
2-Source Dispersers for no(1) Entropy, and Ramsey Graphs Beating the Frankl-Wilson Construction of a bipartite graph, this gives an explicit construction of a bipartite K-Ramsey graph of 2N vertices [BKS+ 05]. As a corollary, we get a construction of a 22log1-0 n (non bipartite) Ramsey graph of 2n
West, Douglas B.
OnÂline Ramsey Theory for Bounded Degree Graphs Jane Butterfield, Tracy Grauman, William B. Abstract When graph Ramsey theory is viewed as a game, ``Painter'' 2Âcolors the edges of a graph presentedÂline degree Ramsey number Ĺˇ R# (G) is the least k such that Builder wins (G, H) when H is the class of graphs
West, Douglas B.
On-line Ramsey Theory for Bounded Degree Graphs Jane Butterfield, Tracy Grauman, William B When graph Ramsey theory is viewed as a game, "Painter" 2-colors the edges of a graph presented-line degree Ramsey number Â°R(G) is the least k such that Builder wins (G, H) when H is the class of graphs
Constructing Ramsey graphs from small probability spaces IBM Almaden Research Center
Naor, Moni
Constructing Ramsey graphs from small probability spaces Moni Naor IBM Almaden Research Center 650 Harry Road SanÂJose CA 95120 naor@almaden.ibm.com Abstract The problem of explicitly constructing Ramsey of all graphs in a distribution that is known to have mostly Ramsey graphs. Keywords: Ramsey Graphs
Constructing Ramsey graphs from small probability spaces IBM Almaden Research Center
Naor, Moni
Constructing Ramsey graphs from small probability spaces Moni Naor IBM Almaden Research Center 650 Harry Road San-Jose CA 95120 naor@almaden.ibm.com Abstract The problem of explicitly constructing Ramsey of all graphs in a distribution that is known to have mostly Ramsey graphs. Keywords: Ramsey Graphs
A Graph-Based Data Model and its Ramifications Mark Levene and George Loizou
Levene, Mark
A Graph-Based Data Model and its Ramifications Mark Levene and George Loizou Abstract- Currently candidate for for- malising hypertext. We then compare it with other graph-based data models and with set-based as a paradigm for graph-based data modelling, we show how to bridge the gap between graph-based and set-based
Interactive Visualization of Genealogical Graphs Michael J. McGuffin Ravin Balakrishnan
Toronto, University of
Interactive Visualization of Genealogical Graphs Michael J. McGuffin Ravin Balakrishnan Department of visualizing "family trees", or genealogi- cal graphs, in 2D, is considered. A graph theoretic analysis is given, which identifies why genealogical graphs can be difficult to draw. This motivates some novel
The Incidence Hopf Algebra of Graphs
Humpert, Brandon; Martin, Jeremy L.
2012-05-03
), unit u(1) = K 0 , comultiplication ?(G) = ? T?V (G) G|T ?G|T , and counit #3;(G) = { 1 if n(G) = 0, 0 if n(G) > 0. The graph algebra is commutative and cocommutative; in particular, its character group X(G) is abelian. As proved by Schmitt [Sch94, (12.1...) counts the number of k-colorings of G such that every color-induced subgraph is H-free. As an extreme example, if G = H , then P?G(G; k) = k n(G) ? k, because the non-G-free colorings are precisely those using only one color. If H = Km,1, then Pm(G; k...
Bicyclic graphs with maximal revised Szeged index
Li, Xueliang
2011-01-01
The revised Szeged index $Sz^*(G)$ is defined as $Sz^*(G)=\\sum_{e=uv \\in E}(n_u(e)+ n_0(e)/2)(n_v(e)+ n_0(e)/2),$ where $n_u(e)$ and $n_v(e)$ are, respectively, the number of vertices of $G$ lying closer to vertex $u$ than to vertex $v$ and the number of vertices of $G$ lying closer to vertex $v$ than to vertex $u$, and $n_0(e)$ is the number of vertices equidistant to $u$ and $v$. Hansen used the AutoGraphiX and made the following conjecture about the revised Szeged index for a connected bicyclic graph $G$ of order $n \\geq 6$:
The normalized Laplacian spectrum of subdivisions of a graph
Pinchen Xie; Zhongzhi Zhang; Francesc Comellas
2015-10-07
Determining and analyzing the spectra of graphs is an important and exciting research topic in theoretical computer science. The eigenvalues of the normalized Laplacian of a graph provide information on its structural properties and also on some relevant dynamical aspects, in particular those related to random walks. In this paper, we give the spectra of the normalized Laplacian of iterated subdivisions of simple connected graphs. As an example of application of these results we find the exact values of their multiplicative degree-Kirchhoff index, Kemeny's constant and number of spanning trees.
Probabilistic Flooding for Efficient Information Dissemination in Random Graph
Stavrakakis, Ioannis
Probabilistic Flooding for Efficient Information Dissemination in Random Graph Topologies 1 & Telecommunications, Athens, Greece Abstract Probabilistic flooding has been frequently considered as a suitable) flooding approaches that are used to disseminate globally information in unstructured peer
Cell-Graph Mining for Breast Tissue Modelling and Classification
Bystroff, Chris
metrics for tissue characteriza- tion and classification. We segmented the digital images of histopaCell-Graph Mining for Breast Tissue Modelling and Classification C.C¸ agatay Bilgin a, C¸ igdem
Support graph preconditioning for elliptic finite element problems
Wang, Meiqiu
2009-05-15
A relatively new preconditioning technique called support graph preconditioning has many merits over the traditional incomplete factorization based methods. A major limitation of this technique is that it is applicable to ...
Technology Portfolio Planning by Weighted Graph Analysis of System Architectures
de Weck, Olivier L.
Technology Portfolio Planning by Weighted Graph Analysis of System Architectures Peter Davison architecture selection and technology investment decisions will constrain the system to certain regions architectures, with a view to enabling robustness to technology portfolio realization and later architectural
Temporally Scalable Visual SLAM using a Reduced Pose Graph
Johannsson, Hordur
2012-05-25
In this paper, we demonstrate a system for temporally scalable visual SLAM using a reduced pose graph representation. Unlike previous visual SLAM approaches that use keyframes, our approach continually uses new measurements ...
Scalable Parallel Algorithms for Massive Scale-free Graphs
Pearce, Roger Allan
2013-12-05
Efficiently storing and processing massive graph data sets is a challenging problem as researchers seek to leverage “Big Data” to answer next-generation scientific questions. New techniques are required to process large ...
On Graphs that are not PCGs Stephane Durocher1
Durocher, Stephane
the graph classes that arise from using the intervals [0, dmax] (LPG) and [dmin, ] (mLPG). They proved LPG, mLPG and PCG are similar to the leaf powers and their variants, which have been extensively
Temporally scalable visual SLAM using a reduced pose graph
Johannsson, Hordur
In this paper, we demonstrate a system for temporally scalable visual SLAM using a reduced pose graph representation. Unlike previous visual SLAM approaches that maintain static keyframes, our approach uses new measurements ...
Quantum Graphs: Applications to Quantum Chaos and Universal Spectral Statistics
Sven Gnutzmann; Uzy Smilansky
2006-12-15
During the last years quantum graphs have become a paradigm of quantum chaos with applications from spectral statistics to chaotic scattering and wave function statistics. In the first part of this review we give a detailed introduction to the spectral theory of quantum graphs and discuss exact trace formulae for the spectrum and the quantum-to-classical correspondence. The second part of this review is devoted to the spectral statistics of quantum graphs as an application to quantum chaos. Especially, we summarise recent developments on the spectral statistics of generic large quantum graphs based on two approaches: the periodic-orbit approach and the supersymmetry approach. The latter provides a condition and a proof for universal spectral statistics as predicted by random-matrix theory.
Generalized Domination in Graphs with Applications in Wireless Networks
Sung, Je Sang
2013-12-10
The objective of this research is to study practical generalization of domination in graphs and explore the theoretical and computational aspects of models arising in the design of wireless networks. For the construction of a virtual backbone of a...
Spectral problems of optical waveguides and quantum graphs
Ong, Beng Seong
2006-10-30
In this dissertation, we consider some spectral problems of optical waveguide and quantum graph theories. We study spectral problems that arise when considerating optical waveguides in photonic band-gap (PBG) materials. Specifically, we address...
Graph Coloring on a Coarse Grained Multiprocessor (extended abstract)
Gebremedhin, Assefaw Hadish
Graph Coloring on a Coarse Grained Multiprocessor (extended abstract) Assefaw Hadish Gebremedhin1 Allwright et al. (1995). However, in a recent result, Gebremedhin and Manne (1999a, 1999b) present
Speeding up Parallel Graph Coloring Assefaw H. Gebremedhin1,
Manne, Fredrik
Speeding up Parallel Graph Coloring Assefaw H. Gebremedhin1, , Fredrik Manne2 , and Tom Woods2 1. Gebremedhin, Fredrik Manne, and Tom Woods However, in practice greedy sequential coloring heuristics have been
SEMANTICS OF PROGRAM REPRESENTATION GRAPHS G. RAMALINGAM and THOMAS REPS
Reps, Thomas W.
dependence graphs (PDGs) [Kuck81, Ferr87, Horw89]. They have also been used in a new algorithm for merging representation in various appli cations such as vectorization, parallelization [Kuck81], and merging program
Bond graph models of electromechanical systems. The AC generator case
Batlle, Carles
Bond graph models of electromechanical systems. The AC generator case Carles Batlle Department. After reviewing electromechanical energy conversion and torque gener- ation, the core element present in any electromechanical system is introduced, and the corresponding electrical and mechanical ports
Parallel Algorithms for Graph Optimization using Tree Decompositions
Sullivan, Blair D; Weerapurage, Dinesh P; Groer, Christopher S
2012-06-01
Although many $\\cal{NP}$-hard graph optimization problems can be solved in polynomial time on graphs of bounded tree-width, the adoption of these techniques into mainstream scientific computation has been limited due to the high memory requirements of the necessary dynamic programming tables and excessive runtimes of sequential implementations. This work addresses both challenges by proposing a set of new parallel algorithms for all steps of a tree decomposition-based approach to solve the maximum weighted independent set problem. A hybrid OpenMP/MPI implementation includes a highly scalable parallel dynamic programming algorithm leveraging the MADNESS task-based runtime, and computational results demonstrate scaling. This work enables a significant expansion of the scale of graphs on which exact solutions to maximum weighted independent set can be obtained, and forms a framework for solving additional graph optimization problems with similar techniques.
Computing the stability number of a graph via semidefinite and ...
2006-04-27
then the vertices of G can be numbered so that E(G8) ? E(G ). Thus G8 is the smallest graph G such that ?(1)(G) > ?(G) = 3. We can extend the above reasoning ...
APPROXIMATING SPECTRAL INVARIANTS OF HARPER OPERATORS ON GRAPHS II
Schick, Thomas
APPROXIMATING SPECTRAL INVARIANTS OF HARPER OPERATORS ON GRAPHS II VARGHESE MATHAI, THOMAS SCHICK;2 VARGHESE MATHAI, THOMAS SCHICK, AND STUART YATES subset E+ of these edges in which each combinatorial edge
Efficient graphlet kernels for large graph comparison Nino Shervashidze
Mehlhorn, Kurt
Efficient graphlet kernels for large graph comparison Nino Shervashidze MPI for Biological such as gSpan (Yan & Han, 2003) have been developed for this task, which use el- egant data structures
Automated Inclusive Design Heuristics Generation with Graph Mining
Sangelkar, Shraddha Chandrakant
2013-08-01
from existing inclusive products. Formalization results show that, the rate of rule generation decreases as more products are added to the dataset. The automated method is particularly helpful in the developmental stages of graph mining applications...
Local computation algorithms for graphs of non-constant degrees
Yodpinyanee, Anak
2014-01-01
In the model of local computation algorithms (LCAs), we aim to compute the queried part of the output by examining only a small (sublinear) portion of the input. Many recently developed LCAs on graph problems achieve time ...
Predictive Mutual Cuts in Graphs: Learning in Bioinformatics
. De Moor K.U. Leuven, ESAT, SCD/SISTA, Kasteelpark Arenberg 10, B-3001, Leuven, Belgium Recent work (mutual graph cuts). Specifically, the problem of mining for correspondances between mi- croarray
A note on light geometric graphs Eyal Ackerman
Fox, Jacob
A note on light geometric graphs Eyal Ackerman Jacob Fox Rom Pinchasi March 19, 2012 Abstract Let G be a geometric graph on n vertices in general position in the plane. We say that G is k-light if no edge e of G than k edges of G. We extend the previous result in [1] and with a shorter argument show that every k-light
Zirbel, Craig L.
Copying Maple graphs into Word Once you create a graph with Maple, you can copy and paste it into Word pretty easily. However, you might be unhappy with the result, if it looks like this: This image to get the image into Word in a better way. Below are two Maple graphs. On a Macintosh, you can click
WORKPLACE HAZARD ASSESSMENT Location: Task
Rubloff, Gary W.
WORKPLACE HAZARD ASSESSMENT Location: Task: Performed by: Date: This form may be used as an aid in performing hazard assessment. Review listed hazard classifications, identify all hazards, possible hazards and their sources. Hazard classification listing is not intended to be complete but is provided as a guide
Noisy entanglement evolution for graph states
Aolita, L; Chaves, R; Dhara, C; Davidovich, L; Acin, A
2010-01-01
A general method for the study of the entanglement evolution of graph states under the action of Pauli was recently proposed in [Cavalcanti, et al., Phys. Rev. Lett. 103, 030502 (2009)]. This method is based on lower and upper bounds on the entanglement of the entire state as a function only of the state of a considerably-smaller subsystem, which undergoes an effective noise process. This provides a huge simplification on the size of the matrices involved in the calculation of entanglement in these systems. In the present paper we elaborate on this method in details and generalize it to other natural situations not described by Pauli maps. Specifically, for Pauli maps we introduce an explicit formula for the characterization of the resulting effective noise. Beyond Pauli maps, we show that the same ideas can be applied to the case of thermal reservoirs at arbitrary temperature. In the latter case, we discuss how to optimize the bounds as a function of the noise strength. We illustrate our ideas with explicit ...
Quantum Vacuum Energy in Graphs and Billiards
L. Kaplan
2011-01-03
The vacuum (Casimir) energy in quantum field theory is a problem relevant both to new nanotechnology devices and to dark energy in cosmology. The crucial question is the dependence of the energy on the system geometry under study. Despite much progress since the first prediction of the Casimir effect in 1948 and its subsequent experimental verification in simple geometries, even the sign of the force in nontrivial situations is still a matter of controversy. Mathematically, vacuum energy fits squarely into the spectral theory of second-order self-adjoint elliptic linear differential operators. Specifically, one promising approach is based on the small-t asymptotics of the cylinder kernel e^(-t sqrt(H)), where H is the self-adjoint operator under study. In contrast with the well-studied heat kernel e^(-tH), the cylinder kernel depends in a non-local way on the geometry of the problem. We discuss some results by the Louisiana-Oklahoma-Texas collaboration on vacuum energy in model systems, including quantum graphs and two-dimensional cavities. The results may shed light on general questions, including the relationship between vacuum energy and periodic or closed classical orbits, and the contribution to vacuum energy of boundaries, edges, and corners.
Alliance free sets in Cartesian product graphs
Yero, Ismael G; Bermudo, Sergio
2011-01-01
Let $G=(V,E)$ be a graph. For a non-empty subset of vertices $S\\subseteq V$, and vertex $v\\in V$, let $\\delta_S(v)=|\\{u\\in S:uv\\in E\\}|$ denote the cardinality of the set of neighbors of $v$ in $S$, and let $\\bar{S}=V-S$. Consider the following condition: {equation}\\label{alliancecondition} \\delta_S(v)\\ge \\delta_{\\bar{S}}(v)+k, \\{equation} which states that a vertex $v$ has at least $k$ more neighbors in $S$ than it has in $\\bar{S}$. A set $S\\subseteq V$ that satisfies Condition (\\ref{alliancecondition}) for every vertex $v \\in S$ is called a \\emph{defensive} $k$-\\emph{alliance}; for every vertex $v$ in the neighborhood of $S$ is called an \\emph{offensive} $k$-\\emph{alliance}. A subset of vertices $S\\subseteq V$, is a \\emph{powerful} $k$-\\emph{alliance} if it is both a defensive $k$-alliance and an offensive $(k +2)$-alliance. Moreover, a subset $X\\subset V$ is a defensive (an offensive or a powerful) $k$-alliance free set if $X$ does not contain any defensive (offensive or powerful, respectively) $k$-allianc...
Joint microseismic event location with uncertain velocity
Poliannikov, Oleg V.
2013-01-01
We study the problem of the joint location of seismic events using an array of receivers. We show that locating multiple seismic events simultaneously is advantageous compared to the more traditional approaches of locating ...
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
Location and Hours Location The ORNL Research Library is located off the central corridor of Bldg. 4500N on the main ORNL campus. Hours The library is open 24 hours, seven days a...
Green's function approach for quantum graphs: an overview
Fabiano M. Andrade; Alexandre G. M. Schmidt; Eduardo Vicentini; Bin K. Cheng; Marcos G. E. da Luz
2016-01-05
Here we review the many interesting aspects and distinct phenomena associated to quantum dynamics on general graph structures. For so, we discuss such class of systems under the energy domain Green's function ($G$) framework. Such approach is particularly interesting because $G$ can be written as a sum over classical-like paths, where local quantum effects are taking into account through the scattering matrix amplitudes (basically, transmission and reflection coefficients) defined on each one of the graph vertices. So, the {\\em exact} $G$ has the functional form of a generalized semiclassical formula, which through different calculation techniques (addressed in details here) always can be cast into a closed analytic expression. This allows to solve exactly arbitrary large (although finite) graphs in a recursive and fast way. Using the Green's function method, we survey many properties for open and closed quantum graphs, like scattering solutions for the former and eigenspectrum and eigenstates for the latter, also addressing quasi-bound states. Concrete examples, like cube, binary trees and Sierpi\\'nski-like, topologies are considered. Along the work, possible distinct applications using the Green's function methods for quantum graphs are outlined.
Optimized Fault Location Final Project Report
Optimized Fault Location Final Project Report Power Systems Engineering Research Center A National Engineering Research Center Optimized Fault Location Concurrent Technologies Corporation Final Project Report
Energy Department Launches Alternative Fueling Station Locator...
Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site
Launches Alternative Fueling Station Locator App Energy Department Launches Alternative Fueling Station Locator App November 7, 2013 - 11:16am Addthis As part of the Obama...
Zhao, Jun; Gligor, Virgil
2015-01-01
Random intersection graphs have received much interest and been used in diverse applications. They are naturally induced in modeling secure sensor networks under random key predistribution schemes, as well as in modeling the topologies of social networks including common-interest networks, collaboration networks, and actor networks. Simply put, a random intersection graph is constructed by assigning each node a set of items in some random manner and then putting an edge between any two nodes that share a certain number of items. Broadly speaking, our work is about analyzing random intersection graphs, and models generated by composing it with other random graph models including random geometric graphs and Erd\\H{o}s-R\\'enyi graphs. These compositional models are introduced to capture the characteristics of various complex natural or man-made networks more accurately than the existing models in the literature. For random intersection graphs and their compositions with other random graphs, we study properties su...
Regular graphs maximize the variability of random neural networks
Gilles Wainrib; Mathieu Galtier
2014-12-17
In this work we study the dynamics of systems composed of numerous interacting elements interconnected through a random weighted directed graph, such as models of random neural networks. We develop an original theoretical approach based on a combination of a classical mean-field theory originally developed in the context of dynamical spin-glass models, and the heterogeneous mean-field theory developed to study epidemic propagation on graphs. Our main result is that, surprisingly, increasing the variance of the in-degree distribution does not result in a more variable dynamical behavior, but on the contrary that the most variable behaviors are obtained in the regular graph setting. We further study how the dynamical complexity of the attractors is influenced by the statistical properties of the in-degree distribution.
An improved spectral graph partitioning algorithm for mapping parallel computations
Hendrickson, B.; Leland, R.
1992-09-01
Efficient use of a distributed memory parallel computer requires that the computational load be balanced across processors in a way that minimizes interprocessor communication. We present a new domain mapping algorithm that extends recent work in which ideas from spectral graph theory have been applied to this problem. Our generalization of spectral graph bisection involves a novel use of multiple eigenvectors to allow for division of a computation into four or eight parts at each stage of a recursive decomposition. The resulting method is suitable for scientific computations like irregular finite elements or differences performed on hypercube or mesh architecture machines. Experimental results confirm that the new method provides better decompositions arrived at more economically and robustly than with previous spectral methods. We have also improved upon the known spectral lower bound for graph bisection.
A Regularized Graph Layout Framework for Dynamic Network Visualization
Xu, Kevin S; Hero, Alfred O
2012-01-01
Many real-world networks, including social and information networks, are dynamic structures that evolve over time. Such dynamic networks are typically visualized using a sequence of static graph layouts. In addition to providing a visual representation of the network topology at each time step, the sequence should preserve the mental map between layouts of consecutive time steps to allow a human to interpret the temporal evolution of the network. In this paper, we propose a framework for dynamic network visualization using regularized graph layouts. Regularization encourages stability of the layouts over time, thus preserving the mental map. The proposed framework involves optimizing a modified cost function that augments the cost function of a static graph layout algorithm with a grouping penalty, which encourages nodes to stay close to other nodes belonging to the same group, and a temporal penalty, which encourages smooth movements of the nodes over time. We introduce two dynamic layout algorithms under th...
On the mixing time of geographical threshold graphs
Bradonjic, Milan
2009-01-01
In this paper, we study the mixing time of random graphs generated by the geographical threshold graph (GTG) model, a generalization of random geometric graphs (RGG). In a GTG, nodes are distributed in a Euclidean space, and edges are assigned according to a threshold function involving the distance between nodes as well as randomly chosen node weights. The motivation for analyzing this model is that many real networks (e.g., wireless networks, the Internet, etc.) need to be studied by using a 'richer' stochastic model (which in this case includes both a distance between nodes and weights on the nodes). We specifically study the mixing times of random walks on 2-dimensional GTGs near the connectivity threshold. We provide a set of criteria on the distribution of vertex weights that guarantees that the mixing time is {Theta}(n log n).
Ombuds Office Location & Hours
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity ofkandz-cm11 Outreach Home Room NewsInformationJesseworkSURVEY UNIVERSEHowScientificOmbuds Office Location & Hours Ombuds
A HYBRID GRASP WITH PERTURBATIONS AND ADAPTIVE PATH-RELINKING FOR THE STEINER PROBLEM IN GRAPHS
Makarychev, Konstantin
with weight perturbations and adaptive path-relinking heuristic (HGP-PR) for the Steiner problem in graphs
Vacuum Energy and Repulsive Casimir Forces in Quantum Star Graphs
S. A. Fulling; L. Kaplan; J. H. Wilson
2007-03-27
Casimir pistons are models in which finite Casimir forces can be calculated without any suspect renormalizations. It has been suggested that such forces are always attractive, but we present several counterexamples, notably a simple type of quantum graph in which the sign of the force depends upon the number of edges. We also show that Casimir forces in quantum graphs can be reliably computed by summing over the classical orbits, and study the rate of convergence of the periodic orbit expansion. In generic situations where no analytic expression is available, the sign and approximate magnitude of Casimir forces can often be obtained using only the shortest classical orbits.
Spectra of magnetic chain graphs: coupling constant perturbations
Pavel Exner; Stepan S. Manko
2014-12-18
We analyze spectral properties of a quantum graph in the form of a ring chain with a $\\delta$ coupling in the vertices exposed to a homogeneous magnetic field perpendicular to the graph plane. We find the band spectrum in the case when the chain exhibits a translational symmetry and study the discrete spectrum in the gaps resulting from changing a finite number of vertex coupling constants. In particular, we discuss in details some examples such as perturbations of one or two vertices, weak perturbation asymptotics, and a pair of distant perturbations.
Faster Quantum Walk Search on a Weighted Graph
Thomas G. Wong
2015-07-27
A randomly walking quantum particle evolving by Schr\\"odinger's equation searches for a unique marked vertex on the "simplex of complete graphs" in time $\\Theta(N^{3/4})$. In this paper, we give a weighted version of this graph that preserves vertex-transitivity, and we show that the time to search on it can be reduced to nearly $\\Theta(\\sqrt{N})$. To prove this, we introduce two novel extensions to degenerate perturbation theory: an adjustment that distinguishes the weights of the edges, and a method to determine how precisely the jumping rate of the quantum walk must be chosen.
Independent set problems and odd-hole-preserving graph reductions
Warren, Jeffrey Scott
2009-05-15
. Independent Set Problems For a graph G = (V;E), S V is an independent set if no vertices in S are adjacent. The maximum independent set (MIS) problem is to find an independent set of largest cardinality in a given graph. The maximum weight independent set... for determining the optimality of a best known solution of the master problem. Many have worked to solve both the MIS and MWIS problems exactly. Tech- niques include explicit enumeration of maximal independent sets [4], combinato- rial branch-and-bound [5, 6, 7, 8...
Short range radio locator system
McEwan, T.E.
1996-12-31
A radio location system comprises a wireless transmitter that outputs two megahertz period bursts of two gigahertz radar carrier signals. A receiver system determines the position of the transmitter by the relative arrival of the radar bursts at several component receivers set up to have a favorable geometry and each one having a known location. One receiver provides a synchronizing gating pulse to itself and all the other receivers. The rate of the synchronizing gating pulse is slightly offset from the rate of the radar bursts themselves, so that each sample collects one finely-detailed piece of information about the time-of-flight of the radar pulse to each receiver each pulse period. Thousands of sequential pulse periods provide corresponding thousand of pieces of information about the time-of-flight of the radar pulse to each receiver, in expanded, not real time. Therefore the signal processing can be done with relatively low-frequency, inexpensive components. A conventional microcomputer is then used to find the position of the transmitter by geometric triangulation based on the relative time-of-flight information. 5 figs.
Short range radio locator system
McEwan, Thomas E. (Livermore, CA)
1996-01-01
A radio location system comprises a wireless transmitter that outputs two megahertz period bursts of two gigahertz radar carrier signals. A receiver system determines the position of the transmitter by the relative arrival of the radar bursts at several component receivers set up to have a favorable geometry and each one having a known location. One receiver provides a synchronizing gating pulse to itself and all the other receivers to sample the ether for the radar pulse. The rate of the synchronizing gating pulse is slightly offset from the rate of the radar bursts themselves, so that each sample collects one finely-detailed piece of information about the time-of-flight of the radar pulse to each receiver each pulse period. Thousands of sequential pulse periods provide corresponding thousand of pieces of information about the time-of-flight of the radar pulse to each receiver, in expanded, not real time. Therefore the signal processing can be done with relatively low-frequency, inexpensive components. A conventional microcomputer is then used to find the position of the transmitter by geometric triangulation based on the relative time-of-flight information.
Graph-theoretic design and analysis of key predistribution schemes Michelle Kendall Keith M. Martin
International Association for Cryptologic Research (IACR)
Graph-theoretic design and analysis of key predistribution schemes Michelle Kendall Keith M. Martin, a general understanding of the design prin- ciples on which to base such constructions is somewhat lacking as a sound design principle. Second, we propose the use of incidence graphs and concurrence graphs as tools
Effective Graph Classification Based on Topological and Label Attributes , Murat Semerci2
Zaki, Mohammed Javeed
online 12 June 2012 in Wiley Online Library (wileyonlinelibrary.com). Abstract: Graph classificationEffective Graph Classification Based on Topological and Label Attributes Geng Li1 , Murat Semerci2 propose an alternative approach to graph classification that is based on feature vectors constructed from
Intermediate statistics for a system with symplectic symmetry: the Dirac rose graph
statistics formed of a gas of energy levels interacting with a logarithmic potential. Spectral statisticsIntermediate statistics for a system with symplectic symmetry: the Dirac rose graph J.M. Harrison1 Abstract We study the spectral statistics of the Dirac operator on a rose-shaped graph-- a graph
Two levels interchange format in XML for Petri Nets and other graph-based formalisms
Gribaudo, Marco
to describe Petri Nets and other graph-based formalisms such as queueing networks and Markov chains. TwoTwo levels interchange format in XML for Petri Nets and other graph-based formalisms Andrea Valente to model Petri Nets and other graph based model speci cation formalismsis presented. In particular
Diameter of the NEPS of Bipartite Graphs Richard A. Brualdi and Jian Shen y
Brualdi, Richard A.
Diameter of the NEPS of Bipartite Graphs Richard A. Brualdi #3; and Jian Shen y Department 4, 2000 Abstract We prove that, if connected, the NEPS of connected, bipartite graphs has diameter-complete, extended p-sum, abbreviated NEPS, of G 1 ; G 2 ; : : : ; G n with basis B is the graph (see e.g. [1]) G
I/O-Efficient Algorithms for Contour Line Extraction and Planar Graph Blocking
Agarwal, Pankaj K.; Arge, Lars; Murali, T. M.; Kasturi R., Varadarajan; Vitter, Jeffrey Scott
1998-01-01
improved algorithm for a more general problem of blocking bounded-degree planar graphs such as TINS (i.e., storing them on disk so that any graph traversal algorithm can traverse the graph in an I/O-efficient manner), and apply it to two problms that arise...
Between automation and exploration: SAS graphing techniques for visualization of survey data
Yu, Alex
Between automation and exploration: SAS graphing techniques for visualization of survey data Chong of survey data. There is always a tension between automation and exploration. Automation is a common to automate the graphing processes via SAS/Macros and SAS/Graph. However, hidden patterns of the data may
Ramsey Minimal Graphs B'ela Bollob'as* Jair Donadelliy and Yoshiharu Kohayak*
Kohayakawa, Yoshiharu
Ramsey Minimal Graphs B'ela Bollob'as* Jair.lAepairtofus say that a Ramsey gra* *ph for (G, H) is critical if graphs (G, H) is said to be Ramsey-infinite ifnthereoareproper subgraph of it i* *s Ramsey for (G, H). A pair infinitely many minimal graphs for which
NON-BIPARTITE PAIRS OF 3-CONNECTED GRAPHS ARE HIGHLY RAMSEY-INFINITE
Siggers, Mark H.
NON-BIPARTITE PAIRS OF 3-CONNECTED GRAPHS ARE HIGHLY RAMSEY-INFINITE MARK SIGGERS ABSTRACT. A pair of graphs (Hb,Hr) is highly Ramsey-infinite if there is some constant c such that for large enough n. We show that a pair of 3-connected graphs is highly Ramsey-infinite if and only if at least one
Directed acyclic graphs, su cient causes and the properties of conditioning on a
Directed acyclic graphs, su˘ cient causes and the properties of conditioning on a common e #12;Abstract Su˘ cient-component causes are incorporated into the directed acyclic graph (DAG) causal su˘ cient causes on a graph, it is possible to detect conditional independencies within strata
Universality for distances in power-law random graphs Remco van der Hofstad1,a
Hofstad, Remco van der
classical random graphs such as the ErdsRényi random graph. It is often suggested that the behavior with similar degree sequences share similar behavior. We survey the available results on graph distances of the occupation status of the other ed
Light Edges in Degree-Constrained Graphs Prosenjit Bose Michiel Smid David R. Wood
Wismath, Stephen
Light Edges in Degree-Constrained Graphs #3; Prosenjit Bose Michiel Smid David R. Wood School of a graph with bounded degree end-points is said to be light. The primary result of this paper is that ev- ery degree-constrained graph has a light edge, where the degree bound depends on the minimum and aver
Computing web page importance without storing the graph of the web
Abiteboul, Serge
Computing web page importance without storing the graph of the web (extended abstract) S. Abiteboul dynamic graph has recently attracted a lot of attention because of the web. Page importance or page rank estimate of page importance while the web/graph is visited. When the web changes, page importance changes
On Finding the Maximum Number of Disjoint Cuts in Seymour Graphs ?
Ageev, Alexandr
On Finding the Maximum Number of Disjoint Cuts in Seymour Graphs ? Alexander A. Ageev Sobolev. In this paper we prove that the problem is polynomially solvable on Seymour graphs which include both all bipar is polynomially solvable when restricted to the family of Seymour graphs. To present a rigorous definition
THE MATCHING ENERGY OF A GRAPH IVAN GUTMAN AND STEPHAN WAGNER
Wagner, Stephan
,28,32,33,37]. #12;2 IVAN GUTMAN AND STEPHAN WAGNER 2. A mathematical route to matching energy The right hand side, the right hand side of Eq. (3) is not the graph energy, but a quantity which we will call "matching energyTHE MATCHING ENERGY OF A GRAPH IVAN GUTMAN AND STEPHAN WAGNER Abstract. The energy of a graph G
Determining Vision Graphs for Distributed Camera Networks Using Feature Digests
Radke, Rich
1 Determining Vision Graphs for Distributed Camera Networks Using Feature Digests Zhaolin Cheng and the length of each feature descriptor are substantially reduced to form a fixed-length "feature digest" that is broadcast to the rest of the network. Each receiver camera decompresses the feature digest to recover
Invariant random graphs with iid degrees in a general geography
Jonasson, Johan
expectation). It is shown that if G has either polynomial growth or rapid growth, then such a random graph ball containing more than n vertices. With rapid growth we mean that the number of vertices in a ball or rapid growth. It is believed that no other growth rates are possible. When G has rapid growth
Approximability of Partitioning Graphs with Supply and Demand
Demaine, Erik
Approximability of Partitioning Graphs with Supply and Demand Takehiro Ito a,, Erik D. Demaine b vertex or a demand vertex and is assigned a positive real number, called the supply or the demand. Each demand vertex can receive "power" from at most one supply vertex through edges in G. One thus wishes
Approximability of Partitioning Graphs with Supply and Demand
Demaine, Erik
Approximability of Partitioning Graphs with Supply and Demand (Extended Abstract) Takehiro Ito1 vertex or a demand vertex and is assigned a positive real number, called the supply or the demand. Each demand vertex can receive "power" from at most one supply vertex through edges in G. One thus wishes
Approximability of Partitioning Graphs with Supply and Demand
Demaine, Erik
Approximability of Partitioning Graphs with Supply and Demand (Extended Abstract) Takehiro Ito 1 vertex or a demand vertex and is assigned a positive real number, called the supply or the demand. Each demand vertex can receive ``power'' from at most one supply vertex through edges in G. One thus wishes
Distanceregular graphs having an eigenvalue of small multiplicity
Martin, Bill
, results of Godsil [12] and Terwilliger [19], to allow computer generation of all feasible intesection of Godsil and Terwilliger and on results in this paper, we now have the diameter bound d Ĺ¸ 3m \\Gamma 8 for m of graph representaÂ tions is outlined, theorems of Godsil and Terwilliger are stated and several
A spectral graph based approach to analyze hyperspectral data
Bertozzi, Andrea L.
A spectral graph based approach to analyze hyperspectral data Blake Hunter Department of Mathematics, UCLA 520 Portola Plaza Los Angeles, CA 90095 Email: blakehunter@math.ucla.edu Yifei Lou Department of Mathematics, UCLA 520 Portola Plaza Los Angeles, CA 90095 Email: bertozzi
The switch Markov chain for sampling irregular graphs
Greenhill, Catherine
The switch Markov chain for sampling irregular graphs Catherine Greenhill School of Mathematics approach to this problem uses a simple Markov chain, which we call the switch chain, to perform the sampling. The switch chain is known to be rapidly mixing for regular degree sequences. We prove
Selectivity Estimation for SPARQL Graph Pattern Faculty of ICT
Liu, Chengfei
, for an arbitrary composite SPARQL graph pattern, we maximally combines the results of the star and chain patterns with different properties sharing the same subject (an example is shown in Figure 1). For estimating' Income 'Prof.' Position 'Advance d course' (Adc) TeacherOf ?Z, Income, '
(Co)Algebraic Characterizations of Signal Flow Graphs
Rutten, Jan
Signal flow graphs are a graphical representation for the analysis, modeling and evaluation of linear as a linear combination of the input and the registers. That is, the dynamics of a circuit can be expressed as a system of linear of equations, one for each register. Since we consider open circuits, the corresponding
Mining Large Graphs And Streams Using Matrix And Tensor Tools
Kolda, Tamara G.
RESULTS The graphs at right show overall variability distribution estimated for the Pentium D 800 where a core no longer works properly. In the Sun T1 Niagara cores this is done with a built-in- self processors we record the temperature at which the failure occurred and adjust to the frequencies
Lesson Summary Students graph and analyze raw data for
Mojzsis, Stephen J.
energy balance equation? What ultimate effect will this have on the energy balance of the Earth? 8 Setting The Earth The Mathematical World Symbolic Relationships Common Themes Constancy and Change NSES://www.strategies.org/index.aspx #12;Earth's Energy Budget or Can You Spare a Sun? Activity 8: Greenhouse Gases Objective: To graph
Ramsey Numbers for Triangles Almost-Complete Graphs
Radziszowski, Stanislaw P.
Ramsey Numbers for Triangles versus Almost-Complete Graphs To the fond memory of Paul Erd on the corresponding Ramsey number, R(K 3 ; K 10 e) #20; 38. The new lower bound of 37 for this number is established by one the best previously known lower and upper bounds. We also give the bounds for the next Ramsey
On Pattern Ramsey Numbers of Graphs Robert E. Jamison
West, Douglas B.
On Pattern Ramsey Numbers of Graphs Robert E. Jamison Mathematical Sciences Clemson University is a Ramsey family if there is some integer N such that every edge- coloring of KN has a copy of some pattern in F. The smallest such N is the (pattern) Ramsey number R(F) of F. The classical Canonical Ramsey
On Pattern Ramsey Numbers of Graphs Robert E. Jamison
West, Douglas B.
On Pattern Ramsey Numbers of Graphs Robert E. Jamison Mathematical Sciences Clemson University is a Ramsey family if there is some integer N such that every edge- coloring of KN has a copy of some pattern in F . The smallest such N is the (pattern) Ramsey number R(F ) of F . The classical Canonical Ramsey
Shannon Capacity and Ramsey Numbers from Product of Graphs
Radziszowski, Stanislaw P.
Bounds on Shannon Capacity and Ramsey Numbers from Product of Graphs Xiaodong Xu Guangxi Academy Abstract In this paper we study Shannon capacity of channels in the context of classical Ramsey numbers. We by Abbott and Song and thus establish new lower bounds for a special type of multicolor Ramsey numbers. We
Efficient Query Processing on Graph Databases JAMES CHENG
Ng, Wilfred Siu Hung
. In this article, we propose an efficient index, FG*-index, to solve this problem. The cost of processing a subgraph query using most existing indexes mainly consists of two parts, the index probing cost and the candidate verification cost. Index probing is to find the query in the index, or to find the graphs from
Tighter Bounds for Graph Steiner Tree Approximation Gabriel Robins
Zelikovsky, Alexander
and properties. In Section 3 we present our main algorithm, called k-LCA. The basic approximation result for k-LCA is proved in Section 4. In Sections 5 and 6 we prove an approximation ratio of the k-LCA algorithm in general graphs, and estimate the performance of the Iterated 1-Steiner and k-LCA heuristics in qu
Fast-Mixed Searching and Related Problems on Graphs
Bonato, Anthony
Fast-Mixed Searching and Related Problems on Graphs Boting Yang Department of Computer Science University of Regina May 27, 2012 1GRASCan 2012, Ryerson University #12;Outline Fast searching and mixed searching Induced-path cover Fast-mixed searching vs fast searching Fast-mixed searching vs mixed
Energy and Laplacian on Hanoi-type fractal quantum graphs
Patricia Alonso Ruiz; Daniel J. Kelleher; Alexander Teplyaev
2015-07-31
This article studies potential theory and spectral analysis on compact metric spaces, which we refer to as fractal quantum graphs. These spaces can be represented as a (possibly infinite) union of 1-dimensional intervals and a totally disconnected (possibly uncountable) compact set, which roughly speaking represents the set of junction points. Classical quantum graphs and fractal spaces such as the Hanoi attractor are included among them. We begin with proving the existence of a resistance form on the Hanoi attractor, and go on to establish heat kernel estimates and upper and lower bounds on the eigenvalue counting function of Laplacians corresponding to weakly self-similar measures on the Hanoi attractor. These estimates and bounds rely heavily on the relation between the length and volume scaling factors of the fractal. We then state and prove a necessary and sufficient condition for the existence of a resistance form on a general fractal quantum graph. Finally, we extend our spectral results to a large class of weakly self-similar fractal quantum graphs.
Exploring Blog Graphs Patterns and a Model for Information
1 Exploring Blog Graphs Patterns and a Model for Information Propagation Mary Mc characterize individual blogs? #12;3 Why blogs? Blogs are a widely used medium of information for many topics and have become an important mode of communication. Blogs cite one another, creating a record of how
Brain Mapping Using Topology Graphs Obtained by Surface Segmentation
Linsen, Lars
Brain Mapping Using Topology Graphs Obtained by Surface Segmentation Fabien Vivodtzev1 , Lars@ucdavis.edu Summary. Brain mapping is a technique used to alleviate the tedious and time- consuming process of annotating brains by mapping existing annotations from brain atlases to individual brains. We introduce
Reasoning With Discrete Factor Graph Indar Sugiarto(1)
Kuehnlenz, Kolja
.sugiarto@tum.de (3) conradt@tum.de (2) Bernstein Center for Computational Neuroscience Munich Center for Sensorimotor intelligence and machine learning which emerges from the combination of graph theory and probability theory originating from one of those Bayesian Networks, it is straight forward to use standard exact inference
Proportional Contact Representations of Planar Graphs Md. J. Alam1
Kobourov, Stephen G.
Proportional Contact Representations of Planar Graphs Md. J. Alam1 , T. Biedl2 , S. Felsner3 , M-contact between the corresponding polygons. Specifically, we consider proportional contact representations, where, the cartographic error, and the unused area. We describe construc- tive algorithms for proportional contact
k-Connectivity in Random Key Graphs with Unreliable Links
Yagan, Osman
of Eschenauer and Gligor for securing wireless sensor network (WSN) communications. Random key graphs have real-world networks; e.g., with secure WSN application in mind, link unreliability can be attributed for securing WSN communications is the random predistribution of cryptographic keys to sensor nodes
Computing global offensive alliances in Cartesian product graphs
Yero, Ismael G
2012-01-01
A global offensive alliance in a graph $G$ is a set $S$ of vertices with the property that every vertex not belonging to $S$ has at least one more neighbor in $S$ than it has outside of $S$. The global offensive alliance number of $G$, $\\gamma_o(G)$, is the minimum cardinality of a global offensive alliance in $G$. A set $S$ of vertices of a graph $G$ is a dominating set for $G$ if every vertex not belonging to $S$ has at least one neighbor in $S$. The domination number of $G$, $\\gamma(G)$, is the minimum cardinality of a dominating set of $G$. In this work we obtain closed formulas for the global offensive alliance number of several families of Cartesian product graphs, we also prove that $\\gamma_o(G\\square H)\\ge \\frac{\\gamma(G)\\gamma_o(H)}{2}$ for any graphs $G$ and $H$ and we show that if $G$ has an efficient dominating set, then $\\gamma_o(G\\square H)\\ge \\gamma(G)\\gamma_o(H).$ Moreover, we present a Vizing-like conjecture for the global offensive alliance number and we prove it for several families of grap...
Partitioning a graph into defensive k-alliances
Yero, Ismael G; Rodriguez-Velazquez, Juan A; Sigarreta, Jose M
2009-01-01
A defensive $k$-alliance in a graph is a set $S$ of vertices with the property that every vertex in $S$ has at least $k$ more neighbors in $S$ than it has outside of $S$. A defensive $k$-alliance $S$ is called global if it forms a dominating set. In this paper we study the problem of partitioning the vertex set of a graph into (global) defensive $k$-alliances. The (global) defensive $k$-alliance partition number of a graph $\\Gamma=(V,E)$, ($\\psi_{k}^{gd}(\\Gamma)$) $\\psi_k^{d}(\\Gamma)$, is defined to be the maximum number of sets in a partition of $V$ such that each set is a (global) defensive $k$-alliance. We obtain tight bounds on $\\psi_k^{d}(\\Gamma)$ and $\\psi_{k}^{gd}(\\Gamma)$ in terms of several parameters of the graph including the order, size, maximum and minimum degree, the algebraic connectivity and the isoperimetric number. Moreover, we study the close relationships that exist among partitions of $\\Gamma_1\\times \\Gamma_2$ into (global) defensive $(k_1+k_2)$-alliances and partitions of $\\Gamma_i$ into...
Offensive Alliances in Graphs Odile Favaron, Universite Paris-Sud
Goddard, Wayne
Offensive Alliances in Graphs Odile Favaron, Universit´e Paris-Sud Gerd Fricke, Morehead State Duane Skaggs, Morehead State University Abstract A set S is an offensive alliance if for every vertex v. The offensive alliance number is the minimum cardi- nality of an offensive alliance. In this paper we explore
Graph-based Navigation Strategies for Heterogeneous Spatial Data Sets
Rodríguez-Tastets, Maria Andrea
Graph-based Navigation Strategies for Heterogeneous Spatial Data Sets Andrea Rodr´iguez1 the information contribution of data sets based on correspondence relations outperform a strategy that considers- base representation, this work describes strategies that optimize the navigation of data sets
Terminological Logics and Conceptual Graphs: An Historical Perspective?
Schmidt, Renate A.
expressive ones, like KL of [6]. The history of these algebras can be traced back to the work of Boole, De be traced, as far back, as the nineteenth century, to the beginnings of algebraic logic and quantification on the existential graphs of Peirce. It is less well-known tha* *t, in essence, Peirce also developed the algebraic
Graph Embeddings and the Robertson-Seymour Ekaterina Nepomnyashchaya
Morrow, James A.
Graph Embeddings and the Robertson-Seymour Theorem Ekaterina Nepomnyashchaya June 4, 2011 Contents . . . . . . . . . . . . . . . . . . . . . . . . 9 4 Overview of the Robertson-Seymour Theorem 10 4.1 Excluded Minors motivation for Robertson and Seymour's work. We cover embed- dings in general, but focus on the understanding
Level of Repair Analysis and Minimum Cost Homomorphisms of Graphs
Gutin, Gregory
of Lillian Barros Abstract. Level of Repair Analysis (LORA) is a prescribed procedure for defence logistics, LORA seeks to determine an optimal provision of repair and maintenance facilities to minimize overall on bipartite graphs is polynomial time solvable. Keywords: Computational Logistics; Level of Repair Analysis
Spectra of graphs and semi-conducting polymers
Philipp Schapotschnikow; Sven Gnutzmann
2008-02-04
We study the band gap in some semi-conducting polymers with two models: H\\"uckel molecular orbital theory and the so-called free electron model. The two models are directly related to spectral theory on combinatorial and metric graphs.
NEAR MINIMAL WEIGHTED WORD GRAPHS FOR POST-PROCESSING SPEECH Michael T. Johnson and Mary P. Harper
Johnson, Michael T.
NEAR MINIMAL WEIGHTED WORD GRAPHS FOR POST-PROCESSING SPEECH Michael T. Johnson and Mary P. Harper for representing large numbers of acoustic hypotheses compactly. Word graphs or lattices generated by acoustic the graph. 1. INTRODUCTION Many recognition systems use word lattices or graphs as mechanisms
LDRD final report : first application of geospatial semantic graphs to SAR image data.
Brost, Randolph C.; McLendon, William Clarence,
2013-01-01
Modeling geospatial information with semantic graphs enables search for sites of interest based on relationships between features, without requiring strong a priori models of feature shape or other intrinsic properties. Geospatial semantic graphs can be constructed from raw sensor data with suitable preprocessing to obtain a discretized representation. This report describes initial work toward extending geospatial semantic graphs to include temporal information, and initial results applying semantic graph techniques to SAR image data. We describe an efficient graph structure that includes geospatial and temporal information, which is designed to support simultaneous spatial and temporal search queries. We also report a preliminary implementation of feature recognition, semantic graph modeling, and graph search based on input SAR data. The report concludes with lessons learned and suggestions for future improvements.
Extracting Patterns from Location History Andrew Kirmse
Cortes, Corinna
" to infer the user's important locations. The "Place lab client" infers locations by listening to RF-emissions different modes of transportation (e.g. bus, on foot, car etc.). Both these papers use clean regularly-sampled
PROBABILISTIC METHODS FOR LOCATION ESTIMATION IN
Myllymäki, Petri
PROBABILISTIC METHODS FOR LOCATION ESTIMATION IN WIRELESS NETWORKS Petri Kontkanen, Petri Myllym;PROBABILISTIC METHODS FOR LOCATION ESTIMATION IN WIRELESS NETWORKS Petri Kontkanen, Petri Myllym¨aki, Teemu Roos METHODS FOR LOCATION ESTIMATION IN WIRELESS NETWORKS Petri Kontkanen, Petri Myllymäki, Teemu Roos, Henry
Fox, Jacob
There exist graphs with super-exponential Ramsey multiplicity constant Jacob Fox Abstract The Ramsey multiplicity M(G; n) of a graph G is the minimum number of monochromatic copies of G over all 2, it is natural to define the Ramsey multiplicity constant C(G) to be limn M(G;n)a v!(n v) , which is the limit
A characterization of Q-polynomial distance-regular graphs
Jurisic, Aleksandar; Zitnik, Arjana
2009-01-01
We obtain the following characterization of $Q$-polynomial distance-regular graphs. Let $\\G$ denote a distance-regular graph with diameter $d\\ge 3$. Let $E$ denote a minimal idempotent of $\\G$ which is not the trivial idempotent $E_0$. Let $\\{\\theta_i^*\\}_{i=0}^d$ denote the dual eigenvalue sequence for $E$. We show that $E$ is $Q$-polynomial if and only if (i) the entry-wise product $E \\circ E$ is a linear combination of $E_0$, $E$, and at most one other minimal idempotent of $\\G$; (ii) there exists a complex scalar $\\beta$ such that $\\theta^*_{i-1}-\\beta \\theta^*_i + \\theta^*_{i+1}$ is independent of $i$ for $1 \\le i \\le d-1$; (iii) $\\theta^*_i \
A Graph Analytic Metric for Mitigating Advanced Persistent Threat
Johnson, John R.; Hogan, Emilie A.
2013-06-04
This paper introduces a novel graph analytic metric that can be used to measure the potential vulnerability of a cyber network to specific types of attacks that use lateral movement and privilege escalation such as the well known Pass The Hash, (PTH). The metric is computed from an oriented subgraph of the underlying cyber network induced by selecting only those edges for which a given property holds between the two vertices of the edge. The metric with respect to a select node on the subgraph is defined as the likelihood that the select node is reachable from another arbitrary node in the graph. This metric can be calculated dynamically from the authorization and auditing layers during the network security authorization phase and will potentially enable predictive deterrence against attacks such as PTH.
Average Interpolating Wavelets on Point Clouds and Graphs
Rustamov, Raif M
2011-01-01
We introduce a new wavelet transform suitable for analyzing functions on point clouds and graphs. Our construction is based on a generalization of the average interpolating refinement scheme of Donoho. The most important ingredient of the original scheme that needs to be altered is the choice of the interpolant. Here, we define the interpolant as the minimizer of a smoothness functional, namely a generalization of the Laplacian energy, subject to the averaging constraints. In the continuous setting, we derive a formula for the optimal solution in terms of the poly-harmonic Green's function. The form of this solution is used to motivate our construction in the setting of graphs and point clouds. We highlight the empirical convergence of our refinement scheme and the potential applications of the resulting wavelet transform through experiments on a number of data stets.
On relaxing the constraints in pairwise compatibility graphs
Calamoneri, Tiziana
subclasses resulting from the the cases where dmin = 0 (LPG) and dmax = + (mLPG). In particular, we show that the union of LPG and mLPG does not coincide with the whole class PCG, their intersection is not empty, and that neither of the classes LPG and mLPG is contained in the other. Finally, as the graphs we deal with belong
Balanced Cayley graphs and balanced planar Joy Morris 1
Morris, Joy
University of Lethbridge Department of Mathematics and Computer Science 4401 University Drive, Lethbridge of the complete graph Kt, i.e. Kt has t vertices and no edges. Further, we denote by Cl the cycle of length l with Kt is called an (l, t)-cycle. Fig. 1.1. (8, 3)-cycle Figure 1.1 shows the example of an (8, 3)-cycle
The $Z$-invariant massive Laplacian on isoradial graphs
Cédric Boutillier; Béatrice de Tiličre; Kilian Raschel
2015-04-03
We introduce a one-parameter family of massive Laplacian operators $(\\Delta^{m(k)})_{k\\in[0,1)}$ defined on isoradial graphs, involving elliptic functions. We prove an explicit formula for minus the inverse of $\\Delta^{m(k)}$, the massive Green function, which has the remarkable property of only depending on the local geometry of the graph, and compute its asymptotics. We study the corresponding statistical mechanics model of random rooted spanning forests. We prove an explicit local formula for an infinite volume Boltzmann measure, and for the free energy of the model. We show that the model undergoes a second order phase transition at $k=0$, thus proving that spanning trees corresponding to the Laplacian introduced by Kenyon are critical. We prove that the massive Laplacian operators $(\\Delta^{m(k)})_{k\\in(0,1)}$ provide a one-parameter family of $Z$-invariant rooted spanning forest models. When the isoradial graph is moreover $\\mathbb{Z}^2$-periodic, we consider the spectral curve $\\mathcal{C}^k$ of the characteristic polynomial of the massive Laplacian. We provide an explicit parametrization of the curve and prove that it is Harnack and has genus 1. We further show that every Harnack curve of genus 1 with $(z,w)\\leftrightarrow(z^{-1},w^{-1})$ symmetry arises from such a massive Laplacian.
Encoding and analyzing aerial imagery using geospatial semantic graphs
Watson, Jean-Paul; Strip, David R.; McLendon, William C.; Parekh, Ojas D.; Diegert, Carl F.; Martin, Shawn Bryan; Rintoul, Mark Daniel
2014-02-01
While collection capabilities have yielded an ever-increasing volume of aerial imagery, analytic techniques for identifying patterns in and extracting relevant information from this data have seriously lagged. The vast majority of imagery is never examined, due to a combination of the limited bandwidth of human analysts and limitations of existing analysis tools. In this report, we describe an alternative, novel approach to both encoding and analyzing aerial imagery, using the concept of a geospatial semantic graph. The advantages of our approach are twofold. First, intuitive templates can be easily specified in terms of the domain language in which an analyst converses. These templates can be used to automatically and efficiently search large graph databases, for specific patterns of interest. Second, unsupervised machine learning techniques can be applied to automatically identify patterns in the graph databases, exposing recurring motifs in imagery. We illustrate our approach using real-world data for Anne Arundel County, Maryland, and compare the performance of our approach to that of an expert human analyst.
Strong Integer Additive Set-valued Graphs: A Creative Review
N. K. Sudev; K. A. Germina; K. P. Chithra
2015-04-23
For a non-empty ground set $X$, finite or infinite, the {\\em set-valuation} or {\\em set-labeling} of a given graph $G$ is an injective function $f:V(G) \\to \\mathcal{P}(X)$, where $\\mathcal{P}(X)$ is the power set of the set $X$. A set-indexer of a graph $G$ is an injective set-valued function $f:V(G) \\to \\mathcal{P}(X)$ such that the function $f^{\\ast}:E(G)\\to \\mathcal{P}(X)-\\{\\emptyset\\}$ defined by $f^{\\ast}(uv) = f(u){\\ast} f(v)$ for every $uv{\\in} E(G)$ is also injective., where $\\ast$ is a binary operation on sets. An integer additive set-indexer is defined as an injective function $f:V(G)\\to \\mathcal{P}({\\mathbb{N}_0})$ such that the induced function $g_f:E(G) \\to \\mathcal{P}(\\mathbb{N}_0)$ defined by $g_f (uv) = f(u)+ f(v)$ is also injective, where $\\mathbb{N}_0$ is the set of all non-negative integers and $\\mathcal{P}(\\mathbb{N}_0)$ is its power set. An IASI $f$ is said to be a strong IASI if $|f^+(uv)|=|f(u)|\\,|f(v)|$ for every pair of adjacent vertices $u,v$ in $G$. In this paper, we critically and creatively review the concepts and properties of strong integer additive set-valued graphs.
Principal Patterns on Graphs: Discovering Coherent Structures in Datasets
Benzi, Kirell; Vandergheynst, Pierre
2015-01-01
In this work, we propose a fast, robust and scalable method for retrieving and analyzing recurring patterns of activity induced by a causal process, typically modeled as time series on a graph. We introduce a particular type of multilayer graph as a model for the data. This graph is structured for emphasizing causal relations between connected nodes and their successive time series values. Within the data, the patterns of activity are assumed to be dynamic, sparse or small compared to the size of the network. For some applications they are also expected to appear in a repeated manner over time but are allowed to differ from an exact copy. The analysis of the activity within a social network and within a transportation network illustrates the power and efficiency of the method. Relevant information can be extracted, giving insights on the behavior of group of persons in social networks and on traffic congestion patterns. Moreover, in this era of big data, it is crucial to design tools able to handle large data...
Community Detection from Location-Tagged Networks
Liu, Zhi
2015-01-01
Many real world systems or web services can be represented as a network such as social networks and transportation networks. In the past decade, many algorithms have been developed to detect the communities in a network using connections between nodes. However in many real world networks, the locations of nodes have great influence on the community structure. For example, in a social network, more connections are established between geographically proximate users. The impact of locations on community has not been fully investigated by the research literature. In this paper, we propose a community detection method which takes locations of nodes into consideration. The goal is to detect communities with both geographic proximity and network closeness. We analyze the distribution of the distances between connected and unconnected nodes to measure the influence of location on the network structure on two real location-tagged social networks. We propose a method to determine if a location-based community detection...
Helicopter magnetic survey conducted to locate wells
Veloski, G.A.; Hammack, R.W.; Stamp, V.; Hall, R.; Colina, K.
2008-07-01
A helicopter magnetic survey was conducted in August 2007 over 15.6 sq mi at the Naval Petroleum Reserve No. 3’s (NPR-3) Teapot Dome Field near Casper, Wyoming. The survey’s purpose was to accurately locate wells drilled there during more than 90 years of continuous oilfield operation. The survey was conducted at low altitude and with closely spaced flight lines to improve the detection of wells with weak magnetic response and to increase the resolution of closely spaced wells. The survey was in preparation for a planned CO2 flood for EOR, which requires a complete well inventory with accurate locations for all existing wells. The magnetic survey was intended to locate wells missing from the well database and to provide accurate locations for all wells. The ability of the helicopter magnetic survey to accurately locate wells was accomplished by comparing airborne well picks with well locations from an intense ground search of a small test area.
Long cycles in critical graphs Noga Alon Michael Krivelevich y Paul Seymour z
Krivelevich, Michael
) Therefore, any k-critical graph on n vertices contains a path of length at least log(n 1)= log(k 2 that there are in#12;nitely many values of n for which there is a k-critical graph on n vertices with no pathLong cycles in critical graphs Noga Alon #3; Michael Krivelevich y Paul Seymour z Abstract
LIGHT SUBGRAPHS IN PLANAR GRAPHS OF MINIMUM DEGREE 4 AND EDGE-DEGREE 9
Mohar, Bojan
LIGHT SUBGRAPHS IN PLANAR GRAPHS OF MINIMUM DEGREE 4 AND EDGE-DEGREE 9 B. MOHAR , R. SKREKOVSKI vertices of degree 4 are adjacent. A graph H is light in G if there is a constant w such that every graph is w. Then we also write w(H) w. It is proved that the cycle Cs is light if and only if 3 s 6, where
Earthquake locations and seismic velocity models for Southern California
Lin, Guoqing
2007-01-01
Linearized EarthquakeChapter 4. The COMPLOC Earthquake Location3-D Simultaneous Earthquake Locations and
Materials for Math 13900 Bring to class each day: graph paper ...
Roames, Renee S
2015-01-08
Materials for Math 13900. Bring to class each day: graph paper isometric dot paper unlined paper cm ruler. We will also be using: compass small scissors.
THE GEOMETRY OF BRAUER GRAPH ALGEBRAS AND CLUSTER ROBERT J. MARSH AND SIBYLLE SCHROLL
Marsh, Robert J.
author. 1 #12;2 MARSH AND SCHROLL sense. We may also consider the dual graph of the m-angulation, which
First Steps toward Automated Design of Mechatronic Systems Using Bond Graphs and Genetic Programming
Fernandez, Thomas
First Steps toward Automated Design of Mechatronic Systems Using Bond Graphs and Genetic for mechatronic systems. The domain of mechatronic systems includes mixtures of, for example, electrical
Choosability of the square of planar subcubic graphs with large girth
Bermond, Jean-Claude
is at most 5. 1 Introduction Let G be a (simple) graph. The neighbourhood of a vertex v of G, denoted NG(v
Esteban, Carlos HernĂˇndez
Motivation Overview Automatic Segmentation Algorithm Building Colour Models Volumetric Graph Segmentation in Multiple Views using Volumetric Graph-Cuts #12;Motivation Overview Automatic Segmentation Algorithm Building Colour Models Volumetric Graph-Cut Results Conclusion Motivation Neill Campbell, George
Locating and tracking assets using RFID
Kim, Gak Gyu
2009-05-15
, this research presents a math¬ematical model of using RFID (both handheld readers and stationary readers) for e?cient asset location. We derive the expected cost of locating RFID¬tagged objects in a multi¬area environment where hand¬held RF readers are used. We...
Central limit theorems, Lee-Yang zeros, and graph-counting polynomials
J. L. Lebowitz; B. Pittel; D. Ruelle; E. R. Speer
2014-08-18
We consider the asymptotic normalcy of families of random variables $X$ which count the number of occupied sites in some large set. We write $Prob(X=m)=p_mz_0^m/P(z_0)$, where $P(z)$ is the generating function $P(z)=\\sum_{j=0}^{N}p_jz^j$ and $z_0>0$. We give sufficient criteria, involving the location of the zeros of $P(z)$, for these families to satisfy a central limit theorem (CLT) and even a local CLT (LCLT); the theorems hold in the sense of estimates valid for large $N$ (we assume that $Var(X)$ is large when $N$ is). For example, if all the zeros lie in the closed left half plane then $X$ is asymptotically normal, and when the zeros satisfy some additional conditions then $X$ satisfies an LCLT. We apply these results to cases in which $X$ counts the number of edges in the (random) set of "occupied" edges in a graph, with constraints on the number of occupied edges attached to a given vertex. Our results also apply to systems of interacting particles, with $X$ counting the number of particles in a box $\\Lambda$ whose size approaches infinity; $P(z)$ is then the grand canonical partition function and its zeros are the Lee-Yang zeros.
Vacuum energy and repulsive Casimir forces in quantum star graphs
Fulling, Stephen; Kaplan, L.; Wilson, J. H.
2007-01-01
Vacuum energy and repulsive Casimir forces in quantum star graphs S. A. Fulling,1,* L. Kaplan,2,? and J. H. Wilson1,? 1Departments of Mathematics and Physics, Texas A&M University, College Station, Texas 77843-3368, USA 2Department of Physics... vacuum en- ergy in the region outside the box, and it involves ?renormal- ization? in the sense of discarding divergent terms associated with the boundary although #1;unlike the case of parallel plates, or any calculation of forces between rigid...
Groups generated by bounded automata and their schreier graphs
Bondarenko, Ievgen
2008-10-10
by Bounded Automata and Their Schreier Graphs. (December 2007) Ievgen Bondarenko, B.S., National Taras Shevchenko University of Kyiv, Ukraine; M.S., National Taras Shevchenko University of Kyiv, Ukraine Chair of Advisory Committee: Dr. Rostislav Grigorchuk... maps In Chapter III we study spectral properties and iterations of piecewise linear maps of the form fK(v) = min A?K Av, v?RN, (1.1) where K is a finite set of nonnegative square matrices of fixed dimension and by “min” we mean component-wise minimum...
Random Procedures for Dominating Sets in Graphs Sarah Artmann1
of a vertex u V in the graph G is the set NG(u) = {v V | uv E} and the closed neighbourhood of u in G is NG[u] = NG(u){u}. The degree of u in G is the number dG(u) = |NG(u)| of its neighbours. For a set U V let NG[U] = uU NG[U] and NG(U) = NG[U] \\ U. A set of vertices D V of G is dominating, if every vertex in V \\ D
New Developments in MadGraph/MadEvent
Alwall, Johan; Artoisenet, Pierre; de Visscher, Simon; Duhr, Claude; Frederix, Rikkert; Herquet, Michel; Mattelaer, Olivier; /IBA, Louvain-la-Neuve
2011-11-08
We here present some recent developments of MadGraph/MadEvent since the latest published version, 4.0. These developments include: Jet matching with Pythia parton showers for both Standard Model and Beyond the Standard Model processes, decay chain functionality, decay width calculation and decay simulation, process generation for the Grid, a package for calculation of quarkonium amplitudes, calculation of Matrix Element weights for experimental events, automatic dipole subtraction for next-to-leading order calculations, and an interface to FeynRules, a package for automatic calculation of Feynman rules and model files from the Lagrangian of any New Physics model.
Weyand, Tracy Kathleen
2014-07-07
on infinite periodic graphs by analyzing the eigenvalues of the magnetic Schrödinger operator on a fundamental domain. Here we consider both discrete and quantum graphs. We find a characterization of critical points of the dispersion relation that occur inside...
Banaji,. Murad
Well-quasi-ordering Binary Matroids The Graph Minors Project of Robertson and Seymour is one with the matroid; thus it is not hard to see that matroids generalise graphs. Robertson and Seymour always believed
McGarrigle, Conor
2009-01-01
closely aligned to the SI's construction of situations. ThisG (1957) Report on the Construction of Situations and on theThe Construction of Locative Situations: Locative Media and
Sze, Sing-Hoi; Tarone, Aaron M
2014-07-14
The recent advance of high-throughput sequencing makes it feasible to study entire transcriptomes through the application of de novo sequence assembly algorithms. While a popular strategy is to first construct an intermediate de Bruijn graph...
for based on Open Inventor scene graph stroke based methods ·non-photorealistic rendering (NPR) architecture· end user: looks at created renditions or · designer interaction uses applications Open Inventor
The power graph of a finite group, II Peter J. Cameron
Cameron, Peter
The power graph of a finite group, II Peter J. Cameron School of Mathematical Sciences Queen Mary, University of London Mile End Road London E1 4NS, U.K. Abstract The directed power graph of a group G is the digraph with vertex set G, having an arc from y to x whenever x is a power of y; the undirected power
Cross-Domain Fault Localization: A Case for a Graph Digest Approach
Cross-Domain Fault Localization: A Case for a Graph Digest Approach William D. Fischer Naval an inference-graph-digest based formulation of the problem. The formulation not only explicitly models propagation can use a function to create a digest representation of their network state and dependencies
Construction of abstract state graphs with PVS Susanne Graf and Hassen Saidi
Grosu, Radu
Construction of abstract state graphs with PVS Susanne Graf and Hassen Saidi VERIMAG Centre at the address http:://www.imag.fr/VERIMAG/PEOPLE/Hassen.Saidi/BRP 2 #12; Construction of abstract state graphs of infinite systems with PVS Susanne Graf and Hassen Saidi VERIMAG 1 Abstract In this paper, we propose
On Self-Assembling Graphs in vitro The Molecular Computing Group
Deaton, Russell J.
On Self-Assembling Graphs in vitro The Molecular Computing Group Max H. Garzon, Rusell J. Deaton in vitro by self-regulating molecular processes. This type of structure, the so-called automatic graphs how the navigator can be implemented as a moleculethat directs the self-assembly process to build
Qualitative Modelling of Genetic Networks: From Logical Regulatory Graphs to Standard
Ruet, Paul
Qualitative Modelling of Genetic Networks: From Logical Regulatory Graphs to Standard Petri Nets, a systematic rewriting of logical genetic reg- ulatory graphs in terms of standard Petri net models is proposed. We show that, in the Boolean case, the combination of the logical approach with the standard Petri
ISIT 1998, Cambridge, MA. USA, August 16 -August 21 On Tanner Graphs of Lattices and Codes
Gulak, P. Glenn
and cross section of A on Wi, 2) deriv- ing a simple Tanner graph for the corresponding label code of A. Banihashemi, Frank R. Kschischang, and P. Glenn Gulak Dept. of Electrical and Computer Engineering, University- complexity Tanner graph for an n-dimensional (n-D)lattice A, it is reasonable to divide the problem into two
12 Trees and Graphs 12.1 Rooted and Unrooted Trees
Goddard, Wayne
, here is a representation of butane: four carbons and ten hydrogen. c Wayne Goddard, Clemson University, and 3 carbon atoms respectively), but there are two isomers of butane. For you to do! 1. Draw the other isomer of butane. 12.2 Graphs A (simple) graph is a collection of vertices and edges such that each edge
Fault-Tolerant Exploration of an Unknown Dangerous Graph by Scattered Agents
Flocchini, Paola
Fault-Tolerant Exploration of an Unknown Dangerous Graph by Scattered Agents Paola Flocchini1 a network where there are dangerous sites (black holes) that eliminate any incoming searcher without leaving a discernible trace. Dangerous graph exploration (Dge) extends the Bhs problem to include dangerous links (black
Discrete Applied Mathematics 95 (1999) 241249 Note on a helicopter search problem on graphs
Fomin, Fedor V.
1999-01-01
Discrete Applied Mathematics 95 (1999) 241249 Note on a helicopter search problem on graphs Fedor 1998 Abstract We consider a search game on a graph in which one cop in a helicopter ying from vertex . In the ˙rst step, Cop occupies some vertex of G. In each of the following steps, Cop moves ( ies by helicopter
The freezing threshold for k-colourings of a random graph Michael Molloy
Molloy, Mike
The freezing threshold for k-colourings of a random graph Michael Molloy March 9, 2012 Abstract We rigorously determine the exact freezing threshold, rf k , for k-colourings of a random graph. We prove using the non-rigorous cavity method. It has been hypothesized that the freezing threshold is the cause
THE RADIO NUMBERS OF ALL GRAPHS OF ORDER n AND DIAMETER n -2
Tomova, Maggy
THE RADIO NUMBERS OF ALL GRAPHS OF ORDER n AND DIAMETER n - 2 KATHERINE BENSON, MATTHEW PORTER, AND MAGGY TOMOVA Abstract. A radio labeling of a connected graph G is a function c : V (G) Z+ such that for every two distinct vertices u and v of G distance(u, v) + |c(u) - c(v)| 1 + diameter(G). The radio
Degree Ramsey numbers of graphs William B. Kinnersley # , Kevin G. Milans + , Douglas B. West #
West, Douglas B.
Degree Ramsey numbers of graphs William B. Kinnersley # , Kevin G. Milans + , Douglas B. West class. Let the sÂcolor degree Ramsey number of a graph G, written R# (G; s), be min{#(H) : H s # G that are reÂ lated to degree Ramsey numbers of paths. Finally, for cycles we show that R# (C 2k+1 ; s) # 2
Combining Bond-Graphs with Genetic Programming for Unified/Automated Design of Mechatronic or
Fernandez, Thomas
Combining Bond-Graphs with Genetic Programming for Unified/Automated Design of Mechatronic or Multi of a mechatronic system makes it difficult to model using a single modeling technique over the whole system and polymorphic modeling and simulation technique. Bond-Graph model of the mechatronic system can be directly
An Updated Taxonomy of Evolutionary Computation Problems using Graph-based
Ashlock, Dan
An Updated Taxonomy of Evolutionary Computation Problems using Graph-based Evolutionary Algorithms some other groups of problems scatter across the taxonomy. This paper updates an earlier taxonomy of 23, for the self-avoiding-walk problems corrects, a taxonomy of 23 problems given in [8]. The list of graphs
Perfect Completion and Deletion in Random Graphs Assaf Natanzon \\Lambda Ron Shamir \\Lambda y
Shamir, Ron
Perfect Completion and Deletion in Random Graphs Assaf Natanzon \\Lambda Ron Shamir \\Lambda y Abstract In the Perfect Completion problem one wishes to add the fewest possible edges to a graph in order Introduction Edge Completion/Deletion problems call for making minimum changes to the edge set of an input
Multi-rate Estimation of Coloured Noise Models in Graph-Based Estimation Algorithms
Nelson, James
Multi-rate Estimation of Coloured Noise Models in Graph-Based Estimation Algorithms Simon J. Julier. In this paper, we consider how coloured noise models can be efficiently incorporated within graph position, three velocity, three orientation). The GPS noise model introduces an extra six states (second
c 2003 Association for Computational Linguistics Graph-Based Generation of Referring
for the generation of referring expressions; and (4) the combined use of graphs and cost functions paves the wayc 2003 Association for Computational Linguistics Graph-Based Generation of Referring Expressions Eindhoven University of Technology This article describes a new approach to the generation of referring
JACOBIANS OF NEARLY COMPLETE AND THRESHOLD GRAPHS SERGUEI NORINE AND PETER WHALEN
Norin, Sergey
to it as the sandpile group [7]. Seven years later, Bacher et al referred to it alternatively as the Picard group. The Jacobian of a graph, also known as the Picard Group, Sandpile Group, or Critical Group, is a discrete is odd, where k is such that the order of the group is the number of spanning trees of the graph
ForPeerReview Bond graph model of a switched reluctance machine
Batlle, Carles
Keywords: Electric machines, Reluctance machines, Modeling Are any of authors IEEE Member?: No Are any the electromechanical energy transformation in electrical machines, is used for a SRM. The bond graph modelForPeerReview Bond graph model of a switched reluctance machine Journal: Transactions on Industrial
Termination Graphs for Java Bytecode M. Brockschmidt, C. Otto, C. von Essen, and J. Giesl
ĂbrahĂˇm, Erika
Termination Graphs for Java Bytecode M. Brockschmidt, C. Otto, C. von Essen, and J. Giesl LuFG Informatik 2, RWTH Aachen University, Germany Abstract. To prove termination of Java Bytecode (JBC) automatically, we transform JBC to finite termination graphs which represent all pos- sible runs of the program
Fundamenta Informaticae 33(2), 1998, 201{209 1 Termination of graph rewriting is undecidable
Plump, Detlef
Fundamenta Informaticae 33(2), 1998, 201{209 1 IOS Press Termination of graph rewriting pushout approach") is terminating. The proof is by a reduction of the Post Correspondence Problem or of the termination problem for string rewriting systems to the present problem. Keywords: graph rewriting
A Rule-Based Quasi-Static Scheduling Approach for Static Islands in Dynamic Dataflow Graphs
Teich, JĂĽrgen
A A Rule-Based Quasi-Static Scheduling Approach for Static Islands in Dynamic Dataflow Graphs-Nuremberg In this article, an efficient rule-based clustering algorithm for static dataflow subgraphs in a dynamic dataflow graph is presented. The clustered static dataflow actors are quasi-statically scheduled, in such a way
A COVERING-GRAPH APPROACH TO EPIDEMICS ON SIS AND SIS-LIKE NETWORKS
Floyd, William
without first passing to the sus- ceptible state. We use a covering graph construction to compare SIR, SIS of infectives. The same covering graph construction allows us to characterize the recurrent states in a SIS on the stochastic SIS model, so that asymptotic behavior is uninteresting; we consider certain long-lived states
Sand Drawings and Gaussian Graphs Erik D. Demaine Martin L. Demaine
Demaine, Erik
Sand Drawings and Gaussian Graphs Erik D. Demaine Martin L. Demaine Computer Science and AI@cs.mcgill.ca Abstract Sand drawings form a part of many cultural artistic traditions. Depending on the part of the world uncover a bridge between sand drawings and Gaussian graphs, leading to a variety of new mathematical
System-Level Synthesis of MEMS via Genetic Programming and Bond Graphs
Hu, Jianjun
System-Level Synthesis of MEMS via Genetic Programming and Bond Graphs Zhun Fan+ , Kisung Seo for automatic synthesis of MEMS system-level lumped parameter models using genetic programming and bond graphs. This paper first dis- cusses the necessity of narrowing the problem of MEMS synthesis into a certain specific
The domination number of on-line social networks and random geometric graphs
Pralat, Pawel
of graphs in the Facebook 100 data set, and these bounds are well-correlated with those predicted geometric graphs. 1. Introduction On-line social networks (or OSNs) such as Facebook have emerged as a hot-demographics are closer together in the space. We give the precise definition of the GEO-P model (actually, one of its
Karahalios, Karrie G.
People Search within an Online Social Network: Large Scale Analysis of Facebook Graph Search Query and Facebook2 , Menlo Park, CA 94025 {spirin2,kkarahal}@illinois.edu and {jfh,miked,maxime}@fb.com ABSTRACT Facebook in- troduced its innovative Graph Search product with the goal to take the OSN search experience
A solid solution to a conjecture on the maximal energy of bipartite bicyclic graphs
Huo, Bofeng; Li, Xueliang; Shi, Yongtang
2011-01-01
The energy of a simple graph $G$, denoted by $E(G)$, is defined as the sum of the absolute values of all eigenvalues of its adjacency matrix. Let $C_n$ denote the cycle of order $n$ and $P^{6,6}_n$ the graph obtained from joining two cycles $C_6$ by a path $P_{n-12}$ with its two leaves. Let $\\mathscr{B}_n$ denote the class of all bipartite bicyclic graphs but not the graph $R_{a,b}$, which is obtained from joining two cycles $C_a$ and $C_b$ ($a, b\\geq 10$ and $a \\equiv b\\equiv 2\\, (\\,\\textmd{mod}\\, 4)$) by an edge. In [I. Gutman, D. Vidovi\\'{c}, Quest for molecular graphs with maximal energy: a computer experiment, {\\it J. Chem. Inf. Sci.} {\\bf41}(2001), 1002--1005], Gutman and Vidovi\\'{c} conjectured that the bicyclic graph with maximal energy is $P^{6,6}_n$, for $n=14$ and $n\\geq 16$. In [X. Li, J. Zhang, On bicyclic graphs with maximal energy, {\\it Linear Algebra Appl.} {\\bf427}(2007), 87--98], Li and Zhang showed that the conjecture is true for graphs in the class $\\mathscr{B}_n$. However, they could not...
A Space-Filling Visualization Technique for Multivariate Small World Graphs
Wong, Pak C.; Foote, Harlan P.; Mackey, Patrick S.; Chin, George; Huang, Zhenyu; Thomas, James J.
2012-03-15
We introduce an information visualization technique, known as GreenCurve, for large sparse graphs that exhibit small world properties. Our fractal-based design approach uses spatial cues to approximate the node connections and thus eliminates the links between the nodes in the visualization. The paper describes a sophisticated algorithm to order the neighboring nodes of a large sparse graph by solving the Fiedler vector of its graph Laplacian, and then fold the graph nodes into a space-filling fractal curve based on the Fiedler vector. The result is a highly compact visualization that gives a succinct overview of the graph with guaranteed visibility of every graph node. We show in the paper that the GreenCurve technology is (1) theoretically sustainable by introducing an error estimation metric to measure the fidelity of the new graph representation, (2) empirically rigorous by conducting a usability study to investigate its strengths and weaknesses against the traditional graph layout, and (3) pragmatically feasible by applying it to analyze stressed conditions of the large scale electric power grid on the west coast.
Solving planning-graph by compiling it into CSP Minh Binh Do & Subbarao Kambhampati
Kambhampati, Subbarao
Solving planning-graph by compiling it into CSP Minh Binh Do & Subbarao Kambhampati Department to adapt CSP search techniques into the backward search phase of Graphplan. This paper describes GP-CSP, a system that does planning by automati- cally converting Graphplan's planning graph into a CSP encoding
The structure of graphs with a vital linkage of Dillon Mayhew
Whittle, Geoff
The structure of graphs with a vital linkage of order 2 Dillon Mayhew Geoff Whittle Stefan H. M, each of which is a path. A linkage is vital if it spans all vertices, and no other linkage connects the same pairs of end vertices. We give a charac- terization of the graphs with a vital linkage of order 2
A lower bound for the tree-width of planar graphs with vital linkages
Adler, Isolde
A lower bound for the tree-width of planar graphs with vital linkages Isolde Adler, Philipp Klaus implementable. The algorithm uses a bound on the tree- width of graphs with vital linkages, and deletion with vital linkages, and for the size of the grid necessary for finding irrelevant vertices. 1 Introduction
Existence and stability of standing waves for the NLS equation on a tadpole graph
Pelinovsky, Dmitry
Existence and stability of standing waves for the NLS equation on a tadpole graph Dmitry Pelinovsky.00455. Series of papers on star graphs by Adami-Cacciapuoti-Finco-Noja: Scattering of solitons; Standing waves.Banica-L.Ignat (2011-2014). Classification of standing waves and computations of the bifurcation diagram on tadpole
Existence and stability of standing waves for the NLS equation on a tadpole graph
Pelinovsky, Dmitry
Existence and stability of standing waves for the NLS equation on a tadpole graph Dmitry Pelinovsky of solitons; Standing waves and stability (2011-14). Recent work by Adami-Serra-Tilli on nonexistence on trees (including star graphs) in V.Banica-L.Ignat (2011-2014). Classification of standing waves
Method of locating underground mines fires
Laage, Linneas (Eagam, MN); Pomroy, William (St. Paul, MN)
1992-01-01
An improved method of locating an underground mine fire by comparing the pattern of measured combustion product arrival times at detector locations with a real time computer-generated array of simulated patterns. A number of electronic fire detection devices are linked thru telemetry to a control station on the surface. The mine's ventilation is modeled on a digital computer using network analysis software. The time reguired to locate a fire consists of the time required to model the mines' ventilation, generate the arrival time array, scan the array, and to match measured arrival time patterns to the simulated patterns.
AN SDP-BASED DIVIDE-AND-CONQUER ALGORITHM FOR LARGE SCALE NOISY ANCHOR-FREE GRAPH REALIZATION
Chuan, Toh Kim
-HANG Z. LEUNG AND KIM-CHUAN TOH Abstract. We propose the DISCO algorithm for graph realization in Rd
Earthquake Location, Direct, Global-Search Methods E 2449 Earthquake Location,
Earthquake Location, Direct, Global-Search Methods E 2449 Earthquake Location, Direct, Global Kingdom Article Outline Glossary Definition of the Subject Introduction The Earthquake Location Problem or temporal av- erage of some characteristic of an earthquake, such as surface shaking intensity or moment
Williams, Susan
Vertex-Colored Graphs, Bicycle Spaces and Mahler Measure Kalyn R. Lamey Daniel S. Silver Susan G to the bicycle space of the graph. For graphs G with a free Zd -action by automorphisms, C is a finitely identify the subspace C0 of based conservative vertex colorings with the bicycle space B of G. In section 3
Silver, Dan
Vertex-Colored Graphs, Bicycle Spaces and Mahler Measure Kalyn R. Lamey Daniel S. Silver Susan G to be isomorphic to the bicycle space of the graph. For graphs G with a free Zd -action by automorphisms, C C0 of based conservative vertex colorings with the bicycle space B of G. In section 3 we define
Addressing endogeneity in residential location models
Guevara-Cue, Cristián Angelo
2005-01-01
Some empirical residential location choice models have reported dwelling-unit price estimated parameters that are small, not statistically significant, or even positive. This would imply that households are non-sensitive ...
Techniques for Mobile Location Estimation in UMTS
Thomas, Nicholas J
The subject area of this thesis is the locating of mobile users using the future 3rd generation spread spectrum communication system UMTS. The motivation behind this work is twofold: firstly the United States Federal ...
A Survey on the Warehouse Location Problem
Cohen, Joseph J.
The warehouse location problem has assumed numerous formulations, and solutions have been devised using a variety of mathematical techniques. The development of this effort is examined and relevant models presented for evaluation.
Developing a theory of nightclub location choice
Crim, Stephen J. (Stephen Johnson)
2008-01-01
This work is an investigation of the factors that influence where nightclubs locate within a city. Nightclubs, like other social spaces, provide important social and economic benefits in the urban environment. As amenities, ...
Alternative Fuel Infrastructure Associate Location: San Diego
California at Davis, University of
Alternative Fuel Infrastructure Associate Location: San Diego Basic Functions Center an Alternative Fuel Infrastructure Associate that has a passion for sustainability, the environment, and accelerating the transition to a sustainable world powered by clean energy! The Alternative Fuel Infrastructure
Discrete Mathematical Approaches to Graph-Based Traffic Analysis
Joslyn, Cliff A.; Cowley, Wendy E.; Hogan, Emilie A.; Olsen, Bryan K.
2014-04-01
Modern cyber defense and anlaytics requires general, formal models of cyber systems. Multi-scale network models are prime candidates for such formalisms, using discrete mathematical methods based in hierarchically-structured directed multigraphs which also include rich sets of labels. An exemplar of an application of such an approach is traffic analysis, that is, observing and analyzing connections between clients, servers, hosts, and actors within IP networks, over time, to identify characteristic or suspicious patterns. Towards that end, NetFlow (or more generically, IPFLOW) data are available from routers and servers which summarize coherent groups of IP packets flowing through the network. In this paper, we consider traffic analysis of Netflow using both basic graph statistics and two new mathematical measures involving labeled degree distributions and time interval overlap measures. We do all of this over the VAST test data set of 96M synthetic Netflow graph edges, against which we can identify characteristic patterns of simulated ground-truth network attacks.
INDDGO: Integrated Network Decomposition & Dynamic programming for Graph Optimization
Groer, Christopher S; Sullivan, Blair D; Weerapurage, Dinesh P
2012-10-01
It is well-known that dynamic programming algorithms can utilize tree decompositions to provide a way to solve some \\emph{NP}-hard problems on graphs where the complexity is polynomial in the number of nodes and edges in the graph, but exponential in the width of the underlying tree decomposition. However, there has been relatively little computational work done to determine the practical utility of such dynamic programming algorithms. We have developed software to construct tree decompositions using various heuristics and have created a fast, memory-efficient dynamic programming implementation for solving maximum weighted independent set. We describe our software and the algorithms we have implemented, focusing on memory saving techniques for the dynamic programming. We compare the running time and memory usage of our implementation with other techniques for solving maximum weighted independent set, including a commercial integer programming solver and a semi-definite programming solver. Our results indicate that it is possible to solve some instances where the underlying decomposition has width much larger than suggested by the literature. For certain types of problems, our dynamic programming code runs several times faster than these other methods.
Driver expectancy in locating automotive controls
Francis, Dawn Suzette
1990-01-01
DRIVER EXPECTANCY IN LOCATING AUTOMOTIVE CONTROLS A Thesis by DAWN SUZETTE FRANCIS Submitted to the Office of Graduate Studies of Texas A&M University in partial fulfillment of the requirements for the degree of MASTER OF SCIENCE May 1990... Major Subject: Industrial Engineering DRIVER EXPECTANCY IN LOCATING AUTOMOTIVE CONTROLS A Thesis by DAWN SUZETTE FRANCIS Approved as to style and content by: R. Dale Huchi son (Chair of Committee) Rodger . . ppa (Member) Waymon L ohnston (M er...
Banaji, Murad
2010-01-01
Associated with a chemical reaction network is a natural labelled bipartite multigraph termed an SR graph, and its directed version, the DSR graph. These objects are closely related to Petri nets. The construction of SR and DSR graphs for chemical reaction networks is presented. Conclusions about asymptotic behaviour of the associated dynamical systems which can be drawn easily from the graphs are discussed. In particular, theorems on ruling out the possibility of multiple equilibria or stable oscillation in chemical reaction networks based on computations on SR/DSR graphs are presented. These include both published and new results. The power and limitations of such results are illustrated via several examples.
Location theory and the location of industry along an interstate highway
Miller, James Patterson
1965-01-01
a greater gamble. This sect. ion has been devoted to s review of the fundamental factors underlying all plant location ss recognised in location theory. The next section will review some recent. empirical attempts to determine the actual... for this thesis was possible through the assistance provided )ointly by the Texas Highway Department and the Bureau of Public Roads. i. v TABLE OF CONTENTS Chapter Page INTRODUCTION Purpose Plan of Study REVIEW OF PLANT LOCATION CONCEPTS Introduction...
Linking SARAH and MadGraph using the UFO format
Staub, Florian
2012-01-01
SARAH is a Mathematica package optimized for the fast, efficient and precise study of supersymmetric models beyond the MSSM: a new model can be defined in a short form and all vertices are derived. This allows SARAH to create model files for FeynArts/FormCalc, CalcHep/CompHep and WHIZARD/OMEGA. The newest version of SARAH now provides the possibility to create model files in the UFO format which is supported by MadGraph 5, MadAnalysis 5, GoSam, and soon by Herwig++. Furthermore, SARAH also calculates the mass matrices, RGEs and 1-loop corrections to the mass spectrum. This information is used to write source code for SPheno in order to create a precision spectrum generator for the given model. This spectrum-generator-generator functionality as well as the output of WHIZARD and CalcHep model files have seen further improvement in this version.
Graph-based interpretation of the Molecular Interstellar Medium Segmentation
Colombo, Dario; Ginsburg, Adam; Duarte-Cabral, Ana; Hughes, Annie
2015-01-01
We present a generalization of the Giant Molecular Cloud (GMC) identification problem based on cluster analysis. The method we designed, SCIMES (Spectral Clustering for Interstellar Molecular Emission Segmentation) considers the dendrogram of emission in the broader framework of graph theory and utilizes spectral clustering to find discrete regions with similar emission properties. For Galactic molecular cloud structures, we show that the characteristic volume and/or integrated CO luminosity are useful criteria to define the clustering, yielding emission structures that closely reproduce "by-eye" identification results. SCIMES performs best on well-resolved, high-resolution data, making it complementary to other available algorithms. Using 12CO(1-0) data for the Orion-Monoceros complex, we demonstrate that SCIMES provides robust results against changes of the dendrogram-construction parameters, noise realizations and degraded resolution. By comparing SCIMES with other cloud decomposition approaches, we show t...
Evaluating Effectiveness of Tamper Proofing on Dynamic Graph Software Watermarks
Khiyal, Malik Sikandar Hayat; Amjad, Sehrish; Khalil, M Shahid
2010-01-01
For enhancing the protection level of dynamic graph software watermarks and for the purpose of conducting the analysis which evaluates the effect of integrating two software protection techniques such as software watermarking and tamper proofing, constant encoding technique along with the enhancement through the idea of constant splitting is proposed. In this paper Thomborson technique has been implemented with the scheme of breaking constants which enables to encode all constants without having any consideration about their values with respect to the value of watermark tree. Experimental analysis which have been conducted and provided in this paper concludes that the constant encoding process significantly increases the code size, heap space usage, and execution time, while making the tamper proofed code resilient to variety of semantic preserving program transformation attacks.
4F13: Machine Learning Propagation on Factor Graphs
Ghahramani, Zoubin
Graphs x3 x1 x2 x4 f1 f2 f3 initialise all messages to be 1 an example schedule of messages resulting in computing p(x4): message direction message value x1 f1 1(x1) x3 f2 1(x3) f1 x2 x1 f1(x1, x2)1(x1) f2 x2 x3 f2(x3, x2)1(x3) x2 f3 x1 f1(x1, x2) x3 f2(x3, x2) f3 x4 x2 f3(x2, x4) x1 f1(x1, x2) x3 f2(x3, x
Utility Locating in the DOE Environment
Clark Scott; Gail Heath
2006-04-01
Some advances have been made in utility locating in recent years and standards have been recently published to try and categorize the level of information known about the utility in the subsurface. At the same time some characterization about the level of effort or technology in the geophysicist approach to utility locating may be generalized. The DOE environment poses some added difficulties and this presentation covers these issues, costs and the technical approach that has been developed at the INEEL to prevent utility hits and how it fits into the generalized classification of effort.
Graph fusion algebras of WLM(p,p')
Jorgen Rasmussen
2010-01-14
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).
Sustainable Transportation Fellowship Location: San Diego, CA
California at Davis, University of
Sustainable Transportation Fellowship Location: San Diego, CA Our clean energy future depends. · Regular web posts on other clean transportation topics. · Assist in other tasks, as assigned. The ideal and a clean, healthy environment. To bring about such a future, each of us must make wise choices now
Secure Location Verification Using Radio Broadcast
Nesterenko, Mikhail
, exploits the difference between propagation speeds of radio and sound waves to estimate the position1 Secure Location Verification Using Radio Broadcast Adnan Vora and Mikhail Nesterenko Abstract of the prover. In this paper, we propose a solution that leverages the broadcast nature of the radio signal
Secure Location Verification Using Radio Broadcast
Nesterenko, Mikhail
the difference between propagation speeds of radio and sound waves to estimate the position of the proverSecure Location Verification Using Radio Broadcast Adnan Vora and Mikhail Nesterenko Computer. In this paper, we propose a solution that leverages the broadcast nature of the radio signal emitted
OPTIMAL LOCATION OF ISOLATION VALVES IN WATER
Mays, Larry W.
CHAPTER 7 OPTIMAL LOCATION OF ISOLATION VALVES IN WATER DISTRIBUTION SYSTEMS: A RELIABILITY The cornerstone of any healthy population is access to safe drinking water. The goal of the United Nations International Drinking Water Supply and Sanitation Decade from 1981 to 1990 was safe drinking water for all
Ontology-based Disambiguation of Spatiotemporal Locations
Hyvönen, Eero
, in the semantic portal MuseumFinland3 [7] a location parton- omy4 was used for annotating museum artifacts. #12;A problem when creating a semantic cultural heritage portal is that places, both modernFinland originate from regions that no longer exist and/or are not part of Finland but of Russia with new names
Locating Secret Messages in Images Ian Davidson
Davidson, Ian
Locating Secret Messages in Images Ian Davidson Computer Science, SUNY Albany 1400 Washington in innocuous media such as images, while steganalysis is the field of detecting these secret messages contributing the most to the energy calculations of an image are deemed outliers. Typically, of the top third
www.elsevier.com/locate/visres polarization
Boal, Jean
.elsevier.com/locate/visres Cuttlefish use polarization sensitivity in predation on silvery fish Nadav Shashar a,b, Roland Hagan c, Jean of cuttlefish, we examined the preference of Sepia officina/is when presented with fish whose polarization reflection was greatly reduced versus fish whose polarization reflection was not affected. Cuttlefish preyed
Omega: an Overlap-graph de novo Assembler for Meta-genomics
Haider, Bahlul; Ahn, Tae-Hyuk; Bushnell, Brian; Chai, JJ; Copeland, Alex; Pan, Chongle
2014-01-01
Motivation: Metagenomic sequencing allows reconstruction of mi-crobial genomes directly from environmental samples. Omega (overlap-graph metagenome assembler) was developed here for assembling and scaffolding Illumina sequencing data of microbial communities. Results: Omega found overlaps between reads using a prefix/suffix hash table. The overlap graph of reads was simplified by removing transitive edges and trimming small branches. Unitigs were generat-ed based on minimum cost flow analysis of the overlap graph. Obtained unitigs were merged to contigs and scaffolds using mate-pair information. Omega was compared with two de Bruijn graph assemblers, SOAPdenovo and IDBA-UD, using a publically-available Illumina sequencing dataset of a 64-genome mock com-munity. The assembly results were verified by their alignment with reference genomes. The overall performances of the three assem-blers were comparable and each assembler provided best results for a subset of genomes.
A Genetic Algorithm Applied to Graph Problems Involving Subsets of Vertices
Wainwright, Roger L.
and Computer Sciences University of Tulsa University of Tulsa 600 South College Avenue 600 South College Avenue Tulsa, OK 74104 USA Tulsa, OK 74104 USA rogerw@utulsa.edu Abstract - Many graph problems seek subsets
CyGraph: A Reconfigurable Architecture for Parallel Breadth-First Search
Zambreno, Joseph A.
--Large-scale graph structures are considered as a keystone for many emerging high-performance computing appli among themselves, which could potentially cause pipeline stalls and other implementation inefficiencies
Banach, Richard
of programs written in UFO ([8,9]), a state-of-the-art object- oriented functional language, onto equivalent as follows: the next two sections introduce MONSTR and UFO and provide Term Graph Rewriting
Dynamic Programming and Graph Algorithms in Computer Vision Pedro F. Felzenszwalb and Ramin Zabih
Field, David
: Combinatorial Algorithms, Vision and Scene Understanding, Artificial Intelligence, Computing Methodologies 1Dynamic Programming and Graph Algorithms in Computer Vision Pedro F. Felzenszwalb and Ramin Zabih, and has been successfully applied to many vision problems. Discrete optimization techniques are especially
The Effect of Graph Layout on Inference from Social Network Data
Blythe, Jim
The Effect of Graph Layout on Inference from Social Network Data Jim Blythe 1 and Cathleen Mc of information to be #12; Ivo Jack Ben York Earl Rick Mel Dale Robin Nan Gerry Bob Fran Walt Ovid Gary Chris Hugh
Graph Expansion Analysis for Communication Costs of Fast Rectangular Matrix Multiplication
California at Berkeley, University of
Graph Expansion Analysis for Communication Costs of Fast Rectangular Matrix Multiplication Grey analysis of computational DAGs is useful for obtaining communication cost lower bounds where previous to fast algorithms for rectangular matrix multiplication, obtaining a new class of communication cost
A New Force-Directed Graph Drawing Method Based on Edge-Edge Repulsion$
Yen, Hsu-Chun
-vertex repulsion model in which vertices are replaced with charged steel rings and edges with springs to form the paradigm of simulated annealing, suited for combinatorial optimization problems, to draw graphs
Improved Algorithms and Complexity Results for Power Domination in Graphs
Niedermeier, Rolf
is asked to place a minimum number of so-called phase measurement units (PMU) at some locations in the system to measure the state variables (for example, the voltage magnitude). Since the monitoring PMU
Mobile Homophily and Social Location Prediction
Bapierre, Halgurt; Groh, Georg
2015-01-01
The mobility behavior of human beings is predictable to a varying degree e.g. depending on the traits of their personality such as the trait extraversion - introversion: the mobility of introvert users may be more dominated by routines and habitual movement patterns, resulting in a more predictable mobility behavior on the basis of their own location history while, in contrast, extrovert users get about a lot and are explorative by nature, which may hamper the prediction of their mobility. However, socially more active and extrovert users meet more people and share information, experiences, believes, thoughts etc. with others. which in turn leads to a high interdependency between their mobility and social lives. Using a large LBSN dataset, his paper investigates the interdependency between human mobility and social proximity, the influence of social networks on enhancing location prediction of an individual and the transmission of social trends/influences within social networks.
VCSEL fault location apparatus and method
Keeler, Gordon A. (Albuquerque, NM); Serkland, Darwin K. (Albuquerque, NM)
2007-05-15
An apparatus for locating a fault within an optical fiber is disclosed. The apparatus, which can be formed as a part of a fiber-optic transmitter or as a stand-alone instrument, utilizes a vertical-cavity surface-emitting laser (VCSEL) to generate a test pulse of light which is coupled into an optical fiber under test. The VCSEL is subsequently reconfigured by changing a bias voltage thereto and is used as a resonant-cavity photodetector (RCPD) to detect a portion of the test light pulse which is reflected or scattered from any fault within the optical fiber. A time interval .DELTA.t between an instant in time when the test light pulse is generated and the time the reflected or scattered portion is detected can then be used to determine the location of the fault within the optical fiber.
Menstrual cycle effects on spatial location tasks
Andrew, Sarah
2013-02-22
abilities (Halpem, 1992; Voyer et al. , 1995). However, there is one spatial ability test where women demonstrate an advantage over men. This female advantage spatial ability is known as spaflal location memory (Eals & Silvermen, 1994; Silverman & Eals..., Mock & Erbaugh, 1961) and a brief daily diary, which recorded subjective moods (i. e. , anxiety, sadness, anger, happiness, and energy level). The participants recorded their daily moods in the daily diary by marking a spot on a 10 cm visual analogue...
Alternative Fueling Station Locator | Department of Energy
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on DeliciousMathematics And StatisticsProgram ManagerCorridor Designations in 11Alternative Fueling Station Locator
Location of Narrowband Spikes in Solar Flares
Arnold O. Benz; Pascal Saint-Hilaire; Nicole Vilmer
2001-12-19
Narrowband spikes of the decimeter type have been identified in dynamic spectrograms of Phoenix-2 of ETH Zurich and located in position with the Nancay Radioheliograph at the same frequency. The spike positions have been compared with the location of hard X-ray emission and the thermal flare plasma in soft X-rays and EUV lines. The decimetric spikes are found to be single sources located some 20" to 400" away from the flare site in hard or soft X-rays. In most cases there is no bright footpoint nearby. In at least two cases the spikes are near loop tops. These observations do not confirm the widely held view that the spike emission is produced by some loss-cone instability masering near the footpoints of flare loops. On the other hand, the large distance to the flare sites and the fact that these spikes are all observed in the flare decay phase make the analyzed spike sources questionable sites for the main flare electron acceleration. They possibly indicate coronal post-flare acceleration sites.
Semantics of Functional and Locative Relations in Rongga
Aryawibawa, I. Nyoman
2010-01-01
Many scholars have proposed a universal set of locative relations. Herskovits’s comprehensive study of English locative relations found that locative concepts such as inclusion, support and contiguity, and coincidence are basic in English. Her...
Location Prediction in Social Media Based on Tie Strength
McGee, Jeffrey A
2013-04-29
We propose a novel network-based approach for location estimation in social media that integrates evidence of the social tie strength between users for improved location estimation. Concretely, we propose a location estimator – Friendly...
Energy Department Announces Student Teams, Location for Solar...
Office of Environmental Management (EM)
Student Teams, Location for Solar Decathlon 2015 Energy Department Announces Student Teams, Location for Solar Decathlon 2015 February 13, 2014 - 1:00pm Addthis News Media Contact...
Optimization Online - p-facility Huff location problem on networks
Rafael Blanquero
2014-10-30
Oct 30, 2014 ... Abstract: The p-facility Huff location problem aims at locating facilities on a competitive environment so as to maximize the market share.
Research Site Locations for Current and Former EERE Postdoctoral...
Broader source: Energy.gov (indexed) [DOE]
Research Site Locations for Current and Former EERE Postdoctoral Awards, from the U.S. Department of Energy's Office of Energy Efficiency and Renewable Energy. Facility Location...
Open Location-Oriented Services for the Web
Wilde, Erik
2008-01-01
Location Management for Mobile Devices. In Proceedings ofof wireless data services and mobile devices can take fullof location-awareness and mobile devices. Conclusions This
Tel: Name: Rm. Tel: Location: Rm.
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity ofkandz-cm11 Outreach Home RoomPreservationBio-Inspired Solar FuelTechnologyTel: Name: Rm. Tel: Location: Rm. Oct 2, 2015 Amin,
Sandia National Laboratories: Locations: Kauai Test Facility
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity ofkandz-cm11 Outreach Home RoomPreservation ofAlbuquerque Albuquerque Housing Education Recreation Locations LifeKauai Test
Sandia National Laboratories: Locations: Livermore, California
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity ofkandz-cm11 Outreach Home RoomPreservation ofAlbuquerque Albuquerque Housing Education Recreation Locations LifeKauai
An Energy Efficient Location Service for Mobile Ad Hoc etworks
Varela, Carlos
the distance traveled by the location update and query packets and, thus, at reducing the overall energy cost by the location update and query packets and, thus, to reduce the overall energy cost. 2 Energy Efficient LocationAn Energy Efficient Location Service for Mobile Ad Hoc etworks Zijian Wang1 , Eyuphan Bulut1
An Application of Graph Based Evolutionary Algorithms for Diversity Preservation
Ashlock, Dan
to a thermal systems engineering design problem - the design of a biomass cook stove currently in use during evolution. A usable stove design, subsequently deployed in the field, was located or other biomass fuels for household cooking and heating needs. In 1997 fuelwood represented about 47
Fusion categories in terms of graphs and relations
Hendryk Pfeiffer
2011-04-20
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).
Locating hardware faults in a parallel computer
Archer, Charles J.; Megerian, Mark G.; Ratterman, Joseph D.; Smith, Brian E.
2010-04-13
Locating hardware faults in a parallel computer, including defining within a tree network of the parallel computer two or more sets of non-overlapping test levels of compute nodes of the network that together include all the data communications links of the network, each non-overlapping test level comprising two or more adjacent tiers of the tree; defining test cells within each non-overlapping test level, each test cell comprising a subtree of the tree including a subtree root compute node and all descendant compute nodes of the subtree root compute node within a non-overlapping test level; performing, separately on each set of non-overlapping test levels, an uplink test on all test cells in a set of non-overlapping test levels; and performing, separately from the uplink tests and separately on each set of non-overlapping test levels, a downlink test on all test cells in a set of non-overlapping test levels.
Location Independent Professional Project: A Pilot Study
Hudson, J.A.; Long, J.P.; Miller, M.M.
1999-02-01
This pilot study project explored the problem of providing access to the nomadic worker who desires to connect a computer through network access points at a number of different locations within the SNL/NM campus as well as outside the campus. The design and prototype development gathered knowledge that may allow a design to be developed that could be extended to a larger number of SNL/NM network drop boxes. The focus was to provide a capability for a worker to access the SNL IRN from a network drop box (e.g. in a conference room) as easily as when accessing the computer network from the office normally used by the worker. Additional study was done on new methods to authenticate the off campus worker, and protect and control access to data.
Stallmann, Matt
of a biconnected graph is given (This data stucture is based on PQ- trees [3]). Algorithms are presented isomorphism of chemical structures (an application of planar graph isomorphism, see [9,11])to VLSI design (see
Graph Coloring Algorithms for Muti-core and Massively Multithreaded Architectures
Catalyurek, Umit; Gebremedhin, Assefaw; Halappanavar, Mahantesh; Pothen, Alex
2012-01-01
We explore the interplay between architectures and algorithm design in the context of shared-memory platforms and a specific graph problem of central importance in scientific and high-performance computing, distance-1 graph coloring. We introduce two different kinds of multithreaded heuristic algorithms for the stated, NP-hard, problem. The first algorithm relies on speculation and iteration, and is suitable for any shared-memory system. The second algorithm uses dataflow principles, and is targeted at the non-conventional, massively multithreaded Cray XMT system. We study the performance of the algorithms on the Cray XMT and two multi-core systems, Sun Niagara 2 and Intel Nehalem. Together, the three systems represent a spectrum of multithreading capabilities and memory structure. As testbed, we use synthetically generated large-scale graphs carefully chosen to cover a wide range of input types. The results show that the algorithms have scalable runtime performance and use nearly the same number of colors as...
Large-scale inference and graph theoretical analysis of gene-regulatory networks in B. stubtilis
C. Christensen; A. Gupta; C. D. Maranas; R. Albert
2006-07-18
We present the methods and results of a two-stage modeling process that generates candidate gene-regulatory networks of the bacterium B. subtilis from experimentally obtained, yet mathematically underdetermined microchip array data. By employing a computational, linear correlative procedure to generate these networks, and by analyzing the networks from a graph theoretical perspective, we are able to verify the biological viability of our inferred networks, and we demonstrate that our networks' graph theoretical properties are remarkably similar to those of other biological systems. In addition, by comparing our inferred networks to those of a previous, noisier implementation of the linear inference process [17], we are able to identify trends in graph theoretical behavior that occur both in our networks as well as in their perturbed counterparts. These commonalities in behavior at multiple levels of complexity allow us to ascertain the level of complexity to which our process is robust to noise.
Cascading Power Outages Propagate Locally in an Influence Graph that is not the Actual Grid Topology
Hines, Paul D H; Rezaei, Pooya
2015-01-01
In a cascading power transmission outage, component outages propagate non-locally; after one component outages, the next failure may be very distant, both topologically and geographically. As a result, simple models of topological contagion do not accurately represent the propagation of cascades in power systems. However, cascading power outages do follow patterns, some of which are useful in understanding and reducing blackout risk. This paper describes a method by which the data from many cascading failure simulations can be transformed into a graph-based model of influences that provides actionable information about the many ways that cascades propagate in a particular system. The resulting "influence graph" model is Markovian, since component outage probabilities depend only on the outages that occurred in the prior generation. To validate the model we compare the distribution of cascade sizes resulting from n-2 contingencies in a 2896 branch test case to cascade sizes in the influence graph. The two dist...
Powers, Sarah S.; Lothian, Joshua
2014-12-01
The benchmarking effort within the Extreme Scale Systems Center at Oak Ridge National Laboratory seeks to provide High Performance Computing benchmarks and test suites of interest to the DoD sponsor. The work described in this report is a part of the effort focusing on graph generation. A previously developed benchmark, SystemBurn, allows the emulation of a broad spectrum of application behavior profiles within a single framework. To complement this effort, similar capabilities are desired for graph-centric problems. This report described the in-depth analysis of the generated synthetic graphs' properties at a variety of scales using different generator implementations and examines their applicability to replicating real world datasets.
Fault Locating, Prediction and Protection (FLPPS)
Yinger, Robert, J.; Venkata, S., S.; Centeno, Virgilio
2010-09-30
One of the main objectives of this DOE-sponsored project was to reduce customer outage time. Fault location, prediction, and protection are the most important aspects of fault management for the reduction of outage time. In the past most of the research and development on power system faults in these areas has focused on transmission systems, and it is not until recently with deregulation and competition that research on power system faults has begun to focus on the unique aspects of distribution systems. This project was planned with three Phases, approximately one year per phase. The first phase of the project involved an assessment of the state-of-the-art in fault location, prediction, and detection as well as the design, lab testing, and field installation of the advanced protection system on the SCE Circuit of the Future located north of San Bernardino, CA. The new feeder automation scheme, with vacuum fault interrupters, will limit the number of customers affected by the fault. Depending on the fault location, the substation breaker might not even trip. Through the use of fast communications (fiber) the fault locations can be determined and the proper fault interrupting switches opened automatically. With knowledge of circuit loadings at the time of the fault, ties to other circuits can be closed automatically to restore all customers except the faulted section. This new automation scheme limits outage time and increases reliability for customers. The second phase of the project involved the selection, modeling, testing and installation of a fault current limiter on the Circuit of the Future. While this project did not pay for the installation and testing of the fault current limiter, it did perform the evaluation of the fault current limiter and its impacts on the protection system of the Circuit of the Future. After investigation of several fault current limiters, the Zenergy superconducting, saturable core fault current limiter was selected for installation. Because of some testing problems with the Zenergy fault current limiter, installation was delayed until early 2009 with it being put into operation on March 6, 2009. A malfunction of the FCL controller caused the DC power supply to the superconducting magnet to be turned off. This inserted the FCL impedance into the circuit while it was in normal operation causing a voltage resonance condition. While these voltages never reached a point where damage would occur on customer equipment, steps were taken to insure this would not happen again. The FCL was reenergized with load on December 18, 2009. A fault was experienced on the circuit with the FCL in operation on January 14, 2010. The FCL operated properly and reduced the fault current by about 8%, what was expected from tests and modeling. As of the end of the project, the FCL was still in operation on the circuit. The third phase of the project involved the exploration of several advanced protection ideas that might be at a state where they could be applied to the Circuit of the Future and elsewhere in the SCE electrical system. Based on the work done as part of the literature review and survey, as well as a number of internal meetings with engineering staff at SCE, a number of ideas were compiled. These ideas were then evaluated for applicability and ability to be applied on the Circuit of the Future in the time remaining for the project. Some of these basic ideas were implemented on the circuit including measurement of power quality before and after the FCL. It was also decided that we would take what was learned as part of the Circuit of the Future work and extend it to the next generation circuit protection for SCE. Also at this time, SCE put in a proposal to the DOE for the Irvine Smart Grid Demonstration using ARRA funding. SCE was successful in obtaining funding for this proposal, so it was felt that exploration of new protection schemes for this Irvine Smart Grid Demonstration would be a good use of the project resources. With this in mind, a protection system that uses fault interrupting switches, hi
Kobourov, Stephen G.
Weak Unit Disk and Interval Representation of Graphs M. J. Alam, S. G. Kobourov, S. Pupyrev, and J of intersection representations with unit balls: unit disks in the plane and unit intervals on the line. Given is to represent the vertices of the graph by unit-size balls so that the balls for two adjacent vertices intersect
Heggernes, Pinar
Graph Classes and Ramsey Numbers RÂ´emy Belmonte, Pinar Heggernes, Pim van 't Hof, Arash Rafiey two positive integers i and j, the Ramsey number RG(i, j) is the smallest positive integer. For the class of all graphs, Ramsey numbers are notoriously hard to determine, and they are known only for very
Mayhew, Dillon
THE STRUCTURE OF GRAPHS WITH A VITAL LINKAGE OF ORDER 2 DILLON MAYHEW, GEOFF WHITTLE, AND STEFAN H of which is a path. A linkage is vital if it spans all vertices, and no other linkage connects the same pairs of end vertices. We give a characterization of the graphs with a vital linkage of order 2
Fault Diagnosis of Steam Generator Using Signed Directed Graph and Artificial Neural Networks
Aly, Mohamed N. [Nuclear Eng. Department, Fac. of Eng., Alex. Univ., Alex. (Egypt); Hegazy, Hesham N. [Nuclear Power Plants Authority, Cairo (Egypt)
2006-07-01
Diagnosis is a very complex and important task for finding the root cause of faults in nuclear power plants. The objective of this paper is to investigate the feasibility of using the combination of signed directed graph (SDG) and artificial neural networks for fault diagnosis in nuclear power plants especially in U-Tube steam generator. Signed directed graph has been the most widely used form of qualitative based model methods for process fault diagnosis. It is constructed to represent the cause-effect relations among the dynamic process variables. Signed directed graph consists of nodes represent the process variables and branches. The branch represents the qualitative influence of a process variable on the related variable. The main problem in fault diagnosis using the signed directed graph is the unmeasured variables. Therefore, neural networks are used to estimate the values of unmeasured nodes. In this work, different four cases of faults in the steam generator ( SG) have been diagnosed, three of them are single fault and the fourth is multiple fault. The first three faults are by pass valve leakage (Vbp(+)), main feed water valve opening increase (Vfw(+)), main feed water valve opening decrease (Vfw (-)). The fourth fault is a multiple fault where by-pass valve leakage and main feed water valve opening decrease (Vbp(+) and Vfw (-)) in the same time. The used data are collected from a basic principle simulator of pressurized water reactor 925 Mwe. The signed directed graph of the steam generator is constructed to represent the cause-effect relations among SG variables. It consists of 26 nodes represent the SG variables, and 48 branches represent the cause effect relations among this variables. For each fault the values of measured nodes are coming from sensors and the values of unmeasured nodes are coming from the trained neural networks. These values of the nodes are compared by normal values to get the sign of the nodes. The cause-effect graph for each fault is constructed from the steam generator signed directed graph by removing the invalid (normal) nodes and inconsistent branches. Then in the cause-effect graph we search about the node which does not have an input branch. This node is the fault origin node. The result of this work demonstrated that this method can be used in nuclear power plant fault diagnosis. The advantages of this method are, it enables us to diagnose a multi fault, it is not restricted by pre-defined faults, and it is fast method. (authors)
Automation of the Dipole Subtraction Method in MadGraph/MadEvent
Rikkert Frederix; Thomas Gehrmann; Nicolas Greiner
2008-08-15
We present the implementation of the dipole subtraction formalism for the real radiation contributions to any next-to-leading order QCD process in the MadGraph/MadEvent framework. Both massless and massive dipoles are considered. Starting from a specific (n+1)-particle process the package provides a Fortran code for all possible dipoles to all Born processes that constitute the subtraction term to the (n+1)-particle process. The output files are given in the usual "MadGraph StandAlone" style using helicity amplitudes.
EZPIX: a tablet entry method for computer-generated slides, drawings, and graphs
Williams, J.M.
1984-09-01
This manual outlines a method for making slides, drawings, maps, graphs, etc., with the touch of a button. A minicomputer-based program, called EZPIX, connects the host computer graphics system to a tablet on which one can digitize input and specify graphics commands from a menu. A minicomputer terminal serves as editor and provides local graphics output. The magic button does practically everything else. It signs you on, starts, builds, ends, executes and saves your command file, and signs you off. It even allows you to make a composite picture from an assortment of inappropriately sized originals. The graph and pie chart modes are handy, too.
Mutlu, Onur
an open problem. Ideally, cost-effective and scalable graph processing systems can be realized by building technology that facilitates stacking logic and memory dies in a single package, which was not available when-of-the-art graph processing workloads with large real-world graphs show that the proposed architecture improves
Homodyne impulse radar hidden object locator
McEwan, T.E.
1996-04-30
An electromagnetic detector is designed to locate an object hidden behind a separator or a cavity within a solid object. The detector includes a PRF generator for generating 2 MHz pulses, a homodyne oscillator for generating a 2 kHz square wave, and for modulating the pulses from the PRF generator. A transmit antenna transmits the modulated pulses through the separator, and a receive antenna receives the signals reflected off the object. The receiver path of the detector includes a sample and hold circuit, an AC coupled amplifier which filters out DC bias level shifts in the sample and hold circuit, and a rectifier circuit connected to the homodyne oscillator and to the AC coupled amplifier, for synchronously rectifying the modulated pulses transmitted over the transmit antenna. The homodyne oscillator modulates the signal from the PRF generator with a continuous wave (CW) signal, and the AC coupled amplifier operates with a passband centered on that CW signal. The present detector can be used in several applications, including the detection of metallic and non-metallic objects, such as pipes, studs, joists, nails, rebars, conduits and electrical wiring, behind wood wall, ceiling, plywood, particle board, dense hardwood, masonry and cement structure. The detector is portable, light weight, simple to use, inexpensive, and has a low power emission which facilitates the compliance with Part 15 of the FCC rules. 15 figs.
Homodyne impulse radar hidden object locator
McEwan, Thomas E. (Livermore, CA)
1996-01-01
An electromagnetic detector is designed to locate an object hidden behind a separator or a cavity within a solid object. The detector includes a PRF generator for generating 2 MHz pulses, a homodyne oscillator for generating a 2 kHz square wave, and for modulating the pulses from the PRF generator. A transmit antenna transmits the modulated pulses through the separator, and a receive antenna receives the signals reflected off the object. The receiver path of the detector includes a sample and hold circuit, an AC coupled amplifier which filters out DC bias level shifts in the sample and hold circuit, and a rectifier circuit connected to the homodyne oscillator and to the AC coupled amplifier, for synchronously rectifying the modulated pulses transmitted over the transmit antenna. The homodyne oscillator modulates the signal from the PRF generator with a continuous wave (CW) signal, and the AC coupled amplifier operates with a passband centered on that CW signal. The present detector can be used in several applications, including the detection of metallic and non-metallic objects, such as pipes, studs, joists, nails, rebars, conduits and electrical wiring, behind wood wall, ceiling, plywood, particle board, dense hardwood, masonry and cement structure. The detector is portable, light weight, simple to use, inexpensive, and has a low power emission which facilitates the compliance with Part 15 of the FCC rules.
TAGGING, TRACKING AND LOCATING WITHOUT GPS
Cordaro, J.; Coleman, T.; Shull, D.
2012-07-08
The Savannah River National Laboratory (SRNL) was requested to lead a Law Enforcement Working Group that was formed to collaborate on common operational needs. All agencies represented on the working group ranked their need to tag, track, and locate a witting or unwitting target as their highest priority. Specifically, they were looking for technologies more robust than Global Positioning Satellite (GPS), could communicate back to the owner, and worked where normal cell phone communications did not work or were unreliable. SRNL brought together multiple technologies in a demonstration that was held in in various Alaska venues, including metropolitan, wilderness, and at-sea that met the working group's requirements. Using prototypical technologies from Boeing, On Ramp, and Fortress, SRNL was able to demonstrate the ability to track personnel and material in all scenarios including indoors, in heavily wooden areas, canyons, and in parking garages. In all cases GPS signals were too weak to measure. Bi-directional communication was achieved in areas that Wi-Fi, cell towers, or traditional radios would not perform. The results of the exercise will be presented. These technologies are considered ideal for tracking high value material such has nuclear material with a platform that allows seamless tracking anywhere in the world, indoors or outdoors.
SAPLE: Sandia Advanced Personnel Locator Engine.
Procopio, Michael J.
2010-04-01
We present the Sandia Advanced Personnel Locator Engine (SAPLE) web application, a directory search application for use by Sandia National Laboratories personnel. SAPLE's purpose is to return Sandia personnel 'results' as a function of user search queries, with its mission to make it easier and faster to find people at Sandia. To accomplish this, SAPLE breaks from more traditional directory application approaches by aiming to return the correct set of results while placing minimal constraints on the user's query. Two key features form the core of SAPLE: advanced search query interpretation and inexact string matching. SAPLE's query interpretation permits the user to perform compound queries when typing into a single search field; where able, SAPLE infers the type of field that the user intends to search on based on the value of the search term. SAPLE's inexact string matching feature yields a high-quality ranking of personnel search results even when there are no exact matches to the user's query. This paper explores these two key features, describing in detail the architecture and operation of SAPLE. Finally, an extensive analysis on logged search query data taken from an 11-week sample period is presented.
A unified Bayesian framework for relative microseismic location
Poliannikov, Oleg V.
We study the problem of determining an unknown microseismic event location relative to previously located events using a single monitoring array in a monitoring well. We show that using the available information about the ...
Locations of Smart Grid Demonstration and Large-Scale Energy...
Office of Environmental Management (EM)
Locations of Smart Grid Demonstration and Large-Scale Energy Storage Projects Locations of Smart Grid Demonstration and Large-Scale Energy Storage Projects Map of the United States...
A unified Bayesian framework for relative microseismic location
Poliannikov, Oleg V.
2013-01-01
We study the problem of determining an unknown microseismic event location relative to previously located events using a single monitoring array in a monitoring well. We show that using the available information about the ...
The Cricket Indoor Location System Nissanka Bodhi Priyantha
applications. Cricket consists of location beacons that are attached to the ceiling of a building to compute their own locations. This active-beacon passive-listener architecture is scalable with respect
Fire Alarm Control Panel is located in Switchgear
KEY: NORTH CHDD-South Floor 1 Fire Alarm Control Panel is located in Switchgear Room #CD11A Panel is located in Switchgear Room #CD11A on Basement Level Evacuation Route Exit Restroom Fire
Policy-aware sender anonymity in Location-based services
Vyas, Avinash
2011-01-01
LBS Server Location Server CSP Sender Figure 1.1: LBS ModelService Provider, denoted as CSP, the Location Server,is either the MPC in the CSP’s network or an Over-The-Top (
The ear as a location for wearable vital signs monitoring
He, David Da
Obtaining vital signs non-invasively and in a wearable manner is essential for personal health monitoring. We propose the site behind the ear as a location for an integrated wearable vital signs monitor. This location is ...
A Look at Health Care Buildings - Where are they located
U.S. Energy Information Administration (EIA) Indexed Site
Location Return to: A Look at Health Care Buildings How large are they? How many employees are there? Where are they located? How old are they? Who owns and occupies them? Are they...
Dynamic resource location in peer-to-peer networks
Nathuji, Ripal Babubhai
2004-09-30
Resource location is a necessary operation for computer applications. In large scale peer-to-peer systems, random search is a scalable approach for locating dynamic resources. Current peer-to-peer systems can be partitioned into those which rely...
An Adaptive Cross-Architecture Combination Method for Graph Traversal
You, Yang; Song, Shuaiwen; Kerbyson, Darren J.
2014-06-18
Breadth-First Search (BFS) is widely used in many real-world applications including computational biology, social networks, and electronic design automation. The combination method, using both top-down and bottom-up techniques, is the most effective BFS approach. However, current combination methods rely on trial-and-error and exhaustive search to locate the optimal switching point, which may cause significant runtime overhead. To solve this problem, we design an adaptive method based on regression analysis to predict an optimal switching point for the combination method at runtime within less than 0.1% of the BFS execution time.
Farque, J.A. (C.D.I., Broken Arrow, OK (United States))
1994-01-01
Magnetic transmission systems work well in conjunction with pipe line pigging. They have transmission characteristics that allow an operator to track a pig as it moves through the line with one antenna orientation, and locate a stationary pig and transmitter to within inches with another. Advanced systems offer pig run documentation features by recording the images of transmitter passages and their times and dates. These features will become increasingly important to pipe line owners and operators in the future as the EPA tightens its grip on the pipe line and gas industries. Additionally, pigging personnel with no real experience with the tracking or location of pigs can operate a magnetic system and be immediately productive. This lowers the overall cost to the service company, the pipe line owner, and ultimately the end user of the product.
TOPICS IN PROBABILISTIC LOCATION ESTIMATION IN WIRELESS NETWORKS
Myllymäki, Petri
TOPICS IN PROBABILISTIC LOCATION ESTIMATION IN WIRELESS NETWORKS Petri Kontkanen, Petri Myllym;TOPICS IN PROBABILISTIC LOCATION ESTIMATION IN WIRELESS NETWORKS Petri Kontkanen, Petri Myllym¨aki, Teemu, Spain, IEEE Press, 2004. TOPICS IN PROBABILISTIC LOCATION ESTIMATION IN WIRELESS NETWORKS Petri
COMBINING LOCATION AND EXPRESSION DATA FOR PRINCIPLED DISCOVERY OF
Hartemink, Alexander
location data to guide the model induction process. We combine these two data modalities by al- lowing combine genomic location and expression data to guide the model induction process by permitting the formerCOMBINING LOCATION AND EXPRESSION DATA FOR PRINCIPLED DISCOVERY OF GENETIC REGULATORY NETWORK
Risks of using AP locations discovered through war driving
Kotz, David
Risks of using AP locations discovered through war driving Minkyong Kim, Jeffrey J. Fielding the actual locations are often unavailable, they use estimated locations from war driving estimated through war driving. War driving is the process of collecting Wi-Fi beacons by driving or walking
Location-based Sponsored Search Advertising George Trimponias1
Papadias, Dimitris
Location-based Sponsored Search Advertising George Trimponias1 , Ilaria Bartolini2 , Dimitris unprecedented opportunities for location-based advertising. In this work, we provide models and investigate the market for location-based sponsored search, where advertisers pay the search engine to be displayed
Static and Dynamic Location Management in Distributed Mobile Environments
Vaidya, Nitin
Static and Dynamic Location Management in Distributed Mobile Environments P. Krishna y N. H. Vaidya for search, update and search-update. Static location management uses one combination of search, update the performance of di erent static location management strategies for various communicationand mobilitypatterns
Incremental Program Testing Using Program Dependence Graphs SAMUEL BATES SUSAN HORWITZ
Horwitz, Susan B.
data adequacy is a widely accepted concept for pro viding some confidence that a particular test suiteIncremental Program Testing Using Program Dependence Graphs SAMUEL BATES SUSAN HORWITZ samuel as the basis for incremental program testing when using test data adequacy criteria. Test data adequacy
Computing Nash Equilibria of Action-Graph Games Navin A. R. Bhat
Sipe,J. E.
Computing Nash Equilibria of Action-Graph Games Navin A. R. Bhat Department of Physics University.g., Fudenberg and Tirole [1991].) The central game-theoretic solution con- cept is the Nash equilibrium, a fixed-point in mixed strat- egy space which Nash [1950] proved exists in every finite game. It remains an important
GEM: Graph EMbedding for Routing and Data-Centric Storage in Sensor Networks Without Geographic
Song, Dawn
GEM: Graph EMbedding for Routing and Data-Centric Storage in Sensor Networks Without Geographic- ularly data-centric storage and information aggregation, rely on efficient routing from one node-to-node routing and data-centric storage and information processing in sensor networks. Un- like previous
GEM: Graph EMbedding for Routing and DataCentric Storage in Sensor Networks Without Geographic
GEM: Graph EMbedding for Routing and DataCentric Storage in Sensor Networks Without Geographic ularly datacentric storage and information aggregation, rely on e#cient routing from one node to another and datacentric storage and information processing in sensor networks. Un like previous approaches
GEM: Graph EMbedding for Routing and DataCentric Storage in Sensor Networks Without
GEM: Graph EMbedding for Routing and DataCentric Storage in Sensor Networks Without Geographic), an infrastructure for nodetonode routing and datacentric storage and information processing in sensor networks, or the U.S. Government or any of its agencies. #12; Keywords: Sensor networks, routing, datacentric
GEM: Graph EMbedding for Routing and Data-Centric Storage in Sensor Networks Without
GEM: Graph EMbedding for Routing and Data-Centric Storage in Sensor Networks Without Geographic), an infrastructure for node-to-node routing and data-centric storage and information processing in sensor networks University, or the U.S. Government or any of its agencies. #12;Keywords: Sensor networks, routing, data-centric
Battery Aware Dynamic Scheduling For Periodic Task Graphs Venkat Rao1
Navet, Nicolas
Battery Aware Dynamic Scheduling For Periodic Task Graphs Venkat Rao1 , Nicolas Navet1 , Gaurav Of Technology, Delhi 4 Indian Institute Of Technology, Delhi Dept. of Computer Science and Engineering Dept. of Electrical Engineering anshul@cse.iitd.ernet.in gswaran@ee.iitd.ernet.in Abstract Battery lifetime, a primary
Figure 1. Schematic of initial air pump design Design of Air Pump System Using Bond Graph
Fernandez, Thomas
, is presented in Figure 1. It is a vibratory pump in which an electromagnetic circuit drives a small permanent magnet attached to a pivoted lever that, in turn, drives a rubber bellows pump. The bellows pump has an embryo bond graph model. Parameters for the GP search process must be set to control both the generation
Paris-Sud XI, Université de
floods. Model checking is a powerful tool for system verification because it can reveal errors that were to describe the properties checking the system model. 395 hal-00617998,version1-31Aug2011 Author manuscriptSCALESEM Evaluation of Semantic Graph based on Model Checking Mahdi Gueffaz, Sylvain Rampacek
In-Space Transportation Infrastructure Architecture Decisions Using a Weighted Graph Approach
de Weck, Olivier L.
and Technology Skolkovo 143025, Russia crawley@skolkovotech.ru Abstract-- The selection of an architecture with nodes corresponding to architecture- technology combinations and edges corresponding to the abilityIn-Space Transportation Infrastructure Architecture Decisions Using a Weighted Graph Approach Peter
Visualizing Cells and their Connectivity Graphs for CompuCell3D Randy Heiland
Indiana University
Visualizing Cells and their Connectivity Graphs for CompuCell3D Randy Heiland CREST, Pervasive models that simulate the behavior of different types of interacting biological cells can be a very time consuming and er- ror prone task. CompuCell3D is an open source application that addresses this challenge
Application-only Call Graph Construction Karim Ali and Ondrej Lhotak
Lhotak, Ondrej
program (i.e., both the application and the libraries that the application depends on). A popular of the library code and any calls the library makes back into the application. This results in potential un the code of the library. 1 Introduction A call graph is a necessary prerequisite for most interprocedural
The Economics Of Supply And Demand: An Important Challenge For Conceptual Graphs
Delugach, Harry S.
The Economics Of Supply And Demand: An Important Challenge For Conceptual Graphs Simon Polovinaknown basic economic area: namely, the law of supply and demand. Employing Peirce logic negative contexts, we represent various parts of classical economic theory, e.g., oversupply, overdemand, and equilibrium states
Aizenman, Michael; Warzel, Simone
2012-09-15
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.
Graph-Based Decoding in the Presence of ISI Mohammad H. Taghavi and Paul H. Siegel
Siegel, Paul H.
1 Graph-Based Decoding in the Presence of ISI Mohammad H. Taghavi and Paul H. Siegel Center: (mtaghavi, psiegel)@ucsd.edu Abstract We propose an approximation of maximum-likelihood detection in ISI of the proposed technique under linear programming. I. INTRODUCTION Intersymbol interference (ISI
BioCONCUR 2004 Preliminary Version From Logical Regulatory Graphs to Standard
Ruet, Paul
BioÂCONCUR 2004 Preliminary Version From Logical Regulatory Graphs to Standard Petri Nets/Universitâ??e de la Mâ??editerranâ??ee Â Marseille, France Abstract Logical modelling and Petri nets constitute two complementary approaches for the dynamical modelling of biological regulatory networks. On the one hand
From Logical Regulatory Graphs to Standard Petri Nets: Dynamical Roles and Functionality
Provence Aix-Marseille I, UniversitĂ© de
From Logical Regulatory Graphs to Standard Petri Nets: Dynamical Roles and Functionality Marseille Cedex 9, France fchaouiya, thieffryg@ibdm.univ-mrs.fr Abstract. Logical modelling and Petri nets constitute two complemen- tary approaches for the dynamical modelling of biological regulatory networks
Planning as Propositional CSP: from Walksat to Local Search Techniques for Action Graphs
Gerevini, Alfonso E.
techniques are implemented in a planner called LPG using various types of heuristics based on a parametrized evaluated using Lagrange multipliers. LPG's basic heuristic was inspired by Walksat, which in Kautz and Selman's Blackbox can be used to solve the SAT-encoding of a planning graph. An advantage of LPG
Planning Through Stochastic Local Search and Temporal Action Graphs in LPG
Gerevini, A; Serina, I; 10.1613/jair.1183
2011-01-01
We present some techniques for planning in domains specified with the recent standard language PDDL2.1, supporting 'durative actions' and numerical quantities. These techniques are implemented in LPG, a domain-independent planner that took part in the 3rd International Planning Competition (IPC). LPG is an incremental, any time system producing multi-criteria quality plans. The core of the system is based on a stochastic local search method and on a graph-based representation called 'Temporal Action Graphs' (TA-graphs). This paper focuses on temporal planning, introducing TA-graphs and proposing some techniques to guide the search in LPG using this representation. The experimental results of the 3rd IPC, as well as further results presented in this paper, show that our techniques can be very effective. Often LPG outperforms all other fully-automated planners of the 3rd IPC in terms of speed to derive a solution, or quality of the solutions that can be produced.
RNA Structures with PseudoKnots GraphTheoretical and Combinatorial Properties
Stadler, Peter F.
RNA Structures with PseudoKnots GraphTheoretical and Combinatorial Properties Peter F. Stadler a Structures Abstract Secondary structures of nucleic acids are a particularly interesting class of contact structures. Many important RNA molecules contain pseudoknots, which are excluded explicitly by the def
VISSOFT'07 Submission Kagdi, Maletic Onion Graphs for Focus+Context Views of UML Class Diagrams
Maletic, Jonathan I.
VISSOFT'07 Submission Kagdi, Maletic Onion Graphs for Focus+Context Views of UML Class Diagrams+context technique for visualizing large UML class models. The focus area, which can be manually or automatically source project. 1. Introduction Developers find UML class models1 useful for designing systems along
Onion Routing Circuit Construction Via Latency Graphs Sergio Castillo-Perez,a
Garcia-Alfaro, Joaquin
privacy problems on the Internet. Tor (short for The onion router) is a popular low-latency anonymity]. Nowadays, it is distributed as a free software implementation known as Tor (The onion router [2]). It canOnion Routing Circuit Construction Via Latency Graphs Sergio Castillo-P´erez,a , Joaquin Garcia
Geosocial Graph-Based Community Detection Yves van Gennip, Huiyi Hu, Blake Hunter
Soatto, Stefano
geosocial information. The data come from the policing district Hollenbeck (see Fig. 1) in Los AngelesGeosocial Graph-Based Community Detection Yves van Gennip, Huiyi Hu, Blake Hunter Department of Mathematics University of California, Los Angeles Los Angeles, CA, USA Email: yvgennip@math.ucla.edu, huiyihu
Pattern Graphs: Combining Multivariate Time Series and Labelled Interval Sequences for
Berthold, Michael R.
.500) gear down [1,*] ? ? [1,*] [1,*] [1,*] [1,*] low revolutions [1,*] [1,*] ? [1,50] [1,*] gear up ? [1,50] ? [1,50] [1,*] ? [1,*] [1,*] [1,*]? [1,*] middle revolutions ¬gear up ¬gear down ¬gear up ¬gear down [1,*] gear up Fig. 1 Example of a pattern graph describing a driving cycle (learned from data, see [10
Erdos-Renyi random graphs + forest fires = self-organized criticality
Balazs Rath; Balint Toth
2009-08-26
We modify the usual Erdos-Renyi random graph evolution by letting connected clusters 'burn down' (i.e. fall apart to disconnected single sites) due to a Poisson flow of lightnings. In a range of the intensity of rate of lightnings the system sticks to a permanent critical state.
Haarslev, Volker
An Enhanced Graph-Oriented Approach for Change Management in Distributed Biomedical Ontologies of the most challenging issues in ontology change management is keeping ontologies consistent when changes occur. Generally most of the existing change management approaches have been faced with the following
Gibbs Sampling for Logistic Normal Topic Models with Graph-Based Priors
McCallum, Andrew
in the T - 1 simplex (i.e., a T-dimensional logistic normal random variable) can be generated as follows: 1Gibbs Sampling for Logistic Normal Topic Models with Graph-Based Priors David Mimno, Hanna M relationships. Models for spatial and temporal data often rely on real-valued state space models such as dynamic
Dvelopper une bibliothque de calculs sur des grands graphes lorsque la matrice
Grigoras, .Romulus
extrĂŞmement favorables pour la faible complexitĂ© espace et temps des algorithmes de traitements. Dans ce les propriĂ©tĂ©s des graphes de terrain an d'optimiser le temps et l'espace des calculs (par l
On the Formal Verification of Embedded Software Using Multiway Decision Graphs
Tahar, SofiĂ¨ne
. Recently attention has been given to the verification of embedded systems using formal methods and Claesen [10] suggested a methodology for modeling both the software and hardware of an embedded system1 On the Formal Verification of Embedded Software Using Multiway Decision Graphs Subhashini
Automated Design Methodology for Mechatronic Systems Using Bond Graphs and Genetic Programming
Fernandez, Thomas
Automated Design Methodology for Mechatronic Systems Using Bond Graphs and Genetic Programming for synthesizing designs for multi-domain systems, such as mechatronic systems. The domain of mechatronic systems range. 1. INTRODUCTION Mechatronic system design is a type of multi-domain problem that differs from