Integrated color face graphs for plant accident display

International Nuclear Information System (INIS)

Hara, Fumio

1987-01-01

This paper presents an integrated man-machine interface that uses cartoon-like colored graphs in the form of faces, that, through different facial expressions, display a plant condition. This is done by drawing the face on a CRT by nonlinearly transforming 31 variables and coloring the face. This integrated color graphics technique is applied to display the progess of events in the Three Mile Island nuclear power plant accident. Human visual perceptive characteristics are investigated in relation to the perception of the plant accident process, the naturality in face color change, and the consistency between facial expressions and colors. This paper concludes that colors used in an integrated color face graphs must be completely consistent with emotional feelings perceived from the colors. (author)

Distributed graph coloring fundamentals and recent developments

CERN Document Server

Barenboim, Leonid

2013-01-01

The focus of this monograph is on symmetry breaking problems in the message-passing model of distributed computing. In this model a communication network is represented by a n-vertex graph G = (V,E), whose vertices host autonomous processors. The processors communicate over the edges of G in discrete rounds. The goal is to devise algorithms that use as few rounds as possible.A typical symmetry-breaking problem is the problem of graph coloring. Denote by ? the maximum degree of G. While coloring G with ? + 1 colors is trivial in the centralized setting, the problem becomes much more challenging

Equitable Coloring of Graphs. Recent Theoretical Results and New Practical Algorithms

Directory of Open Access Journals (Sweden)

Furmańczyk Hanna

2016-09-01

Full Text Available In many applications in sequencing and scheduling it is desirable to have an underlaying graph as equitably colored as possible. In this paper we survey recent theoretical results concerning conditions for equitable colorability of some graphs and recent theoretical results concerning the complexity of equitable coloring problem. Next, since the general coloring problem is strongly NP-hard, we report on practical experiments with some efficient polynomial-time algorithms for approximate equitable coloring of general graphs.

Frog: Asynchronous Graph Processing on GPU with Hybrid Coloring Model

Energy Technology Data Exchange (ETDEWEB)

Shi, Xuanhua; Luo, Xuan; Liang, Junling; Zhao, Peng; Di, Sheng; He, Bingsheng; Jin, Hai

2018-01-01

GPUs have been increasingly used to accelerate graph processing for complicated computational problems regarding graph theory. Many parallel graph algorithms adopt the asynchronous computing model to accelerate the iterative convergence. Unfortunately, the consistent asynchronous computing requires locking or atomic operations, leading to significant penalties/overheads when implemented on GPUs. As such, coloring algorithm is adopted to separate the vertices with potential updating conflicts, guaranteeing the consistency/correctness of the parallel processing. Common coloring algorithms, however, may suffer from low parallelism because of a large number of colors generally required for processing a large-scale graph with billions of vertices. We propose a light-weight asynchronous processing framework called Frog with a preprocessing/hybrid coloring model. The fundamental idea is based on Pareto principle (or 80-20 rule) about coloring algorithms as we observed through masses of realworld graph coloring cases. We find that a majority of vertices (about 80%) are colored with only a few colors, such that they can be read and updated in a very high degree of parallelism without violating the sequential consistency. Accordingly, our solution separates the processing of the vertices based on the distribution of colors. In this work, we mainly answer three questions: (1) how to partition the vertices in a sparse graph with maximized parallelism, (2) how to process large-scale graphs that cannot fit into GPU memory, and (3) how to reduce the overhead of data transfers on PCIe while processing each partition. We conduct experiments on real-world data (Amazon, DBLP, YouTube, RoadNet-CA, WikiTalk and Twitter) to evaluate our approach and make comparisons with well-known non-preprocessed (such as Totem, Medusa, MapGraph and Gunrock) and preprocessed (Cusha) approaches, by testing four classical algorithms (BFS, PageRank, SSSP and CC). On all the tested applications and

Rainbow vacua of colored higher-spin (A)dS_3 gravity

International Nuclear Information System (INIS)

Gwak, Seungho; Joung, Euihun; Mkrtchyan, Karapet; Rey, Soo-Jong

2016-01-01

We study the color-decoration of higher-spin (anti)-de Sitter gravity in three dimensions. We show that the rainbow vacua, which we found recently for the colored gravity theory, also pertain in the colored higher-spin theory. The color singlet spin-two plays the role of first fundamental form (metric). The difference is that when spontaneous breaking of color symmetry takes place, the Goldstone modes of massless spin-two combine with all other spins and become the maximal-depth partially massless fields of the highest spin in the theory, forming a Regge trajectory.

Spanning trees with many or few colors in edge-colored graphs

NARCIS (Netherlands)

Broersma, Haitze J.; Li, Xueliang; Li, Xueliang

1997-01-01

Given a graph G = (V,E) and a (not necessarily proper) edge-coloring of G, we consider the complexity of finding a spanning tree of G with as many different colors as possible, and of finding one with as few different colors as possible. We show that the first problem is equivalent to finding a

Properly colored connectivity of graphs

CERN Document Server

Li, Xueliang; Qin, Zhongmei

2018-01-01

A comprehensive survey of proper connection of graphs is discussed in this book with real world applications in computer science and network security. Beginning with a brief introduction, comprising relevant definitions and preliminary results, this book moves on to consider a variety of properties of graphs that imply bounds on the proper connection number. Detailed proofs of significant advancements toward open problems and conjectures are presented with complete references. Researchers and graduate students with an interest in graph connectivity and colorings will find this book useful as it builds upon fundamental definitions towards modern innovations, strategies, and techniques. The detailed presentation lends to use as an introduction to proper connection of graphs for new and advanced researchers, a solid book for a graduate level topics course, or as a reference for those interested in expanding and further developing research in the area.

Directed paths with few or many colors in colored directed graphs

NARCIS (Netherlands)

Li, X.; Li, Xueliang; Zhang, S.; Broersma, Haitze J.

2000-01-01

Given a graph $D=(V(D),A(D))$ and a coloring of $D$, not necessarily a proper coloring of either the arcs or the vertices of $D$, we consider the complexity of finding a path of $D$ from a given vertex $s$ to another given vertex $t$ with as few different colors as possible, and of finding one with

Perfect 3-colorings of the cubic graphs of order 10

Directory of Open Access Journals (Sweden)

Mehdi Alaeiyan

2017-10-01

Full Text Available Perfect coloring is a generalization of the notion of completely regular codes, given by Delsarte. A perfect m-coloring of a graph G with m colors is a partition of the vertex set of G into m parts A_1, A_2, ..., A_m such that, for all $ i,j \\in \\lbrace 1, ... , m \\rbrace $, every vertex of A_i is adjacent to the same number of vertices, namely, a_{ij} vertices, of A_j. The matrix $A=(a_{ij}_{i,j\\in \\lbrace 1,... ,m\\rbrace }$, is called the parameter matrix. We study the perfect 3-colorings (also known as the equitable partitions into three parts of the cubic graphs of order 10. In particular, we classify all the realizable parameter matrices of perfect 3-colorings for the cubic graphs of order 10.

One-sided interval edge-colorings of bipartite graphs

DEFF Research Database (Denmark)

Casselgren, Carl Johan; Toft, Bjarne

2016-01-01

Let G be a bipartite graph with parts X and Y . An X-interval coloring of G is a proper edge coloring of G by integers such that the colors on the edges incident to any vertex in X form an interval. Denote by χ′int(G,X) the minimum k such that G has an X-interval coloring with k colors. In this p...

Whole Genome Phylogenetic Tree Reconstruction using Colored de Bruijn Graphs

OpenAIRE

Lyman, Cole

2017-01-01

We present kleuren, a novel assembly-free method to reconstruct phylogenetic trees using the Colored de Bruijn Graph. kleuren works by constructing the Colored de Bruijn Graph and then traversing it, finding bubble structures in the graph that provide phylogenetic signal. The bubbles are then aligned and concatenated to form a supermatrix, from which a phylogenetic tree is inferred. We introduce the algorithm that kleuren uses to accomplish this task, and show its performance on reconstructin...

Coloring triangle-free graphs with fixed size

DEFF Research Database (Denmark)

Thomassen, Carsten; Gimbel, John

2000-01-01

Combining recent results on colorings and Ramsey theory, we show that if G is a triangle-free graph with e edges then the chromatic number of G is at most cel(1/3)(log e)(-2/3) for some constant c. In a previous paper, we found an upper bound on the chromatic number of a triangle-free graph of ge...

Perfect 2-colorings of the generalized Petersen graph

Indian Academy of Sciences (India)

It is obvious that GP(n, k) is a 3-regular connected graph. DEFINITION 2.2 ... vertex of color i, the number of its neighbors of color j is equal to aij . ... By the given conditions, we can see that a parameter matrix of a perfect 2-coloring of. GP(n, k) ...

Generating QCD amplitudes in the color-flow basis with MadGraph

International Nuclear Information System (INIS)

Hagiwara, Kaoru; Takaesu, Yoshitaro

2011-01-01

We propose to make use of the off-shell recursive relations with the color-flow decomposition in the calculation of QCD amplitudes on MadGraph. We introduce colored quarks and their interactions with nine gluons in the color-flow basis plus an Abelian gluon on MadGraph, such that it generates helicity amplitudes in the color-flow basis with off-shell recursive formulae for multi-gluon sub-amplitudes. We demonstrate calculations of up to 5-jet processes such as gg→5g, u anti u→5g and uu→uuggg. Although our demonstration is limited, it paves the way to evaluate amplitudes with more quark lines and gluons with MadGraph. (orig.)

Twin edge colorings of certain square graphs and product graphs

Directory of Open Access Journals (Sweden)

R Rajarajachozhan

2016-04-01

Full Text Available A twin edge $k\\!$-coloring of a graph $G$ is a proper edge $k$-coloring of $G$ with the elements of $\\mathbb{Z}_k$ so that the induced vertex $k$-coloring, in which the color of a vertex $v$ in $G$ is the sum in $\\mathbb{Z}_k$ of the colors of the edges incident with $v,$ is a proper vertex $k\\!$-coloring. The minimum $k$ for which $G$ has a twin edge $k\\!$-coloring is called the twin chromatic index of $G.$ Twin chromatic index of the square $P_n^2,$ $n\\ge 4,$ and the square $C_n^2,$ $n\\ge 6,$ are determined. In fact, the twin chromatic index of the square $C_7^2$ is $\\Delta+2,$ where $\\Delta$ is the maximum degree. Twin chromatic index of $C_m\\,\\Box\\,P_n$ is determined, where $\\Box$ denotes the Cartesian product. $C_r$ and $P_r$ are, respectively, the cycle, and the path on $r$ vertices each.

Three-coloring graphs with no induced seven-vertex path II : using a triangle

OpenAIRE

Chudnovsky, Maria; Maceli, Peter; Zhong, Mingxian

2015-01-01

In this paper, we give a polynomial time algorithm which determines if a given graph containing a triangle and no induced seven-vertex path is 3-colorable, and gives an explicit coloring if one exists. In previous work, we gave a polynomial time algorithm for three-coloring triangle-free graphs with no induced seven-vertex path. Combined, our work shows that three-coloring a graph with no induced seven-vertex path can be done in polynomial time.

MATHEMATICA APPLICATION FOR GRAPH COLORING AT THE INTERSECTION OF JALAN PANGERAN ANTASARI JAKARTA

Directory of Open Access Journals (Sweden)

Suwarno Suwarno

2017-12-01

Full Text Available This research examines about graph coloring using Welch-Powell algorithm. This research begins by trying to understand about graph coloring and its algorithm. The case study was conducted at the intersection of Pangeran Antasari Street. In the formation of graph obtained 12 vertices as traffic flow and 16 edges as traffic path. The results of this study obtained 4 chromatic numbers which describes 4 stages of traffic light arrangement. This paper also explains the application of Mathematica software in graph coloring.

Color normalization of histology slides using graph regularized sparse NMF

Science.gov (United States)

Sha, Lingdao; Schonfeld, Dan; Sethi, Amit

2017-03-01

Computer based automatic medical image processing and quantification are becoming popular in digital pathology. However, preparation of histology slides can vary widely due to differences in staining equipment, procedures and reagents, which can reduce the accuracy of algorithms that analyze their color and texture information. To re- duce the unwanted color variations, various supervised and unsupervised color normalization methods have been proposed. Compared with supervised color normalization methods, unsupervised color normalization methods have advantages of time and cost efficient and universal applicability. Most of the unsupervised color normaliza- tion methods for histology are based on stain separation. Based on the fact that stain concentration cannot be negative and different parts of the tissue absorb different stains, nonnegative matrix factorization (NMF), and particular its sparse version (SNMF), are good candidates for stain separation. However, most of the existing unsupervised color normalization method like PCA, ICA, NMF and SNMF fail to consider important information about sparse manifolds that its pixels occupy, which could potentially result in loss of texture information during color normalization. Manifold learning methods like Graph Laplacian have proven to be very effective in interpreting high-dimensional data. In this paper, we propose a novel unsupervised stain separation method called graph regularized sparse nonnegative matrix factorization (GSNMF). By considering the sparse prior of stain concentration together with manifold information from high-dimensional image data, our method shows better performance in stain color deconvolution than existing unsupervised color deconvolution methods, especially in keeping connected texture information. To utilized the texture information, we construct a nearest neighbor graph between pixels within a spatial area of an image based on their distances using heat kernal in lαβ space. The

Multicolored spanning subgraphs in G-colorings of complete graphs

International Nuclear Information System (INIS)

Akbari, S.; Zare, S.

2007-08-01

Let G = {g 1 , ..., g n } be a finite abelian group. Consider the complete graph with the vertex set {g 1 , ..., g n }}. The G-coloring of K n is a proper edge coloring in which the color of edge {g i , g j } is g i + g j , l ≤ i ≤ j ≤ n. We prove that in the G-coloring of the complete graph K n , there exists a multicolored Hamilton path if G is not an elementary abelian 2-group. Furthermore, we show that if n is odd, then the G-coloring of K n can be decomposed into multicolored 2-factors and if l r is the number of elements of order r in G, 3 ≤ r ≤ n. then there are exactly (l r )/2 multicolored r-uniform 2-factors in this decomposition. This provides a generalization of a recent result due to Constantine which states: For any prime number p > 2, there exists a proper edge coloring of K p which is decomposable into multicolored Hamilton cycles. (author)

Spectrum Graph Coloring and Applications to Wi-Fi Channel Assignment

Directory of Open Access Journals (Sweden)

David Orden

2018-03-01

Full Text Available We introduce and explore a family of vertex-coloring problems, which, surprisingly enough, have not been considered before despite stemming from the problem of Wi-Fi channel assignment. Given a spectrum of colors, endowed with a matrix of interferences between each pair of colors, the Threshold Spectrum Coloring problem fixes the number of colors available and aims to minimize the interference threshold, i.e., the maximum of the interferences at the vertices. Conversely, the Chromatic Spectrum Coloring problem fixes a threshold and aims to minimize the number of colors for which respecting that threshold is possible. As the main theoretical results, we prove tight upper bounds for the solutions to each problem. Since both problems turn out to be NP-hard, we complete the scene with experimental results. We propose a DSATUR-based heuristic and study its performance to minimize the maximum vertex interference in Wi-Fi channel assignment, both for randomly-generated graphs and for a real-world scenario. Further, for all these graphs, we experimentally check the goodness of the theoretical bounds.

The number of k-colorings of a graph on a fixed surface

DEFF Research Database (Denmark)

Thomassen, Carsten

2006-01-01

We prove that, for every fixed surface S, there exists a largest positive constant c such that every 5-colorable graph with n vertices on S has at least c center dot 2(n) distinct 5-colorings. This is best possible in the sense that, for each sufficiently large natural number n, there is a graph ...

A DNA Computing Model for the Graph Vertex Coloring Problem Based on a Probe Graph

Directory of Open Access Journals (Sweden)

Jin Xu

2018-02-01

Full Text Available The biggest bottleneck in DNA computing is exponential explosion, in which the DNA molecules used as data in information processing grow exponentially with an increase of problem size. To overcome this bottleneck and improve the processing speed, we propose a DNA computing model to solve the graph vertex coloring problem. The main points of the model are as follows: ① The exponential explosion problem is solved by dividing subgraphs, reducing the vertex colors without losing the solutions, and ordering the vertices in subgraphs; and ② the bio-operation times are reduced considerably by a designed parallel polymerase chain reaction (PCR technology that dramatically improves the processing speed. In this article, a 3-colorable graph with 61 vertices is used to illustrate the capability of the DNA computing model. The experiment showed that not only are all the solutions of the graph found, but also more than 99% of false solutions are deleted when the initial solution space is constructed. The powerful computational capability of the model was based on specific reactions among the large number of nanoscale oligonucleotide strands. All these tiny strands are operated by DNA self-assembly and parallel PCR. After thousands of accurate PCR operations, the solutions were found by recognizing, splicing, and assembling. We also prove that the searching capability of this model is up to O(359. By means of an exhaustive search, it would take more than 896 000 years for an electronic computer (5 × 1014 s−1 to achieve this enormous task. This searching capability is the largest among both the electronic and non-electronic computers that have been developed since the DNA computing model was proposed by Adleman’s research group in 2002 (with a searching capability of O(220. Keywords: DNA computing, Graph vertex coloring problem, Polymerase chain reaction

Deciding the On-line Chromatic Number of a Graph with Pre-coloring is PSPACE-complete

DEFF Research Database (Denmark)

Kudahl, Christian

2015-01-01

In an on-line coloring, the vertices of a graph are revealed one by one. An algorithm assigns a color to each vertex after it is revealed. When a vertex is revealed, it is also revealed which of the previous vertices it is adjacent to. The on-line chromatic number of a graph, G, is the smallest...... number of colors an algorithm will need when on-line-coloring G. The algorithm may know G, but not the order in which the vertices are revealed. The problem of determining if the on-line chromatic number of a graph is less than or equal to k, given a pre-coloring, is shown to be PSPACE-complete....

On interval and cyclic interval edge colorings of (3,5)-biregular graphs

DEFF Research Database (Denmark)

Casselgren, Carl Johan; Petrosyan, Petros; Toft, Bjarne

2017-01-01

A proper edge coloring f of a graph G with colors 1,2,3,…,t is called an interval coloring if the colors on the edges incident to every vertex of G form an interval of integers. The coloring f is cyclic interval if for every vertex v of G, the colors on the edges incident to v either form an inte...

The number of colorings of planar graphs with no separating triangles

DEFF Research Database (Denmark)

Thomassen, Carsten

2017-01-01

A classical result of Birkhoff and Lewis implies that every planar graph with . n vertices has at least . 152n-1 distinct 5-vertex-colorings. Equality holds for planar triangulations with . n-4 separating triangles. We show that, if a planar graph has no separating triangle, then it has at least ...

Coloring graphs from lists with bounded size of their union

Czech Academy of Sciences Publication Activity Database

Král´, D.; Sgall, Jiří

2005-01-01

Roč. 49, č. 3 (2005), s. 177-186 ISSN 0364-9024 R&D Projects: GA ČR(CZ) GA201/01/1195; GA MŠk(CZ) LN00A056 Institutional research plan: CEZ:AV0Z10190503 Keywords : graph coloring * list coloring Subject RIV: BA - General Mathematics Impact factor: 0.319, year: 2005

Relating 2-Rainbow Domination To Roman Domination

Directory of Open Access Journals (Sweden)

Alvarado José D.

2017-11-01

Full Text Available For a graph G, let R(G and yr2(G denote the Roman domination number of G and the 2-rainbow domination number of G, respectively. It is known that yr2(G ≤ R(G ≤ 3/2yr2(G. Fujita and Furuya [Difference between 2-rainbow domination and Roman domination in graphs, Discrete Appl. Math. 161 (2013 806-812] present some kind of characterization of the graphs G for which R(G − yr2(G = k for some integer k. Unfortunately, their result does not lead to an algorithm that allows to recognize these graphs efficiently. We show that for every fixed non-negative integer k, the recognition of the connected K4-free graphs G with yR(G − yr2(G = k is NP-hard, which implies that there is most likely no good characterization of these graphs. We characterize the graphs G such that yr2(H = yR(H for every induced subgraph H of G, and collect several properties of the graphs G with R(G = 3/2yr2(G.

Study of Chromatic parameters of Line, Total, Middle graphs and Graph operators of Bipartite graph

Science.gov (United States)

Nagarathinam, R.; Parvathi, N.

2018-04-01

Chromatic parameters have been explored on the basis of graph coloring process in which a couple of adjacent nodes receives different colors. But the Grundy and b-coloring executes maximum colors under certain restrictions. In this paper, Chromatic, b-chromatic and Grundy number of some graph operators of bipartite graph has been investigat

A CLASSIFIER SYSTEM USING SMOOTH GRAPH COLORING

Directory of Open Access Journals (Sweden)

JORGE FLORES CRUZ

2017-01-01

Full Text Available Unsupervised classifiers allow clustering methods with less or no human intervention. Therefore it is desirable to group the set of items with less data processing. This paper proposes an unsupervised classifier system using the model of soft graph coloring. This method was tested with some classic instances in the literature and the results obtained were compared with classifications made with human intervention, yielding as good or better results than supervised classifiers, sometimes providing alternative classifications that considers additional information that humans did not considered.

A HYBRID ALGORITHM FOR THE ROBUST GRAPH COLORING PROBLEM

Directory of Open Access Journals (Sweden)

Román Anselmo Mora Gutiérrez

2016-08-01

Full Text Available A hybridalgorithm which combines mathematical programming techniques (Kruskal’s algorithm and the strategy of maintaining arc consistency to solve constraint satisfaction problem “CSP” and heuristic methods (musical composition method and DSATUR to resolve the robust graph coloring problem (RGCP is proposed in this paper. Experimental result shows that this algorithm is better than the other algorithms presented on the literature.

Fabrication of digital rainbow holograms and 3-D imaging using SEM based e-beam lithography.

Science.gov (United States)

Firsov, An; Firsov, A; Loechel, B; Erko, A; Svintsov, A; Zaitsev, S

2014-11-17

Here we present an approach for creating full-color digital rainbow holograms based on mixing three basic colors. Much like in a color TV with three luminescent points per single screen pixel, each color pixel of initial image is presented by three (R, G, B) distinct diffractive gratings in a hologram structure. Change of either duty cycle or area of the gratings are used to provide proper R, G, B intensities. Special algorithms allow one to design rather complicated 3D images (that might even be replacing each other with hologram rotation). The software developed ("RainBow") provides stability of colorization of rotated image by means of equalizing of angular blur from gratings responsible for R, G, B basic colors. The approach based on R, G, B color synthesis allows one to fabricate gray-tone rainbow hologram containing white color what is hardly possible in traditional dot-matrix technology. Budgetary electron beam lithography based on SEM column was used to fabricate practical examples of digital rainbow hologram. The results of fabrication of large rainbow holograms from design to imprinting are presented. Advantages of the EBL in comparison to traditional optical (dot-matrix) technology is considered.

Multiscale weighted colored graphs for protein flexibility and rigidity analysis

Science.gov (United States)

Bramer, David; Wei, Guo-Wei

2018-02-01

Protein structural fluctuation, measured by Debye-Waller factors or B-factors, is known to correlate to protein flexibility and function. A variety of methods has been developed for protein Debye-Waller factor prediction and related applications to domain separation, docking pose ranking, entropy calculation, hinge detection, stability analysis, etc. Nevertheless, none of the current methodologies are able to deliver an accuracy of 0.7 in terms of the Pearson correlation coefficients averaged over a large set of proteins. In this work, we introduce a paradigm-shifting geometric graph model, multiscale weighted colored graph (MWCG), to provide a new generation of computational algorithms to significantly change the current status of protein structural fluctuation analysis. Our MWCG model divides a protein graph into multiple subgraphs based on interaction types between graph nodes and represents the protein rigidity by generalized centralities of subgraphs. MWCGs not only predict the B-factors of protein residues but also accurately analyze the flexibility of all atoms in a protein. The MWCG model is validated over a number of protein test sets and compared with many standard methods. An extensive numerical study indicates that the proposed MWCG offers an accuracy of over 0.8 and thus provides perhaps the first reliable method for estimating protein flexibility and B-factors. It also simultaneously predicts all-atom flexibility in a molecule.

Rainbow paths with prescribed ends

DEFF Research Database (Denmark)

Alishahi, Meysam; Taherkhani, Ali; Thomassen, Carsten

2011-01-01

vertices. We also prove that every connected graph with atleast one edge has a proper k-coloring (for some k) such that every vertex of color i has a neighbor of color i + 1 (mod k). C-5 shows that k may have to be greater than the chromatic number. However, if the graph is connected, infinite and locally...... finite, and has finite chromatic number, then the k-coloring exists for every k >= chi(G). In fact, the k-coloring can be chosen such that every vertex is a starting vertex of an infinite path such that the color increases by 1 (mod k) along each edge. The method is based on the circular chromatic number...... chi(c)(G). In particular, we verify the above conjecture for all connected graphs whose circular chromatic number equals the chromatic number....

Total dominator chromatic number of a graph

Directory of Open Access Journals (Sweden)

Adel P. Kazemi

2015-06-01

Full Text Available Given a graph $G$, the total dominator coloring problem seeks a proper coloring of $G$ with the additional property that every vertex in the graph is adjacent to all vertices of a color class. We seek to minimize the number of color classes. We initiate to study this problem on several classes of graphs, as well as finding general bounds and characterizations. We also compare the total dominator chromatic number of a graph with the chromatic number and the total domination number of it.

The Rainbow Sky

CERN Document Server

Buick, Tony

2010-01-01

The world is full of color, from the blue ocean and the yellow daffodils and sunflowers in green carpeted meadows to the majestic purple mountains in the distance and brightly hued coral reefs off the edges of tropical coasts. But what is color, exactly? Why do we see things in different colors? Do we all see the same colors? Like the surface of our planet, the sky above us offers us an endless palette of color, a visual feast for the eyes. Besides atmospheric phenomena such as sunsets and rainbows, there are the many varied worlds of the Solar System, which we can spy through our telescopes, with their subtle colorings of beige and blue and green. Faraway star systems have suns that come in shades ranging from red and yellow to blue and white. Scientists even often use "false colors" to enhance the features of images they take of structures, such as the rings of Saturn and Jupiter’s clouds. This book, with its clear explanations of what makes the sky such a colorful place and in its great wealth of picture...

Coloring mixed hypergraphs

CERN Document Server

Voloshin, Vitaly I

2002-01-01

The theory of graph coloring has existed for more than 150 years. Historically, graph coloring involved finding the minimum number of colors to be assigned to the vertices so that adjacent vertices would have different colors. From this modest beginning, the theory has become central in discrete mathematics with many contemporary generalizations and applications. Generalization of graph coloring-type problems to mixed hypergraphs brings many new dimensions to the theory of colorings. A main feature of this book is that in the case of hypergraphs, there exist problems on both the minimum and th

Modeling Software Evolution using Algebraic Graph Rewriting

NARCIS (Netherlands)

Ciraci, Selim; van den Broek, Pim

We show how evolution requests can be formalized using algebraic graph rewriting. In particular, we present a way to convert the UML class diagrams to colored graphs. Since changes in software may effect the relation between the methods of classes, our colored graph representation also employs the

Upper bound for the span of pencil graph

Science.gov (United States)

Parvathi, N.; Vimala Rani, A.

2018-04-01

An L(2,1)-Coloring or Radio Coloring or λ coloring of a graph is a function f from the vertex set V(G) to the set of all nonnegative integers such that |f(x) ‑ f(y)| ≥ 2 if d(x,y) = 1 and |f(x) ‑ f(y)| ≥ 1 if d(x,y)=2, where d(x,y) denotes the distance between x and y in G. The L(2,1)-coloring number or span number λ(G) of G is the smallest number k such that G has an L(2,1)-coloring with max{f(v) : v ∈ V(G)} = k. [2]The minimum number of colors used in L(2,1)-coloring is called the radio number rn(G) of G (Positive integer). Griggs and yeh conjectured that λ(G) ≤ Δ2 for any simple graph with maximum degree Δ>2. In this article, we consider some special graphs like, n-sunlet graph, pencil graph families and derive its upper bound of (G) and rn(G).

Transforming White Light into Rainbows: Segmentation Strategies for Successful School Tax Elections

Science.gov (United States)

Senden, J. Bradford; Lifto, Don E.

2009-01-01

In the late 1600s, British physicist Sir Isaac Newton first demonstrated refraction and dispersion in a triangular prism. He discovered that a prism could decompose white light into a spectrum. Hold a prism up to the light at the correct angle and white light magically splits into vivid colors of the rainbow! So what do prisms and rainbows have to…

The chromatic polynomial and list colorings

DEFF Research Database (Denmark)

Thomassen, Carsten

2009-01-01

We prove that, if a graph has a list of k available colors at every vertex, then the number of list-colorings is at least the chromatic polynomial evaluated at k when k is sufficiently large compared to the number of vertices of the graph.......We prove that, if a graph has a list of k available colors at every vertex, then the number of list-colorings is at least the chromatic polynomial evaluated at k when k is sufficiently large compared to the number of vertices of the graph....

News from Online: A Spectrum of Color

Science.gov (United States)

Sweeney Judd, Carolyn

1999-06-01

Thomas Chasteen's site ( http://www.shsu.edu/~chm_tgc/sounds/sound.html) shows how to separate colors using a tuneable monochromator. This graphic comes from his monochromator animation ( http://www.shsu.edu/~chemistry/monochromator/mono.gif). Science Media's site ( http://www.scimedia.com/index.html#scimedia) includes spectroscopy tutorials by Brian Tissue. This graphic can be found at http://www.scimedia.com/chem-ed/light/graphics/em-rad.gif (©1998 B. M. Tissue, www.scimedia.com). All the colors in the rainbow! Now that is a good place to start. Go to About Rainbows ( http://www.unidata.ucar.edu/staff/blynds/rnbw.html), a tutorial from astronomer Beverly Lynds, working with the University Corporation for Atmospheric Research. The tutorial begins with a historical perspective, complete with a sketch by René Descartes in 1637. The bibliography makes this tutorial a good starting point for color exploration. About Rainbows brings you questions to explorefor example, "What happens when you look at a rainbow through dark glasses?" Try the links to these other sites. Project SkyMath: Making Mathematical Connections ( http://www.unidata.ucar.edu/staff/blynds/Skymath.html) is especially for the middle school student. Reproducible masters of these teaching modules can be printed in English and Spanish. From Project SkyMath, you can go to Blue-Skies, a user-friendly graphical interface from The Weather Underground at the University of Michigan ( http://groundhog.sprl.umich.edu/BS.html). And speaking of blue skies, look at a great site, Why is the Sky Blue at http://acept.la.asu.edu/PiN/act/sky/sky.shtml. This is a super site from the Arizona Collaborative for Excellence in the Preparation of Teachers, by the Department of Physics and Astronomy at Arizona State University. If you go to Patterns in Nature: Light and Optics at http://acept.la.asu.edu/PiN/act/activities.shtml, plan to spend some time, for it is wonderful. Another link from the About Rainbows tutorial goes to

Several classes of graphs and their r-dynamic chromatic numbers

Science.gov (United States)

Dafik; Meganingtyas, D. E. W.; Dwidja Purnomo, K.; Dicky Tarmidzi, M.; Hesti Agustin, Ika

2017-06-01

Let G be a simple, connected and undirected graph. Let r, k be natural numbers. By a proper k-coloring of a graph G, we mean a map c : V (G) → S, where |S| = k, such that any two adjacent vertices receive different colors. An r-dynamic k-coloring is a proper k-coloring c of G such that |c(N(v))| ≥ min{r, d(v)} for each vertex v in V (G), where N(v) is the neighborhood of v and c(S) = {c(v) : v ∈ S} for a vertex subset S. The r-dynamic chromatic number, written as χ r (G), is the minimum k such that G has an r-dynamic k-coloring. By simple observation it is easy to see that χ r (G) ≤ χ r+1(G), however χ r+1(G) - χ r (G) does not always show a small difference for any r. Thus, finding an exact value of χ r (G) is significantly useful. In this paper, we will study some of them especially when G are prism graph, three-cyclical ladder graph, joint graph and circulant graph.

The b-chromatic number of power graphs

Directory of Open Access Journals (Sweden)

Brice Effantin

2003-06-01

Full Text Available The b-chromatic number of a graph G is defined as the maximum number k of colors that can be used to color the vertices of G, such that we obtain a proper coloring and each color i, with 1 ≤ i≤ k, has at least one representant x i adjacent to a vertex of every color j, 1 ≤ j ≠ i ≤ k. In this paper, we discuss the b-chromatic number of some power graphs. We give the exact value of the b-chromatic number of power paths and power complete binary trees, and we bound the b-chromatic number of power cycles.

A faithful functor among algebras and graphs

OpenAIRE

Falcón Ganfornina, Óscar Jesús; Falcón Ganfornina, Raúl Manuel; Núñez Valdés, Juan; Pacheco Martínez, Ana María; Villar Liñán, María Trinidad; Vigo Aguiar, Jesús (Coordinador)

2016-01-01

The problem of identifying a functor between the categories of algebras and graphs is currently open. Based on a known algorithm that identifies isomorphisms of Latin squares with isomorphism of vertex-colored graphs, we describe here a pair of graphs that enable us to find a faithful functor between finite-dimensional algebras over finite fields and these graphs.

On 4-critical t-perfect graphs

OpenAIRE

Benchetrit, Yohann

2016-01-01

It is an open question whether the chromatic number of $t$-perfect graphs is bounded by a constant. The largest known value for this parameter is 4, and the only example of a 4-critical $t$-perfect graph, due to Laurent and Seymour, is the complement of the line graph of the prism $\\Pi$ (a graph is 4-critical if it has chromatic number 4 and all its proper induced subgraphs are 3-colorable). In this paper, we show a new example of a 4-critical $t$-perfect graph: the complement of the line gra...

Every plane graph of maximum degree 8 has an edge-face 9-colouring.

NARCIS (Netherlands)

R.J. Kang (Ross); J.-S. Sereni; M. Stehlík

2011-01-01

textabstractAn edge-face coloring of a plane graph with edge set $E$ and face set $F$ is a coloring of the elements of $E\\cup F$ such that adjacent or incident elements receive different colors. Borodin proved that every plane graph of maximum degree $\\Delta \\ge 10$ can be edge-face colored with

A new characterization of trivially perfect graphs

Directory of Open Access Journals (Sweden)

Christian Rubio Montiel

2015-03-01

Full Text Available A graph $G$ is \\emph{trivially perfect} if for every induced subgraph the cardinality of the largest set of pairwise nonadjacent vertices (the stability number $\\alpha(G$ equals the number of (maximal cliques $m(G$. We characterize the trivially perfect graphs in terms of vertex-coloring and we extend some definitions to infinite graphs.

Rainbow Particle Imaging Velocimetry

KAUST Repository

Xiong, Jinhui

2017-04-27

Despite significant recent progress, dense, time-resolved imaging of complex, non-stationary 3D flow velocities remains an elusive goal. This work tackles this problem by extending an established 2D method, Particle Imaging Velocimetry, to three dimensions by encoding depth into color. The encoding is achieved by illuminating the flow volume with a continuum of light planes (a “rainbow”), such that each depth corresponds to a specific wavelength of light. A diffractive component in the camera optics ensures that all planes are in focus simultaneously. With this setup, a single color camera is sufficient to track 3D trajectories of particles by combining 2D spatial and 1D color information. For reconstruction, this thesis derives an image formation model for recovering stationary 3D particle positions. 3D velocity estimation is achieved with a variant of 3D optical flow that accounts for both physical constraints as well as the rainbow image formation model. The proposed method is evaluated by both simulations and an experimental prototype setup.

Modern graph theory

CERN Document Server

Bollobás, Béla

1998-01-01

The time has now come when graph theory should be part of the education of every serious student of mathematics and computer science, both for its own sake and to enhance the appreciation of mathematics as a whole. This book is an in-depth account of graph theory, written with such a student in mind; it reflects the current state of the subject and emphasizes connections with other branches of pure mathematics. The volume grew out of the author's earlier book, Graph Theory -- An Introductory Course, but its length is well over twice that of its predecessor, allowing it to reveal many exciting new developments in the subject. Recognizing that graph theory is one of several courses competing for the attention of a student, the book contains extensive descriptive passages designed to convey the flavor of the subject and to arouse interest. In addition to a modern treatment of the classical areas of graph theory such as coloring, matching, extremal theory, and algebraic graph theory, the book presents a detailed ...

The chromatic number of a graph of girth 5 on a fixed surface

DEFF Research Database (Denmark)

Thomassen, Carsten

2003-01-01

We prove a color extension result implying that, for every fixed surface S, there are only finitely many 4-color-critical graphs of girth 5 on S. The result is best possible in the sense that there are infinitely many 4-color-critical graphs of girth 4 on S, except when S is the sphere, As a cons......, As a consequence, the chromatic number of graphs of girth 5 on S can be found in polynomial time....

A short list color proof of Grotzsch's theorem

DEFF Research Database (Denmark)

Thomassen, Carsten

2000-01-01

We give a short proof of the result that every planar graph of girth $5$is $3$-choosable and hence also of Gr\\"{o}tzsch's theorem saying that everyplanar triangle-free graph is $3$-colorable.......We give a short proof of the result that every planar graph of girth $5$is $3$-choosable and hence also of Gr\\"{o}tzsch's theorem saying that everyplanar triangle-free graph is $3$-colorable....

Planar graphs theory and algorithms

CERN Document Server

Nishizeki, T

1988-01-01

Collected in this volume are most of the important theorems and algorithms currently known for planar graphs, together with constructive proofs for the theorems. Many of the algorithms are written in Pidgin PASCAL, and are the best-known ones; the complexities are linear or 0(nlogn). The first two chapters provide the foundations of graph theoretic notions and algorithmic techniques. The remaining chapters discuss the topics of planarity testing, embedding, drawing, vertex- or edge-coloring, maximum independence set, subgraph listing, planar separator theorem, Hamiltonian cycles, and single- or multicommodity flows. Suitable for a course on algorithms, graph theory, or planar graphs, the volume will also be useful for computer scientists and graph theorists at the research level. An extensive reference section is included.

The Return of Rainbow Diet Pills

Science.gov (United States)

Cohen, Pieter A.; Goday, Alberto; Swann, John P.

2012-01-01

The US Food and Drug Administration (FDA) has recently warned consumers about the risks of weight loss supplements adulterated with multiple pharmaceutical agents. Some of these supplements combine potent anorectics, such as amphetamines derivatives, with benzodiazepines, beta-blockers, and other medications to suppress the anorectics’ adverse effects. These weight loss supplements represent the most recent generation of rainbow diet pills, named for their bright and varied colors, which date back more than 70 years. Beginning in the 1940s, several US pharmaceutical firms aggressively promoted rainbow pills to physicians and patients. By the 1960s the pills had caused dozens of deaths before the FDA began removing them from the US market. We used a variety of original resources to trace these deadly pills from their origins in the United States to their popularity in Spain and Brazil to their reintroduction to the United States as weight loss dietary supplements. PMID:22813089

Graphs with Eulerian unit spheres

OpenAIRE

Knill, Oliver

2015-01-01

d-spheres in graph theory are inductively defined as graphs for which all unit spheres S(x) are (d-1)-spheres and that the removal of one vertex renders the graph contractible. Eulerian d-spheres are geometric d-spheres which are d+1 colorable. We prove here that G is an Eulerian sphere if and only if the degrees of all the (d-2)-dimensional sub-simplices in G are even. This generalizes a Kempe-Heawood result for d=2 and is work related to the conjecture that all d-spheres have chromatic numb...

On the local edge antimagicness of m-splitting graphs

Science.gov (United States)

Albirri, E. R.; Dafik; Slamin; Agustin, I. H.; Alfarisi, R.

2018-04-01

Let G be a connected and simple graph. A split graph is a graph derived by adding new vertex v‧ in every vertex v‧ such that v‧ adjacent to v in graph G. An m-splitting graph is a graph which has m v‧-vertices, denoted by mSpl(G). A local edge antimagic coloring in G = (V, E) graph is a bijection f:V (G)\\to \\{1,2,3,\\ldots,|V(G)|\\} in which for any two adjacent edges e 1 and e 2 satisfies w({e}1)\

Graphs of groups on surfaces interactions and models

CERN Document Server

White, AT

2001-01-01

The book, suitable as both an introductory reference and as a text book in the rapidly growing field of topological graph theory, models both maps (as in map-coloring problems) and groups by means of graph imbeddings on sufaces. Automorphism groups of both graphs and maps are studied. In addition connections are made to other areas of mathematics, such as hypergraphs, block designs, finite geometries, and finite fields. There are chapters on the emerging subfields of enumerative topological graph theory and random topological graph theory, as well as a chapter on the composition of English

Efficient Algorithmic Frameworks via Structural Graph Theory

Science.gov (United States)

2016-10-28

constant. For example, they measured that, on large samples of the entire network, the Amazon graph has average degree 17.7, the Facebook graph has average...department heads’ opinions of departments, and generally lack transparency and well-defined measures . On the other hand, the National Research Council (the...Efficient and practical resource block allocation for LTE -based D2D network via graph coloring. Wireless Networks 20(4): 611-624 (2014) 50. Hossein

Fractional graph theory a rational approach to the theory of graphs

CERN Document Server

Scheinerman, Edward R

2013-01-01

A unified treatment of the most important results in the study of fractional graph concepts, this volume explores the various ways in which integer-valued concepts can be modified to derive nonintegral values. It begins with the general fractional theory of hypergraphs and presents in-depth coverage of fundamental and advanced topics. Subjects include fractional matching, fractional coloring, fractional edge coloring, fractional arboricity via matroid methods, and fractional isomorphism. The final chapter examines additional topics such as fractional domination, fractional intersection numbers

Nonsingular rainbow universes

Energy Technology Data Exchange (ETDEWEB)

Awad, Adel; Ali, Ahmed Farag [Center for Theoretical Physics, Zewail City of Science and Technology, Giza, 12588 (Egypt); Majumder, Barun, E-mail: aawad@zewailcity.edu.eg, E-mail: ahmed.ali@fsc.bu.edu.eg, E-mail: barunbasanta@iitgn.ac.in [Indian Institute of Technology Gandhinagar, Ahmedabad, Gujarat 382424 (India)

2013-10-01

In this work, we study FRW cosmologies in the context of gravity rainbow. We discuss the general conditions for having a nonsingular FRW cosmology in gravity rainbow. We propose that gravity rainbow functions can be fixed using two known modified dispersion relation (MDR), which have been proposed in literature. The first MDR was introduced by Amelino-Camelia, et el. in [9] and the second was introduced by Magueijo and Smolin in [24]. Studying these FRW-like cosmologies, after fixing the gravity rainbow functions, leads to nonsingular solutions which can be expressed in exact forms.

A first generation integrated physical and genetic map of the rainbow trout genome

Science.gov (United States)

The rainbow trout physical map was previously constructed from DNA fingerprinting of 192,096 BAC clones using the 4-color high-information content fingerprinting (HICF) method. The clones were assembled into physical map contigs using the finger-printing contig (FPC) program. The map is composed of ...

A short list color proof of Grötzsch's theorem

DEFF Research Database (Denmark)

Thomassen, Carsten

2003-01-01

We give a short proof of the result that every planar graph of girth 5 is 3-choosable and hence also of Grotzsch's theorem saying that every planar triangle-free graph is 3-colorable.......We give a short proof of the result that every planar graph of girth 5 is 3-choosable and hence also of Grotzsch's theorem saying that every planar triangle-free graph is 3-colorable....

Realizable Triples in Dominator Colorings

National Research Council Canada - National Science Library

Fletcher, Douglas M

2007-01-01

Given a graph G and its vertex set V(G), the chromatic number, Chi(G), represents the minimum number of colors required to color the vertices of G so that no two adjacent vertices have the same color...

A simple proof of orientability in colored group field theory.

Science.gov (United States)

Caravelli, Francesco

2012-01-01

Group field theory is an emerging field at the boundary between Quantum Gravity, Statistical Mechanics and Quantum Field Theory and provides a path integral for the gluing of n-simplices. Colored group field theory has been introduced in order to improve the renormalizability of the theory and associates colors to the faces of the simplices. The theory of crystallizations is instead a field at the boundary between graph theory and combinatorial topology and deals with n-simplices as colored graphs. Several techniques have been introduced in order to study the topology of the pseudo-manifold associated to the colored graph. Although of the similarity between colored group field theory and the theory of crystallizations, the connection between the two fields has never been made explicit. In this short note we use results from the theory of crystallizations to prove that color in group field theories guarantees orientability of the piecewise linear pseudo-manifolds associated to each graph generated perturbatively. Colored group field theories generate orientable pseudo-manifolds. The origin of orientability is the presence of two interaction vertices in the action of colored group field theories. In order to obtain the result, we made the connection between the theory of crystallizations and colored group field theory.

Developing and evaluating Quilts for the depiction of large layered graphs.

Science.gov (United States)

Bae, Juhee; Watson, Ben

2011-12-01

Traditional layered graph depictions such as flow charts are in wide use. Yet as graphs grow more complex, these depictions can become difficult to understand. Quilts are matrix-based depictions for layered graphs designed to address this problem. In this research, we first improve Quilts by developing three design alternatives, and then compare the best of these alternatives to better-known node-link and matrix depictions. A primary weakness in Quilts is their depiction of skip links, links that do not simply connect to a succeeding layer. Therefore in our first study, we compare Quilts using color-only, text-only, and mixed (color and text) skip link depictions, finding that path finding with the color-only depiction is significantly slower and less accurate, and that in certain cases, the mixed depiction offers an advantage over the text-only depiction. In our second study, we compare Quilts using the mixed depiction to node-link diagrams and centered matrices. Overall results show that users can find paths through graphs significantly faster with Quilts (46.6 secs) than with node-link (58.3 secs) or matrix (71.2 secs) diagrams. This speed advantage is still greater in large graphs (e.g. in 200 node graphs, 55.4 secs vs. 71.1 secs for node-link and 84.2 secs for matrix depictions). © 2011 IEEE

Strong oriented chromatic number of planar graphs without short cycles

Directory of Open Access Journals (Sweden)

Mickaël Montassier

2008-01-01

Full Text Available Let M be an additive abelian group. A strong oriented coloringof an oriented graph G is a mapping φ from V(G to M such that (1 φ(u ≠ φ(v whenever uv is an arc in G and (2 φ(v - φ(u ≠ -(φ(t - φ(z whenever uv and zt are two arcs in G. We say that G has a M-strong-oriented coloring. The strong oriented chromatic number of an oriented graph, denoted by χ s (G, is the minimal order of a group M, such that G has M-strong-oriented coloring. This notion was introduced by Nešetřil and Raspaud. In this paper, we pose the following problem: Let i ≥ 4 be an integer. Let G be an oriented planar graph without cycles of lengths 4 to i. Which is the strong oriented chromatic number of G ? Our aim is to determine the impact of triangles on the strong oriented coloring. We give some hints of answers to this problem by proving that: (1 the strong oriented chromatic number of any oriented planar graph without cycles of lengths 4 to 12 is at most 7, and (2 the strong oriented chromatic number of any oriented planar graph without cycles of length 4 or 6 is at most 19.

Chinese Postman Problem on edge-colored multigraphs

DEFF Research Database (Denmark)

Gutin, Gregory; Jones, Mark; Sheng, Bin

2017-01-01

It is well-known that the Chinese Postman Problem on undirected and directed graphs is polynomial-time solvable. We extend this result to edge-colored multigraphs. Our result is in sharp contrast to the Chinese Postman Problem on mixed graphs, i.e., graphs with directed and undirected edges, for ...

Human Colors-The Rainbow Garden of Pathology: What Gives Normal and Pathologic Tissues Their Color?

Science.gov (United States)

Piña-Oviedo, Sergio; Ortiz-Hidalgo, Carlos; Ayala, Alberto G

2017-03-01

- Colors are important to all living organisms because they are crucial for camouflage and protection, metabolism, sexual behavior, and communication. Human organs obviously have color, but the underlying biologic processes that dictate the specific colors of organs and tissues are not completely understood. A literature search on the determinants of color in human organs yielded scant information. - To address 2 specific questions: (1) why do human organs have color, and (2) what gives normal and pathologic tissues their distinctive colors? - Endogenous colors are the result of complex biochemical reactions that produce biologic pigments: red-brown cytochromes and porphyrins (blood, liver, spleen, kidneys, striated muscle), brown-black melanins (skin, appendages, brain nuclei), dark-brown lipochromes (aging organs), and colors that result from tissue structure (tendons, aponeurosis, muscles). Yellow-orange carotenes that deposit in lipid-rich tissues are only produced by plants and are acquired from the diet. However, there is lack of information about the cause of color in other organs, such as the gray and white matter, neuroendocrine organs, and white tissues (epithelia, soft tissues). Neoplastic tissues usually retain the color of their nonneoplastic counterpart. - Most available information on the function of pigments comes from studies in plants, microorganisms, cephalopods, and vertebrates, not humans. Biologic pigments have antioxidant and cytoprotective properties and should be considered as potential future therapies for disease and cancer. We discuss the bioproducts that may be responsible for organ coloration and invite pathologists and pathology residents to look at a "routine grossing day" with a different perspective.

Probabilistic Cash Flow-Based Optimal Investment Timing Using Two-Color Rainbow Options Valuation for Economic Sustainability Appraisement

Directory of Open Access Journals (Sweden)

Yonggu Kim

2017-10-01

Full Text Available This research determines the optimal investment timing using real options valuation to support decision-making for economic sustainability assessment. This paper illustrates an option pricing model using the Black-Scholes model applied to a case project to understand the model performance. Applicability of the project to the model requires two Monte Carlo simulations to satisfy a Markov process and a Wiener process. The position of project developers is not only the seller of products, but it is also the buyer of raw materials. Real options valuation can be influenced by the volatility of cash outflow, as well as the volatility of cash inflow. This study suggests two-color rainbow options valuation to overcome this issue, which is demonstrated for a steel plant project. The asymmetric results of the case study show that cash outflow (put option influences the value of the steel plant project more than cash inflow (call option does of which the discussion of the results is referred to a sensitivity analysis. The real options valuation method proposed in this study contributes to the literature on applying the new model, taking into consideration that investors maximize project profitability for economic sustainable development.

On the r-dynamic chromatic number of the corronation by complete graph

Science.gov (United States)

Indah Kristiana, Arika; Imam Utoyo, M.; Dafik

2018-04-01

In this paper we will study the r-dynamic chromatic number of the coronation by complete graph. A proper k-coloring of graph G such that the neighbors of any vertex v receive at least min{r, d(v)} different colors. The r-dynamic chromatic number, χ r (G) is the minimum k such that graph G has an r-dynamic k-coloring. We will obtain lower bound of the r-dynamic chromatic number of {χ }r({K}nȯ H), and {χ }r(Hȯ {K}m) We also study the exact value of the r-dynamic chromatic number of {χ }r({K}nȯ {S}m),{χ }r({K}nȯ {F}m),{χ }r({S}nȯ {K}m),{χ }r({F}nȯ {K}m) and {χ }r({K}nȯ {K}m) for m, n > 3.

On Complexity of Flooding Games on Graphs with Interval Representations

OpenAIRE

Fukui, Hiroyuki; Otachi, Yota; Uehara, Ryuhei; Uno, Takeaki; Uno, Yushi

2012-01-01

The flooding games, which are called Flood-It, Mad Virus, or HoneyBee, are a kind of coloring games and they have been becoming popular online. In these games, each player colors one specified cell in his/her turn, and all connected neighbor cells of the same color are also colored by the color. This flooding or coloring spreads on the same color cells. It is natural to consider these new coloring games on more general boards, or general graphs. Recently, computational complexities of the var...

Approximate Computing Techniques for Iterative Graph Algorithms

Energy Technology Data Exchange (ETDEWEB)

Panyala, Ajay R.; Subasi, Omer; Halappanavar, Mahantesh; Kalyanaraman, Anantharaman; Chavarria Miranda, Daniel G.; Krishnamoorthy, Sriram

2017-12-18

Approximate computing enables processing of large-scale graphs by trading off quality for performance. Approximate computing techniques have become critical not only due to the emergence of parallel architectures but also the availability of large scale datasets enabling data-driven discovery. Using two prototypical graph algorithms, PageRank and community detection, we present several approximate computing heuristics to scale the performance with minimal loss of accuracy. We present several heuristics including loop perforation, data caching, incomplete graph coloring and synchronization, and evaluate their efficiency. We demonstrate performance improvements of up to 83% for PageRank and up to 450x for community detection, with low impact of accuracy for both the algorithms. We expect the proposed approximate techniques will enable scalable graph analytics on data of importance to several applications in science and their subsequent adoption to scale similar graph algorithms.

In search of the rainbow: Colored inks in surgical pathology

Directory of Open Access Journals (Sweden)

Chandralekha Tampi

2012-01-01

Full Text Available Introduction: Although surgical pathologists are aware of the multiple advantages that coloured inks contribute to surgical pathology practice, these coloured inks are not available in India and importing them is not a viable proposition. A systematic search for locally available coloring agents was done, and resulted in identifying specific shades within a popular set of children′s hobby colors of a particular brand. They retain their bright distinct colors on paraffin blocks and sections. These paints are available all over India, and are cheap, safe, and easy to use. Coloring gross specimen excision margins with different colors, adds precision to margin examination. It allows three-dimensional microscopic reconstruction of the tumor vis-a-vis its various neighboring anatomic structures. It allows postoperative comparison of tissue planes predicted by preoperative imaging. It maintains orientation of grossed and dissected specimens, enabling the pathologist to re-visit the grossed specimen, if required, and confidently allows further sampling if necessary. Aim: A systematic search for indigenous coloring agents was carried out, which included the dyes used in the histopathology laboratory, gelatin, commercially available paints, including acrylic paints and inks. Results: The study identified specific shades within a brand of acrylic colors that are easily available and simple to use, with good results on microscopic examination. Conclusion: Colored inks lend precision to margin examination. A set of easily procurable colors are available in our country, which are easy to use, with distinct bright colors, safe, and reliable.

Parallel algorithms for finding cliques in a graph

International Nuclear Information System (INIS)

Szabo, S

2011-01-01

A clique is a subgraph in a graph that is complete in the sense that each two of its nodes are connected by an edge. Finding cliques in a given graph is an important procedure in discrete mathematical modeling. The paper will show how concepts such as splitting partitions, quasi coloring, node and edge dominance are related to clique search problems. In particular we will discuss the connection with parallel clique search algorithms. These concepts also suggest practical guide lines to inspect a given graph before starting a large scale search.

Skin Segmentation Based on Graph Cuts

Institute of Scientific and Technical Information of China (English)

HU Zhilan; WANG Guijin; LIN Xinggang; YAN Hong

2009-01-01

Skin segmentation is widely used in many computer vision tasks to improve automated visualiza-tion. This paper presents a graph cuts algorithm to segment arbitrary skin regions from images. The detected face is used to determine the foreground skin seeds and the background non-skin seeds with the color probability distributions for the foreground represented by a single Gaussian model and for the background by a Gaussian mixture model. The probability distribution of the image is used for noise suppression to alle-viate the influence of the background regions having skin-like colors. Finally, the skin is segmented by graph cuts, with the regional parameter y optimally selected to adapt to different images. Tests of the algorithm on many real wodd photographs show that the scheme accurately segments skin regions and is robust against illumination variations, individual skin variations, and cluttered backgrounds.

完全图的点可区别强全染色算法%Strong Vertex-distinguishing Total Coloring Algorithm of Complete Graph

Institute of Scientific and Technical Information of China (English)

赵焕平; 刘平; 李敬文

2012-01-01

According to the definition of strong vertex-distinguishing total coloring, this paper combines with the symmetry of complete graph, proposes a new strong vertex-distinguishing total coloring algorithm. The algorithm divides the filled colors into two parts: overcolor and propercolor. At the premise of getting the coloring number and the coloring frequency, it uses colored at first to enhance its convergence. Experimental results show that this algorithm has a lower time complexity.%根据图的点可区别全染色的定义,结合完全图的对称性,提出一种新的点可区别强全染色算法.该算法将需要填充的颜色分为超色数和正常色数2个部分,在得到染色数量和染色次数的前提下,对超色数进行染色以增强算法收敛性.实验结果表明,该算法具有较低的时间复杂度.

Rainbow Fourier Transform

Science.gov (United States)

Alexandrov, Mikhail D.; Cairns, Brian; Mishchenko, Michael I.

2012-01-01

We present a novel technique for remote sensing of cloud droplet size distributions. Polarized reflectances in the scattering angle range between 135deg and 165deg exhibit a sharply defined rainbow structure, the shape of which is determined mostly by single scattering properties of cloud particles, and therefore, can be modeled using the Mie theory. Fitting the observed rainbow with such a model (computed for a parameterized family of particle size distributions) has been used for cloud droplet size retrievals. We discovered that the relationship between the rainbow structures and the corresponding particle size distributions is deeper than it had been commonly understood. In fact, the Mie theory-derived polarized reflectance as a function of reduced scattering angle (in the rainbow angular range) and the (monodisperse) particle radius appears to be a proxy to a kernel of an integral transform (similar to the sine Fourier transform on the positive semi-axis). This approach, called the rainbow Fourier transform (RFT), allows us to accurately retrieve the shape of the droplet size distribution by the application of the corresponding inverse transform to the observed polarized rainbow. While the basis functions of the proxy-transform are not exactly orthogonal in the finite angular range, this procedure needs to be complemented by a simple regression technique, which removes the retrieval artifacts. This non-parametric approach does not require any a priori knowledge of the droplet size distribution functional shape and is computationally fast (no look-up tables, no fitting, computations are the same as for the forward modeling).

Hierarchical graphs for rule-based modeling of biochemical systems

Directory of Open Access Journals (Sweden)

Hu Bin

2011-02-01

Full Text Available Abstract Background In rule-based modeling, graphs are used to represent molecules: a colored vertex represents a component of a molecule, a vertex attribute represents the internal state of a component, and an edge represents a bond between components. Components of a molecule share the same color. Furthermore, graph-rewriting rules are used to represent molecular interactions. A rule that specifies addition (removal of an edge represents a class of association (dissociation reactions, and a rule that specifies a change of a vertex attribute represents a class of reactions that affect the internal state of a molecular component. A set of rules comprises an executable model that can be used to determine, through various means, the system-level dynamics of molecular interactions in a biochemical system. Results For purposes of model annotation, we propose the use of hierarchical graphs to represent structural relationships among components and subcomponents of molecules. We illustrate how hierarchical graphs can be used to naturally document the structural organization of the functional components and subcomponents of two proteins: the protein tyrosine kinase Lck and the T cell receptor (TCR complex. We also show that computational methods developed for regular graphs can be applied to hierarchical graphs. In particular, we describe a generalization of Nauty, a graph isomorphism and canonical labeling algorithm. The generalized version of the Nauty procedure, which we call HNauty, can be used to assign canonical labels to hierarchical graphs or more generally to graphs with multiple edge types. The difference between the Nauty and HNauty procedures is minor, but for completeness, we provide an explanation of the entire HNauty algorithm. Conclusions Hierarchical graphs provide more intuitive formal representations of proteins and other structured molecules with multiple functional components than do the regular graphs of current languages for

On the local vertex antimagic total coloring of some families tree

Science.gov (United States)

Febriani Putri, Desi; Dafik; Hesti Agustin, Ika; Alfarisi, Ridho

2018-04-01

Let G(V, E) be a graph of vertex set V and edge set E. Local vertex antimagic total coloring developed from local edge and local vertex antimagic coloring of graph. Local vertex antimagic total coloring is defined f:V(G)\\cup E(G)\\to \\{1,2,3,\\ldots,|V(G)|+|E(G)|\\} if for any two adjacent vertices v 1 and v 2, w({v}1)\

Perfect 2-colorings of the generalized Petersen graph

Indian Academy of Sciences (India)

There are no perfect 2-colorings of GP(n, 2) with the matrix A3. Proof. Suppose, contrary to our claim, there is a perfect 2-coloring of GP(n, 2) with the matrix A3. By Lemma 3.4, there are 2 vertices ai and bi, for some 0 ≤ i ≤ n−1, such that they are the same color. By symmetry, without loss of generality, we can assume T (a0) ...

Feedback from horizontal cells to cones mediates color induction and may facilitate color constancy in rainbow trout

NARCIS (Netherlands)

Sabbah, Shai; Zhu, Changhai; Hornsby, Mark A. W.; Kamermans, Maarten; Hawryshyn, Craig W.

2013-01-01

Color vision is most beneficial when the visual system is color constant and can correct the excitations of photoreceptors for differences in environmental irradiance. A phenomenon related to color constancy is color induction, where the color of an object shifts away from the color of its

Experimental Language Deconstructing Patriarchal Discourse in Ntozake Shange’s for colored girls who have considered suicide/ when the rainbow is enuf

Directory of Open Access Journals (Sweden)

Tellini Silvia Mara

2015-12-01

Full Text Available By sharing the experiences of women and the black community of her time, represented as a journey towards womanhood on stage, Afro- American playwright Ntozake Shange deconstructs the patriarchal structure of language, by pushing the boundaries of genres as she assembles prose, poetry and stage performance in a “choreopoem” capable of empowering and liberating the trajectories of the represented black women. The present study explores the semiotic and linguistic deconstructions of the patriarchal ideology in for colored girls who have considered suicide/ when the rainbow is enuf, aiming at a discussion of the author’s experimentalism with language outside instituted discursive paradigms regarding women. Considering that the concept of the liberation of the individual is strongly historicized in the play, the characters of the seven ladies are focalized as being tightly related to the feminist movement in North America in the seventies. Furthermore, the implications of ideological impositions and limited roles for women in society are analyzed.

Approximation and hardness results for the maximum edge q-coloring problem

DEFF Research Database (Denmark)

Adamaszek, Anna Maria; Popa, Alexandru

2016-01-01

We consider the problem of coloring edges of a graph subject to the following constraints: for every vertex v, all the edges incident with v have to be colored with at most q colors. The goal is to find a coloring satisfying the above constraints and using the maximum number of colors. Notice...... ϵ>0 and any q≥2 assuming the unique games conjecture (UGC), or 1+−ϵ for any ϵ>0 and any q≥3 (≈1.19 for q=2) assuming P≠NP. These results hold even when the considered graphs are bipartite. On the algorithmic side, we restrict to the case q=2, since this is the most important in practice and we show...... a 5/3-approximation algorithm for graphs which have a perfect matching....

On the Lucky labeling of Graphs

OpenAIRE

Ahadi, Arash; Dehghan, Ali; Mollaahmadi, Esmael

2010-01-01

Suppose the vertices of a graph $G$ were labeled arbitrarily by positive integers, and let $Sum(v)$ denote the sum of labels over all neighbors of vertex $v$. A labeling is lucky if the function $Sum$ is a proper coloring of $G$, that is, if we have $Sum(u) \

Colored operads

CERN Document Server

Yau, Donald

2016-01-01

The subject of this book is the theory of operads and colored operads, sometimes called symmetric multicategories. A (colored) operad is an abstract object which encodes operations with multiple inputs and one output and relations between such operations. The theory originated in the early 1970s in homotopy theory and quickly became very important in algebraic topology, algebra, algebraic geometry, and even theoretical physics (string theory). Topics covered include basic graph theory, basic category theory, colored operads, and algebras over colored operads. Free colored operads are discussed in complete detail and in full generality. The intended audience of this book includes students and researchers in mathematics and other sciences where operads and colored operads are used. The prerequisite for this book is minimal. Every major concept is thoroughly motivated. There are many graphical illustrations and about 150 exercises. This book can be used in a graduate course and for independent study.

The rainbow in the box

Science.gov (United States)

Selmke, Markus; Selmke, Sarah

2018-04-01

We describe a three-dimensional (3D) rainbow demonstration experiment. Its key idea is to convey a particular aspect of the natural phenomenon, namely, the origin of the perceived rainbow being multiple individual glints from within a rainshower. Raindrops in this demonstration are represented by acrylic spheres arranged on pillars within a cubic volume. Defocused imaging with a camera or the eye reveals a mosaic rainbow (segment) when viewed and illuminated in the appropriate fashion.

Studies on the metabolism of astaxanthin in the rainbow trout (Salmo gairdneri)

International Nuclear Information System (INIS)

Al-Khalifah, A.S.

1986-01-01

Racemic astaxanthin was fed to rainbow trout (Salmo gairdneri) for 2, 4, and 6 weeks. The fish showed a bright pink coloration of the skin and flesh; the highest amount of astaxanthin was found in the skin of fish fed the test diet for six weeks. Lutein, 3-epilutein, and zeaxanthin were also detected in the flesh and skin; it was concluded that astaxanthin was converted to zeaxanthin in the skin. The mean vitamin A content of the liver was determined; the ratio of vitamin A 1 :vitamin A 2 was approximately 1:3. Retinol and 3,4-dehydroretinol were extracted from the intestine of rainbow trout low in vitamin A, after force feeding with astaxanthin using a feeding tube. Antibiotic-treated fish had no marked difference in vitamin A content compared with a control group that received no antibiotic. This proves that astaxanthin was converted to vitamin A in fish depleted of vitamin A, that microorganisms were not involved in the conversion, and that conversion occurred in the intestine. An in vitro study using 3 H 3S, 3S'-astaxanthin incubated with duodenal and ileal segments of the intestine provided HLPC and radioisotope data, which showed that rainbow trout were able to bioconvert astaxanthin to vitamin A

Vaidya spacetime in massive gravity's rainbow

Directory of Open Access Journals (Sweden)

Yaghoub Heydarzade

2017-11-01

Full Text Available In this paper, we will analyze the energy dependent deformation of massive gravity using the formalism of massive gravity's rainbow. So, we will use the Vainshtein mechanism and the dRGT mechanism for the energy dependent massive gravity, and thus analyze a ghost free theory of massive gravity's rainbow. We study the energy dependence of a time-dependent geometry, by analyzing the radiating Vaidya solution in this theory of massive gravity's rainbow. The energy dependent deformation of this Vaidya metric will be performed using suitable rainbow functions.

Phase rainbow refractometry for accurate droplet variation characterization.

Science.gov (United States)

Wu, Yingchun; Promvongsa, Jantarat; Saengkaew, Sawitree; Wu, Xuecheng; Chen, Jia; Gréhan, Gérard

2016-10-15

We developed a one-dimensional phase rainbow refractometer for the accurate trans-dimensional measurements of droplet size on the micrometer scale as well as the tiny droplet diameter variations at the nanoscale. The dependence of the phase shift of the rainbow ripple structures on the droplet variations is revealed. The phase-shifting rainbow image is recorded by a telecentric one-dimensional rainbow imaging system. Experiments on the evaporating monodispersed droplet stream show that the phase rainbow refractometer can measure the tiny droplet diameter changes down to tens of nanometers. This one-dimensional phase rainbow refractometer is capable of measuring the droplet refractive index and diameter, as well as variations.

Colored Tensor Models - a Review

Directory of Open Access Journals (Sweden)

Razvan Gurau

2012-04-01

Full Text Available Colored tensor models have recently burst onto the scene as a promising conceptual and computational tool in the investigation of problems of random geometry in dimension three and higher. We present a snapshot of the cutting edge in this rapidly expanding research field. Colored tensor models have been shown to share many of the properties of their direct ancestor, matrix models, which encode a theory of fluctuating two-dimensional surfaces. These features include the possession of Feynman graphs encoding topological spaces, a 1/N expansion of graph amplitudes, embedded matrix models inside the tensor structure, a resumable leading order with critical behavior and a continuum large volume limit, Schwinger-Dyson equations satisfying a Lie algebra (akin to the Virasoro algebra in two dimensions, non-trivial classical solutions and so on. In this review, we give a detailed introduction of colored tensor models and pointers to current and future research directions.

3-biplacement of bipartite graphs

Directory of Open Access Journals (Sweden)

Lech Adamus

2008-01-01

Full Text Available Let \\(G=(L,R;E\\ be a bipartite graph with color classes \\(L\\ and \\(R\\ and edge set \\(E\\. A set of two bijections \\(\\{\\varphi_1 , \\varphi_2\\}\\, \\(\\varphi_1 , \\varphi_2 :L \\cup R \\to L \\cup R\\, is said to be a \\(3\\-biplacement of \\(G\\ if \\(\\varphi_1(L= \\varphi_2(L = L\\ and \\(E \\cap \\varphi_1^*(E=\\emptyset\\, \\(E \\cap \\varphi_2^*(E=\\emptyset\\, \\(\\varphi_1^*(E \\cap \\varphi_2^*(E=\\emptyset\\, where \\(\\varphi_1^*\\, \\(\\varphi_2^*\\ are the maps defined on \\(E\\, induced by \\(\\varphi_1\\, \\(\\varphi_2\\, respectively. We prove that if \\(|L| = p\\, \\(|R| = q\\, \\(3 \\leq p \\leq q\\, then every graph \\(G=(L,R;E\\ of size at most \\(p\\ has a \\(3\\-biplacement.

Learning about Science Graphs and Word Games. Superific Science Book V. A Good Apple Science Activity Book for Grades 5-8+.

Science.gov (United States)

Conway, Lorraine

This packet of student materials contains a variety of worksheet activities dealing with science graphs and science word games. These reproducible materials deal with: (1) bar graphs; (2) line graphs; (3) circle graphs; (4) pictographs; (5) histograms; (6) artgraphs; (7) designing your own graphs; (8) medical prefixes; (9) color prefixes; (10)…

A first generation BAC-based physical map of the rainbow trout genome

Directory of Open Access Journals (Sweden)

Thorgaard Gary H

2009-10-01

Full Text Available Abstract Background Rainbow trout (Oncorhynchus mykiss are the most-widely cultivated cold freshwater fish in the world and an important model species for many research areas. Coupling great interest in this species as a research model with the need for genetic improvement of aquaculture production efficiency traits justifies the continued development of genomics research resources. Many quantitative trait loci (QTL have been identified for production and life-history traits in rainbow trout. A bacterial artificial chromosome (BAC physical map is needed to facilitate fine mapping of QTL and the selection of positional candidate genes for incorporation in marker-assisted selection (MAS for improving rainbow trout aquaculture production. This resource will also facilitate efforts to obtain and assemble a whole-genome reference sequence for this species. Results The physical map was constructed from DNA fingerprinting of 192,096 BAC clones using the 4-color high-information content fingerprinting (HICF method. The clones were assembled into physical map contigs using the finger-printing contig (FPC program. The map is composed of 4,173 contigs and 9,379 singletons. The total number of unique fingerprinting fragments (consensus bands in contigs is 1,185,157, which corresponds to an estimated physical length of 2.0 Gb. The map assembly was validated by 1 comparison with probe hybridization results and agarose gel fingerprinting contigs; and 2 anchoring large contigs to the microsatellite-based genetic linkage map. Conclusion The production and validation of the first BAC physical map of the rainbow trout genome is described in this paper. We are currently integrating this map with the NCCCWA genetic map using more than 200 microsatellites isolated from BAC end sequences and by identifying BACs that harbor more than 300 previously mapped markers. The availability of an integrated physical and genetic map will enable detailed comparative genome

On the Adjacent Strong Equitable Edge Coloring of Pn ∨ Pn, Pn ∨ Cn and Cn ∨ Cn

OpenAIRE

Liu Jun; Zhao Chuan Cheng; Yao Shu Xia; Guo Ren Zhi; Yue Qiu Ju

2016-01-01

A proper edge coloring of graph G is called equitable adjacent strong edge coloring if colored sets from every two adjacent vertices incident edge are different,and the number of edges in any two color classes differ by at most one,which the required minimum number of colors is called the adjacent strong equitable edge chromatic number. In this paper, we discuss the adjacent strong equitable edge coloring of join-graphs about Pn ∨ Pn, Pn ∨ Cn and Cn ∨ Cn.

Analysis of the Perfect Table Fuzzy Rainbow Tradeoff

Directory of Open Access Journals (Sweden)

Byoung-Il Kim

2014-01-01

Full Text Available Cryptanalytic time memory tradeoff algorithms are tools for inverting one-way functions, and they are used in practice to recover passwords that restrict access to digital documents. This work provides an accurate complexity analysis of the perfect table fuzzy rainbow tradeoff algorithm. Based on the analysis results, we show that the lesser known fuzzy rainbow tradeoff performs better than the original rainbow tradeoff, which is widely believed to be the best tradeoff algorithm. The fuzzy rainbow tradeoff can attain higher online efficiency than the rainbow tradeoff and do so at a lower precomputation cost.

Rainbows, supernumerary rainbows and interference effects in the angular scattering of chemical reactions: an investigation using Heisenberg's S matrix programme.

Science.gov (United States)

Shan, Xiao; Xiahou, Chengkui; Connor, J N L

2018-01-03

In earlier research, we have demonstrated that broad "hidden" rainbows can occur in the product differential cross sections (DCSs) of state-to-state chemical reactions. Here we ask the question: can pronounced and localized rainbows, rather than broad hidden ones, occur in reactive DCSs? Further motivation comes from recent measurements by H. Pan and K. Liu, J. Phys. Chem. A, 2016, 120, 6712, of a "bulge" in a reactive DCS, which they conjecture is a rainbow. Our theoretical approach uses a "weak" version of Heisenberg's scattering matrix program (wHSMP) introduced by X. Shan and J. N. L. Connor, Phys. Chem. Chem. Phys., 2011, 13, 8392. This wHSMP uses four general physical principles for chemical reactions to suggest simple parameterized forms for the S matrix; it does not employ a potential energy surface. We use a parameterization in which the modulus of the S matrix is a smooth-step function of the total angular momentum quantum number, J, and (importantly) its phase is a cubic polynomial in J. We demonstrate for a Legendre partial wave series (PWS) the existence of pronounced rainbows, supernumerary rainbows, and other interference effects, in reactive DCSs. We find that reactive rainbows can be more complicated in their structure than the familiar rainbows of elastic scattering. We also analyse the angular scattering using Nearside-Farside (NF) PWS theory and NF PWS Local Angular Momentum (LAM) theory, including resummations of the PWS. In addition, we apply full and NF asymptotic (semiclassical) rainbow theories to the PWS - in particular, the uniform Airy and transitional Airy approximations for the farside scattering. This lets us prove that structure in the DCSs are indeed rainbows, supernumerary rainbows as well as other interference effects.

Integer Flows and Circuit Covers of Graphs and Signed Graphs

Science.gov (United States)

Cheng, Jian

The work in Chapter 2 is motivated by Tutte and Jaeger's pioneering work on converting modulo flows into integer-valued flows for ordinary graphs. For a signed graphs (G, sigma), we first prove that for each k ∈ {2, 3}, if (G, sigma) is (k - 1)-edge-connected and contains an even number of negative edges when k = 2, then every modulo k-flow of (G, sigma) can be converted into an integer-valued ( k + 1)-ow with a larger or the same support. We also prove that if (G, sigma) is odd-(2p+1)-edge-connected, then (G, sigma) admits a modulo circular (2 + 1/ p)-flows if and only if it admits an integer-valued circular (2 + 1/p)-flows, which improves all previous result by Xu and Zhang (DM2005), Schubert and Steffen (EJC2015), and Zhu (JCTB2015). Shortest circuit cover conjecture is one of the major open problems in graph theory. It states that every bridgeless graph G contains a set of circuits F such that each edge is contained in at least one member of F and the length of F is at most 7/5∥E(G)∥. This concept was recently generalized to signed graphs by Macajova et al. (JGT2015). In Chapter 3, we improve their upper bound from 11∥E( G)∥ to 14/3 ∥E(G)∥, and if G is 2-edgeconnected and has even negativeness, then it can be further reduced to 11/3 ∥E(G)∥. Tutte's 3-flow conjecture has been studied by many graph theorists in the last several decades. As a new approach to this conjecture, DeVos and Thomassen considered the vectors as ow values and found that there is a close relation between vector S1-flows and integer 3-NZFs. Motivated by their observation, in Chapter 4, we prove that if a graph G admits a vector S1-flow with rank at most two, then G admits an integer 3-NZF. The concept of even factors is highly related to the famous Four Color Theorem. We conclude this dissertation in Chapter 5 with an improvement of a recent result by Chen and Fan (JCTB2016) on the upperbound of even factors. We show that if a graph G contains an even factor, then it

The Full Ward-Takahashi Identity for Colored Tensor Models

Science.gov (United States)

Pérez-Sánchez, Carlos I.

2018-03-01

Colored tensor models (CTM) is a random geometrical approach to quantum gravity. We scrutinize the structure of the connected correlation functions of general CTM-interactions and organize them by boundaries of Feynman graphs. For rank- D interactions including, but not restricted to, all melonic φ^4 -vertices—to wit, solely those quartic vertices that can lead to dominant spherical contributions in the large- N expansion—the aforementioned boundary graphs are shown to be precisely all (possibly disconnected) vertex-bipartite regularly edge- D-colored graphs. The concept of CTM-compatible boundary-graph automorphism is introduced and an auxiliary graph calculus is developed. With the aid of these constructs, certain U (∞)-invariance of the path integral measure is fully exploited in order to derive a strong Ward-Takahashi Identity for CTMs with a symmetry-breaking kinetic term. For the rank-3 φ^4 -theory, we get the exact integral-like equation for the 2-point function. Similarly, exact equations for higher multipoint functions can be readily obtained departing from this full Ward-Takahashi identity. Our results hold for some Group Field Theories as well. Altogether, our non-perturbative approach trades some graph theoretical methods for analytical ones. We believe that these tools can be extended to tensorial SYK-models.

Storying Ubuntu as a rainbow nation

Directory of Open Access Journals (Sweden)

Wonke Buqa

2015-06-01

Full Text Available South Africa is often referred to as the �Rainbow Nation�. This term was coined by Desmond Tutu during the advent of democracy in the country. Tutu stated: �They tried to make us one colour: purple. We say we are the rainbow people! We are the new people of the new South Africa!� This article seeks to answer the question as to whether the Rainbow Nation is a true reflection of Ubuntu in South Africa or whether it is just idealism.

Perspective on rainbow-ladder truncation

International Nuclear Information System (INIS)

Eichmann, G.; Alkofer, R.; Krassnigg, A.; Cloeet, I. C.; Roberts, C. D.

2008-01-01

Prima facie the systematic implementation of corrections to the rainbow-ladder truncation of QCD's Dyson-Schwinger equations will uniformly reduce in magnitude those calculated mass-dimensioned results for pseudoscalar and vector meson properties that are not tightly constrained by symmetries. The aim and interpretation of studies employing rainbow-ladder truncation are reconsidered in this light

Heuristics for the Robust Coloring Problem

Directory of Open Access Journals (Sweden)

Miguel Ángel Gutiérrez Andrade

2011-03-01

Full Text Available Let $G$ and $\\bar{G}$ be complementary graphs. Given a penalty function defined on the edges of $G$, we will say that the rigidity of a $k$-coloring of $G$ is the sum of the penalties of the edges of G joining vertices of the same color. Based on the previous definition, the Robust Coloring Problem (RCP is stated as the search of the minimum rigidity $k$-coloring. In this work a comparison of heuristics based on simulated annealing, GRASP and scatter search is presented. These are the best results for the RCP that have been obtained.

Efficient graph-cut tattoo segmentation

Science.gov (United States)

Kim, Joonsoo; Parra, Albert; Li, He; Delp, Edward J.

2015-03-01

Law enforcement is interested in exploiting tattoos as an information source to identify, track and prevent gang-related crimes. Many tattoo image retrieval systems have been described. In a retrieval system tattoo segmentation is an important step for retrieval accuracy since segmentation removes background information in a tattoo image. Existing segmentation methods do not extract the tattoo very well when the background includes textures and color similar to skin tones. In this paper we describe a tattoo segmentation approach by determining skin pixels in regions near the tattoo. In these regions graph-cut segmentation using a skin color model and a visual saliency map is used to find skin pixels. After segmentation we determine which set of skin pixels are connected with each other that form a closed contour including a tattoo. The regions surrounded by the closed contours are considered tattoo regions. Our method segments tattoos well when the background includes textures and color similar to skin.

ColorMoves: Optimizing Color's Potential for Exploration and Communication of Data

Science.gov (United States)

Samsel, F.

2017-12-01

Color is the most powerful perceptual channel available for exposing and communicating data. Most visualizations are rendered in one of a handful of common colormaps - the rainbow, cool-warm, heat map and viridis. These maps meet the basic criteria for encoding data - perceptual uniformity and reasonable discriminatory power. However, as the size and complexity of data grows, our need to optimize the potential of color grows. The ability to expose greater detail and differentiate between multiple variables becomes ever more important. To meet this need we have created ColorMoves, an interactive colormap construction tool that enables scientists to quickly and easily align a concentration contrast with the data ranges of interest. Perceptual research tells us that luminance is the strongest contrast and thus provides the highest degree of perceptual discrimination. However, the most commonly used colormaps contain a limited range of luminance contrast. ColorMoves enables interactive constructing colormaps enabling one to distribute the luminance where is it most needed. The interactive interface enables optimal placement of the color scales. The ability to watch the changes on ones data, in real time makes precision adjustment quick and easy. By enabling more precise placement and multiple ranges of luminance one can construct colomaps containing greater discriminatory power. By selecting from the wide range of color scale hues scientists can create colormaps intuitive to their subject. ColorMoves is comprised of four main components: a set of 40 color scales; a histogram of the data distribution; a viewing area showing the colormap on your data; and the controls section. The 40 color scales span the spectrum of hues, saturation levels and value distributions. The histogram of the data distribution enables placement of the color scales in precise locations. The viewing area show is the impact of changes on the data in real time. The controls section enables export

Cliques, coloring, and satisfiability

CERN Document Server

Johnson, David S

1996-01-01

The purpose of a DIMACS Challenge is to encourage and coordinate research in the experimental analysis of algorithms. The First DIMACS Challenge encouraged experimental work in the area of network flow and matchings. The Second DIMACS Challenge, on which this volume is based, took place in conjunction with the DIMACS Special Year on Combinatorial Optimization. Addressed here are three difficult combinatorial optimization problems: finding cliques in a graph, coloring the vertices of a graph, and solving instances of the satisfiability problem. These problems were chosen both for their practical interest and because of their theoretical intractability.

Thermodynamic phase transition of a black hole in rainbow gravity

Directory of Open Access Journals (Sweden)

Zhong-Wen Feng

2017-09-01

Full Text Available In this letter, using the rainbow functions that were proposed by Magueijo and Smolin, we investigate the thermodynamics and the phase transition of rainbow Schwarzschild black hole. First, we calculate the rainbow gravity corrected Hawking temperature. From this modification, we then derive the local temperature, free energy, and other thermodynamic quantities in an isothermal cavity. Finally, we analyze the critical behavior, thermodynamic stability, and phase transition of the rainbow Schwarzschild black hole. The results show that the rainbow gravity can stop the Hawking radiation in the final stages of black holes' evolution and lead to the remnants of black holes. Furthermore, one can observe that the rainbow Schwarzschild black hole has one first-order phase transition, two second-order phase transitions, and three Hawking–Page-type phase transitions in the framework of rainbow gravity theory.

Nonsingular universe in massive gravity's rainbow

Science.gov (United States)

Hendi, S. H.; Momennia, M.; Eslam Panah, B.; Panahiyan, S.

2017-06-01

One of the fundamental open questions in cosmology is whether we can regard the universe evolution without singularity like a Big Bang or a Big Rip. This challenging subject stimulates one to regard a nonsingular universe in the far past with an arbitrarily large vacuum energy. Considering the high energy regime in the cosmic history, it is believed that Einstein gravity should be corrected to an effective energy dependent theory which could be acquired by gravity's rainbow. On the other hand, employing massive gravity provided us with solutions to some of the long standing fundamental problems of cosmology such as cosmological constant problem and self acceleration of the universe. Considering these aspects of gravity's rainbow and massive gravity, in this paper, we initiate studying FRW cosmology in the massive gravity's rainbow formalism. At first, we show that although massive gravity modifies the FRW cosmology, but it does not itself remove the big bang singularity. Then, we generalize the massive gravity to the case of energy dependent spacetime and find that massive gravity's rainbow can remove the early universe singularity. We bring together all the essential conditions for having a nonsingular universe and the effects of both gravity's rainbow and massive gravity generalizations on such criteria are determined.

Rainbow's stars

Energy Technology Data Exchange (ETDEWEB)

Garattini, Remo [Universita degli Studi di Bergamo, Department of Engineering and Applied Sciences, Dalmine, Bergamo (Italy); I.N.F.N.-sezione di Milano, Milan (Italy); Mandanici, Gianluca [Universita degli Studi di Bergamo, Department of Engineering and Applied Sciences, Dalmine, Bergamo (Italy)

2017-01-15

In recent years, a growing interest in the equilibrium of compact astrophysical objects like white dwarf and neutron stars has been manifested. In particular, various modifications due to Planck-scale energy effects have been considered. In this paper we analyze the modification induced by gravity's rainbow on the equilibrium configurations described by the Tolman-Oppenheimer-Volkoff (TOV) equation. Our purpose is to explore the possibility that the rainbow Planck-scale deformation of space-time could support the existence of different compact stars. (orig.)

Using Graph and Vertex Entropy to Compare Empirical Graphs with Theoretical Graph Models

Directory of Open Access Journals (Sweden)

Tomasz Kajdanowicz

2016-09-01

Full Text Available Over the years, several theoretical graph generation models have been proposed. Among the most prominent are: the Erdős–Renyi random graph model, Watts–Strogatz small world model, Albert–Barabási preferential attachment model, Price citation model, and many more. Often, researchers working with real-world data are interested in understanding the generative phenomena underlying their empirical graphs. They want to know which of the theoretical graph generation models would most probably generate a particular empirical graph. In other words, they expect some similarity assessment between the empirical graph and graphs artificially created from theoretical graph generation models. Usually, in order to assess the similarity of two graphs, centrality measure distributions are compared. For a theoretical graph model this means comparing the empirical graph to a single realization of a theoretical graph model, where the realization is generated from the given model using an arbitrary set of parameters. The similarity between centrality measure distributions can be measured using standard statistical tests, e.g., the Kolmogorov–Smirnov test of distances between cumulative distributions. However, this approach is both error-prone and leads to incorrect conclusions, as we show in our experiments. Therefore, we propose a new method for graph comparison and type classification by comparing the entropies of centrality measure distributions (degree centrality, betweenness centrality, closeness centrality. We demonstrate that our approach can help assign the empirical graph to the most similar theoretical model using a simple unsupervised learning method.

Selective colors reflection from stratified aragonite calcium carbonate plates of mollusk shells.

Science.gov (United States)

Lertvachirapaiboon, Chutiparn; Parnklang, Tewarak; Pienpinijtham, Prompong; Wongravee, Kanet; Thammacharoen, Chuchaat; Ekgasit, Sanong

2015-08-01

An interaction between the incident light and the structural architecture within the shell of Asian green mussel (Perna viridis) induces observable pearlescent colors. In this paper, we investigate the influence of the structural architecture on the expressed colors. After a removal of the organic binder, small flakes from crushed shells show vivid rainbow reflection under an optical microscope. An individual flake expresses vivid color under a bright-field illumination while become transparent under a dark-field illumination. The expressed colors of the aragonite flakes are directly associated with its structural architecture. The flakes with aragonite thickness of 256, 310, and 353 nm, respectively, appear blue, green, and red under an optical microscope. The spectral simulation corroborates the experimentally observed optical effects as the flakes with thicker aragonite layers selectively reflected color with longer wavelengths. Flakes with multiple aragonite thicknesses expressed multi-color as the upper aragonite layers allow reflected colors from the lower layers to be observed. Copyright © 2015 Elsevier Inc. All rights reserved.

Guts of surfaces and the colored Jones polynomial

CERN Document Server

Futer, David; Purcell, Jessica

2013-01-01

This monograph derives direct and concrete relations between colored Jones polynomials and the topology of incompressible spanning surfaces in knot and link complements. Under mild diagrammatic hypotheses, we prove that the growth of the degree of the colored Jones polynomials is a boundary slope of an essential surface in the knot complement. We show that certain coefficients of the polynomial measure how far this surface is from being a fiber for the knot; in particular, the surface is a fiber if and only if a particular coefficient vanishes. We also relate hyperbolic volume to colored Jones polynomials. Our method is to generalize the checkerboard decompositions of alternating knots. Under mild diagrammatic hypotheses, we show that these surfaces are essential, and obtain an ideal polyhedral decomposition of their complement. We use normal surface theory to relate the pieces of the JSJ decomposition of the  complement to the combinatorics of certain surface spines (state graphs). Since state graphs have p...

STRUCTURAL ANNOTATION OF EM IMAGES BY GRAPH CUT

Energy Technology Data Exchange (ETDEWEB)

Chang, Hang; Auer, Manfred; Parvin, Bahram

2009-05-08

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

Development and usage of a false color display technique for presenting Seasat-A scatterometer data

Science.gov (United States)

Jackson, C. B.

1980-01-01

A computer generated false color program which creates digital multicolor graphics to display geophysical surface parameters measured by the Seasat-A satellite scatterometer (SASS) is described. The data is incrementally scaled over the range of acceptable values and each increment and its data points are assigned a color. The advantage of the false color display is that it visually infers cool or weak data versus hot or intense data by using the rainbow of colors. For example, with wind speeds, levels of yellow and red could be used to imply high winds while green and blue could imply calmer air. The SASS data is sorted into geographic regions and the final false color images are projected onto various world maps with superimposed land/water boundaries.

Farming of Freshwater Rainbow Trout in Denmark

DEFF Research Database (Denmark)

Jokumsen, Alfred; Svendsen, Lars Moeslund

Textbook on Farming of Freshwater Rainbow Trout in Denmark. Danish edition with the title: Opdræt af regnbueørred i Danmark......Textbook on Farming of Freshwater Rainbow Trout in Denmark. Danish edition with the title: Opdræt af regnbueørred i Danmark...

A graph rewriting programming language for graph drawing

OpenAIRE

Rodgers, Peter

1998-01-01

This paper describes Grrr, a prototype visual graph drawing tool. Previously there were no visual languages for programming graph drawing algorithms despite the inherently visual nature of the process. The languages which gave a diagrammatic view of graphs were not computationally complete and so could not be used to implement complex graph drawing algorithms. Hence current graph drawing tools are all text based. Recent developments in graph rewriting systems have produced computationally com...

Global rainbow refractometry for droplet temperature measurement

Energy Technology Data Exchange (ETDEWEB)

Pascal Lemaitre; Emmanuel Porcheron; Amandine Nuboer; Philippe Brun; Pierre Cornet; Jeanne Malet; Jacques Vendel; Laurent Bouilloux [Institut de Radioprotection et de Surete Nucleaire DSU/SERAC, BP 68, 91192 Gif-sur-Yvette Cedex (France); Gerard Grehan [UMR 6614 CORIA, Laboratoire d' Electromagnetisme et Systemes Particulaires Site Universitaire du Madrillet, Avenue de l' universite BP 12, 76 801 Saint Etienne du Rouvray Cedex, (France)

2005-07-01

Full text of publication follows: In order to establish an accurate database to characterize the heat and mass transfers between a spray and the atmosphere with thermal-hydraulic conditions representative of a hypothetical nuclear reactor accident in the containment enclosure of a pressurized water reactor (PWR), the French Institut de Radioprotection et de Surete Nucleaire (IRSN) has developed the TOSQAN experimental facility. This experiment is highly instrumented with non-intrusive diagnostics allowing to measure droplet size and velocity and gas concentrations [1]. The aim of this work is to present the Global Rainbow Thermometry (GRT), which is an advanced non-intrusive optical diagnostic, developed to measure the mean temperature of a set of falling droplets, in a measurement volume of 1 cm{sup 3}. The final paper will be divided in three parts. In the first one, we will explain the principle of the rainbow formation and how droplet temperature can be deduced from the rainbow analysis [2]. This part will be illustrated with the theoretical background on the rainbow and numerical simulations of the global rainbow. The second part will be devoted to present the global rainbow experimental set-up we have developed on optical table, its experimental qualification and finally its implementation on the TOSQAN facility [3]. Finally, we will present the temperature measurements achieved in TOSQAN for thermal-hydraulic conditions representative of a hypothetical nuclear reactor accident. These measurements are useful to characterize the heat and mass transfers between the spraying droplets and the air-steam mixture composing the atmosphere. This analysis will be exposed in a two companion papers. References: [1] E. Porcheron, P. Brun, P. Cornet, J. Malet, J. Vendel. Optical diagnostics applied for single and multi-phase flow characterization in the TOSQAN facility dedicated for thermal hydraulic containment studies. NURETH-10 Seoul, Korea, October 5-9, 2003. [2] P

Global rainbow refractometry for droplet temperature measurement

International Nuclear Information System (INIS)

Pascal Lemaitre; Emmanuel Porcheron; Amandine Nuboer; Philippe Brun; Pierre Cornet; Jeanne Malet; Jacques Vendel; Laurent Bouilloux; Gerard Grehan

2005-01-01

Full text of publication follows: In order to establish an accurate database to characterize the heat and mass transfers between a spray and the atmosphere with thermal-hydraulic conditions representative of a hypothetical nuclear reactor accident in the containment enclosure of a pressurized water reactor (PWR), the French Institut de Radioprotection et de Surete Nucleaire (IRSN) has developed the TOSQAN experimental facility. This experiment is highly instrumented with non-intrusive diagnostics allowing to measure droplet size and velocity and gas concentrations [1]. The aim of this work is to present the Global Rainbow Thermometry (GRT), which is an advanced non-intrusive optical diagnostic, developed to measure the mean temperature of a set of falling droplets, in a measurement volume of 1 cm 3 . The final paper will be divided in three parts. In the first one, we will explain the principle of the rainbow formation and how droplet temperature can be deduced from the rainbow analysis [2]. This part will be illustrated with the theoretical background on the rainbow and numerical simulations of the global rainbow. The second part will be devoted to present the global rainbow experimental set-up we have developed on optical table, its experimental qualification and finally its implementation on the TOSQAN facility [3]. Finally, we will present the temperature measurements achieved in TOSQAN for thermal-hydraulic conditions representative of a hypothetical nuclear reactor accident. These measurements are useful to characterize the heat and mass transfers between the spraying droplets and the air-steam mixture composing the atmosphere. This analysis will be exposed in a two companion papers. References: [1] E. Porcheron, P. Brun, P. Cornet, J. Malet, J. Vendel. Optical diagnostics applied for single and multi-phase flow characterization in the TOSQAN facility dedicated for thermal hydraulic containment studies. NURETH-10 Seoul, Korea, October 5-9, 2003. [2] P

Rainbows in nature: recent advances in observation and theory

International Nuclear Information System (INIS)

Haußmann, Alexander

2016-01-01

This topical review presents an overview of the common and less common observations of rainbows in natural rainfall, and the theoretical concepts that have been developed for their explanation. Mainly throughout the last 20 years, many new and intriguing effects have been photographed or documented for the first time, such as higher-order (tertiary, quaternary, etc) and twinned rainbows, as well as rainbows generated by nearby artificial light sources. In order to provide a sound explanation, the inclusion of natural non-spherical (i.e. oblate) raindrop shapes as well as natural broad polydisperse raindrop distributions into the classical rainbow theory (Lorenz–Mie and Debye scattering) is outlined. Thus, the article provides a condensed up-to-date synopsis complementing classical textbooks and earlier reviews on the physics of rainbows. It is intended to serve both active sky observers as well as physics teachers who want to keep up with current developments in the field. (review)

The End of the Rainbow? Color Schemes for Improved Data Graphics

Science.gov (United States)

Light, Adam; Bartlein, Patrick J.

2004-10-01

Modern computer displays and printers enable the widespread use of color in scientific communication, but the expertise for designing effective graphics has not kept pace with the technology for producing them. Historically, even the most prestigious publications have tolerated high defect rates in figures and illustrations, and technological advances that make creating and reproducing graphics easier do not appear to have decreased the frequency of errors. Flawed graphics consequently beget more flawed graphics as authors emulate published examples. Color has the potential to enhance communication, but design mistakes can result in color figures that are less effective than gray scale displays of the same data. Empirical research on human subjects can build a fundamental understanding of visual perception and scientific methods can be used to evaluate existing designs, but creating effective data graphics is a design task and not fundamentally a scientific pursuit. Like writing well, creating good data graphics requires a combination of formal knowledge and artistic sensibility tempered by experience: a combination of ``substance, statistics, and design''.

Color inference in visual communication: the meaning of colors in recycling.

Science.gov (United States)

Schloss, Karen B; Lessard, Laurent; Walmsley, Charlotte S; Foley, Kathleen

2018-01-01

People interpret abstract meanings from colors, which makes color a useful perceptual feature for visual communication. This process is complicated, however, because there is seldom a one-to-one correspondence between colors and meanings. One color can be associated with many different concepts (one-to-many mapping) and many colors can be associated with the same concept (many-to-one mapping). We propose that to interpret color-coding systems, people perform assignment inference to determine how colors map onto concepts. We studied assignment inference in the domain of recycling. Participants saw images of colored but unlabeled bins and were asked to indicate which bins they would use to discard different kinds of recyclables and trash. In Experiment 1, we tested two hypotheses for how people perform assignment inference. The local assignment hypothesis predicts that people simply match objects with their most strongly associated color. The global assignment hypothesis predicts that people also account for the association strengths between all other objects and colors within the scope of the color-coding system. Participants discarded objects in bins that optimized the color-object associations of the entire set, which is consistent with the global assignment hypothesis. This sometimes resulted in discarding objects in bins whose colors were weakly associated with the object, even when there was a stronger associated option available. In Experiment 2, we tested different methods for encoding color-coding systems and found that people were better at assignment inference when color sets simultaneously maximized the association strength between assigned color-object parings while minimizing associations between unassigned pairings. Our study provides an approach for designing intuitive color-coding systems that facilitate communication through visual media such as graphs, maps, signs, and artifacts.

Diazo Printing of ERTS Color Composites

Science.gov (United States)

Mcmurtry, G. J.; Petersen, G. W. (Principal Investigator); Kowalik, W. S.

1975-01-01

The author has identified the following significant results. ERTS-1 color composites were made with the help of a Diazo developer and printer. Five single channel, density standards were established, using typical ERTS images, in order to determine exposure time. These standards were used to develop a graph from which the exposure time for any transparency can be estimated. Exposure times varied from 3 to 30 minutes, and clear colored polyester sheets from two manufactures were used with slightly different, but equally successful, results.

Graph Aggregation

NARCIS (Netherlands)

Endriss, U.; Grandi, U.

Graph aggregation is the process of computing a single output graph that constitutes a good compromise between several input graphs, each provided by a different source. One needs to perform graph aggregation in a wide variety of situations, e.g., when applying a voting rule (graphs as preference

Experimental evaluation of rainbow trout Oncorhynchus mykiss predation on longnose dace Rhinichthys cataractae

Science.gov (United States)

Turek, Kelly C.; Pegg, Mark A.; Pope, Kevin L.

2014-01-01

Laboratory and in-stream enclosure experiments were used to determine whether rainbow trout Oncorhynchus mykiss influence survival of longnose dace Rhinichthys cataractae. In the laboratory, adult rainbow trout preyed on longnose dace in 42% of trials and juvenile rainbow trout did not prey on longnose dace during the first 6 h after rainbow trout introduction. Survival of longnose dace did not differ in the presence of adult rainbow trout previously exposed to active prey and those not previously exposed to active prey ( = 0.28, P = 0.60). In field enclosures, the number of longnose dace decreased at a faster rate in the presence of rainbow trout relative to controls within the first 72 h, but did not differ between moderate and high densities of rainbow trout (F2,258.9 = 3.73, P = 0.03). Additionally, longnose dace were found in 7% of rainbow trout stomachs after 72 h in enclosures. Rainbow trout acclimated to the stream for longer periods had a greater initial influence on the number of longnose dace remaining in enclosures relative to those acclimated for shorter periods regardless of rainbow trout density treatment (F4,148.5 = 2.50, P = 0.04). More research is needed to determine how predation rates will change in natural environments, under differing amounts of habitat and food resources and in the context of whole assemblages. However, if rainbow trout are introduced into the habitat of longnose dace, some predation on longnose dace is expected, even when rainbow trout have no previous experience with active prey.

Proxy Graph: Visual Quality Metrics of Big Graph Sampling.

Science.gov (United States)

Nguyen, Quan Hoang; Hong, Seok-Hee; Eades, Peter; Meidiana, Amyra

2017-06-01

Data sampling has been extensively studied for large scale graph mining. Many analyses and tasks become more efficient when performed on graph samples of much smaller size. The use of proxy objects is common in software engineering for analysis and interaction with heavy objects or systems. In this paper, we coin the term 'proxy graph' and empirically investigate how well a proxy graph visualization can represent a big graph. Our investigation focuses on proxy graphs obtained by sampling; this is one of the most common proxy approaches. Despite the plethora of data sampling studies, this is the first evaluation of sampling in the context of graph visualization. For an objective evaluation, we propose a new family of quality metrics for visual quality of proxy graphs. Our experiments cover popular sampling techniques. Our experimental results lead to guidelines for using sampling-based proxy graphs in visualization.

ORBITING RAINBOWS PHASE 2

Data.gov (United States)

National Aeronautics and Space Administration — Inspired by the light scattering and focusing properties of distributed optical assemblies in Nature, such as rainbows and aerosols, and by recent laboratory...

NONSINGULAR UNIVERSES IN GAUSS–BONNET GRAVITY’S RAINBOW

International Nuclear Information System (INIS)

Hendi, Seyed Hossein; Momennia, Mehrab; Panah, Behzad Eslam; Faizal, Mir

2016-01-01

In this paper, we study the rainbow deformation of Friedmann-Robertson-Walker (FRW) cosmology in both Einstein gravity and Gauss–Bonnet (GB) gravity. We demonstrate that the singularity in FRW cosmology can be removed because of the rainbow deformation of the FRW metric. We obtain the general constraints required for FRW cosmology to be free of singularities. We observe that the inclusion of GB gravity can significantly change the constraints required to obtain nonsingular universes. We use rainbow functions motivated by the hard spectra of gamma-ray bursts to deform FRW cosmology and explicitly demonstrate that such a deformation removes the singularity in FRW cosmology.

NONSINGULAR UNIVERSES IN GAUSS–BONNET GRAVITY’S RAINBOW

Energy Technology Data Exchange (ETDEWEB)

Hendi, Seyed Hossein; Momennia, Mehrab; Panah, Behzad Eslam [Physics Department and Biruni Observatory, College of Sciences, Shiraz University, Shiraz 71454 (Iran, Islamic Republic of); Faizal, Mir [Department of Physics and Astronomy, University of Lethbridge, Lethbridge, AB T1K 3M4 (Canada)

2016-08-20

In this paper, we study the rainbow deformation of Friedmann-Robertson-Walker (FRW) cosmology in both Einstein gravity and Gauss–Bonnet (GB) gravity. We demonstrate that the singularity in FRW cosmology can be removed because of the rainbow deformation of the FRW metric. We obtain the general constraints required for FRW cosmology to be free of singularities. We observe that the inclusion of GB gravity can significantly change the constraints required to obtain nonsingular universes. We use rainbow functions motivated by the hard spectra of gamma-ray bursts to deform FRW cosmology and explicitly demonstrate that such a deformation removes the singularity in FRW cosmology.

Zooplankton size selection relative to gill raker spacing in rainbow trout

Science.gov (United States)

Budy, P.; Haddix, T.; Schneidervin, R.

2005-01-01

Rainbow trout Oncorhynchus mykiss are one of the most widely stocked salmonids worldwide, often based on the assumption that they will effectively utilize abundant invertebrate food resources. We evaluated the potential for feeding morphology to affect prey selection by rainbow trout using a combination of laboratory feeding experiments and field observations in Flaming Gorge Reservoir, Utah-Wyoming. For rainbow trout collected from the reservoir, inter-gill raker spacing averaged 1.09 mm and there was low variation among fish overall (SD = 0.28). Ninety-seven percent of all zooplankton observed in the diets of rainbow trout collected in the reservoir were larger than the interraker spacing, while only 29% of the zooplankton found in the environment were larger than the interraker spacing. Over the size range of rainbow trout evaluated here (200-475 mm), interraker spacing increased moderately with increasing fish length; however, the size of zooplankton found in the diet did not increase with increasing fish length. In laboratory experiments, rainbow trout consumed the largest zooplankton available; the mean size of zooplankton observed in the diets was significantly larger than the mean size of zooplankton available. Electivity indices for both laboratory and field observations indicated strong selection for larger-sized zooplankton. The size threshold at which electivity switched from selection against smaller-sized zooplankton to selection for larger-sized zooplankton closely corresponded to the mean interraker spacing for both groups (???1-1.2 mm). The combination of results observed here indicates that rainbow trout morphology limits the retention of different-sized zooplankton prey and reinforces the importance of understanding how effectively rainbow trout can utilize the type and sizes of different prey available in a given system. These considerations may improve our ability to predict the potential for growth and survival of rainbow trout within and

Polymer nanoimprinting using an anodized aluminum mold for structural coloration

Science.gov (United States)

Kikuchi, Tatsuya; Nishinaga, Osamu; Natsui, Shungo; Suzuki, Ryosuke O.

2015-06-01

Polymer nanoimprinting of submicrometer-scale dimple arrays with structural coloration was demonstrated. Highly ordered aluminum dimple arrays measuring 530-670 nm in diameter were formed on an aluminum substrate via etidronic acid anodizing at 210-270 V and subsequent anodic oxide dissolution. The nanostructured aluminum surface led to bright structural coloration with a rainbow spectrum, and the reflected wavelength strongly depends on the angle of the specimen and the period of the dimple array. The reflection peak shifts gradually with the dimple diameter toward longer wavelength, reaching 800 nm in wavelength at 670 nm in diameter. The shape of the aluminum dimple arrays were successfully transferred to a mercapto-ester ultra-violet curable polymer via self-assembled monolayer coating and polymer replications using a nanoimprinting technique. The nanostructured polymer surfaces with positively and negatively shaped dimple arrays also exhibited structural coloration based on the periodic nanostructure, and reflected light mostly in the visible region, 400-800 nm. This nanostructuring with structural coloration can be easily realized by simple techniques such as anodizing, SAM coating, and nanoimprinting.

Thermodynamics of charged dilatonic BTZ black holes in rainbow gravity

Science.gov (United States)

Dehghani, M.

2018-02-01

In this paper, the charged three-dimensional Einstein's theory coupled to a dilatonic field has been considered in the rainbow gravity. The dilatonic potential has been written as the linear combination of two Liouville-type potentials. Four new classes of charged dilatonic rainbow black hole solutions, as the exact solution to the coupled field equations of the energy dependent space time, have been obtained. Two of them are correspond to the Coulomb's electric field and the others are consequences of a modified Coulomb's law. Total charge and mass as well as the entropy, temperature and electric potential of the new charged black holes have been calculated in the presence of rainbow functions. Although the thermodynamic quantities are affected by the rainbow functions, it has been found that the first law of black hole thermodynamics is still valid for all of the new black hole solutions. At the final stage, making use of the canonical ensemble method and regarding the black hole heat capacity, the thermal stability or phase transition of the new rainbow black hole solutions have been analyzed.

Thermodynamics of charged dilatonic BTZ black holes in rainbow gravity

Directory of Open Access Journals (Sweden)

M. Dehghani

2018-02-01

Full Text Available In this paper, the charged three-dimensional Einstein's theory coupled to a dilatonic field has been considered in the rainbow gravity. The dilatonic potential has been written as the linear combination of two Liouville-type potentials. Four new classes of charged dilatonic rainbow black hole solutions, as the exact solution to the coupled field equations of the energy dependent space time, have been obtained. Two of them are correspond to the Coulomb's electric field and the others are consequences of a modified Coulomb's law. Total charge and mass as well as the entropy, temperature and electric potential of the new charged black holes have been calculated in the presence of rainbow functions. Although the thermodynamic quantities are affected by the rainbow functions, it has been found that the first law of black hole thermodynamics is still valid for all of the new black hole solutions. At the final stage, making use of the canonical ensemble method and regarding the black hole heat capacity, the thermal stability or phase transition of the new rainbow black hole solutions have been analyzed.

Three dimensional classical theory of rainbow scattering of atoms from surfaces

International Nuclear Information System (INIS)

Pollak, Eli; Miret-Artes, Salvador

2010-01-01

Graphical abstract: In this work, we extend to three dimensions our previous stochastic classical theory on surface rainbow scattering. The stochastic phonon bath is modeled in terms of linear coupling of the phonon modes to the motion of the scattered particle. We take into account the three polarizations of the phonons. Closed formulae are derived for the angular and energy loss distributions. They are readily implemented when assuming that the vertical interaction with the surface is described by a Morse potential. The hard wall limit of the theory is derived and applied to some model corrugated potentials. We find that rainbow structure of the scattered angular distribution reflects the underlying symmetries of the surface. We also distinguish between 'normal rainbows' and 'super rainbows'. The latter occur when the two eigenvalues of the Hessian of the corrugation function vanish simultaneously. - Abstract: In this work, we extend to three dimensions our previous stochastic classical theory on surface rainbow scattering. The stochastic phonon bath is modeled in terms of linear coupling of the phonon modes to the motion of the scattered particle. We take into account the three polarizations of the phonons. Closed formulae are derived for the angular and energy loss distributions. They are readily implemented when assuming that the vertical interaction with the surface is described by a Morse potential. The hard wall limit of the theory is derived and applied to some model corrugated potentials. We find that rainbow structure of the scattered angular distribution reflects the underlying symmetries of the surface. We also distinguish between 'normal rainbows' and 'super rainbows'. The latter occur when the two eigenvalues of the Hessian of the corrugation function vanish simultaneously.

Application of rainbow refractometry for measurement of droplets with solid inclusions

Science.gov (United States)

Li, Can; Wu, Xue-cheng; Cao, Jian-zheng; Chen, Ling-hong; Gréhan, Gerard; Cen, Ke-fa

2018-01-01

Characterization of droplets with solid inclusions is of great research interest and has wide industrial applications. Reported here is a theoretical and experimental investigation of the measurement of droplets with solid inclusions using rainbow refractometry. A rainbow extinction model of a droplet with solid inclusions was deduced based on Beer-Lambert's Law. It takes into account the volume concentration, relative size, scattering efficiency of the solid inclusion, and liquid refractive index. An acoustic levitation system for a single droplet and a global rainbow instrumentation system for spray were integrated to study the effect of the H2O-CaCO3 suspension droplets on the rainbow signal and the measured parameters. The results showed that the rainbow encountered unusual disturbances, introduced by the solid inclusions, but its overall structure was not destroyed. Discoveries also included that for volume concentrations of 2.5% or less the CaCO3 particles with diameters below 4 μm had little effect on the measured parameters of the host droplet. The extinction characteristic was also analyzed. The rainbow extinction model failed to quantity the volume concentration of CaCO3, but succeeded in its qualitative analysis.

Graph sampling

OpenAIRE

Zhang, L.-C.; Patone, M.

2017-01-01

We synthesise the existing theory of graph sampling. We propose a formal definition of sampling in finite graphs, and provide a classification of potential graph parameters. We develop a general approach of Horvitz–Thompson estimation to T-stage snowball sampling, and present various reformulations of some common network sampling methods in the literature in terms of the outlined graph sampling theory.

Algorithms for Planar Graphs and Graphs in Metric Spaces

DEFF Research Database (Denmark)

Wulff-Nilsen, Christian

structural properties that can be exploited. For instance, a road network or a wire layout on a microchip is typically (near-)planar and distances in the network are often defined w.r.t. the Euclidean or the rectilinear metric. Specialized algorithms that take advantage of such properties are often orders...... of magnitude faster than the corresponding algorithms for general graphs. The first and main part of this thesis focuses on the development of efficient planar graph algorithms. The most important contributions include a faster single-source shortest path algorithm, a distance oracle with subquadratic...... for geometric graphs and graphs embedded in metric spaces. Roughly speaking, the stretch factor is a real value expressing how well a (geo-)metric graph approximates the underlying complete graph w.r.t. distances. We give improved algorithms for computing the stretch factor of a given graph and for augmenting...

Charged dilatonic black holes in gravity's rainbow

Energy Technology Data Exchange (ETDEWEB)

Hendi, S.H. [Shiraz University, Physics Department and Biruni Observatory, College of Sciences, Shiraz (Iran, Islamic Republic of); Research Institute for Astronomy and Astrophysics of Maragha (RIAAM), Maragha (Iran, Islamic Republic of); Faizal, Mir [University of Waterloo, Department of Physics and Astronomy, Waterloo, ON (Canada); Panah, B.E. [Shiraz University, Physics Department and Biruni Observatory, College of Sciences, Shiraz (Iran, Islamic Republic of); Panahiyan, S. [Shiraz University, Physics Department and Biruni Observatory, College of Sciences, Shiraz (Iran, Islamic Republic of); Shahid Beheshti University, Physics Department, Tehran (Iran, Islamic Republic of)

2016-05-15

In this paper, we present charged dilatonic black holes in gravity's rainbow. We study the geometric and thermodynamic properties of black hole solutions. We also investigate the effects of rainbow functions on different thermodynamic quantities for these charged black holes in dilatonic gravity's rainbow. Then we demonstrate that the first law of thermodynamics is valid for these solutions. After that, we investigate thermal stability of the solutions using the canonical ensemble and analyze the effects of different rainbow functions on the thermal stability. In addition, we present some arguments regarding the bound and phase transition points in context of geometrical thermodynamics. We also study the phase transition in extended phase space in which the cosmological constant is treated as the thermodynamic pressure. Finally, we use another approach to calculate and demonstrate that the obtained critical points in extended phase space represent a second order phase transition for these black holes. (orig.)

Cell nuclei attributed relational graphs for efficient representation and classification of gastric cancer in digital histopathology

Science.gov (United States)

Sharma, Harshita; Zerbe, Norman; Heim, Daniel; Wienert, Stephan; Lohmann, Sebastian; Hellwich, Olaf; Hufnagl, Peter

2016-03-01

This paper describes a novel graph-based method for efficient representation and subsequent classification in histological whole slide images of gastric cancer. Her2/neu immunohistochemically stained and haematoxylin and eosin stained histological sections of gastric carcinoma are digitized. Immunohistochemical staining is used in practice by pathologists to determine extent of malignancy, however, it is laborious to visually discriminate the corresponding malignancy levels in the more commonly used haematoxylin and eosin stain, and this study attempts to solve this problem using a computer-based method. Cell nuclei are first isolated at high magnification using an automatic cell nuclei segmentation strategy, followed by construction of cell nuclei attributed relational graphs of the tissue regions. These graphs represent tissue architecture comprehensively, as they contain information about cell nuclei morphology as vertex attributes, along with knowledge of neighborhood in the form of edge linking and edge attributes. Global graph characteristics are derived and ensemble learning is used to discriminate between three types of malignancy levels, namely, non-tumor, Her2/neu positive tumor and Her2/neu negative tumor. Performance is compared with state of the art methods including four texture feature groups (Haralick, Gabor, Local Binary Patterns and Varma Zisserman features), color and intensity features, and Voronoi diagram and Delaunay triangulation. Texture, color and intensity information is also combined with graph-based knowledge, followed by correlation analysis. Quantitative assessment is performed using two cross validation strategies. On investigating the experimental results, it can be concluded that the proposed method provides a promising way for computer-based analysis of histopathological images of gastric cancer.

Remnants of black rings from gravity’s rainbow

Energy Technology Data Exchange (ETDEWEB)

Ali, Ahmed Farag [Center for Fundamental Physics, Zewail City of Science and Technology,6th of October City, Giza 12588 (Egypt); Department of Physics, Faculty of Science, Benha University,Benha 13518 (Egypt); Faizal, Mir [Department of Physics and Astronomy, University of Waterloo,Waterloo, Ontario, N2L 3G1 (Canada); Khalil, Mohammed M. [Department of Electrical Engineering, Alexandria University,El-Horreya Rd., Alexandria 12544 (Egypt)

2014-12-29

In this paper, we investigate a spinning black ring and a charged black ring in the context of gravity’s rainbow. By incorporating rainbow functions proposed by Amelino-Camelia, et al. in http://dx.doi.org/10.1142/S0217751X97000566 http://dx.doi.org/10.12942/lrr-2013-5 in the metric of the black rings, a considerable modification happens to their thermodynamical properties. We calculate corrections to the temperature, entropy and heat capacity of the black rings. These calculations demonstrate that the behavior of Hawking radiation changes considerably near the Planck scale in gravity’s rainbow, where it is shown that black rings do not evaporate completely and a remnant is left as the black rings evaporate down to Planck scale.

Plump Cutthroat Trout and Thin Rainbow Trout in a Lentic Ecosystem

OpenAIRE

Courtney, Joshua; Abbott, Jessica; Schmidt, Kerri; Courtney, Michael

2012-01-01

Background: Much has been written about introduced rainbow trout (Oncorhynchus mykiss) interbreeding and outcompeting cutthroat trout (Oncorhynchus clarkii). However, the specific mechanisms by which rainbow trout and their hybrids outcompete cutthroat trout have not been thoroughly explored, and the published data is limited to lotic ecosystems. Materials and Methods: Samples of rainbow trout and cutthroat trout were obtained from a lentic ecosystem by angling. The total length and weight of...

Three dimensional classical theory of rainbow scattering of atoms from surfaces

Energy Technology Data Exchange (ETDEWEB)

Pollak, Eli, E-mail: eli.pollak@weizmann.ac.il [Chemical Physics Department, Weizmann Institute of Science, 76100 Rehovoth (Israel); Miret-Artes, Salvador [Instituto de Fisica Fundamental, Consejo Superior de Investigaciones Cientificas, Serrano 123, 28006 Madrid (Spain)

2010-10-05

Graphical abstract: In this work, we extend to three dimensions our previous stochastic classical theory on surface rainbow scattering. The stochastic phonon bath is modeled in terms of linear coupling of the phonon modes to the motion of the scattered particle. We take into account the three polarizations of the phonons. Closed formulae are derived for the angular and energy loss distributions. They are readily implemented when assuming that the vertical interaction with the surface is described by a Morse potential. The hard wall limit of the theory is derived and applied to some model corrugated potentials. We find that rainbow structure of the scattered angular distribution reflects the underlying symmetries of the surface. We also distinguish between 'normal rainbows' and 'super rainbows'. The latter occur when the two eigenvalues of the Hessian of the corrugation function vanish simultaneously. - Abstract: In this work, we extend to three dimensions our previous stochastic classical theory on surface rainbow scattering. The stochastic phonon bath is modeled in terms of linear coupling of the phonon modes to the motion of the scattered particle. We take into account the three polarizations of the phonons. Closed formulae are derived for the angular and energy loss distributions. They are readily implemented when assuming that the vertical interaction with the surface is described by a Morse potential. The hard wall limit of the theory is derived and applied to some model corrugated potentials. We find that rainbow structure of the scattered angular distribution reflects the underlying symmetries of the surface. We also distinguish between 'normal rainbows' and 'super rainbows'. The latter occur when the two eigenvalues of the Hessian of the corrugation function vanish simultaneously.

Interim report on Mitsubishi's results using rainbow for stage 1 verification

International Nuclear Information System (INIS)

Ohkubo, Y.; Kinjo, H.; Itoh, K.

1990-01-01

Analytical work on the benchmark problems is underway at Mitsubishi by using RAINBOW code. This interim report contains the results of examples 1, 2, 4 and 5. In the following, the brief outline of RAINBOW code is described, and then the analyzed results of the examples are reported. RAINBOW code is a three-dimensional core deformation analysis code developed by Mitsubishi Atomic Power Industries, Inc. In the RAINBOW code, core elements are approximated in straight beams and the beam theory is applied in the analysis of their deflections due to mechanical interactions among core elements. It can handle various sectors of the whole core, assuming a boundary condition of rotational or reflective symmetry. (author). 6 tabs, figs

Impacts of Northern Pike on stocked Rainbow Trout in Pactola Reservoir, South Dakota

Science.gov (United States)

Scheibel, Natalie C.; Dembkowski, Daniel J.; Davis, Jacob L.; Chipps, Steven R.

2016-01-01

Establishment of nonnative Northern Pike Esox lucius in Pactola Reservoir, South Dakota, has prompted concern among biologists about the influence of this species on the lake’s intensively managed salmonid fisheries. Ancedotal information suggests that catch rates of Rainbow Trout Oncorhynchus mykiss have declined while mean size and abundance of Northern Pike has increased, although quantitative information on diet and growth of the Northern Pike population is lacking. To address potential interactions between Northern Pike and Rainbow Trout, we assessed size-dependent predation by Northern Pike on Rainbow Trout and determined the relative energetic contribution of stocked Rainbow Trout to Northern Pike growth using bioenergetics modeling. Stable isotopes combined with traditional diet analyses revealed that smaller Northern Pike (Trout contributed less than 10% to their annual energy consumption. In contrast, larger Northern Pike (≥600 mm TL) consumed primarily Rainbow Trout, which accounted for 56% of their annual energy consumption. Combining estimates of Northern Pike predation with production costs of catchable-size Rainbow Trout revealed that annual economic losses ranged from US$15,259 to $24,801 per year. Over its lifespan, an age-10 Northern Pike was estimated to consume ~117 Rainbow Trout worth approximately $340. Thus, Northern Pike predation substantially influences salmonid management initiatives and is likely a primary factor contributing to reduced Rainbow Trout abundance and return to anglers in Pactola Reservoir. Strategies for reducing Northern Pike predation on Rainbow Trout include increasing the size of stocked fish or altering the timing and spatial distribution of stocking events.

Reassessment of the predatory effects of rainbow smelt on ciscoes in Lake Superior

Science.gov (United States)

Myers, Jared T.; Jones, Michael L.; Stockwell, Jason D.; Yule, Daniel L.

2009-01-01

Evidence from small lakes suggests that predation on larval ciscoes Coregonus artedi by nonnative rainbow smelt Osmerus mordax can lead to cisco suppression or extirpation. However, evidence from larger lakes has led to equivocal conclusions. In this study, we examine the potential predation effects of rainbow smelt in two adjacent but contrasting embayments in Lake Superior (Thunder and Black bays, Ontario). During May 2006, we sampled the ichthyoplankton, pelagic fish communities, and diet composition of rainbow smelt in both bays. Using acoustics and midwater trawling, we estimated rainbow smelt densities to be 476 ± 34/ha (mean ± SE) in Thunder Bay and 3,435 ± 460/ha in Black Bay. We used a bioenergetics model to estimate the proportion of cisco larvae consumed by rainbow smelt. Our results suggest that predation by rainbow smelt accounts for 15–52% and 37–100% of the mortality of larval ciscoes in Thunder and Black bays, respectively, depending on the predator feeding rate and the scale of predator–prey overlap. We also examined the sensitivity of past conclusions (based on 1974 field collections) to assumptions of temporal overlap between rainbow smelt and larval ciscoes and estimates of rainbow smelt abundance derived from bottom trawl samples. After adjusting these parameters to reflect current understanding, we found that the previous predation estimates may have been conservative. We conclude that rainbow smelt may have been a more important contributor to the demise and slow recovery of ciscoes in Lake Superior than previously thought.

Virulence of Flavobacterium columnare genomovars in rainbow trout Oncorhynchus mykiss.

Science.gov (United States)

Evenhuis, Jason P; LaFrentz, Benjamin R

2016-08-09

Flavobacterium columnare is the causative agent of columnaris disease and is responsible for significant economic losses in aquaculture. F. columnare is a Gram-negative bacterium, and 5 genetic types or genomovars have been described based on restriction fragment length polymorphism of the 16S rRNA gene. Previous research has suggested that genomovar II isolates are more virulent than genomovar I isolates to multiple species of fish, including rainbow trout Oncorhynchus mykiss. In addition, improved genotyping methods have shown that some isolates previously classified as genomovar I, and used in challenge experiments, were in fact genomovar III. Our objective was to confirm previous results with respect to genomovar II virulence, and to determine the susceptibility of rainbow trout to other genomovars. The virulence of 8 genomovar I, 4 genomovar II, 3 genomovar II-B, and 5 genomovar III isolates originating from various sources was determined through 3 independent challenges in rainbow trout using an immersion challenge model. Mean cumulative percent mortality (CPM) of ~49% for genomovar I isolates, ~1% for genomovar II, ~5% for the II-B isolates, and ~7% for the III isolates was observed. The inability of genomovar II isolates to produce mortalities in rainbow trout was unanticipated based on previous studies, but may be due to a number of factors including rainbow trout source and water chemistry. The source of fish and/or the presence of sub-optimal environment may influence the susceptibility of rainbow trout to different F. columnare genomovars.

Linear game non-contextuality and Bell inequalities—a graph-theoretic approach

International Nuclear Information System (INIS)

Rosicka, M; Ramanathan, R; Gnaciński, P; Horodecki, M; Horodecki, K; Horodecki, P; Severini, S

2016-01-01

We study the classical and quantum values of a class of one- and two-party unique games, that generalizes the well-known XOR games to the case of non-binary outcomes. In the bipartite case the generalized XOR (XOR-d) games we study are a subclass of the well-known linear games. We introduce a ‘constraint graph’ associated to such a game, with the constraints defining the game represented by an edge-coloring of the graph. We use the graph-theoretic characterization to relate the task of finding equivalent games to the notion of signed graphs and switching equivalence from graph theory. We relate the problem of computing the classical value of single-party anti-correlation XOR games to finding the edge bipartization number of a graph, which is known to be MaxSNP hard, and connect the computation of the classical value of XOR-d games to the identification of specific cycles in the graph. We construct an orthogonality graph of the game from the constraint graph and study its Lovász theta number as a general upper bound on the quantum value even in the case of single-party contextual XOR-d games. XOR-d games possess appealing properties for use in device-independent applications such as randomness of the local correlated outcomes in the optimal quantum strategy. We study the possibility of obtaining quantum algebraic violation of these games, and show that no finite XOR-d game possesses the property of pseudo-telepathy leaving the frequently used chained Bell inequalities as the natural candidates for such applications. We also show this lack of pseudo-telepathy for multi-party XOR-type inequalities involving two-body correlation functions. (paper)

Linear game non-contextuality and Bell inequalities—a graph-theoretic approach

Science.gov (United States)

Rosicka, M.; Ramanathan, R.; Gnaciński, P.; Horodecki, K.; Horodecki, M.; Horodecki, P.; Severini, S.

2016-04-01

We study the classical and quantum values of a class of one- and two-party unique games, that generalizes the well-known XOR games to the case of non-binary outcomes. In the bipartite case the generalized XOR (XOR-d) games we study are a subclass of the well-known linear games. We introduce a ‘constraint graph’ associated to such a game, with the constraints defining the game represented by an edge-coloring of the graph. We use the graph-theoretic characterization to relate the task of finding equivalent games to the notion of signed graphs and switching equivalence from graph theory. We relate the problem of computing the classical value of single-party anti-correlation XOR games to finding the edge bipartization number of a graph, which is known to be MaxSNP hard, and connect the computation of the classical value of XOR-d games to the identification of specific cycles in the graph. We construct an orthogonality graph of the game from the constraint graph and study its Lovász theta number as a general upper bound on the quantum value even in the case of single-party contextual XOR-d games. XOR-d games possess appealing properties for use in device-independent applications such as randomness of the local correlated outcomes in the optimal quantum strategy. We study the possibility of obtaining quantum algebraic violation of these games, and show that no finite XOR-d game possesses the property of pseudo-telepathy leaving the frequently used chained Bell inequalities as the natural candidates for such applications. We also show this lack of pseudo-telepathy for multi-party XOR-type inequalities involving two-body correlation functions.

Rainbows: Mie computations and the Airy approximation.

Science.gov (United States)

Wang, R T; van de Hulst, H C

1991-01-01

Efficient and accurate computation of the scattered intensity pattern by the Mie formulas is now feasible for size parameters up to x = 50,000 at least, which in visual light means spherical drops with diameters up to 6 mm. We present a method for evaluating the Mie coefficients from the ratios between Riccati-Bessel and Neumann functions of successive order. We probe the applicability of the Airy approximation, which we generalize to rainbows of arbitrary p (number of internal reflections = p - 1), by comparing the Mie and Airy intensity patterns. Millimeter size water drops show a match in all details, including the position and intensity of the supernumerary maxima and the polarization. A fairly good match is still seen for drops of 0.1 mm. A small spread in sizes helps to smooth out irrelevant detail. The dark band between the rainbows is used to test more subtle features. We conclude that this band contains not only externally reflected light (p = 0) but also a sizable contribution f rom the p = 6 and p = 7 rainbows, which shift rapidly with wavelength. The higher the refractive index, the closer both theories agree on the first primary rainbow (p = 2) peak for drop diameters as small as 0.02 mm. This may be useful in supporting experimental work.

Degree Associated Edge Reconstruction Number of Graphs with Regular Pruned Graph

Directory of Open Access Journals (Sweden)

P. Anusha Devi

2015-10-01

Full Text Available An ecard of a graph $G$ is a subgraph formed by deleting an edge. A da-ecard specifies the degree of the deleted edge along with the ecard. The degree associated edge reconstruction number of a graph $G,~dern(G,$ is the minimum number of da-ecards that uniquely determines $G.$  The adversary degree associated edge reconstruction number of a graph $G, adern(G,$ is the minimum number $k$ such that every collection of $k$ da-ecards of $G$ uniquely determines $G.$ The maximal subgraph without end vertices of a graph $G$ which is not a tree is the pruned graph of $G.$ It is shown that $dern$ of complete multipartite graphs and some connected graphs with regular pruned graph is $1$ or $2.$ We also determine $dern$ and $adern$ of corona product of standard graphs.

Introduction to graph theory

CERN Document Server

Trudeau, Richard J

1994-01-01

Preface1. Pure Mathematics Introduction; Euclidean Geometry as Pure Mathematics; Games; Why Study Pure Mathematics?; What's Coming; Suggested Reading2. Graphs Introduction; Sets; Paradox; Graphs; Graph diagrams; Cautions; Common Graphs; Discovery; Complements and Subgraphs; Isomorphism; Recognizing Isomorphic Graphs; Semantics The Number of Graphs Having a Given nu; Exercises; Suggested Reading3. Planar Graphs Introduction; UG, K subscript 5, and the Jordan Curve Theorem; Are there More Nonplanar Graphs?; Expansions; Kuratowski's Theorem; Determining Whether a Graph is Planar or

On an edge partition and root graphs of some classes of line graphs

Directory of Open Access Journals (Sweden)

K Pravas

2017-04-01

Full Text Available The Gallai and the anti-Gallai graphs of a graph $G$ are complementary pairs of spanning subgraphs of the line graph of $G$. In this paper we find some structural relations between these graph classes by finding a partition of the edge set of the line graph of a graph $G$ into the edge sets of the Gallai and anti-Gallai graphs of $G$. Based on this, an optimal algorithm to find the root graph of a line graph is obtained. Moreover, root graphs of diameter-maximal, distance-hereditary, Ptolemaic and chordal graphs are also discussed.

Graphs and matrices

CERN Document Server

Bapat, Ravindra B

2014-01-01

This new edition illustrates the power of linear algebra in the study of graphs. The emphasis on matrix techniques is greater than in other texts on algebraic graph theory. Important matrices associated with graphs (for example, incidence, adjacency and Laplacian matrices) are treated in detail. Presenting a useful overview of selected topics in algebraic graph theory, early chapters of the text focus on regular graphs, algebraic connectivity, the distance matrix of a tree, and its generalized version for arbitrary graphs, known as the resistance matrix. Coverage of later topics include Laplacian eigenvalues of threshold graphs, the positive definite completion problem and matrix games based on a graph. Such an extensive coverage of the subject area provides a welcome prompt for further exploration. The inclusion of exercises enables practical learning throughout the book. In the new edition, a new chapter is added on the line graph of a tree, while some results in Chapter 6 on Perron-Frobenius theory are reo...

Graphs cospectral with a friendship graph or its complement

Directory of Open Access Journals (Sweden)

Alireza Abdollahi

2013-12-01

Full Text Available Let $n$ be any positive integer and let $F_n$ be the friendship (or Dutch windmill graph with $2n+1$ vertices and $3n$ edges. Here we study graphs with the same adjacency spectrum as the $F_n$. Two graphs are called cospectral if the eigenvalues multiset of their adjacency matrices are the same. Let $G$ be a graph cospectral with $F_n$. Here we prove that if $G$ has no cycle of length $4$ or $5$, then $Gcong F_n$. Moreover if $G$ is connected and planar then $Gcong F_n$.All but one of connected components of $G$ are isomorphic to $K_2$.The complement $overline{F_n}$ of the friendship graph is determined by its adjacency eigenvalues, that is, if $overline{F_n}$ is cospectral with a graph $H$, then $Hcong overline{F_n}$.

Remnant for all black objects due to gravity's rainbow

Energy Technology Data Exchange (ETDEWEB)

Ali, Ahmed Farag, E-mail: afarag@zewailcity.edu.eg [Department of Physics, Florida State University, Tallahassee, FL 32306 (United States); Center for Fundamental Physics, Zewail City of Science and Technology, Giza 12588 (Egypt); Department of Physics, Faculty of Science, Benha University, Benha 13518 (Egypt); Faizal, Mir, E-mail: f2mir@uwaterloo.ca [Department of Physics and Astronomy, University of Waterloo, Waterloo, Ontario, N2L 3G1 (Canada); Khalil, Mohammed M., E-mail: moh.m.khalil@gmail.com [Department of Electrical Engineering, Alexandria University, Alexandria 12544 (Egypt)

2015-05-15

We argue that a remnant is formed for all black objects in gravity's rainbow. This will be based on the observation that a remnant depends critically on the structure of the rainbow functions, and this dependence is a model independent phenomena. We thus propose general relations for the modified temperature and entropy of all black objects in gravity's rainbow. We explicitly check this to be the case for Kerr, Kerr–Newman-dS, charged-AdS, and higher dimensional Kerr–AdS black holes. We also try to argue that a remnant should form for black saturn in gravity's rainbow. This work extends our previous results on remnants of Schwarzschild black holes and black rings.

Of gluons and gravitons. Exploring color-kinematics duality

International Nuclear Information System (INIS)

Isermann, Reinke Sven

2013-06-01

In this thesis color-kinematics duality will be investigated. This duality is a statement about the kinematical dependence of a scattering amplitude in Yang-Mills gauge theories obeying group theoretical relations similar to that of the color gauge group. The major consequence of this duality is that gravity amplitudes can be related to a certain double copy of gauge theory amplitudes. The main focus of this thesis is on exploring the foundations of color-kinematics duality and its consequences. It is shown how color-kinematics duality can be made manifest at the one-loop level for rational amplitudes. A Lagrangian-based argument will be given for the validity of the double copy construction for these amplitudes including explicit examples at four points. Secondly, it is studied how color-kinematics duality can be used to improve powercounting in gravity theories. To this end the duality is reformulated in terms of linear maps. It is shown as an example how this can be used to derive the large BCFW shift behavior of a gravity integrand constructed through the duality to any loop order up to subtleties inherent to the duality that is addressed. As it becomes clear the duality implies massive cancellations with respect to the usual powercounting of Feynman graphs indicating that gravity theories are much better behaved than naively expected. As another example the linear map approach will be used to investigate the question of UV-finiteness of N=8 supergravity, and it is seen that the amount of cancellations depends on the exact implementation of the duality at loop level. Lastly, color-kinematics duality is considered from a Feynman-graph perspective reproducing some of the results of the earlier chapters thus giving non-trivial evidence for the duality at the loop level from a different perspective.

Of gluons and gravitons. Exploring color-kinematics duality

Energy Technology Data Exchange (ETDEWEB)

Isermann, Reinke Sven

2013-06-15

In this thesis color-kinematics duality will be investigated. This duality is a statement about the kinematical dependence of a scattering amplitude in Yang-Mills gauge theories obeying group theoretical relations similar to that of the color gauge group. The major consequence of this duality is that gravity amplitudes can be related to a certain double copy of gauge theory amplitudes. The main focus of this thesis is on exploring the foundations of color-kinematics duality and its consequences. It is shown how color-kinematics duality can be made manifest at the one-loop level for rational amplitudes. A Lagrangian-based argument will be given for the validity of the double copy construction for these amplitudes including explicit examples at four points. Secondly, it is studied how color-kinematics duality can be used to improve powercounting in gravity theories. To this end the duality is reformulated in terms of linear maps. It is shown as an example how this can be used to derive the large BCFW shift behavior of a gravity integrand constructed through the duality to any loop order up to subtleties inherent to the duality that is addressed. As it becomes clear the duality implies massive cancellations with respect to the usual powercounting of Feynman graphs indicating that gravity theories are much better behaved than naively expected. As another example the linear map approach will be used to investigate the question of UV-finiteness of N=8 supergravity, and it is seen that the amount of cancellations depends on the exact implementation of the duality at loop level. Lastly, color-kinematics duality is considered from a Feynman-graph perspective reproducing some of the results of the earlier chapters thus giving non-trivial evidence for the duality at the loop level from a different perspective.

Graph embedding with rich information through heterogeneous graph

KAUST Repository

Sun, Guolei

2017-11-12

Graph embedding, aiming to learn low-dimensional representations for nodes in graphs, has attracted increasing attention due to its critical application including node classification, link prediction and clustering in social network analysis. Most existing algorithms for graph embedding only rely on the topology information and fail to use the copious information in nodes as well as edges. As a result, their performance for many tasks may not be satisfactory. In this thesis, we proposed a novel and general framework for graph embedding with rich text information (GERI) through constructing a heterogeneous network, in which we integrate node and edge content information with graph topology. Specially, we designed a novel biased random walk to explore the constructed heterogeneous network with the notion of flexible neighborhood. Our sampling strategy can compromise between BFS and DFS local search on heterogeneous graph. To further improve our algorithm, we proposed semi-supervised GERI (SGERI), which learns graph embedding in an discriminative manner through heterogeneous network with label information. The efficacy of our method is demonstrated by extensive comparison experiments with 9 baselines over multi-label and multi-class classification on various datasets including Citeseer, Cora, DBLP and Wiki. It shows that GERI improves the Micro-F1 and Macro-F1 of node classification up to 10%, and SGERI improves GERI by 5% in Wiki.

Topics in graph theory graphs and their Cartesian product

CERN Document Server

Imrich, Wilfried; Rall, Douglas F

2008-01-01

From specialists in the field, you will learn about interesting connections and recent developments in the field of graph theory by looking in particular at Cartesian products-arguably the most important of the four standard graph products. Many new results in this area appear for the first time in print in this book. Written in an accessible way, this book can be used for personal study in advanced applications of graph theory or for an advanced graph theory course.

An Interview with Alex Sanchez, Author of "Rainbow Boys."

Science.gov (United States)

Emert, Toby

2002-01-01

Presents an interview with Alex Sanchez. Notes that his book "Rainbow Boys" has been called the "best gay youth book of the year." Notes that "Rainbow Boys" chronicles the lives of three high school seniors who struggle to manage their issues about sexual identity and coming out to themselves, to each other, and to the world. (SG)

An Automatic Cognitive Graph-Based Segmentation for Detection of Blood Vessels in Retinal Images

Directory of Open Access Journals (Sweden)

Rasha Al Shehhi

2016-01-01

Full Text Available This paper presents a hierarchical graph-based segmentation for blood vessel detection in digital retinal images. This segmentation employs some of perceptual Gestalt principles: similarity, closure, continuity, and proximity to merge segments into coherent connected vessel-like patterns. The integration of Gestalt principles is based on object-based features (e.g., color and black top-hat (BTH morphology and context and graph-analysis algorithms (e.g., Dijkstra path. The segmentation framework consists of two main steps: preprocessing and multiscale graph-based segmentation. Preprocessing is to enhance lighting condition, due to low illumination contrast, and to construct necessary features to enhance vessel structure due to sensitivity of vessel patterns to multiscale/multiorientation structure. Graph-based segmentation is to decrease computational processing required for region of interest into most semantic objects. The segmentation was evaluated on three publicly available datasets. Experimental results show that preprocessing stage achieves better results compared to state-of-the-art enhancement methods. The performance of the proposed graph-based segmentation is found to be consistent and comparable to other existing methods, with improved capability of detecting small/thin vessels.

Rainbow-shift mechanism behind discrete optical-potential ambiguities

International Nuclear Information System (INIS)

Brandan, M.E.; McVoy, K.W.

1991-01-01

Some years ago, Drisko et al. suggested that the discrete ambiguity often encountered for elastic scattering optical potentials could be understood as being due to the interior or small-l S-matrix elements for two ''equivalent'' potentials differing in phase by 2π, l-by-l. We point out that the absence of this phase change for peripheral partial waves is equally essential, and suggest that a deeper understanding of the ambiguity may be achieved by viewing it as a consequence of a farside interference between interior and peripheral partial waves. It is this interference which produces the broad ''Airy maxima'' of a nuclear rainbow, and we show that a Drisko-type phase-shift increment δ l →(δ l +π) for low-l phases relative to the high-l ones is exactly what is needed to shift a farside rainbow pattern by one Airy maximum, thus providing an equivalent ''rainbow-shift'' interpretation of the discrete ambiguity. The physical importance of both interpretations lies in the fact that the existence of discrete ambiguities (as well as of nuclear rainbows) is explicit evidence for low-l transparency in nucleus-nucleus collisions. The essential role played by low partial waves explains why peripheral reactions have generally not proven helpful in resolving this ambiguity

Handbook of graph grammars and computing by graph transformation

CERN Document Server

Engels, G; Kreowski, H J; Rozenberg, G

1999-01-01

Graph grammars originated in the late 60s, motivated by considerations about pattern recognition and compiler construction. Since then, the list of areas which have interacted with the development of graph grammars has grown quite impressively. Besides the aforementioned areas, it includes software specification and development, VLSI layout schemes, database design, modeling of concurrent systems, massively parallel computer architectures, logic programming, computer animation, developmental biology, music composition, visual languages, and many others.The area of graph grammars and graph tran

Rainbows in channeling of charged particles in crystals and nanotubes

CERN Document Server

Nešković, Nebojša; Ćosić, Marko

2017-01-01

This book discusses the effects, modeling, latest results, and nanotechnology applications of rainbows that appear during channeling of charged particles in crystals and nanotubes. The authors begin with a brief review of the optical and particle rainbow effects followed by a detailed description of crystal rainbows, which appear in ion channeling in crystals, and their modeling using catastrophe theory. The effects of spatial and angular focusing of channeled ions are described, with special attention given to the applications of the former effect to subatomic microscopy. The results of a thorough study of the recent high-resolution channeling experiments performed with protons of energies between 2.0 and 0.7 MeV and a 55 nm thick silicon crystal are also provided. This study opens up the potential for accurate analysis of very thin crystals. Also presented are recent results related to rainbows occurring in proton transmission through carbon nanotubes, and a detailed quantum consideration of the transmissio...

Three-dimensional dilatonic gravity's rainbow: Exact solutions

International Nuclear Information System (INIS)

Hossein Hendi, Seyed; Eslam Panah, Behzad; Panahiyan, Shahram

2016-01-01

Deep relations of dark energy scenario and string theory results into dilaton gravity, on the one hand, and the connection between quantum gravity and gravity's rainbow, on the other hand, motivate us to consider three-dimensional dilatonic black hole solutions in gravity's rainbow. We obtain two classes of the solutions, which are polynomial and logarithmic forms. We also calculate conserved and thermodynamic quantities, and examine the first law of thermodynamics for both classes. In addition, we study thermal stability and show that one of the classes is thermally stable while the other one is unstable.

All aboard the Rainbow Warrior

International Nuclear Information System (INIS)

Walker, I.

1980-01-01

An account is given of the attempt by Rainbow Warrior to intercept Pacific Swan at Cherbourg Harbour, to protest against the transport of spent nuclear fuel from England to France for reprocessing. (U.K.)

Subunit vaccine candidates against Aeromonas salmonicida in rainbow trout Oncorhynchus mykiss

DEFF Research Database (Denmark)

Marana, Moonika Haahr; Jørgensen, Louise von Gersdorff; Skov, Jakob

2017-01-01

rainbow trout (Oncorhynchus mykiss, Walbaum) aquaculture furunculosis outbreaks still occur. In this study we tested the efficacy of experimental subunit vaccines against A. salmonicida infection in rainbow trout. We utilized in silico screening of the proteome of A. salmonicida subsp. salmonicida strain...... A449 and identified potential protective protein antigens that were tested by in vivo challenge trial. A total of 14 proteins were recombinantly expressed in Escherichia coli and prepared in 3 different subunit vaccine combinations to immunize 3 groups of rainbow trout by intraperitoneal (i...

Ecological factors affecting Rainbow Smelt recruitment in the main basin of Lake Huron, 1976-2010

Science.gov (United States)

O'Brien, Timothy P.; Taylor, William W.; Roseman, Edward F.; Madenjian, Charles P.; Riley, Stephen C.

2014-01-01

Rainbow Smelt Osmerus mordax are native to northeastern Atlantic and Pacific–Arctic drainages and have been widely introduced throughout North America. In the Great Lakes region, Rainbow Smelt are known predators and competitors of native fish and a primary prey species in pelagic food webs. Despite their widespread distribution, importance as a prey species, and potential to negatively interact with native fish species, there is limited information concerning stock–recruitment relationships for Rainbow Smelt. To better understand recruitment mechanisms, we evaluated potential ecological factors determining recruitment dynamics for Rainbow Smelt in Lake Huron using data from bottom trawl catches. We specifically evaluated influence of stock size, environmental factors (water temperature, lake levels, and precipitation), and salmonine predation on the production of age-0 recruits from 1976 to 2010. Rainbow Smelt recruitment was negatively related to stock size exceeding 10 kg/ha, indicating that compensatory, density-dependent mortality from cannibalism or intraspecific competition was an important factor related to the production of age-0 recruits. Recruitment was positively related to spring precipitation suggesting that the amount of stream-spawning habitat as determined by precipitation was important for the production of strong Rainbow Smelt recruitment. Additionally, density of age-0 Rainbow Smelt was positively related to Lake Trout Salvelinus namaycush abundance. However, spawning stock biomass of Rainbow Smelt, which declined substantially from 1989 to 2010, was negatively associated with Lake Trout catch per effort suggesting predation was an important factor related to the decline of age-2 and older Rainbow Smelt in Lake Huron. As such, we found that recruitment of Rainbow Smelt in Lake Huron was regulated by competition with or cannibalism by older conspecifics, spring precipitation influencing stream spawning habitats, and predation by Lake Trout on

F(R Gravity’s Rainbow and Its Einstein Counterpart

Directory of Open Access Journals (Sweden)

S. H. Hendi

2016-01-01

Full Text Available Motivated by UV completion of general relativity with a modification of a geometry at high energy scale, it is expected to have an energy dependent geometry. In this paper, we introduce charged black hole solutions with power Maxwell invariant source in the context of gravity’s rainbow. In addition, we investigate two classes of F(R gravity’s rainbow solutions. At first, we study energy dependent F(R gravity without energy-momentum tensor, and then we obtain F(R gravity’s rainbow in the presence of conformally invariant Maxwell source. We study geometrical properties of the mentioned solutions and compare their results. We also give some related comments regarding thermodynamical behavior of the obtained solutions and discuss thermal stability of the solutions.

Rainbow fringes around crevice corrosion formed on stainless steel AISI 316 after ennoblement in seawater

Energy Technology Data Exchange (ETDEWEB)

Wang, W.; Zhang, X. [College of Chemistry and Chemical Engineering, Ocean University of China, Qingdao (China); Wang, J. [College of Chemistry and Chemical Engineering, Ocean University of China, Qingdao (China); State Key Laboratory for Corrosion and Protection, Shenyang (China)

2009-10-15

The crevice corrosion occurrence probability of stainless steel (SS) AISI 316 was increased under ennoblement condition due to chemically added H{sub 2}O{sub 2} into seawater. The H{sub 2}O{sub 2} was used to simulate the important factor causing ennoblement in natural marine biofilm. Morphology of the crevice corrosion was observed using an incident-light source microscopy. Some interesting ''rainbow'' fringes were observed around micro-crevices. The mechanism was discussed from the ions diffusion and potential distribution during the crevice formation. This result shows that under ennoblement condition the colored fringe is a distinct characteristic of the morphology of localized corrosion for stainless steel. (Abstract Copyright [2009], Wiley Periodicals, Inc.)

Black hole thermodynamics in Lovelock gravity's rainbow with (AdS asymptote

Directory of Open Access Journals (Sweden)

Seyed Hossein Hendi

2017-01-01

Full Text Available In this paper, we combine Lovelock gravity with gravity's rainbow to construct Lovelock gravity's rainbow. Considering the Lovelock gravity's rainbow coupled to linear and also nonlinear electromagnetic gauge fields, we present two new classes of topological black hole solutions. We compute conserved and thermodynamic quantities of these black holes (such as temperature, entropy, electric potential, charge and mass and show that these quantities satisfy the first law of thermodynamics. In order to study the thermal stability in canonical ensemble, we calculate the heat capacity and determinant of the Hessian matrix and show in what regions there are thermally stable phases for black holes. Also, we discuss the dependence of thermodynamic behavior and thermal stability of black holes on rainbow functions. Finally, we investigate the critical behavior of black holes in the extended phase space and study their interesting properties.

How can rainbow gravity affect on gravitational force?

OpenAIRE

Sefiedgar, A. S.

2015-01-01

According to Verlinde's recent proposal, the gravity is originally an entropic force. In this work, we obtain the corrections to the entropy-area law of black holes within rainbow gravity. The corrected entropy-area law leads to the modifications of the number of bits $N$. Inspired by Verlinde's argument on the entropic force, and using the modified number of bits, we can investigate the effects of rainbow gravity on the modified Newtonian dynamics, Newton's law of gravitation, and Einstein's...

Color-suppression of non-planar diagrams in bosonic bound states

Science.gov (United States)

Alvarenga Nogueira, J. H.; Ji, Chueng-Ryong; Ydrefors, E.; Frederico, T.

2018-02-01

We study the suppression of non-planar diagrams in a scalar QCD model of a meson system in 3 + 1 space-time dimensions due to the inclusion of the color degrees of freedom. As a prototype of the color-singlet meson, we consider a flavor-nonsinglet system consisting of a scalar-quark and a scalar-antiquark with equal masses exchanging a scalar-gluon of a different mass, which is investigated within the framework of the homogeneous Bethe-Salpeter equation. The equation is solved by using the Nakanishi representation for the manifestly covariant bound-state amplitude and its light-front projection. The resulting non-singular integral equation is solved numerically. The damping of the impact of the cross-ladder kernel on the binding energies are studied in detail. The color-suppression of the cross-ladder effects on the light-front wave function and the elastic electromagnetic form factor are also discussed. As our results show, the suppression appears significantly large for Nc = 3, which supports the use of rainbow-ladder truncations in practical non-perturbative calculations within QCD.

Centrosymmetric Graphs And A Lower Bound For Graph Energy Of Fullerenes

Directory of Open Access Journals (Sweden)

Katona Gyula Y.

2014-11-01

Full Text Available The energy of a molecular graph G is defined as the summation of the absolute values of the eigenvalues of adjacency matrix of a graph G. In this paper, an infinite class of fullerene graphs with 10n vertices, n ≥ 2, is considered. By proving centrosymmetricity of the adjacency matrix of these fullerene graphs, a lower bound for its energy is given. Our method is general and can be extended to other class of fullerene graphs.

Graphs and Homomorphisms

CERN Document Server

Hell, Pavol

2004-01-01

This is a book about graph homomorphisms. Graph theory is now an established discipline but the study of graph homomorphisms has only recently begun to gain wide acceptance and interest. The subject gives a useful perspective in areas such as graph reconstruction, products, fractional and circular colourings, and has applications in complexity theory, artificial intelligence, telecommunication, and, most recently, statistical physics.Based on the authors' lecture notes for graduate courses, this book can be used as a textbook for a second course in graph theory at 4th year or master's level an

Spinal deformities in triploid all-female rainbow trout ( Oncorhynchus mykiss )

DEFF Research Database (Denmark)

Madsen, Lone; Arnbjerg, J.; Dalsgaard, Inger

2000-01-01

A batch of experimental rainbow trout was found to have a high level of spinal deformities. An equal deformity level was found in fish from the same batch, but reared at the fish farm from where the fry originated, suggesting that the all-female triploid status of the rainbow trout might account...

Does Oral Vaccination Protect Rainbow Trout (Oncorhynchus mykiss) Against Enteric Red Mouth Disease?

DEFF Research Database (Denmark)

Neumann, Lukas; Villumsen, Kasper Rømer; Kragelund Strøm, Helene

. ruckeri bacteria are need in order to obtain significantly increased immunity against the disease. These results suggest that a high amount of the vaccine is digested in the stomach of the rainbow trout and therefore did not reach the intestine as immunogenic antigens. The project is still ongoing....... The objective for this project is to investigate whether oral vaccination of rainbow trout against Yersinia ruckeri O1 (biotype 1) causing Enteric Red Mouth disease (ERM) can protect rainbow trout against a subsequent experimental bath challenge with Y. ruckeri. The rainbow trout were given oral vaccinations...... primary vaccination), 5) AquaVac ERM (as a primary vaccine), 6) AquaVac w/ booster, and 7) one group with 10 fold increase (w/ booster) of the experimental vaccine in the feed. The rainbow trout were bath challenged with 6.3 x108 CFU/ml Y. ruckeri 6 month post the primary oral vaccination. The challenge...

Decomposing Oriented Graphs into Six Locally Irregular Oriented Graphs

DEFF Research Database (Denmark)

Bensmail, Julien; Renault, Gabriel

2016-01-01

An undirected graph G is locally irregular if every two of its adjacent vertices have distinct degrees. We say that G is decomposable into k locally irregular graphs if there exists a partition E1∪E2∪⋯∪Ek of the edge set E(G) such that each Ei induces a locally irregular graph. It was recently co...

Rainbow Particle Imaging Velocimetry for Dense 3D Fluid Velocity Imaging

KAUST Repository

Xiong, Jinhui

2017-04-11

Despite significant recent progress, dense, time-resolved imaging of complex, non-stationary 3D flow velocities remains an elusive goal. In this work we tackle this problem by extending an established 2D method, Particle Imaging Velocimetry, to three dimensions by encoding depth into color. The encoding is achieved by illuminating the flow volume with a continuum of light planes (a “rainbow”), such that each depth corresponds to a specific wavelength of light. A diffractive component in the camera optics ensures that all planes are in focus simultaneously. For reconstruction, we derive an image formation model for recovering stationary 3D particle positions. 3D velocity estimation is achieved with a variant of 3D optical flow that accounts for both physical constraints as well as the rainbow image formation model. We evaluate our method with both simulations and an experimental prototype setup.

Non-heuristic reduction of the graph in graph-cut optimization

International Nuclear Information System (INIS)

Malgouyres, François; Lermé, Nicolas

2012-01-01

During the last ten years, graph cuts had a growing impact in shape optimization. In particular, they are commonly used in applications of shape optimization such as image processing, computer vision and computer graphics. Their success is due to their ability to efficiently solve (apparently) difficult shape optimization problems which typically involve the perimeter of the shape. Nevertheless, solving problems with a large number of variables remains computationally expensive and requires a high memory usage since underlying graphs sometimes involve billion of nodes and even more edges. Several strategies have been proposed in the literature to improve graph-cuts in this regards. In this paper, we give a formal statement which expresses that a simple and local test performed on every node before its construction permits to avoid the construction of useless nodes for the graphs typically encountered in image processing and vision. A useless node is such that the value of the maximum flow in the graph does not change when removing the node from the graph. Such a test therefore permits to limit the construction of the graph to a band of useful nodes surrounding the final cut.

Graph embedding with rich information through heterogeneous graph

KAUST Repository

Sun, Guolei

2017-01-01

Graph embedding, aiming to learn low-dimensional representations for nodes in graphs, has attracted increasing attention due to its critical application including node classification, link prediction and clustering in social network analysis. Most

Report on the Audit ot the Acquisition of the Tacit Rainbow Anti-Radiation Missile System

Science.gov (United States)

1991-06-24

This is our final report on the audit of the Tacit Rainbow Anti-Radiation Missile System (Tacit Rainbow) for your information and use. We performed... the audit from March through December 1990. The audit objective was to evaluate the acquisition management of the air-launched Tacit Rainbow system to...contains no recommendations because DoD took action to cancel the Tacit Rainbow system in FY 1992. We are bringing the issues identified during the audit to

Graphing trillions of triangles.

Science.gov (United States)

Burkhardt, Paul

2017-07-01

The increasing size of Big Data is often heralded but how data are transformed and represented is also profoundly important to knowledge discovery, and this is exemplified in Big Graph analytics. Much attention has been placed on the scale of the input graph but the product of a graph algorithm can be many times larger than the input. This is true for many graph problems, such as listing all triangles in a graph. Enabling scalable graph exploration for Big Graphs requires new approaches to algorithms, architectures, and visual analytics. A brief tutorial is given to aid the argument for thoughtful representation of data in the context of graph analysis. Then a new algebraic method to reduce the arithmetic operations in counting and listing triangles in graphs is introduced. Additionally, a scalable triangle listing algorithm in the MapReduce model will be presented followed by a description of the experiments with that algorithm that led to the current largest and fastest triangle listing benchmarks to date. Finally, a method for identifying triangles in new visual graph exploration technologies is proposed.

Adaptive Graph Convolutional Neural Networks

OpenAIRE

Li, Ruoyu; Wang, Sheng; Zhu, Feiyun; Huang, Junzhou

2018-01-01

Graph Convolutional Neural Networks (Graph CNNs) are generalizations of classical CNNs to handle graph data such as molecular data, point could and social networks. Current filters in graph CNNs are built for fixed and shared graph structure. However, for most real data, the graph structures varies in both size and connectivity. The paper proposes a generalized and flexible graph CNN taking data of arbitrary graph structure as input. In that way a task-driven adaptive graph is learned for eac...

Decomposing a planar graph of girth 5 into an independent set and a forest

DEFF Research Database (Denmark)

Kawarabayashi, Ken-ichi; Thomassen, Carsten

2009-01-01

We use a list-color technique to extend the result of Borodin and Glebov that the vertex set of every planar graph of girth at least 5 can be partitioned into an independent set and a set which induces a forest. We apply this extension to also extend Grötzsch's theorem that every planar triangle-...

Asymptote Misconception on Graphing Functions: Does Graphing Software Resolve It?

Directory of Open Access Journals (Sweden)

Mehmet Fatih Öçal

2017-01-01

Full Text Available Graphing function is an important issue in mathematics education due to its use in various areas of mathematics and its potential roles for students to enhance learning mathematics. The use of some graphing software assists students’ learning during graphing functions. However, the display of graphs of functions that students sketched by hand may be relatively different when compared to the correct forms sketched using graphing software. The possible misleading effects of this situation brought a discussion of a misconception (asymptote misconception on graphing functions. The purpose of this study is two- fold. First of all, this study investigated whether using graphing software (GeoGebra in this case helps students to determine and resolve this misconception in calculus classrooms. Second, the reasons for this misconception are sought. The multiple case study was utilized in this study. University students in two calculus classrooms who received instructions with (35 students or without GeoGebra assisted instructions (32 students were compared according to whether they fell into this misconception on graphing basic functions (1/x, lnx, ex. In addition, students were interviewed to reveal the reasons behind this misconception. Data were analyzed by means of descriptive and content analysis methods. The findings indicated that those who received GeoGebra assisted instruction were better in resolving it. In addition, the reasons behind this misconception were found to be teacher-based, exam-based and some other factors.

High Dimensional Spectral Graph Theory and Non-backtracking Random Walks on Graphs

Science.gov (United States)

Kempton, Mark

This thesis has two primary areas of focus. First we study connection graphs, which are weighted graphs in which each edge is associated with a d-dimensional rotation matrix for some fixed dimension d, in addition to a scalar weight. Second, we study non-backtracking random walks on graphs, which are random walks with the additional constraint that they cannot return to the immediately previous state at any given step. Our work in connection graphs is centered on the notion of consistency, that is, the product of rotations moving from one vertex to another is independent of the path taken, and a generalization called epsilon-consistency. We present higher dimensional versions of the combinatorial Laplacian matrix and normalized Laplacian matrix from spectral graph theory, and give results characterizing the consistency of a connection graph in terms of the spectra of these matrices. We generalize several tools from classical spectral graph theory, such as PageRank and effective resistance, to apply to connection graphs. We use these tools to give algorithms for sparsification, clustering, and noise reduction on connection graphs. In non-backtracking random walks, we address the question raised by Alon et. al. concerning how the mixing rate of a non-backtracking random walk to its stationary distribution compares to the mixing rate for an ordinary random walk. Alon et. al. address this question for regular graphs. We take a different approach, and use a generalization of Ihara's Theorem to give a new proof of Alon's result for regular graphs, and to extend the result to biregular graphs. Finally, we give a non-backtracking version of Polya's Random Walk Theorem for 2-dimensional grids.

Cell-mediated cytotoxicity in rainbow trout, Oncorhynchus mykiss, infected with viral haemorrhagic septicaemia virus

DEFF Research Database (Denmark)

Utke, K.; Bergmann, S.; Lorenzen, Niels

2007-01-01

classical MHC class I locus Onmy-UBA is identical in the rainbow trout clone C25 and in the permanent rainbow trout cell line RTG-2. This enabled us to develop an assay to measure antiviral cytotoxicity in rainbow trout using a system of MHC class I-matched effector and target cells. Peripheral blood...... leucocytes (PBL) isolated from low dose viral haemorrhagic septicaemia virus (VHSV)-infected rainbow trout killed MHC class I-matched and later also xenogeneic MHC class I-mismatched VHSV-infected cells. When compared to PBL from uninfected control fish PBL from infected fish showed a higher transcriptional...

X-Graphs: Language and Algorithms for Heterogeneous Graph Streams

Science.gov (United States)

2017-09-01

are widely used by academia and industry. 15. SUBJECT TERMS Data Analytics, Graph Analytics, High-Performance Computing 16. SECURITY CLASSIFICATION...form the core of the DeepDive Knowledge Construction System. 2 INTRODUCTION The goal of the X-Graphs project was to develop computational techniques...memory multicore machine. Ringo is based on Snap.py and SNAP, and uses Python . Ringo now allows the integration of Delite DSL Framework Graph

On the sizes of expander graphs and minimum distances of graph codes

DEFF Research Database (Denmark)

Høholdt, Tom; Justesen, Jørn

2014-01-01

We give lower bounds for the minimum distances of graph codes based on expander graphs. The bounds depend only on the second eigenvalue of the graph and the parameters of the component codes. We also give an upper bound on the size of a degree regular graph with given second eigenvalue....

Similarity Measure of Graphs

Directory of Open Access Journals (Sweden)

Amine Labriji

2017-07-01

Full Text Available The topic of identifying the similarity of graphs was considered as highly recommended research field in the Web semantic, artificial intelligence, the shape recognition and information research. One of the fundamental problems of graph databases is finding similar graphs to a graph query. Existing approaches dealing with this problem are usually based on the nodes and arcs of the two graphs, regardless of parental semantic links. For instance, a common connection is not identified as being part of the similarity of two graphs in cases like two graphs without common concepts, the measure of similarity based on the union of two graphs, or the one based on the notion of maximum common sub-graph (SCM, or the distance of edition of graphs. This leads to an inadequate situation in the context of information research. To overcome this problem, we suggest a new measure of similarity between graphs, based on the similarity measure of Wu and Palmer. We have shown that this new measure satisfies the properties of a measure of similarities and we applied this new measure on examples. The results show that our measure provides a run time with a gain of time compared to existing approaches. In addition, we compared the relevance of the similarity values obtained, it appears that this new graphs measure is advantageous and  offers a contribution to solving the problem mentioned above.

Spectra of Graphs

NARCIS (Netherlands)

Brouwer, A.E.; Haemers, W.H.

2012-01-01

This book gives an elementary treatment of the basic material about graph spectra, both for ordinary, and Laplace and Seidel spectra. The text progresses systematically, by covering standard topics before presenting some new material on trees, strongly regular graphs, two-graphs, association

Movement of resident rainbow trout transplanted below a barrier to anadromy

Science.gov (United States)

Wilzbach, Margaret A.; Ashenfelter, Mark J.; Ricker, Seth J.

2012-01-01

We tracked the movement of resident coastal rainbow trout Oncorhynchus mykiss irideus that were experimentally transplanted below a migration barrier in a northern California stream. In 2005 and 2006, age-1 and older rainbow trout were captured above a 5-m-high waterfall in Freshwater Creek and individually marked with passive integrated transponder tags. Otolith microchemistry confirmed that the above-barrier trout were the progeny of resident rather than anadromous parents, and genetic analysis indicated that the rainbow trout were introgressed with cutthroat trout O. clarkii. At each of three sampling events, half of the tagged individuals (n = 22 and 43 trout in 2005 and 2006, respectively) were released 5 km downstream from the waterfall (approximately 10 km upstream from tidewater), and an equal number of tagged individuals were released above the barrier. Tagged individuals were subsequently relocated with stationary and mobile antennae or recaptured in downstream migrant traps, or both, until tracking ceased in October 2007. Most transplanted individuals remained within a few hundred meters of their release location. Three individuals, including one rainbow trout released above the waterfall, were last detected in the tidally influenced lower creek. Two additional tagged individuals released above the barrier were found alive in below-barrier reaches and had presumably washed over the falls. Two of seven tagged rainbow trout captured in downstream migrant traps had smolted and one was a presmolt. The smoltification of at least some individuals, coupled with above-barrier "leakage" of fish downstream, suggests that above-barrier resident trout have the potential to exhibit migratory behavior and to enter breeding populations of steelhead (anadromous rainbow trout) within the basin.

Black hole thermodynamics in Lovelock gravity's rainbow with (A)dS asymptote

Science.gov (United States)

Hendi, Seyed Hossein; Dehghani, Ali; Faizal, Mir

2017-01-01

In this paper, we combine Lovelock gravity with gravity's rainbow to construct Lovelock gravity's rainbow. Considering the Lovelock gravity's rainbow coupled to linear and also nonlinear electromagnetic gauge fields, we present two new classes of topological black hole solutions. We compute conserved and thermodynamic quantities of these black holes (such as temperature, entropy, electric potential, charge and mass) and show that these quantities satisfy the first law of thermodynamics. In order to study the thermal stability in canonical ensemble, we calculate the heat capacity and determinant of the Hessian matrix and show in what regions there are thermally stable phases for black holes. Also, we discuss the dependence of thermodynamic behavior and thermal stability of black holes on rainbow functions. Finally, we investigate the critical behavior of black holes in the extended phase space and study their interesting properties.

Beyond the Rainbow: Retrieval Practice Leads to Better Spelling than Does Rainbow Writing

Science.gov (United States)

Jones, Angela C.; Wardlow, Liane; Pan, Steven C.; Zepeda, Cristina; Heyman, Gail D.; Dunlosky, John; Rickard, Timothy C.

2016-01-01

In three experiments, we compared the effectiveness of rainbow writing and retrieval practice, two common methods of spelling instruction. In experiment 1 (n = 14), second graders completed 2 days of spelling practice, followed by spelling tests 1 day and 5 weeks later. A repeated measures analysis of variance demonstrated that spelling accuracy…

Pattern graph rewrite systems

Directory of Open Access Journals (Sweden)

Aleks Kissinger

2014-03-01

Full Text Available String diagrams are a powerful tool for reasoning about physical processes, logic circuits, tensor networks, and many other compositional structures. Dixon, Duncan and Kissinger introduced string graphs, which are a combinatoric representations of string diagrams, amenable to automated reasoning about diagrammatic theories via graph rewrite systems. In this extended abstract, we show how the power of such rewrite systems can be greatly extended by introducing pattern graphs, which provide a means of expressing infinite families of rewrite rules where certain marked subgraphs, called !-boxes ("bang boxes", on both sides of a rule can be copied any number of times or removed. After reviewing the string graph formalism, we show how string graphs can be extended to pattern graphs and how pattern graphs and pattern rewrite rules can be instantiated to concrete string graphs and rewrite rules. We then provide examples demonstrating the expressive power of pattern graphs and how they can be applied to study interacting algebraic structures that are central to categorical quantum mechanics.

Determination of connected components inthe analysis of homogeneous and detail zonesin color images

Directory of Open Access Journals (Sweden)

Cristina Pérez-Benito

2018-02-01

Full Text Available A model based on local graphs to classify pixels coming from at or detail regions of an image is presented. For each pixel a local graph is dened. Its structure will depend on the similarity between neighbouring pixels. Its features allow us to classify each image pixel as belonging to one type of region or the other. This classication is an essential pre-processing technique for many Computer Vision tools, such as smoothingor sharpening of digital color images.

Kootenai River fisheries investigations: rainbow and bull trout recruitment: annual progress report 1999; ANNUAL

International Nuclear Information System (INIS)

Walters, Jody P.; Downs, Christopher Charles

2001-01-01

Our 1999 objectives were to determine sources of rainbow trout Oncorhynchus mykiss and bull trout Salvelinus confluentus spawning and recruitment in the Idaho reach of the Kootenai River. We used a rotary-screw trap to capture juvenile trout to determine age at out-migration and to estimate total out-migration from the Boundary Creek drainage to the Kootenai River. The out-migrant estimate for March through August 1999 was 1,574 (95% C. I.= 825-3,283) juvenile rainbow trout. Most juveniles out-migrated at age-2 and age-3. No out-migrating bull trout were caught. Five of 17 rainbow trout radio-tagged in Idaho migrated upstream into Montana waters during the spawning season. Five bull trout originally radio-tagged in O'Brien Creek, Montana in early October moved downstream into Idaho and British Columbia by mid-October. Annual angler exploitation for the rainbow trout population upstream of Bonners Ferry, Idaho was estimated to be 58%. Multi-pass depletion estimates for index reaches of Caboose, Curley, and Debt creeks showed 0.20, 0.01, and 0.13 rainbow trout juveniles/m(sup 2), respectively. We estimated rainbow trout (180-415 mm TL) standing stock of 1.6 kg/ha for the Hemlock Bar reach (29.4 ha) of the Kootenai River, similar to the 1998 estimate. Recruitment of juvenile rainbow and bull trout from Idaho tributaries is not sufficient to be the sole source of subsequent older fish in the mainstem Kootenai River. These populations are at least partly dependent on recruitment from Montana waters. The low recruitment and high exploitation rate may be indicators of a rainbow trout population in danger of further decline

On middle cube graphs

Directory of Open Access Journals (Sweden)

C. Dalfo

2015-10-01

Full Text Available We study a family of graphs related to the $n$-cube. The middle cube graph of parameter k is the subgraph of $Q_{2k-1}$ induced by the set of vertices whose binary representation has either $k-1$ or $k$ number of ones. The middle cube graphs can be obtained from the well-known odd graphs by doubling their vertex set. Here we study some of the properties of the middle cube graphs in the light of the theory of distance-regular graphs. In particular, we completely determine their spectra (eigenvalues and their multiplicities, and associated eigenvectors.

Effect of electric barrier on passage and physical condition of juvenile and adult rainbow trout

Science.gov (United States)

Layhee, Megan J.; Sepulveda, Adam; Shaw, Amy; Smuckall, Matthew; Kapperman, Kevin; Reyes, Alejandro

2016-01-01

Electric barriers can inhibit passage and injure fish. Few data exist on electric barrier parameters that minimize these impacts and on how body size affects susceptibility, especially to nontarget fish species. The goal of this study was to determine electric barrier voltage and pulse-width settings that inhibit passage of larger bodied rainbow trout Oncorhynchus mykiss (215–410 mm fork length) while allowing passage of smaller bodied juvenile rainbow trout (52–126 mm) in a static laboratory setting. We exposed rainbow trout to 30-Hz pulsed-direct current voltage gradients (0.00–0.45 V cm−1) and pulse widths (0.0–0.7 ms) and recorded their movement, injury incidence, and mortality. No settings tested allowed all juveniles to pass while impeding all adult passage. Juvenile and adult rainbow trout avoided the barrier at higher pulse widths, and fewer rainbow trout passed the barrier at 0.7-ms pulse width compared to 0.1 ms and when the barrier was turned off. We found no effect of voltage gradient on fish passage. No mortality occurred, and we observed external bruising in 5 (7%) juvenile rainbow trout and 15 (21%) adult rainbow trout. This study may aid managers in selecting barrier settings that allow for increased juvenile passage.

Graph visualization (Invited talk)

NARCIS (Netherlands)

Wijk, van J.J.; Kreveld, van M.J.; Speckmann, B.

2012-01-01

Black and white node link diagrams are the classic method to depict graphs, but these often fall short to give insight in large graphs or when attributes of nodes and edges play an important role. Graph visualization aims obtaining insight in such graphs using interactive graphical representations.

Adventures in graph theory

CERN Document Server

Joyner, W David

2017-01-01

This textbook acts as a pathway to higher mathematics by seeking and illuminating the connections between graph theory and diverse fields of mathematics, such as calculus on manifolds, group theory, algebraic curves, Fourier analysis, cryptography and other areas of combinatorics. An overview of graph theory definitions and polynomial invariants for graphs prepares the reader for the subsequent dive into the applications of graph theory. To pique the reader’s interest in areas of possible exploration, recent results in mathematics appear throughout the book, accompanied with examples of related graphs, how they arise, and what their valuable uses are. The consequences of graph theory covered by the authors are complicated and far-reaching, so topics are always exhibited in a user-friendly manner with copious graphs, exercises, and Sage code for the computation of equations. Samples of the book’s source code can be found at github.com/springer-math/adventures-in-graph-theory. The text is geared towards ad...

Thermal fluctuations of dilaton black holes in gravity's rainbow

Science.gov (United States)

Dehghani, M.

2018-06-01

In this work, thermodynamics and phase transition of some new dilaton black hole solutions have been explored in the presence of the rainbow functions. By introducing an energy dependent space time, the dilaton potential has been obtained as the linear combination of two Liouville-type potentials and three new classes of black hole solutions have been constructed. The conserved and thermodynamic quantities of the new dilaton black holes have been calculated in the energy dependent space times. It has been shown that, even if some of the thermodynamic quantities are affected by the rainbow functions, the thermodynamical first law still remains valid. Also, the impacts of rainbow functions on the stability or phase transition of the new black hole solutions have been investigated. Finally, the quantum gravitational effects on the thermodynamics and phase transition of the solutions have been studied through consideration of the thermal fluctuations.

Classical theory of atom-surface scattering: The rainbow effect

Science.gov (United States)

Miret-Artés, Salvador; Pollak, Eli

2012-07-01

The scattering of heavy atoms and molecules from surfaces is oftentimes dominated by classical mechanics. A large body of experiments have gathered data on the angular distributions of the scattered species, their energy loss distribution, sticking probability, dependence on surface temperature and more. For many years these phenomena have been considered theoretically in the framework of the “washboard model” in which the interaction of the incident particle with the surface is described in terms of hard wall potentials. Although this class of models has helped in elucidating some of the features it left open many questions such as: true potentials are clearly not hard wall potentials, it does not provide a realistic framework for phonon scattering, and it cannot explain the incident angle and incident energy dependence of rainbow scattering, nor can it provide a consistent theory for sticking. In recent years we have been developing a classical perturbation theory approach which has provided new insight into the dynamics of atom-surface scattering. The theory includes both surface corrugation as well as interaction with surface phonons in terms of harmonic baths which are linearly coupled to the system coordinates. This model has been successful in elucidating many new features of rainbow scattering in terms of frictions and bath fluctuations or noise. It has also given new insight into the origins of asymmetry in atomic scattering from surfaces. New phenomena deduced from the theory include friction induced rainbows, energy loss rainbows, a theory of super-rainbows, and more. In this review we present the classical theory of atom-surface scattering as well as extensions and implications for semiclassical scattering and the further development of a quantum theory of surface scattering. Special emphasis is given to the inversion of scattering data into information on the particle-surface interactions.

Distance-regular graphs

NARCIS (Netherlands)

van Dam, Edwin R.; Koolen, Jack H.; Tanaka, Hajime

2016-01-01

This is a survey of distance-regular graphs. We present an introduction to distance-regular graphs for the reader who is unfamiliar with the subject, and then give an overview of some developments in the area of distance-regular graphs since the monograph 'BCN'[Brouwer, A.E., Cohen, A.M., Neumaier,

Brown Trout removal effects on short-term survival and movement of Myxobolus cerebralis-resistant rainbow trout

Science.gov (United States)

Fetherman, Eric R.; Winkelman, Dana L.; Bailey, Larissa L.; Schisler, George J.; Davies, K.

2015-01-01

Following establishment of Myxobolus cerebralis (the parasite responsible for salmonid whirling disease) in Colorado, populations of Rainbow Trout Oncorhynchus mykissexperienced significant declines, whereas Brown Trout Salmo trutta densities increased in many locations across the state, potentially influencing the success of M. cerebralis-resistant Rainbow Trout reintroductions. We examined the effects of Brown Trout removal on the short-term (3-month) survival and movement of two crosses of reintroduced, M. cerebralis-resistant Rainbow Trout in the Cache la Poudre River, Colorado. Radio frequency identification passive integrated transponder tags and antennas were used to track movements of wild Brown Trout and stocked Rainbow Trout in reaches where Brown Trout had or had not been removed. Multistate mark–recapture models were used to estimate tagged fish apparent survival and movement in these sections 3 months following Brown Trout removal. A cross between the German Rainbow Trout and Colorado River Rainbow Trout strains exhibited similar survival and movement probabilities in the reaches, suggesting that the presence of Brown Trout did not affect its survival or movement. However, a cross between the German Rainbow Trout and Harrison Lake Rainbow Trout exhibited less movement from the reach in which Brown Trout had been removed. Despite this, the overall short-term benefits of the removal were equivocal, suggesting that Brown Trout removal may not be beneficial for the reintroduction of Rainbow Trout. Additionally, the logistical constraints of conducting removals in large river systems are substantial and may not be a viable management option in many rivers.

RAINBOWS and CERAMBOWS: The Technologies of Pre-Stressed Piezo Actuators

Science.gov (United States)

Haertling, Gene H.

1996-01-01

Amplified mechanical displacement effects, similar to those observed in the recently reported Rainbow actuators, have also been found to exist in prestressed ceramic/metal composite structures coined as CERAMBOW's - an acronym for CERamic And Metal Biased Oxide Wafer. Mimicking the Rainbows in many ways, the intentionally created internal compressive and tensile stresses within the Cerambows are used to amplify their displacement properties via the combined effects of piezoelectric d31 strain and domain reorientation. They are fabricated from ferroelectric, piezoelectric or electrostrictive materials and metal substrates of significantly different thermal expansions which are largely responsible for the creation of the stress. Typical ceramics used in Cerambows are PZT, PLZT, PBZT, PSZT and PMN and some typical metal substrates are Al, Ag, Ni, brass, steel and Be/Cu foil. Shapes can vary from round disks to square plates and rectangular bars. Formed at an elevated temperature of approximately 250 C, the stresses on cooling to room temperature are generally sufficient to produce displacements as large as 0.125mm (5 mils) when activated unipolar and 0.25mm (10 mils) when operated bipolar at 450 volts in a dome mode. Comparing equal structures of a Cerambow with a Rainbow, the Cerambow was found to achieve approximately 70% of the displacement that would normally be obtained with a Rainbow. Although this difference in displacement is sufficient to prefer a Rainbow for many applications, there are some advantages for the Cerambow. Among these are (1) the processing temperatures are lower, (2) high lead-containing ceramics are not required and (3) in some instances the metal substrate is more convenient to interface with other elements of a device. However, the disadvantages include (1) lower displacement in the dome mode of operation, (2) the higher displacement saddle mode has not yet been demonstrated with a Cerambow and (3) the ceramic/metal bond interface is a

Topological and Graph-Coloring Conditions on the Parameter-Independent Stability of Second-Order Networked Systems

NARCIS (Netherlands)

Koerts, Filip; Bürger, Mathias; van der Schaft, Abraham; De Persis, Claudio

2017-01-01

In this paper, we study parameter-independent stability in qualitatively heterogeneous passive networked systems containing damped and undamped nodes. Given the graph topology and a set of damped nodes, we ask if output consensus is achieved for all system parameter values. For given parameter

On the strong metric dimension of generalized butterfly graph, starbarbell graph, and {C}_{m}\\odot {P}_{n} graph

Science.gov (United States)

Yunia Mayasari, Ratih; Atmojo Kusmayadi, Tri

2018-04-01

Let G be a connected graph with vertex set V(G) and edge set E(G). For every pair of vertices u,v\\in V(G), the interval I[u, v] between u and v to be the collection of all vertices that belong to some shortest u ‑ v path. A vertex s\\in V(G) strongly resolves two vertices u and v if u belongs to a shortest v ‑ s path or v belongs to a shortest u ‑ s path. A vertex set S of G is a strong resolving set of G if every two distinct vertices of G are strongly resolved by some vertex of S. The strong metric basis of G is a strong resolving set with minimal cardinality. The strong metric dimension sdim(G) of a graph G is defined as the cardinality of strong metric basis. In this paper we determine the strong metric dimension of a generalized butterfly graph, starbarbell graph, and {C}mȯ {P}n graph. We obtain the strong metric dimension of generalized butterfly graph is sdim(BFn ) = 2n ‑ 2. The strong metric dimension of starbarbell graph is sdim(S{B}{m1,{m}2,\\ldots,{m}n})={\\sum }i=1n({m}i-1)-1. The strong metric dimension of {C}mȯ {P}n graph are sdim({C}mȯ {P}n)=2m-1 for m > 3 and n = 2, and sdim({C}mȯ {P}n)=2m-2 for m > 3 and n > 2.

Subgraph detection using graph signals

KAUST Repository

Chepuri, Sundeep Prabhakar

2017-03-06

In this paper we develop statistical detection theory for graph signals. In particular, given two graphs, namely, a background graph that represents an usual activity and an alternative graph that represents some unusual activity, we are interested in answering the following question: To which of the two graphs does the observed graph signal fit the best? To begin with, we assume both the graphs are known, and derive an optimal Neyman-Pearson detector. Next, we derive a suboptimal detector for the case when the alternative graph is not known. The developed theory is illustrated with numerical experiments.

Subgraph detection using graph signals

KAUST Repository

Chepuri, Sundeep Prabhakar; Leus, Geert

2017-01-01

In this paper we develop statistical detection theory for graph signals. In particular, given two graphs, namely, a background graph that represents an usual activity and an alternative graph that represents some unusual activity, we are interested in answering the following question: To which of the two graphs does the observed graph signal fit the best? To begin with, we assume both the graphs are known, and derive an optimal Neyman-Pearson detector. Next, we derive a suboptimal detector for the case when the alternative graph is not known. The developed theory is illustrated with numerical experiments.

Graph spectrum

NARCIS (Netherlands)

Brouwer, A.E.; Haemers, W.H.; Brouwer, A.E.; Haemers, W.H.

2012-01-01

This chapter presents some simple results on graph spectra.We assume the reader is familiar with elementary linear algebra and graph theory. Throughout, J will denote the all-1 matrix, and 1 is the all-1 vector.

Pragmatic Graph Rewriting Modifications

OpenAIRE

Rodgers, Peter; Vidal, Natalia

1999-01-01

We present new pragmatic constructs for easing programming in visual graph rewriting programming languages. The first is a modification to the rewriting process for nodes the host graph, where nodes specified as 'Once Only' in the LHS of a rewrite match at most once with a corresponding node in the host graph. This reduces the previously common use of tags to indicate the progress of matching in the graph. The second modification controls the application of LHS graphs, where those specified a...

Simplicial complexes of graphs

CERN Document Server

Jonsson, Jakob

2008-01-01

A graph complex is a finite family of graphs closed under deletion of edges. Graph complexes show up naturally in many different areas of mathematics, including commutative algebra, geometry, and knot theory. Identifying each graph with its edge set, one may view a graph complex as a simplicial complex and hence interpret it as a geometric object. This volume examines topological properties of graph complexes, focusing on homotopy type and homology. Many of the proofs are based on Robin Forman's discrete version of Morse theory. As a byproduct, this volume also provides a loosely defined toolbox for attacking problems in topological combinatorics via discrete Morse theory. In terms of simplicity and power, arguably the most efficient tool is Forman's divide and conquer approach via decision trees; it is successfully applied to a large number of graph and digraph complexes.

The STAPL Parallel Graph Library

KAUST Repository

Harshvardhan,

2013-01-01

This paper describes the stapl Parallel Graph Library, a high-level framework that abstracts the user from data-distribution and parallelism details and allows them to concentrate on parallel graph algorithm development. It includes a customizable distributed graph container and a collection of commonly used parallel graph algorithms. The library introduces pGraph pViews that separate algorithm design from the container implementation. It supports three graph processing algorithmic paradigms, level-synchronous, asynchronous and coarse-grained, and provides common graph algorithms based on them. Experimental results demonstrate improved scalability in performance and data size over existing graph libraries on more than 16,000 cores and on internet-scale graphs containing over 16 billion vertices and 250 billion edges. © Springer-Verlag Berlin Heidelberg 2013.

Case report of an unusual heart abnormality in Rainbow trout (Oncorhynchus mykiss)

Science.gov (United States)

An unusual heart abnormality in rainbow trout Oncorhynchus mykiss was recently observed. During the course of a standard hydrogen peroxide treatment (100 ppm) of production rainbow trout (mean weight, 2-3 g) affected with an external bacterial infection, a small percentage of fish exhibited morbidi...

Detection based on rainbow refractometry of droplet sphericity in liquid-liquid systems.

Science.gov (United States)

Lohner, H; Lehmann, P; Bauckhage, K

1999-03-01

The shape of droplets in liquid-liquid systems influences their mass and momentum transfer processes. The deviation from sphericity of rising droplets in liquid-liquid systems was investigated for different droplet sizes. Rainbow refractometry permits one to test, in this case, whether the use of laser-optical particle sizing will be correct or faulty. Since the assumption of spherical particle geometry is a general basis of laser-optical particle-sizing techniques such as rainbow refractometry or phase Doppler anemometry, deviation from the spherical shape results in a measuring error. A sphericity check based on rainbow refractometry is introduced.

Acoustic rainbow trapping by coiling up space

KAUST Repository

Ni, Xu

2014-11-13

We numerically realize the acoustic rainbow trapping effect by tapping an air waveguide with space-coiling metamaterials. Due to the high refractive-index of the space-coiling metamaterials, our device is more compact compared to the reported trapped-rainbow devices. A numerical model utilizing effective parameters is also calculated, whose results are consistent well with the direct numerical simulation of space-coiling structure. Moreover, such device with the capability of dropping different frequency components of a broadband incident temporal acoustic signal into different channels can function as an acoustic wavelength division de-multiplexer. These results may have potential applications in acoustic device design such as an acoustic filter and an artificial cochlea.

Acoustic rainbow trapping by coiling up space

KAUST Repository

Ni, Xu; Wu, Ying; Chen, Ze-Guo; Zheng, Li-Yang; Xu, Ye-Long; Nayar, Priyanka; Liu, Xiao-Ping; Lu, Ming-Hui; Chen, Yan-Feng

2014-01-01

We numerically realize the acoustic rainbow trapping effect by tapping an air waveguide with space-coiling metamaterials. Due to the high refractive-index of the space-coiling metamaterials, our device is more compact compared to the reported trapped-rainbow devices. A numerical model utilizing effective parameters is also calculated, whose results are consistent well with the direct numerical simulation of space-coiling structure. Moreover, such device with the capability of dropping different frequency components of a broadband incident temporal acoustic signal into different channels can function as an acoustic wavelength division de-multiplexer. These results may have potential applications in acoustic device design such as an acoustic filter and an artificial cochlea.

Topic Model for Graph Mining.

Science.gov (United States)

Xuan, Junyu; Lu, Jie; Zhang, Guangquan; Luo, Xiangfeng

2015-12-01

Graph mining has been a popular research area because of its numerous application scenarios. Many unstructured and structured data can be represented as graphs, such as, documents, chemical molecular structures, and images. However, an issue in relation to current research on graphs is that they cannot adequately discover the topics hidden in graph-structured data which can be beneficial for both the unsupervised learning and supervised learning of the graphs. Although topic models have proved to be very successful in discovering latent topics, the standard topic models cannot be directly applied to graph-structured data due to the "bag-of-word" assumption. In this paper, an innovative graph topic model (GTM) is proposed to address this issue, which uses Bernoulli distributions to model the edges between nodes in a graph. It can, therefore, make the edges in a graph contribute to latent topic discovery and further improve the accuracy of the supervised and unsupervised learning of graphs. The experimental results on two different types of graph datasets show that the proposed GTM outperforms the latent Dirichlet allocation on classification by using the unveiled topics of these two models to represent graphs.

A graph edit dictionary for correcting errors in roof topology graphs reconstructed from point clouds

Science.gov (United States)

Xiong, B.; Oude Elberink, S.; Vosselman, G.

2014-07-01

In the task of 3D building model reconstruction from point clouds we face the problem of recovering a roof topology graph in the presence of noise, small roof faces and low point densities. Errors in roof topology graphs will seriously affect the final modelling results. The aim of this research is to automatically correct these errors. We define the graph correction as a graph-to-graph problem, similar to the spelling correction problem (also called the string-to-string problem). The graph correction is more complex than string correction, as the graphs are 2D while strings are only 1D. We design a strategy based on a dictionary of graph edit operations to automatically identify and correct the errors in the input graph. For each type of error the graph edit dictionary stores a representative erroneous subgraph as well as the corrected version. As an erroneous roof topology graph may contain several errors, a heuristic search is applied to find the optimum sequence of graph edits to correct the errors one by one. The graph edit dictionary can be expanded to include entries needed to cope with errors that were previously not encountered. Experiments show that the dictionary with only fifteen entries already properly corrects one quarter of erroneous graphs in about 4500 buildings, and even half of the erroneous graphs in one test area, achieving as high as a 95% acceptance rate of the reconstructed models.

Effects of cooking methods on electrophoretic patterns of rainbow trout

Directory of Open Access Journals (Sweden)

Yasemen Yanar

2011-07-01

Full Text Available The aim of this study was to determine the effects of different cooking methods on the electrophoretic patterns of rainbow trout (Oncorhynchus mykiss fillets using sodium dodecyl sulfate-polyacrylamide gel electrophoresis (SDS-PAGE. Raw rainbow trout were deep-fried, microwaved, grilled, and baked and then monitored for changes in the electrophoretic pattern. All cooking methods resulted in significant moisture loss when compared to the raw sample (P

Using neutrosophic graph cut segmentation algorithm for qualified rendering image selection in thyroid elastography video.

Science.gov (United States)

Guo, Yanhui; Jiang, Shuang-Quan; Sun, Baiqing; Siuly, Siuly; Şengür, Abdulkadir; Tian, Jia-Wei

2017-12-01

Recently, elastography has become very popular in clinical investigation for thyroid cancer detection and diagnosis. In elastogram, the stress results of the thyroid are displayed using pseudo colors. Due to variation of the rendering results in different frames, it is difficult for radiologists to manually select the qualified frame image quickly and efficiently. The purpose of this study is to find the qualified rendering result in the thyroid elastogram. This paper employs an efficient thyroid ultrasound image segmentation algorithm based on neutrosophic graph cut to find the qualified rendering images. Firstly, a thyroid ultrasound image is mapped into neutrosophic set, and an indeterminacy filter is constructed to reduce the indeterminacy of the spatial and intensity information in the image. A graph is defined on the image and the weight for each pixel is represented using the value after indeterminacy filtering. The segmentation results are obtained using a maximum-flow algorithm on the graph. Then the anatomic structure is identified in thyroid ultrasound image. Finally the rendering colors on these anatomic regions are extracted and validated to find the frames which satisfy the selection criteria. To test the performance of the proposed method, a thyroid elastogram dataset is built and totally 33 cases were collected. An experienced radiologist manually evaluates the selection results of the proposed method. Experimental results demonstrate that the proposed method finds the qualified rendering frame with 100% accuracy. The proposed scheme assists the radiologists to diagnose the thyroid diseases using the qualified rendering images.

Composition measurements of binary mixture droplets by rainbow refractometry.

Science.gov (United States)

Wilms, J; Weigand, B

2007-04-10

So far, refractive index measurements by rainbow refractometry have been used to determine the temperature of single droplets and ensembles of droplets. Rainbow refractometry is, for the first time, to the best of our knowledge, applied to measure composition histories of evaporating, binary mixture droplets. An evaluation method is presented that makes use of Airy theory and the simultaneous size measurement by Mie scattering imaging. The method further includes an empirical correction function for a certain diameter and refractive index range. The measurement uncertainty was investigated by numerical simulations with Lorenz-Mie theory. For the experiments, an optical levitation setup was used allowing for long measurement periods. Temperature measurements of single-component droplets at different temperature levels are shown to demonstrate the accuracy of rainbow refractometry. Measurements of size and composition histories of binary mixture droplets are presented for two different mixtures. Experimental results show good agreement with numerical results using a rapid-mixing model.

Composition measurements of binary mixture droplets by rainbow refractometry

International Nuclear Information System (INIS)

Wilms, J.; Weigand, B.

2007-01-01

So far, refractive index measurements by rainbow refractometry have been used to determine the temperature of single droplets and ensembles of droplets. Rainbow refractometry is, for the first time, to the best of our knowledge, applied to measure composition histories of evaporating, binary mixture droplets. An evaluation method is presented that makes use of Airy theory and the simultaneous size measurement by Mie scattering imaging. The method further includes an empirical correction function for a certain diameter and refractive index range. The measurement uncertainty was investigated by numerical simulations with Lorenz-Mie theory. For the experiments, an optical levitation setup was used allowing for long measurement periods. Temperature measurements of single-component droplets at different temperature levels are shown to demonstrate the accuracy of rainbow refractometry. Measurements of size and composition histories of binary mixture droplets are presented for two different mixtures. Experimental results show good agreement with numerical results using a rapid-mixing model

Introduction to quantum graphs

CERN Document Server

Berkolaiko, Gregory

2012-01-01

A "quantum graph" is a graph considered as a one-dimensional complex and equipped with a differential operator ("Hamiltonian"). Quantum graphs arise naturally as simplified models in mathematics, physics, chemistry, and engineering when one considers propagation of waves of various nature through a quasi-one-dimensional (e.g., "meso-" or "nano-scale") system that looks like a thin neighborhood of a graph. Works that currently would be classified as discussing quantum graphs have been appearing since at least the 1930s, and since then, quantum graphs techniques have been applied successfully in various areas of mathematical physics, mathematics in general and its applications. One can mention, for instance, dynamical systems theory, control theory, quantum chaos, Anderson localization, microelectronics, photonic crystals, physical chemistry, nano-sciences, superconductivity theory, etc. Quantum graphs present many non-trivial mathematical challenges, which makes them dear to a mathematician's heart. Work on qu...

Evaluasi Mutu dan Penerimaan Panelis terhadap Rainbow Cake yang Dibuat dari Tepung Terigu dan Pati Sagu Lokal

Directory of Open Access Journals (Sweden)

Usman Pato

2014-10-01

Full Text Available Riau is one of the sago starch-producing province in Indonesia. Nowadays, sago starch has been utilized to produce various types of tradisional foods. The aim of this study was to compare the quality of rainbow cake produced by the addition of 30% sago starch and rainbow cake using 100% wheat flour and to evaluate panelist acceptance of these rainbow cakes. This study used a Completely Randomized Design (CRD with two treatments and eight replications thus obtained 16 experimental units. The treatments were TS1 (100% wheat and 0%sago starch and TS2 (70% wheat flour and 30%sago starch. The parameters observed were moisture, ash, sucrose and fat contents as well as panelist acceptance test. The results of this study indicated that rainbow cake of TS1 treatment (100% wheat flour and 0%sago starch had no significant difference with rainbow cake of TS2 treatment (70% wheat flour and 30% sago starch in case of ash and sucrose contents, but had significant effect on moisture and fat contents of rainbow cake. Based on the panelist acceptance test, the rainbow cake made from 70% wheat flour and sago starch 30% could be accepted by panelists similar to commercial rainbow cake.

Estrogenic effect of dietary 4-tert-octylphenol in rainbow trout (Oncorhynchus mykiss)

DEFF Research Database (Denmark)

Pedersen, Kristine H; Pedersen, Søren N; Pedersen, Knud L

2003-01-01

The estrogenic effect of dietary 4-tert-octylphenol (octylphenol) in rainbow trout Oncorhynchus mykiss was investigated. Octylphenol was administered orally to sexually immature rainbow trout every second day for 11 days in doses between 0.4 and 50 mgkg(-1)2 d(-1). Plasma vitellogenin was measured...

Graph Generator Survey

Energy Technology Data Exchange (ETDEWEB)

Lothian, Joshua [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Powers, Sarah S. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Sullivan, Blair D. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Baker, Matthew B. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Schrock, Jonathan [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Poole, Stephen W. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)

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

Functions and graphs

CERN Document Server

Gelfand, I M; Shnol, E E

1969-01-01

The second in a series of systematic studies by a celebrated mathematician I. M. Gelfand and colleagues, this volume presents students with a well-illustrated sequence of problems and exercises designed to illuminate the properties of functions and graphs. Since readers do not have the benefit of a blackboard on which a teacher constructs a graph, the authors abandoned the customary use of diagrams in which only the final form of the graph appears; instead, the book's margins feature step-by-step diagrams for the complete construction of each graph. The first part of the book employs simple fu

Loose Graph Simulations

DEFF Research Database (Denmark)

Mansutti, Alessio; Miculan, Marino; Peressotti, Marco

2017-01-01

We introduce loose graph simulations (LGS), a new notion about labelled graphs which subsumes in an intuitive and natural way subgraph isomorphism (SGI), regular language pattern matching (RLPM) and graph simulation (GS). Being a unification of all these notions, LGS allows us to express directly...... also problems which are “mixed” instances of previous ones, and hence which would not fit easily in any of them. After the definition and some examples, we show that the problem of finding loose graph simulations is NP-complete, we provide formal translation of SGI, RLPM, and GS into LGSs, and we give...

More on the rainbow chain: entanglement, space-time geometry and thermal states

International Nuclear Information System (INIS)

Rodríguez-Laguna, Javier; Dubail, Jérôme; Ramírez, Giovanni; Calabrese, Pasquale; Sierra, Germán

2017-01-01

The rainbow chain is an inhomogenous exactly solvable local spin model that, in its ground state, displays a half-chain entanglement entropy growing linearly with the system size. Although many exact results about the rainbow chain are known, the structure of the underlying quantum field theory has not yet been unraveled. Here we show that the universal scaling features of this model are captured by a massless Dirac fermion in a curved space-time with constant negative curvature R   =  − h "2 ( h is the amplitude of the inhomogeneity). This identification allows us to use recently developed techniques to study inhomogeneous conformal systems and to analytically characterise the entanglement entropies of more general bipartitions. These results are carefully tested against exact numerical calculations. Finally, we study the entanglement entropies of the rainbow chain in thermal states, and find that there is a non-trivial interplay between the rainbow effective temperature T_R and the physical temperature T . (paper)

Development of a novel colorimetric sensor based on alginate beads for monitoring rainbow trout spoilage.

Science.gov (United States)

Majdinasab, Marjan; Hosseini, Seyed Mohammad Hashem; Sepidname, Marziyeh; Negahdarifar, Manizheh; Li, Peiwu

2018-05-01

Alginate is a non-toxic, renewable, and linear copolymer obtained from the brown algae Laminaria digitata that can be easily shaped into beads. Its good gel forming properties have made it useful for entrapping food and pharmaceutical ingredients. In this study, alginate beads were used in a novel application as a colorimetric sensor in food intelligent packaging. Colorimetric sensor was developed through entrapping red cabbage extract as a pH indicator in alginate beads. The pH indicator beads were used in rainbow trout packaging for monitoring fillets spoilage. Color change of beads during fish storage was measured using the CIELab method. The alginate bead colorimetric sensor is validated by measuring total volatile basic nitrogen (TVB-N) levels and microbial populations in fish samples. Moreover, peroxide value (PV) and thiobarbituric acid reactive substances (TBARS) were evaluated during storage. Results indicated that increasing the bacterial population during storage and production of proteolytic enzymes resulted in protein degradation, accumulation of volatile amine compounds, increase in the pH and finally color change of alginate beads. The values of TVB-N, pH, PV and TBARS increased with time of storage. The results of TVB-N and microbial growth were in accordance with color change of beads and CIELab data. Therefore, the proposed system enjoys a high sensitivity to pH variations and is capable of monitoring the spoilage of fish or other protein-rich products through its wide range of color changes. The alginate beads containing the red cabbage extract can, thus, be used as a low-cost colorimetric sensor for intelligent packaging applications.

Autoregressive Moving Average Graph Filtering

OpenAIRE

Isufi, Elvin; Loukas, Andreas; Simonetto, Andrea; Leus, Geert

2016-01-01

One of the cornerstones of the field of signal processing on graphs are graph filters, direct analogues of classical filters, but intended for signals defined on graphs. This work brings forth new insights on the distributed graph filtering problem. We design a family of autoregressive moving average (ARMA) recursions, which (i) are able to approximate any desired graph frequency response, and (ii) give exact solutions for tasks such as graph signal denoising and interpolation. The design phi...

On cyclic orthogonal double covers of circulant graphs by special infinite graphs

Directory of Open Access Journals (Sweden)

R. El-Shanawany

2017-12-01

Full Text Available In this article, a technique to construct cyclic orthogonal double covers (CODCs of regular circulant graphs by certain infinite graph classes such as complete bipartite and tripartite graphs and disjoint union of butterfly and K1,2n−10 is introduced.

75 FR 57912 - Application To Export Electric Energy; Rainbow Energy Marketing Corporation

Science.gov (United States)

2010-09-23

... DEPARTMENT OF ENERGY [OE Docket No. EA-375] Application To Export Electric Energy; Rainbow Energy... electric energy from the United States to Mexico pursuant to section 202(e) of the Federal Power Act. DATES... franchised service area. The electric energy that Rainbow proposes to export to Mexico would be surplus...

Quantum walks on quotient graphs

International Nuclear Information System (INIS)

Krovi, Hari; Brun, Todd A.

2007-01-01

A discrete-time quantum walk on a graph Γ is the repeated application of a unitary evolution operator to a Hilbert space corresponding to the graph. If this unitary evolution operator has an associated group of symmetries, then for certain initial states the walk will be confined to a subspace of the original Hilbert space. Symmetries of the original graph, given by its automorphism group, can be inherited by the evolution operator. We show that a quantum walk confined to the subspace corresponding to this symmetry group can be seen as a different quantum walk on a smaller quotient graph. We give an explicit construction of the quotient graph for any subgroup H of the automorphism group and illustrate it with examples. The automorphisms of the quotient graph which are inherited from the original graph are the original automorphism group modulo the subgroup H used to construct it. The quotient graph is constructed by removing the symmetries of the subgroup H from the original graph. We then analyze the behavior of hitting times on quotient graphs. Hitting time is the average time it takes a walk to reach a given final vertex from a given initial vertex. It has been shown in earlier work [Phys. Rev. A 74, 042334 (2006)] that the hitting time for certain initial states of a quantum walks can be infinite, in contrast to classical random walks. We give a condition which determines whether the quotient graph has infinite hitting times given that they exist in the original graph. We apply this condition for the examples discussed and determine which quotient graphs have infinite hitting times. All known examples of quantum walks with hitting times which are short compared to classical random walks correspond to systems with quotient graphs much smaller than the original graph; we conjecture that the existence of a small quotient graph with finite hitting times is necessary for a walk to exhibit a quantum speedup

Fundamentals of algebraic graph transformation

CERN Document Server

Ehrig, Hartmut; Prange, Ulrike; Taentzer, Gabriele

2006-01-01

Graphs are widely used to represent structural information in the form of objects and connections between them. Graph transformation is the rule-based manipulation of graphs, an increasingly important concept in computer science and related fields. This is the first textbook treatment of the algebraic approach to graph transformation, based on algebraic structures and category theory. Part I is an introduction to the classical case of graph and typed graph transformation. In Part II basic and advanced results are first shown for an abstract form of replacement systems, so-called adhesive high-level replacement systems based on category theory, and are then instantiated to several forms of graph and Petri net transformation systems. Part III develops typed attributed graph transformation, a technique of key relevance in the modeling of visual languages and in model transformation. Part IV contains a practical case study on model transformation and a presentation of the AGG (attributed graph grammar) tool envir...

Graph-based modelling in engineering

CERN Document Server

Rysiński, Jacek

2017-01-01

This book presents versatile, modern and creative applications of graph theory in mechanical engineering, robotics and computer networks. Topics related to mechanical engineering include e.g. machine and mechanism science, mechatronics, robotics, gearing and transmissions, design theory and production processes. The graphs treated are simple graphs, weighted and mixed graphs, bond graphs, Petri nets, logical trees etc. The authors represent several countries in Europe and America, and their contributions show how different, elegant, useful and fruitful the utilization of graphs in modelling of engineering systems can be. .

Digestibility in selected rainbow trout families and relation to growth and feed utilisation

DEFF Research Database (Denmark)

Rasmussen, Richard Skøtt; Jokumsen, Alfred

2009-01-01

Experiments have been carried out aimed at clarifying variations in the digestibility of dietary nutrients in rainbow trout families and studying how differences in digestibility may be related to growth and feed utilisation at various growth rates. The digestibility of protein, lipid...... the digestibility of protein, lipid, nitrogen-free extracts and dry matter was measured. Taken as a whole, our results indicate that selective breeding still offers a large potential for improved growth and feed utilisation in rainbow trout strains. In the first study, family Dc showed a higher specific growth rate......, carbohydrates (nitrogen-free extracts, NFE) and dry matter was analysed in two experiments involving eight rainbow trout families [Ab, Ba, Cd, Dc (first study); V, X, Y, Z (second study)]. In the first experiment rainbow trout were reared for 128 days at 13.0A degrees C, and in the second experiment, they were...

Rainbow: a tool for large-scale whole-genome sequencing data analysis using cloud computing.

Science.gov (United States)

Zhao, Shanrong; Prenger, Kurt; Smith, Lance; Messina, Thomas; Fan, Hongtao; Jaeger, Edward; Stephens, Susan

2013-06-27

Technical improvements have decreased sequencing costs and, as a result, the size and number of genomic datasets have increased rapidly. Because of the lower cost, large amounts of sequence data are now being produced by small to midsize research groups. Crossbow is a software tool that can detect single nucleotide polymorphisms (SNPs) in whole-genome sequencing (WGS) data from a single subject; however, Crossbow has a number of limitations when applied to multiple subjects from large-scale WGS projects. The data storage and CPU resources that are required for large-scale whole genome sequencing data analyses are too large for many core facilities and individual laboratories to provide. To help meet these challenges, we have developed Rainbow, a cloud-based software package that can assist in the automation of large-scale WGS data analyses. Here, we evaluated the performance of Rainbow by analyzing 44 different whole-genome-sequenced subjects. Rainbow has the capacity to process genomic data from more than 500 subjects in two weeks using cloud computing provided by the Amazon Web Service. The time includes the import and export of the data using Amazon Import/Export service. The average cost of processing a single sample in the cloud was less than 120 US dollars. Compared with Crossbow, the main improvements incorporated into Rainbow include the ability: (1) to handle BAM as well as FASTQ input files; (2) to split large sequence files for better load balance downstream; (3) to log the running metrics in data processing and monitoring multiple Amazon Elastic Compute Cloud (EC2) instances; and (4) to merge SOAPsnp outputs for multiple individuals into a single file to facilitate downstream genome-wide association studies. Rainbow is a scalable, cost-effective, and open-source tool for large-scale WGS data analysis. For human WGS data sequenced by either the Illumina HiSeq 2000 or HiSeq 2500 platforms, Rainbow can be used straight out of the box. Rainbow is available

完全图和星的合成的点可区别正常边染色%Vertex-distinguishing proper edge coloring of composition of complete graph and star

Institute of Scientific and Technical Information of China (English)

杨芳; 王治文; 陈祥恩; 马春燕

2013-01-01

首先,给出了完全图Kp和星Sq的合成的点可区别正常边色数的一个上界:当p≥2,q≥4时,上界是pq+1.再利用正多边形的对称性以及组合分析的方法来构造染色,分别得到了当p=2,q≥4;p≥3,q=4;p是偶数且p≥4,q=5;pq是奇数且p≥3,q≥5时,完全图Kp和星Sq的合成的点可区别正常边色数.%Firstly,we gave an upper bound for the vertex-distinguishing proper edge chromatic number of composition of complete graph Kp and star Sq,which is pq + 1 for p ≥ 2,q ≥ 4.Then by constructing coloring in terms of the symmetry of regular polygons and the methods of combinatorial analysis,we obtained respectively vertex-distinguishing proper edge chromatic numbers for composition of complete graph Kp and star Sq when p=2,q≥4;p≥3,q=4;pisevenandp≥4,q=5;pqisoddandp≥3,q≥5.

BootGraph: probabilistic fiber tractography using bootstrap algorithms and graph theory.

Science.gov (United States)

Vorburger, Robert S; Reischauer, Carolin; Boesiger, Peter

2013-02-01

Bootstrap methods have recently been introduced to diffusion-weighted magnetic resonance imaging to estimate the measurement uncertainty of ensuing diffusion parameters directly from the acquired data without the necessity to assume a noise model. These methods have been previously combined with deterministic streamline tractography algorithms to allow for the assessment of connection probabilities in the human brain. Thereby, the local noise induced disturbance in the diffusion data is accumulated additively due to the incremental progression of streamline tractography algorithms. Graph based approaches have been proposed to overcome this drawback of streamline techniques. For this reason, the bootstrap method is in the present work incorporated into a graph setup to derive a new probabilistic fiber tractography method, called BootGraph. The acquired data set is thereby converted into a weighted, undirected graph by defining a vertex in each voxel and edges between adjacent vertices. By means of the cone of uncertainty, which is derived using the wild bootstrap, a weight is thereafter assigned to each edge. Two path finding algorithms are subsequently applied to derive connection probabilities. While the first algorithm is based on the shortest path approach, the second algorithm takes all existing paths between two vertices into consideration. Tracking results are compared to an established algorithm based on the bootstrap method in combination with streamline fiber tractography and to another graph based algorithm. The BootGraph shows a very good performance in crossing situations with respect to false negatives and permits incorporating additional constraints, such as a curvature threshold. By inheriting the advantages of the bootstrap method and graph theory, the BootGraph method provides a computationally efficient and flexible probabilistic tractography setup to compute connection probability maps and virtual fiber pathways without the drawbacks of

Students' Understanding of Cloud and Rainbow Formation and Teachers' Awareness of Students' Performance

Science.gov (United States)

Malleus, Elina; Kikas, Eve; Kruus, Sigrid

2016-01-01

This study describes primary school students' knowledge about rainfall, clouds and rainbow formation together with teachers' predictions about students' performance. In our study, primary school students' (N = 177) knowledge about rainfall and rainbow formation was examined using structured interviews with open-ended questions. Primary school…

Thermodynamics and luminosities of rainbow black holes

Energy Technology Data Exchange (ETDEWEB)

Mu, Benrong [Physics Teaching and Research section, College of Medical Technology, Chengdu University of Traditional Chinese Medicine, No. 1166 Liutai Avenue, Chengdu (China); Wang, Peng; Yang, Haitang, E-mail: mubenrong@uestc.edu.cn, E-mail: pengw@scu.edu.cn, E-mail: hyanga@scu.edu.cn [Center for Theoretical Physics, College of Physical Science and Technology, Sichuan University, No. 24 South Section 1 Yihuan Road, Chengdu (China)

2015-11-01

Doubly special relativity (DSR) is an effective model for encoding quantum gravity in flat spacetime. As result of the nonlinearity of the Lorentz transformation, the energy-momentum dispersion relation is modified. One simple way to import DSR to curved spacetime is ''Gravity's rainbow'', where the spacetime background felt by a test particle would depend on its energy. Focusing on the ''Amelino-Camelia dispersion relation'' which is E{sup 2} = m{sup 2}+p{sup 2}[1−η(E/m{sub p}){sup n}] with n > 0, we investigate the thermodynamical properties of a Schwarzschild black hole and a static uncharged black string for all possible values of η and n in the framework of rainbow gravity. It shows that there are non-vanishing minimum masses for these two black holes in the cases with η < 0 and n ≥ 2. Considering effects of rainbow gravity on both the Hawking temperature and radius of the event horizon, we use the geometric optics approximation to compute luminosities of a 2D black hole, a Schwarzschild one and a static uncharged black string. It is found that the luminosities can be significantly suppressed or boosted depending on the values of η and n.

Growth, morphology, and developmental instability of rainbow trout, Yellowstone cutthroat trout, and four hybrid generations

Science.gov (United States)

Ostberg, C.O.; Duda, J.J.; Graham, J.H.; Zhang, S.; Haywood, K. P.; Miller, B.; Lerud, T.L.

2011-01-01

Hybridization of cutthroat trout Oncorhynchus clarkii with nonindigenous rainbow trout O. mykiss contributes to the decline of cutthroat trout subspecies throughout their native range. Introgression by rainbow trout can swamp the gene pools of cutthroat trout populations, especially if there is little selection against hybrids. We used rainbow trout, Yellowstone cutthroat trout O. clarkii bouvieri, and rainbow trout × Yellowstone cutthroat trout F1 hybrids as parents to construct seven different line crosses: F1 hybrids (both reciprocal crosses), F2 hybrids, first-generation backcrosses (both rainbow trout and Yellowstone cutthroat trout), and both parental taxa. We compared growth, morphology, and developmental instability among these seven crosses reared at two different temperatures. Growth was related to the proportion of rainbow trout genome present within the crosses. Meristic traits were influenced by maternal, additive, dominant, overdominant, and (probably) epistatic genetic effects. Developmental stability, however, was not disturbed in F1 hybrids, F2 hybrids, or backcrosses. Backcrosses were morphologically similar to their recurrent parent. The lack of developmental instability in hybrids suggests that there are few genetic incompatibilities preventing introgression. Our findings suggest that hybrids are not equal: that is, growth, development, character traits, and morphology differ depending on the genomic contribution from each parental species as well as the hybrid generation.

Regression analysis for LED color detection of visual-MIMO system

Science.gov (United States)

Banik, Partha Pratim; Saha, Rappy; Kim, Ki-Doo

2018-04-01

Color detection from a light emitting diode (LED) array using a smartphone camera is very difficult in a visual multiple-input multiple-output (visual-MIMO) system. In this paper, we propose a method to determine the LED color using a smartphone camera by applying regression analysis. We employ a multivariate regression model to identify the LED color. After taking a picture of an LED array, we select the LED array region, and detect the LED using an image processing algorithm. We then apply the k-means clustering algorithm to determine the number of potential colors for feature extraction of each LED. Finally, we apply the multivariate regression model to predict the color of the transmitted LEDs. In this paper, we show our results for three types of environmental light condition: room environmental light, low environmental light (560 lux), and strong environmental light (2450 lux). We compare the results of our proposed algorithm from the analysis of training and test R-Square (%) values, percentage of closeness of transmitted and predicted colors, and we also mention about the number of distorted test data points from the analysis of distortion bar graph in CIE1931 color space.

Equipackable graphs

DEFF Research Database (Denmark)

Vestergaard, Preben Dahl; Hartnell, Bert L.

2006-01-01

There are many results dealing with the problem of decomposing a fixed graph into isomorphic subgraphs. There has also been work on characterizing graphs with the property that one can delete the edges of a number of edge disjoint copies of the subgraph and, regardless of how that is done, the gr...

Khovanov homology of graph-links

Energy Technology Data Exchange (ETDEWEB)

Nikonov, Igor M [M. V. Lomonosov Moscow State University, Faculty of Mechanics and Mathematics, Moscow (Russian Federation)

2012-08-31

Graph-links arise as the intersection graphs of turning chord diagrams of links. Speaking informally, graph-links provide a combinatorial description of links up to mutations. Many link invariants can be reformulated in the language of graph-links. Khovanov homology, a well-known and useful knot invariant, is defined for graph-links in this paper (in the case of the ground field of characteristic two). Bibliography: 14 titles.

Guided color consistency optimization for image mosaicking

Science.gov (United States)

Xie, Renping; Xia, Menghan; Yao, Jian; Li, Li

2018-01-01

This paper studies the problem of color consistency correction for sequential images with diverse color characteristics. Existing algorithms try to adjust all images to minimize color differences among images under a unified energy framework, however, the results are prone to presenting a consistent but unnatural appearance when the color difference between images is large and diverse. In our approach, this problem is addressed effectively by providing a guided initial solution for the global consistency optimization, which avoids converging to a meaningless integrated solution. First of all, to obtain the reliable intensity correspondences in overlapping regions between image pairs, we creatively propose the histogram extreme point matching algorithm which is robust to image geometrical misalignment to some extents. In the absence of the extra reference information, the guided initial solution is learned from the major tone of the original images by searching some image subset as the reference, whose color characteristics will be transferred to the others via the paths of graph analysis. Thus, the final results via global adjustment will take on a consistent color similar to the appearance of the reference image subset. Several groups of convincing experiments on both the synthetic dataset and the challenging real ones sufficiently demonstrate that the proposed approach can achieve as good or even better results compared with the state-of-the-art approaches.

Generalized connectivity of graphs

CERN Document Server

Li, Xueliang

2016-01-01

Noteworthy results, proof techniques, open problems and conjectures in generalized (edge-) connectivity are discussed in this book. Both theoretical and practical analyses for generalized (edge-) connectivity of graphs are provided. Topics covered in this book include: generalized (edge-) connectivity of graph classes, algorithms, computational complexity, sharp bounds, Nordhaus-Gaddum-type results, maximum generalized local connectivity, extremal problems, random graphs, multigraphs, relations with the Steiner tree packing problem and generalizations of connectivity. This book enables graduate students to understand and master a segment of graph theory and combinatorial optimization. Researchers in graph theory, combinatorics, combinatorial optimization, probability, computer science, discrete algorithms, complexity analysis, network design, and the information transferring models will find this book useful in their studies.

On two energy-like invariants of line graphs and related graph operations

Directory of Open Access Journals (Sweden)

Xiaodan Chen

2016-02-01

Full Text Available Abstract For a simple graph G of order n, let μ 1 ≥ μ 2 ≥ ⋯ ≥ μ n = 0 $\\mu_{1}\\geq\\mu_{2}\\geq\\cdots\\geq\\mu_{n}=0$ be its Laplacian eigenvalues, and let q 1 ≥ q 2 ≥ ⋯ ≥ q n ≥ 0 $q_{1}\\geq q_{2}\\geq\\cdots\\geq q_{n}\\geq0$ be its signless Laplacian eigenvalues. The Laplacian-energy-like invariant and incidence energy of G are defined as, respectively, LEL ( G = ∑ i = 1 n − 1 μ i and IE ( G = ∑ i = 1 n q i . $$\\mathit{LEL}(G=\\sum_{i=1}^{n-1}\\sqrt{ \\mu_{i}} \\quad\\mbox{and}\\quad \\mathit {IE}(G=\\sum_{i=1}^{n} \\sqrt{q_{i}}. $$ In this paper, we present some new upper and lower bounds on LEL and IE of line graph, subdivision graph, para-line graph and total graph of a regular graph, some of which improve previously known results. The main tools we use here are the Cauchy-Schwarz inequality and the Ozeki inequality.

Looking for the rainbow on exoplanets covered by liquid and icy water clouds

NARCIS (Netherlands)

Karalidi, T.; Stam, D.M.; Hovenier, J.W.

2012-01-01

Aims. Looking for the primary rainbow in starlight that is reflected by exoplanets appears to be a promising method to search for liquid water clouds in exoplanetary atmospheres. Ice water clouds, that consist of water crystals instead of water droplets, could potentially mask the rainbow feature in

Price Competition on Graphs

OpenAIRE

Adriaan R. Soetevent

2010-01-01

This paper extends Hotelling's model of price competition with quadratic transportation costs from a line to graphs. I propose an algorithm to calculate firm-level demand for any given graph, conditional on prices and firm locations. One feature of graph models of price competition is that spatial discontinuities in firm-level demand may occur. I show that the existence result of D'Aspremont et al. (1979) does not extend to simple star graphs. I conjecture that this non-existence result holds...

Price Competition on Graphs

OpenAIRE

Pim Heijnen; Adriaan Soetevent

2014-01-01

This paper extends Hotelling's model of price competition with quadratic transportation costs from a line to graphs. We derive an algorithm to calculate firm-level demand for any given graph, conditional on prices and firm locations. These graph models of price competition may lead to spatial discontinuities in firm-level demand. We show that the existence result of D'Aspremont et al. (1979) does not extend to simple star graphs and conjecture that this non-existence result holds more general...

Skew-adjacency matrices of graphs

NARCIS (Netherlands)

Cavers, M.; Cioaba, S.M.; Fallat, S.; Gregory, D.A.; Haemers, W.H.; Kirkland, S.J.; McDonald, J.J.; Tsatsomeros, M.

2012-01-01

The spectra of the skew-adjacency matrices of a graph are considered as a possible way to distinguish adjacency cospectral graphs. This leads to the following topics: graphs whose skew-adjacency matrices are all cospectral; relations between the matchings polynomial of a graph and the characteristic

Graph theory

CERN Document Server

Diestel, Reinhard

2017-01-01

This standard textbook of modern graph theory, now in its fifth edition, combines the authority of a classic with the engaging freshness of style that is the hallmark of active mathematics. It covers the core material of the subject with concise yet reliably complete proofs, while offering glimpses of more advanced methods in each field by one or two deeper results, again with proofs given in full detail. The book can be used as a reliable text for an introductory course, as a graduate text, and for self-study. From the reviews: “This outstanding book cannot be substituted with any other book on the present textbook market. It has every chance of becoming the standard textbook for graph theory.”Acta Scientiarum Mathematiciarum “Deep, clear, wonderful. This is a serious book about the heart of graph theory. It has depth and integrity. ”Persi Diaconis & Ron Graham, SIAM Review “The book has received a very enthusiastic reception, which it amply deserves. A masterly elucidation of modern graph theo...

Graph Sampling for Covariance Estimation

KAUST Repository

Chepuri, Sundeep Prabhakar

2017-04-25

In this paper the focus is on subsampling as well as reconstructing the second-order statistics of signals residing on nodes of arbitrary undirected graphs. Second-order stationary graph signals may be obtained by graph filtering zero-mean white noise and they admit a well-defined power spectrum whose shape is determined by the frequency response of the graph filter. Estimating the graph power spectrum forms an important component of stationary graph signal processing and related inference tasks such as Wiener prediction or inpainting on graphs. The central result of this paper is that by sampling a significantly smaller subset of vertices and using simple least squares, we can reconstruct the second-order statistics of the graph signal from the subsampled observations, and more importantly, without any spectral priors. To this end, both a nonparametric approach as well as parametric approaches including moving average and autoregressive models for the graph power spectrum are considered. The results specialize for undirected circulant graphs in that the graph nodes leading to the best compression rates are given by the so-called minimal sparse rulers. A near-optimal greedy algorithm is developed to design the subsampling scheme for the non-parametric and the moving average models, whereas a particular subsampling scheme that allows linear estimation for the autoregressive model is proposed. Numerical experiments on synthetic as well as real datasets related to climatology and processing handwritten digits are provided to demonstrate the developed theory.

Price competition on graphs

NARCIS (Netherlands)

Soetevent, A.R.

2010-01-01

This paper extends Hotelling's model of price competition with quadratic transportation costs from a line to graphs. I propose an algorithm to calculate firm-level demand for any given graph, conditional on prices and firm locations. One feature of graph models of price competition is that spatial

Mapping of five candidate sex-determining loci in rainbow trout (Oncorhynchus mykiss

Directory of Open Access Journals (Sweden)

Drew Robert E

2009-01-01

Full Text Available Abstract Background Rainbow trout have an XX/XY genetic mechanism of sex determination where males are the heterogametic sex. The homology of the sex-determining gene (SDG in medaka to Dmrt1 suggested that SDGs evolve from downstream genes by gene duplication. Orthologous sequences of the major genes of the mammalian sex determination pathway have been reported in the rainbow trout but the map position for the majority of these genes has not been assigned. Results Five loci of four candidate genes (Amh, Dax1, Dmrt1 and Sox6 were tested for linkage to the Y chromosome of rainbow trout. We exclude the role of all these loci as candidates for the primary SDG in this species. Sox6i and Sox6ii, duplicated copies of Sox6, mapped to homeologous linkage groups 10 and 18 respectively. Genotyping fishes of the OSU × Arlee mapping family for Sox6i and Sox6ii alleles indicated that Sox6i locus might be deleted in the Arlee lineage. Conclusion Additional candidate genes should be tested for their linkage to the Y chromosome. Mapping data of duplicated Sox6 loci supports previously suggested homeology between linkage groups 10 and 18. Enrichment of the rainbow trout genomic map with known gene markers allows map comparisons with other salmonids. Mapping of candidate sex-determining loci is important for analyses of potential autosomal modifiers of sex-determination in rainbow trout.

Graphing the order of the sexes: constructing, recalling, interpreting, and putting the self in gender difference graphs.

Science.gov (United States)

Hegarty, Peter; Lemieux, Anthony F; McQueen, Grant

2010-03-01

Graphs seem to connote facts more than words or tables do. Consequently, they seem unlikely places to spot implicit sexism at work. Yet, in 6 studies (N = 741), women and men constructed (Study 1) and recalled (Study 2) gender difference graphs with men's data first, and graphed powerful groups (Study 3) and individuals (Study 4) ahead of weaker ones. Participants who interpreted graph order as evidence of author "bias" inferred that the author graphed his or her own gender group first (Study 5). Women's, but not men's, preferences to graph men first were mitigated when participants graphed a difference between themselves and an opposite-sex friend prior to graphing gender differences (Study 6). Graph production and comprehension are affected by beliefs and suppositions about the groups represented in graphs to a greater degree than cognitive models of graph comprehension or realist models of scientific thinking have yet acknowledged.

Collective Rationality in Graph Aggregation

NARCIS (Netherlands)

Endriss, U.; Grandi, U.; Schaub, T.; Friedrich, G.; O'Sullivan, B.

2014-01-01

Suppose a number of agents each provide us with a directed graph over a common set of vertices. Graph aggregation is the problem of computing a single “collective” graph that best represents the information inherent in this profile of individual graphs. We consider this aggregation problem from the

GoFFish: A Sub-Graph Centric Framework for Large-Scale Graph Analytics1

Energy Technology Data Exchange (ETDEWEB)

Simmhan, Yogesh; Kumbhare, Alok; Wickramaarachchi, Charith; Nagarkar, Soonil; Ravi, Santosh; Raghavendra, Cauligi; Prasanna, Viktor

2014-08-25

Large scale graph processing is a major research area for Big Data exploration. Vertex centric programming models like Pregel are gaining traction due to their simple abstraction that allows for scalable execution on distributed systems naturally. However, there are limitations to this approach which cause vertex centric algorithms to under-perform due to poor compute to communication overhead ratio and slow convergence of iterative superstep. In this paper we introduce GoFFish a scalable sub-graph centric framework co-designed with a distributed persistent graph storage for large scale graph analytics on commodity clusters. We introduce a sub-graph centric programming abstraction that combines the scalability of a vertex centric approach with the flexibility of shared memory sub-graph computation. We map Connected Components, SSSP and PageRank algorithms to this model to illustrate its flexibility. Further, we empirically analyze GoFFish using several real world graphs and demonstrate its significant performance improvement, orders of magnitude in some cases, compared to Apache Giraph, the leading open source vertex centric implementation. We map Connected Components, SSSP and PageRank algorithms to this model to illustrate its flexibility. Further, we empirically analyze GoFFish using several real world graphs and demonstrate its significant performance improvement, orders of magnitude in some cases, compared to Apache Giraph, the leading open source vertex centric implementation.

Immunity to rhabdoviruses in rainbow trout: the antibody response

DEFF Research Database (Denmark)

Lorenzen, Niels; Lapatra, S.E.

1999-01-01

to their occasional detrimental effect on rainbow trout farming. Research efforts have been focused on understanding the mechanisms involved in protective immunity. Several specific and nonspecific cellular and humoral parameters are believed to be involved, but only the antibody response has been characterised......, have demonstrated that rainbow trout can produce specific and highly functional antibodies that are able to neutralise virus pathogenicity in vitro as well as in vivo. The apparently more restricted antibody response to IHNV and VHSV antigens in fish compared to mammals could possibly be explained...... aspects of antibody response and antibody reactivity with IHNV and VHSV antigens....

Vertebral column deformities in farmed rainbow trout ( Oncorhynchus mykiss )

DEFF Research Database (Denmark)

Madsen, Lone; Dalsgaard, Inger

1999-01-01

Farmed rainbow trout (Oncorhynchus mykiss) were fed diets with either different levels of vitamin C, or diets enriched with glucan or chitin, from feeding start and 6 months onwards. At an average weight of 100 g, the trout were X-rayed to determine the deformity level. The investigations showed...... of deformities (4.8%). In all groups examined, the deformities were spread over the whole vertebral column. The deformities in the group fed the low vitamin C diet were more severe than those found in the other groups. An outbreak of the disease rainbow trout fry syndrome (RTFS) caused by the bacterium...

Graph Theory. 1. Fragmentation of Structural Graphs

Directory of Open Access Journals (Sweden)

Lorentz JÄNTSCHI

2002-12-01

Full Text Available The investigation of structural graphs has many fields of applications in engineering, especially in applied sciences like as applied chemistry and physics, computer sciences and automation, electronics and telecommunication. The main subject of the paper is to express fragmentation criteria in graph using a new method of investigation: terminal paths. Using terminal paths are defined most of the fragmentation criteria that are in use in molecular topology, but the fields of applications are more generally than that, as I mentioned before. Graphical examples of fragmentation are given for every fragmentation criteria. Note that all fragmentation is made with a computer program that implements a routine for every criterion.[1] A web routine for tracing all terminal paths in graph can be found at the address: http://vl.academicdirect.ro/molecular_topology/tpaths/ [1] M. V. Diudea, I. Gutman, L. Jäntschi, Molecular Topology, Nova Science, Commack, New York, 2001, 2002.

Infection experiments with novel Piscine orthoreovirus from rainbow trout (Oncorhynchus mykiss in salmonids.

Directory of Open Access Journals (Sweden)

Helena Hauge

Full Text Available A new disease in farmed rainbow trout (Onchorhyncus mykiss was described in Norway in 2013. The disease mainly affected the heart and resembled heart and skeletal muscle inflammation (HSMI in Atlantic salmon (Salmo salar L.. HSMI is associated with Piscine orthoreovirus (PRV, and a search for a similar virus in the diseased rainbow trout led to detection of a sequence with 85% similarity to PRV. This finding called for a targeted effort to assess the risk the new PRV-variant pose on farmed rainbow trout and Atlantic salmon by studying infection and disease pathogenesis, aiming to provide more diagnostic knowledge. Based on the genetic relationship to PRV, the novel virus is referred to as PRV-Oncorhynchus mykiss (PRV-Om in contrast to PRV-Salmo salar (PRV-Ss. In experimental trials, intraperitoneally injected PRV-Om was shown to replicate in blood in both salmonid species, but more effectively in rainbow trout. In rainbow trout, the virus levels peaked in blood and heart of cohabitants 6 weeks post challenge, along with increased expression of antiviral genes (Mx and viperin in the spleen, with 80-100% of the cohabitants infected. Heart inflammation was diagnosed in all cohabitants examined 8 weeks post challenge. In contrast, less than 50% of the Atlantic salmon cohabitants were infected between 8 and 16 weeks post challenge and the antiviral response in these fish was very low. From 12 weeks post challenge and onwards, mild focal myocarditis was demonstrated in a few virus-positive salmon. In conclusion, PRV-Om infects both salmonid species, but faster transmission, more notable antiviral response and more prominent heart pathology were observed in rainbow trout.

Introductory graph theory

CERN Document Server

Chartrand, Gary

1984-01-01

Graph theory is used today in the physical sciences, social sciences, computer science, and other areas. Introductory Graph Theory presents a nontechnical introduction to this exciting field in a clear, lively, and informative style. Author Gary Chartrand covers the important elementary topics of graph theory and its applications. In addition, he presents a large variety of proofs designed to strengthen mathematical techniques and offers challenging opportunities to have fun with mathematics. Ten major topics - profusely illustrated - include: Mathematical Models, Elementary Concepts of Grap

OCCURRENCE OF INFECTIOUS PANCREATIC NECROSIS VIRUS (IPNV IN FARMED RAINBOW TROUT (ONCHORHYNCHUS MYKISS IN KOSOVO

Directory of Open Access Journals (Sweden)

Agim Rexhepi

2013-10-01

Full Text Available This article describes the research carried out for the detection of viruses responsible for VHS, IHN and IPN diseases in farmed rainbow trout (Oncorhynchus mykiss in Kosovo for the three-year period between 2006 and 2008. Losses are often reported in trout fingerlings, but no virus has ever been isolated in the rainbow trout in Kosovo. A research project was carried out to determine the occurrence of VHSV, IHNV & IPNV from the samples of fish tissue and ovarian fluids from mature broodfish. In total, 467 fishes from 113 (pools in 10 rainbow trout aquaculture facilities were screened. Laboratory analysis was performed at the TGD (Tiergesundheitsdienst Bayern e. V laboratory in Germany using the biomolecular method of RT-PCR and nested-PCR. The Infectious Pancreatic Necrosis virus was detected in seven trout farms, and prevalence from total samples (pools was 11.5 %. This is the first research and report for IPN virus diagnosis in farmed rainbow trout fry, on-growing fish and broodfish in Kosovo. Keywords: Rainbow trout, viral diseases, IPN, RT-PCR, nested PCR

Hierarchical graph-based segmentation for extracting road networks from high-resolution satellite images

Science.gov (United States)

Alshehhi, Rasha; Marpu, Prashanth Reddy

2017-04-01

Extraction of road networks in urban areas from remotely sensed imagery plays an important role in many urban applications (e.g. road navigation, geometric correction of urban remote sensing images, updating geographic information systems, etc.). It is normally difficult to accurately differentiate road from its background due to the complex geometry of the buildings and the acquisition geometry of the sensor. In this paper, we present a new method for extracting roads from high-resolution imagery based on hierarchical graph-based image segmentation. The proposed method consists of: 1. Extracting features (e.g., using Gabor and morphological filtering) to enhance the contrast between road and non-road pixels, 2. Graph-based segmentation consisting of (i) Constructing a graph representation of the image based on initial segmentation and (ii) Hierarchical merging and splitting of image segments based on color and shape features, and 3. Post-processing to remove irregularities in the extracted road segments. Experiments are conducted on three challenging datasets of high-resolution images to demonstrate the proposed method and compare with other similar approaches. The results demonstrate the validity and superior performance of the proposed method for road extraction in urban areas.

Creating more effective graphs

CERN Document Server

Robbins, Naomi B

2012-01-01

A succinct and highly readable guide to creating effective graphs The right graph can be a powerful tool for communicating information, improving a presentation, or conveying your point in print. If your professional endeavors call for you to present data graphically, here's a book that can help you do it more effectively. Creating More Effective Graphs gives you the basic knowledge and techniques required to choose and create appropriate graphs for a broad range of applications. Using real-world examples everyone can relate to, the author draws on her years of experience in gr

Graph Compression by BFS

Directory of Open Access Journals (Sweden)

Alberto Apostolico

2009-08-01

Full Text Available The Web Graph is a large-scale graph that does not fit in main memory, so that lossless compression methods have been proposed for it. This paper introduces a compression scheme that combines efficient storage with fast retrieval for the information in a node. The scheme exploits the properties of the Web Graph without assuming an ordering of the URLs, so that it may be applied to more general graphs. Tests on some datasets of use achieve space savings of about 10% over existing methods.

Graphing Inequalities, Connecting Meaning

Science.gov (United States)

Switzer, J. Matt

2014-01-01

Students often have difficulty with graphing inequalities (see Filloy, Rojano, and Rubio 2002; Drijvers 2002), and J. Matt Switzer's students were no exception. Although students can produce graphs for simple inequalities, they often struggle when the format of the inequality is unfamiliar. Even when producing a correct graph of an…

Fuzzy Graph Language Recognizability

OpenAIRE

Kalampakas , Antonios; Spartalis , Stefanos; Iliadis , Lazaros

2012-01-01

Part 5: Fuzzy Logic; International audience; Fuzzy graph language recognizability is introduced along the lines of the established theory of syntactic graph language recognizability by virtue of the algebraic structure of magmoids. The main closure properties of the corresponding class are investigated and several interesting examples of fuzzy graph languages are examined.

Bell inequalities for graph states

International Nuclear Information System (INIS)

Toth, G.; Hyllus, P.; Briegel, H.J.; Guehne, O.

2005-01-01

Full text: In the last years graph states have attracted an increasing interest in the field of quantum information theory. Graph states form a family of multi-qubit states which comprises many popular states such as the GHZ states and the cluster states. They also play an important role in applications. For instance, measurement based quantum computation uses graph states as resources. From a theoretical point of view, it is remarkable that graph states allow for a simple description in terms of stabilizing operators. In this contribution, we investigate the non-local properties of graph states. We derive a family of Bell inequalities which require three measurement settings for each party and are maximally violated by graph states. In turn, any graph state violates at least one of the inequalities. We show that for certain types of graph states the violation of these inequalities increases exponentially with the number of qubits. We also discuss connections to other entanglement properties such as the positively of the partial transpose or the geometric measure of entanglement. (author)

Quantitative graph theory mathematical foundations and applications

CERN Document Server

Dehmer, Matthias

2014-01-01

The first book devoted exclusively to quantitative graph theory, Quantitative Graph Theory: Mathematical Foundations and Applications presents and demonstrates existing and novel methods for analyzing graphs quantitatively. Incorporating interdisciplinary knowledge from graph theory, information theory, measurement theory, and statistical techniques, this book covers a wide range of quantitative-graph theoretical concepts and methods, including those pertaining to real and random graphs such as:Comparative approaches (graph similarity or distance)Graph measures to characterize graphs quantitat

Dynamic Representations of Sparse Graphs

DEFF Research Database (Denmark)

Brodal, Gerth Stølting; Fagerberg, Rolf

1999-01-01

We present a linear space data structure for maintaining graphs with bounded arboricity—a large class of sparse graphs containing e.g. planar graphs and graphs of bounded treewidth—under edge insertions, edge deletions, and adjacency queries. The data structure supports adjacency queries in worst...... case O(c) time, and edge insertions and edge deletions in amortized O(1) and O(c+log n) time, respectively, where n is the number of nodes in the graph, and c is the bound on the arboricity....

Spectral fluctuations of quantum graphs

International Nuclear Information System (INIS)

Pluhař, Z.; Weidenmüller, H. A.

2014-01-01

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

Multiple graph regularized protein domain ranking.

Science.gov (United States)

Wang, Jim Jing-Yan; Bensmail, Halima; Gao, Xin

2012-11-19

Protein domain ranking is a fundamental task in structural biology. Most protein domain ranking methods rely on the pairwise comparison of protein domains while neglecting the global manifold structure of the protein domain database. Recently, graph regularized ranking that exploits the global structure of the graph defined by the pairwise similarities has been proposed. However, the existing graph regularized ranking methods are very sensitive to the choice of the graph model and parameters, and this remains a difficult problem for most of the protein domain ranking methods. To tackle this problem, we have developed the Multiple Graph regularized Ranking algorithm, MultiG-Rank. Instead of using a single graph to regularize the ranking scores, MultiG-Rank approximates the intrinsic manifold of protein domain distribution by combining multiple initial graphs for the regularization. Graph weights are learned with ranking scores jointly and automatically, by alternately minimizing an objective function in an iterative algorithm. Experimental results on a subset of the ASTRAL SCOP protein domain database demonstrate that MultiG-Rank achieves a better ranking performance than single graph regularized ranking methods and pairwise similarity based ranking methods. The problem of graph model and parameter selection in graph regularized protein domain ranking can be solved effectively by combining multiple graphs. This aspect of generalization introduces a new frontier in applying multiple graphs to solving protein domain ranking applications.

Black hole thermodynamics in Lovelock gravity's rainbow with (A)dS asymptote

Energy Technology Data Exchange (ETDEWEB)

Hendi, Seyed Hossein, E-mail: hendi@shirazu.ac.ir [Physics Department and Biruni Observatory, College of Sciences, Shiraz University, Shiraz 71454 (Iran, Islamic Republic of); Research Institute for Astrophysics and Astronomy of Maragha (RIAAM), P.O. Box 55134-441, Maragha (Iran, Islamic Republic of); Dehghani, Ali, E-mail: ali.dehghani.phys@gmail.com [Physics Department and Biruni Observatory, College of Sciences, Shiraz University, Shiraz 71454 (Iran, Islamic Republic of); Faizal, Mir, E-mail: f2mir@uwaterloo.ca [Irving K. Barber School of Arts and Sciences, University of British Columbia – Okanagan, Kelowna, BC V1V 1V7 (Canada); Department of Physics and Astronomy, University of Lethbridge, Lethbridge, AB T1K 3M4 (Canada)

2017-01-15

In this paper, we combine Lovelock gravity with gravity's rainbow to construct Lovelock gravity's rainbow. Considering the Lovelock gravity's rainbow coupled to linear and also nonlinear electromagnetic gauge fields, we present two new classes of topological black hole solutions. We compute conserved and thermodynamic quantities of these black holes (such as temperature, entropy, electric potential, charge and mass) and show that these quantities satisfy the first law of thermodynamics. In order to study the thermal stability in canonical ensemble, we calculate the heat capacity and determinant of the Hessian matrix and show in what regions there are thermally stable phases for black holes. Also, we discuss the dependence of thermodynamic behavior and thermal stability of black holes on rainbow functions. Finally, we investigate the critical behavior of black holes in the extended phase space and study their interesting properties.

ON BIPOLAR SINGLE VALUED NEUTROSOPHIC GRAPHS

OpenAIRE

Said Broumi; Mohamed Talea; Assia Bakali; Florentin Smarandache

2016-01-01

In this article, we combine the concept of bipolar neutrosophic set and graph theory. We introduce the notions of bipolar single valued neutrosophic graphs, strong bipolar single valued neutrosophic graphs, complete bipolar single valued neutrosophic graphs, regular bipolar single valued neutrosophic graphs and investigate some of their related properties.

Practical graph mining with R

CERN Document Server

Hendrix, William; Jenkins, John; Padmanabhan, Kanchana; Chakraborty, Arpan

2014-01-01

Practical Graph Mining with R presents a "do-it-yourself" approach to extracting interesting patterns from graph data. It covers many basic and advanced techniques for the identification of anomalous or frequently recurring patterns in a graph, the discovery of groups or clusters of nodes that share common patterns of attributes and relationships, the extraction of patterns that distinguish one category of graphs from another, and the use of those patterns to predict the category of new graphs. Hands-On Application of Graph Data Mining Each chapter in the book focuses on a graph mining task, such as link analysis, cluster analysis, and classification. Through applications using real data sets, the book demonstrates how computational techniques can help solve real-world problems. The applications covered include network intrusion detection, tumor cell diagnostics, face recognition, predictive toxicology, mining metabolic and protein-protein interaction networks, and community detection in social networks. De...

Tissue astaxanthin and canthaxanthin distribution in rainbow trout (Oncorhynchus mykiss) and Atlantic salmon (Salmo salar).

Science.gov (United States)

Page, G I; Davies, S J

2006-01-01

A comparative investigation of tissue carotenoid distribution between rainbow trout, Oncorhynchus mykiss, and Atlantic salmon, Salmo salar, was undertaken to identify the relative efficiency of utilization of astaxanthin and canthaxanthin. Higher apparent digestibility coefficients (ADCs) (96% in trout vs. 28-31% in salmon; Ptrout vs. 5.5% in salmon; Ptrout. Astaxanthin deposition was higher than canthaxanthin in rainbow trout, while the reverse was true for Atlantic salmon, suggesting species-specificity in carotenoid utilization. The white muscle (95% in trout vs. 93% in salmon) and kidneys (0.5% in trout vs. 0.2% in salmon) represented higher proportions of the total body carotenoid pool in rainbow trout than in Atlantic salmon (Ptrout; Ptrout. Liver catabolism is suspected to be a critical determinant in carotenoid clearance, with higher catabolism expected in Atlantic salmon than in rainbow trout.

A seminar on graph theory

CERN Document Server

Harary, Frank

2015-01-01

Presented in 1962-63 by experts at University College, London, these lectures offer a variety of perspectives on graph theory. Although the opening chapters form a coherent body of graph theoretic concepts, this volume is not a text on the subject but rather an introduction to the extensive literature of graph theory. The seminar's topics are geared toward advanced undergraduate students of mathematics.Lectures by this volume's editor, Frank Harary, include ""Some Theorems and Concepts of Graph Theory,"" ""Topological Concepts in Graph Theory,"" ""Graphical Reconstruction,"" and other introduc

Effect of stocking sub-yearling Atlantic salmon on the habitat use of sub-yearling rainbow trout

Science.gov (United States)

Johnson, James H.

2016-01-01

Atlantic salmon (Salmo salar) restoration in the Lake Ontario watershed may depend on the species' ability to compete with naturalized non-native salmonids, including rainbow trout (Oncorhynchus mykiss) in Lake Ontario tributaries. This study examined interspecific habitat associations between sub-yearling Atlantic salmon and rainbow trout as well as the effect of salmon stocking on trout habitat in two streams in the Lake Ontario watershed. In sympatry, Atlantic salmon occupied significantly faster velocities and deeper areas than rainbow trout. However, when examining the habitat use of rainbow trout at all allopatric and sympatric sites in both streams, trout habitat use was more diverse at the sympatric sites with an orientation for increased cover and larger substrate. In Grout Brook, where available habitat remained constant, there was evidence suggesting that trout may have shifted to slower and shallower water in the presence of salmon. The ability of sub-yearling Atlantic salmon to affect a habitat shift in rainbow trout may be due to their larger body size and/or larger pectoral fin size. Future studies examining competitive interactions between these species during their first year of stream residence should consider the size advantage that earlier emerging Atlantic salmon will have over rainbow trout.

Uniform Single Valued Neutrosophic Graphs

Directory of Open Access Journals (Sweden)

S. Broumi

2017-09-01

Full Text Available In this paper, we propose a new concept named the uniform single valued neutrosophic graph. An illustrative example and some properties are examined. Next, we develop an algorithmic approach for computing the complement of the single valued neutrosophic graph. A numerical example is demonstrated for computing the complement of single valued neutrosophic graphs and uniform single valued neutrosophic graph.

Extremal graph theory

CERN Document Server

Bollobas, Bela

2004-01-01

The ever-expanding field of extremal graph theory encompasses a diverse array of problem-solving methods, including applications to economics, computer science, and optimization theory. This volume, based on a series of lectures delivered to graduate students at the University of Cambridge, presents a concise yet comprehensive treatment of extremal graph theory.Unlike most graph theory treatises, this text features complete proofs for almost all of its results. Further insights into theory are provided by the numerous exercises of varying degrees of difficulty that accompany each chapter. A

Estrogen receptor mRNA in mineralized tissues of rainbow trout: calcium mobilization by estrogen.

Science.gov (United States)

Armour, K J; Lehane, D B; Pakdel, F; Valotaire, Y; Graham, R; Russell, R G; Henderson, I W

1997-07-07

RT-PCR was undertaken on total RNA extracts from bone and scales of the rainbow trout, Oncorhynchus mykiss. The rainbow trout estrogen receptor (ER)-specific primers used amplified a single product of expected size from each tissue which, using Southern blotting, strongly hybridized with a 32P-labelled rtER probe under stringent conditions. These data provide the first in vivo evidence of ER mRNA in bone and scale tissues of rainbow trout and suggest that the effects of estrogen observed in this study (increased bone mineral and decreased scale mineral contents, respectively) may be mediated directly through ER.

Multiple graph regularized protein domain ranking

KAUST Repository

Wang, Jim Jing-Yan

2012-11-19

Background: Protein domain ranking is a fundamental task in structural biology. Most protein domain ranking methods rely on the pairwise comparison of protein domains while neglecting the global manifold structure of the protein domain database. Recently, graph regularized ranking that exploits the global structure of the graph defined by the pairwise similarities has been proposed. However, the existing graph regularized ranking methods are very sensitive to the choice of the graph model and parameters, and this remains a difficult problem for most of the protein domain ranking methods.Results: To tackle this problem, we have developed the Multiple Graph regularized Ranking algorithm, MultiG-Rank. Instead of using a single graph to regularize the ranking scores, MultiG-Rank approximates the intrinsic manifold of protein domain distribution by combining multiple initial graphs for the regularization. Graph weights are learned with ranking scores jointly and automatically, by alternately minimizing an objective function in an iterative algorithm. Experimental results on a subset of the ASTRAL SCOP protein domain database demonstrate that MultiG-Rank achieves a better ranking performance than single graph regularized ranking methods and pairwise similarity based ranking methods.Conclusion: The problem of graph model and parameter selection in graph regularized protein domain ranking can be solved effectively by combining multiple graphs. This aspect of generalization introduces a new frontier in applying multiple graphs to solving protein domain ranking applications. 2012 Wang et al; licensee BioMed Central Ltd.

Multiple graph regularized protein domain ranking

KAUST Repository

Wang, Jim Jing-Yan; Bensmail, Halima; Gao, Xin

2012-01-01

Background: Protein domain ranking is a fundamental task in structural biology. Most protein domain ranking methods rely on the pairwise comparison of protein domains while neglecting the global manifold structure of the protein domain database. Recently, graph regularized ranking that exploits the global structure of the graph defined by the pairwise similarities has been proposed. However, the existing graph regularized ranking methods are very sensitive to the choice of the graph model and parameters, and this remains a difficult problem for most of the protein domain ranking methods.Results: To tackle this problem, we have developed the Multiple Graph regularized Ranking algorithm, MultiG-Rank. Instead of using a single graph to regularize the ranking scores, MultiG-Rank approximates the intrinsic manifold of protein domain distribution by combining multiple initial graphs for the regularization. Graph weights are learned with ranking scores jointly and automatically, by alternately minimizing an objective function in an iterative algorithm. Experimental results on a subset of the ASTRAL SCOP protein domain database demonstrate that MultiG-Rank achieves a better ranking performance than single graph regularized ranking methods and pairwise similarity based ranking methods.Conclusion: The problem of graph model and parameter selection in graph regularized protein domain ranking can be solved effectively by combining multiple graphs. This aspect of generalization introduces a new frontier in applying multiple graphs to solving protein domain ranking applications. 2012 Wang et al; licensee BioMed Central Ltd.

Multiple graph regularized protein domain ranking

Directory of Open Access Journals (Sweden)

Wang Jim

2012-11-01

Full Text Available Abstract Background Protein domain ranking is a fundamental task in structural biology. Most protein domain ranking methods rely on the pairwise comparison of protein domains while neglecting the global manifold structure of the protein domain database. Recently, graph regularized ranking that exploits the global structure of the graph defined by the pairwise similarities has been proposed. However, the existing graph regularized ranking methods are very sensitive to the choice of the graph model and parameters, and this remains a difficult problem for most of the protein domain ranking methods. Results To tackle this problem, we have developed the Multiple Graph regularized Ranking algorithm, MultiG-Rank. Instead of using a single graph to regularize the ranking scores, MultiG-Rank approximates the intrinsic manifold of protein domain distribution by combining multiple initial graphs for the regularization. Graph weights are learned with ranking scores jointly and automatically, by alternately minimizing an objective function in an iterative algorithm. Experimental results on a subset of the ASTRAL SCOP protein domain database demonstrate that MultiG-Rank achieves a better ranking performance than single graph regularized ranking methods and pairwise similarity based ranking methods. Conclusion The problem of graph model and parameter selection in graph regularized protein domain ranking can be solved effectively by combining multiple graphs. This aspect of generalization introduces a new frontier in applying multiple graphs to solving protein domain ranking applications.

Canonical Labelling of Site Graphs

Directory of Open Access Journals (Sweden)

Nicolas Oury

2013-06-01

Full Text Available We investigate algorithms for canonical labelling of site graphs, i.e. graphs in which edges bind vertices on sites with locally unique names. We first show that the problem of canonical labelling of site graphs reduces to the problem of canonical labelling of graphs with edge colourings. We then present two canonical labelling algorithms based on edge enumeration, and a third based on an extension of Hopcroft's partition refinement algorithm. All run in quadratic worst case time individually. However, one of the edge enumeration algorithms runs in sub-quadratic time for graphs with "many" automorphisms, and the partition refinement algorithm runs in sub-quadratic time for graphs with "few" bisimulation equivalences. This suite of algorithms was chosen based on the expectation that graphs fall in one of those two categories. If that is the case, a combined algorithm runs in sub-quadratic worst case time. Whether this expectation is reasonable remains an interesting open problem.

DAN IDENTIFIKASI PATOGEN POTENSIAL YANG MENGINFEKSI IKAN RAINBOW (Melanotaenia sp.

Directory of Open Access Journals (Sweden)

Lili Sholichah

2014-03-01

Full Text Available Pemeliharaan ikan rainbow (Melanotaenia sp. di Balai Penelitian dan Pengembangan Budidaya Ikan Hias selalu terjadi kematian secara bertahap mulai calon induk hingga proses pemijahan. Hal ini terjadi berulang kali sehingga ketersediaan induk Melanotaenia sp. sangat terancam. Ikan ini berasal dari Papua yang diperoleh mengandalkan penangkapan di alam. Tujuan dari penelitian ini adalah untuk menginventarisir dan mengidentifikasi berbagai patogen (parasit, jamur, bakteri potensial yang menginfeksi ikan rainbow yang dipelihara di dalam akuarium berukuran 50 cm x 50 cm x 50 cm dengan sistem aliran air stagnan. Tiga jenis rainbow yang dipelihara yaitu: rainbow Sungai Salawati, asal Sungai Sawiat, dan asal Danau Kurumoi. Setiap ikan masing-masing berjumlah 100 ekor dipelihara di akuarium dengan penambahan batu karang dan tanpa penambahan karang (kontrol ke dalam akuarium. Ikan diberi pakan sekenyangnya berupa jentik nyamuk dan cacing rambut beku setiap pagi dan sore hari. Sampling dilakukan secara random sebulan sekali dan secara unrandom setiap ada kejadian ikan sakit. Gejala klinis ikan yang sakit sebagai berikut: ikan berenang di permukaan dan menggosok-gosokkan badan di dinding akuarium, nafsu makan berkurang, gerakan berputar-putar, warna memudar menjadi putih, penekanan warna hitam pada sirip punggung dan perut meningkat, pendarahan pada perut, lendir berlebihan dan sangat berbau, serta sisik berdiri/terbuka. Diagnosa dan deteksi penyakit awal berupa pengamatan parasit baik ektoparasit maupun endoparasit, pengamatan dan isolasi jamur pada media selektif jamur, dan isolasi bakteri dilakukan untuk mengetahui jenis-jenis patogen yang menginfeksi ketiga jenis ikan rainbow. Selanjutnya dilakukan uji histologi dan analisa DNA beberapa patogen. Hasil pengamatan diperoleh patogen berupa parasit (Ichthyophthirius sp., Dactylogyrus sp., Gyrodactylus sp., dan Trichodina sp. dan bakteri (Aeromonas hydrophila, Acinetobacter sp

Rainbow refractometry on particles with radial refractive index gradients

Energy Technology Data Exchange (ETDEWEB)

Saengkaew, Sawitree [CNRS/Universite et INSA de Rouen, UMR 6614/CORIA, BP12, 76 800, Saint Etienne du Rouvray CEDEX (France); Chulalongkorn University, Center of Excellence in Particle Technology, Faculty of Engineering, Bangkok (Thailand); Charinpanitkul, Tawatchai; Vanisri, Hathaichanok; Tanthapanichakoon, Wiwut [Chulalongkorn University, Center of Excellence in Particle Technology, Faculty of Engineering, Bangkok (Thailand); Biscos, Yves; Garcia, Nicolas; Lavergne, Gerard [ONERA/DMAE, Toulouse (France); Mees, Loic; Gouesbet, Gerard; Grehan, Gerard [CNRS/Universite et INSA de Rouen, UMR 6614/CORIA, BP12, 76 800, Saint Etienne du Rouvray CEDEX (France)

2007-10-15

The rainbow refractrometry, under its different configurations (classical and global), is an attractive technique to extract information from droplets in evaporation such as diameter and temperature. Recently a new processing strategy has been developed which increases dramatically the size and refractive index measurements accuracy for homogeneous droplets. Nevertheless, for mono component as well as for multicomponent droplets, the presence of temperature and/or of concentration gradients induce the presence of a gradient of refractive index which affects the interpretation of the recorded signals. In this publication, the effect of radial gradient on rainbow measurements with a high accuracy never reached previously is quantified. (orig.)

Domination criticality in product graphs

Directory of Open Access Journals (Sweden)

M.R. Chithra

2015-07-01

Full Text Available A connected dominating set is an important notion and has many applications in routing and management of networks. Graph products have turned out to be a good model of interconnection networks. This motivated us to study the Cartesian product of graphs G with connected domination number, γc(G=2,3 and characterize such graphs. Also, we characterize the k−γ-vertex (edge critical graphs and k−γc-vertex (edge critical graphs for k=2,3 where γ denotes the domination number of G. We also discuss the vertex criticality in grids.

Graph Creation, Visualisation and Transformation

Directory of Open Access Journals (Sweden)

Maribel Fernández

2010-03-01

Full Text Available We describe a tool to create, edit, visualise and compute with interaction nets - a form of graph rewriting systems. The editor, called GraphPaper, allows users to create and edit graphs and their transformation rules using an intuitive user interface. The editor uses the functionalities of the TULIP system, which gives us access to a wealth of visualisation algorithms. Interaction nets are not only a formalism for the specification of graphs, but also a rewrite-based computation model. We discuss graph rewriting strategies and a language to express them in order to perform strategic interaction net rewriting.

Experimental validation of geosmin uptake in rainbow trout, Oncorhynchus mykiss (Waldbaum) suggests biotransformation

NARCIS (Netherlands)

Schram, Edward; Schrama, Johan W.; Kooten, van Tobias; Kwadijk, Christiaan J.A.F.; Kampen, Harm; Kampen, Harm; Heul, van de Jan W.; Verreth, Johan A.J.; Murk, Albertinka J.

2018-01-01

The bioconcentration of waterborne geosmin in rainbow trout, Oncorhynchus mykiss (Waldbaum) was assessed. Fifty rainbow trout with a mean (SD) weight of 226.6 (29.0) g and lipid content of 6.2 (0.6) % (w/w) were exposed to geosmin in static water for 0, 2, 4, 6, 8, 12, 24, 36, 48 and 120 hr, with

Graph Colouring Algorithms

DEFF Research Database (Denmark)

Husfeldt, Thore

2015-01-01

This chapter presents an introduction to graph colouring algorithms. The focus is on vertex-colouring algorithms that work for general classes of graphs with worst-case performance guarantees in a sequential model of computation. The presentation aims to demonstrate the breadth of available...

Experimental infection of rainbow trout Oncorhynchus mykiss with viral haemorrhagic septicaemia virus isolates from European marine and farmed fishes

DEFF Research Database (Denmark)

Skall, Helle Frank; Slierendrecht, W.J.; King, J.A.

2004-01-01

The susceptibility of rainbow trout Oncorhynchus mykiss to infection with various isolates of viral haemorrhagic septicaemia virus (VHSV) was examined. A total of 8 experiments with rainbow trout ranging from 0.6 to 6.2 g was conducted for 139 isolates originating from wild marine fishes in Europ......The susceptibility of rainbow trout Oncorhynchus mykiss to infection with various isolates of viral haemorrhagic septicaemia virus (VHSV) was examined. A total of 8 experiments with rainbow trout ranging from 0.6 to 6.2 g was conducted for 139 isolates originating from wild marine fishes...... in European waters (115 isolates), farmed turbot from Scotland and Ireland (2 isolates), and farmed rainbow trout (22 isolates). The isolates were tested by immersion and/or intraperitoneal injection either as pooled or single isolates. The isolates from wild marine fishes did not cause mortality by immersion...... while some of the isolates caused mortality when injected. All VHSV isolates from farmed rainbow trout caused significant mortality by immersion. Currently, pathogenicity trials are the only way to differentiate VHSV isolates from wild marine fishes and farmed rainbow trout. The 2 farmed turbot isolates...

Erosion of interspecific reproductive barriers resulting from hatchery supplementation of rainbow trout sympatric with cutthroat trout.

Science.gov (United States)

Docker, Margaret F; Dale, Angie; Heath, Daniel D

2003-12-01

The frequency of hybridization between cutthroat (Onchorhynchus clarki clarki) and rainbow (O. mykiss irideus) trout from coastal habitats in British Columbia, Canada, was examined in seven populations where the two species are sympatric with no history of rainbow trout stocking and compared with areas where native rainbow trout populations have been supplemented with hatchery fish (three populations). Four nuclear markers were used to identify each species and interspecific hybrids and one mitochondrial marker showed the direction of gene exchange between species. The frequency of hybrids was significantly higher (Fisher exact test, P < 0.001) in river systems where hatchery rainbow trout have been introduced (50.6% hybrids) than in populations where the two species naturally co-occur without supplementation (9.9% hybrids).

Hybridization dynamics between Colorado's native cutthroat trout and introduced rainbow trout.

Science.gov (United States)

Metcalf, Jessica L; Siegle, Matthew R; Martin, Andrew P

2008-01-01

Newly formed hybrid populations provide an opportunity to examine the initial consequences of secondary contact between species and identify genetic patterns that may be important early in the evolution of hybrid inviability. Widespread introductions of rainbow trout (Oncorhynchus mykiss) into watersheds with native cutthroat trout (Oncorhynchus clarkii) have resulted in hybridization. These introductions have contributed to the decline of native cutthroat trout populations. Here, we examine the pattern of hybridization between introduced rainbow trout and 2 populations of cutthroat trout native to Colorado. For this study, we utilized 7 diagnostic, codominant nuclear markers and a diagnostic mitochondrial marker to investigate hybridization in a population of greenback cutthroat trout (Oncorhynchus clarkii stomias) and a population of Colorado River cutthroat trout (Oncorhynchus clarkii pleuriticus). We infer that cutthroat-rainbow trout hybrid swarms have formed in both populations. Although a mixture of hybrid genotypes was present, not all genotype combinations were detected at expected frequencies. We found evidence that mitochondrial DNA introgression in hybrids is asymmetric and more likely from rainbow trout than from cutthroat trout. A difference in spawning time of the 2 species or differences in the fitness between the reciprocal crosses may explain the asymmetry. Additionally, the presence of intraspecific cytonuclear associations found in both populations is concordant with current hypotheses regarding coevolution of mitochondrial and nuclear genomes.

The fascinating world of graph theory

CERN Document Server

Benjamin, Arthur; Zhang, Ping

2015-01-01

Graph theory goes back several centuries and revolves around the study of graphs-mathematical structures showing relations between objects. With applications in biology, computer science, transportation science, and other areas, graph theory encompasses some of the most beautiful formulas in mathematics-and some of its most famous problems. The Fascinating World of Graph Theory explores the questions and puzzles that have been studied, and often solved, through graph theory. This book looks at graph theory's development and the vibrant individuals responsible for the field's growth. Introducin

Classical dynamics on graphs

International Nuclear Information System (INIS)

Barra, F.; Gaspard, P.

2001-01-01

We consider the classical evolution of a particle on a graph by using a time-continuous Frobenius-Perron operator that generalizes previous propositions. In this way, the relaxation rates as well as the chaotic properties can be defined for the time-continuous classical dynamics on graphs. These properties are given as the zeros of some periodic-orbit zeta functions. We consider in detail the case of infinite periodic graphs where the particle undergoes a diffusion process. The infinite spatial extension is taken into account by Fourier transforms that decompose the observables and probability densities into sectors corresponding to different values of the wave number. The hydrodynamic modes of diffusion are studied by an eigenvalue problem of a Frobenius-Perron operator corresponding to a given sector. The diffusion coefficient is obtained from the hydrodynamic modes of diffusion and has the Green-Kubo form. Moreover, we study finite but large open graphs that converge to the infinite periodic graph when their size goes to infinity. The lifetime of the particle on the open graph is shown to correspond to the lifetime of a system that undergoes a diffusion process before it escapes

Groupies in multitype random graphs

OpenAIRE

Shang, Yilun

2016-01-01

A groupie in a graph is a vertex whose degree is not less than the average degree of its neighbors. Under some mild conditions, we show that the proportion of groupies is very close to 1/2 in multitype random graphs (such as stochastic block models), which include Erd?s-R?nyi random graphs, random bipartite, and multipartite graphs as special examples. Numerical examples are provided to illustrate the theoretical results.

Status of rainbow smelt in the U.S. waters of Lake Ontario, 2013

Science.gov (United States)

Weidel, Brian C.; Connerton, Michael J.

2014-01-01

Rainbow Smelt Osmerus mordax are the second most abundant pelagic prey fish in Lake Ontario after Alewife Alosa psuedoharengus. The 2013, USGS/NYSDEC bottom trawl assessment indicated the abundance of Lake Ontario age-1 and older Rainbow Smelt decreased by 69% relative to 2012. Length frequency-based age analysis indicated that age-1 Rainbow Smelt constituted approximately 50% of the population, which is similar to recent trends where the proportion of age-1 has ranged from 95% to 42% of the population. While they constituted approximately half of the catch, the overall abundance index for age 1 was one of the lowest observed in the time series, potentially a result of cannibalism from the previous year class. Combined data from all bottom trawl assessments along the southern shore and eastern basin indicate the proportion of the fish community that is Rainbow Smelt has declined over the past 30 years. In 2013 the proportion of the pelagic fish catch (only pelagic species) that was Rainbow Smelt was the second lowest in the time series at 3.1%. Community diversity indices, based on bottom trawl catches, indicate that Lake Ontario fish community diversity, as assessed by bottom trawls, has sharply declined over the past 36 years and in 2013 the index was the lowest value in the time series. Much of this community diversity decline is driven by changes in the pelagic fish community and dominance of Alewife.

Interactions between hatch dates, growth rates, and mortality of Age-0 native Rainbow Smelt and nonnative Alewife in Lake Champlain

Science.gov (United States)

Parrish, Donna; Simonin, Paul W.; Rudstam, Lars G.; Pientka, Bernard; Sullivan, Patrick J.

2016-01-01

Timing of hatch in fish populations can be critical for first-year survival and, therefore, year-class strength and subsequent species interactions. We compared hatch timing, growth rates, and subsequent mortality of age-0 Rainbow Smelt Osmerus mordax and Alewife Alosa pseudoharengus, two common open-water fish species of northern North America. In our study site, Lake Champlain, Rainbow Smelt hatched (beginning May 26) almost a month earlier than Alewives (June 20). Abundance in the sampling area was highest in July for age-0 Rainbow Smelt and August for age-0 Alewives. Late-hatching individuals of both species grew faster than those hatching earlier (0.6 mm/d versus 0.4 for Rainbow Smelt; 0.7 mm/d versus 0.6 for Alewives). Mean mortality rate during the first 45 d of life was 3.4%/d for age-0 Rainbow Smelt and was 5.5%/d for age-0 Alewives. Alewife mortality rates did not differ with hatch timing but daily mortality rates of Rainbow Smelt were highest for early-hatching fish. Cannibalism is probably the primary mortality source for age-0 Rainbow Smelt in this lake. Therefore, hatching earlier may not be advantageous because the overlap of adult and age-0 Rainbow Smelt is highest earlier in the season. However, Alewives, first documented in Lake Champlain in 2003, may increase the mortality of age-0 Rainbow Smelt in the summer, which should favor selection for earlier hatching.

Organic diets are equally good for rainbow trout fry as conventional diets

DEFF Research Database (Denmark)

Madsen, Lone; Ingerslev, Hans Christian; Dalsgaard, Inger

2014-01-01

Rainbow trout (Oncorhynchus mykiss) is the dominant fish species in Danish freshwater aquaculture and the annual production is about 30.000 tonnes. Only a minor part of this production is organic, but the proportion of farmed organic rainbow trout is continuously increasing. The aim of the projec...... ingredients are of organic or conventional origin. Furthermore, fish fed organic diets appear to acquire the same health status as fish fed conventional diets....

Quantum information processing with graph states

International Nuclear Information System (INIS)

Schlingemann, Dirk-Michael

2005-04-01

Graph states are multiparticle states which are associated with graphs. Each vertex of the graph corresponds to a single system or particle. The links describe quantum correlations (entanglement) between pairs of connected particles. Graph states were initiated independently by two research groups: On the one hand, graph states were introduced by Briegel and Raussendorf as a resource for a new model of one-way quantum computing, where algorithms are implemented by a sequence of measurements at single particles. On the other hand, graph states were developed by the author of this thesis and ReinhardWerner in Braunschweig, as a tool to build quantum error correcting codes, called graph codes. The connection between the two approaches was fully realized in close cooperation of both research groups. This habilitation thesis provides a survey of the theory of graph codes, focussing mainly, but not exclusively on the author's own research work. We present the theoretical and mathematical background for the analysis of graph codes. The concept of one-way quantum computing for general graph states is discussed. We explicitly show how to realize the encoding and decoding device of a graph code on a one-way quantum computer. This kind of implementation is to be seen as a mathematical description of a quantum memory device. In addition to that, we investigate interaction processes, which enable the creation of graph states on very large systems. Particular graph states can be created, for instance, by an Ising type interaction between next neighbor particles which sits at the points of an infinitely extended cubic lattice. Based on the theory of quantum cellular automata, we give a constructive characterization of general interactions which create a translationally invariant graph state. (orig.)

Studi Pembuatan Rainbow Cake Menggunakan Pati Sagu (Metroxylon SP.) Lokal Riau

OpenAIRE

', Arnizam; Pato, Usman; Johan, Vonny Setiaries

2015-01-01

This study aim was to analyze the differences in the sensory assessment of the rainbow cake with the addition of 30% sago starch and 100% rainbow cake using wheat flour. This study used a Completely Randomized Design (CRD) with two treatments and eight replication thus obtained 16 experimental units. The treatments were TS1 (100% wheat flour, 0% sago starch) and TS2 (70% wheat flour, 30% sago starch). The parameters observed were descriptive test which includes assessing the attributes of ten...

Focusing properties of a square electrostatic rainbow lens

International Nuclear Information System (INIS)

Telečki, I.; Petrović, S.; Beličev, P.; Rađenović, B.; Balvanović, R.; Bojović, B.; Nešković, N.

2012-01-01

This paper is devoted to the focusing properties of a square electrostatic rainbow lens, which is a novel ion beam optical element. We consider the transmission of parallel and non-parallel proton beams of the initial kinetic energy of 10 keV through this lens. The potential of the electrodes of the lens is chosen to be 2 kV. The electrostatic potential and components of the electric field in the region of the lens are calculated using a three-dimensional finite element computer code. We investigate the spatial and angular distributions of protons propagating through the lens and in the drift space after it. It is confirmed that the evolutions of these distributions are determined by the evolutions of the corresponding rainbow lines, generated using the theory of crystal rainbows. The beam is separated into two components. One beam component, appearing as a beam core, is generated dominantly by the focused protons. Its boundary line in the transverse position plane can be very well approximated by a hypotrochoid. The other beam component is generated dominantly by the defocused protons. We present the focusing coefficient of the lens, the confining coefficients of the lens for the focused and defocused protons, the density of the beam core, the vertical or horizontal emittance of the beam core, and the brightness of the beam core.

Fibonacci number of the tadpole graph

Directory of Open Access Journals (Sweden)

Joe DeMaio

2014-10-01

Full Text Available In 1982, Prodinger and Tichy defined the Fibonacci number of a graph G to be the number of independent sets of the graph G. They did so since the Fibonacci number of the path graph Pn is the Fibonacci number F(n+2 and the Fibonacci number of the cycle graph Cn is the Lucas number Ln. The tadpole graph Tn,k is the graph created by concatenating Cn and Pk with an edge from any vertex of Cn to a pendant of Pk for integers n=3 and k=0. This paper establishes formulae and identities for the Fibonacci number of the tadpole graph via algebraic and combinatorial methods.

On characterizing terrain visibility graphs

Directory of Open Access Journals (Sweden)

William Evans

2015-06-01

Full Text Available A terrain is an $x$-monotone polygonal line in the $xy$-plane. Two vertices of a terrain are mutually visible if and only if there is no terrain vertex on or above the open line segment connecting them. A graph whose vertices represent terrain vertices and whose edges represent mutually visible pairs of terrain vertices is called a terrain visibility graph. We would like to find properties that are both necessary and sufficient for a graph to be a terrain visibility graph; that is, we would like to characterize terrain visibility graphs.Abello et al. [Discrete and Computational Geometry, 14(3:331--358, 1995] showed that all terrain visibility graphs are “persistent”. They showed that the visibility information of a terrain point set implies some ordering requirements on the slopes of the lines connecting pairs of points in any realization, and as a step towards showing sufficiency, they proved that for any persistent graph $M$ there is a total order on the slopes of the (pseudo lines in a generalized configuration of points whose visibility graph is $M$.We give a much simpler proof of this result by establishing an orientation to every triple of vertices, reflecting some slope ordering requirements that are consistent with $M$ being the visibility graph, and prove that these requirements form a partial order. We give a faster algorithm to construct a total order on the slopes. Our approach attempts to clarify the implications of the graph theoretic properties on the ordering of the slopes, and may be interpreted as defining properties on an underlying oriented matroid that we show is a restricted type of $3$-signotope.

Network reconstruction via graph blending

Science.gov (United States)

Estrada, Rolando

2016-05-01

Graphs estimated from empirical data are often noisy and incomplete due to the difficulty of faithfully observing all the components (nodes and edges) of the true graph. This problem is particularly acute for large networks where the number of components may far exceed available surveillance capabilities. Errors in the observed graph can render subsequent analyses invalid, so it is vital to develop robust methods that can minimize these observational errors. Errors in the observed graph may include missing and spurious components, as well fused (multiple nodes are merged into one) and split (a single node is misinterpreted as many) nodes. Traditional graph reconstruction methods are only able to identify missing or spurious components (primarily edges, and to a lesser degree nodes), so we developed a novel graph blending framework that allows us to cast the full estimation problem as a simple edge addition/deletion problem. Armed with this framework, we systematically investigate the viability of various topological graph features, such as the degree distribution or the clustering coefficients, and existing graph reconstruction methods for tackling the full estimation problem. Our experimental results suggest that incorporating any topological feature as a source of information actually hinders reconstruction accuracy. We provide a theoretical analysis of this phenomenon and suggest several avenues for improving this estimation problem.

Rainbow Trout Distribution, Pacific Northwest (updated March, 2006)

Data.gov (United States)

Pacific States Marine Fisheries Commission — This dataset is a record of fish distribution and activity for RAINBOW TROUT contained in the StreamNet database. This feature class was created based on linear...

Interaction graphs

DEFF Research Database (Denmark)

Seiller, Thomas

2016-01-01

Interaction graphs were introduced as a general, uniform, construction of dynamic models of linear logic, encompassing all Geometry of Interaction (GoI) constructions introduced so far. This series of work was inspired from Girard's hyperfinite GoI, and develops a quantitative approach that should...... be understood as a dynamic version of weighted relational models. Until now, the interaction graphs framework has been shown to deal with exponentials for the constrained system ELL (Elementary Linear Logic) while keeping its quantitative aspect. Adapting older constructions by Girard, one can clearly define...... "full" exponentials, but at the cost of these quantitative features. We show here that allowing interpretations of proofs to use continuous (yet finite in a measure-theoretic sense) sets of states, as opposed to earlier Interaction Graphs constructions were these sets of states were discrete (and finite...

Groupies in multitype random graphs.

Science.gov (United States)

Shang, Yilun

2016-01-01

A groupie in a graph is a vertex whose degree is not less than the average degree of its neighbors. Under some mild conditions, we show that the proportion of groupies is very close to 1/2 in multitype random graphs (such as stochastic block models), which include Erdős-Rényi random graphs, random bipartite, and multipartite graphs as special examples. Numerical examples are provided to illustrate the theoretical results.

The Harary index of a graph

CERN Document Server

Xu, Kexiang; Trinajstić, Nenad

2015-01-01

This is the first book to focus on the topological index, the Harary index, of a graph, including its mathematical properties, chemical applications and some related and attractive open problems. This book is dedicated to Professor Frank Harary (1921—2005), the grandmaster of graph theory and its applications. It has be written by experts in the field of graph theory and its applications. For a connected graph G, as an important distance-based topological index, the Harary index H(G) is defined as the sum of the reciprocals of the distance between any two unordered vertices of the graph G. In this book, the authors report on the newest results on the Harary index of a graph. These results mainly concern external graphs with respect to the Harary index; the relations to other topological indices; its properties and applications to pure graph theory and chemical graph theory; and two significant variants, i.e., additively and multiplicatively weighted Harary indices. In the last chapter, we present a number o...

A Modal-Logic Based Graph Abstraction

NARCIS (Netherlands)

Bauer, J.; Boneva, I.B.; Kurban, M.E.; Rensink, Arend; Ehrig, H; Heckel, R.; Rozenberg, G.; Taentzer, G.

2008-01-01

Infinite or very large state spaces often prohibit the successful verification of graph transformation systems. Abstract graph transformation is an approach that tackles this problem by abstracting graphs to abstract graphs of bounded size and by lifting application of productions to abstract

Review of potential interactions between stocked rainbow trout and listed Snake River sockeye salmon in Pettit Lake Idaho

Energy Technology Data Exchange (ETDEWEB)

Teuscher, D.

1996-05-01

The objective of this study was to determine if hatchery rainbow trout compete with or prey on juvenile Snake River sockeye salmon Oncorhynchus nerka in Pettit Lake, Idaho. In 1995, a total of 8,570 age-0 sockeye and 4,000 hatchery rainbow trout were released in Pettit Lake. After releasing the fish, gillnets were set in the pelagic and littoral zones to collected diet and spatial distribution data. Interactions were assessed monthly from June 1995 through March 1996. Competition for food was discounted based on extremely low diet overlap results observed throughout the sample period. Conversely, predation interactions were more significant. A total of 119 rainbow trout stomachs were analyzed, two contained O. nerka. The predation was limited to one sample period, but when extrapolated to the whole rainbow trout populations results in significant losses. Total consumption of O. nerka by rainbow trout ranged from an estimated 10 to 23% of initial stocking numbers. Predation results contradict earlier findings that stocked rainbow trout do not prey on wild kokanee or sockeye in the Sawtooth Lakes. The contradiction may be explained by a combination of poorly adapted hatchery sockeye and a littoral release site that forced spatial overlap that was not occurring in the wild populations. Releasing sockeye in the pelagic zone may have reduced or eliminated predation losses to rainbow trout.

Review of potential interactions between stocked rainbow trout and listed Snake River sockeye salmon in Pettit Lake Idaho

International Nuclear Information System (INIS)

Teuscher, D.

1996-01-01

The objective of this study was to determine if hatchery rainbow trout compete with or prey on juvenile Snake River sockeye salmon Oncorhynchus nerka in Pettit Lake, Idaho. In 1995, a total of 8,570 age-0 sockeye and 4,000 hatchery rainbow trout were released in Pettit Lake. After releasing the fish, gillnets were set in the pelagic and littoral zones to collected diet and spatial distribution data. Interactions were assessed monthly from June 1995 through March 1996. Competition for food was discounted based on extremely low diet overlap results observed throughout the sample period. Conversely, predation interactions were more significant. A total of 119 rainbow trout stomachs were analyzed, two contained O. nerka. The predation was limited to one sample period, but when extrapolated to the whole rainbow trout populations results in significant losses. Total consumption of O. nerka by rainbow trout ranged from an estimated 10 to 23% of initial stocking numbers. Predation results contradict earlier findings that stocked rainbow trout do not prey on wild kokanee or sockeye in the Sawtooth Lakes. The contradiction may be explained by a combination of poorly adapted hatchery sockeye and a littoral release site that forced spatial overlap that was not occurring in the wild populations. Releasing sockeye in the pelagic zone may have reduced or eliminated predation losses to rainbow trout

Rainbow trapping in one-dimensional chirped photonic crystals composed of alternating dielectric slabs

International Nuclear Information System (INIS)

Shen, Yun; Fu, Jiwu; Yu, Guoping

2011-01-01

Highlights: → A simple one-dimensional chirped photonic crystal is proposed to realize rainbow trapping. → The results show different wavelengths can be trapped at different spatial positions. → The structure can be used for optical buffer, memories and filter, sorter, etc. -- Abstract: One-dimensional chirped photonic crystals composed of alternating dielectric slabs are proposed to realize rainbow trapping. We theoretically and numerically demonstrate that not only significantly reduced group velocity can be achieved in the proposed chirped structures, but different wavelengths can be localized in different spatial positions, indicating trapped rainbow. Our results imply a feasible way to slow or even trap light in simple systems, which can be used for optical buffer, memory, data processor and filter, sorter, etc.

Graph mining for next generation sequencing: leveraging the assembly graph for biological insights.

Science.gov (United States)

Warnke-Sommer, Julia; Ali, Hesham

2016-05-06

The assembly of Next Generation Sequencing (NGS) reads remains a challenging task. This is especially true for the assembly of metagenomics data that originate from environmental samples potentially containing hundreds to thousands of unique species. The principle objective of current assembly tools is to assemble NGS reads into contiguous stretches of sequence called contigs while maximizing for both accuracy and contig length. The end goal of this process is to produce longer contigs with the major focus being on assembly only. Sequence read assembly is an aggregative process, during which read overlap relationship information is lost as reads are merged into longer sequences or contigs. The assembly graph is information rich and capable of capturing the genomic architecture of an input read data set. We have developed a novel hybrid graph in which nodes represent sequence regions at different levels of granularity. This model, utilized in the assembly and analysis pipeline Focus, presents a concise yet feature rich view of a given input data set, allowing for the extraction of biologically relevant graph structures for graph mining purposes. Focus was used to create hybrid graphs to model metagenomics data sets obtained from the gut microbiomes of five individuals with Crohn's disease and eight healthy individuals. Repetitive and mobile genetic elements are found to be associated with hybrid graph structure. Using graph mining techniques, a comparative study of the Crohn's disease and healthy data sets was conducted with focus on antibiotics resistance genes associated with transposase genes. Results demonstrated significant differences in the phylogenetic distribution of categories of antibiotics resistance genes in the healthy and diseased patients. Focus was also evaluated as a pure assembly tool and produced excellent results when compared against the Meta-velvet, Omega, and UD-IDBA assemblers. Mining the hybrid graph can reveal biological phenomena captured

Staphylococcus warneri, a resident skin commensal of rainbow trout (Oncorhynchus mykiss) with pathobiont characteristics.

Science.gov (United States)

Musharrafieh, Rami; Tacchi, Luca; Trujeque, Joshua; LaPatra, Scott; Salinas, Irene

2014-02-21

Commensal microorganisms live in association with the mucosal surfaces of all vertebrates. The skin of teleost fish is known to harbor commensals. In this study we report for the first time the presence of an intracellular Gram positive bacteria, Staphylococcus warneri that resides in the skin epidermis of rainbow trout (Oncorhynchus mykiss). S. warneri was isolated from healthy hatchery trout skin epithelial cells. In situ hybridization confirmed the intracellular nature of the bacterium. Skin explants exposed in vitro to S. warneri or the extracellular pathogen Vibrio anguillarum show that S. warneri is able to induce an anti-inflammatory cytokine status via TGF-β1b compared to the pro-inflammatory responses (IL-1β, IL-6 and TNF-∝) elicited by V. anguillarum. In vivo experiments showed that S. warneri is not pathogenic to rainbow trout when injected intraperitoneally at high concentrations. However, S. warneri is able to stimulate V. anguillarum growth and biofilm formation on rainbow trout scales. Our results demonstrate that rainbow trout skin commensals such as S. warneri have the potential to become indirect pathobionts by enhancing growth and biofilm formation of pathogens such as V. anguillarum. These results show that fish farming practices (i.e. handling and other manipulations) can alter the skin microbiota and compromise the skin health of rainbow trout. Copyright © 2013 Elsevier B.V. All rights reserved.

Testing experimental subunit furunculosis vaccines for rainbow trout

DEFF Research Database (Denmark)

Marana, Moonika H.; Chettri, Jiwan Kumar; Skov, Jakob

2016-01-01

Aeromonas salmonicida subsp. salmonicida (AS) is the etiological agent of typical furunculosis in salmonid fish. The disease causes bacterial septicemia and is a major fish health problem in salmonid aquaculture worldwide, inducing high morbidity and mortality. In this study we vaccinated rainbow...... trout with subunit vaccines containing protein antigens that were selected based on an in silico antigen discovery approach. Thus, the proteome of AS strain A449 was analyzed by an antigen discovery platform and its proteins consequently ranked by their predicted ability to evoke protective immune...... response against AS. Fourteen proteins were prepared in 3 different experimental subunit vaccine combinations and used to vaccinate rainbow trout by intraperitoneal (i.p.) injection. We tested the proteins for their ability to elicit antibody production and protection. Thus, fish were exposed to virulent...

Distance-transitive graphs

NARCIS (Netherlands)

Cohen, A.M.; Beineke, L.W.; Wilson, R.J.; Cameron, P.J.

2004-01-01

In this chapter we investigate the classification of distance-transitive graphs: these are graphs whose automorphism groups are transitive on each of the sets of pairs of vertices at distance i, for i = 0, 1,.... We provide an introduction into the field. By use of the classification of finite

TrajGraph: A Graph-Based Visual Analytics Approach to Studying Urban Network Centralities Using Taxi Trajectory Data.

Science.gov (United States)

Huang, Xiaoke; Zhao, Ye; Yang, Jing; Zhang, Chong; Ma, Chao; Ye, Xinyue

2016-01-01

We propose TrajGraph, a new visual analytics method, for studying urban mobility patterns by integrating graph modeling and visual analysis with taxi trajectory data. A special graph is created to store and manifest real traffic information recorded by taxi trajectories over city streets. It conveys urban transportation dynamics which can be discovered by applying graph analysis algorithms. To support interactive, multiscale visual analytics, a graph partitioning algorithm is applied to create region-level graphs which have smaller size than the original street-level graph. Graph centralities, including Pagerank and betweenness, are computed to characterize the time-varying importance of different urban regions. The centralities are visualized by three coordinated views including a node-link graph view, a map view and a temporal information view. Users can interactively examine the importance of streets to discover and assess city traffic patterns. We have implemented a fully working prototype of this approach and evaluated it using massive taxi trajectories of Shenzhen, China. TrajGraph's capability in revealing the importance of city streets was evaluated by comparing the calculated centralities with the subjective evaluations from a group of drivers in Shenzhen. Feedback from a domain expert was collected. The effectiveness of the visual interface was evaluated through a formal user study. We also present several examples and a case study to demonstrate the usefulness of TrajGraph in urban transportation analysis.

Temporal Representation in Semantic Graphs

Energy Technology Data Exchange (ETDEWEB)

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.

The complexity of the matching-cut problem for planar graphs and other graph classes

NARCIS (Netherlands)

Bonsma, P.S.

2009-01-01

The Matching-Cut problem is the problem to decide whether a graph has an edge cut that is also a matching. Previously this problem was studied under the name of the Decomposable Graph Recognition problem, and proved to be -complete when restricted to graphs with maximum degree four. In this paper it

PRIVATE GRAPHS – ACCESS RIGHTS ON GRAPHS FOR SEAMLESS NAVIGATION

Directory of Open Access Journals (Sweden)

W. Dorner

2016-06-01

Full Text Available After the success of GNSS (Global Navigational Satellite Systems and navigation services for public streets, indoor seems to be the next big development in navigational services, relying on RTLS – Real Time Locating Services (e.g. WIFI and allowing seamless navigation. In contrast to navigation and routing services on public streets, seamless navigation will cause an additional challenge: how to make routing data accessible to defined users or restrict access rights for defined areas or only to parts of the graph to a defined user group? The paper will present case studies and data from literature, where seamless and especially indoor navigation solutions are presented (hospitals, industrial complexes, building sites, but the problem of restricted access rights was only touched from a real world, but not a technical perspective. The analysis of case studies will show, that the objective of navigation and the different target groups for navigation solutions will demand well defined access rights and require solutions, how to make only parts of a graph to a user or application available to solve a navigational task. The paper will therefore introduce the concept of private graphs, which is defined as a graph for navigational purposes covering the street, road or floor network of an area behind a public street and suggest different approaches how to make graph data for navigational purposes available considering access rights and data protection, privacy and security issues as well.

Port-Hamiltonian Systems on Open Graphs

NARCIS (Netherlands)

Schaft, A.J. van der; Maschke, B.M.

2010-01-01

In this talk we discuss how to define in an intrinsic manner port-Hamiltonian dynamics on open graphs. Open graphs are graphs where some of the vertices are boundary vertices (terminals), which allow interconnection with other systems. We show that a directed graph carries two natural Dirac

Towards a theory of geometric graphs

CERN Document Server

Pach, Janos

2004-01-01

The early development of graph theory was heavily motivated and influenced by topological and geometric themes, such as the Konigsberg Bridge Problem, Euler's Polyhedral Formula, or Kuratowski's characterization of planar graphs. In 1936, when Denes Konig published his classical Theory of Finite and Infinite Graphs, the first book ever written on the subject, he stressed this connection by adding the subtitle Combinatorial Topology of Systems of Segments. He wanted to emphasize that the subject of his investigations was very concrete: planar figures consisting of points connected by straight-line segments. However, in the second half of the twentieth century, graph theoretical research took an interesting turn. In the most popular and most rapidly growing areas (the theory of random graphs, Ramsey theory, extremal graph theory, algebraic graph theory, etc.), graphs were considered as abstract binary relations rather than geometric objects. Many of the powerful techniques developed in these fields have been su...

Quantum walk on a chimera graph

Science.gov (United States)

Xu, Shu; Sun, Xiangxiang; Wu, Jizhou; Zhang, Wei-Wei; Arshed, Nigum; Sanders, Barry C.

2018-05-01

We analyse a continuous-time quantum walk on a chimera graph, which is a graph of choice for designing quantum annealers, and we discover beautiful quantum walk features such as localization that starkly distinguishes classical from quantum behaviour. Motivated by technological thrusts, we study continuous-time quantum walk on enhanced variants of the chimera graph and on diminished chimera graph with a random removal of vertices. We explain the quantum walk by constructing a generating set for a suitable subgroup of graph isomorphisms and corresponding symmetry operators that commute with the quantum walk Hamiltonian; the Hamiltonian and these symmetry operators provide a complete set of labels for the spectrum and the stationary states. Our quantum walk characterization of the chimera graph and its variants yields valuable insights into graphs used for designing quantum-annealers.

Software for Graph Analysis and Visualization

Directory of Open Access Journals (Sweden)

M. I. Kolomeychenko

2014-01-01

Full Text Available This paper describes the software for graph storage, analysis and visualization. The article presents a comparative analysis of existing software for analysis and visualization of graphs, describes the overall architecture of application and basic principles of construction and operation of the main modules. Furthermore, a description of the developed graph storage oriented to storage and processing of large-scale graphs is presented. The developed algorithm for finding communities and implemented algorithms of autolayouts of graphs are the main functionality of the product. The main advantage of the developed software is high speed processing of large size networks (up to millions of nodes and links. Moreover, the proposed graph storage architecture is unique and has no analogues. The developed approaches and algorithms are optimized for operating with big graphs and have high productivity.

What Would a Graph Look Like in this Layout? A Machine Learning Approach to Large Graph Visualization.

Science.gov (United States)

Kwon, Oh-Hyun; Crnovrsanin, Tarik; Ma, Kwan-Liu

2018-01-01

Using different methods for laying out a graph can lead to very different visual appearances, with which the viewer perceives different information. Selecting a "good" layout method is thus important for visualizing a graph. The selection can be highly subjective and dependent on the given task. A common approach to selecting a good layout is to use aesthetic criteria and visual inspection. However, fully calculating various layouts and their associated aesthetic metrics is computationally expensive. In this paper, we present a machine learning approach to large graph visualization based on computing the topological similarity of graphs using graph kernels. For a given graph, our approach can show what the graph would look like in different layouts and estimate their corresponding aesthetic metrics. An important contribution of our work is the development of a new framework to design graph kernels. Our experimental study shows that our estimation calculation is considerably faster than computing the actual layouts and their aesthetic metrics. Also, our graph kernels outperform the state-of-the-art ones in both time and accuracy. In addition, we conducted a user study to demonstrate that the topological similarity computed with our graph kernel matches perceptual similarity assessed by human users.

Text-Filled Stacked Area Graphs

DEFF Research Database (Denmark)

Kraus, Martin

2011-01-01

-filled stacked area graphs; i.e., graphs that feature stacked areas that are filled with small-typed text. Since these graphs allow for computing the text layout automatically, it is possible to include large amounts of textual detail with very little effort. We discuss the most important challenges and some...... solutions for the design of text-filled stacked area graphs with the help of an exemplary visualization of the genres, publication years, and titles of a database of several thousand PC games....

On Graph Rewriting, Reduction and Evaluation

DEFF Research Database (Denmark)

Zerny, Ian

2010-01-01

We inter-derive two prototypical styles of graph reduction: reduction machines à la Turner and graph rewriting systems à la Barendregt et al. To this end, we adapt Danvy et al.'s mechanical program derivations from the world of terms to the world of graphs. We also outline how to inter-derive a t......We inter-derive two prototypical styles of graph reduction: reduction machines à la Turner and graph rewriting systems à la Barendregt et al. To this end, we adapt Danvy et al.'s mechanical program derivations from the world of terms to the world of graphs. We also outline how to inter...

Molecular characterization of rainbow trout, Oncorhynchus mykiss ...

Indian Academy of Sciences (India)

Molecular Genetics Laboratory, Directorate of Coldwater Fisheries Research, Bhimtal 263 ... Mir J. I., Ali S., Patiyal R. S. and Singh A. K. 2015 Molecular characterization of rainbow trout, ..... 5 × 106 MCMC repeats for final sampling of data. .... enhancing aquaculture productivity in the coldwater regions. ... simulation study.

Graph transformation tool contest 2008

NARCIS (Netherlands)

Rensink, Arend; van Gorp, Pieter

This special section is the outcome of the graph transformation tool contest organised during the Graph-Based Tools (GraBaTs) 2008 workshop, which took place as a satellite event of the International Conference on Graph Transformation (ICGT) 2008. The contest involved two parts: three “off-line case

Graphs with branchwidth at most three

NARCIS (Netherlands)

Bodlaender, H.L.; Thilikos, D.M.

1997-01-01

In this paper we investigate both the structure of graphs with branchwidth at most three, as well as algorithms to recognise such graphs. We show that a graph has branchwidth at most three, if and only if it has treewidth at most three and does not contain the three-dimensional binary cube graph

Graph Quasicontinuous Functions and Densely Continuous Forms

Directory of Open Access Journals (Sweden)

Lubica Hola

2017-07-01

Full Text Available Let $X, Y$ be topological spaces. A function $f: X \\to Y$ is said to be graph quasicontinuous if there is a quasicontinuous function $g: X \\to Y$ with the graph of $g$ contained in the closure of the graph of $f$. There is a close relation between the notions of graph quasicontinuous functions and minimal usco maps as well as the notions of graph quasicontinuous functions and densely continuous forms. Every function with values in a compact Hausdorff space is graph quasicontinuous; more generally every locally compact function is graph quasicontinuous.

Flavobacterium psychrophilum, invasion into and shedding by rainbow trout Oncorhynchus mykiss

DEFF Research Database (Denmark)

Madetoja, J.; Nyman, P.; Wiklund, T.

2000-01-01

The infection route of Flavobacterium psychrophilum into rainbow trout Oncorhynchus mykiss was studied using bath and cohabitation challenges as well as oral challenge with live feed as a vector. Additionally, the number of bacterial cells shed by infected fish into the surrounding water...... is discussed as an important invasion route for F. psychrophilum into the fish. The shedding rate of F. psychrophiIlun by infected fish was associated with water temperature and the mortality of the infected fish. High numbers of F. psychrophilum cells were released into the water by dead rainbow trout during...

Hermetia illucens meal as fish meal replacement for rainbow trout on farm

OpenAIRE

Stadtlander, Timo; Stamer, Andreas; Buser, Andrea; Wohlfahrt, Jens; Leiber, Florian; Sandrock, Christoph

2017-01-01

In a 7-week on-farm feeding trial rainbow trout (Oncorhynchus mykiss) were provided with a diet containing 28% mechanically de-fatted insect meal prepared from larvae of the black soldier fly, Hermetia illucens (HIM) and compared to a control that received a certified organic and fishmeal based diet. In the test diet insect meal replaced almost 50% of the fishmeal. The whole experiment was conducted under practical conditions on an organically certified rainbow trout farm in Switzerland. Fish...

CORECLUSTER: A Degeneracy Based Graph Clustering Framework

OpenAIRE

Giatsidis , Christos; Malliaros , Fragkiskos; Thilikos , Dimitrios M. ,; Vazirgiannis , Michalis

2014-01-01

International audience; Graph clustering or community detection constitutes an important task forinvestigating the internal structure of graphs, with a plethora of applications in several domains. Traditional tools for graph clustering, such asspectral methods, typically suffer from high time and space complexity. In thisarticle, we present \\textsc{CoreCluster}, an efficient graph clusteringframework based on the concept of graph degeneracy, that can be used along withany known graph clusteri...

On a conjecture concerning helly circle graphs

Directory of Open Access Journals (Sweden)

Durán Guillermo

2003-01-01

Full Text Available We say that G is an e-circle graph if there is a bijection between its vertices and straight lines on the cartesian plane such that two vertices are adjacent in G if and only if the corresponding lines intersect inside the circle of radius one. This definition suggests a method for deciding whether a given graph G is an e-circle graph, by constructing a convenient system S of equations and inequations which represents the structure of G, in such a way that G is an e-circle graph if and only if S has a solution. In fact, e-circle graphs are exactly the circle graphs (intersection graphs of chords in a circle, and thus this method provides an analytic way for recognizing circle graphs. A graph G is a Helly circle graph if G is a circle graph and there exists a model of G by chords such that every three pairwise intersecting chords intersect at the same point. A conjecture by Durán (2000 states that G is a Helly circle graph if and only if G is a circle graph and contains no induced diamonds (a diamond is a graph formed by four vertices and five edges. Many unsuccessful efforts - mainly based on combinatorial and geometrical approaches - have been done in order to validate this conjecture. In this work, we utilize the ideas behind the definition of e-circle graphs and restate this conjecture in terms of an equivalence between two systems of equations and inequations, providing a new, analytic tool to deal with it.

Hyperspectral imaging using a color camera and its application for pathogen detection

Science.gov (United States)

Yoon, Seung-Chul; Shin, Tae-Sung; Heitschmidt, Gerald W.; Lawrence, Kurt C.; Park, Bosoon; Gamble, Gary

2015-02-01

This paper reports the results of a feasibility study for the development of a hyperspectral image recovery (reconstruction) technique using a RGB color camera and regression analysis in order to detect and classify colonies of foodborne pathogens. The target bacterial pathogens were the six representative non-O157 Shiga-toxin producing Escherichia coli (STEC) serogroups (O26, O45, O103, O111, O121, and O145) grown in Petri dishes of Rainbow agar. The purpose of the feasibility study was to evaluate whether a DSLR camera (Nikon D700) could be used to predict hyperspectral images in the wavelength range from 400 to 1,000 nm and even to predict the types of pathogens using a hyperspectral STEC classification algorithm that was previously developed. Unlike many other studies using color charts with known and noise-free spectra for training reconstruction models, this work used hyperspectral and color images, separately measured by a hyperspectral imaging spectrometer and the DSLR color camera. The color images were calibrated (i.e. normalized) to relative reflectance, subsampled and spatially registered to match with counterpart pixels in hyperspectral images that were also calibrated to relative reflectance. Polynomial multivariate least-squares regression (PMLR) was previously developed with simulated color images. In this study, partial least squares regression (PLSR) was also evaluated as a spectral recovery technique to minimize multicollinearity and overfitting. The two spectral recovery models (PMLR and PLSR) and their parameters were evaluated by cross-validation. The QR decomposition was used to find a numerically more stable solution of the regression equation. The preliminary results showed that PLSR was more effective especially with higher order polynomial regressions than PMLR. The best classification accuracy measured with an independent test set was about 90%. The results suggest the potential of cost-effective color imaging using hyperspectral image

Optimization Problems on Threshold Graphs

Directory of Open Access Journals (Sweden)

Elena Nechita

2010-06-01

Full Text Available During the last three decades, different types of decompositions have been processed in the field of graph theory. Among these we mention: decompositions based on the additivity of some characteristics of the graph, decompositions where the adjacency law between the subsets of the partition is known, decompositions where the subgraph induced by every subset of the partition must have predeterminate properties, as well as combinations of such decompositions. In this paper we characterize threshold graphs using the weakly decomposition, determine: density and stability number, Wiener index and Wiener polynomial for threshold graphs.

Molecular characterization of rainbow trout, Oncorhynchus mykiss

Indian Academy of Sciences (India)

Home; Journals; Journal of Genetics; Volume 94; Online resources. Molecular characterization of rainbow trout, Oncorhynchus mykiss (Walbaum, 1792) stocks in India. Ashoktaru Barat Prabhati K. Sahoo Rohit Kumar Javaid I. Mir Shahnawaz Ali Rabindar S. Patiyal Atul K. Singh. Volume 94 Online resources 2015 pp e13- ...

Hierarchy of modular graph identities

Energy Technology Data Exchange (ETDEWEB)

D’Hoker, Eric; Kaidi, Justin [Mani L. Bhaumik Institute for Theoretical Physics, Department of Physics and Astronomy,University of California,Los Angeles, CA 90095 (United States)

2016-11-09

The low energy expansion of Type II superstring amplitudes at genus one is organized in terms of modular graph functions associated with Feynman graphs of a conformal scalar field on the torus. In earlier work, surprising identities between two-loop graphs at all weights, and between higher-loop graphs of weights four and five were constructed. In the present paper, these results are generalized in two complementary directions. First, all identities at weight six and all dihedral identities at weight seven are obtained and proven. Whenever the Laurent polynomial at the cusp is available, the form of these identities confirms the pattern by which the vanishing of the Laurent polynomial governs the full modular identity. Second, the family of modular graph functions is extended to include all graphs with derivative couplings and worldsheet fermions. These extended families of modular graph functions are shown to obey a hierarchy of inhomogeneous Laplace eigenvalue equations. The eigenvalues are calculated analytically for the simplest infinite sub-families and obtained by Maple for successively more complicated sub-families. The spectrum is shown to consist solely of eigenvalues s(s−1) for positive integers s bounded by the weight, with multiplicities which exhibit rich representation-theoretic patterns.

Hierarchy of modular graph identities

International Nuclear Information System (INIS)

D’Hoker, Eric; Kaidi, Justin

2016-01-01

The low energy expansion of Type II superstring amplitudes at genus one is organized in terms of modular graph functions associated with Feynman graphs of a conformal scalar field on the torus. In earlier work, surprising identities between two-loop graphs at all weights, and between higher-loop graphs of weights four and five were constructed. In the present paper, these results are generalized in two complementary directions. First, all identities at weight six and all dihedral identities at weight seven are obtained and proven. Whenever the Laurent polynomial at the cusp is available, the form of these identities confirms the pattern by which the vanishing of the Laurent polynomial governs the full modular identity. Second, the family of modular graph functions is extended to include all graphs with derivative couplings and worldsheet fermions. These extended families of modular graph functions are shown to obey a hierarchy of inhomogeneous Laplace eigenvalue equations. The eigenvalues are calculated analytically for the simplest infinite sub-families and obtained by Maple for successively more complicated sub-families. The spectrum is shown to consist solely of eigenvalues s(s−1) for positive integers s bounded by the weight, with multiplicities which exhibit rich representation-theoretic patterns.

Well-covered graphs and factors

DEFF Research Database (Denmark)

Randerath, Bert; Vestergaard, Preben D.

2006-01-01

A maximum independent set of vertices in a graph is a set of pairwise nonadjacent vertices of largest cardinality α. Plummer defined a graph to be well-covered, if every independent set is contained in a maximum independent set of G. Every well-covered graph G without isolated vertices has a perf...

On the centrality of some graphs

Directory of Open Access Journals (Sweden)

Vecdi Aytac

2017-10-01

Full Text Available A central issue in the analysis of complex networks is the assessment of their stability and vulnerability. A variety of measures have been proposed in the literature to quantify the stability of networks and a number of graph-theoretic parameters have been used to derive formulas for calculating network reliability. Different measures for graph vulnerability have been introduced so far to study different aspects of the graph behavior after removal of vertices or links such as connectivity, toughness, scattering number, binding number, residual closeness and integrity. In this paper, we consider betweenness centrality of a graph. Betweenness centrality of a vertex of a graph is portion of the shortest paths all pairs of vertices passing through a given vertex. In this paper, we obtain exact values for betweenness centrality for some wheel related graphs namely gear, helm, sunflower and friendship graphs.

Fate of Tetracapsuloides bryosalmonae (Myxozoa) after infection of brown trout Salmo trutta and rainbow trout Oncorhynchus mykiss.

Science.gov (United States)

Kumar, Gokhlesh; Abd-Elfattah, Ahmed; Saleh, Mona; El-Matbouli, Mansour

2013-11-25

Tetracapsuloides bryosalmonae (Myxozoa) is the causative agent of proliferative kidney disease in salmonids. We assessed differences in intensity of T. bryosalmonae infection between brown trout Salmo trutta and rainbow trout Oncorhynchus mykiss from the clinical phase of infection onwards. Specific pathogen-free fish were exposed to T. bryosalmonae spores under controlled laboratory conditions and sampled at 6, 8, 10, 12, 14, and 17 wk post exposure (wpe), and the transmission of T. bryosalmonae from infected fish to the bryozoan Fredericella sultana was observed. Parasite load was determined in fish kidneys by quantitative real-time PCR (qRT-PCR), and parasite stages were detected in kidney, liver, and spleen tissues at different time points by immunohistochemistry. T. bryosalmonae was successfully transmitted from infected brown trout to F. sultana colonies but not from infected rainbow trout. Body length and weight of infected brown trout did not differ significantly from control brown trout during all time points, while length and weight of infected rainbow trout differed significantly compared to controls from 10 to 17 wpe. qRT-PCR revealed that parasite load was significantly higher in kidneys of brown trout compared with rainbow trout. Immunohistochemistry showed high numbers of intra-luminal stages (sporogonic stages) in kidneys of brown trout with low numbers of pre-sporogonic stages. Sporogonic stages were not seen in kidneys of rainbow trout; only high numbers of pre-sporogonic stages were detected. Numbers of pre-sporogonic stages were low in the spleen and liver of brown trout but high in rainbow trout. These data confirmed that there are differences in the development and infection progress of T. bryosalmonae between brown trout and rainbow trout.

Fate of Tetracapsuloides bryosalmonae (Myxozoa) after infection of brown trout Salmo trutta and rainbow trout Oncorhynchus mykiss

Science.gov (United States)

Kumar, Gokhlesh; Abd-Elfattah, Ahmed; Saleh, Mona; El-Matbouli, Mansour

2014-01-01

Tetracapsuloides bryosalmonae (Myxozoa) is the causative agent of proliferative kidney disease in salmonids. We assessed differences in intensity of T. bryosalmonae infection between brown trout Salmo trutta and rainbow trout Oncorhynchus mykiss from the clinical phase of infection onwards. Specific pathogen-free fish were exposed to T. bryosalmonae spores under controlled laboratory conditions and sampled at 6, 8, 10, 12, 14, and 17 wk post exposure (wpe), and the transmission of T. bryosalmonae from infected fish to the bryozoan Fredericella sultana was observed. Parasite load was determined in fish kidneys by quantitative real-time PCR (qRT-PCR), and parasite stages were detected in kidney, liver, and spleen tissues at different time points by immunohistochemistry. T. bryosalmonae was successfully transmitted from infected brown trout to F. sultana colonies but not from infected rainbow trout. Body length and weight of infected brown trout did not differ significantly from control brown trout during all time points, while length and weight of infected rainbow trout differed significantly compared to controls from 10 to 17 wpe. qRT-PCR revealed that parasite load was significantly higher in kidneys of brown trout compared with rainbow trout. Immunohistochemistry showed high numbers of intra-luminal stages (sporogonic stages) in kidneys of brown trout with low numbers of pre-sporogonic stages. Sporogonic stages were not seen in kidneys of rainbow trout; only high numbers of pre-sporogonic stages were detected. Numbers of pre-sporogonic stages were low in the spleen and liver of brown trout but high in rainbow trout. These data confirmed that there are differences in the development and infection progress of T. bryosalmonae between brown trout and rainbow trout. PMID:24270019

Enabling Graph Appliance for Genome Assembly

Energy Technology Data Exchange (ETDEWEB)

Singh, Rina [ORNL; Graves, Jeffrey A [ORNL; Lee, Sangkeun (Matt) [ORNL; Sukumar, Sreenivas R [ORNL; Shankar, Mallikarjun [ORNL

2015-01-01

In recent years, there has been a huge growth in the amount of genomic data available as reads generated from various genome sequencers. The number of reads generated can be huge, ranging from hundreds to billions of nucleotide, each varying in size. Assembling such large amounts of data is one of the challenging computational problems for both biomedical and data scientists. Most of the genome assemblers developed have used de Bruijn graph techniques. A de Bruijn graph represents a collection of read sequences by billions of vertices and edges, which require large amounts of memory and computational power to store and process. This is the major drawback to de Bruijn graph assembly. Massively parallel, multi-threaded, shared memory systems can be leveraged to overcome some of these issues. The objective of our research is to investigate the feasibility and scalability issues of de Bruijn graph assembly on Cray s Urika-GD system; Urika-GD is a high performance graph appliance with a large shared memory and massively multithreaded custom processor designed for executing SPARQL queries over large-scale RDF data sets. However, to the best of our knowledge, there is no research on representing a de Bruijn graph as an RDF graph or finding Eulerian paths in RDF graphs using SPARQL for potential genome discovery. In this paper, we address the issues involved in representing a de Bruin graphs as RDF graphs and propose an iterative querying approach for finding Eulerian paths in large RDF graphs. We evaluate the performance of our implementation on real world ebola genome datasets and illustrate how genome assembly can be accomplished with Urika-GD using iterative SPARQL queries.

Local adjacency metric dimension of sun graph and stacked book graph

Science.gov (United States)

Yulisda Badri, Alifiah; Darmaji

2018-03-01

A graph is a mathematical system consisting of a non-empty set of nodes and a set of empty sides. One of the topics to be studied in graph theory is the metric dimension. Application in the metric dimension is the navigation robot system on a path. Robot moves from one vertex to another vertex in the field by minimizing the errors that occur in translating the instructions (code) obtained from the vertices of that location. To move the robot must give different instructions (code). In order for the robot to move efficiently, the robot must be fast to translate the code of the nodes of the location it passes. so that the location vertex has a minimum distance. However, if the robot must move with the vertex location on a very large field, so the robot can not detect because the distance is too far.[6] In this case, the robot can determine its position by utilizing location vertices based on adjacency. The problem is to find the minimum cardinality of the required location vertex, and where to put, so that the robot can determine its location. The solution to this problem is the dimension of adjacency metric and adjacency metric bases. Rodrguez-Velzquez and Fernau combine the adjacency metric dimensions with local metric dimensions, thus becoming the local adjacency metric dimension. In the local adjacency metric dimension each vertex in the graph may have the same adjacency representation as the terms of the vertices. To obtain the local metric dimension of values in the graph of the Sun and the stacked book graph is used the construction method by considering the representation of each adjacent vertex of the graph.

Mechatronic modeling and simulation using bond graphs

CERN Document Server

Das, Shuvra

2009-01-01

Introduction to Mechatronics and System ModelingWhat Is Mechatronics?What Is a System and Why Model Systems?Mathematical Modeling Techniques Used in PracticeSoftwareBond Graphs: What Are They?Engineering SystemsPortsGeneralized VariablesBond GraphsBasic Components in SystemsA Brief Note about Bond Graph Power DirectionsSummary of Bond Direction RulesDrawing Bond Graphs for Simple Systems: Electrical and MechanicalSimplification Rules for Junction StructureDrawing Bond Graphs for Electrical SystemsDrawing Bond Graphs for Mechanical SystemsCausalityDrawing Bond Graphs for Hydraulic and Electronic Components and SystemsSome Basic Properties and Concepts for FluidsBond Graph Model of Hydraulic SystemsElectronic SystemsDeriving System Equations from Bond GraphsSystem VariablesDeriving System EquationsTackling Differential CausalityAlgebraic LoopsSolution of Model Equations and Their InterpretationZeroth Order SystemsFirst Order SystemsSecond Order SystemTransfer Functions and Frequency ResponsesNumerical Solution ...

Local Seismicity of the Rainbow Massif on the Mid-Atlantic Ridge

Science.gov (United States)

Horning, G.; Sohn, R. A.; Canales, J. P.; Dunn, R. A.

2018-02-01

The Rainbow massif, an oceanic core complex located in a nontransform discontinuity on the Mid-Atlantic Ridge (36°N), is notable for hosting high-temperature hydrothermal discharge through ultramafic rocks. Here we report results from a 9 month microearthquake survey conducted with a network of 13 ocean bottom seismometers deployed on and around the Rainbow massif as part of the MARINER experiment in 2013-2014. High rates ( 300 per day) of low-magnitude (average ML 0.5) microearthquakes were detected beneath the massif. The hypocenters do not cluster along deeply penetrating fault surfaces and do not exhibit mainshock/aftershock sequences, supporting the hypothesis that the faulting associated with the exhumation of the massif is currently inactive. Instead, the hypocenters demarcate a diffuse zone of continuous, low-magnitude deformation at relatively shallow (serpentinized ultramafic host rock, and although the seismic network we deployed was not capable of constraining the focal mechanism of most events, our analysis suggests that serpentinization may play an important role in microearthquake generation at the Rainbow massif.

Expert interpretation of bar and line graphs: The role of graphicacy in reducing the effect of graph format.

Directory of Open Access Journals (Sweden)

David ePeebles

2015-10-01

Full Text Available The distinction between informational and computational equivalence of representations, first articulated by Larkin and Simon (1987 has been a fundamental principle in the analysis of diagrammatic reasoning which has been supported empirically on numerous occasions. We present an experiment that investigates this principle in relation to the performance of expert graph users of 2 x 2 'interaction' bar and line graphs. The study sought to determine whether expert interpretation is affected by graph format in the same way that novice interpretations are. The findings revealed that, unlike novices - and contrary to the assumptions of several graph comprehension models - experts' performance was the same for both graph formats, with their interpretation of bar graphs being no worse than that for line graphs. We discuss the implications of the study for guidelines for presenting such data and for models of expert graph comprehension.

Proving termination of graph transformation systems using weighted type graphs over semirings

NARCIS (Netherlands)

Bruggink, H.J.S.; König, B.; Nolte, D.; Zantema, H.; Parisi-Presicce, F.; Westfechtel, B.

2015-01-01

We introduce techniques for proving uniform termination of graph transformation systems, based on matrix interpretations for string rewriting. We generalize this technique by adapting it to graph rewriting instead of string rewriting and by generalizing to ordered semirings. In this way we obtain a

First observations of nuclear rainbow scattering in the 16O+27Al system

International Nuclear Information System (INIS)

Pereira, D.; Oliveira, J.R.B.; Chamon, L.C.; Cunsolo, A.; Cappuzzello, F.; Cavallaro, M.; Carbone, D.

2011-01-01

Nuclear rainbow structures have been unexpectedly predicted in the elastic channel of heavy nuclear systems like 16 O + 27 Al or 58 Ni by a new generation of coupled channel calculations, with inclusion of an imaginary potential for dissipative processes. Rainbow scattering phenomena are very sensitive to the nuclear potential in the surface interior and therefore very important to test different microscopic ion-ion potentials, as mentioned in, as well as the role of reaction couplings in the elastic channel far from the barrier region. The rainbow pattern has been experimentally well established for lighter systems like alpha-nucleus, 12 C + 12 C, 16 O + 12 C, and 16 O + 16 O - the heaviest heavy-ion system so far that has shown a prominent rainbow structure. By using the large acceptance magnetic spectrometer MAGNEX (LNS, Catania, Italy) in a high-sensitivity and high-precision experiment, we have confirmed some of the predictions cited above, for the 16 O + 27 Al system, at 100 MeV beam energy, up to about 80 degrees in the center of mass. An extremely good resolution (around 90 keV) was achieved, allowing for clear separation of the elastic channel from the first excited state of 27 Al (843.8 keV). Cross sections below 10 -4 mb were measured. Additional experiments are scheduled to April, 2011, in order to explore the backward-angle region. In this presentation, the comparison between the rainbow structures detected in this system and those in lighter systems and with weakly bound nuclei will be discussed, in connection with the predicted Airy minima. (author)

DIMENSI METRIK GRAPH LOBSTER Ln (q;r

Directory of Open Access Journals (Sweden)

PANDE GDE DONY GUMILAR

2013-05-01

Full Text Available The metric dimension of connected graph G is the cardinality of minimum resolving set in graph G. In this research, we study how to find the metric dimension of lobster graph Ln (q;r. Lobster graph Ln (q;r is a regular lobster graph with vertices backbone on the main path, every backbone vertex is connected to q hand vertices and every hand vertex is connected to r finger vertices, with n, q, r element of N. We obtain the metric dimension of lobster graph L2 (1;1 is 1, the metric dimension of lobster graph L2 (1;1 for n > 2 is 2.

Discrimination of bile acids by the rainbow trout olfactory system: Evidence as potential pheromone

Directory of Open Access Journals (Sweden)

PERCILIA C GIAQUINTO

2008-01-01

Full Text Available Electro-olfactogram recording was used to determine whether the olfactory epithelium of adult rainbow trout is specifically sensitive to bile acids, some of which have been hypothesized to function as pheromones. Of 38 bile acids that had been pre-screened for olfactory activity, 6 were selected. The rainbow trout-specific bile acids, taurocholic acid (TCA, and taurolithocholic acid 3-sulfate (TLS were the most potent compounds tested. TLS had a distinctive dose-response curve. Cross-adaptation experiments demonstrated that sensitivity to bile acids is attributable to at least 3 independent classes of olfactory receptor sites. Our data suggest that bile acids are discriminated by olfaction in rainbow trout, supporting the possibility that these compounds function as pheromones

Summary: beyond fault trees to fault graphs

International Nuclear Information System (INIS)

Alesso, H.P.; Prassinos, P.; Smith, C.F.

1984-09-01

Fault Graphs are the natural evolutionary step over a traditional fault-tree model. A Fault Graph is a failure-oriented directed graph with logic connectives that allows cycles. We intentionally construct the Fault Graph to trace the piping and instrumentation drawing (P and ID) of the system, but with logical AND and OR conditions added. Then we evaluate the Fault Graph with computer codes based on graph-theoretic methods. Fault Graph computer codes are based on graph concepts, such as path set (a set of nodes traveled on a path from one node to another) and reachability (the complete set of all possible paths between any two nodes). These codes are used to find the cut-sets (any minimal set of component failures that will fail the system) and to evaluate the system reliability

Chasing the rainbow: lesbian, gay, bisexual, transgender and queer youth and pride semiotics.

Science.gov (United States)

Wolowic, Jennifer M; Heston, Laura V; Saewyc, Elizabeth M; Porta, Carolyn; Eisenberg, Marla E

2017-05-01

While the pride rainbow has been part of political and social intervention for decades, few have researched how lesbian, gay, bisexual, transgender and queer young people perceive and use the symbol. How do lesbian, gay, bisexual, transgender and queer youth who experience greater feelings of isolation and discrimination than heterosexual youth recognise and deploy the symbol? As part of a larger study on supportive lesbian, gay, bisexual, transgender and queer youth environments, we conducted 66 go-along interviews with lesbian, gay, bisexual, transgender and queer youth people from Massachusetts, Minnesota and British Columbia. During interviews, young people identified visible symbols of support, including recognition and the use of the pride rainbow. A semiotic analysis reveals that young people use the rainbow to construct meanings related to affiliation and positive feelings about themselves, different communities and their futures. Constructed and shared meanings help make the symbol a useful tool for navigating social and physical surroundings. As part of this process, however, young people also recognize that there are limits to the symbolism; it is useful for navigation but its display does not always guarantee supportive places and people. Thus, the pride rainbow connotes safety and support, but using it as a tool for navigation is a learned activity that requires caution.

Interactive Graph Layout of a Million Nodes

Directory of Open Access Journals (Sweden)

Peng Mi

2016-12-01

Full Text Available Sensemaking of large graphs, specifically those with millions of nodes, is a crucial task in many fields. Automatic graph layout algorithms, augmented with real-time human-in-the-loop interaction, can potentially support sensemaking of large graphs. However, designing interactive algorithms to achieve this is challenging. In this paper, we tackle the scalability problem of interactive layout of large graphs, and contribute a new GPU-based force-directed layout algorithm that exploits graph topology. This algorithm can interactively layout graphs with millions of nodes, and support real-time interaction to explore alternative graph layouts. Users can directly manipulate the layout of vertices in a force-directed fashion. The complexity of traditional repulsive force computation is reduced by approximating calculations based on the hierarchical structure of multi-level clustered graphs. We evaluate the algorithm performance, and demonstrate human-in-the-loop layout in two sensemaking case studies. Moreover, we summarize lessons learned for designing interactive large graph layout algorithms on the GPU.

Eulerian Graphs and Related Topics

CERN Document Server

Fleischner, Herbert

1990-01-01

The two volumes comprising Part 1 of this work embrace the theme of Eulerian trails and covering walks. They should appeal both to researchers and students, as they contain enough material for an undergraduate or graduate graph theory course which emphasizes Eulerian graphs, and thus can be read by any mathematician not yet familiar with graph theory. But they are also of interest to researchers in graph theory because they contain many recent results, some of which are only partial solutions to more general problems. A number of conjectures have been included as well. Various problems (such a

The One Universal Graph — a free and open graph database

Science.gov (United States)

Ng, Liang S.; Champion, Corbin

2016-02-01

Recent developments in graph database mostly are huge projects involving big organizations, big operations and big capital, as the name Big Data attests. We proposed the concept of One Universal Graph (OUG) which states that all observable and known objects and concepts (physical, conceptual or digitally represented) can be connected with only one single graph; furthermore the OUG can be implemented with a very simple text file format with free software, capable of being executed on Android or smaller devices. As such the One Universal Graph Data Exchange (GOUDEX) modules can potentially be installed on hundreds of millions of Android devices and Intel compatible computers shipped annually. Coupled with its open nature and ability to connect to existing leading search engines and databases currently in operation, GOUDEX has the potential to become the largest and a better interface for users and programmers to interact with the data on the Internet. With a Web User Interface for users to use and program in native Linux environment, Free Crowdware implemented in GOUDEX can help inexperienced users learn programming with better organized documentation for free software, and is able to manage programmer's contribution down to a single line of code or a single variable in software projects. It can become the first practically realizable “Internet brain” on which a global artificial intelligence system can be implemented. Being practically free and open, One Universal Graph can have significant applications in robotics, artificial intelligence as well as social networks.

Degree-based graph construction

International Nuclear Information System (INIS)

Kim, Hyunju; Toroczkai, Zoltan; Erdos, Peter L; Miklos, Istvan; Szekely, Laszlo A

2009-01-01

Degree-based graph construction is a ubiquitous problem in network modelling (Newman et al 2006 The Structure and Dynamics of Networks (Princeton Studies in Complexity) (Princeton, NJ: Princeton University Press), Boccaletti et al 2006 Phys. Rep. 424 175), ranging from social sciences to chemical compounds and biochemical reaction networks in the cell. This problem includes existence, enumeration, exhaustive construction and sampling questions with aspects that are still open today. Here we give necessary and sufficient conditions for a sequence of nonnegative integers to be realized as a simple graph's degree sequence, such that a given (but otherwise arbitrary) set of connections from an arbitrarily given node is avoided. We then use this result to present a swap-free algorithm that builds all simple graphs realizing a given degree sequence. In a wider context, we show that our result provides a greedy construction method to build all the f-factor subgraphs (Tutte 1952 Can. J. Math. 4 314) embedded within K n setmn S k , where K n is the complete graph and S k is a star graph centred on one of the nodes. (fast track communication)

Downhill Domination in Graphs

Directory of Open Access Journals (Sweden)

Haynes Teresa W.

2014-08-01

Full Text Available A path π = (v1, v2, . . . , vk+1 in a graph G = (V,E is a downhill path if for every i, 1 ≤ i ≤ k, deg(vi ≥ deg(vi+1, where deg(vi denotes the degree of vertex vi ∈ V. The downhill domination number equals the minimum cardinality of a set S ⊆ V having the property that every vertex v ∈ V lies on a downhill path originating from some vertex in S. We investigate downhill domination numbers of graphs and give upper bounds. In particular, we show that the downhill domination number of a graph is at most half its order, and that the downhill domination number of a tree is at most one third its order. We characterize the graphs obtaining each of these bounds

Oil adjuvant elevates protection of rainbow trout (Oncorhynchus my-kiss) following injection vaccination against Yersinia ruckeri

DEFF Research Database (Denmark)

Jaafar, Rzgar M.; Chettri, Jiwan Kumar; Dalsgaard, Inger

2016-01-01

Enteric redmouth disease (ERM) caused by the fish pathogen Yersinia ruckeri is a major threat to freshwater production of rainbow trout throughout all life stages. Injection vaccination of rainbow trout against Y. ruckeri infection has been shown to confer better protection compared to the tradit...

Subsampling for graph power spectrum estimation

KAUST Repository

Chepuri, Sundeep Prabhakar; Leus, Geert

2016-01-01

In this paper we focus on subsampling stationary random signals that reside on the vertices of undirected graphs. Second-order stationary graph signals are obtained by filtering white noise and they admit a well-defined power spectrum. Estimating the graph power spectrum forms a central component of stationary graph signal processing and related inference tasks. We show that by sampling a significantly smaller subset of vertices and using simple least squares, we can reconstruct the power spectrum of the graph signal from the subsampled observations, without any spectral priors. In addition, a near-optimal greedy algorithm is developed to design the subsampling scheme.

Proving relations between modular graph functions

International Nuclear Information System (INIS)

Basu, Anirban

2016-01-01

We consider modular graph functions that arise in the low energy expansion of the four graviton amplitude in type II string theory. The vertices of these graphs are the positions of insertions of vertex operators on the toroidal worldsheet, while the links are the scalar Green functions connecting the vertices. Graphs with four and five links satisfy several non-trivial relations, which have been proved recently. We prove these relations by using elementary properties of Green functions and the details of the graphs. We also prove a relation between modular graph functions with six links. (paper)

Subsampling for graph power spectrum estimation

KAUST Repository

Chepuri, Sundeep Prabhakar

2016-10-06

In this paper we focus on subsampling stationary random signals that reside on the vertices of undirected graphs. Second-order stationary graph signals are obtained by filtering white noise and they admit a well-defined power spectrum. Estimating the graph power spectrum forms a central component of stationary graph signal processing and related inference tasks. We show that by sampling a significantly smaller subset of vertices and using simple least squares, we can reconstruct the power spectrum of the graph signal from the subsampled observations, without any spectral priors. In addition, a near-optimal greedy algorithm is developed to design the subsampling scheme.

Semantic graphs and associative memories

Science.gov (United States)

Pomi, Andrés; Mizraji, Eduardo

2004-12-01

Graphs have been increasingly utilized in the characterization of complex networks from diverse origins, including different kinds of semantic networks. Human memories are associative and are known to support complex semantic nets; these nets are represented by graphs. However, it is not known how the brain can sustain these semantic graphs. The vision of cognitive brain activities, shown by modern functional imaging techniques, assigns renewed value to classical distributed associative memory models. Here we show that these neural network models, also known as correlation matrix memories, naturally support a graph representation of the stored semantic structure. We demonstrate that the adjacency matrix of this graph of associations is just the memory coded with the standard basis of the concept vector space, and that the spectrum of the graph is a code invariant of the memory. As long as the assumptions of the model remain valid this result provides a practical method to predict and modify the evolution of the cognitive dynamics. Also, it could provide us with a way to comprehend how individual brains that map the external reality, almost surely with different particular vector representations, are nevertheless able to communicate and share a common knowledge of the world. We finish presenting adaptive association graphs, an extension of the model that makes use of the tensor product, which provides a solution to the known problem of branching in semantic nets.

RNA graph partitioning for the discovery of RNA modularity: a novel application of graph partition algorithm to biology.

Directory of Open Access Journals (Sweden)

Namhee Kim

Full Text Available Graph representations have been widely used to analyze and design various economic, social, military, political, and biological networks. In systems biology, networks of cells and organs are useful for understanding disease and medical treatments and, in structural biology, structures of molecules can be described, including RNA structures. In our RNA-As-Graphs (RAG framework, we represent RNA structures as tree graphs by translating unpaired regions into vertices and helices into edges. Here we explore the modularity of RNA structures by applying graph partitioning known in graph theory to divide an RNA graph into subgraphs. To our knowledge, this is the first application of graph partitioning to biology, and the results suggest a systematic approach for modular design in general. The graph partitioning algorithms utilize mathematical properties of the Laplacian eigenvector (µ2 corresponding to the second eigenvalues (λ2 associated with the topology matrix defining the graph: λ2 describes the overall topology, and the sum of µ2's components is zero. The three types of algorithms, termed median, sign, and gap cuts, divide a graph by determining nodes of cut by median, zero, and largest gap of µ2's components, respectively. We apply these algorithms to 45 graphs corresponding to all solved RNA structures up through 11 vertices (∼ 220 nucleotides. While we observe that the median cut divides a graph into two similar-sized subgraphs, the sign and gap cuts partition a graph into two topologically-distinct subgraphs. We find that the gap cut produces the best biologically-relevant partitioning for RNA because it divides RNAs at less stable connections while maintaining junctions intact. The iterative gap cuts suggest basic modules and assembly protocols to design large RNA structures. Our graph substructuring thus suggests a systematic approach to explore the modularity of biological networks. In our applications to RNA structures, subgraphs

Global rainbow thermometry assessed by Airy and Lorenz-Mie theories and compared with phase Doppler anemometry.

Science.gov (United States)

van Beeck, Jeronimus Petrus Antonius Johannes; Grosges, Thomas; De Giorgi, Maria Grazia

2003-07-01

Global rainbow thermometry (GRT) measures the mean size and temperature of an ensemble of spray droplets. The domain of validity of the Airy theory for this technique is established through comparison with Lorenz-Mie theory. The temperature derivation from the inflection points of the Airy rainbow pattern appears to be independent of the type of spray dispersion. Measurements in a water spray are reported. The mean diameter obtained from the rainbow pattern lies between the arithmetic and the Sauter mean diameters measured by phase Doppler anemometry. The temperature measurement by GRT is shown to be accurate within a few degrees Celsius.

Choice of the control variables of an isolated intersection by graph colouring

Directory of Open Access Journals (Sweden)

Batanović Vladan

2015-01-01

Full Text Available This paper deals with the problem of grouping the traffic streams into some groups - signal groups on a signalized intersection. The fact that more traffic streams, which are not in a conflict, can be controlled by one sequence of traffic lights means that one control variable can be assigned to one signal group. Determination of the complete sets of signal groups, i.e. the groups of traffic streams on one intersection, controlled by one control variable is defined in this paper as a graphcoloring problem. The complete sets of signal groups are obtained by coloring the complement of the graph of identical indications. It is shown that the minimal number of signal groups in the complete set of signal groups is equal to the chromatic number of the complement of the graph with identical indications. The problem of finding all complete sets of signal groups with minimal cardinality, which is equal to the chromatic number, is formulated as a linear programming problem where the values of variables belong to set {0,1}.

A generalization of total graphs

Indian Academy of Sciences (India)

M Afkhami

2018-04-12

Apr 12, 2018 ... product of any lower triangular matrix with the transpose of any element of U belongs to U. The ... total graph of R, which is denoted by T( (R)), is a simple graph with all elements of R as vertices, and ...... [9] Badawi A, On dot-product graph of a commutative ring, Communications in Algebra 43 (2015). 43–50.

Bath vaccination of rainbow trout against yersiniosis

DEFF Research Database (Denmark)

Raida, Martin Kristian; Buchmann, Kurt

2007-01-01

disease (ERM), was investigated at 5, 15 and 25° C. Rainbow trout fry were kept at controlled temperatures for two month before they were immersed in a commercial Yersinia ruckeri O1 bacterin for 10 minutes. Control groups were sham vaccinated using pure water. Fish were challenged with Yersinia ruckeri O...

A second generation genetic map for rainbow trout (Oncorhynchus mykiss

Directory of Open Access Journals (Sweden)

Gahr Scott A

2008-11-01

Full Text Available Abstract Background Genetic maps characterizing the inheritance patterns of traits and markers have been developed for a wide range of species and used to study questions in biomedicine, agriculture, ecology and evolutionary biology. The status of rainbow trout genetic maps has progressed significantly over the last decade due to interest in this species in aquaculture and sport fisheries, and as a model research organism for studies related to carcinogenesis, toxicology, comparative immunology, disease ecology, physiology and nutrition. We constructed a second generation genetic map for rainbow trout using microsatellite markers to facilitate the identification of quantitative trait loci for traits affecting aquaculture production efficiency and the extraction of comparative information from the genome sequences of model fish species. Results A genetic map ordering 1124 microsatellite loci spanning a sex-averaged distance of 2927.10 cM (Kosambi and having 2.6 cM resolution was constructed by genotyping 10 parents and 150 offspring from the National Center for Cool and Cold Water Aquaculture (NCCCWA reference family mapping panel. Microsatellite markers, representing pairs of loci resulting from an evolutionarily recent whole genome duplication event, identified 180 duplicated regions within the rainbow trout genome. Microsatellites associated with genes through expressed sequence tags or bacterial artificial chromosomes produced comparative assignments with tetraodon, zebrafish, fugu, and medaka resulting in assignments of homology for 199 loci. Conclusion The second generation NCCCWA genetic map provides an increased microsatellite marker density and quantifies differences in recombination rate between the sexes in outbred populations. It has the potential to integrate with cytogenetic and other physical maps, identifying paralogous regions of the rainbow trout genome arising from the evolutionarily recent genome duplication event, and

Molecular analysis of population genetic structure and recolonization of rainbow trout following the Cantara spill

Science.gov (United States)

Nielsen, J.L.; Heine, Erika L.; Gan, Christina A.; Fountain, Monique C.

2000-01-01

Mitochondrial DNA (mtDNA) sequence and allelic frequency data for 12 microsatellite loci were used to analyze population genetic structure and recolonization by rainbow trout, Oncorhynchus mykiss, following the 1991 Cantara spill on the upper Sacramento River, California. Genetic analyses were performed on 1,016 wild rainbow trout collected between 1993 and 1996 from the mainstem and in 8 tributaries. Wild trout genotypes were compared to genotypes for 79 Mount Shasta Hatchery rainbow trout. No genetic heterogeneity was found 2 years after the spill (1993) between tributary populations and geographically proximate mainstem fish, suggesting recolonization of the upper mainstem directly from adjacent tributaries. Trout collections made in 1996 showed significant year-class genetic variation for mtDNA and microsatellites when compared to fish from the same locations in 1993. Five years after the spill, mainstem populations appeared genetically mixed with no significant allelic frequency differences between mainstem populations and geographically proximate tributary trout. In our 1996 samples, we found no significant genetic differences due to season of capture (summer or fall) or sampling technique used to capture rainbow trout, with the exception of trout collected by electrofishing and hook and line near Prospect Avenue. Haplotype and allelic frequencies in wild rainbow trout populations captured in the upper Sacramento River and its tributaries were found to differ genetically from Mount Shasta Hatchery trout for both years, with the notable exception of trout collected in the lower mainstem river near Shasta Lake, where mtDNA and microsatellite data both suggested upstream colonization by hatchery fish from the reservoir. These data suggest that the chemical spill in the upper Sacramento River produced significant effects over time on the genetic population structure of rainbow trout throughout the entire upper river basin.

Gravity's rainbow: A bridge between LQC and DSR

Directory of Open Access Journals (Sweden)

M.A. Gorji

2017-02-01

Full Text Available The doubly special relativity (DSR theories are constructed in order to take into account an observer-independent length scale in special relativity framework. Gravity's rainbow is a simple generalization of DSR theories to incorporate gravity. In this paper, we show that the effective Friedmann equations that are suggested by loop quantum cosmology (LQC can be exactly reobtained in rainbow cosmology setup. The deformed geometry of LQC then fixes the modified dispersion relation and results in a unique DSR model. In comparison with standard LQC scenario where only the geometry is modified, both geometry and matter parts get modified in our setup. In this respect, we show that the total number of microstates for the universe is finite which suggests the statistical origin of the energy and entropy density bounds. These results explicitly show that the DSR theories are appropriate candidates for the flat limit of loop quantum gravity.

Decomposing a planar graph into an independent set and a 3-degenerate graph

DEFF Research Database (Denmark)

Thomassen, Carsten

2001-01-01

We prove the conjecture made by O. V. Borodin in 1976 that the vertex set of every planar graph can be decomposed into an independent set and a set inducing a 3-degenerate graph. (C) 2001 Academic Press....

Evidence of major genes affecting stress response in rainbow trout using Bayesian methods of complex segregation analysis

DEFF Research Database (Denmark)

Vallejo, R L; Rexroad III, C E; Silverstein, J T

2009-01-01

As a first step toward the genetic mapping of QTL affecting stress response variation in rainbow trout, we performed complex segregation analyses (CSA) fitting mixed inheritance models of plasma cortisol by using Bayesian methods in large full-sib families of rainbow trout. To date, no studies have...... been conducted to determine the mode of inheritance of stress response as measured by plasma cortisol response when using a crowding stress paradigm and CSA in rainbow trout. The main objective of this study was to determine the mode of inheritance of plasma cortisol after a crowding stress....... The results from fitting mixed inheritance models with Bayesian CSA suggest that 1 or more major genes with dominant cortisol-decreasing alleles and small additive genetic effects of a large number of independent genes likely underlie the genetic variation of plasma cortisol in the rainbow trout families...

Commuting graphs of matrix algebras

International Nuclear Information System (INIS)

Akbari, S.; Bidkhori, H.; Mohammadian, A.

2006-08-01

The commuting graph of a ring R, denoted by Γ(R), is a graph whose vertices are all non- central elements of R and two distinct vertices x and y are adjacent if and only if xy = yx. The commuting graph of a group G, denoted by Γ(G), is similarly defined. In this paper we investigate some graph theoretic properties of Γ(M n (F)), where F is a field and n ≥ 2. Also we study the commuting graphs of some classical groups such as GL n (F) and SL n (F). We show that Γ(M n (F)) is a connected graph if and only if every field extension of F of degree n contains a proper intermediate field. We prove that apart from finitely many fields, a similar result is true for Γ(GL n (F)) and Γ(SL n (F)). Also we show that for two fields E and F and integers m, n ≥> 2, if Γ(M m (E)) ≅ Γ(M n (F)), then m = n and vertical bar E vertical bar = vertical bar F vertical bar. (author)

Chromosome rearrangements, recombination suppression, and limited segregation distortion in hybrids between Yellowstone cutthroat trout (Oncorhynchus clarkii bouvieri) and rainbow trout (O. mykiss)

Science.gov (United States)

2013-01-01

Background Introgressive hybridization is an important evolutionary process that can lead to the creation of novel genome structures and thus potentially new genetic variation for selection to act upon. On the other hand, hybridization with introduced species can threaten native species, such as cutthroat trout (Oncorhynchus clarkii) following the introduction of rainbow trout (O. mykiss). Neither the evolutionary consequences nor conservation implications of rainbow trout introgression in cutthroat trout is well understood. Therefore, we generated a genetic linkage map for rainbow-Yellowstone cutthroat trout (O. clarkii bouvieri) hybrids to evaluate genome processes that may help explain how introgression affects hybrid genome evolution. Results The hybrid map closely aligned with the rainbow trout map (a cutthroat trout map does not exist), sharing all but one linkage group. This linkage group (RYHyb20) represented a fusion between an acrocentric (Omy28) and a metacentric chromosome (Omy20) in rainbow trout. Additional mapping in Yellowstone cutthroat trout indicated the two rainbow trout homologues were fused in the Yellowstone genome. Variation in the number of hybrid linkage groups (28 or 29) likely depended on a Robertsonian rearrangement polymorphism within the rainbow trout stock. Comparison between the female-merged F1 map and a female consensus rainbow trout map revealed that introgression suppressed recombination across large genomic regions in 5 hybrid linkage groups. Two of these linkage groups (RYHyb20 and RYHyb25_29) contained confirmed chromosome rearrangements between rainbow and Yellowstone cutthroat trout indicating that rearrangements may suppress recombination. The frequency of allelic and genotypic segregation distortion varied among parents and families, suggesting few incompatibilities exist between rainbow and Yellowstone cutthroat trout genomes. Conclusions Chromosome rearrangements suppressed recombination in the hybrids. This result

Graph-theoretical concepts and physicochemical data

Directory of Open Access Journals (Sweden)

Lionello Pogliani

2003-02-01

Full Text Available Graph theoretical concepts have been used to model the molecular polarizabilities of fifty-four organic derivatives, and the induced dipole moment of a set of fifty-seven organic compounds divided into three subsets. The starting point of these modeling strategies is the hydrogen-suppressed chemical graph and pseudograph of a molecule, which works very well for second row atoms. From these types of graphs a set of graph-theoretical basis indices, the molecular connectivity indices, can be derived and used to model properties and activities of molecules. With the aid of the molecular connectivity basis indices it is then possible to build higher-order descriptors. The problem of 'graph' encoding the contribution of the inner-core electrons of heteroatoms can here be solved with the aid of odd complete graphs, Kp-(p-odd. The use of these graph tools allow to draw an optimal modeling of the molecular polarizabilities and a satisfactory modeling of the induced dipole moment of a wide set of organic derivatives.

Graphs whose complement and square are isomorphic

DEFF Research Database (Denmark)

Pedersen, Anders Sune

2014-01-01

We study square-complementary graphs, that is, graphs whose complement and square are isomorphic. We prove several necessary conditions for a graph to be square-complementary, describe ways of building new square-complementary graphs from existing ones, construct infinite families of square-compl...

Graphs & digraphs

CERN Document Server

Chartrand, Gary; Zhang, Ping

2010-01-01

Gary Chartrand has influenced the world of Graph Theory for almost half a century. He has supervised more than a score of Ph.D. dissertations and written several books on the subject. The most widely known of these texts, Graphs and Digraphs, … has much to recommend it, with clear exposition, and numerous challenging examples [that] make it an ideal textbook for the advanced undergraduate or beginning graduate course. The authors have updated their notation to reflect the current practice in this still-growing area of study. By the authors' estimation, the 5th edition is approximately 50% longer than the 4th edition. … the legendary Frank Harary, author of the second graph theory text ever produced, is one of the figures profiled. His book was the standard in the discipline for several decades. Chartrand, Lesniak and Zhang have produced a worthy successor.-John T. Saccoman, MAA Reviews, June 2012 (This book is in the MAA's basic library list.)As with the earlier editions, the current text emphasizes clear...

Packing Degenerate Graphs Greedily

Czech Academy of Sciences Publication Activity Database

Allen, P.; Böttcher, J.; Hladký, J.; Piguet, Diana

2017-01-01

Roč. 61, August (2017), s. 45-51 ISSN 1571-0653 R&D Projects: GA ČR GJ16-07822Y Institutional support: RVO:67985807 Keywords : tree packing conjecture * graph packing * graph processes Subject RIV: BA - General Mathematics OBOR OECD: Pure mathematics

Continuous-time quantum walks on star graphs

International Nuclear Information System (INIS)

Salimi, S.

2009-01-01

In this paper, we investigate continuous-time quantum walk on star graphs. It is shown that quantum central limit theorem for a continuous-time quantum walk on star graphs for N-fold star power graph, which are invariant under the quantum component of adjacency matrix, converges to continuous-time quantum walk on K 2 graphs (complete graph with two vertices) and the probability of observing walk tends to the uniform distribution.

Tailored Random Graph Ensembles

International Nuclear Information System (INIS)

Roberts, E S; Annibale, A; Coolen, A C C

2013-01-01

Tailored graph ensembles are a developing bridge between biological networks and statistical mechanics. The aim is to use this concept to generate a suite of rigorous tools that can be used to quantify and compare the topology of cellular signalling networks, such as protein-protein interaction networks and gene regulation networks. We calculate exact and explicit formulae for the leading orders in the system size of the Shannon entropies of random graph ensembles constrained with degree distribution and degree-degree correlation. We also construct an ergodic detailed balance Markov chain with non-trivial acceptance probabilities which converges to a strictly uniform measure and is based on edge swaps that conserve all degrees. The acceptance probabilities can be generalized to define Markov chains that target any alternative desired measure on the space of directed or undirected graphs, in order to generate graphs with more sophisticated topological features.

The Smallest Valid Extension-Based Efficient, Rare Graph Pattern Mining, Considering Length-Decreasing Support Constraints and Symmetry Characteristics of Graphs

Directory of Open Access Journals (Sweden)

Unil Yun

2016-05-01

Full Text Available Frequent graph mining has been proposed to find interesting patterns (i.e., frequent sub-graphs from databases composed of graph transaction data, which can effectively express complex and large data in the real world. In addition, various applications for graph mining have been suggested. Traditional graph pattern mining methods use a single minimum support threshold factor in order to check whether or not mined patterns are interesting. However, it is not a sufficient factor that can consider valuable characteristics of graphs such as graph sizes and features of graph elements. That is, previous methods cannot consider such important characteristics in their mining operations since they only use a fixed minimum support threshold in the mining process. For this reason, in this paper, we propose a novel graph mining algorithm that can consider various multiple, minimum support constraints according to the types of graph elements and changeable minimum support conditions, depending on lengths of graph patterns. In addition, the proposed algorithm performs in mining operations more efficiently because it can minimize duplicated operations and computational overheads by considering symmetry features of graphs. Experimental results provided in this paper demonstrate that the proposed algorithm outperforms previous mining approaches in terms of pattern generation, runtime and memory usage.

Single nucleotide polymorphism discovery in rainbow trout by deep sequencing of a reduced representation library

Directory of Open Access Journals (Sweden)

Salem Mohamed

2009-11-01

Full Text Available Abstract Background To enhance capabilities for genomic analyses in rainbow trout, such as genomic selection, a large suite of polymorphic markers that are amenable to high-throughput genotyping protocols must be identified. Expressed Sequence Tags (ESTs have been used for single nucleotide polymorphism (SNP discovery in salmonids. In those strategies, the salmonid semi-tetraploid genomes often led to assemblies of paralogous sequences and therefore resulted in a high rate of false positive SNP identification. Sequencing genomic DNA using primers identified from ESTs proved to be an effective but time consuming methodology of SNP identification in rainbow trout, therefore not suitable for high throughput SNP discovery. In this study, we employed a high-throughput strategy that used pyrosequencing technology to generate data from a reduced representation library constructed with genomic DNA pooled from 96 unrelated rainbow trout that represent the National Center for Cool and Cold Water Aquaculture (NCCCWA broodstock population. Results The reduced representation library consisted of 440 bp fragments resulting from complete digestion with the restriction enzyme HaeIII; sequencing produced 2,000,000 reads providing an average 6 fold coverage of the estimated 150,000 unique genomic restriction fragments (300,000 fragment ends. Three independent data analyses identified 22,022 to 47,128 putative SNPs on 13,140 to 24,627 independent contigs. A set of 384 putative SNPs, randomly selected from the sets produced by the three analyses were genotyped on individual fish to determine the validation rate of putative SNPs among analyses, distinguish apparent SNPs that actually represent paralogous loci in the tetraploid genome, examine Mendelian segregation, and place the validated SNPs on the rainbow trout linkage map. Approximately 48% (183 of the putative SNPs were validated; 167 markers were successfully incorporated into the rainbow trout linkage map. In

Single nucleotide polymorphism discovery in rainbow trout by deep sequencing of a reduced representation library.

Science.gov (United States)

Sánchez, Cecilia Castaño; Smith, Timothy P L; Wiedmann, Ralph T; Vallejo, Roger L; Salem, Mohamed; Yao, Jianbo; Rexroad, Caird E

2009-11-25

To enhance capabilities for genomic analyses in rainbow trout, such as genomic selection, a large suite of polymorphic markers that are amenable to high-throughput genotyping protocols must be identified. Expressed Sequence Tags (ESTs) have been used for single nucleotide polymorphism (SNP) discovery in salmonids. In those strategies, the salmonid semi-tetraploid genomes often led to assemblies of paralogous sequences and therefore resulted in a high rate of false positive SNP identification. Sequencing genomic DNA using primers identified from ESTs proved to be an effective but time consuming methodology of SNP identification in rainbow trout, therefore not suitable for high throughput SNP discovery. In this study, we employed a high-throughput strategy that used pyrosequencing technology to generate data from a reduced representation library constructed with genomic DNA pooled from 96 unrelated rainbow trout that represent the National Center for Cool and Cold Water Aquaculture (NCCCWA) broodstock population. The reduced representation library consisted of 440 bp fragments resulting from complete digestion with the restriction enzyme HaeIII; sequencing produced 2,000,000 reads providing an average 6 fold coverage of the estimated 150,000 unique genomic restriction fragments (300,000 fragment ends). Three independent data analyses identified 22,022 to 47,128 putative SNPs on 13,140 to 24,627 independent contigs. A set of 384 putative SNPs, randomly selected from the sets produced by the three analyses were genotyped on individual fish to determine the validation rate of putative SNPs among analyses, distinguish apparent SNPs that actually represent paralogous loci in the tetraploid genome, examine Mendelian segregation, and place the validated SNPs on the rainbow trout linkage map. Approximately 48% (183) of the putative SNPs were validated; 167 markers were successfully incorporated into the rainbow trout linkage map. In addition, 2% of the sequences from the

Relating zeta functions of discrete and quantum graphs

Science.gov (United States)

Harrison, Jonathan; Weyand, Tracy

2018-02-01

We write the spectral zeta function of the Laplace operator on an equilateral metric graph in terms of the spectral zeta function of the normalized Laplace operator on the corresponding discrete graph. To do this, we apply a relation between the spectrum of the Laplacian on a discrete graph and that of the Laplacian on an equilateral metric graph. As a by-product, we determine how the multiplicity of eigenvalues of the quantum graph, that are also in the spectrum of the graph with Dirichlet conditions at the vertices, depends on the graph geometry. Finally we apply the result to calculate the vacuum energy and spectral determinant of a complete bipartite graph and compare our results with those for a star graph, a graph in which all vertices are connected to a central vertex by a single edge.

Observation of a rainbow of visible colors in a near infrared cascaded Raman fiber laser and its novel application as a diagnostic tool for length resolved spectral analysis

Science.gov (United States)

Aparanji, Santosh; Balaswamy, V.; Arun, S.; Supradeepa, V. R.

2018-02-01

In this work, we report and analyse the surprising observation of a rainbow of visible colors, spanning 390nm to 620nm, in silica-based, Near Infrared, continuous-wave, cascaded Raman fiber lasers. The cascaded Raman laser is pumped at 1117nm at around 200W and at full power we obtain 100 W at 1480nm. With increasing pump power at 1117nm, the fiber constituting the Raman laser glows in various hues along its length. From spectroscopic analysis of the emitted visible light, it was identified to be harmonic and sum-frequency components of various locally propagating wavelength components. In addition to third harmonic components, surprisingly, even 2nd harmonic components were observed. Despite being a continuous-wave laser, we expect the phase-matching occurring between the core-propagating NIR light with the cladding-propagating visible wavelengths and the intensity fluctuations characteristic of Raman lasers to have played a major role in generation of visible light. In addition, this surprising generation of visible light provides us a powerful non-contact method to deduce the spectrum of light propagating in the fiber. Using static images of the fiber captured by a standard visible camera such as a DSLR, we demonstrate novel, image-processing based techniques to deduce the wavelength component propagating in the fiber at any given spatial location. This provides a powerful diagnostic tool for both length and power resolved spectral analysis in Raman fiber lasers. This helps accurate prediction of the optimal length of fiber required for complete and efficient conversion to a given Stokes wavelength.

Hawking, fiducial, and free-fall temperature of black hole on gravity's rainbow

Energy Technology Data Exchange (ETDEWEB)

Gim, Yongwan; Kim, Wontae [Sogang University, Department of Physics, Seoul (Korea, Republic of)

2016-03-15

On gravity's rainbow, the energy of test particles deforms the geometry of a black hole in such a way that the corresponding Hawking temperature is expected to be modified. It means that the fiducial and free-fall temperatures on the black hole background should also be modified according to deformation of the geometry. In this work, the probing energy of test particles is assumed as the average energy of the Hawking particle in order to study the particle back reaction of the geometry by using the advantage of gravity's rainbow. We shall obtain the modified fiducial and free-fall temperatures, respectively. The behaviors of these two temperatures on the horizon tell us that black hole complementarity is still well defined on gravity's rainbow. (orig.)

The One Universal Graph — a free and open graph database

International Nuclear Information System (INIS)

Ng, Liang S.; Champion, Corbin

2016-01-01

Recent developments in graph database mostly are huge projects involving big organizations, big operations and big capital, as the name Big Data attests. We proposed the concept of One Universal Graph (OUG) which states that all observable and known objects and concepts (physical, conceptual or digitally represented) can be connected with only one single graph; furthermore the OUG can be implemented with a very simple text file format with free software, capable of being executed on Android or smaller devices. As such the One Universal Graph Data Exchange (GOUDEX) modules can potentially be installed on hundreds of millions of Android devices and Intel compatible computers shipped annually. Coupled with its open nature and ability to connect to existing leading search engines and databases currently in operation, GOUDEX has the potential to become the largest and a better interface for users and programmers to interact with the data on the Internet. With a Web User Interface for users to use and program in native Linux environment, Free Crowdware implemented in GOUDEX can help inexperienced users learn programming with better organized documentation for free software, and is able to manage programmer's contribution down to a single line of code or a single variable in software projects. It can become the first practically realizable “Internet brain” on which a global artificial intelligence system can be implemented. Being practically free and open, One Universal Graph can have significant applications in robotics, artificial intelligence as well as social networks. (paper)

Recognition of fractal graphs

NARCIS (Netherlands)

Perepelitsa, VA; Sergienko, [No Value; Kochkarov, AM

1999-01-01

Definitions of prefractal and fractal graphs are introduced, and they are used to formulate mathematical models in different fields of knowledge. The topicality of fractal-graph recognition from the point of view, of fundamental improvement in the efficiency of the solution of algorithmic problems

Interactive Graph Layout of a Million Nodes

OpenAIRE

Peng Mi; Maoyuan Sun; Moeti Masiane; Yong Cao; Chris North

2016-01-01

Sensemaking of large graphs, specifically those with millions of nodes, is a crucial task in many fields. Automatic graph layout algorithms, augmented with real-time human-in-the-loop interaction, can potentially support sensemaking of large graphs. However, designing interactive algorithms to achieve this is challenging. In this paper, we tackle the scalability problem of interactive layout of large graphs, and contribute a new GPU-based force-directed layout algorithm that exploits graph to...

RATGRAPH: Computer Graphing of Rational Functions.

Science.gov (United States)

Minch, Bradley A.

1987-01-01

Presents an easy-to-use Applesoft BASIC program that graphs rational functions and any asymptotes that the functions might have. Discusses the nature of rational functions, graphing them manually, employing a computer to graph rational functions, and describes how the program works. (TW)

Graph algorithms in the titan toolkit.

Energy Technology Data Exchange (ETDEWEB)

McLendon, William Clarence, III; Wylie, Brian Neil

2009-10-01

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

A Graph Calculus for Predicate Logic

Directory of Open Access Journals (Sweden)

Paulo A. S. Veloso

2013-03-01

Full Text Available We introduce a refutation graph calculus for classical first-order predicate logic, which is an extension of previous ones for binary relations. One reduces logical consequence to establishing that a constructed graph has empty extension, i. e. it represents bottom. Our calculus establishes that a graph has empty extension by converting it to a normal form, which is expanded to other graphs until we can recognize conflicting situations (equivalent to a formula and its negation.

Deep Learning with Dynamic Computation Graphs

OpenAIRE

Looks, Moshe; Herreshoff, Marcello; Hutchins, DeLesley; Norvig, Peter

2017-01-01

Neural networks that compute over graph structures are a natural fit for problems in a variety of domains, including natural language (parse trees) and cheminformatics (molecular graphs). However, since the computation graph has a different shape and size for every input, such networks do not directly support batched training or inference. They are also difficult to implement in popular deep learning libraries, which are based on static data-flow graphs. We introduce a technique called dynami...

Constructs for Programming with Graph Rewrites

OpenAIRE

Rodgers, Peter

2000-01-01

Graph rewriting is becoming increasingly popular as a method for programming with graph based data structures. We present several modifications to a basic serial graph rewriting paradigm and discuss how they improve coding programs in the Grrr graph rewriting programming language. The constructs we present are once only nodes, attractor nodes and single match rewrites. We illustrate the operation of the constructs by example. The advantages of adding these new rewrite modifiers is to reduce t...

Quantum chaos on discrete graphs

International Nuclear Information System (INIS)

Smilansky, Uzy

2007-01-01

Adapting a method developed for the study of quantum chaos on quantum (metric) graphs (Kottos and Smilansky 1997 Phys. Rev. Lett. 79 4794, Kottos and Smilansky 1999 Ann. Phys., NY 274 76), spectral ζ functions and trace formulae for 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 belong to the class of ζ functions proposed originally by Ihara (1966 J. Mat. Soc. Japan 18 219) and expanded by subsequent authors (Stark and Terras 1996 Adv. Math. 121 124, Kotani and Sunada 2000 J. Math. Sci. Univ. Tokyo 7 7). Finally, a model of 'classical dynamics' on the discrete graph is proposed. It is analogous to the corresponding classical dynamics derived for quantum graphs (Kottos and Smilansky 1997 Phys. Rev. Lett. 79 4794, Kottos and Smilansky 1999 Ann. Phys., NY 274 76). (fast track communication)

RJSplot: Interactive Graphs with R.

Science.gov (United States)

Barrios, David; Prieto, Carlos

2018-03-01

Data visualization techniques provide new methods for the generation of interactive graphs. These graphs allow a better exploration and interpretation of data but their creation requires advanced knowledge of graphical libraries. Recent packages have enabled the integration of interactive graphs in R. However, R provides limited graphical packages that allow the generation of interactive graphs for computational biology applications. The present project has joined the analytical power of R with the interactive graphical features of JavaScript in a new R package (RJSplot). It enables the easy generation of interactive graphs in R, provides new visualization capabilities, and contributes to the advance of computational biology analytical methods. At present, 16 interactive graphics are available in RJSplot, such as the genome viewer, Manhattan plots, 3D plots, heatmaps, dendrograms, networks, and so on. The RJSplot package is freely available online at http://rjsplot.net. © 2018 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim.

Bipartite separability and nonlocal quantum operations on graphs

Science.gov (United States)

Dutta, Supriyo; Adhikari, Bibhas; Banerjee, Subhashish; Srikanth, R.

2016-07-01

In this paper we consider the separability problem for bipartite quantum states arising from graphs. Earlier it was proved that the degree criterion is the graph-theoretic counterpart of the familiar positive partial transpose criterion for separability, although there are entangled states with positive partial transpose for which the degree criterion fails. Here we introduce the concept of partially symmetric graphs and degree symmetric graphs by using the well-known concept of partial transposition of a graph and degree criteria, respectively. Thus, we provide classes of bipartite separable states of dimension m ×n arising from partially symmetric graphs. We identify partially asymmetric graphs that lack the property of partial symmetry. We develop a combinatorial procedure to create a partially asymmetric graph from a given partially symmetric graph. We show that this combinatorial operation can act as an entanglement generator for mixed states arising from partially symmetric graphs.

Content-based image retrieval using a signature graph and a self-organizing map

Directory of Open Access Journals (Sweden)

Van Thanh The

2016-06-01

Full Text Available In order to effectively retrieve a large database of images, a method of creating an image retrieval system CBIR (contentbased image retrieval is applied based on a binary index which aims to describe features of an image object of interest. This index is called the binary signature and builds input data for the problem of matching similar images. To extract the object of interest, we propose an image segmentation method on the basis of low-level visual features including the color and texture of the image. These features are extracted at each block of the image by the discrete wavelet frame transform and the appropriate color space. On the basis of a segmented image, we create a binary signature to describe the location, color and shape of the objects of interest. In order to match similar images, we provide a similarity measure between the images based on binary signatures. Then, we present a CBIR model which combines a signature graph and a self-organizing map to cluster and store similar images. To illustrate the proposed method, experiments on image databases are reported, including COREL,Wang and MSRDI.

Algorithms and Data Structures for Graphs

DEFF Research Database (Denmark)

Rotenberg, Eva

are planar graphs, which are those that can be drawn on a piece of paper without any pair of edges crossing. For planar graphs where each edge can only be traversed in one direction, a fundamental question is whether there is a route from vertex A to vertex B in the graph. We show how such a graph can...... of the form: "Is there an edge such that all paths between A and B go via that edge?" and which can quickly be updated when edges are inserted or deleted. We further show how to represent a planar graph such that we can quickly update our representation when an edge is deleted, and such that questions...

On the nullity number of graphs

Directory of Open Access Journals (Sweden)

Mustapha Aouchiche

2017-10-01

Full Text Available The paper discusses bounds on the nullity number of graphs. It is proved in [B. Cheng and B. Liu, On the nullity of graphs. Electron. J. Linear Algebra 16 (2007 60--67] that $\\eta \\le n - D$, where $\\eta$, n and D denote the nullity number, the order and the diameter of a connected graph, respectively. We first give a necessary condition on the extremal graphs corresponding to that bound, and then we strengthen the bound itself using the maximum clique number. In addition, we prove bounds on the nullity using the number of pendant neighbors in a graph. One of those bounds is an improvement of a known bound involving the domination number.

Gravity in Gravity’s Rainbow – Force, Fictitious Force, and Frame of Reference; or: The Science and Poetry of Sloth

Directory of Open Access Journals (Sweden)

Nina Engelhardt

2014-09-01

Full Text Available Gravity is a prominent physical concept in 'Gravity's Rainbow', as already announced by the novel's title. If the second part of the title – the poetic image of the rainbow – is bound up with mathematical formulas and the parabolic path of the Rocket, so conversely, this paper argues, Pynchon's novel introduces a relation between gravity and fiction. The paper explores 'Gravity's Rainbow''s use of the changing historical understandings of gravitation from the seventeenth to the twentieth centuries by examining the novel's illustration of Newton and Leibniz's opposed concepts as well as its references to gravity as understood in Einstein's theory of relativity. When tracing the notions of gravity as force, fictitious force, and frame of reference, a particular focus lies on the relation of physical imagery to ethical questions and on the way 'Gravity's Rainbow' provides a physico-ethical explanation of Slothrop's disappearance from the novel.

Graph Transforming Java Data

NARCIS (Netherlands)

de Mol, M.J.; Rensink, Arend; Hunt, James J.

This paper introduces an approach for adding graph transformation-based functionality to existing JAVA programs. The approach relies on a set of annotations to identify the intended graph structure, as well as on user methods to manipulate that structure, within the user’s own JAVA class

Effects of cooking techniques on fatty acid and oxylipin content of farmed rainbow trout (Oncorhynchus mykiss)

Science.gov (United States)

Rainbow trout is an excellent source of long chain omega-3 polyunsaturated fatty acids (PUFA) which have beneficial health effects. We determined the fatty acid and oxylipin content of 2-year old rainbow trout fillets that were raw, baked, broiled, microwaved, or pan-fried in corn (CO), canola (CaO...

Graph processing platforms at scale: practices and experiences

Energy Technology Data Exchange (ETDEWEB)

Lim, Seung-Hwan [ORNL; Lee, Sangkeun (Matt) [ORNL; Brown, Tyler C [ORNL; Sukumar, Sreenivas R [ORNL; Ganesh, Gautam [ORNL

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.

Generalized hypercube graph $\\Q_n(S$, graph products and self-orthogonal codes

Directory of Open Access Journals (Sweden)

Pani Seneviratne

2016-01-01

Full Text Available A generalized hypercube graph $\\Q_n(S$ has $\\F_{2}^{n}=\\{0,1\\}^n$ as the vertex set and two vertices being adjacent whenever their mutual Hamming distance belongs to $S$, where $n \\ge 1$ and $S\\subseteq \\{1,2,\\ldots, n\\}$. The graph $\\Q_n(\\{1\\}$ is the $n$-cube, usually denoted by $\\Q_n$.We study graph boolean products $G_1 = \\Q_n(S\\times \\Q_1, G_2 = \\Q_{n}(S\\wedge \\Q_1$, $G_3 = \\Q_{n}(S[\\Q_1]$ and show that binary codes from neighborhood designs of $G_1, G_2$ and $G_3$ are self-orthogonal for all choices of $n$ and $S$. More over, we show that the class of codes $C_1$ are self-dual. Further we find subgroups of the automorphism group of these graphs and use these subgroups to obtain PD-sets for permutation decoding. As an example we find a full error-correcting PD set for the binary $[32, 16, 8]$ extremal self-dual code.

Survey of Approaches to Generate Realistic Synthetic Graphs

Energy Technology Data Exchange (ETDEWEB)

Lim, Seung-Hwan [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Lee, Sangkeun [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Powers, Sarah S [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Shankar, Mallikarjun [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Imam, Neena [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)

2016-10-01

A graph is a flexible data structure that can represent relationships between entities. As with other data analysis tasks, the use of realistic graphs is critical to obtaining valid research results. Unfortunately, using the actual ("real-world") graphs for research and new algorithm development is difficult due to the presence of sensitive information in the data or due to the scale of data. This results in practitioners developing algorithms and systems that employ synthetic graphs instead of real-world graphs. Generating realistic synthetic graphs that provide reliable statistical confidence to algorithmic analysis and system evaluation involves addressing technical hurdles in a broad set of areas. This report surveys the state of the art in approaches to generate realistic graphs that are derived from fitted graph models on real-world graphs.

Constructing Dense Graphs with Unique Hamiltonian Cycles

Science.gov (United States)

Lynch, Mark A. M.

2012-01-01

It is not difficult to construct dense graphs containing Hamiltonian cycles, but it is difficult to generate dense graphs that are guaranteed to contain a unique Hamiltonian cycle. This article presents an algorithm for generating arbitrarily large simple graphs containing "unique" Hamiltonian cycles. These graphs can be turned into dense graphs…

Occurrence, size, and tag retention of sneaker male hatchery rainbow trout

Science.gov (United States)

Isely, J.J.; Grabowski, T.B.

2004-01-01

One alternative reproductive tactic involving early-maturing, cryptic males is referred to as "sneaking." Although sneakers tend to be easily detectable upon close inspection, little is known about the proportion of a fish population consisting of sneakers. We examined 15,400 age-1 rainbow trout Oncorhynchus mykiss in a hatchery. Total length (mm), wet weight (g), and sex (sneaker male or unknown) were recorded for each fish. We also individually tagged each sneaker male with soft visual implant alphanumeric (VIalpha) tags that were sequentially numbered and held the fish for 25 d before inspection. Sneakers constituted 2.8% of the hatchery rainbow trout population and were smaller in total length and weight than typical rainbow trout of the same age. Retention of the VIalpha tags in sneakers was 58.9%, significantly lower than has been reported under similar circumstances. We found that sneaker males may contribute substantially to hatchery populations. Reduced tag retention in sneakers may bias studies evaluating the effect of hatchery fish on wild populations. We believe that hatchery-produced sneaker males have the potential to contribute importantly to the genetic composition of wild populations.

Chromatic polynomials of random graphs

International Nuclear Information System (INIS)

Van Bussel, Frank; Fliegner, Denny; Timme, Marc; Ehrlich, Christoph; Stolzenberg, Sebastian

2010-01-01

Chromatic polynomials and related graph invariants are central objects in both graph theory and statistical physics. Computational difficulties, however, have so far restricted studies of such polynomials to graphs that were either very small, very sparse or highly structured. Recent algorithmic advances (Timme et al 2009 New J. Phys. 11 023001) now make it possible to compute chromatic polynomials for moderately sized graphs of arbitrary structure and number of edges. Here we present chromatic polynomials of ensembles of random graphs with up to 30 vertices, over the entire range of edge density. We specifically focus on the locations of the zeros of the polynomial in the complex plane. The results indicate that the chromatic zeros of random graphs have a very consistent layout. In particular, the crossing point, the point at which the chromatic zeros with non-zero imaginary part approach the real axis, scales linearly with the average degree over most of the density range. While the scaling laws obtained are purely empirical, if they continue to hold in general there are significant implications: the crossing points of chromatic zeros in the thermodynamic limit separate systems with zero ground state entropy from systems with positive ground state entropy, the latter an exception to the third law of thermodynamics.

On some labelings of triangular snake and central graph of triangular snake graph

Science.gov (United States)

Agasthi, P.; Parvathi, N.

2018-04-01

A Triangular snake Tn is obtained from a path u 1 u 2 … u n by joining ui and u i+1 to a new vertex wi for 1≤i≤n‑1. A Central graph of Triangular snake C(T n ) is obtained by subdividing each edge of Tn exactly once and joining all the non adjacent vertices of Tn . In this paper the ways to construct square sum, square difference, Root Mean square, strongly Multiplicative, Even Mean and Odd Mean labeling for Triangular Snake and Central graph of Triangular Snake graphs are reported.

Orientations of infinite graphs with prescribed edge-connectivity

DEFF Research Database (Denmark)

Thomassen, Carsten

2016-01-01

We prove a decomposition result for locally finite graphs which can be used to extend results on edge-connectivity from finite to infinite graphs. It implies that every 4k-edge-connected graph G contains an immersion of some finite 2k-edge-connected Eulerian graph containing any prescribed vertex...... set (while planar graphs show that G need not containa subdivision of a simple finite graph of large edge-connectivity). Also, every 8k-edge connected infinite graph has a k-arc-connected orientation, as conjectured in 1989....

Genus Ranges of 4-Regular Rigid Vertex Graphs.

Science.gov (United States)

Buck, Dorothy; Dolzhenko, Egor; Jonoska, Nataša; Saito, Masahico; Valencia, Karin

2015-01-01

A rigid vertex of a graph is one that has a prescribed cyclic order of its incident edges. We study orientable genus ranges of 4-regular rigid vertex graphs. The (orientable) genus range is a set of genera values over all orientable surfaces into which a graph is embedded cellularly, and the embeddings of rigid vertex graphs are required to preserve the prescribed cyclic order of incident edges at every vertex. The genus ranges of 4-regular rigid vertex graphs are sets of consecutive integers, and we address two questions: which intervals of integers appear as genus ranges of such graphs, and what types of graphs realize a given genus range. For graphs with 2 n vertices ( n > 1), we prove that all intervals [ a, b ] for all a genus ranges. For graphs with 2 n - 1 vertices ( n ≥ 1), we prove that all intervals [ a, b ] for all a genus ranges. We also provide constructions of graphs that realize these ranges.

A new cluster algorithm for graphs

NARCIS (Netherlands)

S. van Dongen

1998-01-01

textabstractA new cluster algorithm for graphs called the emph{Markov Cluster algorithm ($MCL$ algorithm) is introduced. The graphs may be both weighted (with nonnegative weight) and directed. Let~$G$~be such a graph. The $MCL$ algorithm simulates flow in $G$ by first identifying $G$ in a

Chemical Graph Transformation with Stereo-Information

DEFF Research Database (Denmark)

Andersen, Jakob Lykke; Flamm, Christoph; Merkle, Daniel

2017-01-01

Double Pushout graph transformation naturally facilitates the modelling of chemical reactions: labelled undirected graphs model molecules and direct derivations model chemical reactions. However, the most straightforward modelling approach ignores the relative placement of atoms and their neighbo......Double Pushout graph transformation naturally facilitates the modelling of chemical reactions: labelled undirected graphs model molecules and direct derivations model chemical reactions. However, the most straightforward modelling approach ignores the relative placement of atoms...... and their neighbours in space. Stereoisomers of chemical compounds thus cannot be distinguished, even though their chemical activity may differ substantially. In this contribution we propose an extended chemical graph transformation system with attributes that encode information about local geometry. The modelling...... of graph transformation, but we here propose a framework that also allows for partially specified stereoinformation. While there are several stereochemical configurations to be considered, we focus here on the tetrahedral molecular shape, and suggest general principles for how to treat all other chemically...

Large-Scale Graph Processing Using Apache Giraph

KAUST Repository

Sakr, Sherif

2017-01-07

This book takes its reader on a journey through Apache Giraph, a popular distributed graph processing platform designed to bring the power of big data processing to graph data. Designed as a step-by-step self-study guide for everyone interested in large-scale graph processing, it describes the fundamental abstractions of the system, its programming models and various techniques for using the system to process graph data at scale, including the implementation of several popular and advanced graph analytics algorithms.