WorldWideScience

Sample records for graph pattern diffusion

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

  2. Learning heat diffusion graphs

    OpenAIRE

    Thanou, Dorina; Dong, Xiaowen; Kressner, Daniel; Frossard, Pascal

    2016-01-01

    Effective information analysis generally boils down to properly identifying the structure or geometry of the data, which is often represented by a graph. In some applications, this structure may be partly determined by design constraints or pre-determined sensing arrangements, like in road transportation networks for example. In general though, the data structure is not readily available and becomes pretty difficult to define. In particular, the global smoothness assumptions, that most of the...

  3. Extended phase graphs with anisotropic diffusion

    Science.gov (United States)

    Weigel, M.; Schwenk, S.; Kiselev, V. G.; Scheffler, K.; Hennig, J.

    2010-08-01

    The extended phase graph (EPG) calculus gives an elegant pictorial description of magnetization response in multi-pulse MR sequences. The use of the EPG calculus enables a high computational efficiency for the quantitation of echo intensities even for complex sequences with multiple refocusing pulses with arbitrary flip angles. In this work, the EPG concept dealing with RF pulses with arbitrary flip angles and phases is extended to account for anisotropic diffusion in the presence of arbitrary varying gradients. The diffusion effect can be expressed by specific diffusion weightings of individual magnetization pathways. This can be represented as an action of a linear operator on the magnetization state. The algorithm allows easy integration of diffusion anisotropy effects. The formalism is validated on known examples from literature and used to calculate the effective diffusion weighting in multi-echo sequences with arbitrary refocusing flip angles.

  4. Percolator: Scalable Pattern Discovery in Dynamic Graphs

    Energy Technology Data Exchange (ETDEWEB)

    Choudhury, Sutanay; Purohit, Sumit; Lin, Peng; Wu, Yinghui; Holder, Lawrence B.; Agarwal, Khushbu

    2018-02-06

    We demonstrate Percolator, a distributed system for graph pattern discovery in dynamic graphs. In contrast to conventional mining systems, Percolator advocates efficient pattern mining schemes that (1) support pattern detection with keywords; (2) integrate incremental and parallel pattern mining; and (3) support analytical queries such as trend analysis. The core idea of Percolator is to dynamically decide and verify a small fraction of patterns and their in- stances that must be inspected in response to buffered updates in dynamic graphs, with a total mining cost independent of graph size. We demonstrate a) the feasibility of incremental pattern mining by walking through each component of Percolator, b) the efficiency and scalability of Percolator over the sheer size of real-world dynamic graphs, and c) how the user-friendly GUI of Percolator inter- acts with users to support keyword-based queries that detect, browse and inspect trending patterns. We also demonstrate two user cases of Percolator, in social media trend analysis and academic collaboration analysis, respectively.

  5. AN EFFECTIVE RECOMMENDATIONS BY DIFFUSION ALGORITHM FOR WEB GRAPH MINING

    Directory of Open Access Journals (Sweden)

    S. Vasukipriya

    2013-04-01

    Full Text Available The information on the World Wide Web grows in an explosive rate. Societies are relying more on the Web for their miscellaneous needs of information. Recommendation systems are active information filtering systems that attempt to present the information items like movies, music, images, books recommendations, tags recommendations, query suggestions, etc., to the users. Various kinds of data bases are used for the recommendations; fundamentally these data bases can be molded in the form of many types of graphs. Aiming at provided that a general framework on effective DR (Recommendations by Diffusion algorithm for web graphs mining. First introduce a novel graph diffusion model based on heat diffusion. This method can be applied to both undirected graphs and directed graphs. Then it shows how to convert different Web data sources into correct graphs in our models.

  6. Diffusion-based recommendation with trust relations on tripartite graphs

    Science.gov (United States)

    Wang, Ximeng; Liu, Yun; Zhang, Guangquan; Xiong, Fei; Lu, Jie

    2017-08-01

    The diffusion-based recommendation approach is a vital branch in recommender systems, which successfully applies physical dynamics to make recommendations for users on bipartite or tripartite graphs. Trust links indicate users’ social relations and can provide the benefit of reducing data sparsity. However, traditional diffusion-based algorithms only consider rating links when making recommendations. In this paper, the complementarity of users’ implicit and explicit trust is exploited, and a novel resource-allocation strategy is proposed, which integrates these two kinds of trust relations on tripartite graphs. Through empirical studies on three benchmark datasets, our proposed method obtains better performance than most of the benchmark algorithms in terms of accuracy, diversity and novelty. According to the experimental results, our method is an effective and reasonable way to integrate additional features into the diffusion-based recommendation approach.

  7. Random Walks and Diffusions on Graphs and Databases An Introduction

    CERN Document Server

    Blanchard, Philippe

    2011-01-01

    Most networks and databases that humans have to deal with contain large, albeit finite number of units. Their structure, for maintaining functional consistency of the components, is essentially not random and calls for a precise quantitative description of relations between nodes (or data units) and all network components. This book is an introduction, for both graduate students and newcomers to the field, to the theory of graphs and random walks on such graphs. The methods based on random walks and diffusions for exploring the structure of finite connected graphs and databases are reviewed (Markov chain analysis). This provides the necessary basis for consistently discussing a number of applications such diverse as electric resistance networks, estimation of land prices, urban planning, linguistic databases, music, and gene expression regulatory networks.

  8. A direct mining approach to efficient constrained graph pattern discovery

    DEFF Research Database (Denmark)

    Zhu, Feida; Zhang, Zequn; Qu, Qiang

    2013-01-01

    Despite the wealth of research on frequent graph pattern mining, how to efficiently mine the complete set of those with constraints still poses a huge challenge to the existing algorithms mainly due to the inherent bottleneck in the mining paradigm. In essence, mining requests with explicitly-spe...

  9. Quick Mining of Isomorphic Exact Large Patterns from Large Graphs

    KAUST Repository

    Almasri, Islam

    2014-12-01

    The applications of the sub graph isomorphism search are growing with the growing number of areas that model their systems using graphs or networks. Specifically, many biological systems, such as protein interaction networks, molecular structures and protein contact maps, are modeled as graphs. The sub graph isomorphism search is concerned with finding all sub graphs that are isomorphic to a relevant query graph, the existence of such sub graphs can reflect on the characteristics of the modeled system. The most computationally expensive step in the search for isomorphic sub graphs is the backtracking algorithm that traverses the nodes of the target graph. In this paper, we propose a pruning approach that is inspired by the minimum remaining value heuristic that achieves greater scalability over large query and target graphs. Our testing on various biological networks shows that performance enhancement of our approach over existing state-of-the-art approaches varies between 6x and 53x. © 2014 IEEE.

  10. Quick Mining of Isomorphic Exact Large Patterns from Large Graphs

    KAUST Repository

    Almasri, Islam; Gao, Xin; Fedoroff, Nina V.

    2014-01-01

    The applications of the sub graph isomorphism search are growing with the growing number of areas that model their systems using graphs or networks. Specifically, many biological systems, such as protein interaction networks, molecular structures and protein contact maps, are modeled as graphs. The sub graph isomorphism search is concerned with finding all sub graphs that are isomorphic to a relevant query graph, the existence of such sub graphs can reflect on the characteristics of the modeled system. The most computationally expensive step in the search for isomorphic sub graphs is the backtracking algorithm that traverses the nodes of the target graph. In this paper, we propose a pruning approach that is inspired by the minimum remaining value heuristic that achieves greater scalability over large query and target graphs. Our testing on various biological networks shows that performance enhancement of our approach over existing state-of-the-art approaches varies between 6x and 53x. © 2014 IEEE.

  11. Support vector machine classification of Major Depressive Disorder using diffusion-weighted neuroimaging and graph theory

    Directory of Open Access Journals (Sweden)

    Matthew D Sacchet

    2015-02-01

    Full Text Available Recently there has been considerable interest in understanding brain networks in Major Depressive Disorder (MDD. Neural pathways can be tracked in the living brain using diffusion weighted imaging (DWI; graph theory can then be used to study properties of the resulting fiber networks. To date, global abnormalities have not been reported in tractography-based graph metrics in MDD, so we used a machine learning approach based on ‘support vector machines’ to differentiate depressed from healthy individuals based on multiple brain network properties. We also assessed how important specific graph metrics were for this differentiation. Finally, we conducted a local graph analysis to identify abnormal connectivity at specific nodes of the network. We were able to classify depression using whole-brain graph metrics. Small-worldness was the most useful graph metric for classification. The right pars orbitalis, right inferior parietal cortex, and left rostral anterior cingulate all showed abnormal network connectivity in MDD. This is the first use of structural global graph metrics to classify depressed individuals. These findings highlight the importance of future research to understand network properties in depression across imaging modalities, improve classification results, and relate network alterations to psychiatric symptoms, medication, and co-morbidities.

  12. Support vector machine classification of major depressive disorder using diffusion-weighted neuroimaging and graph theory.

    Science.gov (United States)

    Sacchet, Matthew D; Prasad, Gautam; Foland-Ross, Lara C; Thompson, Paul M; Gotlib, Ian H

    2015-01-01

    Recently, there has been considerable interest in understanding brain networks in major depressive disorder (MDD). Neural pathways can be tracked in the living brain using diffusion-weighted imaging (DWI); graph theory can then be used to study properties of the resulting fiber networks. To date, global abnormalities have not been reported in tractography-based graph metrics in MDD, so we used a machine learning approach based on "support vector machines" to differentiate depressed from healthy individuals based on multiple brain network properties. We also assessed how important specific graph metrics were for this differentiation. Finally, we conducted a local graph analysis to identify abnormal connectivity at specific nodes of the network. We were able to classify depression using whole-brain graph metrics. Small-worldness was the most useful graph metric for classification. The right pars orbitalis, right inferior parietal cortex, and left rostral anterior cingulate all showed abnormal network connectivity in MDD. This is the first use of structural global graph metrics to classify depressed individuals. These findings highlight the importance of future research to understand network properties in depression across imaging modalities, improve classification results, and relate network alterations to psychiatric symptoms, medication, and comorbidities.

  13. Application of probabilistically weighted graphs to image-based diagnosis of Alzheimer's disease using diffusion MRI

    Science.gov (United States)

    Maryam, Syeda; McCrackin, Laura; Crowley, Mark; Rathi, Yogesh; Michailovich, Oleg

    2017-03-01

    The world's aging population has given rise to an increasing awareness towards neurodegenerative disorders, including Alzheimers Disease (AD). Treatment options for AD are currently limited, but it is believed that future success depends on our ability to detect the onset of the disease in its early stages. The most frequently used tools for this include neuropsychological assessments, along with genetic, proteomic, and image-based diagnosis. Recently, the applicability of Diffusion Magnetic Resonance Imaging (dMRI) analysis for early diagnosis of AD has also been reported. The sensitivity of dMRI to the microstructural organization of cerebral tissue makes it particularly well-suited to detecting changes which are known to occur in the early stages of AD. Existing dMRI approaches can be divided into two broad categories: region-based and tract-based. In this work, we propose a new approach, which extends region-based approaches to the simultaneous characterization of multiple brain regions. Given a predefined set of features derived from dMRI data, we compute the probabilistic distances between different brain regions and treat the resulting connectivity pattern as an undirected, fully-connected graph. The characteristics of this graph are then used as markers to discriminate between AD subjects and normal controls (NC). Although in this preliminary work we omit subjects in the prodromal stage of AD, mild cognitive impairment (MCI), our method demonstrates perfect separability between AD and NC subject groups with substantial margin, and thus holds promise for fine-grained stratification of NC, MCI and AD populations.

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

  15. GraMi: Generalized Frequent Pattern Mining in a Single Large Graph

    KAUST Repository

    Saeedy, Mohammed El

    2011-11-01

    Mining frequent subgraphs is an important operation on graphs. Most existing work assumes a database of many small graphs, but modern applications, such as social networks, citation graphs or protein-protein interaction in bioinformatics, are modeled as a single large graph. Interesting interactions in such applications may be transitive (e.g., friend of a friend). Existing methods, however, search for frequent isomorphic (i.e., exact match) subgraphs and cannot discover many useful patterns. In this paper the authors propose GRAMI, a framework that generalizes frequent subgraph mining in a large single graph. GRAMI discovers frequent patterns. A pattern is a graph where edges are generalized to distance-constrained paths. Depending on the definition of the distance function, many instantiations of the framework are possible. Both directed and undirected graphs, as well as multiple labels per vertex, are supported. The authors developed an efficient implementation of the framework that models the frequency resolution phase as a constraint satisfaction problem, in order to avoid the costly enumeration of all instances of each pattern in the graph. The authors also implemented CGRAMI, a version that supports structural and semantic constraints; and AGRAMI, an approximate version that supports very large graphs. The experiments on real data demonstrate that the authors framework is up to 3 orders of magnitude faster and discovers more interesting patterns than existing approaches.

  16. Airflow Pattern Genereated by Three Air Diffusers

    DEFF Research Database (Denmark)

    Olmedo, Inés; Nielsen, Peter V.; de Adana, Manuel Ruiz

    The correct description of air diffusers plays a crucial role in the CFD predictions of the airflow pattern into a room. The numerical simulation of air distribution in an indoor space is challenging because of the complicated airflow pattern generated. An experimental study has been carried out...... in a full scale test room, 4.10 m (length), 3.20 m (width), and 2.70 m (height), in order to take velocity measurements of the airflow pattern generated by three different air diffusers: displacement, mixing and a low impulse diffuser. Smoke visualization has been developed to determine the direction...

  17. Airflow Pattern Generated by Three Air Diffusers

    DEFF Research Database (Denmark)

    Olmedo, Inés; Nielsen, Peter V.; Ruiz de Adana, Manuel

    2011-01-01

    The correct description of air diffusers plays a crucial role in the CFD predictions of the airflow pattern into a room. The numerical simulation of air distribution in an indoor space is challenging because of the complicated airflow pattern generated. Many authors have developed simplified geom...

  18. GraMi: Generalized Frequent Pattern Mining in a Single Large Graph

    KAUST Repository

    Saeedy, Mohammed El; Kalnis, Panos

    2011-01-01

    resolution phase as a constraint satisfaction problem, in order to avoid the costly enumeration of all instances of each pattern in the graph. The authors also implemented CGRAMI, a version that supports structural and semantic constraints; and AGRAMI

  19. Maximum-entropy networks pattern detection, network reconstruction and graph combinatorics

    CERN Document Server

    Squartini, Tiziano

    2017-01-01

    This book is an introduction to maximum-entropy models of random graphs with given topological properties and their applications. Its original contribution is the reformulation of many seemingly different problems in the study of both real networks and graph theory within the unified framework of maximum entropy. Particular emphasis is put on the detection of structural patterns in real networks, on the reconstruction of the properties of networks from partial information, and on the enumeration and sampling of graphs with given properties.  After a first introductory chapter explaining the motivation, focus, aim and message of the book, chapter 2 introduces the formal construction of maximum-entropy ensembles of graphs with local topological constraints. Chapter 3 focuses on the problem of pattern detection in real networks and provides a powerful way to disentangle nontrivial higher-order structural features from those that can be traced back to simpler local constraints. Chapter 4 focuses on the problem o...

  20. GRAMI: Frequent subgraph and pattern mining in a single large graph

    KAUST Repository

    Elseidy, M.

    2014-01-01

    Mining frequent subgraphs is an important operation on graphs; it is defined as finding all subgraphs that appear frequently in a database according to a given frequency threshold. Most existing work assumes a database of many small graphs, but modern applications, such as social networks, citation graphs, or proteinprotein interactions in bioinformatics, are modeled as a single large graph. In this paper we present GRAMI, a novel framework for frequent subgraph mining in a single large graph. GRAMI undertakes a novel approach that only finds the minimal set of instances to satisfy the frequency threshold and avoids the costly enumeration of all instances required by previous approaches. We accompany our approach with a heuristic and optimizations that significantly improve performance. Additionally, we present an extension of GRAMI that mines frequent patterns. Compared to subgraphs, patterns offer a more powerful version of matching that captures transitive interactions between graph nodes (like friend of a friend) which are very common in modern applications. Finally, we present CGRAMI, a version supporting structural and semantic constraints, and AGRAMI, an approximate version producing results with no false positives. Our experiments on real data demonstrate that our framework is up to 2 orders of magnitude faster and discovers more interesting patterns than existing approaches. 2014 VLDB Endowment.

  1. Ensemble Classification of Alzheimer's Disease and Mild Cognitive Impairment Based on Complex Graph Measures from Diffusion Tensor Images

    Science.gov (United States)

    Ebadi, Ashkan; Dalboni da Rocha, Josué L.; Nagaraju, Dushyanth B.; Tovar-Moll, Fernanda; Bramati, Ivanei; Coutinho, Gabriel; Sitaram, Ranganatha; Rashidi, Parisa

    2017-01-01

    The human brain is a complex network of interacting regions. The gray matter regions of brain are interconnected by white matter tracts, together forming one integrative complex network. In this article, we report our investigation about the potential of applying brain connectivity patterns as an aid in diagnosing Alzheimer's disease and Mild Cognitive Impairment (MCI). We performed pattern analysis of graph theoretical measures derived from Diffusion Tensor Imaging (DTI) data representing structural brain networks of 45 subjects, consisting of 15 patients of Alzheimer's disease (AD), 15 patients of MCI, and 15 healthy subjects (CT). We considered pair-wise class combinations of subjects, defining three separate classification tasks, i.e., AD-CT, AD-MCI, and CT-MCI, and used an ensemble classification module to perform the classification tasks. Our ensemble framework with feature selection shows a promising performance with classification accuracy of 83.3% for AD vs. MCI, 80% for AD vs. CT, and 70% for MCI vs. CT. Moreover, our findings suggest that AD can be related to graph measures abnormalities at Brodmann areas in the sensorimotor cortex and piriform cortex. In this way, node redundancy coefficient and load centrality in the primary motor cortex were recognized as good indicators of AD in contrast to MCI. In general, load centrality, betweenness centrality, and closeness centrality were found to be the most relevant network measures, as they were the top identified features at different nodes. The present study can be regarded as a “proof of concept” about a procedure for the classification of MRI markers between AD dementia, MCI, and normal old individuals, due to the small and not well-defined groups of AD and MCI patients. Future studies with larger samples of subjects and more sophisticated patient exclusion criteria are necessary toward the development of a more precise technique for clinical diagnosis. PMID:28293162

  2. Evaluating structural pattern recognition for handwritten math via primitive label graphs

    Science.gov (United States)

    Zanibbi, Richard; Mouchère, Harold; Viard-Gaudin, Christian

    2013-01-01

    Currently, structural pattern recognizer evaluations compare graphs of detected structure to target structures (i.e. ground truth) using recognition rates, recall and precision for object segmentation, classification and relationships. In document recognition, these target objects (e.g. symbols) are frequently comprised of multiple primitives (e.g. connected components, or strokes for online handwritten data), but current metrics do not characterize errors at the primitive level, from which object-level structure is obtained. Primitive label graphs are directed graphs defined over primitives and primitive pairs. We define new metrics obtained by Hamming distances over label graphs, which allow classification, segmentation and parsing errors to be characterized separately, or using a single measure. Recall and precision for detected objects may also be computed directly from label graphs. We illustrate the new metrics by comparing a new primitive-level evaluation to the symbol-level evaluation performed for the CROHME 2012 handwritten math recognition competition. A Python-based set of utilities for evaluating, visualizing and translating label graphs is publicly available.

  3. Diffusion

    International Nuclear Information System (INIS)

    Kubaschewski, O.

    1983-01-01

    The diffusion rate values of titanium, its compounds and alloys are summarized and tabulated. The individual chemical diffusion coefficients and self-diffusion coefficients of certain isotopes are given. Experimental methods are listed which were used for the determination of diffusion coefficients. Some values have been taken over from other studies. Also given are graphs showing the temperature dependences of diffusion and changes in the diffusion coefficient with concentration changes

  4. REGULAR PATTERN MINING (WITH JITTER ON WEIGHTED-DIRECTED DYNAMIC GRAPHS

    Directory of Open Access Journals (Sweden)

    A. GUPTA

    2017-02-01

    Full Text Available Real world graphs are mostly dynamic in nature, exhibiting time-varying behaviour in structure of the graph, weight on the edges and direction of the edges. Mining regular patterns in the occurrence of edge parameters gives an insight into the consumer trends over time in ecommerce co-purchasing networks. But such patterns need not necessarily be precise as in the case when some product goes out of stock or a group of customers becomes unavailable for a short period of time. Ignoring them may lead to loss of useful information and thus taking jitter into account becomes vital. To the best of our knowledge, no work has been yet reported to extract regular patterns considering a jitter of length greater than unity. In this article, we propose a novel method to find quasi regular patterns on weight and direction sequences of such graphs. The method involves analysing the dynamic network considering the inconsistencies in the occurrence of edges. It utilizes the relation between the occurrence sequence and the corresponding weight and direction sequences to speed up this process. Further, these patterns are used to determine the most central nodes (such as the most profit yielding products. To accomplish this we introduce the concept of dynamic closeness centrality and dynamic betweenness centrality. Experiments on Enron e-mail dataset and a synthetic dynamic network show that the presented approach is efficient, so it can be used to find patterns in large scale networks consisting of many timestamps.

  5. Leveraging tagging and rating for recommendation: RMF meets weighted diffusion on tripartite graphs

    Science.gov (United States)

    Li, Jianguo; Tang, Yong; Chen, Jiemin

    2017-10-01

    Recommender systems (RSs) have been a widely exploited approach to solving the information overload problem. However, the performance is still limited due to the extreme sparsity of the rating data. With the popularity of Web 2.0, the social tagging system provides more external information to improve recommendation accuracy. Although some existing approaches combine the matrix factorization models with the tag co-occurrence and context of tags, they neglect the issue of tag sparsity that would also result in inaccurate recommendations. Consequently, in this paper, we propose a novel hybrid collaborative filtering model named WUDiff_RMF, which improves regularized matrix factorization (RMF) model by integrating Weighted User-Diffusion-based CF algorithm(WUDiff) that obtains the information of similar users from the weighted tripartite user-item-tag graph. This model aims to capture the degree correlation of the user-item-tag tripartite network to enhance the performance of recommendation. Experiments conducted on four real-world datasets demonstrate that our approach significantly performs better than already widely used methods in the accuracy of recommendation. Moreover, results show that WUDiff_RMF can alleviate the data sparsity, especially in the circumstance that users have made few ratings and few tags.

  6. Automatic micropropagation of plants--the vision-system: graph rewriting as pattern recognition

    Science.gov (United States)

    Schwanke, Joerg; Megnet, Roland; Jensch, Peter F.

    1993-03-01

    The automation of plant-micropropagation is necessary to produce high amounts of biomass. Plants have to be dissected on particular cutting-points. A vision-system is needed for the recognition of the cutting-points on the plants. With this background, this contribution is directed to the underlying formalism to determine cutting-points on abstract-plant models. We show the usefulness of pattern recognition by graph-rewriting along with some examples in this context.

  7. Turing Patterns in a Reaction-Diffusion System

    International Nuclear Information System (INIS)

    Wu Yanning; Wang Pingjian; Hou Chunju; Liu Changsong; Zhu Zhengang

    2006-01-01

    We have further investigated Turing patterns in a reaction-diffusion system by theoretical analysis and numerical simulations. Simple Turing patterns and complex superlattice structures are observed. We find that the shape and type of Turing patterns depend on dynamical parameters and external periodic forcing, and is independent of effective diffusivity rate σ in the Lengyel-Epstein model. Our numerical results provide additional insight into understanding the mechanism of development of Turing patterns and predicting new pattern formations.

  8. A hierarchical graph neuron scheme for real-time pattern recognition.

    Science.gov (United States)

    Nasution, B B; Khan, A I

    2008-02-01

    The hierarchical graph neuron (HGN) implements a single cycle memorization and recall operation through a novel algorithmic design. The HGN is an improvement on the already published original graph neuron (GN) algorithm. In this improved approach, it recognizes incomplete/noisy patterns. It also resolves the crosstalk problem, which is identified in the previous publications, within closely matched patterns. To accomplish this, the HGN links multiple GN networks for filtering noise and crosstalk out of pattern data inputs. Intrinsically, the HGN is a lightweight in-network processing algorithm which does not require expensive floating point computations; hence, it is very suitable for real-time applications and tiny devices such as the wireless sensor networks. This paper describes that the HGN's pattern matching capability and the small response time remain insensitive to the increases in the number of stored patterns. Moreover, the HGN does not require definition of rules or setting of thresholds by the operator to achieve the desired results nor does it require heuristics entailing iterative operations for memorization and recall of patterns.

  9. EEG analysis of seizure patterns using visibility graphs for detection of generalized seizures.

    Science.gov (United States)

    Wang, Lei; Long, Xi; Arends, Johan B A M; Aarts, Ronald M

    2017-10-01

    The traditional EEG features in the time and frequency domain show limited seizure detection performance in the epileptic population with intellectual disability (ID). In addition, the influence of EEG seizure patterns on detection performance was less studied. A single-channel EEG signal can be mapped into visibility graphs (VGS), including basic visibility graph (VG), horizontal VG (HVG), and difference VG (DVG). These graphs were used to characterize different EEG seizure patterns. To demonstrate its effectiveness in identifying EEG seizure patterns and detecting generalized seizures, EEG recordings of 615h on one EEG channel from 29 epileptic patients with ID were analyzed. A novel feature set with discriminative power for seizure detection was obtained by using the VGS method. The degree distributions (DDs) of DVG can clearly distinguish EEG of each seizure pattern. The degree entropy and power-law degree power in DVG were proposed here for the first time, and they show significant difference between seizure and non-seizure EEG. The connecting structure measured by HVG can better distinguish seizure EEG from background than those by VG and DVG. A traditional EEG feature set based on frequency analysis was used here as a benchmark feature set. With a support vector machine (SVM) classifier, the seizure detection performance of the benchmark feature set (sensitivity of 24%, FD t /h of 1.8s) can be improved by combining our proposed VGS features extracted from one EEG channel (sensitivity of 38%, FD t /h of 1.4s). The proposed VGS-based features can help improve seizure detection for ID patients. Copyright © 2017 Elsevier B.V. All rights reserved.

  10. Pattern analysis of directed graphs using DEDICOM: an application to Enron email.

    Energy Technology Data Exchange (ETDEWEB)

    Bader, Brett William; Harshman, Richard A. (University of Western Ontario London, Ontario, Canada); Kolda, Tamara Gibson (Sandia National Labs, Livermore, CA)

    2006-12-01

    DEDICOM is a linear algebra model for analyzing intrinsically asymmetric relationships, such as trade among nations or the exchange of emails among individuals. DEDICOM decomposes a complex pattern of observed relations among objects into a sum of simpler patterns of inferred relations among latent components of the objects. Three-way DEDICOM is a higher-order extension of the model that incorporates a third mode of the data, such as time, giving it stronger uniqueness properties and consequently enhancing interpretability of solutions. In this paper, we present algorithms for computing these decompositions on large, sparse data as well as a variant for computing an asymmetric nonnegative factorization. When we apply these techniques to adjacency arrays arising from directed graphs with edges labeled by time, we obtain a smaller graph on latent semantic dimensions and gain additional information about their changing relationships over time. We demonstrate these techniques on the Enron email corpus to learn about the social networks and their transient behavior. The mixture of roles assigned to individuals by DEDICOM showed strong correspondence with known job classifications and revealed the patterns of communication between these roles. Changes in the communication pattern over time, e.g., between top executives and the legal department, were also apparent in the solutions.

  11. Recognition of building group patterns in topographic maps based on graph partitioning and random forest

    Science.gov (United States)

    He, Xianjin; Zhang, Xinchang; Xin, Qinchuan

    2018-02-01

    Recognition of building group patterns (i.e., the arrangement and form exhibited by a collection of buildings at a given mapping scale) is important to the understanding and modeling of geographic space and is hence essential to a wide range of downstream applications such as map generalization. Most of the existing methods develop rigid rules based on the topographic relationships between building pairs to identify building group patterns and thus their applications are often limited. This study proposes a method to identify a variety of building group patterns that allow for map generalization. The method first identifies building group patterns from potential building clusters based on a machine-learning algorithm and further partitions the building clusters with no recognized patterns based on the graph partitioning method. The proposed method is applied to the datasets of three cities that are representative of the complex urban environment in Southern China. Assessment of the results based on the reference data suggests that the proposed method is able to recognize both regular (e.g., the collinear, curvilinear, and rectangular patterns) and irregular (e.g., the L-shaped, H-shaped, and high-density patterns) building group patterns well, given that the correctness values are consistently nearly 90% and the completeness values are all above 91% for three study areas. The proposed method shows promises in automated recognition of building group patterns that allows for map generalization.

  12. Fringe pattern denoising using coherence-enhancing diffusion.

    Science.gov (United States)

    Wang, Haixia; Kemao, Qian; Gao, Wenjing; Lin, Feng; Seah, Hock Soon

    2009-04-15

    Electronic speckle pattern interferometry is one of the methods measuring the displacement on object surfaces in which fringe patterns need to be evaluated. Noise is one of the key problems affecting further processing and reducing measurement quality. We propose an application of coherence-enhancing diffusion to fringe-pattern denoising. It smoothes a fringe pattern along directions both parallel and perpendicular to fringe orientation with suitable diffusion speeds to more effectively reduce noise and improve fringe-pattern quality. It is a generalized work of Tang's et al.'s [Opt. Lett.33, 2179 (2008)] model that only smoothes a fringe pattern along fringe orientation. Since our model diffuses a fringe pattern with an additional direction, it is able to denoise low-density fringes as well as improve denoising effectiveness for high-density fringes. Theoretical analysis as well as simulation and experimental verifications are addressed.

  13. Pattern formation in reaction diffusion systems with finite geometry

    International Nuclear Information System (INIS)

    Borzi, C.; Wio, H.

    1990-04-01

    We analyze the one-component, one-dimensional, reaction-diffusion equation through a simple inverse method. We confine the system and fix the boundary conditions as to induce pattern formation. We analyze the stability of those patterns. Our goal is to get information about the reaction term out of the preknowledgment of the pattern. (author). 5 refs

  14. Generalised power graph compression reveals dominant relationship patterns in complex networks.

    Science.gov (United States)

    Ahnert, Sebastian E

    2014-03-25

    We introduce a framework for the discovery of dominant relationship patterns in complex networks, by compressing the networks into power graphs with overlapping power nodes. When paired with enrichment analysis of node classification terms, the most compressible sets of edges provide a highly informative sketch of the dominant relationship patterns that define the network. In addition, this procedure also gives rise to a novel, link-based definition of overlapping node communities in which nodes are defined by their relationships with sets of other nodes, rather than through connections within the community. We show that this completely general approach can be applied to undirected, directed, and bipartite networks, yielding valuable insights into the large-scale structure of real-world networks, including social networks and food webs. Our approach therefore provides a novel way in which network architecture can be studied, defined and classified.

  15. Predicting patterns of glioma recurrence using diffusion tensor imaging

    International Nuclear Information System (INIS)

    Price, Stephen J.; Pickard, John D.; Jena, Rajesh; Burnet, Neil G.; Carpenter, T.A.; Gillard, Jonathan H.

    2007-01-01

    Although multimodality therapy for high-grade gliomas is making some improvement in outcome, most patients will still die from their disease within a short time. We need tools that allow treatments to be tailored to an individual. In this study we used diffusion tensor imaging (DTI), a technique sensitive to subtle disruption of white-matter tracts due to tumour infiltration, to see if it can be used to predict patterns of glioma recurrence. In this study we imaged 26 patients with gliomas using DTI. Patients were imaged after 2 years or on symptomatic tumour recurrence. The diffusion tensor was split into its isotropic (p) and anisotropic (q) components, and these were plotted on T 2 -weighted images to show the pattern of DTI abnormality. This was compared to the pattern of recurrence. Three DTI patterns could be identified: (a) a diffuse pattern of abnormality where p exceeded q in all directions and was associated with diffuse increase in tumour size; (b) a localised pattern of abnormality where the tumour recurred in one particular direction; and (c) a pattern of minimal abnormality seen in some patients with or without evidence of recurrence. Diffusion tensor imaging is able to predict patterns of tumour recurrence and may allow better individualisation of tumour management and stratification for randomised controlled trials. (orig.)

  16. Predicting patterns of glioma recurrence using diffusion tensor imaging

    Energy Technology Data Exchange (ETDEWEB)

    Price, Stephen J.; Pickard, John D. [University of Cambridge and Cambridge University Hospitals NHS Foundation Trust, Addenbrooke' s Hospital, Academic Neurosurgery Unit (United Kingdom); University of Cambridge and Cambridge University Hospitals NHS Foundation Trust, Addenbrooke' s Hospital, Wolfson Brain Imaging Centre, Department of Clinical Neurosciences (United Kingdom); Jena, Rajesh; Burnet, Neil G. [University of Cambridge and Cambridge University Hospitals NHS Foundation Trust, Addenbrooke' s Hospital, University Department of Oncology (United Kingdom); Carpenter, T.A. [University of Cambridge and Cambridge University Hospitals NHS Foundation Trust, Addenbrooke' s Hospital, Wolfson Brain Imaging Centre, Department of Clinical Neurosciences (United Kingdom); Gillard, Jonathan H. [University of Cambridge and Cambridge University Hospitals NHS Foundation Trust, Addenbrooke' s Hospital, University Department of Radiology (United Kingdom)

    2007-07-15

    Although multimodality therapy for high-grade gliomas is making some improvement in outcome, most patients will still die from their disease within a short time. We need tools that allow treatments to be tailored to an individual. In this study we used diffusion tensor imaging (DTI), a technique sensitive to subtle disruption of white-matter tracts due to tumour infiltration, to see if it can be used to predict patterns of glioma recurrence. In this study we imaged 26 patients with gliomas using DTI. Patients were imaged after 2 years or on symptomatic tumour recurrence. The diffusion tensor was split into its isotropic (p) and anisotropic (q) components, and these were plotted on T{sub 2}-weighted images to show the pattern of DTI abnormality. This was compared to the pattern of recurrence. Three DTI patterns could be identified: (a) a diffuse pattern of abnormality where p exceeded q in all directions and was associated with diffuse increase in tumour size; (b) a localised pattern of abnormality where the tumour recurred in one particular direction; and (c) a pattern of minimal abnormality seen in some patients with or without evidence of recurrence. Diffusion tensor imaging is able to predict patterns of tumour recurrence and may allow better individualisation of tumour management and stratification for randomised controlled trials. (orig.)

  17. A Selectivity based approach to Continuous Pattern Detection in Streaming Graphs

    Energy Technology Data Exchange (ETDEWEB)

    Choudhury, Sutanay; Holder, Larry; Chin, George; Agarwal, Khushbu; Feo, John T.

    2015-05-27

    Cyber security is one of the most significant technical challenges in current times. Detecting adversarial activities, prevention of theft of intellectual properties and customer data is a high priority for corporations and government agencies around the world. Cyber defenders need to analyze massive-scale, high-resolution network flows to identify, categorize, and mitigate attacks involving networks spanning institutional and national boundaries. Many of the cyber attacks can be described as subgraph patterns, with prominent examples being insider infiltrations (path queries), denial of service (parallel paths) and malicious spreads (tree queries). This motivates us to explore subgraph matching on streaming graphs in a continuous setting. The novelty of our work lies in using the subgraph distributional statistics collected from the streaming graph to determine the query processing strategy. We introduce a ``Lazy Search" algorithm where the search strategy is decided on a vertex-to-vertex basis depending on the likelihood of a match in the vertex neighborhood. We also propose a metric named ``Relative Selectivity" that is used to select between different query processing strategies. Our experiments performed on real online news, network traffic stream and a synthetic social network benchmark demonstrate 10-100x speedups over non-incremental, selectivity agnostic approaches.

  18. GRAMI: Frequent subgraph and pattern mining in a single large graph

    KAUST Repository

    Elseidy, M.; Abdelhamid, Ehab; Skiadopoulos, S.; Kalnis, Panos

    2014-01-01

    Mining frequent subgraphs is an important operation on graphs; it is defined as finding all subgraphs that appear frequently in a database according to a given frequency threshold. Most existing work assumes a database of many small graphs

  19. Pattern dynamics of the reaction-diffusion immune system.

    Science.gov (United States)

    Zheng, Qianqian; Shen, Jianwei; Wang, Zhijie

    2018-01-01

    In this paper, we will investigate the effect of diffusion, which is ubiquitous in nature, on the immune system using a reaction-diffusion model in order to understand the dynamical behavior of complex patterns and control the dynamics of different patterns. Through control theory and linear stability analysis of local equilibrium, we obtain the optimal condition under which the system loses stability and a Turing pattern occurs. By combining mathematical analysis and numerical simulation, we show the possible patterns and how these patterns evolve. In addition, we establish a bridge between the complex patterns and the biological mechanism using the results from a previous study in Nature Cell Biology. The results in this paper can help us better understand the biological significance of the immune system.

  20. Turing and Non-Turing patterns in diffusive plankton model

    Directory of Open Access Journals (Sweden)

    N. K. Thakur

    2015-03-01

    Full Text Available In this paper, we investigate a Rosenzweig-McAurthur model and its variant for phytoplankton, zooplankton and fish population dynamics with Holling type II and III functional responses. We present the theoretical analysis of processes of pattern formation that involves organism distribution and their interaction of spatially distributed population with local diffusion. The choice of parameter values is important to study the effect of diffusion, also it depends more on the nonlinearity of the system. With the help of numerical simulations, we observe the formation of spatiotemporal patterns both inside and outside the Turing space.

  1. Strategy and pattern recognition in expert\\ud comprehension of 2 × 2 interaction graphs

    OpenAIRE

    Peebles, David

    2013-01-01

    I present a model of expert comprehension performance for 2 × 2 "interaction" graphs typically used to present data from two-way factorial research designs. Developed using the ACT-R cognitive architecture, the model simulates the cognitive and perceptual operations involved in interpreting interaction graphs and provides a detailed characterisation of the information\\ud extracted from the diagram, the prior knowledge required to interpret interaction graphs, and the knowledge generated durin...

  2. LPaMI: A Graph-Based Lifestyle Pattern Mining Application Using Personal Image Collections in Smartphones

    Directory of Open Access Journals (Sweden)

    Kifayat Ullah Khan

    2017-11-01

    Full Text Available Normally, individuals use smartphones for a variety of purposes like photography, schedule planning, playing games, and so on, apart from benefiting from the core tasks of call-making and short messaging. These services are sources of personal data generation. Therefore, any application that utilises personal data of a user from his/her smartphone is truly a great witness of his/her interests and this information can be used for various personalised services. In this paper, we present Lifestyle Pattern MIning (LPaMI, which is a personalised application for mining the lifestyle patterns of a smartphone user. LPaMI uses the personal photograph collections of a user, which reflect the day-to-day photos taken by a smartphone, to recognise scenes (called objects of interest in our work. These are then mined to discover lifestyle patterns. The uniqueness of LPaMI lies in our graph-based approach to mining the patterns of interest. Modelling of data in the form of graphs is effective in preserving the lifestyle behaviour maintained over the passage of time. Graph-modelled lifestyle data enables us to apply variety of graph mining techniques for pattern discovery. To demonstrate the effectiveness of our proposal, we have developed a prototype system for LPaMI to implement its end-to-end pipeline. We have also conducted an extensive evaluation for various phases of LPaMI using different real-world datasets. We understand that the output of LPaMI can be utilised for variety of pattern discovery application areas like trip and food recommendations, shopping, and so on.

  3. Rethinking pattern formation in reaction-diffusion systems

    Science.gov (United States)

    Halatek, J.; Frey, E.

    2018-05-01

    The present theoretical framework for the analysis of pattern formation in complex systems is mostly limited to the vicinity of fixed (global) equilibria. Here we present a new theoretical approach to characterize dynamical states arbitrarily far from (global) equilibrium. We show that reaction-diffusion systems that are driven by locally mass-conserving interactions can be understood in terms of local equilibria of diffusively coupled compartments. Diffusive coupling generically induces lateral redistribution of the globally conserved quantities, and the variable local amounts of these quantities determine the local equilibria in each compartment. We find that, even far from global equilibrium, the system is well characterized by its moving local equilibria. We apply this framework to in vitro Min protein pattern formation, a paradigmatic model for biological pattern formation. Within our framework we can predict and explain transitions between chemical turbulence and order arbitrarily far from global equilibrium. Our results reveal conceptually new principles of self-organized pattern formation that may well govern diverse dynamical systems.

  4. Pattern formation due to non-linear vortex diffusion

    Science.gov (United States)

    Wijngaarden, Rinke J.; Surdeanu, R.; Huijbregtse, J. M.; Rector, J. H.; Dam, B.; Einfeld, J.; Wördenweber, R.; Griessen, R.

    Penetration of magnetic flux in YBa 2Cu 3O 7 superconducting thin films in an external magnetic field is visualized using a magneto-optic technique. A variety of flux patterns due to non-linear vortex diffusion is observed: (1) Roughening of the flux front with scaling exponents identical to those observed in burning paper including two distinct regimes where respectively spatial disorder and temporal disorder dominate. In the latter regime Kardar-Parisi-Zhang behavior is found. (2) Fractal penetration of flux with Hausdorff dimension depending on the critical current anisotropy. (3) Penetration as ‘flux-rivers’. (4) The occurrence of commensurate and incommensurate channels in films with anti-dots as predicted in numerical simulations by Reichhardt, Olson and Nori. It is shown that most of the observed behavior is related to the non-linear diffusion of vortices by comparison with simulations of the non-linear diffusion equation appropriate for vortices.

  5. Guidelines for the fitting of anomalous diffusion mean square displacement graphs from single particle tracking experiments.

    Directory of Open Access Journals (Sweden)

    Eldad Kepten

    Full Text Available Single particle tracking is an essential tool in the study of complex systems and biophysics and it is commonly analyzed by the time-averaged mean square displacement (MSD of the diffusive trajectories. However, past work has shown that MSDs are susceptible to significant errors and biases, preventing the comparison and assessment of experimental studies. Here, we attempt to extract practical guidelines for the estimation of anomalous time averaged MSDs through the simulation of multiple scenarios with fractional Brownian motion as a representative of a large class of fractional ergodic processes. We extract the precision and accuracy of the fitted MSD for various anomalous exponents and measurement errors with respect to measurement length and maximum time lags. Based on the calculated precision maps, we present guidelines to improve accuracy in single particle studies. Importantly, we find that in some experimental conditions, the time averaged MSD should not be used as an estimator.

  6. Size-dependent diffusion promotes the emergence of spatiotemporal patterns

    DEFF Research Database (Denmark)

    Zhang, Lai; Thygesen, Uffe Høgsbro; Banerjee, Malay

    2014-01-01

    intraspecific physiological variations at the individual level. Here we explore the impacts of size variation within species resulting from individual ontogeny, on the emergence of spatiotemporal patterns in a fully size-structured population model. We found that size dependency of animal's diffusivity greatly......, we found that the single-generation cycle is more likely to drive spatiotemporal patterns compared to predator-prey cycles, meaning that the mechanism of Hopf bifurcation might be more common than hitherto appreciated since the former cycle is more widespread than the latter in case of interacting...

  7. Diffuse scarring alopecia in a female pattern hair loss distribution.

    Science.gov (United States)

    Fergie, Bonnie; Khaira, Gurpreet; Howard, Vicki; de Zwaan, Sally

    2018-02-01

    We describe three cases of hair loss in a female pattern hair loss (FPHL) distribution with histologic features of lichen planopilaris (LPP). All patients had a history of diffuse, gradual hair loss in a Christmas tree pattern that clinically presented as FPHL on gross and dermoscopic examination. Notably, there were no characteristic clinical signs of LPP and no histologic features of FPHL. These cases are most consistent with cicatricial pattern hair loss (CPHL). This relatively new entity is similar to fibrosing alopecia in a pattern distribution (FAPD) in that they are both scarring alopecias confined to a FPHL distribution, but CPHL lacks the clinical signs of perifollicular erythema and perifollicular keratosis seen in FAPD. These three cases may present an early, subtle form of CPHL and will be of interest to clinicians and histopathologists alike. © 2017 The Australasian College of Dermatologists.

  8. Pattern formation in three-dimensional reaction-diffusion systems

    Science.gov (United States)

    Callahan, T. K.; Knobloch, E.

    1999-08-01

    Existing group theoretic analysis of pattern formation in three dimensions [T.K. Callahan, E. Knobloch, Symmetry-breaking bifurcations on cubic lattices, Nonlinearity 10 (1997) 1179-1216] is used to make specific predictions about the formation of three-dimensional patterns in two models of the Turing instability, the Brusselator model and the Lengyel-Epstein model. Spatially periodic patterns having the periodicity of the simple cubic (SC), face-centered cubic (FCC) or body-centered cubic (BCC) lattices are considered. An efficient center manifold reduction is described and used to identify parameter regimes permitting stable lamellæ, SC, FCC, double-diamond, hexagonal prism, BCC and BCCI states. Both models possess a special wavenumber k* at which the normal form coefficients take on fixed model-independent ratios and both are described by identical bifurcation diagrams. This property is generic for two-species chemical reaction-diffusion models with a single activator and inhibitor.

  9. Pattern of diffusion-limited aggregation on nonuniform substrate

    CERN Document Server

    Ouyang Wen Ze; Zou Xian Wu; Jin Zhun Zhi

    2003-01-01

    Pattern of diffusion-limited aggregation (DLA) on nonuniform substrate was investigated by computer simulations. The nonuniform substrates are represented by Leath percolations with the probability p. p stands for the degree of nonuniformity and takes values in the range p sub c<=p<=1, where p sub c is the threshold of percolation. The DLA cluster grows up on the Leath percolation substrate. The patterns of the DLA clusters appear asymmetrical and nonuniform, and the branches are relative few for the case p is close to p sub c. In addition, the pattern depends on the shape of substrate. As p increases from p sub c to 1, cluster changes to pure DLA gradually. Correspondingly, the fractal dimension increases from 1.46 to 1.68. Also, the random walks on Leath percolations through the range p sub c<=p<=1 were examined. Our simulations show the Honda-Toyoki-Matsushita relation is still reasonable for fractional dimensional systems.

  10. Inferring patterns of folktale diffusion using genomic data

    Science.gov (United States)

    Bortolini, Eugenio; Pagani, Luca; Sarno, Stefania; Boattini, Alessio; Sazzini, Marco; da Silva, Sara Graça; Martini, Gessica; Metspalu, Mait; Pettener, Davide; Luiselli, Donata; Tehrani, Jamshid J.

    2017-01-01

    Observable patterns of cultural variation are consistently intertwined with demic movements, cultural diffusion, and adaptation to different ecological contexts [Cavalli-Sforza and Feldman (1981) Cultural Transmission and Evolution: A Quantitative Approach; Boyd and Richerson (1985) Culture and the Evolutionary Process]. The quantitative study of gene–culture coevolution has focused in particular on the mechanisms responsible for change in frequency and attributes of cultural traits, the spread of cultural information through demic and cultural diffusion, and detecting relationships between genetic and cultural lineages. Here, we make use of worldwide whole-genome sequences [Pagani et al. (2016) Nature 538:238–242] to assess the impact of processes involving population movement and replacement on cultural diversity, focusing on the variability observed in folktale traditions (n = 596) [Uther (2004) The Types of International Folktales: A Classification and Bibliography. Based on the System of Antti Aarne and Stith Thompson] in Eurasia. We find that a model of cultural diffusion predicted by isolation-by-distance alone is not sufficient to explain the observed patterns, especially at small spatial scales (up to ∼4,000 km). We also provide an empirical approach to infer presence and impact of ethnolinguistic barriers preventing the unbiased transmission of both genetic and cultural information. After correcting for the effect of ethnolinguistic boundaries, we show that, of the alternative models that we propose, the one entailing cultural diffusion biased by linguistic differences is the most plausible. Additionally, we identify 15 tales that are more likely to be predominantly transmitted through population movement and replacement and locate putative focal areas for a set of tales that are spread worldwide. PMID:28784786

  11. Pattern formation in diffusive excitable systems under magnetic flow effects

    Science.gov (United States)

    Mvogo, Alain; Takembo, Clovis N.; Ekobena Fouda, H. P.; Kofané, Timoléon C.

    2017-07-01

    We study the spatiotemporal formation of patterns in a diffusive FitzHugh-Nagumo network where the effect of electromagnetic induction has been introduced in the standard mathematical model by using magnetic flux, and the modulation of magnetic flux on membrane potential is realized by using memristor coupling. We use the multi-scale expansion to show that the system equations can be reduced to a single differential-difference nonlinear equation. The linear stability analysis is performed and discussed with emphasis on the impact of magnetic flux. It is observed that the effect of memristor coupling importantly modifies the features of modulational instability. Our analytical results are supported by the numerical experiments, which reveal that the improved model can lead to nonlinear quasi-periodic spatiotemporal patterns with some features of synchronization. It is observed also the generation of pulses and rhythmics behaviors like breathing or swimming which are important in brain researches.

  12. Autofluorescence and diffuse reflectance patterns in cervical spectroscopy

    Science.gov (United States)

    Marin, Nena Maribel

    Fluorescence and diffuse reflectance spectroscopy are two new optical technologies, which have shown promise to aid in the real time, non-invasive identification of cancers and precancers. Spectral patterns carry a fingerprint of scattering, absorption and fluorescence properties in tissue. Scattering, absorption and fluorescence in tissue are directly affected by biological features that are diagnostically significant, such as nuclear size, micro-vessel density, volume fraction of collagen fibers, tissue oxygenation and cell metabolism. Thus, analysis of spectral patterns can unlock a wealth of information directly related with the onset and progression of disease. Data from a Phase II clinical trial to assess the technical efficacy of fluorescence and diffuse reflectance spectroscopy acquired from 850 women at three clinical locations with two research grade optical devices is calibrated and analyzed. Tools to process and standardize spectra so that data from multiple spectrometers can be combined and analyzed are presented. Methodologies for calibration and quality assurance of optical systems are established to simplify design issues and ensure validity of data for future clinical trials. Empirically based algorithms, using multivariate statistical approaches are applied to spectra and evaluated as a clinical diagnostic tool. Physically based algorithms, using mathematical models of light propagation in tissue are presented. The presented mathematical model combines a diffusion theory in P3 approximation reflectance model and a 2-layer fluorescence model using exponential attenuation and diffusion theory. The resulting adjoint fluorescence and reflectance model extracts twelve optical properties characterizing fluorescence efficiency of cervical epithelium and stroma fluorophores, stromal hemoglobin and collagen absorption, oxygen saturation, and stromal scattering strength and shape. Validations with Monte Carlo simulations show that adjoint model extracted

  13. Phase-locked patterns of the Kuramoto model on 3-regular graphs

    Science.gov (United States)

    DeVille, Lee; Ermentrout, Bard

    2016-09-01

    We consider the existence of non-synchronized fixed points to the Kuramoto model defined on sparse networks: specifically, networks where each vertex has degree exactly three. We show that "most" such networks support multiple attracting phase-locked solutions that are not synchronized and study the depth and width of the basins of attraction of these phase-locked solutions. We also show that it is common in "large enough" graphs to find phase-locked solutions where one or more of the links have angle difference greater than π/2.

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

  15. Distorted Pattern Recognition and Analysis with the Help of IEf Graph Representation

    Directory of Open Access Journals (Sweden)

    Adam Sedziwy

    2002-01-01

    Full Text Available An algorithm for distorted pattern recognition is presented. lt's generalization of M Flasinski results (Pattern Recognition, 27, 1-16, 1992. A new formalism allows to make both qualitative and quantitive distortion analysis. It also enlarges parser flexibility by extending the set of patterns which may be recognized.

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

  17. Electron diffraction patterns with thermal diffuse scattering maxima around Kikuchi lines

    International Nuclear Information System (INIS)

    Karakhanyan, R. K.; Karakhanyan, K. R.

    2011-01-01

    Transmission electron diffraction patterns of silicon with thermal diffuse maxima around Kikuchi lines, which are analogs of the maxima of thermal diffuse electron scattering around point reflections, have been recorded. Diffuse maxima are observed only around Kikuchi lines with indices that are forbidden for the silicon structure. The diffraction conditions for forming these maxima are discussed.

  18. Graph Theoretical Analysis of Developmental Patterns of the White Matter Network

    Directory of Open Access Journals (Sweden)

    Zhang eChen

    2013-11-01

    Full Text Available Understanding the development of human brain organization is critical for gaining insight into how the enhancement of cognitive processes is related to the fine-tuning of the brain network. However, the developmental trajectory of the large-scale white matter (WM network is not fully understood. Here, using graph theory, we examine developmental changes in the organization of WM networks in 180 typically-developing participants. WM networks were constructed using whole brain tractography and 78 cortical regions of interest were extracted from each participant. The subjects were first divided into 5 equal sample size (n=36 groups (early childhood: 6.0-9.7 years; late childhood: 9.8-12.7 years; adolescence: 12.9-17.5 years; young adult: 17.6-21.8 years; adult: 21.9-29.6 years. Most prominent changes in the topological properties of developing brain networks occur at late childhood and adolescence. During late childhood period, the structural brain network showed significant increase in the global efficiency but decrease in modularity, suggesting a shift of topological organization toward a more randomized configuration. However, while preserving most topological features, there was a significant increase in the local efficiency at adolescence, suggesting the dynamic process of rewiring and rebalancing brain connections at different growth stages. In addition, several pivotal hubs were identified that are vital for the global coordination of information flow over the whole brain network across all age groups. Significant increases of nodal efficiency were present in several regions such as precuneus at late childhood. Finally, a stable and functionally/anatomically related modular organization was identified throughout the development of the WM network. This study used network analysis to elucidate the topological changes in brain maturation, paving the way for developing novel methods for analyzing disrupted brain connectivity in

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

  20. Pattern formation induced by cross-diffusion in a predator–prey system

    International Nuclear Information System (INIS)

    Sun Guiquan; Jin Zhen; Liu Quanxing; Li Li

    2008-01-01

    This paper considers the Holling–Tanner model for predator–prey with self and cross-diffusion. From the Turing theory, it is believed that there is no Turing pattern formation for the equal self-diffusion coefficients. However, combined with cross-diffusion, it shows that the system will exhibit spotted pattern by both mathematical analysis and numerical simulations. Furthermore, asynchrony of the predator and the prey in the space. The obtained results show that cross-diffusion plays an important role on the pattern formation of the predator–prey system. (general)

  1. Effect of Flood Water Diffuser on Flow Pattern of Water during Road Crossing

    Directory of Open Access Journals (Sweden)

    Abdul Ghani A.N.

    2014-03-01

    Full Text Available One of the methods to reduce the velocity of flood water flow across roads is to design obstacle objects as diffusers and place them alongside the road shoulder. The velocity reduction of water flow depends on the diffusion pattern of water. The pattern of diffused water depends on the design of the obstacle objects. The main purpose of this study is to investigate the design of obstacle objects and their water diffusing patterns and their capability to reduce the velocity of the flood water flow during road crossing. Variety of designs and orientation of the obstacle objects were tested in the environmental laboratory on a scale of 1:20. The results are classified into three distinguishable patterns of diffusion. Finally, two diffuser shapes and arrangements are recommended for further investigations in full scale or CFD model.

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

  3. Improving the Communication Pattern in Matrix-Vector Operations for Large Scale-Free Graphs by Disaggregation

    Energy Technology Data Exchange (ETDEWEB)

    Kuhlemann, Verena [Emory Univ., Atlanta, GA (United States); Vassilevski, Panayot S. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)

    2013-10-28

    Matrix-vector multiplication is the key operation in any Krylov-subspace iteration method. We are interested in Krylov methods applied to problems associated with the graph Laplacian arising from large scale-free graphs. Furthermore, computations with graphs of this type on parallel distributed-memory computers are challenging. This is due to the fact that scale-free graphs have a degree distribution that follows a power law, and currently available graph partitioners are not efficient for such an irregular degree distribution. The lack of a good partitioning leads to excessive interprocessor communication requirements during every matrix-vector product. Here, we present an approach to alleviate this problem based on embedding the original irregular graph into a more regular one by disaggregating (splitting up) vertices in the original graph. The matrix-vector operations for the original graph are performed via a factored triple matrix-vector product involving the embedding graph. And even though the latter graph is larger, we are able to decrease the communication requirements considerably and improve the performance of the matrix-vector product.

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

  5. EEG analysis of seizure patterns using visibility graphs for detection of generalized seizures

    NARCIS (Netherlands)

    Wang, Lei; Long, Xi; Arends, J.B.A.M.; Aarts, R.M.

    2017-01-01

    Background The traditional EEG features in the time and frequency domain show limited seizure detection performance in the epileptic population with intellectual disability (ID). In addition, the influence of EEG seizure patterns on detection performance was less studied. New method A single-channel

  6. Non-linear diffusion and pattern formation in vortex matter

    Science.gov (United States)

    Wijngaarden, Rinke J.; Surdeanu, R.; Huijbregtse, J. M.; Rector, J. H.; Dam, B.; Griessen, R.; Einfeld, J.; Woerdenweber, R.

    2000-03-01

    Penetration of magnetic flux in YBa_2Cu_3O7 superconducting thin films and crystals in externally applied magnetic fields is visualized with a magneto-optical technique. A variety of flux patterns due to non-linear vortex behavior is observed: 1. Roughening of the flux front^1 with scaling exponents identical to those observed in burning paper^2. Two regimes are found where respectively spatial disorder and temporal disorder dominate. In the latter regime Kardar-Parisi-Zhang behavior is found. 2. Roughening of the flux profile similar to the Oslo model for rice-piles. 3. Fractal penetration of flux^3 with Hausdorff dimension depending on the critical current anisotropy. 4. Penetration as 'flux-rivers'. 5. The occurrence of commensurate and incommensurate channels in films with anti-dots as predicted in numerical simulations by Reichhardt, Olson and Nori^4. By comparison with numerical simulations, it is shown that most of the observed behavior can be explained in terms of non-linear diffusion of vortices. ^1R. Surdeanu, R.J. Wijngaarden, E. Visser, J.M. Huijbregtse, J.H. Rector, B. Dam and R. Griessen, Phys.Rev. Lett. 83 (1999) 2054 ^2J. Maunuksela, M. Myllys, O.-P. Kähkönen, J. Timonen, N. Provatas, M.J. Alava, T. Ala-Nissila, Phys. Rev. Lett. 79, 1515 (1997) ^3R. Surdeanu, R.J. Wijngaarden, B. Dam, J. Rector, R. Griessen, C. Rossel, Z.F. Ren and J.H. Wang, Phys Rev B 58 (1998) 12467 ^4C. Reichhardt, C.J. Olson and F. Nori, Phys. Rev. B 58, 6534 (1998)

  7. Pattern Formation in Predator-Prey Model with Delay and Cross Diffusion

    Directory of Open Access Journals (Sweden)

    Xinze Lian

    2013-01-01

    Full Text Available We consider the effect of time delay and cross diffusion on the dynamics of a modified Leslie-Gower predator-prey model incorporating a prey refuge. Based on the stability analysis, we demonstrate that delayed feedback may generate Hopf and Turing instability under some conditions, resulting in spatial patterns. One of the most interesting findings is that the model exhibits complex pattern replication: the model dynamics exhibits a delay and diffusion controlled formation growth not only to spots, stripes, and holes, but also to spiral pattern self-replication. The results indicate that time delay and cross diffusion play important roles in pattern formation.

  8. A numerical study of one-dimensional replicating patterns in reaction-diffusion systems with non-linear diffusion coefficients

    International Nuclear Information System (INIS)

    Ferreri, J. C.; Carmen, A. del

    1998-01-01

    A numerical study of the dynamics of pattern evolution in reaction-diffusion systems is performed, although limited to one spatial dimension. The diffusion coefficients are nonlinear, based on powers of the scalar variables. The system keeps the dynamics of previous studies in the literature, but the presence of nonlinear diffusion generates a field of strong nonlinear interactions due to the presence of receding travelling waves. This field is limited by the plane of symmetry of the space domain and the last born outgoing travelling wave. These effects are discussed. (author). 10 refs., 7 figs

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

  10. The mechanism of Turing pattern formation in a positive feedback system with cross diffusion

    International Nuclear Information System (INIS)

    Yang, Xiyan; Liu, Tuoqi; Zhang, Jiajun; Zhou, Tianshou

    2014-01-01

    In this paper, we analyze a reaction–diffusion (R–D) system with a double negative feedback loop and find cases where self diffusion alone cannot lead to Turing pattern formation but cross diffusion can. Specifically, we first derive a set of sufficient conditions for Turing instability by performing linear stability analysis, then plot two bifurcation diagrams that specifically identify Turing regions in the parameter phase plane, and finally numerically demonstrate representative Turing patterns according to the theoretical predictions. Our analysis combined with previous studies actually implies an interesting fact that Turing patterns can be generated not only in a class of monostable R–D systems where cross diffusion is not necessary but also in a class of bistable R–D systems where cross diffusion is necessary. In addition, our model would be a good candidate for experimentally testing Turing pattern formation from the viewpoint of synthetic biology. (paper)

  11. Diffusion Magnetic Resonance Imaging Patterns in Metabolic and Toxic Brain Disorders

    Energy Technology Data Exchange (ETDEWEB)

    Sener, R.N. [Ege Univ. Hospital, Bornova, Izmir (Turkey). Dept. of Radiology

    2004-08-01

    Purpose: To evaluate metabolic and toxic brain disorders that manifest with restricted, elevated, or both restricted and elevated diffusion patterns on diffusion magnetic resonance imaging (MRI). Material and Methods: Echo-planar diffusion MRI examinations were obtained in 34 pediatric patients with metabolic and toxic brain disorders proved by appropriate laboratory studies. The MRI unit operated at 1.5T with a gradient strength of 30 mT/meter, and a rise time of 600 s. b=1000 s/mm{sup 2} images and apparent diffusion coefficient (ADC) maps with ADC values were studied. Results: Three patterns were observed: 1. A restricted diffusion pattern (high signal on b=1000 s/mm{sup 2} images and low ADC values); 2. an elevated diffusion pattern (normal signal on b=1000 s/mm2 images and high ADC values); and 3. a mixed pattern (coexistent restricted and increased diffusion patterns in the same patient). Disorders manifesting with a restricted diffusion pattern included metachromatic leukodystrophy (n=2), phenylketonuria (n=3), maple syrup urine disease (intermediate form) (n=1), infantile neuroaxonal dystrophy (n=1), Leigh (n=2), Wilson (n=3), and Canavan disease (n=1). Disorders with an elevated diffusion pattern included phenylketonuria (n=1), adrenoleukodystrophy (n=1), merosin-deficient congenital muscular dystrophy (n=2), mucopolysaccharidosis (n=2), Lowe syndrome (n=1), Leigh (n=2), Alexander (n=1), Pelizaeus-Merzbacher (n=1), and Wilson (n=3) disease. Disorders with a mixed pattern included L-2 hydroxyglutaric aciduria (n=2), non-ketotic hyperglycinemia (n=1), infantile neuroaxonal dystrophy (n=2), maple syrup urine disease (n=1), and Leigh (n=1) disease. Conclusion: The findings suggested that the three different diffusion patterns reflect the histopathological changes associated with the disorders and different stages of a particular disorder. It is likely that the restricted diffusion pattern corresponds to abnormalities related to myelin, and the elevated

  12. Diffusion Magnetic Resonance Imaging Patterns in Metabolic and Toxic Brain Disorders

    International Nuclear Information System (INIS)

    Sener, R.N.

    2004-01-01

    Purpose: To evaluate metabolic and toxic brain disorders that manifest with restricted, elevated, or both restricted and elevated diffusion patterns on diffusion magnetic resonance imaging (MRI). Material and Methods: Echo-planar diffusion MRI examinations were obtained in 34 pediatric patients with metabolic and toxic brain disorders proved by appropriate laboratory studies. The MRI unit operated at 1.5T with a gradient strength of 30 mT/meter, and a rise time of 600 s. b=1000 s/mm 2 images and apparent diffusion coefficient (ADC) maps with ADC values were studied. Results: Three patterns were observed: 1. A restricted diffusion pattern (high signal on b=1000 s/mm 2 images and low ADC values); 2. an elevated diffusion pattern (normal signal on b=1000 s/mm2 images and high ADC values); and 3. a mixed pattern (coexistent restricted and increased diffusion patterns in the same patient). Disorders manifesting with a restricted diffusion pattern included metachromatic leukodystrophy (n=2), phenylketonuria (n=3), maple syrup urine disease (intermediate form) (n=1), infantile neuroaxonal dystrophy (n=1), Leigh (n=2), Wilson (n=3), and Canavan disease (n=1). Disorders with an elevated diffusion pattern included phenylketonuria (n=1), adrenoleukodystrophy (n=1), merosin-deficient congenital muscular dystrophy (n=2), mucopolysaccharidosis (n=2), Lowe syndrome (n=1), Leigh (n=2), Alexander (n=1), Pelizaeus-Merzbacher (n=1), and Wilson (n=3) disease. Disorders with a mixed pattern included L-2 hydroxyglutaric aciduria (n=2), non-ketotic hyperglycinemia (n=1), infantile neuroaxonal dystrophy (n=2), maple syrup urine disease (n=1), and Leigh (n=1) disease. Conclusion: The findings suggested that the three different diffusion patterns reflect the histopathological changes associated with the disorders and different stages of a particular disorder. It is likely that the restricted diffusion pattern corresponds to abnormalities related to myelin, and the elevated diffusion pattern

  13. Graph theoretical analysis reveals the reorganization of the brain network pattern in primary open angle glaucoma patients

    International Nuclear Information System (INIS)

    Wang, Jieqiong; Li, Ting; Xian, Junfang; Wang, Ningli; He, Huiguang

    2016-01-01

    Most previous glaucoma studies with resting-state fMRI have focused on the neuronal activity in the individual structure of the brain, yet ignored the functional communication of anatomically separated structures. The purpose of this study is to investigate the efficiency of the functional communication change or not in glaucoma patients. We applied the resting-state fMRI data to construct the connectivity network of 25 normal controls and 25 age-gender-matched primary open angle glaucoma patients. Graph theoretical analysis was performed to assess brain network pattern differences between the two groups. No significant differences of the global network measures were found between the two groups. However, the local measures were radically reorganized in glaucoma patients. Comparing with the hub regions in normal controls' network, we found that six hub regions disappeared and nine hub regions appeared in the network of patients. In addition, the betweenness centralities of two altered hub regions, right fusiform gyrus and right lingual gyrus, were significantly correlated with the visual field mean deviation. Although the efficiency of functional communication is preserved in the brain network of the glaucoma at the global level, the efficiency of functional communication is altered in some specialized regions of the glaucoma. (orig.)

  14. Graph theoretical analysis reveals the reorganization of the brain network pattern in primary open angle glaucoma patients

    Energy Technology Data Exchange (ETDEWEB)

    Wang, Jieqiong [Chinese Academy of Sciences, State Key Laboratory of Management and Control for Complex Systems, Institute of Automation, Beijing (China); Li, Ting; Xian, Junfang [Capital Medical University, Department of Radiology, Beijing Tongren Hospital, Beijing (China); Wang, Ningli [Capital Medical University, Department of Ophthalmology, Beijing Tongren Hospital, Beijing (China); He, Huiguang [Chinese Academy of Sciences, State Key Laboratory of Management and Control for Complex Systems, Institute of Automation, Beijing (China); Chinese Academy of Sciences, Research Center for Brain-Inspired Intelligence, Institute of Automation, Beijing (China)

    2016-11-15

    Most previous glaucoma studies with resting-state fMRI have focused on the neuronal activity in the individual structure of the brain, yet ignored the functional communication of anatomically separated structures. The purpose of this study is to investigate the efficiency of the functional communication change or not in glaucoma patients. We applied the resting-state fMRI data to construct the connectivity network of 25 normal controls and 25 age-gender-matched primary open angle glaucoma patients. Graph theoretical analysis was performed to assess brain network pattern differences between the two groups. No significant differences of the global network measures were found between the two groups. However, the local measures were radically reorganized in glaucoma patients. Comparing with the hub regions in normal controls' network, we found that six hub regions disappeared and nine hub regions appeared in the network of patients. In addition, the betweenness centralities of two altered hub regions, right fusiform gyrus and right lingual gyrus, were significantly correlated with the visual field mean deviation. Although the efficiency of functional communication is preserved in the brain network of the glaucoma at the global level, the efficiency of functional communication is altered in some specialized regions of the glaucoma. (orig.)

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

  16. Patterns of diagnostic marker assessment in adult diffuse glioma

    DEFF Research Database (Denmark)

    Woehrer, Adelheid; Kristensen, Bjarne W.; Vital, Anne

    2017-01-01

    The 2016 update of the WHO classification has introduced an integrated diagnostic approach that incorporates both tumor morphology and molecular information. This conceptual change has far-reaching implications, especially for neuropathologists who are in the forefront of translating molecular...... markers to routine diagnostic use. Adult diffuse glioma is a prototypic example for a group of tumors that underwent substantial regrouping, and it represents a major workload for surgical neuropathologists. Hence, we conducted a survey among members of the European Confederation of Neuropathological...

  17. Diffusion tractography and graph theory analysis reveal the disrupted rich-club organization of white matter structural networks in early Tourette Syndrome children

    Science.gov (United States)

    Wen, Hongwei; Liu, Yue; Wang, Shengpei; Zhang, Jishui; Peng, Yun; He, Huiguang

    2017-03-01

    Tourette syndrome (TS) is a childhood-onset neurobehavioral disorder. At present, the topological disruptions of the whole brain white matter (WM) structural networks remain poorly understood in TS children. Considering the unique position of the topologically central role of densely interconnected brain hubs, namely the rich club regions, therefore, we aimed to investigate whether the rich club regions and their related connections would be particularly vulnerable in early TS children. In our study, we used diffusion tractography and graph theoretical analyses to explore the rich club structures in 44 TS children and 48 healthy children. The structural networks of TS children exhibited significantly increased normalized rich club coefficient, suggesting that TS is characterized by increased structural integrity of this centrally embedded rich club backbone, potentially resulting in increased global communication capacity. In addition, TS children showed a reorganization of rich club regions, as well as significantly increased density and decreased number in feeder connections. Furthermore, the increased rich club coefficients and feeder connections density of TS children were significantly positively correlated to tic severity, indicating that TS may be characterized by a selective alteration of the structural connectivity of the rich club regions, tending to have higher bridging with non-rich club regions, which may increase the integration among tic-related brain circuits with more excitability but less inhibition for information exchanges between highly centered brain regions and peripheral areas. In all, our results suggest the disrupted rich club organization in early TS children and provide structural insights into the brain networks.

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

  19. Global stability and pattern formation in a nonlocal diffusive Lotka-Volterra competition model

    Science.gov (United States)

    Ni, Wenjie; Shi, Junping; Wang, Mingxin

    2018-06-01

    A diffusive Lotka-Volterra competition model with nonlocal intraspecific and interspecific competition between species is formulated and analyzed. The nonlocal competition strength is assumed to be determined by a diffusion kernel function to model the movement pattern of the biological species. It is shown that when there is no nonlocal intraspecific competition, the dynamics properties of nonlocal diffusive competition problem are similar to those of classical diffusive Lotka-Volterra competition model regardless of the strength of nonlocal interspecific competition. Global stability of nonnegative constant equilibria are proved using Lyapunov or upper-lower solution methods. On the other hand, strong nonlocal intraspecific competition increases the system spatiotemporal dynamic complexity. For the weak competition case, the nonlocal diffusive competition model may possess nonconstant positive equilibria for some suitably large nonlocal intraspecific competition coefficients.

  20. Pattern transition between periodic Liesegang pattern and crystal growth regime in reaction-diffusion systems

    Science.gov (United States)

    Lagzi, István; Ueyama, Daishin

    2009-01-01

    The pattern transition between periodic precipitation pattern formation (Liesegang phenomenon) and pure crystal growth regimes is investigated in silver nitrate and potassium dichromate system in mixed agarose-gelatin gel. Morphologically different patterns were found depending on the quality of the gel, and transition between these typical patterns can be controlled by the concentration of gelatin in mixed gel. Effect of temperature and hydrodynamic force on precipitation pattern structure was also investigated.

  1. Spatio-Temporal Diffusion Pattern and Hotspot Detection of Dengue in Chachoengsao Province, Thailand

    Directory of Open Access Journals (Sweden)

    Phaisarn Jeefoo

    2010-12-01

    Full Text Available In recent years, dengue has become a major international public health concern. In Thailand it is also an important concern as several dengue outbreaks were reported in last decade. This paper presents a GIS approach to analyze the spatial and temporal dynamics of dengue epidemics. The major objective of this study was to examine spatial diffusion patterns and hotspot identification for reported dengue cases. Geospatial diffusion pattern of the 2007 dengue outbreak was investigated. Map of daily cases was generated for the 153 days of the outbreak. Epidemiological data from Chachoengsao province, Thailand (reported dengue cases for the years 1999–2007 was used for this study. To analyze the dynamic space-time pattern of dengue outbreaks, all cases were positioned in space at a village level. After a general statistical analysis (by gender and age group, data was subsequently analyzed for temporal patterns and correlation with climatic data (especially rainfall, spatial patterns and cluster analysis, and spatio-temporal patterns of hotspots during epidemics. The results revealed spatial diffusion patterns during the years 1999–2007 representing spatially clustered patterns with significant differences by village. Villages on the urban fringe reported higher incidences. The space and time of the cases showed outbreak movement and spread patterns that could be related to entomologic and epidemiologic factors. The hotspots showed the spatial trend of dengue diffusion. This study presents useful information related to the dengue outbreak patterns in space and time and may help public health departments to plan strategies to control the spread of disease. The methodology is general for space-time analysis and can be applied for other infectious diseases as well.

  2. Square Turing patterns in reaction-diffusion systems with coupled layers

    Energy Technology Data Exchange (ETDEWEB)

    Li, Jing [State Key Laboratory for Mesoscopic Physics and School of Physics, Peking University, Beijing 100871 (China); Wang, Hongli, E-mail: hlwang@pku.edu.cn, E-mail: qi@pku.edu.cn [State Key Laboratory for Mesoscopic Physics and School of Physics, Peking University, Beijing 100871 (China); Center for Quantitative Biology, Peking University, Beijing 100871 (China); Ouyang, Qi, E-mail: hlwang@pku.edu.cn, E-mail: qi@pku.edu.cn [State Key Laboratory for Mesoscopic Physics and School of Physics, Peking University, Beijing 100871 (China); Center for Quantitative Biology, Peking University, Beijing 100871 (China); The Peking-Tsinghua Center for Life Sciences, Beijing 100871 (China)

    2014-06-15

    Square Turing patterns are usually unstable in reaction-diffusion systems and are rarely observed in corresponding experiments and simulations. We report here an example of spontaneous formation of square Turing patterns with the Lengyel-Epstein model of two coupled layers. The squares are found to be a result of the resonance between two supercritical Turing modes with an appropriate ratio. Besides, the spatiotemporal resonance of Turing modes resembles to the mode-locking phenomenon. Analysis of the general amplitude equations for square patterns reveals that the fixed point corresponding to square Turing patterns is stationary when the parameters adopt appropriate values.

  3. Externally controlled anisotropy in pattern-forming reaction-diffusion systems.

    Science.gov (United States)

    Escala, Dario M; Guiu-Souto, Jacobo; Muñuzuri, Alberto P

    2015-06-01

    The effect of centrifugal forces is analyzed in a pattern-forming reaction-diffusion system. Numerical simulations conducted on the appropriate extension of the Oregonator model for the Belousov-Zhabotinsky reaction show a great variety of dynamical behaviors in such a system. In general, the system exhibits an anisotropy that results in new types of patterns or in a global displacement of the previous one. We consider the effect of both constant and periodically modulated centrifugal forces on the different types of patterns that the system may exhibit. A detailed analysis of the patterns and behaviors observed for the different parameter values considered is presented here.

  4. Contribution to an effective design method for stationary reaction-diffusion patterns

    Energy Technology Data Exchange (ETDEWEB)

    Szalai, István; Horváth, Judit [Laboratory of Nonlinear Chemical Dynamics, Institute of Chemistry, Eötvös Loránd University, P.O. Box 32, H-1518 Budapest 112 (Hungary); De Kepper, Patrick [Centre de Recherche Paul Pascal, CNRS, University of Bordeaux, 115, Avenue Schweitzer, F-33600 Pessac (France)

    2015-06-15

    The British mathematician Alan Turing predicted, in his seminal 1952 publication, that stationary reaction-diffusion patterns could spontaneously develop in reacting chemical or biochemical solutions. The first two clear experimental demonstrations of such a phenomenon were not made before the early 1990s when the design of new chemical oscillatory reactions and appropriate open spatial chemical reactors had been invented. Yet, the number of pattern producing reactions had not grown until 2009 when we developed an operational design method, which takes into account the feeding conditions and other specificities of real open spatial reactors. Since then, on the basis of this method, five additional reactions were shown to produce stationary reaction-diffusion patterns. To gain a clearer view on where our methodical approach on the patterning capacity of a reaction stands, numerical studies in conditions that mimic true open spatial reactors were made. In these numerical experiments, we explored the patterning capacity of Rabai's model for pH driven Landolt type reactions as a function of experimentally attainable parameters that control the main time and length scales. Because of the straightforward reversible binding of protons to carboxylate carrying polymer chains, this class of reaction is at the base of the chemistry leading to most of the stationary reaction-diffusion patterns presently observed. We compare our model predictions with experimental observations and comment on agreements and differences.

  5. Contribution to an effective design method for stationary reaction-diffusion patterns

    International Nuclear Information System (INIS)

    Szalai, István; Horváth, Judit; De Kepper, Patrick

    2015-01-01

    The British mathematician Alan Turing predicted, in his seminal 1952 publication, that stationary reaction-diffusion patterns could spontaneously develop in reacting chemical or biochemical solutions. The first two clear experimental demonstrations of such a phenomenon were not made before the early 1990s when the design of new chemical oscillatory reactions and appropriate open spatial chemical reactors had been invented. Yet, the number of pattern producing reactions had not grown until 2009 when we developed an operational design method, which takes into account the feeding conditions and other specificities of real open spatial reactors. Since then, on the basis of this method, five additional reactions were shown to produce stationary reaction-diffusion patterns. To gain a clearer view on where our methodical approach on the patterning capacity of a reaction stands, numerical studies in conditions that mimic true open spatial reactors were made. In these numerical experiments, we explored the patterning capacity of Rabai's model for pH driven Landolt type reactions as a function of experimentally attainable parameters that control the main time and length scales. Because of the straightforward reversible binding of protons to carboxylate carrying polymer chains, this class of reaction is at the base of the chemistry leading to most of the stationary reaction-diffusion patterns presently observed. We compare our model predictions with experimental observations and comment on agreements and differences

  6. Patterning functional materials using channel diffused plasma-etched self-assembled monolayer templates

    NARCIS (Netherlands)

    George, A.; Maijenburg, A.W.; Maas, M.G.; Blank, David H.A.; ten Elshof, Johan E.

    2011-01-01

    A simple and cost-effective methodology for large-area micrometer-scale patterning of a wide range of metallic and oxidic functional materials is presented. Self-assembled monolayers (SAM) of alkyl thiols on Au were micropatterned by channel-diffused oxygen plasma etching, a method in which selected

  7. Diffuse micronodular pattern of bronchiolitis obliterans organizing pneumonia: a case report

    Energy Technology Data Exchange (ETDEWEB)

    Lee, In Jae; Jang, Seung Hun; Min, Kwang Seon; Whang, Im Kyung; Lee, Yul; Bae, Sang Hoon [Hallym University Sacred Heart Hospital, Hallym University College of Medicine, Anyang (Korea, Republic of)

    2006-10-15

    The typical radiographic findings of bronchiolitis obliterans organizing pneumonia (BOOP) are known to be patchy air-space consolidation that is often subpleural, and with or without ground-glass opacities. However, there are scant radiologic reports about the micronodular pattern of BOOP. We report here on a case of BOOP that manifested as diffusely scattered ill-defined centrilobular micronodules on HRCT.

  8. Organic influences on inorganic patterns of diffusion-controlled precipitation in gels

    Science.gov (United States)

    Barge, Laura M.; Nealson, Kenneth H.; Petruska, John

    2010-06-01

    The well-known AgNO 3/K 2CrO 4 reaction-diffusion system produces periodic bands of silver chromate precipitate in gelatin, but only randomly oriented crystals in agarose gel. We show that comparable bands can be produced in agarose gel by adding small amounts of simple organic acids (e.g., acetic acid, N-acetyl glycine, and N-acetyl alanine) that suppress crystal growth and promote formation of rounded particles of precipitate. These results indicate that α-carboxyl groups of amino acids or short peptides in gelatin under mildly acidic conditions can induce periodic band patterns in diffusion-controlled silver chromate precipitates.

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

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

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

  12. The influence of different diffusion pattern to the sub- and super-critical fluid flow in brown coal

    Science.gov (United States)

    Peng, Peihuo

    2018-03-01

    Sub- and super-critical CO2 flowing in nanoscale pores are recently becoming of great interest due to that it is closely related to many engineering applications, such as geological burial and sequestration of carbon dioxide, Enhanced Coal Bed Methane recovery ( ECBM), super-critical CO2 fracturing and so on. Gas flow in nanopores cannot be described simply by the Darcy equation. Different diffusion pattern such as Fick diffusion, Knudsen diffusion, transitional diffusion and slip flow at the solid matrix separate the seepage behaviour from Darcy-type flow. According to the principle of different diffusion pattern, the flow of sub- and super-critical CO2 in brown coal was simulated by numerical method, and the results were compared with the experimental results to explore the contribution of different diffusion pattern and swelling effect in sub- and super-critical CO2 flow in nanoscale pores.

  13. Patterns of accentuated grey-white differentiation on diffusion-weighted imaging or the apparent diffusion coefficient maps in comatose survivors after global brain injury

    International Nuclear Information System (INIS)

    Kim, E.; Sohn, C.-H.; Chang, K.-H.; Chang, H.-W.; Lee, D.H.

    2011-01-01

    Aim: To determine what disease entities show accentuated grey-white differentiation of the cerebral hemisphere on diffusion-weighted images (DWI) or apparent diffusion coefficient (ADC) maps, and whether there is a correlation between the different patterns and the cause of the brain injury. Methods and materials: The DWI and ADC maps of 19 patients with global brain injury were reviewed and evaluated to investigate whether there was a correlation between the different patterns seen on the DWI and ADC maps and the cause of global brain injury. The ADC values were measured for quantitative analysis. Results: There were three different patterns of ADC decrease: a predominant ADC decrease in only the cerebral cortex (n = 8; pattern I); an ADC decrease in both the cerebral cortex and white matter (WM) and a predominant decrease in the WM (n = 9; pattern II); and a predominant ADC decrease in only the WM (n = 3; pattern III). Conclusion: Pattern I is cerebral cortical injury, suggesting cortical laminar necrosis in hypoxic brain injury. Pattern II is cerebral cortical and WM injury, frequently seen in brain death, while pattern 3 is mainly WM injury, especially found in hypoglycaemic brain injury. It is likely that pattern I is decorticate injury and pattern II is decerebrate injury in hypoxic ischaemic encephalopathy.Patterns I and II are found in severe hypoxic brain injury, and pattern II is frequently shown in brain death, whereas pattern III was found in severe hypoglycaemic injury.

  14. Diffusion-induced periodic transition between oscillatory modes in amplitude-modulated patterns

    Energy Technology Data Exchange (ETDEWEB)

    Tang, Xiaodong; He, Yuxiu; Wang, Shaorong; Gao, Qingyu, E-mail: gaoqy@cumt.edu.cn [College of Chemical Engineering, China University of Mining and Technology, Xuzhou 221008 (China); Epstein, Irving R., E-mail: epstein@brandeis.edu [Department of Chemistry and Volen Center for Complex Systems, MS 015, Brandeis University, Waltham, Massachusetts 02454-9110 (United States); Wang, Qun [School of Physics and Electronic Engineering, Jiangsu Normal University, Xuzhou 221116 (China)

    2014-06-15

    We study amplitude-modulated waves, e.g., wave packets in one dimension, overtarget spirals and superspirals in two dimensions, under mixed-mode oscillatory conditions in a three-variable reaction-diffusion model. New transition zones, not seen in the homogeneous system, are found, in which periodic transitions occur between local 1{sup N−1} and 1{sup N} oscillations. Amplitude-modulated complex patterns result from periodic transition between (N − 1)-armed and N-armed waves. Spatial recurrence rates provide a useful guide to the stability of these modulated patterns.

  15. A Clustering Graph Generator

    Energy Technology Data Exchange (ETDEWEB)

    Winlaw, Manda [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); De Sterck, Hans [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Sanders, Geoffrey [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)

    2015-10-26

    In very simple terms a network can be de ned as a collection of points joined together by lines. Thus, networks can be used to represent connections between entities in a wide variety of elds including engi- neering, science, medicine, and sociology. Many large real-world networks share a surprising number of properties, leading to a strong interest in model development research and techniques for building synthetic networks have been developed, that capture these similarities and replicate real-world graphs. Modeling these real-world networks serves two purposes. First, building models that mimic the patterns and prop- erties of real networks helps to understand the implications of these patterns and helps determine which patterns are important. If we develop a generative process to synthesize real networks we can also examine which growth processes are plausible and which are not. Secondly, high-quality, large-scale network data is often not available, because of economic, legal, technological, or other obstacles [7]. Thus, there are many instances where the systems of interest cannot be represented by a single exemplar network. As one example, consider the eld of cybersecurity, where systems require testing across diverse threat scenarios and validation across diverse network structures. In these cases, where there is no single exemplar network, the systems must instead be modeled as a collection of networks in which the variation among them may be just as important as their common features. By developing processes to build synthetic models, so-called graph generators, we can build synthetic networks that capture both the essential features of a system and realistic variability. Then we can use such synthetic graphs to perform tasks such as simulations, analysis, and decision making. We can also use synthetic graphs to performance test graph analysis algorithms, including clustering algorithms and anomaly detection algorithms.

  16. Enlisting Clustering and Graph-Traversal Methods for Cutting Pattern and Net Topology Design in Pneumatic Hybrids

    DEFF Research Database (Denmark)

    Ayres, Phil; Vestartas, Petras; Ramsgaard Thomsen, Mette

    2017-01-01

    Cutting patterns for architectural membranes are generally characterised by rational approaches to surface discretisation and minimisation of geometric deviation between discrete elements that comprise the membrane. In this paper, we present an alternative approach for cutting pattern generation...... to the cutting pattern generation method and the net topology generation method used to produce a constraint net for a given membrane. We test our computational design approach through an iterative cycle of digital and physical prototyping before realising an air-inflated cable restrained pneumatic structural...

  17. Coloring sums of extensions of certain graphs

    Directory of Open Access Journals (Sweden)

    Johan Kok

    2017-12-01

    Full Text Available We recall that the minimum number of colors that allow a proper coloring of graph $G$ is called the chromatic number of $G$ and denoted $\\chi(G$. Motivated by the introduction of the concept of the $b$-chromatic sum of a graph the concept of $\\chi'$-chromatic sum and $\\chi^+$-chromatic sum are introduced in this paper. The extended graph $G^x$ of a graph $G$ was recently introduced for certain regular graphs. This paper furthers the concepts of $\\chi'$-chromatic sum and $\\chi^+$-chromatic sum to extended paths and cycles. Bipartite graphs also receive some attention. The paper concludes with patterned structured graphs. These last said graphs are typically found in chemical and biological structures.

  18. Graph theory

    CERN Document Server

    Gould, Ronald

    2012-01-01

    This introduction to graph theory focuses on well-established topics, covering primary techniques and including both algorithmic and theoretical problems. The algorithms are presented with a minimum of advanced data structures and programming details. This thoroughly corrected 1988 edition provides insights to computer scientists as well as advanced undergraduates and graduate students of topology, algebra, and matrix theory. Fundamental concepts and notation and elementary properties and operations are the first subjects, followed by examinations of paths and searching, trees, and networks. S

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

  20. Mathematical analysis and numerical simulation of patterns in fractional and classical reaction-diffusion systems

    International Nuclear Information System (INIS)

    Owolabi, Kolade M.

    2016-01-01

    The aim of this paper is to examine pattern formation in the sub— and super-diffusive scenarios and compare it with that of classical or standard diffusive processes in two-component fractional reaction-diffusion systems that modeled a predator-prey dynamics. The focus of the work concentrates on the use of two separate mathematical techniques, we formulate a Fourier spectral discretization method as an efficient alternative technique to solve fractional reaction-diffusion problems in higher-dimensional space, and later advance the resulting systems of ODEs in time with the adaptive exponential time-differencing solver. Obviously, the fractional Fourier approach is able to achieve spectral convergence up to machine precision regardless of the fractional order α, owing to the fact that our approach is able to give full diagonal representation of the fractional operator. The complexity of the dynamics in this system is theoretically discussed and graphically displayed with some examples and numerical simulations in one, two and three dimensions.

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

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

  3. Patterns induced by super cross-diffusion in a predator-prey system with Michaelis-Menten type harvesting.

    Science.gov (United States)

    Liu, Biao; Wu, Ranchao; Chen, Liping

    2018-04-01

    Turing instability and pattern formation in a super cross-diffusion predator-prey system with Michaelis-Menten type predator harvesting are investigated. Stability of equilibrium points is first explored with or without super cross-diffusion. It is found that cross-diffusion could induce instability of equilibria. To further derive the conditions of Turing instability, the linear stability analysis is carried out. From theoretical analysis, note that cross-diffusion is the key mechanism for the formation of spatial patterns. By taking cross-diffusion rate as bifurcation parameter, we derive amplitude equations near the Turing bifurcation point for the excited modes by means of weakly nonlinear theory. Dynamical analysis of the amplitude equations interprets the structural transitions and stability of various forms of Turing patterns. Furthermore, the theoretical results are illustrated via numerical simulations. Copyright © 2018. Published by Elsevier Inc.

  4. Spatiotemporal Patterns in a Ratio-Dependent Food Chain Model with Reaction-Diffusion

    Directory of Open Access Journals (Sweden)

    Lei Zhang

    2014-01-01

    Full Text Available Predator-prey models describe biological phenomena of pursuit-evasion interaction. And this interaction exists widely in the world for the necessary energy supplement of species. In this paper, we have investigated a ratio-dependent spatially extended food chain model. Based on the bifurcation analysis (Hopf and Turing, we give the spatial pattern formation via numerical simulation, that is, the evolution process of the system near the coexistence equilibrium point (u2*,v2*,w2*, and find that the model dynamics exhibits complex pattern replication. For fixed parameters, on increasing the control parameter c1, the sequence “holes → holes-stripe mixtures → stripes → spots-stripe mixtures → spots” pattern is observed. And in the case of pure Hopf instability, the model exhibits chaotic wave pattern replication. Furthermore, we consider the pattern formation in the case of which the top predator is extinct, that is, the evolution process of the system near the equilibrium point (u1*,v1*,0, and find that the model dynamics exhibits stripes-spots pattern replication. Our results show that reaction-diffusion model is an appropriate tool for investigating fundamental mechanism of complex spatiotemporal dynamics. It will be useful for studying the dynamic complexity of ecosystems.

  5. Critical regimes driven by recurrent mobility patterns of reaction-diffusion processes in networks

    Science.gov (United States)

    Gómez-Gardeñes, J.; Soriano-Paños, D.; Arenas, A.

    2018-04-01

    Reaction-diffusion processes1 have been widely used to study dynamical processes in epidemics2-4 and ecology5 in networked metapopulations. In the context of epidemics6, reaction processes are understood as contagions within each subpopulation (patch), while diffusion represents the mobility of individuals between patches. Recently, the characteristics of human mobility7, such as its recurrent nature, have been proven crucial to understand the phase transition to endemic epidemic states8,9. Here, by developing a framework able to cope with the elementary epidemic processes, the spatial distribution of populations and the commuting mobility patterns, we discover three different critical regimes of the epidemic incidence as a function of these parameters. Interestingly, we reveal a regime of the reaction-diffussion process in which, counter-intuitively, mobility is detrimental to the spread of disease. We analytically determine the precise conditions for the emergence of any of the three possible critical regimes in real and synthetic networks.

  6. Dichotomous-noise-induced pattern formation in a reaction-diffusion system

    Science.gov (United States)

    Das, Debojyoti; Ray, Deb Shankar

    2013-06-01

    We consider a generic reaction-diffusion system in which one of the parameters is subjected to dichotomous noise by controlling the flow of one of the reacting species in a continuous-flow-stirred-tank reactor (CSTR) -membrane reactor. The linear stability analysis in an extended phase space is carried out by invoking Furutzu-Novikov procedure for exponentially correlated multiplicative noise to derive the instability condition in the plane of the noise parameters (correlation time and strength of the noise). We demonstrate that depending on the correlation time an optimal strength of noise governs the self-organization. Our theoretical analysis is corroborated by numerical simulations on pattern formation in a chlorine-dioxide-iodine-malonic acid reaction-diffusion system.

  7. Simulations of pattern dynamics for reaction-diffusion systems via SIMULINK.

    Science.gov (United States)

    Wang, Kaier; Steyn-Ross, Moira L; Steyn-Ross, D Alistair; Wilson, Marcus T; Sleigh, Jamie W; Shiraishi, Yoichi

    2014-04-11

    Investigation of the nonlinear pattern dynamics of a reaction-diffusion system almost always requires numerical solution of the system's set of defining differential equations. Traditionally, this would be done by selecting an appropriate differential equation solver from a library of such solvers, then writing computer codes (in a programming language such as C or Matlab) to access the selected solver and display the integrated results as a function of space and time. This "code-based" approach is flexible and powerful, but requires a certain level of programming sophistication. A modern alternative is to use a graphical programming interface such as Simulink to construct a data-flow diagram by assembling and linking appropriate code blocks drawn from a library. The result is a visual representation of the inter-relationships between the state variables whose output can be made completely equivalent to the code-based solution. As a tutorial introduction, we first demonstrate application of the Simulink data-flow technique to the classical van der Pol nonlinear oscillator, and compare Matlab and Simulink coding approaches to solving the van der Pol ordinary differential equations. We then show how to introduce space (in one and two dimensions) by solving numerically the partial differential equations for two different reaction-diffusion systems: the well-known Brusselator chemical reactor, and a continuum model for a two-dimensional sheet of human cortex whose neurons are linked by both chemical and electrical (diffusive) synapses. We compare the relative performances of the Matlab and Simulink implementations. The pattern simulations by Simulink are in good agreement with theoretical predictions. Compared with traditional coding approaches, the Simulink block-diagram paradigm reduces the time and programming burden required to implement a solution for reaction-diffusion systems of equations. Construction of the block-diagram does not require high-level programming

  8. Distinguishing diffuse alopecia areata (AA) from pattern hair loss (PHL) using CD3(+) T cells.

    Science.gov (United States)

    Kolivras, Athanassios; Thompson, Curtis

    2016-05-01

    Distinguishing between diffuse subacute alopecia areata (AA), in which the peribulbar infiltrate is absent, and pattern hair loss is challenging, particularly in cases that lack marked follicular miniaturization and a marked catagen/telogen shift. We sought to distinguish diffuse AA from pattern hair loss using CD3(+) T lymphocytes. A total of 28 cases of subacute AA and 31 cases of pattern hair loss were selected and a 4-mm punch biopsy was performed. All the specimens were processed using the "HoVert" (horizontal and vertical) technique. In all cases, hematoxylin-eosin and immunohistochemical stains for CD3, CD4, CD8, and CD20 were performed. The presence of CD3(+) lymphocytes within empty follicular fibrous tracts (stela), even without a concomitant peribulbar infiltrate, is a reliable histopathological clue in supporting a diagnosis of AA (sensitivity 0.964, specificity 1, P ≤ .001). Limited tissue for analysis remained in the clinical sample tissue blocks. The presence of CD3(+) T-cells within empty follicular fibrous tracts (stela) supports a diagnosis of AA. Copyright © 2015 American Academy of Dermatology, Inc. Published by Elsevier Inc. All rights reserved.

  9. Analyses of Crime Patterns in NIBRS Data Based on a Novel Graph Theory Clustering Method: Virginia as a Case Study

    Directory of Open Access Journals (Sweden)

    Peixin Zhao

    2014-01-01

    Full Text Available This paper suggests a novel clustering method for analyzing the National Incident-Based Reporting System (NIBRS data, which include the determination of correlation of different crime types, the development of a likelihood index for crimes to occur in a jurisdiction, and the clustering of jurisdictions based on crime type. The method was tested by using the 2005 assault data from 121 jurisdictions in Virginia as a test case. The analyses of these data show that some different crime types are correlated and some different crime parameters are correlated with different crime types. The analyses also show that certain jurisdictions within Virginia share certain crime patterns. This information assists with constructing a pattern for a specific crime type and can be used to determine whether a jurisdiction may be more likely to see this type of crime occur in their area.

  10. A study of the diffusion pattern in N=4 SYM at high energies

    International Nuclear Information System (INIS)

    Caporale, F.; Chachamis, G.; Madrigal, J.D.; Murdaca, B.; Sabio Vera, A.

    2013-01-01

    In the context of evolution equations and scattering amplitudes in the high energy limit of the N=4 super Yang–Mills theory we investigate in some detail the BFKL gluon Green function at next-to-leading order. In particular, we study its collinear behavior in terms of an expansion in different angular components. We also perform a Monte Carlo simulation of the different final states contributing to such a Green function and construct the diffusion pattern into infrared and ultraviolet modes and multiplicity distributions, making emphasis in separating the gluon contributions from those of scalars and gluinos. We find that the combined role of the non-gluonic degrees of freedom is to improve the collinear behavior and reduce the diffusion into ultraviolet regions while not having any effect on the average multiplicities or diffusion into the infrared. In terms of growth with energy, the non-zero conformal spin components are mainly driven by the gluon terms in the BFKL kernel. For zero conformal spin (Pomeron) the effect of the scalar and gluino sectors is to dramatically push the Green function towards higher values

  11. Social diffusion of energy-related practices and representations: Patterns and policies in Portugal and Belgium

    International Nuclear Information System (INIS)

    Bartiaux, Françoise; Schmidt, Luísa; Horta, Ana; Correia, Augusta

    2016-01-01

    The social-class dimension of energy consumption has been rather neglected relative to other theoretical approaches to energy use, despite its potential deployment in energy policies. This paper aims at investigating energy policy-related inequalities across social classes with respect to three dimensions highlighted by environmental-justice theories: income distribution, procedures producing unequal distributional outcomes, and cultural and political recognition of vulnerable and marginalised social groups. These inequalities can be exacerbated or reduced by social diffusion processes, both vertical and horizontal. These processes include policy instruments intending to lower energy consumption in the residential sector. To empirically ground the analysis, two countries with contrasting patterns of income inequalities, Portugal and Belgium, are compared on the basis of qualitative data collected in 2009–2011. We discuss the relevance of integrating the social diffusion dimension in energy policies and propose several policy instruments to do so. One of our main contribution is to argue that both vertical and horizontal diffusion across social classes, if adequately translated into policy instruments, can boost the uptake of residential energy retrofits and other energy saving practices.

  12. The spatiotemporal pattern of Src activation at lipid rafts revealed by diffusion-corrected FRET imaging.

    Directory of Open Access Journals (Sweden)

    Shaoying Lu

    2008-07-01

    Full Text Available Genetically encoded biosensors based on fluorescence resonance energy transfer (FRET have been widely applied to visualize the molecular activity in live cells with high spatiotemporal resolution. However, the rapid diffusion of biosensor proteins hinders a precise reconstruction of the actual molecular activation map. Based on fluorescence recovery after photobleaching (FRAP experiments, we have developed a finite element (FE method to analyze, simulate, and subtract the diffusion effect of mobile biosensors. This method has been applied to analyze the mobility of Src FRET biosensors engineered to reside at different subcompartments in live cells. The results indicate that the Src biosensor located in the cytoplasm moves 4-8 folds faster (0.93+/-0.06 microm(2/sec than those anchored on different compartments in plasma membrane (at lipid raft: 0.11+/-0.01 microm(2/sec and outside: 0.18+/-0.02 microm(2/sec. The mobility of biosensor at lipid rafts is slower than that outside of lipid rafts and is dominated by two-dimensional diffusion. When this diffusion effect was subtracted from the FRET ratio images, high Src activity at lipid rafts was observed at clustered regions proximal to the cell periphery, which remained relatively stationary upon epidermal growth factor (EGF stimulation. This result suggests that EGF induced a Src activation at lipid rafts with well-coordinated spatiotemporal patterns. Our FE-based method also provides an integrated platform of image analysis for studying molecular mobility and reconstructing the spatiotemporal activation maps of signaling molecules in live cells.

  13. Effects of intrinsic stochasticity on delayed reaction-diffusion patterning systems

    KAUST Repository

    Woolley, Thomas E.; Baker, Ruth E.; Gaffney, Eamonn A.; Maini, Philip K.; Seirin-Lee, Sungrim

    2012-01-01

    Cellular gene expression is a complex process involving many steps, including the transcription of DNA and translation of mRNA; hence the synthesis of proteins requires a considerable amount of time, from ten minutes to several hours. Since diffusion-driven instability has been observed to be sensitive to perturbations in kinetic delays, the application of Turing patterning mechanisms to the problem of producing spatially heterogeneous differential gene expression has been questioned. In deterministic systems a small delay in the reactions can cause a large increase in the time it takes a system to pattern. Recently, it has been observed that in undelayed systems intrinsic stochasticity can cause pattern initiation to occur earlier than in the analogous deterministic simulations. Here we are interested in adding both stochasticity and delays to Turing systems in order to assess whether stochasticity can reduce the patterning time scale in delayed Turing systems. As analytical insights to this problem are difficult to attain and often limited in their use, we focus on stochastically simulating delayed systems. We consider four different Turing systems and two different forms of delay. Our results are mixed and lead to the conclusion that, although the sensitivity to delays in the Turing mechanism is not completely removed by the addition of intrinsic noise, the effects of the delays are clearly ameliorated in certain specific cases. © 2012 American Physical Society.

  14. Effects of intrinsic stochasticity on delayed reaction-diffusion patterning systems

    KAUST Repository

    Woolley, Thomas E.

    2012-05-22

    Cellular gene expression is a complex process involving many steps, including the transcription of DNA and translation of mRNA; hence the synthesis of proteins requires a considerable amount of time, from ten minutes to several hours. Since diffusion-driven instability has been observed to be sensitive to perturbations in kinetic delays, the application of Turing patterning mechanisms to the problem of producing spatially heterogeneous differential gene expression has been questioned. In deterministic systems a small delay in the reactions can cause a large increase in the time it takes a system to pattern. Recently, it has been observed that in undelayed systems intrinsic stochasticity can cause pattern initiation to occur earlier than in the analogous deterministic simulations. Here we are interested in adding both stochasticity and delays to Turing systems in order to assess whether stochasticity can reduce the patterning time scale in delayed Turing systems. As analytical insights to this problem are difficult to attain and often limited in their use, we focus on stochastically simulating delayed systems. We consider four different Turing systems and two different forms of delay. Our results are mixed and lead to the conclusion that, although the sensitivity to delays in the Turing mechanism is not completely removed by the addition of intrinsic noise, the effects of the delays are clearly ameliorated in certain specific cases. © 2012 American Physical Society.

  15. Turing patterns induced by cross-diffusion in a predator-prey system in presence of habitat complexity

    International Nuclear Information System (INIS)

    Ghorai, Santu; Poria, Swarup

    2016-01-01

    In this paper, we have investigated the phenomena of Turing pattern formation in a predator-prey model with habitat complexity in presence of cross diffusion. Using the linear stability analysis, the conditions for the existence of stationary pattern and the existence of Hopf bifurcation are obtained. It is shown analytically that the presence of cross diffusion in the system supports the formation of Turing pattern. Two parameter bifurcation analysis are done analytically and corresponding bifurcation diagrams are presented numerically. A series of simulation results are plotted for different biologically meaningful parameter values. Effects of variation of habitat complexity and the predator mortality rate and birth rate of prey on pattern formation are also reported. It is shown that cross-diffusion can lead to a wide variety of spatial and spatiotemporal pattern formation. It is found that the model exhibits spot and stripe pattern, and coexistence of both spot and strip patterns under the zero flux boundary condition. It is observed that cross-diffusion, habitat complexity, birth rate of prey and predator’s mortality rate play a significant role in the pattern formation of a distributed population system of predator-prey type.

  16. Chromatic graph theory

    CERN Document Server

    Chartrand, Gary; Rosen, Kenneth H

    2008-01-01

    Beginning with the origin of the four color problem in 1852, the field of graph colorings has developed into one of the most popular areas of graph theory. Introducing graph theory with a coloring theme, Chromatic Graph Theory explores connections between major topics in graph theory and graph colorings as well as emerging topics. This self-contained book first presents various fundamentals of graph theory that lie outside of graph colorings, including basic terminology and results, trees and connectivity, Eulerian and Hamiltonian graphs, matchings and factorizations, and graph embeddings. The remainder of the text deals exclusively with graph colorings. It covers vertex colorings and bounds for the chromatic number, vertex colorings of graphs embedded on surfaces, and a variety of restricted vertex colorings. The authors also describe edge colorings, monochromatic and rainbow edge colorings, complete vertex colorings, several distinguishing vertex and edge colorings, and many distance-related vertex coloring...

  17. Master stability functions reveal diffusion-driven pattern formation in networks

    Science.gov (United States)

    Brechtel, Andreas; Gramlich, Philipp; Ritterskamp, Daniel; Drossel, Barbara; Gross, Thilo

    2018-03-01

    We study diffusion-driven pattern formation in networks of networks, a class of multilayer systems, where different layers have the same topology, but different internal dynamics. Agents are assumed to disperse within a layer by undergoing random walks, while they can be created or destroyed by reactions between or within a layer. We show that the stability of homogeneous steady states can be analyzed with a master stability function approach that reveals a deep analogy between pattern formation in networks and pattern formation in continuous space. For illustration, we consider a generalized model of ecological meta-food webs. This fairly complex model describes the dispersal of many different species across a region consisting of a network of individual habitats while subject to realistic, nonlinear predator-prey interactions. In this example, the method reveals the intricate dependence of the dynamics on the spatial structure. The ability of the proposed approach to deal with this fairly complex system highlights it as a promising tool for ecology and other applications.

  18. Pattern formation, social forces, and diffusion instability in games with success-driven motion

    Science.gov (United States)

    Helbing, Dirk

    2009-02-01

    A local agglomeration of cooperators can support the survival or spreading of cooperation, even when cooperation is predicted to die out according to the replicator equation, which is often used in evolutionary game theory to study the spreading and disappearance of strategies. In this paper, it is shown that success-driven motion can trigger such local agglomeration and may, therefore, be used to supplement other mechanisms supporting cooperation, like reputation or punishment. Success-driven motion is formulated here as a function of the game-theoretical payoffs. It can change the outcome and dynamics of spatial games dramatically, in particular as it causes attractive or repulsive interaction forces. These forces act when the spatial distributions of strategies are inhomogeneous. However, even when starting with homogeneous initial conditions, small perturbations can trigger large inhomogeneities by a pattern-formation instability, when certain conditions are fulfilled. Here, these instability conditions are studied for the prisoner’s dilemma and the snowdrift game. Furthermore, it is demonstrated that asymmetrical diffusion can drive social, economic, and biological systems into the unstable regime, if these would be stable without diffusion.

  19. Apparent diffusion coefficient values and dynamic contrast enhancement patterns in differentiating seminomas from nonseminomatous testicular neoplasms

    International Nuclear Information System (INIS)

    Tsili, Athina C.; Sylakos, Anastasios; Ntorkou, Alexandra; Stavrou, Sotirios; Astrakas, Loukas G.; Sofikitis, Nikolaos; Argyropoulou, Maria I.

    2015-01-01

    Highlights: • Functional MRI in the characterization of testicular germ cell tumors was assessed. • ADC values proved useful in the characterization of testicular germ cell tumors. • Testicular germ cell tumors had similar enhancement patterns of dynamic MRI. - Abstract: Introduction: The aim of this study is to investigate the role of apparent diffusion coefficient (ADC) values and dynamic contrast enhancement (DCE) patterns in differentiating seminomas from nonseminomatous germ cell tumors (NSGCTs). Materials and methods: The MRI examinations of the scrotum of 26 men with histologically proven testicular GCTs were reviewed. DWI was performed in all patients, using a single shot, multi-slice spin-echo planar diffusion pulse sequence and b-values of 0 and 900 s/mm 2 . Subtraction DCE-MRI was performed in 20 cases using a 3D fast-field echo sequence after gadolinium administration. Time-signal intensity curves were created and semi-quantitative parameters (peak enhancement, time to peak, wash-in and wash-out rate) were calculated. The Student's t-test was used to compare the mean values of ADC, peak enhancement, time to peak, wash-in and wash-out rate between seminomas and NSGCTs. ROC analysis was also performed. Results: Histopathology disclosed the presence of 15 seminomas and 11 NSGCTs. The mean ± s.d. of ADC values (× 10 −3 mm 2 /s) of seminomas (0.59 ± 0.009) were significantly lower than those of NSGCTs (0.90 ± 0.33) (P = 0.01). The optimal ADC cut-off value was 0.68 × 10 −3 mm 2 /s. No differences between the two groups were observed for peak enhancement (P = 0.18), time to peak (P = 0.63) wash-in rate (P = 0.32) and wash-out rate (P = 0.18). Conclusions: ADC values may be used to preoperatively differentiate seminomas from NSGCTs

  20. Graphs, Ideal Flow, and the Transportation Network

    OpenAIRE

    Teknomo, Kardi

    2016-01-01

    This lecture discusses the mathematical relationship between network structure and network utilization of transportation network. Network structure means the graph itself. Network utilization represent the aggregation of trajectories of agents in using the network graph. I show the similarity and relationship between the structural pattern of the network and network utilization.

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

  2. Nonequilibrium transition and pattern formation in a linear reaction-diffusion system with self-regulated kinetics

    Science.gov (United States)

    Paul, Shibashis; Ghosh, Shyamolina; Ray, Deb Shankar

    2018-02-01

    We consider a reaction-diffusion system with linear, stochastic activator-inhibitor kinetics where the time evolution of concentration of a species at any spatial location depends on the relative average concentration of its neighbors. This self-regulating nature of kinetics brings in spatial correlation between the activator and the inhibitor. An interplay of this correlation in kinetics and disparity of diffusivities of the two species leads to symmetry breaking non-equilibrium transition resulting in stationary pattern formation. The role of initial noise strength and the linear reaction terms has been analyzed for pattern selection.

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

  4. A Study on Diffusion Pattern of Technology Convergence: Patent Analysis for Korea

    Directory of Open Access Journals (Sweden)

    Jae Young Choi

    2015-08-01

    Full Text Available Technology convergence indicates that technologies of different application areas are converted into a new and common unity of technology. Its range spans from inter-field, whereby technologies are converged between heterogeneous fields in homogeneous sector, to a wider inter-sector, whereby technologies belong to heterogeneous technology sector are converged. This paper determined the definition of technology convergence from previous literature and classified patents into technology category depending on patent information. Furthermore, we empirically measure technology convergence degree based on co-classification analysis and estimate its diffusion trend at the entire technology domain level by using overall 1,476,967 of patents filed to the KIPO (Korean Intellectual Property Office from 1998 to 2010. As a result, potential size and growth rate of technology convergence are varied by both technology and type of technology convergence, i.e., inter-field and inter-sector technology convergence. Diffusion pattern of inter-sector technology convergence appears as the more various form than that of inter-field technology convergence. In a relationship between potential size and growth rate of technology convergence, growth rate of technology convergence is in inverse proportion to potential size of technology convergence in general. That is, the faster the growth rate of technology convergence, the smaller the potential size of technology convergence. In addition, this paper found that technology convergence of the instrument and chemistry sector is actively progressing in both inter-field and inter-sector convergence, while the technologies related to Information and Communication Technology (ICT in electrical engineering sector have relatively mature progress of technology convergence, especially in inter-sector technology convergence.

  5. Apparent diffusion coefficient values and dynamic contrast enhancement patterns in differentiating seminomas from nonseminomatous testicular neoplasms

    Energy Technology Data Exchange (ETDEWEB)

    Tsili, Athina C., E-mail: a_tsili@yahoo.gr [Department of Radiology, Medical School, University of Ioannina, 45110 Ioannina (Greece); Sylakos, Anastasios, E-mail: anasylakos@yahoo.gr [Department of Urology, Medical School, University of Ioannina, 45110 Ioannina (Greece); Ntorkou, Alexandra, E-mail: alexdorkou@yahoo.com [Department of Radiology, Medical School, University of Ioannina, 45110 Ioannina (Greece); Stavrou, Sotirios, E-mail: s.sotiris@yahoo.gr [Department of Urology, Medical School, University of Ioannina, 45110 Ioannina (Greece); Astrakas, Loukas G., E-mail: astrakas@uoi.gr [Department of Medical Physics, Medical School, University of Ioannina, 45110 Ioannina (Greece); Sofikitis, Nikolaos, E-mail: akrosnin@hotmail.com [Department of Urology, Medical School, University of Ioannina, 45110 Ioannina (Greece); Argyropoulou, Maria I., E-mail: margyrop@cc.uoi.gr [Department of Radiology, Medical School, University of Ioannina, 45110 Ioannina (Greece)

    2015-07-15

    Highlights: • Functional MRI in the characterization of testicular germ cell tumors was assessed. • ADC values proved useful in the characterization of testicular germ cell tumors. • Testicular germ cell tumors had similar enhancement patterns of dynamic MRI. - Abstract: Introduction: The aim of this study is to investigate the role of apparent diffusion coefficient (ADC) values and dynamic contrast enhancement (DCE) patterns in differentiating seminomas from nonseminomatous germ cell tumors (NSGCTs). Materials and methods: The MRI examinations of the scrotum of 26 men with histologically proven testicular GCTs were reviewed. DWI was performed in all patients, using a single shot, multi-slice spin-echo planar diffusion pulse sequence and b-values of 0 and 900 s/mm{sup 2}. Subtraction DCE-MRI was performed in 20 cases using a 3D fast-field echo sequence after gadolinium administration. Time-signal intensity curves were created and semi-quantitative parameters (peak enhancement, time to peak, wash-in and wash-out rate) were calculated. The Student's t-test was used to compare the mean values of ADC, peak enhancement, time to peak, wash-in and wash-out rate between seminomas and NSGCTs. ROC analysis was also performed. Results: Histopathology disclosed the presence of 15 seminomas and 11 NSGCTs. The mean ± s.d. of ADC values (× 10{sup −3} mm{sup 2}/s) of seminomas (0.59 ± 0.009) were significantly lower than those of NSGCTs (0.90 ± 0.33) (P = 0.01). The optimal ADC cut-off value was 0.68 × 10{sup −3} mm{sup 2}/s. No differences between the two groups were observed for peak enhancement (P = 0.18), time to peak (P = 0.63) wash-in rate (P = 0.32) and wash-out rate (P = 0.18). Conclusions: ADC values may be used to preoperatively differentiate seminomas from NSGCTs.

  6. Real-time nonlinear feedback control of pattern formation in (bio)chemical reaction-diffusion processes: a model study.

    Science.gov (United States)

    Brandt-Pollmann, U; Lebiedz, D; Diehl, M; Sager, S; Schlöder, J

    2005-09-01

    Theoretical and experimental studies related to manipulation of pattern formation in self-organizing reaction-diffusion processes by appropriate control stimuli become increasingly important both in chemical engineering and cellular biochemistry. In a model study, we demonstrate here exemplarily the application of an efficient nonlinear model predictive control (NMPC) algorithm to real-time optimal feedback control of pattern formation in a bacterial chemotaxis system modeled by nonlinear partial differential equations. The corresponding drift-diffusion model type is representative for many (bio)chemical systems involving nonlinear reaction dynamics and nonlinear diffusion. We show how the computed optimal feedback control strategy exploits the system inherent physical property of wave propagation to achieve desired control aims. We discuss various applications of our approach to optimal control of spatiotemporal dynamics.

  7. Identifying diffusion patterns of research articles on Twitter: A case study of online engagement with open access articles.

    Science.gov (United States)

    Alperin, Juan Pablo; Gomez, Charles J; Haustein, Stefanie

    2018-03-01

    The growing presence of research shared on social media, coupled with the increase in freely available research, invites us to ask whether scientific articles shared on platforms like Twitter diffuse beyond the academic community. We explore a new method for answering this question by identifying 11 articles from two open access biology journals that were shared on Twitter at least 50 times and by analyzing the follower network of users who tweeted each article. We find that diffusion patterns of scientific articles can take very different forms, even when the number of times they are tweeted is similar. Our small case study suggests that most articles are shared within single-connected communities with limited diffusion to the public. The proposed approach and indicators can serve those interested in the public understanding of science, science communication, or research evaluation to identify when research diffuses beyond insular communities.

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

  9. Inferring ontology graph structures using OWL reasoning

    KAUST Repository

    Rodriguez-Garcia, Miguel Angel; Hoehndorf, Robert

    2018-01-01

    ' semantic content remains a challenge.We developed a method to transform ontologies into graphs using an automated reasoner while taking into account all relations between classes. Searching for (existential) patterns in the deductive closure of ontologies

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

  11. Trajectories entropy in dynamical graphs with memory

    Directory of Open Access Journals (Sweden)

    Francesco eCaravelli

    2016-04-01

    Full Text Available In this paper we investigate the application of non-local graph entropy to evolving and dynamical graphs. The measure is based upon the notion of Markov diffusion on a graph, and relies on the entropy applied to trajectories originating at a specific node. In particular, we study the model of reinforcement-decay graph dynamics, which leads to scale free graphs. We find that the node entropy characterizes the structure of the network in the two parameter phase-space describing the dynamical evolution of the weighted graph. We then apply an adapted version of the entropy measure to purely memristive circuits. We provide evidence that meanwhile in the case of DC voltage the entropy based on the forward probability is enough to characterize the graph properties, in the case of AC voltage generators one needs to consider both forward and backward based transition probabilities. We provide also evidence that the entropy highlights the self-organizing properties of memristive circuits, which re-organizes itself to satisfy the symmetries of the underlying graph.

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

  13. Application of graph theory to the morphological analysis of settlements

    OpenAIRE

    Szmytkie Robert

    2017-01-01

    In the following paper, the analyses of morphology of settlements were conducted using graph methods. The intention of the author was to create a quantifiable and simple measure, which, in a quantitative way, would express the degree of development of a graph (the spatial pattern of settlement). When analysing examples of graphs assigned to a set of small towns and large villages, it was noticed that the graph development index should depend on: a relative number of edges in relation to the n...

  14. Using Graph Components Derived from an Associative Concept Dictionary to Predict fMRI Neural Activation Patterns that Represent the Meaning of Nouns.

    Directory of Open Access Journals (Sweden)

    Hiroyuki Akama

    Full Text Available In this study, we introduce an original distance definition for graphs, called the Markov-inverse-F measure (MiF. This measure enables the integration of classical graph theory indices with new knowledge pertaining to structural feature extraction from semantic networks. MiF improves the conventional Jaccard and/or Simpson indices, and reconciles both the geodesic information (random walk and co-occurrence adjustment (degree balance and distribution. We measure the effectiveness of graph-based coefficients through the application of linguistic graph information for a neural activity recorded during conceptual processing in the human brain. Specifically, the MiF distance is computed between each of the nouns used in a previous neural experiment and each of the in-between words in a subgraph derived from the Edinburgh Word Association Thesaurus of English. From the MiF-based information matrix, a machine learning model can accurately obtain a scalar parameter that specifies the degree to which each voxel in (the MRI image of the brain is activated by each word or each principal component of the intermediate semantic features. Furthermore, correlating the voxel information with the MiF-based principal components, a new computational neurolinguistics model with a network connectivity paradigm is created. This allows two dimensions of context space to be incorporated with both semantic and neural distributional representations.

  15. Incremental View Maintenance for Deductive Graph Databases Using Generalized Discrimination Networks

    Directory of Open Access Journals (Sweden)

    Thomas Beyhl

    2016-12-01

    Full Text Available Nowadays, graph databases are employed when relationships between entities are in the scope of database queries to avoid performance-critical join operations of relational databases. Graph queries are used to query and modify graphs stored in graph databases. Graph queries employ graph pattern matching that is NP-complete for subgraph isomorphism. Graph database views can be employed that keep ready answers in terms of precalculated graph pattern matches for often stated and complex graph queries to increase query performance. However, such graph database views must be kept consistent with the graphs stored in the graph database. In this paper, we describe how to use incremental graph pattern matching as technique for maintaining graph database views. We present an incremental maintenance algorithm for graph database views, which works for imperatively and declaratively specified graph queries. The evaluation shows that our maintenance algorithm scales when the number of nodes and edges stored in the graph database increases. Furthermore, our evaluation shows that our approach can outperform existing approaches for the incremental maintenance of graph query results.

  16. Cellular automata for spatiotemporal pattern formation from reaction–diffusion partial differential equations

    International Nuclear Information System (INIS)

    Ohmori, Shousuke; Yamazaki, Yoshihiro

    2016-01-01

    Ultradiscrete equations are derived from a set of reaction–diffusion partial differential equations, and cellular automaton rules are obtained on the basis of the ultradiscrete equations. Some rules reproduce the dynamical properties of the original reaction–diffusion equations, namely, bistability and pulse annihilation. Furthermore, other rules bring about soliton-like preservation and periodic pulse generation with a pacemaker, which are not obtained from the original reaction–diffusion equations. (author)

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

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

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

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

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

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

  3. Strain Map of the Tongue in Normal and ALS Speech Patterns from Tagged and Diffusion MRI.

    Science.gov (United States)

    Xing, Fangxu; Prince, Jerry L; Stone, Maureen; Reese, Timothy G; Atassi, Nazem; Wedeen, Van J; El Fakhri, Georges; Woo, Jonghye

    2018-02-01

    Amyotrophic Lateral Sclerosis (ALS) is a neurological disease that causes death of neurons controlling muscle movements. Loss of speech and swallowing functions is a major impact due to degeneration of the tongue muscles. In speech studies using magnetic resonance (MR) techniques, diffusion tensor imaging (DTI) is used to capture internal tongue muscle fiber structures in three-dimensions (3D) in a non-invasive manner. Tagged magnetic resonance images (tMRI) are used to record tongue motion during speech. In this work, we aim to combine information obtained with both MR imaging techniques to compare the functionality characteristics of the tongue between normal and ALS subjects. We first extracted 3D motion of the tongue using tMRI from fourteen normal subjects in speech. The estimated motion sequences were then warped using diffeomorphic registration into the b0 spaces of the DTI data of two normal subjects and an ALS patient. We then constructed motion atlases by averaging all warped motion fields in each b0 space, and computed strain in the line of action along the muscle fiber directions provided by tractography. Strain in line with the fiber directions provides a quantitative map of the potential active region of the tongue during speech. Comparison between normal and ALS subjects explores the changing volume of compressing tongue tissues in speech facing the situation of muscle degradation. The proposed framework provides for the first time a dynamic map of contracting fibers in ALS speech patterns, and has the potential to provide more insight into the detrimental effects of ALS on speech.

  4. OPEX: Optimized Eccentricity Computation in Graphs

    Energy Technology Data Exchange (ETDEWEB)

    Henderson, Keith [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)

    2011-11-14

    Real-world graphs have many properties of interest, but often these properties are expensive to compute. We focus on eccentricity, radius and diameter in this work. These properties are useful measures of the global connectivity patterns in a graph. Unfortunately, computing eccentricity for all nodes is O(n2) for a graph with n nodes. We present OPEX, a novel combination of optimizations which improves computation time of these properties by orders of magnitude in real-world experiments on graphs of many different sizes. We run OPEX on graphs with up to millions of links. OPEX gives either exact results or bounded approximations, unlike its competitors which give probabilistic approximations or sacrifice node-level information (eccentricity) to compute graphlevel information (diameter).

  5. Hierarchical Bayesian modeling of the space - time diffusion patterns of cholera epidemic in Kumasi, Ghana

    NARCIS (Netherlands)

    Osei, Frank B.; Osei, F.B.; Duker, Alfred A.; Stein, A.

    2011-01-01

    This study analyses the joint effects of the two transmission routes of cholera on the space-time diffusion dynamics. Statistical models are developed and presented to investigate the transmission network routes of cholera diffusion. A hierarchical Bayesian modelling approach is employed for a joint

  6. Understanding spatial and temporal patterning of astrocyte calcium transients via interactions between network transport and extracellular diffusion

    Science.gov (United States)

    Shtrahman, E.; Maruyama, D.; Olariu, E.; Fink, C. G.; Zochowski, M.

    2017-02-01

    Astrocytes form interconnected networks in the brain and communicate via calcium signaling. We investigate how modes of coupling between astrocytes influence the spatio-temporal patterns of calcium signaling within astrocyte networks and specifically how these network interactions promote coordination within this group of cells. To investigate these complex phenomena, we study reduced cultured networks of astrocytes and neurons. We image the spatial temporal patterns of astrocyte calcium activity and quantify how perturbing the coupling between astrocytes influences astrocyte activity patterns. To gain insight into the pattern formation observed in these cultured networks, we compare the experimentally observed calcium activity patterns to the patterns produced by a reduced computational model, where we represent astrocytes as simple units that integrate input through two mechanisms: gap junction coupling (network transport) and chemical release (extracellular diffusion). We examine the activity patterns in the simulated astrocyte network and their dependence upon these two coupling mechanisms. We find that gap junctions and extracellular chemical release interact in astrocyte networks to modulate the spatiotemporal patterns of their calcium dynamics. We show agreement between the computational and experimental findings, which suggests that the complex global patterns can be understood as a result of simple local coupling mechanisms.

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

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

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

  10. Use of blood-pool imaging in evaluation of diffuse activity patterns in technetium-99m pyrophosphate myocardial scintigraphy.

    Science.gov (United States)

    Cowley, M J; Mantle, J A; Rogers, W J; Russell, R O; Rackley, C E; Logic, J R

    1979-06-01

    It has been suggested that diffuse Tc-99m pyrophosphate precordial activity may be due to persistent blood-pool activity in routine delayed views during myocardial imaging. To answer this question, we reviewed myocardial scintigrams recorded 60--90 min following the injection of 12--15 mCi of Tc-99m pyrophosphate for the presence of diffuse precordial activity, and compared these with early images of the blood pool in 265 patients. Diffuse activity in the delayed images was identified in 48 patients: in 20 with acute myocardial infarction and in 28 with no evidence of it. Comparison of these routine delayed images with early views of the blood pool revealed two types of patterns. In patients with acute infarction, 95% had delayed images that were distinguishable from blood pool either because the activity was smaller than the early blood pool, or by the presence of localized activity superimposed on diffuse activity identical to blood pool. In those without infarction, 93% had activity distribution in routine delayed views matching that in the early blood-pool images. The usefulness of the diffuse TcPPi precordial activity in myocardial infarction is improved when early blood-pool imaging is used to exclude persistence of blood-pool activity as its cause. Moreover, it does not require additional amounts of radioactivity nor complex computer processing, a feature that may be of value in the community hospital using the technique to "rule out" infarction 24--72 hr after onset of suggestive symptoms.

  11. Use of blood-pool imaging in evaluation of diffuse activity patterns in technetium-99m pyrophosphate myocardial scintigraphy

    International Nuclear Information System (INIS)

    Cowley, M.J.; Mantle, J.A.; Rogers, W.J.; Russell, R.O. Jr.; Rackley, C.E.; Logic, J.R.

    1979-01-01

    It has been suggested that diffuse 99m Tc pyrophosphate precordial activity may be due to persistent blood-pool activity in routine delayed views during myocardial imaging. To answer this question, we reviewed myocardial scintigrams recorded 60 to 90 min following the injection of 12 to 15 mCi of 99m Tc pyrophosphate for the presence of diffuse precordial activity, and compared these with early images of the blood pool in 265 patients. Diffuse activity in the delayed images was identified in 48 patients: in 20 with acute myocardial infarction and in 28 with no evidence of it. Comparison of these routine delayed images with early views of the blood pool revealed two types of patterns. In patients with acute infarction, 95% had delayed images that were distinguishable from blood pool either because the activity was smaller than the early blood pool, or by the presence of localized activity superimposed on diffuse activity identical to blood pool. In those without infarction, 93% had activity distribution in routine delayed views matching that in the early blood-pool images. The usefulness of the diffuse TcPPi precordial activity in myocardial infarction is improved when early blood-pool imaging is used to exclude persistence of blood-pool activity as its cause. Moreover, it does not require additional amounts of radioactivity nor complex computer processing, a feature that may be of value in the community hospital using the technique to rule out infarction 24 to 72 hr after onset of suggestive symptoms

  12. Wave of chaos in a diffusive system: Generating realistic patterns of patchiness in plankton-fish dynamics

    International Nuclear Information System (INIS)

    Upadhyay, Ranjit Kumar; Kumari, Nitu; Rai, Vikas

    2009-01-01

    We show that wave of chaos (WOC) can generate two-dimensional time-independent spatial patterns which can be a potential candidate for understanding planktonic patchiness observed in marine environments. These spatio-temporal patterns were obtained in computer simulations of a minimal model of phytoplankton-zooplankton dynamics driven by forces of diffusion. We also attempt to figure out the average lifetimes of these non-linear non-equilibrium patterns. These spatial patterns serve as a realistic model for patchiness found in aquatic systems (e.g., marine and oceanic). Additionally, spatio-temporal chaos produced by bi-directional WOCs is robust to changes in key parameters of the system; e.g., intra-specific competition among individuals of phytoplankton and the rate of fish predation. The ideas contained in the present paper may find applications in diverse fields of human endeavor.

  13. Diffusion Patterns in Convergence among High-Technology Industries: A Co-Occurrence-Based Analysis of Newspaper Article Data

    Directory of Open Access Journals (Sweden)

    Hyeokseong Lee

    2016-10-01

    Full Text Available Firms in high-technology industries have faced great technological and market uncertainty and volatility in the past few decades. In order to be competitive and sustainable in this environment, firms have been pursuing technological innovation, product differentiation, vertical integration, and alliances, which eventually drive industry convergence, defined as the process of blurring boundaries between previously distinct industries. Although industry convergence has greatly affected industrial structure and the economy, little research has investigated this phenomenon, especially its diffusion patterns; thus, it is still unclear which industries are converging more rapidly or have a higher potential for convergence. This paper explores these issues by investigating industry convergence in U.S. high-technology industries, using a large set of newspaper articles from 1987 to 2012. We perform a co-occurrence-based analysis to obtain information on industry convergence and estimate its diffusion patterns using an internal-influence logistic model. We find heterogeneous diffusion patterns, depending on convergent-industry pairs and their wide dispersion. In addition, we find that the potential degree of industry convergence is significantly negatively associated with its growth rate, which indicates that a great deal of time will be required for industry convergence between high-technology industries with this high potential to achieve a high degree of convergence.

  14. Graph Processing on GPUs: A Survey

    DEFF Research Database (Denmark)

    Shi, Xuanhua; Zheng, Zhigao; Zhou, Yongluan

    2018-01-01

    hundreds of billions, has attracted much attention in both industry and academia. It still remains a great challenge to process such large-scale graphs. Researchers have been seeking for new possible solutions. Because of the massive degree of parallelism and the high memory access bandwidth in GPU......, utilizing GPU to accelerate graph processing proves to be a promising solution. This article surveys the key issues of graph processing on GPUs, including data layout, memory access pattern, workload mapping, and specific GPU programming. In this article, we summarize the state-of-the-art research on GPU...

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

  16. Outer-totalistic cellular automata on graphs

    International Nuclear Information System (INIS)

    Marr, Carsten; Huett, Marc-Thorsten

    2009-01-01

    We present an intuitive formalism for implementing cellular automata on arbitrary topologies. By that means, we identify a symmetry operation in the class of elementary cellular automata. Moreover, we determine the subset of topologically sensitive elementary cellular automata and find that the overall number of complex patterns decreases under increasing neighborhood size in regular graphs. As exemplary applications, we apply the formalism to complex networks and compare the potential of scale-free graphs and metabolic networks to generate complex dynamics

  17. Pattern formation and control of spatiotemporal chaos in a reaction diffusion prey–predator system supplying additional food

    International Nuclear Information System (INIS)

    Ghorai, Santu; Poria, Swarup

    2016-01-01

    Spatiotemporal dynamics of a predator–prey system in presence of spatial diffusion is investigated in presence of additional food exists for predators. Conditions for stability of Hopf as well as Turing patterns in a spatial domain are determined by making use of the linear stability analysis. Impact of additional food is clear from these conditions. Numerical simulation results are presented in order to validate the analytical findings. Finally numerical simulations are carried out around the steady state under zero flux boundary conditions. With the help of numerical simulations, the different types of spatial patterns (including stationary spatial pattern, oscillatory pattern, and spatiotemporal chaos) are identified in this diffusive predator–prey system in presence of additional food, depending on the quantity, quality of the additional food and the spatial domain and other parameters of the model. The key observation is that spatiotemporal chaos can be controlled supplying suitable additional food to predator. These investigations may be useful to understand complex spatiotemporal dynamics of population dynamical models in presence of additional food.

  18. Inferring ontology graph structures using OWL reasoning

    KAUST Repository

    Rodriguez-Garcia, Miguel Angel

    2018-01-05

    Ontologies are representations of a conceptualization of a domain. Traditionally, ontologies in biology were represented as directed acyclic graphs (DAG) which represent the backbone taxonomy and additional relations between classes. These graphs are widely exploited for data analysis in the form of ontology enrichment or computation of semantic similarity. More recently, ontologies are developed in a formal language such as the Web Ontology Language (OWL) and consist of a set of axioms through which classes are defined or constrained. While the taxonomy of an ontology can be inferred directly from the axioms of an ontology as one of the standard OWL reasoning tasks, creating general graph structures from OWL ontologies that exploit the ontologies\\' semantic content remains a challenge.We developed a method to transform ontologies into graphs using an automated reasoner while taking into account all relations between classes. Searching for (existential) patterns in the deductive closure of ontologies, we can identify relations between classes that are implied but not asserted and generate graph structures that encode for a large part of the ontologies\\' semantic content. We demonstrate the advantages of our method by applying it to inference of protein-protein interactions through semantic similarity over the Gene Ontology and demonstrate that performance is increased when graph structures are inferred using deductive inference according to our method. Our software and experiment results are available at http://github.com/bio-ontology-research-group/Onto2Graph .Onto2Graph is a method to generate graph structures from OWL ontologies using automated reasoning. The resulting graphs can be used for improved ontology visualization and ontology-based data analysis.

  19. Inferring ontology graph structures using OWL reasoning.

    Science.gov (United States)

    Rodríguez-García, Miguel Ángel; Hoehndorf, Robert

    2018-01-05

    Ontologies are representations of a conceptualization of a domain. Traditionally, ontologies in biology were represented as directed acyclic graphs (DAG) which represent the backbone taxonomy and additional relations between classes. These graphs are widely exploited for data analysis in the form of ontology enrichment or computation of semantic similarity. More recently, ontologies are developed in a formal language such as the Web Ontology Language (OWL) and consist of a set of axioms through which classes are defined or constrained. While the taxonomy of an ontology can be inferred directly from the axioms of an ontology as one of the standard OWL reasoning tasks, creating general graph structures from OWL ontologies that exploit the ontologies' semantic content remains a challenge. We developed a method to transform ontologies into graphs using an automated reasoner while taking into account all relations between classes. Searching for (existential) patterns in the deductive closure of ontologies, we can identify relations between classes that are implied but not asserted and generate graph structures that encode for a large part of the ontologies' semantic content. We demonstrate the advantages of our method by applying it to inference of protein-protein interactions through semantic similarity over the Gene Ontology and demonstrate that performance is increased when graph structures are inferred using deductive inference according to our method. Our software and experiment results are available at http://github.com/bio-ontology-research-group/Onto2Graph . Onto2Graph is a method to generate graph structures from OWL ontologies using automated reasoning. The resulting graphs can be used for improved ontology visualization and ontology-based data analysis.

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

  1. An adopter-centric approach to analyze the diffusion patterns of innovative residential heating systems in Sweden

    International Nuclear Information System (INIS)

    Mahapatra, Krushna; Gustavsson, Leif

    2008-01-01

    Innovation and diffusion of renewable energy technologies play a major role in mitigation of climate change. In Sweden replacing electric and oil heating systems with innovative heating systems such as district heating, heat pumps and wood pellet boilers in detached homes is a significant mitigation option. Using an adopter-centric approach, we analyzed the influence of investment subsidy on conversion of resistance heaters and oil boilers, and the variation in diffusion pattern of district heating, heat pumps and pellet boilers in Swedish detached homes. Results from questionnaire surveys of 1500 randomly selected homeowners in September 2004 and January 2007 showed that more than 80% of the respondents did not intend to install a new heating system. Hence, about 37% of the homeowners still have electric and oil heating systems. The government investment subsidy was important for conversion from a resistance heater, but not from an oil boiler. This is because homeowners currently replacing their oil boilers are the laggards, while those replacing resistance heaters are the 'early adopters'. Economic aspects and functional reliability were the most important factors for the homeowners when considering a new heating system. There is a variation in the perceived advantages associated with each of the innovative heating systems and therefore, the diffusion patterns of such systems vary. Installers and interpersonal sources were the most important communication channels for information on heating systems

  2. An adopter-centric approach to analyze the diffusion patterns of innovative residential heating systems in Sweden

    Energy Technology Data Exchange (ETDEWEB)

    Mahapatra, Krushna; Gustavsson, Leif [Ecotechnology, Mid Sweden University, 831 25 Oestersund (Sweden)

    2008-02-15

    Innovation and diffusion of renewable energy technologies play a major role in mitigation of climate change. In Sweden replacing electric and oil heating systems with innovative heating systems such as district heating, heat pumps and wood pellet boilers in detached homes is a significant mitigation option. Using an adopter-centric approach, we analyzed the influence of investment subsidy on conversion of resistance heaters and oil boilers, and the variation in diffusion pattern of district heating, heat pumps and pellet boilers in Swedish detached homes. Results from questionnaire surveys of 1500 randomly selected homeowners in September 2004 and January 2007 showed that more than 80% of the respondents did not intend to install a new heating system. Hence, about 37% of the homeowners still have electric and oil heating systems. The government investment subsidy was important for conversion from a resistance heater, but not from an oil boiler. This is because homeowners currently replacing their oil boilers are the laggards, while those replacing resistance heaters are the 'early adopters'. Economic aspects and functional reliability were the most important factors for the homeowners when considering a new heating system. There is a variation in the perceived advantages associated with each of the innovative heating systems and therefore, the diffusion patterns of such systems vary. Installers and interpersonal sources were the most important communication channels for information on heating systems. (author)

  3. An Unusual Radiologic Pattern of Cryptogenic Organizing Pneumonia: Diffuse Pulmonary Nodules in a Leukemia Patient

    Energy Technology Data Exchange (ETDEWEB)

    Ko, Kai Hsiung; Hsu, Hsian He; Kao, Woei Yau; Chang, Ching Feng; Cheng, Ming Fang; Huang, Guo Shu [Tri-Service General Hospital, Taipei (China)

    2009-02-15

    The radiological appearance of diffuse discrete pulmonary nodules associated with cryptogenic organizing pneumonia (COP) has been rarely described. We describe a case of COP in 49-year-old woman with acute myeloid leukemia who developed diffuse pulmonary nodules during the second course of induction chemotherapy. The clinical status of the patient and imaging findings suggested the presence of a pulmonary metastasis or infectious disease. A video-assisted thoracoscopic lung biopsy resulted in the unexpected diagnosis of COP as an isolated entity. Steroid therapy led to dramatic improvement of the clinical symptoms and the pulmonary lesions.

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

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

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

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

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

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

  10. GRAMI: Generalized Frequent Subgraph Mining in Large Graphs

    KAUST Repository

    El Saeedy, Mohammed El Sayed

    2011-07-24

    Mining frequent subgraphs is an important operation on graphs. Most existing work assumes a database of many small graphs, but modern applications, such as social networks, citation graphs or protein-protein interaction in bioinformatics, are modeled as a single large graph. Interesting interactions in such applications may be transitive (e.g., friend of a friend). Existing methods, however, search for frequent isomorphic (i.e., exact match) subgraphs and cannot discover many useful patterns. In this paper we propose GRAMI, a framework that generalizes frequent subgraph mining in a large single graph. GRAMI discovers frequent patterns. A pattern is a graph where edges are generalized to distance-constrained paths. Depending on the definition of the distance function, many instantiations of the framework are possible. Both directed and undirected graphs, as well as multiple labels per vertex, are supported. We developed an efficient implementation of the framework that models the frequency resolution phase as a constraint satisfaction problem, in order to avoid the costly enumeration of all instances of each pattern in the graph. We also implemented CGRAMI, a version that supports structural and semantic constraints; and AGRAMI, an approximate version that supports very large graphs. Our experiments on real data demonstrate that our framework is up to 3 orders of magnitude faster and discovers more interesting patterns than existing approaches.

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

  12. Diffusion archeology for diffusion progression history reconstruction

    OpenAIRE

    Sefer, Emre; Kingsford, Carl

    2015-01-01

    Diffusion through graphs can be used to model many real-world processes, such as the spread of diseases, social network memes, computer viruses, or water contaminants. Often, a real-world diffusion cannot be directly observed while it is occurring — perhaps it is not noticed until some time has passed, continuous monitoring is too costly, or privacy concerns limit data access. This leads to the need to reconstruct how the present state of the diffusion came to be from partial d...

  13. Airflow Pattern and Performance Analysis of Diffuse Ceiling Ventilation in an Office Room using CFD Study

    DEFF Research Database (Denmark)

    Zhang, Chen; Chen, Qingyan; Heiselberg, Per Kvols

    2015-01-01

    geometrical model and the other is a porous media model. The numerical models are validated by the full-scale experimental studies in a climate chamber. The results indicate that porous media model performed better on predicting air flow characteristic below diffuse ceiling and air velocity near the floor...

  14. Reaction-Diffusion Automata Phenomenology, Localisations, Computation

    CERN Document Server

    Adamatzky, Andrew

    2013-01-01

    Reaction-diffusion and excitable media are amongst most intriguing substrates. Despite apparent simplicity of the physical processes involved the media exhibit a wide range of amazing patterns: from target and spiral waves to travelling localisations and stationary breathing patterns. These media are at the heart of most natural processes, including morphogenesis of living beings, geological formations, nervous and muscular activity, and socio-economic developments.   This book explores a minimalist paradigm of studying reaction-diffusion and excitable media using locally-connected networks of finite-state machines: cellular automata and automata on proximity graphs. Cellular automata are marvellous objects per se because they show us how to generate and manage complexity using very simple rules of dynamical transitions. When combined with the reaction-diffusion paradigm the cellular automata become an essential user-friendly tool for modelling natural systems and designing future and emergent computing arch...

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

  16. Representation of activity in images using geospatial temporal graphs

    Science.gov (United States)

    Brost, Randolph; McLendon, III, William C.; Parekh, Ojas D.; Rintoul, Mark Daniel; Watson, Jean-Paul; Strip, David R.; Diegert, Carl

    2018-05-01

    Various technologies pertaining to modeling patterns of activity observed in remote sensing images using geospatial-temporal graphs are described herein. Graphs are constructed by representing objects in remote sensing images as nodes, and connecting nodes with undirected edges representing either distance or adjacency relationships between objects and directed edges representing changes in time. Activity patterns may be discerned from the graphs by coding nodes representing persistent objects like buildings differently from nodes representing ephemeral objects like vehicles, and examining the geospatial-temporal relationships of ephemeral nodes within the graph.

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

  18. Longitudinal Diffusion Tensor Imaging Resembles Patterns of Pathology Progression in Behavioral Variant Frontotemporal Dementia (bvFTD

    Directory of Open Access Journals (Sweden)

    Jan Kassubek

    2018-03-01

    Full Text Available Objective: Recently, the characteristic longitudinal distribution pattern of the underlying phosphorylated TDP-43 (pTDP-43 pathology in the behavioral variant of frontotemporal dementia (bvFTD excluding Pick's disease (PiD across specific brain regions was described. The aim of the present study was to investigate whether in vivo investigations of bvFTD patients by use of diffusion tensor imaging (DTI were consistent with these proposed patterns of progression.Methods: Sixty-two bvFTD patients and 47 controls underwent DTI in a multicenter study design. Of these, 49 bvFTD patients and 34 controls had a follow-up scan after ~12 months. Cross-sectional and longitudinal alterations were assessed by a two-fold analysis, i.e., voxelwise comparison of fractional anisotropy (FA maps and a tract of interest-based (TOI approach, which identifies tract structures that could be assigned to brain regions associated with disease progression.Results: Whole brain-based spatial statistics showed white matter alterations predominantly in the frontal lobes cross-sectionally and longitudinally. The TOIs of bvFTD neuroimaging stages 1 and 2 (uncinate fascicle—bvFTD pattern I; corticostriatal pathway—bvFTD pattern II showed highly significant differences between bvFTD patients and controls. The corticospinal tract-associated TOI (bvFTD pattern III did not differ between groups, whereas the differences in the optic radiation (bvFTD pattern IV reached significance. The findings in the corticospinal tract were due to a “dichotomous” behavior of FA changes there.Conclusion: Longitudinal TOI analysis demonstrated a pattern of white matter pathways alterations consistent with patterns of pTDP-43 pathology.

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

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

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

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

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

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

  5. Information geometric analysis of phase transitions in complex patterns: the case of the Gray-Scott reaction–diffusion model

    International Nuclear Information System (INIS)

    Har-Shemesh, Omri; Quax, Rick; Hoekstra, Alfons G; Sloot, Peter M A

    2016-01-01

    The Fisher–Rao metric from information geometry is related to phase transition phenomena in classical statistical mechanics. Several studies propose to extend the use of information geometry to study more general phase transitions in complex systems. However, it is unclear whether the Fisher–Rao metric does indeed detect these more general transitions, especially in the absence of a statistical model. In this paper we study the transitions between patterns in the Gray-Scott reaction–diffusion model using Fisher information. We describe the system by a probability density function that represents the size distribution of blobs in the patterns and compute its Fisher information with respect to changing the two rate parameters of the underlying model. We estimate the distribution non-parametrically so that we do not assume any statistical model. The resulting Fisher map can be interpreted as a phase-map of the different patterns. Lines with high Fisher information can be considered as boundaries between regions of parameter space where patterns with similar characteristics appear. These lines of high Fisher information can be interpreted as phase transitions between complex patterns. (paper: disordered systems, classical and quantum)

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

  7. The many faces of graph dynamics

    Science.gov (United States)

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

    2017-06-01

    The topological structure of complex networks has fascinated researchers for several decades, resulting in the discovery of many universal properties and reoccurring characteristics of different kinds of networks. However, much less is known today about the network dynamics: indeed, complex networks in reality are not static, but rather dynamically evolve over time. Our paper is motivated by the empirical observation that network evolution patterns seem far from random, but exhibit structure. Moreover, the specific patterns appear to depend on the network type, contradicting the existence of a ‘one fits it all’ model. However, we still lack observables to quantify these intuitions, as well as metrics to compare graph evolutions. Such observables and metrics are needed for extrapolating or predicting evolutions, as well as for interpolating graph evolutions. To explore the many faces of graph dynamics and to quantify temporal changes, this paper suggests to build upon the concept of centrality, a measure of node importance in a network. In particular, we introduce the notion of centrality distance, a natural similarity measure for two graphs which depends on a given centrality, characterizing the graph type. Intuitively, centrality distances reflect the extent to which (non-anonymous) node roles are different or, in case of dynamic graphs, have changed over time, between two graphs. We evaluate the centrality distance approach for five evolutionary models and seven real-world social and physical networks. Our results empirically show the usefulness of centrality distances for characterizing graph dynamics compared to a null-model of random evolution, and highlight the differences between the considered scenarios. Interestingly, our approach allows us to compare the dynamics of very different networks, in terms of scale and evolution speed.

  8. A novel method to achieve selective emitter for silicon solar cell using low cost pattern-able a-Si thin films as the semi-transparent phosphorus diffusion barrier

    International Nuclear Information System (INIS)

    Chen, Da Ming; Liang, Zong Cun; Zhuang, Lin; Lin, Yang Huan; Shen, Hui

    2012-01-01

    Highlights: ► a-Si thin films as semitransparent phosphorus diffusion barriers for solar cell. ► a-Si thin films on silicon wafers were patterned by the alkaline solution. ► Selective emitter was formed with patterned a-Si as diffusion barrier for solar cell. -- Abstract: Selective emitter for silicon solar cell was realized by employing a-Si thin films as the semi-transparent diffusion barrier. The a-Si thin films with various thicknesses (∼10–40 nm) were deposited by the electron-beam evaporation technique. Emitters with sheet resistances from 37 to 145 Ω/□ were obtained via POCl 3 diffusion process. The thickness of the a-Si diffusion barrier was optimized to be 15 nm for selective emitter in our work. Homemade mask which can dissolve in ethanol was screen-printed on a-Si film to make pattern. The a-Si film was then patterned in KOH solution to form finger-like design. Selective emitter was obtainable with one-step diffusion with patterned a-Si film on. Combinations of sheet resistances for the high-/low-level doped regions of 39.8/112.1, 36.2/88.8, 35.4/73.9 were obtained. These combinations are suitable for screen-printed solar cells. This preparation method of selective emitter based on a-Si diffusion barrier is a promising approach for low cost industrial manufacturing.

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

  10. Evolutionary games on graphs

    Science.gov (United States)

    Szabó, György; Fáth, Gábor

    2007-07-01

    Game theory is one of the key paradigms behind many scientific disciplines from biology to behavioral sciences to economics. In its evolutionary form and especially when the interacting agents are linked in a specific social network the underlying solution concepts and methods are very similar to those applied in non-equilibrium statistical physics. This review gives a tutorial-type overview of the field for physicists. The first four sections introduce the necessary background in classical and evolutionary game theory from the basic definitions to the most important results. The fifth section surveys the topological complications implied by non-mean-field-type social network structures in general. The next three sections discuss in detail the dynamic behavior of three prominent classes of models: the Prisoner's Dilemma, the Rock-Scissors-Paper game, and Competing Associations. The major theme of the review is in what sense and how the graph structure of interactions can modify and enrich the picture of long term behavioral patterns emerging in evolutionary games.

  11. Spiral patterns near Turing instability in a discrete reaction diffusion system

    International Nuclear Information System (INIS)

    Li, Meifeng; Han, Bo; Xu, Li; Zhang, Guang

    2013-01-01

    In this paper, linear stability analysis is applied to an exponential discrete Lotka–Volterra system, which describes the competition between two identical species. Conditions for the Turing instability are obtained and the emergence of spiral patterns is demonstrated by means of numerical simulations in the vicinity of the bifurcation point. Moreover, the impact of crucial system parameters on the stability and coherence of spiral patterns is illustrated on several examples

  12. MOSS-5: A Fast Method of Approximating Counts of 5-Node Graphlets in Large Graphs

    KAUST Repository

    Wang, Pinghui; Zhao, Junzhou; Zhang, Xiangliang; Li, Zhenguo; Cheng, Jiefeng; Lui, John C.S.; Towsley, Don; Tao, Jing; Guan, Xiaohong

    2017-01-01

    Counting 3-, 4-, and 5-node graphlets in graphs is important for graph mining applications such as discovering abnormal/evolution patterns in social and biology networks. In addition, it is recently widely used for computing similarities between

  13. Parameterized Verification of Graph Transformation Systems with Whole Neighbourhood Operations

    OpenAIRE

    Delzanno, Giorgio; Stückrath, Jan

    2014-01-01

    We introduce a new class of graph transformation systems in which rewrite rules can be guarded by universally quantified conditions on the neighbourhood of nodes. These conditions are defined via special graph patterns which may be transformed by the rule as well. For the new class for graph rewrite rules, we provide a symbolic procedure working on minimal representations of upward closed sets of configurations. We prove correctness and effectiveness of the procedure by a categorical presenta...

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

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

  16. Patterns in early diffusion-weighted MRI in children with haemolytic uraemic syndrome and CNS involvement

    International Nuclear Information System (INIS)

    Donnerstag, Frank; Ding, Xiaoqi; Bueltmann, Eva; Zajaczek, Jan; Lanfermann, Heinrich; Pape, Lars; Das, Anibh Martin; Ehrich, Jochen; Hartmann, Hans; Luecke, Thomas; Hoy, Ludwig

    2012-01-01

    Diffusion-weighted imaging (DWI) in children with diarrhoea associated haemolytic uraemic syndrome (D+HUS) and cerebral involvement was evaluated retrospectively. DWI within 24 h of onset of neurological symptoms. The apparent diffusion coefficient (ADC) was measured in grey/white matter and correlated with clinical and laboratory findings. DWI was abnormal in all. Abnormal ADC was detected in the supratentorial white matter (6/12) and cortex (1/12), the basal ganglia (5/12), the thalami (4/12), and the cerebellum (1/12). ADC was reduced in 5/12, increased in 4/12, and both in 3/12. Mean serum sodium was lower in patients with DWI abnormalities affecting the white matter (6/12), than in those with basal ganglia/thalamic involvement (6/12). Neurological outcome was normal in 4/11 and abnormal in 7/11, and 1 patient died, outcome did not correlate to either localisation or type of DWI abnormality. In D+HUS with neurological symptoms, early DWI may reveal abnormal ADC not only in the basal ganglia/thalami, but also in the white matter/cortex. Besides thrombotic microangiopathy, toxic effects of shiga toxin, azotaemia and hyponatraemia / hypoosmolality may be involved in cerebral involvement in children with D+HUS. Findings on early MRI seem not to predict clinical course or outcome. (orig.)

  17. Patterns in early diffusion-weighted MRI in children with haemolytic uraemic syndrome and CNS involvement

    Energy Technology Data Exchange (ETDEWEB)

    Donnerstag, Frank; Ding, Xiaoqi; Bueltmann, Eva; Zajaczek, Jan; Lanfermann, Heinrich [Hannover Medical School, Institute of Diagnostic and Therapeutic Neuroradiology, Hannover (Germany); Pape, Lars; Das, Anibh Martin; Ehrich, Jochen; Hartmann, Hans [Hannover Medical School, Clinic for Pediatric Kidney, Liver and Metabolic Diseases, Hannover (Germany); Luecke, Thomas [Hannover Medical School, Clinic for Pediatric Kidney, Liver and Metabolic Diseases, Hannover (Germany); University of Bochum, Department of Neuropediatrics, Pediatric Hospital, Bochum (Germany); Hoy, Ludwig [Hannover Medical School, Institute of Biometrics, Hannover (Germany)

    2012-03-15

    Diffusion-weighted imaging (DWI) in children with diarrhoea associated haemolytic uraemic syndrome (D+HUS) and cerebral involvement was evaluated retrospectively. DWI within 24 h of onset of neurological symptoms. The apparent diffusion coefficient (ADC) was measured in grey/white matter and correlated with clinical and laboratory findings. DWI was abnormal in all. Abnormal ADC was detected in the supratentorial white matter (6/12) and cortex (1/12), the basal ganglia (5/12), the thalami (4/12), and the cerebellum (1/12). ADC was reduced in 5/12, increased in 4/12, and both in 3/12. Mean serum sodium was lower in patients with DWI abnormalities affecting the white matter (6/12), than in those with basal ganglia/thalamic involvement (6/12). Neurological outcome was normal in 4/11 and abnormal in 7/11, and 1 patient died, outcome did not correlate to either localisation or type of DWI abnormality. In D+HUS with neurological symptoms, early DWI may reveal abnormal ADC not only in the basal ganglia/thalami, but also in the white matter/cortex. Besides thrombotic microangiopathy, toxic effects of shiga toxin, azotaemia and hyponatraemia / hypoosmolality may be involved in cerebral involvement in children with D+HUS. Findings on early MRI seem not to predict clinical course or outcome. (orig.)

  18. Interpretation of Technology Diffusion Patterns for the U.S. Department of Energy's Environmental Management Program

    International Nuclear Information System (INIS)

    Cummings, M.A.

    1999-01-01

    The purpose of this paper is to provide a response to the general question as to why there has been so little actual application of new environmental technologies to on-the-ground cleanup. There are two sides to the issue that may at first seem unrelated, but taken together provide both a tactical and theoretical response to the question. EM-50 has provided a tactical response to the challenge of showing that expenditures in technology development are justified by implementation of its ASTD program. ASTD provides a fiscal incentive for the major DOE facilities to effect remedial actions using new technologies. The purpose of the ASTD is to demonstrate to stakeholders, including US Congress and concerned citizens, that environmental costs can be reduced and site cleanup accelerated by substituting new technologies for established baseline methods. The theoretical side looks at how historically, the substitution of new technologies for old in any given industry follows well-documented principles of diffusion; therefore, the aggregate adoption of new environmental technologies is predictive. It is not within the scope of this paper to accurately quantify the equations that result in the mathematical description of the S-shaped diffusion curve, but the overall concept of the innovation-development process is an important clue in understanding why new EM-50 technologies are not already in more widespread use

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

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

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

  2. Cycles in graphs

    CERN Document Server

    Alspach, BR

    1985-01-01

    This volume deals with a variety of problems involving cycles in graphs and circuits in digraphs. Leading researchers in this area present here 3 survey papers and 42 papers containing new results. There is also a collection of unsolved problems.

  3. Introduction to graph theory

    CERN Document Server

    Wilson, Robin J

    1985-01-01

    Graph Theory has recently emerged as a subject in its own right, as well as being an important mathematical tool in such diverse subjects as operational research, chemistry, sociology and genetics. This book provides a comprehensive introduction to the subject.

  4. Hyperbolicity in median graphs

    Indian Academy of Sciences (India)

    mic problems in hyperbolic spaces and hyperbolic graphs have been .... that in general the main obstacle is that we do not know the location of ...... [25] Jonckheere E and Lohsoonthorn P, A hyperbolic geometry approach to multipath routing,.

  5. Measuring Two-Event Structural Correlations on Graphs

    Science.gov (United States)

    2012-08-01

    2012 to 00-00-2012 4. TITLE AND SUBTITLE Measuring Two-Event Structural Correlations on Graphs 5a. CONTRACT NUMBER 5b. GRANT NUMBER 5c. PROGRAM ...by event simulation on the DBLP graph. Then we examine the efficiency and scala - bility of the framework with a Twitter network. The third part of...correlation pattern mining for large graphs. In Proc. of the 8th Workshop on Mining and Learning with Graphs, pages 119–126, 2010. [23] T. Smith. A

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

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

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

  9. Comparison of Shallow and Deep Learning Methods on Classifying the Regional Pattern of Diffuse Lung Disease.

    Science.gov (United States)

    Kim, Guk Bae; Jung, Kyu-Hwan; Lee, Yeha; Kim, Hyun-Jun; Kim, Namkug; Jun, Sanghoon; Seo, Joon Beom; Lynch, David A

    2017-10-17

    This study aimed to compare shallow and deep learning of classifying the patterns of interstitial lung diseases (ILDs). Using high-resolution computed tomography images, two experienced radiologists marked 1200 regions of interest (ROIs), in which 600 ROIs were each acquired using a GE or Siemens scanner and each group of 600 ROIs consisted of 100 ROIs for subregions that included normal and five regional pulmonary disease patterns (ground-glass opacity, consolidation, reticular opacity, emphysema, and honeycombing). We employed the convolution neural network (CNN) with six learnable layers that consisted of four convolution layers and two fully connected layers. The classification results were compared with the results classified by a shallow learning of a support vector machine (SVM). The CNN classifier showed significantly better performance for accuracy compared with that of the SVM classifier by 6-9%. As the convolution layer increases, the classification accuracy of the CNN showed better performance from 81.27 to 95.12%. Especially in the cases showing pathological ambiguity such as between normal and emphysema cases or between honeycombing and reticular opacity cases, the increment of the convolution layer greatly drops the misclassification rate between each case. Conclusively, the CNN classifier showed significantly greater accuracy than the SVM classifier, and the results implied structural characteristics that are inherent to the specific ILD patterns.

  10. Spatial-temporal evolution of self-organized loop-patterns on a water surface and a diffuse discharge in the gap

    Science.gov (United States)

    Li, Xuechen; Geng, Jinling; Jia, Pengying; Zhang, Panpan; Zhang, Qi; Li, Yaru

    2017-11-01

    Excited by an alternating current voltage, a patterned discharge and a diffuse discharge are generated in a needle to liquid configuration. Using an intensified charge-coupled device (ICCD), temporal evolution of the discharge between the two electrodes is investigated for the diffuse mode and the patterned mode, respectively. For the diffuse mode, the positive discharge is in a glow regime, and the negative discharge is in a Townsend discharge regime. For the patterned mode, the discharge always belongs to the Townsend discharge regime. Moreover, in the patterned mode, various patterns including the single loop, single loop with the surrounding corona, triple loops, and concentric loops with a central spot are observed on the water surface with the increasing positive peak-value of the applied voltage (Upp). Temporally resolved images of the loop-patterns are captured on the water surface. From the electrical measurements and the ICCD imaging, it is found that the loop pattern emerges after the discharge bridges the two electrodes. Then, it begins to evolve and finally degenerates with the decrease in the discharge current. The pattern does not disappear until the discharge quenches. Formation of the loop-patterns is attributed to the role of negative ions.

  11. Diffuse optical tomography with structured-light patterns to quantify breast density

    Science.gov (United States)

    Kwong, Jessica; Nouizi, Farouk; Cho, Jaedu; Zheng, Jie; Li, Yifan; Chen, Jeon-hor; Su, Min-Ying; Gulsen, Gultekin

    2016-02-01

    Breast density is an independent risk factor for breast cancer, where women with denser breasts are more likely to develop cancer. By identifying women at higher risk, healthcare providers can suggest screening at a younger age to effectively diagnose and treat breast cancer in its earlier stages. Clinical risk assessment models currently do not incorporate breast density, despite its strong correlation with breast cancer. Current methods to measure breast density rely on mammography and MRI, both of which may be difficult to use as a routine risk assessment tool. We propose to use diffuse optical tomography with structured-light to measure the dense, fibroglandular (FGT) tissue volume, which has a different chromophore signature than the surrounding adipose tissue. To test the ability of this technique, we performed simulations by creating numerical breast phantoms from segmented breast MR images. We looked at two different cases, one with a centralized FGT distribution and one with a dispersed distribution. As expected, the water and lipid volumes segmented at half-maximum were overestimated for the dispersed case. However, it was noticed that the recovered water and lipid concentrations were lower and higher, respectively, than the centralized case. This information may provide insight into the morphological distribution of the FGT and can be a correction in estimating the breast density.

  12. Historical collections reveal patterns of diffusion of sweet potato in Oceania obscured by modern plant movements and recombination.

    Science.gov (United States)

    Roullier, Caroline; Benoit, Laure; McKey, Doyle B; Lebot, Vincent

    2013-02-05

    The history of sweet potato in the Pacific has long been an enigma. Archaeological, linguistic, and ethnobotanical data suggest that prehistoric human-mediated dispersal events contributed to the distribution in Oceania of this American domesticate. According to the "tripartite hypothesis," sweet potato was introduced into Oceania from South America in pre-Columbian times and was then later newly introduced, and diffused widely across the Pacific, by Europeans via two historically documented routes from Mexico and the Caribbean. Although sweet potato is the most convincing example of putative pre-Columbian connections between human occupants of Polynesia and South America, the search for genetic evidence of pre-Columbian dispersal of sweet potato into Oceania has been inconclusive. Our study attempts to fill this gap. Using complementary sets of markers (chloroplast and nuclear microsatellites) and both modern and herbarium samples, we test the tripartite hypothesis. Our results provide strong support for prehistoric transfer(s) of sweet potato from South America (Peru-Ecuador region) into Polynesia. Our results also document a temporal shift in the pattern of distribution of genetic variation in sweet potato in Oceania. Later reintroductions, accompanied by recombination between distinct sweet potato gene pools, have reshuffled the crop's initial genetic base, obscuring primary patterns of diffusion and, at the same time, giving rise to an impressive number of local variants. Moreover, our study shows that phenotypes, names, and neutral genes do not necessarily share completely parallel evolutionary histories. Multidisciplinary approaches, thus, appear necessary for accurate reconstruction of the intertwined histories of plants and humans.

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

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

  15. A distributed query execution engine of big attributed graphs.

    Science.gov (United States)

    Batarfi, Omar; Elshawi, Radwa; Fayoumi, Ayman; Barnawi, Ahmed; Sakr, Sherif

    2016-01-01

    A graph is a popular data model that has become pervasively used for modeling structural relationships between objects. In practice, in many real-world graphs, the graph vertices and edges need to be associated with descriptive attributes. Such type of graphs are referred to as attributed graphs. G-SPARQL has been proposed as an expressive language, with a centralized execution engine, for querying attributed graphs. G-SPARQL supports various types of graph querying operations including reachability, pattern matching and shortest path where any G-SPARQL query may include value-based predicates on the descriptive information (attributes) of the graph edges/vertices in addition to the structural predicates. In general, a main limitation of centralized systems is that their vertical scalability is always restricted by the physical limits of computer systems. This article describes the design, implementation in addition to the performance evaluation of DG-SPARQL, a distributed, hybrid and adaptive parallel execution engine of G-SPARQL queries. In this engine, the topology of the graph is distributed over the main memory of the underlying nodes while the graph data are maintained in a relational store which is replicated on the disk of each of the underlying nodes. DG-SPARQL evaluates parts of the query plan via SQL queries which are pushed to the underlying relational stores while other parts of the query plan, as necessary, are evaluated via indexless memory-based graph traversal algorithms. Our experimental evaluation shows the efficiency and the scalability of DG-SPARQL on querying massive attributed graph datasets in addition to its ability to outperform the performance of Apache Giraph, a popular distributed graph processing system, by orders of magnitudes.

  16. Cellular Automata on Graphs: Topological Properties of ER Graphs Evolved towards Low-Entropy Dynamics

    Directory of Open Access Journals (Sweden)

    Marc-Thorsten Hütt

    2012-06-01

    Full Text Available Cellular automata (CA are a remarkably  efficient tool for exploring general properties of complex systems and spatiotemporal patterns arising from local rules. Totalistic cellular automata,  where the update  rules depend  only on the density of neighboring states, are at the same time a versatile  tool for exploring  dynamical  processes on graphs. Here we briefly review our previous results on cellular automata on graphs, emphasizing some systematic relationships between network architecture and dynamics identified in this way. We then extend the investigation  towards graphs obtained in a simulated-evolution procedure, starting from Erdő s–Rényi (ER graphs and selecting for low entropies of the CA dynamics. Our key result is a strong association of low Shannon entropies with a broadening of the graph’s degree distribution.

  17. Quantitative consensus of supervised learners for diffuse lung parenchymal HRCT patterns

    Science.gov (United States)

    Raghunath, Sushravya; Rajagopalan, Srinivasan; Karwoski, Ronald A.; Bartholmai, Brian J.; Robb, Richard A.

    2013-03-01

    Automated lung parenchymal classification usually relies on supervised learning of expert chosen regions representative of the visually differentiable HRCT patterns specific to different pathologies (eg. emphysema, ground glass, honey combing, reticular and normal). Considering the elusiveness of a single most discriminating similarity measure, a plurality of weak learners can be combined to improve the machine learnability. Though a number of quantitative combination strategies exist, their efficacy is data and domain dependent. In this paper, we investigate multiple (N=12) quantitative consensus approaches to combine the clusters obtained with multiple (n=33) probability density-based similarity measures. Our study shows that hypergraph based meta-clustering and probabilistic clustering provides optimal expert-metric agreement.

  18. On some covering graphs of a graph

    Directory of Open Access Journals (Sweden)

    Shariefuddin Pirzada

    2016-10-01

    Full Text Available For a graph $G$ with vertex set $V(G=\\{v_1, v_2, \\dots, v_n\\}$, let $S$ be the covering set of $G$ having the maximum degree over all the minimum covering sets of $G$. Let $N_S[v]=\\{u\\in S : uv \\in E(G \\}\\cup \\{v\\}$ be the closed neighbourhood of the vertex $v$ with respect to $S.$ We define a square matrix $A_S(G= (a_{ij},$ by $a_{ij}=1,$ if $\\left |N_S[v_i]\\cap N_S[v_j] \\right| \\geq 1, i\

  19. Application of graph theory to the morphological analysis of settlements

    Directory of Open Access Journals (Sweden)

    Szmytkie Robert

    2017-12-01

    Full Text Available In the following paper, the analyses of morphology of settlements were conducted using graph methods. The intention of the author was to create a quantifiable and simple measure, which, in a quantitative way, would express the degree of development of a graph (the spatial pattern of settlement. When analysing examples of graphs assigned to a set of small towns and large villages, it was noticed that the graph development index should depend on: a relative number of edges in relation to the number of nodes (β index, the number of cycles (urban blocks, which evidences the complexity of the spatial pattern of settlement, and the average rank of nodes of a graph, which expresses the degree of complexity of a street network.

  20. Diffuse and enteroaggregative patterns of adherence of Escherichia coli isolated from stools of children in northeastern Brazil

    Directory of Open Access Journals (Sweden)

    Scaletsky Isabel Cristina Affonso

    2001-01-01

    Full Text Available Childhood diarrheal diseases remain highly endemic in northeastern Brazil. The attributable fraction of all diarrheal diseases among children less than 2 years of age due to Escherichia coli was examined in a 2-year prospective study in two large urban centers of Brazil. Between May 1997 and June 1999, fecal E. coli isolates from 237 children with diarrhea (217 acute and 20 persistent cases and 231 children without diarrhea (controls attending two hospitals in Northeast Brazil were tested for their pattern of adherence to HEp-2 cells and for colony hybridization with DNA probes specific for the six pathotypes of diarrheagenic E. coli. Enteroinvasive E. coli, enterotoxigenic E. coli and enterohemorrhagic E. coli were not isolated from any children. Diffusely adherent E. coli (DAEC and enteroaggregative E. coli (EAEC were the most frequent isolates with similar frequencies from children with or without diarrhea. Atypical EPEC (EAF-negative strains were isolated with similiar frequency from both cases (5.5% and controls (5.6%. Enteropathogenic E. coli (typical EPEC strains, characterized by localized adherence pattern of adherence, hybridization with the EAF probe, and belonging to the classical O serogroups, were significantly associated with diarrhea (P = 0.03. These E. coli strains associated with diarrhea accounted for 9% of all children with diarrhea. Collectively, in Northeast Brazil, E. coli strains comprise a small proportion of severe diarrhea prevalence in children.

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

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

  3. Graphs, groups and surfaces

    CERN Document Server

    White, AT

    1985-01-01

    The field of topological graph theory has expanded greatly in the ten years since the first edition of this book appeared. The original nine chapters of this classic work have therefore been revised and updated. Six new chapters have been added, dealing with: voltage graphs, non-orientable imbeddings, block designs associated with graph imbeddings, hypergraph imbeddings, map automorphism groups and change ringing.Thirty-two new problems have been added to this new edition, so that there are now 181 in all; 22 of these have been designated as ``difficult'''' and 9 as ``unsolved''''. Three of the four unsolved problems from the first edition have been solved in the ten years between editions; they are now marked as ``difficult''''.

  4. Profinite graphs and groups

    CERN Document Server

    Ribes, Luis

    2017-01-01

    This book offers a detailed introduction to graph theoretic methods in profinite groups and applications to abstract groups. It is the first to provide a comprehensive treatment of the subject. The author begins by carefully developing relevant notions in topology, profinite groups and homology, including free products of profinite groups, cohomological methods in profinite groups, and fixed points of automorphisms of free pro-p groups. The final part of the book is dedicated to applications of the profinite theory to abstract groups, with sections on finitely generated subgroups of free groups, separability conditions in free and amalgamated products, and algorithms in free groups and finite monoids. Profinite Graphs and Groups will appeal to students and researchers interested in profinite groups, geometric group theory, graphs and connections with the theory of formal languages. A complete reference on the subject, the book includes historical and bibliographical notes as well as a discussion of open quest...

  5. Subdominant pseudoultrametric on graphs

    Energy Technology Data Exchange (ETDEWEB)

    Dovgoshei, A A; Petrov, E A [Institute of Applied Mathematics and Mechanics, National Academy of Sciences of Ukraine, Donetsk (Ukraine)

    2013-08-31

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

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

  7. Augmented marked graphs

    CERN Document Server

    Cheung, King Sing

    2014-01-01

    Petri nets are a formal and theoretically rich model for the modelling and analysis of systems. A subclass of Petri nets, augmented marked graphs possess a structure that is especially desirable for the modelling and analysis of systems with concurrent processes and shared resources.This monograph consists of three parts: Part I provides the conceptual background for readers who have no prior knowledge on Petri nets; Part II elaborates the theory of augmented marked graphs; finally, Part III discusses the application to system integration. The book is suitable as a first self-contained volume

  8. Graph Query Portal

    OpenAIRE

    Dayal, Amit; Brock, David

    2018-01-01

    Prashant Chandrasekar, a lead developer for the Social Interactome project, has tasked the team with creating a graph representation of the data collected from the social networks involved in that project. The data is currently stored in a MySQL database. The client requested that the graph database be Cayley, but after a literature review, Neo4j was chosen. The reasons for this shift will be explained in the design section. Secondarily, the team was tasked with coming up with three scena...

  9. Spectral radius of graphs

    CERN Document Server

    Stevanovic, Dragan

    2015-01-01

    Spectral Radius of Graphs provides a thorough overview of important results on the spectral radius of adjacency matrix of graphs that have appeared in the literature in the preceding ten years, most of them with proofs, and including some previously unpublished results of the author. The primer begins with a brief classical review, in order to provide the reader with a foundation for the subsequent chapters. Topics covered include spectral decomposition, the Perron-Frobenius theorem, the Rayleigh quotient, the Weyl inequalities, and the Interlacing theorem. From this introduction, the

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

  11. Diffusion archeology for diffusion progression history reconstruction.

    Science.gov (United States)

    Sefer, Emre; Kingsford, Carl

    2016-11-01

    Diffusion through graphs can be used to model many real-world processes, such as the spread of diseases, social network memes, computer viruses, or water contaminants. Often, a real-world diffusion cannot be directly observed while it is occurring - perhaps it is not noticed until some time has passed, continuous monitoring is too costly, or privacy concerns limit data access. This leads to the need to reconstruct how the present state of the diffusion came to be from partial diffusion data. Here, we tackle the problem of reconstructing a diffusion history from one or more snapshots of the diffusion state. This ability can be invaluable to learn when certain computer nodes are infected or which people are the initial disease spreaders to control future diffusions. We formulate this problem over discrete-time SEIRS-type diffusion models in terms of maximum likelihood. We design methods that are based on submodularity and a novel prize-collecting dominating-set vertex cover (PCDSVC) relaxation that can identify likely diffusion steps with some provable performance guarantees. Our methods are the first to be able to reconstruct complete diffusion histories accurately in real and simulated situations. As a special case, they can also identify the initial spreaders better than the existing methods for that problem. Our results for both meme and contaminant diffusion show that the partial diffusion data problem can be overcome with proper modeling and methods, and that hidden temporal characteristics of diffusion can be predicted from limited data.

  12. Patterns of failure of diffuse large B-cell lymphoma patients after involved-site radiotherapy

    Energy Technology Data Exchange (ETDEWEB)

    Holzhaeuser, Eva; Berlin, Maximilian; Bezold, Thomas; Mayer, Arnulf; Schmidberger, Heinz [University Medical Center Mainz, Department of Radiation Oncology and Radiotherapy, Mainz (Germany); Wollschlaeger, Daniel [University Medical Center Mainz, Institute for Medical Biostatistics, Epidemiology and Informatics, Mainz (Germany); Hess, Georg [University Medical Center Mainz, Department of Internal Medicine, Mainz (Germany)

    2017-12-15

    Radiotherapy (RT) in combination with chemoimmunotherapy is highly efficient in the treatment of diffuse large B-cell lymphoma (DLBCL). This retrospective analysis evaluated the efficacy of the treatment volume and the dose concept of involved-site RT (ISRT). We identified 60 histologically confirmed stage I-IV DLBCL patients treated with multimodal cytotoxic chemoimmunotherapy and followed by consolidative ISRT from 2005-2015. Progression-free survival (PFS) and overall survival (OS) were estimated by Kaplan-Meier method. Univariate analyses were performed by log-rank test and Mann-Whitney U-test. After initial chemoimmunotherapy (mostly R-CHOP; rituximab, cyclophosphamide, doxorubicin, vincristine, and prednisolone), 19 (36%) patients achieved complete response (CR), 34 (64%) partial response (PR) or less. Excluded were 7 (12%) patients with progressive disease after chemoimmunotherapy. All patients underwent ISRT with a dose of 40 Gy. After a median follow-up of 44 months, 79% of the patients remained disease free, while 21% presented with failure, progressive systemic disease, or death. All patients who achieved CR after chemoimmunotherapy remained in CR. Of the patients achieving PR after chemotherapy only 2 failed at the initial site within the ISRT volume. No marginal relapse was observed. Ann Arbor clinical stage I/II showed significantly improved PFS compared to stage III/IV (93% vs 65%; p ≤ 0.021). International Prognostic Index (IPI) score of 0 or 1 compared to 2-5 has been associated with significantly increased PFS (100% vs 70%; p ≤ 0.031). Postchemoimmunotherapy status of CR compared to PR was associated with significantly increased PFS (100% vs 68%; p ≤ 0.004) and OS (100% vs 82%; p ≤ 0.026). Only 3 of 53 patients developed grade II late side effects, whereas grade III or IV side effects have not been observed. These data suggest that a reduction of the RT treatment volume from involved-field (IF) to involved-site (IS) is sufficient because

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

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

  15. Partitioning a call graph

    NARCIS (Netherlands)

    Bisseling, R.H.; Byrka, J.; Cerav-Erbas, S.; Gvozdenovic, N.; Lorenz, M.; Pendavingh, R.A.; Reeves, C.; Röger, M.; Verhoeven, A.; Berg, van den J.B.; Bhulai, S.; Hulshof, J.; Koole, G.; Quant, C.; Williams, J.F.

    2006-01-01

    Splitting a large software system into smaller and more manageable units has become an important problem for many organizations. The basic structure of a software system is given by a directed graph with vertices representing the programs of the system and arcs representing calls from one program to

  16. Coloring geographical threshold graphs

    Energy Technology Data Exchange (ETDEWEB)

    Bradonjic, Milan [Los Alamos National Laboratory; Percus, Allon [Los Alamos National Laboratory; Muller, Tobias [EINDHOVEN UNIV. OF TECH

    2008-01-01

    We propose a coloring algorithm for sparse random graphs generated by the geographical threshold graph (GTG) model, a generalization of random geometric graphs (RGG). In a GTG, nodes are distributed in a Euclidean space, and edges are assigned according to a threshold function involving the distance between nodes as well as randomly chosen node weights. The motivation for analyzing this model is that many real networks (e.g., wireless networks, the Internet, etc.) need to be studied by using a 'richer' stochastic model (which in this case includes both a distance between nodes and weights on the nodes). Here, we analyze the GTG coloring algorithm together with the graph's clique number, showing formally that in spite of the differences in structure between GTG and RGG, the asymptotic behavior of the chromatic number is identical: {chi}1n 1n n / 1n n (1 + {omicron}(1)). Finally, we consider the leading corrections to this expression, again using the coloring algorithm and clique number to provide bounds on the chromatic number. We show that the gap between the lower and upper bound is within C 1n n / (1n 1n n){sup 2}, and specify the constant C.

  17. Supermarket model on graphs

    NARCIS (Netherlands)

    Budhiraja, A.S.; Mukherjee, D.; Wu, R.

    2017-01-01

    We consider a variation of the supermarket model in which the servers can communicate with their neighbors and where the neighborhood relationships are described in terms of a suitable graph. Tasks with unit-exponential service time distributions arrive at each vertex as independent Poisson

  18. Basin Hopping Graph

    DEFF Research Database (Denmark)

    Kucharik, Marcel; Hofacker, Ivo; Stadler, Peter

    2014-01-01

    of the folding free energy landscape, however, can provide the relevant information. Results We introduce the basin hopping graph (BHG) as a novel coarse-grained model of folding landscapes. Each vertex of the BHG is a local minimum, which represents the corresponding basin in the landscape. Its edges connect...

  19. The STAPL Parallel Graph Library

    KAUST Repository

    Harshvardhan,; Fidel, Adam; Amato, Nancy M.; Rauchwerger, Lawrence

    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

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

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

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

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

  4. A strategy for full interrogation of prognostic gene expression patterns: exploring the biology of diffuse large B cell lymphoma.

    Directory of Open Access Journals (Sweden)

    Lisa M Rimsza

    Full Text Available Gene expression profiling yields quantitative data on gene expression used to create prognostic models that accurately predict patient outcome in diffuse large B cell lymphoma (DLBCL. Often, data are analyzed with genes classified by whether they fall above or below the median expression level. We sought to determine whether examining multiple cut-points might be a more powerful technique to investigate the association of gene expression with outcome.We explored gene expression profiling data using variable cut-point analysis for 36 genes with reported prognostic value in DLBCL. We plotted two-group survival logrank test statistics against corresponding cut-points of the gene expression levels and smooth estimates of the hazard ratio of death versus gene expression levels. To facilitate comparisons we also standardized the expression of each of the genes by the fraction of patients that would be identified by any cut-point. A multiple comparison adjusted permutation p-value identified 3 different patterns of significance: 1 genes with significant cut-point points below the median, whose loss is associated with poor outcome (e.g. HLA-DR; 2 genes with significant cut-points above the median, whose over-expression is associated with poor outcome (e.g. CCND2; and 3 genes with significant cut-points on either side of the median, (e.g. extracellular molecules such as FN1.Variable cut-point analysis with permutation p-value calculation can be used to identify significant genes that would not otherwise be identified with median cut-points and may suggest biological patterns of gene effects.

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

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

  7. On dominator colorings in graphs

    Indian Academy of Sciences (India)

    colors required for a dominator coloring of G is called the dominator .... Theorem 1.3 shows that the complete graph Kn is the only connected graph of order n ... Conversely, if a graph G satisfies condition (i) or (ii), it is easy to see that χd(G) =.

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

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

  10. Graph 500 on OpenSHMEM: Using a Practical Survey of Past Work to Motivate Novel Algorithmic Developments

    Energy Technology Data Exchange (ETDEWEB)

    Grossman, Max [Rice Univ., Houston, TX (United States); Pritchard Jr., Howard Porter [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Budimlic, Zoran [Rice Univ., Houston, TX (United States); Sarkar, Vivek [Rice Univ., Houston, TX (United States)

    2016-12-22

    Graph500 [14] is an effort to offer a standardized benchmark across large-scale distributed platforms which captures the behavior of common communicationbound graph algorithms. Graph500 differs from other large-scale benchmarking efforts (such as HPL [6] or HPGMG [7]) primarily in the irregularity of its computation and data access patterns. The core computational kernel of Graph500 is a breadth-first search (BFS) implemented on an undirected graph. The output of Graph500 is a spanning tree of the input graph, usually represented by a predecessor mapping for every node in the graph. The Graph500 benchmark defines several pre-defined input sizes for implementers to test against. This report summarizes investigation into implementing the Graph500 benchmark on OpenSHMEM, and focuses on first building a strong and practical understanding of the strengths and limitations of past work before proposing and developing novel extensions.

  11. Multi-class parkinsonian disorders classification with quantitative MR markers and graph-based features using support vector machines.

    Science.gov (United States)

    Morisi, Rita; Manners, David Neil; Gnecco, Giorgio; Lanconelli, Nico; Testa, Claudia; Evangelisti, Stefania; Talozzi, Lia; Gramegna, Laura Ludovica; Bianchini, Claudio; Calandra-Buonaura, Giovanna; Sambati, Luisa; Giannini, Giulia; Cortelli, Pietro; Tonon, Caterina; Lodi, Raffaele

    2018-02-01

    In this study we attempt to automatically classify individual patients with different parkinsonian disorders, making use of pattern recognition techniques to distinguish among several forms of parkinsonisms (multi-class classification), based on a set of binary classifiers that discriminate each disorder from all others. We combine diffusion tensor imaging, proton spectroscopy and morphometric-volumetric data to obtain MR quantitative markers, which are provided to support vector machines with the aim of recognizing the different parkinsonian disorders. Feature selection is used to find the most important features for classification. We also exploit a graph-based technique on the set of quantitative markers to extract additional features from the dataset, and increase classification accuracy. When graph-based features are not used, the MR markers that are most frequently automatically extracted by the feature selection procedure reflect alterations in brain regions that are also usually considered to discriminate parkinsonisms in routine clinical practice. Graph-derived features typically increase the diagnostic accuracy, and reduce the number of features required. The results obtained in the work demonstrate that support vector machines applied to multimodal brain MR imaging and using graph-based features represent a novel and highly accurate approach to discriminate parkinsonisms, and a useful tool to assist the diagnosis. Copyright © 2017 Elsevier Ltd. All rights reserved.

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

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

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

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

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

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

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

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

  20. Status epilepticus in the elderly: Prognostic implications of rhythmic and periodic patterns in electroencephalography and hyperintensities on diffusion-weighted imaging.

    Science.gov (United States)

    Yoshimura, Hajime; Matsumoto, Riki; Ueda, Hiroyuki; Ariyoshi, Koichi; Kawamoto, Michi; Ishii, Junko; Ikeda, Akio; Takahashi, Ryosuke; Kohara, Nobuo

    2016-11-15

    To delineate the clinical characteristics and functional outcome of status epilepticus (SE) in elderly people, and elucidate prognostic implications of SE-associated rhythmic and periodic patterns (RPPs) in electroencephalography and hyperintensities on diffusion-weighted imaging. We retrospectively investigated 107 consecutive patients with SE aged≥65years in a comprehensive community hospital. RPPs were classified using the 2012 American Clinical Neurophysiology Society's Standardized Critical Care EEG Terminology. Poor outcome was defined as an increase in modified Rankin Scale (mRS) score at discharge compared with that at baseline, including death. Median age of patients was 80.0years. Median mRS score at baseline was 3. Thirty-four patients (31.8%) had a previous diagnosis of epilepsy. Cerebrovascular disease and dementia were major etiologies. Poor outcome occurred in 41 (38.3%). In electroencephalography, periodic discharges (PDs) were present in 21.0% (22/105), rhythmic delta activity (RDA) in 10.5% (11/105), and conventional seizure patterns in 9.5% (10/105). Diffusion-weighted hyperintensities associated with SE were observed in 28.0% (26/93). With univariate analysis, poor outcome was significantly associated with no previous diagnosis of epilepsy, etiology, refractory SE, specific electroencephalographic patterns (PDs and conventional seizure patterns, but not RDA), and diffusion-weighted hyperintensities. With multivariate logistic regression analysis, diffusion-weighted hyperintensities (OR 6.13 [95% CI 1.72-21.9]) and refractory SE (OR 5.36 [95% CI 1.28-22.4]) were independently associated with poor outcome. SE often occurred as the first seizure in already disabled elderly people, further worsening their functional disabilities. Diffusion-weighted hyperintensities and refractory SE, but not RPPs in electroencephalography, were independent functional prognostic factors. Copyright © 2016 Elsevier B.V. All rights reserved.

  1. An Unusual Exponential Graph

    Science.gov (United States)

    Syed, M. Qasim; Lovatt, Ian

    2014-01-01

    This paper is an addition to the series of papers on the exponential function begun by Albert Bartlett. In particular, we ask how the graph of the exponential function y = e[superscript -t/t] would appear if y were plotted versus ln t rather than the normal practice of plotting ln y versus t. In answering this question, we find a new way to…

  2. Understanding Charts and Graphs.

    Science.gov (United States)

    1987-07-28

    Farenheit degrees, which have no Onaturalo zero ); finally, ratio scales have numbers that are ordered so that the magnitudes of differences are important and...system. They have to do with the very nature of how marks serve as meaningful symbols. In the ideal case, a chart or graph will be absolutely unambiguous...and these laws comprise this principle (see Stevens, 1974). Absolute discriminability: A minimal magnitude of a mark is necessary for it to be detected

  3. Measurements of brain microstructure and connectivity with diffusion MRI

    Directory of Open Access Journals (Sweden)

    Ching-Po Lin

    2011-12-01

    Full Text Available By probing direction-dependent diffusivity of water molecules, diffusion MRI has shown its capability to reflect the microstructural tissue status and to estimate the neural orientation and pathways in the living brain. This approach has supplied novel insights into in-vivo human brain connections. By detecting the connection patterns, anatomical architecture and structural integrity between cortical regions or subcortical nuclei in the living human brain can be easily identified. It thus opens a new window on brain connectivity studies and disease processes. During the past years, there is a growing interest in exploring the connectivity patterns of the human brain. Specifically, the utilities of noninvasive neuroimaging data and graph theoretical analysis have provided important insights into the anatomical connections and topological pattern of human brain structural networks in vivo. Here, we review the progress of this important technique and the recent methodological and application studies utilizing graph theoretical approaches on brain structural networks with structural MRI and diffusion MRI.

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

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

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

  7. Transition of spiral calcium waves between multiple stable patterns can be triggered by a single calcium spark in a fire-diffuse-fire model

    Science.gov (United States)

    Tang, Ai-Hui; Wang, Shi-Qiang

    2009-01-01

    Spiral patterns have been found in various nonequilibrium systems. The Ca2+-induced Ca2+ release system in single cardiac cells is unique for highly discrete reaction elements, each giving rise to a Ca2+ spark upon excitation. We imaged the spiral Ca2+ waves in isolated cardiac cells and numerically studied the effect of system excitability on spiral patterns using a two-dimensional fire-diffuse-fire model. We found that under certain conditions, the system was able to display multiple stable patterns of spiral waves, each exhibiting different periods and distinct routines of spiral tips. Transition between these different patterns could be triggered by an internal fluctuation in the form of a single Ca2+ spark. PMID:19792039

  8. Transition of spiral calcium waves between multiple stable patterns can be triggered by a single calcium spark in a fire-diffuse-fire model.

    Science.gov (United States)

    Tang, Ai-Hui; Wang, Shi-Qiang

    2009-09-01

    Spiral patterns have been found in various nonequilibrium systems. The Ca(2+)-induced Ca(2+) release system in single cardiac cells is unique for highly discrete reaction elements, each giving rise to a Ca(2+) spark upon excitation. We imaged the spiral Ca(2+) waves in isolated cardiac cells and numerically studied the effect of system excitability on spiral patterns using a two-dimensional fire-diffuse-fire model. We found that under certain conditions, the system was able to display multiple stable patterns of spiral waves, each exhibiting different periods and distinct routines of spiral tips. Transition between these different patterns could be triggered by an internal fluctuation in the form of a single Ca(2+) spark.

  9. Endomorphisms of graph algebras

    DEFF Research Database (Denmark)

    Conti, Roberto; Hong, Jeong Hee; Szymanski, Wojciech

    2012-01-01

    We initiate a systematic investigation of endomorphisms of graph C*-algebras C*(E), extending several known results on endomorphisms of the Cuntz algebras O_n. Most but not all of this study is focused on endomorphisms which permute the vertex projections and globally preserve the diagonal MASA D...... that the restriction to the diagonal MASA of an automorphism which globally preserves both D_E and the core AF-subalgebra eventually commutes with the corresponding one-sided shift. Secondly, we exhibit several properties of proper endomorphisms, investigate invertibility of localized endomorphisms both on C...

  10. Total colourings of graphs

    CERN Document Server

    Yap, Hian-Poh

    1996-01-01

    This book provides an up-to-date and rapid introduction to an important and currently active topic in graph theory. The author leads the reader to the forefront of research in this area. Complete and easily readable proofs of all the main theorems, together with numerous examples, exercises and open problems are given. The book is suitable for use as a textbook or as seminar material for advanced undergraduate and graduate students. The references are comprehensive and so it will also be useful for researchers as a handbook.

  11. Graph Algorithm Animation with Grrr

    OpenAIRE

    Rodgers, Peter; Vidal, Natalia

    2000-01-01

    We discuss geometric positioning, highlighting of visited nodes and user defined highlighting that form the algorithm animation facilities in the Grrr graph rewriting programming language. The main purpose of animation was initially for the debugging and profiling of Grrr code, but recently it has been extended for the purpose of teaching algorithms to undergraduate students. The animation is restricted to graph based algorithms such as graph drawing, list manipulation or more traditional gra...

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

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

  14. Quantum Graph Analysis

    Energy Technology Data Exchange (ETDEWEB)

    Maunz, Peter Lukas Wilhelm [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Sterk, Jonathan David [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Lobser, Daniel [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Parekh, Ojas D. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Ryan-Anderson, Ciaran [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)

    2016-01-01

    In recent years, advanced network analytics have become increasingly important to na- tional security with applications ranging from cyber security to detection and disruption of ter- rorist networks. While classical computing solutions have received considerable investment, the development of quantum algorithms to address problems, such as data mining of attributed relational graphs, is a largely unexplored space. Recent theoretical work has shown that quan- tum algorithms for graph analysis can be more efficient than their classical counterparts. Here, we have implemented a trapped-ion-based two-qubit quantum information proces- sor to address these goals. Building on Sandia's microfabricated silicon surface ion traps, we have designed, realized and characterized a quantum information processor using the hyperfine qubits encoded in two 171 Yb + ions. We have implemented single qubit gates using resonant microwave radiation and have employed Gate set tomography (GST) to characterize the quan- tum process. For the first time, we were able to prove that the quantum process surpasses the fault tolerance thresholds of some quantum codes by demonstrating a diamond norm distance of less than 1 . 9 x 10 [?] 4 . We used Raman transitions in order to manipulate the trapped ions' motion and realize two-qubit gates. We characterized the implemented motion sensitive and insensitive single qubit processes and achieved a maximal process infidelity of 6 . 5 x 10 [?] 5 . We implemented the two-qubit gate proposed by Molmer and Sorensen and achieved a fidelity of more than 97 . 7%.

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

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

  17. Graph Theory. 2. Vertex Descriptors and Graph Coloring

    Directory of Open Access Journals (Sweden)

    Lorentz JÄNTSCHI

    2002-12-01

    Full Text Available This original work presents the construction of a set of ten sequence matrices and their applications for ordering vertices in graphs. For every sequence matrix three ordering criteria are applied: lexicographic ordering, based on strings of numbers, corresponding to every vertex, extracted as rows from sequence matrices; ordering by the sum of path lengths from a given vertex; and ordering by the sum of paths, starting from a given vertex. We also examine a graph that has different orderings for the above criteria. We then proceed to demonstrate that every criterion induced its own partition of graph vertex. We propose the following theoretical result: both LAVS and LVDS criteria generate identical partitioning of vertices in any graph. Finally, a coloring of graph vertices according to introduced ordering criteria was proposed.

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

  19. The planar cubic Cayley graphs

    CERN Document Server

    Georgakopoulos, Agelos

    2018-01-01

    The author obtains a complete description of the planar cubic Cayley graphs, providing an explicit presentation and embedding for each of them. This turns out to be a rich class, comprising several infinite families. He obtains counterexamples to conjectures of Mohar, Bonnington and Watkins. The author's analysis makes the involved graphs accessible to computation, corroborating a conjecture of Droms.

  20. Groupies in random bipartite graphs

    OpenAIRE

    Yilun Shang

    2010-01-01

    A vertex $v$ of a graph $G$ is called a groupie if its degree is notless than the average of the degrees of its neighbors. In thispaper we study the influence of bipartition $(B_1,B_2)$ on groupiesin random bipartite graphs $G(B_1,B_2,p)$ with both fixed $p$ and$p$ tending to zero.

  1. Nested Dynamic Condition Response Graphs

    DEFF Research Database (Denmark)

    Hildebrandt, Thomas; Mukkamala, Raghava Rao; Slaats, Tijs

    2012-01-01

    We present an extension of the recently introduced declarative process model Dynamic Condition Response Graphs ( DCR Graphs) to allow nested subgraphs and a new milestone relation between events. The extension was developed during a case study carried out jointly with our industrial partner...

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

  3. Graph Sampling for Covariance Estimation

    KAUST Repository

    Chepuri, Sundeep Prabhakar; Leus, Geert

    2017-01-01

    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

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

  5. A cluster algorithm for graphs

    NARCIS (Netherlands)

    S. van Dongen

    2000-01-01

    textabstractA cluster algorithm for graphs called the emph{Markov Cluster algorithm (MCL~algorithm) is introduced. The algorithm provides basically an interface to an algebraic process defined on stochastic matrices, called the MCL~process. The graphs may be both weighted (with nonnegative weight)

  6. Graph theoretical model of a sensorimotor connectome in zebrafish.

    Science.gov (United States)

    Stobb, Michael; Peterson, Joshua M; Mazzag, Borbala; Gahtan, Ethan

    2012-01-01

    Mapping the detailed connectivity patterns (connectomes) of neural circuits is a central goal of neuroscience. The best quantitative approach to analyzing connectome data is still unclear but graph theory has been used with success. We present a graph theoretical model of the posterior lateral line sensorimotor pathway in zebrafish. The model includes 2,616 neurons and 167,114 synaptic connections. Model neurons represent known cell types in zebrafish larvae, and connections were set stochastically following rules based on biological literature. Thus, our model is a uniquely detailed computational representation of a vertebrate connectome. The connectome has low overall connection density, with 2.45% of all possible connections, a value within the physiological range. We used graph theoretical tools to compare the zebrafish connectome graph to small-world, random and structured random graphs of the same size. For each type of graph, 100 randomly generated instantiations were considered. Degree distribution (the number of connections per neuron) varied more in the zebrafish graph than in same size graphs with less biological detail. There was high local clustering and a short average path length between nodes, implying a small-world structure similar to other neural connectomes and complex networks. The graph was found not to be scale-free, in agreement with some other neural connectomes. An experimental lesion was performed that targeted three model brain neurons, including the Mauthner neuron, known to control fast escape turns. The lesion decreased the number of short paths between sensory and motor neurons analogous to the behavioral effects of the same lesion in zebrafish. This model is expandable and can be used to organize and interpret a growing database of information on the zebrafish connectome.

  7. Graph theoretical model of a sensorimotor connectome in zebrafish.

    Directory of Open Access Journals (Sweden)

    Michael Stobb

    Full Text Available Mapping the detailed connectivity patterns (connectomes of neural circuits is a central goal of neuroscience. The best quantitative approach to analyzing connectome data is still unclear but graph theory has been used with success. We present a graph theoretical model of the posterior lateral line sensorimotor pathway in zebrafish. The model includes 2,616 neurons and 167,114 synaptic connections. Model neurons represent known cell types in zebrafish larvae, and connections were set stochastically following rules based on biological literature. Thus, our model is a uniquely detailed computational representation of a vertebrate connectome. The connectome has low overall connection density, with 2.45% of all possible connections, a value within the physiological range. We used graph theoretical tools to compare the zebrafish connectome graph to small-world, random and structured random graphs of the same size. For each type of graph, 100 randomly generated instantiations were considered. Degree distribution (the number of connections per neuron varied more in the zebrafish graph than in same size graphs with less biological detail. There was high local clustering and a short average path length between nodes, implying a small-world structure similar to other neural connectomes and complex networks. The graph was found not to be scale-free, in agreement with some other neural connectomes. An experimental lesion was performed that targeted three model brain neurons, including the Mauthner neuron, known to control fast escape turns. The lesion decreased the number of short paths between sensory and motor neurons analogous to the behavioral effects of the same lesion in zebrafish. This model is expandable and can be used to organize and interpret a growing database of information on the zebrafish connectome.

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

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

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

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

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

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

  14. PERSEUS-HUB: Interactive and Collective Exploration of Large-Scale Graphs

    Directory of Open Access Journals (Sweden)

    Di Jin

    2017-07-01

    Full Text Available Graphs emerge naturally in many domains, such as social science, neuroscience, transportation engineering, and more. In many cases, such graphs have millions or billions of nodes and edges, and their sizes increase daily at a fast pace. How can researchers from various domains explore large graphs interactively and efficiently to find out what is ‘important’? How can multiple researchers explore a new graph dataset collectively and “help” each other with their findings? In this article, we present Perseus-Hub, a large-scale graph mining tool that computes a set of graph properties in a distributed manner, performs ensemble, multi-view anomaly detection to highlight regions that are worth investigating, and provides users with uncluttered visualization and easy interaction with complex graph statistics. Perseus-Hub uses a Spark cluster to calculate various statistics of large-scale graphs efficiently, and aggregates the results in a summary on the master node to support interactive user exploration. In Perseus-Hub, the visualized distributions of graph statistics provide preliminary analysis to understand a graph. To perform a deeper analysis, users with little prior knowledge can leverage patterns (e.g., spikes in the power-law degree distribution marked by other users or experts. Moreover, Perseus-Hub guides users to regions of interest by highlighting anomalous nodes and helps users establish a more comprehensive understanding about the graph at hand. We demonstrate our system through the case study on real, large-scale networks.

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

  16. XML Graphs in Program Analysis

    DEFF Research Database (Denmark)

    Møller, Anders; Schwartzbach, Michael I.

    2011-01-01

    of XML graphs against different XML schema languages, and provide a software package that enables others to make use of these ideas. We also survey the use of XML graphs for program analysis with four very different languages: XACT (XML in Java), Java Servlets (Web application programming), XSugar......XML graphs have shown to be a simple and effective formalism for representing sets of XML documents in program analysis. It has evolved through a six year period with variants tailored for a range of applications. We present a unified definition, outline the key properties including validation...

  17. Coloring and The Lonely Graph

    OpenAIRE

    Rabern, Landon

    2007-01-01

    We improve upper bounds on the chromatic number proven independently in \\cite{reedNote} and \\cite{ingo}. Our main lemma gives a sufficient condition for two paths in graph to be completely joined. Using this, we prove that if a graph has an optimal coloring with more than $\\frac{\\omega}{2}$ singleton color classes, then it satisfies $\\chi \\leq \\frac{\\omega + \\Delta + 1}{2}$. It follows that a graph satisfying $n - \\Delta < \\alpha + \\frac{\\omega - 1}{2}$ must also satisfy $\\chi \\leq \\frac{\\ome...

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

  19. High Energy Conversion Efficiency with 3-D Micro-Patterned Photoanode for Enhancement Diffusivity and Modification of Photon Distribution in Dye-Sensitized Solar Cells.

    Science.gov (United States)

    Yun, Min Ju; Sim, Yeon Hyang; Cha, Seung I; Seo, Seon Hee; Lee, Dong Y

    2017-11-08

    Dye sensitize solar cells (DSSCs) have been considered as the promising alternatives silicon based solar cell with their characteristics including high efficiency under weak illumination and insensitive power output to incident angle. Therefore, many researches have been studied to improve the energy conversion efficiency of DSSCs. However the efficiency of DSSCs are still trapped at the around 10%. In this study, micro-scale hexagonal shape patterned photoanode have proposed to modify light distribution of photon. In the patterned electrode, the appearance efficiency have been obtained from 7.1% to 7.8% considered active area and the efficiency of 12.7% have been obtained based on the photoanode area. Enhancing diffusion of electrons and modification of photon distribution utilizing the morphology of the electrode are major factors to improving the performance of patterned electrode. Also, finite element method analyses of photon distributions were conducted to estimate morphological effect that influence on the photon distribution and current density. From our proposed study, it is expecting that patterned electrode is one of the solution to overcome the stagnant efficiency and one of the optimized geometry of electrode to modify photon distribution. Process of inter-patterning in photoanode has been minimized.

  20. Network graph analysis and visualization with Gephi

    CERN Document Server

    Cherven, Ken

    2013-01-01

    A practical, hands-on guide, that provides you with all the tools you need to visualize and analyze your data using network graphs with Gephi.This book is for data analysts who want to intuitively reveal patterns and trends, highlight outliers, and tell stories with their data using Gephi. It is great for anyone looking to explore interactions within network datasets, whether the data comes from social media or elsewhere. It is also a valuable resource for those seeking to learn more about Gephi without being overwhelmed by technical details.

  1. Eulerian graph embeddings and trails confined to lattice tubes

    International Nuclear Information System (INIS)

    Soteros, C E

    2006-01-01

    Embeddings of graphs in sublattices of the square and simple cubic lattice known as tubes (or prisms) are considered. For such sublattices, two combinatorial bounds are obtained which each relate the number of embeddings of all closed eulerian graphs with k branch points (vertices of degree greater than two) to the number of self-avoiding polygons. From these bounds it is proved that the entropic critical exponent for the number of embeddings of closed eulerian graphs with k branch points is equal to k, and the entropic critical exponent for the number of closed trails with k branch points is equal to k + 1. One of the required combinatorial bounds is obtained via Madras' 1999 lattice cluster pattern theorem, which yields a bound on the number of ways to convert a self-avoiding polygon into a closed eulerian graph embedding with k branch points. The other combinatorial bound is established by constructing a method for sequentially removing branch points from a closed eulerian graph embedding; this yields a bound on the number of ways to convert a closed eulerian graph embedding into a self-avoiding polygon

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

  3. Graph anomalies in cyber communications

    Energy Technology Data Exchange (ETDEWEB)

    Vander Wiel, Scott A [Los Alamos National Laboratory; Storlie, Curtis B [Los Alamos National Laboratory; Sandine, Gary [Los Alamos National Laboratory; Hagberg, Aric A [Los Alamos National Laboratory; Fisk, Michael [Los Alamos National Laboratory

    2011-01-11

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

  4. Open Graphs and Computational Reasoning

    Directory of Open Access Journals (Sweden)

    Lucas Dixon

    2010-06-01

    Full Text Available We present a form of algebraic reasoning for computational objects which are expressed as graphs. Edges describe the flow of data between primitive operations which are represented by vertices. These graphs have an interface made of half-edges (edges which are drawn with an unconnected end and enjoy rich compositional principles by connecting graphs along these half-edges. In particular, this allows equations and rewrite rules to be specified between graphs. Particular computational models can then be encoded as an axiomatic set of such rules. Further rules can be derived graphically and rewriting can be used to simulate the dynamics of a computational system, e.g. evaluating a program on an input. Examples of models which can be formalised in this way include traditional electronic circuits as well as recent categorical accounts of quantum information.

  5. The toughness of split graphs

    NARCIS (Netherlands)

    Woeginger, G.J.

    1998-01-01

    In this short note we argue that the toughness of split graphs can be computed in polynomial time. This solves an open problem from a recent paper by Kratsch et al. (Discrete Math. 150 (1996) 231–245).

  6. Generating random networks and graphs

    CERN Document Server

    Coolen, Ton; Roberts, Ekaterina

    2017-01-01

    This book supports researchers who need to generate random networks, or who are interested in the theoretical study of random graphs. The coverage includes exponential random graphs (where the targeted probability of each network appearing in the ensemble is specified), growth algorithms (i.e. preferential attachment and the stub-joining configuration model), special constructions (e.g. geometric graphs and Watts Strogatz models) and graphs on structured spaces (e.g. multiplex networks). The presentation aims to be a complete starting point, including details of both theory and implementation, as well as discussions of the main strengths and weaknesses of each approach. It includes extensive references for readers wishing to go further. The material is carefully structured to be accessible to researchers from all disciplines while also containing rigorous mathematical analysis (largely based on the techniques of statistical mechanics) to support those wishing to further develop or implement the theory of rand...

  7. Graph theory and its applications

    CERN Document Server

    Gross, Jonathan L

    2006-01-01

    Gross and Yellen take a comprehensive approach to graph theory that integrates careful exposition of classical developments with emerging methods, models, and practical needs. Their unparalleled treatment provides a text ideal for a two-semester course and a variety of one-semester classes, from an introductory one-semester course to courses slanted toward classical graph theory, operations research, data structures and algorithms, or algebra and topology.

  8. Nonschematic drawing recognition: a new approach based on attributed graph grammar with flexible embedding

    Science.gov (United States)

    Lee, Kyu J.; Kunii, T. L.; Noma, T.

    1993-01-01

    In this paper, we propose a syntactic pattern recognition method for non-schematic drawings, based on a new attributed graph grammar with flexible embedding. In our graph grammar, the embedding rule permits the nodes of a guest graph to be arbitrarily connected with the nodes of a host graph. The ambiguity caused by this flexible embedding is controlled with the evaluation of synthesized attributes and the check of context sensitivity. To integrate parsing with the synthesized attribute evaluation and the context sensitivity check, we also develop a bottom up parsing algorithm.

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

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

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

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

  13. Acyclicity in edge-colored graphs

    DEFF Research Database (Denmark)

    Gutin, Gregory; Jones, Mark; Sheng, Bin

    2017-01-01

    A walk W in edge-colored graphs is called properly colored (PC) if every pair of consecutive edges in W is of different color. We introduce and study five types of PC acyclicity in edge-colored graphs such that graphs of PC acyclicity of type i is a proper superset of graphs of acyclicity of type...

  14. Building Scalable Knowledge Graphs for Earth Science

    Science.gov (United States)

    Ramachandran, Rahul; Maskey, Manil; Gatlin, Patrick; Zhang, Jia; Duan, Xiaoyi; Miller, J. J.; Bugbee, Kaylin; Christopher, Sundar; Freitag, Brian

    2017-01-01

    Knowledge Graphs link key entities in a specific domain with other entities via relationships. From these relationships, researchers can query knowledge graphs for probabilistic recommendations to infer new knowledge. Scientific papers are an untapped resource which knowledge graphs could leverage to accelerate research discovery. Goal: Develop an end-to-end (semi) automated methodology for constructing Knowledge Graphs for Earth Science.

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

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

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

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

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

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

  1. MetricForensics: A Multi-Level Approach for Mining Volatile Graphs

    Energy Technology Data Exchange (ETDEWEB)

    Henderson, Keith [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Eliassi-Rad, Tina [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Faloutsos, Christos [Carnegie Mellon Univ., Pittsburgh, PA (United States); Akoglu, Leman [Carnegie Mellon Univ., Pittsburgh, PA (United States); Li, Lei [Carnegie Mellon Univ., Pittsburgh, PA (United States); Maruhashi, Koji [Fujitsu Laboratories Ltd., Kanagawa (Japan); Prakash, B. Aditya [Carnegie Mellon Univ., Pittsburgh, PA (United States); Tong, H [Carnegie Mellon Univ., Pittsburgh, PA (United States)

    2010-02-08

    Advances in data collection and storage capacity have made it increasingly possible to collect highly volatile graph data for analysis. Existing graph analysis techniques are not appropriate for such data, especially in cases where streaming or near-real-time results are required. An example that has drawn significant research interest is the cyber-security domain, where internet communication traces are collected and real-time discovery of events, behaviors, patterns and anomalies is desired. We propose MetricForensics, a scalable framework for analysis of volatile graphs. MetricForensics combines a multi-level “drill down" approach, a collection of user-selected graph metrics and a collection of analysis techniques. At each successive level, more sophisticated metrics are computed and the graph is viewed at a finer temporal resolution. In this way, MetricForensics scales to highly volatile graphs by only allocating resources for computationally expensive analysis when an interesting event is discovered at a coarser resolution first. We test MetricForensics on three real-world graphs: an enterprise IP trace, a trace of legitimate and malicious network traffic from a research institution, and the MIT Reality Mining proximity sensor data. Our largest graph has »3M vertices and »32M edges, spanning 4:5 days. The results demonstrate the scalability and capability of MetricForensics in analyzing volatile graphs; and highlight four novel phenomena in such graphs: elbows, broken correlations, prolonged spikes, and strange stars.

  2. An original approach to the mathematical concept of graph from braid crafts

    Directory of Open Access Journals (Sweden)

    Albanese Veronica

    2016-01-01

    Full Text Available In previous researches we found that a community of Argentinean artisans models its own practices of braiding using graphs. Inspired by these findings, we designed an educational activity to introduce the concept of graphs. The study of graphs helps students to develop combinatorial and systematic thinking as well as skills to model reality and abstract and generalize patterns from particular situations. The tasks proposed aim to construct the concept of graphs, then identify characteristics that allow some graphs to be models of braids and finally use them to invent more graphs for new braids. The activity performed in a secondary school teachers’ educational course, had quite satisfactory results due to the number of braids invented and the small amount of mistakes made by the participants.

  3. Schur complements of matrices with acyclic bipartite graphs

    DEFF Research Database (Denmark)

    Britz, Thomas Johann; Olesky, D.D.; van den Driessche, P.

    2005-01-01

    Bipartite graphs are used to describe the generalized Schur complements of real matrices having nos quare submatrix with two or more nonzero diagonals. For any matrix A with this property, including any nearly reducible matrix, the sign pattern of each generalized Schur complement is shown to be ...

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

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

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

  7. Query Optimizations over Decentralized RDF Graphs

    KAUST Repository

    Abdelaziz, Ibrahim

    2017-05-18

    Applications in life sciences, decentralized social networks, Internet of Things, and statistical linked dataspaces integrate data from multiple decentralized RDF graphs via SPARQL queries. Several approaches have been proposed to optimize query processing over a small number of heterogeneous data sources by utilizing schema information. In the case of schema similarity and interlinks among sources, these approaches cause unnecessary data retrieval and communication, leading to poor scalability and response time. This paper addresses these limitations and presents Lusail, a system for scalable and efficient SPARQL query processing over decentralized graphs. Lusail achieves scalability and low query response time through various optimizations at compile and run times. At compile time, we use a novel locality-aware query decomposition technique that maximizes the number of query triple patterns sent together to a source based on the actual location of the instances satisfying these triple patterns. At run time, we use selectivity-awareness and parallel query execution to reduce network latency and to increase parallelism by delaying the execution of subqueries expected to return large results. We evaluate Lusail using real and synthetic benchmarks, with data sizes up to billions of triples on an in-house cluster and a public cloud. We show that Lusail outperforms state-of-the-art systems by orders of magnitude in terms of scalability and response time.

  8. Diffuse nitrogen loss simulation and impact assessment of stereoscopic agriculture pattern by integrated water system model and consideration of multiple existence forms

    Science.gov (United States)

    Zhang, Yongyong; Gao, Yang; Yu, Qiang

    2017-09-01

    Agricultural nitrogen loss becomes an increasingly important source of water quality deterioration and eutrophication, even threatens water safety for humanity. Nitrogen dynamic mechanism is still too complicated to be well captured at watershed scale due to its multiple existence forms and instability, disturbance of agricultural management practices. Stereoscopic agriculture is a novel agricultural planting pattern to efficiently use local natural resources (e.g., water, land, sunshine, heat and fertilizer). It is widely promoted as a high yield system and can obtain considerable economic benefits, particularly in China. However, its environmental quality implication is not clear. In our study, Qianyanzhou station is famous for its stereoscopic agriculture pattern of Southern China, and an experimental watershed was selected as our study area. Regional characteristics of runoff and nitrogen losses were simulated by an integrated water system model (HEQM) with multi-objective calibration, and multiple agriculture practices were assessed to find the effective approach for the reduction of diffuse nitrogen losses. Results showed that daily variations of runoff and nitrogen forms were well reproduced throughout watershed, i.e., satisfactory performances for ammonium and nitrate nitrogen (NH4-N and NO3-N) loads, good performances for runoff and organic nitrogen (ON) load, and very good performance for total nitrogen (TN) load. The average loss coefficient was 62.74 kg/ha for NH4-N, 0.98 kg/ha for NO3-N, 0.0004 kg/ha for ON and 63.80 kg/ha for TN. The dominating form of nitrogen losses was NH4-N due to the applied fertilizers, and the most dramatic zones aggregated in the middle and downstream regions covered by paddy and orange orchard. In order to control diffuse nitrogen losses, the most effective practices for Qianyanzhou stereoscopic agriculture pattern were to reduce farmland planting scale in the valley by afforestation, particularly for orchard in the

  9. Eigenfunction statistics on quantum graphs

    International Nuclear Information System (INIS)

    Gnutzmann, S.; Keating, J.P.; Piotet, F.

    2010-01-01

    We investigate the spatial statistics of the energy eigenfunctions on large quantum graphs. It has previously been conjectured that these should be described by a Gaussian Random Wave Model, by analogy with quantum chaotic systems, for which such a model was proposed by Berry in 1977. The autocorrelation functions we calculate for an individual quantum graph exhibit a universal component, which completely determines a Gaussian Random Wave Model, and a system-dependent deviation. This deviation depends on the graph only through its underlying classical dynamics. Classical criteria for quantum universality to be met asymptotically in the large graph limit (i.e. for the non-universal deviation to vanish) are then extracted. We use an exact field theoretic expression in terms of a variant of a supersymmetric σ model. A saddle-point analysis of this expression leads to the estimates. In particular, intensity correlations are used to discuss the possible equidistribution of the energy eigenfunctions in the large graph limit. When equidistribution is asymptotically realized, our theory predicts a rate of convergence that is a significant refinement of previous estimates. The universal and system-dependent components of intensity correlation functions are recovered by means of an exact trace formula which we analyse in the diagonal approximation, drawing in this way a parallel between the field theory and semiclassics. Our results provide the first instance where an asymptotic Gaussian Random Wave Model has been established microscopically for eigenfunctions in a system with no disorder.

  10. Box graphs and resolutions I

    Directory of Open Access Journals (Sweden)

    Andreas P. Braun

    2016-04-01

    Full Text Available Box graphs succinctly and comprehensively characterize singular fibers of elliptic fibrations in codimension two and three, as well as flop transitions connecting these, in terms of representation theoretic data. We develop a framework that provides a systematic map between a box graph and a crepant algebraic resolution of the singular elliptic fibration, thus allowing an explicit construction of the fibers from a singular Weierstrass or Tate model. The key tool is what we call a fiber face diagram, which shows the relevant information of a (partial toric triangulation and allows the inclusion of more general algebraic blowups. We shown that each such diagram defines a sequence of weighted algebraic blowups, thus providing a realization of the fiber defined by the box graph in terms of an explicit resolution. We show this correspondence explicitly for the case of SU(5 by providing a map between box graphs and fiber faces, and thereby a sequence of algebraic resolutions of the Tate model, which realizes each of the box graphs.

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

  12. Hierarchical organisation of causal graphs

    International Nuclear Information System (INIS)

    Dziopa, P.

    1993-01-01

    This paper deals with the design of a supervision system using a hierarchy of models formed by graphs, in which the variables are the nodes and the causal relations between the variables of the arcs. To obtain a representation of the variables evolutions which contains only the relevant features of their real evolutions, the causal relations are completed with qualitative transfer functions (QTFs) which produce roughly the behaviour of the classical transfer functions. Major improvements have been made in the building of the hierarchical organization. First, the basic variables of the uppermost level and the causal relations between them are chosen. The next graph is built by adding intermediary variables to the upper graph. When the undermost graph has been built, the transfer functions parameters corresponding to its causal relations are identified. The second task consists in the upwelling of the information from the undermost graph to the uppermost one. A fusion procedure of the causal relations has been designed to compute the QFTs relevant for each level. This procedure aims to reduce the number of parameters needed to represent an evolution at a high level of abstraction. These techniques have been applied to the hierarchical modelling of nuclear process. (authors). 8 refs., 12 figs

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

  14. High-resolution computed tomography to differentiate chronic diffuse interstitial lung diseases with predominant ground-glass pattern using logical analysis of data

    International Nuclear Information System (INIS)

    Martin, Sophie Grivaud; Brauner, Michel W.; Rety, Frederique; Kronek, Louis-Philippe; Brauner, Nadia; Valeyre, Dominique; Nunes, Hilario; Brillet, Pierre-Yves

    2010-01-01

    We evaluated the performance of high-resolution computed tomography (HRCT) to differentiate chronic diffuse interstitial lung diseases (CDILD) with predominant ground-glass pattern by using logical analysis of data (LAD). A total of 162 patients were classified into seven categories: sarcoidosis (n = 38), connective tissue disease (n = 32), hypersensitivity pneumonitis (n = 18), drug-induced lung disease (n = 15), alveolar proteinosis (n = 12), idiopathic non-specific interstitial pneumonia (n = 10) and miscellaneous (n = 37). First, 40 CT attributes were investigated by the LAD to build up patterns characterising a category. From the association of patterns, LAD determined models specific to each CDILD. Second, data were recomputed by adding eight clinical attributes to the analysis. The 20 x 5 cross-folding method was used for validation. Models could be individualised for sarcoidosis, hypersensitivity pneumonitis, connective tissue disease and alveolar proteinosis. An additional model was individualised for drug-induced lung disease by adding clinical data. No model was demonstrated for idiopathic non-specific interstitial pneumonia and the miscellaneous category. The results showed that HRCT had a good sensitivity (≥64%) and specificity (≥78%) and a high negative predictive value (≥93%) for diseases with a model. Higher sensitivity (≥78%) and specificity (≥89%) were achieved by adding clinical data. The diagnostic performance of HRCT is high and can be increased by adding clinical data. (orig.)

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

  16. Graph modeling systems and methods

    Science.gov (United States)

    Neergaard, Mike

    2015-10-13

    An apparatus and a method for vulnerability and reliability modeling are provided. The method generally includes constructing a graph model of a physical network using a computer, the graph model including a plurality of terminating vertices to represent nodes in the physical network, a plurality of edges to represent transmission paths in the physical network, and a non-terminating vertex to represent a non-nodal vulnerability along a transmission path in the physical network. The method additionally includes evaluating the vulnerability and reliability of the physical network using the constructed graph model, wherein the vulnerability and reliability evaluation includes a determination of whether each terminating and non-terminating vertex represents a critical point of failure. The method can be utilized to evaluate wide variety of networks, including power grid infrastructures, communication network topologies, and fluid distribution systems.

  17. On the graph turnpike problem

    KAUST Repository

    Feder, Tomá s; Motwani, Rajeev

    2009-01-01

    Results on graph turnpike problem without distinctness, including its NP-completeness, and an O(m+n log n) algorithm, is presented. The usual turnpike problem has all pairwise distances given, but does not specify which pair of vertices w e corresponds to. There are two other problems that can be viewed as special cases of the graph turnpike problem, including the bandwidth problem and the low-distortion graph embedding problem. The aim for the turnpike problem in the NP-complete is to orient the edges with weights w i in either direction so that when the whole cycle is transversed in the real line, it returns to a chosen starting point for the cycle. An instance of the turnpike problem with or without distinctness is uniquely mappable if there exists at most one solution up to translation and choice of orientation.

  18. On the graph turnpike problem

    KAUST Repository

    Feder, Tomás

    2009-06-01

    Results on graph turnpike problem without distinctness, including its NP-completeness, and an O(m+n log n) algorithm, is presented. The usual turnpike problem has all pairwise distances given, but does not specify which pair of vertices w e corresponds to. There are two other problems that can be viewed as special cases of the graph turnpike problem, including the bandwidth problem and the low-distortion graph embedding problem. The aim for the turnpike problem in the NP-complete is to orient the edges with weights w i in either direction so that when the whole cycle is transversed in the real line, it returns to a chosen starting point for the cycle. An instance of the turnpike problem with or without distinctness is uniquely mappable if there exists at most one solution up to translation and choice of orientation.

  19. Negation switching invariant signed graphs

    Directory of Open Access Journals (Sweden)

    Deepa Sinha

    2014-04-01

    Full Text Available A signed graph (or, $sigraph$ in short is a graph G in which each edge x carries a value $\\sigma(x \\in \\{-, +\\}$ called its sign. Given a sigraph S, the negation $\\eta(S$ of the sigraph S is a sigraph obtained from S by reversing the sign of every edge of S. Two sigraphs $S_{1}$ and $S_{2}$ on the same underlying graph are switching equivalent if it is possible to assign signs `+' (`plus' or `-' (`minus' to vertices of $S_{1}$ such that by reversing the sign of each of its edges that has received opposite signs at its ends, one obtains $S_{2}$. In this paper, we characterize sigraphs which are negation switching invariant and also see for what sigraphs, S and $\\eta (S$ are signed isomorphic.

  20. Quantum snake walk on graphs

    International Nuclear Information System (INIS)

    Rosmanis, Ansis

    2011-01-01

    I introduce a continuous-time quantum walk on graphs called the quantum snake walk, the basis states of which are fixed-length paths (snakes) in the underlying graph. First, I analyze the quantum snake walk on the line, and I show that, even though most states stay localized throughout the evolution, there are specific states that most likely move on the line as wave packets with momentum inversely proportional to the length of the snake. Next, I discuss how an algorithm based on the quantum snake walk might potentially be able to solve an extended version of the glued trees problem, which asks to find a path connecting both roots of the glued trees graph. To the best of my knowledge, no efficient quantum algorithm solving this problem is known yet.

  1. A Comparative Study of Theoretical Graph Models for Characterizing Structural Networks of Human Brain

    Directory of Open Access Journals (Sweden)

    Xiaojin Li

    2013-01-01

    Full Text Available Previous studies have investigated both structural and functional brain networks via graph-theoretical methods. However, there is an important issue that has not been adequately discussed before: what is the optimal theoretical graph model for describing the structural networks of human brain? In this paper, we perform a comparative study to address this problem. Firstly, large-scale cortical regions of interest (ROIs are localized by recently developed and validated brain reference system named Dense Individualized Common Connectivity-based Cortical Landmarks (DICCCOL to address the limitations in the identification of the brain network ROIs in previous studies. Then, we construct structural brain networks based on diffusion tensor imaging (DTI data. Afterwards, the global and local graph properties of the constructed structural brain networks are measured using the state-of-the-art graph analysis algorithms and tools and are further compared with seven popular theoretical graph models. In addition, we compare the topological properties between two graph models, namely, stickiness-index-based model (STICKY and scale-free gene duplication model (SF-GD, that have higher similarity with the real structural brain networks in terms of global and local graph properties. Our experimental results suggest that among the seven theoretical graph models compared in this study, STICKY and SF-GD models have better performances in characterizing the structural human brain network.

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

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

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

  5. XML Graphs in Program Analysis

    DEFF Research Database (Denmark)

    Møller, Anders; Schwartzbach, Michael Ignatieff

    2007-01-01

    XML graphs have shown to be a simple and effective formalism for representing sets of XML documents in program analysis. It has evolved through a six year period with variants tailored for a range of applications. We present a unified definition, outline the key properties including validation...... of XML graphs against different XML schema languages, and provide a software package that enables others to make use of these ideas. We also survey four very different applications: XML in Java, Java Servlets and JSP, transformations between XML and non-XML data, and XSLT....

  6. Graph topologies on closed multifunctions

    Directory of Open Access Journals (Sweden)

    Giuseppe Di Maio

    2003-10-01

    Full Text Available In this paper we study function space topologies on closed multifunctions, i.e. closed relations on X x Y using various hypertopologies. The hypertopologies are in essence, graph topologies i.e topologies on functions considered as graphs which are subsets of X x Y . We also study several topologies, including one that is derived from the Attouch-Wets filter on the range. We state embedding theorems which enable us to generalize and prove some recent results in the literature with the use of known results in the hyperspace of the range space and in the function space topologies of ordinary functions.

  7. Cyclic graphs and Apery's theorem

    International Nuclear Information System (INIS)

    Sorokin, V N

    2002-01-01

    This is a survey of results about the behaviour of Hermite-Pade approximants for graphs of Markov functions, and a survey of interpolation problems leading to Apery's result about the irrationality of the value ζ(3) of the Riemann zeta function. The first example is given of a cyclic graph for which the Hermite-Pade problem leads to Apery's theorem. Explicit formulae for solutions are obtained, namely, Rodrigues' formulae and integral representations. The asymptotic behaviour of the approximants is studied, and recurrence formulae are found

  8. Interacting particle systems on graphs

    Science.gov (United States)

    Sood, Vishal

    In this dissertation, the dynamics of socially or biologically interacting populations are investigated. The individual members of the population are treated as particles that interact via links on a social or biological network represented as a graph. The effect of the structure of the graph on the properties of the interacting particle system is studied using statistical physics techniques. In the first chapter, the central concepts of graph theory and social and biological networks are presented. Next, interacting particle systems that are drawn from physics, mathematics and biology are discussed in the second chapter. In the third chapter, the random walk on a graph is studied. The mean time for a random walk to traverse between two arbitrary sites of a random graph is evaluated. Using an effective medium approximation it is found that the mean first-passage time between pairs of sites, as well as all moments of this first-passage time, are insensitive to the density of links in the graph. The inverse of the mean-first passage time varies non-monotonically with the density of links near the percolation transition of the random graph. Much of the behavior can be understood by simple heuristic arguments. Evolutionary dynamics, by which mutants overspread an otherwise uniform population on heterogeneous graphs, are studied in the fourth chapter. Such a process underlies' epidemic propagation, emergence of fads, social cooperation or invasion of an ecological niche by a new species. The first part of this chapter is devoted to neutral dynamics, in which the mutant genotype does not have a selective advantage over the resident genotype. The time to extinction of one of the two genotypes is derived. In the second part of this chapter, selective advantage or fitness is introduced such that the mutant genotype has a higher birth rate or a lower death rate. This selective advantage leads to a dynamical competition in which selection dominates for large populations

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

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

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

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

  13. Neural coding in graphs of bidirectional associative memories.

    Science.gov (United States)

    Bouchain, A David; Palm, Günther

    2012-01-24

    In the last years we have developed large neural network models for the realization of complex cognitive tasks in a neural network architecture that resembles the network of the cerebral cortex. We have used networks of several cortical modules that contain two populations of neurons (one excitatory, one inhibitory). The excitatory populations in these so-called "cortical networks" are organized as a graph of Bidirectional Associative Memories (BAMs), where edges of the graph correspond to BAMs connecting two neural modules and nodes of the graph correspond to excitatory populations with associative feedback connections (and inhibitory interneurons). The neural code in each of these modules consists essentially of the firing pattern of the excitatory population, where mainly it is the subset of active neurons that codes the contents to be represented. The overall activity can be used to distinguish different properties of the patterns that are represented which we need to distinguish and control when performing complex tasks like language understanding with these cortical networks. The most important pattern properties or situations are: exactly fitting or matching input, incomplete information or partially matching pattern, superposition of several patterns, conflicting information, and new information that is to be learned. We show simple simulations of these situations in one area or module and discuss how to distinguish these situations based on the overall internal activation of the module. This article is part of a Special Issue entitled "Neural Coding". Copyright © 2011 Elsevier B.V. All rights reserved.

  14. Constructing Knowledge Graphs of Depression

    NARCIS (Netherlands)

    Huang, Zhisheng; Yang, Jie; van Harmelen, Frank; Hu, Qing

    2017-01-01

    Knowledge Graphs have been shown to be useful tools for integrating multiple medical knowledge sources, and to support such tasks as medical decision making, literature retrieval, determining healthcare quality indicators, co-morbodity analysis and many others. A large number of medical knowledge

  15. Partitioning graphs into connected parts

    NARCIS (Netherlands)

    Hof, van 't P.; Paulusma, D.; Woeginger, G.J.; Frid, A.; Morozov, A.S.; Rybalchenko, A.; Wagner, K.W.

    2009-01-01

    The 2-DISJOINT CONNECTED SUBGRAPHS problem asks if a given graph has two vertex-disjoint connected subgraphs containing pre-specified sets of vertices. We show that this problem is NP-complete even if one of the sets has cardinality 2. The LONGEST PATH CONTRACTIBILITY problem asks for the largest

  16. Isoperimetric inequalities for minimal graphs

    International Nuclear Information System (INIS)

    Pacelli Bessa, G.; Montenegro, J.F.

    2007-09-01

    Based on Markvorsen and Palmer's work on mean time exit and isoperimetric inequalities we establish slightly better isoperimetric inequalities and mean time exit estimates for minimal graphs in N x R. We also prove isoperimetric inequalities for submanifolds of Hadamard spaces with tamed second fundamental form. (author)

  17. Ancestral Genres of Mathematical Graphs

    Science.gov (United States)

    Gerofsky, Susan

    2011-01-01

    Drawing from sources in gesture studies, cognitive science, the anthropology of religion and art/architecture history, this article explores cultural, bodily and cosmological resonances carried (unintentionally) by mathematical graphs on Cartesian coordinates. Concepts of asymmetric bodily spaces, grids, orthogonality, mapping and sacred spaces…

  18. Humidity Graphs for All Seasons.

    Science.gov (United States)

    Esmael, F.

    1982-01-01

    In a previous article in this journal (Vol. 17, p358, 1979), a wet-bulb depression table was recommended for two simple experiments to determine relative humidity. However, the use of a graph is suggested because it gives the relative humidity directly from the wet and dry bulb readings. (JN)

  19. Contracting a planar graph efficiently

    DEFF Research Database (Denmark)

    Holm, Jacob; Italiano, Giuseppe F.; Karczmarz, Adam

    2017-01-01

    the data structure, we can achieve optimal running times for decremental bridge detection, 2-edge connectivity, maximal 3-edge connected components, and the problem of finding a unique perfect matching for a static planar graph. Furthermore, we improve the running times of algorithms for several planar...

  20. Graph Model Based Indoor Tracking

    DEFF Research Database (Denmark)

    Jensen, Christian Søndergaard; Lu, Hua; Yang, Bin

    2009-01-01

    The tracking of the locations of moving objects in large indoor spaces is important, as it enables a range of applications related to, e.g., security and indoor navigation and guidance. This paper presents a graph model based approach to indoor tracking that offers a uniform data management...

  1. A graph with fractional revival

    Science.gov (United States)

    Bernard, Pierre-Antoine; Chan, Ada; Loranger, Érika; Tamon, Christino; Vinet, Luc

    2018-02-01

    An example of a graph that admits balanced fractional revival between antipodes is presented. It is obtained by establishing the correspondence between the quantum walk on a hypercube where the opposite vertices across the diagonals of each face are connected and, the coherent transport of single excitations in the extension of the Krawtchouk spin chain with next-to-nearest neighbour interactions.

  2. Fixation Time for Evolutionary Graphs

    Science.gov (United States)

    Nie, Pu-Yan; Zhang, Pei-Ai

    Evolutionary graph theory (EGT) is recently proposed by Lieberman et al. in 2005. EGT is successful for explaining biological evolution and some social phenomena. It is extremely important to consider the time of fixation for EGT in many practical problems, including evolutionary theory and the evolution of cooperation. This study characterizes the time to asymptotically reach fixation.

  3. Mathematical Minute: Rotating a Function Graph

    Science.gov (United States)

    Bravo, Daniel; Fera, Joseph

    2013-01-01

    Using calculus only, we find the angles you can rotate the graph of a differentiable function about the origin and still obtain a function graph. We then apply the solution to odd and even degree polynomials.

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

  5. Bounds on Gromov hyperbolicity constant in graphs

    Indian Academy of Sciences (India)

    Infinite graphs; Cartesian product graphs; independence number; domin- ation number; geodesics ... the secure transmission of information through the internet (see [15, 16]). In particular, ..... In particular, δ(G) is an integer multiple of 1/4.

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

  7. Torsional rigidity, isospectrality and quantum graphs

    International Nuclear Information System (INIS)

    Colladay, Don; McDonald, Patrick; Kaganovskiy, Leon

    2017-01-01

    We study torsional rigidity for graph and quantum graph analogs of well-known pairs of isospectral non-isometric planar domains. We prove that such isospectral pairs are distinguished by torsional rigidity. (paper)

  8. Functionals of Brownian motion, localization and metric graphs

    International Nuclear Information System (INIS)

    Comtet, Alain; Desbois, Jean; Texier, Christophe

    2005-01-01

    We review several results related to the problem of a quantum particle in a random environment. In an introductory part, we recall how several functionals of Brownian motion arise in the study of electronic transport in weakly disordered metals (weak localization). Two aspects of the physics of the one-dimensional strong localization are reviewed: some properties of the scattering by a random potential (time delay distribution) and a study of the spectrum of a random potential on a bounded domain (the extreme value statistics of the eigenvalues). Then we mention several results concerning the diffusion on graphs, and more generally the spectral properties of the Schroedinger operator on graphs. The interest of spectral determinants as generating functions characterizing the diffusion on graphs is illustrated. Finally, we consider a two-dimensional model of a charged particle coupled to the random magnetic field due to magnetic vortices. We recall the connection between spectral properties of this model and winding functionals of planar Brownian motion. (topical review)

  9. Bond graph modeling of centrifugal compression systems

    OpenAIRE

    Uddin, Nur; Gravdahl, Jan Tommy

    2015-01-01

    A novel approach to model unsteady fluid dynamics in a compressor network by using a bond graph is presented. The model is intended in particular for compressor control system development. First, we develop a bond graph model of a single compression system. Bond graph modeling offers a different perspective to previous work by modeling the compression system based on energy flow instead of fluid dynamics. Analyzing the bond graph model explains the energy flow during compressor surge. Two pri...

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

  11. Sphere and dot product representations of graphs

    NARCIS (Netherlands)

    R.J. Kang (Ross); T. Müller (Tobias)

    2012-01-01

    textabstractA graph $G$ is a $k$-sphere graph if there are $k$-dimensional real vectors $v_1,\\dots,v_n$ such that $ij\\in E(G)$ if and only if the distance between $v_i$ and $v_j$ is at most $1$. A graph $G$ is a $k$-dot product graph if there are $k$-dimensional real vectors $v_1,\\dots,v_n$ such

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

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

  14. VIGOR: Interactive Visual Exploration of Graph Query Results.

    Science.gov (United States)

    Pienta, Robert; Hohman, Fred; Endert, Alex; Tamersoy, Acar; Roundy, Kevin; Gates, Chris; Navathe, Shamkant; Chau, Duen Horng

    2018-01-01

    Finding patterns in graphs has become a vital challenge in many domains from biological systems, network security, to finance (e.g., finding money laundering rings of bankers and business owners). While there is significant interest in graph databases and querying techniques, less research has focused on helping analysts make sense of underlying patterns within a group of subgraph results. Visualizing graph query results is challenging, requiring effective summarization of a large number of subgraphs, each having potentially shared node-values, rich node features, and flexible structure across queries. We present VIGOR, a novel interactive visual analytics system, for exploring and making sense of query results. VIGOR uses multiple coordinated views, leveraging different data representations and organizations to streamline analysts sensemaking process. VIGOR contributes: (1) an exemplar-based interaction technique, where an analyst starts with a specific result and relaxes constraints to find other similar results or starts with only the structure (i.e., without node value constraints), and adds constraints to narrow in on specific results; and (2) a novel feature-aware subgraph result summarization. Through a collaboration with Symantec, we demonstrate how VIGOR helps tackle real-world problems through the discovery of security blindspots in a cybersecurity dataset with over 11,000 incidents. We also evaluate VIGOR with a within-subjects study, demonstrating VIGOR's ease of use over a leading graph database management system, and its ability to help analysts understand their results at higher speed and make fewer errors.

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

  16. Diffusion on Networks and Diffusion Weighted NMR of the Human Lung

    DEFF Research Database (Denmark)

    Buhl, Niels

    2011-01-01

    of the diffusion propagator to general properties of the underlying graph. Diffusion weighted NMR of the human lung with hyperpolarized noble gases, which over the last decade has been demonstrated to be a very promising way of detecting and quantifying lung diseases like emphysema, represent an obvious...... application of the above mentioned theory, given that the human lung consists of a large network of bifurcating tube like airways. 90-95% of the gas in a human lung resides in the ~30000 pulmonary acini, each of these consists of ~500 airways, which are connected as the edges in a binary tree. We model...... diffusion in the pulmonary acini as diffusion on metric graphs with this structure. The metric graph for each individual pulmonary acinus is embedded in three dimensional space via line segments. By considering an isotropic distribution of acini and a symmetric branching geometry for the line segments...

  17. My Bar Graph Tells a Story

    Science.gov (United States)

    McMillen, Sue; McMillen, Beth

    2010-01-01

    Connecting stories to qualitative coordinate graphs has been suggested as an effective instructional strategy. Even students who are able to "create" bar graphs may struggle to correctly "interpret" them. Giving children opportunities to work with qualitative graphs can help them develop the skills to interpret, describe, and compare information…

  18. The groupies of random multipartite graphs

    OpenAIRE

    Portmann, Marius; Wang, Hongyun

    2012-01-01

    If a vertex $v$ in a graph $G$ has degree larger than the average of the degrees of its neighbors, we call it a groupie in $G$. In the current work, we study the behavior of groupie in random multipartite graphs with the link probability between sets of nodes fixed. Our results extend the previous ones on random (bipartite) graphs.

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

  20. A Type Graph Model for Java Programs

    NARCIS (Netherlands)

    Rensink, Arend; Zambon, Eduardo

    2009-01-01

    In this report we present a type graph that models all executable constructs of the Java programming language. Such a model is useful for any graph-based technique that relies on a representation of Java programs as graphs. The model can be regarded as a common representation to which all Java

  1. An intersection graph of straight lines

    DEFF Research Database (Denmark)

    Thomassen, Carsten

    2002-01-01

    G. Ehrlich, S. Even, and R.E. Tarjan conjectured that the graph obtained from a complete 3 partite graph K4,4,4 by deleting the edges of four disjoint triangles is not the intersection graph of straight line segments in the plane. We show that it is....

  2. Girth 5 graphs from relative difference sets

    DEFF Research Database (Denmark)

    Jørgensen, Leif Kjær

    2005-01-01

    We consider the problem of construction of graphs with given degree $k$ and girth 5 and as few vertices as possible. We give a construction of a family of girth 5 graphs based on relative difference sets. This family contains the smallest known graph of degree 8 and girth 5 which was constructed ...

  3. Cycles in weighted graphs and related topics

    NARCIS (Netherlands)

    Zhang, Shenggui

    2002-01-01

    This thesis contains results on paths andcycles in graphs andon a more or less relatedtopic, the vulnerability of graphs. In the first part of the thesis, Chapters 2 through 5, we concentrate on paths andcycles in weightedgraphs. A number of sufficient conditions are presentedfor graphs to contain

  4. Graph Transformation Semantics for a QVT Language

    NARCIS (Netherlands)

    Rensink, Arend; Nederpel, Ronald; Bruni, Roberto; Varró, Dániel

    It has been claimed by many in the graph transformation community that model transformation, as understood in the context of Model Driven Architecture, can be seen as an application of graph transformation. In this paper we substantiate this claim by giving a graph transformation-based semantics to

  5. Girth 5 graphs from relative difference sets

    DEFF Research Database (Denmark)

    Jørgensen, Leif Kjær

    We consider the problem of construction of graphs with given degree and girth 5 and as few vertices as possible. We give a construction of a family of girth 5 graphs based on relative difference sets. This family contains the smallest known graph of degree 8 and girth 5 which was constructed by G...

  6. Improper colouring of (random) unit disk graphs

    NARCIS (Netherlands)

    Kang, R.J.; Müller, T.; Sereni, J.S.

    2008-01-01

    For any graph G, the k-improper chromatic number ¿k(G) is the smallest number of colours used in a colouring of G such that each colour class induces a subgraph of maximum degree k. We investigate ¿k for unit disk graphs and random unit disk graphs to generalise results of McDiarmid and Reed

  7. Alliances and Bisection Width for Planar Graphs

    DEFF Research Database (Denmark)

    Olsen, Martin; Revsbæk, Morten

    2013-01-01

    An alliance in a graph is a set of vertices (allies) such that each vertex in the alliance has at least as many allies (counting the vertex itself) as non-allies in its neighborhood of the graph. We show that any planar graph with minimum degree at least 4 can be split into two alliances in polyn...

  8. A Type Graph Model for Java Programs

    NARCIS (Netherlands)

    Rensink, Arend; Zambon, Eduardo; Lee, D.; Lopes, A.; Poetzsch-Heffter, A.

    2009-01-01

    In this work we present a type graph that models all executable constructs of the Java programming language. Such a model is useful for any graph-based technique that relies on a representation of Java programs as graphs. The model can be regarded as a common representation to which all Java syntax

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

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

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

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

  13. 47 CFR 80.761 - Conversion graphs.

    Science.gov (United States)

    2010-10-01

    ... MARITIME SERVICES Standards for Computing Public Coast Station VHF Coverage § 80.761 Conversion graphs. The following graphs must be employed where conversion from one to the other of the indicated types of units is... 47 Telecommunication 5 2010-10-01 2010-10-01 false Conversion graphs. 80.761 Section 80.761...

  14. Multiclass Data Segmentation using Diffuse Interface Methods on Graphs

    Science.gov (United States)

    2014-01-01

    the Claremont Graduate University and San Diego State University joint program, working under the supervision of Prof. Allon Percus and Dr. Arjuna...identifying some borders of the red cow as part of the black cow. Multiclass GL also has problems identifying parts of the grass. C. MNIST Data The MNIST data...from the Université Paris-Sud, Orsay in 1997. He was a member of the scientific staff at Los Alamos National Laboratory in the Division of Computer

  15. Fast Multiclass Segmentation using Diffuse Interface Methods on Graphs

    Science.gov (United States)

    2013-02-01

    student in the Joint Degree Program in Computational Science at Claremont Graduate University and San Diego State University. She obtained her...9 4 3 8 33 121 32 0 96 70 6620 mistakes made correspond to identifying some borders of the red cow as part of the black cow. (a) Original Image (b...He was a member of the scientific staff at Los Alamos National Laboratory in the Division of Computer and Computational Sciences, and from 2003 to

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

  17. Equilibrium statistical mechanics on correlated random graphs

    Science.gov (United States)

    Barra, Adriano; Agliari, Elena

    2011-02-01

    Biological and social networks have recently attracted great attention from physicists. Among several aspects, two main ones may be stressed: a non-trivial topology of the graph describing the mutual interactions between agents and, typically, imitative, weighted, interactions. Despite such aspects being widely accepted and empirically confirmed, the schemes currently exploited in order to generate the expected topology are based on a priori assumptions and, in most cases, implement constant intensities for links. Here we propose a simple shift [-1,+1]\\to [0,+1] in the definition of patterns in a Hopfield model: a straightforward effect is the conversion of frustration into dilution. In fact, we show that by varying the bias of pattern distribution, the network topology (generated by the reciprocal affinities among agents, i.e. the Hebbian rule) crosses various well-known regimes, ranging from fully connected, to an extreme dilution scenario, then to completely disconnected. These features, as well as small-world properties, are, in this context, emergent and no longer imposed a priori. The model is throughout investigated also from a thermodynamics perspective: the Ising model defined on the resulting graph is analytically solved (at a replica symmetric level) by extending the double stochastic stability technique, and presented together with its fluctuation theory for a picture of criticality. Overall, our findings show that, at least at equilibrium, dilution (of whatever kind) simply decreases the strength of the coupling felt by the spins, but leaves the paramagnetic/ferromagnetic flavors unchanged. The main difference with respect to previous investigations is that, within our approach, replicas do not appear: instead of (multi)-overlaps as order parameters, we introduce a class of magnetizations on all the possible subgraphs belonging to the main one investigated: as a consequence, for these objects a closure for a self-consistent relation is achieved.

  18. Equilibrium statistical mechanics on correlated random graphs

    International Nuclear Information System (INIS)

    Barra, Adriano; Agliari, Elena

    2011-01-01

    Biological and social networks have recently attracted great attention from physicists. Among several aspects, two main ones may be stressed: a non-trivial topology of the graph describing the mutual interactions between agents and, typically, imitative, weighted, interactions. Despite such aspects being widely accepted and empirically confirmed, the schemes currently exploited in order to generate the expected topology are based on a priori assumptions and, in most cases, implement constant intensities for links. Here we propose a simple shift [-1,+1]→[0,+1] in the definition of patterns in a Hopfield model: a straightforward effect is the conversion of frustration into dilution. In fact, we show that by varying the bias of pattern distribution, the network topology (generated by the reciprocal affinities among agents, i.e. the Hebbian rule) crosses various well-known regimes, ranging from fully connected, to an extreme dilution scenario, then to completely disconnected. These features, as well as small-world properties, are, in this context, emergent and no longer imposed a priori. The model is throughout investigated also from a thermodynamics perspective: the Ising model defined on the resulting graph is analytically solved (at a replica symmetric level) by extending the double stochastic stability technique, and presented together with its fluctuation theory for a picture of criticality. Overall, our findings show that, at least at equilibrium, dilution (of whatever kind) simply decreases the strength of the coupling felt by the spins, but leaves the paramagnetic/ferromagnetic flavors unchanged. The main difference with respect to previous investigations is that, within our approach, replicas do not appear: instead of (multi)-overlaps as order parameters, we introduce a class of magnetizations on all the possible subgraphs belonging to the main one investigated: as a consequence, for these objects a closure for a self-consistent relation is achieved

  19. Analyzing and synthesizing phylogenies using tree alignment graphs.

    Directory of Open Access Journals (Sweden)

    Stephen A Smith

    Full Text Available Phylogenetic trees are used to analyze and visualize evolution. However, trees can be imperfect datatypes when summarizing multiple trees. This is especially problematic when accommodating for biological phenomena such as horizontal gene transfer, incomplete lineage sorting, and hybridization, as well as topological conflict between datasets. Additionally, researchers may want to combine information from sets of trees that have partially overlapping taxon sets. To address the problem of analyzing sets of trees with conflicting relationships and partially overlapping taxon sets, we introduce methods for aligning, synthesizing and analyzing rooted phylogenetic trees within a graph, called a tree alignment graph (TAG. The TAG can be queried and analyzed to explore uncertainty and conflict. It can also be synthesized to construct trees, presenting an alternative to supertrees approaches. We demonstrate these methods with two empirical datasets. In order to explore uncertainty, we constructed a TAG of the bootstrap trees from the Angiosperm Tree of Life project. Analysis of the resulting graph demonstrates that areas of the dataset that are unresolved in majority-rule consensus tree analyses can be understood in more detail within the context of a graph structure, using measures incorporating node degree and adjacency support. As an exercise in synthesis (i.e., summarization of a TAG constructed from the alignment trees, we also construct a TAG consisting of the taxonomy and source trees from a recent comprehensive bird study. We synthesized this graph into a tree that can be reconstructed in a repeatable fashion and where the underlying source information can be updated. The methods presented here are tractable for large scale analyses and serve as a basis for an alternative to consensus tree and supertree methods. Furthermore, the exploration of these graphs can expose structures and patterns within the dataset that are otherwise difficult to

  20. Analyzing and synthesizing phylogenies using tree alignment graphs.

    Science.gov (United States)

    Smith, Stephen A; Brown, Joseph W; Hinchliff, Cody E

    2013-01-01

    Phylogenetic trees are used to analyze and visualize evolution. However, trees can be imperfect datatypes when summarizing multiple trees. This is especially problematic when accommodating for biological phenomena such as horizontal gene transfer, incomplete lineage sorting, and hybridization, as well as topological conflict between datasets. Additionally, researchers may want to combine information from sets of trees that have partially overlapping taxon sets. To address the problem of analyzing sets of trees with conflicting relationships and partially overlapping taxon sets, we introduce methods for aligning, synthesizing and analyzing rooted phylogenetic trees within a graph, called a tree alignment graph (TAG). The TAG can be queried and analyzed to explore uncertainty and conflict. It can also be synthesized to construct trees, presenting an alternative to supertrees approaches. We demonstrate these methods with two empirical datasets. In order to explore uncertainty, we constructed a TAG of the bootstrap trees from the Angiosperm Tree of Life project. Analysis of the resulting graph demonstrates that areas of the dataset that are unresolved in majority-rule consensus tree analyses can be understood in more detail within the context of a graph structure, using measures incorporating node degree and adjacency support. As an exercise in synthesis (i.e., summarization of a TAG constructed from the alignment trees), we also construct a TAG consisting of the taxonomy and source trees from a recent comprehensive bird study. We synthesized this graph into a tree that can be reconstructed in a repeatable fashion and where the underlying source information can be updated. The methods presented here are tractable for large scale analyses and serve as a basis for an alternative to consensus tree and supertree methods. Furthermore, the exploration of these graphs can expose structures and patterns within the dataset that are otherwise difficult to observe.

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

  2. OpinionFlow: Visual Analysis of Opinion Diffusion on Social Media.

    Science.gov (United States)

    Wu, Yingcai; Liu, Shixia; Yan, Kai; Liu, Mengchen; Wu, Fangzhao

    2014-12-01

    It is important for many different applications such as government and business intelligence to analyze and explore the diffusion of public opinions on social media. However, the rapid propagation and great diversity of public opinions on social media pose great challenges to effective analysis of opinion diffusion. In this paper, we introduce a visual analysis system called OpinionFlow to empower analysts to detect opinion propagation patterns and glean insights. Inspired by the information diffusion model and the theory of selective exposure, we develop an opinion diffusion model to approximate opinion propagation among Twitter users. Accordingly, we design an opinion flow visualization that combines a Sankey graph with a tailored density map in one view to visually convey diffusion of opinions among many users. A stacked tree is used to allow analysts to select topics of interest at different levels. The stacked tree is synchronized with the opinion flow visualization to help users examine and compare diffusion patterns across topics. Experiments and case studies on Twitter data demonstrate the effectiveness and usability of OpinionFlow.

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

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

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

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

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

  8. Significance evaluation in factor graphs

    DEFF Research Database (Denmark)

    Madsen, Tobias; Hobolth, Asger; Jensen, Jens Ledet

    2017-01-01

    in genomics and the multiple-testing issues accompanying them, accurate significance evaluation is of great importance. We here address the problem of evaluating statistical significance of observations from factor graph models. Results Two novel numerical approximations for evaluation of statistical...... significance are presented. First a method using importance sampling. Second a saddlepoint approximation based method. We develop algorithms to efficiently compute the approximations and compare them to naive sampling and the normal approximation. The individual merits of the methods are analysed both from....... Conclusions The applicability of saddlepoint approximation and importance sampling is demonstrated on known models in the factor graph framework. Using the two methods we can substantially improve computational cost without compromising accuracy. This contribution allows analyses of large datasets...

  9. Groups, graphs and random walks

    CERN Document Server

    Salvatori, Maura; Sava-Huss, Ecaterina

    2017-01-01

    An accessible and panoramic account of the theory of random walks on groups and graphs, stressing the strong connections of the theory with other branches of mathematics, including geometric and combinatorial group theory, potential analysis, and theoretical computer science. This volume brings together original surveys and research-expository papers from renowned and leading experts, many of whom spoke at the workshop 'Groups, Graphs and Random Walks' celebrating the sixtieth birthday of Wolfgang Woess in Cortona, Italy. Topics include: growth and amenability of groups; Schrödinger operators and symbolic dynamics; ergodic theorems; Thompson's group F; Poisson boundaries; probability theory on buildings and groups of Lie type; structure trees for edge cuts in networks; and mathematical crystallography. In what is currently a fast-growing area of mathematics, this book provides an up-to-date and valuable reference for both researchers and graduate students, from which future research activities will undoubted...

  10. Flux networks in metabolic graphs

    International Nuclear Information System (INIS)

    Warren, P B; Queiros, S M Duarte; Jones, J L

    2009-01-01

    A metabolic model can be represented as a bipartite graph comprising linked reaction and metabolite nodes. Here it is shown how a network of conserved fluxes can be assigned to the edges of such a graph by combining the reaction fluxes with a conserved metabolite property such as molecular weight. A similar flux network can be constructed by combining the primal and dual solutions to the linear programming problem that typically arises in constraint-based modelling. Such constructions may help with the visualization of flux distributions in complex metabolic networks. The analysis also explains the strong correlation observed between metabolite shadow prices (the dual linear programming variables) and conserved metabolite properties. The methods were applied to recent metabolic models for Escherichia coli, Saccharomyces cerevisiae and Methanosarcina barkeri. Detailed results are reported for E. coli; similar results were found for other organisms

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

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

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

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

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

  16. Parallel External Memory Graph Algorithms

    DEFF Research Database (Denmark)

    Arge, Lars Allan; Goodrich, Michael T.; Sitchinava, Nodari

    2010-01-01

    In this paper, we study parallel I/O efficient graph algorithms in the Parallel External Memory (PEM) model, one o f the private-cache chip multiprocessor (CMP) models. We study the fundamental problem of list ranking which leads to efficient solutions to problems on trees, such as computing lowest...... an optimal speedup of ¿(P) in parallel I/O complexity and parallel computation time, compared to the single-processor external memory counterparts....

  17. Submanifolds weakly associated with graphs

    Indian Academy of Sciences (India)

    A CARRIAZO, L M FERN ´ANDEZ and A RODRÍGUEZ-HIDALGO. Department of Geometry and Topology, ..... by means of trees (connected graphs without cycles) and forests (disjoint unions of trees, see [6]) given in [3], by extending it to weak ... CR-submanifold. In this case, every tree is a K2. Finally, Theorem 3.8 of [3] can ...

  18. Feature selection and multi-kernel learning for adaptive graph regularized nonnegative matrix factorization

    KAUST Repository

    Wang, Jim Jing-Yan

    2014-09-20

    Nonnegative matrix factorization (NMF), a popular part-based representation technique, does not capture the intrinsic local geometric structure of the data space. Graph regularized NMF (GNMF) was recently proposed to avoid this limitation by regularizing NMF with a nearest neighbor graph constructed from the input data set. However, GNMF has two main bottlenecks. First, using the original feature space directly to construct the graph is not necessarily optimal because of the noisy and irrelevant features and nonlinear distributions of data samples. Second, one possible way to handle the nonlinear distribution of data samples is by kernel embedding. However, it is often difficult to choose the most suitable kernel. To solve these bottlenecks, we propose two novel graph-regularized NMF methods, AGNMFFS and AGNMFMK, by introducing feature selection and multiple-kernel learning to the graph regularized NMF, respectively. Instead of using a fixed graph as in GNMF, the two proposed methods learn the nearest neighbor graph that is adaptive to the selected features and learned multiple kernels, respectively. For each method, we propose a unified objective function to conduct feature selection/multi-kernel learning, NMF and adaptive graph regularization simultaneously. We further develop two iterative algorithms to solve the two optimization problems. Experimental results on two challenging pattern classification tasks demonstrate that the proposed methods significantly outperform state-of-the-art data representation methods.

  19. Identifying Threats Using Graph-based Anomaly Detection

    Science.gov (United States)

    Eberle, William; Holder, Lawrence; Cook, Diane

    Much of the data collected during the monitoring of cyber and other infrastructures is structural in nature, consisting of various types of entities and relationships between them. The detection of threatening anomalies in such data is crucial to protecting these infrastructures. We present an approach to detecting anomalies in a graph-based representation of such data that explicitly represents these entities and relationships. The approach consists of first finding normative patterns in the data using graph-based data mining and then searching for small, unexpected deviations to these normative patterns, assuming illicit behavior tries to mimic legitimate, normative behavior. The approach is evaluated using several synthetic and real-world datasets. Results show that the approach has high truepositive rates, low false-positive rates, and is capable of detecting complex structural anomalies in real-world domains including email communications, cellphone calls and network traffic.

  20. Topological structure of dictionary graphs

    International Nuclear Information System (INIS)

    Fuks, Henryk; Krzeminski, Mark

    2009-01-01

    We investigate the topological structure of the subgraphs of dictionary graphs constructed from WordNet and Moby thesaurus data. In the process of learning a foreign language, the learner knows only a subset of all words of the language, corresponding to a subgraph of a dictionary graph. When this subgraph grows with time, its topological properties change. We introduce the notion of the pseudocore and argue that the growth of the vocabulary roughly follows decreasing pseudocore numbers-that is, one first learns words with a high pseudocore number followed by smaller pseudocores. We also propose an alternative strategy for vocabulary growth, involving decreasing core numbers as opposed to pseudocore numbers. We find that as the core or pseudocore grows in size, the clustering coefficient first decreases, then reaches a minimum and starts increasing again. The minimum occurs when the vocabulary reaches a size between 10 3 and 10 4 . A simple model exhibiting similar behavior is proposed. The model is based on a generalized geometric random graph. Possible implications for language learning are discussed.

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

  2. Anatomical explanations for acute depressions in radial pattern of axial sap flow in two diffuse-porous mangrove species: implications for water use.

    Science.gov (United States)

    Zhao, Hewei; Yang, Shengchang; Guo, Xudong; Peng, Congjiao; Gu, Xiaoxuan; Deng, Chuanyuan; Chen, Luzhen

    2018-02-01

    Mangrove species have developed uniquely efficient water-use strategies in order to survive in highly saline and anaerobic environments. Herein, we estimated the stand water use of two diffuse-porous mangrove species of the same age, Sonneratia apetala Buch. Ham and Sonneratia caseolaris (L.) Engl., growing in a similar intertidal environment. Specifically, to investigate the radial patterns of axial sap flow density (Js) and understand the anatomical traits associated with them, we measured axial sap flow density in situ together with micromorphological observations. A significant decrease of Js was observed for both species. This result was accompanied by the corresponding observations of wood structure and blockages in xylem sapwood, which appeared to influence and, hence, explained the acute radial reductions of axial sap flow in the stems of both species. However, higher radial resistance in sapwood of S. caseolaris caused a steeper decline of Js radially when compared with S. apetala, thus explaining the latter's more efficient use of water. Without first considering acute reductions in Js into the sapwood from the outer bark, a total of ~55% and 51% of water use would have been overestimated, corresponding to average discrepancies in stand water use of 5.6 mm day-1 for S. apetala trees and 2.5 mm day-1 for S. caseolaris trees. This suggests that measuring radial pattern of Js is a critical factor in determining whole-tree or stand water use. © The Author(s) 2018. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oup.com.

  3. Promoter methylation patterns in Richter syndrome affect stem-cell maintenance and cell cycle regulation and differ from de novo diffuse large B-cell lymphoma.

    Science.gov (United States)

    Rinaldi, Andrea; Mensah, Afua Adjeiwaa; Kwee, Ivo; Forconi, Francesco; Orlandi, Ester M; Lucioni, Marco; Gattei, Valter; Marasca, Roberto; Berger, Françoise; Cogliatti, Sergio; Cavalli, Franco; Zucca, Emanuele; Gaidano, Gianluca; Rossi, Davide; Bertoni, Francesco

    2013-10-01

    In a fraction of patients, chronic lymphocytic leukaemia (CLL) can transform to Richter syndrome (RS), usually a diffuse large B-cell lymphoma (DLBCL). We studied genome-wide promoter DNA methylation in RS and clonally related CLL-phases of transformed patients, alongside de novo DLBCL (of non-germinal centre B type), untransformed-CLL and normal B-cells. The greatest differences in global DNA methylation levels were observed between RS and DLBCL, indicating that these two diseases, although histologically similar, are epigenetically distinct. RS was more highly methylated for genes involved in cell cycle regulation. When RS was compared to the preceding CLL-phase and with untransformed-CLL, RS presented a higher degree of methylation for genes possessing the H3K27me3 mark and PRC2 targets, as well as for gene targets of TP53 and RB1. Comparison of the methylation levels of individual genes revealed that OSM, a stem cell regulatory gene, exhibited significantly higher methylation levels in RS compared to CLL-phases. Its transcriptional repression by DNA methylation was confirmed by 5-aza-2'deoxycytidine treatment of DLBCL cells, determining an increased OSM expression. Our results showed that methylation patterns in RS are largely different from de novo DLBCL. Stem cell-related genes and cell cycle regulation genes are targets of DNA methylation in RS. © 2013 John Wiley & Sons Ltd.

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

  5. Encoding and analyzing aerial imagery using geospatial semantic graphs

    Energy Technology Data Exchange (ETDEWEB)

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

    2014-02-01

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

  6. Multiple Kernel Learning for adaptive graph regularized nonnegative matrix factorization

    KAUST Repository

    Wang, Jim Jing-Yan; AbdulJabbar, Mustafa Abdulmajeed

    2012-01-01

    Nonnegative Matrix Factorization (NMF) has been continuously evolving in several areas like pattern recognition and information retrieval methods. It factorizes a matrix into a product of 2 low-rank non-negative matrices that will define parts-based, and linear representation of non-negative data. Recently, Graph regularized NMF (GrNMF) is proposed to find a compact representation, which uncovers the hidden semantics and simultaneously respects the intrinsic geometric structure. In GNMF, an affinity graph is constructed from the original data space to encode the geometrical information. In this paper, we propose a novel idea which engages a Multiple Kernel Learning approach into refining the graph structure that reflects the factorization of the matrix and the new data space. The GrNMF is improved by utilizing the graph refined by the kernel learning, and then a novel kernel learning method is introduced under the GrNMF framework. Our approach shows encouraging results of the proposed algorithm in comparison to the state-of-the-art clustering algorithms like NMF, GrNMF, SVD etc.

  7. Mean Curvature, Threshold Dynamics, and Phase Field Theory on Finite Graphs

    Science.gov (United States)

    2013-06-28

    3380. [DEL12a] Xavier Desquesnes, Abderrahim Elmoataz, and Olivier Lézoray, Eikonal equation adapta- tion on weighted graphs: Fast geometric diffusion...Abderrahim Elmoataz, Olivier Lézoray, and Vinh-Thong Ta, Efficient algorithms for image and high dimensional data processing using eikonal equation on

  8. Spatial And Temporal Patterns As Well As Major Influencing Factors Of Global And Diffuse Horizontal Irradiance Over China: 1960-2014

    Science.gov (United States)

    Wang, H.; Sun, F.

    2017-12-01

    Global Horizontal Irradiance (GHI) on Earth is a central element of climate systems. With changes in the climate and regional development, the patterns and influencing factors of GHI, in addition to presenting global consistency, are increasingly showing regional particularities. Based on data for GHI, Diffuse Horizontal Irradiance (DHI) and potential impact factors (geographical position, elevation, cloud cover, water vapor, and ground atmospheric transparency related variables) from 1960 to 2014 in China, we analyzed the pattern and major influencing factors of GHI and DHI. The results showed that the major influencing factors of the GHI spatial pattern were the total cloud cover (TCC) and relative humidity (RH) in China. Dividing all of China into two regions, the major factors were the water vapor pressure (WVP) in the northern region and TCC in the southern region. And we divided the GHI and DHI data into two periods (1960-1987 and 1988-2014) due to global dimming and brightening observed in China in the late 1980's. The temporal GHI showed that 31 of 58 decreased significantly with an average decreasing rate of 95 MJ.10yr-1 during the periods of 1960-2014 and 49 of 76 stations decreased significantly with an rate of 342 MJ.10yr-1 during 1960-1987, whereas 57 of 88 stations did not change and 24 stations increased significantly with an rate of 201 MJ.10yr-1 during the period of 1988-2014. The temporal DHI showed that 40 of 61sites did not change significantly from 1960 to 1987. The major influencing factors for temporal changes of GHI in nine typical cities from 1960 to 2013 were as follows: air quality-related variables in super cities, sandstorms and wind in desert oasis cities, clouds in cities with good air quality and a low cloud amount (LCA) and annual fog days (FD) in Chengdu. Overall, we identified characteristics of GHI and DHI based on global climate change and regional urban development and found that the spatial characteristics of GHI results for

  9. Modelling of Innovation Diffusion

    Directory of Open Access Journals (Sweden)

    Arkadiusz Kijek

    2010-01-01

    Full Text Available Since the publication of the Bass model in 1969, research on the modelling of the diffusion of innovation resulted in a vast body of scientific literature consisting of articles, books, and studies of real-world applications of this model. The main objective of the diffusion model is to describe a pattern of spread of innovation among potential adopters in terms of a mathematical function of time. This paper assesses the state-of-the-art in mathematical models of innovation diffusion and procedures for estimating their parameters. Moreover, theoretical issues related to the models presented are supplemented with empirical research. The purpose of the research is to explore the extent to which the diffusion of broadband Internet users in 29 OECD countries can be adequately described by three diffusion models, i.e. the Bass model, logistic model and dynamic model. The results of this research are ambiguous and do not indicate which model best describes the diffusion pattern of broadband Internet users but in terms of the results presented, in most cases the dynamic model is inappropriate for describing the diffusion pattern. Issues related to the further development of innovation diffusion models are discussed and some recommendations are given. (original abstract

  10. Replica methods for loopy sparse random graphs

    International Nuclear Information System (INIS)

    Coolen, ACC

    2016-01-01

    I report on the development of a novel statistical mechanical formalism for the analysis of random graphs with many short loops, and processes on such graphs. The graphs are defined via maximum entropy ensembles, in which both the degrees (via hard constraints) and the adjacency matrix spectrum (via a soft constraint) are prescribed. The sum over graphs can be done analytically, using a replica formalism with complex replica dimensions. All known results for tree-like graphs are recovered in a suitable limit. For loopy graphs, the emerging theory has an appealing and intuitive structure, suggests how message passing algorithms should be adapted, and what is the structure of theories describing spin systems on loopy architectures. However, the formalism is still largely untested, and may require further adjustment and refinement. (paper)

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

  12. Reconstructing Topological Graphs and Continua

    OpenAIRE

    Gartside, Paul; Pitz, Max F.; Suabedissen, Rolf

    2015-01-01

    The deck of a topological space $X$ is the set $\\mathcal{D}(X)=\\{[X \\setminus \\{x\\}] \\colon x \\in X\\}$, where $[Z]$ denotes the homeomorphism class of $Z$. A space $X$ is topologically reconstructible if whenever $\\mathcal{D}(X)=\\mathcal{D}(Y)$ then $X$ is homeomorphic to $Y$. It is shown that all metrizable compact connected spaces are reconstructible. It follows that all finite graphs, when viewed as a 1-dimensional cell-complex, are reconstructible in the topological sense, and more genera...

  13. Decomposing a graph into bistars

    DEFF Research Database (Denmark)

    Thomassen, Carsten

    2013-01-01

    Bárat and the present author conjectured that, for each tree T, there exists a natural number kT such that the following holds: If G is a kT-edge-connected graph such that |E(T)| divides |E(G)|, then G has a T-decomposition, that is, a decomposition of the edge set into trees each of which...... is isomorphic to T. The conjecture has been verified for infinitely many paths and for each star. In this paper we verify the conjecture for an infinite family of trees that are neither paths nor stars, namely all the bistars S(k,k+1)....

  14. On path hypercompositions in graphs and automata

    Directory of Open Access Journals (Sweden)

    Massouros Christos G.

    2016-01-01

    Full Text Available The paths in graphs define hypercompositions in the set of their vertices and therefore it is feasible to associate hypercompositional structures to each graph. Similarly, the strings of letters from their alphabet, define hypercompositions in the automata, which in turn define the associated hypergroups to the automata. The study of the associated hypercompositional structures gives results in both, graphs and automata theory.

  15. Attack Graph Construction for Security Events Analysis

    Directory of Open Access Journals (Sweden)

    Andrey Alexeevich Chechulin

    2014-09-01

    Full Text Available The paper is devoted to investigation of the attack graphs construction and analysis task for a network security evaluation and real-time security event processing. Main object of this research is the attack modeling process. The paper contains the description of attack graphs building, modifying and analysis technique as well as overview of implemented prototype for network security analysis based on attack graph approach.

  16. Steiner Distance in Graphs--A Survey

    OpenAIRE

    Mao, Yaping

    2017-01-01

    For a connected graph $G$ of order at least $2$ and $S\\subseteq V(G)$, the \\emph{Steiner distance} $d_G(S)$ among the vertices of $S$ is the minimum size among all connected subgraphs whose vertex sets contain $S$. In this paper, we summarize the known results on the Steiner distance parameters, including Steiner distance, Steiner diameter, Steiner center, Steiner median, Steiner interval, Steiner distance hereditary graph, Steiner distance stable graph, average Steiner distance, and Steiner ...

  17. Density conditions for triangles in multipartite graphs

    DEFF Research Database (Denmark)

    Bondy, Adrian; Shen, Jin; Thomassé, Stephan

    2006-01-01

    subgraphs in G. We investigate in particular the case where G is a complete multipartite graph. We prove that a finite tripartite graph with all edge densities greater than the golden ratio has a triangle and that this bound is best possible. Also we show that an infinite-partite graph with finite parts has...... a triangle, provided that the edge density between any two parts is greater than 1/2....

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

  19. EmptyHeaded: A Relational Engine for Graph Processing.

    Science.gov (United States)

    Aberger, Christopher R; Tu, Susan; Olukotun, Kunle; Ré, Christopher

    2016-01-01

    There are two types of high-performance graph processing engines: low- and high-level engines. Low-level engines (Galois, PowerGraph, Snap) provide optimized data structures and computation models but require users to write low-level imperative code, hence ensuring that efficiency is the burden of the user. In high-level engines, users write in query languages like datalog (SociaLite) or SQL (Grail). High-level engines are easier to use but are orders of magnitude slower than the low-level graph engines. We present EmptyHeaded, a high-level engine that supports a rich datalog-like query language and achieves performance comparable to that of low-level engines. At the core of EmptyHeaded's design is a new class of join algorithms that satisfy strong theoretical guarantees but have thus far not achieved performance comparable to that of specialized graph processing engines. To achieve high performance, EmptyHeaded introduces a new join engine architecture, including a novel query optimizer and data layouts that leverage single-instruction multiple data (SIMD) parallelism. With this architecture, EmptyHeaded outperforms high-level approaches by up to three orders of magnitude on graph pattern queries, PageRank, and Single-Source Shortest Paths (SSSP) and is an order of magnitude faster than many low-level baselines. We validate that EmptyHeaded competes with the best-of-breed low-level engine (Galois), achieving comparable performance on PageRank and at most 3× worse performance on SSSP.

  20. An Expert System toward Buiding An Earth Science Knowledge Graph

    Science.gov (United States)

    Zhang, J.; Duan, X.; Ramachandran, R.; Lee, T. J.; Bao, Q.; Gatlin, P. N.; Maskey, M.

    2017-12-01

    In this ongoing work, we aim to build foundations of Cognitive Computing for Earth Science research. The goal of our project is to develop an end-to-end automated methodology for incrementally constructing Knowledge Graphs for Earth Science (KG4ES). These knowledge graphs can then serve as the foundational components for building cognitive systems in Earth science, enabling researchers to uncover new patterns and hypotheses that are virtually impossible to identify today. In addition, this research focuses on developing mining algorithms needed to exploit these constructed knowledge graphs. As such, these graphs will free knowledge from publications that are generated in a very linear, deterministic manner, and structure knowledge in a way that users can both interact and connect with relevant pieces of information. Our major contributions are two-fold. First, we have developed an end-to-end methodology for constructing Knowledge Graphs for Earth Science (KG4ES) using existing corpus of journal papers and reports. One of the key challenges in any machine learning, especially deep learning applications, is the need for robust and large training datasets. We have developed techniques capable of automatically retraining models and incrementally building and updating KG4ES, based on ever evolving training data. We also adopt the evaluation instrument based on common research methodologies used in Earth science research, especially in Atmospheric Science. Second, we have developed an algorithm to infer new knowledge that can exploit the constructed KG4ES. In more detail, we have developed a network prediction algorithm aiming to explore and predict possible new connections in the KG4ES and aid in new knowledge discovery.

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

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

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

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

  5. An algebraic approach to graph codes

    DEFF Research Database (Denmark)

    Pinero, Fernando

    This thesis consists of six chapters. The first chapter, contains a short introduction to coding theory in which we explain the coding theory concepts we use. In the second chapter, we present the required theory for evaluation codes and also give an example of some fundamental codes in coding...... theory as evaluation codes. Chapter three consists of the introduction to graph based codes, such as Tanner codes and graph codes. In Chapter four, we compute the dimension of some graph based codes with a result combining graph based codes and subfield subcodes. Moreover, some codes in chapter four...

  6. The color space of a graph

    DEFF Research Database (Denmark)

    Jensen, T.R.; Thomassen, Carsten

    2000-01-01

    If k is a prime power, and G is a graph with n vertices, then a k-coloring of G may be considered as a vector in GF(k)(n). We prove that the subspace of GF(3)(n) spanned by all 3-colorings of a planar triangle-free graph with n vertices has dimension n. In particular, any such graph has at least n...... - 1 nonequivalent 3-colorings, and the addition of any edge or any vertex of degree 3 results in a 3-colorable graph. (C) 2000 John Wiley & Sons, Inc....

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

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

  9. Reconstructing Nearly Simple Polytopes from their Graph

    OpenAIRE

    Doolittle, Joseph

    2017-01-01

    We present a partial description of which polytopes are reconstructible from their graphs. This is an extension of work by Blind and Mani (1987) and Kalai (1988), which showed that simple polytopes can be reconstructed from their graphs. In particular, we introduce a notion of $h$-nearly simple and prove that 1-nearly simple and 2-nearly simple polytopes are reconstructible from their graphs. We also give an example of a 3-nearly simple polytope which is not reconstructible from its graph. Fu...

  10. A Reduction of the Graph Reconstruction Conjecture

    Directory of Open Access Journals (Sweden)

    Monikandan S.

    2014-08-01

    Full Text Available A graph is said to be reconstructible if it is determined up to isomor- phism from the collection of all its one-vertex deleted unlabeled subgraphs. Reconstruction Conjecture (RC asserts that all graphs on at least three vertices are reconstructible. In this paper, we prove that interval-regular graphs and some new classes of graphs are reconstructible and show that RC is true if and only if all non-geodetic and non-interval-regular blocks G with diam(G = 2 or diam(Ḡ = diam(G = 3 are reconstructible

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

  12. Equitable Colorings Of Corona Multiproducts Of Graphs

    Directory of Open Access Journals (Sweden)

    Furmánczyk Hanna

    2017-11-01

    Full Text Available A graph is equitably k-colorable if its vertices can be partitioned into k independent sets in such a way that the numbers of vertices in any two sets differ by at most one. The smallest k for which such a coloring exists is known as the equitable chromatic number of G and denoted by =(G. It is known that the problem of computation of =(G is NP-hard in general and remains so for corona graphs. In this paper we consider the same model of coloring in the case of corona multiproducts of graphs. In particular, we obtain some results regarding the equitable chromatic number for the l-corona product G ◦l H, where G is an equitably 3- or 4-colorable graph and H is an r-partite graph, a cycle or a complete graph. Our proofs are mostly constructive in that they lead to polynomial algorithms for equitable coloring of such graph products provided that there is given an equitable coloring of G. Moreover, we confirm the Equitable Coloring Conjecture for corona products of such graphs. This paper extends the results from [H. Furmánczyk, K. Kaliraj, M. Kubale and V.J. Vivin, Equitable coloring of corona products of graphs, Adv. Appl. Discrete Math. 11 (2013 103–120].

  13. VT Digital Line Graph Miscellaneous Transmission Lines

    Data.gov (United States)

    Vermont Center for Geographic Information — (Link to Metadata) This datalayer is comprised of Miscellaineous Transmission Lines. Digital line graph (DLG) data are digital representations of cartographic...

  14. Studies of the phase gradient at the boundary of the phase diffusion equation, motivated by peculiar wave patterns of rhythmic contraction in the amoeboid movement of Physarum polycephalum

    Science.gov (United States)

    Iima, Makoto; Kori, Hiroshi; Nakagaki, Toshiyuki

    2017-04-01

    The boundary of a cell is the interface with its surroundings and plays a key role in controlling the cell movement adaptations to different environments. We propose a study of the boundary effects on the patterns and waves of the rhythmic contractions in plasmodia of Physarum polycephalum, a tractable model organism of the amoeboid type. Boundary effects are defined as the effects of both the boundary conditions and the boundary shape. The rhythmicity of contraction can be modulated by local stimulation of temperature, light and chemicals, and by local deformation of cell shape via mechanosensitive ion channels as well. First, we examined the effects of boundary cell shapes in the case of a special shape resembling a tadpole, while requiring that the natural frequency in the proximity of the boundary is slightly higher and uniform. The simulation model reproduced the approximate propagated wave, from the tail to the head, while the inward waves were observed only near the periphery of the head section of the tadpole-shape. A key finding was that the frequency of the rhythmic contractions depended on the local shape of cell boundary. This implies that the boundary conditions of the phase were not always homogeneous. To understand the dependency, we reduced the two-dimensional model into a one-dimensional continuum model with Neumann boundary conditions. Here, the boundary conditions reflect the frequency distribution at the boundary. We described the analytic solutions and calculated the relationship between the boundary conditions and the wave propagation for a one-dimensional model of the continuous oscillatory field and a discrete coupled oscillator system. The results obtained may not be limited to cell movement of Physarum, but may be applicable to the other physical systems since the analysis used a generic phase diffusion equation.

  15. Studies of the phase gradient at the boundary of the phase diffusion equation, motivated by peculiar wave patterns of rhythmic contraction in the amoeboid movement of Physarum polycephalum

    International Nuclear Information System (INIS)

    Iima, Makoto; Kori, Hiroshi; Nakagaki, Toshiyuki

    2017-01-01

    The boundary of a cell is the interface with its surroundings and plays a key role in controlling the cell movement adaptations to different environments. We propose a study of the boundary effects on the patterns and waves of the rhythmic contractions in plasmodia of Physarum polycephalum , a tractable model organism of the amoeboid type. Boundary effects are defined as the effects of both the boundary conditions and the boundary shape. The rhythmicity of contraction can be modulated by local stimulation of temperature, light and chemicals, and by local deformation of cell shape via mechanosensitive ion channels as well. First, we examined the effects of boundary cell shapes in the case of a special shape resembling a tadpole, while requiring that the natural frequency in the proximity of the boundary is slightly higher and uniform. The simulation model reproduced the approximate propagated wave, from the tail to the head, while the inward waves were observed only near the periphery of the head section of the tadpole-shape. A key finding was that the frequency of the rhythmic contractions depended on the local shape of cell boundary. This implies that the boundary conditions of the phase were not always homogeneous. To understand the dependency, we reduced the two-dimensional model into a one-dimensional continuum model with Neumann boundary conditions. Here, the boundary conditions reflect the frequency distribution at the boundary. We described the analytic solutions and calculated the relationship between the boundary conditions and the wave propagation for a one-dimensional model of the continuous oscillatory field and a discrete coupled oscillator system. The results obtained may not be limited to cell movement of Physarum , but may be applicable to the other physical systems since the analysis used a generic phase diffusion equation. (paper)

  16. Patterns and Timing of Failure for Diffuse Large B-Cell Lymphoma After Initial Therapy in a Cohort Who Underwent Autologous Bone Marrow Transplantation for Relapse

    Energy Technology Data Exchange (ETDEWEB)

    Dhakal, Sughosh; Bates, James E. [Department of Radiation Oncology, Wilmot Cancer Institute, University of Rochester Medical Center, Rochester, New York (United States); Casulo, Carla; Friedberg, Jonathan W.; Becker, Michael W.; Liesveld, Jane L. [Department of Medicine, Wilmot Cancer Institute, University of Rochester Medical Center, Rochester, New York (United States); Constine, Louis S., E-mail: louis_constine@urmc.rochester.edu [Department of Radiation Oncology, Wilmot Cancer Institute, University of Rochester Medical Center, Rochester, New York (United States)

    2016-10-01

    Purpose: To evaluate the location and timing of initial recurrence in patients with diffuse large B-cell lymphoma (DLBCL) who subsequently underwent high-dose chemotherapy with autologous stem cell transplant (HDC/ASCT), to direct approaches for disease surveillance, elucidate the patterns of failure of contemporary treatment strategies, and guide adjuvant treatment decisions. Methods and Materials: We analyzed consecutive patients with DLBCL who underwent HDC/ASCT between May 1992 and March 2014 at our institution. Of the 187 evaluable patients, 8 had incomplete data, and 79 underwent HDC/ASCT as a component of initial treatment for de novo or refractory DLBCL and were excluded from further analysis. Results: The median age was 50.8 years; the median time to relapse was 1.3 years. Patients were segregated according to the initial stage at diagnosis, with early stage (ES) defined as stage I/II and advanced stage (AS) defined as stage III/IV. In total, 40.4% of the ES and 75.5% of the AS patients relapsed in sites of initial disease; 68.4% of those with ES disease and 75.0% of those with AS disease relapsed in sites of initial disease only. Extranodal relapses were common (44.7% in ES and 35.9% in AS) and occurred in a variety of organs, although gastrointestinal tract/liver (n=12) was most frequent. Conclusions: Most patients with DLBCL who relapse and subsequently undergo HDC/ASCT initially recur in the previously involved disease site(s). Time to recurrence is brief, suggesting that frequency of screening is most justifiably greatest in the early posttherapy years. © 2016 Elsevier Inc.

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

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

  19. Probability on graphs random processes on graphs and lattices

    CERN Document Server

    Grimmett, Geoffrey

    2018-01-01

    This introduction to some of the principal models in the theory of disordered systems leads the reader through the basics, to the very edge of contemporary research, with the minimum of technical fuss. Topics covered include random walk, percolation, self-avoiding walk, interacting particle systems, uniform spanning tree, random graphs, as well as the Ising, Potts, and random-cluster models for ferromagnetism, and the Lorentz model for motion in a random medium. This new edition features accounts of major recent progress, including the exact value of the connective constant of the hexagonal lattice, and the critical point of the random-cluster model on the square lattice. The choice of topics is strongly motivated by modern applications, and focuses on areas that merit further research. Accessible to a wide audience of mathematicians and physicists, this book can be used as a graduate course text. Each chapter ends with a range of exercises.

  20. Diffusion Tensor Tractography Reveals Disrupted Structural Connectivity during Brain Aging

    Science.gov (United States)

    Lin, Lan; Tian, Miao; Wang, Qi; Wu, Shuicai

    2017-10-01

    Brain aging is one of the most crucial biological processes that entail many physical, biological, chemical, and psychological changes, and also a major risk factor for most common neurodegenerative diseases. To improve the quality of life for the elderly, it is important to understand how the brain is changed during the normal aging process. We compared diffusion tensor imaging (DTI)-based brain networks in a cohort of 75 healthy old subjects by using graph theory metrics to describe the anatomical networks and connectivity patterns, and network-based statistic (NBS) analysis was used to identify pairs of regions with altered structural connectivity. The NBS analysis revealed a significant network comprising nine distinct fiber bundles linking 10 different brain regions showed altered white matter structures in young-old group compare with middle-aged group (p < .05, family-wise error-corrected). Our results might guide future studies and help to gain a better understanding of brain aging.

  1. POOR TEXTURAL IMAGE MATCHING BASED ON GRAPH THEORY

    Directory of Open Access Journals (Sweden)

    S. Chen

    2016-06-01

    Full Text Available Image matching lies at the heart of photogrammetry and computer vision. For poor textural images, the matching result is affected by low contrast, repetitive patterns, discontinuity or occlusion, few or homogeneous textures. Recently, graph matching became popular for its integration of geometric and radiometric information. Focused on poor textural image matching problem, it is proposed an edge-weight strategy to improve graph matching algorithm. A series of experiments have been conducted including 4 typical landscapes: Forest, desert, farmland, and urban areas. And it is experimentally found that our new algorithm achieves better performance. Compared to SIFT, doubled corresponding points were acquired, and the overall recall rate reached up to 68%, which verifies the feasibility and effectiveness of the algorithm.

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

  3. A support vector machine classifier reduces interscanner variation in the HRCT classification of regional disease pattern in diffuse lung disease: Comparison to a Bayesian classifier

    Energy Technology Data Exchange (ETDEWEB)

    Chang, Yongjun; Lim, Jonghyuck; Kim, Namkug; Seo, Joon Beom [Department of Radiology, University of Ulsan College of Medicine, 388-1 Pungnap2-dong, Songpa-gu, Seoul 138-736 (Korea, Republic of); Lynch, David A. [Department of Radiology, National Jewish Medical and Research Center, Denver, Colorado 80206 (United States)

    2013-05-15

    Purpose: To investigate the effect of using different computed tomography (CT) scanners on the accuracy of high-resolution CT (HRCT) images in classifying regional disease patterns in patients with diffuse lung disease, support vector machine (SVM) and Bayesian classifiers were applied to multicenter data. Methods: Two experienced radiologists marked sets of 600 rectangular 20 Multiplication-Sign 20 pixel regions of interest (ROIs) on HRCT images obtained from two scanners (GE and Siemens), including 100 ROIs for each of local patterns of lungs-normal lung and five of regional pulmonary disease patterns (ground-glass opacity, reticular opacity, honeycombing, emphysema, and consolidation). Each ROI was assessed using 22 quantitative features belonging to one of the following descriptors: histogram, gradient, run-length, gray level co-occurrence matrix, low-attenuation area cluster, and top-hat transform. For automatic classification, a Bayesian classifier and a SVM classifier were compared under three different conditions. First, classification accuracies were estimated using data from each scanner. Next, data from the GE and Siemens scanners were used for training and testing, respectively, and vice versa. Finally, all ROI data were integrated regardless of the scanner type and were then trained and tested together. All experiments were performed based on forward feature selection and fivefold cross-validation with 20 repetitions. Results: For each scanner, better classification accuracies were achieved with the SVM classifier than the Bayesian classifier (92% and 82%, respectively, for the GE scanner; and 92% and 86%, respectively, for the Siemens scanner). The classification accuracies were 82%/72% for training with GE data and testing with Siemens data, and 79%/72% for the reverse. The use of training and test data obtained from the HRCT images of different scanners lowered the classification accuracy compared to the use of HRCT images from the same scanner. For

  4. A support vector machine classifier reduces interscanner variation in the HRCT classification of regional disease pattern in diffuse lung disease: Comparison to a Bayesian classifier

    International Nuclear Information System (INIS)

    Chang, Yongjun; Lim, Jonghyuck; Kim, Namkug; Seo, Joon Beom; Lynch, David A.

    2013-01-01

    Purpose: To investigate the effect of using different computed tomography (CT) scanners on the accuracy of high-resolution CT (HRCT) images in classifying regional disease patterns in patients with diffuse lung disease, support vector machine (SVM) and Bayesian classifiers were applied to multicenter data. Methods: Two experienced radiologists marked sets of 600 rectangular 20 × 20 pixel regions of interest (ROIs) on HRCT images obtained from two scanners (GE and Siemens), including 100 ROIs for each of local patterns of lungs—normal lung and five of regional pulmonary disease patterns (ground-glass opacity, reticular opacity, honeycombing, emphysema, and consolidation). Each ROI was assessed using 22 quantitative features belonging to one of the following descriptors: histogram, gradient, run-length, gray level co-occurrence matrix, low-attenuation area cluster, and top-hat transform. For automatic classification, a Bayesian classifier and a SVM classifier were compared under three different conditions. First, classification accuracies were estimated using data from each scanner. Next, data from the GE and Siemens scanners were used for training and testing, respectively, and vice versa. Finally, all ROI data were integrated regardless of the scanner type and were then trained and tested together. All experiments were performed based on forward feature selection and fivefold cross-validation with 20 repetitions. Results: For each scanner, better classification accuracies were achieved with the SVM classifier than the Bayesian classifier (92% and 82%, respectively, for the GE scanner; and 92% and 86%, respectively, for the Siemens scanner). The classification accuracies were 82%/72% for training with GE data and testing with Siemens data, and 79%/72% for the reverse. The use of training and test data obtained from the HRCT images of different scanners lowered the classification accuracy compared to the use of HRCT images from the same scanner. For integrated ROI

  5. Isospectral graphs with identical nodal counts

    International Nuclear Information System (INIS)

    Oren, Idan; Band, Ram

    2012-01-01

    According to a recent conjecture, isospectral objects have different nodal count sequences (Gnutzmann et al 2005 J. Phys. A: Math. Gen. 38 8921–33). We study generalized Laplacians on discrete graphs, and use them to construct the first non-trivial counterexamples to this conjecture. In addition, these examples demonstrate a surprising connection between isospectral discrete and quantum graphs. (paper)

  6. Compression-based inference on graph data

    NARCIS (Netherlands)

    Bloem, P.; van den Bosch, A.; Heskes, T.; van Leeuwen, D.

    2013-01-01

    We investigate the use of compression-based learning on graph data. General purpose compressors operate on bitstrings or other sequential representations. A single graph can be represented sequentially in many ways, which may in uence the performance of sequential compressors. Using Normalized

  7. On minimum degree conditions for supereulerian graphs

    NARCIS (Netherlands)

    Broersma, Haitze J.; Xiong, L.

    1999-01-01

    A graph is called supereulerian if it has a spanning closed trail. Let $G$ be a 2-edge-connected graph of order $n$ such that each minimal edge cut $E \\subseteq E (G)$ with $|E| \\le 3$ satisfies the property that each component of $G-E$ has order at least $(n-2)/5$. We prove that either $G$ is

  8. On the exterior structure of graphs

    International Nuclear Information System (INIS)

    Kastler, Daniel

    2004-01-01

    After a detailed ab initio description of the exterior structure of graphs as handled by Connes and Kreimer in their work on renormalization (illustrated by the example of the φ 3 model in six dimensions) we spell out in detail their study of the Lie algebra of infinitesimal characters and of the group of characters of the Hopf algebra of Feynman graphs

  9. The Minimum Distance of Graph Codes

    DEFF Research Database (Denmark)

    Høholdt, Tom; Justesen, Jørn

    2011-01-01

    We study codes constructed from graphs where the code symbols are associated with the edges and the symbols connected to a given vertex are restricted to be codewords in a component code. In particular we treat such codes from bipartite expander graphs coming from Euclidean planes and other...... geometries. We give results on the minimum distances of the codes....

  10. Domination versus disjunctive domination in graphs | Henning ...

    African Journals Online (AJOL)

    Domination versus disjunctive domination in graphs. Michael A Henning, Sinclair A Marcon. Abstract. A dominating set in a graph G is a set S of vertices of G such that every vertex not in S is adjacent to a vertex of S. The domination number of G is the minimum cardinality of a dominating set of G. For a positive integer b, ...

  11. Eigenvalues and expansion of bipartite graphs

    DEFF Research Database (Denmark)

    Høholdt, Tom; Janwa, Heeralal

    2012-01-01

    We prove lower bounds on the largest and second largest eigenvalue of the adjacency matrix of bipartite graphs and give necessary and sufficient conditions for equality. We give several examples of classes that are optimal with respect to the bouns. We prove that BIBD-graphs are characterized by ...

  12. Co-Roman domination in graphs

    Indian Academy of Sciences (India)

    1National Centre for Advanced Research in Discrete Mathematics ... 3Department of Computer Science, Ball State University, Muncie, IN, USA .... The corona of two disjoint graphs G1 and G2 is defined to be the graph G = G1 ◦ G2,.

  13. Supplantation of Mental Operations on Graphs

    Science.gov (United States)

    Vogel, Markus; Girwidz, Raimund; Engel, Joachim

    2007-01-01

    Research findings show the difficulties younger students have in working with graphs. Higher mental operations are necessary for a skilled interpretation of abstract representations. We suggest connecting a concrete representation of the modeled problem with the related graph. The idea is to illustrate essential mental operations externally. This…

  14. Some remarks on definability of process graphs

    NARCIS (Netherlands)

    Grabmayer, C.A.; Klop, J.W.; Luttik, B.; Baier, C.; Hermanns, H.

    2006-01-01

    We propose the notions of "density" and "connectivity" of infinite process graphs and investigate them in the context of the wellknown process algebras BPA and BPP. For a process graph G, the density function in a state s maps a natural number n to the number of states of G with distance less or

  15. On revealing graph cycles via boundary measurements

    International Nuclear Information System (INIS)

    Belishev, M I; Wada, N

    2009-01-01

    This paper deals with boundary value inverse problems on a metric graph, the structure of the graph being assumed unknown. The question under consideration is how to detect from the dynamical and/or spectral inverse data whether the graph contains cycles (is not a tree). For any graph Ω, the dynamical as well as spectral boundary inverse data determine the so-called wave diameter d w : H -1 (Ω) → R defined on functionals supported in the graph. The known fact is that if Ω is a tree then d w ≥ 0 holds and, in this case, the inverse data determine Ω up to isometry. A graph Ω is said to be coordinate if the functions {dist Ω (., γ)} γin∂Ω constitute a coordinate system on Ω. For such graphs, we propose a procedure, which reveals the presence/absence of cycles. The hypothesis is that Ω contains cycles if and only if d w takes negative values. We do not justify this hypothesis in the general case but reduce it to a certain special class of graphs (suns)

  16. Declarative Process Mining for DCR Graphs

    DEFF Research Database (Denmark)

    Debois, Søren; Hildebrandt, Thomas T.; Laursen, Paw Høvsgaard

    2017-01-01

    We investigate process mining for the declarative Dynamic Condition Response (DCR) graphs process modelling language. We contribute (a) a process mining algorithm for DCR graphs, (b) a proposal for a set of metrics quantifying output model quality, and (c) a preliminary example-based comparison...

  17. A Graph Library Extension of SVG

    DEFF Research Database (Denmark)

    Nørmark, Kurt

    2007-01-01

    be aggregated as a single node, and an entire graph can be embedded in a single node. In addition, a number of different graph animations are described. The starting point of the SVG extension is a library that provides an exact of mirror of SVG 1.1 in the functional programming language Scheme. Each element...

  18. Acyclicity in edge-colored graphs

    DEFF Research Database (Denmark)

    Gutin, Gregory; Jones, Mark; Sheng, Bin

    2017-01-01

    A walk W in edge-colored graphs is called properly colored (PC) if every pair of consecutive edges in W is of different color. We introduce and study five types of PC acyclicity in edge-colored graphs such that graphs of PC acyclicity of type i is a proper superset of graphs of acyclicity of type i......+1, i=1,2,3,4. The first three types are equivalent to the absence of PC cycles, PC closed trails, and PC closed walks, respectively. While graphs of types 1, 2 and 3 can be recognized in polynomial time, the problem of recognizing graphs of type 4 is, somewhat surprisingly, NP-hard even for 2-edge-colored...... graphs (i.e., when only two colors are used). The same problem with respect to type 5 is polynomial-time solvable for all edge-colored graphs. Using the five types, we investigate the border between intractability and tractability for the problems of finding the maximum number of internally vertex...

  19. From concatenated codes to graph codes

    DEFF Research Database (Denmark)

    Justesen, Jørn; Høholdt, Tom

    2004-01-01

    We consider codes based on simple bipartite expander graphs. These codes may be seen as the first step leading from product type concatenated codes to more complex graph codes. We emphasize constructions of specific codes of realistic lengths, and study the details of decoding by message passing...

  20. Graph coarsening and clustering on the GPU

    NARCIS (Netherlands)

    Fagginger Auer, B.O.; Bisseling, R.H.

    2013-01-01

    Agglomerative clustering is an effective greedy way to quickly generate graph clusterings of high modularity in a small amount of time. In an effort to use the power offered by multi-core CPU and GPU hardware to solve the clustering problem, we introduce a fine-grained sharedmemory parallel graph

  1. Pixels to Graphs by Associative Embedding

    KAUST Repository

    Newell, Alejandro; Deng, Jia

    2017-01-01

    network such that it takes in an input image and produces a full graph. This is done end-to-end in a single stage with the use of associative embeddings. The network learns to simultaneously identify all of the elements that make up a graph and piece them

  2. Isomorphisms and traversability of directed path graphs

    NARCIS (Netherlands)

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

    1998-01-01

    The concept of a line digraph is generalized to that of a directed path graph. The directed path graph $\\forw P_k(D)$ of a digraph $D$ is obtained by representing the directed paths on $k$ vertices of $D$ by vertices. Two vertices are joined by an arc whenever the corresponding directed paths in $D$

  3. Perfect secure domination in graphs

    Directory of Open Access Journals (Sweden)

    S.V. Divya Rashmi

    2017-07-01

    Full Text Available Let $G=(V,E$ be a graph. A subset $S$ of $V$ is a dominating set of $G$ if every vertex in $Vsetminus  S$ is adjacent to a vertex in $S.$ A dominating set $S$ is called a secure dominating set if for each $vin Vsetminus S$ there exists $uin S$ such that $v$ is adjacent to $u$ and $S_1=(Ssetminus{u}cup {v}$ is a dominating set. If further the vertex $uin S$ is unique, then $S$ is called a perfect secure dominating set. The minimum cardinality of a perfect secure dominating set of $G$ is called the perfect  secure domination number of $G$ and is denoted by $gamma_{ps}(G.$ In this paper we initiate a study of this parameter and present several basic results.

  4. Graph Mining Meets the Semantic Web

    Energy Technology Data Exchange (ETDEWEB)

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

    2015-01-01

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

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

  6. Three Syntactic Theories for Combinatory Graph Reduction

    DEFF Research Database (Denmark)

    Danvy, Olivier; Zerny, Ian

    2011-01-01

    in a third syntactic theory. The structure of the store-based abstract machine corresponding to this third syntactic theory oincides with that of Turner's original reduction machine. The three syntactic theories presented here The three syntactic heories presented here therefore have the following......We present a purely syntactic theory of graph reduction for the canonical combinators S, K, and I, where graph vertices are represented with evaluation contexts and let expressions. We express this syntactic theory as a reduction semantics, which we refocus into the first storeless abstract machine...... for combinatory graph reduction, which we refunctionalize into the first storeless natural semantics for combinatory graph reduction.We then factor out the introduction of let expressions to denote as many graph vertices as possible upfront instead of on demand, resulting in a second syntactic theory, this one...

  7. Three Syntactic Theories for Combinatory Graph Reduction

    DEFF Research Database (Denmark)

    Danvy, Olivier; Zerny, Ian

    2013-01-01

    , as a store-based reduction semantics of combinatory term graphs. We then refocus this store-based reduction semantics into a store-based abstract machine. The architecture of this store-based abstract machine coincides with that of Turner's original reduction machine. The three syntactic theories presented......We present a purely syntactic theory of graph reduction for the canonical combinators S, K, and I, where graph vertices are represented with evaluation contexts and let expressions. We express this rst syntactic theory as a storeless reduction semantics of combinatory terms. We then factor out...... the introduction of let expressions to denote as many graph vertices as possible upfront instead of on demand . The factored terms can be interpreted as term graphs in the sense of Barendregt et al. We express this second syntactic theory, which we prove equivalent to the rst, as a storeless reduction semantics...

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

  9. On The Roman Domination Stable Graphs

    Directory of Open Access Journals (Sweden)

    Hajian Majid

    2017-11-01

    Full Text Available A Roman dominating function (or just RDF on a graph G = (V,E is a function f : V → {0, 1, 2} satisfying the condition that every vertex u for which f(u = 0 is adjacent to at least one vertex v for which f(v = 2. The weight of an RDF f is the value f(V (G = Pu2V (G f(u. The Roman domination number of a graph G, denoted by R(G, is the minimum weight of a Roman dominating function on G. A graph G is Roman domination stable if the Roman domination number of G remains unchanged under removal of any vertex. In this paper we present upper bounds for the Roman domination number in the class of Roman domination stable graphs, improving bounds posed in [V. Samodivkin, Roman domination in graphs: the class RUV R, Discrete Math. Algorithms Appl. 8 (2016 1650049].

  10. Pristine transfinite graphs and permissive electrical networks

    CERN Document Server

    Zemanian, Armen H

    2001-01-01

    A transfinite graph or electrical network of the first rank is obtained conceptually by connecting conventionally infinite graphs and networks together at their infinite extremities. This process can be repeated to obtain a hierarchy of transfiniteness whose ranks increase through the countable ordinals. This idea, which is of recent origin, has enriched the theories of graphs and networks with radically new constructs and research problems. The book provides a more accessible introduction to the subject that, though sacrificing some generality, captures the essential ideas of transfiniteness for graphs and networks. Thus, for example, some results concerning discrete potentials and random walks on transfinite networks can now be presented more concisely. Conversely, the simplifications enable the development of many new results that were previously unavailable. Topics and features: *A simplified exposition provides an introduction to transfiniteness for graphs and networks.*Various results for conventional g...

  11. A model of language inflection graphs

    Science.gov (United States)

    Fukś, Henryk; Farzad, Babak; Cao, Yi

    2014-01-01

    Inflection graphs are highly complex networks representing relationships between inflectional forms of words in human languages. For so-called synthetic languages, such as Latin or Polish, they have particularly interesting structure due to the abundance of inflectional forms. We construct the simplest form of inflection graphs, namely a bipartite graph in which one group of vertices corresponds to dictionary headwords and the other group to inflected forms encountered in a given text. We, then, study projection of this graph on the set of headwords. The projection decomposes into a large number of connected components, to be called word groups. Distribution of sizes of word group exhibits some remarkable properties, resembling cluster distribution in a lattice percolation near the critical point. We propose a simple model which produces graphs of this type, reproducing the desired component distribution and other topological features.

  12. Disease management research using event graphs.

    Science.gov (United States)

    Allore, H G; Schruben, L W

    2000-08-01

    Event Graphs, conditional representations of stochastic relationships between discrete events, simulate disease dynamics. In this paper, we demonstrate how Event Graphs, at an appropriate abstraction level, also extend and organize scientific knowledge about diseases. They can identify promising treatment strategies and directions for further research and provide enough detail for testing combinations of new medicines and interventions. Event Graphs can be enriched to incorporate and validate data and test new theories to reflect an expanding dynamic scientific knowledge base and establish performance criteria for the economic viability of new treatments. To illustrate, an Event Graph is developed for mastitis, a costly dairy cattle disease, for which extensive scientific literature exists. With only a modest amount of imagination, the methodology presented here can be seen to apply modeling to any disease, human, plant, or animal. The Event Graph simulation presented here is currently being used in research and in a new veterinary epidemiology course. Copyright 2000 Academic Press.

  13. Pixels to Graphs by Associative Embedding

    KAUST Repository

    Newell, Alejandro

    2017-06-22

    Graphs are a useful abstraction of image content. Not only can graphs represent details about individual objects in a scene but they can capture the interactions between pairs of objects. We present a method for training a convolutional neural network such that it takes in an input image and produces a full graph. This is done end-to-end in a single stage with the use of associative embeddings. The network learns to simultaneously identify all of the elements that make up a graph and piece them together. We benchmark on the Visual Genome dataset, and report a Recall@50 of 9.7% compared to the prior state-of-the-art at 3.4%, a nearly threefold improvement on the challenging task of scene graph generation.

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

  15. Effectiveness of Partition and Graph Theoretic Clustering Algorithms for Multiple Source Partial Discharge Pattern Classification Using Probabilistic Neural Network and Its Adaptive Version: A Critique Based on Experimental Studies

    Directory of Open Access Journals (Sweden)

    S. Venkatesh

    2012-01-01

    Full Text Available Partial discharge (PD is a major cause of failure of power apparatus and hence its measurement and analysis have emerged as a vital field in assessing the condition of the insulation system. Several efforts have been undertaken by researchers to classify PD pulses utilizing artificial intelligence techniques. Recently, the focus has shifted to the identification of multiple sources of PD since it is often encountered in real-time measurements. Studies have indicated that classification of multi-source PD becomes difficult with the degree of overlap and that several techniques such as mixed Weibull functions, neural networks, and wavelet transformation have been attempted with limited success. Since digital PD acquisition systems record data for a substantial period, the database becomes large, posing considerable difficulties during classification. This research work aims firstly at analyzing aspects concerning classification capability during the discrimination of multisource PD patterns. Secondly, it attempts at extending the previous work of the authors in utilizing the novel approach of probabilistic neural network versions for classifying moderate sets of PD sources to that of large sets. The third focus is on comparing the ability of partition-based algorithms, namely, the labelled (learning vector quantization and unlabelled (K-means versions, with that of a novel hypergraph-based clustering method in providing parsimonious sets of centers during classification.

  16. Graph Theoretical Analysis Reveals: Women's Brains Are Better Connected than Men's.

    Directory of Open Access Journals (Sweden)

    Balázs Szalkai

    Full Text Available Deep graph-theoretic ideas in the context with the graph of the World Wide Web led to the definition of Google's PageRank and the subsequent rise of the most popular search engine to date. Brain graphs, or connectomes, are being widely explored today. We believe that non-trivial graph theoretic concepts, similarly as it happened in the case of the World Wide Web, will lead to discoveries enlightening the structural and also the functional details of the animal and human brains. When scientists examine large networks of tens or hundreds of millions of vertices, only fast algorithms can be applied because of the size constraints. In the case of diffusion MRI-based structural human brain imaging, the effective vertex number of the connectomes, or brain graphs derived from the data is on the scale of several hundred today. That size facilitates applying strict mathematical graph algorithms even for some hard-to-compute (or NP-hard quantities like vertex cover or balanced minimum cut. In the present work we have examined brain graphs, computed from the data of the Human Connectome Project, recorded from male and female subjects between ages 22 and 35. Significant differences were found between the male and female structural brain graphs: we show that the average female connectome has more edges, is a better expander graph, has larger minimal bisection width, and has more spanning trees than the average male connectome. Since the average female brain weighs less than the brain of males, these properties show that the female brain has better graph theoretical properties, in a sense, than the brain of males. It is known that the female brain has a smaller gray matter/white matter ratio than males, that is, a larger white matter/gray matter ratio than the brain of males; this observation is in line with our findings concerning the number of edges, since the white matter consists of myelinated axons, which, in turn, roughly correspond to the connections

  17. Graph-based Operational Semantics of a Lazy Functional Languages

    DEFF Research Database (Denmark)

    Rose, Kristoffer Høgsbro

    1992-01-01

    Presents Graph Operational Semantics (GOS): a semantic specification formalism based on structural operational semantics and term graph rewriting. Demonstrates the method by specifying the dynamic ...

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

  19. Multiplicative Attribute Graph Model of Real-World Networks

    Energy Technology Data Exchange (ETDEWEB)

    Kim, Myunghwan [Stanford Univ., CA (United States); Leskovec, Jure [Stanford Univ., CA (United States)

    2010-10-20

    Large scale real-world network data, such as social networks, Internet andWeb graphs, is ubiquitous in a variety of scientific domains. The study of such social and information networks commonly finds patterns and explain their emergence through tractable models. In most networks, especially in social networks, nodes also have a rich set of attributes (e.g., age, gender) associatedwith them. However, most of the existing network models focus only on modeling the network structure while ignoring the features of nodes in the network. Here we present a class of network models that we refer to as the Multiplicative Attribute Graphs (MAG), which naturally captures the interactions between the network structure and node attributes. We consider a model where each node has a vector of categorical features associated with it. The probability of an edge between a pair of nodes then depends on the product of individual attributeattribute similarities. The model yields itself to mathematical analysis as well as fit to real data. We derive thresholds for the connectivity, the emergence of the giant connected component, and show that the model gives rise to graphs with a constant diameter. Moreover, we analyze the degree distribution to show that the model can produce networks with either lognormal or power-law degree distribution depending on certain conditions.

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