Parameterized Verification of Graph Transformation Systems with Whole Neighbourhood Operations
Delzanno, Giorgio; Stückrath, Jan
2014-01-01
We introduce a new class of graph transformation systems in which rewrite rules can be guarded by universally quantified conditions on the neighbourhood of nodes. These conditions are defined via special graph patterns which may be transformed by the rule as well. For the new class for graph rewrite rules, we provide a symbolic procedure working on minimal representations of upward closed sets of configurations. We prove correctness and effectiveness of the procedure by a categorical presenta...
Proving termination of graph transformation systems using weighted type graphs over semirings
Bruggink, H.J.S.; König, B.; Nolte, D.; Zantema, H.; Parisi-Presicce, F.; Westfechtel, B.
2015-01-01
We introduce techniques for proving uniform termination of graph transformation systems, based on matrix interpretations for string rewriting. We generalize this technique by adapting it to graph rewriting instead of string rewriting and by generalizing to ordered semirings. In this way we obtain a
Fundamentals of algebraic graph transformation
Ehrig, Hartmut; Prange, Ulrike; Taentzer, Gabriele
2006-01-01
Graphs are widely used to represent structural information in the form of objects and connections between them. Graph transformation is the rule-based manipulation of graphs, an increasingly important concept in computer science and related fields. This is the first textbook treatment of the algebraic approach to graph transformation, based on algebraic structures and category theory. Part I is an introduction to the classical case of graph and typed graph transformation. In Part II basic and advanced results are first shown for an abstract form of replacement systems, so-called adhesive high-level replacement systems based on category theory, and are then instantiated to several forms of graph and Petri net transformation systems. Part III develops typed attributed graph transformation, a technique of key relevance in the modeling of visual languages and in model transformation. Part IV contains a practical case study on model transformation and a presentation of the AGG (attributed graph grammar) tool envir...
Graph Creation, Visualisation and Transformation
Directory of Open Access Journals (Sweden)
Maribel Fernández
2010-03-01
Full Text Available We describe a tool to create, edit, visualise and compute with interaction nets - a form of graph rewriting systems. The editor, called GraphPaper, allows users to create and edit graphs and their transformation rules using an intuitive user interface. The editor uses the functionalities of the TULIP system, which gives us access to a wealth of visualisation algorithms. Interaction nets are not only a formalism for the specification of graphs, but also a rewrite-based computation model. We discuss graph rewriting strategies and a language to express them in order to perform strategic interaction net rewriting.
de Mol, M.J.; Rensink, Arend; Hunt, James J.
This paper introduces an approach for adding graph transformation-based functionality to existing JAVA programs. The approach relies on a set of annotations to identify the intended graph structure, as well as on user methods to manipulate that structure, within the user’s own JAVA class
Graph transformation tool contest 2008
Rensink, Arend; van Gorp, Pieter
This special section is the outcome of the graph transformation tool contest organised during the Graph-Based Tools (GraBaTs) 2008 workshop, which took place as a satellite event of the International Conference on Graph Transformation (ICGT) 2008. The contest involved two parts: three “off-line case
Chemical Graph Transformation with Stereo-Information
DEFF Research Database (Denmark)
Andersen, Jakob Lykke; Flamm, Christoph; Merkle, Daniel
2017-01-01
Double Pushout graph transformation naturally facilitates the modelling of chemical reactions: labelled undirected graphs model molecules and direct derivations model chemical reactions. However, the most straightforward modelling approach ignores the relative placement of atoms and their neighbo......Double Pushout graph transformation naturally facilitates the modelling of chemical reactions: labelled undirected graphs model molecules and direct derivations model chemical reactions. However, the most straightforward modelling approach ignores the relative placement of atoms...... and their neighbours in space. Stereoisomers of chemical compounds thus cannot be distinguished, even though their chemical activity may differ substantially. In this contribution we propose an extended chemical graph transformation system with attributes that encode information about local geometry. The modelling...... of graph transformation, but we here propose a framework that also allows for partially specified stereoinformation. While there are several stereochemical configurations to be considered, we focus here on the tetrahedral molecular shape, and suggest general principles for how to treat all other chemically...
Graph Transformation Semantics for a QVT Language
Rensink, Arend; Nederpel, Ronald; Bruni, Roberto; Varró, Dániel
It has been claimed by many in the graph transformation community that model transformation, as understood in the context of Model Driven Architecture, can be seen as an application of graph transformation. In this paper we substantiate this claim by giving a graph transformation-based semantics to
Handbook of graph grammars and computing by graph transformation
Engels, G; Kreowski, H J; Rozenberg, G
1999-01-01
Graph grammars originated in the late 60s, motivated by considerations about pattern recognition and compiler construction. Since then, the list of areas which have interacted with the development of graph grammars has grown quite impressively. Besides the aforementioned areas, it includes software specification and development, VLSI layout schemes, database design, modeling of concurrent systems, massively parallel computer architectures, logic programming, computer animation, developmental biology, music composition, visual languages, and many others.The area of graph grammars and graph tran
Directory of Open Access Journals (Sweden)
Aleks Kissinger
2014-03-01
Full Text Available String diagrams are a powerful tool for reasoning about physical processes, logic circuits, tensor networks, and many other compositional structures. Dixon, Duncan and Kissinger introduced string graphs, which are a combinatoric representations of string diagrams, amenable to automated reasoning about diagrammatic theories via graph rewrite systems. In this extended abstract, we show how the power of such rewrite systems can be greatly extended by introducing pattern graphs, which provide a means of expressing infinite families of rewrite rules where certain marked subgraphs, called !-boxes ("bang boxes", on both sides of a rule can be copied any number of times or removed. After reviewing the string graph formalism, we show how string graphs can be extended to pattern graphs and how pattern graphs and pattern rewrite rules can be instantiated to concrete string graphs and rewrite rules. We then provide examples demonstrating the expressive power of pattern graphs and how they can be applied to study interacting algebraic structures that are central to categorical quantum mechanics.
Graph Transformation for Consolidation of Creativity Sessions Results
DEFF Research Database (Denmark)
Dolog, Peter
2010-01-01
Graph transformation approach for consolidation of creativity sessions results is part of the FP7 EU/IST project idSpace: Tooling of and training for collaborative, distributed product innovation. The goal of graph transformation approach is to provide a tool for merging results of various sessions...... (such as brainstorming sessions), which are represented as graphs, when the session participants- are physically distributed....
Improved Conflict Detection for Graph Transformation with Attributes
Directory of Open Access Journals (Sweden)
Géza Kulcsár
2015-04-01
Full Text Available In graph transformation, a conflict describes a situation where two alternative transformations cannot be arbitrarily serialized. When enriching graphs with attributes, existing conflict detection techniques typically report a conflict whenever at least one of two transformations manipulates a shared attribute. In this paper, we propose an improved, less conservative condition for static conflict detection of graph transformation with attributes by explicitly taking the semantics of the attribute operations into account. The proposed technique is based on symbolic graphs, which extend the traditional notion of graphs by logic formulas used for attribute handling. The approach is proven complete, i.e., any potential conflict is guaranteed to be detected.
Engineering Object-Oriented Semantics Using Graph Transformations
Kastenberg, H.; Kleppe, A.G.; Rensink, Arend
In this paper we describe the application of the theory of graph transformations to the practise of language design. We have defined the semantics of a small but realistic object-oriented language (called TAAL) by mapping the language constructs to graphs and their operational semantics to graph
Transformation of UML models to CSP : a case study for graph transformation tools
Varró, D.; Asztalos, M.; Bisztray, D.; Boronat, A.; Dang, D.; Geiß, R.; Greenyer, J.; Van Gorp, P.M.E.; Kniemeyer, O.; Narayanan, A.; Rencis, E.; Weinell, E.; Schürr, A.; Nagl, M.; Zündorf, A.
2008-01-01
Graph transformation provides an intuitive mechanism for capturing model transformations. In the current paper, we investigate and compare various graph transformation tools using a compact practical model transformation case study carried out as part of the AGTIVE 2007 Tool Contest [22]. The aim of
Directory of Open Access Journals (Sweden)
Sarunya Kanjanawattana
2017-07-01
Full Text Available Image classification plays a vital role in many areas of study, such as data mining and image processing; however, serious problems collectively referred to as the course of dimensionality have been encountered in previous studies as factors that reduce system performance. Furthermore, we also confront the problem of different graph characteristics even if graphs belong to same types. In this study, we propose a novel method of graph-type classification. Using our approach, we open up a new solution of high-dimensional images and address problems of different characteristics by converting graph images to one dimension with a discrete Fourier transformation and creating numeric datasets using wavelet and Hough transformations. Moreover, we introduce a new classifier, which is a combination between artificial neuron networks (ANNs and support vector machines (SVMs, which we call ANNSVM, to enhance accuracy. The objectives of our study are to propose an effective graph-type classification method that includes finding a new data representative used for classification instead of two-dimensional images and to investigate what features make our data separable. To evaluate the method of our study, we conducted five experiments with different methods and datasets. The input dataset we focused on was a numeric dataset containing wavelet coefficients and outputs of a Hough transformation. From our experimental results, we observed that the highest accuracy was provided using our method with Coiflet 1, which achieved a 0.91 accuracy.
Port-Hamiltonian Systems on Open Graphs
Schaft, A.J. van der; Maschke, B.M.
2010-01-01
In this talk we discuss how to define in an intrinsic manner port-Hamiltonian dynamics on open graphs. Open graphs are graphs where some of the vertices are boundary vertices (terminals), which allow interconnection with other systems. We show that a directed graph carries two natural Dirac
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.
Interacting particle systems on graphs
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
Bond graph modeling of centrifugal compression systems
Uddin, Nur; Gravdahl, Jan Tommy
2015-01-01
A novel approach to model unsteady fluid dynamics in a compressor network by using a bond graph is presented. The model is intended in particular for compressor control system development. First, we develop a bond graph model of a single compression system. Bond graph modeling offers a different perspective to previous work by modeling the compression system based on energy flow instead of fluid dynamics. Analyzing the bond graph model explains the energy flow during compressor surge. Two pri...
DEFF Research Database (Denmark)
Greenyer, Joel; Kindler, Ekkart
2010-01-01
and for model-based software engineering approaches in general. QVT (Query/View/Transformation) is the transformation technology recently proposed for this purpose by the OMG. TGGs (Triple Graph Grammars) are another transformation technology proposed in the mid-nineties, used for example in the FUJABA CASE...
System dynamics and control with bond graph modeling
Kypuros, Javier
2013-01-01
Part I Dynamic System ModelingIntroduction to System DynamicsIntroductionSystem Decomposition and Model ComplexityMathematical Modeling of Dynamic SystemsAnalysis and Design of Dynamic SystemsControl of Dynamic SystemsDiagrams of Dynamic SystemsA Graph-Centered Approach to ModelingSummaryPracticeExercisesBasic Bond Graph ElementsIntroductionPower and Energy VariablesBasic 1-Port ElementsBasic 2-Ports ElementsJunction ElementsSimple Bond Graph ExamplesSummaryPracticeExercisesBond Graph Synthesis and Equation DerivationIntroductionGeneral GuidelinesMechanical TranslationMechanical RotationElectrical CircuitsHydraulic CircuitsMixed SystemsState Equation DerivationState-Space RepresentationsAlgebraic Loops and Derivative CausalitySummaryPracticeExercisesImpedance Bond GraphsIntroductionLaplace Transform of the State-Space EquationBasic 1-Port ImpedancesImpedance Bond Graph SynthesisJunctions, Transformers, and GyratorsEffort and Flow DividersSign ChangesTransfer Function DerivationAlternative Derivation of Transf...
Rose, L.M.; Herrmannsdoerfer, M.; Mazanek, S.; Van Gorp, P.M.E.; Buchwald, S.; Horn, T.; Kalnina, E.; Koch, A.; Lano, K.; Schätz, B.; Wimmer, M.
2014-01-01
We describe the results of the Transformation Tool Contest 2010 workshop, in which nine graph and model transformation tools were compared for specifying model migration. The model migration problem—migration of UML activity diagrams from version 1.4 to version 2.2—is non-trivial and practically
Mapping Between Semantic Graphs and Sentences in Grammar Induction System
Directory of Open Access Journals (Sweden)
Laszlo Kovacs
2010-06-01
Full Text Available The proposed transformation module performs mapping be-
tween two di®erent knowledge representation forms used in grammar induction systems. The kernel knowledge representation form is a special predicate centered conceptual graph called ECG. The ECG provides a semantic-based, language independent description of the environment. The other base representation form is some kind of language. The sentences of the language should meet the corresponding grammatical rules. The pilot project demonstrates the functionality of a translator module using this transformation engine between the ECG graph and the Hungarian language.
Clone Detection for Graph-Based Model Transformation Languages
DEFF Research Database (Denmark)
Strüber, Daniel; Plöger, Jennifer; Acretoaie, Vlad
2016-01-01
and analytical quality assurance. From these use cases, we derive a set of key requirements. We describe our customization of existing model clone detection techniques allowing us to address these requirements. Finally, we provide an experimental evaluation, indicating that our customization of ConQAT, one......Cloning is a convenient mechanism to enable reuse across and within software artifacts. On the downside, it is also a practice related to significant long-term maintainability impediments, thus generating a need to identify clones in affected artifacts. A large variety of clone detection techniques...... has been proposed for programming and modeling languages; yet no specific ones have emerged for model transformation languages. In this paper, we explore clone detection for graph-based model transformation languages. We introduce potential use cases for such techniques in the context of constructive...
Use of Attack Graphs in Security Systems
Directory of Open Access Journals (Sweden)
Vivek Shandilya
2014-01-01
Full Text Available Attack graphs have been used to model the vulnerabilities of the systems and their potential exploits. The successful exploits leading to the partial/total failure of the systems are subject of keen security interest. Considerable effort has been expended in exhaustive modeling, analyses, detection, and mitigation of attacks. One prominent methodology involves constructing attack graphs of the pertinent system for analysis and response strategies. This not only gives the simplified representation of the system, but also allows prioritizing the security properties whose violations are of greater concern, for both detection and repair. We present a survey and critical study of state-of-the-art technologies in attack graph generation and use in security system. Based on our research, we identify the potential, challenges, and direction of the current research in using attack graphs.
Herdable Systems Over Signed, Directed Graphs
Ruf, Sebastian F.
2018-04-11
This paper considers the notion of herdability, a set-based reachability condition, which asks whether the state of a system can be controlled to be element-wise larger than a non-negative threshold. The basic theory of herdable systems is presented, including a necessary and sufficient condition for herdability. This paper then considers the impact of the underlying graph structure of a linear system on the herdability of the system, for the case where the graph is represented as signed and directed. By classifying nodes based on the length and sign of walks from an input, we find a class of completely herdable systems as well as provide a complete characterization of nodes that can be herded in systems with an underlying graph that is a directed out-branching rooted at a single input.
Herdable Systems Over Signed, Directed Graphs
Ruf, Sebastian F.; Egerstedt, Magnus; Shamma, Jeff S.
2018-01-01
This paper considers the notion of herdability, a set-based reachability condition, which asks whether the state of a system can be controlled to be element-wise larger than a non-negative threshold. The basic theory of herdable systems is presented, including a necessary and sufficient condition for herdability. This paper then considers the impact of the underlying graph structure of a linear system on the herdability of the system, for the case where the graph is represented as signed and directed. By classifying nodes based on the length and sign of walks from an input, we find a class of completely herdable systems as well as provide a complete characterization of nodes that can be herded in systems with an underlying graph that is a directed out-branching rooted at a single input.
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.
Optimizing graph algorithms on pregel-like systems
Salihoglu, Semih; Widom, Jennifer
2014-01-01
We study the problem of implementing graph algorithms efficiently on Pregel-like systems, which can be surprisingly challenging. Standard graph algorithms in this setting can incur unnecessary inefficiencies such as slow convergence or high
Transformation Strategies between Block-Oriented and Graph-Oriented Process Modelling Languages
DEFF Research Database (Denmark)
Mendling, Jan; Lassen, Kristian Bisgaard; Zdun, Uwe
2006-01-01
Much recent research work discusses the transformation between different process modelling languages. This work, however, is mainly focussed on specific process modelling languages, and thus the general reusability of the applied transformation concepts is rather limited. In this paper, we aim...... to abstract from concrete transformation strategies by distinguishing two major paradigms for representing control flow in process modelling languages: block-oriented languages (such as BPEL and BPML) and graph-oriented languages (such as EPCs and YAWL). The contribution of this paper are generic strategies...... for transforming from block-oriented process languages to graph-oriented languages, and vice versa....
A CLASSIFIER SYSTEM USING SMOOTH GRAPH COLORING
Directory of Open Access Journals (Sweden)
JORGE FLORES CRUZ
2017-01-01
Full Text Available Unsupervised classifiers allow clustering methods with less or no human intervention. Therefore it is desirable to group the set of items with less data processing. This paper proposes an unsupervised classifier system using the model of soft graph coloring. This method was tested with some classic instances in the literature and the results obtained were compared with classifications made with human intervention, yielding as good or better results than supervised classifiers, sometimes providing alternative classifications that considers additional information that humans did not considered.
ARTICLE Robust Diagnosis of Mechatronics System by Bond Graph Approach
Directory of Open Access Journals (Sweden)
Abderrahmene Sellami
2018-03-01
Full Text Available This article presents design of a robust diagnostic system based on bond graph model for a mechatronic system. Mechatronics is the synergistic and systemic combination of mechanics, electronics and computer science. The design of a mechatronic system modeled by the bond graph model becomes easier and more generous. The bond graph tool is a unified graphical language for all areas of engineering sciences and confirmed as a structured approach to modeling and simulation of multidisciplinary systems.
A Modal-Logic Based Graph Abstraction
Bauer, J.; Boneva, I.B.; Kurban, M.E.; Rensink, Arend; Ehrig, H; Heckel, R.; Rozenberg, G.; Taentzer, G.
2008-01-01
Infinite or very large state spaces often prohibit the successful verification of graph transformation systems. Abstract graph transformation is an approach that tackles this problem by abstracting graphs to abstract graphs of bounded size and by lifting application of productions to abstract
Complexity Analysis of Precedence Terminating Infinite Graph Rewrite Systems
Directory of Open Access Journals (Sweden)
Naohi Eguchi
2015-05-01
Full Text Available The general form of safe recursion (or ramified recurrence can be expressed by an infinite graph rewrite system including unfolding graph rewrite rules introduced by Dal Lago, Martini and Zorzi, in which the size of every normal form by innermost rewriting is polynomially bounded. Every unfolding graph rewrite rule is precedence terminating in the sense of Middeldorp, Ohsaki and Zantema. Although precedence terminating infinite rewrite systems cover all the primitive recursive functions, in this paper we consider graph rewrite systems precedence terminating with argument separation, which form a subclass of precedence terminating graph rewrite systems. We show that for any precedence terminating infinite graph rewrite system G with a specific argument separation, both the runtime complexity of G and the size of every normal form in G can be polynomially bounded. As a corollary, we obtain an alternative proof of the original result by Dal Lago et al.
Army Maintenance System Transformation
National Research Council Canada - National Science Library
Gilbertson, Frank V
2006-01-01
.... Used in conjunction with pertinent historical data and developed with Army transformation goals in mind, General Systems thinking can provide the framework for guiding maintenance transformation...
Transformation Strategies between Block-Oriented and Graph-Oriented Process Modelling Languages
DEFF Research Database (Denmark)
Mendling, Jan; Lassen, Kristian Bisgaard; Zdun, Uwe
to abstract from concrete transformationstrategies by distinguishing two major paradigms for process modelling languages:block-oriented languages (such as BPEL and BPML) and graph-oriented languages(such as EPCs and YAWL). The contribution of this paper are generic strategiesfor transforming from block......Much recent research work discusses the transformation between differentprocess modelling languages. This work, however, is mainly focussed on specific processmodelling languages, and thus the general reusability of the applied transformationconcepts is rather limited. In this paper, we aim......-oriented process languages to graph-oriented languages,and vice versa. We also present two case studies of applying our strategies....
Dynamical systems and algebra associated with seperated graphs
DEFF Research Database (Denmark)
Lolk, Matias
In this thesis, we study partial dynamical systems and graph algebras arising from nitely separated graphs. The thesis consists of an introduction followed by three papers, the rst of which is joint work with Pere Ara. In Article [A], we introduce convex subshifts, an abstract generalisation...... of the partial dynamical systems associated with nite separated graphs. We dene notions of a nite and innite type convex subshift and show that all such dynamical systems arise from a nite bipartite separated graph up to a suitable type of equivalence. We then study various aspects of the ideal structure...
Optimizing graph algorithms on pregel-like systems
Salihoglu, Semih
2014-03-01
We study the problem of implementing graph algorithms efficiently on Pregel-like systems, which can be surprisingly challenging. Standard graph algorithms in this setting can incur unnecessary inefficiencies such as slow convergence or high communication or computation cost, typically due to structural properties of the input graphs such as large diameters or skew in component sizes. We describe several optimization techniques to address these inefficiencies. Our most general technique is based on the idea of performing some serial computation on a tiny fraction of the input graph, complementing Pregel\\'s vertex-centric parallelism. We base our study on thorough implementations of several fundamental graph algorithms, some of which have, to the best of our knowledge, not been implemented on Pregel-like systems before. The algorithms and optimizations we describe are fully implemented in our open-source Pregel implementation. We present detailed experiments showing that our optimization techniques improve runtime significantly on a variety of very large graph datasets.
Hermann, Frank; Ehrig, Hartmut; Orejas, Fernando; Ulrike, Golas
2010-01-01
Triple Graph Grammars (TGGs) are a well-established concept for the specification of model transformations. In previous work we have formalized and analyzed already crucial properties of model transformations like termination, correctness and completeness, but functional behaviour - especially local confluence - is missing up to now. In order to close this gap we generate forward translation rules, which extend standard forward rules by translation attributes keeping track of the elements whi...
Hierarchical graphs for rule-based modeling of biochemical systems
Directory of Open Access Journals (Sweden)
Hu Bin
2011-02-01
Full Text Available Abstract Background In rule-based modeling, graphs are used to represent molecules: a colored vertex represents a component of a molecule, a vertex attribute represents the internal state of a component, and an edge represents a bond between components. Components of a molecule share the same color. Furthermore, graph-rewriting rules are used to represent molecular interactions. A rule that specifies addition (removal of an edge represents a class of association (dissociation reactions, and a rule that specifies a change of a vertex attribute represents a class of reactions that affect the internal state of a molecular component. A set of rules comprises an executable model that can be used to determine, through various means, the system-level dynamics of molecular interactions in a biochemical system. Results For purposes of model annotation, we propose the use of hierarchical graphs to represent structural relationships among components and subcomponents of molecules. We illustrate how hierarchical graphs can be used to naturally document the structural organization of the functional components and subcomponents of two proteins: the protein tyrosine kinase Lck and the T cell receptor (TCR complex. We also show that computational methods developed for regular graphs can be applied to hierarchical graphs. In particular, we describe a generalization of Nauty, a graph isomorphism and canonical labeling algorithm. The generalized version of the Nauty procedure, which we call HNauty, can be used to assign canonical labels to hierarchical graphs or more generally to graphs with multiple edge types. The difference between the Nauty and HNauty procedures is minor, but for completeness, we provide an explanation of the entire HNauty algorithm. Conclusions Hierarchical graphs provide more intuitive formal representations of proteins and other structured molecules with multiple functional components than do the regular graphs of current languages for
Automatic Generation of Supervisory Control System Software Using Graph Composition
Nakata, Hideo; Sano, Tatsuro; Kojima, Taizo; Seo, Kazuo; Uchida, Tomoyuki; Nakamura, Yasuaki
This paper describes the automatic generation of system descriptions for SCADA (Supervisory Control And Data Acquisition) systems. The proposed method produces various types of data and programs for SCADA systems from equipment definitions using conversion rules. At first, this method makes directed graphs, which represent connections between the equipment, from equipment definitions. System descriptions are generated using the conversion rules, by analyzing these directed graphs, and finding the groups of equipment that involve similar operations. This method can make the conversion rules multi levels by using the composition of graphs, and can reduce the number of rules. The developer can define and manage these rules efficiently.
Bond graph model-based fault diagnosis of hybrid systems
Borutzky, Wolfgang
2015-01-01
This book presents a bond graph model-based approach to fault diagnosis in mechatronic systems appropriately represented by a hybrid model. The book begins by giving a survey of the fundamentals of fault diagnosis and failure prognosis, then recalls state-of-art developments referring to latest publications, and goes on to discuss various bond graph representations of hybrid system models, equations formulation for switched systems, and simulation of their dynamic behavior. The structured text: • focuses on bond graph model-based fault detection and isolation in hybrid systems; • addresses isolation of multiple parametric faults in hybrid systems; • considers system mode identification; • provides a number of elaborated case studies that consider fault scenarios for switched power electronic systems commonly used in a variety of applications; and • indicates that bond graph modelling can also be used for failure prognosis. In order to facilitate the understanding of fault diagnosis and the presented...
GraphStore: A Distributed Graph Storage System for Big Data Networks
Martha, VenkataSwamy
2013-01-01
Networks, such as social networks, are a universal solution for modeling complex problems in real time, especially in the Big Data community. While previous studies have attempted to enhance network processing algorithms, none have paved a path for the development of a persistent storage system. The proposed solution, GraphStore, provides an…
Modelling and analysis of distributed simulation protocols with distributed graph transformation
Lara, Juan de; Taentzer, Gabriele
2005-01-01
Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. J. de Lara, and G. Taentzer, "Modelling and analysis of distributed simulation protocols with distributed graph transformation...
Bond Graph Modeling and Simulation of Mechatronic Systems
DEFF Research Database (Denmark)
Habib, Tufail; Nielsen, Kjeld; Jørgensen, Kaj Asbjørn
2012-01-01
One of the demanding steps in the design and development of Mechatronic systems is to develop the initial model to visualize the response of a system. The Bond Graph (BG) method is a graphical approach for the design of multidomain systems. That is ideal for visualizing the essential characterist......One of the demanding steps in the design and development of Mechatronic systems is to develop the initial model to visualize the response of a system. The Bond Graph (BG) method is a graphical approach for the design of multidomain systems. That is ideal for visualizing the essential...
Fingerprint recognition system by use of graph matching
Shen, Wei; Shen, Jun; Zheng, Huicheng
2001-09-01
Fingerprint recognition is an important subject in biometrics to identify or verify persons by physiological characteristics, and has found wide applications in different domains. In the present paper, we present a finger recognition system that combines singular points and structures. The principal steps of processing in our system are: preprocessing and ridge segmentation, singular point extraction and selection, graph representation, and finger recognition by graphs matching. Our fingerprint recognition system is implemented and tested for many fingerprint images and the experimental result are satisfactory. Different techniques are used in our system, such as fast calculation of orientation field, local fuzzy dynamical thresholding, algebraic analysis of connections and fingerprints representation and matching by graphs. Wed find that for fingerprint database that is not very large, the recognition rate is very high even without using a prior coarse category classification. This system works well for both one-to-few and one-to-many problems.
PathSys: integrating molecular interaction graphs for systems biology
Directory of Open Access Journals (Sweden)
Raval Alpan
2006-02-01
Full Text Available Abstract Background The goal of information integration in systems biology is to combine information from a number of databases and data sets, which are obtained from both high and low throughput experiments, under one data management scheme such that the cumulative information provides greater biological insight than is possible with individual information sources considered separately. Results Here we present PathSys, a graph-based system for creating a combined database of networks of interaction for generating integrated view of biological mechanisms. We used PathSys to integrate over 14 curated and publicly contributed data sources for the budding yeast (S. cerevisiae and Gene Ontology. A number of exploratory questions were formulated as a combination of relational and graph-based queries to the integrated database. Thus, PathSys is a general-purpose, scalable, graph-data warehouse of biological information, complete with a graph manipulation and a query language, a storage mechanism and a generic data-importing mechanism through schema-mapping. Conclusion Results from several test studies demonstrate the effectiveness of the approach in retrieving biologically interesting relations between genes and proteins, the networks connecting them, and of the utility of PathSys as a scalable graph-based warehouse for interaction-network integration and a hypothesis generator system. The PathSys's client software, named BiologicalNetworks, developed for navigation and analyses of molecular networks, is available as a Java Web Start application at http://brak.sdsc.edu/pub/BiologicalNetworks.
Graph topology and gap topology for unstable systems
Zhu, S.Q.
1989-01-01
A reformation is provided of the graph topology and the gap topology for a general setting (including lumped linear time-invariant systems and distributed linear time-invariant systems) in the frequency domain. Some essential properties and their comparisons are clearly presented in the
Böhm Reduction in Infinitary Term Graph Rewriting Systems
DEFF Research Database (Denmark)
Bahr, Patrick
2017-01-01
a corresponding theory of Böhm reduction for term graphs. Our main result is that partial order convergence in a term graph rewriting system can be truthfully and faithfully simulated by metric convergence in the Böhm extension of the system. To prove this result we generalise the notion of residuals...... that `meaningless terms' can be contracted to a fresh constant ⊥. In previous work, we have established that Böhm reduction can be instead characterised by a different mode of convergences of transfinite reductions that is based on a partial order structure instead of a metric space. In this paper, we develop...... and projections to the setting of infinitary term graph rewriting. As ancillary results we prove the infinitary strip lemma and the compression property, both for partial order and metric convergence....
Graph-related optimization and decision support systems
Krichen, Saoussen
2014-01-01
Constrained optimization is a challenging branch of operations research that aims to create a model which has a wide range of applications in the supply chain, telecommunications and medical fields. As the problem structure is split into two main components, the objective is to accomplish the feasible set framed by the system constraints. The aim of this book is expose optimization problems that can be expressed as graphs, by detailing, for each studied problem, the set of nodes and the set of edges. This graph modeling is an incentive for designing a platform that integrates all optimizatio
Bond graphs : an integrating tool for design of mechatronic systems
International Nuclear Information System (INIS)
Ould Bouamama, B.
2011-01-01
Bond graph is a powerful tool well known for dynamic modelling of multi physical systems: This is the only modelling technique to generate automatically state space or non-linear models using dedicated software tools (CAMP-G, 20-Sim, Symbols, Dymola...). Recently several fundamental theories have been developed for using a bond graph model not only for modeling but also as a real integrated tool from conceptual ideas to optimal practical realization of mechatronic system. This keynote presents a synthesis of those new theories which exploit some particular properties (such as causal, structural and behavioral) of this graphical methodology. Based on a pedagogical example, it will be shown how from a physical system (not a transfer function or state equation) and using only one representation (Bond graph), the following results can be performed: modeling (formal state equations generation), Control analysis (observability, controllability, Structural I/O decouplability, dynamic decoupling,...) diagnosis analysis (automatic generation of robust fault indicators, sensor placement, structural diagnosability) and finally sizing of actuators. The presentation will be illustrated by real industrial applications. Limits and perspectives of bond graph theory conclude the keynote.
Engineering system dynamics a unified graph-centered approach
Brown, Forbes T
2006-01-01
For today's students, learning to model the dynamics of complex systems is increasingly important across nearly all engineering disciplines. First published in 2001, Forbes T. Brown's Engineering System Dynamics: A Unified Graph-Centered Approach introduced students to a unique and highly successful approach to modeling system dynamics using bond graphs. Updated with nearly one-third new material, this second edition expands this approach to an even broader range of topics. What's New in the Second Edition? In addition to new material, this edition was restructured to build students' competence in traditional linear mathematical methods before they have gone too far into the modeling that still plays a pivotal role. New topics include magnetic circuits and motors including simulation with magnetic hysteresis; extensive new material on the modeling, analysis, and simulation of distributed-parameter systems; kinetic energy in thermodynamic systems; and Lagrangian and Hamiltonian methods. MATLAB(R) figures promi...
Systems information management: graph theoretical approach
Temel, T.
2006-01-01
This study proposes a new method for characterising the underlying information structure of a multi-sector system. A complete characterisation is accomplished by identifying information gaps and cause-effect information pathways in the system, and formulating critical testable hypotheses.
Identifying Vulnerabilities and Hardening Attack Graphs for Networked Systems
Energy Technology Data Exchange (ETDEWEB)
Saha, Sudip; Vullinati, Anil K.; Halappanavar, Mahantesh; Chatterjee, Samrat
2016-09-15
We investigate efficient security control methods for protecting against vulnerabilities in networked systems. A large number of interdependent vulnerabilities typically exist in the computing nodes of a cyber-system; as vulnerabilities get exploited, starting from low level ones, they open up the doors to more critical vulnerabilities. These cannot be understood just by a topological analysis of the network, and we use the attack graph abstraction of Dewri et al. to study these problems. In contrast to earlier approaches based on heuristics and evolutionary algorithms, we study rigorous methods for quantifying the inherent vulnerability and hardening cost for the system. We develop algorithms with provable approximation guarantees, and evaluate them for real and synthetic attack graphs.
An Expert System toward Buiding An Earth Science Knowledge Graph
Zhang, J.; Duan, X.; Ramachandran, R.; Lee, T. J.; Bao, Q.; Gatlin, P. N.; Maskey, M.
2017-12-01
In this ongoing work, we aim to build foundations of Cognitive Computing for Earth Science research. The goal of our project is to develop an end-to-end automated methodology for incrementally constructing Knowledge Graphs for Earth Science (KG4ES). These knowledge graphs can then serve as the foundational components for building cognitive systems in Earth science, enabling researchers to uncover new patterns and hypotheses that are virtually impossible to identify today. In addition, this research focuses on developing mining algorithms needed to exploit these constructed knowledge graphs. As such, these graphs will free knowledge from publications that are generated in a very linear, deterministic manner, and structure knowledge in a way that users can both interact and connect with relevant pieces of information. Our major contributions are two-fold. First, we have developed an end-to-end methodology for constructing Knowledge Graphs for Earth Science (KG4ES) using existing corpus of journal papers and reports. One of the key challenges in any machine learning, especially deep learning applications, is the need for robust and large training datasets. We have developed techniques capable of automatically retraining models and incrementally building and updating KG4ES, based on ever evolving training data. We also adopt the evaluation instrument based on common research methodologies used in Earth science research, especially in Atmospheric Science. Second, we have developed an algorithm to infer new knowledge that can exploit the constructed KG4ES. In more detail, we have developed a network prediction algorithm aiming to explore and predict possible new connections in the KG4ES and aid in new knowledge discovery.
The web graph of a tourism system
Baggio, Rodolfo
2007-06-01
The website network of a tourism destination is examined. Network theoretic metrics are used to gauge the static and dynamic characteristics of the webspace. The topology of the network is found partly similar to the one exhibited by similar systems. However, some differences are found, mainly due to the relatively poor connectivity and clusterisation of the network. These results are interpreted by considering the formation mechanisms and the connotation of the linkages between websites. Clustering and assortativity coefficients are proposed as quantitative estimations of the degree of collaboration and cooperation among destination stakeholders.
Fourier Transform Spectrometer System
Campbell, Joel F. (Inventor)
2014-01-01
A Fourier transform spectrometer (FTS) data acquisition system includes an FTS spectrometer that receives a spectral signal and a laser signal. The system further includes a wideband detector, which is in communication with the FTS spectrometer and receives the spectral signal and laser signal from the FTS spectrometer. The wideband detector produces a composite signal comprising the laser signal and the spectral signal. The system further comprises a converter in communication with the wideband detector to receive and digitize the composite signal. The system further includes a signal processing unit that receives the composite signal from the converter. The signal processing unit further filters the laser signal and the spectral signal from the composite signal and demodulates the laser signal, to produce velocity corrected spectral data.
Graph Transformation and Designing Parallel Sparse Matrix Algorithms beyond Data Dependence Analysis
Directory of Open Access Journals (Sweden)
H.X. Lin
2004-01-01
Full Text Available Algorithms are often parallelized based on data dependence analysis manually or by means of parallel compilers. Some vector/matrix computations such as the matrix-vector products with simple data dependence structures (data parallelism can be easily parallelized. For problems with more complicated data dependence structures, parallelization is less straightforward. The data dependence graph is a powerful means for designing and analyzing parallel algorithms. However, for sparse matrix computations, parallelization based on solely exploiting the existing parallelism in an algorithm does not always give satisfactory results. For example, the conventional Gaussian elimination algorithm for the solution of a tri-diagonal system is inherently sequential, so algorithms specially for parallel computation has to be designed. After briefly reviewing different parallelization approaches, a powerful graph formalism for designing parallel algorithms is introduced. This formalism will be discussed using a tri-diagonal system as an example. Its application to general matrix computations is also discussed. Its power in designing parallel algorithms beyond the ability of data dependence analysis is shown by means of a new algorithm called ACER (Alternating Cyclic Elimination and Reduction algorithm.
A Hybrid Approach to Processing Big Data Graphs on Memory-Restricted Systems
Harshvardhan,; West, Brandon; Fidel, Adam; Amato, Nancy M.; Rauchwerger, Lawrence
2015-01-01
that sacrifice performance. In this work, we propose a novel RAM-Disk hybrid approach to graph processing that can scale well from a single shared-memory node to large distributed-memory systems. It works by partitioning the graph into sub graphs that fit in RAM
A Feynman graph selection tool in GRACE system
International Nuclear Information System (INIS)
Yuasa, Fukuko; Ishikawa, Tadashi; Kaneko, Toshiaki
2001-01-01
We present a Feynman graph selection tool grcsel, which is an interpreter written in C language. In the framework of GRACE, it enables us to get a subset of Feynman graphs according to given conditions
Motifs in triadic random graphs based on Steiner triple systems
Winkler, Marco; Reichardt, Jörg
2013-08-01
Conventionally, pairwise relationships between nodes are considered to be the fundamental building blocks of complex networks. However, over the last decade, the overabundance of certain subnetwork patterns, i.e., the so-called motifs, has attracted much attention. It has been hypothesized that these motifs, instead of links, serve as the building blocks of network structures. Although the relation between a network's topology and the general properties of the system, such as its function, its robustness against perturbations, or its efficiency in spreading information, is the central theme of network science, there is still a lack of sound generative models needed for testing the functional role of subgraph motifs. Our work aims to overcome this limitation. We employ the framework of exponential random graph models (ERGMs) to define models based on triadic substructures. The fact that only a small portion of triads can actually be set independently poses a challenge for the formulation of such models. To overcome this obstacle, we use Steiner triple systems (STSs). These are partitions of sets of nodes into pair-disjoint triads, which thus can be specified independently. Combining the concepts of ERGMs and STSs, we suggest generative models capable of generating ensembles of networks with nontrivial triadic Z-score profiles. Further, we discover inevitable correlations between the abundance of triad patterns, which occur solely for statistical reasons and need to be taken into account when discussing the functional implications of motif statistics. Moreover, we calculate the degree distributions of our triadic random graphs analytically.
Comparison between state graphs and fault trees for sequential and repairable systems
International Nuclear Information System (INIS)
Soussan, D.; Saignes, P.
1996-01-01
In French PSA (Probabilistic Safety Assessment) 1300 for the 1300 Mwe PWR plants carried out by EDF, sequential and reparable systems are modeled with state graphs. This method is particularly convenient for modeling dynamic systems with long-term missions but induces a bad traceability and understandability of models. In the objective of providing elements for rewriting PSA 1300 with only boolean models, EDF has asked CEA to participate to a methodological study. The aim is to carry out a feasibility study of transposition of state graphs models into fault trees on Component Cooling System and Essential Service Water System (CCS/ESWS) and to draw a methodological guide for transposition. The study realized on CCS/ESWS involves two main axes: quantification of cold source loss (as an accident sequence initiating event, called H1); quantification of the CCS/ESWS missions in accident sequences. The subject of this article is to show that this transformation is applicable with minimum distortions of the results and to determine the hypotheses, the conditions and the limits of application of this conversion. (authors). 2 refs
A Hybrid Approach to Processing Big Data Graphs on Memory-Restricted Systems
Harshvardhan,
2015-05-01
With the advent of big-data, processing large graphs quickly has become increasingly important. Most existing approaches either utilize in-memory processing techniques that can only process graphs that fit completely in RAM, or disk-based techniques that sacrifice performance. In this work, we propose a novel RAM-Disk hybrid approach to graph processing that can scale well from a single shared-memory node to large distributed-memory systems. It works by partitioning the graph into sub graphs that fit in RAM and uses a paging-like technique to load sub graphs. We show that without modifying the algorithms, this approach can scale from small memory-constrained systems (such as tablets) to large-scale distributed machines with 16, 000+ cores.
Strategic Port Graph Rewriting: An Interactive Modelling and Analysis Framework
Directory of Open Access Journals (Sweden)
Maribel Fernández
2014-07-01
Full Text Available We present strategic portgraph rewriting as a basis for the implementation of visual modelling and analysis tools. The goal is to facilitate the specification, analysis and simulation of complex systems, using port graphs. A system is represented by an initial graph and a collection of graph rewriting rules, together with a user-defined strategy to control the application of rules. The strategy language includes constructs to deal with graph traversal and management of rewriting positions in the graph. We give a small-step operational semantics for the language, and describe its implementation in the graph transformation and visualisation tool PORGY.
Solving Graph Laplacian Systems Through Recursive Bisections and Two-Grid Preconditioning
Energy Technology Data Exchange (ETDEWEB)
Ponce, Colin [Cornell Univ., Ithaca, NY (United States); Vassilevski, Panayot S. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
2016-02-18
We present a parallelizable direct method for computing the solution to graph Laplacian-based linear systems derived from graphs that can be hierarchically bipartitioned with small edge cuts. For a graph of size n with constant-size edge cuts, our method decomposes a graph Laplacian in time O(n log n), and then uses that decomposition to perform a linear solve in time O(n log n). We then use the developed technique to design a preconditioner for graph Laplacians that do not have this property. Finally, we augment this preconditioner with a two-grid method that accounts for much of the preconditioner's weaknesses. We present an analysis of this method, as well as a general theorem for the condition number of a general class of two-grid support graph-based preconditioners. Numerical experiments illustrate the performance of the studied methods.
Directory of Open Access Journals (Sweden)
SERGIY KOZERENKO
2016-04-01
Full Text Available One feature of the famous Sharkovsky’s theorem is that it can be proved using digraphs of a special type (the so–called Markov graphs. The most general definition assigns a Markov graph to every continuous map from the topological graph to itself. We show that this definition is too broad, i.e. every finite digraph can be viewed as a Markov graph of some one–dimensional dynamical system on a tree. We therefore consider discrete analogues of Markov graphs for vertex maps on combinatorial trees and characterize all maps on trees whose discrete Markov graphs are of the following types: complete, complete bipartite, the disjoint union of cycles, with every arc being a loop.
Mizan: Optimizing Graph Mining in Large Parallel Systems
Kalnis, Panos
2012-03-01
Extracting information from graphs, from nding shortest paths to complex graph mining, is essential for many ap- plications. Due to the shear size of modern graphs (e.g., social networks), processing must be done on large paral- lel computing infrastructures (e.g., the cloud). Earlier ap- proaches relied on the MapReduce framework, which was proved inadequate for graph algorithms. More recently, the message passing model (e.g., Pregel) has emerged. Although the Pregel model has many advantages, it is agnostic to the graph properties and the architecture of the underlying com- puting infrastructure, leading to suboptimal performance. In this paper, we propose Mizan, a layer between the users\\' code and the computing infrastructure. Mizan considers the structure of the input graph and the architecture of the in- frastructure in order to: (i) decide whether it is bene cial to generate a near-optimal partitioning of the graph in a pre- processing step, and (ii) choose between typical point-to- point message passing and a novel approach that puts com- puting nodes in a virtual overlay ring. We deployed Mizan on a small local Linux cluster, on the cloud (256 virtual machines in Amazon EC2), and on an IBM Blue Gene/P supercomputer (1024 CPUs). We show that Mizan executes common algorithms on very large graphs 1-2 orders of mag- nitude faster than MapReduce-based implementations and up to one order of magnitude faster than implementations relying on Pregel-like hash-based graph partitioning.
Using Behavior Over Time Graphs to Spur Systems Thinking Among Public Health Practitioners.
Calancie, Larissa; Anderson, Seri; Branscomb, Jane; Apostolico, Alexsandra A; Lich, Kristen Hassmiller
2018-02-01
Public health practitioners can use Behavior Over Time (BOT) graphs to spur discussion and systems thinking around complex challenges. Multiple large systems, such as health care, the economy, and education, affect chronic disease rates in the United States. System thinking tools can build public health practitioners' capacity to understand these systems and collaborate within and across sectors to improve population health. BOT graphs show a variable, or variables (y axis) over time (x axis). Although analyzing trends is not new to public health, drawing BOT graphs, annotating the events and systemic forces that are likely to influence the depicted trends, and then discussing the graphs in a diverse group provides an opportunity for public health practitioners to hear each other's perspectives and creates a more holistic understanding of the key factors that contribute to a trend. We describe how BOT graphs are used in public health, how they can be used to generate group discussion, and how this process can advance systems-level thinking. Then we describe how BOT graphs were used with groups of maternal and child health (MCH) practitioners and partners (N = 101) during a training session to advance their thinking about MCH challenges. Eighty-six percent of the 84 participants who completed an evaluation agreed or strongly agreed that they would use this BOT graph process to engage stakeholders in their home states and jurisdictions. The BOT graph process we describe can be applied to a variety of public health issues and used by practitioners, stakeholders, and researchers.
Gohatre, Umakant Bhaskar; Patil, Venkat P.
2018-04-01
In computer vision application, the multiple object detection and tracking, in real-time operation is one of the important research field, that have gained a lot of attentions, in last few years for finding non stationary entities in the field of image sequence. The detection of object is advance towards following the moving object in video and then representation of object is step to track. The multiple object recognition proof is one of the testing assignment from detection multiple objects from video sequence. The picture enrollment has been for quite some time utilized as a reason for the location the detection of moving multiple objects. The technique of registration to discover correspondence between back to back casing sets in view of picture appearance under inflexible and relative change. The picture enrollment is not appropriate to deal with event occasion that can be result in potential missed objects. In this paper, for address such problems, designs propose novel approach. The divided video outlines utilizing area adjancy diagram of visual appearance and geometric properties. Then it performed between graph sequences by using multi graph matching, then getting matching region labeling by a proposed graph coloring algorithms which assign foreground label to respective region. The plan design is robust to unknown transformation with significant improvement in overall existing work which is related to moving multiple objects detection in real time parameters.
Directory of Open Access Journals (Sweden)
Lubna Moin
2009-04-01
Full Text Available This research paper basically explores and compares the different modeling and analysis techniques and than it also explores the model order reduction approach and significance. The traditional modeling and simulation techniques for dynamic systems are generally adequate for single-domain systems only, but the Bond Graph technique provides new strategies for reliable solutions of multi-domain system. They are also used for analyzing linear and non linear dynamic production system, artificial intelligence, image processing, robotics and industrial automation. This paper describes a unique technique of generating the Genetic design from the tree structured transfer function obtained from Bond Graph. This research work combines bond graphs for model representation with Genetic programming for exploring different ideas on design space tree structured transfer function result from replacing typical bond graph element with their impedance equivalent specifying impedance lows for Bond Graph multiport. This tree structured form thus obtained from Bond Graph is applied for generating the Genetic Tree. Application studies will identify key issues and importance for advancing this approach towards becoming on effective and efficient design tool for synthesizing design for Electrical system. In the first phase, the system is modeled using Bond Graph technique. Its system response and transfer function with conventional and Bond Graph method is analyzed and then a approach towards model order reduction is observed. The suggested algorithm and other known modern model order reduction techniques are applied to a 11th order high pass filter [1], with different approach. The model order reduction technique developed in this paper has least reduction errors and secondly the final model retains structural information. The system response and the stability analysis of the system transfer function taken by conventional and by Bond Graph method is compared and
Zero Forcing Sets and Controllability of Dynamical Systems Defined on Graphs
Monshizadeh Naini, Nima; Zhang, Shuo; Camlibel, M. Kanat
In this technical note, controllability of systems defined on graphs is discussed. We consider the problem of controllability of the network for a family of matrices carrying the structure of an underlying directed graph. A one-to-one correspondence between the set of leaders rendering the network
On the graph and systems analysis of reversible chemical reaction networks with mass action kinetics
Rao, Shodhan; Jayawardhana, Bayu; Schaft, Arjan van der
2012-01-01
Motivated by the recent progresses on the interplay between the graph theory and systems theory, we revisit the analysis of reversible chemical reaction networks described by mass action kinetics by reformulating it using the graph knowledge of the underlying networks. Based on this formulation, we
Automatic Transformation of MPI Programs to Asynchronous, Graph-Driven Form
Energy Technology Data Exchange (ETDEWEB)
Baden, Scott B [University of California, San Diego; Weare, John H [University of California, San Diego; Bylaska, Eric J [Pacific Northwest National Laboratory
2013-04-30
The goals of this project are to develop new, scalable, high-fidelity algorithms for atomic-level simulations and program transformations that automatically restructure existing applications, enabling them to scale forward to Petascale systems and beyond. The techniques enable legacy MPI application code to exploit greater parallelism though increased latency hiding and improved workload assignment. The techniques were successfully demonstrated on high-end scalable systems located at DOE laboratories. Besides the automatic MPI program transformations efforts, the project also developed several new scalable algorithms for ab-initio molecular dynamics, including new massively parallel algorithms for hybrid DFT and new parallel in time algorithms for molecular dynamics and ab-initio molecular dynamics. These algorithms were shown to scale to very large number of cores, and they were designed to work in the latency hiding framework developed in this project. The effectiveness of the developments was enhanced by the direct application to real grand challenge simulation problems covering a wide range of technologically important applications, time scales and accuracies. These included the simulation of the electronic structure of mineral/fluid interfaces, the very accurate simulation of chemical reactions in microsolvated environments, and the simulation of chemical behavior in very large enzyme reactions.
International Nuclear Information System (INIS)
Barra, F.; Gaspard, P.
2001-01-01
We consider the classical evolution of a particle on a graph by using a time-continuous Frobenius-Perron operator that generalizes previous propositions. In this way, the relaxation rates as well as the chaotic properties can be defined for the time-continuous classical dynamics on graphs. These properties are given as the zeros of some periodic-orbit zeta functions. We consider in detail the case of infinite periodic graphs where the particle undergoes a diffusion process. The infinite spatial extension is taken into account by Fourier transforms that decompose the observables and probability densities into sectors corresponding to different values of the wave number. The hydrodynamic modes of diffusion are studied by an eigenvalue problem of a Frobenius-Perron operator corresponding to a given sector. The diffusion coefficient is obtained from the hydrodynamic modes of diffusion and has the Green-Kubo form. Moreover, we study finite but large open graphs that converge to the infinite periodic graph when their size goes to infinity. The lifetime of the particle on the open graph is shown to correspond to the lifetime of a system that undergoes a diffusion process before it escapes
Bond graph modeling and LQG/LTR controller design of magnetically levitation systems
Energy Technology Data Exchange (ETDEWEB)
Kim, Jong Shik; Park, Jeon Soo [Busan National Univ. (Korea, Republic of)
1991-09-01
A logical and systematic procedure to derive a mathematical model for magnetically levitation (MAGLEV) systems with a combined lift and guidance is developed by using bond graph modeling techniques. First, bond graph is contructed for the 1{sup st}-dimensional MAGLEV system in which three subsystems (energy feeding, track and vehicle) are considered. And, the 2{sup nd}-dimensional MAGLEV system in which lift and guidance dynamics are coupled is modeled by using the concept of multi-port field in bond graph languages. Finally, the LQG/LTR control system is designed for a multivariable MAGLEV system with stagger configuration type. In this paper, it has been shown that the bond graph is an excellent effective method for modeling multi-energy domain systems such as MAGLEV systems with uncertainties such as mass variations, track irregularities and wind gusts. (Author).
Bond graph modeling and LQG/LTR controller design of magnetically levitation systems
International Nuclear Information System (INIS)
Kim, Jong Shik; Park, Jeon Soo
1991-01-01
A logical and systematic procedure to derive a mathematical model for magnetically levitation (MAGLEV) systems with a combined lift and guidance is developed by using bond graph modeling techniques. First, bond graph is contructed for the 1 st -dimensional MAGLEV system in which three subsystems (energy feeding, track and vehicle) are considered. And, the 2 nd -dimensional MAGLEV system in which lift and guidance dynamics are coupled is modeled by using the concept of multi-port field in bond graph languages. Finally, the LQG/LTR control system is designed for a multivariable MAGLEV system with stagger configuration type. In this paper, it has been shown that the bond graph is an excellent effective method for modeling multi-energy domain systems such as MAGLEV systems with uncertainties such as mass variations, track irregularities and wind gusts. (Author)
Information Graph Flow: A Geometric Approximation of Quantum and Statistical Systems
Vanchurin, Vitaly
2018-05-01
Given a quantum (or statistical) system with a very large number of degrees of freedom and a preferred tensor product factorization of the Hilbert space (or of a space of distributions) we describe how it can be approximated with a very low-dimensional field theory with geometric degrees of freedom. The geometric approximation procedure consists of three steps. The first step is to construct weighted graphs (we call information graphs) with vertices representing subsystems (e.g., qubits or random variables) and edges representing mutual information (or the flow of information) between subsystems. The second step is to deform the adjacency matrices of the information graphs to that of a (locally) low-dimensional lattice using the graph flow equations introduced in the paper. (Note that the graph flow produces very sparse adjacency matrices and thus might also be used, for example, in machine learning or network science where the task of graph sparsification is of a central importance.) The third step is to define an emergent metric and to derive an effective description of the metric and possibly other degrees of freedom. To illustrate the procedure we analyze (numerically and analytically) two information graph flows with geometric attractors (towards locally one- and two-dimensional lattices) and metric perturbations obeying a geometric flow equation. Our analysis also suggests a possible approach to (a non-perturbative) quantum gravity in which the geometry (a secondary object) emerges directly from a quantum state (a primary object) due to the flow of the information graphs.
Energy systems transformation.
Dangerman, A T C Jérôme; Schellnhuber, Hans Joachim
2013-02-12
The contemporary industrial metabolism is not sustainable. Critical problems arise at both the input and the output side of the complex: Although affordable fossil fuels and mineral resources are declining, the waste products of the current production and consumption schemes (especially CO(2) emissions, particulate air pollution, and radioactive residua) cause increasing environmental and social costs. Most challenges are associated with the incumbent energy economy that is unlikely to subsist. However, the crucial question is whether a swift transition to its sustainable alternative, based on renewable sources, can be achieved. The answer requires a deep analysis of the structural conditions responsible for the rigidity of the fossil-nuclear energy system. We argue that the resilience of the fossil-nuclear energy system results mainly from a dynamic lock-in pattern known in operations research as the "Success to the Successful" mode. The present way of generating, distributing, and consuming energy--the largest business on Earth--expands through a combination of factors such as the longevity of pertinent infrastructure, the information technology revolution, the growth of the global population, and even the recent financial crises: Renewable-energy industries evidently suffer more than the conventional-energy industries under recession conditions. Our study tries to elucidate the archetypical traits of the lock-in pattern and to assess the respective importance of the factors involved. In particular, we identify modern corporate law as a crucial system element that thus far has been largely ignored. Our analysis indicates that the rigidity of the existing energy economy would be reduced considerably by the assignment of unlimited liabilities to the shareholders.
Bond graph modelling of engineering systems: theory, applications and software support
National Research Council Canada - National Science Library
Borutzky, Wolfgang; Margolis, Donald L
2011-01-01
... way such that analytical or computer response predictions can be straightforwardly carried out. Bond graphs are a concise pictorial representation of all types of interacting energetic systems. In my experience working with engineers on the development of complex systems it is obvious that these systems suffer from thermal problems, structural problems, vibration and noise problems, and control and stability issues that do not fit into a single discipline. Bond graphs provide the link by which all these different ...
Bond graphs for modelling, control and fault diagnosis of engineering systems
2017-01-01
This book presents theory and latest application work in Bond Graph methodology with a focus on: • Hybrid dynamical system models, • Model-based fault diagnosis, model-based fault tolerant control, fault prognosis • and also addresses • Open thermodynamic systems with compressible fluid flow, • Distributed parameter models of mechanical subsystems. In addition, the book covers various applications of current interest ranging from motorised wheelchairs, in-vivo surgery robots, walking machines to wind-turbines.The up-to-date presentation has been made possible by experts who are active members of the worldwide bond graph modelling community. This book is the completely revised 2nd edition of the 2011 Springer compilation text titled Bond Graph Modelling of Engineering Systems – Theory, Applications and Software Support. It extends the presentation of theory and applications of graph methodology by new developments and latest research results. Like the first edition, this book addresses readers in a...
Fast Discrete Fourier Transform Computations Using the Reduced Adder Graph Technique
Directory of Open Access Journals (Sweden)
Andrew G. Dempster
2007-01-01
Full Text Available It has recently been shown that the n-dimensional reduced adder graph (RAG-n technique is beneficial for many DSP applications such as for FIR and IIR filters, where multipliers can be grouped in multiplier blocks. This paper highlights the importance of DFT and FFT as DSP objects and also explores how the RAG-n technique can be applied to these algorithms. This RAG-n DFT will be shown to be of low complexity and possess an attractively regular VLSI data flow when implemented with the Rader DFT algorithm or the Bluestein chirp-z algorithm. ASIC synthesis data are provided and demonstrate the low complexity and high speed of the design when compared to other alternatives.
Fast Discrete Fourier Transform Computations Using the Reduced Adder Graph Technique
Directory of Open Access Journals (Sweden)
Dempster Andrew G
2007-01-01
Full Text Available It has recently been shown that the -dimensional reduced adder graph (RAG- technique is beneficial for many DSP applications such as for FIR and IIR filters, where multipliers can be grouped in multiplier blocks. This paper highlights the importance of DFT and FFT as DSP objects and also explores how the RAG- technique can be applied to these algorithms. This RAG- DFT will be shown to be of low complexity and possess an attractively regular VLSI data flow when implemented with the Rader DFT algorithm or the Bluestein chirp- algorithm. ASIC synthesis data are provided and demonstrate the low complexity and high speed of the design when compared to other alternatives.
Coexistence of graph-oriented and relational data file organisations in a data bank system
International Nuclear Information System (INIS)
Engel, K.D.
1980-01-01
It is shown that a coexistence of hierarchical and relational data bank structures in computer networks in a common data bank system is possible. This coexistence model, first established by NIJSSEN, regards the graph theory CODASYL approach and CODD's relational model as graph-oriented, or rather table-oriented, data file organisation as presented to the user of a common logical structure of the data bank. (WB) [de
The coordinate transforming in geography information system
International Nuclear Information System (INIS)
Zhao Xiang; Chen Gang
2003-01-01
The coordinate transforming of geography information system includes two kinds of transforming, map projection and coordinate-transforming. This paper proposed a arithmetic of coordinate-transforming, it implement the transforming between the longitude-latitude coordinate and the screen coordinate and apply it in the GIS. The preferable effect was made. (authors)
Modeling, Control and Analyze of Multi-Machine Drive Systems using Bond Graph Technique
Directory of Open Access Journals (Sweden)
J. Belhadj
2006-03-01
Full Text Available In this paper, a system viewpoint method has been investigated to study and analyze complex systems using Bond Graph technique. These systems are multimachine multi-inverter based on Induction Machine (IM, well used in industries like rolling mills, textile, and railway traction. These systems are multi-domains, multi-scales time and present very strong internal and external couplings, with non-linearity characterized by a high model order. The classical study with analytic model is difficult to manipulate and it is limited to some performances. In this study, a “systemic approach” is presented to design these kinds of systems, using an energetic representation based on Bond Graph formalism. Three types of multimachine are studied with their control strategies. The modeling is carried out by Bond Graph and results are discussed to show the performances of this methodology
Mechanical system reliability analysis using a combination of graph theory and Boolean function
International Nuclear Information System (INIS)
Tang, J.
2001-01-01
A new method based on graph theory and Boolean function for assessing reliability of mechanical systems is proposed. The procedure for this approach consists of two parts. By using the graph theory, the formula for the reliability of a mechanical system that considers the interrelations of subsystems or components is generated. Use of the Boolean function to examine the failure interactions of two particular elements of the system, followed with demonstrations of how to incorporate such failure dependencies into the analysis of larger systems, a constructive algorithm for quantifying the genuine interconnections between the subsystems or components is provided. The combination of graph theory and Boolean function provides an effective way to evaluate the reliability of a large, complex mechanical system. A numerical example demonstrates that this method an effective approaches in system reliability analysis
International Nuclear Information System (INIS)
Lacasa, Lucas
2014-01-01
Dynamical processes can be transformed into graphs through a family of mappings called visibility algorithms, enabling the possibility of (i) making empirical time series analysis and signal processing and (ii) characterizing classes of dynamical systems and stochastic processes using the tools of graph theory. Recent works show that the degree distribution of these graphs encapsulates much information on the signals' variability, and therefore constitutes a fundamental feature for statistical learning purposes. However, exact solutions for the degree distributions are only known in a few cases, such as for uncorrelated random processes. Here we analytically explore these distributions in a list of situations. We present a diagrammatic formalism which computes for all degrees their corresponding probability as a series expansion in a coupling constant which is the number of hidden variables. We offer a constructive solution for general Markovian stochastic processes and deterministic maps. As case tests we focus on Ornstein–Uhlenbeck processes, fully chaotic and quasiperiodic maps. Whereas only for certain degree probabilities can all diagrams be summed exactly, in the general case we show that the perturbation theory converges. In a second part, we make use of a variational technique to predict the complete degree distribution for special classes of Markovian dynamics with fast-decaying correlations. In every case we compare the theory with numerical experiments. (paper)
A nonlinear merging protocol for consensus in multi-agent systems on signed and weighted graphs
Feng, Shasha; Wang, Li; Li, Yijia; Sun, Shiwen; Xia, Chengyi
2018-01-01
In this paper, we investigate the multi-agent consensus for networks with undirected graphs which are not connected, especially for the signed graph in which some edge weights are positive and some edges have negative weights, and the negative-weight graph whose edge weights are negative. We propose a novel nonlinear merging consensus protocol to drive the states of all agents to converge to the same state zero which is not dependent upon the initial states of agents. If the undirected graph whose edge weights are positive is connected, then the states of all agents converge to the same state more quickly when compared to most other protocols. While the undirected graph whose edge weights might be positive or negative is unconnected, the states of all agents can still converge to the same state zero under the premise that the undirected graph can be divided into several connected subgraphs with more than one node. Furthermore, we also discuss the impact of parameter r presented in our protocol. Current results can further deepen the understanding of consensus processes for multi-agent systems.
Modelling of Non-Linear Pilot Disinfection Water System: A Bond Graph Approach
Directory of Open Access Journals (Sweden)
Naoufel ZITOUNI
2012-08-01
Full Text Available The ultraviolet (UV irradiations are used to solve the bacteriological problem of the drinking water quality. A discharge-gas lamp is used to produce this type of irradiation. The UV lamp is fed by photovoltaic (PV energy via electronic ballast composed by an inverter, a transformer and resonant circuit (RLC. The aim of this work is to give a useful global model of the system. In particular, we introduce the complicated UV lamp model and the water disinfection kinetics, where the radiant energy flux emitted by the discharge-gas lamp and the arc voltage are a complex functions of the current and time. This system is intended to be mainly used in rural zones, the photovoltaic modules as source of energy is an adequate solution. To optimise the power transfer from the PV array to ballast and UV lamp, a Maximum Power Point Tracking (MPPT device may be located between PV array and the loads. In this paper, we developed a bond-graph model which gives the water quality from UV flow, gas type, pressure, lamp current and geometrical characteristic. Finally reliable simulations are established and compared with experimental tests.
Mizan: A system for dynamic load balancing in large-scale graph processing
Khayyat, Zuhair
2013-01-01
Pregel [23] was recently introduced as a scalable graph mining system that can provide significant performance improvements over traditional MapReduce implementations. Existing implementations focus primarily on graph partitioning as a preprocessing step to balance computation across compute nodes. In this paper, we examine the runtime characteristics of a Pregel system. We show that graph partitioning alone is insufficient for minimizing end-to-end computation. Especially where data is very large or the runtime behavior of the algorithm is unknown, an adaptive approach is needed. To this end, we introduce Mizan, a Pregel system that achieves efficient load balancing to better adapt to changes in computing needs. Unlike known implementations of Pregel, Mizan does not assume any a priori knowledge of the structure of the graph or behavior of the algorithm. Instead, it monitors the runtime characteristics of the system. Mizan then performs efficient fine-grained vertex migration to balance computation and communication. We have fully implemented Mizan; using extensive evaluation we show that - especially for highly-dynamic workloads - Mizan provides up to 84% improvement over techniques leveraging static graph pre-partitioning. © 2013 ACM.
Scalable Parallel Distributed Coprocessor System for Graph Searching Problems with Massive Data
Directory of Open Access Journals (Sweden)
Wanrong Huang
2017-01-01
Full Text Available The Internet applications, such as network searching, electronic commerce, and modern medical applications, produce and process massive data. Considerable data parallelism exists in computation processes of data-intensive applications. A traversal algorithm, breadth-first search (BFS, is fundamental in many graph processing applications and metrics when a graph grows in scale. A variety of scientific programming methods have been proposed for accelerating and parallelizing BFS because of the poor temporal and spatial locality caused by inherent irregular memory access patterns. However, new parallel hardware could provide better improvement for scientific methods. To address small-world graph problems, we propose a scalable and novel field-programmable gate array-based heterogeneous multicore system for scientific programming. The core is multithread for streaming processing. And the communication network InfiniBand is adopted for scalability. We design a binary search algorithm to address mapping to unify all processor addresses. Within the limits permitted by the Graph500 test bench after 1D parallel hybrid BFS algorithm testing, our 8-core and 8-thread-per-core system achieved superior performance and efficiency compared with the prior work under the same degree of parallelism. Our system is efficient not as a special acceleration unit but as a processor platform that deals with graph searching applications.
State space model extraction of thermohydraulic systems – Part I: A linear graph approach
International Nuclear Information System (INIS)
Uren, K.R.; Schoor, G. van
2013-01-01
Thermohydraulic simulation codes are increasingly making use of graphical design interfaces. The user can quickly and easily design a thermohydraulic system by placing symbols on the screen resembling system components. These components can then be connected to form a system representation. Such system models may then be used to obtain detailed simulations of the physical system. Usually this kind of simulation models are too complex and not ideal for control system design. Therefore, a need exists for automated techniques to extract lumped parameter models useful for control system design. The goal of this first paper, in a two part series, is to propose a method that utilises a graphical representation of a thermohydraulic system, and a lumped parameter modelling approach, to extract state space models. In this methodology each physical domain of the thermohydraulic system is represented by a linear graph. These linear graphs capture the interaction between all components within and across energy domains – hydraulic, thermal and mechanical. These linear graphs are analysed using a graph-theoretic approach to derive reduced order state space models. These models capture the dominant dynamics of the thermohydraulic system and are ideal for control system design purposes. The proposed state space model extraction method is demonstrated by considering a U-tube system. A non-linear state space model is extracted representing both the hydraulic and thermal domain dynamics of the system. The simulated state space model is compared with a Flownex ® model of the U-tube. Flownex ® is a validated systems thermal-fluid simulation software package. - Highlights: • A state space model extraction methodology based on graph-theoretic concepts. • An energy-based approach to consider multi-domain systems in a common framework. • Allow extraction of transparent (white-box) state space models automatically. • Reduced order models containing only independent state
Ant-based extraction of rules in simple decision systems over ontological graphs
Directory of Open Access Journals (Sweden)
Pancerz Krzysztof
2015-06-01
Full Text Available In the paper, the problem of extraction of complex decision rules in simple decision systems over ontological graphs is considered. The extracted rules are consistent with the dominance principle similar to that applied in the dominancebased rough set approach (DRSA. In our study, we propose to use a heuristic algorithm, utilizing the ant-based clustering approach, searching the semantic spaces of concepts presented by means of ontological graphs. Concepts included in the semantic spaces are values of attributes describing objects in simple decision systems
An Interactive Teaching System for Bond Graph Modeling and Simulation in Bioengineering
Roman, Monica; Popescu, Dorin; Selisteanu, Dan
2013-01-01
The objective of the present work was to implement a teaching system useful in modeling and simulation of biotechnological processes. The interactive system is based on applications developed using 20-sim modeling and simulation software environment. A procedure for the simulation of bioprocesses modeled by bond graphs is proposed and simulators…
Specific features of the REDUCE system and calculation of QCD Feynman graphs
International Nuclear Information System (INIS)
Dulyan, L.S.
1990-01-01
The ways and methods used in calculation of one class of the QCD Feynman graphs with the help of the REDUCE system are described. It is shown how by introducing new constructions and operations the user could avoid difficulties connected with specific restrictions and features of the REDUCE system
Fault diagnosis of air conditioning systems based on qualitative bond graph
International Nuclear Information System (INIS)
Ghiaus, C.
1999-01-01
The bond graph method represents a unified approach for modeling engineering systems. The main idea is that power transfer bonds the components of a system. The bond graph model is the same for both quantitative representation, in which parameters have numerical values, and qualitative approach, in which they are classified qualitatively. To infer the cause of faults using a qualitative method, a system of qualitative equations must be solved. However, the characteristics of qualitative operators require specific methods for solving systems of equations having qualitative variables. This paper proposes both a method for recursively solving the qualitative system of equations derived from bond graph, and a bond graph model of a direct-expansion, mechanical vapor-compression air conditioning system. Results from diagnosing two faults in a real air conditioning system are presented and discussed. Occasionally, more than one fault candidate is inferred for the same set of qualitative values derived from measurements. In these cases, additional information is required to localize the fault. Fault diagnosis is initiated by a fault detection mechanism which also classifies the quantitative measurements into qualitative values; the fault detection is not presented here. (author)
An Efficient Downlink Scheduling Strategy Using Normal Graphs for Multiuser MIMO Wireless Systems
Chen, Jung-Chieh; Wu, Cheng-Hsuan; Lee, Yao-Nan; Wen, Chao-Kai
Inspired by the success of the low-density parity-check (LDPC) codes in the field of error-control coding, in this paper we propose transforming the downlink multiuser multiple-input multiple-output scheduling problem into an LDPC-like problem using the normal graph. Based on the normal graph framework, soft information, which indicates the probability that each user will be scheduled to transmit packets at the access point through a specified angle-frequency sub-channel, is exchanged among the local processors to iteratively optimize the multiuser transmission schedule. Computer simulations show that the proposed algorithm can efficiently schedule simultaneous multiuser transmission which then increases the overall channel utilization and reduces the average packet delay.
DEFF Research Database (Denmark)
Seiller, Thomas
2016-01-01
Interaction graphs were introduced as a general, uniform, construction of dynamic models of linear logic, encompassing all Geometry of Interaction (GoI) constructions introduced so far. This series of work was inspired from Girard's hyperfinite GoI, and develops a quantitative approach that should...... be understood as a dynamic version of weighted relational models. Until now, the interaction graphs framework has been shown to deal with exponentials for the constrained system ELL (Elementary Linear Logic) while keeping its quantitative aspect. Adapting older constructions by Girard, one can clearly define...... "full" exponentials, but at the cost of these quantitative features. We show here that allowing interpretations of proofs to use continuous (yet finite in a measure-theoretic sense) sets of states, as opposed to earlier Interaction Graphs constructions were these sets of states were discrete (and finite...
Graph theoretical calculation of systems reliability with semi-Markov processes
International Nuclear Information System (INIS)
Widmer, U.
1984-06-01
The determination of the state probabilities and related quantities of a system characterized by an SMP (or a homogeneous MP) can be performed by means of graph-theoretical methods. The calculation procedures for semi-Markov processes based on signal flow graphs are reviewed. Some methods from electrotechnics are adapted in order to obtain a representation of the state probabilities by means of trees. From this some formulas are derived for the asymptotic state probabilities and for the mean life-time in reliability considerations. (Auth.)
Designing a Cross-organizational Case Management System using Dynamic Condition Response Graphs
DEFF Research Database (Denmark)
Hildebrandt, Thomas; Mukkamala, Raghava Rao; Slaats, Tijs
2011-01-01
systems. We show how DCR Graphs allow to capture directly both the behavioral constraints identified during meetings with the customer and the operational execution as markings of the graph. In comparison, imperative models such as BPMN, Petri Net, UML Sequence or Activity diagrams are only good...... at describing the operational way to fulfill the constraints, leaving the constraints implicit. In particular, we point out that the BPMN ad-hoc sub process activity, intended to support more loosely structured goal driven ad-hoc processes, is inconsistently described in the final version of the BPMN 2...
A Qualitative Approach to Sketch the Graph of a Function.
Alson, Pedro
1992-01-01
Presents a qualitative and global method of graphing functions that involves transformations of the graph of a known function in the cartesian coordinate system referred to as graphic operators. Explains how the method has been taught to students and some comments about the results obtained. (MDH)
Mal-Netminer: Malware Classification Approach Based on Social Network Analysis of System Call Graph
Directory of Open Access Journals (Sweden)
Jae-wook Jang
2015-01-01
Full Text Available As the security landscape evolves over time, where thousands of species of malicious codes are seen every day, antivirus vendors strive to detect and classify malware families for efficient and effective responses against malware campaigns. To enrich this effort and by capitalizing on ideas from the social network analysis domain, we build a tool that can help classify malware families using features driven from the graph structure of their system calls. To achieve that, we first construct a system call graph that consists of system calls found in the execution of the individual malware families. To explore distinguishing features of various malware species, we study social network properties as applied to the call graph, including the degree distribution, degree centrality, average distance, clustering coefficient, network density, and component ratio. We utilize features driven from those properties to build a classifier for malware families. Our experimental results show that “influence-based” graph metrics such as the degree centrality are effective for classifying malware, whereas the general structural metrics of malware are less effective for classifying malware. Our experiments demonstrate that the proposed system performs well in detecting and classifying malware families within each malware class with accuracy greater than 96%.
A graph rewriting programming language for graph drawing
Rodgers, Peter
1998-01-01
This paper describes Grrr, a prototype visual graph drawing tool. Previously there were no visual languages for programming graph drawing algorithms despite the inherently visual nature of the process. The languages which gave a diagrammatic view of graphs were not computationally complete and so could not be used to implement complex graph drawing algorithms. Hence current graph drawing tools are all text based. Recent developments in graph rewriting systems have produced computationally com...
Entangling transformations in composite finite quantum systems
International Nuclear Information System (INIS)
Vourdas, A
2003-01-01
Phase space methods are applied in the context of finite quantum systems. 'Galois quantum systems' (with a dimension which is a power of a prime number) are considered, and symplectic Sp(2,Z(d)) transformations are studied. Composite systems comprising two finite quantum systems are also considered. Symplectic Sp(4,Z(d)) transformations are classified into local and entangling ones and the necessary matrices which perform such transformations are calculated numerically
Endriss, U.; Grandi, U.
Graph aggregation is the process of computing a single output graph that constitutes a good compromise between several input graphs, each provided by a different source. One needs to perform graph aggregation in a wide variety of situations, e.g., when applying a voting rule (graphs as preference
Stability analysis of switched linear systems defined by graphs
Athanasopoulos, Nikolaos; Lazar, Mircea
2015-01-01
We present necessary and sufficient conditions for global exponential stability for switched discrete-time linear systems, under arbitrary switching, which is constrained within a set of admissible transitions. The class of systems studied includes the family of systems under arbitrary switching, periodic systems, and systems with minimum and maximum dwell time specifications. To reach the result, we describe the set of rules that define the admissible transitions with a weighted directed gra...
Model-Based Requirements Management in Gear Systems Design Based On Graph-Based Design Languages
Directory of Open Access Journals (Sweden)
Kevin Holder
2017-10-01
Full Text Available For several decades, a wide-spread consensus concerning the enormous importance of an in-depth clarification of the specifications of a product has been observed. A weak clarification of specifications is repeatedly listed as a main cause for the failure of product development projects. Requirements, which can be defined as the purpose, goals, constraints, and criteria associated with a product development project, play a central role in the clarification of specifications. The collection of activities which ensure that requirements are identified, documented, maintained, communicated, and traced throughout the life cycle of a system, product, or service can be referred to as “requirements engineering”. These activities can be supported by a collection and combination of strategies, methods, and tools which are appropriate for the clarification of specifications. Numerous publications describe the strategy and the components of requirements management. Furthermore, recent research investigates its industrial application. Simultaneously, promising developments of graph-based design languages for a holistic digital representation of the product life cycle are presented. Current developments realize graph-based languages by the diagrams of the Unified Modelling Language (UML, and allow the automatic generation and evaluation of multiple product variants. The research presented in this paper seeks to present a method in order to combine the advantages of a conscious requirements management process and graph-based design languages. Consequently, the main objective of this paper is the investigation of a model-based integration of requirements in a product development process by means of graph-based design languages. The research method is based on an in-depth analysis of an exemplary industrial product development, a gear system for so-called “Electrical Multiple Units” (EMU. Important requirements were abstracted from a gear system
Nonstochastic Analysis of Manufacturing Systems Using Timed-Event Graphs
DEFF Research Database (Denmark)
Hulgaard, Henrik; Amon, Tod
1996-01-01
Using automated methods to analyze the temporal behavior ofmanufacturing systems has proven to be essential and quite beneficial.Popular methodologies include Queueing networks, Markov chains,simulation techniques, and discrete event systems (such as Petrinets). These methodologies are primarily...
Stability analysis of switched linear systems defined by graphs
Athanasopoulos, N.; Lazar, M.
2014-01-01
We present necessary and sufficient conditions for global exponential stability for switched discrete-time linear systems, under arbitrary switching, which is constrained within a set of admissible transitions. The class of systems studied includes the family of systems under arbitrary switching,
Algorithm for shortest path search in Geographic Information Systems by using reduced graphs.
Rodríguez-Puente, Rafael; Lazo-Cortés, Manuel S
2013-01-01
The use of Geographic Information Systems has increased considerably since the eighties and nineties. As one of their most demanding applications we can mention shortest paths search. Several studies about shortest path search show the feasibility of using graphs for this purpose. Dijkstra's algorithm is one of the classic shortest path search algorithms. This algorithm is not well suited for shortest path search in large graphs. This is the reason why various modifications to Dijkstra's algorithm have been proposed by several authors using heuristics to reduce the run time of shortest path search. One of the most used heuristic algorithms is the A* algorithm, the main goal is to reduce the run time by reducing the search space. This article proposes a modification of Dijkstra's shortest path search algorithm in reduced graphs. It shows that the cost of the path found in this work, is equal to the cost of the path found using Dijkstra's algorithm in the original graph. The results of finding the shortest path, applying the proposed algorithm, Dijkstra's algorithm and A* algorithm, are compared. This comparison shows that, by applying the approach proposed, it is possible to obtain the optimal path in a similar or even in less time than when using heuristic algorithms.
Graphing trillions of triangles.
Burkhardt, Paul
2017-07-01
The increasing size of Big Data is often heralded but how data are transformed and represented is also profoundly important to knowledge discovery, and this is exemplified in Big Graph analytics. Much attention has been placed on the scale of the input graph but the product of a graph algorithm can be many times larger than the input. This is true for many graph problems, such as listing all triangles in a graph. Enabling scalable graph exploration for Big Graphs requires new approaches to algorithms, architectures, and visual analytics. A brief tutorial is given to aid the argument for thoughtful representation of data in the context of graph analysis. Then a new algebraic method to reduce the arithmetic operations in counting and listing triangles in graphs is introduced. Additionally, a scalable triangle listing algorithm in the MapReduce model will be presented followed by a description of the experiments with that algorithm that led to the current largest and fastest triangle listing benchmarks to date. Finally, a method for identifying triangles in new visual graph exploration technologies is proposed.
Volatility behavior of visibility graph EMD financial time series from Ising interacting system
Zhang, Bo; Wang, Jun; Fang, Wen
2015-08-01
A financial market dynamics model is developed and investigated by stochastic Ising system, where the Ising model is the most popular ferromagnetic model in statistical physics systems. Applying two graph based analysis and multiscale entropy method, we investigate and compare the statistical volatility behavior of return time series and the corresponding IMF series derived from the empirical mode decomposition (EMD) method. And the real stock market indices are considered to be comparatively studied with the simulation data of the proposed model. Further, we find that the degree distribution of visibility graph for the simulation series has the power law tails, and the assortative network exhibits the mixing pattern property. All these features are in agreement with the real market data, the research confirms that the financial model established by the Ising system is reasonable.
STABILITY OF LINEAR MULTIAGENT SCALAR SYSTEMS AND ITS DEPENDENCE ON CONNECTIVITY GRAPH
Directory of Open Access Journals (Sweden)
S. I. Tomashevich
2014-03-01
Full Text Available Multiagent systems are now finding increasingly wide applications in various engineering fields such as energy, transportation, robotics, aviation and others. There are two main aspects to be focused on when organizing multiagent systems: the dynamics of the agents themselves and the ways of their interaction. This interaction is determined by the structure of information connections between agents. Thus, there are several key points of multiagent systems study: the dynamics of individual agents and shape of the information graph. Formation dynamics, in general, is determined by a set of properties of agents and connectivity graph. The paper deals with the relationship between dynamics of agents and Laplace matrix, which is used to set the graph connections. The present research is based on the results given in the known paper by A. Fax and R. Murray (IEEE Trans. AC, 2004. An illustrative example is given, and the application problem of studying the formation dynamics consisting of the group of quadrocopters is presented. Information exchange between agents is determined in the paper by means of the conventional set of graphs. The paper presents an interpretation of the stability conditions and the method of system performance improvement based on these conditions. Motion of quadrocopters group along the flight height is used as an example for methodology application. The simulation results demonstrate the basic dependencies between the information graph shape (and, consequently, the eigenvalues of the Laplacian, which describes this graph and formation stability. Simulation and consideration of Nyquist diagram connection with the key points give an indication of the system stability and take steps to change the control laws. Necessary conditions for the formation stability are obtained on the basis of this research method. Research result makes it possible to create local control laws for agents to ensure the stability of motion in the selected
Graph-Based Interactive Bibliographic Information Retrieval Systems
Zhu, Yongjun
2017-01-01
In the big data era, we have witnessed the explosion of scholarly literature. This explosion has imposed challenges to the retrieval of bibliographic information. Retrieval of intended bibliographic information has become challenging due to the overwhelming search results returned by bibliographic information retrieval systems for given input…
Signals and transforms in linear systems analysis
Wasylkiwskyj, Wasyl
2013-01-01
Signals and Transforms in Linear Systems Analysis covers the subject of signals and transforms, particularly in the context of linear systems theory. Chapter 2 provides the theoretical background for the remainder of the text. Chapter 3 treats Fourier series and integrals. Particular attention is paid to convergence properties at step discontinuities. This includes the Gibbs phenomenon and its amelioration via the Fejer summation techniques. Special topics include modulation and analytic signal representation, Fourier transforms and analytic function theory, time-frequency analysis and frequency dispersion. Fundamentals of linear system theory for LTI analogue systems, with a brief account of time-varying systems, are covered in Chapter 4 . Discrete systems are covered in Chapters 6 and 7. The Laplace transform treatment in Chapter 5 relies heavily on analytic function theory as does Chapter 8 on Z -transforms. The necessary background on complex variables is provided in Appendix A. This book is intended to...
Perseo. A flexible subroutine system for plotting of threedimensional graphs
International Nuclear Information System (INIS)
Guasp, J.
1979-01-01
The Perseo subroutine system allows the drawing of three dimensional grafics at the digital plotter Calcomp-936, as well in ordinary perspective, with two variable angles, as in cavalier perspective, with only one angle. It has high versatility and can be used in a very simple way. The drawing of lines uses histograms and allows the correct handling of hidden lines. It has been writen in Fortran V for the Univac-1110 from J.E.N. (author)
Introduction to quantum graphs
Berkolaiko, Gregory
2012-01-01
A "quantum graph" is a graph considered as a one-dimensional complex and equipped with a differential operator ("Hamiltonian"). Quantum graphs arise naturally as simplified models in mathematics, physics, chemistry, and engineering when one considers propagation of waves of various nature through a quasi-one-dimensional (e.g., "meso-" or "nano-scale") system that looks like a thin neighborhood of a graph. Works that currently would be classified as discussing quantum graphs have been appearing since at least the 1930s, and since then, quantum graphs techniques have been applied successfully in various areas of mathematical physics, mathematics in general and its applications. One can mention, for instance, dynamical systems theory, control theory, quantum chaos, Anderson localization, microelectronics, photonic crystals, physical chemistry, nano-sciences, superconductivity theory, etc. Quantum graphs present many non-trivial mathematical challenges, which makes them dear to a mathematician's heart. Work on qu...
Consensus pursuit of heterogeneous multi-agent systems under a directed acyclic graph
Yan, Jing; Guan, Xin-Ping; Luo, Xiao-Yuan
2011-04-01
This paper is concerned with the cooperative target pursuit problem by multiple agents based on directed acyclic graph. The target appears at a random location and moves only when sensed by the agents, and agents will pursue the target once they detect its existence. Since the ability of each agent may be different, we consider the heterogeneous multi-agent systems. According to the topology of the multi-agent systems, a novel consensus-based control law is proposed, where the target and agents are modeled as a leader and followers, respectively. Based on Mason's rule and signal flow graph analysis, the convergence conditions are provided to show that the agents can catch the target in a finite time. Finally, simulation studies are provided to verify the effectiveness of the proposed approach.
Zhang, Huaguang; Feng, Tao; Yang, Guang-Hong; Liang, Hongjing
2015-07-01
In this paper, the inverse optimal approach is employed to design distributed consensus protocols that guarantee consensus and global optimality with respect to some quadratic performance indexes for identical linear systems on a directed graph. The inverse optimal theory is developed by introducing the notion of partial stability. As a result, the necessary and sufficient conditions for inverse optimality are proposed. By means of the developed inverse optimal theory, the necessary and sufficient conditions are established for globally optimal cooperative control problems on directed graphs. Basic optimal cooperative design procedures are given based on asymptotic properties of the resulting optimal distributed consensus protocols, and the multiagent systems can reach desired consensus performance (convergence rate and damping rate) asymptotically. Finally, two examples are given to illustrate the effectiveness of the proposed methods.
Cheng, Shaobo; Zhang, Dong; Deng, Shiqing; Li, Xing; Li, Jun; Tan, Guotai; Zhu, Yimei; Zhu, Jing
2018-04-01
Topological defects and their interactions often arouse multiple types of emerging phenomena from edge states in Skyrmions to disclination pairs in liquid crystals. In hexagonal manganites, partial edge dislocations, a prototype topological defect, are ubiquitous and they significantly alter the topologically protected domains and their behaviors. Herein, combining electron microscopy experiment and graph theory analysis, we report a systematic study of the connections and configurations of domains in this dislocation embedded system. Rules for domain arrangement are established. The dividing line between domains, which can be attributed by the strain field of dislocations, is accurately described by a genus model from a higher dimension in the graph theory. Our results open a door for the understanding of domain patterns in topologically protected multiferroic systems.
Automatic micropropagation of plants--the vision-system: graph rewriting as pattern recognition
Schwanke, Joerg; Megnet, Roland; Jensch, Peter F.
1993-03-01
The automation of plant-micropropagation is necessary to produce high amounts of biomass. Plants have to be dissected on particular cutting-points. A vision-system is needed for the recognition of the cutting-points on the plants. With this background, this contribution is directed to the underlying formalism to determine cutting-points on abstract-plant models. We show the usefulness of pattern recognition by graph-rewriting along with some examples in this context.
Zhang, L.-C.; Patone, M.
2017-01-01
We synthesise the existing theory of graph sampling. We propose a formal definition of sampling in finite graphs, and provide a classification of potential graph parameters. We develop a general approach of Horvitz–Thompson estimation to T-stage snowball sampling, and present various reformulations of some common network sampling methods in the literature in terms of the outlined graph sampling theory.
International Nuclear Information System (INIS)
Golovanov, M.N.; Zyuzin, N.N.; Levin, G.L.; Chesnokov, A.N.
1987-01-01
An approach for estimation of reliability factors of complex reserved systems at early stages of development using the method of imitating simulation is considered. Different types of models, their merits and lacks are given. Features of in-core monitoring systems and advosability of graph model and graph theory element application for estimating reliability of such systems are shown. The results of investigation of the reliability factors of the reactor monitoring, control and core local protection subsystem are shown
Janssen, P.; Stouffs, R.M.F.; Chaszar, A.T.; Boeykens, S.; Toth, B.
2012-01-01
This paper describes the use of property graphs for mapping data between AEC software tools, which are not linked by common data formats and/or other interoperability measures. The intention of introducing this in practice, education and research is to facilitate the use of diverse, non-integrated
Hewitt, Robin; Gobbi, Alberto; Lee, Man-Ling
2005-01-01
Relational databases are the current standard for storing and retrieving data in the pharmaceutical and biotech industries. However, retrieving data from a relational database requires specialized knowledge of the database schema and of the SQL query language. At Anadys, we have developed an easy-to-use system for searching and reporting data in a relational database to support our drug discovery project teams. This system is fast and flexible and allows users to access all data without having to write SQL queries. This paper presents the hierarchical, graph-based metadata representation and SQL-construction methods that, together, are the basis of this system's capabilities.
GDSCalc: A Web-Based Application for Evaluating Discrete Graph Dynamical Systems.
Elmeligy Abdelhamid, Sherif H; Kuhlman, Chris J; Marathe, Madhav V; Mortveit, Henning S; Ravi, S S
2015-01-01
Discrete dynamical systems are used to model various realistic systems in network science, from social unrest in human populations to regulation in biological networks. A common approach is to model the agents of a system as vertices of a graph, and the pairwise interactions between agents as edges. Agents are in one of a finite set of states at each discrete time step and are assigned functions that describe how their states change based on neighborhood relations. Full characterization of state transitions of one system can give insights into fundamental behaviors of other dynamical systems. In this paper, we describe a discrete graph dynamical systems (GDSs) application called GDSCalc for computing and characterizing system dynamics. It is an open access system that is used through a web interface. We provide an overview of GDS theory. This theory is the basis of the web application; i.e., an understanding of GDS provides an understanding of the software features, while abstracting away implementation details. We present a set of illustrative examples to demonstrate its use in education and research. Finally, we compare GDSCalc with other discrete dynamical system software tools. Our perspective is that no single software tool will perform all computations that may be required by all users; tools typically have particular features that are more suitable for some tasks. We situate GDSCalc within this space of software tools.
Results of a directed graph and fault tree assessment of a MC and A system
International Nuclear Information System (INIS)
Gilman, F.M.; Lambert, H.E.; Lim, J.J.
1978-01-01
An assessment of the effectiveness of the Material Control and Accounting System (MC and A) in a hypothetical nuclear facility, the TEST BED is presented. The key in assessing the TEST BED is the generation of adversary event sets. The adversary event sets are generated and analyzed by a directed graph (digraph) and fault tree procedure. Although the TEST BED is a system hardened against SNM theft, the assessment of the TEST BED finds several major weaknesses, and also indicates possible modifications to correct these weaknesses
Energy Technology Data Exchange (ETDEWEB)
Lothian, Joshua [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Powers, Sarah S. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Sullivan, Blair D. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Baker, Matthew B. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Schrock, Jonathan [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Poole, Stephen W. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)
2013-10-01
The benchmarking effort within the Extreme Scale Systems Center at Oak Ridge National Laboratory seeks to provide High Performance Computing benchmarks and test suites of interest to the DoD sponsor. The work described in this report is a part of the effort focusing on graph generation. A previously developed benchmark, SystemBurn, allowed the emulation of different application behavior profiles within a single framework. To complement this effort, similar capabilities are desired for graph-centric problems. This report examines existing synthetic graph generator implementations in preparation for further study on the properties of their generated synthetic graphs.
Brouwer, A.E.; Haemers, W.H.; Brouwer, A.E.; Haemers, W.H.
2012-01-01
This chapter presents some simple results on graph spectra.We assume the reader is familiar with elementary linear algebra and graph theory. Throughout, J will denote the all-1 matrix, and 1 is the all-1 vector.
evelopment of a boiling water reactor fault diagnostic system with a signed directed graph method
International Nuclear Information System (INIS)
Chen, M.; Yu, C.C.; Liou, C.T.; Liao, L.Y.
1990-01-01
The fault diagnostic system for a nuclear power reactor is expected to be a useful decision support system for the operators during transients and accident conditions. A considerable research effort has been devoted to the development of automated fault diagnostic systems. One major approach, which has been widely used in chemical engineering, is to identify the possible causes of process disturbance using a logic-oriented method called signed directed graph (SDG). A knowledge based system was developed with the rules derived from the SDG representation. The SDG for the Chinshan nuclear power plant, which is a typical boiling water reactor, is established. The personal consultant system is used as the expert system development tool in this paper
Darboux transformation for two-level system
Energy Technology Data Exchange (ETDEWEB)
Bagrov, V.; Baldiotti, M.; Gitman, D.; Shamshutdinova, V. [Instituto de Fisica, Universidade de Sao Paulo, Caixa Postal 66318-CEP, 05315-970 Sao Paulo, S.P. (Brazil)
2005-06-01
We develop the Darboux procedure for the case of the two-level system. In particular, it is demonstrated that one can construct the Darboux intertwining operator that does not violate the specific structure of the equations of the two-level system, transforming only one real potential into another real potential. We apply the obtained Darboux transformation to known exact solutions of the two-level system. Thus, we find three classes of new solutions for the two-level system and the corresponding new potentials that allow such solutions. (Abstract Copyright [2005], Wiley Periodicals, Inc.)
Energy Technology Data Exchange (ETDEWEB)
Andoulsi, R.
2001-12-01
We present in this thesis a study of a class of photovoltaic system by a bond graph approach. This study concerns the modelling, the analysis and the control of some configurations including PV generator, DC/DC converters and DC motor-pumps. The modelling of the different elements of a photovoltaic system is an indispensable stage that must precede all application of sizing, identification or simulation. However, theses PV systems are of hybrid type and their modelling is complex. It is why we use a unified modelling approach based on the bond graph technique. This methodology is completely systematic and has a sufficient flexibility for allowing the introduction of different components in the system. In the first chapter, we recall the principle of functioning of a photovoltaic generator and we treat mainly the MPPT (Maximum Power Point Tracking) working. In the second chapter, we elaborate bond graph models of various photovoltaic system configurations. For the PV source, we elaborate, in a first stage, a complete model taking into account the various physical phenomena influencing the quality of the PV source. In a second stage, we deduce a reduced bond graph model more easy to use for analysis and control purposes. For the DC/DC converters, we recall the bond graph modelling of switching elements and the average bond graph of the DC/DC converters developed in the literature. Thus, we deduce the bond graphs models of the various DC/DC converters to be used. The third chapter presents a dynamic study of some configurations stability in linear procedure. In the fourth chapter, we study the feasibility of non linear controllers by input/output linearization for some configurations of PV systems. In this study, we use the concept of inverse bond graph to determine, by a bond graph approach, the expression of the control input and the nature of the stability of the internal dynamics (dynamics of zeros). The fifth chapter is dedicated for the presentation of some
Proxy Graph: Visual Quality Metrics of Big Graph Sampling.
Nguyen, Quan Hoang; Hong, Seok-Hee; Eades, Peter; Meidiana, Amyra
2017-06-01
Data sampling has been extensively studied for large scale graph mining. Many analyses and tasks become more efficient when performed on graph samples of much smaller size. The use of proxy objects is common in software engineering for analysis and interaction with heavy objects or systems. In this paper, we coin the term 'proxy graph' and empirically investigate how well a proxy graph visualization can represent a big graph. Our investigation focuses on proxy graphs obtained by sampling; this is one of the most common proxy approaches. Despite the plethora of data sampling studies, this is the first evaluation of sampling in the context of graph visualization. For an objective evaluation, we propose a new family of quality metrics for visual quality of proxy graphs. Our experiments cover popular sampling techniques. Our experimental results lead to guidelines for using sampling-based proxy graphs in visualization.
Directory of Open Access Journals (Sweden)
Sagar Indurkhya
Full Text Available ODE simulations of chemical systems perform poorly when some of the species have extremely low concentrations. Stochastic simulation methods, which can handle this case, have been impractical for large systems due to computational complexity. We observe, however, that when modeling complex biological systems: (1 a small number of reactions tend to occur a disproportionately large percentage of the time, and (2 a small number of species tend to participate in a disproportionately large percentage of reactions. We exploit these properties in LOLCAT Method, a new implementation of the Gillespie Algorithm. First, factoring reaction propensities allows many propensities dependent on a single species to be updated in a single operation. Second, representing dependencies between reactions with a bipartite graph of reactions and species requires only storage for reactions, rather than the required for a graph that includes only reactions. Together, these improvements allow our implementation of LOLCAT Method to execute orders of magnitude faster than currently existing Gillespie Algorithm variants when simulating several yeast MAPK cascade models.
Indurkhya, Sagar; Beal, Jacob
2010-01-01
ODE simulations of chemical systems perform poorly when some of the species have extremely low concentrations. Stochastic simulation methods, which can handle this case, have been impractical for large systems due to computational complexity. We observe, however, that when modeling complex biological systems: (1) a small number of reactions tend to occur a disproportionately large percentage of the time, and (2) a small number of species tend to participate in a disproportionately large percentage of reactions. We exploit these properties in LOLCAT Method, a new implementation of the Gillespie Algorithm. First, factoring reaction propensities allows many propensities dependent on a single species to be updated in a single operation. Second, representing dependencies between reactions with a bipartite graph of reactions and species requires only storage for reactions, rather than the required for a graph that includes only reactions. Together, these improvements allow our implementation of LOLCAT Method to execute orders of magnitude faster than currently existing Gillespie Algorithm variants when simulating several yeast MAPK cascade models. PMID:20066048
Dynamic Allocation of SPM Based on Time-Slotted Cache Conflict Graph for System Optimization
Wu, Jianping; Ling, Ming; Zhang, Yang; Mei, Chen; Wang, Huan
This paper proposes a novel dynamic Scratch-pad Memory allocation strategy to optimize the energy consumption of the memory sub-system. Firstly, the whole program execution process is sliced into several time slots according to the temporal dimension; thereafter, a Time-Slotted Cache Conflict Graph (TSCCG) is introduced to model the behavior of Data Cache (D-Cache) conflicts within each time slot. Then, Integer Nonlinear Programming (INP) is implemented, which can avoid time-consuming linearization process, to select the most profitable data pages. Virtual Memory System (VMS) is adopted to remap those data pages, which will cause severe Cache conflicts within a time slot, to SPM. In order to minimize the swapping overhead of dynamic SPM allocation, a novel SPM controller with a tightly coupled DMA is introduced to issue the swapping operations without CPU's intervention. Last but not the least, this paper discusses the fluctuation of system energy profit based on different MMU page size as well as the Time Slot duration quantitatively. According to our design space exploration, the proposed method can optimize all of the data segments, including global data, heap and stack data in general, and reduce the total energy consumption by 27.28% on average, up to 55.22% with a marginal performance promotion. And comparing to the conventional static CCG (Cache Conflicts Graph), our approach can obtain 24.7% energy profit on average, up to 30.5% with a sight boost in performance.
Indurkhya, Sagar; Beal, Jacob
2010-01-06
ODE simulations of chemical systems perform poorly when some of the species have extremely low concentrations. Stochastic simulation methods, which can handle this case, have been impractical for large systems due to computational complexity. We observe, however, that when modeling complex biological systems: (1) a small number of reactions tend to occur a disproportionately large percentage of the time, and (2) a small number of species tend to participate in a disproportionately large percentage of reactions. We exploit these properties in LOLCAT Method, a new implementation of the Gillespie Algorithm. First, factoring reaction propensities allows many propensities dependent on a single species to be updated in a single operation. Second, representing dependencies between reactions with a bipartite graph of reactions and species requires only storage for reactions, rather than the required for a graph that includes only reactions. Together, these improvements allow our implementation of LOLCAT Method to execute orders of magnitude faster than currently existing Gillespie Algorithm variants when simulating several yeast MAPK cascade models.
Toward transformational carbon capture systems
Energy Technology Data Exchange (ETDEWEB)
Miller, David C. [National Energy Technology Laboratory, U.S. Dept. of Energy, Pittsburgh PA (United States); Litynski, John T. [Office of Fossil Energy, U.S. Dept. of Energy, Washington DC (United States); Brickett, Lynn A. [National Energy Technology Laboratory, U.S. Dept. of Energy, Pittsburgh PA (United States); Morreale, Bryan D. [National Energy Technology Laboratory, U.S. Dept. of Energy, Pittsburgh PA (United States)
2015-10-28
This paper will briefly review the history and current state of Carbon Capture and Storage (CCS) research and development and describe the technical barriers to carbon capture. it will argue forcefully for a new approach to R&D, which leverages both simulation and physical systems at the laboratory and pilot scales to more rapidly move the best technoogies forward, prune less advantageous approaches, and simultaneously develop materials and processes.
Systems Thinking for Transformational Change in Health
Willis, Cameron D.; Best, Allan; Riley, Barbara; Herbert, Carol P.; Millar, John; Howland, David
2014-01-01
Incremental approaches to introducing change in Canada's health systems have not sufficiently improved the quality of services and outcomes. Further progress requires 'large system transformation', considered to be the systematic effort to generate coordinated change across organisations sharing a common vision and goal. This essay draws on…
Dead sea transform fault system reviews
Garfunkel, Zvi; Kagan, Elisa
2014-01-01
The Dead Sea transform is an active plate boundary connecting the Red Sea seafloor spreading system to the Arabian-Eurasian continental collision zone. Its geology and geophysics provide a natural laboratory for investigation of the surficial, crustal and mantle processes occurring along transtensional and transpressional transform fault domains on a lithospheric scale and related to continental breakup. There have been many detailed and disciplinary studies of the Dead Sea transform fault zone during the last?20 years and this book brings them together.This book is an updated comprehensive coverage of the knowledge, based on recent studies of the tectonics, structure, geophysics, volcanism, active tectonics, sedimentology and paleo and modern climate of the Dead Sea transform fault zone. It puts together all this new information and knowledge in a coherent fashion.
International Nuclear Information System (INIS)
Lucas, B.
1994-05-01
After having recalled the usual diagnosis techniques (failure index, decision tree) and those based on an artificial intelligence approach, the author reports a research aimed at exploring the knowledge and model generation technique. He focuses on the design of an aid to model generation tool and aid-to-diagnosis tool. The bond graph technique is shown to be adapted to the aid to model generation, and is then adapted to the aid to diagnosis. The developed tool is applied to three projects: DIADEME (a diagnosis system based on physical model), the improvement of the SEXTANT diagnosis system (an expert system for transient analysis), and the investigation on an Ariane 5 launcher component. Notably, the author uses the Reiter and Greiner algorithm
RGFinder: a system for determining semantically related genes using GO graph minimum spanning tree.
Taha, Kamal
2015-01-01
Biologists often need to know the set S' of genes that are the most functionally and semantically related to a given set S of genes. For determining the set S', most current gene similarity measures overlook the structural dependencies among the Gene Ontology (GO) terms annotating the set S, which may lead to erroneous results. We introduce in this paper a biological search engine called RGFinder that considers the structural dependencies among GO terms by employing the concept of existence dependency. RGFinder assigns a weight to each edge in GO graph to represent the degree of relatedness between the two GO terms connected by the edge. The value of the weight is determined based on the following factors: 1) type of the relation represented by the edge (e.g., an "is-a" relation is assigned a different weight than a "part-of" relation), 2) the functional relationship between the two GO terms connected by the edge, and 3) the string-substring relationship between the names of the two GO terms connected by the edge. RGFinder then constructs a minimum spanning tree of GO graph based on these weights. In the framework of RGFinder, the set S' is annotated to the GO terms located at the lowest convergences of the subtree of the minimum spanning tree that passes through the GO terms annotating set S. We evaluated RGFinder experimentally and compared it with four gene set enrichment systems. Results showed marked improvement.
Tang, Xiaolan; Hong, Donghui; Chen, Wenlong
2017-06-08
Existing studies on data acquisition in vehicular networks often take the mobile vehicular nodes as data carriers. However, their autonomous movements, limited resources and security risks impact the quality of services. In this article, we propose a data acquisition model using stable matching of bipartite graph in cooperative vehicle-infrastructure systems, namely, DAS. Contents are distributed to roadside units, while vehicular nodes support supplementary storage. The original distribution problem is formulated as a stable matching problem of bipartite graph, where the data and the storage cells compose two sides of vertices. Regarding the factors relevant with the access ratio and delay, the preference rankings for contents and roadside units are calculated, respectively. With a multi-replica preprocessing algorithm to handle the potential one-to-many mapping, the matching problem is addressed in polynomial time. In addition, vehicular nodes carry and forward assistant contents to deliver the failed packets because of bandwidth competition. Furthermore, an incentive strategy is put forward to boost the vehicle cooperation and to achieve a fair bandwidth allocation at roadside units. Experiments show that DAS achieves a high access ratio and a small storage cost with an acceptable delay.
Directory of Open Access Journals (Sweden)
L. V. Savkin
2015-01-01
Full Text Available One of the problems in implementation of the multipurpose complete systems based on the reconfigurable computing fields (RCF is the problem of optimum redistribution of logicalarithmetic resources in growing scope of functional tasks. Irrespective of complexity, all of them are transformed into an orgraph, which functional and topological structure is appropriately imposed on the RCF based, as a rule, on the field programmable gate array (FPGA.Due to limitation of the hardware configurations and functions realized by means of the switched logical blocks (SLB, the abovementioned problem becomes even more critical when there is a need, within the strictly allocated RCF fragment, to realize even more complex challenge in comparison with the problem which was solved during the previous computing step. In such cases it is possible to speak about graphs of big dimensions with respect to allocated RCF fragment.The article considers this problem through development of diagnostic algorithms to implement diagnostics and control of an onboard control complex of the spacecraft using RCF. It gives examples of big graphs arising with respect to allocated RCF fragment when forming the hardware levels of a diagnostic model, which, in this case, is any hardware-based algorithm of diagnostics in RCF.The article reviews examples of arising big graphs when forming the complicated diagnostic models due to drastic difference in formation of hardware levels on closely located RCF fragments. It also pays attention to big graphs emerging when the multichannel diagnostic models are formed.Three main ways to solve the problem of big graphs with respect to allocated RCF fragment are given. These are: splitting the graph into fragments, use of pop-up windows with relocating and memorizing intermediate values of functions of high hardware levels of diagnostic models, and deep adaptive update of diagnostic model.It is shown that the last of three ways is the most efficient
Availability estimation of repairable systems using reliability graph with general gates (RGGG)
International Nuclear Information System (INIS)
Goh, Gyoung Tae
2009-02-01
By performing risk analysis, we may obtain sufficient information about the system to redesign it and lower the probability of the occurrence of an accident or mitigate the ensuing consequences. The concept of reliability is widely used to express risk of systems. The reliability is used for non-repairable systems. But nuclear power plant systems are repairable systems. With repairable systems, repairable components can improve the availability of a system because faults that are generated in components can be recovered. Hence, the availability of the system is more proper concept in case of repairable systems. Reliability graph with general gate (RGGG) is one of the system reliability analysis methods. The RGGG is a very intuitiveness method as compared with other methods. But the RGGG has not been applied to repairable systems yet. The objective of this study is to extend the RGGG in order to enable one to analyze repairable system. Determining the probability table for each node is a critical process to calculate the system availability in the RGGG method. Therefore finding the proper algorithms and making probability tables in various situations are the major a part of this study. The other part is an example of applying RGGG method to a real system. We find the proper algorithms and probability tables for independent repairable systems, dependent series repairable systems, and k-out-of-m (K/M) redundant parallel repairable systems in this study. We can evaluate the availability of real system using these probability tables. An example for a real system is shown in the latter part of this study. For the purpose of this analysis, the charging pumps subsystem of the chemical and volume control system (CVCS) was selected. The RGGG method extended for repairable systems has the same characteristic of intuitiveness as the original RGGG method and we can confirm that the availability analysis result from the repairable RGGG method is exact
Optimal perturbations for nonlinear systems using graph-based optimal transport
Grover, Piyush; Elamvazhuthi, Karthik
2018-06-01
We formulate and solve a class of finite-time transport and mixing problems in the set-oriented framework. The aim is to obtain optimal discrete-time perturbations in nonlinear dynamical systems to transport a specified initial measure on the phase space to a final measure in finite time. The measure is propagated under system dynamics in between the perturbations via the associated transfer operator. Each perturbation is described by a deterministic map in the measure space that implements a version of Monge-Kantorovich optimal transport with quadratic cost. Hence, the optimal solution minimizes a sum of quadratic costs on phase space transport due to the perturbations applied at specified times. The action of the transport map is approximated by a continuous pseudo-time flow on a graph, resulting in a tractable convex optimization problem. This problem is solved via state-of-the-art solvers to global optimality. We apply this algorithm to a problem of transport between measures supported on two disjoint almost-invariant sets in a chaotic fluid system, and to a finite-time optimal mixing problem by choosing the final measure to be uniform. In both cases, the optimal perturbations are found to exploit the phase space structures, such as lobe dynamics, leading to efficient global transport. As the time-horizon of the problem is increased, the optimal perturbations become increasingly localized. Hence, by combining the transfer operator approach with ideas from the theory of optimal mass transportation, we obtain a discrete-time graph-based algorithm for optimal transport and mixing in nonlinear systems.
Energy Technology Data Exchange (ETDEWEB)
Nekrasov, A M; Lazarenko, T V; Zlatopol' skiy, A N
1982-01-01
The dynamics for the indicators of daily graphs of consumption of electricity in the USSR is the result of interaction of a large number of different-directed factors. Among them in recent years relatively greater influence has come from a change in the structure of consumers of each unified energy system and especially the USSR energy system with the unified energy systems with inclusion in it of large unified energy systems, whose time is shifted on time zones, and intensification of electrical bonds between the unified energy systems. The factor of expansion of the USSR energy system on the territory of the country because of the inclusion of new unified energy systems resulted in condensation of the daily graphs for consumption of electricity of the USSR energy system: increase in the coefficient of filling the daily graphs, their peak and semipeak parts, as well as coefficient of minimum consumption. Taking into consideration the program for further development of the country presented in the main trends for economic and social development of the USSR for 1981-1985 and for the period up to the year 1990, for the current and the near five-year plan, one can expect preservation of the revealed trends for dynamics of the indicators of the daily graphs for electricity consumption of the USSR energy system.
Transforming Power Systems Through Global Collaboration
Energy Technology Data Exchange (ETDEWEB)
2017-06-01
Ambitious and integrated policy and regulatory frameworks are crucial to achieve power system transformation. The 21st Century Power Partnership -- a multilateral initiative of the Clean Energy Ministerial -- serves as a platform for public-private collaboration to advance integrated solutions for the large-scale deployment of renewable energy in combination with energy efficiency and grid modernization.
Transforming Power Systems through Global Collaboration
Energy Technology Data Exchange (ETDEWEB)
None, None
2016-04-01
Ambitious and integrated policy and regulatory frameworks are crucial to achieve power system transformation. The 21st Century Power Partnership -- a multilateral initiative of the Clean Energy Ministerial -- serves as a platform for public-private collaboration to advance integrated solutions for the large-scale deployment of renewable energy in combination with energy efficiency and grid modernization.
Matching of renewable source of energy generation graphs and electrical load in local energy system
Lezhniuk, Petro; Komar, Vyacheslav; Sobchuk, Dmytro; Kravchuk, Sergiy; Kacejko, Piotr; Zavidsky, Vladislav
2017-08-01
The paper contains the method of matching generation graph of photovoltaic electric stations and consumers. Characteristic feature of this method is the application of morphometric analysis for assessment of non-uniformity of the integrated graph of energy supply, optimal coefficients of current distribution, that enables by mean of refining the powers, transferring in accordance with the graph , to provide the decrease of electric energy losses in the grid and transport task, as the optimization tool.
Koerts, Filip; Bürger, Mathias; van der Schaft, Abraham; De Persis, Claudio
2017-01-01
In this paper, we study parameter-independent stability in qualitatively heterogeneous passive networked systems containing damped and undamped nodes. Given the graph topology and a set of damped nodes, we ask if output consensus is achieved for all system parameter values. For given parameter
Directory of Open Access Journals (Sweden)
Krzysztof Małecki
2017-12-01
Full Text Available A complex system is a set of mutually interacting elements for which it is possible to construct a mathematical model. This article focuses on the cellular automata theory and the graph theory in order to compare various types of cellular automata and to analyse applications of graph structures together with cellular automata. It proposes a graph cellular automaton with a variable configuration of cells and relation-based neighbourhoods (r–GCA. The developed mechanism enables modelling of phenomena found in complex systems (e.g., transport networks, urban logistics, social networks taking into account the interaction between the existing objects. As an implementation example, modelling of moving vehicles has been made and r–GCA was compared to the other cellular automata models simulating the road traffic and used in the computer simulation process.
DEFF Research Database (Denmark)
Vestergaard, Preben Dahl; Hartnell, Bert L.
2006-01-01
There are many results dealing with the problem of decomposing a fixed graph into isomorphic subgraphs. There has also been work on characterizing graphs with the property that one can delete the edges of a number of edge disjoint copies of the subgraph and, regardless of how that is done, the gr...
Transformation of health system in Ecuador
Directory of Open Access Journals (Sweden)
Wilson Giovanni Jiménez Barbosa
2017-05-01
Full Text Available Objective: To describe the transformations of the structure of the health system in Ecuador, taking into account the constitutional and policy context of that country, and to reflect on the historical context in which it occurred and its implications for the welfare of the people from Ecuador. Materials and methods: A bibliographic review was made, beginning with the regulations of Ecuador since the Constitution of 1979, where health is considered as a right, passing by the Organic Law of Health, the Social Security Act, among others, including the last reform of the Constitution in 2008. Results: The transformation of the Health System of Ecuador is the result of the action of economic and political forces, both internal and external, that have affected this country throughout the studied period.
Transformation of health system in Ecuador
Wilson Giovanni Jiménez Barbosa; María Luisa Granda Kuffo; Diana Margoth Ávila Guzmán; Leidy Johanna Cruz Díaz; Julián Camilo Flórez Parra; Luisa Silvana Mejía; Diana Carolina Vargas Suárez
2017-01-01
Objective: To describe the transformations of the structure of the health system in Ecuador, taking into account the constitutional and policy context of that country, and to reflect on the historical context in which it occurred and its implications for the welfare of the people from Ecuador. Materials and methods: A bibliographic review was made, beginning with the regulations of Ecuador since the Constitution of 1979, where health is considered as a right, passing by the Organic Law of Hea...
Transforming Systems Engineering through Model Centric Engineering
2017-08-08
Contract No. HQ0034-13-D-0004 Report No. SERC-2017-TR-110 Date: August 8, 2017 Transforming Systems Engineering through Model-Centric... Engineering Technical Report SERC-2017-TR-110 Update: August 8, 2017 Principal Investigator: Mark Blackburn, Stevens Institute of Technology Co...Evangelista Sponsor: U.S. Army Armament Research, Development and Engineering Center (ARDEC), Office of the Deputy Assistant Secretary of Defense for
Quantum walks on quotient graphs
International Nuclear Information System (INIS)
Krovi, Hari; Brun, Todd A.
2007-01-01
A discrete-time quantum walk on a graph Γ is the repeated application of a unitary evolution operator to a Hilbert space corresponding to the graph. If this unitary evolution operator has an associated group of symmetries, then for certain initial states the walk will be confined to a subspace of the original Hilbert space. Symmetries of the original graph, given by its automorphism group, can be inherited by the evolution operator. We show that a quantum walk confined to the subspace corresponding to this symmetry group can be seen as a different quantum walk on a smaller quotient graph. We give an explicit construction of the quotient graph for any subgroup H of the automorphism group and illustrate it with examples. The automorphisms of the quotient graph which are inherited from the original graph are the original automorphism group modulo the subgroup H used to construct it. The quotient graph is constructed by removing the symmetries of the subgroup H from the original graph. We then analyze the behavior of hitting times on quotient graphs. Hitting time is the average time it takes a walk to reach a given final vertex from a given initial vertex. It has been shown in earlier work [Phys. Rev. A 74, 042334 (2006)] that the hitting time for certain initial states of a quantum walks can be infinite, in contrast to classical random walks. We give a condition which determines whether the quotient graph has infinite hitting times given that they exist in the original graph. We apply this condition for the examples discussed and determine which quotient graphs have infinite hitting times. All known examples of quantum walks with hitting times which are short compared to classical random walks correspond to systems with quotient graphs much smaller than the original graph; we conjecture that the existence of a small quotient graph with finite hitting times is necessary for a walk to exhibit a quantum speedup
Hydraulic oil control system for transformer stations
International Nuclear Information System (INIS)
Truong, P.
2002-01-01
'Full text:' Electrical oil control systems are commonly used to contain large volumes of spilled oil in transformer stations. Specially calibrated floats, some of which are designed to float only in oil and others only in water, are used in combination with a pump to contain oil at the catch basin below a transformer station.This electrical control system requires frequent maintenance and inspections to ensure the electrical system is not affected by any electrical surges. Also the floats need to be inspected and cleaned frequently to prevent oil or grit build up that may affect the systems' ability to contain oil.Recognizing the limitations of electrical oil control systems, Hydro One is investigating alternative control systems. A hydraulic oil control system is being investigated as an alternative which can backup oil in a containment area while allowing any water entering the containment area to pass through. Figure 1 shows a schematic of a bench-top model tested at Ryerson University. Oil and water separation occurs within the double-piped column. Oil and water are allowed to enter the external pipe column but only water is allowed to exit the internal pipe column. The internal pipe column is designed to generate enough hydrostatic pressure to ensure the oil is contained in the external pipe column.The hydraulic oil control system provides a reliable control mechanism and requires less maintenance compared to that of the electrical control system. Since the hydraulic oil control system has no moving parts, nor would any parts that require electricity, it is not affected by electrical surges such as lightening.The maintenance requirements of the hydraulic oil control system are: the removal of any oil and grit from the catch basin, and the occasional visual inspection for any crack or clogs in the system. (author)
Identification problems in linear transformation system
International Nuclear Information System (INIS)
Delforge, Jacques.
1975-01-01
An attempt was made to solve the theoretical and numerical difficulties involved in the identification problem relative to the linear part of P. Delattre's theory of transformation systems. The theoretical difficulties are due to the very important problem of the uniqueness of the solution, which must be demonstrated in order to justify the value of the solution found. Simple criteria have been found when measurements are possible on all the equivalence classes, but the problem remains imperfectly solved when certain evolution curves are unknown. The numerical difficulties are of two kinds: a slow convergence of iterative methods and a strong repercussion of numerical and experimental errors on the solution. In the former case a fast convergence was obtained by transformation of the parametric space, while in the latter it was possible, from sensitivity functions, to estimate the errors, to define and measure the conditioning of the identification problem then to minimize this conditioning as a function of the experimental conditions [fr
Matsutani, Shigeki; Sato, Iwao
2017-09-01
In the previous report (Matsutani and Suzuki, 2000 [21]), by proposing the mechanism under which electric conductivity is caused by the activational hopping conduction with the Wigner surmise of the level statistics, the temperature-dependent of electronic conductivity of a highly disordered carbon system was evaluated including apparent metal-insulator transition. Since the system consists of small pieces of graphite, it was assumed that the reason why the level statistics appears is due to the behavior of the quantum chaos in each granular graphite. In this article, we revise the assumption and show another origin of the Wigner surmise, which is more natural for the carbon system based on a recent investigation of graph zeta function in graph theory. Our method can be applied to the statistical treatment of the electronic properties of the randomized molecular system in general.
Robot Skills for Transformable Manufacturing Systems
DEFF Research Database (Denmark)
Pedersen, Mikkel Rath
Efficient, transformable production systems need robots that are flexible and effortlessly repurposed or reconfigured. The present dissertation argues that this can be achieved through the implementation and use of general, object-centered robot skills. In this dissertation, we focus on the design...... autonomously, exactly when it is needed. It is the firm belief of this researcher that industrial robotics need to go in a direction towards what is outlined in this dissertation, both in academia and in the industry. In order for manufacturing companies to remain competitive, robotics is the definite way...
Energy Technology Data Exchange (ETDEWEB)
Sergyeyev, Artur [Mathematical Institute, Silesian University in Opava, Na RybnIcku 1, 746 01 Opava (Czech Republic); Blaszak, Maciej [Institute of Physics, A Mickiewicz University, Umultowska 85, 61-614 Poznan (Poland)], E-mail: Artur.Sergyeyev@math.slu.cz, E-mail: blaszakm@amu.edu.pl
2008-03-14
We present a multiparameter generalization of the Staeckel transform (the latter is also known as the coupling-constant metamorphosis) and show that under certain conditions this generalized Staeckel transform preserves Liouville integrability, noncommutative integrability and superintegrability. The corresponding transformation for the equations of motion proves to be nothing but a reciprocal transformation of a special form, and we investigate the properties of this reciprocal transformation. Finally, we show that the Hamiltonians of the systems possessing separation curves of apparently very different form can be related through a suitably chosen generalized Staeckel transform.
Tailored Random Graph Ensembles
International Nuclear Information System (INIS)
Roberts, E S; Annibale, A; Coolen, A C C
2013-01-01
Tailored graph ensembles are a developing bridge between biological networks and statistical mechanics. The aim is to use this concept to generate a suite of rigorous tools that can be used to quantify and compare the topology of cellular signalling networks, such as protein-protein interaction networks and gene regulation networks. We calculate exact and explicit formulae for the leading orders in the system size of the Shannon entropies of random graph ensembles constrained with degree distribution and degree-degree correlation. We also construct an ergodic detailed balance Markov chain with non-trivial acceptance probabilities which converges to a strictly uniform measure and is based on edge swaps that conserve all degrees. The acceptance probabilities can be generalized to define Markov chains that target any alternative desired measure on the space of directed or undirected graphs, in order to generate graphs with more sophisticated topological features.
Directory of Open Access Journals (Sweden)
Ming Yu
2015-12-01
Full Text Available This article proposes a sequential fault diagnosis method to handle asynchronous distinct faults using diagnostic hybrid bond graph and composite harmony search. The faults under consideration include fault mode, abrupt fault, and intermittent fault. The faults can occur in different time instances, which add to the difficulty of decision making for fault diagnosis. This is because the earlier occurred fault can exhibit fault symptom which masks the fault symptom of latter occurred fault. In order to solve this problem, a sequential identification algorithm is developed in which the identification task is reactivated based on two conditions. The first condition is that the latter occurred fault has at least one inconsistent coherence vector element which is consistent in coherence vector of the earlier occurred fault, and the second condition is that the existing fault coherence vector has the ability to hide other faults and the second-level residual exceeds the threshold. A new composite harmony search which is capable of handling continuous variables and binary variables simultaneously is proposed for identification purpose. Experiments on a mobile robot system are conducted to assess the proposed sequential fault diagnosis algorithm.
PyDecay/GraphPhys: A Unified Language and Storage System for Particle Decay Process Descriptions
Energy Technology Data Exchange (ETDEWEB)
Dunietz, Jesse N.; /MIT /SLAC
2011-06-22
To ease the tasks of Monte Carlo (MC) simulation and event reconstruction (i.e. inferring particle-decay events from experimental data) for long-term BaBar data preservation and analysis, the following software components have been designed: a language ('GraphPhys') for specifying decay processes, common to both simulation and data analysis, allowing arbitrary parameters on particles, decays, and entire processes; an automated visualization tool to show graphically what decays have been specified; and a searchable database storage mechanism for decay specifications. Unlike HepML, a proposed XML standard for HEP metadata, the specification language is designed not for data interchange between computer systems, but rather for direct manipulation by human beings as well as computers. The components are interoperable: the information parsed from files in the specification language can easily be rendered as an image by the visualization package, and conversion between decay representations was implemented. Several proof-of-concept command-line tools were built based on this framework. Applications include building easier and more efficient interfaces to existing analysis tools for current projects (e.g. BaBar/BESII), providing a framework for analyses in future experimental settings (e.g. LHC/SuperB), and outreach programs that involve giving students access to BaBar data and analysis tools to give them a hands-on feel for scientific analysis.
Wang, Wei; Wen, Changyun; Huang, Jiangshuai; Fan, Huijin
2017-11-01
In this paper, a backstepping based distributed adaptive control scheme is proposed for multiple uncertain Euler-Lagrange systems under directed graph condition. The common desired trajectory is allowed totally unknown by part of the subsystems and the linearly parameterized trajectory model assumed in currently available results is no longer needed. To compensate the effects due to unknown trajectory information, a smooth function of consensus errors and certain positive integrable functions are introduced in designing virtual control inputs. Besides, to overcome the difficulty of completely counteracting the coupling terms of distributed consensus errors and parameter estimation errors in the presence of asymmetric Laplacian matrix, extra information transmission of local parameter estimates are introduced among linked subsystem and adaptive gain technique is adopted to generate distributed torque inputs. It is shown that with the proposed distributed adaptive control scheme, global uniform boundedness of all the closed-loop signals and asymptotically output consensus tracking can be achieved. Copyright © 2017 ISA. Published by Elsevier Ltd. All rights reserved.
The role of the autonomic nervous system in hypertension: a bond graph model study
International Nuclear Information System (INIS)
Chen, Shuzhen; Gong, Yuexian; Dai, Kaiyong; Sui, Meirong; Yu, Yi; Ning, Gangmin; Zhang, Shaowen
2008-01-01
A bond graph model of the cardiovascular system with embedded autonomic nervous regulation was developed for a better understanding of the role of the autonomic nervous system (ANS) in hypertension. The model is described by a pump model of the heart and a detailed representation of the head and neck, pulmonary, coronary, abdomen and extremity circulation. It responds to sympathetic and parasympathetic activities by modifying systemic peripheral vascular resistance, heart rate, ventricular end-systolic elastance and venous unstressed volumes. The impairment of ANS is represented by an elevation of the baroreflex set point. The simulation results show that, compared with normotensive, in hypertension the systolic and diastolic blood pressure (SBP/DBP) rose from 112/77 mmHg to 144/94 mmHg and the left ventricular wall thickness (LVWT) increased from 10 mm to 12.74 mm. In the case that ANS regulation was absent, both the SBP and DBP further increased by 8 mmHg and the LVWT increased to 13.22 mm. The results also demonstrate that when ANS regulation is not severely damaged, e.g. the baroreflex set point is 97 mmHg, it still has an effect in preventing the rapid rise of blood pressure in hypertension; however, with the worsening of ANS regulation, its protective role weakens. The results agree with human physiological and pathological features in hemodynamic parameters and carotid baroreflex function curves, and indicate the role of ANS in blood pressure regulation and heart protection. In conclusion, the present model may provide a valid approach to study the pathophysiological conditions of the cardiovascular system and the mechanism of ANS regulation
Trudeau, Richard J
1994-01-01
Preface1. Pure Mathematics Introduction; Euclidean Geometry as Pure Mathematics; Games; Why Study Pure Mathematics?; What's Coming; Suggested Reading2. Graphs Introduction; Sets; Paradox; Graphs; Graph diagrams; Cautions; Common Graphs; Discovery; Complements and Subgraphs; Isomorphism; Recognizing Isomorphic Graphs; Semantics The Number of Graphs Having a Given nu; Exercises; Suggested Reading3. Planar Graphs Introduction; UG, K subscript 5, and the Jordan Curve Theorem; Are there More Nonplanar Graphs?; Expansions; Kuratowski's Theorem; Determining Whether a Graph is Planar or
Bond Graph Model of Cerebral Circulation: Toward Clinically Feasible Systemic Blood Flow Simulations
Safaei, Soroush; Blanco, Pablo J.; Müller, Lucas O.; Hellevik, Leif R.; Hunter, Peter J.
2018-01-01
We propose a detailed CellML model of the human cerebral circulation that runs faster than real time on a desktop computer and is designed for use in clinical settings when the speed of response is important. A lumped parameter mathematical model, which is based on a one-dimensional formulation of the flow of an incompressible fluid in distensible vessels, is constructed using a bond graph formulation to ensure mass conservation and energy conservation. The model includes arterial vessels with geometric and anatomical data based on the ADAN circulation model. The peripheral beds are represented by lumped parameter compartments. We compare the hemodynamics predicted by the bond graph formulation of the cerebral circulation with that given by a classical one-dimensional Navier-Stokes model working on top of the whole-body ADAN model. Outputs from the bond graph model, including the pressure and flow signatures and blood volumes, are compared with physiological data. PMID:29551979
DEFF Research Database (Denmark)
Galsgaard, Bo; Lundtoft, Dennis Holm; Nikolov, Ivan Adriyanov
2015-01-01
are finally scaled and used to acquire the necessary wood stack measurements in real-world scale (in cm). The proposed system, which works automatically, has been tested on two different datasets, containing real outdoor images of logs which vary in shapes and sizes. The experimental results show......One of the time consuming tasks in the timber industry is the manually measurement of features of wood stacks. Such features include, but are not limited to, the number of the logs in a stack, their diameters distribution, and their volumes. Computer vision techniques have recently been used...... for solving this real-world industrial application. Such techniques are facing many challenges as the task is usually performed in outdoor, uncontrolled, environments. Furthermore, the logs can vary in texture and they can be occluded by different obstacles. These all make the segmentation of the wood logs...
Relun, Anne; Grosbois, Vladimir; Alexandrov, Tsviatko; Sánchez-Vizcaíno, Jose M; Waret-Szkuta, Agnes; Molia, Sophie; Etter, Eric Marcel Charles; Martínez-López, Beatriz
2017-01-01
In most European countries, data regarding movements of live animals are routinely collected and can greatly aid predictive epidemic modeling. However, the use of complete movements' dataset to conduct policy-relevant predictions has been so far limited by the massive amount of data that have to be processed (e.g., in intensive commercial systems) or the restricted availability of timely and updated records on animal movements (e.g., in areas where small-scale or extensive production is predominant). The aim of this study was to use exponential random graph models (ERGMs) to reproduce, understand, and predict pig trade networks in different European production systems. Three trade networks were built by aggregating movements of pig batches among premises (farms and trade operators) over 2011 in Bulgaria, Extremadura (Spain), and Côtes-d'Armor (France), where small-scale, extensive, and intensive pig production are predominant, respectively. Three ERGMs were fitted to each network with various demographic and geographic attributes of the nodes as well as six internal network configurations. Several statistical and graphical diagnostic methods were applied to assess the goodness of fit of the models. For all systems, both exogenous (attribute-based) and endogenous (network-based) processes appeared to govern the structure of pig trade network, and neither alone were capable of capturing all aspects of the network structure. Geographic mixing patterns strongly structured pig trade organization in the small-scale production system, whereas belonging to the same company or keeping pigs in the same housing system appeared to be key drivers of pig trade, in intensive and extensive production systems, respectively. Heterogeneous mixing between types of production also explained a part of network structure, whichever production system considered. Limited information is thus needed to capture most of the global structure of pig trade networks. Such findings will be useful
X-Graphs: Language and Algorithms for Heterogeneous Graph Streams
2017-09-01
are widely used by academia and industry. 15. SUBJECT TERMS Data Analytics, Graph Analytics, High-Performance Computing 16. SECURITY CLASSIFICATION...form the core of the DeepDive Knowledge Construction System. 2 INTRODUCTION The goal of the X-Graphs project was to develop computational techniques...memory multicore machine. Ringo is based on Snap.py and SNAP, and uses Python . Ringo now allows the integration of Delite DSL Framework Graph
Transformers and the Electric Utility System
Roman, Harry T.
2005-01-01
For electric energy to get from the generating station to a home, it must pass through a transformer, a device that can change voltage levels easily. This article describes how transformers work, covering the following topics: (1) the magnetism-electricity link; (2) transformer basics; (3) the energy seesaw; (4) the turns ratio rule; and (5)…
Bisseling, R.H.; Byrka, J.; Cerav-Erbas, S.; Gvozdenovic, N.; Lorenz, M.; Pendavingh, R.A.; Reeves, C.; Röger, M.; Verhoeven, A.; Berg, van den J.B.; Bhulai, S.; Hulshof, J.; Koole, G.; Quant, C.; Williams, J.F.
2006-01-01
Splitting a large software system into smaller and more manageable units has become an important problem for many organizations. The basic structure of a software system is given by a directed graph with vertices representing the programs of the system and arcs representing calls from one program to
Duality transformations for general abelian systems
International Nuclear Information System (INIS)
Savit, R.
1982-01-01
We describe the general structure of duality transformations for a very broad set of abelian statistical and field theoretic systems. This includes theories with many different types of fields and a large variety of kinds of interactions including, but not limited to nearest neighbor, next nearest neighbor, multi-spin interactions, etc. We find that the dual form of a theory does not depend directly on the dimensionality of the theory, but rather on the number of fields and number of different kinds of interactions. The dual forms we find have a generalized gauge symmetry and posses the usual property of having a temperature (or coupling constant) which is inverted from that of the original theory. Our results reduce to the well-known results in those particular cases that have heretofore been studied. Our procedure also suggests variations capable of generating other forms of the dual theory which may be useful in various specific cases. (orig.)
Diestel, Reinhard
2017-01-01
This standard textbook of modern graph theory, now in its fifth edition, combines the authority of a classic with the engaging freshness of style that is the hallmark of active mathematics. It covers the core material of the subject with concise yet reliably complete proofs, while offering glimpses of more advanced methods in each field by one or two deeper results, again with proofs given in full detail. The book can be used as a reliable text for an introductory course, as a graduate text, and for self-study. From the reviews: “This outstanding book cannot be substituted with any other book on the present textbook market. It has every chance of becoming the standard textbook for graph theory.”Acta Scientiarum Mathematiciarum “Deep, clear, wonderful. This is a serious book about the heart of graph theory. It has depth and integrity. ”Persi Diaconis & Ron Graham, SIAM Review “The book has received a very enthusiastic reception, which it amply deserves. A masterly elucidation of modern graph theo...
Cheung, King Sing
2014-01-01
Petri nets are a formal and theoretically rich model for the modelling and analysis of systems. A subclass of Petri nets, augmented marked graphs possess a structure that is especially desirable for the modelling and analysis of systems with concurrent processes and shared resources.This monograph consists of three parts: Part I provides the conceptual background for readers who have no prior knowledge on Petri nets; Part II elaborates the theory of augmented marked graphs; finally, Part III discusses the application to system integration. The book is suitable as a first self-contained volume
Scheduling of Conditional Process Graphs for the Synthesis of Embedded Systems
DEFF Research Database (Denmark)
Eles, Petru; Kuchcinski, Krzysztof; Peng, Zebo
1998-01-01
We present an approach to process scheduling based on an abstract graph representation which captures both dataflow and the flow of control. Target architectures consist of several processors, ASICs and shared busses. We have developed a heuristic which generates a schedule table so that the worst...... case delay is minimized. Several experiments demonstrate the efficiency of the approach....
A Graph-Based Approach to Action Scheduling in a Parallel Database System
Grefen, P.W.P.J.; Apers, Peter M.G.
Parallel database machines are meant to obtain high performance in transaction processing, both in terms of response time adn throughput. To obtain high performance, a good scheduling of the execution of the various actions in transactions is crucial. This paper describes a graph-based technique for
Verifying Temporal Properties of Reactive Systems by Transformation
Hamilton, Geoff
2015-01-01
We show how program transformation techniques can be used for the verification of both safety and liveness properties of reactive systems. In particular, we show how the program transformation technique distillation can be used to transform reactive systems specified in a functional language into a simplified form that can subsequently be analysed to verify temporal properties of the systems. Example systems which are intended to model mutual exclusion are analysed using these techniques with...
On Graph Rewriting, Reduction and Evaluation
DEFF Research Database (Denmark)
Zerny, Ian
2010-01-01
We inter-derive two prototypical styles of graph reduction: reduction machines à la Turner and graph rewriting systems à la Barendregt et al. To this end, we adapt Danvy et al.'s mechanical program derivations from the world of terms to the world of graphs. We also outline how to inter-derive a t......We inter-derive two prototypical styles of graph reduction: reduction machines à la Turner and graph rewriting systems à la Barendregt et al. To this end, we adapt Danvy et al.'s mechanical program derivations from the world of terms to the world of graphs. We also outline how to inter...
A Baecklund transformation between two integrable discrete hungry systems
Energy Technology Data Exchange (ETDEWEB)
Fukuda, Akiko, E-mail: j1409704@ed.kagu.tus.ac.j [Department of Mathematical Information Science, Graduate School of Science, Tokyo University of Science, 1-3 Kagurazaka, Shinjuku-ku, Tokyo 162-8601 (Japan); Yamamoto, Yusaku [Graduate School of System Informatics, Kobe University, 1-1 Rokkodai-cho, Nada-ku, Kobe 657-8501 (Japan); Iwasaki, Masashi [Department of Informatics and Environmental Science, Kyoto Prefectural University, 1-5, Nakaragi-cho, Shimogamo, Sakyo-ku, Kyoto 606-8522 (Japan); Ishiwata, Emiko [Department of Mathematical Information Science, Tokyo University of Science, 1-3 Kagurazaka, Shinjuku-ku, Tokyo 162-8601 (Japan); Nakamura, Yoshimasa [Graduate School of Informatics, Kyoto University, Yoshida-Honmachi, Sakyo-ku, Kyoto 606-8501 (Japan)
2011-01-17
The discrete hungry Toda (dhToda) equation and the discrete hungry Lotka-Volterra (dhLV) system are known as integrable discrete hungry systems. In this Letter, through finding the LR transformations associated with the dhToda equation and the dhLV system, we present a Baecklund transformation between these integrable systems.
A Baecklund transformation between two integrable discrete hungry systems
International Nuclear Information System (INIS)
Fukuda, Akiko; Yamamoto, Yusaku; Iwasaki, Masashi; Ishiwata, Emiko; Nakamura, Yoshimasa
2011-01-01
The discrete hungry Toda (dhToda) equation and the discrete hungry Lotka-Volterra (dhLV) system are known as integrable discrete hungry systems. In this Letter, through finding the LR transformations associated with the dhToda equation and the dhLV system, we present a Baecklund transformation between these integrable systems.
Risk Assessment of Power System considering the CPS of Transformers
Zhou, Long; Peng, Zewu; Liu, Xindong; Li, Canbing; Chen, Can
2018-02-01
This paper constructs a risk assessment framework of power system for device-level information security, analyzes the typical protection configuration of power transformers, and takes transformer gas protection and differential protection as examples to put forward a method that analyzes the cyber security in electric power system, which targets transformer protection parameters. We estimate the risk of power system accounting for the cyber security of transformer through utilizing Monte Carlo method and two indexes, which are the loss of load probability and the expected demand not supplied. The proposed approach is tested with IEEE 9 bus system and IEEE 118 bus system.
Transforming Research Management Systems at Mayo Clinic
Smith, Steven C.; Gronseth, Darren L.
2011-01-01
In order for research programs at academic medical centers and universities to survive and thrive in the increasingly challenging economic, political and regulatory environment, successful transformation is extremely important. Transformation and quality management techniques are increasingly well established in medical practice organizations. In…
Gould, Ronald
2012-01-01
This introduction to graph theory focuses on well-established topics, covering primary techniques and including both algorithmic and theoretical problems. The algorithms are presented with a minimum of advanced data structures and programming details. This thoroughly corrected 1988 edition provides insights to computer scientists as well as advanced undergraduates and graduate students of topology, algebra, and matrix theory. Fundamental concepts and notation and elementary properties and operations are the first subjects, followed by examinations of paths and searching, trees, and networks. S
Network Security Risk Assessment System Based on Attack Graph and Markov Chain
Sun, Fuxiong; Pi, Juntao; Lv, Jin; Cao, Tian
2017-10-01
Network security risk assessment technology can be found in advance of the network problems and related vulnerabilities, it has become an important means to solve the problem of network security. Based on attack graph and Markov chain, this paper provides a Network Security Risk Assessment Model (NSRAM). Based on the network infiltration tests, NSRAM generates the attack graph by the breadth traversal algorithm. Combines with the international standard CVSS, the attack probability of atomic nodes are counted, and then the attack transition probabilities of ones are calculated by Markov chain. NSRAM selects the optimal attack path after comprehensive measurement to assessment network security risk. The simulation results show that NSRAM can reflect the actual situation of network security objectively.
Chartrand, Gary; Zhang, Ping
2010-01-01
Gary Chartrand has influenced the world of Graph Theory for almost half a century. He has supervised more than a score of Ph.D. dissertations and written several books on the subject. The most widely known of these texts, Graphs and Digraphs, … has much to recommend it, with clear exposition, and numerous challenging examples [that] make it an ideal textbook for the advanced undergraduate or beginning graduate course. The authors have updated their notation to reflect the current practice in this still-growing area of study. By the authors' estimation, the 5th edition is approximately 50% longer than the 4th edition. … the legendary Frank Harary, author of the second graph theory text ever produced, is one of the figures profiled. His book was the standard in the discipline for several decades. Chartrand, Lesniak and Zhang have produced a worthy successor.-John T. Saccoman, MAA Reviews, June 2012 (This book is in the MAA's basic library list.)As with the earlier editions, the current text emphasizes clear...
Static and dynamic analysis of beam assemblies using a differential system on an oriented graph
Czech Academy of Sciences Publication Activity Database
Náprstek, Jiří; Fischer, Cyril
2015-01-01
Roč. 155, July (2015), s. 28-41 ISSN 0045-7949 R&D Projects: GA ČR(CZ) GA15-01035S Institutional support: RVO:68378297 Keywords : symmetric operators * oriented graph * dynamic stiffness matrix * slope deflection method * finite element method Subject RIV: JM - Building Engineering Impact factor: 2.425, year: 2015 http://www.sciencedirect.com/science/article/pii/S0045794915000590#
Graph-based modelling in engineering
Rysiński, Jacek
2017-01-01
This book presents versatile, modern and creative applications of graph theory in mechanical engineering, robotics and computer networks. Topics related to mechanical engineering include e.g. machine and mechanism science, mechatronics, robotics, gearing and transmissions, design theory and production processes. The graphs treated are simple graphs, weighted and mixed graphs, bond graphs, Petri nets, logical trees etc. The authors represent several countries in Europe and America, and their contributions show how different, elegant, useful and fruitful the utilization of graphs in modelling of engineering systems can be. .
Directory of Open Access Journals (Sweden)
V. E. Podol'skii
2015-01-01
Full Text Available The paper considers the implementing Bellman-Ford and Lee algorithms to find the shortest graph path on a computer system with multiple instruction stream and single data stream (MISD. The MISD computer is a computer that executes commands of arithmetic-logical processing (on the CPU and commands of structures processing (on the structures processor in parallel on a single data stream. Transformation of sequential programs into the MISD programs is a labor intensity process because it requires a stream of the arithmetic-logical processing to be manually separated from that of the structures processing. Algorithms based on the processing of data structures (e.g., algorithms on graphs show high performance on a MISD computer. Bellman-Ford and Lee algorithms for finding the shortest path on a graph are representatives of these algorithms. They are applied to robotics for automatic planning of the robot movement in-situ. Modification of Bellman-Ford and Lee algorithms for finding the shortest graph path in coprocessor MISD mode and the parallel MISD modification of these algorithms were first obtained in this article. Thus, this article continues a series of studies on the transformation of sequential algorithms into MISD ones (Dijkstra and Ford-Fulkerson 's algorithms and has a pronouncedly applied nature. The article also presents the analysis results of Bellman-Ford and Lee algorithms in MISD mode. The paper formulates the basic trends of a technique for parallelization of algorithms into arithmetic-logical processing stream and structures processing stream. Among the key areas for future research, development of the mathematical approach to provide a subsequently formalized and automated process of parallelizing sequential algorithms between the CPU and structures processor is highlighted. Among the mathematical models that can be used in future studies there are graph models of algorithms (e.g., dependency graph of a program. Due to the high
Phases of the energy system transformation
International Nuclear Information System (INIS)
Fischedick, Manfred; Samadi, Sascha; Hoffmann, Clemens; Henning, Hans-Martin; Pregger, Thomas; Leprich, Uwe; Schmidt, Maike
2015-01-01
The energy transition is an ambitious and highly complex process of transformation. This article presents eight theses that can help to better understand the challenges and to identify starting points for future action and to identify research needs. [de
Summary: beyond fault trees to fault graphs
International Nuclear Information System (INIS)
Alesso, H.P.; Prassinos, P.; Smith, C.F.
1984-09-01
Fault Graphs are the natural evolutionary step over a traditional fault-tree model. A Fault Graph is a failure-oriented directed graph with logic connectives that allows cycles. We intentionally construct the Fault Graph to trace the piping and instrumentation drawing (P and ID) of the system, but with logical AND and OR conditions added. Then we evaluate the Fault Graph with computer codes based on graph-theoretic methods. Fault Graph computer codes are based on graph concepts, such as path set (a set of nodes traveled on a path from one node to another) and reachability (the complete set of all possible paths between any two nodes). These codes are used to find the cut-sets (any minimal set of component failures that will fail the system) and to evaluate the system reliability
Phase transformations and systems driven far from equilibrium
International Nuclear Information System (INIS)
Ma, E.; Atzmon, M.; Bellon, P.; Trivedi, R.
1998-01-01
This volume compiles invited and contributed papers that were presented at Symposium B of the 1997 Materials Research Society Fall Meeting, Phase Transformations and Systems Driven Far From Equilibrium, which was held December 1--5, in Boston, Massachusetts. While this symposium followed the tradition of previous MRS symposia on the fundamental topic of phase transformations, this year the emphasis was on materials systems driven far from equilibrium. The central theme of the majority of the work presented is the understanding of the thermodynamics and kinetics of phase transformations, with significant coverage of metastable materials and externally forced transformations driven, for example, by energy beams or mechanical deformation. The papers are arranged in seven sections: solidification theory and experiments; nucleation; solid state transformations and microstructural evolution; beam-induced transformations; amorphous solids; interfacial and thin film transformations; and nanophases and mechanical alloying. One hundred three papers have been processed separately for inclusion on the data base
Transformation procedures in 3D terrestrial coordinate systems
Directory of Open Access Journals (Sweden)
Sedlák Vladimír
2001-12-01
Full Text Available Transformation procedures belong to the main tasks of surveyor working in a field of geodesy, for example in satellite geodesy or astronomical geodesy. It is necessary to know transformation procedures in 3D terrestrial (Earth coordinate systems. Increasingly a dynamic advance growth of application of satellite navigation systems, for example GPS (Global Positioning System into engineering surveying, real estate register and others spheres of applied geodesy and geo-surveying (mine surveying exacts knowledge of these transformation procedures between coordinates in various coordinate systems. These tasks are common for daily work for various practical surveyors too, not only for theoretical scientific working surveyors.Conventional Terrestrial System is 3D coordinate system what is the most important coordinate system in global geodesy. Conventional Terrestrial System is an approximation of the nature coordinate system of the Earth. The origin of this coordinate system is placed in the earth substantial centre of gravity and in the centre of geoid. Conventional Terrestrial System is the Cartesian right-handed coordinate system, i.e. positive one. The Local Astronomical System is 3D coordinate system too and it belongs to an important coordinate system in geodesy from its practical point of view. Many geodetic measurements are realized in this coordinate system. Designation of this coordinate system as astronomical system expresses its sticking to a normal line to an equipotential plane, i.e. to a vertical. Local Astronomical system is the left-handed cartesian coordinate system.Transformation procedures in 3D terrestrial coordinate systems with theory of these systems are presented in the paper. Transformation in the local astronomical coordinate system presents common transformation in a frame of an adjustment of various local geodetic networks. In a case of satellite measurements (GPS, satellite altimetry, etc. transformation between local and
A Blueprint for Innovation to Achieve Health System Transformation.
Snowdon, Anne W
2017-01-01
Global health systems are challenged by escalating costs and growing demands for care created by the demands of aging populations and rising rates of chronic illness which place unsustainable pressure on health systems to meet population health needs. To overcome these challenges, transformational change is needed to strengthen health system performance and sustainability. Innovation is widely viewed as the strategy to drive transformational change in health systems; yet to date, innovation has lacked a clearly defined focus or agenda to achieve transformation. An actionable innovation agenda is needed to achieve transformational change for health systems. The key conditions for success as an innovation strategy are examined, including clearly defined innovation objectives, key milestones, and actionable steps every system stakeholder must pursue in order to guide the innovation agenda and ultimately accelerate the transformational changes needed for a sustainable healthcare system that delivers value to populations.
Decentralized formation of random regular graphs for robust multi-agent networks
Yazicioglu, A. Yasin; Egerstedt, Magnus; Shamma, Jeff S.
2014-01-01
systems. One family of robust graphs is the random regular graphs. In this paper, we present a locally applicable reconfiguration scheme to build random regular graphs through self-organization. For any connected initial graph, the proposed scheme
Judicial Capacity in a Transforming Legal System
Directory of Open Access Journals (Sweden)
Hugh Corder
2017-12-01
Full Text Available Given the perennial problem of lack of access to justice; the fact that there was no shortage of superior court judges until 1994; the demands on court process which flow directly from transition to the constitutional democratic system; and the urgent and justified necessity for the demographic transformation of judicial personnel, two challenges to the capacity of the judicial system present themselves in South Africa: Enlarging the number of suitable candidates for judicial appointment to redress the former demographic imbalance; and developing the kind of skills among those appointed as judges to be able to respond with confidence across a wide range of often complex legal issues; and developing a theory of judicial deference which observes the separation of powers and preserves judicial independence. This paper explores these challenges, after setting out the socio-political context, as it impacts directly on their nature and scope, and the prospects of meeting them.Debido al constante problema de la falta de acceso a la justicia, al hecho de que no hubo escasez de jueces de tribunales superiores hasta 1994, las demandas del proceso judicial que surgen directamente de la transición al sistema democrático constitucional, y la necesidad urgente y justificada de la transformación demográfica del personal judicial, el rendimiento judicial en Sudáfrica se encuentra con dos desafíos: Aumentar el número de candidatos aptos al nombramiento judicial para compensar el anterior desequilibrio demográfico y desarrollar en los jueces nombrados aquellas habilidades que les permitan responder con confianza a asuntos jurídicos a menudo complejos; y desarrollar una teoría de deferencia judicial que respete la separación de poderes y preserve la independencia judicial. Este artículo explora estos desafíos tras explicar el contexto sociopolítico, ya que éste afecta directamente a su naturaleza y alcance, y las probabilidades de que se superen
Quantum number theoretic transforms on multipartite finite systems.
Vourdas, A; Zhang, S
2009-06-01
A quantum system composed of p-1 subsystems, each of which is described with a p-dimensional Hilbert space (where p is a prime number), is considered. A quantum number theoretic transform on this system, which has properties similar to those of a Fourier transform, is studied. A representation of the Heisenberg-Weyl group in this context is also discussed.
Challenging obduracy : How local communities transform the energy system
Van Der Schoor, Tineke; Van Lente, Harro; Scholtens, Bert; Peine, Alex
2016-01-01
The transformation from the current energy system to a decentralized renewable energy system requires the transformation of communities into energy neutral or even energy producing communities. Increasingly, citizens become 'prosumers' and pool their resources to start a local energy initiative. In
Energy Technology Data Exchange (ETDEWEB)
Winlaw, Manda [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); De Sterck, Hans [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Sanders, Geoffrey [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
2015-10-26
In very simple terms a network can be de ned as a collection of points joined together by lines. Thus, networks can be used to represent connections between entities in a wide variety of elds including engi- neering, science, medicine, and sociology. Many large real-world networks share a surprising number of properties, leading to a strong interest in model development research and techniques for building synthetic networks have been developed, that capture these similarities and replicate real-world graphs. Modeling these real-world networks serves two purposes. First, building models that mimic the patterns and prop- erties of real networks helps to understand the implications of these patterns and helps determine which patterns are important. If we develop a generative process to synthesize real networks we can also examine which growth processes are plausible and which are not. Secondly, high-quality, large-scale network data is often not available, because of economic, legal, technological, or other obstacles [7]. Thus, there are many instances where the systems of interest cannot be represented by a single exemplar network. As one example, consider the eld of cybersecurity, where systems require testing across diverse threat scenarios and validation across diverse network structures. In these cases, where there is no single exemplar network, the systems must instead be modeled as a collection of networks in which the variation among them may be just as important as their common features. By developing processes to build synthetic models, so-called graph generators, we can build synthetic networks that capture both the essential features of a system and realistic variability. Then we can use such synthetic graphs to perform tasks such as simulations, analysis, and decision making. We can also use synthetic graphs to performance test graph analysis algorithms, including clustering algorithms and anomaly detection algorithms.
Energy Technology Data Exchange (ETDEWEB)
Lucas, B.
1994-05-15
After having recalled the usual diagnosis techniques (failure index, decision tree) and those based on an artificial intelligence approach, the author reports a research aimed at exploring the knowledge and model generation technique. He focuses on the design of an aid to model generation tool and aid-to-diagnosis tool. The bond graph technique is shown to be adapted to the aid to model generation, and is then adapted to the aid to diagnosis. The developed tool is applied to three projects: DIADEME (a diagnosis system based on physical model), the improvement of the SEXTANT diagnosis system (an expert system for transient analysis), and the investigation on an Ariane 5 launcher component. Notably, the author uses the Reiter and Greiner algorithm
Transforming the structure of a health system.
Reilly, Patrick
2012-06-01
In starting the planning process for an organization's transformation or restructuring, healthcare finance leaders should: Identify strategic imperatives for the organization and physicians, Remember the organization's core area of business, Define the starting point and create clear objectives, Develop a strategy that engages front-line employees to change the culture of the organization.
Information retrieval system utilizing wavelet transform
Brewster, Mary E.; Miller, Nancy E.
2000-01-01
A method for automatically partitioning an unstructured electronically formatted natural language document into its sub-topic structure. Specifically, the document is converted to an electronic signal and a wavelet transform is then performed on the signal. The resultant signal may then be used to graphically display and interact with the sub-topic structure of the document.
Towards a theory of geometric graphs
Pach, Janos
2004-01-01
The early development of graph theory was heavily motivated and influenced by topological and geometric themes, such as the Konigsberg Bridge Problem, Euler's Polyhedral Formula, or Kuratowski's characterization of planar graphs. In 1936, when Denes Konig published his classical Theory of Finite and Infinite Graphs, the first book ever written on the subject, he stressed this connection by adding the subtitle Combinatorial Topology of Systems of Segments. He wanted to emphasize that the subject of his investigations was very concrete: planar figures consisting of points connected by straight-line segments. However, in the second half of the twentieth century, graph theoretical research took an interesting turn. In the most popular and most rapidly growing areas (the theory of random graphs, Ramsey theory, extremal graph theory, algebraic graph theory, etc.), graphs were considered as abstract binary relations rather than geometric objects. Many of the powerful techniques developed in these fields have been su...
Inferring ontology graph structures using OWL reasoning
Rodriguez-Garcia, Miguel Angel; Hoehndorf, Robert
2018-01-01
' semantic content remains a challenge.We developed a method to transform ontologies into graphs using an automated reasoner while taking into account all relations between classes. Searching for (existential) patterns in the deductive closure of ontologies
Khaouch, Zakaria; Zekraoui, Mustapha; Bengourram, Jamaa; Kouider, Nourreeddine; Mabrouki, Mustapha
2016-11-01
In this paper, we would like to focus on modeling main parts of the wind turbines (blades, gearbox, tower, generator and pitching system) from a mechatronics viewpoint using the Bond-Graph Approach (BGA). Then, these parts are combined together in order to simulate the complete system. Moreover, the real dynamic behavior of the wind turbine is taken into account and with the new model; final load simulation is more realistic offering benefits and reliable system performance. This model can be used to develop control algorithms to reduce fatigue loads and enhance power production. Different simulations are carried-out in order to validate the proposed wind turbine model, using real data provided in the open literature (blade profile and gearbox parameters for a 750 kW wind turbine). Copyright © 2016 ISA. Published by Elsevier Ltd. All rights reserved.
Chartrand, Gary; Rosen, Kenneth H
2008-01-01
Beginning with the origin of the four color problem in 1852, the field of graph colorings has developed into one of the most popular areas of graph theory. Introducing graph theory with a coloring theme, Chromatic Graph Theory explores connections between major topics in graph theory and graph colorings as well as emerging topics. This self-contained book first presents various fundamentals of graph theory that lie outside of graph colorings, including basic terminology and results, trees and connectivity, Eulerian and Hamiltonian graphs, matchings and factorizations, and graph embeddings. The remainder of the text deals exclusively with graph colorings. It covers vertex colorings and bounds for the chromatic number, vertex colorings of graphs embedded on surfaces, and a variety of restricted vertex colorings. The authors also describe edge colorings, monochromatic and rainbow edge colorings, complete vertex colorings, several distinguishing vertex and edge colorings, and many distance-related vertex coloring...
The inertia system coordinate transformation based on the Lobachevsky function
International Nuclear Information System (INIS)
Fadeev, N.G.
2001-01-01
Based on the interpretation of the Lobachevsky function cosΠ(ρ/k) = thρ/k as the function which expresses the constant light velocity principle at k = c (k is the Lobachevsky constant, c is the light velocity), the inertia system coordinate transformation of two kinds (one of them known as Lorentz transformation) have been obtained
Fourier transform in multimode systems in the Bargmann representation
International Nuclear Information System (INIS)
Lei, C; Vourdas, A
2007-01-01
A Fourier transform in a multimode system is studied, using the Bargmann representation. The growth of a Bargmann function is shown to be related to the second-order correlation of the corresponding state. Both the total growth and the total second-order correlation remain unchanged under the Fourier transform. Examples with coherent states, squeezed states and Mittag-Leffler states are discussed
Mechatronic modeling and simulation using bond graphs
Das, Shuvra
2009-01-01
Introduction to Mechatronics and System ModelingWhat Is Mechatronics?What Is a System and Why Model Systems?Mathematical Modeling Techniques Used in PracticeSoftwareBond Graphs: What Are They?Engineering SystemsPortsGeneralized VariablesBond GraphsBasic Components in SystemsA Brief Note about Bond Graph Power DirectionsSummary of Bond Direction RulesDrawing Bond Graphs for Simple Systems: Electrical and MechanicalSimplification Rules for Junction StructureDrawing Bond Graphs for Electrical SystemsDrawing Bond Graphs for Mechanical SystemsCausalityDrawing Bond Graphs for Hydraulic and Electronic Components and SystemsSome Basic Properties and Concepts for FluidsBond Graph Model of Hydraulic SystemsElectronic SystemsDeriving System Equations from Bond GraphsSystem VariablesDeriving System EquationsTackling Differential CausalityAlgebraic LoopsSolution of Model Equations and Their InterpretationZeroth Order SystemsFirst Order SystemsSecond Order SystemTransfer Functions and Frequency ResponsesNumerical Solution ...
XML Graphs in Program Analysis
DEFF Research Database (Denmark)
Møller, Anders; Schwartzbach, Michael Ignatieff
2007-01-01
XML graphs have shown to be a simple and effective formalism for representing sets of XML documents in program analysis. It has evolved through a six year period with variants tailored for a range of applications. We present a unified definition, outline the key properties including validation...... of XML graphs against different XML schema languages, and provide a software package that enables others to make use of these ideas. We also survey four very different applications: XML in Java, Java Servlets and JSP, transformations between XML and non-XML data, and XSLT....
Transformative governance of urban social-ecological systems
A central aspect of adaptive governance is a learning process that can help communities achieve environmental objectives. Adaptive governance is a framework for managing social-ecological systems, and is the precursor to transformative governance. Adaptive governance accounts for...
Nonbijective canonical transformations and applications to some dynamical systems
International Nuclear Information System (INIS)
Negadi, T.
1988-01-01
A first part is devoted to a presentation of a simplified formalism concerning non-bijective canonical transformations and to an interpretation of some of them in the framework on the theory of Lie algebras. In particular, the well-known Levi-Civita and Kustaanheimo-Stiefel transformations are generalized to the non-compact case and to the dimensions 2, 4 and 8. The differential and geometrical properties of the so-called Hurwitz transformations as well as their interpretation in terms of Lie algebras under constraints are given. A second part is concerned with the application of certain non-bijective canonical transformations (and in particular the Kustaanheimo-Stiefel transformation) to some dynamical systems of interest in theoretical and in chemical physics. The applications concern especially hydrogenoid systems, free or embedded in static and uniform electromagnetic fields, and systems presenting a line of singularity (as the Hartmann system, the Aharonov-Bohm system, and the dyonium system). The Kustaanheimo-Stiefel transformation allows to convert the Schroedinger equations for the later systems into Schroedinger equations for oscillators (harmonic, anharmonic, non-harmonic) in 2 or 4 dimensions [fr
Computer simulation of martensitic transformations in idealized systems
International Nuclear Information System (INIS)
Chen, S.H.R.
1979-06-01
Very little theoretical work on the development of the martensitic transformation and the characteristics of the resulting microstructure exists. This thesis advances the theory of the martensite transformation by constructing a computer model of a martensitic transformation in an idealized system. The model has its source in the general observation that the characteristics of martensitic transformations in solids are largely determined by accomodating the strain associated with the martensitic distortion of the crystal lattice. A review and adaptation of prior theoretical work leads to the development of a theory which allows the straightforward computation of the elastic energy associated with an arbitrary distribution of defects in an elastically anisotropic body under the assumption that the body has uniform elastic constants and that anharmonic effects may be neglected. Equations are cast in which the energy is written as a simple sum of binary interactions in which the defects influence one another according to an elastic potential whose form can be calculated. At the time that the energetic equations take a simple form the kinematics of the process involving the appearance of elastic inclusions are also known to be simple. The martiensitic transformation is modeled as a transformation which occurs through the sequential formation of individual martensitic elements, each carries the elementary transformation strain. Statistical equations developed govern the selection of the transformation path, or sequence that elementary martensite particles appear in the model, and specifies the kinetics of transformation.A useful representative path is defined as the minimum energy path. The model is used for the detailed simulation of a martensitic transformation in a pseudo two-dimensional system. Virtually all interesting qualitative aspects of the developing martensitic transformation are shown to be inherently present within it
The systems psychodynamic experiences of organisational transformation amongst support staff
Directory of Open Access Journals (Sweden)
Martin Steyn
2016-10-01
Full Text Available Orientation: The unconscious impact of organisational transformation is often neglected and even denied. This research revealed the manifestation and impact of high levels and different forms of anxiety experienced by employees during transformation. Research objective: The objective was to study and describe the manifesting systems psychodynamic behaviour amongst support staff during organisational transformation. Motivation for the study: Organisational transformation is mostly researched from a leadership viewpoint. Little research data are available on the experiences of support staff on the receiving end of decisions about and implementation of transformation. Research design, approach and method: A qualitative approach within the phenomenological hermeneutic interpretive stance was used. The research was set in a government organisation. A semi-structured interview with four conveniently and purposefully chosen support staff members was thematically analysed using systems psychodynamics as theoretical paradigm. Main findings: Four themes manifested, namely de-authorisation and detachment, being bullied and seduced by leadership, the organisation in the mind as incompetent, and a dangerous and persecutory system. In the discussion, the basic assumptions and relevant constructs are interpreted. Practical implications: Understanding the transformation experiences of support staff could assist the industrial psychologist to facilitate appropriate support in coaching more junior staff towards increasing wellness and work performance. Contribution: Organisational transformation is highlighted as an anxiety provoking experience especially on the lower levels of the organisation. Its potentially deep and complex psychological impact could possibly derail parts of the system if not managed in a psychologically contained manner.
Transformation instability of oscillations in inhomogeneous beam-plasma system
International Nuclear Information System (INIS)
Kitsenko, A.B.
1985-01-01
Wave transformation is studied in a plasma system which was weak-inhomogeneous along beam velocity, in absence of external magnetic field. For the case of small density beam formulae are obtained which have set a coupling between the charge density beam wave amplitudes and the Langmuir wave on both sides of transformation point. It is shown that in collisionless plasma the wave production is a cause of the absorption of the charge density beam waves. Transformation mechanism of the absolute instability in the weak-inhomogeneous beam-plasma system is revealed
On a conjecture concerning helly circle graphs
Directory of Open Access Journals (Sweden)
Durán Guillermo
2003-01-01
Full Text Available We say that G is an e-circle graph if there is a bijection between its vertices and straight lines on the cartesian plane such that two vertices are adjacent in G if and only if the corresponding lines intersect inside the circle of radius one. This definition suggests a method for deciding whether a given graph G is an e-circle graph, by constructing a convenient system S of equations and inequations which represents the structure of G, in such a way that G is an e-circle graph if and only if S has a solution. In fact, e-circle graphs are exactly the circle graphs (intersection graphs of chords in a circle, and thus this method provides an analytic way for recognizing circle graphs. A graph G is a Helly circle graph if G is a circle graph and there exists a model of G by chords such that every three pairwise intersecting chords intersect at the same point. A conjecture by Durán (2000 states that G is a Helly circle graph if and only if G is a circle graph and contains no induced diamonds (a diamond is a graph formed by four vertices and five edges. Many unsuccessful efforts - mainly based on combinatorial and geometrical approaches - have been done in order to validate this conjecture. In this work, we utilize the ideas behind the definition of e-circle graphs and restate this conjecture in terms of an equivalence between two systems of equations and inequations, providing a new, analytic tool to deal with it.
Understanding Charts and Graphs.
1987-07-28
Farenheit degrees, which have no Onaturalo zero ); finally, ratio scales have numbers that are ordered so that the magnitudes of differences are important and...system. They have to do with the very nature of how marks serve as meaningful symbols. In the ideal case, a chart or graph will be absolutely unambiguous...and these laws comprise this principle (see Stevens, 1974). Absolute discriminability: A minimal magnitude of a mark is necessary for it to be detected
A quantum annealing approach for fault detection and diagnosis of graph-based systems
Perdomo-Ortiz, A.; Fluegemann, J.; Narasimhan, S.; Biswas, R.; Smelyanskiy, V. N.
2015-02-01
Diagnosing the minimal set of faults capable of explaining a set of given observations, e.g., from sensor readouts, is a hard combinatorial optimization problem usually tackled with artificial intelligence techniques. We present the mapping of this combinatorial problem to quadratic unconstrained binary optimization (QUBO), and the experimental results of instances embedded onto a quantum annealing device with 509 quantum bits. Besides being the first time a quantum approach has been proposed for problems in the advanced diagnostics community, to the best of our knowledge this work is also the first research utilizing the route Problem → QUBO → Direct embedding into quantum hardware, where we are able to implement and tackle problem instances with sizes that go beyond previously reported toy-model proof-of-principle quantum annealing implementations; this is a significant leap in the solution of problems via direct-embedding adiabatic quantum optimization. We discuss some of the programmability challenges in the current generation of the quantum device as well as a few possible ways to extend this work to more complex arbitrary network graphs.
Using systems thinking to support clinical system transformation.
Best, Allan; Berland, Alex; Herbert, Carol; Bitz, Jennifer; van Dijk, Marlies W; Krause, Christina; Cochrane, Douglas; Noel, Kevin; Marsden, Julian; McKeown, Shari; Millar, John
2016-05-16
Purpose - The British Columbia Ministry of Health's Clinical Care Management initiative was used as a case study to better understand large-scale change (LSC) within BC's health system. Using a complex system framework, the purpose of this paper is to examine mechanisms that enable and constrain the implementation of clinical guidelines across various clinical settings. Design/methodology/approach - Researchers applied a general model of complex adaptive systems plus two specific conceptual frameworks (realist evaluation and system dynamics mapping) to define and study enablers and constraints. Focus group sessions and interviews with clinicians, executives, managers and board members were validated through an online survey. Findings - The functional themes for managing large-scale clinical change included: creating a context to prepare clinicians for health system transformation initiatives; promoting shared clinical leadership; strengthening knowledge management, strategic communications and opportunities for networking; and clearing pathways through the complexity of a multilevel, dynamic system. Research limitations/implications - The action research methodology was designed to guide continuing improvement of implementation. A sample of initiatives was selected; it was not intended to compare and contrast facilitators and barriers across all initiatives and regions. Similarly, evaluating the results or process of guideline implementation was outside the scope; the methods were designed to enable conversations at multiple levels - policy, management and practice - about how to improve implementation. The study is best seen as a case study of LSC, offering a possible model for replication by others and a tool to shape further dialogue. Practical implications - Recommended action-oriented strategies included engaging local champions; supporting local adaptation for implementation of clinical guidelines; strengthening local teams to guide implementation; reducing
DEFF Research Database (Denmark)
Bock, Lars Nicolai
2011-01-01
Artiklen diskuterer ordet "transformation" med udgangspunkt i dels hvorledes ordet bruges i arkitektfaglig terminologi og dels med fokus på ordets potentielle indhold og egnethed i samme teminologi.......Artiklen diskuterer ordet "transformation" med udgangspunkt i dels hvorledes ordet bruges i arkitektfaglig terminologi og dels med fokus på ordets potentielle indhold og egnethed i samme teminologi....
Energy Technology Data Exchange (ETDEWEB)
LACKS,S.A.
2003-10-09
Transformation, which alters the genetic makeup of an individual, is a concept that intrigues the human imagination. In Streptococcus pneumoniae such transformation was first demonstrated. Perhaps our fascination with genetics derived from our ancestors observing their own progeny, with its retention and assortment of parental traits, but such interest must have been accelerated after the dawn of agriculture. It was in pea plants that Gregor Mendel in the late 1800s examined inherited traits and found them to be determined by physical elements, or genes, passed from parents to progeny. In our day, the material basis of these genetic determinants was revealed to be DNA by the lowly bacteria, in particular, the pneumococcus. For this species, transformation by free DNA is a sexual process that enables cells to sport new combinations of genes and traits. Genetic transformation of the type found in S. pneumoniae occurs naturally in many species of bacteria (70), but, initially only a few other transformable species were found, namely, Haemophilus influenzae, Neisseria meningitides, Neisseria gonorrheae, and Bacillus subtilis (96). Natural transformation, which requires a set of genes evolved for the purpose, contrasts with artificial transformation, which is accomplished by shocking cells either electrically, as in electroporation, or by ionic and temperature shifts. Although such artificial treatments can introduce very small amounts of DNA into virtually any type of cell, the amounts introduced by natural transformation are a million-fold greater, and S. pneumoniae can take up as much as 10% of its cellular DNA content (40).
Smooth Bundling of Large Streaming and Sequence Graphs
Hurter, C.; Ersoy, O.; Telea, A.
2013-01-01
Dynamic graphs are increasingly pervasive in modern information systems. However, understanding how a graph changes in time is difficult. We present here two techniques for simplified visualization of dynamic graphs using edge bundles. The first technique uses a recent image-based graph bundling
Graph visualization (Invited talk)
Wijk, van J.J.; Kreveld, van M.J.; Speckmann, B.
2012-01-01
Black and white node link diagrams are the classic method to depict graphs, but these often fall short to give insight in large graphs or when attributes of nodes and edges play an important role. Graph visualization aims obtaining insight in such graphs using interactive graphical representations.
Fast Fourier transformation in vibration analysis of physically active systems
International Nuclear Information System (INIS)
Hafeez, T.; Amir, M.; Farooq, U.; Day, P.
2003-01-01
Vibration of all physical systems may be expressed as the summation of an infinite number of sine and cosine terms known as Fourier series. The basic vibration analysis tool used is the frequency 'spectrum' (a graph of vibration where the amplitude of vibration is plotted against frequency). When a particular rotating component begins to fail, its vibration tends to increase. Spectra graphs are powerful diagnostic tool for detecting components' degradation. Spectra obtained with accelerometers located at the various locations on the components and their analysis in practice from rotating machines enable early detecting of incipient failure. Consequence of unexpected failure can be catastrophic and costly. This study provides basis to relate defective component by its constituent frequencies and then to the known discrete frequency of its 'signature' or 'thumbprint' to predict and verify the sustained dynamic behavior of machine designs harmful effects of forced vibration. The spectra for gearbox of a vane with teeth damaged fault are presented here which signified the importance of FFT analysis as diagnostic tool. This may be helpful to predictive maintenance of the machinery. (author)
Quick Mining of Isomorphic Exact Large Patterns from Large Graphs
Almasri, Islam
2014-12-01
The applications of the sub graph isomorphism search are growing with the growing number of areas that model their systems using graphs or networks. Specifically, many biological systems, such as protein interaction networks, molecular structures and protein contact maps, are modeled as graphs. The sub graph isomorphism search is concerned with finding all sub graphs that are isomorphic to a relevant query graph, the existence of such sub graphs can reflect on the characteristics of the modeled system. The most computationally expensive step in the search for isomorphic sub graphs is the backtracking algorithm that traverses the nodes of the target graph. In this paper, we propose a pruning approach that is inspired by the minimum remaining value heuristic that achieves greater scalability over large query and target graphs. Our testing on various biological networks shows that performance enhancement of our approach over existing state-of-the-art approaches varies between 6x and 53x. © 2014 IEEE.
Quick Mining of Isomorphic Exact Large Patterns from Large Graphs
Almasri, Islam; Gao, Xin; Fedoroff, Nina V.
2014-01-01
The applications of the sub graph isomorphism search are growing with the growing number of areas that model their systems using graphs or networks. Specifically, many biological systems, such as protein interaction networks, molecular structures and protein contact maps, are modeled as graphs. The sub graph isomorphism search is concerned with finding all sub graphs that are isomorphic to a relevant query graph, the existence of such sub graphs can reflect on the characteristics of the modeled system. The most computationally expensive step in the search for isomorphic sub graphs is the backtracking algorithm that traverses the nodes of the target graph. In this paper, we propose a pruning approach that is inspired by the minimum remaining value heuristic that achieves greater scalability over large query and target graphs. Our testing on various biological networks shows that performance enhancement of our approach over existing state-of-the-art approaches varies between 6x and 53x. © 2014 IEEE.
Early Childhood Systems: Transforming Early Learning
Kagan, Sharon Lynn, Ed.; Kauertz, Kristie, Ed.
2012-01-01
In this seminal volume, leading authorities strategize about how to create early childhood systems that transcend politics and economics to serve the needs of all young children. The authors offer different interpretations of the nature of early childhood systems, discuss the elements necessary to support their development, and examine how…
Celis, A.M.; Vos, Aurin; Triana, S.; Medina, C.A.; Escobar Salazar, Natalia; Restrepo, S.; Wosten, Han; de Cock, Hans
2017-01-01
Malassezia spp. are part of the normal human and animal mycobiota but are also associated with a variety of dermatological diseases. The absence of a transformation system hampered studies to reveal mechanisms underlying the switch from the non-pathogenic to pathogenic life style. Here we describe,
Baker, W.R.
1959-08-25
Transformers of a type adapted for use with extreme high power vacuum tubes where current requirements may be of the order of 2,000 to 200,000 amperes are described. The transformer casing has the form of a re-entrant section being extended through an opening in one end of the cylinder to form a coaxial terminal arrangement. A toroidal multi-turn primary winding is disposed within the casing in coaxial relationship therein. In a second embodiment, means are provided for forming the casing as a multi-turn secondary. The transformer is characterized by minimized resistance heating, minimized external magnetic flux, and an economical construction.
Pragmatic Graph Rewriting Modifications
Rodgers, Peter; Vidal, Natalia
1999-01-01
We present new pragmatic constructs for easing programming in visual graph rewriting programming languages. The first is a modification to the rewriting process for nodes the host graph, where nodes specified as 'Once Only' in the LHS of a rewrite match at most once with a corresponding node in the host graph. This reduces the previously common use of tags to indicate the progress of matching in the graph. The second modification controls the application of LHS graphs, where those specified a...
Trust and the transformation of energy systems
Energy Technology Data Exchange (ETDEWEB)
Rayner, Steve [James Martin Institute for Science and Civilization, Said Business School, Park End Street, Oxford, OX1 1HP (United Kingdom)
2010-06-15
The author looks at diverse concepts and roles of trust in the challenge of decarbonising energy systems, drawing on 25 years of personal experience in the fields of energy and environmental policy research. The paper focuses on three issues-public trust in science, institutional trust in making technology choices, and the idea that high-trust societies are more sustainable than those exhibiting low-trust. While trust is a key concept in understanding the public acceptability of technology choices, it is only one of a suite of interrelated concepts that must be addressed, which also includes liability, consent, and fairness. Furthermore, rational distrust among competing institutional world views may be critical in understanding the role of social capital in socioeconomic and technological development. Thus the concept of trust has become a portmanteau, carrying a diverse range of ideas and conditions for sustainable energy systems. The paper concludes with three emphases for decision makers. First, the issue is the energy system, not particular generating technologies. Second, the energy system must be recognized to be as much a social system as it is a technical one. Third, the system requires incorporation of the minimum level of diversity of engineering technologies and social actors to be sustainable. (author)
Trust and the transformation of energy systems
International Nuclear Information System (INIS)
Rayner, Steve
2010-01-01
The author looks at diverse concepts and roles of trust in the challenge of decarbonising energy systems, drawing on 25 years of personal experience in the fields of energy and environmental policy research. The paper focuses on three issues-public trust in science, institutional trust in making technology choices, and the idea that high-trust societies are more sustainable than those exhibiting low-trust. While trust is a key concept in understanding the public acceptability of technology choices, it is only one of a suite of interrelated concepts that must be addressed, which also includes liability, consent, and fairness. Furthermore, rational distrust among competing institutional world views may be critical in understanding the role of social capital in socioeconomic and technological development. Thus the concept of trust has become a portmanteau, carrying a diverse range of ideas and conditions for sustainable energy systems. The paper concludes with three emphases for decision makers. First, the issue is the energy system, not particular generating technologies. Second, the energy system must be recognized to be as much a social system as it is a technical one. Third, the system requires incorporation of the minimum level of diversity of engineering technologies and social actors to be sustainable.
Energy Technology Data Exchange (ETDEWEB)
Shin, Seung Ki [Div. of Research Reactor System Design, Korea Atomic Energy Research Institute, Daejeon (Korea, Republic of); No, Young Gyu; Seong, Poong Hyun [Dept. of Nuclear and Quantum Engineering, Korea Advanced Institute of Science and Technology, Daejeon (Korea, Republic of)
2016-04-15
The safety of nuclear power plants is analyzed by a probabilistic risk assessment, and the fault tree analysis is the most widely used method for a risk assessment with the event tree analysis. One of the well-known disadvantages of the fault tree is that drawing a fault tree for a complex system is a very cumbersome task. Thus, several graphical modeling methods have been proposed for the convenient and intuitive modeling of complex systems. In this paper, the reliability graph with general gates (RGGG) method, one of the intuitive graphical modeling methods based on Bayesian networks, is improved for the reliability analyses of dynamic systems that have various operation modes with time. A reliability matrix is proposed and it is explained how to utilize the reliability matrix in the RGGG for various cases of operation mode changes. The proposed RGGG with a reliability matrix provides a convenient and intuitive modeling of various operation modes of complex systems, and can also be utilized with dynamic nodes that analyze the failure sequences of subcomponents. The combinatorial use of a reliability matrix with dynamic nodes is illustrated through an application to a shutdown cooling system in a nuclear power plant.
International Nuclear Information System (INIS)
Shin, Seung Ki; No, Young Gyu; Seong, Poong Hyun
2016-01-01
The safety of nuclear power plants is analyzed by a probabilistic risk assessment, and the fault tree analysis is the most widely used method for a risk assessment with the event tree analysis. One of the well-known disadvantages of the fault tree is that drawing a fault tree for a complex system is a very cumbersome task. Thus, several graphical modeling methods have been proposed for the convenient and intuitive modeling of complex systems. In this paper, the reliability graph with general gates (RGGG) method, one of the intuitive graphical modeling methods based on Bayesian networks, is improved for the reliability analyses of dynamic systems that have various operation modes with time. A reliability matrix is proposed and it is explained how to utilize the reliability matrix in the RGGG for various cases of operation mode changes. The proposed RGGG with a reliability matrix provides a convenient and intuitive modeling of various operation modes of complex systems, and can also be utilized with dynamic nodes that analyze the failure sequences of subcomponents. The combinatorial use of a reliability matrix with dynamic nodes is illustrated through an application to a shutdown cooling system in a nuclear power plant
Open Graphs and Computational Reasoning
Directory of Open Access Journals (Sweden)
Lucas Dixon
2010-06-01
Full Text Available We present a form of algebraic reasoning for computational objects which are expressed as graphs. Edges describe the flow of data between primitive operations which are represented by vertices. These graphs have an interface made of half-edges (edges which are drawn with an unconnected end and enjoy rich compositional principles by connecting graphs along these half-edges. In particular, this allows equations and rewrite rules to be specified between graphs. Particular computational models can then be encoded as an axiomatic set of such rules. Further rules can be derived graphically and rewriting can be used to simulate the dynamics of a computational system, e.g. evaluating a program on an input. Examples of models which can be formalised in this way include traditional electronic circuits as well as recent categorical accounts of quantum information.
Quantum information processing with graph states
International Nuclear Information System (INIS)
Schlingemann, Dirk-Michael
2005-04-01
Graph states are multiparticle states which are associated with graphs. Each vertex of the graph corresponds to a single system or particle. The links describe quantum correlations (entanglement) between pairs of connected particles. Graph states were initiated independently by two research groups: On the one hand, graph states were introduced by Briegel and Raussendorf as a resource for a new model of one-way quantum computing, where algorithms are implemented by a sequence of measurements at single particles. On the other hand, graph states were developed by the author of this thesis and ReinhardWerner in Braunschweig, as a tool to build quantum error correcting codes, called graph codes. The connection between the two approaches was fully realized in close cooperation of both research groups. This habilitation thesis provides a survey of the theory of graph codes, focussing mainly, but not exclusively on the author's own research work. We present the theoretical and mathematical background for the analysis of graph codes. The concept of one-way quantum computing for general graph states is discussed. We explicitly show how to realize the encoding and decoding device of a graph code on a one-way quantum computer. This kind of implementation is to be seen as a mathematical description of a quantum memory device. In addition to that, we investigate interaction processes, which enable the creation of graph states on very large systems. Particular graph states can be created, for instance, by an Ising type interaction between next neighbor particles which sits at the points of an infinitely extended cubic lattice. Based on the theory of quantum cellular automata, we give a constructive characterization of general interactions which create a translationally invariant graph state. (orig.)
Chromatic polynomials of random graphs
International Nuclear Information System (INIS)
Van Bussel, Frank; Fliegner, Denny; Timme, Marc; Ehrlich, Christoph; Stolzenberg, Sebastian
2010-01-01
Chromatic polynomials and related graph invariants are central objects in both graph theory and statistical physics. Computational difficulties, however, have so far restricted studies of such polynomials to graphs that were either very small, very sparse or highly structured. Recent algorithmic advances (Timme et al 2009 New J. Phys. 11 023001) now make it possible to compute chromatic polynomials for moderately sized graphs of arbitrary structure and number of edges. Here we present chromatic polynomials of ensembles of random graphs with up to 30 vertices, over the entire range of edge density. We specifically focus on the locations of the zeros of the polynomial in the complex plane. The results indicate that the chromatic zeros of random graphs have a very consistent layout. In particular, the crossing point, the point at which the chromatic zeros with non-zero imaginary part approach the real axis, scales linearly with the average degree over most of the density range. While the scaling laws obtained are purely empirical, if they continue to hold in general there are significant implications: the crossing points of chromatic zeros in the thermodynamic limit separate systems with zero ground state entropy from systems with positive ground state entropy, the latter an exception to the third law of thermodynamics.
Hardware and software system for monitoring oil pump operation in power high-voltage transformers
Directory of Open Access Journals (Sweden)
Михайло Дмитрович Дяченко
2017-07-01
Full Text Available The article considers the basic prerequisites for the creation of an automated monitoring system for oil pumps of high-voltage transformers. This is due to the fact that the long operation of oil pumps results in deterioration and destruction of bearings, rubbing of the rotor, breakage and damage to the impeller, leakage, etc., which inevitably causes a significant decrease in the insulating properties of the transformer oil and leads to expenditures for its further recovery. False triggerings of gas protection sometimes occur. Continuous operation of the electric motor also requires additional equipment to protect the motor itself from various emergency situations, such as a short in the stator winding, a housing breakdown, an incomplete phase mode, etc. The use of stationary systems provides: diagnosing defects at an early stage of their development, increasing the reliability and longevity of the equipment components, increasing the overhaul period, decreasing the number of emergency stops, and adjusting the schedule of preventative maintenance. The basic principles of identification of the damaged part of the oil pump are given, the hardware and algorithmic solutions are considered in the work. The full-scale tests of the model sample on the power transformer of the high-voltage substation confirmed the assumption of the possibility of detecting the damaged unit separating it from the rest connected in one mechanical structure. A detailed analysis of the operation of each of the units is carried out by means of the general substation switchboard and displayed as graphs, diagrams and text messages. When the limit values of vibration are reached, faults in the operation of the unit are detected, the overlimit current values, a warning alarm is activated, and the command to disconnect the damaged unit is issued. The optimal solution for the organization of the information collection system using the principle of sensor networks, but combined
Diagnostic and Measuring Systems of the Power Transformers
Directory of Open Access Journals (Sweden)
Jan Michalik
2003-01-01
Full Text Available In the article the diagnostic and measuring systems dedicated for complex output tests of power transformers aswell as their diagnostic is dcscribcd. The aim of research in this area was to elaborate the problem of so-called open loop measuring system controlled by PC. The attribute "open" means the possibility to adapt the system for different electric equipment, different measurands and an zdaptation of the way of monitoring, evaluation and distribution of output information according to specific requirements the controlled transformer.
Establishment of an efficient transformation system for Pleurotus ostreatus.
Lei, Min; Wu, Xiangli; Zhang, Jinxia; Wang, Hexiang; Huang, Chenyang
2017-11-21
Pleurotus ostreatus is widely cultivated worldwide, but the lack of an efficient transformation system regarding its use restricts its genetic research. The present study developed an improved and efficient Agrobacterium tumefaciens-mediated transformation method in P. ostreatus. Four parameters were optimized to obtain the most efficient transformation method. The strain LBA4404 was the most suitable for the transformation of P. ostreatus. A bacteria-to-protoplast ratio of 100:1, an acetosyringone (AS) concentration of 0.1 mM, and 18 h of co-culture showed the best transformation efficiency. The hygromycin B phosphotransferase gene (HPH) was used as the selective marker, and EGFP was used as the reporter gene in this study. Southern blot analysis combined with EGFP fluorescence assay showed positive results, and mitotic stability assay showed that more than 75% transformants were stable after five generations. These results showed that our transformation method is effective and stable and may facilitate future genetic studies in P. ostreatus.
Transformation of Taiwan's Upper Secondary Education System
Directory of Open Access Journals (Sweden)
Hueih-Lirng Laih
1998-09-01
Full Text Available This paper explores the policy issues circling around the structural "transition" in upper secondary education implicit in the twenty-year increase in secondary and third-level school enrollment rates in Taiwan. This expansion has taken place within a secondary school system which is rigidly divided into both general, i.e., academic, and vocational tracks and into public and private sectors: the majority of students are enrolled in the private vocational sector which is only loosely articulated with the university sector. These features of the school system are analysed against the background of social and economic developments in Taiwan as well as public opinion. The analysis suggests that the present structures of school must be "reformed" in ways that will result in a more unified secondary system with both greater public funding and better articulation of all school types with the third level. The policy options that circle around the possibility of such reforms in the areas of curriculum, examination structures and second level-third level articulation are discussed and a policy framework for the reform of the Taiwan secondary education sector is outlined.
Bapat, Ravindra B
2014-01-01
This new edition illustrates the power of linear algebra in the study of graphs. The emphasis on matrix techniques is greater than in other texts on algebraic graph theory. Important matrices associated with graphs (for example, incidence, adjacency and Laplacian matrices) are treated in detail. Presenting a useful overview of selected topics in algebraic graph theory, early chapters of the text focus on regular graphs, algebraic connectivity, the distance matrix of a tree, and its generalized version for arbitrary graphs, known as the resistance matrix. Coverage of later topics include Laplacian eigenvalues of threshold graphs, the positive definite completion problem and matrix games based on a graph. Such an extensive coverage of the subject area provides a welcome prompt for further exploration. The inclusion of exercises enables practical learning throughout the book. In the new edition, a new chapter is added on the line graph of a tree, while some results in Chapter 6 on Perron-Frobenius theory are reo...
How to transform local energy systems towards bioenergy? Three strategy models for transformation
International Nuclear Information System (INIS)
Martensson, Kjell; Westerberg, Karin
2007-01-01
During the last decades, the actors within the energy sector in Sweden-as well as in many other countries-have faced increasing demands to transform the energy system towards ecological sustainability. In Sweden these demands have led to numerous policies and economic incentives promoting the use of renewables (which in the Swedish discourse often also includes a connotation of 'indigenous energy sources'), and especially the promotion of bioenergy. To be successful, however, these policies and economic incentives need to be interpreted and adapted to different local contexts and translated into actual transformation processes. In Sweden the municipal authorities have played an important role as interpreters of such institutional frameworks and implementers of local transformation processes. In this article, we re-construct three transformation processes implemented by local municipal authorities, chiselling out the different strategy models developed through them. We argue that such re-constructions help to make visible the different and complex interactions between national institutional frameworks and local contexts as well as interactions within such local contexts. We hope that the strategy models presented can contribute to the understanding of the different kinds of local actions that can foster a further implementation of bioenergy into the energy system
Energy transformation in molecular electronic systems
International Nuclear Information System (INIS)
Kasha, M.
1985-01-01
Our new optical pumping spectroscopy (steady state, and double-laser pulse) allows the production and study of the unstable rare tautomer in its ground and excited states, including picosecond dynamic studies. Molecules under study here included 7-azaindole (model for biological purines), 3-hydroxyflavone (model for plant flavones), lumichrome, and other heterocyclics. New detailed molecular mechanisms for proton transfer are derived, especially with catalytic assisting molecules. A new proton-transfer laser of extraordinary efficiency has become a side dividend, possibly worth of industrial development. The excited and highly reactive singlet molecular oxygen species 1 Δ/sub g/) has proven to be ubiquitous in chemical peroxide systems and in physically excited sensitizer-oxygen systems. Hyperbaric oxygen mechanisms in biology probably involve singlet oxygen. We have undertaken a spectroscopic study of tris - dibenzoylmethane chelates of Al, Gd, Eu, and Yb trivalent ions. These chelates offer a variety of electronic behaviors, from Z-effects on π-electron spin-orbital coupling (Al, Gd) to Weissman intramolecular energy transfer to 4f mestable levels (Eu, Gd). Elegant new spectroscopic resolution at 77K permits separation of tautomeric, parasitic self-absorption, dissociation, and cage effects to be resolved. 18 refs., 4 figs
Adaptive Graph Convolutional Neural Networks
Li, Ruoyu; Wang, Sheng; Zhu, Feiyun; Huang, Junzhou
2018-01-01
Graph Convolutional Neural Networks (Graph CNNs) are generalizations of classical CNNs to handle graph data such as molecular data, point could and social networks. Current filters in graph CNNs are built for fixed and shared graph structure. However, for most real data, the graph structures varies in both size and connectivity. The paper proposes a generalized and flexible graph CNN taking data of arbitrary graph structure as input. In that way a task-driven adaptive graph is learned for eac...
Transformation Planning of Ecotourism Systems to Invigorate Responsible Tourism
Yun Eui Choi; Minsun Doh; Samuel Park; Jinhyung Chon
2017-01-01
The purpose of this study is to introduce transformation plans that can stimulate responsible ecotourism by using systems thinking to solve ecotourism problems in Korea. Systems thinking is a research method used to understand the operating mechanisms of the variables that influence an entire system, in order to identify its problems. The four types of ecotourism systems are classified as follows: low-infrastructure and resident-initiated, high-infrastructure and resident-initiated, high-infr...
On-line Monitoring System for Power Transformers
Directory of Open Access Journals (Sweden)
Alexandru HOTEA
2016-12-01
Full Text Available Power transformers are the most important and expensive equipment from the electricity transmission system, so it is very important to know the real state of health of such equipment in every moment. De-energizing the power transformer accidentally due to internal defects can generate high costs. Annual maintenance proved to be ineffective in many cases to determine the internal condition of the equipment degradation due to faults rapidly evolving. An On-line Monitoring System for Power Transformers help real-time condition assessment and to detect errors early enough to take action to eliminate or minimize them. After abnormality detected, it is still important to perform full diagnostic tests to determine the exact condition of the equipment. On-line monitoring systems can help increase the level of availability and reliability of power transformers and lower costs of accidental interruption. This paper presents cases studies on several power transformers equipped with on-line monitoring systems from Transelectrica substation.
Directory of Open Access Journals (Sweden)
C. Dalfo
2015-10-01
Full Text Available We study a family of graphs related to the $n$-cube. The middle cube graph of parameter k is the subgraph of $Q_{2k-1}$ induced by the set of vertices whose binary representation has either $k-1$ or $k$ number of ones. The middle cube graphs can be obtained from the well-known odd graphs by doubling their vertex set. Here we study some of the properties of the middle cube graphs in the light of the theory of distance-regular graphs. In particular, we completely determine their spectra (eigenvalues and their multiplicities, and associated eigenvectors.
State Authorization Tracking System (StATS) - Data, Charts and Graphs
U.S. Environmental Protection Agency — The State Authorization Tracking System (StATS) is an information management system designed to document the progress of each state and territory in establishing and...
On the analysis of synchronous dataflow graphs: a system-theoretic perspective
de Groote, Robert
2016-01-01
In the design of real-time systems, time forms a key requirement in a system’s specification. System designers must be able to verify whether a system meets its timing demands or not, e.g., whether it responds to input within a specific time window, or whether it is able to process data at a given
Transforming Graphical System Models to Graphical Attack Models
DEFF Research Database (Denmark)
Ivanova, Marieta Georgieva; Probst, Christian W.; Hansen, Rene Rydhof
2016-01-01
Manually identifying possible attacks on an organisation is a complex undertaking; many different factors must be considered, and the resulting attack scenarios can be complex and hard to maintain as the organisation changes. System models provide a systematic representation of organisations...... approach to transforming graphical system models to graphical attack models in the form of attack trees. Based on an asset in the model, our transformations result in an attack tree that represents attacks by all possible actors in the model, after which the actor in question has obtained the asset....
Transformations in Air Transportation Systems For the 21st Century
Holmes, Bruce J.
2004-01-01
Globally, our transportation systems face increasingly discomforting realities: certain of the legacy air and ground infrastructures of the 20th century will not satisfy our 21st century mobility needs. The consequence of inaction is diminished quality of life and economic opportunity for those nations unable to transform from the 20th to 21st century systems. Clearly, new thinking is required regarding business models that cater to consumers value of time, airspace architectures that enable those new business models, and technology strategies for innovating at the system-of-networks level. This lecture proposes a structured way of thinking about transformation from the legacy systems of the 20th century toward new systems for the 21st century. The comparison and contrast between the legacy systems of the 20th century and the transformed systems of the 21st century provides insights into the structure of transformation of air transportation. Where the legacy systems tend to be analog (versus digital), centralized (versus distributed), and scheduled (versus on-demand) for example, transformed 21st century systems become capable of scalability through technological, business, and policy innovations. Where air mobility in our legacy systems of the 20th century brought economic opportunity and quality of life to large service markets, transformed air mobility of the 21st century becomes more equitable available to ever-thinner and widely distributed populations. Several technological developments in the traditional aircraft disciplines as well as in communication, navigation, surveillance and information systems create new foundations for 21st thinking about air transportation. One of the technological developments of importance arises from complexity science and modern network theory. Scale-free (i.e., scalable) networks represent a promising concept space for modeling airspace system architectures, and for assessing network performance in terms of robustness
Eigenfunction statistics on quantum graphs
International Nuclear Information System (INIS)
Gnutzmann, S.; Keating, J.P.; Piotet, F.
2010-01-01
We investigate the spatial statistics of the energy eigenfunctions on large quantum graphs. It has previously been conjectured that these should be described by a Gaussian Random Wave Model, by analogy with quantum chaotic systems, for which such a model was proposed by Berry in 1977. The autocorrelation functions we calculate for an individual quantum graph exhibit a universal component, which completely determines a Gaussian Random Wave Model, and a system-dependent deviation. This deviation depends on the graph only through its underlying classical dynamics. Classical criteria for quantum universality to be met asymptotically in the large graph limit (i.e. for the non-universal deviation to vanish) are then extracted. We use an exact field theoretic expression in terms of a variant of a supersymmetric σ model. A saddle-point analysis of this expression leads to the estimates. In particular, intensity correlations are used to discuss the possible equidistribution of the energy eigenfunctions in the large graph limit. When equidistribution is asymptotically realized, our theory predicts a rate of convergence that is a significant refinement of previous estimates. The universal and system-dependent components of intensity correlation functions are recovered by means of an exact trace formula which we analyse in the diagonal approximation, drawing in this way a parallel between the field theory and semiclassics. Our results provide the first instance where an asymptotic Gaussian Random Wave Model has been established microscopically for eigenfunctions in a system with no disorder.
Architectural transformations in network services and distributed systems
Luntovskyy, Andriy
2017-01-01
With the given work we decided to help not only the readers but ourselves, as the professionals who actively involved in the networking branch, with understanding the trends that have developed in recent two decades in distributed systems and networks. Important architecture transformations of distributed systems have been examined. The examples of new architectural solutions are discussed. Content Periodization of service development Energy efficiency Architectural transformations in Distributed Systems Clustering and Parallel Computing, performance models Cloud Computing, RAICs, Virtualization, SDN Smart Grid, Internet of Things, Fog Computing Mobile Communication from LTE to 5G, DIDO, SAT-based systems Data Security Guaranteeing Distributed Systems Target Groups Students in EE and IT of universities and (dual) technical high schools Graduated engineers as well as teaching staff About the Authors Andriy Luntovskyy provides classes on networks, mobile communication, software technology, distributed systems, ...
AC system stabilization via phase shift transformer with thyristor commutation
Energy Technology Data Exchange (ETDEWEB)
Oliveira, Jose Carlos de; Guimaraes, Geraldo Caixeta; Moraes, Adelio Jose [Uberlandia Univ., MG (Brazil); Abreu, Jose Policarpo G. de [Escola Federal de Engenharia de Itajuba, MG (Brazil); Oliveira, Edimar Jose de [Juiz de Fora Univ., MG (Brazil)
1994-12-31
This article aims to present initially the constructive and operative forms of a phase-shift autotransformer which provides both magnitude and phase angle change through thyristor commutation, including a technic to reduce the number of thyristors. Following, it is proposed a control system to make such equipment an efficient AC system stabilizing tool. It is presented some simulation results to show the operation of this transformer in an electrical system. (author) 3 refs., 11 figs., 3 tabs.
On Solving the Lorenz System by Differential Transformation Method
International Nuclear Information System (INIS)
Al-Sawalha, M. Mossa; Noorani, M. S. M.
2008-01-01
The differential transformation method (DTM) is employed to solve a nonlinear differential equation, namely the Lorenz system. Numerical results are compared to those obtained by the Runge–Kutta method to illustrate the preciseness and effectiveness of the proposed method. In particular, we examine the accuracy of the (DTM) as the Lorenz system changes from a non-chaotic system to a chaotic one. It is shown that the (DTM) is robust, accurate and easy to apply
Software System for Finding the Incipient Faults in Power Transformers
Directory of Open Access Journals (Sweden)
Nikolina Petkova
2015-05-01
Full Text Available In this paper a new software system for finding of incipient faultsis presented.An experiment is made with real measurement of partial discharge(PD that appeared in power transformer. The software system usesacquisition data to define the real state of this transformer. One of the most important criteria for the power transformer’s state is the presence of partial discharges. The wave propagation caused by partial discharge depends on scheme of the winding and construction of the power equipment. In all cases, the PD source had a specific position so the wave measured from the PD –coupling device had a specific waveform. The waveform is different when PDcoupling device is put on a specific place. The waveform and the time of propagation are criteria for the localization of the source of incipient faults in the volume of power transformer.
Transformers: Shape-Changing Space Systems Built with Robotic Textiles
Stoica, Adrian
2013-01-01
Prior approaches to transformer-like robots had only very limited success. They suffer from lack of reliability, ability to integrate large surfaces, and very modest change in overall shape. Robots can now be built from two-dimensional (2D) layers of robotic fabric. These transformers, a new kind of robotic space system, are dramatically different from current systems in at least two ways. First, the entire transformer is built from a single, thin sheet; a flexible layer of a robotic fabric (ro-fabric); or robotic textile (ro-textile). Second, the ro-textile layer is foldable to small volume and self-unfolding to adapt shape and function to mission phases.
Multi-rate equivalents of cyclo-static synchronous dataflow graphs
de Groote, Robert; Holzenspies, P.K.F.; Kuper, Jan; Smit, Gerardus Johannes Maria
In this paper, we present a transformation that takes a cyclo-static dataflow (CSDF) graph and produces an equivalent multi-rate synchronous dataflow (MRSDF) graph. This fills a gap in existing analysis techniques for synchronous dataflow graphs; transformations into equivalent homogeneous
Health System Transformation through a Scalable, Actionable Innovation Strategy.
Snowdon, Anne
2017-01-01
The authors who contributed to this issue of Healthcare Papers have provided rich insights into a promising innovation agenda to support transformational change aimed at achieving high-performing, person-centric health systems that are sustainable and deliver value. First and foremost, the commentaries make clear that a focused innovation agenda with defined goals, objectives and milestones is needed, if innovation is to be a viable and successful strategy to achieve health system transformation. To date, innovation has been a catch-all term for solving the many challenges health systems are experiencing. Yet, innovation on its own cannot fix all the ills of a health system; strategic goals and objectives are needed to define the way forward if innovation is to achieve value for Canadians. To this end, the authors identify goals and objectives that are worthy of serious consideration by all health system stakeholders.
Soetevent, A.R.
2010-01-01
This paper extends Hotelling's model of price competition with quadratic transportation costs from a line to graphs. I propose an algorithm to calculate firm-level demand for any given graph, conditional on prices and firm locations. One feature of graph models of price competition is that spatial
Graphing Inequalities, Connecting Meaning
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…
Directory of Open Access Journals (Sweden)
Amine Labriji
2017-07-01
Full Text Available The topic of identifying the similarity of graphs was considered as highly recommended research field in the Web semantic, artificial intelligence, the shape recognition and information research. One of the fundamental problems of graph databases is finding similar graphs to a graph query. Existing approaches dealing with this problem are usually based on the nodes and arcs of the two graphs, regardless of parental semantic links. For instance, a common connection is not identified as being part of the similarity of two graphs in cases like two graphs without common concepts, the measure of similarity based on the union of two graphs, or the one based on the notion of maximum common sub-graph (SCM, or the distance of edition of graphs. This leads to an inadequate situation in the context of information research. To overcome this problem, we suggest a new measure of similarity between graphs, based on the similarity measure of Wu and Palmer. We have shown that this new measure satisfies the properties of a measure of similarities and we applied this new measure on examples. The results show that our measure provides a run time with a gain of time compared to existing approaches. In addition, we compared the relevance of the similarity values obtained, it appears that this new graphs measure is advantageous and offers a contribution to solving the problem mentioned above.
van Dam, Edwin R.; Koolen, Jack H.; Tanaka, Hajime
2016-01-01
This is a survey of distance-regular graphs. We present an introduction to distance-regular graphs for the reader who is unfamiliar with the subject, and then give an overview of some developments in the area of distance-regular graphs since the monograph 'BCN'[Brouwer, A.E., Cohen, A.M., Neumaier,
Fuzzy Graph Language Recognizability
Kalampakas , Antonios; Spartalis , Stefanos; Iliadis , Lazaros
2012-01-01
Part 5: Fuzzy Logic; International audience; Fuzzy graph language recognizability is introduced along the lines of the established theory of syntactic graph language recognizability by virtue of the algebraic structure of magmoids. The main closure properties of the corresponding class are investigated and several interesting examples of fuzzy graph languages are examined.
Brouwer, A.E.; Haemers, W.H.
2012-01-01
This book gives an elementary treatment of the basic material about graph spectra, both for ordinary, and Laplace and Seidel spectra. The text progresses systematically, by covering standard topics before presenting some new material on trees, strongly regular graphs, two-graphs, association
A Transformer-less Single Phase Inverter For photovoltaic Systems
DEFF Research Database (Denmark)
Mostaan, Ali; Alizadeh, Ebrahim; Qu, Ying
2017-01-01
A single phase transformer-less inverter is introduced in this paper. The negative polarities of the input voltage and output terminal have common ground. Therefore, the leakage current problem that is common in PV systems is eliminated naturally. In addition, the proposed inverter has fewer comp...
Prevention Service System Transformation Using "Communities That Care"
Brown, Eric C.; Hawkins, J. David; Arthur, Michael W.; Briney, John S.; Fagan, Abigail A.
2011-01-01
This study examines prevention system transformation as part of a community-randomized controlled trial of Communities That Care (CTC). Using data from surveys of community leaders, we examine differences between CTC and control communities 4.5 years after CTC implementation. Significantly higher levels of adopting a science-based approach to…
Emotion regulation and conflict transformation in multi-team systems
Curseu, P.L.; Meeus, M.T.H.
2014-01-01
Purpose The aim of this paper is to test the moderating role of emotion regulation in the transformation of both task and process conflict into relationship conflict. Design/methodology/approach A field study of multi-teams systems, in which (94) respondents are engaged in interpersonal and
Directory of Open Access Journals (Sweden)
William E. Butler
2014-09-01
Full Text Available The Richard Floor Biorepository supports collaborative studies of extracellular vesicles (EVs found in human fluids and tissue specimens. The current emphasis is on biomarkers for central nervous system neoplasms but its structure may serve as a template for collaborative EV translational studies in other fields. The informatic system provides specimen inventory tracking with bar codes assigned to specimens and containers and projects, is hosted on globalized cloud computing resources, and embeds a suite of shared documents, calendars, and video-conferencing features. Clinical data are recorded in relation to molecular EV attributes and may be tagged with terms drawn from a network of externally maintained ontologies thus offering expansion of the system as the field matures. We fashioned the graphical user interface (GUI around a web-based data visualization package. This system is now in an early stage of deployment, mainly focused on specimen tracking and clinical, laboratory, and imaging data capture in support of studies to optimize detection and analysis of brain tumour–specific mutations. It currently includes 4,392 specimens drawn from 611 subjects, the majority with brain tumours. As EV science evolves, we plan biorepository changes which may reflect multi-institutional collaborations, proteomic interfaces, additional biofluids, changes in operating procedures and kits for specimen handling, novel procedures for detection of tumour-specific EVs, and for RNA extraction and changes in the taxonomy of EVs. We have used an ontology-driven data model and web-based architecture with a graph theory–driven GUI to accommodate and stimulate the semantic web of EV science.
Butler, William E.; Atai, Nadia; Carter, Bob; Hochberg, Fred
2014-01-01
The Richard Floor Biorepository supports collaborative studies of extracellular vesicles (EVs) found in human fluids and tissue specimens. The current emphasis is on biomarkers for central nervous system neoplasms but its structure may serve as a template for collaborative EV translational studies in other fields. The informatic system provides specimen inventory tracking with bar codes assigned to specimens and containers and projects, is hosted on globalized cloud computing resources, and embeds a suite of shared documents, calendars, and video-conferencing features. Clinical data are recorded in relation to molecular EV attributes and may be tagged with terms drawn from a network of externally maintained ontologies thus offering expansion of the system as the field matures. We fashioned the graphical user interface (GUI) around a web-based data visualization package. This system is now in an early stage of deployment, mainly focused on specimen tracking and clinical, laboratory, and imaging data capture in support of studies to optimize detection and analysis of brain tumour–specific mutations. It currently includes 4,392 specimens drawn from 611 subjects, the majority with brain tumours. As EV science evolves, we plan biorepository changes which may reflect multi-institutional collaborations, proteomic interfaces, additional biofluids, changes in operating procedures and kits for specimen handling, novel procedures for detection of tumour-specific EVs, and for RNA extraction and changes in the taxonomy of EVs. We have used an ontology-driven data model and web-based architecture with a graph theory–driven GUI to accommodate and stimulate the semantic web of EV science. PMID:25317275
Butler, William E; Atai, Nadia; Carter, Bob; Hochberg, Fred
2014-01-01
The Richard Floor Biorepository supports collaborative studies of extracellular vesicles (EVs) found in human fluids and tissue specimens. The current emphasis is on biomarkers for central nervous system neoplasms but its structure may serve as a template for collaborative EV translational studies in other fields. The informatic system provides specimen inventory tracking with bar codes assigned to specimens and containers and projects, is hosted on globalized cloud computing resources, and embeds a suite of shared documents, calendars, and video-conferencing features. Clinical data are recorded in relation to molecular EV attributes and may be tagged with terms drawn from a network of externally maintained ontologies thus offering expansion of the system as the field matures. We fashioned the graphical user interface (GUI) around a web-based data visualization package. This system is now in an early stage of deployment, mainly focused on specimen tracking and clinical, laboratory, and imaging data capture in support of studies to optimize detection and analysis of brain tumour-specific mutations. It currently includes 4,392 specimens drawn from 611 subjects, the majority with brain tumours. As EV science evolves, we plan biorepository changes which may reflect multi-institutional collaborations, proteomic interfaces, additional biofluids, changes in operating procedures and kits for specimen handling, novel procedures for detection of tumour-specific EVs, and for RNA extraction and changes in the taxonomy of EVs. We have used an ontology-driven data model and web-based architecture with a graph theory-driven GUI to accommodate and stimulate the semantic web of EV science.
Replica methods for loopy sparse random graphs
International Nuclear Information System (INIS)
Coolen, ACC
2016-01-01
I report on the development of a novel statistical mechanical formalism for the analysis of random graphs with many short loops, and processes on such graphs. The graphs are defined via maximum entropy ensembles, in which both the degrees (via hard constraints) and the adjacency matrix spectrum (via a soft constraint) are prescribed. The sum over graphs can be done analytically, using a replica formalism with complex replica dimensions. All known results for tree-like graphs are recovered in a suitable limit. For loopy graphs, the emerging theory has an appealing and intuitive structure, suggests how message passing algorithms should be adapted, and what is the structure of theories describing spin systems on loopy architectures. However, the formalism is still largely untested, and may require further adjustment and refinement. (paper)
Role of graph architecture in controlling dynamical networks with applications to neural systems
Kim, Jason Z.; Soffer, Jonathan M.; Kahn, Ari E.; Vettel, Jean M.; Pasqualetti, Fabio; Bassett, Danielle S.
2018-01-01
Networked systems display complex patterns of interactions between components. In physical networks, these interactions often occur along structural connections that link components in a hard-wired connection topology, supporting a variety of system-wide dynamical behaviours such as synchronization. Although descriptions of these behaviours are important, they are only a first step towards understanding and harnessing the relationship between network topology and system behaviour. Here, we use linear network control theory to derive accurate closed-form expressions that relate the connectivity of a subset of structural connections (those linking driver nodes to non-driver nodes) to the minimum energy required to control networked systems. To illustrate the utility of the mathematics, we apply this approach to high-resolution connectomes recently reconstructed from Drosophila, mouse, and human brains. We use these principles to suggest an advantage of the human brain in supporting diverse network dynamics with small energetic costs while remaining robust to perturbations, and to perform clinically accessible targeted manipulation of the brain's control performance by removing single edges in the network. Generally, our results ground the expectation of a control system's behaviour in its network architecture, and directly inspire new directions in network analysis and design via distributed control.
Survey of Approaches to Generate Realistic Synthetic Graphs
Energy Technology Data Exchange (ETDEWEB)
Lim, Seung-Hwan [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Lee, Sangkeun [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Powers, Sarah S [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Shankar, Mallikarjun [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Imam, Neena [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)
2016-10-01
A graph is a flexible data structure that can represent relationships between entities. As with other data analysis tasks, the use of realistic graphs is critical to obtaining valid research results. Unfortunately, using the actual ("real-world") graphs for research and new algorithm development is difficult due to the presence of sensitive information in the data or due to the scale of data. This results in practitioners developing algorithms and systems that employ synthetic graphs instead of real-world graphs. Generating realistic synthetic graphs that provide reliable statistical confidence to algorithmic analysis and system evaluation involves addressing technical hurdles in a broad set of areas. This report surveys the state of the art in approaches to generate realistic graphs that are derived from fitted graph models on real-world graphs.
International Nuclear Information System (INIS)
Vilardy, Juan M; Millán, María S; Pérez-Cabré, Elisabet; Torres, Yezid
2014-01-01
We propose a generalization of the encryption system based on double random phase encoding (DRPE) and a joint transform correlator (JTC), from the Fourier domain to the fractional Fourier domain (FrFD) by using the fractional Fourier operators, such as the fractional Fourier transform (FrFT), fractional traslation, fractional convolution and fractional correlation. Image encryption systems based on a JTC architecture in the FrFD usually produce low quality decrypted images. In this work, we present two approaches to improve the quality of the decrypted images, which are based on nonlinear processing applied to the encrypted function (that contains the joint fractional power spectrum, JFPS) and the nonzero-order JTC in the FrFD. When the two approaches are combined, the quality of the decrypted image is higher. In addition to the advantages introduced by the implementation of the DRPE using a JTC, we demonstrate that the proposed encryption system in the FrFD preserves the shift-invariance property of the JTC-based encryption system in the Fourier domain, with respect to the lateral displacement of both the key random mask in the decryption process and the retrieval of the primary image. The feasibility of this encryption system is verified and analyzed by computer simulations. (paper)
Fourier transform infrared spectra applications to chemical systems
Ferraro, John R
1978-01-01
Fourier Transform Infrared Spectroscopy: Applications to Chemical Systems presents the chemical applications of the Fourier transform interferometry (FT-IR).The book contains discussions on the applications of FT-IR in the fields of chromatography FT-IR, polymers and biological macromolecules, emission spectroscopy, matrix isolation, high-pressure interferometry, and far infrared interferometry. The final chapter is devoted to the presentation of the use of FT-IR in solving national technical problems such as air pollution, space exploration, and energy related subjects.Researc
Model Transformation for a System of Systems Dependability Safety Case
Murphy, Judy; Driskell, Steve
2011-01-01
The presentation reviews the dependability and safety effort of NASA's Independent Verification and Validation Facility. Topics include: safety engineering process, applications to non-space environment, Phase I overview, process creation, sample SRM artifact, Phase I end result, Phase II model transformation, fault management, and applying Phase II to individual projects.
Directory of Open Access Journals (Sweden)
Hossien Pourghassem
2011-04-01
Full Text Available Relevance feedback approaches is used to improve the performance of content-based image retrieval systems. In this paper, a novel relevance feedback approach based on similarity measure modification in an X-ray image retrieval system based on fuzzy representation using fuzzy attributed relational graph (FARG is presented. In this approach, optimum weight of each feature in feature vector is calculated using similarity rate between query image and relevant and irrelevant images in user feedback. The calculated weight is used to tune fuzzy graph matching algorithm as a modifier parameter in similarity measure. The standard deviation of the retrieved image features is applied to calculate the optimum weight. The proposed image retrieval system uses a FARG for representation of images, a fuzzy matching graph algorithm as similarity measure and a semantic classifier based on merging scheme for determination of the search space in image database. To evaluate relevance feedback approach in the proposed system, a standard X-ray image database consisting of 10000 images in 57 classes is used. The improvement of the evaluation parameters shows proficiency and efficiency of the proposed system.
Fourier transform digital holographic adaptive optics imaging system
Liu, Changgeng; Yu, Xiao; Kim, Myung K.
2013-01-01
A Fourier transform digital holographic adaptive optics imaging system and its basic principles are proposed. The CCD is put at the exact Fourier transform plane of the pupil of the eye lens. The spherical curvature introduced by the optics except the eye lens itself is eliminated. The CCD is also at image plane of the target. The point-spread function of the system is directly recorded, making it easier to determine the correct guide-star hologram. Also, the light signal will be stronger at the CCD, especially for phase-aberration sensing. Numerical propagation is avoided. The sensor aperture has nothing to do with the resolution and the possibility of using low coherence or incoherent illumination is opened. The system becomes more efficient and flexible. Although it is intended for ophthalmic use, it also shows potential application in microscopy. The robustness and feasibility of this compact system are demonstrated by simulations and experiments using scattering objects. PMID:23262541
Housing First and Photovoice: Transforming Lives, Communities, and Systems
Barile, John P.; Ogawa, Terry Yasuko; Peralta, Nelson; Bugg, Reumell; Lau, John; Lamberton, Thomas; Hall, Corazon; Mori, Victor
2018-01-01
This article presents findings from a community-based participatory evaluation of a Housing First program on the Island of O’ahu. In this study, clients in a Housing First program used Photovoice to evaluate the program and to advocate for progressive housing policies. Written together by members of the Housing First Photovoice group, this collaborative article describes the outcomes from both the Housing First program and the Photovoice project and demonstrates the ways in which participatory program evaluations can interact with client-driven programs like Housing First to produce a cumulative, transformative impact. Findings suggest that community psychologists hoping to re-engage with community mental health systems through enacting transformative change should consider taking a community-based participatory approach to program evaluation because increased client voice in community mental health programs and their evaluations can have far-reaching, transformative impacts for research, practice, and policy. PMID:29323410
Transformation of fraud activities in procurement system in Indonesia
Setiani, N.; Huda, S. N.; Pulungan, R.; Winarko, E.
2017-03-01
E-procurement has been applied in Indonesia since 2008 through the adoption of Electronic Procurement System (SPSE). The purpose of the use of SPSE in the procurement process is to improve the efficiency of goods or services procurement. In the bidding process, intensive communication and data exchange between providers and organizers are urgently needed. Through SPSE, the frequency of face to face meetings between providers and the committee can be reduced. This is expected to minimize potential fraud behaviors in the goods or services procurement conducted through the tender process. There exists a transformation of activities in the procurement through SPSE from the tender process that was previously done manually. In this paper, we analyze this transformation between manual procurement process and SPSE-based procurement process. The result of the analysis is exploited for investigating the possibility of fraud behavior transformations in every phase of e-procurement activities.
Transforming Systems Engineering through Model-Centric Engineering
2018-02-28
Contract No. HQ0034-13-D-0004 Research Tasks: 48, 118, 141, 157, 170 Report No. SERC-2018-TR-103 Transforming Systems Engineering through...Model-Centric Engineering Technical Report SERC-2018-TR-103 February 28, 2018 Principal Investigator Dr. Mark Blackburn, Stevens Institute of...Systems Engineering Research Center This material is based upon work supported, in whole or in part, by the U.S. Department of Defense through the
PRIVATE GRAPHS – ACCESS RIGHTS ON GRAPHS FOR SEAMLESS NAVIGATION
Directory of Open Access Journals (Sweden)
W. Dorner
2016-06-01
Full Text Available After the success of GNSS (Global Navigational Satellite Systems and navigation services for public streets, indoor seems to be the next big development in navigational services, relying on RTLS – Real Time Locating Services (e.g. WIFI and allowing seamless navigation. In contrast to navigation and routing services on public streets, seamless navigation will cause an additional challenge: how to make routing data accessible to defined users or restrict access rights for defined areas or only to parts of the graph to a defined user group? The paper will present case studies and data from literature, where seamless and especially indoor navigation solutions are presented (hospitals, industrial complexes, building sites, but the problem of restricted access rights was only touched from a real world, but not a technical perspective. The analysis of case studies will show, that the objective of navigation and the different target groups for navigation solutions will demand well defined access rights and require solutions, how to make only parts of a graph to a user or application available to solve a navigational task. The paper will therefore introduce the concept of private graphs, which is defined as a graph for navigational purposes covering the street, road or floor network of an area behind a public street and suggest different approaches how to make graph data for navigational purposes available considering access rights and data protection, privacy and security issues as well.
Hell, Pavol
2004-01-01
This is a book about graph homomorphisms. Graph theory is now an established discipline but the study of graph homomorphisms has only recently begun to gain wide acceptance and interest. The subject gives a useful perspective in areas such as graph reconstruction, products, fractional and circular colourings, and has applications in complexity theory, artificial intelligence, telecommunication, and, most recently, statistical physics.Based on the authors' lecture notes for graduate courses, this book can be used as a textbook for a second course in graph theory at 4th year or master's level an
Zhang, Ke; Jiang, Bin; Shi, Peng
2017-02-01
In this paper, a novel adjustable parameter (AP)-based distributed fault estimation observer (DFEO) is proposed for multiagent systems (MASs) with the directed communication topology. First, a relative output estimation error is defined based on the communication topology of MASs. Then a DFEO with AP is constructed with the purpose of improving the accuracy of fault estimation. Based on H ∞ and H 2 with pole placement, multiconstrained design is given to calculate the gain of DFEO. Finally, simulation results are presented to illustrate the feasibility and effectiveness of the proposed DFEO design with AP.
Simplicial complexes of graphs
Jonsson, Jakob
2008-01-01
A graph complex is a finite family of graphs closed under deletion of edges. Graph complexes show up naturally in many different areas of mathematics, including commutative algebra, geometry, and knot theory. Identifying each graph with its edge set, one may view a graph complex as a simplicial complex and hence interpret it as a geometric object. This volume examines topological properties of graph complexes, focusing on homotopy type and homology. Many of the proofs are based on Robin Forman's discrete version of Morse theory. As a byproduct, this volume also provides a loosely defined toolbox for attacking problems in topological combinatorics via discrete Morse theory. In terms of simplicity and power, arguably the most efficient tool is Forman's divide and conquer approach via decision trees; it is successfully applied to a large number of graph and digraph complexes.
A SUSTAINABLE HEALTH CARE SYSTEM REQUIRES MANAGEMENT TRANSFORMATION
Directory of Open Access Journals (Sweden)
Kanellopoulos Dimitros
2011-12-01
Full Text Available In order to be the health care system sustainable , management transformations must be based on very precise diagnostic analysis that includes complete and current information. It is necessary to implement an information system that collects information in real time, that watches the parameters that significantly influence the sustainability of the system. Such an information system should point out a radiography(a scan of the system at some time under following aspects:: 1. An overview of system; 2 An overview of the economic situation; 3 A technical presentation ;4. A legal overview; 5. A social overview ; 6. A management overview .Based on these Xrays of the health system, it outlines a series of conclusions and recommendations together with a SWOT analysis that highlights the potential internal (strengths and weaknesses and external potential (opportunities and threats. Based on this analysis and recommendations, the management is going to redesign the system in order to be adapted to the changing environmental requirements. Management transformation is recommended to be by following steps. :1. The development of a new management system that would make a positive change in the health care system 2. Implementation of the new management system 3. Assessment of the changes
Inferring ontology graph structures using OWL reasoning
Rodriguez-Garcia, Miguel Angel
2018-01-05
Ontologies are representations of a conceptualization of a domain. Traditionally, ontologies in biology were represented as directed acyclic graphs (DAG) which represent the backbone taxonomy and additional relations between classes. These graphs are widely exploited for data analysis in the form of ontology enrichment or computation of semantic similarity. More recently, ontologies are developed in a formal language such as the Web Ontology Language (OWL) and consist of a set of axioms through which classes are defined or constrained. While the taxonomy of an ontology can be inferred directly from the axioms of an ontology as one of the standard OWL reasoning tasks, creating general graph structures from OWL ontologies that exploit the ontologies\\' semantic content remains a challenge.We developed a method to transform ontologies into graphs using an automated reasoner while taking into account all relations between classes. Searching for (existential) patterns in the deductive closure of ontologies, we can identify relations between classes that are implied but not asserted and generate graph structures that encode for a large part of the ontologies\\' semantic content. We demonstrate the advantages of our method by applying it to inference of protein-protein interactions through semantic similarity over the Gene Ontology and demonstrate that performance is increased when graph structures are inferred using deductive inference according to our method. Our software and experiment results are available at http://github.com/bio-ontology-research-group/Onto2Graph .Onto2Graph is a method to generate graph structures from OWL ontologies using automated reasoning. The resulting graphs can be used for improved ontology visualization and ontology-based data analysis.
Inferring ontology graph structures using OWL reasoning.
Rodríguez-García, Miguel Ángel; Hoehndorf, Robert
2018-01-05
Ontologies are representations of a conceptualization of a domain. Traditionally, ontologies in biology were represented as directed acyclic graphs (DAG) which represent the backbone taxonomy and additional relations between classes. These graphs are widely exploited for data analysis in the form of ontology enrichment or computation of semantic similarity. More recently, ontologies are developed in a formal language such as the Web Ontology Language (OWL) and consist of a set of axioms through which classes are defined or constrained. While the taxonomy of an ontology can be inferred directly from the axioms of an ontology as one of the standard OWL reasoning tasks, creating general graph structures from OWL ontologies that exploit the ontologies' semantic content remains a challenge. We developed a method to transform ontologies into graphs using an automated reasoner while taking into account all relations between classes. Searching for (existential) patterns in the deductive closure of ontologies, we can identify relations between classes that are implied but not asserted and generate graph structures that encode for a large part of the ontologies' semantic content. We demonstrate the advantages of our method by applying it to inference of protein-protein interactions through semantic similarity over the Gene Ontology and demonstrate that performance is increased when graph structures are inferred using deductive inference according to our method. Our software and experiment results are available at http://github.com/bio-ontology-research-group/Onto2Graph . Onto2Graph is a method to generate graph structures from OWL ontologies using automated reasoning. The resulting graphs can be used for improved ontology visualization and ontology-based data analysis.
Study of alloy crystallization in systems undergoing peritectic transformations
International Nuclear Information System (INIS)
Psarev, V.I.; Kirij, V.G.; Kuznetsov, A.V.; Psareva, I.V.; Ivanov, A.L.
1982-01-01
Studies into Ge-Te, In-Te, Al-Mn, Sb-Zn, Sn-Au systems are carried out at melt cooling rates from 50 deg/h to 10 5 deg/h to establish regularities in stable and metastable crystallization of alloys undergoing peritectic transformations. Methods of metallographic, X-ray phase and X-ray diffraction analyses are used. Differentiation in types of peritectic transformations is made through their mechanisms under equilibrium and non-equilibrium crystallization conditions for various alloy systems. It is found out that ability to supercooling even at low or moderate cooling rates for Te-Ge and Te-In system melts can be one of the main indication of the possibility of amorphous alloy formation [ru
Transformational change in health care systems: an organizational model.
Lukas, Carol VanDeusen; Holmes, Sally K; Cohen, Alan B; Restuccia, Joseph; Cramer, Irene E; Shwartz, Michael; Charns, Martin P
2007-01-01
The Institute of Medicine's 2001 report Crossing the Quality Chasm argued for fundamental redesign of the U.S. health care system. Six years later, many health care organizations have embraced the report's goals, but few have succeeded in making the substantial transformations needed to achieve those aims. This article offers a model for moving organizations from short-term, isolated performance improvements to sustained, reliable, organization-wide, and evidence-based improvements in patient care. Longitudinal comparative case studies were conducted in 12 health care systems using a mixed-methods evaluation design based on semistructured interviews and document review. Participating health care systems included seven systems funded through the Robert Wood Johnson Foundation's Pursuing Perfection Program and five systems with long-standing commitments to improvement and high-quality care. Five interactive elements appear critical to successful transformation of patient care: (1) Impetus to transform; (2) Leadership commitment to quality; (3) Improvement initiatives that actively engage staff in meaningful problem solving; (4) Alignment to achieve consistency of organization goals with resource allocation and actions at all levels of the organization; and (5) Integration to bridge traditional intra-organizational boundaries among individual components. These elements drive change by affecting the components of the complex health care organization in which they operate: (1) Mission, vision, and strategies that set its direction and priorities; (2) Culture that reflects its informal values and norms; (3) Operational functions and processes that embody the work done in patient care; and (4) Infrastructure such as information technology and human resources that support the delivery of patient care. Transformation occurs over time with iterative changes being sustained and spread across the organization. The conceptual model holds promise for guiding health care
Performance versus Values in Sustainability Transformation of Food Systems
Directory of Open Access Journals (Sweden)
Hugo F. Alrøe
2017-02-01
Full Text Available Questions have been raised on what role the knowledge provided by sustainability science actually plays in the transition to sustainability and what role it may play in the future. In this paper we investigate different approaches to sustainability transformation of food systems by analyzing the rationale behind transformative acts-the ground that the direct agents of change act upon- and how the type of rationale is connected to the role of research and how the agents of change are involved. To do this we employ Max Weber’s distinction between instrumental rationality and value-rationality in social action. In particular, we compare two different approaches to the role of research in sustainability transformation: (1 Performance-based approaches that measure performance and set up sustainability indicator targets and benchmarks to motivate the agents in the food system to change; (2 Values-based approaches that aim at communicating and mediating sustainability values to enable coordinated and cooperative action to transform the food system. We identify their respective strengths and weaknesses based on a cross-case analysis of four cases, and propose that the two approaches, like Weber’s two types of rationality, are complementary-because they are based on complementary observer stances—and that an optimal in-between approach therefore cannot be found. However, there are options for reflexive learning by observing one perspective-and its possible blind spots-from the vantage point of the other, so we suggest that new strategies for sustainability transformation can be found based on reflexive rationality as a third and distinct type of rationality.
Hierarchical organisation of causal graphs
International Nuclear Information System (INIS)
Dziopa, P.
1993-01-01
This paper deals with the design of a supervision system using a hierarchy of models formed by graphs, in which the variables are the nodes and the causal relations between the variables of the arcs. To obtain a representation of the variables evolutions which contains only the relevant features of their real evolutions, the causal relations are completed with qualitative transfer functions (QTFs) which produce roughly the behaviour of the classical transfer functions. Major improvements have been made in the building of the hierarchical organization. First, the basic variables of the uppermost level and the causal relations between them are chosen. The next graph is built by adding intermediary variables to the upper graph. When the undermost graph has been built, the transfer functions parameters corresponding to its causal relations are identified. The second task consists in the upwelling of the information from the undermost graph to the uppermost one. A fusion procedure of the causal relations has been designed to compute the QFTs relevant for each level. This procedure aims to reduce the number of parameters needed to represent an evolution at a high level of abstraction. These techniques have been applied to the hierarchical modelling of nuclear process. (authors). 8 refs., 12 figs
A Demonstration of the Grrr Graph Rewriting Programming Language
Rodgers, Peter; Vidal, Natalia
2000-01-01
This paper overviews the graph rewriting programming language, Grrr. The serial graph rewriting strategy is detailed, and key elements of the user interface are described. The system is illustrated by a simple example.
Simplifying Scalable Graph Processing with a Domain-Specific Language
Hong, Sungpack; Salihoglu, Semih; Widom, Jennifer; Olukotun, Kunle
2014-01-01
Large-scale graph processing, with its massive data sets, requires distributed processing. However, conventional frameworks for distributed graph processing, such as Pregel, use non-traditional programming models that are well-suited for parallelism and scalability but inconvenient for implementing non-trivial graph algorithms. In this paper, we use Green-Marl, a Domain-Specific Language for graph analysis, to intuitively describe graph algorithms and extend its compiler to generate equivalent Pregel implementations. Using the semantic information captured by Green-Marl, the compiler applies a set of transformation rules that convert imperative graph algorithms into Pregel's programming model. Our experiments show that the Pregel programs generated by the Green-Marl compiler perform similarly to manually coded Pregel implementations of the same algorithms. The compiler is even able to generate a Pregel implementation of a complicated graph algorithm for which a manual Pregel implementation is very challenging.
Simplifying Scalable Graph Processing with a Domain-Specific Language
Hong, Sungpack
2014-01-01
Large-scale graph processing, with its massive data sets, requires distributed processing. However, conventional frameworks for distributed graph processing, such as Pregel, use non-traditional programming models that are well-suited for parallelism and scalability but inconvenient for implementing non-trivial graph algorithms. In this paper, we use Green-Marl, a Domain-Specific Language for graph analysis, to intuitively describe graph algorithms and extend its compiler to generate equivalent Pregel implementations. Using the semantic information captured by Green-Marl, the compiler applies a set of transformation rules that convert imperative graph algorithms into Pregel\\'s programming model. Our experiments show that the Pregel programs generated by the Green-Marl compiler perform similarly to manually coded Pregel implementations of the same algorithms. The compiler is even able to generate a Pregel implementation of a complicated graph algorithm for which a manual Pregel implementation is very challenging.
Overvoltages related to distributed generation-power system interconnection transformer
Energy Technology Data Exchange (ETDEWEB)
Zamanillo, G.R.; Gomez, J.C.; Florena, E.F. [Rio Cuarto National University (IPSEP/UNRC), Cordoba (Argentina). Electric Power Systems Protection Institute], Email: jcgomez@ing.unrc.edu.ar
2009-07-01
The energy crisis that experiences the world drives to carry to an extreme, the use of all energy sources which are available. The sources need to be connected to the electric network in their next point, requiring of electric-electronic interfaces. The traditional electric power systems are changing their characteristics, in what concerns to structure, operation and on overvoltage generation. This change is not taking place in coordinated form among the involved sectors. The interconnection of a Distributed Generator (DG) directly with the power system is objectionable and risky. It is required of an interconnection transformer which performs several functions. Rigid specifications do not exist in this respect, for the variety of systems in use in the world, nevertheless there are utilities recommendations. Overvoltages caused by the DG, which arise due to the change of structure of the electric system, are explained. The transformer connection selection, presents positive and negative aspects that impact the utility and the user in a different or many times in an antagonistic way. The phenomenon of balanced and unbalanced ferroresonance overvoltage is studied. This phenomenon can takes place when using DG, either with synchronous or asynchronous generator, and for any type of connection of the transformer. The necessary conditions so that the phenomenon appears are presented. Eight interconnection transformer connection ways were studied. It is concluded that the solutions to reach by means of the employment of the DG, offer technical-economic advantages so much to the utility as to the user. It is also concluded in this work that the more advisable interconnection type is function of the system connection type. (author)
Transformation Planning of Ecotourism Systems to Invigorate Responsible Tourism
Directory of Open Access Journals (Sweden)
Yun Eui Choi
2017-12-01
Full Text Available The purpose of this study is to introduce transformation plans that can stimulate responsible ecotourism by using systems thinking to solve ecotourism problems in Korea. Systems thinking is a research method used to understand the operating mechanisms of the variables that influence an entire system, in order to identify its problems. The four types of ecotourism systems are classified as follows: low-infrastructure and resident-initiated, high-infrastructure and resident-initiated, high-infrastructure and government-initiated and low-infrastructure and government-initiated. These systems vary based on the need for tourism facilities and the form of governance. Each type of system is analyzed using the systems thinking process (dynamic thinking, causal thinking, feedback thinking, strategic thinking at representative ecotourism sites in Jeollanam-do and the following transformation plans are proposed to improve the responsibility at the tourism sites: First, local residents will develop a system to manage and operate ecotourism ventures and establish cooperative governance structures to strengthen the local capacity. Second, ecotourism operators will improve the quality of their educational and interpretative programs and tourist information platforms in order to raise awareness of the responsibilities of ecotourists. Third, ecotourism systems that are improved through ecotourists’ and tour operators' heightened senses of responsibility can sustain ecotourism independently. These transformation plans can be applied to policy proposals for revitalizing ecotourism, to guidelines for improving community resilience and to biological habitat protection plans. This study is meaningful in that it discusses the role of stakeholders in ecotourism planning and promoting responsible tourism and their role in utilizing and conserving natural resources accordingly.
Discrete Wavelet Transform for Fault Locations in Underground Distribution System
Apisit, C.; Ngaopitakkul, A.
2010-10-01
In this paper, a technique for detecting faults in underground distribution system is presented. Discrete Wavelet Transform (DWT) based on traveling wave is employed in order to detect the high frequency components and to identify fault locations in the underground distribution system. The first peak time obtained from the faulty bus is employed for calculating the distance of fault from sending end. The validity of the proposed technique is tested with various fault inception angles, fault locations and faulty phases. The result is found that the proposed technique provides satisfactory result and will be very useful in the development of power systems protection scheme.
Pulse design for multilevel systems by utilizing Lie transforms
Kang, Yi-Hao; Chen, Ye-Hong; Shi, Zhi-Cheng; Huang, Bi-Hua; Song, Jie; Xia, Yan
2018-03-01
We put forward a scheme to design pulses to manipulate multilevel systems with Lie transforms. A formula to reverse construct a control Hamiltonian is given and is applied in pulse design in the three- and four-level systems as examples. To demonstrate the validity of the scheme, we perform numerical simulations, which show the population transfers for cascaded three-level and N -type four-level Rydberg atoms can be completed successfully with high fidelities. Therefore, the scheme may benefit quantum information tasks based on multilevel systems.
Performance versus values in sustainability transformation of food systems
DEFF Research Database (Denmark)
Alrøe, Hugo F.; Sautier, Marion; Legun, Katharine
2017-01-01
Questions have been raised on what role the knowledge provided by sustainability science actually plays in the transition to sustainability and what role it may play in the future. In this paper we investigate different approaches to sustainability transformation of food systems by analyzing......-based approaches that aim at communicating and mediating sustainability values to enable coordinated and cooperative action to transform the food system. We identify their respective strengths and weaknesses based on a cross-case analysis of four cases, and propose that the two approaches, likeWeber's two types...... of rationality, are complementary-because they are based on complementary observer stances-and that an optimal in-between approach therefore cannot be found. However, there are options for reflexive learning by observing one perspective-and its possible blind spots-from the vantage point of the other, so we...
Energy Technology Data Exchange (ETDEWEB)
Buelund, A.; Hellstroem, U. [Banverket, Swedisch National Rail Administration Engineering Dept., Borlaenge (Sweden); Varju, G. [Technical Univ. Budapest (Hungary). Dept. of Electrical Power System
1999-07-01
A study of the changeover from a booster transformer (BT) system to an auto transformer (AT) system has been initiated by Banverket to increase the transport capability (weight and speed) of a heavily loaded freight train lines of about 40 km situated between Raatsi and Svappavaara and fed from the Kiruna converter station. In this paper, firstly, a survey of comparison is given on the bases of sophisticated three-conductor line simulations for the two supply schemes in the point of view of equivalent impedance, losses, power rating for actual traffic conditions, longitudinal induction to line-side telecommunication cable, rail-to-earth and rail-to-rail potential. The results of simulation calculations have provided the necessary information on the rating of the AT scheme including the required number and locations of the auto transformers. At AT system has been installed in addition to the already existing BT without the removal of the BT system. This installation has allowed to change from one system to the other in one day period of time and thus giving the possibility of performing real scale comparison tests between the two schemes. The paper presents a survey of the results of two week time site measurements. (orig.)
An Efficient Agrobacterium-Mediated Transformation System for Poplar
Movahedi, Ali; Zhang, Jiaxin; Amirian, Rasoul; Zhuge, Qiang
2014-01-01
Poplar is a model system for the regeneration and genetic transformation of woody plants. To shorten the time required for studies of transgenic poplar, efforts have been made to optimize transformation methods that use Agrobacterium tumefaciens. In this study, an Agrobacterium infective suspension was treated at 4 °C for at least 10 h before infecting explants. By transforming the Populus hybrid clone “Nanlin895” (Populus deltoides × P. euramericana) with Agrobacterium harboring the PBI121:CarNAC6 binary vector, we showed that the transformation efficiency was improved significantly by multiple independent factors, including an Agrobacterium infective suspension with an OD600 of 0.7, an Agrobacterium infection for 120 min, an Agrobacterium infective suspension at a pH of 5.0, an acetosyringone concentration of 200 µM, a cocultivation at 28 °C, a cocultivation for 72 h and a sucrose concentration of 30 g/L in the cocultivation medium. We also showed that preculture of wounded leaf explants for two days increased the regeneration rate. The integration of the desired gene into transgenic poplars was detected using selective medium containing kanamycin, followed by southern blot analysis. The expression of the transgene in the transgenic lines was confirmed by northern blot analysis. PMID:24933641
AGM: A DSL for mobile cloud computing based on directed graph
Tanković, Nikola; Grbac, Tihana Galinac
2016-06-01
This paper summarizes a novel approach for consuming a domain specific language (DSL) by transforming it to a directed graph representation persisted by a graph database. Using such specialized database enables advanced navigation trough the stored model exposing only relevant subsets of meta-data to different involved services and components. We applied this approach in a mobile cloud computing system and used it to model several mobile applications in retail, supply chain management and merchandising domain. These application are distributed in a Software-as-a-Service (SaaS) fashion and used by thousands of customers in Croatia. We report on lessons learned and propose further research on this topic.
Adiabatic graph-state quantum computation
International Nuclear Information System (INIS)
Antonio, B; Anders, J; Markham, D
2014-01-01
Measurement-based quantum computation (MBQC) and holonomic quantum computation (HQC) are two very different computational methods. The computation in MBQC is driven by adaptive measurements executed in a particular order on a large entangled state. In contrast in HQC the system starts in the ground subspace of a Hamiltonian which is slowly changed such that a transformation occurs within the subspace. Following the approach of Bacon and Flammia, we show that any MBQC on a graph state with generalized flow (gflow) can be converted into an adiabatically driven holonomic computation, which we call adiabatic graph-state quantum computation (AGQC). We then investigate how properties of AGQC relate to the properties of MBQC, such as computational depth. We identify a trade-off that can be made between the number of adiabatic steps in AGQC and the norm of H-dot as well as the degree of H, in analogy to the trade-off between the number of measurements and classical post-processing seen in MBQC. Finally the effects of performing AGQC with orderings that differ from standard MBQC are investigated. (paper)
Enabling Graph Appliance for Genome Assembly
Energy Technology Data Exchange (ETDEWEB)
Singh, Rina [ORNL; Graves, Jeffrey A [ORNL; Lee, Sangkeun (Matt) [ORNL; Sukumar, Sreenivas R [ORNL; Shankar, Mallikarjun [ORNL
2015-01-01
In recent years, there has been a huge growth in the amount of genomic data available as reads generated from various genome sequencers. The number of reads generated can be huge, ranging from hundreds to billions of nucleotide, each varying in size. Assembling such large amounts of data is one of the challenging computational problems for both biomedical and data scientists. Most of the genome assemblers developed have used de Bruijn graph techniques. A de Bruijn graph represents a collection of read sequences by billions of vertices and edges, which require large amounts of memory and computational power to store and process. This is the major drawback to de Bruijn graph assembly. Massively parallel, multi-threaded, shared memory systems can be leveraged to overcome some of these issues. The objective of our research is to investigate the feasibility and scalability issues of de Bruijn graph assembly on Cray s Urika-GD system; Urika-GD is a high performance graph appliance with a large shared memory and massively multithreaded custom processor designed for executing SPARQL queries over large-scale RDF data sets. However, to the best of our knowledge, there is no research on representing a de Bruijn graph as an RDF graph or finding Eulerian paths in RDF graphs using SPARQL for potential genome discovery. In this paper, we address the issues involved in representing a de Bruin graphs as RDF graphs and propose an iterative querying approach for finding Eulerian paths in large RDF graphs. We evaluate the performance of our implementation on real world ebola genome datasets and illustrate how genome assembly can be accomplished with Urika-GD using iterative SPARQL queries.
Military Health System Transformation Implications on Health Information Technology Modernization.
Khan, Saad
2018-03-01
With the recent passage of the National Defense Authorization Act for Fiscal Year 2017, Congress has triggered groundbreaking Military Health System organizational restructuring with the Defense Health Agency assuming responsibility for managing all hospitals and clinics owned by the Army, Navy, and Air Force. This is a major shift toward a modern value-based managed care system, which will require much greater military-civilian health care delivery integration to be in place by October 2018. Just before the National Defense Authorization Act for Fiscal Year 2017 passage, the Department of Defense had already begun a seismic shift and awarded a contract for the new Military Health System-wide electronic health record system. In this perspective, we discuss the implications of the intersection of two large-scope and large-scale initiatives, health system transformation, and information technology modernization, being rolled out in the largest and most complex federal agency and potential risk mitigating steps. The Military Health System will require an expanded unified clinical leadership to spearhead short-term transformation; furthermore, developing, organizing, and growing a cadre of informatics expertise to expand the use and diffusion of novel solutions such as health information exchanges, data analytics, and others to transcend organizational barriers are still needed to achieve the long-term aim of health system reform as envisioned by the National Defense Authorization Act for Fiscal Year 2017.
Bates, Jason H T; Sobel, Burton E
2003-05-01
This is the third in a series of four articles developed for the readers of Coronary Artery Disease. Without language ideas cannot be articulated. What may not be so immediately obvious is that they cannot be formulated either. One of the essential languages of cardiology is mathematics. Unfortunately, medical education does not emphasize, and in fact, often neglects empowering physicians to think mathematically. Reference to statistics, conditional probability, multicompartmental modeling, algebra, calculus and transforms is common but often without provision of genuine conceptual understanding. At the University of Vermont College of Medicine, Professor Bates developed a course designed to address these deficiencies. The course covered mathematical principles pertinent to clinical cardiovascular and pulmonary medicine and research. It focused on fundamental concepts to facilitate formulation and grasp of ideas.This series of four articles was developed to make the material available for a wider audience. The articles will be published sequentially in Coronary Artery Disease. Beginning with fundamental axioms and basic algebraic manipulations they address algebra, function and graph theory, real and complex numbers, calculus and differential equations, mathematical modeling, linear system theory and integral transforms and statistical theory. The principles and concepts they address provide the foundation needed for in-depth study of any of these topics. Perhaps of even more importance, they should empower cardiologists and cardiovascular researchers to utilize the language of mathematics in assessing the phenomena of immediate pertinence to diagnosis, pathophysiology and therapeutics. The presentations are interposed with queries (by Coronary Artery Disease abbreviated as CAD) simulating the nature of interactions that occurred during the course itself. Each article concludes with one or more examples illustrating application of the concepts covered to
Chartrand, Gary
1984-01-01
Graph theory is used today in the physical sciences, social sciences, computer science, and other areas. Introductory Graph Theory presents a nontechnical introduction to this exciting field in a clear, lively, and informative style. Author Gary Chartrand covers the important elementary topics of graph theory and its applications. In addition, he presents a large variety of proofs designed to strengthen mathematical techniques and offers challenging opportunities to have fun with mathematics. Ten major topics - profusely illustrated - include: Mathematical Models, Elementary Concepts of Grap
Lithuanian financial system transformation in the context of globalization
Directory of Open Access Journals (Sweden)
Arturas Balkevicius
2013-10-01
Full Text Available Purpose: The purpose of the article is to discuss the transformation of the Lithuania finance system in the context of globalization. Exploring the interdependence between the financial system and the economy, in different periods. Analyze the country’s financial system transformation after the crisis period. Methods: Contribution use general scientific methods, especially analysis, synthesis, comparison, induction and deduction. Essential sources of information were professional publications , statistic data of state Statistics Department, Bank of Lithuania, Euro stat. Scientific aim: Main aim of this article is to analyze the transformation of the Lithuania financial system and fined out the country’s economic growth and the financial system correlation, the main factors having a both positive and negative impact on economic growth. Findings: Findings of this article are new information in this area, which can be useful for another research. The correlation between the banks ‚ loans and GDP. However, this does not apply at the time of the economy fall. Conclusions: Economic growth in the financial sector and economic development is best visible analyzing in the correlation between the banks ‚ loans and GDP. However, this does not apply at the time of the economy fall. Banks ‚ relative indicators better reflects the weight of the financial sector and the impact on the national economy. We can see that 2011 banks relative indicators dropped to 2006 level. This shows how much the financial sector’s contribution decreased to economic development. Banks’ loans demand fall down. Lithuania has taken strict fiscal discipline and austerity measures. This have produced results quite quickly, in 2010 GDP grew by 3.4 percent, and in 2011 even 11.5 percent. Lithuania’s economy is recovering, but the financial sector and in particular banks still not recovering. The economic crisis has intervened in the banking system and has been surviving
Erskine, Jonathan; Hunter, David J; Small, Adrian; Hicks, Chris; McGovern, Tom; Lugsden, Ed; Whitty, Paula; Steen, Nick; Eccles, Martin Paul
2013-02-01
The research project 'An Evaluation of Transformational Change in NHS North East' examines the progress and success of National Health Service (NHS) organisations in north east England in implementing and embedding the North East Transformation System (NETS), a region-wide programme to improve healthcare quality and safety, and to reduce waste, using a combination of Vision, Compact, and Lean-based Method. This paper concentrates on findings concerning the role of leadership in enabling tranformational change, based on semi-structured interviews with a mix of senior NHS managers and quality improvement staff in 14 study sites. Most interviewees felt that implementing the NETS requires committed, stable leadership, attention to team-building across disciplines and leadership development at many levels. We conclude that without senior leader commitment to continuous improvement over a long time scale and serious efforts to distribute leadership tasks to all levels, healthcare organisations are less likely to achieve positive changes in managerial-clinical relations, sustainable improvements to organisational culture and, ultimately, the region-wide step change in quality, safety and efficiency that the NETS was designed to deliver. © The Author(s) 2013 Reprints and permissions: sagepub.co.uk/journalsPermissions.nav.
Friedrich, R.; Drewelow, W.
1978-01-01
An algorithm is described that is based on the method of breaking the Laplace transform down into partial fractions which are then inverse-transformed separately. The sum of the resulting partial functions is the wanted time function. Any problems caused by equation system forms are largely limited by appropriate normalization using an auxiliary parameter. The practical limits of program application are reached when the degree of the denominator of the Laplace transform is seven to eight.
Education for Managing Digital Transformation: A Feedback Systems Approach
Directory of Open Access Journals (Sweden)
Michael Von Kutzschenbach
2017-04-01
Full Text Available "Digital transformation" is becoming the newest mantra of business leaders. It is clear that there are tremendous business opportunities resulting from this revolution, but there is also a price to be paid. Most management literature focuses on the benefits of digitalization, reflecting the desire to increase performance and efficiency in selected business activities. However, digital transformations may lead to the disruption of established ways of doing the work of the firm, stakeholder power may be fundamentally changed, and there is the potential for redefining the nature of the firm itself. Consequently, the decision to "go digital" requires managers to develop perspectives that have the requisite variety to cope with these challenges. Feedback systems thinking is a powerful means for managers to develop and communicate business models that include those aspects of digitalization that affects their firm's theory of success. The Uber case illustrates the principles of applying feedback systems thinking to the radical changes that it has presented the public transportation sector. This paper analyzes Uber's platform business by presenting an endogenous explanation of the drivers and eventual constraints to growth of the theory of success upon which the firm is based. This type of analysis has implications for all firms considering implementing a significant digital transformation process.
Adriaan R. Soetevent
2010-01-01
This paper extends Hotelling's model of price competition with quadratic transportation costs from a line to graphs. I propose an algorithm to calculate firm-level demand for any given graph, conditional on prices and firm locations. One feature of graph models of price competition is that spatial discontinuities in firm-level demand may occur. I show that the existence result of D'Aspremont et al. (1979) does not extend to simple star graphs. I conjecture that this non-existence result holds...
Pim Heijnen; Adriaan Soetevent
2014-01-01
This paper extends Hotelling's model of price competition with quadratic transportation costs from a line to graphs. We derive an algorithm to calculate firm-level demand for any given graph, conditional on prices and firm locations. These graph models of price competition may lead to spatial discontinuities in firm-level demand. We show that the existence result of D'Aspremont et al. (1979) does not extend to simple star graphs and conjecture that this non-existence result holds more general...
Gelfand, I M; Shnol, E E
1969-01-01
The second in a series of systematic studies by a celebrated mathematician I. M. Gelfand and colleagues, this volume presents students with a well-illustrated sequence of problems and exercises designed to illuminate the properties of functions and graphs. Since readers do not have the benefit of a blackboard on which a teacher constructs a graph, the authors abandoned the customary use of diagrams in which only the final form of the graph appears; instead, the book's margins feature step-by-step diagrams for the complete construction of each graph. The first part of the book employs simple fu
Creating more effective graphs
Robbins, Naomi B
2012-01-01
A succinct and highly readable guide to creating effective graphs The right graph can be a powerful tool for communicating information, improving a presentation, or conveying your point in print. If your professional endeavors call for you to present data graphically, here's a book that can help you do it more effectively. Creating More Effective Graphs gives you the basic knowledge and techniques required to choose and create appropriate graphs for a broad range of applications. Using real-world examples everyone can relate to, the author draws on her years of experience in gr
DEFF Research Database (Denmark)
Mansutti, Alessio; Miculan, Marino; Peressotti, Marco
2017-01-01
We introduce loose graph simulations (LGS), a new notion about labelled graphs which subsumes in an intuitive and natural way subgraph isomorphism (SGI), regular language pattern matching (RLPM) and graph simulation (GS). Being a unification of all these notions, LGS allows us to express directly...... also problems which are “mixed” instances of previous ones, and hence which would not fit easily in any of them. After the definition and some examples, we show that the problem of finding loose graph simulations is NP-complete, we provide formal translation of SGI, RLPM, and GS into LGSs, and we give...
Directory of Open Access Journals (Sweden)
Alberto Apostolico
2009-08-01
Full Text Available The Web Graph is a large-scale graph that does not fit in main memory, so that lossless compression methods have been proposed for it. This paper introduces a compression scheme that combines efficient storage with fast retrieval for the information in a node. The scheme exploits the properties of the Web Graph without assuming an ordering of the URLs, so that it may be applied to more general graphs. Tests on some datasets of use achieve space savings of about 10% over existing methods.
[The need of transforming the health system in Mexico].
López-Cervantes, Malaquías; Durán Arenas, Juan Luis; Villanueva Lozano, Marcia
2011-01-01
In this article we review the need for the transformation of the Mexican health care system given the deformities that the system developed in the last 60 years. We start by the discussion of two main deformities: the segmented answer to the health right, and the development of a segmented health care system based on the method of payment (formal workers contributions); and the development of a health care model based on specialties and hospital care. These deformities have resulted in a health care system characterized by high costs and low effectiveness. Even though the correction of the deformities imply complex modifications that involve political economic and legal aspects, in the short term we have the conditions in Mexico for the creation of a universal primary health care system, given the human and financial resources available in the country.
Graph Theory. 1. Fragmentation of Structural Graphs
Directory of Open Access Journals (Sweden)
Lorentz JÄNTSCHI
2002-12-01
Full Text Available The investigation of structural graphs has many fields of applications in engineering, especially in applied sciences like as applied chemistry and physics, computer sciences and automation, electronics and telecommunication. The main subject of the paper is to express fragmentation criteria in graph using a new method of investigation: terminal paths. Using terminal paths are defined most of the fragmentation criteria that are in use in molecular topology, but the fields of applications are more generally than that, as I mentioned before. Graphical examples of fragmentation are given for every fragmentation criteria. Note that all fragmentation is made with a computer program that implements a routine for every criterion.[1] A web routine for tracing all terminal paths in graph can be found at the address: http://vl.academicdirect.ro/molecular_topology/tpaths/ [1] M. V. Diudea, I. Gutman, L. Jäntschi, Molecular Topology, Nova Science, Commack, New York, 2001, 2002.
On revealing graph cycles via boundary measurements
International Nuclear Information System (INIS)
Belishev, M I; Wada, N
2009-01-01
This paper deals with boundary value inverse problems on a metric graph, the structure of the graph being assumed unknown. The question under consideration is how to detect from the dynamical and/or spectral inverse data whether the graph contains cycles (is not a tree). For any graph Ω, the dynamical as well as spectral boundary inverse data determine the so-called wave diameter d w : H -1 (Ω) → R defined on functionals supported in the graph. The known fact is that if Ω is a tree then d w ≥ 0 holds and, in this case, the inverse data determine Ω up to isometry. A graph Ω is said to be coordinate if the functions {dist Ω (., γ)} γin∂Ω constitute a coordinate system on Ω. For such graphs, we propose a procedure, which reveals the presence/absence of cycles. The hypothesis is that Ω contains cycles if and only if d w takes negative values. We do not justify this hypothesis in the general case but reduce it to a certain special class of graphs (suns)
It's the System, Stupid: How Systems Biology Is Transforming.
2010-01-01
So far, little is known about systems biology and its potential for changing how we diagnose and treat disease. That will change soon, say the systems experts, who advise payers to begin learning now about how it could make healthcare efficient.
Pressure-Point Strategy: Leverages for Urban Systemic Transformation
Directory of Open Access Journals (Sweden)
Katleen De Flander
2017-01-01
Full Text Available Sustainability can be understood as a specific kind of problem framing that emphasizes the interconnectedness of different problems and scales and calls for new forms of problem handling that are much more process-oriented, reflexive and iterative in nature. Closely related with the notion of reflexive governance, we propose such an alternative strategy for societal problem handling and change management in the urban context. The strategy starts from stress states in the urban system(s and uses their initial momentum to encourage systemic change through intraventions—rather than interventions—at selected pressure points. This paper highlights the potential to evolve what has often been an intuitive practice, led by community or elected leaders with unique wisdom about functions and pressure points in their urban system, into a more accessible strategy for shaping socio-ecological transformation in urban practice.
Human Iris Recognition System using Wavelet Transform and LVQ
Energy Technology Data Exchange (ETDEWEB)
Lee, Kwan Yong; Lim, Shin Young [Electronics and Telecommunications Research Institute (Korea); Cho, Seong Won [Hongik University (Korea)
2000-07-01
The popular methods to check the identity of individuals include passwords and ID cards. These conventional methods for user identification and authentication are not altogether reliable because they can be stolen and forgotten. As an alternative of the existing methods, biometric technology has been paid much attention for the last few decades. In this paper, we propose an efficient system for recognizing the identity of a living person by analyzing iris patterns which have a high level of stability and distinctiveness than other biometric measurements. The proposed system is based on wavelet transform and a competitive neural network with the improved mechanisms. After preprocessing the iris data acquired through a CCD camera, feature vectors are extracted by using Haar wavelet transform. LVQ(Learning Vector Quantization) is exploited to classify these feature vectors. We improve the overall performance of the proposed system by optimizing the size of feature vectors and by introducing an efficient initialization of the weight vectors and a new method for determining the winner in order to increase the recognition accuracy of LVQ. From the experiments, we confirmed that the proposed system has a great potential of being applied to real applications in an efficient and effective way. (author). 14 refs., 13 figs., 7 tabs.
Mutual proximity graphs for improved reachability in music recommendation.
Flexer, Arthur; Stevens, Jeff
2018-01-01
This paper is concerned with the impact of hubness, a general problem of machine learning in high-dimensional spaces, on a real-world music recommendation system based on visualisation of a k-nearest neighbour (knn) graph. Due to a problem of measuring distances in high dimensions, hub objects are recommended over and over again while anti-hubs are nonexistent in recommendation lists, resulting in poor reachability of the music catalogue. We present mutual proximity graphs, which are an alternative to knn and mutual knn graphs, and are able to avoid hub vertices having abnormally high connectivity. We show that mutual proximity graphs yield much better graph connectivity resulting in improved reachability compared to knn graphs, mutual knn graphs and mutual knn graphs enhanced with minimum spanning trees, while simultaneously reducing the negative effects of hubness.
Cohen, A.M.; Beineke, L.W.; Wilson, R.J.; Cameron, P.J.
2004-01-01
In this chapter we investigate the classification of distance-transitive graphs: these are graphs whose automorphism groups are transitive on each of the sets of pairs of vertices at distance i, for i = 0, 1,.... We provide an introduction into the field. By use of the classification of finite
Joyner, W David
2017-01-01
This textbook acts as a pathway to higher mathematics by seeking and illuminating the connections between graph theory and diverse fields of mathematics, such as calculus on manifolds, group theory, algebraic curves, Fourier analysis, cryptography and other areas of combinatorics. An overview of graph theory definitions and polynomial invariants for graphs prepares the reader for the subsequent dive into the applications of graph theory. To pique the reader’s interest in areas of possible exploration, recent results in mathematics appear throughout the book, accompanied with examples of related graphs, how they arise, and what their valuable uses are. The consequences of graph theory covered by the authors are complicated and far-reaching, so topics are always exhibited in a user-friendly manner with copious graphs, exercises, and Sage code for the computation of equations. Samples of the book’s source code can be found at github.com/springer-math/adventures-in-graph-theory. The text is geared towards ad...
Perepelitsa, VA; Sergienko, [No Value; Kochkarov, AM
1999-01-01
Definitions of prefractal and fractal graphs are introduced, and they are used to formulate mathematical models in different fields of knowledge. The topicality of fractal-graph recognition from the point of view, of fundamental improvement in the efficiency of the solution of algorithmic problems
DEFF Research Database (Denmark)
Husfeldt, Thore
2015-01-01
This chapter presents an introduction to graph colouring algorithms. The focus is on vertex-colouring algorithms that work for general classes of graphs with worst-case performance guarantees in a sequential model of computation. The presentation aims to demonstrate the breadth of available...
Packing Degenerate Graphs Greedily
Czech Academy of Sciences Publication Activity Database
Allen, P.; Böttcher, J.; Hladký, J.; Piguet, Diana
2017-01-01
Roč. 61, August (2017), s. 45-51 ISSN 1571-0653 R&D Projects: GA ČR GJ16-07822Y Institutional support: RVO:67985807 Keywords : tree packing conjecture * graph packing * graph processes Subject RIV: BA - General Mathematics OBOR OECD: Pure mathematics
Ciocca, M.
2016-12-01
(Abstract only) Since Fall of 2014, AAVSO made available two very useful software tools: transform generator (tg) and transform applier (ta). tg, authored by Gordon Myers (gordonmyers@hotmail.com), is a program, running under python that allows the user to obtain the transformation coefficients of their imaging train. ta, authored by George Silvis, allows users to apply the transformation coefficients obtained previously to their photometric observation. The data so processed become then directly comparable to those of other observers. I will show how to obtain transform coefficient using two Standard Field (M 67 and NGC7790), how consistent the results are and as an application, I will present transformed data for two AAVSO Target stars, AE UMA and RR CET.
Module Ten: Transformers; Basic Electricity and Electronics Individualized Learning System.
Bureau of Naval Personnel, Washington, DC.
The module introduces a very important electrical device, the transformer. The module is divided into six lessons: transformer construction, transformer theory and operation, turns and voltage ratios, power and current, transformer efficiency, and semiconductor rectifiers. Each lesson consists of an overview, a list of study resources, lesson…
Generalized connectivity of graphs
Li, Xueliang
2016-01-01
Noteworthy results, proof techniques, open problems and conjectures in generalized (edge-) connectivity are discussed in this book. Both theoretical and practical analyses for generalized (edge-) connectivity of graphs are provided. Topics covered in this book include: generalized (edge-) connectivity of graph classes, algorithms, computational complexity, sharp bounds, Nordhaus-Gaddum-type results, maximum generalized local connectivity, extremal problems, random graphs, multigraphs, relations with the Steiner tree packing problem and generalizations of connectivity. This book enables graduate students to understand and master a segment of graph theory and combinatorial optimization. Researchers in graph theory, combinatorics, combinatorial optimization, probability, computer science, discrete algorithms, complexity analysis, network design, and the information transferring models will find this book useful in their studies.
Large-Scale Graph Processing Using Apache Giraph
Sakr, Sherif
2017-01-07
This book takes its reader on a journey through Apache Giraph, a popular distributed graph processing platform designed to bring the power of big data processing to graph data. Designed as a step-by-step self-study guide for everyone interested in large-scale graph processing, it describes the fundamental abstractions of the system, its programming models and various techniques for using the system to process graph data at scale, including the implementation of several popular and advanced graph analytics algorithms.
Large-Scale Graph Processing Using Apache Giraph
Sakr, Sherif; Orakzai, Faisal Moeen; Abdelaziz, Ibrahim; Khayyat, Zuhair
2017-01-01
This book takes its reader on a journey through Apache Giraph, a popular distributed graph processing platform designed to bring the power of big data processing to graph data. Designed as a step-by-step self-study guide for everyone interested in large-scale graph processing, it describes the fundamental abstractions of the system, its programming models and various techniques for using the system to process graph data at scale, including the implementation of several popular and advanced graph analytics algorithms.
Transformation language integration based on profiles and higher order transformations
Van Gorp, P.M.E.; Keller, A.; Janssens, D.; Gaševic, D.; Lämmel, R.; Van Wyk, Eric
2009-01-01
For about two decades, researchers have been constructing tools for applying graph transformations on large model transformation case studies. Instead of incrementally extending a common core, these competitive tool builders have repeatedly reconstructed mechanisms that were already supported by
Autoregressive Moving Average Graph Filtering
Isufi, Elvin; Loukas, Andreas; Simonetto, Andrea; Leus, Geert
2016-01-01
One of the cornerstones of the field of signal processing on graphs are graph filters, direct analogues of classical filters, but intended for signals defined on graphs. This work brings forth new insights on the distributed graph filtering problem. We design a family of autoregressive moving average (ARMA) recursions, which (i) are able to approximate any desired graph frequency response, and (ii) give exact solutions for tasks such as graph signal denoising and interpolation. The design phi...
Status Report on Power System Transformation: A 21st Century Power Partnership Report
Energy Technology Data Exchange (ETDEWEB)
Miller, Mackay [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Martinot, Eric [Beijing Inst. of Technology (China); Cox, Sadie [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Speer, Bethany [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Zinaman, Owen [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Booth, Sam [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Zissler, Romain [Japan Renewable Energy Foundation (Japan); Cochran, Jaquelin [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Soonee, S. K. [Power System Operation Corporation, Ltd (India); Audinet, Pierre [World Bank Energy Sector Management Assistance Program, Washington, DC (United States); Munuera, Luis [International Energy Agency, Paris (France); Arent, Doug [Joint Inst. for Strategic Energy Analysis, Washington, DC (United States)
2015-05-27
This report has three primary goals: (1) to articulate the concept of power system transformation; (2) to explore the current global landscape of ‘innovations’ that constitute power system transformation and provide evidence of how these innovations are emerging; and (3) to suggest an analytical framework for assessing the status of power system transformation on an on-going basis.
Energy Technology Data Exchange (ETDEWEB)
Gandanegara, G.
2003-11-15
In Electrical Engineering, the global analysis of systems is difficult because of their heterogeneity and their multi-domain nature. Nevertheless, this system approach is essential because it underlines couplings between elements of different physical fields. To facilitate this analysis, the unified formalism Bond Graph is used. This modeling method illustrates the energetic transfers in the system. Moreover, this methodology offers interesting solutions in terms of system analysis. Two simplification methods have been investigated and compared, i.e. the Singular Perturbations Method (SPM), based on the dynamic analysis of elements, and the Model Order Reduction Algorithm (MORA), based on the energetic activity. By these methods, a simplified bond graph model can be obtained for a given frequency range. The stability analysis by the root locus method and the Lyapunov's second method have been examined and applied with the Bond Graph formalism support. An industrial railway traction system is considered as the case study in the application of these different analysis techniques. (author)
Directory of Open Access Journals (Sweden)
Graham R. Marshall
2015-09-01
Full Text Available The social-ecological systems (SES framework was developed to support communication across the multiple disciplines concerned with sustainable provision and/or appropriation of common-pool resources (CPRs. Transformation activities (e.g. processing, distribution, retailing in which value is added to resource units appropriated from CPRs were assumed in developing the framework to be exogenous to the SES of focal concern. However, provision and appropriation of CPRs are nowadays often closely integrated with the market economy, so significant interdependence exists between many CPR provision/appropriation activities and the activities in which appropriated resource units are transformed into the products ultimately marketed. This paper presents a modified version of the SES framework designed to better account for transformation activities in order to be more suitable for diagnosing those sustainability problems where it is inappropriate to define all such activities as exogenous to the SES of focal concern. The need for such modification was identified in a research project examining the challenges faced by Cambodian cattle-owning smallholders in accessing value chains for premium-priced beef. Hence the immediate focus was on strengthening the SES framework’s value for facilitating a multi-disciplinary diagnostic approach to food system research projects of this kind. The modified SES framework’s potential in this respect was illustrated by a preliminary application that drew on literature reviewed for the Cambodian project. Significant further potential exists in using the modified framework as a foundation from which to develop a version that is suitable for application to SESs in which transformation systems are appropriately represented as endogenous. Maintaining consistency with the standard SES framework will enable communication to occur more effectively between food system researchers and CPR scholars more generally.
International Nuclear Information System (INIS)
Chau Ling-Lie; Ge Mo-Lin; Teh, Rosy.
1984-09-01
The Baecklund Transformations and the hidden symmetry algebra for Self-Dual Yang-Mills Equations, Landau-Lifshitz equations and the Extended Super Yang-Mills fields (N>2) are discussed on the base of the Regular Riemann-Hilbert Transform and the linearization equations. (author)
Subgraph detection using graph signals
Chepuri, Sundeep Prabhakar
2017-03-06
In this paper we develop statistical detection theory for graph signals. In particular, given two graphs, namely, a background graph that represents an usual activity and an alternative graph that represents some unusual activity, we are interested in answering the following question: To which of the two graphs does the observed graph signal fit the best? To begin with, we assume both the graphs are known, and derive an optimal Neyman-Pearson detector. Next, we derive a suboptimal detector for the case when the alternative graph is not known. The developed theory is illustrated with numerical experiments.
Subgraph detection using graph signals
Chepuri, Sundeep Prabhakar; Leus, Geert
2017-01-01
In this paper we develop statistical detection theory for graph signals. In particular, given two graphs, namely, a background graph that represents an usual activity and an alternative graph that represents some unusual activity, we are interested in answering the following question: To which of the two graphs does the observed graph signal fit the best? To begin with, we assume both the graphs are known, and derive an optimal Neyman-Pearson detector. Next, we derive a suboptimal detector for the case when the alternative graph is not known. The developed theory is illustrated with numerical experiments.
Construction and application research of knowledge graph in aviation risk field
Directory of Open Access Journals (Sweden)
Zhao Qian
2018-01-01
Full Text Available Since the causes of aviation accidents and risks are complicated, concealed, unpredictable and difficult to be investigated, in order to achieve the efficient organization and knowledge sharing of the historical cases of aviation risk events, this paper put forward the method of constructing vertical knowledge graph for aviation risk field. Firstly, the data-driven incremental construction technology is used to build aviation risk event ontology model. Secondly, the pattern-based knowledge mapping mechanism, which transform structured data into RDF (Resource Description Framework data for storage, is proposed. And then the application, update and maintenance of the knowledge graph are described. Finally, knowledge graph construction system in aviation risk field is developed; and the data from American Aviation Safety Reporting System (ASRS is used as an example to verify the rationality and validity of the knowledge graph construction method. Practice has proved that the construction of knowledge graph has a guiding significance for the case information organization and sharing on the field of aviation risk.
Our Stories Transforming Our Libraries: The York County Library System
Directory of Open Access Journals (Sweden)
Mina Edmondson
2016-11-01
Full Text Available These narratives chronicle the authors’ journeys to collaborate and discover the transformative impact that stories have on library culture and library staff. This study describes a research collaboration between York County Libraries and Penn State York. In Phase I, we collected stories from library staff as the library system was being challenged to reimage public libraries for the future. The major themes and types of organizational stories identified in the initial narrative project were presented during a county-wide all-staff in-service training. The library District Consultant (first author and the Penn State professor (second author then facilitated a workshop designed to lead staff in their exploration of these topics and generate a written record of their storytelling/discussions. This data became the basis for Phase II of the project and allowed the system to strategically assess its evolving culture and identity.
Optimal PMU placement using topology transformation method in power systems
Directory of Open Access Journals (Sweden)
Nadia H.A. Rahman
2016-09-01
Full Text Available Optimal phasor measurement units (PMUs placement involves the process of minimizing the number of PMUs needed while ensuring the entire power system completely observable. A power system is identified observable when the voltages of all buses in the power system are known. This paper proposes selection rules for topology transformation method that involves a merging process of zero-injection bus with one of its neighbors. The result from the merging process is influenced by the selection of bus selected to merge with the zero-injection bus. The proposed method will determine the best candidate bus to merge with zero-injection bus according to the three rules created in order to determine the minimum number of PMUs required for full observability of the power system. In addition, this paper also considered the case of power flow measurements. The problem is formulated as integer linear programming (ILP. The simulation for the proposed method is tested by using MATLAB for different IEEE bus systems. The explanation of the proposed method is demonstrated by using IEEE 14-bus system. The results obtained in this paper proved the effectiveness of the proposed method since the number of PMUs obtained is comparable with other available techniques.
Optimal PMU placement using topology transformation method in power systems.
Rahman, Nadia H A; Zobaa, Ahmed F
2016-09-01
Optimal phasor measurement units (PMUs) placement involves the process of minimizing the number of PMUs needed while ensuring the entire power system completely observable. A power system is identified observable when the voltages of all buses in the power system are known. This paper proposes selection rules for topology transformation method that involves a merging process of zero-injection bus with one of its neighbors. The result from the merging process is influenced by the selection of bus selected to merge with the zero-injection bus. The proposed method will determine the best candidate bus to merge with zero-injection bus according to the three rules created in order to determine the minimum number of PMUs required for full observability of the power system. In addition, this paper also considered the case of power flow measurements. The problem is formulated as integer linear programming (ILP). The simulation for the proposed method is tested by using MATLAB for different IEEE bus systems. The explanation of the proposed method is demonstrated by using IEEE 14-bus system. The results obtained in this paper proved the effectiveness of the proposed method since the number of PMUs obtained is comparable with other available techniques.
[The Mexican health system: does it require a transformation?].
Chertorivski Woldenberg, Salomón; Fajardo Dolci, German
2012-01-01
National health systems represent an organized social response that enables countries to improve, maintain and enhance the health status of their citizens. These evolve and are transformed according to changes in the biological, economic, political and social components of health. In Mexico there is currently a segmented health system, consisting of a bismarckian model of social security and a social protection in health model. The latter developed to comply with the fourth constitutional article by which health is no longer described as a right linked to the employment status of the individual. Given this reality at least three alternatives seem to emerge for the future: the permanence of a mixed health system with social security and social protection institutions with a similar weight within the national health system, or its opposite, the extension of social protection as a mechanism for widespread access. Given the challenges we face, it is desirable to establish a unified health system, the aim should be that health care is universally protected, as currently happens, but is guaranteed through a much more efficient and based in primary care health care system.
Bollobas, Bela
2004-01-01
The ever-expanding field of extremal graph theory encompasses a diverse array of problem-solving methods, including applications to economics, computer science, and optimization theory. This volume, based on a series of lectures delivered to graduate students at the University of Cambridge, presents a concise yet comprehensive treatment of extremal graph theory.Unlike most graph theory treatises, this text features complete proofs for almost all of its results. Further insights into theory are provided by the numerous exercises of varying degrees of difficulty that accompany each chapter. A
A heterogeneous graph-based recommendation simulator
Energy Technology Data Exchange (ETDEWEB)
Yeonchan, Ahn [Seoul National University; Sungchan, Park [Seoul National University; Lee, Matt Sangkeun [ORNL; Sang-goo, Lee [Seoul National University
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.
Particle transport in breathing quantum graph
International Nuclear Information System (INIS)
Matrasulov, D.U.; Yusupov, J.R.; Sabirov, K.K.; Sobirov, Z.A.
2012-01-01
Full text: Particle transport in nanoscale networks and discrete structures is of fundamental and practical importance. Usually such systems are modeled by so-called quantum graphs, the systems attracting much attention in physics and mathematics during past two decades [1-5]. During last two decades quantum graphs found numerous applications in modeling different discrete structures and networks in nanoscale and mesoscopic physics (e.g., see reviews [1-3]). Despite considerable progress made in the study of particle dynamics most of the problems deal with unperturbed case and the case of time-dependent perturbation has not yet be explored. In this work we treat particle dynamics for quantum star graph with time-dependent bonds. In particular, we consider harmonically breathing quantum star graphs, the cases of monotonically contracting and expanding graphs. The latter can be solved exactly analytically. Edge boundaries are considered to be time-dependent, while branching point is assumed to be fixed. Quantum dynamics of a particle in such graphs is studied by solving Schrodinger equation with time-dependent boundary conditions given on a star graph. Time-dependence of the average kinetic energy is analyzed. Space-time evolution of the Gaussian wave packet is treated for harmonically breathing star graph. It is found that for certain frequencies energy is a periodic function of time, while for others it can be non-monotonically growing function of time. Such a feature can be caused by possible synchronization of the particles motion and the motions of the moving edges of graph bonds. (authors) References: [1] Tsampikos Kottos and Uzy Smilansky, Ann. Phys., 76, 274 (1999). [2] Sven Gnutzmann and Uzy Smilansky, Adv. Phys. 55, 527 (2006). [3] S. GnutzmannJ.P. Keating, F. Piotet, Ann. Phys., 325, 2595 (2010). [4] P.Exner, P.Seba, P.Stovicek, J. Phys. A: Math. Gen. 21, 4009 (1988). [5] J. Boman, P. Kurasov, Adv. Appl. Math., 35, 58 (2005)
Phase transformations in the titanium-niobium binary alloy system
International Nuclear Information System (INIS)
Moffat, D.L.
1985-01-01
A fundamental study of the phase transformations in the Ti-Nb binary alloy system was completed. Eight alloys in the range 20 to 70 at% Nb were investigated using transmission electron microscopy, light metallography, and x-ray diffraction. Measurements of electric resistivity and Vicker's microhardness also were performed. Emphasis was placed on the minimization of interstitial contamination in all steps of alloy fabrication and specimen preparation. In order to eliminate the effects of prior cold working, the alloys studied were recrystallized at 1000 0 C. Phase transformations were studied in alloys quenched to room temperature after recrystallization and then isothermally aged, and in those isothermally aged without a prior room temperature quench. It was found that the microstructures of the quenched 20 and 25% Nb alloys were extremely sensitive to quench rate - with a fast quench producing martensite, a slow quench, the omega phase. Microstructures of the higher niobium content alloys were much less sensitive to quench rate. The microstructures of the isothermally aged 20 and 25% Nb alloys were found to be sensitive to prior thermal history. Alloys quenched to room temperature and then aged at 400 0 C contained large omega precipitates, while those aged without an intermediate room temperature quench contained alpha precipitates
[Politics as a tool in National Health System transformation].
Dávila Torres, Javier
2012-01-01
The politics as an activity oriented to the decision making process, seeks to achieve specific objectives, and it is a fundamental tool for the transformation of the National Health System (NHS). It is important to point out that there are different elements, interest and participants that take part in the design and implementation of these policies. Therefore, it should be considered the presence of the health care institutions in the development of the health policies, as well as the participation of the Congress where each political party presents and defends their proposals, negotiate the approval and assignation of the financial budget, among others. Nowadays, there are elements with a relevant presence on these policies and in the transformation process of the NHS such as the media and laboral force represented by the unions. Finally, some general statements are expressed to contribute with the advances in the integration process for a stronger NHS. This should consider the economic, demographic and social changes in the country; furthermore it should focus on universal coverage and provision of a better health care for the Mexican population.
The Container Problem in Bubble-Sort Graphs
Suzuki, Yasuto; Kaneko, Keiichi
Bubble-sort graphs are variants of Cayley graphs. A bubble-sort graph is suitable as a topology for massively parallel systems because of its simple and regular structure. Therefore, in this study, we focus on n-bubble-sort graphs and propose an algorithm to obtain n-1 disjoint paths between two arbitrary nodes in time bounded by a polynomial in n, the degree of the graph plus one. We estimate the time complexity of the algorithm and the sum of the path lengths after proving the correctness of the algorithm. In addition, we report the results of computer experiments evaluating the average performance of the algorithm.
Application of the Sumudu Transform to Discrete Dynamic Systems
Asiru, Muniru Aderemi
2003-01-01
The Sumudu transform is an integral transform introduced to solve differential equations and control engineering problems. The transform possesses many interesting properties that make visualization easier and application has been demonstrated in the solution of partial differential equations, integral equations, integro-differential equations and…
Transforming Graph Data for Statistical Relational Learning
2012-10-01
pairwise kernel for predicting links between proteins (protein-protein interactions). The pairwise kernel is a tensor -product of two linear kernels on...participate in the same “event,” such as both voting yes for the same political bill. Rather than directly labeling links (like ART), the GT model clusters...these nodes (such as people) into latent groups based on textual descriptions of the events/ votes . However, the GT model also simultaneously infers a set
Optical generation of matter qubit graph states
International Nuclear Information System (INIS)
Benjamin, S C; Eisert, J; Stace, T M
2005-01-01
We present a scheme for rapidly entangling matter qubits in order to create graph states for one-way quantum computing. The qubits can be simple three-level systems in separate cavities. Coupling involves only local fields and a static (unswitched) linear optics network. Fusion of graph-state sections occurs with, in principle, zero probability of damaging the nascent graph state. We avoid the finite thresholds of other schemes by operating on two entangled pairs, so that each generates exactly one photon. We do not require the relatively slow single qubit local flips to be applied during the growth phase: growth of the graph state can then become a purely optical process. The scheme naturally generates graph states with vertices of high degree and so is easily able to construct minimal graph states, with consequent resource savings. The most efficient approach will be to create new graph-state edges even as qubits elsewhere are measured, in a 'just in time' approach. An error analysis indicates that the scheme is relatively robust against imperfections in the apparatus
Directory of Open Access Journals (Sweden)
Haynes Teresa W.
2014-08-01
Full Text Available A path π = (v1, v2, . . . , vk+1 in a graph G = (V,E is a downhill path if for every i, 1 ≤ i ≤ k, deg(vi ≥ deg(vi+1, where deg(vi denotes the degree of vertex vi ∈ V. The downhill domination number equals the minimum cardinality of a set S ⊆ V having the property that every vertex v ∈ V lies on a downhill path originating from some vertex in S. We investigate downhill domination numbers of graphs and give upper bounds. In particular, we show that the downhill domination number of a graph is at most half its order, and that the downhill domination number of a tree is at most one third its order. We characterize the graphs obtaining each of these bounds
Alspach, BR
1985-01-01
This volume deals with a variety of problems involving cycles in graphs and circuits in digraphs. Leading researchers in this area present here 3 survey papers and 42 papers containing new results. There is also a collection of unsolved problems.
Wilson, Robin J
1985-01-01
Graph Theory has recently emerged as a subject in its own right, as well as being an important mathematical tool in such diverse subjects as operational research, chemistry, sociology and genetics. This book provides a comprehensive introduction to the subject.
Hyperbolicity in median graphs
Indian Academy of Sciences (India)
mic problems in hyperbolic spaces and hyperbolic graphs have been .... that in general the main obstacle is that we do not know the location of ...... [25] Jonckheere E and Lohsoonthorn P, A hyperbolic geometry approach to multipath routing,.
'SIP', as a tool of 'Ukrytie' shelter transformation into an ecologically safe system
International Nuclear Information System (INIS)
Dzhadd, K.; Shmidt, D.
1999-01-01
The Shelter implementation plan (SIP) was used for realisation of 'Ukrytie' stabilization and for its transformation into an ecologically safe system SIP includes logic of needed actions and process of solution adaption during 'Ukrytie' transformation
Obesity and the food system transformation in Latin America.
Popkin, B M; Reardon, T
2018-04-24
The Latin America and the Caribbean (LAC) region faces a major diet-related health problem accompanied by enormous economic and social costs. The shifts in diet are profound: major shifts in intake of less-healthful low-nutrient-density foods and sugary beverages, changes in away-from-home eating and snacking and rapid shifts towards very high levels of overweight and obesity among all ages along with, in some countries, high burdens of stunting. Diet changes have occurred in parallel to, and in two-way causality with, changes in the broad food system - the set of supply chains from farms, through midstream segments of processing, wholesale and logistics, to downstream segments of retail and food service (restaurants and fast food chains). An essential contribution of this piece is to marry and integrate the nutrition transition literature with the literature on the economics of food system transformation. These two literatures and debates have been to date largely 'two ships passing in the night'. This review documents in-depth the recent history of rapid growth and transformation of that broad food system in LAC, with the rapid rise of supermarkets, large processors, fast food chains and food logistics firms. The transformation is the story of a 'double-edged sword', showing its links to various negative diet side trends, e.g. the rise of consumption of fast food and highly processed food, as well as in parallel, to various positive trends, e.g. the reduction of the cost of food, de-seasonalization, increase of convenience of food preparation reducing women's time associated with that and increase of availability of some nutritious foods like meat and dairy. We view the transformation of the food system, as well as certain aspects of diet change linked to long-run changes in employment and demographics (e.g. the quest for convenience), as broad parameters that will endure for the next decades without truly major regulatory and fiscal changes. We then focus in on
Digital health and the challenge of health systems transformation
Gagnon, Marie-Pierre; Fortin, Jean-Paul
2017-01-01
Information and communication technologies have transformed all sectors of society. The health sector is no exception to this trend. In light of “digital health”, we see multiplying numbers of web platforms and mobile health applications, often brought by new unconventional players who produce and offer services in non-linear and non-hierarchal ways, this by multiplying access points to services for people. Some speak of a “uberization” of healthcare. New realities and challenges have emerged from this paradigm, which question the abilities of health systems to cope with new business and economic models, governance of data and regulation. Countries must provide adequate responses so that digital health, based increasingly on disruptive technologies, can benefit for all. PMID:28894741
Digital health and the challenge of health systems transformation.
Alami, Hassane; Gagnon, Marie-Pierre; Fortin, Jean-Paul
2017-01-01
Information and communication technologies have transformed all sectors of society. The health sector is no exception to this trend. In light of "digital health", we see multiplying numbers of web platforms and mobile health applications, often brought by new unconventional players who produce and offer services in non-linear and non-hierarchal ways, this by multiplying access points to services for people. Some speak of a "uberization" of healthcare. New realities and challenges have emerged from this paradigm, which question the abilities of health systems to cope with new business and economic models, governance of data and regulation. Countries must provide adequate responses so that digital health, based increasingly on disruptive technologies, can benefit for all.
Sustainable urban systems: Co-design and framing for transformation.
Webb, Robert; Bai, Xuemei; Smith, Mark Stafford; Costanza, Robert; Griggs, David; Moglia, Magnus; Neuman, Michael; Newman, Peter; Newton, Peter; Norman, Barbara; Ryan, Chris; Schandl, Heinz; Steffen, Will; Tapper, Nigel; Thomson, Giles
2018-02-01
Rapid urbanisation generates risks and opportunities for sustainable development. Urban policy and decision makers are challenged by the complexity of cities as social-ecological-technical systems. Consequently there is an increasing need for collaborative knowledge development that supports a whole-of-system view, and transformational change at multiple scales. Such holistic urban approaches are rare in practice. A co-design process involving researchers, practitioners and other stakeholders, has progressed such an approach in the Australian context, aiming to also contribute to international knowledge development and sharing. This process has generated three outputs: (1) a shared framework to support more systematic knowledge development and use, (2) identification of barriers that create a gap between stated urban goals and actual practice, and (3) identification of strategic focal areas to address this gap. Developing integrated strategies at broader urban scales is seen as the most pressing need. The knowledge framework adopts a systems perspective that incorporates the many urban trade-offs and synergies revealed by a systems view. Broader implications are drawn for policy and decision makers, for researchers and for a shared forward agenda.
Resistance Distances in Vertex-Face Graphs
Shangguan, Yingmin; Chen, Haiyan
2018-01-01
The computation of two-point resistances in networks is a classical problem in electric circuit theory and graph theory. Let G be a triangulation graph with n vertices embedded on an orientable surface. Define K(G) to be the graph obtained from G by inserting a new vertex vϕ to each face ϕ of G and adding three new edges (u, vϕ), (v, vϕ) and (w, vϕ), where u, v and w are three vertices on the boundary of ϕ. In this paper, using star-triangle transformation and resistance local-sum rules, explicit relations between resistance distances in K(G) and those in G are obtained. These relations enable us to compute resistance distance between any two points of Kk(G) recursively. As explanation examples, some resistances in several networks are computed, including the modified Apollonian network and networks constructed from tetrahedron, octahedron and icosahedron, respectively.
Uniform Single Valued Neutrosophic Graphs
Directory of Open Access Journals (Sweden)
S. Broumi
2017-09-01
Full Text Available In this paper, we propose a new concept named the uniform single valued neutrosophic graph. An illustrative example and some properties are examined. Next, we develop an algorithmic approach for computing the complement of the single valued neutrosophic graph. A numerical example is demonstrated for computing the complement of single valued neutrosophic graphs and uniform single valued neutrosophic graph.
Collective Rationality in Graph Aggregation
Endriss, U.; Grandi, U.; Schaub, T.; Friedrich, G.; O'Sullivan, B.
2014-01-01
Suppose a number of agents each provide us with a directed graph over a common set of vertices. Graph aggregation is the problem of computing a single “collective” graph that best represents the information inherent in this profile of individual graphs. We consider this aggregation problem from the
Bollobás, Béla
1998-01-01
The time has now come when graph theory should be part of the education of every serious student of mathematics and computer science, both for its own sake and to enhance the appreciation of mathematics as a whole. This book is an in-depth account of graph theory, written with such a student in mind; it reflects the current state of the subject and emphasizes connections with other branches of pure mathematics. The volume grew out of the author's earlier book, Graph Theory -- An Introductory Course, but its length is well over twice that of its predecessor, allowing it to reveal many exciting new developments in the subject. Recognizing that graph theory is one of several courses competing for the attention of a student, the book contains extensive descriptive passages designed to convey the flavor of the subject and to arouse interest. In addition to a modern treatment of the classical areas of graph theory such as coloring, matching, extremal theory, and algebraic graph theory, the book presents a detailed ...
Workforce planning and development in times of delivery system transformation.
Pittman, Patricia; Scully-Russ, Ellen
2016-09-23
As implementation of the US Affordable Care Act (ACA) advances, many domestic health systems are considering major changes in how the healthcare workforce is organized. The purpose of this study is to explore the dynamic processes and interactions by which workforce planning and development (WFPD) is evolving in this new environment. Informed by the theory of loosely coupled systems (LCS), we use a case study design to examine how workforce changes are being managed in Kaiser Permanente and Montefiore Health System. We conducted site visits with in-depth interviews with 8 to 10 stakeholders in each organization. Both systems demonstrate a concern for the impact of change on their workforce and have made commitments to avoid outsourcing and layoffs. Central workforce planning mechanisms have been replaced with strategies to integrate various stakeholders and units in alignment with strategic growth plans. Features of this new approach include early and continuous engagement of labor in innovation; the development of intermediary sense-making structures to garner resources, facilitate plans, and build consensus; and a whole system perspective, rather than a focus on single professions. We also identify seven principles underlying the WFPD processes in these two cases that can aid in development of a new and more adaptive workforce strategy in healthcare. Since passage of the ACA, healthcare systems are becoming larger and more complex. Insights from these case studies suggest that while organizational history and structure determined different areas of emphasis, our results indicate that large-scale system transformations in healthcare can be managed in ways that enhance the skills and capacities of the workforce. Our findings merit attention, not just by healthcare administrators and union leaders, but by policymakers and scholars interested in making WFPD policies at a state and national level more responsive.
Resonant transformation of electrostatic energy in ExB field system
International Nuclear Information System (INIS)
Tanizuka, Noboru
1986-01-01
A theoretical consideration on an effective transformation of electrostatic potential energy is given. A transformator particle is introduced with the transformation in an ExB field system. A device constant of the system is introduced comparing with some empirical, practical examples and an experimental proof of the transformation is given. Finally a nuclear fusion device plan is proposed based on the idea of the consideration. (author)
Directory of Open Access Journals (Sweden)
Aida Javanmard
2016-09-01
Full Text Available Introduction: Mortierella alpina is one of the most important fungi in food industry because of having ability of synthesizing unsaturated fatty acids, particularly Arashidonic Acid. This is a precursor of Eicosanoidregulate-lipoprotein metabolism which is involved in blood rheology, platelet activation and leukocyte-function, and the functional characteristics of the cell membrane. Materials and methods: In this study genetic transformation of M. alpina CBS754.68 fungus was evaluated via Agrobacterium tumefaciens and Agrobacterium rhizogenes. Agrobacteriums containing pBI121 vector were used for transformation of three days of old mycelia. Three days old hyphae were exposed to the bacteria with three level of time (one, two and three hours in the present of acetosyringone. Mitotic stability of the third generation of transgenic (T2 was confirmed by GUS assay and amplification of CaMV 35S promoter by polymerase chain reaction. Results: The highest percentage of transformation and mitotic stability were obtained by using A. tumefaciens and A. rhizogenese, respectively. Discussion and conclusion: The results showed that to obtain more efficient and more stable transformation, the fundamental factor is the use of suitable species of Agrobacterium. It is the first report for transformation of autothroph strain of M. alpine via Agrobacterium.
A new optical encryption system for image transformation
Yao, Shuyu; Chen, Linfei; Chang, Guojun; He, Bingyu
2017-12-01
This paper introduces a new optical image encryption system based on Fresnel diffraction and phase iterative algorithm, which can realize the conversion between different images. The method is based on the optical system of free space transmission, and uses the iterative phase retrieval algorithm to encode an image into two phase masks and a ciphertext. Unlike the existed methods, the ciphertext is a visible image, which can be used to achieve the conversion of one image to another image. In order to enhance the security, two phase masks are combined into a wide-scale phase mask by the double image cross pixel scrambling approach. In the decryption process, the wide-scale phase mask is re-decrypted into two random phase masks using a random shift matrix. The ciphertext and the first phase mask are placed on the input plane and the second random phase mask is placed on the transformation plane. The Fresnel diffraction principle can be used to obtain the plaintext information on the output plane. Theoretical analysis and simulation results show that the encryption system is feasible and quite safe.
Transforming the Way We Teach Function Transformations
Faulkenberry, Eileen Durand; Faulkenberry, Thomas J.
2010-01-01
In this article, the authors discuss "function," a well-defined rule that relates inputs to outputs. They have found that by using the input-output definition of "function," they can examine transformations of functions simply by looking at changes to input or output and the respective changes to the graph. Applying transformations to the input…
GoFFish: A Sub-Graph Centric Framework for Large-Scale Graph Analytics1
Energy Technology Data Exchange (ETDEWEB)
Simmhan, Yogesh; Kumbhare, Alok; Wickramaarachchi, Charith; Nagarkar, Soonil; Ravi, Santosh; Raghavendra, Cauligi; Prasanna, Viktor
2014-08-25
Large scale graph processing is a major research area for Big Data exploration. Vertex centric programming models like Pregel are gaining traction due to their simple abstraction that allows for scalable execution on distributed systems naturally. However, there are limitations to this approach which cause vertex centric algorithms to under-perform due to poor compute to communication overhead ratio and slow convergence of iterative superstep. In this paper we introduce GoFFish a scalable sub-graph centric framework co-designed with a distributed persistent graph storage for large scale graph analytics on commodity clusters. We introduce a sub-graph centric programming abstraction that combines the scalability of a vertex centric approach with the flexibility of shared memory sub-graph computation. We map Connected Components, SSSP and PageRank algorithms to this model to illustrate its flexibility. Further, we empirically analyze GoFFish using several real world graphs and demonstrate its significant performance improvement, orders of magnitude in some cases, compared to Apache Giraph, the leading open source vertex centric implementation. We map Connected Components, SSSP and PageRank algorithms to this model to illustrate its flexibility. Further, we empirically analyze GoFFish using several real world graphs and demonstrate its significant performance improvement, orders of magnitude in some cases, compared to Apache Giraph, the leading open source vertex centric implementation.
Simulating triangulations. Graphs, manifolds and (quantum) spacetime
International Nuclear Information System (INIS)
Krueger, Benedikt
2016-01-01
Triangulations, which can intuitively be described as a tessellation of space into simplicial building blocks, are structures that arise in various different branches of physics: They can be used for describing complicated and curved objects in a discretized way, e.g., in foams, gels or porous media, or for discretizing curved boundaries for fluid simulations or dissipative systems. Interpreting triangulations as (maximal planar) graphs makes it possible to use them in graph theory or statistical physics, e.g., as small-world networks, as networks of spins or in biological physics as actin networks. Since one can find an analogue of the Einstein-Hilbert action on triangulations, they can even be used for formulating theories of quantum gravity. Triangulations have also important applications in mathematics, especially in discrete topology. Despite their wide occurrence in different branches of physics and mathematics, there are still some fundamental open questions about triangulations in general. It is a prior unknown how many triangulations there are for a given set of points or a given manifold, or even whether there are exponentially many triangulations or more, a question that relates to a well-defined behavior of certain quantum geometry models. Another major unknown question is whether elementary steps transforming triangulations into each other, which are used in computer simulations, are ergodic. Using triangulations as model for spacetime, it is not clear whether there is a meaningful continuum limit that can be identified with the usual and well-tested theory of general relativity. Within this thesis some of these fundamental questions about triangulations are answered by the use of Markov chain Monte Carlo simulations, which are a probabilistic method for calculating statistical expectation values, or more generally a tool for calculating high-dimensional integrals. Additionally, some details about the Wang-Landau algorithm, which is the primary used
Simulating triangulations. Graphs, manifolds and (quantum) spacetime
Energy Technology Data Exchange (ETDEWEB)
Krueger, Benedikt
2016-07-01
Triangulations, which can intuitively be described as a tessellation of space into simplicial building blocks, are structures that arise in various different branches of physics: They can be used for describing complicated and curved objects in a discretized way, e.g., in foams, gels or porous media, or for discretizing curved boundaries for fluid simulations or dissipative systems. Interpreting triangulations as (maximal planar) graphs makes it possible to use them in graph theory or statistical physics, e.g., as small-world networks, as networks of spins or in biological physics as actin networks. Since one can find an analogue of the Einstein-Hilbert action on triangulations, they can even be used for formulating theories of quantum gravity. Triangulations have also important applications in mathematics, especially in discrete topology. Despite their wide occurrence in different branches of physics and mathematics, there are still some fundamental open questions about triangulations in general. It is a prior unknown how many triangulations there are for a given set of points or a given manifold, or even whether there are exponentially many triangulations or more, a question that relates to a well-defined behavior of certain quantum geometry models. Another major unknown question is whether elementary steps transforming triangulations into each other, which are used in computer simulations, are ergodic. Using triangulations as model for spacetime, it is not clear whether there is a meaningful continuum limit that can be identified with the usual and well-tested theory of general relativity. Within this thesis some of these fundamental questions about triangulations are answered by the use of Markov chain Monte Carlo simulations, which are a probabilistic method for calculating statistical expectation values, or more generally a tool for calculating high-dimensional integrals. Additionally, some details about the Wang-Landau algorithm, which is the primary used
Modeling of Solid State Transformer for the FREEDM System Demonstration
Jiang, Youyuan
The Solid State Transformer (SST) is an essential component in the FREEDM system. This research focuses on the modeling of the SST and the controller hardware in the loop (CHIL) implementation of the SST for the support of the FREEDM system demonstration. The energy based control strategy for a three-stage SST is analyzed and applied. A simplified average model of the three-stage SST that is suitable for simulation in real time digital simulator (RTDS) has been developed in this study. The model is also useful for general time-domain power system analysis and simulation. The proposed simplified av-erage model has been validated in MATLAB and PLECS. The accuracy of the model has been verified through comparison with the cycle-by-cycle average (CCA) model and de-tailed switching model. These models are also implemented in PSCAD, and a special strategy to implement the phase shift modulation has been proposed to enable the switching model simulation in PSCAD. The implementation of the CHIL test environment of the SST in RTDS is described in this report. The parameter setup of the model has been discussed in detail. One of the dif-ficulties is the choice of the damping factor, which is revealed in this paper. Also the grounding of the system has large impact on the RTDS simulation. Another problem is that the performance of the system is highly dependent on the switch parameters such as voltage and current ratings. Finally, the functionalities of the SST have been realized on the platform. The distributed energy storage interface power injection and reverse power flow have been validated. Some limitations are noticed and discussed through the simulation on RTDS.
Optimum transformer design for a pulsed power system
International Nuclear Information System (INIS)
Broverman, A.Y.
1987-11-01
Electromagnetic forces resulting from peak pulsed current require special design consideration to prevent failure of the coils of the transformer. Procedures for interleaving transformer windings to reduce both electromagnetic short-circuit forces and reactive voltage drop while reducing procurement costs are described. The basics of transformer design principles and cost trade-offs are included to enhance understanding of the interleaving procedures. 3 refs., 3 figs
Graph processing platforms at scale: practices and experiences
Energy Technology Data Exchange (ETDEWEB)
Lim, Seung-Hwan [ORNL; Lee, Sangkeun (Matt) [ORNL; Brown, Tyler C [ORNL; Sukumar, Sreenivas R [ORNL; Ganesh, Gautam [ORNL
2015-01-01
Graph analysis unveils hidden associations of data in many phenomena and artifacts, such as road network, social networks, genomic information, and scientific collaboration. Unfortunately, a wide diversity in the characteristics of graphs and graph operations make it challenging to find a right combination of tools and implementation of algorithms to discover desired knowledge from the target data set. This study presents an extensive empirical study of three representative graph processing platforms: Pegasus, GraphX, and Urika. Each system represents a combination of options in data model, processing paradigm, and infrastructure. We benchmarked each platform using three popular graph operations, degree distribution, connected components, and PageRank over a variety of real-world graphs. Our experiments show that each graph processing platform shows different strength, depending the type of graph operations. While Urika performs the best in non-iterative operations like degree distribution, GraphX outputforms iterative operations like connected components and PageRank. In addition, we discuss challenges to optimize the performance of each platform over large scale real world graphs.
Directory of Open Access Journals (Sweden)
Luciano Telesca
Full Text Available By using the method of the visibility graph (VG the synthetic seismicity generated by a simple stick-slip system with asperities is analysed. The stick-slip system mimics the interaction between tectonic plates, whose asperities are given by sandpapers of different granularity degrees. The VG properties of the seismic sequences have been put in relationship with the typical seismological parameter, the b-value of the Gutenberg-Richter law. Between the b-value of the synthetic seismicity and the slope of the least square line fitting the k-M plot (relationship between the magnitude M of each synthetic event and its connectivity degree k a close linear relationship is found, also verified by real seismicity.
An optimized formulation for Deprit-type Lie transformations of Taylor maps for symplectic systems
International Nuclear Information System (INIS)
Shi, Jicong
1993-01-01
An optimized iterative formulation is presented for directly transforming a Taylor map of a symplectic system into a Deprit-type Lie transformation, which is a composition of a linear transfer matrix and a single Lie transformation, to an arbitrary order
PERANCANGAN SISTEM PENJADWALAN PEMBELAJARAN MENGGUNAKAN GRAPH COLORING
Directory of Open Access Journals (Sweden)
Taufik Hidayatulloh
2016-03-01
Full Text Available Abstract - In learning scheduling problem often faced by schools in the new academic year. Sometimes collisions on the schedule was not found when the learning process has begun, so it is necessary to re-schedule on the schedule. And this resulted in the teaching and learning first weeks less to run well. Researchers previously have used various methods to solve the scheduling as Tabu search, Simulated Annealing, Network Flow, Graph Coloring. Graph Coloring (coloring of a graph is the simplest method and the experimental results indicate that the development of methods of scheduling Graph Coloring deliver results that meet an average of 93% across the specified constraints. At the time of split schedules that require extra energy at the start of learning did not experience a collision. With this system is expected to facilitate the allocation of space, teachers, lessons to avoid a collision. Keywords: Information Systems, Scheduling, graph coloring Abstraksi - Dalam masalah penjadwalan pembelajaran sering dihadapi sekolah pada tahun ajaran baru. Terkadang tabrakan pada jadwal itu baru ditemukan ketika proses belajar mengajar telah dimulai, sehingga perlu dilakukan penjadwalan ulang pada jadwal tersebut. Dan hal ini mengakibatkan kegiatan belajar mengajar pada minggu-minggu pertama kurang dapat berjalan dengan baik. Para peneliti sebelumnya telah menggunakan berbagai metode untuk memecahkan penjadwalan seperti Tabu search, Simulated Annealing, Network Flow, Graph Coloring. Graph Coloring (pewarnaan graf merupakan metode yang paling sederhana dan hasil percobaan menunjukkan bahwa pengembangan metode Graph Coloring memberikan hasil penjadwalan yang memenuhi rata-rata 93% seluruh constraints yang ditentukan. Pada saat membagi jadwal memerlukan energi ekstra agar pada saat di mulai pembelajaran tidak mengalami tabrakan. Dengan sistem ini diharapkan dapat mempermudah dalam mengalokasikan ruangan, guru, pelajaran agar tidak mengalami tabrakan. Kata
On some covering graphs of a graph
Directory of Open Access Journals (Sweden)
Shariefuddin Pirzada
2016-10-01
Full Text Available For a graph $G$ with vertex set $V(G=\\{v_1, v_2, \\dots, v_n\\}$, let $S$ be the covering set of $G$ having the maximum degree over all the minimum covering sets of $G$. Let $N_S[v]=\\{u\\in S : uv \\in E(G \\}\\cup \\{v\\}$ be the closed neighbourhood of the vertex $v$ with respect to $S.$ We define a square matrix $A_S(G= (a_{ij},$ by $a_{ij}=1,$ if $\\left |N_S[v_i]\\cap N_S[v_j] \\right| \\geq 1, i\
Arosio, Marcello; Martina, Mario L. V.
2017-04-01
The emergent behaviour of the contemporary complex, socio-technical and interconnected society makes the collective risk greater than the sum of the parts and this requires a holistic, systematic and integrated approach. Although there have been major improvements in recent years, there are still some limitation in term of a holistic approach that is able to include the emergent value hidden in the connections between exposed elements and the interactions between the different spheres of the multi-hazards, vulnerability, exposure and resilience. To deal with these challenges it is necessary to consider the connections between the exposed elements (e.g. populations, schools, hospital, etc.) and to quantify the relative importance of the elements and their interconnections (e.g. the need of injured people to go to hospital or children to school). In a system (e.g. road, hospital and ecological network, etc.), or in a System of System (e.g. socio-technical urban service), there are critical elements that, beyond the intrinsic vulnerability, can be characterized by greater or lower vulnerability because of their physical, geographical, cyber or logical connections. To this aim, we propose in this study a comparative analysis between traditional reductionist approach and a new holistic approach to vulnerability assessment to natural hazards. The analysis considers a study case of a socio-economic complex system through an innovative approach based on the properties of graph G=(N,L). A graph consists of two sets N (nodes) and L (links): the nodes represent the single exposed elements (physical, social, environmental, etc.) to a hazard, while the links (or connections) represent the interaction between the elements. The final goal is to illustrate an application of this innovative approach of integrated collective vulnerability assessment.
Canonical transformations and exact invariants for dissipative systems
International Nuclear Information System (INIS)
Pedrosa, I.A.
1986-01-01
A simple treatment to the problem of finding exact invariants and related auxiliary equations for time-dependent oscillators with friction is presented. The treatment is based on the use of a time-dependent canonical transformation and an auxiliary transformation. (Author) [pt
The STAPL Parallel Graph Library
Harshvardhan,
2013-01-01
This paper describes the stapl Parallel Graph Library, a high-level framework that abstracts the user from data-distribution and parallelism details and allows them to concentrate on parallel graph algorithm development. It includes a customizable distributed graph container and a collection of commonly used parallel graph algorithms. The library introduces pGraph pViews that separate algorithm design from the container implementation. It supports three graph processing algorithmic paradigms, level-synchronous, asynchronous and coarse-grained, and provides common graph algorithms based on them. Experimental results demonstrate improved scalability in performance and data size over existing graph libraries on more than 16,000 cores and on internet-scale graphs containing over 16 billion vertices and 250 billion edges. © Springer-Verlag Berlin Heidelberg 2013.
Swanson, R Chad; Cattaneo, Adriano; Bradley, Elizabeth; Chunharas, Somsak; Atun, Rifat; Abbas, Kaja M; Katsaliaki, Korina; Mustafee, Navonil; Mason Meier, Benjamin; Best, Allan
2012-10-01
While reaching consensus on future plans to address current global health challenges is far from easy, there is broad agreement that reductionist approaches that suggest a limited set of targeted interventions to improve health around the world are inadequate. We argue that a comprehensive systems perspective should guide health practice, education, research and policy. We propose key 'systems thinking' tools and strategies that have the potential for transformational change in health systems. Three overarching themes span these tools and strategies: collaboration across disciplines, sectors and organizations; ongoing, iterative learning; and transformational leadership. The proposed tools and strategies in this paper can be applied, in varying degrees, to every organization within health systems, from families and communities to national ministries of health. While our categorization is necessarily incomplete, this initial effort will provide a valuable contribution to the health systems strengthening debate, as the need for a more systemic, rigorous perspective in health has never been greater.
White, AT
1985-01-01
The field of topological graph theory has expanded greatly in the ten years since the first edition of this book appeared. The original nine chapters of this classic work have therefore been revised and updated. Six new chapters have been added, dealing with: voltage graphs, non-orientable imbeddings, block designs associated with graph imbeddings, hypergraph imbeddings, map automorphism groups and change ringing.Thirty-two new problems have been added to this new edition, so that there are now 181 in all; 22 of these have been designated as ``difficult'''' and 9 as ``unsolved''''. Three of the four unsolved problems from the first edition have been solved in the ten years between editions; they are now marked as ``difficult''''.
Ribes, Luis
2017-01-01
This book offers a detailed introduction to graph theoretic methods in profinite groups and applications to abstract groups. It is the first to provide a comprehensive treatment of the subject. The author begins by carefully developing relevant notions in topology, profinite groups and homology, including free products of profinite groups, cohomological methods in profinite groups, and fixed points of automorphisms of free pro-p groups. The final part of the book is dedicated to applications of the profinite theory to abstract groups, with sections on finitely generated subgroups of free groups, separability conditions in free and amalgamated products, and algorithms in free groups and finite monoids. Profinite Graphs and Groups will appeal to students and researchers interested in profinite groups, geometric group theory, graphs and connections with the theory of formal languages. A complete reference on the subject, the book includes historical and bibliographical notes as well as a discussion of open quest...
Subdominant pseudoultrametric on graphs
Energy Technology Data Exchange (ETDEWEB)
Dovgoshei, A A; Petrov, E A [Institute of Applied Mathematics and Mechanics, National Academy of Sciences of Ukraine, Donetsk (Ukraine)
2013-08-31
Let (G,w) be a weighted graph. We find necessary and sufficient conditions under which the weight w:E(G)→R{sup +} can be extended to a pseudoultrametric on V(G), and establish a criterion for the uniqueness of such an extension. We demonstrate that (G,w) is a complete k-partite graph, for k≥2, if and only if for any weight that can be extended to a pseudoultrametric, among all such extensions one can find the least pseudoultrametric consistent with w. We give a structural characterization of graphs for which the subdominant pseudoultrametric is an ultrametric for any strictly positive weight that can be extended to a pseudoultrametric. Bibliography: 14 titles.
Graph based communication analysis for hardware/software codesign
DEFF Research Database (Denmark)
Knudsen, Peter Voigt; Madsen, Jan
1999-01-01
In this paper we present a coarse grain CDFG (Control/Data Flow Graph) model suitable for hardware/software partitioning of single processes and demonstrate how it is necessary to perform various transformations on the graph structure before partitioning in order to achieve a structure that allows...... for accurate estimation of communication overhead between nodes mapped to different processors. In particular, we demonstrate how various transformations of control structures can lead to a more accurate communication analysis and more efficient implementations. The purpose of the transformations is to obtain...
A distributed query execution engine of big attributed graphs.
Batarfi, Omar; Elshawi, Radwa; Fayoumi, Ayman; Barnawi, Ahmed; Sakr, Sherif
2016-01-01
A graph is a popular data model that has become pervasively used for modeling structural relationships between objects. In practice, in many real-world graphs, the graph vertices and edges need to be associated with descriptive attributes. Such type of graphs are referred to as attributed graphs. G-SPARQL has been proposed as an expressive language, with a centralized execution engine, for querying attributed graphs. G-SPARQL supports various types of graph querying operations including reachability, pattern matching and shortest path where any G-SPARQL query may include value-based predicates on the descriptive information (attributes) of the graph edges/vertices in addition to the structural predicates. In general, a main limitation of centralized systems is that their vertical scalability is always restricted by the physical limits of computer systems. This article describes the design, implementation in addition to the performance evaluation of DG-SPARQL, a distributed, hybrid and adaptive parallel execution engine of G-SPARQL queries. In this engine, the topology of the graph is distributed over the main memory of the underlying nodes while the graph data are maintained in a relational store which is replicated on the disk of each of the underlying nodes. DG-SPARQL evaluates parts of the query plan via SQL queries which are pushed to the underlying relational stores while other parts of the query plan, as necessary, are evaluated via indexless memory-based graph traversal algorithms. Our experimental evaluation shows the efficiency and the scalability of DG-SPARQL on querying massive attributed graph datasets in addition to its ability to outperform the performance of Apache Giraph, a popular distributed graph processing system, by orders of magnitudes.
Quantitative graph theory mathematical foundations and applications
Dehmer, Matthias
2014-01-01
The first book devoted exclusively to quantitative graph theory, Quantitative Graph Theory: Mathematical Foundations and Applications presents and demonstrates existing and novel methods for analyzing graphs quantitatively. Incorporating interdisciplinary knowledge from graph theory, information theory, measurement theory, and statistical techniques, this book covers a wide range of quantitative-graph theoretical concepts and methods, including those pertaining to real and random graphs such as:Comparative approaches (graph similarity or distance)Graph measures to characterize graphs quantitat
International Nuclear Information System (INIS)
Kuznetsov, Yu.K.; Pinos, I.B.; Tyupa, V.I.
1999-01-01
With formulas for averaging over magnetic surfaces general analytical expressions are here deduced to determine the rotational transform angles in stellarator systems having different plasma pressure profiles
Game Changing Transformable Entry System Technology Applicability to Robotic Venus Science Missions
National Aeronautics and Space Administration — The innovative adpative deployable entry and placement technology (ADEPT), also known as transformable entry system technology (TEST) concept, akin to an umbrella,...
Dayal, Amit; Brock, David
2018-01-01
Prashant Chandrasekar, a lead developer for the Social Interactome project, has tasked the team with creating a graph representation of the data collected from the social networks involved in that project. The data is currently stored in a MySQL database. The client requested that the graph database be Cayley, but after a literature review, Neo4j was chosen. The reasons for this shift will be explained in the design section. Secondarily, the team was tasked with coming up with three scena...
Stevanovic, Dragan
2015-01-01
Spectral Radius of Graphs provides a thorough overview of important results on the spectral radius of adjacency matrix of graphs that have appeared in the literature in the preceding ten years, most of them with proofs, and including some previously unpublished results of the author. The primer begins with a brief classical review, in order to provide the reader with a foundation for the subsequent chapters. Topics covered include spectral decomposition, the Perron-Frobenius theorem, the Rayleigh quotient, the Weyl inequalities, and the Interlacing theorem. From this introduction, the
Directory of Open Access Journals (Sweden)
Namhee Kim
Full Text Available Graph representations have been widely used to analyze and design various economic, social, military, political, and biological networks. In systems biology, networks of cells and organs are useful for understanding disease and medical treatments and, in structural biology, structures of molecules can be described, including RNA structures. In our RNA-As-Graphs (RAG framework, we represent RNA structures as tree graphs by translating unpaired regions into vertices and helices into edges. Here we explore the modularity of RNA structures by applying graph partitioning known in graph theory to divide an RNA graph into subgraphs. To our knowledge, this is the first application of graph partitioning to biology, and the results suggest a systematic approach for modular design in general. The graph partitioning algorithms utilize mathematical properties of the Laplacian eigenvector (µ2 corresponding to the second eigenvalues (λ2 associated with the topology matrix defining the graph: λ2 describes the overall topology, and the sum of µ2's components is zero. The three types of algorithms, termed median, sign, and gap cuts, divide a graph by determining nodes of cut by median, zero, and largest gap of µ2's components, respectively. We apply these algorithms to 45 graphs corresponding to all solved RNA structures up through 11 vertices (∼ 220 nucleotides. While we observe that the median cut divides a graph into two similar-sized subgraphs, the sign and gap cuts partition a graph into two topologically-distinct subgraphs. We find that the gap cut produces the best biologically-relevant partitioning for RNA because it divides RNAs at less stable connections while maintaining junctions intact. The iterative gap cuts suggest basic modules and assembly protocols to design large RNA structures. Our graph substructuring thus suggests a systematic approach to explore the modularity of biological networks. In our applications to RNA structures, subgraphs
2008-09-01
Psychophysiologic Response and Technology -Enabled Learning and Intervention Systems PRINCIPAL INVESTIGATOR: Leigh W. Jerome, Ph.D...NUMBER Transformative Learning : Patterns of Psychophysiologic Response and Technology - Enabled Learning and Intervention Systems 5b. GRANT NUMBER...project entitled “Transformative Learning : Patterns of Psychophysiologic Response in Technology Enabled Learning and Intervention Systems.” The
International Nuclear Information System (INIS)
Yeon, Kyu Hwang; Hong, Suc Kyoung; Um, Chung In; George, Thomas F.
2006-01-01
With quantum operators corresponding to functions of the canonical variables, Schroedinger equations are constructed for systems corresponding to classical systems connected by a general point canonical transformation. Using the operator connecting quantum states between systems before and after the transformation, the quantum correction term and ordering parameter are obtained
Arbaoui, B.
2014-01-01
This thesis investigates the transformation of West-European television systems since the onset of the liberalisation process through a systematic comparison of 17 television systems between 1980 and 2008. The transformation of West-European television systems is analysed through a dualistic
Graph embedding with rich information through heterogeneous graph
Sun, Guolei
2017-01-01
Graph embedding, aiming to learn low-dimensional representations for nodes in graphs, has attracted increasing attention due to its critical application including node classification, link prediction and clustering in social network analysis. Most
Using Graph and Vertex Entropy to Compare Empirical Graphs with Theoretical Graph Models
Directory of Open Access Journals (Sweden)
Tomasz Kajdanowicz
2016-09-01
Full Text Available Over the years, several theoretical graph generation models have been proposed. Among the most prominent are: the Erdős–Renyi random graph model, Watts–Strogatz small world model, Albert–Barabási preferential attachment model, Price citation model, and many more. Often, researchers working with real-world data are interested in understanding the generative phenomena underlying their empirical graphs. They want to know which of the theoretical graph generation models would most probably generate a particular empirical graph. In other words, they expect some similarity assessment between the empirical graph and graphs artificially created from theoretical graph generation models. Usually, in order to assess the similarity of two graphs, centrality measure distributions are compared. For a theoretical graph model this means comparing the empirical graph to a single realization of a theoretical graph model, where the realization is generated from the given model using an arbitrary set of parameters. The similarity between centrality measure distributions can be measured using standard statistical tests, e.g., the Kolmogorov–Smirnov test of distances between cumulative distributions. However, this approach is both error-prone and leads to incorrect conclusions, as we show in our experiments. Therefore, we propose a new method for graph comparison and type classification by comparing the entropies of centrality measure distributions (degree centrality, betweenness centrality, closeness centrality. We demonstrate that our approach can help assign the empirical graph to the most similar theoretical model using a simple unsupervised learning method.
Topics in graph theory graphs and their Cartesian product
Imrich, Wilfried; Rall, Douglas F
2008-01-01
From specialists in the field, you will learn about interesting connections and recent developments in the field of graph theory by looking in particular at Cartesian products-arguably the most important of the four standard graph products. Many new results in this area appear for the first time in print in this book. Written in an accessible way, this book can be used for personal study in advanced applications of graph theory or for an advanced graph theory course.
AN EFFECTIVE RECOMMENDATIONS BY DIFFUSION ALGORITHM FOR WEB GRAPH MINING
Directory of Open Access Journals (Sweden)
S. Vasukipriya
2013-04-01
Full Text Available The information on the World Wide Web grows in an explosive rate. Societies are relying more on the Web for their miscellaneous needs of information. Recommendation systems are active information filtering systems that attempt to present the information items like movies, music, images, books recommendations, tags recommendations, query suggestions, etc., to the users. Various kinds of data bases are used for the recommendations; fundamentally these data bases can be molded in the form of many types of graphs. Aiming at provided that a general framework on effective DR (Recommendations by Diffusion algorithm for web graphs mining. First introduce a novel graph diffusion model based on heat diffusion. This method can be applied to both undirected graphs and directed graphs. Then it shows how to convert different Web data sources into correct graphs in our models.
A formal definition of data flow graph models
Kavi, Krishna M.; Buckles, Bill P.; Bhat, U. Narayan
1986-01-01
In this paper, a new model for parallel computations and parallel computer systems that is based on data flow principles is presented. Uninterpreted data flow graphs can be used to model computer systems including data driven and parallel processors. A data flow graph is defined to be a bipartite graph with actors and links as the two vertex classes. Actors can be considered similar to transitions in Petri nets, and links similar to places. The nondeterministic nature of uninterpreted data flow graphs necessitates the derivation of liveness conditions.
Coloring geographical threshold graphs
Energy Technology Data Exchange (ETDEWEB)
Bradonjic, Milan [Los Alamos National Laboratory; Percus, Allon [Los Alamos National Laboratory; Muller, Tobias [EINDHOVEN UNIV. OF TECH
2008-01-01
We propose a coloring algorithm for sparse random graphs generated by the geographical threshold graph (GTG) model, a generalization of random geometric graphs (RGG). In a GTG, nodes are distributed in a Euclidean space, and edges are assigned according to a threshold function involving the distance between nodes as well as randomly chosen node weights. The motivation for analyzing this model is that many real networks (e.g., wireless networks, the Internet, etc.) need to be studied by using a 'richer' stochastic model (which in this case includes both a distance between nodes and weights on the nodes). Here, we analyze the GTG coloring algorithm together with the graph's clique number, showing formally that in spite of the differences in structure between GTG and RGG, the asymptotic behavior of the chromatic number is identical: {chi}1n 1n n / 1n n (1 + {omicron}(1)). Finally, we consider the leading corrections to this expression, again using the coloring algorithm and clique number to provide bounds on the chromatic number. We show that the gap between the lower and upper bound is within C 1n n / (1n 1n n){sup 2}, and specify the constant C.
Budhiraja, A.S.; Mukherjee, D.; Wu, R.
2017-01-01
We consider a variation of the supermarket model in which the servers can communicate with their neighbors and where the neighborhood relationships are described in terms of a suitable graph. Tasks with unit-exponential service time distributions arrive at each vertex as independent Poisson
DEFF Research Database (Denmark)
Kucharik, Marcel; Hofacker, Ivo; Stadler, Peter
2014-01-01
of the folding free energy landscape, however, can provide the relevant information. Results We introduce the basin hopping graph (BHG) as a novel coarse-grained model of folding landscapes. Each vertex of the BHG is a local minimum, which represents the corresponding basin in the landscape. Its edges connect...
The STAPL Parallel Graph Library
Harshvardhan,; Fidel, Adam; Amato, Nancy M.; Rauchwerger, Lawrence
2013-01-01
This paper describes the stapl Parallel Graph Library, a high-level framework that abstracts the user from data-distribution and parallelism details and allows them to concentrate on parallel graph algorithm development. It includes a customizable
Visibility graph analysis on heartbeat dynamics of meditation training
Jiang, Sen; Bian, Chunhua; Ning, Xinbao; Ma, Qianli D. Y.
2013-06-01
We apply the visibility graph analysis to human heartbeat dynamics by constructing the complex networks of heartbeat interval time series and investigating the statistical properties of the network before and during chi and yoga meditation. The experiment results show that visibility graph analysis can reveal the dynamical changes caused by meditation training manifested as regular heartbeat, which is closely related to the adjustment of autonomous neural system, and visibility graph analysis is effective to evaluate the effect of meditation.
Groupies in multitype random graphs
Shang, Yilun
2016-01-01
A groupie in a graph is a vertex whose degree is not less than the average degree of its neighbors. Under some mild conditions, we show that the proportion of groupies is very close to 1/2 in multitype random graphs (such as stochastic block models), which include Erd?s-R?nyi random graphs, random bipartite, and multipartite graphs as special examples. Numerical examples are provided to illustrate the theoretical results.
Groupies in multitype random graphs.
Shang, Yilun
2016-01-01
A groupie in a graph is a vertex whose degree is not less than the average degree of its neighbors. Under some mild conditions, we show that the proportion of groupies is very close to 1/2 in multitype random graphs (such as stochastic block models), which include Erdős-Rényi random graphs, random bipartite, and multipartite graphs as special examples. Numerical examples are provided to illustrate the theoretical results.
Temporal Representation in Semantic Graphs
Energy Technology Data Exchange (ETDEWEB)
Levandoski, J J; Abdulla, G M
2007-08-07
A wide range of knowledge discovery and analysis applications, ranging from business to biological, make use of semantic graphs when modeling relationships and concepts. Most of the semantic graphs used in these applications are assumed to be static pieces of information, meaning temporal evolution of concepts and relationships are not taken into account. Guided by the need for more advanced semantic graph queries involving temporal concepts, this paper surveys the existing work involving temporal representations in semantic graphs.
A generalization of total graphs
Indian Academy of Sciences (India)
M Afkhami
2018-04-12
Apr 12, 2018 ... product of any lower triangular matrix with the transpose of any element of U belongs to U. The ... total graph of R, which is denoted by T( (R)), is a simple graph with all elements of R as vertices, and ...... [9] Badawi A, On dot-product graph of a commutative ring, Communications in Algebra 43 (2015). 43–50.
On dominator colorings in graphs
Indian Academy of Sciences (India)
colors required for a dominator coloring of G is called the dominator .... Theorem 1.3 shows that the complete graph Kn is the only connected graph of order n ... Conversely, if a graph G satisfies condition (i) or (ii), it is easy to see that χd(G) =.
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.
Geels, F.W.
2007-01-01
The transformation of existing systems is an underexposed topic in large technical systems (LTS) research. Most LTS research has focused on the emergence and stabilization of systems, ending with momentum. But how is momentum overcome, and how do transformations come about? This article presents a
Fourier transform infrared spectra applications to chemical systems
Ferraro, John R
1985-01-01
The final and largest volume to complete this four-volume treatise is published in response to the intense commercial and research interest in Fourier Transform Interferometry.Presenting current information from leading experts in the field, Volume 4 introduces new information on, for example, applications of Diffuse Reflectance Spectroscopy in the Far-Infrared Region. The editors place emphasis on surface studies and address advances in Capillary Gas Chromatography - Fourier Transform Interferometry.Volume 4 especially benefits spectroscopists and physicists, as well as researchers
Algorithms for Planar Graphs and Graphs in Metric Spaces
DEFF Research Database (Denmark)
Wulff-Nilsen, Christian
structural properties that can be exploited. For instance, a road network or a wire layout on a microchip is typically (near-)planar and distances in the network are often defined w.r.t. the Euclidean or the rectilinear metric. Specialized algorithms that take advantage of such properties are often orders...... of magnitude faster than the corresponding algorithms for general graphs. The first and main part of this thesis focuses on the development of efficient planar graph algorithms. The most important contributions include a faster single-source shortest path algorithm, a distance oracle with subquadratic...... for geometric graphs and graphs embedded in metric spaces. Roughly speaking, the stretch factor is a real value expressing how well a (geo-)metric graph approximates the underlying complete graph w.r.t. distances. We give improved algorithms for computing the stretch factor of a given graph and for augmenting...
Monitoring systems online of oil for transformers of nuclear power plants
International Nuclear Information System (INIS)
Sarandeses, S.
2014-01-01
The nuclear power plants are showing their concern due to the existence of recent failures related to the bulky transformers of power. These transformers are not security, but are important for the production of power as its failure can cause transient on the floor, reactor scram or shooting, that can cause interruptions in the production of energy or might force us to reduce the power of production The analysis of gases dissolved in transformer oil is recognized as a trial key to identify a submerged transformer failure in oil. With this analysis it is not possible to ensure that there is no damage in the transformer, but the probability of risk of this type of failure can be reduced. The industry recommended to equip the new large power transformers with oil online monitoring systems and in some cases also be It recommended its use in existing transformers. (Author)
Percolator: Scalable Pattern Discovery in Dynamic Graphs
Energy Technology Data Exchange (ETDEWEB)
Choudhury, Sutanay; Purohit, Sumit; Lin, Peng; Wu, Yinghui; Holder, Lawrence B.; Agarwal, Khushbu
2018-02-06
We demonstrate Percolator, a distributed system for graph pattern discovery in dynamic graphs. In contrast to conventional mining systems, Percolator advocates efficient pattern mining schemes that (1) support pattern detection with keywords; (2) integrate incremental and parallel pattern mining; and (3) support analytical queries such as trend analysis. The core idea of Percolator is to dynamically decide and verify a small fraction of patterns and their in- stances that must be inspected in response to buffered updates in dynamic graphs, with a total mining cost independent of graph size. We demonstrate a) the feasibility of incremental pattern mining by walking through each component of Percolator, b) the efficiency and scalability of Percolator over the sheer size of real-world dynamic graphs, and c) how the user-friendly GUI of Percolator inter- acts with users to support keyword-based queries that detect, browse and inspect trending patterns. We also demonstrate two user cases of Percolator, in social media trend analysis and academic collaboration analysis, respectively.
A survey and comparison of transformation tools based on the transformation tool contest
Jakumeit, E.; Van Gorp, P.; Buchwald, S.; Rose, L.; Wagelaar, D.; Dan, L.; Hegedüs, Á; Hermannsdörfer, M.; Horn, T.; Kalnina, E.; Krause, C.; Lano, K.; Lepper, M.; Rensink, Arend; Rose, L.M.; Wätzoldt, S.; Mazanek, S.
Model transformation is one of the key tasks in model-driven engineering and relies on the efficient matching and modification of graph-based data structures; its sibling graph rewriting has been used to successfully model problems in a variety of domains. Over the last years, a wide range of graph
Rapid Business Transformations in Health Care: A Systems Approach
Shulaiba, Refaat A.
2011-01-01
The top two priorities of health care business leaders are to constantly improve the quality of health care while striving to contain and reduce the high cost of health care. The Health Care industry, similar to all businesses, is motivated to deliver innovative solutions that accelerate business transformation and increase business capabilities. …
Nonlinear Fourier transform for dual-polarization optical communication system
DEFF Research Database (Denmark)
Gaiarin, Simone
communication is considered an emerging paradigm in fiber-optic communications that could potentially overcome these limitations. It relies on a mathematical technique called “inverse scattering transform” or “nonlinear Fourier transform (NFT)” to exploit the “hidden” linearity of the nonlinear Schrödinger...
Graph theory and the Virasoro master equation
International Nuclear Information System (INIS)
Obers, N.A.J.
1991-01-01
A brief history of affine Lie algebra, the Virasoro algebra and its culmination in the Virasoro master equation is given. By studying ansaetze of the master equation, the author obtains exact solutions and gains insight in the structure of large slices of affine-Virasoro space. He finds an isomorphism between the constructions in the ansatz SO(n) diag , which is a set of unitary, generically irrational affine-Virasoro constructions on SO(n), and the unlabeled graphs of order n. On the one hand, the conformal constructions, are classified by the graphs, while, conversely, a group-theoretic and conformal field-theoretic identification is obtained for every graph of graph theory. He also defines a class of magic Lie group bases in which the Virasoro master equation admits a simple metric ansatz {g metric }, whose structure is visible in the high-level expansion. When a magic basis is real on compact g, the corresponding g metric is a large system of unitary, generically irrational conformal field theories. Examples in this class include the graph-theory ansatz SO(n) diag in the Cartesian basis of SO(n), and the ansatz SU(n) metric in the Pauli-like basis of SU(n). Finally, he defines the 'sine-area graphs' of SU(n), which label the conformal field theories of SU(n) metric , and he notes that, in similar fashion, each magic basis of g defines a generalized graph theory on g which labels the conformal field theories of g metric
Harary, Frank
2015-01-01
Presented in 1962-63 by experts at University College, London, these lectures offer a variety of perspectives on graph theory. Although the opening chapters form a coherent body of graph theoretic concepts, this volume is not a text on the subject but rather an introduction to the extensive literature of graph theory. The seminar's topics are geared toward advanced undergraduate students of mathematics.Lectures by this volume's editor, Frank Harary, include ""Some Theorems and Concepts of Graph Theory,"" ""Topological Concepts in Graph Theory,"" ""Graphical Reconstruction,"" and other introduc
Spectral fluctuations of quantum graphs
International Nuclear Information System (INIS)
Pluhař, Z.; Weidenmüller, H. A.
2014-01-01
We prove the Bohigas-Giannoni-Schmit conjecture in its most general form for completely connected simple graphs with incommensurate bond lengths. We show that for graphs that are classically mixing (i.e., graphs for which the spectrum of the classical Perron-Frobenius operator possesses a finite gap), the generating functions for all (P,Q) correlation functions for both closed and open graphs coincide (in the limit of infinite graph size) with the corresponding expressions of random-matrix theory, both for orthogonal and for unitary symmetry
Dynamic Representations of Sparse Graphs
DEFF Research Database (Denmark)
Brodal, Gerth Stølting; Fagerberg, Rolf
1999-01-01
We present a linear space data structure for maintaining graphs with bounded arboricity—a large class of sparse graphs containing e.g. planar graphs and graphs of bounded treewidth—under edge insertions, edge deletions, and adjacency queries. The data structure supports adjacency queries in worst...... case O(c) time, and edge insertions and edge deletions in amortized O(1) and O(c+log n) time, respectively, where n is the number of nodes in the graph, and c is the bound on the arboricity....
Domination criticality in product graphs
Directory of Open Access Journals (Sweden)
M.R. Chithra
2015-07-01
Full Text Available A connected dominating set is an important notion and has many applications in routing and management of networks. Graph products have turned out to be a good model of interconnection networks. This motivated us to study the Cartesian product of graphs G with connected domination number, γc(G=2,3 and characterize such graphs. Also, we characterize the k−γ-vertex (edge critical graphs and k−γc-vertex (edge critical graphs for k=2,3 where γ denotes the domination number of G. We also discuss the vertex criticality in grids.
Study of Chromatic parameters of Line, Total, Middle graphs and Graph operators of Bipartite graph
Nagarathinam, R.; Parvathi, N.
2018-04-01
Chromatic parameters have been explored on the basis of graph coloring process in which a couple of adjacent nodes receives different colors. But the Grundy and b-coloring executes maximum colors under certain restrictions. In this paper, Chromatic, b-chromatic and Grundy number of some graph operators of bipartite graph has been investigat
Wu, Dongliang; Navet, Natasha; Liu, Yingchao; Uchida, Janice; Tian, Miaoying
2016-09-06
As an agriculturally important oomycete genus, Phytophthora contains a large number of destructive plant pathogens that severely threaten agricultural production and natural ecosystems. Among them is the broad host range pathogen P. palmivora, which infects many economically important plant species. An essential way to dissect their pathogenesis mechanisms is genetic modification of candidate genes, which requires effective transformation systems. Four methods were developed for transformation of Phytophthora spp., including PEG(polyethylene glycol)/CaCl2 mediated protoplast transformation, electroporation of zoospores, microprojectile bombardment and Agrobacterium-mediated transformation (AMT). Among them, AMT has many advantages over the other methods such as easy handling and mainly generating single-copy integration in the genome. An AMT method previously reported for P. infestans and P. palmivora has barely been used in oomycete research due to low success and low reproducibility. In this study, we report a simple and efficient AMT system for P. palmivora. Using this system, we were able to reproducibly generate over 40 transformants using zoospores collected from culture grown in a single 100 mm-diameter petri dish. The generated GFP transformants constitutively expressed GFP readily detectable using a fluorescence microscope. All of the transformants tested using Southern blot analysis contained a single-copy T-DNA insertion. This system is highly effective and reproducible for transformation of P. palmivora and expected to be adaptable for transformation of additional Phytophthora spp. and other oomycetes. Its establishment will greatly accelerate their functional genomic studies.
An improved ternary vector system for Agrobacterium-mediated rapid maize transformation.
Anand, Ajith; Bass, Steven H; Wu, Emily; Wang, Ning; McBride, Kevin E; Annaluru, Narayana; Miller, Michael; Hua, Mo; Jones, Todd J
2018-05-01
A simple and versatile ternary vector system that utilizes improved accessory plasmids for rapid maize transformation is described. This system facilitates high-throughput vector construction and plant transformation. The super binary plasmid pSB1 is a mainstay of maize transformation. However, the large size of the base vector makes it challenging to clone, the process of co-integration is cumbersome and inefficient, and some Agrobacterium strains are known to give rise to spontaneous mutants resistant to tetracycline. These limitations present substantial barriers to high throughput vector construction. Here we describe a smaller, simpler and versatile ternary vector system for maize transformation that utilizes improved accessory plasmids requiring no co-integration step. In addition, the newly described accessory plasmids have restored virulence genes found to be defective in pSB1, as well as added virulence genes. Testing of different configurations of the accessory plasmids in combination with T-DNA binary vector as ternary vectors nearly doubles both the raw transformation frequency and the number of transformation events of usable quality in difficult-to-transform maize inbreds. The newly described ternary vectors enabled the development of a rapid maize transformation method for elite inbreds. This vector system facilitated screening different origins of replication on the accessory plasmid and T-DNA vector, and four combinations were identified that have high (86-103%) raw transformation frequency in an elite maize inbred.
Directory of Open Access Journals (Sweden)
Heinz Toparkus
2014-04-01
Full Text Available In this paper we consider first-order systems with constant coefficients for two real-valued functions of two real variables. This is both a problem in itself, as well as an alternative view of the classical linear partial differential equations of second order with constant coefficients. The classification of the systems is done using elementary methods of linear algebra. Each type presents its special canonical form in the associated characteristic coordinate system. Then you can formulate initial value problems in appropriate basic areas, and you can try to achieve a solution of these problems by means of transform methods.
Directory of Open Access Journals (Sweden)
Marc-Thorsten Hütt
2012-06-01
Full Text Available Cellular automata (CA are a remarkably efficient tool for exploring general properties of complex systems and spatiotemporal patterns arising from local rules. Totalistic cellular automata, where the update rules depend only on the density of neighboring states, are at the same time a versatile tool for exploring dynamical processes on graphs. Here we briefly review our previous results on cellular automata on graphs, emphasizing some systematic relationships between network architecture and dynamics identified in this way. We then extend the investigation towards graphs obtained in a simulated-evolution procedure, starting from Erdő s–Rényi (ER graphs and selecting for low entropies of the CA dynamics. Our key result is a strong association of low Shannon entropies with a broadening of the graph’s degree distribution.
Energy Minimization of Discrete Protein Titration State Models Using Graph Theory
Purvine, Emilie; Monson, Kyle; Jurrus, Elizabeth; Star, Keith; Baker, Nathan A.
2016-01-01
There are several applications in computational biophysics which require the optimization of discrete interacting states; e.g., amino acid titration states, ligand oxidation states, or discrete rotamer angles. Such optimization can be very time-consuming as it scales exponentially in the number of sites to be optimized. In this paper, we describe a new polynomial-time algorithm for optimization of discrete states in macromolecular systems. This algorithm was adapted from image processing and uses techniques from discrete mathematics and graph theory to restate the optimization problem in terms of “maximum flow-minimum cut” graph analysis. The interaction energy graph, a graph in which vertices (amino acids) and edges (interactions) are weighted with their respective energies, is transformed into a flow network in which the value of the minimum cut in the network equals the minimum free energy of the protein, and the cut itself encodes the state that achieves the minimum free energy. Because of its deterministic nature and polynomial-time performance, this algorithm has the potential to allow for the ionization state of larger proteins to be discovered. PMID:27089174
Energy Minimization of Discrete Protein Titration State Models Using Graph Theory.
Purvine, Emilie; Monson, Kyle; Jurrus, Elizabeth; Star, Keith; Baker, Nathan A
2016-08-25
There are several applications in computational biophysics that require the optimization of discrete interacting states, for example, amino acid titration states, ligand oxidation states, or discrete rotamer angles. Such optimization can be very time-consuming as it scales exponentially in the number of sites to be optimized. In this paper, we describe a new polynomial time algorithm for optimization of discrete states in macromolecular systems. This algorithm was adapted from image processing and uses techniques from discrete mathematics and graph theory to restate the optimization problem in terms of "maximum flow-minimum cut" graph analysis. The interaction energy graph, a graph in which vertices (amino acids) and edges (interactions) are weighted with their respective energies, is transformed into a flow network in which the value of the minimum cut in the network equals the minimum free energy of the protein and the cut itself encodes the state that achieves the minimum free energy. Because of its deterministic nature and polynomial time performance, this algorithm has the potential to allow for the ionization state of larger proteins to be discovered.
International Nuclear Information System (INIS)
Matsumoto, K.; Takahashi, H.; Saito, H.; Ikeda, Y.
1978-01-01
Mechanisms of inefficiency in heterospecies transformation were studied with a transformation system consisting of Bacillus subtilis 168TI (trpC2thy) as recipient and of DNA prepared from partially hybrid strains of B. subtilis which had incorporated trp + DNA of B. amyloliquefaciens 203 (formerly, B. megaterium 203) in the chromosome (termed intergenote). The intergenote transformation was not so efficient as the corresponding homospecies transformation and the efficiency appeared to relate inversely with the length of heterologous portion in the intergenote. When a variety of ultraviolet light (UV) sensitive mutants, deficient in host-cell reactivation capacity, were used as recipients for the intergenote transformation, 2 out of 16 mutants exhibited significantly enhanced transformation efficiency of the trpC marker. Genetic studies by transformation showed that the trait relating to the enhancement of intergenote-transformation efficiency was always associated with the UV sensitivity, suggesting that these two traits are determined by a single gene. The efficiency of intergenote transformation was highly affected also by DNA concentration; the lower the concentration, the less the efficiency. When, however, the UV sensitive mutant was used as recipient, the effect of DNA concentration was largely diminished, suggesting the reduction of DNA-inactivating activity in the UV sensitive recipient. These results were discussed in relation to a possible excision-repair system selectively correcting the mismatched DNA in the course of intergenote transformation. (orig.) [de
Graph Sampling for Covariance Estimation
Chepuri, Sundeep Prabhakar
2017-04-25
In this paper the focus is on subsampling as well as reconstructing the second-order statistics of signals residing on nodes of arbitrary undirected graphs. Second-order stationary graph signals may be obtained by graph filtering zero-mean white noise and they admit a well-defined power spectrum whose shape is determined by the frequency response of the graph filter. Estimating the graph power spectrum forms an important component of stationary graph signal processing and related inference tasks such as Wiener prediction or inpainting on graphs. The central result of this paper is that by sampling a significantly smaller subset of vertices and using simple least squares, we can reconstruct the second-order statistics of the graph signal from the subsampled observations, and more importantly, without any spectral priors. To this end, both a nonparametric approach as well as parametric approaches including moving average and autoregressive models for the graph power spectrum are considered. The results specialize for undirected circulant graphs in that the graph nodes leading to the best compression rates are given by the so-called minimal sparse rulers. A near-optimal greedy algorithm is developed to design the subsampling scheme for the non-parametric and the moving average models, whereas a particular subsampling scheme that allows linear estimation for the autoregressive model is proposed. Numerical experiments on synthetic as well as real datasets related to climatology and processing handwritten digits are provided to demonstrate the developed theory.
Hendrix, William; Jenkins, John; Padmanabhan, Kanchana; Chakraborty, Arpan
2014-01-01
Practical Graph Mining with R presents a "do-it-yourself" approach to extracting interesting patterns from graph data. It covers many basic and advanced techniques for the identification of anomalous or frequently recurring patterns in a graph, the discovery of groups or clusters of nodes that share common patterns of attributes and relationships, the extraction of patterns that distinguish one category of graphs from another, and the use of those patterns to predict the category of new graphs. Hands-On Application of Graph Data Mining Each chapter in the book focuses on a graph mining task, such as link analysis, cluster analysis, and classification. Through applications using real data sets, the book demonstrates how computational techniques can help solve real-world problems. The applications covered include network intrusion detection, tumor cell diagnostics, face recognition, predictive toxicology, mining metabolic and protein-protein interaction networks, and community detection in social networks. De...
Canonical Labelling of Site Graphs
Directory of Open Access Journals (Sweden)
Nicolas Oury
2013-06-01
Full Text Available We investigate algorithms for canonical labelling of site graphs, i.e. graphs in which edges bind vertices on sites with locally unique names. We first show that the problem of canonical labelling of site graphs reduces to the problem of canonical labelling of graphs with edge colourings. We then present two canonical labelling algorithms based on edge enumeration, and a third based on an extension of Hopcroft's partition refinement algorithm. All run in quadratic worst case time individually. However, one of the edge enumeration algorithms runs in sub-quadratic time for graphs with "many" automorphisms, and the partition refinement algorithm runs in sub-quadratic time for graphs with "few" bisimulation equivalences. This suite of algorithms was chosen based on the expectation that graphs fall in one of those two categories. If that is the case, a combined algorithm runs in sub-quadratic worst case time. Whether this expectation is reasonable remains an interesting open problem.
Learning heat diffusion graphs
Thanou, Dorina; Dong, Xiaowen; Kressner, Daniel; Frossard, Pascal
2016-01-01
Effective information analysis generally boils down to properly identifying the structure or geometry of the data, which is often represented by a graph. In some applications, this structure may be partly determined by design constraints or pre-determined sensing arrangements, like in road transportation networks for example. In general though, the data structure is not readily available and becomes pretty difficult to define. In particular, the global smoothness assumptions, that most of the...
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…
Investigation of thermal and hydrodynamic processes in the oil transformer radiator cooling system
Ільїн, Сергій Віталійович
2013-01-01
Despite the large number of publications in the field of transformer, heat transfer and hydrodynamic processes that take place in the radiator cooling systems, lack of attention. However, for a comprehensive analysis of the entire oil circuit in the transformer, it is necessary to take into account the work of the radiator, as it was on the efficiency of removal of heat in it will depend on the oil temperature at the inlet of the transformer. To achieve these objectives, this paper describes ...
A Theory of Transformative Agency in Linked Social-Ecological Systems
Directory of Open Access Journals (Sweden)
Frances R. Westley
2013-09-01
Full Text Available We reviewed the literature on leadership in linked social-ecological systems and combined it with the literature on institutional entrepreneurship in complex adaptive systems to develop a new theory of transformative agency in linked social-ecological systems. Although there is evidence of the importance of strategic agency in introducing innovation and transforming approaches to management and governance of such systems, there is no coherent theory to explain the wide diversity of strategies identified. Using Holling's adaptive cycle as a model of phases present in innovation and transformation of resilient social-ecological systems, overlaid by Dorado's model of opportunity context (opaque, hazy, transparent in complex adaptive systems, we propose a more coherent theory of strategic agency, which links particular strategies, on the part of transformative agents, to phases of system change.
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.
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
Incremental Frequent Subgraph Mining on Large Evolving Graphs
Abdelhamid, Ehab
2017-08-22
Frequent subgraph mining is a core graph operation used in many domains, such as graph data management and knowledge exploration, bioinformatics and security. Most existing techniques target static graphs. However, modern applications, such as social networks, utilize large evolving graphs. Mining these graphs using existing techniques is infeasible, due to the high computational cost. In this paper, we propose IncGM+, a fast incremental approach for continuous frequent subgraph mining problem on a single large evolving graph. We adapt the notion of “fringe” to the graph context, that is the set of subgraphs on the border between frequent and infrequent subgraphs. IncGM+ maintains fringe subgraphs and exploits them to prune the search space. To boost the efficiency, we propose an efficient index structure to maintain selected embeddings with minimal memory overhead. These embeddings are utilized to avoid redundant expensive subgraph isomorphism operations. Moreover, the proposed system supports batch updates. Using large real-world graphs, we experimentally verify that IncGM+ outperforms existing methods by up to three orders of magnitude, scales to much larger graphs and consumes less memory.
Gallerani, Luigi
2015-01-01
Abstract The CERN Technical Network (TN) TN was intended to be a network for accelerator and infrastructure operations. However, today, more than 60 million IP packets are routed every hour between the General Purpose Network (GPN) and the TN, involving more than 6000 different hosts. In order to improve the security of the accelerator control system, it is fundamental to understand the network traffic between the two networks and to define new appropriate routing and firewall rules without impacting operations. The complexity and huge size of the infrastructure and the number of protocols and services involved, have discouraged for years any attempt to understand and control the network traffic between the GPN and the TN. In this paper, we show a new way to solve the problem graphically. Combining the network traffic analysis with the use of large graph visualization algorithms we produced usable 2D large color topology maps of the network identifying the inter-relations of the control system machines and s...
Algebraic Methods for Counting Euclidean Embeddings of Rigid Graphs
I.Z. Emiris; E.P. Tsigaridas; A. Varvitsiotis (Antonios); E.R. Gasner
2009-01-01
textabstract The study of (minimally) rigid graphs is motivated by numerous applications, mostly in robotics and bioinformatics. A major open problem concerns the number of embeddings of such graphs, up to rigid motions, in Euclidean space. We capture embeddability by polynomial systems
Generic Graph Grammar: A Simple Grammar for Generic Procedural Modelling
DEFF Research Database (Denmark)
Christiansen, Asger Nyman; Bærentzen, Jakob Andreas
2012-01-01
in a directed cyclic graph. Furthermore, the basic productions are chosen such that Generic Graph Grammar seamlessly combines the capabilities of L-systems to imitate biological growth (to model trees, animals, etc.) and those of split grammars to design structured objects (chairs, houses, etc.). This results...
Formation of Robust Multi-Agent Networks through Self-Organizing Random Regular Graphs
Yasin Yazicioǧlu, A.; Egerstedt, Magnus; Shamma, Jeff S.
2015-01-01
Multi-Agent networks are often modeled as interaction graphs, where the nodes represent the agents and the edges denote some direct interactions. The robustness of a multi-Agent network to perturbations such as failures, noise, or malicious attacks largely depends on the corresponding graph. In many applications, networks are desired to have well-connected interaction graphs with relatively small number of links. One family of such graphs is the random regular graphs. In this paper, we present a decentralized scheme for transforming any connected interaction graph with a possibly non-integer average degree of k into a connected random m-regular graph for some m ϵ [k+k ] 2. Accordingly, the agents improve the robustness of the network while maintaining a similar number of links as the initial configuration by locally adding or removing some edges. © 2015 IEEE.
Formation of Robust Multi-Agent Networks through Self-Organizing Random Regular Graphs
Yasin Yazicioǧlu, A.
2015-11-25
Multi-Agent networks are often modeled as interaction graphs, where the nodes represent the agents and the edges denote some direct interactions. The robustness of a multi-Agent network to perturbations such as failures, noise, or malicious attacks largely depends on the corresponding graph. In many applications, networks are desired to have well-connected interaction graphs with relatively small number of links. One family of such graphs is the random regular graphs. In this paper, we present a decentralized scheme for transforming any connected interaction graph with a possibly non-integer average degree of k into a connected random m-regular graph for some m ϵ [k+k ] 2. Accordingly, the agents improve the robustness of the network while maintaining a similar number of links as the initial configuration by locally adding or removing some edges. © 2015 IEEE.
A Bond Graph Approach for the Modeling and Simulation of a Buck Converter
Directory of Open Access Journals (Sweden)
Rached Zrafi
2018-01-01
Full Text Available This paper deals with the modeling of bond graph buck converter systems. The bond graph formalism, which represents a heterogeneous formalism for physical modeling, is used to design a sub-model of a power MOSFET and PiN diode switchers. These bond graph models are based on the device’s electrical elements. The application of these models to a bond graph buck converter permit us to obtain an invariant causal structure when the switch devices change state. This paper shows the usefulness of the bond graph device’s modeling to simulate an implicit bond graph buck converter.
Probability on graphs random processes on graphs and lattices
Grimmett, Geoffrey
2018-01-01
This introduction to some of the principal models in the theory of disordered systems leads the reader through the basics, to the very edge of contemporary research, with the minimum of technical fuss. Topics covered include random walk, percolation, self-avoiding walk, interacting particle systems, uniform spanning tree, random graphs, as well as the Ising, Potts, and random-cluster models for ferromagnetism, and the Lorentz model for motion in a random medium. This new edition features accounts of major recent progress, including the exact value of the connective constant of the hexagonal lattice, and the critical point of the random-cluster model on the square lattice. The choice of topics is strongly motivated by modern applications, and focuses on areas that merit further research. Accessible to a wide audience of mathematicians and physicists, this book can be used as a graduate course text. Each chapter ends with a range of exercises.
Molecular transformation, gene cloning, and gene expression systems for filamentous fungi
Gold, Scott E.; Duick, John W.; Redman, Regina S.; Rodriguez, Rusty J.
2001-01-01
This chapter discusses the molecular transformation, gene cloning, and gene expression systems for filamentous fungi. Molecular transformation involves the movement of discrete amounts of DNA into cells, the expression of genes on the transported DNA, and the sustainable replication of the transforming DNA. The ability to transform fungi is dependent on the stable replication and expression of genes located on the transforming DNA. Three phenomena observed in bacteria, that is, competence, plasmids, and restriction enzymes to facilitate cloning, were responsible for the development of molecular transformation in fungi. Initial transformation success with filamentous fungi, involving the complementation of auxotrophic mutants by exposure to sheared genomic DNA or RNA from wt isolates, occurred with low transformation efficiencies. In addition, it was difficult to retrieve complementing DNA fragments and isolate genes of interest. This prompted the development of transformation vectors and methods to increase efficiencies. The physiological studies performed with fungi indicated that the cell wall could be removed to generate protoplasts. It was evident that protoplasts could be transformed with significantly greater efficiencies than walled cells.
An introduction to grids, graphs, and networks
Pozrikidis, C
2014-01-01
An Introduction to Grids, Graphs, and Networks aims to provide a concise introduction to graphs and networks at a level that is accessible to scientists, engineers, and students. In a practical approach, the book presents only the necessary theoretical concepts from mathematics and considers a variety of physical and conceptual configurations as prototypes or examples. The subject is timely, as the performance of networks is recognized as an important topic in the study of complex systems with applications in energy, material, and information grid transport (epitomized by the internet). The bo
Applied and computational harmonic analysis on graphs and networks
Irion, Jeff; Saito, Naoki
2015-09-01
In recent years, the advent of new sensor technologies and social network infrastructure has provided huge opportunities and challenges for analyzing data recorded on such networks. In the case of data on regular lattices, computational harmonic analysis tools such as the Fourier and wavelet transforms have well-developed theories and proven track records of success. It is therefore quite important to extend such tools from the classical setting of regular lattices to the more general setting of graphs and networks. In this article, we first review basics of graph Laplacian matrices, whose eigenpairs are often interpreted as the frequencies and the Fourier basis vectors on a given graph. We point out, however, that such an interpretation is misleading unless the underlying graph is either an unweighted path or cycle. We then discuss our recent effort of constructing multiscale basis dictionaries on a graph, including the Hierarchical Graph Laplacian Eigenbasis Dictionary and the Generalized Haar-Walsh Wavelet Packet Dictionary, which are viewed as generalizations of the classical hierarchical block DCTs and the Haar-Walsh wavelet packets, respectively, to the graph setting. Finally, we demonstrate the usefulness of our dictionaries by using them to simultaneously segment and denoise 1-D noisy signals sampled on regular lattices, a problem where classical tools have difficulty.
Graphs cospectral with a friendship graph or its complement
Directory of Open Access Journals (Sweden)
Alireza Abdollahi
2013-12-01
Full Text Available Let $n$ be any positive integer and let $F_n$ be the friendship (or Dutch windmill graph with $2n+1$ vertices and $3n$ edges. Here we study graphs with the same adjacency spectrum as the $F_n$. Two graphs are called cospectral if the eigenvalues multiset of their adjacency matrices are the same. Let $G$ be a graph cospectral with $F_n$. Here we prove that if $G$ has no cycle of length $4$ or $5$, then $Gcong F_n$. Moreover if $G$ is connected and planar then $Gcong F_n$.All but one of connected components of $G$ are isomorphic to $K_2$.The complement $overline{F_n}$ of the friendship graph is determined by its adjacency eigenvalues, that is, if $overline{F_n}$ is cospectral with a graph $H$, then $Hcong overline{F_n}$.
International Nuclear Information System (INIS)
Drozdoff, V.V.
1988-01-01
Several established rodent cell lines, such as C3H/10T1/2 fibroblasts, have been developed to study radiation and chemically-induced malignant transformation. Most experimental evidence has supported the idea that transformation in 10T1/2 cells involved at least two steps but that the apparent frequency of transformation depends on the density of plated cells. A new approach is presented here for studying radiation-induced transformation. An oncogene primed cell system (C3H-myc) was developed by introducing a constitutively active mouse c-myc gene into 10T1/2 cells. A primary goal was to determine if the introduction of an activated oncogene could substitute for one of the required steps in radiation-induced transformation. Results are presented that show that the expression of the exogenous myc gene significantly increased the frequency of radiation-induced transformation in these cells. Subculture experiments performed to analyze the kinetics of transformation in C3H-myc cells and reconstruction experiments allowing the effects of normal cells on radiation-induced transformants to be determined indicated that transformed cells arose very shortly after irradiation. These results support the conclusion that a radiation-induced event can complement the effect of myc in C3H-myc cells and directly result in transformation. This system thus provides an opportunity to isolate early steps in radiation-induced transformation and should facilitate the identification and analysis of these events
Decomposing Oriented Graphs into Six Locally Irregular Oriented Graphs
DEFF Research Database (Denmark)
Bensmail, Julien; Renault, Gabriel
2016-01-01
An undirected graph G is locally irregular if every two of its adjacent vertices have distinct degrees. We say that G is decomposable into k locally irregular graphs if there exists a partition E1∪E2∪⋯∪Ek of the edge set E(G) such that each Ei induces a locally irregular graph. It was recently co...
Effects on social economics from transformations of the bioenergy system
International Nuclear Information System (INIS)
Braennlund, R.; Ankarhem, M.; Sjoestroem, M.; Marklund, P.O.; Lundgren, T.
2002-02-01
The transformation of the energy sector that is taking place in Sweden - substitution of renewable energy sources, in particular biofuels, for fossil fuels - will cause changes in the economy that are analysed in this report. The main issues are: How will the market be affected by a higher competition for wood? How will the fuel mix change in the heating sector? What environmental effects will result from the new energy policy? How will governmentally implemented economic incentives act on the fuel choices in the heating sector? Is the market for wood fuels efficient in the meaning that it reflects the values of the resource as the sellers and the buyers see it?
Xie, Wen-Jie; Han, Rui-Qi; Jiang, Zhi-Qiang; Wei, Lijian; Zhou, Wei-Xing
2017-08-01
Complex network is not only a powerful tool for the analysis of complex system, but also a promising way to analyze time series. The algorithm of horizontal visibility graph (HVG) maps time series into graphs, whose degree distributions are numerically and analytically investigated for certain time series. We derive the degree distributions of HVGs through an iterative construction process of HVGs. The degree distributions of the HVG and the directed HVG for random series are derived to be exponential, which confirms the analytical results from other methods. We also obtained the analytical expressions of degree distributions of HVGs and in-degree and out-degree distributions of directed HVGs transformed from multifractal binomial measures, which agree excellently with numerical simulations.
Arvind, Pratul
2012-11-01
The ability to identify and classify all ten types of faults in a distribution system is an important task for protection engineers. Unlike transmission system, distribution systems have a complex configuration and are subjected to frequent faults. In the present work, an algorithm has been developed for identifying all ten types of faults in a distribution system by collecting current samples at the substation end. The samples are subjected to wavelet packet transform and artificial neural network in order to yield better classification results. A comparison of results between wavelet transform and wavelet packet transform is also presented thereby justifying the feature extracted from wavelet packet transform yields promising results. It should also be noted that current samples are collected after simulating a 25kv distribution system in PSCAD software.
Infinite Random Graphs as Statistical Mechanical Models
DEFF Research Database (Denmark)
Durhuus, Bergfinnur Jøgvan; Napolitano, George Maria
2011-01-01
We discuss two examples of infinite random graphs obtained as limits of finite statistical mechanical systems: a model of two-dimensional dis-cretized quantum gravity defined in terms of causal triangulated surfaces, and the Ising model on generic random trees. For the former model we describe a ...
Butler, William E.; Atai, Nadia; Carter, Bob; Hochberg, Fred
2014-01-01
The Richard Floor Biorepository supports collaborative studies of extracellular vesicles (EVs) found in human fluids and tissue specimens. The current emphasis is on biomarkers for central nervous system neoplasms but its structure may serve as a template for collaborative EV translational studies in other fields. The informatic system provides specimen inventory tracking with bar codes assigned to specimens and containers and projects, is hosted on globalized cloud computing resources, and e...
Climate change induced transformations of agricultural systems: insights from a global model
Leclère, D.; Havlík, P.; Fuss, S.; Schmid, E.; Mosnier, A.; Walsh, B.; Valin, H.; Herrero, M.; Khabarov, N.; Obersteiner, M.
2014-12-01
Climate change might impact crop yields considerably and anticipated transformations of agricultural systems are needed in the coming decades to sustain affordable food provision. However, decision-making on transformational shifts in agricultural systems is plagued by uncertainties concerning the nature and geography of climate change, its impacts, and adequate responses. Locking agricultural systems into inadequate transformations costly to adjust is a significant risk and this acts as an incentive to delay action. It is crucial to gain insight into how much transformation is required from agricultural systems, how robust such strategies are, and how we can defuse the associated challenge for decision-making. While implementing a definition related to large changes in resource use into a global impact assessment modelling framework, we find transformational adaptations to be required of agricultural systems in most regions by 2050s in order to cope with climate change. However, these transformations widely differ across climate change scenarios: uncertainties in large-scale development of irrigation span in all continents from 2030s on, and affect two-thirds of regions by 2050s. Meanwhile, significant but uncertain reduction of major agricultural areas affects the Northern Hemisphere’s temperate latitudes, while increases to non-agricultural zones could be large but uncertain in one-third of regions. To help reducing the associated challenge for decision-making, we propose a methodology exploring which, when, where and why transformations could be required and uncertain, by means of scenario analysis.
Climate change induced transformations of agricultural systems: insights from a global model
International Nuclear Information System (INIS)
Leclère, D; Havlík, P; Mosnier, A; Walsh, B; Valin, H; Khabarov, N; Obersteiner, M; Fuss, S; Schmid, E; Herrero, M
2014-01-01
Climate change might impact crop yields considerably and anticipated transformations of agricultural systems are needed in the coming decades to sustain affordable food provision. However, decision-making on transformational shifts in agricultural systems is plagued by uncertainties concerning the nature and geography of climate change, its impacts, and adequate responses. Locking agricultural systems into inadequate transformations costly to adjust is a significant risk and this acts as an incentive to delay action. It is crucial to gain insight into how much transformation is required from agricultural systems, how robust such strategies are, and how we can defuse the associated challenge for decision-making. While implementing a definition related to large changes in resource use into a global impact assessment modelling framework, we find transformational adaptations to be required of agricultural systems in most regions by 2050s in order to cope with climate change. However, these transformations widely differ across climate change scenarios: uncertainties in large-scale development of irrigation span in all continents from 2030s on, and affect two-thirds of regions by 2050s. Meanwhile, significant but uncertain reduction of major agricultural areas affects the Northern Hemisphere’s temperate latitudes, while increases to non-agricultural zones could be large but uncertain in one-third of regions. To help reducing the associated challenge for decision-making, we propose a methodology exploring which, when, where and why transformations could be required and uncertain, by means of scenario analysis. (letter)
Study on sampling of continuous linear system based on generalized Fourier transform
Li, Huiguang
2003-09-01
In the research of signal and system, the signal's spectrum and the system's frequency characteristic can be discussed through Fourier Transform (FT) and Laplace Transform (LT). However, some singular signals such as impulse function and signum signal don't satisfy Riemann integration and Lebesgue integration. They are called generalized functions in Maths. This paper will introduce a new definition -- Generalized Fourier Transform (GFT) and will discuss generalized function, Fourier Transform and Laplace Transform under a unified frame. When the continuous linear system is sampled, this paper will propose a new method to judge whether the spectrum will overlap after generalized Fourier transform (GFT). Causal and non-causal systems are studied, and sampling method to maintain system's dynamic performance is presented. The results can be used on ordinary sampling and non-Nyquist sampling. The results also have practical meaning on research of "discretization of continuous linear system" and "non-Nyquist sampling of signal and system." Particularly, condition for ensuring controllability and observability of MIMO continuous systems in references 13 and 14 is just an applicable example of this paper.
Directory of Open Access Journals (Sweden)
V.V. Vasilevskij
2016-06-01
Full Text Available Introduction. An important problem in power transformers resource prognosis is the formation of moisture dynamics trends of transformer insulation. Purpose. Increasing the accuracy of power transformer insulation resource assessment based on accounting of moisture dynamics in interrelation with temperature dynamics. Working out of moisture dynamics model in paper insulation-transformer oil system in conjunction with thermodynamic model, load model and technical maintenance model. Methodology. The mathematical models used for describe the moisture dynamics are grounded on nonlinear differential equations. Interrelation moisture dynamics model with thermodynamic, load and technical maintenance models described by UML model. For confirming the adequacy of model used computer simulation. Results. We have implemented the model of moisture dynamics in power transformers insulation in interrelation with other models, which describe the state of power transformer in operation. The proposed model allows us to form detailed trends of moisture dynamics in power transformers insulation basing on monitoring data or power transformers operational factors simulation results. We have performed computer simulation of moisture exchange processes and calculation of transformer insulation resource for different moisture trends. Originality. The offered model takes into account moisture dynamics in power transformers insulation under the influence of changes of the power transformers thermal mode and operational factors. Practical value. The offered model can be used in power transformers monitoring systems for automation of resource assessment of oil-immersed power transformers paper insulation at different phase of lifecycle. Model also can be used for assessment of projected economic efficiency of power transformers exploitation in projected operating conditions.
Endomorphisms of graph algebras
DEFF Research Database (Denmark)
Conti, Roberto; Hong, Jeong Hee; Szymanski, Wojciech
2012-01-01
We initiate a systematic investigation of endomorphisms of graph C*-algebras C*(E), extending several known results on endomorphisms of the Cuntz algebras O_n. Most but not all of this study is focused on endomorphisms which permute the vertex projections and globally preserve the diagonal MASA D...... that the restriction to the diagonal MASA of an automorphism which globally preserves both D_E and the core AF-subalgebra eventually commutes with the corresponding one-sided shift. Secondly, we exhibit several properties of proper endomorphisms, investigate invertibility of localized endomorphisms both on C...
Yap, Hian-Poh
1996-01-01
This book provides an up-to-date and rapid introduction to an important and currently active topic in graph theory. The author leads the reader to the forefront of research in this area. Complete and easily readable proofs of all the main theorems, together with numerous examples, exercises and open problems are given. The book is suitable for use as a textbook or as seminar material for advanced undergraduate and graduate students. The references are comprehensive and so it will also be useful for researchers as a handbook.
Graph Algorithm Animation with Grrr
Rodgers, Peter; Vidal, Natalia
2000-01-01
We discuss geometric positioning, highlighting of visited nodes and user defined highlighting that form the algorithm animation facilities in the Grrr graph rewriting programming language. The main purpose of animation was initially for the debugging and profiling of Grrr code, but recently it has been extended for the purpose of teaching algorithms to undergraduate students. The animation is restricted to graph based algorithms such as graph drawing, list manipulation or more traditional gra...
Eseryel, U. Yeliz; Eseryel, Deniz
While software development teams are becoming more and more distributed around the globe, most software development methodologies used by global teams prescribe self-managing teams. Transformational leadership is the key to successful information systems development and use for competitive
Dorota LESZCZYŃSKA; Laurence SAGLIETTO
2014-01-01
If perception is a concept which is necessarily intuitive in the analysis of transformations in information systems, it is not to be taken into account at its fair value in existing theoretical models. These models are mainly interested in
Building Scalable Knowledge Graphs for Earth Science
Ramachandran, R.; Maskey, M.; Gatlin, P. N.; Zhang, J.; Duan, X.; Bugbee, K.; Christopher, S. A.; Miller, J. J.
2017-12-01
Estimates indicate that the world's information will grow by 800% in the next five years. In any given field, a single researcher or a team of researchers cannot keep up with this rate of knowledge expansion without the help of cognitive systems. Cognitive computing, defined as the use of information technology to augment human cognition, can help tackle large systemic problems. Knowledge graphs, one of the foundational components of cognitive systems, link key entities in a specific domain with other entities via relationships. Researchers could mine these graphs to make probabilistic recommendations and to infer new knowledge. At this point, however, there is a dearth of tools to generate scalable Knowledge graphs using existing corpus of scientific literature for Earth science research. Our project is currently developing an end-to-end automated methodology for incrementally constructing Knowledge graphs for Earth Science. Semantic Entity Recognition (SER) is one of the key steps in this methodology. SER for Earth Science uses external resources (including metadata catalogs and controlled vocabulary) as references to guide entity extraction and recognition (i.e., labeling) from unstructured text, in order to build a large training set to seed the subsequent auto-learning component in our algorithm. Results from several SER experiments will be presented as well as lessons learned.
Butler, William E.; Atai, Nadia; Carter, Bob; Hochberg, Fred
2014-01-01
The Richard Floor Biorepository supports collaborative studies of extracellular vesicles (EVs) found in human fluids and tissue specimens. The current emphasis is on biomarkers for central nervous system neoplasms but its structure may serve as a template for collaborative EV translational studies
Optimization Problems on Threshold Graphs
Directory of Open Access Journals (Sweden)
Elena Nechita
2010-06-01
Full Text Available During the last three decades, different types of decompositions have been processed in the field of graph theory. Among these we mention: decompositions based on the additivity of some characteristics of the graph, decompositions where the adjacency law between the subsets of the partition is known, decompositions where the subgraph induced by every subset of the partition must have predeterminate properties, as well as combinations of such decompositions. In this paper we characterize threshold graphs using the weakly decomposition, determine: density and stability number, Wiener index and Wiener polynomial for threshold graphs.
Eulerian Graphs and Related Topics
Fleischner, Herbert
1990-01-01
The two volumes comprising Part 1 of this work embrace the theme of Eulerian trails and covering walks. They should appeal both to researchers and students, as they contain enough material for an undergraduate or graduate graph theory course which emphasizes Eulerian graphs, and thus can be read by any mathematician not yet familiar with graph theory. But they are also of interest to researchers in graph theory because they contain many recent results, some of which are only partial solutions to more general problems. A number of conjectures have been included as well. Various problems (such a
Bäcklund transformations for the Jacobi system on an ellipsoid
Tsiganov, A. V.
2017-09-01
We consider analogues of auto- and hetero-Bäcklund transformations for the Jacobi system on a threeaxis ellipsoid. Using the results in a Weierstrass paper, where the change of times reduces integrating the equations of motion to inverting the Abel mapping, we construct the differential Abel equations and auto-Bäcklund transformations preserving the Poisson bracket with respect to which the equations of motion written in the Weierstrass form are Hamiltonian. Transforming this bracket to the canonical form, we can construct a new integrable system on the ellipsoid with a Hamiltonian of the natural form and with a fourth-degree integral of motion in momenta.
Shi, Liang; Chen, Dongdong; Xu, Chao; Ren, Ang; Yu, Hanshou; Zhao, Mingwen
2017-07-11
Flammulina velutipes is a well-known edible mushroom cultivated all over the world. However, because of the low transformation frequency, the expensive instruments required, and the complicated, time-consuming procedures necessary, there is insufficient genetic research on F. velutipes. In this study, we report a liposome-mediated transformation (LMT) system for the genetic transformation of F. velutipes. Using the LMT system, we obtained 82 ± 4 stable F. velutipes transformants per 10 5 protoplasts, which is a clear increase in transformation frequency compared to the other methods used. We were able to detect the expression of an EGFP reporter gene in the F. velutipes transformants using fluorescence imaging assays. Furthermore, we used this method to transfer the laccase gene into F. velutipes and found that the transcriptional level and enzymatic activity increased in these transformants. Mitotic stability analysis showed that all of the selected transformants remained mitotically stable, even after five successive rounds of sub-culturing. These results demonstrate a new transgenic approach that will facilitate F. velutipes research.
International Nuclear Information System (INIS)
Brandt, F.
1993-01-01
It is shown that Baecklund transformations (BTs) and zero-curvature representations (ZCRs) of systems of partial differential equations (PDEs) are closely related. The connection is established by nonlinear representations of the symmetry group underlying the ZCR which induce gauge transformations relating different BTs. This connection is used to construct BTs from ZCRs (and vice versa). Furthermore a procedure is outlined which allows a systematic search for ZCRs of a given system of PDEs. (orig.)
A signal-flow-graph approach to on-line gradient calculation.
Campolucci, P; Uncini, A; Piazza, F
2000-08-01
A large class of nonlinear dynamic adaptive systems such as dynamic recurrent neural networks can be effectively represented by signal flow graphs (SFGs). By this method, complex systems are described as a general connection of many simple components, each of them implementing a simple one-input, one-output transformation, as in an electrical circuit. Even if graph representations are popular in the neural network community, they are often used for qualitative description rather than for rigorous representation and computational purposes. In this article, a method for both on-line and batch-backward gradient computation of a system output or cost function with respect to system parameters is derived by the SFG representation theory and its known properties. The system can be any causal, in general nonlinear and time-variant, dynamic system represented by an SFG, in particular any feedforward, time-delay, or recurrent neural network. In this work, we use discrete-time notation, but the same theory holds for the continuous-time case. The gradient is obtained in a straightforward way by the analysis of two SFGs, the original one and its adjoint (obtained from the first by simple transformations), without the complex chain rule expansions of derivatives usually employed. This method can be used for sensitivity analysis and for learning both off-line and on-line. On-line learning is particularly important since it is required by many real applications, such as digital signal processing, system identification and control, channel equalization, and predistortion.
Energy Technology Data Exchange (ETDEWEB)
Maunz, Peter Lukas Wilhelm [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Sterk, Jonathan David [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Lobser, Daniel [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Parekh, Ojas D. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Ryan-Anderson, Ciaran [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
2016-01-01
In recent years, advanced network analytics have become increasingly important to na- tional security with applications ranging from cyber security to detection and disruption of ter- rorist networks. While classical computing solutions have received considerable investment, the development of quantum algorithms to address problems, such as data mining of attributed relational graphs, is a largely unexplored space. Recent theoretical work has shown that quan- tum algorithms for graph analysis can be more efficient than their classical counterparts. Here, we have implemented a trapped-ion-based two-qubit quantum information proces- sor to address these goals. Building on Sandia's microfabricated silicon surface ion traps, we have designed, realized and characterized a quantum information processor using the hyperfine qubits encoded in two 171 Yb + ions. We have implemented single qubit gates using resonant microwave radiation and have employed Gate set tomography (GST) to characterize the quan- tum process. For the first time, we were able to prove that the quantum process surpasses the fault tolerance thresholds of some quantum codes by demonstrating a diamond norm distance of less than 1 . 9 x 10 [?] 4 . We used Raman transitions in order to manipulate the trapped ions' motion and realize two-qubit gates. We characterized the implemented motion sensitive and insensitive single qubit processes and achieved a maximal process infidelity of 6 . 5 x 10 [?] 5 . We implemented the two-qubit gate proposed by Molmer and Sorensen and achieved a fidelity of more than 97 . 7%.
Asymptote Misconception on Graphing Functions: Does Graphing Software Resolve It?
Directory of Open Access Journals (Sweden)
Mehmet Fatih Öçal
2017-01-01
Full Text Available Graphing function is an important issue in mathematics education due to its use in various areas of mathematics and its potential roles for students to enhance learning mathematics. The use of some graphing software assists students’ learning during graphing functions. However, the display of graphs of functions that students sketched by hand may be relatively different when compared to the correct forms sketched using graphing software. The possible misleading effects of this situation brought a discussion of a misconception (asymptote misconception on graphing functions. The purpose of this study is two- fold. First of all, this study investigated whether using graphing software (GeoGebra in this case helps students to determine and resolve this misconception in calculus classrooms. Second, the reasons for this misconception are sought. The multiple case study was utilized in this study. University students in two calculus classrooms who received instructions with (35 students or without GeoGebra assisted instructions (32 students were compared according to whether they fell into this misconception on graphing basic functions (1/x, lnx, ex. In addition, students were interviewed to reveal the reasons behind this misconception. Data were analyzed by means of descriptive and content analysis methods. The findings indicated that those who received GeoGebra assisted instruction were better in resolving it. In addition, the reasons behind this misconception were found to be teacher-based, exam-based and some other factors.
On the classification of plane graphs representing structurally stable rational Newton flows
Jongen, H.Th.; Jonker, P.; Twilt, F.
1991-01-01
We study certain plane graphs, called Newton graphs, representing a special class of dynamical systems which are closely related to Newton's iteration method for finding zeros of (rational) functions defined on the complex plane. These Newton graphs are defined in terms of nonvanishing angles
ON BIPOLAR SINGLE VALUED NEUTROSOPHIC GRAPHS
Said Broumi; Mohamed Talea; Assia Bakali; Florentin Smarandache
2016-01-01
In this article, we combine the concept of bipolar neutrosophic set and graph theory. We introduce the notions of bipolar single valued neutrosophic graphs, strong bipolar single valued neutrosophic graphs, complete bipolar single valued neutrosophic graphs, regular bipolar single valued neutrosophic graphs and investigate some of their related properties.
Gong, Lihua; Deng, Chengzhi; Pan, Shumin; Zhou, Nanrun
2018-07-01
Based on hyper-chaotic system and discrete fractional random transform, an image compression-encryption algorithm is designed. The original image is first transformed into a spectrum by the discrete cosine transform and the resulting spectrum is compressed according to the method of spectrum cutting. The random matrix of the discrete fractional random transform is controlled by a chaotic sequence originated from the high dimensional hyper-chaotic system. Then the compressed spectrum is encrypted by the discrete fractional random transform. The order of DFrRT and the parameters of the hyper-chaotic system are the main keys of this image compression and encryption algorithm. The proposed algorithm can compress and encrypt image signal, especially can encrypt multiple images once. To achieve the compression of multiple images, the images are transformed into spectra by the discrete cosine transform, and then the spectra are incised and spliced into a composite spectrum by Zigzag scanning. Simulation results demonstrate that the proposed image compression and encryption algorithm is of high security and good compression performance.
The impact of photovoltaic systems on distribution transformer: A case study
International Nuclear Information System (INIS)
Jimenez, Humberto; Calleja, Hugo; Gonzalez, Raul; Huacuz, Jorge; Lagunas, Javier
2006-01-01
In this paper, the results obtained after monitoring a distribution transformer during an 18 months period are described and discussed. The transformer fed several households, each with a grid connected photovoltaic system, and it was found that the power factor at the transformer attained unusually low levels. This was due to the fact that under some conditions, the systems provided a large portion of the active power demanded by the households, while the grid supplied all the reactive and distortion powers. The operating temperature was used as an indicator of the stress on the transformer. The temperature was at its lowest when the systems were providing the maximum energy available from the solar cells
Graph Theory. 2. Vertex Descriptors and Graph Coloring
Directory of Open Access Journals (Sweden)
Lorentz JÄNTSCHI
2002-12-01
Full Text Available This original work presents the construction of a set of ten sequence matrices and their applications for ordering vertices in graphs. For every sequence matrix three ordering criteria are applied: lexicographic ordering, based on strings of numbers, corresponding to every vertex, extracted as rows from sequence matrices; ordering by the sum of path lengths from a given vertex; and ordering by the sum of paths, starting from a given vertex. We also examine a graph that has different orderings for the above criteria. We then proceed to demonstrate that every criterion induced its own partition of graph vertex. We propose the following theoretical result: both LAVS and LVDS criteria generate identical partitioning of vertices in any graph. Finally, a coloring of graph vertices according to introduced ordering criteria was proposed.
A Graph Summarization Algorithm Based on RFID Logistics
Sun, Yan; Hu, Kongfa; Lu, Zhipeng; Zhao, Li; Chen, Ling
Radio Frequency Identification (RFID) applications are set to play an essential role in object tracking and supply chain management systems. The volume of data generated by a typical RFID application will be enormous as each item will generate a complete history of all the individual locations that it occupied at every point in time. The movement trails of such RFID data form gigantic commodity flowgraph representing the locations and durations of the path stages traversed by each item. In this paper, we use graph to construct a warehouse of RFID commodity flows, and introduce a database-style operation to summarize graphs, which produces a summary graph by grouping nodes based on user-selected node attributes, further allows users to control the hierarchy of summaries. It can cut down the size of graphs, and provide convenience for users to study just on the shrunk graph which they interested. Through extensive experiments, we demonstrate the effectiveness and efficiency of the proposed method.
Isotropic covariance functions on graphs and their edges
DEFF Research Database (Denmark)
Anderes, E.; Møller, Jesper; Rasmussen, Jakob Gulddahl
We develop parametric classes of covariance functions on linear networks and their extension to graphs with Euclidean edges, i.e., graphs with edges viewed as line segments or more general sets with a coordinate system allowing us to consider points on the graph which are vertices or points...... on an edge. Our covariance functions are defined on the vertices and edge points of these graphs and are isotropic in the sense that they depend only on the geodesic distance or on a new metric called the resistance metric (which extends the classical resistance metric developed in electrical network theory...... functions in the spatial statistics literature (the power exponential, Matérn, generalized Cauchy, and Dagum classes) are shown to be valid with respect to the resistance metric for any graph with Euclidean edges, whilst they are only valid with respect to the geodesic metric in more special cases....
Application of Bipolar Fuzzy Sets in Graph Structures
Directory of Open Access Journals (Sweden)
Muhammad Akram
2016-01-01
Full Text Available A graph structure is a useful tool in solving the combinatorial problems in different areas of computer science and computational intelligence systems. In this paper, we apply the concept of bipolar fuzzy sets to graph structures. We introduce certain notions, including bipolar fuzzy graph structure (BFGS, strong bipolar fuzzy graph structure, bipolar fuzzy Ni-cycle, bipolar fuzzy Ni-tree, bipolar fuzzy Ni-cut vertex, and bipolar fuzzy Ni-bridge, and illustrate these notions by several examples. We study ϕ-complement, self-complement, strong self-complement, and totally strong self-complement in bipolar fuzzy graph structures, and we investigate some of their interesting properties.
Two-colorable graph states with maximal Schmidt measure
International Nuclear Information System (INIS)
Severini, Simone
2006-01-01
The Schmidt measure was introduced by Eisert and Briegel for quantifying the degree of entanglement of multipartite quantum systems [J. Eisert, H.-J. Briegel, Phys. Rev. A 64 (2001) 22306]. For two-colorable graph states, the Schmidt measure is related to the spectrum of the associated graph. We observe that almost all two-colorable graph states have maximal Schmidt measure and we construct specific examples. By making appeal to a result of Ehrenfeucht et al. [A. Ehrenfeucht, T. Harju, G. Rozenberg, Discrete Math. 278 (2004) 45], we point out that the graph operations called local complementation and switching form a transitive group acting on the set of all graph states of a given dimension