Community detection in directed acyclic graphs
NASA Astrophysics Data System (ADS)
Speidel, Leo; Takaguchi, Taro; Masuda, Naoki
2015-08-01
Some temporal networks, most notably citation networks, are naturally represented as directed acyclic graphs (DAGs). To detect communities in DAGs, we propose a modularity for DAGs by defining an appropriate null model (i.e., randomized network) respecting the order of nodes. We implement a spectral method to approximately maximize the proposed modularity measure and test the method on citation networks and other DAGs. We find that the attained values of the modularity for DAGs are similar for partitions that we obtain by maximizing the proposed modularity (designed for DAGs), the modularity for undirected networks and that for general directed networks. In other words, if we neglect the order imposed on nodes (and the direction of links) in a given DAG and maximize the conventional modularity measure, the obtained partition is close to the optimal one in the sense of the modularity for DAGs. Contribution to the Topical Issue "Temporal Network Theory and Applications", edited by Petter Holme.
[Application of directed acyclic graphs in control of confounding].
Xiang, R; Dai, W J; Xiong, Y; Wu, X; Yang, Y F; Wang, L; Dai, Z H; Li, J; Liu, A Z
2016-07-01
Observational study is a method most commonly used in the etiology study of epidemiology, but confounders, always distort the true causality between exposure and outcome when local inferencing. In order to eliminate these confounding, the determining of variables which need to be adjusted become a key issue. Directed acyclic graph(DAG)could visualize complex causality, provide a simple and intuitive way to identify the confounding, and convert it into the finding of the minimal sufficient adjustment for the control of confounding. On the one hand, directed acyclic graph can choose less variables, which increase statistical efficiency of the analysis. On the other hand, it could help avoiding variables that is not measured or with missing values. In a word, the directed acyclic graph could facilitate the reveal of the real causality effectively.
Graphical presentation of confounding in directed acyclic graphs.
Suttorp, Marit M; Siegerink, Bob; Jager, Kitty J; Zoccali, Carmine; Dekker, Friedo W
2015-09-01
Since confounding obscures the real effect of the exposure, it is important to adequately address confounding for making valid causal inferences from observational data. Directed acyclic graphs (DAGs) are visual representations of causal assumptions that are increasingly used in modern epidemiology. They can help to identify the presence of confounding for the causal question at hand. This structured approach serves as a visual aid in the scientific discussion by making underlying relations explicit. This article explains the basic concepts of DAGs and provides examples in the field of nephrology with and without presence of confounding. Ultimately, these examples will show that DAGs can be preferable to the traditional methods to identify sources of confounding, especially in complex research questions.
Estimation of Sparse Directed Acyclic Graphs for Multivariate Counts Data
Han, Sung Won; Zhong, Hua
2016-01-01
Summary The next-generation sequencing data, called high throughput sequencing data, are recorded as count data, which is generally far from normal distribution. Under the assumption that the count data follow the Poisson log-normal distribution, this paper provides an L1-penalized likelihood framework and an efficient search algorithm to estimate the structure of sparse directed acyclic graphs (DAGs) for multivariate counts data. In searching for the solution, we use iterative optimization procedures to estimate the adjacency matrix and the variance matrix of the latent variables. The simulation result shows that our proposed method outperforms the approach which assumes multivariate normal distributions, and the log-transformation approach. It also shows that the proposed method outperforms the rank-based PC method under sparse network or hub network structures. As a real data example, we demonstrate the efficiency of the proposed method in estimating the gene regulatory networks of the ovarian cancer study. PMID:26849781
Robust causal inference using directed acyclic graphs: the R package 'dagitty'.
Textor, Johannes; van der Zander, Benito; Gilthorpe, Mark S; Liśkiewicz, Maciej; Ellison, George T H
2017-01-15
Directed acyclic graphs (DAGs), which offer systematic representations of causal relationships, have become an established framework for the analysis of causal inference in epidemiology, often being used to determine covariate adjustment sets for minimizing confounding bias. DAGitty is a popular web application for drawing and analysing DAGs. Here we introduce the R package 'dagitty', which provides access to all of the capabilities of the DAGitty web application within the R platform for statistical computing, and also offers several new functions. We describe how the R package 'dagitty' can be used to: evaluate whether a DAG is consistent with the dataset it is intended to represent; enumerate 'statistically equivalent' but causally different DAGs; and identify exposure-outcome adjustment sets that are valid for causally different but statistically equivalent DAGs. This functionality enables epidemiologists to detect causal misspecifications in DAGs and make robust inferences that remain valid for a range of different DAGs. The R package 'dagitty' is available through the comprehensive R archive network (CRAN) at [https://cran.r-project.org/web/packages/dagitty/]. The source code is available on github at [https://github.com/jtextor/dagitty]. The web application 'DAGitty' is free software, licensed under the GNU general public licence (GPL) version 2 and is available at [http://dagitty.net/].
"Toward a clearer definition of confounding" revisited with directed acyclic graphs.
Howards, Penelope P; Schisterman, Enrique F; Poole, Charles; Kaufman, Jay S; Weinberg, Clarice R
2012-09-15
In a 1993 paper (Am J Epidemiol. 1993;137(1):1-8), Weinberg considered whether a variable that is associated with the outcome and is affected by exposure but is not an intermediate variable between exposure and outcome should be considered a confounder in etiologic studies. As an example, she examined the common practice of adjusting for history of spontaneous abortion when estimating the effect of an exposure on the risk of spontaneous abortion. She showed algebraically that such an adjustment could substantially bias the results even though history of spontaneous abortion would meet some definitions of a confounder. Directed acyclic graphs (DAGs) were introduced into epidemiology several years later as a tool with which to identify confounders. The authors now revisit Weinberg's paper using DAGs to represent scenarios that arise from her original assumptions. DAG theory is consistent with Weinberg's finding that adjusting for history of spontaneous abortion introduces bias in her original scenario. In the authors' examples, treating history of spontaneous abortion as a confounder introduces bias if it is a descendant of the exposure and is associated with the outcome conditional on exposure or is a child of a collider on a relevant undirected path. Thoughtful DAG analyses require clear research questions but are easily modified for examining different causal assumptions that may affect confounder assessment.
PenPC: A Two-step Approach to Estimate the Skeletons of High Dimensional Directed Acyclic Graphs
Ha, Min Jin; Sun, Wei; Xie, Jichun
2015-01-01
Summary Estimation of the skeleton of a directed acyclic graph (DAG) is of great importance for understanding the underlying DAG and causal e ects can be assessed from the skeleton when the DAG is not identifiable. We propose a novel method named PenPC to estimate the skeleton of a high-dimensional DAG by a two-step approach. We first estimate the non-zero entries of a concentration matrix using penalized regression, and then fix the difference between the concentration matrix and the skeleton by evaluating a set of conditional independence hypotheses. For high dimensional problems where the number of vertices p is in polynomial or exponential scale of sample size n, we study the asymptotic property of PenPC on two types of graphs: traditional random graphs where all the vertices have the same expected number of neighbors, and scale-free graphs where a few vertices may have a large number of neighbors. As illustrated by extensive simulations and applications on gene expression data of cancer patients, PenPC has higher sensitivity and specificity than the state-of-the-art method, the PC-stable algorithm. PMID:26406114
Invited commentary: the perils of birth weight--a lesson from directed acyclic graphs.
Wilcox, Allen J
2006-12-01
The strong association of birth weight with infant mortality is complicated by a paradoxical finding: Small babies in high-risk populations usually have lower risk than small babies in low-risk populations. In this issue of the Journal, Hernández-Díaz et al. (Am J Epidemiol 2006;164:1115-20) address this "birth weight paradox" using directed acyclic graphs (DAGs). They conclude that the paradox is the result of bias created by adjustment for a factor (birth weight) that is affected by the exposure of interest and at the same time shares causes with the outcome (mortality). While this bias has been discussed before, the DAGs presented by Hernández-Díaz et al. provide more firmly grounded criticism. The DAGs demonstrate (as do many other examples) that seemingly reasonable adjustments can distort epidemiologic results. In this commentary, the birth weight paradox is shown to be an illustration of Simpson's Paradox. It is possible for a factor to be protective within every stratum of a variable and yet be damaging overall. Questions remain as to the causal role of birth weight.
A multiple testing method for hypotheses structured in a directed acyclic graph.
Meijer, Rosa J; Goeman, Jelle J
2015-01-01
We present a novel multiple testing method for testing null hypotheses that are structured in a directed acyclic graph (DAG). The method is a top-down method that strongly controls the familywise error rate and can be seen as a generalization of Meinshausen's procedure for tree-structured hypotheses. Just as Meinshausen's procedure, our proposed method can be used to test for variable importance, only the corresponding variable clusters can be chosen more freely, because the method allows for multiple parent nodes and partially overlapping hypotheses. An important application of our method is in gene set analysis, in which one often wants to test multiple gene sets as well as individual genes for their association with a clinical outcome. By considering the genes and gene sets as nodes in a DAG, our method enables us to test both for significant gene sets as well as for significant individual genes within the same multiple testing procedure. The method will be illustrated by testing Gene Ontology terms for evidence of differential expression in a survival setting and is implemented in the R package cherry.
Acyclic and star colorings of joins of graphs and an algorithm for cographs.
Lyons, A.; Mathematics and Computer Science; Univ. of Chicago
2009-01-01
An acyclic coloring of a graph is a proper vertex coloring such that the subgraph induced by the union of any two color classes is a disjoint collection of trees. The more restricted notion of star coloring requires that the union of any two color classes induces a disjoint collection of stars. The acyclic and star chromatic numbers of a graph G are defined analogously to the chromatic number {chi}(G) and are denoted by {chi}{sub a}(G) and {chi}{sub s}(G), respectively. In this paper, we consider acyclic and star colorings of graphs that are decomposable with respect to the join operation, which builds a new graph from a collection of two or more disjoint graphs by adding all possible edges between them. In particular, we present a recursive formula for the acyclic chromatic number of joins of graphs and show that a similar formula holds for the star chromatic number. We also demonstrate the algorithmic implications of our results for the cographs, which have the unique property that they are recursively decomposable with respect to the join and disjoint union operations.
Wang, Shuihua; Yang, Ming; Du, Sidan; Yang, Jiquan; Liu, Bin; Gorriz, Juan M.; Ramírez, Javier; Yuan, Ti-Fei; Zhang, Yudong
2016-01-01
Highlights We develop computer-aided diagnosis system for unilateral hearing loss detection in structural magnetic resonance imaging.Wavelet entropy is introduced to extract image global features from brain images. Directed acyclic graph is employed to endow support vector machine an ability to handle multi-class problems.The developed computer-aided diagnosis system achieves an overall accuracy of 95.1% for this three-class problem of differentiating left-sided and right-sided hearing loss from healthy controls. Aim: Sensorineural hearing loss (SNHL) is correlated to many neurodegenerative disease. Now more and more computer vision based methods are using to detect it in an automatic way. Materials: We have in total 49 subjects, scanned by 3.0T MRI (Siemens Medical Solutions, Erlangen, Germany). The subjects contain 14 patients with right-sided hearing loss (RHL), 15 patients with left-sided hearing loss (LHL), and 20 healthy controls (HC). Method: We treat this as a three-class classification problem: RHL, LHL, and HC. Wavelet entropy (WE) was selected from the magnetic resonance images of each subjects, and then submitted to a directed acyclic graph support vector machine (DAG-SVM). Results: The 10 repetition results of 10-fold cross validation shows 3-level decomposition will yield an overall accuracy of 95.10% for this three-class classification problem, higher than feedforward neural network, decision tree, and naive Bayesian classifier. Conclusions: This computer-aided diagnosis system is promising. We hope this study can attract more computer vision method for detecting hearing loss. PMID:27807415
Wang, Shuihua; Yang, Ming; Du, Sidan; Yang, Jiquan; Liu, Bin; Gorriz, Juan M; Ramírez, Javier; Yuan, Ti-Fei; Zhang, Yudong
2016-01-01
Highlights We develop computer-aided diagnosis system for unilateral hearing loss detection in structural magnetic resonance imaging.Wavelet entropy is introduced to extract image global features from brain images. Directed acyclic graph is employed to endow support vector machine an ability to handle multi-class problems.The developed computer-aided diagnosis system achieves an overall accuracy of 95.1% for this three-class problem of differentiating left-sided and right-sided hearing loss from healthy controls. Aim: Sensorineural hearing loss (SNHL) is correlated to many neurodegenerative disease. Now more and more computer vision based methods are using to detect it in an automatic way. Materials: We have in total 49 subjects, scanned by 3.0T MRI (Siemens Medical Solutions, Erlangen, Germany). The subjects contain 14 patients with right-sided hearing loss (RHL), 15 patients with left-sided hearing loss (LHL), and 20 healthy controls (HC). Method: We treat this as a three-class classification problem: RHL, LHL, and HC. Wavelet entropy (WE) was selected from the magnetic resonance images of each subjects, and then submitted to a directed acyclic graph support vector machine (DAG-SVM). Results: The 10 repetition results of 10-fold cross validation shows 3-level decomposition will yield an overall accuracy of 95.10% for this three-class classification problem, higher than feedforward neural network, decision tree, and naive Bayesian classifier. Conclusions: This computer-aided diagnosis system is promising. We hope this study can attract more computer vision method for detecting hearing loss.
VPipe: Virtual Pipelining for Scheduling of DAG Stream Query Plans
NASA Astrophysics Data System (ADS)
Wang, Song; Gupta, Chetan; Mehta, Abhay
There are data streams all around us that can be harnessed for tremendous business and personal advantage. For an enterprise-level stream processing system such as CHAOS [1] (Continuous, Heterogeneous Analytic Over Streams), handling of complex query plans with resource constraints is challenging. While several scheduling strategies exist for stream processing, efficient scheduling of complex DAG query plans is still largely unsolved. In this paper, we propose a novel execution scheme for scheduling complex directed acyclic graph (DAG) query plans with meta-data enriched stream tuples. Our solution, called Virtual Pipelined Chain (or VPipe Chain for short), effectively extends the "Chain" pipelining scheduling approach to complex DAG query plans.
Can we believe the DAGs? A comment on the relationship between causal DAGs and mechanisms
Aalen, OO; Røysland, K; Gran, JM; Kouyos, R
2014-01-01
Directed acyclic graphs (DAGs) play a large role in the modern approach to causal inference. DAGs describe the relationship between measurements taken at various discrete times including the effect of interventions. The causal mechanisms, on the other hand, would naturally be assumed to be a continuous process operating over time in a cause–effect fashion. How does such immediate causation, that is causation occurring over very short time intervals, relate to DAGs constructed from discrete observations? We introduce a time-continuous model and simulate discrete observations in order to judge the relationship between the DAG and the immediate causal model. We find that there is no clear relationship; indeed the Bayesian network described by the DAG may not relate to the causal model. Typically, discrete observations of a process will obscure the conditional dependencies that are represented in the underlying mechanistic model of the process. It is therefore doubtful whether DAGs are always suited to describe causal relationships unless time is explicitly considered in the model. We relate the issues to mechanistic modeling by using the concept of local (in)dependence. An example using data from the Swiss HIV Cohort Study is presented. PMID:24463886
Jiang, Yuyi; Shao, Zhiqing; Guo, Yi
2014-01-01
A complex computing problem can be solved efficiently on a system with multiple computing nodes by dividing its implementation code into several parallel processing modules or tasks that can be formulated as directed acyclic graph (DAG) problems. The DAG jobs may be mapped to and scheduled on the computing nodes to minimize the total execution time. Searching an optimal DAG scheduling solution is considered to be NP-complete. This paper proposed a tuple molecular structure-based chemical reaction optimization (TMSCRO) method for DAG scheduling on heterogeneous computing systems, based on a very recently proposed metaheuristic method, chemical reaction optimization (CRO). Comparing with other CRO-based algorithms for DAG scheduling, the design of tuple reaction molecular structure and four elementary reaction operators of TMSCRO is more reasonable. TMSCRO also applies the concept of constrained critical paths (CCPs), constrained-critical-path directed acyclic graph (CCPDAG) and super molecule for accelerating convergence. In this paper, we have also conducted simulation experiments to verify the effectiveness and efficiency of TMSCRO upon a large set of randomly generated graphs and the graphs for real world problems. PMID:25143977
A Gibbs Sampler for Learning DAGs
Goudie, Robert J. B.; Mukherjee, Sach
2017-01-01
We propose a Gibbs sampler for structure learning in directed acyclic graph (DAG) models. The standard Markov chain Monte Carlo algorithms used for learning DAGs are random-walk Metropolis-Hastings samplers. These samplers are guaranteed to converge asymptotically but often mix slowly when exploring the large graph spaces that arise in structure learning. In each step, the sampler we propose draws entire sets of parents for multiple nodes from the appropriate conditional distribution. This provides an efficient way to make large moves in graph space, permitting faster mixing whilst retaining asymptotic guarantees of convergence. The conditional distribution is related to variable selection with candidate parents playing the role of covariates or inputs. We empirically examine the performance of the sampler using several simulated and real data examples. The proposed method gives robust results in diverse settings, outperforming several existing Bayesian and frequentist methods. In addition, our empirical results shed some light on the relative merits of Bayesian and constraint-based methods for structure learning.
2012-09-01
11 b. Business Process Model and Notation ( BPMN ) ....................12 c. Entity Relationship Diagrams (ERD...diagram (From EETimes Website Authors, 2011) ...........12 Figure 9. BPMN example diagram (From Wikipedia contributors, 2012) .....................13...Association for Computing Machinery BPMN Business Process Model and Notation DAG Directed Acyclic Graph DOM Document Object Model ERD Entity
Visualizing Evaluation Structures using Layered Graph Drawings.
Onoue, Yosuke; Kukimoto, Nobuyuki; Sakamoto, Naohisa; Misue, Kazuo; Koyamada, Koji
2016-03-18
We propose a method for visualizing evaluation structures that is based on layered graph drawing techniques. An evaluation structure is a hierarchical structure of human cognition extracted from interviews based on the evaluation grid method. An evaluation structure can be defined as a directed acyclic graph (DAG). The Sugiyama framework is a popular method for constructing DAGs. A new layer assignment method that is a part of the Sugiyama framework is proposed to satisfy the requirements for drawing evaluation structures. We formulate a layer assignment problem by considering the sum of squares of arc lengths to be an integer quadratic programming (IQP) problem. Moreover, we transform the IQP problem into an equivalent integer linear programming (ILP) problem for computational efficiency. Evaluations demonstrate that the layered graph drawing with the proposed layer assignment method is preferred by users and aids in the understanding of evaluation structures.
DagStream: locality aware and failure resilient peer-to-peer streaming
NASA Astrophysics Data System (ADS)
Liang, Jin; Nahrstedt, Klara
2006-01-01
Live peer to peer (P2P) media streaming faces many challenges such as peer unreliability and bandwidth heterogeneity. To effectively address these challenges, general "mesh" based P2P streaming architectures have recently been adopted. Mesh-based systems allow peers to aggregate bandwidth from multiple neighbors, and dynamically adapt to changing network conditions and neighbor failures. However, a drawback of mesh-based overlays is that it is difficult to guarantee network connectivity in a distributed fashion, especially when network locality needs to be optimized. This paper introduces a new P2P streaming framework called DagStream, which (1) organizes peers into a directed acyclic graph (DAG) where each node maintains at least k parents, thus has provable network connectivity (and hence failure resilience), and (2) enables peers to quickly achieve locality awareness in a distributed fashion, thus ensures efficient network resource usage. Our experiment results in both simulation and wide area environment show that with our DagStream protocol, peers can quickly self-organize into a locality aware DAG. Further, by selecting additional parents as needed, peers can achieve good streaming quality commensurate with their downlink bandwidth.
Lecca, Paola; Casiraghi, Nicola; Demichelis, Francesca
2015-01-01
Somatic mutations arise and accumulate both during tumor genesis and progression. However, the order in which mutations occur is an open question and the inference of the temporal ordering at the gene level could potentially impact on patient treatment. Thus, exploiting recent observations suggesting that the occurrence of mutations is a non-memoryless process, we developed a computational approach to infer timed oncogenetic directed acyclic graphs (TO-DAGs) from human tumor mutation data. Such graphs represent the path and the waiting times of alterations during tumor evolution. The probability of occurrence of each alteration in a path is the probability that the alteration occurs when all alterations prior to it have occurred. The waiting time between an alteration and the subsequent is modeled as a stochastic function of the conditional probability of the event given the occurrence of the previous one. TO-DAG performances have been evaluated both on synthetic data and on somatic non-silent mutations from prostate cancer and melanoma patients and then compared with those of current well-established approaches. TO-DAG shows high performance scores on synthetic data and recognizes mutations in gatekeeper tumor suppressor genes as trigger for several downstream mutational events in the human tumor data.
Saad, Tony; Sutherland, James C.
2016-05-04
To address the coding and software challenges of modern hybrid architectures, we propose an approach to multiphysics code development for high-performance computing. This approach is based on using a Domain Specific Language (DSL) in tandem with a directed acyclic graph (DAG) representation of the problem to be solved that allows runtime algorithm generation. When coupled with a large-scale parallel framework, the result is a portable development framework capable of executing on hybrid platforms and handling the challenges of multiphysics applications. In addition, we share our experience developing a code in such an environment – an effort that spans an interdisciplinary team of engineers and computer scientists.
Zhang, Qin
2015-07-01
Probabilistic graphical models (PGMs) such as Bayesian network (BN) have been widely applied in uncertain causality representation and probabilistic reasoning. Dynamic uncertain causality graph (DUCG) is a newly presented model of PGMs, which can be applied to fault diagnosis of large and complex industrial systems, disease diagnosis, and so on. The basic methodology of DUCG has been previously presented, in which only the directed acyclic graph (DAG) was addressed. However, the mathematical meaning of DUCG was not discussed. In this paper, the DUCG with directed cyclic graphs (DCGs) is addressed. In contrast, BN does not allow DCGs, as otherwise the conditional independence will not be satisfied. The inference algorithm for the DUCG with DCGs is presented, which not only extends the capabilities of DUCG from DAGs to DCGs but also enables users to decompose a large and complex DUCG into a set of small, simple sub-DUCGs, so that a large and complex knowledge base can be easily constructed, understood, and maintained. The basic mathematical definition of a complete DUCG with or without DCGs is proved to be a joint probability distribution (JPD) over a set of random variables. The incomplete DUCG as a part of a complete DUCG may represent a part of JPD. Examples are provided to illustrate the methodology.
Saad, Tony; Sutherland, James C.
2016-05-04
To address the coding and software challenges of modern hybrid architectures, we propose an approach to multiphysics code development for high-performance computing. This approach is based on using a Domain Specific Language (DSL) in tandem with a directed acyclic graph (DAG) representation of the problem to be solved that allows runtime algorithm generation. When coupled with a large-scale parallel framework, the result is a portable development framework capable of executing on hybrid platforms and handling the challenges of multiphysics applications. In addition, we share our experience developing a code in such an environment – an effort that spans an interdisciplinarymore » team of engineers and computer scientists.« less
Project management of DAG: Eastern Anatolia Observatory
NASA Astrophysics Data System (ADS)
Keskin, Onur; Yesilyaprak, Cahit; Yerli, Sinan K.; Zago, Lorenzo; Guver, Tolga; Alis, Sinan
2016-08-01
The four meter DAG (Eastern Anatolia Observatory in Turkish) telescope is not only the largest telescope in Turkey but also the most promising telescope in the northern hemisphere with a large potential to offer scientific observations with its cutting edge technology. DAG is designed to be an AO telescope which will allow both infrared and visible observations with its two Nasmyth platforms dedicated to next generation focal plane instruments. In this paper, status updates from DAG telescope will be presented in terms of; (i) in house optical design of DAG, (ii) tender process of telescope, (iii) tender process of enclosure, and (iv) tender process of the observatory building. Also status updates from the focal plane instruments project and possible collaboration activities will be presented.
The dystroglycan complex is involved in a number of processes including laminin and basement membrane assembly, sacrolemmal stability, cell survival, peripheral nerve myelination, nodal structure, cell migration, and epithelial polarization. DAG1 is the laminin binding component of the dystrophin-glycoprotein complex which provides a linkage between the subsarcolemmal cytoskeleton and the extracellular matrix. The DAG1 gene is a candidate gene for the site of the mutation in autosomal recessive muscular dystrophies. The dramatic reduction of dystroglycan 1 in Duchenne muscular dystrophy leads to a loss of linkage between the sarcolemma and extracellular matrix, rendering muscle fibers more susceptible to necrosis. Dystroglycan also functions as dual receptor for agrin and laminin-2 in the Schwann cell membrane. The muscle and nonmuscle isoforms of dystroglycan differ by carbohydrate moieties but not protein sequence. Alternative splicing results in multiple transcript variants all encoding the same protein. DAG1 is expressed in a variety of fetal and adult tissues.
Gas recirculator for acyclic machines
NASA Astrophysics Data System (ADS)
Balsa, T. F.
1985-05-01
The present invention relates to acyclic machines of the type using liquid metal collectors, and more particularly to an improvement for retaining the liquid metal in such machines. Radial type acyclic motors and generators generally include a metallic disk rotor rotating on a shaft between electromagnetic stator poles excited by field coils wound concentric with the shaft. Instead of solid brush, current collectors at the rotor periphery, liquid metal collectors are sometimes used to close the electrical current loop between the shaft and the rotor, and an inert pressurized cover gas fills the gaps between the rotating components and the stationary housing. A cover has recirculator in an acyclic generator having liquid metal collectors for reducing entrainment of the liquid metal in the gas. Radial passages in the stator housing provide natural recirculating paths for the cover gas to flow radially outward along the sides of the rotor and return inwardly through the passages. Scoops or lips located inward of the liquid metal collector divert the outward gas flow into the passages to minimize contact of the gas with the liquid metal.
DAG1, no gene for RNA regulation?
Brancaccio, Andrea
2012-04-10
DAG1 encodes for a precursor protein that liberates the two subunits featured by the dystroglycan (DG) adhesion complex that are involved in an increasing number of cellular functions in a wide variety of cells and tissues. Aside from the proteolytic events producing the α and β subunits, especially the former undergoes extensive "post-production" modifications taking place within the ER/Golgi where its core protein is both N- and O-decorated with sugars. These post-translational events, that are mainly orchestrated by a plethora of certified, or putative, glycosyltransferases, prelude to the excocytosis-mediated trafficking and targeting of the DG complex to the plasma membrane. Extensive genetic and biochemical evidences have been accumulated so far on α-DG glycosylation, while little is know on possible regulatory events underlying the chromatine activation, transcription or post-transcription (splicing and escape from the nucleus) of DAG1 or of its mRNA. A scenario is envisaged in which cells would use a sort of preferential, and scarcely regulated, route for DAG1 activation, that would imply fast mRNA transcription, maturation and export to the cytosol, and would prelude to the multiple time-consuming enzymatic post-translational activities needed for its glycosylation. Such a provocative view might be helpful to trigger future work aiming at disclosing the complete molecular mechanisms underlying DAG1 activation and at improving our knowledge of any pre-translational step that is involved in dystroglycan regulation.
2002-04-15
path from a to (3 together with an edge (3 -+ a is called a (fully) directed cycle . An anterior path from a to f3 together with an edge (3 -+ a is...called a partially directed cycle . A directed acyclic graph (DA G) is a mixed graph in which all edges are directed, and there are no directed cycles . 3...regardless of whether a and "’f are adjacent). There are no directed cycles or pa’ltially directed cycles . 9 to Proof: follows because condition rules
Cardioleader use in acyclic types of sports
NASA Technical Reports Server (NTRS)
Bondin, V. I.
1980-01-01
The use of the cardioleader method in regulating training loads and tests for athletes in acyclic sports was investigated. It was found that the use of this method increases the effectiveness of the training process.
Inferring Pedigree Graphs from Genetic Distances
NASA Astrophysics Data System (ADS)
Tamura, Takeyuki; Ito, Hiro
In this paper, we study a problem of inferring blood relationships which satisfy a given matrix of genetic distances between all pairs of n nodes. Blood relationships are represented by our proposed graph class, which is called a pedigree graph. A pedigree graph is a directed acyclic graph in which the maximum indegree is at most two. We show that the number of pedigree graphs which satisfy the condition of given genetic distances may be exponential, but they can be represented by one directed acyclic graph with n nodes. Moreover, an O(n3) time algorithm which solves the problem is also given. Although phylogenetic trees and phylogenetic networks are similar data structures to pedigree graphs, it seems that inferring methods for phylogenetic trees and networks cannot be applied to infer pedigree graphs since nodes of phylogenetic trees and networks represent species whereas nodes of pedigree graphs represent individuals. We also show an O(n2) time algorithm which detects a contradiction between a given pedigreee graph and distance matrix of genetic distances.
Explaining a Weighted DAG with Few Paths for Solving Genome-Guided Multi-Assembly.
Tomescu, Alexandru I; Gagie, Travis; Popa, Alexandru; Rizzi, Romeo; Kuosmanen, Anna; Mäkinen, Veli
2015-01-01
RNA-Seq technology offers new high-throughput ways for transcript identification and quantification based on short reads, and has recently attracted great interest. This is achieved by constructing a weighted DAG whose vertices stand for exons, and whose arcs stand for split alignments of the RNA-Seq reads to the exons. The task consists of finding a number of paths, together with their expression levels, which optimally explain the weights of the graph under various fitting functions, such as least sum of squared residuals. In (Tomescu et al. BMC Bioinformatics, 2013) we studied this genome-guided multi-assembly problem when the number of allowed solution paths was linear in the number of arcs. In this paper, we further refine this problem by asking for a bounded number k of solution paths, which is the setting of most practical interest. We formulate this problem in very broad terms, and show that for many choices of the fitting function it becomes NP-hard. Nevertheless, we identify a natural graph parameter of a DAG G, which we call arc-width and denote ⟨G⟩, and give a dynamic programming algorithm running in time O(W(k)⟨G⟩(k)(⟨G⟩+ k)n) , where n is the number of vertices and W is the maximum weight of G. This implies that the problem is fixed-parameter tractable (FPT) in the parameters W, ⟨G⟩, and k. We also show that the arc-width of DAGs constructed from simulated and real RNA-Seq reads is small in practice. Finally, we study the approximability of this problem, and, in particular, give a fully polynomial-time approximation scheme (FPTAS) for the case when the fitting function penalizes the maximum ratio between the weights of the arcs and their predicted coverage.
Acyclic telluroiminium salts: isolation and characterization.
Mutoh, Yuichiro; Murai, Toshiaki; Yamago, Shigeru
2004-12-29
The isolation, structure, and reactions of acyclic telluroiminium salts were disclosed. The delocalization of electrons on the tellurium atom and the partial double-bond character of C-Te bonds in the salts are discussed on the basis of X-ray molecular structure analysis, 13C and 125Te NMR spectroscopy, and molecular orbital calculation.
NASA Astrophysics Data System (ADS)
Yamaguchi, Shingo
A workflow net (WF-net for short) is a Petri net which represents a workflow. There are two important subclasses of WF-nets: extended free-choice (EFC for short) and well-structured (WS for short). It is known that most actual workflows can be modeled as EFC WF-nets; Acyclic WS is a subclass of acyclic EFC but has more analysis methods. An acyclic EFC WF-net may be transformed to an acyclic WS WF-net without changing the external behavior of the net. We name such a transformation Acyclic EFC WF-net refactoring. We give a formal definition of acyclic EFC WF-net refactoring problem. We also give a necessary condition and a sufficient condition for solving the problem. Those conditions can be checked in polynomial time. These result in the enhancement of the analysis power of acyclic EFC WF-nets.
DAG tales: the multiple faces of diacylglycerol--stereochemistry, metabolism, and signaling.
Eichmann, Thomas Oliver; Lass, Achim
2015-10-01
The neutral lipids diacylglycerols (DAGs) are involved in a plethora of metabolic pathways. They function as components of cellular membranes, as building blocks for glycero(phospho)lipids, and as lipid second messengers. Considering their central role in multiple metabolic processes and signaling pathways, cellular DAG levels require a tight regulation to ensure a constant and controlled availability. Interestingly, DAG species are versatile in their chemical structure. Besides the different fatty acid species esterified to the glycerol backbone, DAGs can occur in three different stereo/regioisoforms, each with unique biological properties. Recent scientific advances have revealed that DAG metabolizing enzymes generate and distinguish different DAG isoforms, and that only one DAG isoform holds signaling properties. Herein, we review the current knowledge of DAG stereochemistry and their impact on cellular metabolism and signaling. Further, we describe intracellular DAG turnover and its stereochemistry in a 3-pool model to illustrate the spatial and stereochemical separation and hereby the diversity of cellular DAG metabolism.
A microwave kinetic inductance detector for the DAG telescope
NASA Astrophysics Data System (ADS)
Güver, Tolga; Mazin, Benjamin A.; O'Brien, Kieran; Kay, Burak; Aliş, Sinan; Yelkenci, F. Korhan; Yeşilyaprak, Cahit; Yerli, Sinan K.; Erol, Ayşe.; Keskin, Onur
2016-08-01
We present the details of a proposed microwave kinetic inductance detector (MKID) for the DAG (Eastern Anatolia Observatory in Turkish) telescope, DAG-MKID. The observatory will have a modern 4m size telescope that is currently under construction. Current plan to obtain the first light with the telescope is late 2019. The proposed MKID based instrument will enable astronomers to simultaneously detect photons in the relatively wide wavelength range of 4000 - 13500 Å with a timing accuracy of μs and spectral resolution R = ⋋/▵ ⋋ =10-25. With a planned field of view of approximately an arcminute, DAG-MKID will mostly be used for follow-up observations of transient or variable objects as well as a robust tool to measure photometric redshifts of a large number of galaxies or other extra-galactic objects.
Digestion and assimilation features of dietary DAG in the rat small intestine.
Kondo, Hidehiko; Hase, Tadashi; Murase, Takatoshi; Tokimitsu, Ichiro
2003-01-01
Several recent studies have demonstrated that dietary DAG oil rich in 1,3-species suppresses the postprandial increase of serum TAG level and decreases body fat accumulation, compared with TAG oil. To clarify the mechanisms underlying the beneficial effects of DAG, we investigated the metabolic features of DAG in the small intestine with regard to the digestion pathway in the lumen and the TAG-synthesis pathway in the mucosa. When intraduodenally infused as an emulsion, TAG was digested to 1,2-DAG, 2-MAG, and FFA, whereas 1,3-DAG was digested to 1(3)-MAG and FFA. When assessed by the incorporation of [1-14C]linoleic acid in lipids, the mucosal TAG-synthesis was significantly reduced by DAG infusion compared with TAG infusion. However, the mucosal 1,3-DAG synthesis was remarkably increased in the DAG-infused rats. The total amount of mucosal 1,3-DAG was also increased (4.5-fold) after DAG infusion compared with that after TAG infusion. Next, we examined the synthesis pathway of 1,3-DAG. In cultures of the everted intestinal sacs, 1,3-DAG production required the presence of 1-MAG, suggesting that the 1,3-DAG synthesis was due to acylation of 1(3)-MAG in the DAG-infused rats. Furthermore, measurements of DAG acyltransferase activity indicated that 1,3-DAG was little utilized in TAG synthesis. These findings suggest that features of 1,3-DAG digestion and assimilation in the intestine may be responsible for the reduction of the postprandial serum TAG level by dietary DAG.
DAG Telescope: A New Potential for MOS Observations
NASA Astrophysics Data System (ADS)
Alis, S.; Yesilyaprak, C.; Yerli, S. K.
2016-10-01
East Anatolian Observatory (aka. DAG) is a national project supported by the Turkish Government for building a 4 m class telescope which will be working in the optical and near-IR domain. As the tender process has been completed and kick-off to the telescope and the mirror production has been initiated, the project team is looking for possible collaborations for the focal plane instrumentation. This contribution is intended to describe the DAG project and to show its opportunities for a state-of-the-art MOS instrument.
Sensor Placement for Fault Diagnosis Using Graph of a Process
NASA Astrophysics Data System (ADS)
Sztyber, Anna
2017-01-01
The quality of a diagnostic system strongly depends on the availability of appropriate measurements. In this work sensor placement method using Graph of a Process is introduced. Graph of a Process is a formalization of a causal graph useful in fault diagnosis. Faults are directly incorporated into the model. The necessary and sufficient conditions for fault detectability and isolability are formulated. The analysis is divided into acyclic graph search and calculations within strongly connected components. This method is applicable to the design of the instrumentation of diagnostic systems, when the analytical process model is unavailable.
Acyclic archaebacterial ether lipids in swamp sediments
NASA Astrophysics Data System (ADS)
Pauly, George G.; Van Vleet, Edward S.
1986-06-01
Acyclic phytanyl diether glycerol and biphytanyl ether lipids have been quantified in two modern swamp sediment cores in concentrations ranging up to 360 μg/ml porewater. Methanogenic bacteria are the only known source organisms which can inhabit the swamp sediments. Variations in relative abundance between these lipids may reflect taxonomic changes in methanogen populations or the stage of growth. Maxima in methanogen lipid concentrations coincide with local maxima of 13C of organic matter, possibly the result of a pool effect on CO 2 or acetate. Methane production estimates calculated from lipid concentrations in swamp sediments range from 0.1 to 1.3 mmol cm -2 yr -1, values which are consistent with published methane fluxes.
Schulz, Martin; Arnold, Dorian
2007-06-12
GraphLib is a support library used by other tools to create, manipulate, store, and export graphs. It provides a simple interface to specifS arbitrary directed and undirected graphs by adding nodes and edges. Each node and edge can be associated with a set of attributes describing size, color, and shape. Once created, graphs can be manipulated using a set of graph analysis algorithms, including merge, prune, and path coloring operations. GraphLib also has the ability to export graphs into various open formats such as DOT and GML.
Turkey's next big science project: DAG the 4 meter telescope
NASA Astrophysics Data System (ADS)
Keskin, O.; Yesilyaprak, C.; Yerli, S. K.; Zago, L.; Jolissaint, L.
2014-07-01
The DAG (Turkish for Eastern Anatolia Observatory) 4-m telescope project has been formally launched in 2012, being fully funded by the Government of Turkey. This new observatory is to be located on a 3170 m altitude ridge near the town of Erzurum in Eastern Anatolia. First light is scheduled for late 2017. The DAG team's baseline design of the telescope consists of a Ritchey-Chretien type with alt-az mount, a focal length of 56 m and a field of view up to 30 arcmin. Multiple instruments will be located at the Nasmyth foci. The optical specifications of the telescope are set by DAG team for diffraction limited performance with active and adaptive optics. Modern mirror control technologies will allow defining in a most cost effective way the figuring requirements of the optical surfaces: the low order figuring errors of the combined optical train constituted of M1-M2-M3 are defined in terms of Zernike coefficients and referred to the M1 surface area. The high order figuring errors are defined using the phase structure functions. Daytime chilling of the closed enclosure volume and natural ventilation through suitable openings during observations will be used to ensure optimal mirror and dome seeing. A design of a ground layer adaptive optics (GLAO) subsystem is developed concurrently with the telescope. In this paper, main design aspects, the optical design and expected performance analysis of the telescope will be presented.
The Dome Automations of ATA50 and MASS-DIMM Telescopes for DAG Project
NASA Astrophysics Data System (ADS)
Dogan, E.; Celik, H. I.; Ozbaldan, E. E.; Guney, Y.; Yesilyaprak, C.
2016-12-01
In the scope of Eastern Anatolia Observatory (DAG) Project, The DAG Technical Team has carried out various automation studies like dome, camera, atmospherical equipments, etc. The domes of ATA50 and MASS-DIMM Telescopes have almost similar opening systems. Both telescopes will run as robotic very soon; therefore it's mandatory and inevitable to make the automations of their domes. The automation studies as its electronics and software developed by DAG Technical Team are presented.
Acyclic Tethers Mimicking Subunits of Polysaccharide Ligands: Selectin Antagonists
2014-01-01
We report on the design and synthesis of molecules having E- and P-selectins blocking activity both in vitro and in vivo. The GlcNAc component of the selectin ligand sialyl LewisX was replaced by an acyclic tether that links two saccharide units. The minimization of intramolecular dipole–dipole interactions and the gauche effect would be at the origin of the conformational bias imposed by this acyclic tether. The stereoselective synthesis of these molecules, their biochemical and biological evaluations using surface plasmon resonance spectroscopy (SPR), and in vivo assays are described. Because the structure of our analogues differs from the most potent E-selectin antagonists reported, our acyclic analogues offer new opportunities for chemical diversity. PMID:25221666
On the acyclicity of the solution sets of operator equations
NASA Astrophysics Data System (ADS)
Gel'man, Boris D.
2010-12-01
A parameter-dependent completely continuous map is considered. The acyclicity of the set of fixed points of this map is proved for some fixed value of the parameter under the assumption that for close values of the parameter the map has a unique fixed point. The results obtained are used to prove the acyclicity of the set of fixed points of a 'nonscattering' map, as well as to study the topological structure of the set of fixed points of an abstract Volterra map. Bibliography: 13 titles.
Synthesis of some novel hydrazono acyclic nucleoside analogues
Khalafi-Nezhad, Ali; Behrouz, Somayeh
2010-01-01
Summary The syntheses of novel hydrazono acyclic nucleosides similar to miconazole scaffolds are described. In this series of acyclic nucleosides, pyrimidine as well as purine and other azole derivatives replaced the imidazole function in miconazole and the ether group was replaced with a hydrazone moiety using phenylhydrazine. To interpret the dominant formation of (E)-hydrazone derivatives rather than (Z)-isomers, PM3 semiempirical quantum mechanic calculations were carried out which indicated that the (E)-isomers had the lower heats of formation. PMID:20563270
NASA Astrophysics Data System (ADS)
Yesilyaprak, C.; Yerli, S. K.; Keskin, O.
2016-12-01
This document (Eastern Anatolia Observatory (DAG) is the new observatory of Turkey with the optical and near-infrared largest telescope (4 m class) and its robust observing site infrastructure. This national project consists of three phases with DAG (Telescope, Enclosure, Buildings and Infrastructures), FPI (Focal Plane Instruments and Adaptive Optics) and MCP (Mirror Coating Plant) and is supported by the Ministry of Development of Turkey. The tenders of telescope and enclosure have been made and almost all the infrastructure (roads, geological and atmospherical surveys, electricity, fiber optics, cable car, water, generator, etc.) of DAG site (Erzurum/Turkey, 3,170 m altitude) have been completed. This poster is about the recent developments of DAG and about the future possible collaborations for various robotic telescopes which can be set up in DAG site.
ERIC Educational Resources Information Center
Connery, Keely Flynn
2007-01-01
Graphing predictions is especially important in classes where relationships between variables need to be explored and derived. In this article, the author describes how his students sketch the graphs of their predictions before they begin their investigations on two laboratory activities: Distance Versus Time Cart Race Lab and Resistance; and…
Acyclic glycosidopyrroles analogues of ganciclovir: synthesis and biological activity.
Diana, P; Barraja, P; Almerico, A M; Dattolo, G; Mingoia, F; Loi, A G; Congeddu, E; Musiu, C; Putzolu, M; La Colla, P
1997-05-01
Acyclic glycosidopyrroles of type 3 were synthetized in good overall yields, according to the Scheme. When evaluated for antiviral activity against DNA and RNA viruses, only compound in which R1 = R2 = Ph, R3 = NH2 was found to inhibit the HIV-1 replication at concentrations that were not cytotoxic for MT-4 cells.
New acyclic diterpenic acids from yacon (Smallanthus sonchifolius) leaves.
Mercado, María I; Coll Aráoz, María V; Grau, Alfredo; Catalán, César A N
2010-11-01
Two new acyclic diterpenoids, smaditerpenic acid E (1a) and F (2a), along with nineteen melampolide-type sesquiterpene lactones, six of them not previously reported in yacon, were isolated from the methylene chloride leaf rinse extract. Their structures were elucidated from 1D and 2D NMR experiments and gas chromatography coupled to mass spectrometry.
Scenario Graphs and Attack Graphs
2004-04-14
46 6.1 Vulnerability Analysis of a Network . . . . . . . . . . . . . . . . . . . . . . . . . 53 6.2 Sandia Red Team Attack Graph...asymptotic bound. The test machine was a 1Ghz Pentium III with 1GB of RAM, running Red Hat Linux 7.3. Figure 4.1(a) plots running time of the implemen...host scanning tools network information vulnerability Attack Graph network Red
Direct activation of Transient Receptor Potential Vanilloid 1(TRPV1) by Diacylglycerol (DAG)
Woo, Dong Ho; Jung, Sung Jun; Zhu, Mei Hong; Park, Chul-Kyu; Kim, Yong Ho; Oh, Seog Bae; Lee, C Justin
2008-01-01
The capsaicin receptor, known as transient receptor potential channel vanilloid subtype 1 (TRPV1), is activated by a wide range of noxious stimulants and putative ligands such as capsaicin, heat, pH, anandamide, and phosphorylation by protein kinase C (PKC). However, the identity of endogenous activators for TRPV1 under physiological condition is still debated. Here, we report that diacylglycerol (DAG) directly activates TRPV1 channel in a membrane-delimited manner in rat dorsal root ganglion (DRG) neurons. 1-oleoyl-2-acetyl-sn-glycerol (OAG), a membrane-permeable DAG analog, elicited intracellular Ca2+ transients, cationic currents and cobalt uptake that were blocked by TRPV1-selective antagonists, but not by inhibitors of PKC and DAG lipase in rat DRG neurons or HEK 293 cells heterologously expressing TRPV1. OAG induced responses were about one fifth of capsaicin induced signals, suggesting that OAG displays partial agonism. We also found that endogenously produced DAG can activate rat TRPV1 channels. Mutagenesis of rat TRPV1 revealed that DAG-binding site is at Y511, the same site for capsaicin binding, and PtdIns(4,5)P2binding site may not be critical for the activation of rat TRPV1 by DAG in heterologous system. We propose that DAG serves as an endogenous ligand for rat TRPV1, acting as an integrator of Gq/11-coupled receptors and receptor tyrosine kinases that are linked to phospholipase C. PMID:18826653
Sanfilippo, Antonio P.
2005-12-27
Graph theory is a branch of discrete combinatorial mathematics that studies the properties of graphs. The theory was pioneered by the Swiss mathematician Leonhard Euler in the 18th century, commenced its formal development during the second half of the 19th century, and has witnessed substantial growth during the last seventy years, with applications in areas as diverse as engineering, computer science, physics, sociology, chemistry and biology. Graph theory has also had a strong impact in computational linguistics by providing the foundations for the theory of features structures that has emerged as one of the most widely used frameworks for the representation of grammar formalisms.
DaG 1066: A Newfound Anomalous Ureilite with Chondritic Inclusions
NASA Astrophysics Data System (ADS)
Moggi Cecchi, V.; Caporali, S.; Pratesi, G.
2015-07-01
General description, textural, and compositional features of the polymict ureilite DaG 1066, recovered in 1999 in Libya, are provided. The meteorite contains various inclusions, among which almost pure forsterite and enstatite-bearing chondrules.
Adjusting protein graphs based on graph entropy.
Peng, Sheng-Lung; Tsay, Yu-Wei
2014-01-01
Measuring protein structural similarity attempts to establish a relationship of equivalence between polymer structures based on their conformations. In several recent studies, researchers have explored protein-graph remodeling, instead of looking a minimum superimposition for pairwise proteins. When graphs are used to represent structured objects, the problem of measuring object similarity become one of computing the similarity between graphs. Graph theory provides an alternative perspective as well as efficiency. Once a protein graph has been created, its structural stability must be verified. Therefore, a criterion is needed to determine if a protein graph can be used for structural comparison. In this paper, we propose a measurement for protein graph remodeling based on graph entropy. We extend the concept of graph entropy to determine whether a graph is suitable for representing a protein. The experimental results suggest that when applied, graph entropy helps a conformational on protein graph modeling. Furthermore, it indirectly contributes to protein structural comparison if a protein graph is solid.
Test of Graphing and Graph Interpretation Skills.
ERIC Educational Resources Information Center
Hermann, J.
This monograph is a test of graphing and graph interpretation skills which assesses performance on all the skills of graphing which are contained in the AAAS program, Science - A Process Approach. The testing includes construction of bar graphs, interpreting information on graphs, the use of the Cartesian coordinate system, making predictions from…
NASA Astrophysics Data System (ADS)
Beeken, Paul
2014-11-01
Graphing is an essential skill that forms the foundation of any physical science.1 Understanding the relationships between measurements ultimately determines which modeling equations are successful in predicting observations.2 Over the years, science and math teachers have approached teaching this skill with a variety of techniques. For secondary school instruction, the job of graphing skills falls heavily on physics teachers. By virtue of the nature of the topics we cover, it is our mission to develop this skill to the fine art that it is.
Threshold Graph Limits and Random Threshold Graphs
Diaconis, Persi; Holmes, Susan; Janson, Svante
2010-01-01
We study the limit theory of large threshold graphs and apply this to a variety of models for random threshold graphs. The results give a nice set of examples for the emerging theory of graph limits. PMID:20811581
ERIC Educational Resources Information Center
Beeken, Paul
2014-01-01
Graphing is an essential skill that forms the foundation of any physical science. Understanding the relationships between measurements ultimately determines which modeling equations are successful in predicting observations. Over the years, science and math teachers have approached teaching this skill with a variety of techniques. For secondary…
Sukumar, Sreenivas R.; Hong, Seokyong; Lee, Sangkeun; Lim, Seung-Hwan
2016-06-01
GraphBench is a benchmark suite for graph pattern mining and graph analysis systems. The benchmark suite is a significant addition to conducting apples-apples comparison of graph analysis software (databases, in-memory tools, triple stores, etc.)
NASA Astrophysics Data System (ADS)
Warchalowski, Wiktor; Krawczyk, Malgorzata J.
2017-03-01
We found the Lindenmayer systems for line graphs built on selected fractals. We show that the fractal dimension of such obtained graphs in all analysed cases is the same as for their original graphs. Both for the original graphs and for their line graphs we identified classes of nodes which reflect symmetry of the graph.
DAG-TM Concept Element 11 CNS Performance Assessment: ADS-B Performance in the TRACON
NASA Technical Reports Server (NTRS)
Raghavan, Rajesh S.
2004-01-01
Distributed Air/Ground (DAG) Traffic Management (TM) is an integrated operational concept in which flight deck crews, air traffic service providers and aeronautical operational control personnel use distributed decision-making to enable user preferences and increase system capacity, while meeting air traffic management (ATM) safety requirements. It is a possible operational mode under the Free Flight concept outlined by the RTCA Task Force 3. The goal of DAG-TM is to enhance user flexibility/efficiency and increase system capacity, without adversely affecting system safety or restricting user accessibility to the National Airspace System (NAS). DAG-TM will be accomplished with a human-centered operational paradigm enabled by procedural and technological innovations. These innovations include automation aids, information sharing and Communication, Navigation, and Surveillance (CNS) / ATM technologies. The DAG-TM concept is intended to eliminate static restrictions to the maximum extent possible. In this paradigm, users may plan and operate according to their preferences - as the rule rather than the exception - with deviations occurring only as necessary. The DAG-TM concept elements aim to mitigate the extent and impact of dynamic NAS constraints, while maximizing the flexibility of airspace operations
Neural network for graphs: a contextual constructive approach.
Micheli, Alessio
2009-03-01
This paper presents a new approach for learning in structured domains (SDs) using a constructive neural network for graphs (NN4G). The new model allows the extension of the input domain for supervised neural networks to a general class of graphs including both acyclic/cyclic, directed/undirected labeled graphs. In particular, the model can realize adaptive contextual transductions, learning the mapping from graphs for both classification and regression tasks. In contrast to previous neural networks for structures that had a recursive dynamics, NN4G is based on a constructive feedforward architecture with state variables that uses neurons with no feedback connections. The neurons are applied to the input graphs by a general traversal process that relaxes the constraints of previous approaches derived by the causality assumption over hierarchical input data. Moreover, the incremental approach eliminates the need to introduce cyclic dependencies in the definition of the system state variables. In the traversal process, the NN4G units exploit (local) contextual information of the graphs vertices. In spite of the simplicity of the approach, we show that, through the compositionality of the contextual information developed by the learning, the model can deal with contextual information that is incrementally extended according to the graphs topology. The effectiveness and the generality of the new approach are investigated by analyzing its theoretical properties and providing experimental results.
DAG telescope site studies and infrastructure for possible international co-operations
NASA Astrophysics Data System (ADS)
Yerli, Sinan K.; Yeşilyaprak, Cahit; Keskin, Onur; Alis, Sinan
2016-07-01
The selected site for the 4 m DAG (Eastern Anatolian Observatory in Turkish) telescope is at "Karakaya Ridge", at 3170 m altitude (3150 m after summit management). The telescope's optical design is performed by the DAG technical team to allow infrared observation at high angular resolution, with its adaptive optics system to be built in Turkey. In this paper; a brief introduction about DAG telescope design; planned instrumentation; the meteorological data collected from 2008, clear night counts, short-term DIMM observations; current infrastructure to hold auxiliary telescopes; auxiliary buildings to assist operations; the observatory design; and coating unit plans will be presented along with possible collaboration possibilities in terms of instrumentation and science programs.
The a-cycle problem for transverse Ising ring
NASA Astrophysics Data System (ADS)
Dong, Jian-Jun; Li, Peng; Chen, Qi-Hui
2016-11-01
Traditionally, the transverse Ising model is mapped to the fermionic c-cycle problem, which neglects the boundary effect due to thermodynamic limit. If persisting on a perfect periodic boundary condition, we can get a so-called a-cycle problem that has not been treated seriously so far (Lieb et al 1961 Ann. Phys. 16 407). In this work, we show a little surprising but exact result in this respect. We find the odevity of the number of lattice sites, N, in the a-cycle problem plays an unexpected role even in the thermodynamic limit, N\\to ∞ , due to the boundary constraint. We pay special attention to the system with N(\\in Odd)\\to ∞ , which is in contrast to the one with N(\\in Even)\\to ∞ , because the former suffers a ring frustration. As a new effect, we find the ring frustration induces a low-energy gapless spectrum above the ground state. By proving a theorem for a new type of Toeplitz determinant, we demonstrate that the ground state in the gapless region exhibits a peculiar longitudinal spin-spin correlation. The entangled nature of the ground state is also disclosed by the evaluation of its entanglement entropy. At low temperature, new behavior of specific heat is predicted. We also propose an experimental protocol for observing the new phenomenon due to the ring frustration.
Catabolism of citronellol and related acyclic terpenoids in pseudomonads.
Förster-Fromme, Karin; Jendrossek, Dieter
2010-07-01
Terpenes are a huge group of natural compounds characterised by their predominantly pleasant smell. They are built up by isoprene units in cyclic or acyclic form and can be functionalised by carbonyl, hydroxyl or carboxyl groups and by presence of additional carbon-carbon double bonds (terpenoids). Currently, much more than 10,000 terpenoid compounds are known, and many thereof are present in different iso- and stereoforms. Terpenoids are secondary metabolites and can have important biological functions in living organisms. In many cases, the biological functions of terpenoids are not known at all. Nevertheless, terpenoids are used in large quantities as perfumes and aroma compounds for food additives. Terpenoids can be also precursors and building blocks for synthesis of complex chiral compounds in chemical and pharmaceutical industry. Unfortunately, only few terpenoids are available in large quantities at reasonable costs. Therefore, characterisation of suited biocatalysts specific for terpenoid compounds and development of biotransformation processes of abundant terpenoids to commercially interesting derivates becomes more and more important. This minireview summarises knowledge on catabolic pathways and biotransformations of acyclic monoterpenes that have received only little attention. Terpenoids with 20 or more carbon atoms are not a subject of this study.
Observatory building design: a case study of DAG with infrastructure and facilities
NASA Astrophysics Data System (ADS)
Sahmali, Ali Erkan; Yesilyaprak, Cahit; Yerli, Sinan K.; Keskin, Onur
2016-08-01
Eastern Anatolian Observatory (DAG), will be built in one of the well-known mountain ridges of Erzurum, Turkey, at latitude of 39°46'50, longitude of 41°13'35 and an altitude of 3.151 meters. As well as erecting the largest telescope of Turkey, the DAG project aims to establish an observatory complex both small in size and functional enough to give service to all astronomy community. In this paper, the challenge is explained in details: geological and geographical limitations, environmental and meteorological constraints, engineering and structural considerations, energy efficiency and sustainability.
DAG: a new observatory and a prospective observing site for other potential telescopes
NASA Astrophysics Data System (ADS)
Yeşilyaprak, Cahit; Yerli, Sinan K.; Keskin, Onur; Güçsav, B. Bülent
2016-07-01
DAG (Eastern Anatolia Observatory is read as "Doğu Anadolu Gözlemevi" in Turkish) is the newest and largest observatory of Turkey, constructed at an altitude of 3150 m in Konaklı/Erzurum provenience, with an optical and nearinfrared telescope (4 m in diameter) and its robust observing site infrastructure. This national project consists of three main phases: DAG (Telescope, Enclosure, Buildings and Infrastructures), FPI (Focal Plane Instruments and Adaptive Optics) and MCP (Mirror Coating Plant). All these three phases are supported by the Ministry of Development of Turkey and funding is awarded to Atatürk University. Telescope, enclosure and building tenders were completed in 2014, 2015 and 2016, respectively. The final design of telescope, enclosure and building and almost all main infrastructure components of DAG site have been completed; mainly: road work, geological and atmospheric surveys, electric and fiber cabling, water line, generator system, cable car to summit. This poster explains recent developments of DAG project and talks about the future possible collaborations for various telescopes which can be constructed at the site.
Tyrosinase kinetics in epidermal melanocytes: analysis of DAG-PKC-dependent signaling pathway
NASA Astrophysics Data System (ADS)
Stolnitz, Mikhail M.; Peshkova, Anna Y.
2001-05-01
Tyrosinase is the key enzyme of melanogenesis with unusual enzyme kinetics. Protein kinase C plays an important role in regulating of tyrosinase activity. In the paper the mathematical model of PKC-DAG-dependent signal transduction pathway for UV-radiation is presented.
Quantification of TAG and DAG in lesquerella (Physaria fendleri) oil by HPLC and MS
Technology Transfer Automated Retrieval System (TEKTRAN)
Castor oil has many industrial uses because of its high content (90%) of the hydroxy fatty acid, ricinoleic acid (OH1218:19). Lesquerella oil containing lesquerolic acid (Ls, OH1420:111, 56.5%) is potentially useful in industry. Ten diacylglycerols (DAG) and 74 triacylglycerols (TAG) in the seed oil...
Delay estimation in a two-node acyclic network
2009-01-01
Linear measures such as cross-correlation have been used successfully to determine time delays from the given processes. Such an analysis often precedes identifying possible causal relationships between the observed processes. The present study investigates the impact of a positively correlated driver whose correlation function decreases monotonically with lag on the delay estimation in a two-node acyclic network with one and two-delays. It is shown that cross-correlation analysis of the given processes can result in spurious identification of multiple delays between the driver and the dependent processes. Subsequently, delay estimation of increment process as opposed to the original process under certain implicit constraints is explored. Short-range and long-range correlated driver processes along with those of their coarse-grained counterparts are considered. PMID:19214240
ERIC Educational Resources Information Center
Lawes, Jonathan F.
2013-01-01
Graphing polar curves typically involves a combination of three traditional techniques, all of which can be time-consuming and tedious. However, an alternative method--graphing the polar function on a rectangular plane--simplifies graphing, increases student understanding of the polar coordinate system, and reinforces graphing techniques learned…
Enantioselective Pd-catalyzed allylation of acyclic α-fluorinated ketones.
Wang, Wengui; Shen, Haiming; Wan, Xiao-Long; Chen, Qing-Yun; Guo, Yong
2014-07-03
Significant synthetic challenges remain for the asymmetric synthesis of tertiary α-fluoro ketones, which are potentially useful molecules for the development of drugs, agrochemicals, and functional materials. Herein, we describe the development of a method for the catalytic enantioselective synthesis of tertiary α-fluoro ketones via the Tsuji-Trost reaction of racemic acyclic α-fluorinated ketones. Enantioenriched acyclic α-cabonyl tertiary fluorides can be produced with the aid of a palladium/phosphinooxazoline catalyst.
Exact Algorithms for Coloring Graphs While Avoiding Monochromatic Cycles
NASA Astrophysics Data System (ADS)
Talla Nobibon, Fabrice; Hurkens, Cor; Leus, Roel; Spieksma, Frits C. R.
We consider the problem of deciding whether a given directed graph can be vertex partitioned into two acyclic subgraphs. Applications of this problem include testing rationality of collective consumption behavior, a subject in micro-economics. We identify classes of directed graphs for which the problem is easy and prove that the existence of a constant factor approximation algorithm is unlikely for an optimization version which maximizes the number of vertices that can be colored using two colors while avoiding monochromatic cycles. We present three exact algorithms, namely an integer-programming algorithm based on cycle identification, a backtracking algorithm, and a branch-and-check algorithm. We compare these three algorithms both on real-life instances and on randomly generated graphs. We find that for the latter set of graphs, every algorithm solves instances of considerable size within few seconds; however, the CPU time of the integer-programming algorithm increases with the number of vertices in the graph while that of the two other procedures does not. For every algorithm, we also study empirically the transition from a high to a low probability of YES answer as function of a parameter of the problem. For real-life instances, the integer-programming algorithm fails to solve the largest instance after one hour while the other two algorithms solve it in about ten minutes.
Agile development approach for the observatory control software of the DAG 4m telescope
NASA Astrophysics Data System (ADS)
Güçsav, B. Bülent; ćoker, Deniz; Yeşilyaprak, Cahit; Keskin, Onur; Zago, Lorenzo; Yerli, Sinan K.
2016-08-01
Observatory Control Software for the upcoming 4m infrared telescope of DAG (Eastern Anatolian Observatory in Turkish) is in the beginning of its lifecycle. After the process of elicitation-validation of the initial requirements, we have been focused on preparation of a rapid conceptual design not only to see the big picture of the system but also to clarify the further development methodology. The existing preliminary designs for both software (including TCS and active optics control system) and hardware shall be presented here in brief to exploit the challenges the DAG software team has been facing with. The potential benefits of an agile approach for the development will be discussed depending on the published experience of the community and on the resources available to us.
Reducing Response Time Bounds for DAG-Based Task Systems on Heterogeneous Multicore Platforms
2016-01-01
with identical processors . Such complications are impeding advancements in the em- bedded computing industry today. Problem considered herein. In this...the problem at hand. This problem involves the scheduling of real-time data - flows on heterogeneous computational elements (CEs), such as CPUs, digital...signal processors (DSPs), or one of many types of hardware accelerators. Each dataflow is represented by a DAG, the nodes (resp., edges) of which
Structural Interactions within Lithium Salt Solvates. Acyclic Carbonates and Esters
Afroz, Taliman; Seo, D. M.; Han, Sang D.; Boyle, Paul D.; Henderson, Wesley A.
2015-03-06
Solvate crystal structures serve as useful models for the molecular-level interactions within the diverse solvates present in liquid electrolytes. Although acyclic carbonate solvents are widely used for Li-ion battery electrolytes, only three solvate crystal structures with lithium salts are known for these and related solvents. The present work, therefore, reports six lithium salt solvate structures with dimethyl and diethyl carbonate: (DMC)_{2}:LiPF_{6}, (DMC)1:LiCF_{3}SO_{3}, (DMC)_{1/4}:LiBF_{4}, (DEC)_{2}:LiClO_{4}, (DEC)_{1}:LiClO_{4} and (DEC)_{1}:LiCF_{3}SO_{3} and four with the structurally related methyl and ethyl acetate: (MA)_{2}:LiClO_{4}, (MA)_{1}:LiBF_{4}, (EA)_{1}:LiClO_{4} and (EA)_{1}:LiBF_{4}.
The DAG project, a 4m class telescope: the telescope main structure performances
NASA Astrophysics Data System (ADS)
Marchiori, G.; Busatta, A.; Ghedin, L.; Marcuzzi, E.; Manfrin, C.; Battistel, C.; Pirnay, O.; Flebus, Carlo; Yeşilyaprak, C.; Keskin, O.; Yerli, S.
2016-07-01
Dogu Anatolu Gözlemevi (DAG-Eastern Anatolia Observatory) Project is a 4m class optical, near-infrared Telescope and suitable enclosure which will be located at an altitude of 3.170m in Erzurum, Turkey. The DAG telescope is a project fully funded by Turkish Ministry of Development and the Atatürk University of Astrophysics Research Telescope - ATASAM. The Project is being developed by the Belgian company AMOS (project leader), which is also the optics supplier and EIE GROUP, the Telescope Main Structure supplier and responsible for the final site integration. The design of the Telescope Main Structure fits in the EIE TBO Program which aims at developing a Dome/Telescope systemic optimization process for both performances and competitive costs based on previous project commitments like NTT, VLT, VST and ASTRI. The optical Configuration of the DAG Telescope is a Ritchey-Chretien with two Nasmyth foci and a 4m primary thin mirror controlled in shape and position by an Active Optic System. The main characteristics of the Telescope Main Structure are an Altitude-Azimuth light and rigid structure system with Direct Drive Systems for both axis, AZ Hydrostatic Bearing System and Altitude standard bearing system; both axes are equipped with Tape Encoder System. An innovative Control System characterizes the telescope performance.
Intrinsic graph structure estimation using graph Laplacian.
Noda, Atsushi; Hino, Hideitsu; Tatsuno, Masami; Akaho, Shotaro; Murata, Noboru
2014-07-01
A graph is a mathematical representation of a set of variables where some pairs of the variables are connected by edges. Common examples of graphs are railroads, the Internet, and neural networks. It is both theoretically and practically important to estimate the intensity of direct connections between variables. In this study, a problem of estimating the intrinsic graph structure from observed data is considered. The observed data in this study are a matrix with elements representing dependency between nodes in the graph. The dependency represents more than direct connections because it includes influences of various paths. For example, each element of the observed matrix represents a co-occurrence of events at two nodes or a correlation of variables corresponding to two nodes. In this setting, spurious correlations make the estimation of direct connection difficult. To alleviate this difficulty, a digraph Laplacian is used for characterizing a graph. A generative model of this observed matrix is proposed, and a parameter estimation algorithm for the model is also introduced. The notable advantage of the proposed method is its ability to deal with directed graphs, while conventional graph structure estimation methods such as covariance selections are applicable only to undirected graphs. The algorithm is experimentally shown to be able to identify the intrinsic graph structure.
Sheriff, Sulaiman; Kadeer, Nijiati; Friend, Lou Ann; James, J Howard; Alexander, J Wesley; Balasubramaniam, Ambikaipakan
2014-10-01
Critical illness, including burn injury, results in elevated plasma lactate levels. Dysregulation of PI3K/Akt signaling has been shown to play a predominant role in the inactivation of skeletal muscle PDC and, hence, in hyperlactacidemia in rat models of sepsis and endotoxemia. This observation, and our previous finding that DAG can reverse burn-induced skeletal muscle proteolysis through the activation of PI3K/Akt pathway, led us to hypothesize that DAG may also attenuate hyperlactacidemia in burn injury. Our investigations revealed that burn injury significantly elevated both skeletal muscle lactate production and plasma lactate levels. Moreover, this was accompanied in skeletal muscle by a 5-7 fold increase in mRNA expression of pyruvate dehydrogenase kinases (PDK) 2 and 4, and a ∼30% reduction in PDC activity. DAG treatment of burn rats completely normalized not only the mRNA expression of the PDKs and PDC activity, but also hyperlactacidemia within 24h of burn injury. DAG also normalized epinephrine-induced lactate production by isolated skeletal muscles from normal rats. Moreover, DAG also improved survival in a lethal rat model of burn trauma. These findings with DAG may have clinical implications because chances of survival for critically ill patients are greatly improved if plasma lactate levels are normalized within 24h of injury.
Chattopadhyay, Ava; Förster-Fromme, Karin; Jendrossek, Dieter
2010-04-01
Growth of Pseudomonas aeruginosa on acyclic terpene alcohols such as geraniol depends on the presence of the atuRABCDEFGH gene cluster and a functional acyclic terpene utilisation (Atu) pathway. The proteins encoded by the atu gene cluster are necessary but not sufficient for growth on acyclic terpenes. Comparative 2-dimensional polyacrylamide gel electrophoresis of soluble P. aeruginosa proteins revealed the presence of an additional spot (besides Atu proteins) that is specifically expressed in geraniol cells but is absent in isovalerate-grown cells. The spot was identified as PA1982 gene product a pyrroloquinoline quinone (PQQ) dependent ethanol oxidoreductase (QEDH). Inactivation of PA1982 by insertion mutagenesis resulted in inability of the mutant to utilise ethanol and in reduced growth on geraniol. Growth on ethanol was restored by transferring an intact copy of the PA1982 gene into the mutant. The PA1982 gene product was purified from recombinant Escherichia coli and revealed PQQ-dependent oxidoreductase activity with a variety of substrates including acyclic terpene derivates at comparable V(max)-values. Our results show that QEDH participates in oxidation of acyclic terpene derivates in addition to the well-known function in ethanol metabolism.
On molecular graph comparison.
Melo, Jenny A; Daza, Edgar
2011-06-01
Since the last half of the nineteenth century, molecular graphs have been present in several branches of chemistry. When used for molecular structure representation, they have been compared after mapping the corresponding graphs into mathematical objects. However, direct molecular comparison of molecular graphs is a research field less explored. The goal of this mini-review is to show some distance and similarity coefficients which were proposed to directly compare molecular graphs or which could be useful to do so.
Graphing Inequalities, Connecting Meaning
ERIC Educational Resources Information Center
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…
ERIC Educational Resources Information Center
Reading Teacher, 2012
2012-01-01
The "Toolbox" column features content adapted from ReadWriteThink.org lesson plans and provides practical tools for classroom teachers. This issue's column features a lesson plan adapted from "Graphing Plot and Character in a Novel" by Lisa Storm Fink and "Bio-graph: Graphing Life Events" by Susan Spangler. Students retell biographic events…
NASA Astrophysics Data System (ADS)
Ma, Da; Hettiarachchi, Gaya; Nguyen, Duc; Zhang, Ben; Wittenberg, James B.; Zavalij, Peter Y.; Briken, Volker; Isaacs, Lyle
2012-06-01
The solubility characteristics of 40-70% of new drug candidates are so poor that they cannot be formulated on their own, so new methods for increasing drug solubility are highly prized. Here, we describe a new class of general-purpose solubilizing agents—acyclic cucurbituril-type containers—which increase the solubility of ten insoluble drugs by a factor of between 23 and 2,750 by forming container-drug complexes. The containers exhibit low in vitro toxicity in human liver, kidney and monocyte cell lines, and outbred Swiss Webster mice tolerate high doses of the container without sickness or weight loss. Paclitaxel solubilized by the acyclic cucurbituril-type containers kills cervical and ovarian cancer cells more efficiently than paclitaxel alone. The acyclic cucurbituril-type containers preferentially bind cationic and aromatic drugs, but also solubilize neutral drugs such as paclitaxel, and represent an attractive extension of cyclodextrin-based technology for drug solubilization and delivery.
Some biochemical properties of an acyclic oligonucleotide analogue. A plausible ancestor of the DNA?
NASA Astrophysics Data System (ADS)
Merle, Liliane; Spach, Gérard; Merle, Yves; Sági, János; Szemzö, Attila
1993-04-01
As acyclic oligonucleotides have been suggested as a primitive model of DNA or RNA in prebiotic times, we compared some biochemical properties of these analogues to that of natural ones. Firstly, an acyclic analogue of deoxyribonucleoside triphosphates was tested as a potential substrate of enzymes intervening in nucleic acids synthesis. GlyTTP, a dTTP analogue with a missing 2'-methylene group is notaccepted as a substrate by either DNA polymerase or deoxynucleotidyl terminal transferase (TdT). Secondly, themodified dodecathymidylate (GlyT)12, the racemic acyclic sugar analogue of (dT)12, proved to be anefficient primer for DNA polymerase and TdT, though the associative properties of (GlyT)12 are very weak as shown by UV spectroscopy in phosphate buffer without magnesium chloride. But (GlyT)12 has the advantage to be 500-times more stable against hydrolysis by snake venom phosphodiesterase than the corresponding oligothymidylate.
Wong, Pak C.; Mackey, Patrick S.; Perrine, Kenneth A.; Foote, Harlan P.; Thomas, James J.
2008-12-23
Methods for visualizing a graph by automatically drawing elements of the graph as labels are disclosed. In one embodiment, the method comprises receiving node information and edge information from an input device and/or communication interface, constructing a graph layout based at least in part on that information, wherein the edges are automatically drawn as labels, and displaying the graph on a display device according to the graph layout. In some embodiments, the nodes are automatically drawn as labels instead of, or in addition to, the label-edges.
Acyclic monoterpenes in tree essential oils as a shrinking agent for waste-expanded polystyrene.
Shimotori, Yasutaka; Hattori, Kazuyuki; Aoyama, Masakazu; Miyakoshi, Tetsuo
2011-01-01
We examined the dissolution of polystyrene (PS) into acyclic monoterpenes present in tree essential oils, to develop an environmentally friendly shrinking agent for waste-expanded polystyrene (EPS). The dissolving powers of geranyl acetate, geranylacetone, and geranyl formate [221.8-241.2 g PS (100 g solvent)(-1)] compared favorably with that of (R)-limonene [181.7 g PS (100 g solvent)(-1)]. Their favorable dissolving powers for PS can be explained by their flexible linear structures, which may be more accessible to the inside of bulk PS compared with cyclic monoterpenes. These acyclic monoterpenes and PS were recovered almost quantitatively by simple steam distillation of the PS solution.
Ogata, Aya; Maeda, Yusuke; Ueno, Yoshihito
2017-04-01
The synthesis of oligonucleotide (ON) analogs, which can be used as antisense molecules, has recently gained much attention. Here, we report the synthesis and properties of an ON analog containing acyclic thymidine and cytidine analogs with a 4-pentyl-1,2-diol instead of the d-ribofuranose moiety. The incorporation of these analogs into the ON improved its nuclease resistance to 3'-exonucleases. Furthermore, it was found that the incorporation of the acyclic thymidine analog into a DNA/RNA duplex accelerates the RNA cleavage of a DNA/RNA duplex by Escherichia coli RNase H.
Diagnostic Analyzer for Gearboxes (DAG): User's Guide. Version 3.1 for Microsoft Windows 3.1
NASA Technical Reports Server (NTRS)
Jammu, Vinay B.; Kourosh, Danai
1997-01-01
This documentation describes the Diagnostic Analyzer for Gearboxes (DAG) software for performing fault diagnosis of gearboxes. First, the user would construct a graphical representation of the gearbox using the gear, bearing, shaft, and sensor tools contained in the DAG software. Next, a set of vibration features obtained by processing the vibration signals recorded from the gearbox using a signal analyzer is required. Given this information, the DAG software uses an unsupervised neural network referred to as the Fault Detection Network (FDN) to identify the occurrence of faults, and a pattern classifier called Single Category-Based Classifier (SCBC) for abnormality scaling of individual vibration features. The abnormality-scaled vibration features are then used as inputs to a Structure-Based Connectionist Network (SBCN) for identifying faults in gearbox subsystems and components. The weights of the SBCN represent its diagnostic knowledge and are derived from the structure of the gearbox graphically presented in DAG. The outputs of SBCN are fault possibility values between 0 and 1 for individual subsystems and components in the gearbox with a 1 representing a definite fault and a 0 representing normality. This manual describes the steps involved in creating the diagnostic gearbox model, along with the options and analysis tools of the DAG software.
Topics in networks: Community detection, random graphs, and network epidemiology
NASA Astrophysics Data System (ADS)
Karrer, Brian C.
In this dissertation, we present research on several topics in networks including community detection, random graphs, and network epidemiology. Traditional stochastic blockmodels may produce inaccurate fits to complex networks with heterogeneous degree distributions and we devise a degree-corrected block-model that alleviates this problematic behavior. The resulting objective function for community detection using the degree-corrected version outperforms the traditional model at finding communities on a variety of real-world and synthetic tests. Then we study a different generative model that associates communities to the edges of the network and naturally includes overlapping vertex communities. We create a fast and accurate algorithm to fit this model to empirical networks and show that it can be used to quickly find non-overlapping communities as well. We also develop random graph models for directed acyclic graphs, a class of networks including family trees and citation networks. We argue that the lack of cycles comes from an ordering constraint and then generalize the configuration model to incorporate this constraint. We calculate many properties of these models and demonstrate that sonic of the model predictions agree quite well with real-world networks, emphasizing the importance of vertex ordering to generating directed acyclic networks with realistic properties. Finally, we examine the spread of disease over networks, starting with a simple model of two diseases spreading with cross-immunity, where infection by one disease makes an individual immune to the other disease and vice versa. Utilizing a timescale separation argument, we map the system to consecutive bond percolation, one disease spreading after the other. The resulting phase diagram includes discontinuous and continuous phase transitions and a coexistence region where both diseases can spread to a substantial fraction of the population. Then we analyze a flexible susceptible
Some acyclic analogues of nucleotides and their template-directed reactions
NASA Technical Reports Server (NTRS)
Tohidi, Mahrokh; Orgel, Leslie E.
1989-01-01
Bismonophosphoimidazolides of acyclic analogues of guanosine IV and adenosine V were synthesized. They undergo oligomerization in the presence of complementary polynucleotide templates. Details of their synthesis and their subsequent template- and nontemplate-directed reactions are described, and their possible relevance to the origin of life is discussed.
Robinson, Sean W.; Mustoe, Chantal L.; White, Nicholas G.; ...
2014-12-05
The synthesis and anion binding properties of novel halogen-bonding (XB) bis-iodotriazole-pyridinium-containing acyclic and [2]catenane anion host systems are described. The XB acyclic receptor displays selectivity for acetate over halides with enhanced anion recognition properties compared to the analogous hydrogen-bonding (HB) acyclic receptor. A reversal in halide selectivity is observed in the XB [2]catenane, in comparison to the acyclic XB receptor, due to the interlocked host’s unique three-dimensional binding cavity, and no binding is observed for oxoanions. Notable halide anion association constant values determined for the [2]catenane in competitive organic–aqueous solvent mixtures demonstrate considerable enhancement of anion recognition as compared tomore » the HB catenane analogue. X-ray crystallographic analysis of a series of halide catenane complexes reveal strong XB interactions in the solid state. These interactions were studied using Cl and Br K-edge X-ray Absorption Spectroscopy (XAS) indicating intense pre-edge features characteristic of charge transfer from the halide to its bonding partner (σAX←X–* ← X1s), and providing a direct measure of the degree of covalency in the halogen bond(s). Lastly, the data reveal that the degree of covalency is similar to that which is observed in transition metal coordinate covalent bonds. These results are supported by DFT results, which correlate well with the experimental data.« less
Robinson, Sean W.; Mustoe, Chantal L.; White, Nicholas G.; Brown, Asha; Thompson, Amber L.; Kennepohl, Pierre; Beer, Paul D.
2014-12-05
The synthesis and anion binding properties of novel halogen-bonding (XB) bis-iodotriazole-pyridinium-containing acyclic and [2]catenane anion host systems are described. The XB acyclic receptor displays selectivity for acetate over halides with enhanced anion recognition properties compared to the analogous hydrogen-bonding (HB) acyclic receptor. A reversal in halide selectivity is observed in the XB [2]catenane, in comparison to the acyclic XB receptor, due to the interlocked host’s unique three-dimensional binding cavity, and no binding is observed for oxoanions. Notable halide anion association constant values determined for the [2]catenane in competitive organic–aqueous solvent mixtures demonstrate considerable enhancement of anion recognition as compared to the HB catenane analogue. X-ray crystallographic analysis of a series of halide catenane complexes reveal strong XB interactions in the solid state. These interactions were studied using Cl and Br K-edge X-ray Absorption Spectroscopy (XAS) indicating intense pre-edge features characteristic of charge transfer from the halide to its bonding partner (σ_{AX←X–}* ← X1s), and providing a direct measure of the degree of covalency in the halogen bond(s). Lastly, the data reveal that the degree of covalency is similar to that which is observed in transition metal coordinate covalent bonds. These results are supported by DFT results, which correlate well with the experimental data.
NASA Astrophysics Data System (ADS)
Jana, Atish Dipankar; Saha, Rajat; Mostafa, Golam
2010-03-01
The 1D chain complex [{Cu(II)(bpp)(malonate)(H 2O)}(H 2O) 4] n ( 1) (bpp = 1,3-bis(4-pyridyl)propane) self-assembles to form a 2D ribbed sheet stabilized by an acyclic pentameric water cluster, which in turn, influences the conformation of the bpp ligand.
Acyclic sulfides, garlicnins L-1-L-4, E, and F, from Allium sativum.
Nohara, Toshihiro; Fujiwara, Yukio; Ikeda, Tsuyoshi; Yamaguchi, Koki; Manabe, Hideyuki; Murakami, Kotaro; Ono, Masateru; Nakano, Daisuke; Kinjo, Junei
2014-01-01
Six novel acyclic sulfides, named garlicnins L-1-L-4 (1-4), E (5), and F (6), were isolated from the acetone extracts, with the ability to suppress M2 macrophage activation, of the bulbs of garlic (Allium sativum L.), and their chemical structures were characterized.
NASA Technical Reports Server (NTRS)
Lieberman, R. N.
1972-01-01
Given a directed graph, a natural topology is defined and relationships between standard topological properties and graph theoretical concepts are studied. In particular, the properties of connectivity and separatedness are investigated. A metric is introduced which is shown to be related to separatedness. The topological notions of continuity and homeomorphism. A class of maps is studied which preserve both graph and topological properties. Applications involving strong maps and contractions are also presented.
Recognition of Probe Ptolemaic Graphs
NASA Astrophysics Data System (ADS)
Chang, Maw-Shang; Hung, Ling-Ju
Let G denote a graph class. An undirected graph G is called a probe G graph if one can make G a graph in G by adding edges between vertices in some independent set of G. By definition graph class G is a subclass of probe G graphs. Ptolemaic graphs are chordal and induced gem free. They form a subclass of both chordal graphs and distance-hereditary graphs. Many problems NP-hard on chordal graphs can be solved in polynomial time on ptolemaic graphs. We proposed an O(nm)-time algorithm to recognize probe ptolemaic graphs where n and m are the numbers of vertices and edges of the input graph respectively.
Lothian, Josh; Powers, Sarah S; Sullivan, Blair D; Baker, Matthew B; Schrock, Jonathan; Poole, Stephen W
2013-12-01
The benchmarking effort within the Extreme Scale Systems Center at Oak Ridge National Laboratory seeks to provide High Performance Computing benchmarks and test suites of interest to the DoD sponsor. The work described in this report is a part of the effort focusing on graph generation. A previously developed benchmark, SystemBurn, allowed the emulation of dierent application behavior profiles within a single framework. To complement this effort, similar capabilities are desired for graph-centric problems. This report examines existing synthetic graph generator implementations in preparation for further study on the properties of their generated synthetic graphs.
Frishman, Yaniv; Tal, Ayellet
2008-01-01
This paper presents an algorithm for drawing a sequence of graphs online. The algorithm strives to maintain the global structure of the graph and thus the user's mental map, while allowing arbitrary modifications between consecutive layouts. The algorithm works online and uses various execution culling methods in order to reduce the layout time and handle large dynamic graphs. Techniques for representing graphs on the GPU allow a speedup by a factor of up to 17 compared to the CPU implementation. The scalability of the algorithm across GPU generations is demonstrated. Applications of the algorithm to the visualization of discussion threads in Internet sites and to the visualization of social networks are provided.
Jerome, A.; Srivastava, S. K.; Sharma, R. K.
2016-01-01
This research was conducted to study the follicular dynamics, hormonal, biochemical profile and fertility response in acyclic and norgestomet+PMSG treated acyclic buffaloes in summer. The study animals were divided into two groups: group I [control (n=8): no treatment] and II [treatment group (n=15)]. In group II, seven animals were used for follicular biochemical and hormonal profile and eight animals for fertility studies following Crestar® (Intervet, France) treatment (day 0: Crestar® insertion; day 8: 500 IU PMSG; day 9: Crestar® removal; day 11 AI). Follicular fluid stradiol (E2) and progesterone (P4) in acyclic and pre-ovulatory follicle in study groups was significantly (P<0.01) higher than peripheral level. Peripheral E2 concentration, during pre-ovulatory period in group II was higher (P<0.05) than group I. Significant correlation between serum and follicular E2 was deduced (r=0.888; P<0.01) as significant difference in serum cholesterol content was shown between groups. Lower follicular total protein (P<0.05) in acyclic animals and higher follicular glucose (P<0.05) in treated group were concluded. Significant correlation (r=-0.770; P<0.05) was observed between follicular cholesterol and triglycerides. Follicular characteristics, post PMSG administration, differed significantly (0.83 ± 0.20 vs 1.32 ± 0.12; P<0.01) in all buffaloes exhibiting estrus, out of which four conceived. In conclusion, follicular hormonal and biochemical profile exhibits alteration in protein and glucose level between summer acyclic and treated buffaloes. However, peripheral E2 along with fertility response showed significant difference (P<0.01) between the study groups with significant correlation in E2, cholesterol and triglycerides between peripheral and follicular compartment. PMID:28224008
Dow, T L; Brown, J L
2012-01-01
African elephants of reproductive age in zoos are experiencing high rates of ovarian cycle problems (>40%) and low reproductive success. Previously, our laboratory found that 1/3 of acyclic females exhibit hyperprolactinaemia, a likely cause of ovarian dysfunction. This follow-up study re-examined hyperprolactinaemia in African elephants and found the problem has increased significantly to 71% of acyclic females. Circulating serum progestagens and prolactin were analysed in 31 normal cycling, 13 irregular cycling and 31 acyclic elephants for 12 months. In acyclic females, overall mean prolactin concentrations differed from cycling females (P < 0.05), with concentrations being either higher (n = 22; 54.90 ± 13.31 ngmL(-1)) or lower (n = 9; 6.47 ± 1.73 ngmL(-1)) than normal. No temporal patterns of prolactin secretion were evident in elephants that lacked progestagen cycles. In cycling females, prolactin was secreted in a cyclical manner, with higher concentrations observed during nonluteal (34.38 ± 1.77 and 32.75 ± 2.61 ngmL(-1)) than luteal (10.51 ± 0.30 and 9.67 ± 0.42 ngmL(-1)) phases for normal and irregular females, respectively. Of most concern was that over two-thirds of acyclic females now are hyperprolactinemic, a dramatic increase over that observed 7 years earlier. Furthermore, females of reproductive age constituted 45% of elephants with hyperprolactinaemia. Until the cause of this problem is identified and a treatment is developed, reproductive rates will remain suboptimal and the population nonsustaining.
Graphs, matrices, and the GraphBLAS: Seven good reasons
Kepner, Jeremy; Bader, David; Buluç, Aydın; ...
2015-01-01
The analysis of graphs has become increasingly important to a wide range of applications. Graph analysis presents a number of unique challenges in the areas of (1) software complexity, (2) data complexity, (3) security, (4) mathematical complexity, (5) theoretical analysis, (6) serial performance, and (7) parallel performance. Implementing graph algorithms using matrix-based approaches provides a number of promising solutions to these challenges. The GraphBLAS standard (istcbigdata.org/GraphBlas) is being developed to bring the potential of matrix based graph algorithms to the broadest possible audience. The GraphBLAS mathematically defines a core set of matrix-based graph operations that can be used to implementmore » a wide class of graph algorithms in a wide range of programming environments. This paper provides an introduction to the GraphBLAS and describes how the GraphBLAS can be used to address many of the challenges associated with analysis of graphs.« less
Graphs, matrices, and the GraphBLAS: Seven good reasons
Kepner, Jeremy; Bader, David; Buluç, Aydın; Gilbert, John; Mattson, Timothy; Meyerhenke, Henning
2015-01-01
The analysis of graphs has become increasingly important to a wide range of applications. Graph analysis presents a number of unique challenges in the areas of (1) software complexity, (2) data complexity, (3) security, (4) mathematical complexity, (5) theoretical analysis, (6) serial performance, and (7) parallel performance. Implementing graph algorithms using matrix-based approaches provides a number of promising solutions to these challenges. The GraphBLAS standard (istcbigdata.org/GraphBlas) is being developed to bring the potential of matrix based graph algorithms to the broadest possible audience. The GraphBLAS mathematically defines a core set of matrix-based graph operations that can be used to implement a wide class of graph algorithms in a wide range of programming environments. This paper provides an introduction to the GraphBLAS and describes how the GraphBLAS can be used to address many of the challenges associated with analysis of graphs.
Integrated opto-dynamic modeling of the 4m DAG telescope image quality performance
NASA Astrophysics Data System (ADS)
Zago, Lorenzo; Guex, Benjamin; Yesilyaprak, Cahit; Yerli, Sinan K.; Keskin, Onur
2016-08-01
The Turkish DAG 4-m telescope is currently through the final design stage. It is to be located on a 3170 m mountain top in Eastern Anatolia. The telescope will be a state-of-the art device, alt-az mount with active primary and adjustable secondary and tertiary mirrors. Its optics design is specially aimed at being compatible with advance adaptive optics instrumentation. The ultimate performance of such a telescope results of multiple concurrent effects from many different components and active functions of the complex system. The paper presents a comprehensive integrated (end-to-end) model of the telescope, comprising in one computational sequence all structural, electrodynamics and oactive optics performance that produce the image quality at the focal plane. The model is entirely programmed in Matlab/Simulink and comprises a finite element model of structure and mirrors, dynamics modal reduction, deformation analyses of structural and optical elements, active optics feedback control in the Zernike modal space.
Property Graph vs RDF Triple Store: A Comparison on Glycan Substructure Search
Alocci, Davide; Mariethoz, Julien; Horlacher, Oliver; Bolleman, Jerven T.; Campbell, Matthew P.; Lisacek, Frederique
2015-01-01
Resource description framework (RDF) and Property Graph databases are emerging technologies that are used for storing graph-structured data. We compare these technologies through a molecular biology use case: glycan substructure search. Glycans are branched tree-like molecules composed of building blocks linked together by chemical bonds. The molecular structure of a glycan can be encoded into a direct acyclic graph where each node represents a building block and each edge serves as a chemical linkage between two building blocks. In this context, Graph databases are possible software solutions for storing glycan structures and Graph query languages, such as SPARQL and Cypher, can be used to perform a substructure search. Glycan substructure searching is an important feature for querying structure and experimental glycan databases and retrieving biologically meaningful data. This applies for example to identifying a region of the glycan recognised by a glycan binding protein (GBP). In this study, 19,404 glycan structures were selected from GlycomeDB (www.glycome-db.org) and modelled for being stored into a RDF triple store and a Property Graph. We then performed two different sets of searches and compared the query response times and the results from both technologies to assess performance and accuracy. The two implementations produced the same results, but interestingly we noted a difference in the query response times. Qualitative measures such as portability were also used to define further criteria for choosing the technology adapted to solving glycan substructure search and other comparable issues. PMID:26656740
Property Graph vs RDF Triple Store: A Comparison on Glycan Substructure Search.
Alocci, Davide; Mariethoz, Julien; Horlacher, Oliver; Bolleman, Jerven T; Campbell, Matthew P; Lisacek, Frederique
2015-01-01
Resource description framework (RDF) and Property Graph databases are emerging technologies that are used for storing graph-structured data. We compare these technologies through a molecular biology use case: glycan substructure search. Glycans are branched tree-like molecules composed of building blocks linked together by chemical bonds. The molecular structure of a glycan can be encoded into a direct acyclic graph where each node represents a building block and each edge serves as a chemical linkage between two building blocks. In this context, Graph databases are possible software solutions for storing glycan structures and Graph query languages, such as SPARQL and Cypher, can be used to perform a substructure search. Glycan substructure searching is an important feature for querying structure and experimental glycan databases and retrieving biologically meaningful data. This applies for example to identifying a region of the glycan recognised by a glycan binding protein (GBP). In this study, 19,404 glycan structures were selected from GlycomeDB (www.glycome-db.org) and modelled for being stored into a RDF triple store and a Property Graph. We then performed two different sets of searches and compared the query response times and the results from both technologies to assess performance and accuracy. The two implementations produced the same results, but interestingly we noted a difference in the query response times. Qualitative measures such as portability were also used to define further criteria for choosing the technology adapted to solving glycan substructure search and other comparable issues.
ERIC Educational Resources Information Center
Hirsch, Christian R.
1975-01-01
Using a set of worksheets, students will discover and apply Euler's formula regarding connected planar graphs and play and analyze the game of Sprouts. One sheet leads to the discovery of Euler's formula; another concerns traversability of a graph; another gives an example and a game involving these ideas. (Author/KM)
ERIC Educational Resources Information Center
Lind, Joy; Narayan, Darren
2009-01-01
We present the topic of graph connectivity along with a famous theorem of Menger in the real-world setting of the national computer network infrastructure of "National LambdaRail". We include a set of exercises where students reinforce their understanding of graph connectivity by analysing the "National LambdaRail" network. Finally, we give…
Caetano, Tibério S; McAuley, Julian J; Cheng, Li; Le, Quoc V; Smola, Alex J
2009-06-01
As a fundamental problem in pattern recognition, graph matching has applications in a variety of fields, from computer vision to computational biology. In graph matching, patterns are modeled as graphs and pattern recognition amounts to finding a correspondence between the nodes of different graphs. Many formulations of this problem can be cast in general as a quadratic assignment problem, where a linear term in the objective function encodes node compatibility and a quadratic term encodes edge compatibility. The main research focus in this theme is about designing efficient algorithms for approximately solving the quadratic assignment problem, since it is NP-hard. In this paper we turn our attention to a different question: how to estimate compatibility functions such that the solution of the resulting graph matching problem best matches the expected solution that a human would manually provide. We present a method for learning graph matching: the training examples are pairs of graphs and the 'labels' are matches between them. Our experimental results reveal that learning can substantially improve the performance of standard graph matching algorithms. In particular, we find that simple linear assignment with such a learning scheme outperforms Graduated Assignment with bistochastic normalisation, a state-of-the-art quadratic assignment relaxation algorithm.
ERIC Educational Resources Information Center
Petrosino, Anthony
2012-01-01
This article responds to arguments by Skidmore and Thompson (this issue of "Educational Researcher") that a graph published more than 10 years ago was erroneously reproduced and "gratuitously damaged" perceptions of the quality of education research. After describing the purpose of the original graph, the author counters assertions that the graph…
ERIC Educational Resources Information Center
Shen, Ji
2009-01-01
In the Walking Out Graphs Lesson described here, students experience several types of representations used to describe motion, including words, sentences, equations, graphs, data tables, and actions. The most important theme of this lesson is that students have to understand the consistency among these representations and form the habit of…
Graphing from Everyday Experience.
ERIC Educational Resources Information Center
Carraher, David; Schliemann, Analucia; Nemirousky, Ricardo
1995-01-01
Discusses the importance of teaching grounded in the everyday experiences and concerns of the learners. Studies how people with limited school experience can understand graphs and concludes that individuals with limited academic education can clarify the role of everyday experiences in learning about graphs. (ASK)
ERIC Educational Resources Information Center
Johnson, Millie
1997-01-01
Graphs from media sources and questions developed from them can be used in the middle school mathematics classroom. Graphs depict storage temperature on a milk carton; air pressure measurements on a package of shock absorbers; sleep-wake patterns of an infant; a dog's breathing patterns; and the angle, velocity, and radius of a leaning bicyclist…
ERIC Educational Resources Information Center
Doto, Julianne; Golbeck, Susan
2007-01-01
Collecting data and analyzing the results of experiments is difficult for children. The authors found a surprising way to help their third graders make graphs and draw conclusions from their data: digital photographs. The pictures bridged the gap between an abstract graph and the plants it represented. With the support of the photos, students…
Evolutionary stability on graphs
Ohtsuki, Hisashi; Nowak, Martin A.
2008-01-01
Evolutionary stability is a fundamental concept in evolutionary game theory. A strategy is called an evolutionarily stable strategy (ESS), if its monomorphic population rejects the invasion of any other mutant strategy. Recent studies have revealed that population structure can considerably affect evolutionary dynamics. Here we derive the conditions of evolutionary stability for games on graphs. We obtain analytical conditions for regular graphs of degree k > 2. Those theoretical predictions are compared with computer simulations for random regular graphs and for lattices. We study three different update rules: birth-death (BD), death-birth (DB), and imitation (IM) updating. Evolutionary stability on sparse graphs does not imply evolutionary stability in a well-mixed population, nor vice versa. We provide a geometrical interpretation of the ESS condition on graphs. PMID:18295801
DagSolid: a new Geant4 solid class for fast simulation in polygon-mesh geometry.
Han, Min Cheol; Kim, Chan Hyeong; Jeong, Jong Hwi; Yeom, Yeon Soo; Kim, SungHoon; Wilson, Paul P H; Apostolakis, John
2013-07-07
Even though a computer-aided design (CAD)-based geometry can be directly implemented in Geant4 as polygon-mesh using the G4TessellatedSolid class, the computation speed becomes very slow, especially when the geometry is composed of a large number of facets. To address this problem, in the present study, a new Geant4 solid class, named DagSolid, was developed based on the direct accelerated geometry for the Monte Carlo (DAGMC) library which provides the ray-tracing acceleration algorithm functions. To develop the DagSolid class, the new solid class was derived from the G4VSolid class, and its ray-tracing functions were linked to the corresponding functions of the DAGMC library. The results of this study show that the use of the DagSolid class drastically improves the computation speed. The improvement was more significant when there were more facets, meaning that the DagSolid class can be used more effectively for complicated geometries with many facets than for simple geometries. The maximum difference of computation speed was 1562 and 680 times for Geantino and ChargedGeantino, respectively. For real particles (gammas, electrons, neutrons, and protons), the difference of computation speed was less significant, but still was within the range of 53-685 times depending on the type of beam particles simulated.
Lozano, María Luisa; Cook, Aaron; Bastida, José María; Paul, David S; Iruin, Gemma; Cid, Ana Rosa; Adan-Pedroso, Rosa; Ramón González-Porras, José; Hernández-Rivas, Jesús María; Fletcher, Sarah J; Johnson, Ben; Morgan, Neil; Ferrer-Marin, Francisca; Vicente, Vicente; Sondek, John; Watson, Steve P; Bergmeier, Wolfgang; Rivera, José
2016-09-01
In addition to mutations in ITG2B or ITGB3 genes that cause defective αIIbβ3 expression and/or function in Glanzmann's thrombasthenia patients, platelet dysfunction can be a result of genetic variability in proteins that mediate inside-out activation of αIIbβ3 The RASGRP2 gene is strongly expressed in platelets and neutrophils, where its encoded protein CalDAG-GEFI facilitates the activation of Rap1 and subsequent activation of integrins. We used next-generation sequencing (NGS) and whole-exome sequencing (WES) to identify 2 novel function-disrupting mutations in RASGRP2 that account for bleeding diathesis and platelet dysfunction in 2 unrelated families. By using a panel of 71 genes, we identified a homozygous change (c.1142C>T) in exon 10 of RASGRP2 in a 9-year-old child of Chinese origin (family 1). This variant led to a p.Ser381Phe substitution in the CDC25 catalytic domain of CalDAG-GEFI. In 2 Spanish siblings from family 2, WES identified a nonsense homozygous variation (c.337C>T) (p.Arg113X) in exon 5 of RASGRP2 CalDAG-GEFI expression was markedly reduced in platelets from all patients, and by using a novel in vitro assay, we found that the nucleotide exchange activity was dramatically reduced in CalDAG-GEFI p.Ser381Phe. Platelets from homozygous patients exhibited agonist-specific defects in αIIbβ3 integrin activation and aggregation. In contrast, α- and δ-granule secretion, platelet spreading, and clot retraction were not markedly affected. Integrin activation in the patients' neutrophils was also impaired. These patients are the first cases of a CalDAG-GEFI deficiency due to homozygous RASGRP2 mutations that are linked to defects in both leukocyte and platelet integrin activation.
Lozano, María Luisa; Cook, Aaron; Bastida, José María; Paul, David S.; Iruin, Gemma; Cid, Ana Rosa; Adan-Pedroso, Rosa; Ramón González-Porras, José; Hernández-Rivas, Jesús María; Fletcher, Sarah J.; Johnson, Ben; Morgan, Neil; Ferrer-Marin, Francisca; Vicente, Vicente; Sondek, John; Watson, Steve P.; Bergmeier, Wolfgang
2016-01-01
In addition to mutations in ITG2B or ITGB3 genes that cause defective αIIbβ3 expression and/or function in Glanzmann’s thrombasthenia patients, platelet dysfunction can be a result of genetic variability in proteins that mediate inside-out activation of αIIbβ3. The RASGRP2 gene is strongly expressed in platelets and neutrophils, where its encoded protein CalDAG-GEFI facilitates the activation of Rap1 and subsequent activation of integrins. We used next-generation sequencing (NGS) and whole-exome sequencing (WES) to identify 2 novel function-disrupting mutations in RASGRP2 that account for bleeding diathesis and platelet dysfunction in 2 unrelated families. By using a panel of 71 genes, we identified a homozygous change (c.1142C>T) in exon 10 of RASGRP2 in a 9-year-old child of Chinese origin (family 1). This variant led to a p.Ser381Phe substitution in the CDC25 catalytic domain of CalDAG-GEFI. In 2 Spanish siblings from family 2, WES identified a nonsense homozygous variation (c.337C>T) (p.Arg113X) in exon 5 of RASGRP2. CalDAG-GEFI expression was markedly reduced in platelets from all patients, and by using a novel in vitro assay, we found that the nucleotide exchange activity was dramatically reduced in CalDAG-GEFI p.Ser381Phe. Platelets from homozygous patients exhibited agonist-specific defects in αIIbβ3 integrin activation and aggregation. In contrast, α- and δ-granule secretion, platelet spreading, and clot retraction were not markedly affected. Integrin activation in the patients’ neutrophils was also impaired. These patients are the first cases of a CalDAG-GEFI deficiency due to homozygous RASGRP2 mutations that are linked to defects in both leukocyte and platelet integrin activation. PMID:27235135
Rives, Arnaud; Baglai, Iaroslav; Malytskyi, Volodymyr; Maraval, Valérie; Saffon-Merceron, Nathalie; Voitenko, Zoia; Chauvin, Remi
2012-09-11
A series of stable quadrupolar bis(p-aminophenyl)-carbo-benzenes, featuring both donor-donor-donor π-frustration and central macro-aromaticity, is described and compared to the acyclic dibutatrienylacetylene (DBA) reference series.
The Effect of Using Graphing Calculators in Complex Function Graphs
ERIC Educational Resources Information Center
Ocak, Mehmet Akif
2008-01-01
This study investigates the role of graphing calculators in multiple representations for knowledge transfer and the omission of oversimplification in complex function graphs. The main aim is to examine whether graphing calculators were used efficiently to see different cases and multiple perspectives among complex function graphs, or whether…
Asymptote Misconception on Graphing Functions: Does Graphing Software Resolve It?
ERIC Educational Resources Information Center
Öçal, Mehmet Fatih
2017-01-01
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…
Boto, Alicia; Hernández, Dácil; Hernández, Rosendo; Alvarez, Eleuterio
2007-12-07
The design of processes which combine tandem and sequential reactions allows the transformation of readily available precursors into high-profit products. This strategy is illustrated by the one-pot synthesis of acyclic nucleosides, which are potential antiviral compounds, from readily available carbohydrates. The reaction conditions are mild, compatible with most functional groups. Depending on the starting sugar, both common and uncommon acyclic chains can be prepared. These polyhydroxylated chains can be combined with different bases to generate diversity.
Weber, Evelyne; Seifert, Alexander; Antonovici, Mihaela; Geinitz, Christopher; Pleiss, Jürgen; Urlacher, Vlada B
2011-01-21
A minimal enriched P450 BM3 library was screened for the ability to oxidize inert cyclic and acyclic alkanes. The F87A/A328V mutant was found to effectively hydroxylate cyclooctane, cyclodecane and cyclododecane. F87V/A328F with high activity towards cyclooctane hydroxylated acyclic n-octane to 2-(R)-octanol (46% ee) with high regioselectivity (92%).
Khan, F A; Das, G K; Pande, Megha; Sarkar, M; Mahapatra, R K; Shankar, Uma
2012-01-01
Ovarian acyclicity is one of the most important causes of infertility in water buffalo. Recent studies have indicated alterations in the composition of follicular fluid during the condition. The aim of this study was to determine the changes in follicular fluid concentrations of estradiol, progesterone and insulin during ovarian acyclicity in water buffalo. Ovaries were collected from 50 acyclic and 95 cyclic (control) buffaloes and follicular fluid was aspirated from small (5.0-6.9 mm), medium (7.0-9.9 mm) and large (≥10.0 mm) sized follicles. Estradiol concentration was lower (P<0.0001) in acyclic (1.4 ± 0.09 ng/ml) than in cyclic (3.3 ± 0.18 ng/ml) buffaloes. Regardless of the ovarian cyclic status, there was an increase (P<0.01) in estradiol concentration with the increase in follicle size; the mean concentrations were 2.4 ± 0.16 ng/ml, 2.8 ± 0.29 ng/ml and 3.5 ± 0.41 ng/ml in small, medium and large follicles, respectively. A higher (P<0.001) progesterone concentration was recorded in acyclic (24.3 ± 2.61 ng/ml) compared to the cyclic (7.6 ± 0.79 ng/ml) group. Furthermore, acyclic buffaloes had a lower (P<0.05) concentration of insulin in the follicular fluid than that of cyclic buffaloes (15.2 ± 1.55 μIU/ml versus 25.9 ± 2.78 μIU/ml, respectively). In conclusion, acyclic buffaloes have lower concentrations of estradiol and insulin concurrent with higher concentrations of progesterone in the follicular fluid. These hormonal changes in the follicular microenvironment are possibly a manifestation of the disturbances in the normal follicular development leading to anovulation and anestrus in acyclic buffaloes.
Enantioselective Heck arylations of acyclic alkenyl alcohols using a redox-relay strategy.
Werner, Erik W; Mei, Tian-Sheng; Burckle, Alexander J; Sigman, Matthew S
2012-12-14
Progress in the development of asymmetric Heck couplings of arenes and acyclic olefins has been limited by a tenuous understanding of the factors that dictate selectivity in migratory insertion and β-hydride elimination. On the basis of key mechanistic insight recently garnered in the exploration of selective Heck reactions, we report here an enantioselective variant that delivers β-, γ-, or δ-aryl carbonyl products from acyclic alkenol substrates. The catalyst system imparts notable regioselectivity during migratory insertion and promotes the migration of the alkene's unsaturation toward the alcohol to ultimately form the ketone product. The reaction uses aryldiazonium salts as the arene source, yields enantiomeric products from opposite starting alkene configurations, and uses a readily accessible ligand. The racemic nature of the alkenol substrate does not bias the enantioselection.
Acyclic ketones in the defensive secretion of a "daddy longlegs" (Leiobunum vittatum).
Meinwald, J; Kluge, A F; Carrel, J E; Eisner, T
1971-07-01
The defensive secretion of the "daddy longlegs" Leiobunum vittatum was analyzed and found to contain the acyclic ketones 4-methylheptan-3-one and E-4,6-dimethyl-6-octen-3-one as its major organic components. Although 4-methylheptan-3-one has been found previously as an alarm substance in certain ant genera, the second component, whose structure is confirmed by synthesis, is new.
Burioni, Raffaella; Chibbaro, Sergio; Vergni, Davide; Vulpiani, Angelo
2012-11-01
We study reaction-diffusion processes on graphs through an extension of the standard reaction-diffusion equation starting from first principles. We focus on reaction spreading, i.e., on the time evolution of the reaction product M(t). At variance with pure diffusive processes, characterized by the spectral dimension d{s}, the important quantity for reaction spreading is found to be the connectivity dimension d{l}. Numerical data, in agreement with analytical estimates based on the features of n independent random walkers on the graph, show that M(t)∼t{d{l}}. In the case of Erdös-Renyi random graphs, the reaction product is characterized by an exponential growth M(t)e{αt} with α proportional to ln(k), where (k) is the average degree of the graph.
A Semantic Graph Query Language
Kaplan, I L
2006-10-16
Semantic graphs can be used to organize large amounts of information from a number of sources into one unified structure. A semantic query language provides a foundation for extracting information from the semantic graph. The graph query language described here provides a simple, powerful method for querying semantic graphs.
Assortativity of complementary graphs
NASA Astrophysics Data System (ADS)
Wang, H.; Winterbach, W.; van Mieghem, P.
2011-09-01
Newman's measure for (dis)assortativity, the linear degree correlationρD, is widely studied although analytic insight into the assortativity of an arbitrary network remains far from well understood. In this paper, we derive the general relation (2), (3) and Theorem 1 between the assortativity ρD(G) of a graph G and the assortativityρD(Gc) of its complement Gc. Both ρD(G) and ρD(Gc) are linearly related by the degree distribution in G. When the graph G(N,p) possesses a binomial degree distribution as in the Erdős-Rényi random graphs Gp(N), its complementary graph Gpc(N) = G1-p(N) follows a binomial degree distribution as in the Erdős-Rényi random graphs G1-p(N). We prove that the maximum and minimum assortativity of a class of graphs with a binomial distribution are asymptotically antisymmetric: ρmax(N,p) = -ρmin(N,p) for N → ∞. The general relation (3) nicely leads to (a) the relation (10) and (16) between the assortativity range ρmax(G)-ρmin(G) of a graph with a given degree distribution and the range ρmax(Gc)-ρmin(Gc) of its complementary graph and (b) new bounds (6) and (15) of the assortativity. These results together with our numerical experiments in over 30 real-world complex networks illustrate that the assortativity range ρmax-ρmin is generally large in sparse networks, which underlines the importance of assortativity as a network characterizer.
Commuting projections on graphs
Vassilevski, Panayot S.; Zikatanov, Ludmil T.
2013-02-19
For a given (connected) graph, we consider vector spaces of (discrete) functions defined on its vertices and its edges. These two spaces are related by a discrete gradient operator, Grad and its adjoint, ₋Div, referred to as (negative) discrete divergence. We also consider a coarse graph obtained by aggregation of vertices of the original one. Then a coarse vertex space is identified with the subspace of piecewise constant functions over the aggregates. We consider the ℓ_{2}-projection Q_{H} onto the space of these piecewise constants. In the present paper, our main result is the construction of a projection π _{H} from the original edge-space onto a properly constructed coarse edge-space associated with the edges of the coarse graph. The projections π _{H} and Q_{H} commute with the discrete divergence operator, i.e., we have div π _{H} = Q_{H} div. The respective pair of coarse edge-space and coarse vertexspace offer the potential to construct two-level, and by recursion, multilevel methods for the mixed formulation of the graph Laplacian which utilizes the discrete divergence operator. The performance of one two-level method with overlapping Schwarz smoothing and correction based on the constructed coarse spaces for solving such mixed graph Laplacian systems is illustrated on a number of graph examples.
a Graph Based Model for the Detection of Tidal Channels Using Marked Point Processes
NASA Astrophysics Data System (ADS)
Schmidt, A.; Rottensteiner, F.; Soergel, U.; Heipke, C.
2015-08-01
In this paper we propose a new method for the automatic extraction of tidal channels in digital terrain models (DTM) using a sampling approach based on marked point processes. In our model, the tidal channel system is represented by an undirected, acyclic graph. The graph is iteratively generated and fitted to the data using stochastic optimization based on a Reversible Jump Markov Chain Monte Carlo (RJMCMC) sampler and simulated annealing. The nodes of the graph represent junction points of the channel system and the edges straight line segments with a certain width in between. In each sampling step, the current configuration of nodes and edges is modified. The changes are accepted or rejected depending on the probability density function for the configuration which evaluates the conformity of the current status with a pre-defined model for tidal channels. In this model we favour high DTM gradient magnitudes at the edge borders and penalize a graph configuration consisting of non-connected components, overlapping segments and edges with atypical intersection angles. We present the method of our graph based model and show results for lidar data, which serve of a proof of concept of our approach.
Clique graphs and overlapping communities
NASA Astrophysics Data System (ADS)
Evans, T. S.
2010-12-01
It is shown how to construct a clique graph in which properties of cliques of a fixed order in a given graph are represented by vertices in a weighted graph. Various definitions and motivations for these weights are given. The detection of communities or clusters is used to illustrate how a clique graph may be exploited. In particular a benchmark network is shown where clique graphs find the overlapping communities accurately while vertex partition methods fail.
Actinomycetal complex of light sierozem on the Kopet-Dag piedmont plain
NASA Astrophysics Data System (ADS)
Zenova, G. M.; Zvyagintsev, D. G.; Manucharova, N. A.; Stepanova, O. A.; Chernov, I. Yu.
2016-10-01
The population density of actinomycetes in the samples of light sierozem from the Kopet Dag piedmont plain (75 km from Ashkhabad, Turkmenistan) reaches hundreds of thousand CFU/g soil. The actinomycetal complex is represented by two genera: Streptomyces and Micromonospora. Representatives of the Streptomyces genus predominate and comprise 73 to 87% of the actinomycetal complex. In one sample, representatives of the Micromonospora genus predominated in the complex (75%). The Streptomyces genus in the studied soil samples is represented by the species from several sections and series: the species of section Helvolo-Flavus series Helvolus represent the dominant component of the streptomycetal complex; their portion is up to 77% of all isolated actinomycetes. The species of other sections and series are much less abundant. Thus, the percentage of the Cinereus Achromogenes section in the actinomycetal complex does not exceed 28%; representatives of the Albus section Albus series, Roseus section Lavendulae-Roseus series, and Imperfectus section belong to rare species; they have been isolated not from all the studied samples of light sierozem, and their portion does not exceed 10% of the actinomycetal complex.
Proxy Graph: Visual Quality Metrics of Big Graph Sampling.
Nguyen, Quan-Hoang; Hong, Seok-Hee; Eades, Peter; Meidiana, Amyra
2017-02-24
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.
Higher-order graph wavelets and sparsity on circulant graphs
NASA Astrophysics Data System (ADS)
Kotzagiannidis, Madeleine S.; Dragotti, Pier Luigi
2015-08-01
The notion of a graph wavelet gives rise to more advanced processing of data on graphs due to its ability to operate in a localized manner, across newly arising data-dependency structures, with respect to the graph signal and underlying graph structure, thereby taking into consideration the inherent geometry of the data. In this work, we tackle the problem of creating graph wavelet filterbanks on circulant graphs for a sparse representation of certain classes of graph signals. The underlying graph can hereby be data-driven as well as fixed, for applications including image processing and social network theory, whereby clusters can be modelled as circulant graphs, respectively. We present a set of novel graph wavelet filter-bank constructions, which annihilate higher-order polynomial graph signals (up to a border effect) defined on the vertices of undirected, circulant graphs, and are localised in the vertex domain. We give preliminary results on their performance for non-linear graph signal approximation and denoising. Furthermore, we provide extensions to our previously developed segmentation-inspired graph wavelet framework for non-linear image approximation, by incorporating notions of smoothness and vanishing moments, which further improve performance compared to traditional methods.
Optimized Graph Search Using Multi-Level Graph Clustering
NASA Astrophysics Data System (ADS)
Kala, Rahul; Shukla, Anupam; Tiwari, Ritu
Graphs find a variety of use in numerous domains especially because of their capability to model common problems. The social networking graphs that are used for social networking analysis, a feature given by various social networking sites are an example of this. Graphs can also be visualized in the search engines to carry search operations and provide results. Various searching algorithms have been developed for searching in graphs. In this paper we propose that the entire network graph be clustered. The larger graphs are clustered to make smaller graphs. These smaller graphs can again be clustered to further reduce the size of graph. The search is performed on the smallest graph to identify the general path, which may be further build up to actual nodes by working on the individual clusters involved. Since many searches are carried out on the same graph, clustering may be done once and the data may be used for multiple searches over the time. If the graph changes considerably, only then we may re-cluster the graph.
Subdominant pseudoultrametric on graphs
Dovgoshei, A A; Petrov, E A
2013-08-31
Let (G,w) be a weighted graph. We find necessary and sufficient conditions under which the weight w:E(G)→R{sup +} can be extended to a pseudoultrametric on V(G), and establish a criterion for the uniqueness of such an extension. We demonstrate that (G,w) is a complete k-partite graph, for k≥2, if and only if for any weight that can be extended to a pseudoultrametric, among all such extensions one can find the least pseudoultrametric consistent with w. We give a structural characterization of graphs for which the subdominant pseudoultrametric is an ultrametric for any strictly positive weight that can be extended to a pseudoultrametric. Bibliography: 14 titles.
Chen, J.; Safro, I.
2011-01-01
Measuring the connection strength between a pair of vertices in a graph is one of the most important concerns in many graph applications. Simple measures such as edge weights may not be sufficient for capturing the effects associated with short paths of lengths greater than one. In this paper, we consider an iterative process that smooths an associated value for nearby vertices, and we present a measure of the local connection strength (called the algebraic distance; see [D. Ron, I. Safro, and A. Brandt, Multiscale Model. Simul., 9 (2011), pp. 407-423]) based on this process. The proposed measure is attractive in that the process is simple, linear, and easily parallelized. An analysis of the convergence property of the process reveals that the local neighborhoods play an important role in determining the connectivity between vertices. We demonstrate the practical effectiveness of the proposed measure through several combinatorial optimization problems on graphs and hypergraphs.
Khan, Firdous Ahmad; Das, Goutam Kumar
2012-01-01
The objective of this study was to examine the follicular characteristics and intrafollicular concentrations of nitric oxide and ascorbic acid during ovarian acyclicity in buffaloes. Ovaries were collected from 56 acyclic and 95 cyclic buffaloes at slaughter, surface follicle number was counted and follicles were classified into small (5.0-6.9 mm), medium (7.0-9.9 mm), and large (≥ 10.0 mm) size categories based on their diameter. Follicular fluid was aspirated and assayed for nitric oxide, ascorbic acid, estradiol, and progesterone. Acyclic buffaloes had a higher (P<0.05) number of medium-sized follicles and a lower (P<0.001) number of large follicles than the cyclic ones. In acyclic animals, the number of large follicles was lower (P<0.01) than in medium size category which in turn was lower (P<0.001) than the number of small follicles. In contrast, the number of medium and large follicles was not different (P>0.05) in the cyclic control. However, the number of small-sized follicles was higher (P<0.001) compared to the other two categories. The incidence of large-sized follicles was lower (P<0.05) in acyclic buffalo population compared to the cyclic control. Evaluation of estrogenic status demonstrated that all the follicles of acyclic buffaloes are estrogen-inactive (E (2)/P (4) ratio<1). Small- and medium-sized follicles of acyclic buffaloes had higher concentrations of nitric oxide (P<0.05 and P<0.001, respectively) and lower concentrations of ascorbic acid (P<0.05 and P<0.01, respectively) than the corresponding size estrogen-active follicles of their cyclic counterparts. In conclusion, this study indicates that follicular development continues during acyclicity in buffaloes. Although follicles in some acyclic buffaloes attain a size corresponding to morphological dominance, they are unable to achieve functional dominance, perhaps due to an altered balance of intrafollicular nitric oxide and ascorbic acid and, as a result, these follicles instead of
1990-03-01
returns from a frequency swept microwave signal centred on the ship being measured. Each data set consists of 255 equally spaced points which represent...overlaid one over the other, or split into three windows where the hard black-lined top graph is the back chart and the thinner-lined lower graph is the...Borland’s Turbo Pascal Version 1.0 (Borland 1986) to edit and compile the main source code. Menu details, window specification, dialogue box and item
Graphing Calculator Mini Course
NASA Technical Reports Server (NTRS)
Karnawat, Sunil R.
1996-01-01
The "Graphing Calculator Mini Course" project provided a mathematically-intensive technologically-based summer enrichment workshop for teachers of American Indian students on the Turtle Mountain Indian Reservation. Eleven such teachers participated in the six-day workshop in summer of 1996 and three Sunday workshops in the academic year. The project aimed to improve science and mathematics education on the reservation by showing teachers effective ways to use high-end graphing calculators as teaching and learning tools in science and mathematics courses at all levels. In particular, the workshop concentrated on applying TI-82's user-friendly features to understand the various mathematical and scientific concepts.
Graph ensemble boosting for imbalanced noisy graph stream classification.
Pan, Shirui; Wu, Jia; Zhu, Xingquan; Zhang, Chengqi
2015-05-01
Many applications involve stream data with structural dependency, graph representations, and continuously increasing volumes. For these applications, it is very common that their class distributions are imbalanced with minority (or positive) samples being only a small portion of the population, which imposes significant challenges for learning models to accurately identify minority samples. This problem is further complicated with the presence of noise, because they are similar to minority samples and any treatment for the class imbalance may falsely focus on the noise and result in deterioration of accuracy. In this paper, we propose a classification model to tackle imbalanced graph streams with noise. Our method, graph ensemble boosting, employs an ensemble-based framework to partition graph stream into chunks each containing a number of noisy graphs with imbalanced class distributions. For each individual chunk, we propose a boosting algorithm to combine discriminative subgraph pattern selection and model learning as a unified framework for graph classification. To tackle concept drifting in graph streams, an instance level weighting mechanism is used to dynamically adjust the instance weight, through which the boosting framework can emphasize on difficult graph samples. The classifiers built from different graph chunks form an ensemble for graph stream classification. Experiments on real-life imbalanced graph streams demonstrate clear benefits of our boosting design for handling imbalanced noisy graph stream.
On the Sequential Nature of Unification.
1984-03-01
lWhon Dar Entored) _ REPORT DOCUMENTATION PAGE READ INSTRUCTIONS SRPRDCM TTBEFORE COMPLETING FORM I. REPORT NUMUER12. GOVT ACCESO NSREIPIENT’S...Terms may be represented using directed acyclic graphs with labeled nodes and, possibly. multiple labelled arcs. A labeled 4directed graph is a finite...G in linear time and logarithmic space. Moreover, the site of a simple dag. measured in number of nodes and arcs, is within a consant multiplicative
Jubeli, Emile; Maginty, Amanda B; Abdul Khalique, Nada; Raju, Liji; Abdulhai, Mohamad; Nicholson, David G; Larsen, Helge; Pungente, Michael D; Goldring, William P D
2015-10-01
Previously we reported the synthesis and in vitro evaluation of four novel, short-chain cationic lipid gene delivery vectors, characterized by acyclic or macrocyclic hydrophobic regions composed of, or derived from, two 7-carbon chains. Herein we describe a revised synthesis of an expanded library of related cationic lipids to include extended chain analogues, their formulation with plasmid DNA (pDNA) and in vitro delivery into Chinese hamster ovarian (CHO-K1) cells. The formulations were evaluated against each other based on structural differences in the hydrophobic domain and headgroup. Structurally the library is divided into four sets based on lipids derived from two 7- or two 11-carbon hydrophobic chains, C7 and C11 respectively, which possess either a dimethylamine or a trimethylamine derived headgroup. Each set includes four cationic lipids based on an acyclic or macrocyclic, saturated or unsaturated hydrophobic domain. All lipids were co-formulated with the commercial cationic lipid 1,2-dimyristoyl-sn-glycero-3-ethylphosphocholine (EPC) in a 1:1 molar ratio, along with one of two distinct neutral co-lipids, cholesterol or 1,2-dioleoyl-sn-glycero-3-phosphoethanolamine (DOPE) in an overall cationic-to-neutral lipid molar ratio of 3:2. Binding of lipid formulations with DNA, and packing morphology associated with the individual lipid-DNA complexes were characterized by gel electrophoresis and small angle X-ray diffraction (SAXD), respectively. As a general trend, lipoplex formulations based on mismatched binary cationic lipids, composed of a shorter C7 lipid and the longer lipid EPC (C14), were generally associated with higher transfection efficiency and lower cytotoxicity than their more closely matched C11/EPC binary lipid formulation counterparts. Furthermore, the cyclic lipids gave transfection levels as high as or greater than their acyclic counterparts, and formulations with cholesterol exhibited higher transfection and lower cytotoxicity than those
Clinch, Keith; Crump, Douglas R.; Evans, Gary B.; Hazleton, Keith Z.; Mason, Jennifer M.; Schramm, Vern L.
2013-01-01
The pathogenic protozoa responsible for malaria lack enzymes for the de novo synthesis of purines and rely on purine salvage from the host. In Plasmodium falciparum (Pf), hypoxanthine-guanine-xanthine phosphoribosyltransferase (HGXPRT) converts hypoxanthine to inosine monophosphate and is essential for purine salvage making the enzyme an anti-malarial drug target. We have synthesized a number of simple acyclic aza-C- nucleosides and shown that some are potent inhibitors of Pf HGXPRT while showing excellent selectivity for the Pf versus the human enzyme. PMID:23810424
ERIC Educational Resources Information Center
Sokol, William
In this autoinstructional packet, the student is given an experimental situation which introduces him to the process of graphing. The lesson is presented for secondary school students in chemistry. Algebra I and a Del Mod System program (indicated as SE 018 020) are suggested prerequisites for the use of this program. Behavioral objectives are…
ERIC Educational Resources Information Center
Pitts Bannister, Vanessa R.; Jamar, Idorenyin; Mutegi, Jomo W.
2007-01-01
In this article, the learning progress of one fifth-grade student is examined with regard to the development of her graph interpretation skills as she participated in the Junior Science Institute (JSI), a two-week, science intensive summer camp in which participants engaged in microbiology research and application. By showcasing the student's…
Simmons, G.J.
1985-01-01
Given a graph G and an ordering phi of the vertices, V(G), we define a parsimonious proper coloring (PPC) of V(G) under phi to be a proper coloring of V(G) in the order phi, where a new color is introduced only when a vertex cannot be properly colored in its order with any of the colors already used.
2013-02-19
This library is used in several LLNL projects, including STAT (the Stack Trace Analysis Tool for scalable debugging) and some modules in P^nMPI (a tool MPI tool infrastructure). It can also be used standalone for creating and manipulationg graphs, but its API is primarily tuned to support these other projects
Coloring geographical threshold graphs
Bradonjic, Milan; Percus, Allon; Muller, Tobias
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.
ERIC Educational Resources Information Center
Nemirovsky, Ricardo; Tierney, Cornelia; Wright, Tracy
1998-01-01
Analyzed two children's use of a computer-based motion detector to make sense of symbolic expressions (Cartesian graphs). Found three themes: (1) tool perspectives, efforts to understand graphical responses to body motion; (2) fusion, emergent ways of talking and behaving that merge symbols and referents; and (3) graphical spaces, when changing…
ERIC Educational Resources Information Center
Donley, H. Edward; George, Elizabeth Ann
1993-01-01
Demonstrates how to construct rational, exponential, and sinusoidal functions that appear normal on one scale but exhibit interesting hidden behavior when viewed on another scale. By exploring these examples, students learn the importance of scale, window size, and resolution effects in computer and calculator graphing. (MAZ)
ERIC Educational Resources Information Center
Krueger, Tom
2010-01-01
In this article, the author shares one effective lesson idea on straight line graphs that he applied in his lower ability Y9 class. The author wanted something interesting for his class to do, something that was fun and engaging with direct feedback, and something that worked because someone else had tried it before. In a word, the author admits…
Temporal Representation in Semantic Graphs
Levandoski, J J; Abdulla, G M
2007-08-07
A wide range of knowledge discovery and analysis applications, ranging from business to biological, make use of semantic graphs when modeling relationships and concepts. Most of the semantic graphs used in these applications are assumed to be static pieces of information, meaning temporal evolution of concepts and relationships are not taken into account. Guided by the need for more advanced semantic graph queries involving temporal concepts, this paper surveys the existing work involving temporal representations in semantic graphs.
Quantum walks on quotient graphs
Krovi, Hari; Brun, Todd A.
2007-06-15
A discrete-time quantum walk on a graph {gamma} 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.
Zhang, Liangxiao; Fan, Wei; Cao, Dongsheng; Zeng, Maomao; Xiao, Hongbin; Liang, Yizeng
2012-03-30
Neutral losses are a type of important variables in mass spectral interpretation. Since it is hard to calculate or extract neutral losses from mass spectra, they are usually discarded. In this study, dissimilarity analysis was employed to extract mass spectral characteristics for predicting branching degree of acyclic alkenes. The relationships between branching degree and neutral loss were constructed under direction of experimental observation and mass spectral fragmentations. A branching degree predictor of acyclic alkenes was subsequently built based on the above relationships. After tested by the experimental data in previous studies, the predictor could correctly provide the branching degree from abundant ions of mass spectra. More importantly, this predictor was able to point out which acyclic alkenes could be predicted correctly or not.
Recursive Feature Extraction in Graphs
2014-08-14
ReFeX extracts recursive topological features from graph data. The input is a graph as a csv file and the output is a csv file containing feature values for each node in the graph. The features are based on topological counts in the neighborhoods of each nodes, as well as recursive summaries of neighbors' features.
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.
Mining and Indexing Graph Databases
ERIC Educational Resources Information Center
Yuan, Dayu
2013-01-01
Graphs are widely used to model structures and relationships of objects in various scientific and commercial fields. Chemical molecules, proteins, malware system-call dependencies and three-dimensional mechanical parts are all modeled as graphs. In this dissertation, we propose to mine and index those graph data to enable fast and scalable search.…
ERIC Educational Resources Information Center
Hopkins, Brian
2004-01-01
The interconnected world of actors and movies is a familiar, rich example for graph theory. This paper gives the history of the "Kevin Bacon Game" and makes extensive use of a Web site to analyze the underlying graph. The main content is the classroom development of the weighted average to determine the best choice of "center" for the graph. The…
ERIC Educational Resources Information Center
Skurnick, Ronald; Davi, Charles; Skurnick, Mia
2005-01-01
Since 1952, several well-known graph theorists have proven numerous results regarding Hamiltonian graphs. In fact, many elementary graph theory textbooks contain the theorems of Ore, Bondy and Chvatal, Chvatal and Erdos, Posa, and Dirac, to name a few. In this note, the authors state and prove some propositions of their own concerning Hamiltonian…
Winlaw, Manda; De Sterck, Hans; Sanders, Geoffrey
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.
A novel acyclic oligomycin A derivative formed via retro-aldol rearrangement of oligomycin A.
Lysenkova, Lyudmila N; Turchin, Konstantin F; Korolev, Alexander M; Bykov, Evgenyi E; Danilenko, Valery N; Bekker, Olga B; Trenin, Alexey S; Elizarov, Sergei M; Dezhenkova, Lyubov G; Shtil, Alexander A; Preobrazhenskaya, Maria N
2012-08-01
The antibiotic oligomycin A in the presence of K(2)CO(3) and n-Bu(4)NHSO(4) in chloroform in phase-transfer conditions afforded a novel derivative through the initial retro-aldol fragmentation of the 8,9 bond, followed by further transformation of the intermediate aldehyde. NMR, MS and quantum chemical calculations showed that the novel compound is the acyclic oligomycin A derivative, in which the 8,9 carbon bond is disrupted and two polyfunctional branches are connected with spiroketal moiety in positions C-23 and C-25. The tri-O-acetyl derivative of the novel derivative was prepared. The acyclic oligomycin A derivative retained the ability to induce apoptosis in tumor cells at low micromolar concentrations, whereas its antimicrobial potencies decreased substantially. The derivative virtually lost the inhibitory activity against F(0)F(1) ATP synthase-containing proteoliposomes, strongly suggesting the existence of the target(s) beyond F(0)F(1) ATP synthase that is important for the antitumor potency of oligomycin A.
NASA Astrophysics Data System (ADS)
Small, Meagan C.; Aytenfisu, Asaminew H.; Lin, Fang-Yu; He, Xibing; MacKerell, Alexander D.
2017-02-01
The majority of computer simulations exploring biomolecular function employ Class I additive force fields (FF), which do not treat polarization explicitly. Accordingly, much effort has been made into developing models that go beyond the additive approximation. Development and optimization of the Drude polarizable FF has yielded parameters for selected lipids, proteins, DNA and a limited number of carbohydrates. The work presented here details parametrization of aliphatic aldehydes and ketones (viz. acetaldehyde, propionaldehyde, butaryaldehyde, isobutaryaldehyde, acetone, and butanone) as well as their associated acyclic sugars (uc(d)-allose and uc(d)-psicose). LJ parameters are optimized targeting experimental heats of vaporization and molecular volumes, while the electrostatic parameters are optimized targeting QM water interactions, dipole moments, and molecular polarizabilities. Bonded parameters are targeted to both QM and crystal survey values, with the models for ketones and aldehydes shown to be in good agreement with QM and experimental target data. The reported heats of vaporization and molecular volumes represent a compromise between the studied model compounds. Simulations of the model compounds show an increase in the magnitude and the fluctuations of the dipole moments in moving from gas phase to condensed phases, which is a phenomenon that the additive FF is intrinsically unable to reproduce. The result is a polarizable model for aliphatic ketones and aldehydes including the acyclic sugars uc(d)-allose and uc(d)-psicose, thereby extending the available biomolecules in the Drude polarizable FF.
Orthocomplemented complete lattices and graphs
NASA Astrophysics Data System (ADS)
Ollech, Astrid
1995-08-01
The problem I consider originates from Dörfler, who found a construction to assign an Orthocomplemented lattice H(G) to a graph G. By Dörfler it is known that for every finite Orthocomplemented lattice L there exists a graph G such that H(G)=L. Unfortunately, we can find more than one graph G with this property, i.e., orthocomplemented lattices which belong to different graphs can be isomorphic. I show some conditions under which two graphs have the same orthocomplemented lattice.
Spectral fluctuations of quantum graphs
Pluhař, Z.; Weidenmüller, H. A.
2014-10-15
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.
2010-12-02
evaluating the function ΘP (A) for any fixed A,P is equivalent to solving the so-called Quadratic Assignment Problem ( QAP ), and thus we can employ various...tractable linear programming, spectral, and SDP relaxations of QAP [40, 11, 33]. In particular we discuss recent work [14] on exploiting group...symmetry in SDP relaxations of QAP , which is useful for approximately computing elementary convex graph invariants in many interesting cases. Finally in
ERIC Educational Resources Information Center
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…
Zhou, Feng; de la Torre, Fernando
2015-11-19
Graph matching (GM) is a fundamental problem in computer science, and it plays a central role to solve correspondence problems in computer vision. GM problems that incorporate pairwise constraints can be formulated as a quadratic assignment problem (QAP). Although widely used, solving the correspondence problem through GM has two main limitations: (1) the QAP is NP-hard and difficult to approximate; (2) GM algorithms do not incorporate geometric constraints between nodes that are natural in computer vision problems. To address aforementioned problems, this paper proposes factorized graph matching (FGM). FGM factorizes the large pairwise affinity matrix into smaller matrices that encode the local structure of each graph and the pairwise affinity between edges. Four are the benefits that follow from this factorization: (1) There is no need to compute the costly (in space and time) pairwise affinity matrix; (2) The factorization allows the use of a path-following optimization algorithm, that leads to improved optimization strategies and matching performance; (3) Given the factorization, it becomes straight-forward to incorporate geometric transformations (rigid and non-rigid) to the GM problem. (4) Using a matrix formulation for the GM problem and the factorization, it is easy to reveal commonalities and differences between different GM methods. The factorization also provides a clean connection with other matching algorithms such as iterative closest point; Experimental results on synthetic and real databases illustrate how FGM outperforms state-of-the-art algorithms for GM. The code is available at http://humansensing.cs.cmu.edu/fgm.
Lung segmentation with graph cuts: Graph size versus performance
NASA Astrophysics Data System (ADS)
Pazokifard, Banafsheh; Sowmya, Arcot
2013-10-01
The effect of graph size on segmentation performance and speed is investigated, where segmentation is based on the graph cuts algorithm. The study is performed on lung extraction in 50 complete multi detector computed tomography (MDCT) datasets, and a fully automatic procedure. The experiments were performed on different graph sizes for both 2-D (4 and 8 neighbours) and 3-D (6 and 26 neighbours) graphs. Five slices from each segmented dataset were compared to the reference delineation provided by a radiologist. Our evaluations highlight the fact that when medical image segmentation is performed using graph cuts, increasing graph and neighbourhood connection size does not necessarily improve the segmentation performance, but also increase the running time dramatically.
Evaluation of Graph Pattern Matching Workloads in Graph Analysis Systems
Hong, Seokyong; Lee, Sangkeun; Lim, Seung-Hwan; Sukumar, Sreenivas Rangan; Vatsavai, Raju
2016-01-01
Graph analysis has emerged as a powerful method for data scientists to represent, integrate, query, and explore heterogeneous data sources. As a result, graph data management and mining became a popular area of research, and led to the development of plethora of systems in recent years. Unfortunately, the number of emerging graph analysis systems and the wide range of applications, coupled with a lack of apples-to-apples comparisons, make it difficult to understand the trade-offs between different systems and the graph operations for which they are designed. A fair comparison of these systems is a challenging task for the following reasons: multiple data models, non-standardized serialization formats, various query interfaces to users, and diverse environments they operate in. To address these key challenges, in this paper we present a new benchmark suite by extending the Lehigh University Benchmark (LUBM) to cover the most common capabilities of various graph analysis systems. We provide the design process of the benchmark, which generalizes the workflow for data scientists to conduct the desired graph analysis on different graph analysis systems. Equipped with this extended benchmark suite, we present performance comparison for nine subgraph pattern retrieval operations over six graph analysis systems, namely NetworkX, Neo4j, Jena, Titan, GraphX, and uRiKA. Through the proposed benchmark suite, this study reveals both quantitative and qualitative findings in (1) implications in loading data into each system; (2) challenges in describing graph patterns for each query interface; and (3) different sensitivity of each system to query selectivity. We envision that this study will pave the road for: (i) data scientists to select the suitable graph analysis systems, and (ii) data management system designers to advance graph analysis systems.
Martian Pyroxenes in the Shergottite Meteorites; Zagami, SAU005, DAG476 and EETA79001
NASA Astrophysics Data System (ADS)
Stephen, N.; Benedix, G. K.; Bland, P.; Hamilton, V. E.
2010-12-01
The geology and surface mineralogy of Mars is characterised using remote sensing techniques such as thermal emission spectroscopy (TES) from instruments on a number of spacecraft currently orbiting Mars or gathered from roving missions on the Martian surface. However, the study of Martian meteorites is also important in efforts to further understand the geological history of Mars or to interpret mission data as they are believed to be the only available samples that give us direct clues as to Martian igneous processes [1]. We have recently demonstrated that the spectra of Martian-specific minerals can be determined using micro-spectroscopy [2] and that these spectra can be reliably obtained from thin sections of Martian meteorites [3]. Accurate modal mineralogy of these meteorites is also important [4]. In this study we are using a variety of techniques to build upon previous studies of these particular samples in order to fully characterise the nature of the 2 common pyroxenes found in Martian Shergottites; pigeonite and augite [5], [6]. Previous studies have shown that the Shergottite meteorites are dominated by pyroxene (pigeonite and augite in varying quantities) [4], [5], commonly but not always olivine, plagioclase or maskelynite/glass and also hydrous minerals, which separate the Martian meteorites from other achondrites [7]. Our microprobe study of meteorites Zagami, EETA79001, SAU005 and DAG476 in thin-section at the Natural History Museum, London shows a chemical variability within both the pigeonite and augite composition across individual grains in all thin sections; variation within either Mg or Ca concentration varies from core to rim within the grains. This variation can also be seen in modal mineralogy maps using SEM-derived element maps and the Photoshop® technique previously described [4], and in new micro-spectroscopy data, particularly within the Zagami meteorite. New mineral spectra have been gathered from the Shergottite thin-sections by
Automated Program Recognition by Graph Parsing
1992-07-01
programs are represented as attributed dataflow graphs and a library of clichis is encoded as an attributed graph grammar . Graph parsing is used to...recognition. Second, we investigate the expressiveness of our graph grammar formalism for capturing pro- gramming cliches. Third, we empirically and...library of cliches is encoded as an attributed graph grammar . Graph parsing is used to recognize clich6s in the code. We demonstrate that this graph
Graph Coarsening for Path Finding in Cybersecurity Graphs
Hogan, Emilie A.; Johnson, John R.; Halappanavar, Mahantesh
2013-01-01
n the pass-the-hash attack, hackers repeatedly steal password hashes and move through a computer network with the goal of reaching a computer with high level administrative privileges. In this paper we apply graph coarsening in network graphs for the purpose of detecting hackers using this attack or assessing the risk level of the network's current state. We repeatedly take graph minors, which preserve the existence of paths in the graph, and take powers of the adjacency matrix to count the paths. This allows us to detect the existence of paths as well as find paths that have high risk of being used by adversaries.
Hartline, Caroll B; Gustin, Kortney M; Wan, William B; Ciesla, Stephanie L; Beadle, James R; Hostetler, Karl Y; Kern, Earl R
2005-02-01
The acyclic nucleoside phosphonate cidofovir (CDV) and its closely related analogue (S)-9-(3-hydroxy-2-phosphonylmethoxypropyl)-adenine ([S]-HPMPA) have been reported to have activity against many adenovirus (AdV) serotypes. A new series of orally active ether lipid-ester prodrugs of CDV and of (S)-HPMPA that have slight differences in the structure of their lipid esters were evaluated, in tissue-culture cells, for activity against 5 AdV serotypes. The results indicated that, against several AdV serotypes, the most active compounds were 15-2500-fold more active than the unmodified parent compounds and should be evaluated further for their potential to treat AdV infections in humans.
Halogen bonding in water results in enhanced anion recognition in acyclic and rotaxane hosts
NASA Astrophysics Data System (ADS)
Langton, Matthew J.; Robinson, Sean W.; Marques, Igor; Félix, Vítor; Beer, Paul D.
2014-12-01
Halogen bonding (XB), the attractive interaction between an electron-deficient halogen atom and a Lewis base, has undergone a dramatic development as an intermolecular force analogous to hydrogen bonding (HB). However, its utilization in the solution phase remains underdeveloped. Furthermore, the design of receptors capable of strong and selective recognition of anions in water remains a significant challenge. Here we demonstrate the superiority of halogen bonding over hydrogen bonding for strong anion binding in water, to the extent that halide recognition by a simple acyclic mono-charged receptor is achievable. Quantification of iodide binding by rotaxane hosts reveals the strong binding by the XB-rotaxane is driven exclusively by favourable enthalpic contributions arising from the halogen-bonding interactions, whereas weaker association with the HB-rotaxanes is entropically driven. These observations demonstrate the unique nature of halogen bonding in water as a strong alternative interaction to the ubiquitous hydrogen bonding in molecular recognition and assembly.
Hazelton, Keith Z.; Ho, Meng-Chaio; Cassera, Maria B.; Clinch, Keith; Crump, Douglas R.; Rosario Jr., Irving; Merino, Emilio F.; Almo, Steve C.; Tyler, Peter C.; Schramm, Vern L.
2012-06-22
We found that Plasmodium falciparum is the primary cause of deaths from malaria. It is a purine auxotroph and relies on hypoxanthine salvage from the host purine pool. Purine starvation as an antimalarial target has been validated by inhibition of purine nucleoside phosphorylase. Hypoxanthine depletion kills Plasmodium falciparum in cell culture and in Aotus monkey infections. Hypoxanthine-guanine-xanthine phosphoribosyltransferase (HGXPRT) from P. falciparum is required for hypoxanthine salvage by forming inosine 5'-monophosphate, a branchpoint for all purine nucleotide synthesis in the parasite. We present a class of HGXPRT inhibitors, the acyclic immucillin phosphonates (AIPs), and cell permeable AIP prodrugs. The AIPs are simple, potent, selective, and biologically stable inhibitors. The AIP prodrugs block proliferation of cultured parasites by inhibiting the incorporation of hypoxanthine into the parasite nucleotide pool and validates HGXPRT as a target in malaria.
NASA Astrophysics Data System (ADS)
Shimakami, Tetsuro; Honda, Masao; Shirasaki, Takayoshi; Takabatake, Riuta; Liu, Fanwei; Murai, Kazuhisa; Shiomoto, Takayuki; Funaki, Masaya; Yamane, Daisuke; Murakami, Seishi; Lemon, Stanley M.; Kaneko, Shuichi
2014-04-01
Clinical studies suggest that the oral acyclic retinoid Peretinoin may reduce the recurrence of hepatocellular carcinoma (HCC) following surgical ablation of primary tumours. Since hepatitis C virus (HCV) infection is a major cause of HCC, we assessed whether Peretinoin and other retinoids have any effect on HCV infection. For this purpose, we measured the effects of several retinoids on the replication of genotype 1a, 1b, and 2a HCV in vitro. Peretinoin inhibited RNA replication for all genotypes and showed the strongest antiviral effect among the retinoids tested. Furthermore, it reduced infectious virus release by 80-90% without affecting virus assembly. These effects could be due to reduced signalling from lipid droplets, triglyceride abundance, and the expression of mature sterol regulatory element-binding protein 1c and fatty acid synthase. These negative effects of Peretinoin on HCV infection may be beneficial in addition to its potential for HCC chemoprevention in HCV-infected patients.
Hicks, Jacqueline D.; Hyde, Alan M.; Cuezva, Alberto Martinez; Buchwald, Stephen L.
2009-01-01
We report the efficient N-arylation of acyclic secondary amides and related nucleophiles with aryl nonaflates, triflates, and chlorides. This method allows for easy variation of the aromatic component in tertiary aryl amides. A new biaryl phosphine with P-bound 3,5-(bis)trifluoromethylphenyl groups was found to be uniquely effective for this amidation. The critical aspects of the ligand were explored through synthetic, mechanistic, and computational studies. Systematic variation of the ligand revealed the importance of (1) a methoxy group on the aromatic carbon of the “top ring” ortho to the phosphorus and (2) two highly electron-withdrawing P-bound 3,5-(bis)trifluoromethylphenyl groups. Computational studies suggest the electron-deficient nature of the ligand is important in facilitating amide binding to the LPd(II)(Ph)(X) intermediate. PMID:19886610
New acyclic secondary metabolites from the biologically active fraction of Albizia lebbeck flowers.
Al-Massarani, Shaza M; El Gamal, Ali A; Abd El Halim, Mohamed F; Al-Said, Mansour S; Abdel-Kader, Maged S; Basudan, Omer A; Alqasoumi, Saleh I
2017-01-01
The total extract of Albizia lebbeck flowers was examined in vivo for its possible hepatoprotective activity in comparison with the standard drug silymarin at two doses. The higher dose expressed promising activity especially in reducing the levels of AST, ALT and bilirubin. Fractionation via liquid-liquid partition and reexamination of the fractions revealed that the n-butanol fraction was the best in improving liver biochemical parameters followed by the n-hexane fraction. However, serum lipid parameters were best improved with CHCl3 fraction. The promising biological activity results initiated an intensive chromatographic purification of A. lebbeck flowers fractions. Two compounds were identified from natural source for the first time, the acyclic farnesyl sesquiterpene glycoside1-O-[6-O-α-l-arabinopyranosyl-β-d-glucopyranoside]-(2E,6E-)-farnesol (6) and the squalene derivative 2,3-dihydroxy-2,3-dihydrosqualene (9), in addition to eight compounds reported here for the first time from the genus Albizia; two benzyl glycosides, benzyl 1-O-β-d-glucopyranoside (1) and benzyl 6-O-α-l-arabinopyranosyl β-d-glucopyranoside (2); three acyclic monoterpene glycosides, linalyl β-d-glucopyranoside (3) and linalyl 6-O-α-l-arabinopyranosyl-β-d-glucopyranoside (4); (2E)-3,7-dimethylocta-2,6-dienoate-6-O-α-l arabinopyranosyl-β-d-glucopyranoside (5), two oligoglycosides, n-hexyl-α-l arabinopyranosyl-(1 → 6)-β-d-glucopyranoside (creoside) (7) and n-octyl α-l-arabinopyranosyl-(1 → 6)-β-d-glucopyranoside (rhodiooctanoside) (8); and ethyl fructofuranoside (10). The structures of the isolated compounds were elucidated based on extensive examination of their spectroscopic 1D and 2D-NMR, MS, UV, and IR data. It is worth mentioning that, some of the isolated linalol glycoside derivatives were reported as aroma precursors.
1973-10-01
The theory of strongly regular graphs was introduced by Bose r7 1 in 1963, in connection with partial geometries and 2 class association schemes. One...non adjacent vertices is constant and equal to ~. We shall denote by ~(p) (reap.r(p)) the set of vertices adjacent (resp.non adjacent) to a vertex p...is the complement of .2’ if the set of vertices of ~ is the set of vertices of .2’ and if two vertices in .2’ are adjacent if and only if they were
Eigensolutions of dodecahedron graphs
NASA Astrophysics Data System (ADS)
Ghosh, Piyali; Karmakar, Somnath; Mandal, Bholanath
2014-02-01
Eigensolutions of 20-vertex cage (i.e. dodecahedron) have been determined with the use of fivefold rotational symmetry. For homo-dodecahedron the eigensolutions become analytical but for the hetero-dodecahedron having two different types of atoms ((C,N),(C,B),(B,N)) the eigensolutions are found to be factored out into five 4-degree polynomials with one corresponding to nondegenerate and other four corresponding to two degenerate eigensolutions. Eigenspectra and total π-electron energies of homo- and hetero-dodecahedron graphs have been calculated.
NASA Technical Reports Server (NTRS)
Burleigh, Scott C.
2011-01-01
Contact Graph Routing (CGR) is a dynamic routing system that computes routes through a time-varying topology of scheduled communication contacts in a network based on the DTN (Delay-Tolerant Networking) architecture. It is designed to enable dynamic selection of data transmission routes in a space network based on DTN. This dynamic responsiveness in route computation should be significantly more effective and less expensive than static routing, increasing total data return while at the same time reducing mission operations cost and risk. The basic strategy of CGR is to take advantage of the fact that, since flight mission communication operations are planned in detail, the communication routes between any pair of bundle agents in a population of nodes that have all been informed of one another's plans can be inferred from those plans rather than discovered via dialogue (which is impractical over long one-way-light-time space links). Messages that convey this planning information are used to construct contact graphs (time-varying models of network connectivity) from which CGR automatically computes efficient routes for bundles. Automatic route selection increases the flexibility and resilience of the space network, simplifying cross-support and reducing mission management costs. Note that there are no routing tables in Contact Graph Routing. The best route for a bundle destined for a given node may routinely be different from the best route for a different bundle destined for the same node, depending on bundle priority, bundle expiration time, and changes in the current lengths of transmission queues for neighboring nodes; routes must be computed individually for each bundle, from the Bundle Protocol agent's current network connectivity model for the bundle s destination node (the contact graph). Clearly this places a premium on optimizing the implementation of the route computation algorithm. The scalability of CGR to very large networks remains a research topic
Noncommutative Riemannian geometry on graphs
NASA Astrophysics Data System (ADS)
Majid, Shahn
2013-07-01
We show that arising out of noncommutative geometry is a natural family of edge Laplacians on the edges of a graph. The family includes a canonical edge Laplacian associated to the graph, extending the usual graph Laplacian on vertices, and we find its spectrum. We show that for a connected graph its eigenvalues are strictly positive aside from one mandatory zero mode, and include all the vertex degrees. Our edge Laplacian is not the graph Laplacian on the line graph but rather it arises as the noncommutative Laplace-Beltrami operator on differential 1-forms, where we use the language of differential algebras to functorially interpret a graph as providing a 'finite manifold structure' on the set of vertices. We equip any graph with a canonical 'Euclidean metric' and a canonical bimodule connection, and in the case of a Cayley graph we construct a metric compatible connection for the Euclidean metric. We make use of results on bimodule connections on inner calculi on algebras, which we prove, including a general relation between zero curvature and the braid relations.
Hinz, Andreas M.
2012-01-01
The appropriate mathematical model for the problem space of tower transformation tasks is the state graph representing positions of discs or balls and their moves. Graph theoretical quantities like distance, eccentricities or degrees of vertices and symmetries of graphs support the choice of problems, the selection of tasks and the analysis of performance of subjects whose solution paths can be projected onto the graph. The mathematical model is also at the base of a computerized test tool to administer various types of tower tasks. PMID:22207419
Graph Visualization for RDF Graphs with SPARQL-EndPoints
Sukumar, Sreenivas R; Bond, Nathaniel
2014-07-11
RDF graphs are hard to visualize as triples. This software module is a web interface that connects to a SPARQL endpoint and retrieves graph data that the user can explore interactively and seamlessly. The software written in python and JavaScript has been tested to work on screens as little as the smart phones to large screens such as EVEREST.
Kirkpatrick, Bonnie; Reshef, Yakir; Finucane, Hilary; Jiang, Haitao; Zhu, Binhai; Karp, Richard M
2012-09-01
Pedigree graphs, or family trees, are typically constructed by an expensive process of examining genealogical records to determine which pairs of individuals are parent and child. New methods to automate this process take as input genetic data from a set of extant individuals and reconstruct ancestral individuals. There is a great need to evaluate the quality of these methods by comparing the estimated pedigree to the true pedigree. In this article, we consider two main pedigree comparison problems. The first is the pedigree isomorphism problem, for which we present a linear-time algorithm for leaf-labeled pedigrees. The second is the pedigree edit distance problem, for which we present (1) several algorithms that are fast and exact in various special cases, and (2) a general, randomized heuristic algorithm. In the negative direction, we first prove that the pedigree isomorphism problem is as hard as the general graph isomorphism problem, and that the sub-pedigree isomorphism problem is NP-hard. We then show that the pedigree edit distance problem is APX-hard in general and NP-hard on leaf-labeled pedigrees. We use simulated pedigrees to compare our edit-distance algorithms to each other as well as to a branch-and-bound algorithm that always finds an optimal solution.
Maunz, Peter Lukas Wilhelm; Sterk, Jonathan David; Lobser, Daniel; Parekh, Ojas D.; Ryan-Anderson, Ciaran
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%.
Graph-based optimization of epitope coverage for vaccine antigen design
Theiler, James Patrick; Korber, Bette Tina Marie
2017-01-29
Epigraph is a recently developed algorithm that enables the computationally efficient design of single or multi-antigen vaccines to maximize the potential epitope coverage for a diverse pathogen population. Potential epitopes are defined as short contiguous stretches of proteins, comparable in length to T-cell epitopes. This optimal coverage problem can be formulated in terms of a directed graph, with candidate antigens represented as paths that traverse this graph. Epigraph protein sequences can also be used as the basis for designing peptides for experimental evaluation of immune responses in natural infections to highly variable proteins. The epigraph tool suite also enables rapidmore » characterization of populations of diverse sequences from an immunological perspective. Fundamental distance measures are based on immunologically relevant shared potential epitope frequencies, rather than simple Hamming or phylogenetic distances. Here, we provide a mathematical description of the epigraph algorithm, include a comparison of different heuristics that can be used when graphs are not acyclic, and we describe an additional tool we have added to the web-based epigraph tool suite that provides frequency summaries of all distinct potential epitopes in a population. Lastly, we also show examples of the graphical output and summary tables that can be generated using the epigraph tool suite and explain their content and applications.« less
Quantization of gauge fields, graph polynomials and graph homology
Kreimer, Dirk; Sars, Matthias; Suijlekom, Walter D. van
2013-09-15
We review quantization of gauge fields using algebraic properties of 3-regular graphs. We derive the Feynman integrand at n loops for a non-abelian gauge theory quantized in a covariant gauge from scalar integrands for connected 3-regular graphs, obtained from the two Symanzik polynomials. The transition to the full gauge theory amplitude is obtained by the use of a third, new, graph polynomial, the corolla polynomial. This implies effectively a covariant quantization without ghosts, where all the relevant signs of the ghost sector are incorporated in a double complex furnished by the corolla polynomial–we call it cycle homology–and by graph homology. -- Highlights: •We derive gauge theory Feynman from scalar field theory with 3-valent vertices. •We clarify the role of graph homology and cycle homology. •We use parametric renormalization and the new corolla polynomial.
Blind Identification of Graph Filters
NASA Astrophysics Data System (ADS)
Segarra, Santiago; Mateos, Gonzalo; Marques, Antonio G.; Ribeiro, Alejandro
2017-03-01
Network processes are often represented as signals defined on the vertices of a graph. To untangle the latent structure of such signals, one can view them as outputs of linear graph filters modeling underlying network dynamics. This paper deals with the problem of joint identification of a graph filter and its input signal, thus broadening the scope of classical blind deconvolution of temporal and spatial signals to the less-structured graph domain. Given a graph signal $\\mathbf{y}$ modeled as the output of a graph filter, the goal is to recover the vector of filter coefficients $\\mathbf{h}$, and the input signal $\\mathbf{x}$ which is assumed to be sparse. While $\\mathbf{y}$ is a bilinear function of $\\mathbf{x}$ and $\\mathbf{h}$, the filtered graph signal is also a linear combination of the entries of the lifted rank-one, row-sparse matrix $\\mathbf{x} \\mathbf{h}^T$. The blind graph-filter identification problem can thus be tackled via rank and sparsity minimization subject to linear constraints, an inverse problem amenable to convex relaxations offering provable recovery guarantees under simplifying assumptions. Numerical tests using both synthetic and real-world networks illustrate the merits of the proposed algorithms, as well as the benefits of leveraging multiple signals to aid the blind identification task.
NASA Technical Reports Server (NTRS)
Butler, Ricky W.; Sjogren, Jon A.
1998-01-01
This paper documents the NASA Langley PVS graph theory library. The library provides fundamental definitions for graphs, subgraphs, walks, paths, subgraphs generated by walks, trees, cycles, degree, separating sets, and four notions of connectedness. Theorems provided include Ramsey's and Menger's and the equivalence of all four notions of connectedness.
Network reconstruction via graph blending
NASA Astrophysics Data System (ADS)
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.
ERIC Educational Resources Information Center
Axtell, M.; Stickles, J.
2010-01-01
The last ten years have seen an explosion of research in the zero-divisor graphs of commutative rings--by professional mathematicians "and" undergraduates. The objective is to find algebraic information within the geometry of these graphs. This topic is approachable by anyone with one or two semesters of abstract algebra. This article gives the…
Graphs as Statements of Belief.
ERIC Educational Resources Information Center
Lake, David
2002-01-01
Identifies points where beliefs are important when making decisions about how graphs are drawn. Describes a simple case of the reaction between 'bicarb soda' and orange or lemon juice and discusses how drawing a graph becomes a statement of belief. (KHR)
Shimizu, Masahito; Suzui, Masumi; Deguchi, Atsuko; Lim, Jin T E; Xiao, Danhua; Hayes, Julia H; Papadopoulos, Kyriakos P; Weinstein, I Bernard
2004-10-01
Hepatoma is one of the most frequently occurring cancers worldwide. However, effective chemotherapeutic agents for this disease have not been developed. Acyclic retinoid, a novel synthetic retinoid, can reduce the incidence of postsurgical recurrence of hepatoma and improve the survival rate. OSI-461, a potent derivative of exisulind, can increase intracellular levels of cyclic GMP, which leads to activation of protein kinase G and induction of apoptosis in cancer cells. In the present study, we examined the combined effects of acyclic retinoid plus OSI-461 in the HepG2 human hepatoma cell line. We found that the combination of as little as 1.0 micromol/L acyclic retinoid and 0.01 micromol/L OSI-461 exerted synergistic inhibition of the growth of HepG2 cells. Combined treatment with low concentrations of these two agents also acted synergistically to induce apoptosis in HepG2 cells through induction of Bax and Apaf-1, reduction of Bcl-2 and Bcl-xL, and activation of caspase-3, -8, and -9. OSI-461 enhanced the G0-G1 arrest caused by acyclic retinoid, and the combination of these agents caused a synergistic decrease in the levels of expression of cyclin D1 protein and mRNA, inhibited cyclin D1 promoter activity, decreased the level of hyperphosphorylated forms of the Rb protein, induced increased cellular levels of the p21(CIP1) protein and mRNA, and stimulated p21(CIP1) promoter activity. Moreover, OSI-461 enhanced the ability of acyclic retinoid to induce increased cellular levels of retinoic acid receptor beta and to stimulate retinoic acid response element-chloramphenicol acetyltransferase activity. A hypothetical model involving concerted effects on p21(CIP1) and retinoic acid receptor beta expression is proposed to explain these synergistic effects. Our results suggest that the combination of acyclic retinoid plus OSI-461 might be an effective regimen for the chemoprevention and chemotherapy of human hepatoma and possibly other malignancies.
A Collection of Features for Semantic Graphs
Eliassi-Rad, T; Fodor, I K; Gallagher, B
2007-05-02
Semantic graphs are commonly used to represent data from one or more data sources. Such graphs extend traditional graphs by imposing types on both nodes and links. This type information defines permissible links among specified nodes and can be represented as a graph commonly referred to as an ontology or schema graph. Figure 1 depicts an ontology graph for data from National Association of Securities Dealers. Each node type and link type may also have a list of attributes. To capture the increased complexity of semantic graphs, concepts derived for standard graphs have to be extended. This document explains briefly features commonly used to characterize graphs, and their extensions to semantic graphs. This document is divided into two sections. Section 2 contains the feature descriptions for static graphs. Section 3 extends the features for semantic graphs that vary over time.
Path similarity skeleton graph matching.
Bai, Xiang; Latecki, Longin Jan
2008-07-01
This paper presents a novel framework to for shape recognition based on object silhouettes. The main idea is to match skeleton graphs by comparing the shortest paths between skeleton endpoints. In contrast to typical tree or graph matching methods, we completely ignore the topological graph structure. Our approach is motivated by the fact that visually similar skeleton graphs may have completely different topological structures. The proposed comparison of shortest paths between endpoints of skeleton graphs yields correct matching results in such cases. The skeletons are pruned by contour partitioning with Discrete Curve Evolution, which implies that the endpoints of skeleton branches correspond to visual parts of the objects. The experimental results demonstrate that our method is able to produce correct results in the presence of articulations, stretching, and occlusion.
Raberto, Marco; Rapallo, Fabio; Scalas, Enrico
2011-01-01
In this paper, we outline a model of graph (or network) dynamics based on two ingredients. The first ingredient is a Markov chain on the space of possible graphs. The second ingredient is a semi-Markov counting process of renewal type. The model consists in subordinating the Markov chain to the semi-Markov counting process. In simple words, this means that the chain transitions occur at random time instants called epochs. The model is quite rich and its possible connections with algebraic geometry are briefly discussed. Moreover, for the sake of simplicity, we focus on the space of undirected graphs with a fixed number of nodes. However, in an example, we present an interbank market model where it is meaningful to use directed graphs or even weighted graphs. PMID:21887245
Garcia, Lia C; Donadío, Lucia Gandolfi; Mann, Ella; Kolusheva, Sofiya; Kedei, Noemi; Lewin, Nancy E; Hill, Colin S; Kelsey, Jessica S; Yang, Jing; Esch, Timothy E; Santos, Marina; Peach, Megan L; Kelley, James A; Blumberg, Peter M; Jelinek, Raz; Marquez, Victor E; Comin, Maria J
2014-06-15
The development of selective agents capable of discriminating between protein kinase C (PKC) isoforms and other diacylglycerol (DAG)-responsive C1 domain-containing proteins represents an important challenge. Recent studies have highlighted the role that Ras guanine nucleotide-releasing protein (RasGRP) isoforms play both in immune responses as well as in the development of prostate cancer and melanoma, suggesting that the discovery of selective ligands could have potential therapeutic value. Thus far, the N-methyl-substituted indololactone 1 is the agonist with the highest reported potency and selectivity for RasGRP relative to PKC. Here we present the synthesis, binding studies, cellular assays and biophysical analysis of interactions with model membranes of a family of regioisomers of 1 (compounds 2-5) that differ in the position of the linkage between the indole ring and the lactone moiety. These structural variations were studied to explore the interaction of the active complex (C1 domain-ligand) with cellular membranes, which is believed to be an important factor for selectivity in the activation of DAG-responsive C1 domain containing signaling proteins. All compounds were potent and selective activators of RasGRP when compared to PKCα with selectivities ranging from 6 to 65 fold. However, the parent compound 1 was appreciably more selective than any of the other isomers. In intact cells, modest differences in the patterns of translocation of the C1 domain targets were observed. Biophysical studies using giant vesicles as model membranes did show substantial differences in terms of molecular interactions impacting lipid organization, dynamics and membrane insertion. However, these differences did not yield correspondingly large changes in patterns of biological response, at least for the parameters examined.
Garcia, Lia C.; Donadío, Lucia Gandolfi; Mann, Ella; Kolusheva, Sofiya; Kedei, Noemi; Lewin, Nancy E.; Hill, Colin S.; Kelsey, Jessica S.; Yang, Jing; Esch, Timothy E.; Santos, Marina; Peach, Megan L.; Kelley, James A.; Blumberg, Peter M.; Jelinek, Raz; Marquez, Victor E.; Comin, Maria J.
2014-01-01
The development of selective agents capable of discriminating between protein kinase C (PKC) isoforms and other diacylglycerol (DAG)-responsive C1 domain-containing proteins represents an important challenge. Recent studies have highlighted the role that Ras guanine nucleotide-releasing protein (RasGRP) isoforms play both in immune responses as well as in the development of prostate cancer and melanoma, suggesting that the discovery of selective ligands could have potential therapeutic value. Thus far, the N-methyl-substituted indololactone 1 is the agonist with the highest reported potency and selectivity for RasGRP relative to PKC. Here we present the synthesis, binding studies, cellular assays and biophysical analysis of interactions with model membranes of a family of regioisomers of 1 (compounds 2 to 5) that differ in the position of the linkage between the indole ring and the lactone moiety. These structural variations were studied to explore the interaction of the active complex (C1 domain-ligand) with cellular membranes, which is believed to be an important factor for selectivity in the activation of DAG-responsive C1 domain containing signaling proteins. All compounds were potent and selective activators of RasGRP when compared to PKCα with selectivities ranging from 6 to 65 fold. However, the parent compound 1 was appreciably more selective than any of the other isomers. In intact cells, modest differences in the patterns of translocation of the C1 domain targets were observed. Biophysical studies using giant vesicles as model membranes did show substantial differences in terms of molecular interactions impacting lipid organization, dynamics and membrane insertion. However, these differences did not yield correspondingly large changes in patterns of biological response, at least for the parameters examined. PMID:24794745
Exploring and Making Sense of Large Graphs
2015-08-01
our fast algorithmic methodologies, we also contribute graph-theoretical ideas and models, and real-world applications in two main areas ??? Single ...Graph Exploration: We show how to interpretably summarize a single graph by identifying its important graph structures. We complement summarization with...effectively learn information about the unknown entities. ??? Multiple-Graph Exploration: We extend the idea of single -graph summarization to time
Completeness and regularity of generalized fuzzy graphs.
Samanta, Sovan; Sarkar, Biswajit; Shin, Dongmin; Pal, Madhumangal
2016-01-01
Fuzzy graphs are the backbone of many real systems like networks, image, scheduling, etc. But, due to some restriction on edges, fuzzy graphs are limited to represent for some systems. Generalized fuzzy graphs are appropriate to avoid such restrictions. In this study generalized fuzzy graphs are introduced. In this study, matrix representation of generalized fuzzy graphs is described. Completeness and regularity are two important parameters of graph theory. Here, regular and complete generalized fuzzy graphs are introduced. Some properties of them are discussed. After that, effective regular graphs are exemplified.
Comparison and enumeration of chemical graphs.
Akutsu, Tatsuya; Nagamochi, Hiroshi
2013-01-01
Chemical compounds are usually represented as graph structured data in computers. In this review article, we overview several graph classes relevant to chemical compounds and the computational complexities of several fundamental problems for these graph classes. In particular, we consider the following problems: determining whether two chemical graphs are identical, determining whether one input chemical graph is a part of the other input chemical graph, finding a maximum common part of two input graphs, finding a reaction atom mapping, enumerating possible chemical graphs, and enumerating stereoisomers. We also discuss the relationship between the fifth problem and kernel functions for chemical compounds.
ERIC Educational Resources Information Center
Fuglesang, Andreas, Ed.
The objective of the two week long 1972 Dag Hammarskjold Seminar was to break away from traditional and theoretical concepts of information work in order to gain a practical insight into communication, especially as it applies to social and economic development. Fifty participants and lecturers from developed and developing countries in Europe and…
GRAPH III: a digitizing and graph plotting program
Selleck, C.B.
1986-03-01
GRAPH is an interactive program that allows the user to perform two functions. The first is to plot two dimensional graphs and the second is to digitize graphs or plots to create data files of points. The program is designed to allow the user to get results quickly and easily. It is written in RATIV (a FORTRAN preprocessor) and is currently in use at Sandia under VMS on a VAX computer and CTSS on a Cray supercomputer. The program provides graphical output through all of the Sandia Virtual Device Interface (VDI) graphics devices. 2 refs., 3 figs., 3 tabs.
DeNinno, M P; Eller, C; Etienne, J B
2001-10-19
Intramolecular endo-cyclization reactions of N-acyliminium ions have seen wide application for the synthesis of heterocyclic compounds. The corresponding exocyclic variant, which would provide 1-aminotetralin derivatives, for example, has little precedent. We have discovered that acyclic N-acylcarbamates can be readily reduced to the corresponding N-acylhemiaminal derivatives in high yield using DIBAL as the reducing agent. These intermediates are remarkably stable and, if desired, can be purified and stored. The acyclic N-acylhemiaminals undergo both intra- and intermolecular nucleophilic addition reactions mediated by strong Lewis acids, such as TiCl(4). Diastereoselectivity, induced either by a substituent on the newly formed ring, or by utilizing a chiral ester on the carbamic acid, was disappointingly low. This methodology was successfully applied to the synthesis of the racemic form of the marketed antidepressant sertraline.
Enzymatic study on AtCCD4 and AtCCD7 and their potential to form acyclic regulatory metabolites
Bruno, Mark; Koschmieder, Julian; Wuest, Florian; Schaub, Patrick; Fehling-Kaschek, Mirjam; Timmer, Jens; Beyer, Peter; Al-Babili, Salim
2016-01-01
The Arabidopsis carotenoid cleavage dioxygenase 4 (AtCCD4) is a negative regulator of the carotenoid content of seeds and has recently been suggested as a candidate for the generation of retrograde signals that are thought to derive from the cleavage of poly-cis-configured carotene desaturation intermediates. In this work, we investigated the activity of AtCCD4 in vitro and used dynamic modeling to determine its substrate preference. Our results document strict regional specificity for cleavage at the C9–C10 double bond in carotenoids and apocarotenoids, with preference for carotenoid substrates and an obstructing effect on hydroxyl functions, and demonstrate the specificity for all-trans-configured carotenes and xanthophylls. AtCCD4 cleaved substrates with at least one ionone ring and did not convert acyclic carotene desaturation intermediates, independent of their isomeric states. These results do not support a direct involvement of AtCCD4 in generating the supposed regulatory metabolites. In contrast, the strigolactone biosynthetic enzyme AtCCD7 converted 9-cis-configured acyclic carotenes, such as 9-cis-ζ-carotene, 9'-cis-neurosporene, and 9-cis-lycopene, yielding 9-cis-configured products and indicating that AtCCD7, rather than AtCCD4, is the candidate for forming acyclic retrograde signals. PMID:27811075
Flying through Graphs: An Introduction to Graph Theory.
ERIC Educational Resources Information Center
McDuffie, Amy Roth
2001-01-01
Presents an activity incorporating basic terminology, concepts, and solution methods of graph theory in the context of solving problems related to air travel. Discusses prerequisite knowledge and resources and includes a teacher's guide with a student worksheet. (KHR)
Multigraph: Reusable Interactive Data Graphs
NASA Astrophysics Data System (ADS)
Phillips, M. B.
2010-12-01
There are surprisingly few good software tools available for presenting time series data on the internet. The most common practice is to use a desktop program such as Excel or Matlab to save a graph as an image which can be included in a web page like any other image. This disconnects the graph from the data in a way that makes updating a graph with new data a cumbersome manual process, and it limits the user to one particular view of the data. The Multigraph project defines an XML format for describing interactive data graphs, and software tools for creating and rendering those graphs in web pages and other internet connected applications. Viewing a Multigraph graph is extremely simple and intuitive, and requires no instructions; the user can pan and zoom by clicking and dragging, in a familiar "Google Maps" kind of way. Creating a new graph for inclusion in a web page involves writing a simple XML configuration file. Multigraph can read data in a variety of formats, and can display data from a web service, allowing users to "surf" through large data sets, downloading only those the parts of the data that are needed for display. The Multigraph XML format, or "MUGL" for short, provides a concise description of the visual properties of a graph, such as axes, plot styles, data sources, labels, etc, as well as interactivity properties such as how and whether the user can pan or zoom along each axis. Multigraph reads a file in this format, draws the described graph, and allows the user to interact with it. Multigraph software currently includes a Flash application for embedding graphs in web pages, a Flex component for embedding graphs in larger Flex/Flash applications, and a plugin for creating graphs in the WordPress content management system. Plans for the future include a Java version for desktop viewing and editing, a command line version for batch and server side rendering, and possibly Android and iPhone versions. Multigraph is currently in use on several web
DNA Rearrangements through Spatial Graphs
NASA Astrophysics Data System (ADS)
Jonoska, Nataša; Saito, Masahico
The paper is a short overview of a recent model of homologous DNA recombination events guided by RNA templates that have been observed in certain species of ciliates. This model uses spatial graphs to describe DNA rearrangements and show how gene recombination can be modeled as topological braiding of the DNA. We show that a graph structure, which we refer to as an assembly graph, containing only 1- and 4-valent rigid vertices can provide a physical representation of the DNA at the time of recombination. With this representation, 4-valent vertices correspond to the alignment of the recombination sites, and we model the actual recombination event as smoothing of these vertices.
n-Nucleotide circular codes in graph theory.
Fimmel, Elena; Michel, Christian J; Strüngmann, Lutz
2016-03-13
The circular code theory proposes that genes are constituted of two trinucleotide codes: the classical genetic code with 61 trinucleotides for coding the 20 amino acids (except the three stop codons {TAA,TAG,TGA}) and a circular code based on 20 trinucleotides for retrieving, maintaining and synchronizing the reading frame. It relies on two main results: the identification of a maximal C(3) self-complementary trinucleotide circular code X in genes of bacteria, eukaryotes, plasmids and viruses (Michel 2015 J. Theor. Biol. 380, 156-177. (doi:10.1016/j.jtbi.2015.04.009); Arquès & Michel 1996 J. Theor. Biol. 182, 45-58. (doi:10.1006/jtbi.1996.0142)) and the finding of X circular code motifs in tRNAs and rRNAs, in particular in the ribosome decoding centre (Michel 2012 Comput. Biol. Chem. 37, 24-37. (doi:10.1016/j.compbiolchem.2011.10.002); El Soufi & Michel 2014 Comput. Biol. Chem. 52, 9-17. (doi:10.1016/j.compbiolchem.2014.08.001)). The univerally conserved nucleotides A1492 and A1493 and the conserved nucleotide G530 are included in X circular code motifs. Recently, dinucleotide circular codes were also investigated (Michel & Pirillo 2013 ISRN Biomath. 2013, 538631. (doi:10.1155/2013/538631); Fimmel et al. 2015 J. Theor. Biol. 386, 159-165. (doi:10.1016/j.jtbi.2015.08.034)). As the genetic motifs of different lengths are ubiquitous in genes and genomes, we introduce a new approach based on graph theory to study in full generality n-nucleotide circular codes X, i.e. of length 2 (dinucleotide), 3 (trinucleotide), 4 (tetranucleotide), etc. Indeed, we prove that an n-nucleotide code X is circular if and only if the corresponding graph [Formula: see text] is acyclic. Moreover, the maximal length of a path in [Formula: see text] corresponds to the window of nucleotides in a sequence for detecting the correct reading frame. Finally, the graph theory of tournaments is applied to the study of dinucleotide circular codes. It has full equivalence between the combinatorics
Polarizable empirical force field for acyclic polyalcohols based on the classical Drude oscillator.
He, Xibing; Lopes, Pedro E M; Mackerell, Alexander D
2013-10-01
A polarizable empirical force field for acyclic polyalcohols based on the classical Drude oscillator is presented. The model is optimized with an emphasis on the transferability of the developed parameters among molecules of different sizes in this series and on the condensed-phase properties validated against experimental data. The importance of the explicit treatment of electronic polarizability in empirical force fields is demonstrated in the cases of this series of molecules with vicinal hydroxyl groups that can form cooperative intra- and intermolecular hydrogen bonds. Compared to the CHARMM additive force field, improved treatment of the electrostatic interactions avoids overestimation of the gas-phase dipole moments resulting in significant improvement in the treatment of the conformational energies and leads to the correct balance of intra- and intermolecular hydrogen bonding of glycerol as evidenced by calculated heat of vaporization being in excellent agreement with experiment. Computed condensed phase data, including crystal lattice parameters and volumes and densities of aqueous solutions are in better agreement with experimental data as compared to the corresponding additive model. Such improvements are anticipated to significantly improve the treatment of polymers in general, including biological macromolecules.
Flotation properties of some oxygen-containing compounds of the acyclic series
Shreider, E.M.; Para, S.F.; Galanov, M.E.; Trachik, T.L.; Lagutina, L.V.
1981-01-01
In the monatomic alcohols series, maximum flotation activity is reached at 6 to 8 carbon atoms in the radical. It was decided to investigate the reagent properties of some other substances containing hydroxyl radicals which have not previously been considered. Oxygen-containing compounds in the acyclic series were examined, including alcohols: I - ethanol, ethylene-glycol, glycerol, pentaerythrytol, D-mannitol; II - dulcitol, D-sorbitol, D-mannitol, xylitol; glycols - monoethyleneglycol, diethyleneglycol, triethyleneglycol, polyethyleneglycol; and ethanolamines - ethanolamine, triethanolamine. The flotation properties of the reagents were determined in a Mekhanobr laboratory flotation machine with a chamber volume of 1.5 liter and an impeller speed of 1800 rpm. The materials tested were the <1 mm size fractions from run-of-plant charge and slurry from the radial thickeners. The samples were first dried and averaged. The pulp density was 200 g/l. The reagent conditions were kept constant throughout (50% of the total added at the start of a test, 25% after 2 min and 25% after 4 min from the start). The reagent additions were 1.0 to 1.4 kg/ton. All of these compounds had a very weak flotation activity.
Amino acids of the Murchison meteorite. I - Six carbon acyclic primary alpha-amino alkanoic acids
NASA Technical Reports Server (NTRS)
Cronin, J. R.; Gandy, W. E.; Pizzarello, S.
1981-01-01
Six of the seven chain isomers of six-carbon acyclic primary alpha-amino alkanoic acids (leucine isomers) have been either identified or confirmed in hot-water extracts of the Murchison meteorite using combined gas chromatography-mass spectrometry (GC-MS) and ion exchange chromatography. 2-Amino-2-ethylbutyric acid, 2-amino-2,3-dimethylbutyric acid, pseudoleucine, and 2-methylnorvaline were positively identified by GC-MS. These amino acids have not been previously reported to occur in natural materials and may be uniquely meteoritic in origin. The presence of leucine and isoleucine (including the diastereoisomer, alloisoleucine) was confirmed. Peaks corresponding to norleucine were seen by ion-exchange and gas chromatography but characteristic mass spectra were not obtained. The alpha-branched chain isomers in this series are quantitatively the most significant. These results are compared with literature data on amino acid synthesis by electrical discharge and Fischer-Tropsch-type catalysis. Neither model system produces an amino acid suite that is completely comparable to that found in the Murchison meteorite.
NASA Technical Reports Server (NTRS)
Cronin, John R.; Pizzarello, Sandra
1986-01-01
All of the eighteen possible seven-carbon acyclic primary alpha-amino alkanoic acids have been positively identified in a hot-water extract of the Murchison meteorite by the combined use of gas chromatography-mass spectrometry, ion exchange chromatography and reversed-phase chromatography. None of these amino acids has previously been found in meteorites or in any other natural material. They range in concentration from less than or equal to 0.5 to 5.3 nmol/g. Configuration assignments were made for 2-amino-3,4-dimethylpentanoic acid and allo-2-amino-3,4-dimethylpentanoic acid and the diasteromer ratio was determined. Fifty-five amino acids have now been positively identified in the Murchison meteorite, 36 of which are unknown in terrestrial materials. This unique suite of amino acids is characterized by the occurrence of all structural isomers within the two major classes of amino acids represented, by the predominance of branched chain isomers, and by an exponential decline in amount with increasing carbon chain length within homologous series. These characteristics of the Murchison amino acids are suggestive of synthesis before incorporation into a parent body.
Pathak, Ashish K; Pathak, Vibha; Reynolds, Robert C
2014-09-08
Molecular diversity plays a pivotal role in modern drug discovery against phenotypic or enzyme-based targets using high throughput screening technology. Under the auspices of the Pilot Scale Library Program of the NIH Roadmap Initiative, we produced and report herein a diverse library of 181 purine, pyrimidine, and 1,2,4-triazole-N-acetamide analogues which were prepared in a parallel high throughput solution-phase reaction format. A set of assorted amines were reacted with several nucleic acid N-acetic acids utilizing HATU as the coupling reagent to produce diverse acyclic nucleoside N-acetamide analogues. These reactions were performed using 24 well reaction blocks and an automatic reagent-dispensing platform under inert atmosphere. The targeted compounds were purified on an automated purification system using solid sample loading prepacked cartridges and prepacked silica gel columns. All compounds were characterized by NMR and HRMS, and were analyzed for purity by HPLC before submission to the Molecular Libraries Small Molecule Repository (MLSMR) at NIH. Initial screening through the Molecular Libraries Probe Production Centers Network (MLPCN) program, indicates that several analogues showed diverse and interesting biological activities.
Juliano, Thomas R; Korter, Timothy M
2013-10-10
Terahertz spectroscopy provides direct information concerning weak intermolecular forces in crystalline molecular solids and therefore acts as an excellent method for calibrating and evaluating computational models for noncovalent interactions. In this study, the low-frequency vibrations of two dipeptides were compared, acyclic diglycine and cyclic diglycine, as benchmark systems for gauging the performance of semiempirical London force correction approaches. The diglycine samples were investigated using pulsed terahertz spectroscopy from 10 to 100 cm(-1) and then analyzed using solid-state density functional theory (DFT) augmented with existing London force corrections, as well as a new parametrization (DFT-DX) based on known experimental values. The two diglycine molecules provide a useful test for the applied models given their similarities, but more importantly the differences in the intermolecular forces displayed by each. It was found that all of the considered London force correction models were able to generate diglycine crystal structures of similar accuracy, but considerable variation occurred in their abilities to predict terahertz frequency vibrations. The DFT-DX parametrization was particularly successful in this investigation and shows promise for the improved analysis of low-frequency spectra.
Executive Summary of Ares V: Lunar Capabilities Concept Review Through Phase A-Cycle 3
NASA Technical Reports Server (NTRS)
Holladay, J. B.; Baggett, K. E.; Feldman, S. M.
2011-01-01
This Technical Memorandum (TM) was generated as an overall Ares V summary from the Lunar Capabilities Concept Review (LCCR) through Phase A-Cycle 3 (PA-C3) with the intent that it may be coupled with separately published appendices for a more detailed, integrated narrative. The Ares V has evolved from the initial point of departure (POD) 51.00.48 LCCR configuration to the current candidate POD, PA-C3D, and the family of vehicles concept that contains vehicles PA-C3A through H. The logical progression from concept to POD vehicles is summarized in this TM and captures the trade space and performance of each. The family-of-vehicles concept was assessed during PA-C3 and offered flexibility in the path forward with the ability to add options deemed appropriate. A description of each trade space is given in addition to a summary of each Ares V element. The Ares V contributions to a Mars campaign are also highlighted with the goal of introducing Ares V capabilities within the trade space. The assessment of the Ares V vehicle as it pertains to Mars missions remained locked to the architecture presented in Mars Design Reference Authorization 5.0 using the PA-C3D vehicle configuration to assess Mars transfer vehicle options, in-space EDS capabilities, docking adaptor and propellant transfer assessments, and lunar and Mars synergistic potential.
Multibody graph transformations and analysis
2013-01-01
This two-part paper uses graph transformation methods to develop methods for partitioning, aggregating, and constraint embedding for multibody systems. This first part focuses on tree-topology systems and reviews the key notion of spatial kernel operator (SKO) models for such systems. It develops systematic and rigorous techniques for partitioning SKO models in terms of the SKO models of the component subsystems based on the path-induced property of the component subgraphs. It shows that the sparsity structure of key matrix operators and the mass matrix for the multibody system can be described using partitioning transformations. Subsequently, the notions of node contractions and subgraph aggregation and their role in coarsening graphs are discussed. It is shown that the tree property of a graph is preserved after subgraph aggregation if and only if the subgraph satisfies an aggregation condition. These graph theory ideas are used to develop SKO models for the aggregated tree multibody systems. PMID:24288438
Graph anomalies in cyber communications
Vander Wiel, Scott A; Storlie, Curtis B; Sandine, Gary; Hagberg, Aric A; Fisk, Michael
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.
Constructing Dense Graphs with Unique Hamiltonian Cycles
ERIC Educational Resources Information Center
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…
CUDA Enabled Graph Subset Examiner
Johnston, Jeremy T.
2016-12-22
Finding Godsil-McKay switching sets in graphs is one way to demonstrate that a specific graph is not determined by its spectrum--the eigenvalues of its adjacency matrix. An important area of active research in pure mathematics is determining which graphs are determined by their spectra, i.e. when the spectrum of the adjacency matrix uniquely determines the underlying graph. We are interested in exploring the spectra of graphs in the Johnson scheme and specifically seek to determine which of these graphs are determined by their spectra. Given a graph G, a Godsil-McKay switching set is an induced subgraph H on 2k vertices with the following properties: I) H is regular, ii) every vertex in G/H is adjacent to either 0, k, or 2k vertices of H, and iii) at least one vertex in G/H is adjacent to k vertices in H. The software package examines each subset of a user specified size to determine whether or not it satisfies those 3 conditions. The software makes use of the massive parallel processing power of CUDA enabled GPUs. It also exploits the vertex transitivity of graphs in the Johnson scheme by reasoning that if G has a Godsil-McKay switching set, then it has a switching set which includes vertex 1. While the code (in its current state) is tuned to this specific problem, the method of examining each induced subgraph of G can be easily re-written to check for any user specified conditions on the subgraphs and can therefore be used much more broadly.
Chromatic polynomials of random graphs
NASA Astrophysics Data System (ADS)
Van Bussel, Frank; Ehrlich, Christoph; Fliegner, Denny; Stolzenberg, Sebastian; Timme, Marc
2010-04-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.
Khovanov homology of graph-links
Nikonov, Igor M
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.
Principal Graph and Structure Learning Based on Reversed Graph Embedding.
Mao, Qi; Wang, Li; Tsang, Ivor; Sun, Yijun
2016-12-05
Many scientific datasets are of high dimension, and the analysis usually requires retaining the most important structures of data. Principal curve is a widely used approach for this purpose. However, many existing methods work only for data with structures that are mathematically formulated by curves, which is quite restrictive for real applications. A few methods can overcome the above problem, but they either require complicated human-made rules for a specific task with lack of adaption flexibility to different tasks, or cannot obtain explicit structures of data. To address these issues, we develop a novel principal graph and structure learning framework that captures the local information of the underlying graph structure based on reversed graph embedding. As showcases, models that can learn a spanning tree or a weighted undirected `1 graph are proposed, and a new learning algorithm is developed that learns a set of principal points and a graph structure from data, simultaneously. The new algorithm is simple with guaranteed convergence. We then extend the proposed framework to deal with large-scale data. Experimental results on various synthetic and six real world datasets show that the proposed method compares favorably with baselines and can uncover the underlying structure correctly.
GraphMeta: Managing HPC Rich Metadata in Graphs
Dai, Dong; Chen, Yong; Carns, Philip; Jenkins, John; Zhang, Wei; Ross, Robert
2016-01-01
High-performance computing (HPC) systems face increasingly critical metadata management challenges, especially in the approaching exascale era. These challenges arise not only from exploding metadata volumes, but also from increasingly diverse metadata, which contains data provenance and arbitrary user-defined attributes in addition to traditional POSIX metadata. This ‘rich’ metadata is becoming critical to supporting advanced data management functionality such as data auditing and validation. In our prior work, we identified a graph-based model as a promising solution to uniformly manage HPC rich metadata due to its flexibility and generality. However, at the same time, graph-based HPC rich metadata anagement also introduces significant challenges to the underlying infrastructure. In this study, we first identify the challenges on the underlying infrastructure to support scalable, high-performance rich metadata management. Based on that, we introduce GraphMeta, a graphbased engine designed for this use case. It achieves performance scalability by introducing a new graph partitioning algorithm and a write-optimal storage engine. We evaluate GraphMeta under both synthetic and real HPC metadata workloads, compare it with other approaches, and demonstrate its advantages in terms of efficiency and usability for rich metadata management in HPC systems.
Private Graphs - Access Rights on Graphs for Seamless Navigation
NASA Astrophysics Data System (ADS)
Dorner, W.; Hau, F.; Pagany, R.
2016-06-01
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.
Laurinyecz, Barbara; Péter, Mária; Vedelek, Viktor; Kovács, Attila L.; Juhász, Gábor; Maróy, Péter; Vígh, László; Balogh, Gábor; Sinka, Rita
2016-01-01
Drosophila spermatogenesis is an ideal system to study the effects of changes in lipid composition, because spermatid elongation and individualization requires extensive membrane biosynthesis and remodelling. The bulk of transcriptional activity is completed with the entry of cysts into meiotic division, which makes post-meiotic stages of spermatogenesis very sensitive to even a small reduction in gene products. In this study, we describe the effect of changes in lipid composition during spermatogenesis using a hypomorphic male sterile allele of the Drosophila CDP-DAG synthase (CdsA) gene. We find that the CdsA mutant shows defects in spermatid individualization and enlargement of mitochondria and the axonemal sheath of the spermatids. Furthermore, we could genetically rescue the male sterile phenotype by overexpressing Phosphatidylinositol synthase (dPIS) in a CdsA mutant background. The results of lipidomic and genetic analyses of the CdsA mutant highlight the importance of correct lipid composition during sperm development and show that phosphatidic acid levels are crucial in late stages of spermatogenesis. PMID:26791243
Sharing Teaching Ideas: Graphing Families of Curves Using Transformations of Reference Graphs
ERIC Educational Resources Information Center
Kukla, David
2007-01-01
This article provides for a fast extremely accurate approach to graphing functions that is based on learning function reference graphs and then applying algebraic transformations to these reference graphs.
Malver, Olaf; Sebastian, Mina J; Oppenheimer, Norman J
2014-11-01
A new, acyclic NAD-analog, acycloNAD(+) has been synthesized where the nicotinamide ribosyl moiety has been replaced by the nicotinamide (2-hydroxyethoxy)methyl moiety. The chemical properties of this analog are comparable to those of β-NAD(+) with a redox potential of -324mV and a 341nm λmax for the reduced form. Both yeast alcohol dehydrogenase (YADH) and horse liver alcohol dehydrogenase (HLADH) catalyze the reduction of acycloNAD(+) by primary alcohols. With HLADH 1-butanol has the highest Vmax at 49% that of β-NAD(+). The primary deuterium kinetic isotope effect is greater than 3 indicating a significant contribution to the rate limiting step from cleavage of the carbon-hydrogen bond. The stereochemistry of the hydride transfer in the oxidation of stereospecifically deuterium labeled n-butanol is identical to that for the reaction with β-NAD(+). In contrast to the activity toward primary alcohols there is no detectable reduction of acycloNAD(+) by secondary alcohols with HLADH although these alcohols serve as competitive inhibitors. The net effect is that acycloNAD(+) has converted horse liver ADH from a broad spectrum alcohol dehydrogenase, capable of utilizing either primary or secondary alcohols, into an exclusively primary alcohol dehydrogenase. This is the first example of an NAD analog that alters the substrate specificity of a dehydrogenase and, like site-directed mutagenesis of proteins, establishes that modifications of the coenzyme distance from the active site can be used to alter enzyme function and substrate specificity. These and other results, including the activity with α-NADH, clearly demonstrate the promiscuity of the binding interactions between dehydrogenases and the riboside phosphate of the nicotinamide moiety, thus greatly expanding the possibilities for the design of analogs and inhibitors of specific dehydrogenases.
Methoxymethyl (MOM) group nitrogen protection of pyrimidines bearing C-6 acyclic side-chains.
Kraljević, Tatjana Gazivoda; Petrović, Martina; Krištafor, Svjetlana; Makuc, Damjan; Plavec, Janez; Ross, Tobias L; Ametamey, Simon M; Raić-Malić, Silvana
2011-06-20
Novel N-methoxymethylated (MOM) pyrimidine (4-13) and pyrimidine-2,4-diones (15-17) nucleoside mimetics in which an isobutyl side-chain is attached at the C-6 position of the pyrimidine moiety were synthesized. Synthetic methods via O-persilylated or N-anionic uracil derivatives have been evaluated for the synthesis of N-1- and/or N-3-MOM pyrimidine derivatives with C-6 acyclic side-chains. A synthetic approach using an activated N-anionic pyrimidine derivative afforded the desired N,N-1,3-diMOM and N-1-MOM pyrimidines 4 and 5 in good yield. Introduction of fluorine into the side-chain was performed with DAST as the fluorinating reagent to give a N,N-1,3-diMOM pyrimidine 13 with a 1-fluoro-3-hydroxyisobutyl moiety at C-6. Conformational study of the monotritylated N-1-MOM pyrimidine 12 by the use of the NOE experiments revealed the predominant conformation of the compound to be one where the hydroxymethyl group in the C-6 side-chain is close to the N-1-MOM moiety, while the OMTr is in proximity to the CH(3)-5 group. Contrary to this no NOE enhancements between the N-1-MOM group and hydroxymethyl or fluoromethyl protons in 13 were observed, which suggested a nonrestricted rotation along the C-6 side-chain. Fluorinated N,N-1,3-diMOM pyrimidine 13 emerged as a model compound for development of tracer molecules for non-invasive imaging of gene expression using positron emission tomography (PET).
Graph classification by means of Lipschitz embedding.
Riesen, Kaspar; Bunke, Horst
2009-12-01
In pattern recognition and related fields, graph-based representations offer a versatile alternative to the widely used feature vectors. Therefore, an emerging trend of representing objects by graphs can be observed. This trend is intensified by the development of novel approaches in graph-based machine learning, such as graph kernels or graph-embedding techniques. These procedures overcome a major drawback of graphs, which consists of a serious lack of algorithms for classification. This paper is inspired by the idea of representing graphs through dissimilarities and extends our previous work to the more general setting of Lipschitz embeddings. In an experimental evaluation, we empirically confirm that classifiers that rely on the original graph distances can be outperformed by a classification system using the Lipschitz embedded graphs.
Algebraic connectivity and graph robustness.
Feddema, John Todd; Byrne, Raymond Harry; Abdallah, Chaouki T.
2009-07-01
Recent papers have used Fiedler's definition of algebraic connectivity to show that network robustness, as measured by node-connectivity and edge-connectivity, can be increased by increasing the algebraic connectivity of the network. By the definition of algebraic connectivity, the second smallest eigenvalue of the graph Laplacian is a lower bound on the node-connectivity. In this paper we show that for circular random lattice graphs and mesh graphs algebraic connectivity is a conservative lower bound, and that increases in algebraic connectivity actually correspond to a decrease in node-connectivity. This means that the networks are actually less robust with respect to node-connectivity as the algebraic connectivity increases. However, an increase in algebraic connectivity seems to correlate well with a decrease in the characteristic path length of these networks - which would result in quicker communication through the network. Applications of these results are then discussed for perimeter security.
Graph Analytics for Signature Discovery
Hogan, Emilie A.; Johnson, John R.; Halappanavar, Mahantesh; Lo, Chaomei
2013-06-01
Within large amounts of seemingly unstructured data it can be diffcult to find signatures of events. In our work we transform unstructured data into a graph representation. By doing this we expose underlying structure in the data and can take advantage of existing graph analytics capabilities, as well as develop new capabilities. Currently we focus on applications in cybersecurity and communication domains. Within cybersecurity we aim to find signatures for perpetrators using the pass-the-hash attack, and in communications we look for emails or phone calls going up or down a chain of command. In both of these areas, and in many others, the signature we look for is a path with certain temporal properties. In this paper we discuss our methodology for finding these temporal paths within large graphs.
Graph modeling systems and methods
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.
Sequential visibility-graph motifs
NASA Astrophysics Data System (ADS)
Iacovacci, Jacopo; Lacasa, Lucas
2016-04-01
Visibility algorithms transform time series into graphs and encode dynamical information in their topology, paving the way for graph-theoretical time series analysis as well as building a bridge between nonlinear dynamics and network science. In this work we introduce and study the concept of sequential visibility-graph motifs, smaller substructures of n consecutive nodes that appear with characteristic frequencies. We develop a theory to compute in an exact way the motif profiles associated with general classes of deterministic and stochastic dynamics. We find that this simple property is indeed a highly informative and computationally efficient feature capable of distinguishing among different dynamics and robust against noise contamination. We finally confirm that it can be used in practice to perform unsupervised learning, by extracting motif profiles from experimental heart-rate series and being able, accordingly, to disentangle meditative from other relaxation states. Applications of this general theory include the automatic classification and description of physical, biological, and financial time series.
NASA Astrophysics Data System (ADS)
Algor, Ilan
1988-03-01
The problem concerns the minimum time in which a number of messages can be transmitted through a communication network in which each node can transmit to many other nodes simultaneously but can receive only one message at a time. In the undirected version of the problem, the graphs, G, representing the messages are finite, undirected and simple; the messages transmitted in unit time form a subgraph which is a star. The star aboricity, st(G) of a graph G is the minimum number of star forests whose union covers all edges of G. A maximum value is derived for the star aboricity of any d-regular graph G, and is proved through probabilistic arguments.
Optimal preparation of graph states
Cabello, Adan; Lopez-Tarrida, Antonio J.; Danielsen, Lars Eirik; Portillo, Jose R.
2011-04-15
We show how to prepare any graph state of up to 12 qubits with (a) the minimum number of controlled-Z gates and (b) the minimum preparation depth. We assume only one-qubit and controlled-Z gates. The method exploits the fact that any graph state belongs to an equivalence class under local Clifford operations. We extend up to 12 qubits the classification of graph states according to their entanglement properties, and identify each class using only a reduced set of invariants. For any state, we provide a circuit with both properties (a) and (b), if it does exist, or, if it does not, one circuit with property (a) and one with property (b), including the explicit one-qubit gates needed.
Rosmanis, Ansis
2011-02-15
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.
Topalis, D; Alvarez, K; Barral, K; Munier-Lehmann, H; Schneider, B; Véron, M; Guerreiro, C; Mulard, L; El-Amri, C; Canard, B; Deville-Bonne, D
2008-04-01
Adenylate kinases are involved in the activation of antiviral drugs such as the acyclic phosphonates analogs PMEA and (R)PMPA. We examine the in vitro phosphorylation of PMEA and PMPA bearing a borano- or a H- group on the phosphorus atom. The alpha-borano or alpha-H on PMEA and PMPA were detrimental to the activity of recombinant human AMP kinases 1 and 2. Docking PMEA to the active site of AMP kinase 1 indicated that the borano group may prevent two conserved critical Arg interactions with the alpha-phosphate, resulting in substrate bad positioning.
NASA Technical Reports Server (NTRS)
Cronin, J. R.; Pizzarello, S.; Yuen, G. U.
1985-01-01
The five-carbon acyclic primary beta, gamma, and delta amino alkanoic acids of the Murchison meteorite are studied using gas chromatography-mass spectrometry and ion exchange chromatography. The chromatograms reveal that alpha is the most abundant monoamino alkanoic acid followed by gamma and beta, and an exponential increase in the amount of amino acid is observed as the carbon number increases in the homologous series. The influence of frictional heating, spontaneous thermal decomposition, and radiation of the synthesis of amino acids is examined. The data obtained support an amino acid synthesis process involving random combination of single-carbon precursors.
Bruffaerts, J; Pierrot, D; Marek, I
2016-11-08
The molding of molecules through remote functionalisation has increasingly become popular as it provides original and flexible synthetic alternatives to classical retrosynthetic analysis. In this Perspective article, we summarise more than a decade of studies in the specific field of remote activation of inert C-C and C-O bonds using the unique abilities of organozirconocene species mainly from our own research group. By demonstrating that these reactions represent novel and powerful entries towards acyclic stereodefined reactive organometallic species, we aim to show the vast opportunities this concept-driven methodology discovery offers.
Interacting particle systems on graphs
NASA Astrophysics Data System (ADS)
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
Synchronizability of random rectangular graphs
Estrada, Ernesto Chen, Guanrong
2015-08-15
Random rectangular graphs (RRGs) represent a generalization of the random geometric graphs in which the nodes are embedded into hyperrectangles instead of on hypercubes. The synchronizability of RRG model is studied. Both upper and lower bounds of the eigenratio of the network Laplacian matrix are determined analytically. It is proven that as the rectangular network is more elongated, the network becomes harder to synchronize. The synchronization processing behavior of a RRG network of chaotic Lorenz system nodes is numerically investigated, showing complete consistence with the theoretical results.
Boosting for multi-graph classification.
Wu, Jia; Pan, Shirui; Zhu, Xingquan; Cai, Zhihua
2015-03-01
In this paper, we formulate a novel graph-based learning problem, multi-graph classification (MGC), which aims to learn a classifier from a set of labeled bags each containing a number of graphs inside the bag. A bag is labeled positive, if at least one graph in the bag is positive, and negative otherwise. Such a multi-graph representation can be used for many real-world applications, such as webpage classification, where a webpage can be regarded as a bag with texts and images inside the webpage being represented as graphs. This problem is a generalization of multi-instance learning (MIL) but with vital differences, mainly because instances in MIL share a common feature space whereas no feature is available to represent graphs in a multi-graph bag. To solve the problem, we propose a boosting based multi-graph classification framework (bMGC). Given a set of labeled multi-graph bags, bMGC employs dynamic weight adjustment at both bag- and graph-levels to select one subgraph in each iteration as a weak classifier. In each iteration, bag and graph weights are adjusted such that an incorrectly classified bag will receive a higher weight because its predicted bag label conflicts to the genuine label, whereas an incorrectly classified graph will receive a lower weight value if the graph is in a positive bag (or a higher weight if the graph is in a negative bag). Accordingly, bMGC is able to differentiate graphs in positive and negative bags to derive effective classifiers to form a boosting model for MGC. Experiments and comparisons on real-world multi-graph learning tasks demonstrate the algorithm performance.
Approximate Graph Edit Distance in Quadratic Time.
Riesen, Kaspar; Ferrer, Miquel; Bunke, Horst
2015-09-14
Graph edit distance is one of the most flexible and general graph matching models available. The major drawback of graph edit distance, however, is its computational complexity that restricts its applicability to graphs of rather small size. Recently the authors of the present paper introduced a general approximation framework for the graph edit distance problem. The basic idea of this specific algorithm is to first compute an optimal assignment of independent local graph structures (including substitutions, deletions, and insertions of nodes and edges). This optimal assignment is complete and consistent with respect to the involved nodes of both graphs and can thus be used to instantly derive an admissible (yet suboptimal) solution for the original graph edit distance problem in O(n3) time. For large scale graphs or graph sets, however, the cubic time complexity may still be too high. Therefore, we propose to use suboptimal algorithms with quadratic rather than cubic time for solving the basic assignment problem. In particular, the present paper introduces five different greedy assignment algorithms in the context of graph edit distance approximation. In an experimental evaluation we show that these methods have great potential for further speeding up the computation of graph edit distance while the approximated distances remain sufficiently accurate for graph based pattern classification.
NASA Astrophysics Data System (ADS)
Marcel Müller, Christian; Mengel, Kurt; Singh Thangjam, Guneshwar; Weckwerth, Gerd
2016-04-01
The HED meteorites, a clan of stony achondrites, are believed to originate from asteroid (4) Vesta (e.g. Mittlefehldt et al. (2015)). Recent evolution models (e.g. Toplis et al. (2013)) and observations from Dawn spacecraft data (e.g., Prettyman et al. (2013)) indicate that diogenites form the lower crust and uppermost mantle of (4) Vesta. Deep seated material excavated by large impacts such as the Rheasilvia- and Veneneiaforming event should be present in howardites. We analysed a slice of howardite DaG 779 which had been recovered from the Libyan Desert in 1999 and was briefly described by Grossmann (2000). The data presented here include electron microprobe, bulk-rock XRD and XRF as well as trace element analysis by ICP-MS and INA. The petrographic results confirm earlier observations that DaG 779 is polymict and mainly contains diogenite and eucrite clasts. Mass balance calculations using bulk-rock and microprobe major element data reveal a modal mineralogy of 77% orthopyroxene, 8% plagioclase, 7% clinopyroxene and 2% spinels, the rest being olivine, SiO2-phases, sulphides, and native Fe(Ni). When compared with the element compilation recently reported by Mittlefehldt (2015) the 39 trace element analysed here (including REE and PGE) confirm that this howardite is clearly dominated by diogenite. Beside the modal petrographic information, a number of more detailed observations obtained from microprobe investigations reveal fresh and recrystallized glasses, troilite-orthopyroxene symplectites from a mixed silicate-sulphide melt giving rise to graphic intergrowths as well as vermicular and reticular FeS in highly disrupted clasts. While the origin of the FeS in these clasts is not clear yet, its particular shape and distribution indicates that this mineral has been (partially) molten and recrystallized from a sulphide melt. The silicate minerals around these FeS occurrences are recrystallized but there is no indication for a partial silicate melt. Further
Comparison Graph of Sea Ice Minimum - 2010
This animated graph tracks the retreat of sea ice, measured in millions of square kilometers, averaged from the start of the satellite record in 1979 through 2000 (white). Next, the graph follows t...
Mathematical Minute: Rotating a Function Graph
ERIC Educational Resources Information Center
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.
Standard Distributions: One Graph Fits All
ERIC Educational Resources Information Center
Wagner, Clifford H.
2007-01-01
Standard distributions are ubiquitous but not unique. With suitable scaling, the graph of a standard distribution serves as the graph for every distribution in the family. The standard exponential can easily be taught in elementary statistics courses.
Graphing and Social Studies: An Interdisciplinary Activity.
ERIC Educational Resources Information Center
Brehm, Julia L.
1996-01-01
Describes a graphing activity that promotes mathematical connections with social studies lessons. Students should be familiar with graphing on the Cartesian coordinate system to play this variation of the game Battleship on maps of various regions of the world. (AIM)
Torsional rigidity, isospectrality and quantum graphs
NASA Astrophysics Data System (ADS)
Colladay, Don; Kaganovskiy, Leon; McDonald, Patrick
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.
Humidity Graphs for All Seasons.
ERIC Educational Resources Information Center
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)
NASA Astrophysics Data System (ADS)
Prudente, Matthew James
Given a graph G with pebbles on the vertices, we define a pebbling move as removing two pebbles from a vertex u, placing one pebble on a neighbor v, and discarding the other pebble, like a toll. The pebbling number pi( G) is the least number of pebbles needed so that every arrangement of pi(G) pebbles can place a pebble on any vertex through a sequence of pebbling moves. We introduce a new variation on graph pebbling called two-player pebbling. In this, players called the mover and the defender alternate moves, with the stipulation that the defender cannot reverse the previous move. The mover wins only if they can place a pebble on a specified vertex and the defender wins if the mover cannot. We define η(G), analogously, as the minimum number of pebbles such that given every configuration of the η( G) pebbles and every specified vertex r, the mover has a winning strategy. First, we will investigate upper bounds for η( G) on various classes of graphs and find a certain structure for which the defender has a winning strategy, no matter how many pebbles are in a configuration. Then, we characterize winning configurations for both players on a special class of diameter 2 graphs. Finally, we show winning configurations for the mover on paths using a recursive argument.
Graphs and Enhancing Maple Multiplication.
ERIC Educational Resources Information Center
Cecil, David R.; Wang, Rongdong
2002-01-01
Description of a technique in Maple programming language that automatically prints all paths of any desired length along with the name of each vertex, proceeding in order from the beginning vertex to the ending vertex for a given graph. (Author/MM)
Fibonacci Identities, Matrices, and Graphs
ERIC Educational Resources Information Center
Huang, Danrun
2005-01-01
General strategies used to help discover, prove, and generalize identities for Fibonacci numbers are described along with some properties about the determinants of square matrices. A matrix proof for identity (2) that has received immense attention from many branches of mathematics, like linear algebra, dynamical systems, graph theory and others…
Ancestral Genres of Mathematical Graphs
ERIC Educational Resources Information Center
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…
Situating Graphs as Workplace Knowledge
ERIC Educational Resources Information Center
Noss, Richard; Bakker, Arthur; Hoyles, Celia; Kent, Phillip
2007-01-01
We investigate the use and knowledge of graphs in the context of a large industrial factory. We are particularly interested in the question of "transparency", a question that has been extensively considered in the general literature on tool use and, more recently, by Michael Roth and his colleagues in the context of scientific work. Roth uses the…
Conceptual graphs for semantics and knowledge processing
Fargues, J.; Landau, M.C.; Dugourd, A.; Catach, L.
1986-01-01
This paper discusses the representational and algorithmic power of the conceptual graph model for natural language semantics and knowledge processing. Also described is a Prolog-like resolution method for conceptual graphs, which allows to perform deduction on very large semantic domains. The interpreter developed is similar to a Prolog interpreter in which the terms are any conceptual graphs and in which the unification algorithm is replaced by a specialized algorithm for conceptual graphs.
Claw-Free Maximal Planar Graphs
1989-01-01
0, 1,2 and 3 points of degree 6 respectively.) Now suppose G,. has no claws for 3 < r < i and consider graph G ,+,. Graph G,+ 1 is obtained from Gr by...adjacent to a point v by N(v) and call the induced subgraph GiN(v)] the neighborhood graph of v in G . Graph G is said to be locally n-connected if for all
Chemical Applications of Graph Theory: Part II. Isomer Enumeration.
ERIC Educational Resources Information Center
Hansen, Peter J.; Jurs, Peter C.
1988-01-01
Discusses the use of graph theory to aid in the depiction of organic molecular structures. Gives a historical perspective of graph theory and explains graph theory terminology with organic examples. Lists applications of graph theory to current research projects. (ML)
Marnett, Lawrence J; Cohen, Samuel M; Fukushima, Shoji; Gooderham, Nigel J; Hecht, Stephen S; Rietjens, Ivonne M C M; Smith, Robert L; Adams, Timothy B; Bastaki, Maria; Harman, Christie L; McGowen, Margaret M; Taylor, Sean V
2014-04-01
This publication is the 1st in a series of publications by the Expert Panel of the Flavor and Extract Manufacturers Assoc. summarizing the Panel's 3rd re-evaluation of Generally Recognized as Safe (GRAS) status referred to as the GRASr2 program. In 2011, the Panel initiated a comprehensive program to re-evaluate the safety of more than 2700 flavor ingredients that have previously met the criteria for GRAS status under conditions of intended use as flavor ingredients. Elements that are fundamental to the safety evaluation of flavor ingredients include exposure, structural analogy, metabolism, pharmacokinetics, and toxicology. Flavor ingredients are evaluated individually and in the context of the available scientific information on the group of structurally related substances. Scientific data relevant to the safety evaluation of the use of aliphatic acyclic and alicyclic terpenoid tertiary alcohols and structurally related substances as flavoring ingredients are evaluated. The group of aliphatic acyclic and alicyclic terpenoid tertiary alcohols and structurally related substances was reaffirmed as GRAS (GRASr2) based, in part, on their rapid absorption, metabolic detoxication, and excretion in humans and other animals; their low level of flavor use; the wide margins of safety between the conservative estimates of intake and the no-observed-adverse effect levels determined from subchronic studies and the lack of significant genotoxic and mutagenic potential.
Collaborative Robotic Instruction: A Graph Teaching Experience
ERIC Educational Resources Information Center
Mitnik, Ruben; Recabarren, Matias; Nussbaum, Miguel; Soto, Alvaro
2009-01-01
Graphing is a key skill in the study of Physics. Drawing and interpreting graphs play a key role in the understanding of science, while the lack of these has proved to be a handicap and a limiting factor in the learning of scientific concepts. It has been observed that despite the amount of previous graph-working experience, students of all ages…
47 CFR 80.761 - Conversion graphs.
Code of Federal Regulations, 2012 CFR
2012-10-01
... 47 Telecommunication 5 2012-10-01 2012-10-01 false Conversion graphs. 80.761 Section 80.761... 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...
Positive and Unlabeled Multi-Graph Learning.
Wu, Jia; Pan, Shirui; Zhu, Xingquan; Zhang, Chengqi; Wu, Xindong
2016-03-23
In this paper, we advance graph classification to handle multi-graph learning for complicated objects, where each object is represented as a bag of graphs and the label is only available to each bag but not individual graphs. In addition, when training classifiers, users are only given a handful of positive bags and many unlabeled bags, and the learning objective is to train models to classify previously unseen graph bags with maximum accuracy. To achieve the goal, we propose a positive and unlabeled multi-graph learning (puMGL) framework to first select informative subgraphs to convert graphs into a feature space. To utilize unlabeled bags for learning, puMGL assigns a confidence weight to each bag and dynamically adjusts its weight value to select "reliable negative bags." A number of representative graphs, selected from positive bags and identified reliable negative graph bags, form a "margin graph pool" which serves as the base for deriving subgraph patterns, training graph classifiers, and further updating the bag weight values. A closed-loop iterative process helps discover optimal subgraphs from positive and unlabeled graph bags for learning. Experimental comparisons demonstrate the performance of puMGL for classifying real-world complicated objects.
47 CFR 80.761 - Conversion graphs.
Code of Federal Regulations, 2013 CFR
2013-10-01
... 47 Telecommunication 5 2013-10-01 2013-10-01 false Conversion graphs. 80.761 Section 80.761... 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...
47 CFR 80.761 - Conversion graphs.
Code of Federal Regulations, 2010 CFR
2010-10-01
... 47 Telecommunication 5 2010-10-01 2010-10-01 false Conversion graphs. 80.761 Section 80.761... 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...
ERIC Educational Resources Information Center
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…
So Many Graphs, So Little Time
ERIC Educational Resources Information Center
Wall, Jennifer J.; Benson, Christine C.
2009-01-01
Interpreting graphs found in various content areas is an important skill for students, especially in light of high-stakes testing. In addition, reading and understanding graphs is an important part of numeracy, or numeric literacy, a skill necessary for informed citizenry. This article explores the different categories of graphs, provides…
47 CFR 80.761 - Conversion graphs.
Code of Federal Regulations, 2011 CFR
2011-10-01
... 47 Telecommunication 5 2011-10-01 2011-10-01 false Conversion graphs. 80.761 Section 80.761... 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...
47 CFR 80.761 - Conversion graphs.
Code of Federal Regulations, 2014 CFR
2014-10-01
... 47 Telecommunication 5 2014-10-01 2014-10-01 false Conversion graphs. 80.761 Section 80.761... 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...
Teaching and Assessing Graphing Using Active Learning
ERIC Educational Resources Information Center
McFarland, Jenny
2010-01-01
As a college biology instructor, I often see graphs in lab reports that do not meet my expectations. I also observe that many college students do not always adequately differentiate between good and poor (or misleading) graphs. The activity described in this paper is the result of my work with students to improve their graphing literacy. The…
Some Applications of Graph Theory to Clustering
ERIC Educational Resources Information Center
Hubert, Lawrence J.
1974-01-01
The connection between graph theory and clustering is reviewed and extended. Major emphasis is on restating, in a graph-theoretic context, selected past work in clustering, and conversely, developing alternative strategies from several standard concepts used in graph theory per se. (Author/RC)
Graph Partitioning Models for Parallel Computing
Hendrickson, B.; Kolda, T.G.
1999-03-02
Calculations can naturally be described as graphs in which vertices represent computation and edges reflect data dependencies. By partitioning the vertices of a graph, the calculation can be divided among processors of a parallel computer. However, the standard methodology for graph partitioning minimizes the wrong metric and lacks expressibility. We survey several recently proposed alternatives and discuss their relative merits.
NASA Astrophysics Data System (ADS)
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.
Dense Trivalent Graphs for Processor Interconnection,
1981-01-01
this paper is organized as follows: Sec- tion 2 introduces notation and defines the new family of graphs, which we call Moebius graphs. Section 3...the shuffle exchange [9].) Let Id denote the identity function on 2 The Moebius graph of order n (so named because the function f introduces a loop...We will write vk = p(v ). 3. DIAMETER OF THE MOEBIUS GRAPH In this section we will show that the diameter of the Moe- bius graph is bounded by L3/2 nj
Stability Properties of Inclusive Connectivity for Graphs
1993-12-01
of G . Graphs illustrating the two possible relationships between the three inclusive connectivity parameters for edges are shown in Figures 2.12 and...For simplicity in this section, we will call this graph G the "internal G graph " due to its location in the figures, and the "K4 with one edge doubly...to one copy of the subdivided K4 producing the graph in Figure 5.25. 117 1(4 with one edge Internal G graph K4 with one edge Figure 5.24 The
Proving relations between modular graph functions
NASA Astrophysics Data System (ADS)
Basu, Anirban
2016-12-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.
NASA Technical Reports Server (NTRS)
Barmore, Bryan; Johnson, Edward; Wing, David J.; Barhydt, Richard
2003-01-01
A human-in-the-loop experiment was performed at the NASA Langley Research Center to study the feasibility of Distributed Air/Ground Traffic Management (DAG-TM) autonomous aircraft operations in highly constrained airspace. The airspace was constrained by a pair of special use airspace (SUA) regions on either side of the pilot s planned route. The available airspace was further varied by changing the separation standard for lateral separation between 3 nm and 5 nm. The pilot had to maneuver through the corridor between the SUA s, avoid other traffic and meet flow management constraints. Traffic flow management (TFM) constraints were imposed as a required time of arrival and crossing altitude at an en route fix. This is a follow-up study to work presented at the 4th USA/Europe Air Traffic Management R&D Seminar in December 2001. Nearly all of the pilots were able to meet their TFM constraints while maintaining adequate separation from other traffic. In only 3 out of 59 runs were the pilots unable to meet their required time of arrival. Two loss of separation cases are studied and it is found that the pilots need conflict prevention information presented in a clearer manner. No degradation of performance or safety was seen between the wide and narrow corridors. Although this was not a thorough study of the consequences of reducing the en route lateral separation, nothing was found that would refute the feasibility of reducing the separation requirement from 5 nm to 3 nm. The creation of additional, second-generation conflicts is also investigated. Two resolution methods were offered to the pilots: strategic and tactical. The strategic method is a closed-loop alteration to the Flight Management System (FMS) active route that considers other traffic as well as TFM constraints. The tactical resolutions are short-term resolutions that leave avoiding other traffic conflicts and meeting the TFM constraints to the pilot. Those that made use of the strategic tools avoided
Generalized graph states based on Hadamard matrices
Cui, Shawn X.; Yu, Nengkun; Zeng, Bei
2015-07-15
Graph states are widely used in quantum information theory, including entanglement theory, quantum error correction, and one-way quantum computing. Graph states have a nice structure related to a certain graph, which is given by either a stabilizer group or an encoding circuit, both can be directly given by the graph. To generalize graph states, whose stabilizer groups are abelian subgroups of the Pauli group, one approach taken is to study non-abelian stabilizers. In this work, we propose to generalize graph states based on the encoding circuit, which is completely determined by the graph and a Hadamard matrix. We study the entanglement structures of these generalized graph states and show that they are all maximally mixed locally. We also explore the relationship between the equivalence of Hadamard matrices and local equivalence of the corresponding generalized graph states. This leads to a natural generalization of the Pauli (X, Z) pairs, which characterizes the local symmetries of these generalized graph states. Our approach is also naturally generalized to construct graph quantum codes which are beyond stabilizer codes.
Constrained Graph Optimization: Interdiction and Preservation Problems
Schild, Aaron V
2012-07-30
The maximum flow, shortest path, and maximum matching problems are a set of basic graph problems that are critical in theoretical computer science and applications. Constrained graph optimization, a variation of these basic graph problems involving modification of the underlying graph, is equally important but sometimes significantly harder. In particular, one can explore these optimization problems with additional cost constraints. In the preservation case, the optimizer has a budget to preserve vertices or edges of a graph, preventing them from being deleted. The optimizer wants to find the best set of preserved edges/vertices in which the cost constraints are satisfied and the basic graph problems are optimized. For example, in shortest path preservation, the optimizer wants to find a set of edges/vertices within which the shortest path between two predetermined points is smallest. In interdiction problems, one deletes vertices or edges from the graph with a particular cost in order to impede the basic graph problems as much as possible (for example, delete edges/vertices to maximize the shortest path between two predetermined vertices). Applications of preservation problems include optimal road maintenance, power grid maintenance, and job scheduling, while interdiction problems are related to drug trafficking prevention, network stability assessment, and counterterrorism. Computational hardness results are presented, along with heuristic methods for approximating solutions to the matching interdiction problem. Also, efficient algorithms are presented for special cases of graphs, including on planar graphs. The graphs in many of the listed applications are planar, so these algorithms have important practical implications.
On a programming language for graph algorithms
NASA Technical Reports Server (NTRS)
Rheinboldt, W. C.; Basili, V. R.; Mesztenyi, C. K.
1971-01-01
An algorithmic language, GRAAL, is presented for describing and implementing graph algorithms of the type primarily arising in applications. The language is based on a set algebraic model of graph theory which defines the graph structure in terms of morphisms between certain set algebraic structures over the node set and arc set. GRAAL is modular in the sense that the user specifies which of these mappings are available with any graph. This allows flexibility in the selection of the storage representation for different graph structures. In line with its set theoretic foundation, the language introduces sets as a basic data type and provides for the efficient execution of all set and graph operators. At present, GRAAL is defined as an extension of ALGOL 60 (revised) and its formal description is given as a supplement to the syntactic and semantic definition of ALGOL. Several typical graph algorithms are written in GRAAL to illustrate various features of the language and to show its applicability.
Efficient Graph Sequence Mining Using Reverse Search
NASA Astrophysics Data System (ADS)
Inokuchi, Akihiro; Ikuta, Hiroaki; Washio, Takashi
The mining of frequent subgraphs from labeled graph data has been studied extensively. Furthermore, much attention has recently been paid to frequent pattern mining from graph sequences. A method, called GTRACE, has been proposed to mine frequent patterns from graph sequences under the assumption that changes in graphs are gradual. Although GTRACE mines the frequent patterns efficiently, it still needs substantial computation time to mine the patterns from graph sequences containing large graphs and long sequences. In this paper, we propose a new version of GTRACE that permits efficient mining of frequent patterns based on the principle of a reverse search. The underlying concept of the reverse search is a general scheme for designing efficient algorithms for hard enumeration problems. Our performance study shows that the proposed method is efficient and scalable for mining both long and large graph sequence patterns and is several orders of magnitude faster than the original GTRACE.
Fast Approximate Quadratic Programming for Graph Matching
Vogelstein, Joshua T.; Conroy, John M.; Lyzinski, Vince; Podrazik, Louis J.; Kratzer, Steven G.; Harley, Eric T.; Fishkind, Donniell E.; Vogelstein, R. Jacob; Priebe, Carey E.
2015-01-01
Quadratic assignment problems arise in a wide variety of domains, spanning operations research, graph theory, computer vision, and neuroscience, to name a few. The graph matching problem is a special case of the quadratic assignment problem, and graph matching is increasingly important as graph-valued data is becoming more prominent. With the aim of efficiently and accurately matching the large graphs common in big data, we present our graph matching algorithm, the Fast Approximate Quadratic assignment algorithm. We empirically demonstrate that our algorithm is faster and achieves a lower objective value on over 80% of the QAPLIB benchmark library, compared with the previous state-of-the-art. Applying our algorithm to our motivating example, matching C. elegans connectomes (brain-graphs), we find that it efficiently achieves performance. PMID:25886624
Molecular graph convolutions: moving beyond fingerprints.
Kearnes, Steven; McCloskey, Kevin; Berndl, Marc; Pande, Vijay; Riley, Patrick
2016-08-01
Molecular "fingerprints" encoding structural information are the workhorse of cheminformatics and machine learning in drug discovery applications. However, fingerprint representations necessarily emphasize particular aspects of the molecular structure while ignoring others, rather than allowing the model to make data-driven decisions. We describe molecular graph convolutions, a machine learning architecture for learning from undirected graphs, specifically small molecules. Graph convolutions use a simple encoding of the molecular graph-atoms, bonds, distances, etc.-which allows the model to take greater advantage of information in the graph structure. Although graph convolutions do not outperform all fingerprint-based methods, they (along with other graph-based methods) represent a new paradigm in ligand-based virtual screening with exciting opportunities for future improvement.
The Feynman Identity for Planar Graphs
NASA Astrophysics Data System (ADS)
da Costa, G. A. T. F.
2016-08-01
The Feynman identity (FI) of a planar graph relates the Euler polynomial of the graph to an infinite product over the equivalence classes of closed nonperiodic signed cycles in the graph. The main objectives of this paper are to compute the number of equivalence classes of nonperiodic cycles of given length and sign in a planar graph and to interpret the data encoded by the FI in the context of free Lie superalgebras. This solves in the case of planar graphs a problem first raised by Sherman and sets the FI as the denominator identity of a free Lie superalgebra generated from a graph. Other results are obtained. For instance, in connection with zeta functions of graphs.
Fast approximate quadratic programming for graph matching.
Vogelstein, Joshua T; Conroy, John M; Lyzinski, Vince; Podrazik, Louis J; Kratzer, Steven G; Harley, Eric T; Fishkind, Donniell E; Vogelstein, R Jacob; Priebe, Carey E
2015-01-01
Quadratic assignment problems arise in a wide variety of domains, spanning operations research, graph theory, computer vision, and neuroscience, to name a few. The graph matching problem is a special case of the quadratic assignment problem, and graph matching is increasingly important as graph-valued data is becoming more prominent. With the aim of efficiently and accurately matching the large graphs common in big data, we present our graph matching algorithm, the Fast Approximate Quadratic assignment algorithm. We empirically demonstrate that our algorithm is faster and achieves a lower objective value on over 80% of the QAPLIB benchmark library, compared with the previous state-of-the-art. Applying our algorithm to our motivating example, matching C. elegans connectomes (brain-graphs), we find that it efficiently achieves performance.
Hierarchical structure of the logical Internet graph
NASA Astrophysics Data System (ADS)
Ge, Zihui; Figueiredo, Daniel R.; Jaiswal, Sharad; Gao, Lixin
2001-07-01
The study of the Internet topology has recently received much attention from the research community. In particular, the observation that the network graph has interesting properties, such as power laws, that might be explored in a myriad of ways. Most of the work in characterizing the Internet graph is based on the physical network graph, i.e., the connectivity graph. In this paper we investigate how logical relationships between nodes of the AS graph can be used to gain insight to its structure. We characterize the logical graph using various metrics and identify the presence of power laws in the number of customers that a provider has. Using these logical relationships we define a structural model of the AS graph. The model highlights the hierarchical nature of logical relationships and the preferential connection to larger providers. We also investigate the consistency of this model over time and observe interesting properties of the hierarchical structure.
Graph distance for complex networks
NASA Astrophysics Data System (ADS)
Shimada, Yutaka; Hirata, Yoshito; Ikeguchi, Tohru; Aihara, Kazuyuki
2016-10-01
Networks are widely used as a tool for describing diverse real complex systems and have been successfully applied to many fields. The distance between networks is one of the most fundamental concepts for properly classifying real networks, detecting temporal changes in network structures, and effectively predicting their temporal evolution. However, this distance has rarely been discussed in the theory of complex networks. Here, we propose a graph distance between networks based on a Laplacian matrix that reflects the structural and dynamical properties of networked dynamical systems. Our results indicate that the Laplacian-based graph distance effectively quantifies the structural difference between complex networks. We further show that our approach successfully elucidates the temporal properties underlying temporal networks observed in the context of face-to-face human interactions.
Graph distance for complex networks
Shimada, Yutaka; Hirata, Yoshito; Ikeguchi, Tohru; Aihara, Kazuyuki
2016-01-01
Networks are widely used as a tool for describing diverse real complex systems and have been successfully applied to many fields. The distance between networks is one of the most fundamental concepts for properly classifying real networks, detecting temporal changes in network structures, and effectively predicting their temporal evolution. However, this distance has rarely been discussed in the theory of complex networks. Here, we propose a graph distance between networks based on a Laplacian matrix that reflects the structural and dynamical properties of networked dynamical systems. Our results indicate that the Laplacian-based graph distance effectively quantifies the structural difference between complex networks. We further show that our approach successfully elucidates the temporal properties underlying temporal networks observed in the context of face-to-face human interactions. PMID:27725690
Graph Embedded Extreme Learning Machine.
Iosifidis, Alexandros; Tefas, Anastasios; Pitas, Ioannis
2016-01-01
In this paper, we propose a novel extension of the extreme learning machine (ELM) algorithm for single-hidden layer feedforward neural network training that is able to incorporate subspace learning (SL) criteria on the optimization process followed for the calculation of the network's output weights. The proposed graph embedded ELM (GEELM) algorithm is able to naturally exploit both intrinsic and penalty SL criteria that have been (or will be) designed under the graph embedding framework. In addition, we extend the proposed GEELM algorithm in order to be able to exploit SL criteria in arbitrary (even infinite) dimensional ELM spaces. We evaluate the proposed approach on eight standard classification problems and nine publicly available datasets designed for three problems related to human behavior analysis, i.e., the recognition of human face, facial expression, and activity. Experimental results denote the effectiveness of the proposed approach, since it outperforms other ELM-based classification schemes in all the cases.
Line graphs as social networks
NASA Astrophysics Data System (ADS)
Krawczyk, M. J.; Muchnik, L.; Mańka-Krasoń, A.; Kułakowski, K.
2011-07-01
It was demonstrated recently that the line graphs are clustered and assortative. These topological features are known to characterize some social networks [M.E.J. Newman, Y. Park, Why social networks are different from other types of networks, Phys. Rev. E 68 (2003) 036122]; it was argued that this similarity reveals their cliquey character. In the model proposed here, a social network is the line graph of an initial network of families, communities, interest groups, school classes and small companies. These groups play the role of nodes, and individuals are represented by links between these nodes. The picture is supported by the data on the LiveJournal network of about 8×10 6 people.
Morfeld, Kari A; Ball, Ray L; Brown, Janine L
2014-09-01
Hyperprolactinemia is associated with reproductive acyclicity in zoo African elephants (Loxodonta africana) and may contribute to the non-self-sustainability of the captive population in North America. It is a common cause of infertility in women and other mammals and can be treated with the dopamine agonist cabergoline. The objectives of this study were to assess prolactin responses to cabergoline treatment in hyperprolactinemic, acyclic African elephants and to determine the subsequent impact on ovarian cyclic activity. Five elephants, diagnosed as hyperprolactinemic (>11 ng/ml prolactin) and acyclic (maintenance of baseline progestagens for at least 1 yr), were treated with 1-2 mg cabergoline orally twice weekly for 16-82 wk. Cabergoline reduced (P < 0.05) serum prolactin concentrations during the treatment period compared to pretreatment levels in four of five elephants (11.5 +/- 3.2 vs. 9.1 +/- 3.4 ng/ml; 20.3 +/- 16.7 vs. 7.9 +/- 9.8 ng/ml; 26.4 +/- 15.0 vs. 6.8 +/- 1.5 ng/ml; 42.2 +/- 22.6 vs. 18.6 +/- 8.9 ng/ml). However, none of the females resumed ovarian cyclicity based on serum progestagen analyses up to 1 yr posttreatment. In addition, within 1 to 6 wk after cessation of oral cabergoline, serum prolactin concentrations returned to concentrations that were as high as or higher than before treatment (P < 0.05). One elephant that exhibited the highest pretreatment prolactin concentration (75.2 +/- 10.5 ng/ml) did not respond to cabergoline and maintained elevated levels throughout the study. Thus, oral cabergoline administration reduced prolactin concentrations in elephants with hyperprolactinemia, but there was no resumption of ovarian cyclicity, and a significant prolactin rebound effect was observed. It is possible that higher doses or longer treatment intervals may be required for cabergoline treatment to result in permanent suppression of prolactin secretion and to mitigate associated ovarian cycle problems.
Relativity on Rotated Graph Paper
NASA Astrophysics Data System (ADS)
Salgado, Roberto
2011-11-01
We present visual calculations in special relativity using spacetime diagrams drawn on graph paper that has been rotated by 45 degrees. The rotated lines represent lightlike directions in Minkowski spacetime, and the boxes in the grid (called light-clock diamonds) represent ticks of an inertial observer's lightclock. We show that many quantitative results can be read off a spacetime diagram by counting boxes, using a minimal amount of algebra.
Dynamic molecular graphs: "hopping" structures.
Cortés-Guzmán, Fernando; Rocha-Rinza, Tomas; Guevara-Vela, José Manuel; Cuevas, Gabriel; Gómez, Rosa María
2014-05-05
This work aims to contribute to the discussion about the suitability of bond paths and bond-critical points as indicators of chemical bonding defined within the theoretical framework of the quantum theory of atoms in molecules. For this purpose, we consider the temporal evolution of the molecular structure of [Fe{C(CH2 )3 }(CO)3 ] throughout Born-Oppenheimer molecular dynamics (BOMD), which illustrates the changing behaviour of the molecular graph (MG) of an electronic system. Several MGs with significant lifespans are observed across the BOMD simulations. The bond paths between the trimethylenemethane and the metallic core are uninterruptedly formed and broken. This situation is reminiscent of a "hopping" ligand over the iron atom. The molecular graph wherein the bonding between trimethylenemethane and the iron atom takes place only by means of the tertiary carbon atom has the longest lifespan of all the considered structures, which is consistent with the MG found by X-ray diffraction experiments and quantum chemical calculations. In contrast, the η(4) complex predicted by molecular-orbital theory has an extremely brief lifetime. The lifespan of different molecular structures is related to bond descriptors on the basis of the topology of the electron density such as the ellipticities at the FeCH2 bond-critical points and electron delocalisation indices. This work also proposes the concept of a dynamic molecular graph composed of the different structures found throughout the BOMD trajectories in analogy to a resonance hybrid of Lewis structures. It is our hope that the notion of dynamic molecular graphs will prove useful in the discussion of electronic systems, in particular for those in which analysis on the basis of static structures leads to controversial conclusions.
Topological structure of dictionary graphs
NASA Astrophysics Data System (ADS)
Fukś, Henryk; Krzemiński, Mark
2009-09-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 103 and 104. 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.
Metabolic networks: beyond the graph.
Bernal, Andrés; Daza, Edgar
2011-06-01
Drugs are devised to enter into the metabolism of an organism in order to produce a desired effect. From the chemical point of view, cellular metabolism is constituted by a complex network of reactions transforming metabolites one in each other. Knowledge on the structure of this network could help to develop novel methods for drug design, and to comprehend the root of known unexpected side effects. Many large-scale studies on the structure of metabolic networks have been developed following models based on different kinds of graphs as the fundamental image of the reaction network. Graphs models, however, comport wrong assumptions regarding the structure of reaction networks that may lead into wrong conclusions if they are not taken into account. In this article we critically review some graph-theoretical approaches to the analysis of centrality, vulnerability and modularity of metabolic networks, analyzing their limitations in estimating these key network properties, consider some proposals explicit or implicitly based on directed hypergraphs regarding their ability to overcome these issues, and review some recent implementation improvements that make the application of these models in increasingly large networks a viable option.
What is the difference between the breakpoint graph and the de Bruijn graph?
Lin, Yu; Nurk, Sergey; Pevzner, Pavel A
2014-01-01
The breakpoint graph and the de Bruijn graph are two key data structures in the studies of genome rearrangements and genome assembly. However, the classical breakpoint graphs are defined on two genomes (represented as sequences of synteny blocks), while the classical de Bruijn graphs are defined on a single genome (represented as DNA strings). Thus, the connection between these two graph models is not explicit. We generalize the notions of both the breakpoint graph and the de Bruijn graph, and make it transparent that the breakpoint graph and the de Bruijn graph are mathematically equivalent. The explicit description of the connection between these important data structures provides a bridge between two previously separated bioinformatics communities studying genome rearrangements and genome assembly.
Helping Students Make Sense of Graphs: An Experimental Trial of SmartGraphs Software
NASA Astrophysics Data System (ADS)
Zucker, Andrew; Kay, Rachel; Staudt, Carolyn
2014-06-01
Graphs are commonly used in science, mathematics, and social sciences to convey important concepts; yet students at all ages demonstrate difficulties interpreting graphs. This paper reports on an experimental study of free, Web-based software called SmartGraphs that is specifically designed to help students overcome their misconceptions regarding graphs. SmartGraphs allows students to interact with graphs and provides hints and scaffolding to help students, if they need help. SmartGraphs activities can be authored to be useful in teaching and learning a variety of topics that use graphs (such as slope, velocity, half-life, and global warming). A 2-year experimental study in physical science classrooms was conducted with dozens of teachers and thousands of students. In the first year, teachers were randomly assigned to experimental or control conditions. Data show that students of teachers who use SmartGraphs as a supplement to normal instruction make greater gains understanding graphs than control students studying the same content using the same textbooks, but without SmartGraphs. Additionally, teachers believe that the SmartGraphs activities help students meet learning goals in the physical science course, and a great majority reported they would use the activities with students again. In the second year of the study, several specific variations of SmartGraphs were researched to help determine what makes SmartGraphs effective.
Huizinga, B J; Tannenbaum, E; Kaplan, I R
1987-01-01
A series of pyrolysis experiments, utilizing two different immature oil-prone kerogens ("type I": Green River Formation kerogen; "Type II": Monterey Formation kerogen) mixed with common sedimentary minerals (calcite, illite, or Na-montmorillonite), was conducted to study the effects of minerals on the generation of n-alkanes, acyclic isoprenoids, and alkenes during laboratory-simulated catagenesis of kerogen. The influence of clay minerals on the aliphatic hydrocarbons is critically dependent on the water concentration during laboratory thermal maturation. Under extremely low contents of water (i.e., dry pyrolysis, where only pyrolysate water is present), C12(+) -range n-alkanes and acyclic isoprenoids are mostly destroyed by montmorillonite but undergo only minor alteration with illite. Both clay minerals significantly reduce alkene formation during dry pyrolysis. Under hydrous conditions (mineral/water = 2:1), the effects of the clay minerals are substantially reduced. In addition, the dry pyrolysis experiments show that illite and montmorillonite preferentially retain large amounts of the polar constituents of bitumen, but not n-alkanes or acyclic isoprenoids. Therefore, bitumen fractionation according to polarity differences occurs in the presence of these clay minerals. By this process, n-alkanes and acyclic isoprenoids are concentrated in the bitumen fraction that is not strongly adsorbed on the clay matrices. The extent of these concentrations effects is greatly diminished during hydrous pyrolysis. In contrast, calcite has no significant influence on the thermal evolution of the hydrocarbons. In addition, calcite is incapable of retaining bitumen. Therefore, the fractionation of n-alkanes or acyclic isoprenoids relative to the polar constituents of bitumen is insignificant in the presence of calcite.
Wang, Xiaowei; Adachi, Shinya; Iwai, Hiroyoshi; Takatsuki, Hiroshi; Fujita, Katsuhiro; Kubo, Mikako; Oku, Akira; Harada, Toshiro
2003-12-26
allo-Threonine-derived O-aroyl-B-phenyl-N-tosyl-1,3,2-oxazaborolidin-5-ones 1g,n catalyze the asymmetric Mukaiyama-Michael reaction of acyclic enones with a trimethylsilyl ketene S,O-acetal in high enantioselectivity. A range of alkenyl methyl ketones is successfully employed as Michael acceptors affording ee values of 85-90% by using 10 mol % of the catalyst. The use of 2,6-diisopropylphenol and tert-butyl methyl ether as additives is found to be essential to achieve high enantioselectivity in these reactions. The effects of the additives are discussed in terms of the retardation of an Si(+)-catalyzed racemic pathway, which seriously deteriorates the enantioselectivity of asymmetric Mukaiyama-Michael reactions. A working model for asymmetric induction is proposed based on correlation between catalyst structures and enantioselectivities.
NASA Astrophysics Data System (ADS)
Kohnen, Math E. L.; Sinninghe Damsté, Jaap S.; ten Haven, H. L.; Van Dalen, A. C. Kock; Schouten, Stefan; De Leeuw, Jan W.
1991-12-01
Homologous series (C 15-C 24) of novel 3- n-alkyl-1,2-dithianes and 3- n-alkyl-6-methyl-1,2-di-thianes have been identified in immature sediments. The identification of these compounds was based on comparison of mass spectra and Chromatographie data with those of synthesized 3-methyl-6-tridecyll, 2-dithiane. In addition, 4-methyl-3-(3,7,11-trimethyldodecyl)-1,2-dithiane, 4-(4,8,12-trimethyltridecyl)-1,2-dithiane, 5-methyl-4-(3,7,11-trimethyldodecyl)-1,2,3-trithiepane, and a 1,2-dithiane possessing a pentakishomohopane carbon skeleton were tentatively assigned on the basis of mass spectral characteristics, selective chemolysis, and desulphurisation. The occurrence of these cyclic di-and trisulphides with linear, acyclic isoprenoid and hopanoid carbon skeletons in thermally immature sediments indicates that inorganic polysulphides are incorporated into functionalised lipids during the early stages of diagenesis.
Peters, Hannah L; Jochmans, Dirk; de Wilde, Adriaan H; Posthuma, Clara C; Snijder, Eric J; Neyts, Johan; Seley-Radtke, Katherine L
2015-08-01
A series of doubly flexible nucleoside analogues were designed based on the acyclic sugar scaffold of acyclovir and the flex-base moiety found in the fleximers. The target compounds were evaluated for their antiviral potential and found to inhibit several coronaviruses. Significantly, compound 2 displayed selective antiviral activity (CC50 >3× EC50) towards human coronavirus (HCoV)-NL63 and Middle East respiratory syndrome-coronavirus, but not severe acute respiratory syndrome-coronavirus. In the case of HCoV-NL63 the activity was highly promising with an EC50 <10 μM and a CC50 >100 μM. As such, these doubly flexible nucleoside analogues are viewed as a novel new class of drug candidates with potential for potent inhibition of coronaviruses.
Computing Information Value from RDF Graph Properties
al-Saffar, Sinan; Heileman, Gregory
2010-11-08
Information value has been implicitly utilized and mostly non-subjectively computed in information retrieval (IR) systems. We explicitly define and compute the value of an information piece as a function of two parameters, the first is the potential semantic impact the target information can subjectively have on its recipient's world-knowledge, and the second parameter is trust in the information source. We model these two parameters as properties of RDF graphs. Two graphs are constructed, a target graph representing the semantics of the target body of information and a context graph representing the context of the consumer of that information. We compute information value subjectively as a function of both potential change to the context graph (impact) and the overlap between the two graphs (trust). Graph change is computed as a graph edit distance measuring the dissimilarity between the context graph before and after the learning of the target graph. A particular application of this subjective information valuation is in the construction of a personalized ranking component in Web search engines. Based on our method, we construct a Web re-ranking system that personalizes the information experience for the information-consumer.
JavaGenes: Evolving Graphs with Crossover
NASA Technical Reports Server (NTRS)
Globus, Al; Atsatt, Sean; Lawton, John; Wipke, Todd
2000-01-01
Genetic algorithms usually use string or tree representations. We have developed a novel crossover operator for a directed and undirected graph representation, and used this operator to evolve molecules and circuits. Unlike strings or trees, a single point in the representation cannot divide every possible graph into two parts, because graphs may contain cycles. Thus, the crossover operator is non-trivial. A steady-state, tournament selection genetic algorithm code (JavaGenes) was written to implement and test the graph crossover operator. All runs were executed by cycle-scavagging on networked workstations using the Condor batch processing system. The JavaGenes code has evolved pharmaceutical drug molecules and simple digital circuits. Results to date suggest that JavaGenes can evolve moderate sized drug molecules and very small circuits in reasonable time. The algorithm has greater difficulty with somewhat larger circuits, suggesting that directed graphs (circuits) are more difficult to evolve than undirected graphs (molecules), although necessary differences in the crossover operator may also explain the results. In principle, JavaGenes should be able to evolve other graph-representable systems, such as transportation networks, metabolic pathways, and computer networks. However, large graphs evolve significantly slower than smaller graphs, presumably because the space-of-all-graphs explodes combinatorially with graph size. Since the representation strongly affects genetic algorithm performance, adding graphs to the evolutionary programmer's bag-of-tricks should be beneficial. Also, since graph evolution operates directly on the phenotype, the genotype-phenotype translation step, common in genetic algorithm work, is eliminated.
API Requirements for Dynamic Graph Prediction
Gallagher, B; Eliassi-Rad, T
2006-10-13
Given a large-scale time-evolving multi-modal and multi-relational complex network (a.k.a., a large-scale dynamic semantic graph), we want to implement algorithms that discover patterns of activities on the graph and learn predictive models of those discovered patterns. This document outlines the application programming interface (API) requirements for fast prototyping of feature extraction, learning, and prediction algorithms on large dynamic semantic graphs. Since our algorithms must operate on large-scale dynamic semantic graphs, we have chosen to use the graph API developed in the CASC Complex Networks Project. This API is supported on the back end by a semantic graph database (developed by Scott Kohn and his team). The advantages of using this API are (i) we have full-control of its development and (ii) the current API meets almost all of the requirements outlined in this document.
Fast generation of sparse random kernel graphs
Hagberg, Aric; Lemons, Nathan; Du, Wen -Bo
2015-09-10
The development of kernel-based inhomogeneous random graphs has provided models that are flexible enough to capture many observed characteristics of real networks, and that are also mathematically tractable. We specify a class of inhomogeneous random graph models, called random kernel graphs, that produces sparse graphs with tunable graph properties, and we develop an efficient generation algorithm to sample random instances from this model. As real-world networks are usually large, it is essential that the run-time of generation algorithms scales better than quadratically in the number of vertices n. We show that for many practical kernels our algorithm runs in time at most ο(n(logn)²). As an example, we show how to generate samples of power-law degree distribution graphs with tunable assortativity.
Fast generation of sparse random kernel graphs
Hagberg, Aric; Lemons, Nathan; Du, Wen -Bo
2015-09-10
The development of kernel-based inhomogeneous random graphs has provided models that are flexible enough to capture many observed characteristics of real networks, and that are also mathematically tractable. We specify a class of inhomogeneous random graph models, called random kernel graphs, that produces sparse graphs with tunable graph properties, and we develop an efficient generation algorithm to sample random instances from this model. As real-world networks are usually large, it is essential that the run-time of generation algorithms scales better than quadratically in the number of vertices n. We show that for many practical kernels our algorithm runs in timemore » at most ο(n(logn)²). As an example, we show how to generate samples of power-law degree distribution graphs with tunable assortativity.« less
Molecular graph convolutions: moving beyond fingerprints
NASA Astrophysics Data System (ADS)
Kearnes, Steven; McCloskey, Kevin; Berndl, Marc; Pande, Vijay; Riley, Patrick
2016-08-01
Molecular "fingerprints" encoding structural information are the workhorse of cheminformatics and machine learning in drug discovery applications. However, fingerprint representations necessarily emphasize particular aspects of the molecular structure while ignoring others, rather than allowing the model to make data-driven decisions. We describe molecular graph convolutions, a machine learning architecture for learning from undirected graphs, specifically small molecules. Graph convolutions use a simple encoding of the molecular graph—atoms, bonds, distances, etc.—which allows the model to take greater advantage of information in the graph structure. Although graph convolutions do not outperform all fingerprint-based methods, they (along with other graph-based methods) represent a new paradigm in ligand-based virtual screening with exciting opportunities for future improvement.
Replica methods for loopy sparse random graphs
NASA Astrophysics Data System (ADS)
Coolen, ACC
2016-03-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. This paper is dedicated to the memory of our colleague and friend Jun-Ichi Inoue, with whom the author has had the great pleasure and privilege of collaborating.
Spectral correlations of individual quantum graphs
Gnutzmann, Sven; Altland, Alexander
2005-11-01
We investigate the spectral properties of chaotic quantum graphs. We demonstrate that the energy-average over the spectrum of individual graphs can be traded for the functional average over a supersymmetric nonlinear {sigma}-model action. This proves that spectral correlations of individual quantum graphs behave according to the predictions of Wigner-Dyson random matrix theory. We explore the stability of the universal random matrix behavior with regard to perturbations, and discuss the crossover between different types of symmetries.
Miller, Allan Ray
1987-05-01
Increases in high speed hardware have mandated studies in software techniques to exploit the parallel capabilities. This thesis examines the effects a run-time scheduler has on a multiprocessor. The model consists of directed, acyclic graphs, generated from serial FORTRAN benchmark programs by the parallel compiler Parafrase. A multitasked, multiprogrammed environment is created. Dependencies are generated by the compiler. Tasks are bidimensional, i.e., they may specify both time and processor requests. Processor requests may be folded into execution time by the scheduler. The graphs may arrive at arbitrary time intervals. The general case is NP-hard, thus, a variety of heuristics are examined by a simulator. Multiprogramming demonstrates a greater need for a run-time scheduler than does monoprogramming for a variety of reasons, e.g., greater stress on the processors, a larger number of independent control paths, more variety in the task parameters, etc. The dynamic critical path series of algorithms perform well. Dynamic critical volume did not add much. Unfortunately, dynamic critical path maximizes turnaround time as well as throughput. Two schedulers are presented which balance throughput and turnaround time. The first requires classification of jobs by type; the second requires selection of a ratio value which is dependent upon system parameters. 45 refs., 19 figs., 20 tabs.
NASA Astrophysics Data System (ADS)
Sui, Xiukai; Wu, Bin; Wang, Long
2015-12-01
The likelihood that a mutant fixates in the wild population, i.e., fixation probability, has been intensively studied in evolutionary game theory, where individuals' fitness is frequency dependent. However, it is of limited interest when it takes long to take over. Thus the speed of evolution becomes an important issue. In general, it is still unclear how fixation times are affected by the population structure, although the fixation times have already been addressed in the well-mixed populations. Here we theoretically address this issue by pair approximation and diffusion approximation on regular graphs. It is shown (i) that under neutral selection, both unconditional and conditional fixation time are shortened by increasing the number of neighbors; (ii) that under weak selection, for the simplified prisoner's dilemma game, if benefit-to-cost ratio exceeds the degree of the graph, then the unconditional fixation time of a single cooperator is slower than that in the neutral case; and (iii) that under weak selection, for the conditional fixation time, limited neighbor size dilutes the counterintuitive stochastic slowdown which was found in well-mixed populations. Interestingly, we find that all of our results can be interpreted as that in the well-mixed population with a transformed payoff matrix. This interpretation is also valid for both death-birth and birth-death processes on graphs. This interpretation bridges the fixation time in the structured population and that in the well-mixed population. Thus it opens the avenue to investigate the challenging fixation time in structured populations by the known results in well-mixed populations.
Gnutzmann, Sven; Waltner, Daniel
2016-12-01
We consider exact and asymptotic solutions of the stationary cubic nonlinear Schrödinger equation on metric graphs. We focus on some basic example graphs. The asymptotic solutions are obtained using the canonical perturbation formalism developed in our earlier paper [S. Gnutzmann and D. Waltner, Phys. Rev. E 93, 032204 (2016)2470-004510.1103/PhysRevE.93.032204]. For closed example graphs (interval, ring, star graph, tadpole graph), we calculate spectral curves and show how the description of spectra reduces to known characteristic functions of linear quantum graphs in the low-intensity limit. Analogously for open examples, we show how nonlinear scattering of stationary waves arises and how it reduces to known linear scattering amplitudes at low intensities. In the short-wavelength asymptotics we discuss how genuine nonlinear effects may be described using the leading order of canonical perturbation theory: bifurcation of spectral curves (and the corresponding solutions) in closed graphs and multistability in open graphs.
NASA Astrophysics Data System (ADS)
Gnutzmann, Sven; Waltner, Daniel
2016-12-01
We consider exact and asymptotic solutions of the stationary cubic nonlinear Schrödinger equation on metric graphs. We focus on some basic example graphs. The asymptotic solutions are obtained using the canonical perturbation formalism developed in our earlier paper [S. Gnutzmann and D. Waltner, Phys. Rev. E 93, 032204 (2016), 10.1103/PhysRevE.93.032204]. For closed example graphs (interval, ring, star graph, tadpole graph), we calculate spectral curves and show how the description of spectra reduces to known characteristic functions of linear quantum graphs in the low-intensity limit. Analogously for open examples, we show how nonlinear scattering of stationary waves arises and how it reduces to known linear scattering amplitudes at low intensities. In the short-wavelength asymptotics we discuss how genuine nonlinear effects may be described using the leading order of canonical perturbation theory: bifurcation of spectral curves (and the corresponding solutions) in closed graphs and multistability in open graphs.
The alignment-distribution graph
NASA Technical Reports Server (NTRS)
Chatterjee, Siddhartha; Gilbert, John R.; Schreiber, Robert
1993-01-01
Implementing a data-parallel language such as Fortran 90 on a distributed-memory parallel computer requires distributing aggregate data objects (such as arrays) among the memory modules attached to the processors. The mapping of objects to the machine determines the amount of residual communication needed to bring operands of parallel operations into alignment with each other. We present a program representation called the alignment-distribution graph that makes these communication requirements explicit. We describe the details of the representation, show how to model communication cost in this framework, and outline several algorithms for determining object mappings that approximately minimize residual communication.
The alignment-distribution graph
NASA Technical Reports Server (NTRS)
Chatterjee, Siddhartha; Gilbert, John R.; Schreiber, Robert
1993-01-01
Implementing a data-parallel language such as Fortran 90 on a distributed-memory parallel computer requires distributing aggregate data objects (such as arrays) among the memory modules attached to the processors. The mapping of objects to the machine determines the amount of residual communication needed to bring operands of parallel operations into alignment with each other. We present a program representation called the alignment distribution graph that makes these communication requirements explicit. We describe the details of the representation, show how to model communication cost in this framework, and outline several algorithms for determining object mappings that approximately minimize residual communication.
NASA Astrophysics Data System (ADS)
Gosti, Giorgio; Batchelder, William H.
We address how the structure of a social communication system affects language coordination. The naming game is an abstraction of lexical acquisition dynamics, in which N agents try to find an agreement on the names to give to objects. Most results on naming games are specific to certain communication network topologies. We present two important results that are general to any graph topology: the first proves that under certain topologies the system always converges to a name-object agreement; the second proves that if these conditions are not met the system may end up in a state in which sub-networks with different competing object-name associations coexist.
Simple scale interpolator facilitates reading of graphs
NASA Technical Reports Server (NTRS)
Fetterman, D. E., Jr.
1965-01-01
Simple transparent overlay with interpolation scale facilitates accurate, rapid reading of graph coordinate points. This device can be used for enlarging drawings and locating points on perspective drawings.
Evolutionary Games of Multiplayer Cooperation on Graphs
Arranz, Jordi; Traulsen, Arne
2016-01-01
There has been much interest in studying evolutionary games in structured populations, often modeled as graphs. However, most analytical results so far have only been obtained for two-player or linear games, while the study of more complex multiplayer games has been usually tackled by computer simulations. Here we investigate evolutionary multiplayer games on graphs updated with a Moran death-Birth process. For cycles, we obtain an exact analytical condition for cooperation to be favored by natural selection, given in terms of the payoffs of the game and a set of structure coefficients. For regular graphs of degree three and larger, we estimate this condition using a combination of pair approximation and diffusion approximation. For a large class of cooperation games, our approximations suggest that graph-structured populations are stronger promoters of cooperation than populations lacking spatial structure. Computer simulations validate our analytical approximations for random regular graphs and cycles, but show systematic differences for graphs with many loops such as lattices. In particular, our simulation results show that these kinds of graphs can even lead to more stringent conditions for the evolution of cooperation than well-mixed populations. Overall, we provide evidence suggesting that the complexity arising from many-player interactions and spatial structure can be captured by pair approximation in the case of random graphs, but that it need to be handled with care for graphs with high clustering. PMID:27513946
Graph algorithms in the titan toolkit.
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.
Some Recent Results on Graph Matching,
1987-06-01
extendable graphs In Section 2 of this paper we saw how the brick decomposition procedure can be carried out on an arbitrary 1-extendable graph and that...in fact, the procedure is "canonical" in the sense that the final list of bricks so obtained is an invariant of the graph. Furthermore, we saw how...JACKSON, P. KATERINIS and A. SAITO, Toughness and the existence of k-factors, J. Graph Theory 9, 1985, 87-95. [G1] T. GALLAI, Kritische Graphen II
Bandlimited graph signal reconstruction by diffusion operator
NASA Astrophysics Data System (ADS)
Yang, Lishan; You, Kangyong; Guo, Wenbin
2016-12-01
Signal processing on graphs extends signal processing concepts and methodologies from the classical signal processing theory to data indexed by general graphs. For a bandlimited graph signal, the unknown data associated with unsampled vertices can be reconstructed from the sampled data by exploiting the spatial relationship of graph signal. In this paper, we propose a generalized analytical framework of unsampled graph signal and introduce a concept of diffusion operator which consists of local-mean and global-bias diffusion operator. Then, a diffusion operator-based iterative algorithm is proposed to reconstruct bandlimited graph signal from sampled data. In each iteration, the reconstructed residuals associated with the sampled vertices are diffused to all the unsampled vertices for accelerating the convergence. We then prove that the proposed reconstruction strategy converges to the original graph signal. The simulation results demonstrate the effectiveness of the proposed reconstruction strategy with various downsampling patterns, fluctuation of graph cut-off frequency, robustness on the classic graph structures, and noisy scenarios.
Generation of graph-state streams
Ballester, Daniel; Cho, Jaeyoon; Kim, M. S.
2011-01-15
We propose a protocol to generate a stream of mobile qubits in a graph state through a single stationary parent qubit and discuss two types of its physical implementation, namely, the generation of photonic graph states through an atomlike qubit and the generation of flying atoms through a cavity-mode photonic qubit. The generated graph states fall into an important class that can hugely reduce the resource requirement of fault-tolerant linear optics quantum computation, which was previously known to be far from realistic. In regard to the flying atoms, we also propose a heralded generation scheme, which allows for high-fidelity graph states even under the photon loss.
Smalter, Aaron; Huan, Jun Luke; Jia, Yi; Lushington, Gerald
2010-01-01
Graph data mining is an active research area. Graphs are general modeling tools to organize information from heterogeneous sources and have been applied in many scientific, engineering, and business fields. With the fast accumulation of graph data, building highly accurate predictive models for graph data emerges as a new challenge that has not been fully explored in the data mining community. In this paper, we demonstrate a novel technique called graph pattern diffusion (GPD) kernel. Our idea is to leverage existing frequent pattern discovery methods and to explore the application of kernel classifier (e.g., support vector machine) in building highly accurate graph classification. In our method, we first identify all frequent patterns from a graph database. We then map subgraphs to graphs in the graph database and use a process we call "pattern diffusion" to label nodes in the graphs. Finally, we designed a graph alignment algorithm to compute the inner product of two graphs. We have tested our algorithm using a number of chemical structure data. The experimental results demonstrate that our method is significantly better than competing methods such as those kernel functions based on paths, cycles, and subgraphs.
ERIC Educational Resources Information Center
Xi, Xiaoming
2010-01-01
Motivated by cognitive theories of graph comprehension, this study systematically manipulated characteristics of a line graph description task in a speaking test in ways to mitigate the influence of graph familiarity, a potential source of construct-irrelevant variance. It extends Xi (2005), which found that the differences in holistic scores on…
Helping Students Make Sense of Graphs: An Experimental Trial of SmartGraphs Software
ERIC Educational Resources Information Center
Zucker, Andrew; Kay, Rachel; Staudt, Carolyn
2014-01-01
Graphs are commonly used in science, mathematics, and social sciences to convey important concepts; yet students at all ages demonstrate difficulties interpreting graphs. This paper reports on an experimental study of free, Web-based software called SmartGraphs that is specifically designed to help students overcome their misconceptions regarding…
Clique percolation in random graphs
NASA Astrophysics Data System (ADS)
Li, Ming; Deng, Youjin; Wang, Bing-Hong
2015-10-01
As a generation of the classical percolation, clique percolation focuses on the connection of cliques in a graph, where the connection of two k cliques means that they share at least l
Clique percolation in random graphs.
Li, Ming; Deng, Youjin; Wang, Bing-Hong
2015-10-01
As a generation of the classical percolation, clique percolation focuses on the connection of cliques in a graph, where the connection of two k cliques means that they share at least l
Feature Tracking Using Reeb Graphs
Weber, Gunther H.; Bremer, Peer-Timo; Day, Marcus S.; Bell, John B.; Pascucci, Valerio
2010-08-02
Tracking features and exploring their temporal dynamics can aid scientists in identifying interesting time intervals in a simulation and serve as basis for performing quantitative analyses of temporal phenomena. In this paper, we develop a novel approach for tracking subsets of isosurfaces, such as burning regions in simulated flames, which are defined as areas of high fuel consumption on a temperature isosurface. Tracking such regions as they merge and split over time can provide important insights into the impact of turbulence on the combustion process. However, the convoluted nature of the temperature isosurface and its rapid movement make this analysis particularly challenging. Our approach tracks burning regions by extracting a temperature isovolume from the four-dimensional space-time temperature field. It then obtains isosurfaces for the original simulation time steps and labels individual connected 'burning' regions based on the local fuel consumption value. Based on this information, a boundary surface between burning and non-burning regions is constructed. The Reeb graph of this boundary surface is the tracking graph for burning regions.
Enabling Graph Appliance for Genome Assembly
Singh, Rina; Graves, Jeffrey A; Lee, Sangkeun; Sukumar, Sreenivas R; Shankar, Mallikarjun
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.
Feynman graph generation and calculations in the Hopf algebra of Feynman graphs
NASA Astrophysics Data System (ADS)
Borinsky, Michael
2014-12-01
Two programs for the computation of perturbative expansions of quantum field theory amplitudes are provided. feyngen can be used to generate Feynman graphs for Yang-Mills, QED and φk theories. Using dedicated graph theoretic tools feyngen can generate graphs of comparatively high loop orders. feyncop implements the Hopf algebra of those Feynman graphs which incorporates the renormalization procedure necessary to calculate finite results in perturbation theory of the underlying quantum field theory. feyngen is validated by comparison to explicit calculations of zero dimensional quantum field theories and feyncop is validated using a combinatorial identity on the Hopf algebra of graphs.
Generative Graph Prototypes from Information Theory.
Han, Lin; Wilson, Richard C; Hancock, Edwin R
2015-10-01
In this paper we present a method for constructing a generative prototype for a set of graphs by adopting a minimum description length approach. The method is posed in terms of learning a generative supergraph model from which the new samples can be obtained by an appropriate sampling mechanism. We commence by constructing a probability distribution for the occurrence of nodes and edges over the supergraph. We encode the complexity of the supergraph using an approximate Von Neumann entropy. A variant of the EM algorithm is developed to minimize the description length criterion in which the structure of the supergraph and the node correspondences between the sample graphs and the supergraph are treated as missing data. To generate new graphs, we assume that the nodes and edges of graphs arise under independent Bernoulli distributions and sample new graphs according to their node and edge occurrence probabilities. Empirical evaluations on real-world databases demonstrate the practical utility of the proposed algorithm and show the effectiveness of the generative model for the tasks of graph classification, graph clustering and generating new sample graphs.
Graphing as a Problem-Solving Strategy.
ERIC Educational Resources Information Center
Cohen, Donald
1984-01-01
The focus is on how line graphs can be used to approximate solutions to rate problems and to suggest equations that offer exact algebraic solutions to the problem. Four problems requiring progressively greater graphing sophistication are presented plus four exercises. (MNS)
Qualitative Graphing: A Construction in Mathematics.
ERIC Educational Resources Information Center
Narode, Ronald
This document argues that qualitative graphing is an effective introduction to mathematics as a construction for communication of ideas involving quantitative relationships. It is suggested that with little or no prior knowledge of Cartesian coordinates or analytic descriptions of graphs using equations students can successfully grasp concepts of…
Developing Data Graph Comprehension. Third Edition
ERIC Educational Resources Information Center
Curcio, Frances
2010-01-01
Since the dawn of civilization, pictorial representations and symbols have been used to communicate simple statistics. Efficient and effective, they are still used today in the form of pictures and graphs to record and present data. Who can tie their shoes? How many calories are in your favorite food? Make data and graphs relevant and interesting…
A Ring Construction Using Finite Directed Graphs
ERIC Educational Resources Information Center
Bardzell, Michael
2012-01-01
In this paper we discuss an interesting class of noncommutative rings which can be constructed using finite directed graphs. This construction also creates a vector space. These structures provide undergraduate students connections between ring theory and graph theory and, among other things, allow them to see a ring unity element that looks quite…
Student Reasoning about Graphs in Different Contexts
ERIC Educational Resources Information Center
Ivanjek, Lana; Susac, Ana; Planinic, Maja; Andrasevic, Aneta; Milin-Sipus, Zeljka
2016-01-01
This study investigates university students' graph interpretation strategies and difficulties in mathematics, physics (kinematics), and contexts other than physics. Eight sets of parallel (isomorphic) mathematics, physics, and other context questions about graphs, which were developed by us, were administered to 385 first-year students at the…
Pattern Perception and the Comprehension of Graphs.
ERIC Educational Resources Information Center
Pinker, Steven
Three experiments tested the hypothesis that graphs convey information effectively because they can display global trends as geometric patterns that visual systems encode easily. A novel type of graph was invented in which angles/lengths of line segments joined end-to-end represented variables of rainfall and temperature of a set of months. It was…
Body Motion and Graphing. Working Paper.
ERIC Educational Resources Information Center
Nemirovsky, Ricardo; Tierney, Cornelia; Wright, Tracey
This paper explores children's efforts to make sense of graphs by analyzing two students' use of a computer-based motion detector. The analysis focuses on the students' growing understanding of the motion detector which enables them to plan their movements in order to create graphs and interpret them in terms of kinesthetic actions. Students…
ON CLUSTERING TECHNIQUES OF CITATION GRAPHS.
ERIC Educational Resources Information Center
CHIEN, R.T.; PREPARATA, F.P.
ONE OF THE PROBLEMS ENCOUNTERED IN CLUSTERING TECHNIQUES AS APPLIED TO DOCUMENT RETRIEVAL SYSTEMS USING BIBLIOGRAPHIC COUPLING DEVICES IS THAT THE COMPUTATIONAL EFFORT REQUIRED GROWS ROUGHLY AS THE SQUARE OF THE COLLECTION SIZE. IN THIS STUDY GRAPH THEORY IS APPLIED TO THIS PROBLEM BY FIRST MAPPING THE CITATION GRAPH OF THE DOCUMENT COLLECTION…
Using a Microcomputer for Graphing Practice.
ERIC Educational Resources Information Center
Beichner, Robert J.
1986-01-01
Describes a laboratory exercise that introduces physics students to graphing. Presents the program format and sample output of a computer simulation of an experiment which tests the effects of sound intensity on the crawling speed of a snail. Provides students with practice in making exponential or logarithmic graphs. (ML)
Teaching Discrete Mathematics with Graphing Calculators.
ERIC Educational Resources Information Center
Masat, Francis E.
Graphing calculator use is often thought of in terms of pre-calculus or continuous topics in mathematics. This paper contains examples and activities that demonstrate useful, interesting, and easy ways to use a graphing calculator with discrete topics. Examples are given for each of the following topics: functions, mathematical induction and…
Cognitive Aids for Guiding Graph Comprehension
ERIC Educational Resources Information Center
Mautone, Patricia D.; Mayer, Richard E.
2007-01-01
This study sought to improve students' comprehension of scientific graphs by adapting scaffolding techniques used to aid text comprehension. In 3 experiments involving 121 female and 88 male college students, some students were shown cognitive aids prior to viewing 4 geography graphs whereas others were not; all students were then asked to write a…
Pattern vectors from algebraic graph theory.
Wilson, Richard C; Hancock, Edwin R; Luo, Bin
2005-07-01
Graph structures have proven computationally cumbersome for pattern analysis. The reason for this is that, before graphs can be converted to pattern vectors, correspondences must be established between the nodes of structures which are potentially of different size. To overcome this problem, in this paper, we turn to the spectral decomposition of the Laplacian matrix. We show how the elements of the spectral matrix for the Laplacian can be used to construct symmetric polynomials that are permutation invariants. The coefficients of these polynomials can be used as graph features which can be encoded in a vectorial manner. We extend this representation to graphs in which there are unary attributes on the nodes and binary attributes on the edges by using the spectral decomposition of a Hermitian property matrix that can be viewed as a complex analogue of the Laplacian. To embed the graphs in a pattern space, we explore whether the vectors of invariants can be embedded in a low-dimensional space using a number of alternative strategies, including principal components analysis (PCA), multidimensional scaling (MDS), and locality preserving projection (LPP). Experimentally, we demonstrate that the embeddings result in well-defined graph clusters. Our experiments with the spectral representation involve both synthetic and real-world data. The experiments with synthetic data demonstrate that the distances between spectral feature vectors can be used to discriminate between graphs on the basis of their structure. The real-world experiments show that the method can be used to locate clusters of graphs.
Universal spectral statistics in quantum graphs.
Gnutzmann, Sven; Altland, Alexander
2004-11-05
We prove that the spectrum of an individual chaotic quantum graph shows universal spectral correlations, as predicted by random-matrix theory. The stability of these correlations with regard to nonuniversal corrections is analyzed in terms of the linear operator governing the classical dynamics on the graph.
NASA Technical Reports Server (NTRS)
Huizinga, Bradley J.; Tannenbaum, Eli; Kaplan, Isaac R.
1987-01-01
The effect of common sedimentary minerals (illite, Na-montmorillonite, or calcite) under different water concentrations on the generation and release of n-alkanes, acyclic isoprenoids, and select alkenes from oil-prone kerogens was investigated. Matrices containing Green River Formation kerogen or Monterey Formation kerogen, alone or in the presence of minerals, were heated at 200 or 300 C for periods of up to 1000 hours, and the pyrolysis products were analyzed. The influence of the first two clay minerals was found to be critically dependent on the water content. Under the dry pyrolysis conditions, both minerals significantly reduced alkene formation; the C12+ n-alkanes and acyclic isoprenoids were mostly destroyed by montmorillonite, but underwent only minor alteration with illite. Under hydrous conditions (mineral/water of 2/1), the effects of both minerals were substantially reduced. Calcite had no significant effect on the thermal evolution of the hydrocarbons.
NASA Astrophysics Data System (ADS)
Huizinga, Bradley J.; Tannenbaum, Eli; Kaplan, Isaac R.
1987-05-01
The effect of common sedimentary minerals (illite, Na-montmorillonite, or calcite) under different water concentrations on the generation and release of n-alkanes, acyclic isoprenoids, and select alkenes from oil-prone kerogens was investigated. Matrices containing Green River Formation kerogen or Monterey Formation kerogen, alone or in the presence of minerals, were heated at 200 or 300 C for periods of up to 1000 hours, and the pyrolysis products were analyzed. The influence of the first two clay minerals was found to be critically dependent on the water content. Under the dry pyrolysis conditions, both minerals significantly reduced alkene formation; the C12+ n-alkanes and acyclic isoprenoids were mostly destroyed by montmorillonite, but underwent only minor alteration with illite. Under hydrous conditions (mineral/water of 2/1), the effects of both minerals were substantially reduced. Calcite had no significant effect on the thermal evolution of the hydrocarbons.
Sequential motif profile of natural visibility graphs
NASA Astrophysics Data System (ADS)
Iacovacci, Jacopo; Lacasa, Lucas
2016-11-01
The concept of sequential visibility graph motifs—subgraphs appearing with characteristic frequencies in the visibility graphs associated to time series—has been advanced recently along with a theoretical framework to compute analytically the motif profiles associated to horizontal visibility graphs (HVGs). Here we develop a theory to compute the profile of sequential visibility graph motifs in the context of natural visibility graphs (VGs). This theory gives exact results for deterministic aperiodic processes with a smooth invariant density or stochastic processes that fulfill the Markov property and have a continuous marginal distribution. The framework also allows for a linear time numerical estimation in the case of empirical time series. A comparison between the HVG and the VG case (including evaluation of their robustness for short series polluted with measurement noise) is also presented.
Vortices and superfields on a graph
NASA Astrophysics Data System (ADS)
Kan, Nahomi; Kobayashi, Koichiro; Shiraishi, Kiyoshi
2009-08-01
We extend the dimensional deconstruction by utilizing the knowledge of graph theory. In the dimensional deconstruction, one uses the moose diagram to exhibit the structure of the “theory space.” We generalize the moose diagram to a general graph with oriented edges. In the present paper, we consider only the U(1) gauge symmetry. We also introduce supersymmetry into our model by use of superfields. We suppose that vector superfields reside at the vertices and chiral superfields at the edges of a given graph. Then we can consider multivector, multi-Higgs models. In our model, [U(1)]p (where p is the number of vertices) is broken to a single U(1). Therefore, for specific graphs, we get vortexlike classical solutions in our model. We show some examples of the graphs admitting the vortex solutions of simple structure as the Bogomolnyi solution.
Vortices and superfields on a graph
Kan, Nahomi; Kobayashi, Koichiro; Shiraishi, Kiyoshi
2009-08-15
We extend the dimensional deconstruction by utilizing the knowledge of graph theory. In the dimensional deconstruction, one uses the moose diagram to exhibit the structure of the 'theory space'. We generalize the moose diagram to a general graph with oriented edges. In the present paper, we consider only the U(1) gauge symmetry. We also introduce supersymmetry into our model by use of superfields. We suppose that vector superfields reside at the vertices and chiral superfields at the edges of a given graph. Then we can consider multivector, multi-Higgs models. In our model, [U(1)]{sup p} (where p is the number of vertices) is broken to a single U(1). Therefore, for specific graphs, we get vortexlike classical solutions in our model. We show some examples of the graphs admitting the vortex solutions of simple structure as the Bogomolnyi solution.
Graph Mining Meets the Semantic Web
Lee, Sangkeun; Sukumar, Sreenivas R; Lim, Seung-Hwan
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.
Quantum graphs and random-matrix theory
NASA Astrophysics Data System (ADS)
Pluhař, Z.; Weidenmüller, H. A.
2015-07-01
For simple connected graphs with incommensurate bond lengths and with unitary symmetry we prove the Bohigas-Giannoni-Schmit (BGS) conjecture in its most general form. Using supersymmetry and taking the limit of infinite graph size, we show that the generating function for every (P,Q) correlation function for both closed and open graphs coincides with the corresponding expression of random-matrix theory. We show that the classical Perron-Frobenius operator is bistochastic and possesses a single eigenvalue +1. In the quantum case that implies the existence of a zero (or massless) mode of the effective action. That mode causes universal fluctuation properties. Avoiding the saddle-point approximation we show that for graphs that are classically mixing (i.e. for which the spectrum of the classical Perron-Frobenius operator possesses a finite gap) and that do not carry a special class of bound states, the zero mode dominates in the limit of infinite graph size.
GraphReduce: Processing Large-Scale Graphs on Accelerator-Based Systems
Sengupta, Dipanjan; Song, Shuaiwen; Agarwal, Kapil; Schwan, Karsten
2015-11-15
Recent work on real-world graph analytics has sought to leverage the massive amount of parallelism offered by GPU devices, but challenges remain due to the inherent irregularity of graph algorithms and limitations in GPU-resident memory for storing large graphs. We present GraphReduce, a highly efficient and scalable GPU-based framework that operates on graphs that exceed the device’s internal memory capacity. GraphReduce adopts a combination of edge- and vertex-centric implementations of the Gather-Apply-Scatter programming model and operates on multiple asynchronous GPU streams to fully exploit the high degrees of parallelism in GPUs with efficient graph data movement between the host and device.
GraphReduce: Large-Scale Graph Analytics on Accelerator-Based HPC Systems
Sengupta, Dipanjan; Agarwal, Kapil; Song, Shuaiwen; Schwan, Karsten
2015-09-30
Recent work on real-world graph analytics has sought to leverage the massive amount of parallelism offered by GPU devices, but challenges remain due to the inherent irregularity of graph algorithms and limitations in GPU-resident memory for storing large graphs. We present GraphReduce, a highly efficient and scalable GPU-based framework that operates on graphs that exceed the device’s internal memory capacity. GraphReduce adopts a combination of both edge- and vertex-centric implementations of the Gather-Apply-Scatter programming model and operates on multiple asynchronous GPU streams to fully exploit the high degrees of parallelism in GPUs with efficient graph data movement between the host and the device.
Relativity on rotated graph paper
NASA Astrophysics Data System (ADS)
Salgado, Roberto B.
2016-05-01
We demonstrate a method for constructing spacetime diagrams for special relativity on graph paper that has been rotated by 45°. The diagonal grid lines represent light-flash worldlines in Minkowski spacetime, and the boxes in the grid (called "clock diamonds") represent units of measurement corresponding to the ticks of an inertial observer's light clock. We show that many quantitative results can be read off a spacetime diagram simply by counting boxes, with very little algebra. In particular, we show that the squared interval between two events is equal to the signed area of the parallelogram on the grid (called the "causal diamond") with opposite vertices corresponding to those events. We use the Doppler effect—without explicit use of the Doppler formula—to motivate the method.
Join-Graph Propagation Algorithms
Mateescu, Robert; Kask, Kalev; Gogate, Vibhav; Dechter, Rina
2010-01-01
The paper investigates parameterized approximate message-passing schemes that are based on bounded inference and are inspired by Pearl's belief propagation algorithm (BP). We start with the bounded inference mini-clustering algorithm and then move to the iterative scheme called Iterative Join-Graph Propagation (IJGP), that combines both iteration and bounded inference. Algorithm IJGP belongs to the class of Generalized Belief Propagation algorithms, a framework that allowed connections with approximate algorithms from statistical physics and is shown empirically to surpass the performance of mini-clustering and belief propagation, as well as a number of other state-of-the-art algorithms on several classes of networks. We also provide insight into the accuracy of iterative BP and IJGP by relating these algorithms to well known classes of constraint propagation schemes. PMID:20740057
Degree distribution and assortativity in line graphs of complex networks
NASA Astrophysics Data System (ADS)
Wang, Xiangrong; Trajanovski, Stojan; Kooij, Robert E.; Van Mieghem, Piet
2016-03-01
Topological characteristics of links of complex networks influence the dynamical processes executed on networks triggered by links, such as cascading failures triggered by links in power grids and epidemic spread due to link infection. The line graph transforms links in the original graph into nodes. In this paper, we investigate how graph metrics in the original graph are mapped into those for its line graph. In particular, we study the degree distribution and the assortativity of a graph and its line graph. Specifically, we show, both analytically and numerically, the degree distribution of the line graph of an Erdős-Rényi graph follows the same distribution as its original graph. We derive a formula for the assortativity of line graphs and indicate that the assortativity of a line graph is not linearly related to its original graph. Additionally, line graphs of various graphs, e.g. Erdős-Rényi graphs, scale-free graphs, show positive assortativity. In contrast, we find certain types of trees and non-trees whose line graphs have negative assortativity.
Preference Propagation in Temporal/Capacity Constraint Graphs
1989-01-01
contention for each resource and the reliance of each activity on the possession of that resource. SECURITY CLASSIFICA:ION OF THIS PAGE Table of Contents 1 ...Introduction 1 1.1. The Issue 1 1.2. Formalization of the Scheduling Problem 2 1.3. An Example 4 1.4. Organization of the Paper 7 2. Related Work 8 3...Acyclic TCG with Fixed-duration Activities 17 4.2.1. CO: Io MEETS 1 ? 19 4.2.2. CIO: Il is BEFORE I0 20 4.2.3. Example 21 4.3. Propagation in an Acyclic
H4octapa-Trastuzumab: Versatile Acyclic Chelate System for 111In and 177Lu Imaging and Therapy
Price, Eric W.; Zeglis, Brian M.; Cawthray, Jacqueline F.; Ramogida, Caterina F.; Ramos, Nicholas
2013-01-01
A bifunctional derivative of the versatile acyclic chelator H4octapa, p-SCNBn- H4octapa, has been synthesized for the first time. The chelator was conjugated to the HER2/neu-targeting antibody trastuzumab and labeled in high radiochemical purity and specific activity with the radioisotopes 111In and 177Lu. The in vivo behavior of the resulting radioimmunoconjugates was investigated in mice bearing ovarian cancer xenografts and compared to analogous radioimmunoconjugates employing the ubiquitous chelator DOTA. The H4octapa-trastuzumab conjugates displayed faster radiolabeling kinetics with more reproducible yields under milder conditions (15 min, RT, ~94–95%) than those based on DOTA-trastuzumab (60 min, 37 °C ~50–88%). Further, antibody integrity was better preserved in the 111In- and 177Lu-octapatrastuzumab constructs, with immunoreactive fractions of 0.99 for each compared to 0.93–0.95 for 111In- and 177Lu-DOTA-trastuzumab. These results translated to improved in vivo biodistribution profiles and SPECT imaging results for 111In- and 177Lu-octapa-trastuzumab compared to 111In- and 177Lu-DOTA-trastuzumab, with increased tumor uptake and higher tumor-to-tissue activity ratios. PMID:23901833
Shrestha, R; Tatsukawa, H; Shrestha, R; Ishibashi, N; Matsuura, T; Kagechika, H; Kose, S; Hitomi, K; Imamoto, N; Kojima, S
2015-01-01
Nuclear accumulation of transglutaminase 2 (TG2) is an important step in TG2-dependent cell death. However, the underlying molecular mechanisms for nuclear translocation of TG2 are still poorly understood. In this study, we demonstrated that acyclic retinoid (ACR) induced nuclear accumulation of TG2 in JHH-7 cells, a hepatocellular carcinoma (HCC) leading to their apoptosis. We further demonstrated molecular mechanism in nuclear-cytoplasmic trafficking of TG2 and an effect of ACR on it. We identified a novel 14-amino acid nuclear localization signal (NLS) 466AEKEETGMAMRIRV479 in the ‘C' domain and a leucine-rich nuclear export signal (NES) 657LHMGLHKL664 in the ‘D' domain that allowed TG2 to shuttle between the nuclear and cytosolic milieu. Increased nuclear import of GAPDH myc-HIS fused with the identified NLS was observed, confirming its nuclear import ability. Leptomycin B, an inhibitor of exportin-1 as well as point mutation of all leucine residues to glutamine residues in the NES of TG2 demolished its nuclear export. TG2 formed a trimeric complex with importin-α and importin-β independently from transamidase activity which strongly suggested the involvement of a NLS-based translocation of TG2 to the nucleus. ACR accelerated the formation of the trimeric complex and that may be at least in part responsible for enhanced nuclear localization of TG2 in HCC cells treated with ACR. PMID:26633708
Mollin, Stefan; Riedel, Radostan; Harms, Klaus; Meggers, Eric
2015-07-01
Octahedral metal complexes are attractive structural templates for the design of enzyme inhibitors as has been demonstrated, for example, with the development of metallo-pyridocarbazoles as protein kinase inhibitors. The octahedral coordination sphere provides untapped structural opportunities but at the same time poses the drawback of dealing with a large number of stereoisomers. In order to address this challenge of controlling the relative metal-centered configuration, the synthesis of rhodium(III) pyridocarbazole complexes with facially coordinating acyclic tridentate ligands was investigated. A strategy for the rapid synthesis of such complexes is reported, the diastereoselectivities of these reactions were investigated, the structure of several complexes were determined by X-ray crystallography, the high kinetic stability of such complexes in thiol-containing solutions was demonstrated in (1)H-NMR experiments, and the protein kinase inhibition ability of this class of complexes was confirmed. It can be concluded that the use of multidentate ligands is currently maybe the most practical strategy to avoid a large number of possible stereoisomers in the course of exploiting octahedral coordination spheres as structural templates for the design of bioactive molecules.
De Clercq, Erik
2003-01-01
The acyclic nucleoside phosphonates HPMPC (cidofovir), PMEA (adefovir), and PMPA (tenofovir) have proved to be effective in vitro (cell culture systems) and in vivo (animal models and clinical studies) against a wide variety of DNA virus and retrovirus infections: cidofovir against herpesvirus (herpes simplex virus types 1 and 2 varicella-zoster virus, cytomegalovirus [CMV], Epstein-Barr virus, and human herpesviruses 6, 7, and 8), polyomavirus, papillomavirus, adenovirus, and poxvirus (variola virus, cowpox virus, vaccinia virus, molluscum contagiosum virus, and orf virus) infections; adefovir against herpesvirus, hepadnavirus (human hepatitis B virus), and retrovirus (human immunodeficiency virus types 1 [HIV-1] and 2 [HIV-2], simian immunodeficiency virus, and feline immunodeficiency virus) infections; and tenofovir against both hepadnavirus and retrovirus infections. Cidofovir (Vistide) has been officially approved for the treatment of CMV retinitis in AIDS patients, tenofovir disoproxil fumarate (Viread) has been approved for the treatment of HIV infections (i.e., AIDS), and adefovir dipivoxil (Hepsera) has been approved for the treatment of chronic hepatitis B. Nephrotoxicity is the dose-limiting side effect for cidofovir (Vistide) when used intravenously (5 mg/kg); no toxic side effects have been described for adefovir dipivoxil and tenofovir disoproxil fumarate, at the approved doses (Hepsera at 10 mg orally daily and Viread at 300 mg orally daily). PMID:14557287
Lamplighter groups, de Brujin graphs, spider-web graphs and their spectra
NASA Astrophysics Data System (ADS)
Grigorchuk, R.; Leemann, P.-H.; Nagnibeda, T.
2016-05-01
We study the infinite family of spider-web graphs \\{{{ S }}k,N,M\\}, k≥slant 2, N≥slant 0 and M≥slant 1, initiated in the 50s in the context of network theory. It was later shown in physical literature that these graphs have remarkable percolation and spectral properties. We provide a mathematical explanation of these properties by putting the spider-web graphs in the context of group theory and algebraic graph theory. Namely, we realize them as tensor products of the well-known de Bruijn graphs \\{{{ B }}k,N\\} with cyclic graphs \\{{C}M\\} and show that these graphs are described by the action of the lamplighter group {{ L }}k={Z}/k{Z}\\wr {Z} on the infinite binary tree. Our main result is the identification of the infinite limit of \\{{{ S }}k,N,M\\}, as N,M\\to ∞ , with the Cayley graph of the lamplighter group {{ L }}k which, in turn, is one of the famous Diestel-Leader graphs {{DL}}k,k. As an application we compute the spectra of all spider-web graphs and show their convergence to the discrete spectral distribution associated with the Laplacian on the lamplighter group.
Graph-Based Object Class Discovery
NASA Astrophysics Data System (ADS)
Xia, Shengping; Hancock, Edwin R.
We are interested in the problem of discovering the set of object classes present in a database of images using a weakly supervised graph-based framework. Rather than making use of the ”Bag-of-Features (BoF)” approach widely used in current work on object recognition, we represent each image by a graph using a group of selected local invariant features. Using local feature matching and iterative Procrustes alignment, we perform graph matching and compute a similarity measure. Borrowing the idea of query expansion , we develop a similarity propagation based graph clustering (SPGC) method. Using this method class specific clusters of the graphs can be obtained. Such a cluster can be generally represented by using a higher level graph model whose vertices are the clustered graphs, and the edge weights are determined by the pairwise similarity measure. Experiments are performed on a dataset, in which the number of images increases from 1 to 50K and the number of objects increases from 1 to over 500. Some objects have been discovered with total recall and a precision 1 in a single cluster.
A Graph Syntax for Processes and Services
NASA Astrophysics Data System (ADS)
Bruni, Roberto; Gadducci, Fabio; Lafuente, Alberto Lluch
We propose a class of hierarchical graphs equipped with a simple algebraic syntax as a convenient way to describe configurations in languages with inherently hierarchical features such as sessions, fault- handling scopes or transactions. The graph syntax can be seen as an intermediate representation language, that facilitates the encoding of structured specifications and, in particular, of process calculi, since it provides primitives for nesting, name restriction and parallel composition. The syntax is based on an algebraic presentation that faithfully characterises families of hierarchical graphs, meaning that each term of the language uniquely identifies an equivalence class of graphs (modulo graph isomorphism). Proving soundness and completeness of an encoding (i.e. proving that structurally equivalent processes are mapped to isomorphic graphs) is then facilitated and can be done by structural induction. Summing up, the graph syntax facilitates the definition of faithful encodings, yet allowing a precise visual representation. We illustrate our work with an application to a workflow language and a service-oriented calculus.
Pathfinder: Visual Analysis of Paths in Graphs
Partl, C.; Gratzl, S.; Streit, M.; Wassermann, A. M.; Pfister, H.; Schmalstieg, D.; Lex, A.
2016-01-01
The analysis of paths in graphs is highly relevant in many domains. Typically, path-related tasks are performed in node-link layouts. Unfortunately, graph layouts often do not scale to the size of many real world networks. Also, many networks are multivariate, i.e., contain rich attribute sets associated with the nodes and edges. These attributes are often critical in judging paths, but directly visualizing attributes in a graph layout exacerbates the scalability problem. In this paper, we present visual analysis solutions dedicated to path-related tasks in large and highly multivariate graphs. We show that by focusing on paths, we can address the scalability problem of multivariate graph visualization, equipping analysts with a powerful tool to explore large graphs. We introduce Pathfinder (Figure 1), a technique that provides visual methods to query paths, while considering various constraints. The resulting set of paths is visualized in both a ranked list and as a node-link diagram. For the paths in the list, we display rich attribute data associated with nodes and edges, and the node-link diagram provides topological context. The paths can be ranked based on topological properties, such as path length or average node degree, and scores derived from attribute data. Pathfinder is designed to scale to graphs with tens of thousands of nodes and edges by employing strategies such as incremental query results. We demonstrate Pathfinder's fitness for use in scenarios with data from a coauthor network and biological pathways. PMID:27942090
Object Discovery: Soft Attributed Graph Mining.
Zhang, Quanshi; Song, Xuan; Shao, Xiaowei; Zhao, Huijing; Shibasaki, Ryosuke
2016-03-01
We categorize this research in terms of its contribution to both graph theory and computer vision. From the theoretical perspective, this study can be considered as the first attempt to formulate the idea of mining maximal frequent subgraphs in the challenging domain of messy visual data, and as a conceptual extension to the unsupervised learning of graph matching. We define a soft attributed pattern (SAP) to represent the common subgraph pattern among a set of attributed relational graphs (ARGs), considering both their structure and attributes. Regarding the differences between ARGs with fuzzy attributes and conventional labeled graphs, we propose a new mining strategy that directly extracts the SAP with the maximal graph size without applying node enumeration. Given an initial graph template and a number of ARGs, we develop an unsupervised method to modify the graph template into the maximal-size SAP. From a practical perspective, this research develops a general platform for learning the category model (i.e., the SAP) from cluttered visual data (i.e., the ARGs) without labeling "what is where," thereby opening the possibility for a series of applications in the era of big visual data. Experiments demonstrate the superior performance of the proposed method on RGB/RGB-D images and videos.
Sketch Matching on Topology Product Graph.
Liang, Shuang; Luo, Jun; Liu, Wenyin; Wei, Yichen
2015-08-01
Sketch matching is the fundamental problem in sketch based interfaces. After years of study, it remains challenging when there exists large irregularity and variations in the hand drawn sketch shapes. While most existing works exploit topology relations and graph representations for this problem, they are usually limited by the coarse topology exploration and heuristic (thus suboptimal) similarity metrics between graphs. We present a new sketch matching method with two novel contributions. We introduce a comprehensive definition of topology relations, which results in a rich and informative graph representation of sketches. For graph matching, we propose topology product graph that retains the full correspondence for matching two graphs. Based on it, we derive an intuitive sketch similarity metric whose exact solution is easy to compute. In addition, the graph representation and new metric naturally support partial matching, an important practical problem that received less attention in the literature. Extensive experimental results on a real challenging dataset and the superior performance of our method show that it outperforms the state-of-the-art.
A Review of Big Graph Mining Research
NASA Astrophysics Data System (ADS)
Atastina, I.; Sitohang, B.; Saptawati, G. A. P.; Moertini, V. S.
2017-03-01
Big Graph Mining” is a continuously developing research that was started in 2009 until now. After 7 years, there are many researches that put this topic as the main concern. However, there is no mapping or summary concerning the important issues and solutions to explain this topic. This paper contains a summary of researches that have been conducted since 2009. The result is grouped based on the algorithms, built system and also preprocess techniques that have been developed. Based on survey, there are 11 algorithms and 6 distributed systems to analyse the Big Graph have been improved. While improved pre-process algorithm only covers: sampling and compression technique. These improving algorithms are usually aimed to frequent sub graphs discovery, whereas slightly those of is aimed to cluster Big Graph, and there is no algorithm to classify Big Graph. As a conclusion of this survey, there is a need for more researches to be conducted to improve a comprehensive Graph Mining System, especially for very big Graph.
Partitioning sparse matrices with eigenvectors of graphs
NASA Technical Reports Server (NTRS)
Pothen, Alex; Simon, Horst D.; Liou, Kang-Pu
1990-01-01
The problem of computing a small vertex separator in a graph arises in the context of computing a good ordering for the parallel factorization of sparse, symmetric matrices. An algebraic approach for computing vertex separators is considered in this paper. It is shown that lower bounds on separator sizes can be obtained in terms of the eigenvalues of the Laplacian matrix associated with a graph. The Laplacian eigenvectors of grid graphs can be computed from Kronecker products involving the eigenvectors of path graphs, and these eigenvectors can be used to compute good separators in grid graphs. A heuristic algorithm is designed to compute a vertex separator in a general graph by first computing an edge separator in the graph from an eigenvector of the Laplacian matrix, and then using a maximum matching in a subgraph to compute the vertex separator. Results on the quality of the separators computed by the spectral algorithm are presented, and these are compared with separators obtained from other algorithms for computing separators. Finally, the time required to compute the Laplacian eigenvector is reported, and the accuracy with which the eigenvector must be computed to obtain good separators is considered. The spectral algorithm has the advantage that it can be implemented on a medium-size multiprocessor in a straightforward manner.
Approximate von Neumann entropy for directed graphs.
Ye, Cheng; Wilson, Richard C; Comin, César H; Costa, Luciano da F; Hancock, Edwin R
2014-05-01
In this paper, we develop an entropy measure for assessing the structural complexity of directed graphs. Although there are many existing alternative measures for quantifying the structural properties of undirected graphs, there are relatively few corresponding measures for directed graphs. To fill this gap in the literature, we explore an alternative technique that is applicable to directed graphs. We commence by using Chung's generalization of the Laplacian of a directed graph to extend the computation of von Neumann entropy from undirected to directed graphs. We provide a simplified form of the entropy which can be expressed in terms of simple node in-degree and out-degree statistics. Moreover, we find approximate forms of the von Neumann entropy that apply to both weakly and strongly directed graphs, and that can be used to characterize network structure. We illustrate the usefulness of these simplified entropy forms defined in this paper on both artificial and real-world data sets, including structures from protein databases and high energy physics theory citation networks.
Massive graph visualization : LDRD final report.
Wylie, Brian Neil; Moreland, Kenneth D.
2007-10-01
Graphs are a vital way of organizing data with complex correlations. A good visualization of a graph can fundamentally change human understanding of the data. Consequently, there is a rich body of work on graph visualization. Although there are many techniques that are effective on small to medium sized graphs (tens of thousands of nodes), there is a void in the research for visualizing massive graphs containing millions of nodes. Sandia is one of the few entities in the world that has the means and motivation to handle data on such a massive scale. For example, homeland security generates graphs from prolific media sources such as television, telephone, and the Internet. The purpose of this project is to provide the groundwork for visualizing such massive graphs. The research provides for two major feature gaps: a parallel, interactive visualization framework and scalable algorithms to make the framework usable to a practical application. Both the frameworks and algorithms are designed to run on distributed parallel computers, which are already available at Sandia. Some features are integrated into the ThreatView{trademark} application and future work will integrate further parallel algorithms.
Enabling Graph Mining in RDF Triplestores using SPARQL for Holistic In-situ Graph Analysis
Lee, Sangkeun; Sukumar, Sreenivas R; Hong, Seokyong; Lim, Seung-Hwan
2016-01-01
The graph analysis is now considered as a promising technique to discover useful knowledge in data with a new perspective. We envi- sion that there are two dimensions of graph analysis: OnLine Graph Analytic Processing (OLGAP) and Graph Mining (GM) where each respectively focuses on subgraph pattern matching and automatic knowledge discovery in graph. Moreover, as these two dimensions aim to complementarily solve complex problems, holistic in-situ graph analysis which covers both OLGAP and GM in a single system is critical for minimizing the burdens of operating multiple graph systems and transferring intermediate result-sets between those systems. Nevertheless, most existing graph analysis systems are only capable of one dimension of graph analysis. In this work, we take an approach to enabling GM capabilities (e.g., PageRank, connected-component analysis, node eccentricity, etc.) in RDF triplestores, which are originally developed to store RDF datasets and provide OLGAP capability. More specifically, to achieve our goal, we implemented six representative graph mining algorithms using SPARQL. The approach allows a wide range of available RDF data sets directly applicable for holistic graph analysis within a system. For validation of our approach, we evaluate performance of our implementations with nine real-world datasets and three different computing environments - a laptop computer, an Amazon EC2 instance, and a shared-memory Cray XMT2 URIKA-GD graph-processing appliance. The experimen- tal results show that our implementation can provide promising and scalable performance for real world graph analysis in all tested environments. The developed software is publicly available in an open-source project that we initiated.
Enabling Graph Mining in RDF Triplestores using SPARQL for Holistic In-situ Graph Analysis
Lee, Sangkeun; Sukumar, Sreenivas R; Hong, Seokyong; ...
2016-01-01
The graph analysis is now considered as a promising technique to discover useful knowledge in data with a new perspective. We envi- sion that there are two dimensions of graph analysis: OnLine Graph Analytic Processing (OLGAP) and Graph Mining (GM) where each respectively focuses on subgraph pattern matching and automatic knowledge discovery in graph. Moreover, as these two dimensions aim to complementarily solve complex problems, holistic in-situ graph analysis which covers both OLGAP and GM in a single system is critical for minimizing the burdens of operating multiple graph systems and transferring intermediate result-sets between those systems. Nevertheless, most existingmore » graph analysis systems are only capable of one dimension of graph analysis. In this work, we take an approach to enabling GM capabilities (e.g., PageRank, connected-component analysis, node eccentricity, etc.) in RDF triplestores, which are originally developed to store RDF datasets and provide OLGAP capability. More specifically, to achieve our goal, we implemented six representative graph mining algorithms using SPARQL. The approach allows a wide range of available RDF data sets directly applicable for holistic graph analysis within a system. For validation of our approach, we evaluate performance of our implementations with nine real-world datasets and three different computing environments - a laptop computer, an Amazon EC2 instance, and a shared-memory Cray XMT2 URIKA-GD graph-processing appliance. The experimen- tal results show that our implementation can provide promising and scalable performance for real world graph analysis in all tested environments. The developed software is publicly available in an open-source project that we initiated.« less
NASA Astrophysics Data System (ADS)
Abou-Hussein, Azza A. A.; Linert, Wolfgang
Mono- and bi-nuclear acyclic and macrocyclic complexes with hard-soft Schiff base, H2L, ligand derived from the reaction of 4,6-diacetylresorcinol and thiocabohydrazide, in the molar ratio 1:2 have been prepared. The H2L ligand reacts with Co(II), Ni(II), Cu(II), Zn(II), Mn(II) and UO2(VI) nitrates, VO(IV) sulfate and Ru(III) chloride to get acyclic binuclear complexes except for VO(IV) and Ru(III) which gave acyclic mono-nuclear complexes. Reaction of the acyclic mono-nuclear VO(IV) and Ru(III) complexes with 4,6-diacetylresorcinol afforded the corresponding macrocyclic mono-nuclear VO(IV) and Ru(IIII) complexes. Template reactions of the 4,6-diacetylresorcinol and thiocarbohydrazide with either VO(IV) or Ru(III) salts afforded the macrocyclic binuclear VO(IV) and Ru(III) complexes. The Schiff base, H2L, ligand acts as dibasic with two NSO-tridentate sites and can coordinate with two metal ions to form binuclear complexes after the deprotonation of the hydrogen atoms of the phenolic groups in all the complexes, except in the case of the acyclic mononuclear Ru(III) and VO(IV) complexes, where the Schiff base behaves as neutral tetradentate chelate with N2S2 donor atoms. The ligands and the metal complexes were characterized by elemental analysis, IR, UV-vis 1H-NMR, thermal gravimetric analysis (TGA) and ESR, as well as the measurements of conductivity and magnetic moments at room temperature. Electronic spectra and magnetic moments of the complexes indicate the geometries of the metal centers are either tetrahedral, square planar or octahedral. Kinetic and thermodynamic parameters were calculated using Coats-Redfern equation, for the different thermal decomposition steps of the complexes. The ligands and the metal complexes were screened for their antimicrobial activity against Staphylococcus aureus as Gram-positive bacteria, and Pseudomonas fluorescens as Gram-negative bacteria in addition to Fusarium oxysporum fungus. Most of the complexes exhibit mild
Computing the isoperimetric number of a graph
Golovach, P.A.
1995-01-01
Let G be a finite graph. Denote by {partial_derivative}X, where X {contained_in} VG, the set of edges of the graph G with one end in X and the other end in the set VG{backslash}X. The ratio i(G) = min {vert_bar}{vert_bar}X{vert_bar}/{vert_bar}X{vert_bar}, where the minimum is over all nonempty subsets X of the set VG such that {vert_bar}X{vert_bar} {le} {vert_bar} VG {vert_bar}/2, is called the isoperimetric number of the graph G. It is easy to see that the isoperimetric number may be used as a {open_quotes}measure of connectivity{close_quotes} of the graph. The problem of determining the isoperimetric number is clearly linked with graph partition problems, which often arise in various applications. The isoperimetric number is also important for studying Riemann surfaces. These and other applications of the isoperimetric number justify the analysis of graphs of this kind. The properties of the isoperimetric number are presented in more detail elsewhere. It is shown elsewhere that the computation of the isoperimetric number is an NP-hard problem for graphs with multiple edges. We will show that the decision problem {open_quotes}given the graph G and two integers s and t decide if i(G) {le} s/t{close_quotes} is NP-complete even for simple graphs with vertex degrees not exceeding 3. Note that the isoperimetric number of a tree can be computed by a known polynomial-time algorithm.
The MultiThreaded Graph Library (MTGL)
Berry, Jonathan; Leung, Vitus; McLendon, III, William; & Madduri, Kamesh
2008-07-17
The MultiThreaded Graph Library (MTGL) is a set of header files that implement graph algorithm in such a way that they can run on massively multithreaded architectures. It is based upon the Boost Graph Library, but doesnÃÂÃÂ¢ÃÂÃÂÃÂÃÂt use Boost since the latter doesnÃÂÃÂ¢ÃÂÃÂÃÂÃÂt run well on these architectures.
Identifying Codes on Directed De Bruijn Graphs
2014-12-19
ar X iv :1 41 2. 58 42 v1 [ m at h. C O ] 1 8 D ec 2 01 4 Identifying Codes on Directed De Bruijn Graphs Debra Boutin ∗ Department of...Mathematics Hamilton College Victoria Horan † Air Force Research Laboratory Information Directorate December 19, 2014 Abstract For a directed graph G, a t...length at most t is both non-empty and unique. A graph is called t-identifiable if there exists a t-identifying code. This paper shows that the de
A heterogeneous graph-based recommendation simulator
Yeonchan, Ahn; Sungchan, Park; Lee, Matt Sangkeun; Sang-goo, Lee
2013-01-01
Heterogeneous graph-based recommendation frameworks have flexibility in that they can incorporate various recommendation algorithms and various kinds of information to produce better results. In this demonstration, we present a heterogeneous graph-based recommendation simulator which enables participants to experience the flexibility of a heterogeneous graph-based recommendation method. With our system, participants can simulate various recommendation semantics by expressing the semantics via meaningful paths like User Movie User Movie. The simulator then returns the recommendation results on the fly based on the user-customized semantics using a fast Monte Carlo algorithm.
Identifying Codes on Directed De Bruijn Graphs
2015-08-27
JOURNAL ARTICLE (POST PRINT) 3. DATES COVERED (From - To) JUN 2013 – AUG 2015 4. TITLE AND SUBTITLE IDENTIFYING CODES ON DIRECTED DE BRUIJN GRAPHS 5a...owner. 14. ABSTRACT For a directed graph G, a t-identifying code is a subset S ⊆ V (G) with the property that for each vertex v ∈ V (G) the set of...t-identifying code . This paper shows that the directed de Bruijn graph B(d, n) is t- identifiable for n ≥ 2t−1, and is not t-identifiable for n ≤ 2t
The Total Interval of a Graph.
1988-01-01
definitions for all of these clases . A Husimi tree is a graph for which every block is a clique. A cactus is a graph for which every edge is in at most one...proportion of graphs with n vertices that we can represent with q(n) intervals is at most n-2 and this approaches zero as n gets large . Hence the...representations will have relatively few intervals of small depth and relatively many intervals of large depth. It is nevertheless often useful to restrict
Prime Graph Components of Finite Simple Groups
NASA Astrophysics Data System (ADS)
Kondrat'ev, A. S.
1990-02-01
Let G be a finite group and π(G) the set of prime factors of its order. The prime graph of G is the graph with vertex-set π(G), two vertices p and q being joined by an edge whenever G contains an element of order pq. This article contains an explicit description of the primes in each of the connected components of the prime graphs of the finite simple groups of Lie type of even characteristic. This solves question 9.16 of the Kourovka Notebook. Bibliography: 15 titles.
Finite Frames and Graph Theoretic Uncertainty Principles
NASA Astrophysics Data System (ADS)
Koprowski, Paul J.
The subject of analytical uncertainty principles is an important field within harmonic analysis, quantum physics, and electrical engineering. We explore uncertainty principles in the context of the graph Fourier transform, and we prove additive results analogous to the multiplicative version of the classical uncertainty principle. We establish additive uncertainty principles for finite Parseval frames. Lastly, we examine the feasibility region of simultaneous values of the norms of a graph differential operator acting on a function f ∈ l2(G) and its graph Fourier transform.
Implementation aspects of Graph Neural Networks
NASA Astrophysics Data System (ADS)
Barcz, A.; Szymański, Z.; Jankowski, S.
2013-10-01
This article summarises the results of implementation of a Graph Neural Network classi er. The Graph Neural Network model is a connectionist model, capable of processing various types of structured data, including non- positional and cyclic graphs. In order to operate correctly, the GNN model must implement a transition function being a contraction map, which is assured by imposing a penalty on model weights. This article presents research results concerning the impact of the penalty parameter on the model training process and the practical decisions that were made during the GNN implementation process.
Supporting interactive graph exploration using edge plucking
NASA Astrophysics Data System (ADS)
Wong, Nelson; Carpendale, Sheelagh
2007-01-01
Excessive edge density in graphs can cause serious readability issues, which in turn can make the graphs difficult to understand or even misleading. Recently, we introduced the idea of providing tools that offer interactive edge bending as a method by which edge congestion can be disambiguated. We extend this direction, presenting a new tool, Edge Plucking, which offers new interactive methods to clarify node-edge relationships. Edge Plucking expands the number of situations in which interactive graph exploration tools can be used to address edge congestion.
Line graphs for a multiplex network.
Criado, Regino; Flores, Julio; García Del Amo, Alejandro; Romance, Miguel; Barrena, Eva; Mesa, Juan A
2016-06-01
It is well known that line graphs offer a good summary of the graphs properties, which make them easier to analyze and highlight the desired properties. We extend the concept of line graph to multiplex networks in order to analyze multi-plexed and multi-layered networked systems. As these structures are very rich, different approaches to this notion are required to capture a variety of situations. Some relationships between these approaches are established. Finally, by means of some simulations, the potential utility of this concept is illustrated.
Rapid graph layout using space filling curves.
Muelder, Chris; Ma, Kwan-Liu
2008-01-01
Network data frequently arises in a wide variety of fields, and node-link diagrams are a very natural and intuitive representation of such data. In order for a node-link diagram to be effective, the nodes must be arranged well on the screen. While many graph layout algorithms exist for this purpose, they often have limitations such as high computational complexity or node colocation. This paper proposes a new approach to graph layout through the use of space filling curves which is very fast and guarantees that there will be no nodes that are colocated. The resulting layout is also aesthetic and satisfies several criteria for graph layout effectiveness.
Intelligent Graph Layout Using Many Users' Input.
Yuan, Xiaoru; Che, Limei; Hu, Yifan; Zhang, Xin
2012-12-01
In this paper, we propose a new strategy for graph drawing utilizing layouts of many sub-graphs supplied by a large group of people in a crowd sourcing manner. We developed an algorithm based on Laplacian constrained distance embedding to merge subgraphs submitted by different users, while attempting to maintain the topological information of the individual input layouts. To facilitate collection of layouts from many people, a light-weight interactive system has been designed to enable convenient dynamic viewing, modification and traversing between layouts. Compared with other existing graph layout algorithms, our approach can achieve more aesthetic and meaningful layouts with high user preference.
Integer sequence discovery from small graphs
Hoppe, Travis; Petrone, Anna
2015-01-01
We have exhaustively enumerated all simple, connected graphs of a finite order and have computed a selection of invariants over this set. Integer sequences were constructed from these invariants and checked against the Online Encyclopedia of Integer Sequences (OEIS). 141 new sequences were added and six sequences were extended. From the graph database, we were able to programmatically suggest relationships among the invariants. It will be shown that we can readily visualize any sequence of graphs with a given criteria. The code has been released as an open-source framework for further analysis and the database was constructed to be extensible to invariants not considered in this work. PMID:27034526
Loops in Reeb Graphs of 2-Manifolds
Cole-McLaughlin, K; Edelsbrunner, H; Harer, J; Natarajan, V; Pascucci, V
2003-02-11
Given a Morse function f over a 2-manifold with or without boundary, the Reeb graph is obtained by contracting the connected components of the level sets to points. We prove tight upper and lower bounds on the number of loops in the Reeb graph that depend on the genus, the number of boundary components, and whether or not the 2-manifold is orientable. We also give an algorithm that constructs the Reeb graph in time O(n log n), where n is the number of edges in the triangulation used to represent the 2-manifold and the Morse function.
Loops in Reeb Graphs of 2-Manifolds
Cole-McLaughlin, K; Edelsbrunner, H; Harer, J; Natarajan, V; Pascucci, V
2004-12-16
Given a Morse function f over a 2-manifold with or without boundary, the Reeb graph is obtained by contracting the connected components of the level sets to points. We prove tight upper and lower bounds on the number of loops in the Reeb graph that depend on the genus, the number of boundary components, and whether or not the 2-manifold is orientable. We also give an algorithm that constructs the Reeb graph in time O(n log n), where n is the number of edges in the triangulation used to represent the 2-manifold and the Morse function.
Motif-based embedding for graph clustering
NASA Astrophysics Data System (ADS)
Lim, Sungsu; Lee, Jae-Gil
2016-12-01
Community detection in complex networks is a fundamental problem that has been extensively studied owing to its wide range of applications. However, because community detection methods typically rely on the relations between vertices in networks, they may fail to discover higher-order graph substructures, called the network motifs. In this paper, we propose a novel embedding method for graph clustering that considers higher-order relationships involving multiple vertices. We show that our embedding method, which we call motif-based embedding, is more effective in detecting communities than existing graph embedding methods, spectral embedding and force-directed embedding, both theoretically and experimentally.
NASA Astrophysics Data System (ADS)
Shahid, Nauman; Perraudin, Nathanael; Kalofolias, Vassilis; Puy, Gilles; Vandergheynst, Pierre
2016-06-01
Mining useful clusters from high dimensional data has received significant attention of the computer vision and pattern recognition community in the recent years. Linear and non-linear dimensionality reduction has played an important role to overcome the curse of dimensionality. However, often such methods are accompanied with three different problems: high computational complexity (usually associated with the nuclear norm minimization), non-convexity (for matrix factorization methods) and susceptibility to gross corruptions in the data. In this paper we propose a principal component analysis (PCA) based solution that overcomes these three issues and approximates a low-rank recovery method for high dimensional datasets. We target the low-rank recovery by enforcing two types of graph smoothness assumptions, one on the data samples and the other on the features by designing a convex optimization problem. The resulting algorithm is fast, efficient and scalable for huge datasets with O(nlog(n)) computational complexity in the number of data samples. It is also robust to gross corruptions in the dataset as well as to the model parameters. Clustering experiments on 7 benchmark datasets with different types of corruptions and background separation experiments on 3 video datasets show that our proposed model outperforms 10 state-of-the-art dimensionality reduction models. Our theoretical analysis proves that the proposed model is able to recover approximate low-rank representations with a bounded error for clusterable data.
Activities: Relating to Graphs in Introductory Algebra.
ERIC Educational Resources Information Center
Van Dyke, Frances
1994-01-01
Presents activities designed to help students bridge the gap between the graphical representation of a function and a verbal description. Includes a number of nonstandard graphs and reproducible student worksheets. (MKR)
D'Azevedo, Ed F; Imam, Neena
2015-01-01
This document describes the effort to implement the Graph 500 benchmark using OpenSHMEM based on the MPI-2 one-side version. The Graph 500 benchmark performs a breadth-first search in parallel on a large randomly generated undirected graph and can be implemented using basic MPI-1 and MPI-2 one-sided communication. Graph 500 requires atomic bit-wise operations on unsigned long integers but neither atomic bit-wise operations nor OpenSHMEM for unsigned long are available in OpenSHEM. Such needed bit-wise atomic operations and support for unsigned long are implemented using atomic condition swap (CSWAP) on signed long integers. Preliminary results on comparing the OpenSHMEM and MPI-2 one-sided implementations on a Silicon Graphics Incorporated (SGI) cluster and the Cray XK7 are presented.
Logical reasoning necessary to make line graphs
NASA Astrophysics Data System (ADS)
Wavering, Michael J.
A study was conducted to determine the logical reasoning necessary to construct line graphs. Three types of line graphs were used: a straight line with a positive slope, a straight line with a negative slope, and an exponentially increasing curve. The subjects were students in grades six through twelve enrolled in a laboratory school. The responses were classified into one of nine categories. The categories ranged from no attempt to make a graph to a complete graph with a statement of a relationship between the variables. Subjects in grades six through eight exhibited behaviors mainly in the first four categories, ninth- and tenth-grade subjects scored in the middle categories, and eleventh and twelfth graders scored mainly in the upper categories. These response categories also showed a close fit with Piagetian concrete operational structures for single and double seriation and formal operational structures for proportional reasoning and correlational reasoning.
Strong sum distance in fuzzy graphs.
Tom, Mini; Sunitha, Muraleedharan Shetty
2015-01-01
In this paper the idea of strong sum distance which is a metric, in a fuzzy graph is introduced. Based on this metric the concepts of eccentricity, radius, diameter, center and self centered fuzzy graphs are studied. Some properties of eccentric nodes, peripheral nodes and central nodes are obtained. A characterisation of self centered complete fuzzy graph is obtained and conditions under which a fuzzy cycle is self centered are established. We have proved that based on this metric, an eccentric node of a fuzzy tree G is a fuzzy end node of G and a node is an eccentric node of a fuzzy tree if and only if it is a peripheral node of G and the center of a fuzzy tree consists of either one or two neighboring nodes. The concepts of boundary nodes and interior nodes in a fuzzy graph based on strong sum distance are introduced. Some properties of boundary nodes, interior nodes and complete nodes are studied.
Bipartite Graphs of Large Clique-Width
NASA Astrophysics Data System (ADS)
Korpelainen, Nicholas; Lozin, Vadim V.
Recently, several constructions of bipartite graphs of large clique-width have been discovered in the literature. In the present paper, we propose a general framework for developing such constructions and use it to obtain new results on this topic.
Fault-tolerant dynamic task graph scheduling
Kurt, Mehmet C.; Krishnamoorthy, Sriram; Agrawal, Kunal; Agrawal, Gagan
2014-11-16
In this paper, we present an approach to fault tolerant execution of dynamic task graphs scheduled using work stealing. In particular, we focus on selective and localized recovery of tasks in the presence of soft faults. We elicit from the user the basic task graph structure in terms of successor and predecessor relationships. The work stealing-based algorithm to schedule such a task graph is augmented to enable recovery when the data and meta-data associated with a task get corrupted. We use this redundancy, and the knowledge of the task graph structure, to selectively recover from faults with low space and time overheads. We show that the fault tolerant design retains the essential properties of the underlying work stealing-based task scheduling algorithm, and that the fault tolerant execution is asymptotically optimal when task re-execution is taken into account. Experimental evaluation demonstrates the low cost of recovery under various fault scenarios.
Efficient multiple-way graph partitioning algorithms
Dasdan, A.; Aykanat, C.
1995-12-01
Graph partitioning deals with evenly dividing a graph into two or more parts such that the total weight of edges interconnecting these parts, i.e., cutsize, is minimized. Graph partitioning has important applications in VLSI layout, mapping, and sparse Gaussian elimination. Since graph partitioning problem is NP-hard, we should resort to polynomial-time algorithms to obtain a good solution, or hopefully a near-optimal solution. Kernighan-Lin (KL) propsoed a 2-way partitioning algorithms. Fiduccia-Mattheyses (FM) introduced a faster version of KL algorithm. Sanchis (FMS) generalized FM algorithm to a multiple-way partitioning algorithm. Simulated Annealing (SA) is one of the most successful approaches that are not KL-based.
Exploring Hill Ciphers with Graphing Calculators.
ERIC Educational Resources Information Center
St. John, Dennis
1998-01-01
Explains how to code and decode messages using Hill ciphers which combine matrix multiplication and modular arithmetic. Discusses how a graphing calculator can facilitate the matrix and modular arithmetic used in the coding and decoding procedures. (ASK)
Graph Theory and the High School Student.
ERIC Educational Resources Information Center
Chartrand, Gary; Wall, Curtiss E.
1980-01-01
Graph theory is presented as a tool to instruct high school mathematics students. A variety of real world problems can be modeled which help students recognize the importance and difficulty of applying mathematics. (MP)
Bipartite graph partitioning and data clustering
Zha, Hongyuan; He, Xiaofeng; Ding, Chris; Gu, Ming; Simon, Horst D.
2001-05-07
Many data types arising from data mining applications can be modeled as bipartite graphs, examples include terms and documents in a text corpus, customers and purchasing items in market basket analysis and reviewers and movies in a movie recommender system. In this paper, the authors propose a new data clustering method based on partitioning the underlying biopartite graph. The partition is constructed by minimizing a normalized sum of edge weights between unmatched pairs of vertices of the bipartite graph. They show that an approximate solution to the minimization problem can be obtained by computing a partial singular value decomposition (SVD) of the associated edge weight matrix of the bipartite graph. They point out the connection of their clustering algorithm to correspondence analysis used in multivariate analysis. They also briefly discuss the issue of assigning data objects to multiple clusters. In the experimental results, they apply their clustering algorithm to the problem of document clustering to illustrate its effectiveness and efficiency.
Pre-Service Elementary Teachers' Understandings of Graphs
ERIC Educational Resources Information Center
Alacaci, Cengiz; Lewis, Scott; O'Brien, George E.; Jiang, Zhonghong
2011-01-01
Choosing graphs to display quantitative information is a component of "graph sense". An important aspect of pre-service elementary teachers' content knowledge; ability to choose appropriate graphs in applied contexts is investigated in this study. They were given three scenarios followed by four graphs representing the same quantitative data. They…
47 CFR 73.184 - Groundwave field strength graphs.
Code of Federal Regulations, 2014 CFR
2014-10-01
... 47 Telecommunication 4 2014-10-01 2014-10-01 false Groundwave field strength graphs. 73.184... RADIO BROADCAST SERVICES AM Broadcast Stations § 73.184 Groundwave field strength graphs. (a) Graphs 1... graph paper and each is to be used for the range of frequencies shown thereon. Computations are based...
47 CFR 73.184 - Groundwave field strength graphs.
Code of Federal Regulations, 2010 CFR
2010-10-01
... 47 Telecommunication 4 2010-10-01 2010-10-01 false Groundwave field strength graphs. 73.184... RADIO BROADCAST SERVICES AM Broadcast Stations § 73.184 Groundwave field strength graphs. (a) Graphs 1... graph paper and each is to be used for the range of frequencies shown thereon. Computations are based...
47 CFR 73.184 - Groundwave field strength graphs.
Code of Federal Regulations, 2012 CFR
2012-10-01
... 47 Telecommunication 4 2012-10-01 2012-10-01 false Groundwave field strength graphs. 73.184... RADIO BROADCAST SERVICES AM Broadcast Stations § 73.184 Groundwave field strength graphs. (a) Graphs 1... graph paper and each is to be used for the range of frequencies shown thereon. Computations are based...
47 CFR 73.184 - Groundwave field strength graphs.
Code of Federal Regulations, 2013 CFR
2013-10-01
... 47 Telecommunication 4 2013-10-01 2013-10-01 false Groundwave field strength graphs. 73.184... RADIO BROADCAST SERVICES AM Broadcast Stations § 73.184 Groundwave field strength graphs. (a) Graphs 1... graph paper and each is to be used for the range of frequencies shown thereon. Computations are based...
Continuous Time Group Discovery in Dynamic Graphs
Miller, K; Eliassi-Rad, T
2010-11-04
With the rise in availability and importance of graphs and networks, it has become increasingly important to have good models to describe their behavior. While much work has focused on modeling static graphs, we focus on group discovery in dynamic graphs. We adapt a dynamic extension of Latent Dirichlet Allocation to this task and demonstrate good performance on two datasets. Modeling relational data has become increasingly important in recent years. Much work has focused on static graphs - that is fixed graphs at a single point in time. Here we focus on the problem of modeling dynamic (i.e. time-evolving) graphs. We propose a scalable Bayesian approach for community discovery in dynamic graphs. Our approach is based on extensions of Latent Dirichlet Allocation (LDA). LDA is a latent variable model for topic modeling in text corpora. It was extended to deal with topic changes in discrete time and later in continuous time. These models were referred to as the discrete Dynamic Topic Model (dDTM) and the continuous Dynamic Topic Model (cDTM), respectively. When adapting these models to graphs, we take our inspiration from LDA-G and SSN-LDA, applications of LDA to static graphs that have been shown to effectively factor out community structure to explain link patterns in graphs. In this paper, we demonstrate how to adapt and apply the cDTM to the task of finding communities in dynamic networks. We use link prediction to measure the quality of the discovered community structure and apply it to two different relational datasets - DBLP author-keyword and CAIDA autonomous systems relationships. We also discuss a parallel implementation of this approach using Hadoop. In Section 2, we review LDA and LDA-G. In Section 3, we review the cDTM and introduce cDTMG, its adaptation to modeling dynamic graphs. We discuss inference for the cDTM-G and details of our parallel implementation in Section 4 and present its performance on two datasets in Section 5 before concluding in
Understanding graphs with two independent variables
NASA Astrophysics Data System (ADS)
Cooper, Jennifer L.
Adults are not necessarily competent users of graphs with two independent variables, despite the frequency of this representational format. The three tasks in this thesis address the impact of interpretation statements and graph patterns. Interpretation statements were based on the statistical effects -- simple effects, main effects, and interactions. Graph patterns were systematically varied based on a novel classification scheme of graphs with two IVs. I suggest that the complexity of a graph's data pattern depends on the consistency of the simple effects' directions and magnitudes. In the first study, undergraduates constructed graphs based on statements about data patterns. Errors reflected a misunderstanding of how two IVs could be combined and represented graphically. When the experimental group had graph-relevant information added (variable labels spatially located on axes), the ability to represent the relationships among the IVs significantly increased. The ability to satisfy the constraints imposed by the statements was not affected. Adding labels specifically targeted skills relevant to graphical literacy. Transfer to a third trial was stronger for those of higher math abilities. The second study focused on the effect of an introductory statistics course. Overall, undergraduates performed well on statements describing the simple effects of the IVs. However, even though they improved from Time 1 to Time 2 for interaction statements, performance on statements about main effects and interactions still showed considerable room for improvement. In the third study, repeated trials of the 20 patterns proposed by the simple effects consistency model established that the proposed classification scheme addresses additional sources of variability in reasoning with graphs (i.e., sources not captured by traditional classification schemes). As the complexity level of the data pattern increased, performance (based on accuracy and RT) decreased, with parallel impacts on
Kernel-Based Reconstruction of Graph Signals
NASA Astrophysics Data System (ADS)
Romero, Daniel; Ma, Meng; Giannakis, Georgios B.
2017-02-01
A number of applications in engineering, social sciences, physics, and biology involve inference over networks. In this context, graph signals are widely encountered as descriptors of vertex attributes or features in graph-structured data. Estimating such signals in all vertices given noisy observations of their values on a subset of vertices has been extensively analyzed in the literature of signal processing on graphs (SPoG). This paper advocates kernel regression as a framework generalizing popular SPoG modeling and reconstruction and expanding their capabilities. Formulating signal reconstruction as a regression task on reproducing kernel Hilbert spaces of graph signals permeates benefits from statistical learning, offers fresh insights, and allows for estimators to leverage richer forms of prior information than existing alternatives. A number of SPoG notions such as bandlimitedness, graph filters, and the graph Fourier transform are naturally accommodated in the kernel framework. Additionally, this paper capitalizes on the so-called representer theorem to devise simpler versions of existing Thikhonov regularized estimators, and offers a novel probabilistic interpretation of kernel methods on graphs based on graphical models. Motivated by the challenges of selecting the bandwidth parameter in SPoG estimators or the kernel map in kernel-based methods, the present paper further proposes two multi-kernel approaches with complementary strengths. Whereas the first enables estimation of the unknown bandwidth of bandlimited signals, the second allows for efficient graph filter selection. Numerical tests with synthetic as well as real data demonstrate the merits of the proposed methods relative to state-of-the-art alternatives.
Cantor spectra of magnetic chain graphs
NASA Astrophysics Data System (ADS)
Exner, Pavel; Vašata, Daniel
2017-04-01
We demonstrate a one-dimensional magnetic system can exhibit a Cantor-type spectrum using an example of a chain graph with δ coupling at the vertices exposed to a magnetic field perpendicular to the graph plane and varying along the chain. If the field grows linearly with an irrational slope, measured in terms of the flux through the loops of the chain, we demonstrate the character of the spectrum relating it to the almost Mathieu operator.
Molecular electrostatic potential as a graph.
Daza, Edgar E; Maza, Julio; Torres, Raul
2013-06-01
We present several procedures to represent molecular electrostatic potential as a graph, based on the pattern of critical points and their neighborhood relations. This representation is used for the molecular electrostatic comparison, which is reduced to a comparison of tree-type graphs. Several methods to compare trees are also presented. The applications of this algorithm to compare and classify molecules through their electrostatic potential are illustrated.
A software tool for dataflow graph scheduling
NASA Technical Reports Server (NTRS)
Jones, Robert L., III
1994-01-01
A graph-theoretic design process and software tool is presented for selecting a multiprocessing scheduling solution for a class of computational problems. The problems of interest are those that can be described using a dataflow graph and are intended to be executed repetitively on multiple processors. The dataflow paradigm is very useful in exposing the parallelism inherent in algorithms. It provides a graphical and mathematical model which describes a partial ordering of algorithm tasks based on data precedence.
Accelerating semantic graph databases on commodity clusters
Morari, Alessandro; Castellana, Vito G.; Haglin, David J.; Feo, John T.; Weaver, Jesse R.; Tumeo, Antonino; Villa, Oreste
2013-10-06
We are developing a full software system for accelerating semantic graph databases on commodity cluster that scales to hundreds of nodes while maintaining constant query throughput. Our framework comprises a SPARQL to C++ compiler, a library of parallel graph methods and a custom multithreaded runtime layer, which provides a Partitioned Global Address Space (PGAS) programming model with fork/join parallelism and automatic load balancing over a commodity clusters. We present preliminary results for the compiler and for the runtime.
Capacitated max -Batching with Interval Graph Compatibilities
NASA Astrophysics Data System (ADS)
Nonner, Tim
We consider the problem of partitioning interval graphs into cliques of bounded size. Each interval has a weight, and the weight of a clique is the maximum weight of any interval in the clique. This natural graph problem can be interpreted as a batch scheduling problem. Solving a long-standing open problem, we show NP-hardness, even if the bound on the clique sizes is constant. Moreover, we give a PTAS based on a novel dynamic programming technique for this case.
Inverse scattering problem for quantum graph vertices
Cheon, Taksu; Turek, Ondrej; Exner, Pavel
2011-06-15
We demonstrate how the inverse scattering problem of a quantum star graph can be solved by means of diagonalization of the Hermitian unitary matrix when the vertex coupling is of the scale-invariant (or Fueloep-Tsutsui) form. This enables the construction of quantum graphs with desired properties in a tailor-made fashion. The procedure is illustrated on the example of quantum vertices with equal transmission probabilities.
Reproducibility of graph metrics in FMRI networks.
Telesford, Qawi K; Morgan, Ashley R; Hayasaka, Satoru; Simpson, Sean L; Barret, William; Kraft, Robert A; Mozolic, Jennifer L; Laurienti, Paul J
2010-01-01
The reliability of graph metrics calculated in network analysis is essential to the interpretation of complex network organization. These graph metrics are used to deduce the small-world properties in networks. In this study, we investigated the test-retest reliability of graph metrics from functional magnetic resonance imaging data collected for two runs in 45 healthy older adults. Graph metrics were calculated on data for both runs and compared using intraclass correlation coefficient (ICC) statistics and Bland-Altman (BA) plots. ICC scores describe the level of absolute agreement between two measurements and provide a measure of reproducibility. For mean graph metrics, ICC scores were high for clustering coefficient (ICC = 0.86), global efficiency (ICC = 0.83), path length (ICC = 0.79), and local efficiency (ICC = 0.75); the ICC score for degree was found to be low (ICC = 0.29). ICC scores were also used to generate reproducibility maps in brain space to test voxel-wise reproducibility for unsmoothed and smoothed data. Reproducibility was uniform across the brain for global efficiency and path length, but was only high in network hubs for clustering coefficient, local efficiency, and degree. BA plots were used to test the measurement repeatability of all graph metrics. All graph metrics fell within the limits for repeatability. Together, these results suggest that with exception of degree, mean graph metrics are reproducible and suitable for clinical studies. Further exploration is warranted to better understand reproducibility across the brain on a voxel-wise basis.
Constrained Markovian Dynamics of Random Graphs
NASA Astrophysics Data System (ADS)
Coolen, A. C. C.; de Martino, A.; Annibale, A.
2009-09-01
We introduce a statistical mechanics formalism for the study of constrained graph evolution as a Markovian stochastic process, in analogy with that available for spin systems, deriving its basic properties and highlighting the role of the `mobility' (the number of allowed moves for any given graph). As an application of the general theory we analyze the properties of degree-preserving Markov chains based on elementary edge switchings. We give an exact yet simple formula for the mobility in terms of the graph's adjacency matrix and its spectrum. This formula allows us to define acceptance probabilities for edge switchings, such that the Markov chains become controlled Glauber-type detailed balance processes, designed to evolve to any required invariant measure (representing the asymptotic frequencies with which the allowed graphs are visited during the process). As a corollary we also derive a condition in terms of simple degree statistics, sufficient to guarantee that, in the limit where the number of nodes diverges, even for state-independent acceptance probabilities of proposed moves the invariant measure of the process will be uniform. We test our theory on synthetic graphs and on realistic larger graphs as studied in cellular biology, showing explicitly that, for instances where the simple edge swap dynamics fails to converge to the uniform measure, a suitably modified Markov chain instead generates the correct phase space sampling.
On convex relaxation of graph isomorphism
Aflalo, Yonathan; Bronstein, Alexander; Kimmel, Ron
2015-01-01
We consider the problem of exact and inexact matching of weighted undirected graphs, in which a bijective correspondence is sought to minimize a quadratic weight disagreement. This computationally challenging problem is often relaxed as a convex quadratic program, in which the space of permutations is replaced by the space of doubly stochastic matrices. However, the applicability of such a relaxation is poorly understood. We define a broad class of friendly graphs characterized by an easily verifiable spectral property. We prove that for friendly graphs, the convex relaxation is guaranteed to find the exact isomorphism or certify its inexistence. This result is further extended to approximately isomorphic graphs, for which we develop an explicit bound on the amount of weight disagreement under which the relaxation is guaranteed to find the globally optimal approximate isomorphism. We also show that in many cases, the graph matching problem can be further harmlessly relaxed to a convex quadratic program with only n separable linear equality constraints, which is substantially more efficient than the standard relaxation involving 2n equality and n2 inequality constraints. Finally, we show that our results are still valid for unfriendly graphs if additional information in the form of seeds or attributes is allowed, with the latter satisfying an easy to verify spectral characteristic. PMID:25713342
Graph representation of protein free energy landscape
Li, Minghai; Duan, Mojie; Fan, Jue; Huo, Shuanghong; Han, Li
2013-11-14
The thermodynamics and kinetics of protein folding and protein conformational changes are governed by the underlying free energy landscape. However, the multidimensional nature of the free energy landscape makes it difficult to describe. We propose to use a weighted-graph approach to depict the free energy landscape with the nodes on the graph representing the conformational states and the edge weights reflecting the free energy barriers between the states. Our graph is constructed from a molecular dynamics trajectory and does not involve projecting the multi-dimensional free energy landscape onto a low-dimensional space defined by a few order parameters. The calculation of free energy barriers was based on transition-path theory using the MSMBuilder2 package. We compare our graph with the widely used transition disconnectivity graph (TRDG) which is constructed from the same trajectory and show that our approach gives more accurate description of the free energy landscape than the TRDG approach even though the latter can be organized into a simple tree representation. The weighted-graph is a general approach and can be used on any complex system.
Probabilistic Graph Layout for Uncertain Network Visualization.
Schulz, Christoph; Nocaj, Arlind; Goertler, Jochen; Deussen, Oliver; Brandes, Ulrik; Weiskopf, Daniel
2017-01-01
We present a novel uncertain network visualization technique based on node-link diagrams. Nodes expand spatially in our probabilistic graph layout, depending on the underlying probability distributions of edges. The visualization is created by computing a two-dimensional graph embedding that combines samples from the probabilistic graph. A Monte Carlo process is used to decompose a probabilistic graph into its possible instances and to continue with our graph layout technique. Splatting and edge bundling are used to visualize point clouds and network topology. The results provide insights into probability distributions for the entire network-not only for individual nodes and edges. We validate our approach using three data sets that represent a wide range of network types: synthetic data, protein-protein interactions from the STRING database, and travel times extracted from Google Maps. Our approach reveals general limitations of the force-directed layout and allows the user to recognize that some nodes of the graph are at a specific position just by chance.
Graph representation of protein free energy landscape.
Li, Minghai; Duan, Mojie; Fan, Jue; Han, Li; Huo, Shuanghong
2013-11-14
The thermodynamics and kinetics of protein folding and protein conformational changes are governed by the underlying free energy landscape. However, the multidimensional nature of the free energy landscape makes it difficult to describe. We propose to use a weighted-graph approach to depict the free energy landscape with the nodes on the graph representing the conformational states and the edge weights reflecting the free energy barriers between the states. Our graph is constructed from a molecular dynamics trajectory and does not involve projecting the multi-dimensional free energy landscape onto a low-dimensional space defined by a few order parameters. The calculation of free energy barriers was based on transition-path theory using the MSMBuilder2 package. We compare our graph with the widely used transition disconnectivity graph (TRDG) which is constructed from the same trajectory and show that our approach gives more accurate description of the free energy landscape than the TRDG approach even though the latter can be organized into a simple tree representation. The weighted-graph is a general approach and can be used on any complex system.
Student reasoning about graphs in different contexts
NASA Astrophysics Data System (ADS)
Ivanjek, Lana; Susac, Ana; Planinic, Maja; Andrasevic, Aneta; Milin-Sipus, Zeljka
2016-06-01
This study investigates university students' graph interpretation strategies and difficulties in mathematics, physics (kinematics), and contexts other than physics. Eight sets of parallel (isomorphic) mathematics, physics, and other context questions about graphs, which were developed by us, were administered to 385 first-year students at the Faculty of Science, University of Zagreb. Students were asked to provide explanations and/or mathematical procedures with their answers. Students' main strategies and difficulties identified through the analysis of those explanations and procedures are described. Student strategies of graph interpretation were found to be largely context dependent and domain specific. A small fraction of students have used the same strategy in all three domains (mathematics, physics, and other contexts) on most sets of parallel questions. Some students have shown indications of transfer of knowledge in the sense that they used techniques and strategies developed in physics for solving (or attempting to solve) other context problems. In physics, the preferred strategy was the use of formulas, which sometimes seemed to block the use of other, more productive strategies which students displayed in other domains. Students' answers indicated the presence of slope-height confusion and interval-point confusion in all three domains. Students generally better interpreted graph slope than the area under a graph, although the concept of slope still seemed to be quite vague for many. The interpretation of the concept of area under a graph needs more attention in both physics and mathematics teaching.
Jubeli, Emile; Maginty, Amanda B; Khalique, Nada Abdul; Raju, Liji; Nicholson, David G; Larsen, Helge; Pungente, Michael D; Goldring, William P D
2017-01-05
In this communication we describe the construction of four succinic-based cationic lipids, their formulation with plasmid DNA (pDNA), and an evaluation of their in vitro gene delivery into Chinese hamster ovarian (CHO-K1) cells. The cationic lipids employed in this work possess either a dimethylamine or trimethylamine headgroup, and a macrocyclic or an acyclic hydrophobic domain composed of, or derived from two 16-atom, succinic-based acyl chains. The synthesized lipids and a co-lipid of neutral charge, either cholesterol or 1,2-dioleoyl-sn-glycero-3-phosphoethanolamine (DOPE), were formulated in an overall 3:2 cationic-to-neutral lipid molar ratio, then complexed with plasmid DNA (pDNA). The relative transfection performance was evaluated via a comparison between matched versus mismatched formulations defined by the rigidity relationship between the lipids employed. Gel electrophoresis was used to characterize the binding of the lipid formulations with plasmid DNA and the relative degree of plasmid degradation using a DNase I degradation assay. Small angle X-ray diffraction (SAXD) was employed to characterize the packing morphology of the lipid-DNA complexes. In general, the succinic unit embedded within the hydrophobic domain of the cationic lipids was found to improve lipid hydration. The transfection assays revealed a general trend in which mismatched formulations that employed a rigid lipid combined with a non-rigid (or flexible) lipid, outperformed the matched formulations. The results from this work suggest that the design of the cationic lipid structure and the composition of the lipoplex formulation play key roles in governing the transfection performance of nonviral gene delivery agents.
Muñoz Acuña, Ulyana; Carcache, Peter J Blanco; Matthew, Susan; Carcache de Blanco, Esperanza J
2016-07-01
The bioassay-guided fractionation of the aril of Myristica fragrans (mace spice) yielded five phenolic compounds, one new acyclic bis phenylpropanoid (1) and four previously known phenolic compounds: compounds (1) (S) 1-(3,4,5-trimethoxyphenyl)-2-(3-methoxy-5-(prop-1-yl) phenyl)-propan-1-ol, (2) benzenemethanol; α-[1-[2,6-dimethoxy-4-(2-propen-1-yl)phenoxy]ethyl]-3,4-dimethoxy-1-acetate, (3) odoratisol A, phenol, 4-[(2S,3S)-2,3-dihydro-7-methoxy-3-methyl-5-(1E)-1-propenyl-2-benzofuranyl]-2,6-dimethoxy, (4) 1,3-benzodioxate-5-methanol,α-[1-[2,6-dimethoxy-4-(2-propenyl)phenoxy]ethyl]-acetate, (5) licarin C; benzofuran,2,3-dihydro-7-methoxy-3-methyl-5-(1E)-1-yl-2-(3,4,5-trimethoxyphenyl). An NMR tube Mosher ester reaction was used in an approach to characterize and determine the assignment of the absolute configuration of the new isolated chiral alcohol (1). The PARP-1 inhibitory activity was evaluated for compound (1) (IC50=3.04μM), compound (2) (IC50=0.001μM), compound (4) (IC50=22.07μM) and compound (5) (IC50=3.11μM). Furthermore, the isolated secondary metabolites were tested for NF-κB and K-Ras inhibitory activities. When tested in the p65 assay, compounds (2) and (4) displayed potent NF-κB inhibition (IC50=1.5 nM and 3.4nM, respectively).
Kupakuwana, Gillian V.; Crill, James E.; McPike, Mark P.; Borer, Philip N.
2011-01-01
Background Aptamers are oligonucleotides that bind proteins and other targets with high affinity and selectivity. Twenty years ago elements of natural selection were adapted to in vitro selection in order to distinguish aptamers among randomized sequence libraries. The primary bottleneck in traditional aptamer discovery is multiple cycles of in vitro evolution. Methodology/Principal Findings We show that over-representation of sequences in aptamer libraries and deep sequencing enables acyclic identification of aptamers. We demonstrated this by isolating a known family of aptamers for human α-thrombin. Aptamers were found within a library containing an average of 56,000 copies of each possible randomized 15mer segment. The high affinity sequences were counted many times above the background in 2–6 million reads. Clustering analysis of sequences with more than 10 counts distinguished two sequence motifs with candidates at high abundance. Motif I contained the previously observed consensus 15mer, Thb1 (46,000 counts), and related variants with mostly G/T substitutions; secondary analysis showed that affinity for thrombin correlated with abundance (Kd = 12 nM for Thb1). The signal-to-noise ratio for this experiment was roughly 10,000∶1 for Thb1. Motif II was unrelated to Thb1 with the leading candidate (29,000 counts) being a novel aptamer against hexose sugars in the storage and elution buffers for Concanavilin A (Kd = 0.5 µM for α-methyl-mannoside); ConA was used to immobilize α-thrombin. Conclusions/Significance Over-representation together with deep sequencing can dramatically shorten the discovery process, distinguish aptamers having a wide range of affinity for the target, allow an exhaustive search of the sequence space within a simplified library, reduce the quantity of the target required, eliminate cycling artifacts, and should allow multiplexing of sequencing experiments and targets. PMID:21625587
Šolínová, Veronika; Mikysková, Hana; Kaiser, Martin Maxmilián; Janeba, Zlatko; Holý, Antonín; Kašička, Václav
2016-01-01
Affinity capillary electrophoresis (ACE) has been applied to estimation of apparent binding constant of complexes of (R,S)-enantiomers of selected acyclic nucleoside phosphonates (ANPs) with chiral selector β-cyclodextrin (βCD) in aqueous alkaline medium. The noncovalent interactions of five pairs of (R,S)-enantiomers of ANPs-based antiviral drugs and their derivatives with βCD were investigated in the background electrolyte (BGE) composed of 35 or 50 mM sodium tetraborate, pH 10.0, and containing variable concentration (0-25 mM) of βCD. The apparent binding constants of the complexes of (R,S)-enantiomers of ANPs with βCD were estimated from the dependence of effective electrophoretic mobilities of (R,S)-enantiomers of ANPs (measured simultaneously by ACE at constant reference temperature 25°C inside the capillary) on the concentration of βCD in the BGE using different nonlinear and linear calculation methodologies. Nonlinear regression analysis provided more precise and accurate values of the binding constants and a higher correlation coefficient as compared to the regression analysis of the three linearized plots of the effective mobility dependence on βCD concentration in the BGE. The complexes of (R,S)-enantiomers of ANPs with βCD have been found to be relatively weak - their apparent binding constants determined by the nonlinear regression analysis were in the range 13.3-46.4 L/mol whereas the values from the linearized plots spanned the interval 12.3-55.2 L/mol.
Preserving Differential Privacy in Degree-Correlation based Graph Generation.
Wang, Yue; Wu, Xintao
2013-08-01
Enabling accurate analysis of social network data while preserving differential privacy has been challenging since graph features such as cluster coefficient often have high sensitivity, which is different from traditional aggregate functions (e.g., count and sum) on tabular data. In this paper, we study the problem of enforcing edge differential privacy in graph generation. The idea is to enforce differential privacy on graph model parameters learned from the original network and then generate the graphs for releasing using the graph model with the private parameters. In particular, we develop a differential privacy preserving graph generator based on the dK-graph generation model. We first derive from the original graph various parameters (i.e., degree correlations) used in the dK-graph model, then enforce edge differential privacy on the learned parameters, and finally use the dK-graph model with the perturbed parameters to generate graphs. For the 2K-graph model, we enforce the edge differential privacy by calibrating noise based on the smooth sensitivity, rather than the global sensitivity. By doing this, we achieve the strict differential privacy guarantee with smaller magnitude noise. We conduct experiments on four real networks and compare the performance of our private dK-graph models with the stochastic Kronecker graph generation model in terms of utility and privacy tradeoff. Empirical evaluations show the developed private dK-graph generation models significantly outperform the approach based on the stochastic Kronecker generation model.
Preserving Differential Privacy in Degree-Correlation based Graph Generation
Wang, Yue; Wu, Xintao
2014-01-01
Enabling accurate analysis of social network data while preserving differential privacy has been challenging since graph features such as cluster coefficient often have high sensitivity, which is different from traditional aggregate functions (e.g., count and sum) on tabular data. In this paper, we study the problem of enforcing edge differential privacy in graph generation. The idea is to enforce differential privacy on graph model parameters learned from the original network and then generate the graphs for releasing using the graph model with the private parameters. In particular, we develop a differential privacy preserving graph generator based on the dK-graph generation model. We first derive from the original graph various parameters (i.e., degree correlations) used in the dK-graph model, then enforce edge differential privacy on the learned parameters, and finally use the dK-graph model with the perturbed parameters to generate graphs. For the 2K-graph model, we enforce the edge differential privacy by calibrating noise based on the smooth sensitivity, rather than the global sensitivity. By doing this, we achieve the strict differential privacy guarantee with smaller magnitude noise. We conduct experiments on four real networks and compare the performance of our private dK-graph models with the stochastic Kronecker graph generation model in terms of utility and privacy tradeoff. Empirical evaluations show the developed private dK-graph generation models significantly outperform the approach based on the stochastic Kronecker generation model. PMID:24723987
Labeled Graph Kernel for Behavior Analysis.
Zhao, Ruiqi; Martinez, Aleix M
2016-08-01
Automatic behavior analysis from video is a major topic in many areas of research, including computer vision, multimedia, robotics, biology, cognitive science, social psychology, psychiatry, and linguistics. Two major problems are of interest when analyzing behavior. First, we wish to automatically categorize observed behaviors into a discrete set of classes (i.e., classification). For example, to determine word production from video sequences in sign language. Second, we wish to understand the relevance of each behavioral feature in achieving this classification (i.e., decoding). For instance, to know which behavior variables are used to discriminate between the words apple and onion in American Sign Language (ASL). The present paper proposes to model behavior using a labeled graph, where the nodes define behavioral features and the edges are labels specifying their order (e.g., before, overlaps, start). In this approach, classification reduces to a simple labeled graph matching. Unfortunately, the complexity of labeled graph matching grows exponentially with the number of categories we wish to represent. Here, we derive a graph kernel to quickly and accurately compute this graph similarity. This approach is very general and can be plugged into any kernel-based classifier. Specifically, we derive a Labeled Graph Support Vector Machine (LGSVM) and a Labeled Graph Logistic Regressor (LGLR) that can be readily employed to discriminate between many actions (e.g., sign language concepts). The derived approach can be readily used for decoding too, yielding invaluable information for the understanding of a problem (e.g., to know how to teach a sign language). The derived algorithms allow us to achieve higher accuracy results than those of state-of-the-art algorithms in a fraction of the time. We show experimental results on a variety of problems and datasets, including multimodal data.
Graph optimized Laplacian eigenmaps for face recognition
NASA Astrophysics Data System (ADS)
Dornaika, F.; Assoum, A.; Ruichek, Y.
2015-01-01
In recent years, a variety of nonlinear dimensionality reduction techniques (NLDR) have been proposed in the literature. They aim to address the limitations of traditional techniques such as PCA and classical scaling. Most of these techniques assume that the data of interest lie on an embedded non-linear manifold within the higher-dimensional space. They provide a mapping from the high-dimensional space to the low-dimensional embedding and may be viewed, in the context of machine learning, as a preliminary feature extraction step, after which pattern recognition algorithms are applied. Laplacian Eigenmaps (LE) is a nonlinear graph-based dimensionality reduction method. It has been successfully applied in many practical problems such as face recognition. However the construction of LE graph suffers, similarly to other graph-based DR techniques from the following issues: (1) the neighborhood graph is artificially defined in advance, and thus does not necessary benefit the desired DR task; (2) the graph is built using the nearest neighbor criterion which tends to work poorly due to the high-dimensionality of original space; and (3) its computation depends on two parameters whose values are generally uneasy to assign, the neighborhood size and the heat kernel parameter. To address the above-mentioned problems, for the particular case of the LPP method (a linear version of LE), L. Zhang et al.1 have developed a novel DR algorithm whose idea is to integrate graph construction with specific DR process into a unified framework. This algorithm results in an optimized graph rather than a predefined one.
Labeled Graph Kernel for Behavior Analysis
Zhao, Ruiqi; Martinez, Aleix M.
2016-01-01
Automatic behavior analysis from video is a major topic in many areas of research, including computer vision, multimedia, robotics, biology, cognitive science, social psychology, psychiatry, and linguistics. Two major problems are of interest when analyzing behavior. First, we wish to automatically categorize observed behaviors into a discrete set of classes (i.e., classification). For example, to determine word production from video sequences in sign language. Second, we wish to understand the relevance of each behavioral feature in achieving this classification (i.e., decoding). For instance, to know which behavior variables are used to discriminate between the words apple and onion in American Sign Language (ASL). The present paper proposes to model behavior using a labeled graph, where the nodes define behavioral features and the edges are labels specifying their order (e.g., before, overlaps, start). In this approach, classification reduces to a simple labeled graph matching. Unfortunately, the complexity of labeled graph matching grows exponentially with the number of categories we wish to represent. Here, we derive a graph kernel to quickly and accurately compute this graph similarity. This approach is very general and can be plugged into any kernel-based classifier. Specifically, we derive a Labeled Graph Support Vector Machine (LGSVM) and a Labeled Graph Logistic Regressor (LGLR) that can be readily employed to discriminate between many actions (e.g., sign language concepts). The derived approach can be readily used for decoding too, yielding invaluable information for the understanding of a problem (e.g., to know how to teach a sign language). The derived algorithms allow us to achieve higher accuracy results than those of state-of-the-art algorithms in a fraction of the time. We show experimental results on a variety of problems and datasets, including multimodal data. PMID:26415154
A graph theoretic approach to scene matching
NASA Technical Reports Server (NTRS)
Ranganath, Heggere S.; Chipman, Laure J.
1991-01-01
The ability to match two scenes is a fundamental requirement in a variety of computer vision tasks. A graph theoretic approach to inexact scene matching is presented which is useful in dealing with problems due to imperfect image segmentation. A scene is described by a set of graphs, with nodes representing objects and arcs representing relationships between objects. Each node has a set of values representing the relations between pairs of objects, such as angle, adjacency, or distance. With this method of scene representation, the task in scene matching is to match two sets of graphs. Because of segmentation errors, variations in camera angle, illumination, and other conditions, an exact match between the sets of observed and stored graphs is usually not possible. In the developed approach, the problem is represented as an association graph, in which each node represents a possible mapping of an observed region to a stored object, and each arc represents the compatibility of two mappings. Nodes and arcs have weights indicating the merit or a region-object mapping and the degree of compatibility between two mappings. A match between the two graphs corresponds to a clique, or fully connected subgraph, in the association graph. The task is to find the clique that represents the best match. Fuzzy relaxation is used to update the node weights using the contextual information contained in the arcs and neighboring nodes. This simplifies the evaluation of cliques. A method of handling oversegmentation and undersegmentation problems is also presented. The approach is tested with a set of realistic images which exhibit many types of sementation errors.
GoFFish: A Sub-Graph Centric Framework for Large-Scale Graph Analytics1
Simmhan, Yogesh; Kumbhare, Alok; Wickramaarachchi, Charith; Nagarkar, Soonil; Ravi, Santosh; Raghavendra, Cauligi; Prasanna, Viktor
2014-08-25
Large scale graph processing is a major research area for Big Data exploration. Vertex centric programming models like Pregel are gaining traction due to their simple abstraction that allows for scalable execution on distributed systems naturally. However, there are limitations to this approach which cause vertex centric algorithms to under-perform due to poor compute to communication overhead ratio and slow convergence of iterative superstep. In this paper we introduce GoFFish a scalable sub-graph centric framework co-designed with a distributed persistent graph storage for large scale graph analytics on commodity clusters. We introduce a sub-graph centric programming abstraction that combines the scalability of a vertex centric approach with the flexibility of shared memory sub-graph computation. We map Connected Components, SSSP and PageRank algorithms to this model to illustrate its flexibility. Further, we empirically analyze GoFFish using several real world graphs and demonstrate its significant performance improvement, orders of magnitude in some cases, compared to Apache Giraph, the leading open source vertex centric implementation. We map Connected Components, SSSP and PageRank algorithms to this model to illustrate its flexibility. Further, we empirically analyze GoFFish using several real world graphs and demonstrate its significant performance improvement, orders of magnitude in some cases, compared to Apache Giraph, the leading open source vertex centric implementation.
ERIC Educational Resources Information Center
Deniz, Hasan; Dulger, Mehmet F.
2012-01-01
This study examined to what extent inquiry-based instruction supported with real-time graphing technology improves fourth grader's ability to interpret graphs as representations of physical science concepts such as motion and temperature. This study also examined whether there is any difference between inquiry-based instruction supported with…
ERIC Educational Resources Information Center
Gültepe, Nejla
2016-01-01
Graphing subjects in chemistry has been used to provide alternatives to verbal and algorithmic descriptions of a subject by handing students another way of improving their manipulation of concepts. Teachers should therefore know the level of students' graphing skills. Studies have identified that students have difficulty making connections with…
Graph's Topology and Free Energy of a Spin Model on the Graph
NASA Astrophysics Data System (ADS)
Choi, Jeong-Mo; Gilson, Amy I.; Shakhnovich, Eugene I.
2017-02-01
In this Letter we investigate a direct relationship between a graph's topology and the free energy of a spin system on the graph. We develop a method of separating topological and energetic contributions to the free energy, and find that considering the topology is sufficient to qualitatively compare the free energies of different graph systems at high temperature, even when the energetics are not fully known. This method was applied to the metal lattice system with defects, and we found that it partially explains why point defects are more stable than high-dimensional defects. Given the energetics, we can even quantitatively compare free energies of different graph structures via a closed form of linear graph contributions. The closed form is applied to predict the sequence-space free energy of lattice proteins, which is a key factor determining the designability of a protein structure.
Oliveira, Caio C; Pfaltz, Andreas; Correia, Carlos Roque Duarte
2015-11-16
We describe herein a highly regio- and enantioselective Pd-catalyzed Heck arylation of unactivated trisubstituted acyclic olefins to provide all-carbon quaternary stereogenic centers. Chiral N,N ligands of the pyrimidine- and pyrazino-oxazoline class were developed for that purpose, providing the desired products in good to high yields with enantiomeric ratios up to >99:1. Both linear and branched substituents on the olefins were well-tolerated. The potential of this new method is demonstrated by the straightforward synthesis of several O-methyl lactols and lactones containing quaternary stereocenters, together with a concise enantioselective total synthesis of the calcium channel blocker verapamil.
Graph mining: procedure, application to drug discovery and recent advances.
Takigawa, Ichigaku; Mamitsuka, Hiroshi
2013-01-01
Combinatorial chemistry has generated chemical libraries and databases with a huge number of chemical compounds, which include prospective drugs. Chemical structures of compounds can be molecular graphs, to which a variety of graph-based techniques in computer science, specifically graph mining, can be applied. The most basic way for analyzing molecular graphs is using structural fragments, so-called subgraphs in graph theory. The mainstream technique in graph mining is frequent subgraph mining, by which we can retrieve essential subgraphs in given molecular graphs. In this article we explain the idea and procedure of mining frequent subgraphs from given molecular graphs, raising some real applications, and we describe the recent advances of graph mining.
Survey of Approaches to Generate Realistic Synthetic Graphs
Lim, Seung-Hwan; Lee, Sangkeun; Powers, Sarah S; Shankar, Mallikarjun; Imam, Neena
2016-10-01
A graph is a flexible data structure that can represent relationships between entities. As with other data analysis tasks, the use of realistic graphs is critical to obtaining valid research results. Unfortunately, using the actual ("real-world") graphs for research and new algorithm development is difficult due to the presence of sensitive information in the data or due to the scale of data. This results in practitioners developing algorithms and systems that employ synthetic graphs instead of real-world graphs. Generating realistic synthetic graphs that provide reliable statistical confidence to algorithmic analysis and system evaluation involves addressing technical hurdles in a broad set of areas. This report surveys the state of the art in approaches to generate realistic graphs that are derived from fitted graph models on real-world graphs.
Modeling Transmission Line Networks Using Quantum Graphs
NASA Astrophysics Data System (ADS)
Koch, Trystan; Antonsen, Thomas
Quantum graphs--one dimensional edges, connecting nodes, that support propagating Schrödinger wavefunctions--have been studied extensively as tractable models of wave chaotic behavior (Smilansky and Gnutzmann 2006, Berkolaiko and Kuchment 2013). Here we consider the electrical analog, in which the graph represents an electrical network where the edges are transmission lines (Hul et. al. 2004) and the nodes contain either discrete circuit elements or intricate circuit elements best represented by arbitrary scattering matrices. Including these extra degrees of freedom at the nodes leads to phenomena that do not arise in simpler graph models. We investigate the properties of eigenfrequencies and eigenfunctions on these graphs, and relate these to the statistical description of voltages on the transmission lines when driving the network externally. The study of electromagnetic compatibility, the effect of external radiation on complicated systems with numerous interconnected cables, motivates our research into this extension of the graph model. Work supported by the Office of Naval Research (N0014130474) and the Air Force Office of Scientific Research.
Linear Time Vertex Partitioning on Massive Graphs.
Mell, Peter; Harang, Richard; Gueye, Assane
The problem of optimally removing a set of vertices from a graph to minimize the size of the largest resultant component is known to be NP-complete. Prior work has provided near optimal heuristics with a high time complexity that function on up to hundreds of nodes and less optimal but faster techniques that function on up to thousands of nodes. In this work, we analyze how to perform vertex partitioning on massive graphs of tens of millions of nodes. We use a previously known and very simple heuristic technique: iteratively removing the node of largest degree and all of its edges. This approach has an apparent quadratic complexity since, upon removal of a node and adjoining set of edges, the node degree calculations must be updated prior to choosing the next node. However, we describe a linear time complexity solution using an array whose indices map to node degree and whose values are hash tables indicating the presence or absence of a node at that degree value. This approach also has a linear growth with respect to memory usage which is surprising since we lowered the time complexity from quadratic to linear. We empirically demonstrate linear scalability and linear memory usage on random graphs of up to 15000 nodes. We then demonstrate tractability on massive graphs through execution on a graph with 34 million nodes representing Internet wide router connectivity.
Towards Scalable Graph Computation on Mobile Devices
Chen, Yiqi; Lin, Zhiyuan; Pienta, Robert; Kahng, Minsuk; Chau, Duen Horng
2015-01-01
Mobile devices have become increasingly central to our everyday activities, due to their portability, multi-touch capabilities, and ever-improving computational power. Such attractive features have spurred research interest in leveraging mobile devices for computation. We explore a novel approach that aims to use a single mobile device to perform scalable graph computation on large graphs that do not fit in the device's limited main memory, opening up the possibility of performing on-device analysis of large datasets, without relying on the cloud. Based on the familiar memory mapping capability provided by today's mobile operating systems, our approach to scale up computation is powerful and intentionally kept simple to maximize its applicability across the iOS and Android platforms. Our experiments demonstrate that an iPad mini can perform fast computation on large real graphs with as many as 272 million edges (Google+ social graph), at a speed that is only a few times slower than a 13″ Macbook Pro. Through creating a real world iOS app with this technique, we demonstrate the strong potential application for scalable graph computation on a single mobile device using our approach. PMID:25859564
Towards Scalable Graph Computation on Mobile Devices.
Chen, Yiqi; Lin, Zhiyuan; Pienta, Robert; Kahng, Minsuk; Chau, Duen Horng
2014-10-01
Mobile devices have become increasingly central to our everyday activities, due to their portability, multi-touch capabilities, and ever-improving computational power. Such attractive features have spurred research interest in leveraging mobile devices for computation. We explore a novel approach that aims to use a single mobile device to perform scalable graph computation on large graphs that do not fit in the device's limited main memory, opening up the possibility of performing on-device analysis of large datasets, without relying on the cloud. Based on the familiar memory mapping capability provided by today's mobile operating systems, our approach to scale up computation is powerful and intentionally kept simple to maximize its applicability across the iOS and Android platforms. Our experiments demonstrate that an iPad mini can perform fast computation on large real graphs with as many as 272 million edges (Google+ social graph), at a speed that is only a few times slower than a 13″ Macbook Pro. Through creating a real world iOS app with this technique, we demonstrate the strong potential application for scalable graph computation on a single mobile device using our approach.
DT-MRI segmentation using graph cuts
NASA Astrophysics Data System (ADS)
Weldeselassie, Yonas T.; Hamarneh, Ghassan
2007-03-01
An important problem in medical image analysis is the segmentation of anatomical regions of interest. Once regions of interest are segmented, one can extract shape, appearance, and structural features that can be analyzed for disease diagnosis or treatment evaluation. Diffusion tensor magnetic resonance imaging (DT-MRI) is a relatively new medical imaging modality that captures unique water diffusion properties and fiber orientation information of the imaged tissues. In this paper, we extend the interactive multidimensional graph cuts segmentation technique to operate on DT-MRI data by utilizing latest advances in tensor calculus and diffusion tensor dissimilarity metrics. The user interactively selects certain tensors as object ("obj") or background ("bkg") to provide hard constraints for the segmentation. Additional soft constraints incorporate information about both regional tissue diffusion as well as boundaries between tissues of different diffusion properties. Graph cuts are used to find globally optimal segmentation of the underlying 3D DT-MR image among all segmentations satisfying the constraints. We develop a graph structure from the underlying DT-MR image with the tensor voxels corresponding to the graph vertices and with graph edge weights computed using either Log-Euclidean or the J-divergence tensor dissimilarity metric. The topology of our segmentation is unrestricted and both obj and bkg segments may consist of several isolated parts. We test our method on synthetic DT data and apply it to real 2D and 3D MRI, providing segmentations of the corpus callosum in the brain and the ventricles of the heart.
Linear Time Vertex Partitioning on Massive Graphs
Mell, Peter; Harang, Richard; Gueye, Assane
2016-01-01
The problem of optimally removing a set of vertices from a graph to minimize the size of the largest resultant component is known to be NP-complete. Prior work has provided near optimal heuristics with a high time complexity that function on up to hundreds of nodes and less optimal but faster techniques that function on up to thousands of nodes. In this work, we analyze how to perform vertex partitioning on massive graphs of tens of millions of nodes. We use a previously known and very simple heuristic technique: iteratively removing the node of largest degree and all of its edges. This approach has an apparent quadratic complexity since, upon removal of a node and adjoining set of edges, the node degree calculations must be updated prior to choosing the next node. However, we describe a linear time complexity solution using an array whose indices map to node degree and whose values are hash tables indicating the presence or absence of a node at that degree value. This approach also has a linear growth with respect to memory usage which is surprising since we lowered the time complexity from quadratic to linear. We empirically demonstrate linear scalability and linear memory usage on random graphs of up to 15000 nodes. We then demonstrate tractability on massive graphs through execution on a graph with 34 million nodes representing Internet wide router connectivity. PMID:27336059
Shokri, Alireza; Wang, Xue B.; Wang, Yangping; O'Doherty, George A.; Kass, Steven R.
2016-03-17
Flexible acyclic alcohols with 1–5 hydroxyl groups were bound to chloride anion and these complexes were interrogated by negative ion photoelectron spectroscopy and companion density functional theory computations. The resulting vertical detachment energies are reproduced on average to 0.10 eV by M06-2X/aug-cc-pVTZ predictions and range from 4.45 – 5.96 eV. These values are 0.84 – 2.35 eV larger than the adiabatic detachment energy of Cl– as a result of the larger hydrogen bond networks in the bigger polyols. Adiabatic detachment energies of the alcohol–Cl– clusters are more difficult to determine both experimentally and computationally. This is due to the large geometry changes that occur upon photodetachment and the large bond dissociation energy of H–Cl which enables the resulting chlorine atom to abstract a hydrogen from any of the methylene (CH2) or methine (CH) positions. Both ionic and non-ionic hydrogen bonds (i.e., OH•••Cl– and OH•••OH•••Cl–) form in the larger polyols complexes, and are found to be energetically comparable. Subtle structural differences, consequently can lead to the formation of different types of hydrogen bonds and maximizing the ionic ones is not always preferred. Solution equilibrium binding constants between the alcohols and tetrrabuylammonium chloride (TBACl) in acetonitrile at -24.2, 22.0, and 53.6 °C were also determined. The free energies of association are nearly identical for all of the substrates (i.e., ΔG° = -2.8 ± 0.7 kcal mol–1). Compensating enthalpy and entropy values reveal, contrary to expectation and the intrinsic gas-phase preferences, that the bigger systems with more hydroxyl groups are entropically favored and enthalpically disfavored relative to the smaller species. This suggests that more solvent molecules are released upon binding TBACl to alcohols with more hydroxyl groups and is consistent with the measured negative heat capacities. These quantities increase with
Recent Developments in Quantitative Graph Theory: Information Inequalities for Networks
Dehmer, Matthias; Sivakumar, Lavanya
2012-01-01
In this article, we tackle a challenging problem in quantitative graph theory. We establish relations between graph entropy measures representing the structural information content of networks. In particular, we prove formal relations between quantitative network measures based on Shannon's entropy to study the relatedness of those measures. In order to establish such information inequalities for graphs, we focus on graph entropy measures based on information functionals. To prove such relations, we use known graph classes whose instances have been proven useful in various scientific areas. Our results extend the foregoing work on information inequalities for graphs. PMID:22355362
Unsupervised spectral mesh segmentation driven by heterogeneous graphs.
Theologou, Panagiotis; Pratikakis, Ioannis; Theoharis, Theoharis
2016-03-21
A fully automatic mesh segmentation scheme using heterogeneous graphs is presented. We introduce a spectral framework where local geometry affinities are coupled with surface patch affinities. A heterogeneous graph is constructed combining two distinct graphs: a weighted graph based on adjacency of patches of an initial over-segmentation, and the weighted dual mesh graph. The partitioning relies on processing each eigenvector of the heterogeneous graph Laplacian individually, taking into account the nodal set and nodal domain theory. Experiments on standard datasets show that the proposed unsupervised approach outperforms the state-of-the-art unsupervised methodologies and is comparable to the best supervised approaches.
Unsupervised Spectral Mesh Segmentation Driven by Heterogeneous Graphs.
Theologou, Panagiotis; Pratikakis, Ioannis; Theoharis, Theoharis
2017-02-01
A fully automatic mesh segmentation scheme using heterogeneous graphs is presented. We introduce a spectral framework where local geometry affinities are coupled with surface patch affinities. A heterogeneous graph is constructed combining two distinct graphs: a weighted graph based on adjacency of patches of an initial over-segmentation, and the weighted dual mesh graph. The partitioning relies on processing each eigenvector of the heterogeneous graph Laplacian individually, taking into account the nodal set and nodal domain theory. Experiments on standard datasets show that the proposed unsupervised approach outperforms the state-of-the-art unsupervised methodologies and is comparable to the best supervised approaches.
Aligning graphs and finding substructures by a cavity approach
NASA Astrophysics Data System (ADS)
Bradde, S.; Braunstein, A.; Mahmoudi, H.; Tria, F.; Weigt, M.; Zecchina, R.
2010-02-01
We introduce a new distributed algorithm for aligning graphs or finding substructures within a given graph. It is based on the cavity method and is used to study the maximum-clique and the graph-alignment problems in random graphs. The algorithm allows to analyze large graphs and may find applications in fields such as computational biology. As a proof of concept we use our algorithm to align the similarity graphs of two interacting protein families involved in bacterial signal transduction, and to predict actually interacting protein partners between these families.
Recent developments in quantitative graph theory: information inequalities for networks.
Dehmer, Matthias; Sivakumar, Lavanya
2012-01-01
In this article, we tackle a challenging problem in quantitative graph theory. We establish relations between graph entropy measures representing the structural information content of networks. In particular, we prove formal relations between quantitative network measures based on Shannon's entropy to study the relatedness of those measures. In order to establish such information inequalities for graphs, we focus on graph entropy measures based on information functionals. To prove such relations, we use known graph classes whose instances have been proven useful in various scientific areas. Our results extend the foregoing work on information inequalities for graphs.
Interactive Web Graphs with Fewer Restrictions
NASA Technical Reports Server (NTRS)
Fiedler, James
2012-01-01
There is growing popularity for interactive, statistical web graphs and programs to generate them. However, it seems that these programs tend to be somewhat restricted in which web browsers and statistical software are supported. For example, the software might use SVG (e.g., Protovis, gridSVG) or HTML canvas, both of which exclude most versions of Internet Explorer, or the software might be made specifically for R (gridSVG, CRanvas), thus excluding users of other stats software. There are more general tools (d3, Rapha lJS) which are compatible with most browsers, but using one of these to make statistical graphs requires more coding than is probably desired, and requires learning a new tool. This talk will present a method for making interactive web graphs, which, by design, attempts to support as many browsers and as many statistical programs as possible, while also aiming to be relatively easy to use and relatively easy to extend.
Dynamic graph system for a semantic database
Mizell, David
2015-01-27
A method and system in a computer system for dynamically providing a graphical representation of a data store of entries via a matrix interface is disclosed. A dynamic graph system provides a matrix interface that exposes to an application program a graphical representation of data stored in a data store such as a semantic database storing triples. To the application program, the matrix interface represents the graph as a sparse adjacency matrix that is stored in compressed form. Each entry of the data store is considered to represent a link between nodes of the graph. Each entry has a first field and a second field identifying the nodes connected by the link and a third field with a value for the link that connects the identified nodes. The first, second, and third fields represent the rows, column, and elements of the adjacency matrix.
A graph algebra for scalable visual analytics.
Shaverdian, Anna A; Zhou, Hao; Michailidis, George; Jagadish, Hosagrahar V
2012-01-01
Visual analytics (VA), which combines analytical techniques with advanced visualization features, is fast becoming a standard tool for extracting information from graph data. Researchers have developed many tools for this purpose, suggesting a need for formal methods to guide these tools' creation. Increased data demands on computing requires redesigning VA tools to consider performance and reliability in the context of analysis of exascale datasets. Furthermore, visual analysts need a way to document their analyses for reuse and results justification. A VA graph framework encapsulated in a graph algebra helps address these needs. Its atomic operators include selection and aggregation. The framework employs a visual operator and supports dynamic attributes of data to enable scalable visual exploration of data.
Heuristic Traversal Of A Free Space Graph
NASA Astrophysics Data System (ADS)
Holmes, Peter D.; Jungert, Erland
1989-01-01
In order to plan paths within a physical working space, effective data structures must be used for spatial representation. A free space graph is a data structure derived from a systematic decomposition of the unobstructed portions of the working space. For the two-dimensional case, this work describes an heuristic method for traversal and search of one particular type of free space graph. The focus herein regards the "dialogue" between an A* search process and an inference engine whose rules employ spatial operators for classification of local topologies within the free space graph. This knowledge-based technique is used to generate plans which describe admissible sequences of movement between selected start and goal configurations.
Dynamic graph system for a semantic database
Mizell, David
2016-04-12
A method and system in a computer system for dynamically providing a graphical representation of a data store of entries via a matrix interface is disclosed. A dynamic graph system provides a matrix interface that exposes to an application program a graphical representation of data stored in a data store such as a semantic database storing triples. To the application program, the matrix interface represents the graph as a sparse adjacency matrix that is stored in compressed form. Each entry of the data store is considered to represent a link between nodes of the graph. Each entry has a first field and a second field identifying the nodes connected by the link and a third field with a value for the link that connects the identified nodes. The first, second, and third fields represent the rows, column, and elements of the adjacency matrix.
Clustering gene expression data using graph separators.
Kaba, Bangaly; Pinet, Nicolas; Lelandais, Gaëlle; Sigayret, Alain; Berry, Anne
2007-01-01
Recent work has used graphs to modelize expression data from microarray experiments, in view of partitioning the genes into clusters. In this paper, we introduce the use of a decomposition by clique separators. Our aim is to improve the classical clustering methods in two ways: first we want to allow an overlap between clusters, as this seems biologically sound, and second we want to be guided by the structure of the graph to define the number of clusters. We test this approach with a well-known yeast database (Saccharomyces cerevisiae). Our results are good, as the expression profiles of the clusters we find are very coherent. Moreover, we are able to organize into another graph the clusters we find, and order them in a fashion which turns out to respect the chronological order defined by the the sporulation process.
Learning molecular energies using localized graph kernels
NASA Astrophysics Data System (ADS)
Ferré, Grégoire; Haut, Terry; Barros, Kipton
2017-03-01
Recent machine learning methods make it possible to model potential energy of atomic configurations with chemical-level accuracy (as calculated from ab initio calculations) and at speeds suitable for molecular dynamics simulation. Best performance is achieved when the known physical constraints are encoded in the machine learning models. For example, the atomic energy is invariant under global translations and rotations; it is also invariant to permutations of same-species atoms. Although simple to state, these symmetries are complicated to encode into machine learning algorithms. In this paper, we present a machine learning approach based on graph theory that naturally incorporates translation, rotation, and permutation symmetries. Specifically, we use a random walk graph kernel to measure the similarity of two adjacency matrices, each of which represents a local atomic environment. This Graph Approximated Energy (GRAPE) approach is flexible and admits many possible extensions. We benchmark a simple version of GRAPE by predicting atomization energies on a standard dataset of organic molecules.
Key-Node-Separated Graph Clustering and Layouts for Human Relationship Graph Visualization.
Itoh, Takayuki; Klein, Karsten
2015-01-01
Many graph-drawing methods apply node-clustering techniques based on the density of edges to find tightly connected subgraphs and then hierarchically visualize the clustered graphs. However, users may want to focus on important nodes and their connections to groups of other nodes for some applications. For this purpose, it is effective to separately visualize the key nodes detected based on adjacency and attributes of the nodes. This article presents a graph visualization technique for attribute-embedded graphs that applies a graph-clustering algorithm that accounts for the combination of connections and attributes. The graph clustering step divides the nodes according to the commonality of connected nodes and similarity of feature value vectors. It then calculates the distances between arbitrary pairs of clusters according to the number of connecting edges and the similarity of feature value vectors and finally places the clusters based on the distances. Consequently, the technique separates important nodes that have connections to multiple large clusters and improves the visibility of such nodes' connections. To test this technique, this article presents examples with human relationship graph datasets, including a coauthorship and Twitter communication network dataset.
Some Sufficient Conditions for Graphs to Be (g,f,n)-Critical Graphs
NASA Astrophysics Data System (ADS)
Zhou, Sizhong; Liu, Hongxia; Duan, Ziming
2009-01-01
Let G be a graph of order p, and let a and b and n be nonnegative integers with 1⩽a⩽b, and let g and f be two integer-valued functions defined on V(G) such that a⩽g(x)⩽f(x)⩽b for all x∈V(G). A (g,f)-factor of graph G is defined as a spanning subgraph F of G such that g(x)⩽dF(x)⩽f(x) for each x∈V(G). Then a graph G is called a (g,f,n)-critical graph if after deleting any n vertices of G the remaining graph of G has a (g,f)-factor. In this paper, we prove that every graph G is a (g,f,n)-critical graph if its minimum degree is greater than p+a+b-2√(a+1)p-bn+1 . Furthermore, it is showed that the result in this paper is best possible in some sense.
Diversity of Graphs with Highly Variable Connectivity
2016-06-07
or whether it is a technological or social network as argued in 37. This idea has been made previously in 7,26,29,33,38 and has also been recently...published 3 April 2007 A popular approach for describing the structure of many complex networks focuses on graph theoretic properties that...comparability of graph theoretic descriptions. DOI: 10.1103/PhysRevE.75.046102 PACS numbers: 89.75.Hc, 89.20.Ff INTRODUCTION The recent use of network models to
Lattices of processes in graphs with inputs
Shakhbazyan, K.V.
1995-09-01
This article is a continuation of others work, presenting a detailed analysis of finite lattices of processes in graphs with input nodes. Lattices of processes in such graphs are studied by representing the lattices in the form of an algebra of pairs. We define the algebra of pairs somewhat generalizing the definition. Let K and D be bounded distributive lattices. A sublattice {delta} {contained_in} K x D is called an algebra of pairs if for all K {element_of} K we have (K, 1{sub D}) {element_of} {delta} and for all d {element_of} D we have (O{sub K}).
Quasiperiodic graphs at the onset of chaos.
Luque, B; Cordero-Gracia, M; Gómez, M; Robledo, A
2013-12-01
We examine the connectivity fluctuations across networks obtained when the horizontal visibility (HV) algorithm is used on trajectories generated by nonlinear circle maps at the quasiperiodic transition to chaos. The resultant HV graph is highly anomalous as the degrees fluctuate at all scales with amplitude that increases with the size of the network. We determine families of Pesin-like identities between entropy growth rates and generalized graph-theoretical Lyapunov exponents. An irrational winding number with pure periodic continued fraction characterizes each family. We illustrate our results for the so-called golden, silver, and bronze numbers.
Graph-state basis for Pauli channels
Chen Xiaoyu; Jiang Lizhen
2011-05-15
Quantum capacities of Pauli channels are not additive, a degenerate quantum code may improve the hashing bound of the capacity. The difficulty in approaching the capacity is how to calculate the coherent information of a generic degenerate quantum code. Using graph state basis, we greatly reduce the problem for the input of quantum error-correcting code. We show that for a graph diagonal state passing through a Pauli channel the output state is diagonalizable and the joint output state of the system and ancilla is block diagonalizable. When the input state is an equal probable mixture of codewords of a stabilizer code, the coherent information can be analytically obtained.
Isomorphisms between Petri nets and dataflow graphs
NASA Technical Reports Server (NTRS)
Kavi, Krishna M.; Buckles, Billy P.; Bhat, U. Narayan
1987-01-01
Dataflow graphs are a generalized model of computation. Uninterpreted dataflow graphs with nondeterminism resolved via probabilities are shown to be isomorphic to a class of Petri nets known as free choice nets. Petri net analysis methods are readily available in the literature and this result makes those methods accessible to dataflow research. Nevertheless, combinatorial explosion can render Petri net analysis inoperative. Using a previously known technique for decomposing free choice nets into smaller components, it is demonstrated that, in principle, it is possible to determine aspects of the overall behavior from the particular behavior of components.
An Algorithm for Parsing Flow Graphs
1984-03-01
struut iire of low graph.i and flow ,,griin::,.irs has baen in.fi...eed by .earl work on web yr, ’mfnr., iPfdtz and 1hi,,cnfhti 1069. %Iontran-ari...conventions, that portion of a nod’s linkage - information which involves only input (resp. output) edges is called its left. linkage ( rtsp . right-linkage...never any quiestion as to X ] low a right-hanid side should replace a left-hand side. ror example, figure 2.3 shows the derivation of a graph from the
Graphing techniques for materials laboratory using Excel
NASA Technical Reports Server (NTRS)
Kundu, Nikhil K.
1994-01-01
Engineering technology curricula stress hands on training and laboratory practices in most of the technical courses. Laboratory reports should include analytical as well as graphical evaluation of experimental data. Experience shows that many students neither have the mathematical background nor the expertise for graphing. This paper briefly describes the procedure and data obtained from a number of experiments such as spring rate, stress concentration, endurance limit, and column buckling for a variety of materials. Then with a brief introduction to Microsoft Excel the author explains the techniques used for linear regression and logarithmic graphing.
2015-01-01
We studied the influence of the aromatic sidewalls on the ability of acyclic CB[n]-type molecular containers (1a–1e) to act as solubilizing agents for 19 insoluble drugs including the developmental anticancer agent PBS-1086. All five containers exhibit good water solubility and weak self-association (Ks ≤ 624 M–1). We constructed phase solubility diagrams to extract Krel and Ka values for the container·drug complexes. The acyclic CB[n]-type containers generally display significantly higher Ka values than HP-β-CD toward drugs. Containers 1a–1e bind the steroidal ring system and aromatic moieties of insoluble drugs. Compound 1b displays highest affinity toward most of the drugs studied. Containers 1a and 1b are broadly applicable and can be used to formulate a wider variety of insoluble drugs than was previously possible with cyclodextrin technology. For drugs that are solubilized by both HP-β-CD and 1a–1e, lower concentrations of 1a–1e are required to achieve identical [drug]. PMID:25369565
Decision graphs: a tool for developing real-time software
Kozubal, A.J.
1981-01-01
The use of decision graphs in the preparation of, in particular, real-time software is briefly described. The usefulness of decision graphs in software design, testing, and maintenance is pointed out. 2 figures. (RWR)
On Ramsey (3K2, K3) - minimal graphs
NASA Astrophysics Data System (ADS)
Wijaya, Kristiana; Baskoro, Edy Tri; Assiyatun, Hilda; Suprijanto, Djoko
2016-02-01
The Ramsey graph theory has many interesting applications, such as in the fields of communications, information retrieval, and decision making. One of growing topics in Ramsey theory is Ramsey minimal graph. For any given graphs G and H, find graphs F such that any red-blue coloring of all edges of F contains either a red copy of G or a blue copy of H. If this condition is not satisfied by the graph F - e, then we call the graph F as a Ramsey (G, H) - minimal. In this paper, we derive the properties of (3K2, K3) - minimal graphs. We, then, characterize all Ramsey (3K2, K3) - minimal graphs.
NASA Astrophysics Data System (ADS)
Steelman, Zachary A.; Tolstykh, Gleb P.; Estlack, Larry E.; Roth, Caleb C.; Ibey, Bennett L.
2015-03-01
Phosphatidylinositol4,5-biphosphate (PIP2) is a membrane phospholipid of particular importance in cell-signaling pathways. Hydrolysis of PIP2 releases inositol-1,4,5-triphosphate (IP3) from the membrane, activating IP3 receptors on the smooth endoplasmic reticulum (ER) and facilitating a release of intracellular calcium stores and activation of protein kinase C (PKC). Recent studies suggest that nanosecond pulsed electric fields (nsPEF) cause depletion of PIP2 in the cellular membrane, activating the IP3 signaling pathway. However, the exact mechanism(s) causing this observed depletion of PIP2 are unknown. Complicating the matter, nsPEF create nanopores in the plasma membrane, allowing calcium to enter the cell and thus causing an increase in intracellular calcium. While elevated intracellular calcium can cause activation of phospholipase C (PLC) (a known catalyst of PIP2 hydrolysis), PIP2 depletion has been shown to occur in the absence of both extracellular and intracellular calcium. These observations have led to the hypothesis that the high electric field itself may be playing a direct role in the hydrolysis of PIP2 from the plasma membrane. To support this hypothesis, we used edelfosine to block PLC and prevent activation of the IP3/DAG pathway in Chinese Hamster Ovarian (CHO) cells prior to applying nsPEF. Fluorescence microscopy was used to monitor intracellular calcium bursts during nsPEF, while MTT (3-(4,5-Dimethylthiazol-2-yl)-2,5-diphenyltetrazolium bromide) survivability assays were utilized to determine whether edelfosine improved cell survival during nsPEF exposure. This work is critical to refine the role of PIP2 in the cellular response to nsPEF, and also to determine the fundamental biological effects of high electric field exposures.
Persistent homology in graph power filtrations
Marchette, David J.
2016-01-01
The persistence of homological features in simplicial complex representations of big datasets in Rn resulting from Vietoris–Rips or Čech filtrations is commonly used to probe the topological structure of such datasets. In this paper, the notion of homological persistence in simplicial complexes obtained from power filtrations of graphs is introduced. Specifically, the rth complex, r ≥ 1, in such a power filtration is the clique complex of the rth power Gr of a simple graph G. Because the graph distance in G is the relevant proximity parameter, unlike a Euclidean filtration of a dataset where regional scale differences can be an issue, persistence in power filtrations provides a scale-free insight into the topology of G. It is shown that for a power filtration of G, the girth of G defines an r range over which the homology of the complexes in the filtration are guaranteed to persist in all dimensions. The role of chordal graphs as trivial homology delimiters in power filtrations is also discussed and the related notions of ‘persistent triviality’, ‘transient noise’ and ‘persistent periodicity’ in power filtrations are introduced. PMID:27853540
Horizontal visibility graphs from integer sequences
NASA Astrophysics Data System (ADS)
Lacasa, Lucas
2016-09-01
The horizontal visibility graph (HVG) is a graph-theoretical representation of a time series and builds a bridge between dynamical systems and graph theory. In recent years this representation has been used to describe and theoretically compare different types of dynamics and has been applied to characterize empirical signals, by extracting topological features from the associated HVGs which have shown to be informative on the class of dynamics. Among some other measures, it has been shown that the degree distribution of these graphs is a very informative feature that encapsulates nontrivial information of the series's generative dynamics. In particular, the HVG associated to a bi-infinite real-valued series of independent and identically distributed random variables is a universal exponential law P(k)=(1/3){(2/3)}k-2, independent of the series marginal distribution. Most of the current applications have however only addressed real-valued time series, as no exact results are known for the topological properties of HVGs associated to integer-valued series. In this paper we explore this latter situation and address univariate time series where each variable can only take a finite number n of consecutive integer values. We are able to construct an explicit formula for the parametric degree distribution {P}n(k), which we prove to converge to the continuous case for large n and deviates otherwise. A few applications are then considered.
Communication Graph Generator for Parallel Programs
2014-04-08
Graphator is a collection of relatively simple sequential programs that generate communication graphs/matrices for commonly occurring patterns in parallel programs. Currently, there is support for five communication patterns: two-dimensional 4-point stencil, four-dimensional 8-point stencil, all-to-alls over sub-communicators, random near-neighbor communication, and near-neighbor communication.
Simple scale interpolator facilitates reading of graphs
NASA Technical Reports Server (NTRS)
Fazio, A.; Henry, B.; Hood, D.
1966-01-01
Set of cards with scale divisions and a scale finder permits accurate reading of the coordinates of points on linear or logarithmic graphs plotted on rectangular grids. The set contains 34 different scales for linear plotting and 28 single cycle scales for log plots.
An Ellipse Morphs to a Cosine Graph!
ERIC Educational Resources Information Center
King, L .R.
2013-01-01
We produce a continuum of curves all of the same length, beginning with an ellipse and ending with a cosine graph. The curves in the continuum are made by cutting and unrolling circular cones whose section is the ellipse; the initial cone is degenerate (it is the plane of the ellipse); the final cone is a circular cylinder. The curves of the…
Contextualized trajectory parsing with spatiotemporal graph.
Liu, Xiaobai; Lin, Liang; Jin, Hai
2013-12-01
This work investigates how to automatically parse object trajectories in surveillance videos, which aims at jointly solving three subproblems: 1) spatial segmentation, 2) temporal tracking, and 3) object categorization. We present a novel representation spatiotemporal graph (ST-Graph) in which: 1) Graph nodes express the motion primitives, each representing a short sequence of small-size patches over consecutive images, and 2) every two neighbor nodes are linked with either a positive edge or a negative edge to describe their collaborative or exclusive relationship of belonging to the same object trajectory. Phrasing the trajectory parsing as a graph multicoloring problem, we propose a unified probabilistic formulation to integrate various types of context knowledge as informative priors. An efficient composite cluster sampling algorithm is employed in search of the optimal solution by exploiting both the collaborative and the exclusive relationships between nodes. The proposed framework is evaluated over challenging videos from public datasets, and results show that it can achieve state-of-the-art tracking accuracy.
Quantum secret sharing with qudit graph states
Keet, Adrian; Fortescue, Ben; Sanders, Barry C.; Markham, Damian
2010-12-15
We present a unified formalism for threshold quantum secret sharing using graph states of systems with prime dimension. We construct protocols for three varieties of secret sharing: with classical and quantum secrets shared between parties over both classical and quantum channels.
Graphing Powers and Roots of Complex Numbers.
ERIC Educational Resources Information Center
Embse, Charles Vonder
1993-01-01
Using De Moivre's theorem and a parametric graphing utility, examines powers and roots of complex numbers and allows students to establish connections between the visual and numerical representations of complex numbers. Provides a program to numerically verify the roots of complex numbers. (MDH)
Alignment of Tractograms As Graph Matching.
Olivetti, Emanuele; Sharmin, Nusrat; Avesani, Paolo
2016-01-01
The white matter pathways of the brain can be reconstructed as 3D polylines, called streamlines, through the analysis of diffusion magnetic resonance imaging (dMRI) data. The whole set of streamlines is called tractogram and represents the structural connectome of the brain. In multiple applications, like group-analysis, segmentation, or atlasing, tractograms of different subjects need to be aligned. Typically, this is done with registration methods, that transform the tractograms in order to increase their similarity. In contrast with transformation-based registration methods, in this work we propose the concept of tractogram correspondence, whose aim is to find which streamline of one tractogram corresponds to which streamline in another tractogram, i.e., a map from one tractogram to another. As a further contribution, we propose to use the relational information of each streamline, i.e., its distances from the other streamlines in its own tractogram, as the building block to define the optimal correspondence. We provide an operational procedure to find the optimal correspondence through a combinatorial optimization problem and we discuss its similarity to the graph matching problem. In this work, we propose to represent tractograms as graphs and we adopt a recent inexact sub-graph matching algorithm to approximate the solution of the tractogram correspondence problem. On tractograms generated from the Human Connectome Project dataset, we report experimental evidence that tractogram correspondence, implemented as graph matching, provides much better alignment than affine registration and comparable if not better results than non-linear registration of volumes.
Marking Student Programs Using Graph Similarity
ERIC Educational Resources Information Center
Naude, Kevin A.; Greyling, Jean H.; Vogts, Dieter
2010-01-01
We present a novel approach to the automated marking of student programming assignments. Our technique quantifies the structural similarity between unmarked student submissions and marked solutions, and is the basis by which we assign marks. This is accomplished through an efficient novel graph similarity measure ("AssignSim"). Our experiments…
Community detection by graph Voronoi diagrams
NASA Astrophysics Data System (ADS)
Deritei, Dávid; Lázár, Zsolt I.; Papp, István; Járai-Szabó, Ferenc; Sumi, Róbert; Varga, Levente; Ravasz Regan, Erzsébet; Ercsey-Ravasz, Mária
2014-06-01
Accurate and efficient community detection in networks is a key challenge for complex network theory and its applications. The problem is analogous to cluster analysis in data mining, a field rich in metric space-based methods. Common to these methods is a geometric, distance-based definition of clusters or communities. Here we propose a new geometric approach to graph community detection based on graph Voronoi diagrams. Our method serves as proof of principle that the definition of appropriate distance metrics on graphs can bring a rich set of metric space-based clustering methods to network science. We employ a simple edge metric that reflects the intra- or inter-community character of edges, and a graph density-based rule to identify seed nodes of Voronoi cells. Our algorithm outperforms most network community detection methods applicable to large networks on benchmark as well as real-world networks. In addition to offering a computationally efficient alternative for community detection, our method opens new avenues for adapting a wide range of data mining algorithms to complex networks from the class of centroid- and density-based clustering methods.
Reducing Abstraction When Learning Graph Theory
ERIC Educational Resources Information Center
Hazzan, Orit; Hadar, Irit
2005-01-01
This article presents research on students' understanding of basic concepts in Graph Theory. Students' understanding is analyzed through the lens of the theoretical framework of reducing abstraction (Hazzan, 1999). As it turns out, in spite of the relative simplicity of the concepts that are introduced in the introductory part of a traditional…
Some asymptotic properties of duplication graphs
NASA Astrophysics Data System (ADS)
Raval, Alpan
2003-12-01
Duplication graphs are graphs that grow by duplication of existing vertices, and are important models of biological networks, including protein-protein interaction networks and gene regulatory networks. Three models of graph growth are studied: pure duplication growth, and two two-parameter models in which duplication forms one element of the growth dynamics. A power-law degree distribution is found to emerge in all three models. However, the parameter space of the latter two models is characterized by a range of parameter values for which duplication is the predominant mechanism of graph growth. For parameter values that lie in this “duplication-dominated” regime, it is shown that the degree distribution either approaches zero asymptotically, or approaches a nonzero power-law degree distribution very slowly. In either case, the approach to the true asymptotic degree distribution is characterized by a dependence of the scaling exponent on properties of the initial degree distribution. It is therefore conjectured that duplication-dominated, scale-free networks may contain identifiable remnants of their early structure. This feature is inherited from the idealized model of pure duplication growth, for which the exact finite-size degree distribution is found and its asymptotic properties studied.
Using Dynamic Graphs to Reveal Student Reasoning
ERIC Educational Resources Information Center
Lassak, Marshall
2009-01-01
Using dynamic graphs, future secondary mathematics teachers were able to represent and communicate their understanding of a brief mathematical investigation in a way that a symbolic proof of the problem could not. Four different student work samples are discussed. (Contains 6 figures.)
Figure-Ground Segmentation Using Factor Graphs.
Shen, Huiying; Coughlan, James; Ivanchenko, Volodymyr
2009-06-04
Foreground-background segmentation has recently been applied [26,12] to the detection and segmentation of specific objects or structures of interest from the background as an efficient alternative to techniques such as deformable templates [27]. We introduce a graphical model (i.e. Markov random field)-based formulation of structure-specific figure-ground segmentation based on simple geometric features extracted from an image, such as local configurations of linear features, that are characteristic of the desired figure structure. Our formulation is novel in that it is based on factor graphs, which are graphical models that encode interactions among arbitrary numbers of random variables. The ability of factor graphs to express interactions higher than pairwise order (the highest order encountered in most graphical models used in computer vision) is useful for modeling a variety of pattern recognition problems. In particular, we show how this property makes factor graphs a natural framework for performing grouping and segmentation, and demonstrate that the factor graph framework emerges naturally from a simple maximum entropy model of figure-ground segmentation.We cast our approach in a learning framework, in which the contributions of multiple grouping cues are learned from training data, and apply our framework to the problem of finding printed text in natural scenes. Experimental results are described, including a performance analysis that demonstrates the feasibility of the approach.
A notion of graph likelihood and an infinite monkey theorem
NASA Astrophysics Data System (ADS)
Banerji, Christopher R. S.; Mansour, Toufik; Severini, Simone
2014-01-01
We play with a graph-theoretic analogue of the folklore infinite monkey theorem. We define a notion of graph likelihood as the probability that a given graph is constructed by a monkey in a number of time steps equal to the number of vertices. We present an algorithm to compute this graph invariant and closed formulas for some infinite classes. We have to leave the computational complexity of the likelihood as an open problem.
Range charts and no-space graphs
Edwards, L.E.
1978-01-01
No-space graphs present one solution to the familiar problem: given data on the occurrence of fossil taxa in separate, well-sampled sections, determine a range chart; that is, a reasonable working hypothesis of the total range in the area in question of each taxon studied. The solution presented here treats only the relative sequence of biostratigraphic events (first and last occurrences of taxa) and does not attempt to determine an amount of spacing between events. Relative to a hypothesized sequence, observed events in any section may be in-place or out-of-place. Out-of-place events may indicate (1) the event in question reflects a taxon that did not fill its entire range (unfilled-range event), or (2) the event in question indicates a need for the revision of the hypothesized sequence. A graph of relative position only (no-space graph) can be used to facilitate the recognition of in-place and out-of-place events by presenting a visual comparison of the observations from each section with the hypothesized sequence. The geometry of the graph as constructed here is such that in-place events will lie along a line series and out-of-place events will lie above or below it. First-occurrence events below the line series and last-occurrence events above the line series indicate unfilled ranges. First-occurrence events above the line series and last-occurrence events below the line series indicate a need for the revision of the hypothesis. Knowing this, the stratigrapher considers alternative positionings of the line series as alternative range hypotheses and seeks the line series that best fits his geologic and paleontologic judgment. No-space graphs are used to revise an initial hypothesis until a final hypothesis is reached. In this final hypothesis every event is found in-place in at least one section, and all events in all sections may be interpreted to represent in-place events or unfilled-range events. No event may indicate a need for further range revision. The
GraphPrints: Towards a Graph Analytic Method for Network Anomaly Detection
Harshaw, Chris R; Bridges, Robert A; Iannacone, Michael D; Reed, Joel W; Goodall, John R
2016-01-01
This paper introduces a novel graph-analytic approach for detecting anomalies in network flow data called \\textit{GraphPrints}. Building on foundational network-mining techniques, our method represents time slices of traffic as a graph, then counts graphlets\\textemdash small induced subgraphs that describe local topology. By performing outlier detection on the sequence of graphlet counts, anomalous intervals of traffic are identified, and furthermore, individual IPs experiencing abnormal behavior are singled-out. Initial testing of GraphPrints is performed on real network data with an implanted anomaly. Evaluation shows false positive rates bounded by 2.84\\% at the time-interval level, and 0.05\\% at the IP-level with 100\\% true positive rates at both.
GRASPE 1.5: A Graph Processor and Its Application.
ERIC Educational Resources Information Center
Friedman, Daniel P.; And Others
A set of primitives to allow graph processing on a list processing system is investigated. The object of the investigation is to provide a method of applying intuitive graph solution techniques to graph oriented computer problems. Applications are presented from several disciplines. (Author)
Learning Financial Reports From Mixed Symbolic-Spatial Graphs
ERIC Educational Resources Information Center
Tanlamai, Uthai; Soongswang, Oranuj
2011-01-01
Mixed visuals of numbers and graphs are available in various financial reports that demonstrate the financial status and risks of a firm. GWN (graphs with numbers) and TWG (table of numbers with graphs) were used as two alternative visuals derived from the actual data of two large public companies, one from food manufacturing industry (food) and…
Measuring Graph Comprehension, Critique, and Construction in Science
ERIC Educational Resources Information Center
Lai, Kevin; Cabrera, Julio; Vitale, Jonathan M.; Madhok, Jacquie; Tinker, Robert; Linn, Marcia C.
2016-01-01
Interpreting and creating graphs plays a critical role in scientific practice. The K-12 Next Generation Science Standards call for students to use graphs for scientific modeling, reasoning, and communication. To measure progress on this dimension, we need valid and reliable measures of graph understanding in science. In this research, we designed…
Students' Cognitive Reasoning of Graphs: Characteristics and Progression
ERIC Educational Resources Information Center
Wang, Zu Hao; Wei, Silin; Ding, Wei; Chen, Xiuyun; Wang, Xiaonan; Hu, Kaiyan
2012-01-01
Graphs are widely used to present scientific information. Information presented in graphs can be classified into three kinds: explicit information, tacit information, and conclusive information. Reading information from graphs requires not only science content knowledge and understanding but also general logical reasoning. This study examined the…
Deterministic dense coding and faithful teleportation with multipartite graph states
Huang, C.-Y.; Yu, I-C.; Lin, F.-L.; Hsu, L.-Y.
2009-05-15
We propose schemes to perform the deterministic dense coding and faithful teleportation with multipartite graph states. We also find the sufficient and necessary condition of a viable graph state for the proposed schemes. That is, for the associated graph, the reduced adjacency matrix of the Tanner-type subgraph between senders and receivers should be invertible.
Hands-on Science: Getting-to-Know-You Graphing.
ERIC Educational Resources Information Center
Kepler, Lynne
1992-01-01
Elementary teachers can use graphing to introduce students to one another. An eye color graphing activity helps students learn more about each other while experimenting with different ways of organizing and displaying information. For follow up, students can apply their graphing knowledge by collecting and displaying data from their families. (SM)
Do Graphs Promote Learning in Principles of Economics?
ERIC Educational Resources Information Center
Cohn, Elchanan; Cohn, Sharon; Balch, Donald C.; Bradley, James, Jr.
2001-01-01
Tests the effects on student performance when using graphs as part of a University of South Carolina (Columbia) principles of economics lecture. Finds in 1995 that students in the lecture with graphs had significantly lower gain scores than those in the no-graphs lecture. Finds no significant difference in 1997. (RLH)