Hierarchy of modular graph identities
International Nuclear Information System (INIS)
D’Hoker, Eric; Kaidi, Justin
2016-01-01
The low energy expansion of Type II superstring amplitudes at genus one is organized in terms of modular graph functions associated with Feynman graphs of a conformal scalar field on the torus. In earlier work, surprising identities between two-loop graphs at all weights, and between higher-loop graphs of weights four and five were constructed. In the present paper, these results are generalized in two complementary directions. First, all identities at weight six and all dihedral identities at weight seven are obtained and proven. Whenever the Laurent polynomial at the cusp is available, the form of these identities confirms the pattern by which the vanishing of the Laurent polynomial governs the full modular identity. Second, the family of modular graph functions is extended to include all graphs with derivative couplings and worldsheet fermions. These extended families of modular graph functions are shown to obey a hierarchy of inhomogeneous Laplace eigenvalue equations. The eigenvalues are calculated analytically for the simplest infinite sub-families and obtained by Maple for successively more complicated sub-families. The spectrum is shown to consist solely of eigenvalues s(s−1) for positive integers s bounded by the weight, with multiplicities which exhibit rich representation-theoretic patterns.
Hierarchy of modular graph identities
Energy Technology Data Exchange (ETDEWEB)
D’Hoker, Eric; Kaidi, Justin [Mani L. Bhaumik Institute for Theoretical Physics, Department of Physics and Astronomy,University of California,Los Angeles, CA 90095 (United States)
2016-11-09
The low energy expansion of Type II superstring amplitudes at genus one is organized in terms of modular graph functions associated with Feynman graphs of a conformal scalar field on the torus. In earlier work, surprising identities between two-loop graphs at all weights, and between higher-loop graphs of weights four and five were constructed. In the present paper, these results are generalized in two complementary directions. First, all identities at weight six and all dihedral identities at weight seven are obtained and proven. Whenever the Laurent polynomial at the cusp is available, the form of these identities confirms the pattern by which the vanishing of the Laurent polynomial governs the full modular identity. Second, the family of modular graph functions is extended to include all graphs with derivative couplings and worldsheet fermions. These extended families of modular graph functions are shown to obey a hierarchy of inhomogeneous Laplace eigenvalue equations. The eigenvalues are calculated analytically for the simplest infinite sub-families and obtained by Maple for successively more complicated sub-families. The spectrum is shown to consist solely of eigenvalues s(s−1) for positive integers s bounded by the weight, with multiplicities which exhibit rich representation-theoretic patterns.
Proving relations between modular graph functions
International Nuclear Information System (INIS)
Basu, Anirban
2016-01-01
We consider modular graph functions that arise in the low energy expansion of the four graviton amplitude in type II string theory. The vertices of these graphs are the positions of insertions of vertex operators on the toroidal worldsheet, while the links are the scalar Green functions connecting the vertices. Graphs with four and five links satisfy several non-trivial relations, which have been proved recently. We prove these relations by using elementary properties of Green functions and the details of the graphs. We also prove a relation between modular graph functions with six links. (paper)
From modular invariants to graphs: the modular splitting method
International Nuclear Information System (INIS)
Isasi, E; Schieber, G
2007-01-01
We start with a given modular invariant M of a two-dimensional su-hat(n) k conformal field theory (CFT) and present a general method for solving the Ocneanu modular splitting equation and then determine, in a step-by-step explicit construction (1) the generalized partition functions corresponding to the introduction of boundary conditions and defect lines; (2) the quantum symmetries of the higher ADE graph G associated with the initial modular invariant M. Note that one does not suppose here that the graph G is already known, since it appears as a by-product of the calculations. We analyse several su-hat(3) k exceptional cases at levels 5 and 9
Aligning Biomolecular Networks Using Modular Graph Kernels
Towfic, Fadi; Greenlee, M. Heather West; Honavar, Vasant
Comparative analysis of biomolecular networks constructed using measurements from different conditions, tissues, and organisms offer a powerful approach to understanding the structure, function, dynamics, and evolution of complex biological systems. We explore a class of algorithms for aligning large biomolecular networks by breaking down such networks into subgraphs and computing the alignment of the networks based on the alignment of their subgraphs. The resulting subnetworks are compared using graph kernels as scoring functions. We provide implementations of the resulting algorithms as part of BiNA, an open source biomolecular network alignment toolkit. Our experiments using Drosophila melanogaster, Saccharomyces cerevisiae, Mus musculus and Homo sapiens protein-protein interaction networks extracted from the DIP repository of protein-protein interaction data demonstrate that the performance of the proposed algorithms (as measured by % GO term enrichment of subnetworks identified by the alignment) is competitive with some of the state-of-the-art algorithms for pair-wise alignment of large protein-protein interaction networks. Our results also show that the inter-species similarity scores computed based on graph kernels can be used to cluster the species into a species tree that is consistent with the known phylogenetic relationships among the species.
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
Modular Environment for Graph Research and Analysis with a Persistent
Energy Technology Data Exchange (ETDEWEB)
2009-11-18
The MEGRAPHS software package provides a front-end to graphs and vectors residing on special-purpose computing resources. It allows these data objects to be instantiated, destroyed, and manipulated. A variety of primitives needed for typical graph analyses are provided. An example program illustrating how MEGRAPHS can be used to implement a PageRank computation is included in the distribution.The MEGRAPHS software package is targeted towards developers of graph algorithms. Programmers using MEGRAPHS would write graph analysis programs in terms of high-level graph and vector operations. These computations are transparently executed on the Cray XMT compute nodes.
Label-based routing for a family of scale-free, modular, planar and unclustered graphs
International Nuclear Information System (INIS)
Comellas, Francesc; Miralles, Alicia
2011-01-01
We give an optimal labeling and routing algorithm for a family of scale-free, modular and planar graphs with zero clustering. The relevant properties of this family match those of some networks associated with technological and biological systems with a low clustering, including some electronic circuits and protein networks. The existence of an efficient routing protocol for this graph model should help when designing communication algorithms in real networks and also in the understanding of their dynamic processes.
Directory of Open Access Journals (Sweden)
Cécile Bordier
2017-08-01
Full Text Available Neuroimaging data can be represented as networks of nodes and edges that capture the topological organization of the brain connectivity. Graph theory provides a general and powerful framework to study these networks and their structure at various scales. By way of example, community detection methods have been widely applied to investigate the modular structure of many natural networks, including brain functional connectivity networks. Sparsification procedures are often applied to remove the weakest edges, which are the most affected by experimental noise, and to reduce the density of the graph, thus making it theoretically and computationally more tractable. However, weak links may also contain significant structural information, and procedures to identify the optimal tradeoff are the subject of active research. Here, we explore the use of percolation analysis, a method grounded in statistical physics, to identify the optimal sparsification threshold for community detection in brain connectivity networks. By using synthetic networks endowed with a ground-truth modular structure and realistic topological features typical of human brain functional connectivity networks, we show that percolation analysis can be applied to identify the optimal sparsification threshold that maximizes information on the networks' community structure. We validate this approach using three different community detection methods widely applied to the analysis of brain connectivity networks: Newman's modularity, InfoMap and Asymptotical Surprise. Importantly, we test the effects of noise and data variability, which are critical factors to determine the optimal threshold. This data-driven method should prove particularly useful in the analysis of the community structure of brain networks in populations characterized by different connectivity strengths, such as patients and controls.
Princeton Plasma Physics Laboratory:
Energy Technology Data Exchange (ETDEWEB)
Phillips, C.A. (ed.)
1986-01-01
This paper discusses progress on experiments at the Princeton Plasma Physics Laboratory. The projects and areas discussed are: Principal Parameters Achieved in Experimental Devices, Tokamak Fusion Test Reactor, Princeton Large Torus, Princeton Beta Experiment, S-1 Spheromak, Current-Drive Experiment, X-ray Laser Studies, Theoretical Division, Tokamak Modeling, Spacecraft Glow Experiment, Compact Ignition Tokamak, Engineering Department, Project Planning and Safety Office, Quality Assurance and Reliability, and Administrative Operations.
Princeton Plasma Physics Laboratory:
International Nuclear Information System (INIS)
Phillips, C.A.
1986-01-01
This paper discusses progress on experiments at the Princeton Plasma Physics Laboratory. The projects and areas discussed are: Principal Parameters Achieved in Experimental Devices, Tokamak Fusion Test Reactor, Princeton Large Torus, Princeton Beta Experiment, S-1 Spheromak, Current-Drive Experiment, X-ray Laser Studies, Theoretical Division, Tokamak Modeling, Spacecraft Glow Experiment, Compact Ignition Tokamak, Engineering Department, Project Planning and Safety Office, Quality Assurance and Reliability, and Administrative Operations
Princeton Plasma Physics Laboratory
Energy Technology Data Exchange (ETDEWEB)
1990-01-01
This report discusses the following topics: principal parameters achieved in experimental devices fiscal year 1990; tokamak fusion test reactor; compact ignition tokamak; Princeton beta experiment- modification; current drive experiment-upgrade; international collaboration; x-ray laser studies; spacecraft glow experiment; plasma processing: deposition and etching of thin films; theoretical studies; tokamak modeling; international thermonuclear experimental reactor; engineering department; project planning and safety office; quality assurance and reliability; technology transfer; administrative operations; PPPL patent invention disclosures for fiscal year 1990; graduate education; plasma physics; graduate education: plasma science and technology; science education program; and Princeton Plasma Physics Laboratory reports fiscal year 1990.
Princeton Plasma Physics Laboratory
International Nuclear Information System (INIS)
1990-01-01
This report discusses the following topics: principal parameters achieved in experimental devices fiscal year 1990; tokamak fusion test reactor; compact ignition tokamak; Princeton beta experiment- modification; current drive experiment-upgrade; international collaboration; x-ray laser studies; spacecraft glow experiment; plasma processing: deposition and etching of thin films; theoretical studies; tokamak modeling; international thermonuclear experimental reactor; engineering department; project planning and safety office; quality assurance and reliability; technology transfer; administrative operations; PPPL patent invention disclosures for fiscal year 1990; graduate education; plasma physics; graduate education: plasma science and technology; science education program; and Princeton Plasma Physics Laboratory reports fiscal year 1990
Smith, Keith; Ricaud, Benjamin; Shahid, Nauman; Rhodes, Stephen; Starr, John M.; Ibáñez, Augustin; Parra, Mario A.; Escudero, Javier; Vandergheynst, Pierre
2017-02-01
Visual short-term memory binding tasks are a promising early marker for Alzheimer’s disease (AD). To uncover functional deficits of AD in these tasks it is meaningful to first study unimpaired brain function. Electroencephalogram recordings were obtained from encoding and maintenance periods of tasks performed by healthy young volunteers. We probe the task’s transient physiological underpinnings by contrasting shape only (Shape) and shape-colour binding (Bind) conditions, displayed in the left and right sides of the screen, separately. Particularly, we introduce and implement a novel technique named Modular Dirichlet Energy (MDE) which allows robust and flexible analysis of the functional network with unprecedented temporal precision. We find that connectivity in the Bind condition is less integrated with the global network than in the Shape condition in occipital and frontal modules during the encoding period of the right screen condition. Using MDE we are able to discern driving effects in the occipital module between 100-140 ms, coinciding with the P100 visually evoked potential, followed by a driving effect in the frontal module between 140-180 ms, suggesting that the differences found constitute an information processing difference between these modules. This provides temporally precise information over a heterogeneous population in promising tasks for the detection of AD.
Bliss, Gilbert Ames
1913-01-01
Following the early tradition of the American Mathematical Society, the sixth colloquium of the Society was held as part of the summer meeting that took place at Princeton University. Two sets of lectures were presented: Fundamental Existence Theorems, by G. A. Bliss, and Geometric Aspects of Dynamics, by Edward Kasner. The goal of Bliss's Colloquium Lectures is an overview of contemporary existence theorems for solutions to ordinary or partial differential equations. The first part of the book, however, covers algebraic and analytic aspects of implicit functions. These become the primary too
Princeton Cyclotron QDDD spectrograph system
International Nuclear Information System (INIS)
Kouzes, R.T.
1985-01-01
A review of experiments involving the Princeton Quadrupole-Dipole-Dipole- Dipole (QDDD) spectrograph is given. The QDDD is a high resolution, large solid angle device which is combined with the azymuthally varying field (AVF) cyclotron. Some reactions involving 3 He beams are discussed
Senior Thesis Research at Princeton.
Prud'homme, Robert K.
1981-01-01
Reviews a senior undergraduate research program in chemical engineering at Princeton University. Includes strengths and requirements for a successful program. Senior thesis research provides creative problem solving experiences for students and is congruent with departmental research objectives. Selected student comments are included. (SK)
Princeton University Plasma Physics Laboratory, Princeton, New Jersey
International Nuclear Information System (INIS)
1991-01-01
This report discusses the following topics: Principal parameters of experimental devices; Tokamak Fusion Test Reactor; Burning Plasma Experiment; Princeton Beta Experiment-Modification; Current Drive Experiment-Upgrade; International Thermonuclear Experimental Reactor; International Collaboration; X-Ray Laser Studies; Hyperthermal Atomic Beam Source; Pure Electron Plasma Experiments; Plasma Processing: Deposition and Etching of Thin Films; Theoretical Studies; Tokamak Modeling; Engineering Department; Environment, Safety, and Health and Quality Assurance; Technology Transfer; Office of Human Resources and Administration; PPPL Patent Invention Disclosures; Office of Resource Management; Graduate Education: Plasma Physics; Graduate Education: Program in Plasma Science and Technology; and Science Education Program
PITR: Princeton Ignition Test Reactor
International Nuclear Information System (INIS)
1978-12-01
The principal objectives of the PITR - Princeton Ignition Test Reactor - are to demonstrate the attainment of thermonuclear ignition in deuterium-tritium, and to develop optimal start-up techniques for plasma heating and current induction, in order to determine the most favorable means of reducing the size and cost of tokamak power reactors. This report describes the status of the plasma and engineering design features of the PITR. The PITR geometry is chosen to provide the highest MHD-stable values of beta in a D-shaped plasma, as well as ease of access for remote handling and neutral-beam injection
[The mission of Princeton Plasma Physics Laboratory
International Nuclear Information System (INIS)
1993-01-01
This report discusses the following about Princeton Plasma Physics Laboratory: its mission; requirements and guidance documents for the QA program; architecture; assessment organization; and specific management issues
Degree-based graph construction
International Nuclear Information System (INIS)
Kim, Hyunju; Toroczkai, Zoltan; Erdos, Peter L; Miklos, Istvan; Szekely, Laszlo A
2009-01-01
Degree-based graph construction is a ubiquitous problem in network modelling (Newman et al 2006 The Structure and Dynamics of Networks (Princeton Studies in Complexity) (Princeton, NJ: Princeton University Press), Boccaletti et al 2006 Phys. Rep. 424 175), ranging from social sciences to chemical compounds and biochemical reaction networks in the cell. This problem includes existence, enumeration, exhaustive construction and sampling questions with aspects that are still open today. Here we give necessary and sufficient conditions for a sequence of nonnegative integers to be realized as a simple graph's degree sequence, such that a given (but otherwise arbitrary) set of connections from an arbitrarily given node is avoided. We then use this result to present a swap-free algorithm that builds all simple graphs realizing a given degree sequence. In a wider context, we show that our result provides a greedy construction method to build all the f-factor subgraphs (Tutte 1952 Can. J. Math. 4 314) embedded within K n setmn S k , where K n is the complete graph and S k is a star graph centred on one of the nodes. (fast track communication)
Princeton University High Energy Physics Research
Energy Technology Data Exchange (ETDEWEB)
Marlow, Daniel R. [Princeton Univ., NJ (United States)
2015-06-30
This is the Final Report on research conducted by the Princeton Elementary Particles group over the approximately three-year period from May 1, 2012 to April 30, 2015. The goal of our research is to investigate the fundamental constituents of matter, their fields, and their interactions; to understand the properties of space and time; and to study the profound relationships between cosmology and particle physics. During the funding period covered by this report, the group has been organized into a subgroup concentrating on the theory of particles, strings, and cosmology; and four subgroups performing major experiments at laboratories around the world: CERN, Daya Bay, Gran Sasso as well as detector R\\&D on the Princeton campus. Highlights in of this research include the discovery of the Higgs Boson at CERN and the measurement of $\\sin^22\\theta_{13}$ by the Daya Bay experiment. In both cases, Princeton researchers supported by this grant played key roles.
Paris-Princeton Lectures on Mathematical Finance
Carmona, René A; Kohatsu-Higa, Arturo; Lasry, Jean-Michel; Lions, Pierre-Louis; Pham, Huyên; Taflin, Erik
2007-01-01
The Paris-Princeton Lectures in Financial Mathematics, of which this is the third volume, will, on an annual basis, publish cutting-edge research in self-contained, expository articles from outstanding - established or upcoming! - specialists. The aim is to produce a series of articles that can serve as an introductory reference for research in the field. It arises as a result of frequent exchanges between the finance and financial mathematics groups in Paris and Princeton. The present volume sets standards with articles by René Carmona, Ivar Ekeland/Erik Taflin, Arturo Kohatsu-Higa, Pierre-Louis Lions/Jean-Michel Lasry, and Hyuên Pham.
Defining Modules, Modularity and Modularization
DEFF Research Database (Denmark)
Miller, Thomas Dedenroth; Pedersen, Per Erik Elgård
The paper describes the evolution of the concept of modularity in a historical perspective. The main reasons for modularity are: create variety, utilize similarities, and reduce complexity. The paper defines the terms: Module, modularity, and modularization.......The paper describes the evolution of the concept of modularity in a historical perspective. The main reasons for modularity are: create variety, utilize similarities, and reduce complexity. The paper defines the terms: Module, modularity, and modularization....
Princeton University Materials Academy for underrepresented students
Steinberg, Daniel; Rodriguez Martinez, Sara; Cody, Linda
Summer 2016 gave underrepresented high school students from Trenton New Jersey the opportunity to learn materials science, sustainability and the physics and chemistry of energy storage from Princeton University professors. New efforts to place this curriculum online so that teachers across the United States can teach materials science as a tool to teach ``real'' interdisciplinary science and meet the new Next Generation Science Standards (NGSS). The Princeton University Materials Academy (PUMA) is an education outreach program for underrepresented high school students. It is part of the Princeton Center for Complex Materials (PCCM), a National Science Foundation (NSF) funded Materials Research Engineering and Science Center (MRSEC). PUMA has been serving the community of Trenton New Jersey which is only eight miles from the Princeton University campus. We reached over 250 students from 2003-2016 with many students repeating for multiple years. 100% of our PUMA students have graduated high school and 98% have gone on for college. This is compared with overall Trenton district graduation rate of 48% and a free and reduced lunch of 83%. We discuss initiatives to share the curriculum online to enhance the reach of PCCM' PUMA and to help teachers use materials science to meet NGSS and give their students opportunities to learn interdisciplinary science. MRSEC, NSF (DMR-1420541).
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
Paris-Princeton Lectures on Mathematical Finance
Çinlar, Erhan; Ekeland, Ivar; Jouini, Elyes; Scheinkman, José; Touzi, Nizar
2004-01-01
The Paris-Princeton Lectures in Financial Mathematics, of which this is the second volume, will, on an annual basis, publish cutting-edge research in self-contained, expository articles from outstanding - established or upcoming! - specialists. The aim is to produce a series of articles that can serve as an introductory reference for research in the field. It arises as a result of frequent exchanges between the finance and financial mathematics groups in Paris and Princeton. This volume presents the following articles: "Hedging of Defaultable Claims" by T. Bielecki, M. Jeanblanc, and M. Rutkowski; "On the Geometry of Interest Rate Models" by T. Björk; "Heterogeneous Beliefs, Speculation and Trading in Financial Markets" by J.A. Scheinkman, and W. Xiong.
Exterior LED Lighting Projects at Princeton University
Energy Technology Data Exchange (ETDEWEB)
Davis, Robert G. [Pacific Northwest National Lab. (PNNL), Richland, WA (United States); Evans, William [Princeton Univ., NJ (United States); Murphy, Arthur T. [Princeton Univ., NJ (United States); Perrin, Tess E. [Pacific Northwest National Lab. (PNNL), Richland, WA (United States)
2015-10-01
For this report, PNNL / the U.S. Department of Energy (DOE) studied a series of past exterior lighting projects at Princeton, in order to document Princeton’s experiences with solid-state lighting (SSL) and the lessons learned along the way, and to show how their approach to SSL projects evolved as their own learning expanded and as the products available improved in performance and sophistication.
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.
Progress on the occulter experiment at Princeton
Cady, Eric; Balasubramanian, Kunjithapatham; Carr, Michael; Dickie, Matthew; Echternach, Pierre; Groff, Tyler; Kasdin, Jeremy; Laftchiev, Christian; McElwain, Michael; Sirbu, Dan; Vanderbei, Robert; White, Victor
2009-08-01
An occulter is used in conjunction with a separate telescope to suppress the light of a distant star. To demonstrate the performance of this system, we are building an occulter experiment in the laboratory at Princeton. This experiment will use an etched silicon mask as the occulter, with some modifications to try to improve the performance. The occulter is illuminated by a diverging laser beam to reduce the aberrations from the optics before the occulter. We present the progress of this experiment and expectations for future work.
Graph coarsening and clustering on the GPU
Fagginger Auer, B.O.; Bisseling, R.H.
2013-01-01
Agglomerative clustering is an effective greedy way to quickly generate graph clusterings of high modularity in a small amount of time. In an effort to use the power offered by multi-core CPU and GPU hardware to solve the clustering problem, we introduce a fine-grained sharedmemory parallel graph
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.
Directory of Open Access Journals (Sweden)
Leo White
2015-12-01
Full Text Available We present modular implicits, an extension to the OCaml language for ad-hoc polymorphism inspired by Scala implicits and modular type classes. Modular implicits are based on type-directed implicit module parameters, and elaborate straightforwardly into OCaml's first-class functors. Basing the design on OCaml's modules leads to a system that naturally supports many features from other languages with systematic ad-hoc overloading, including inheritance, instance constraints, constructor classes and associated types.
Energy Technology Data Exchange (ETDEWEB)
1991-12-31
This report discusses the following topics: Principal parameters of experimental devices; Tokamak Fusion Test Reactor; Burning Plasma Experiment; Princeton Beta Experiment-Modification; Current Drive Experiment-Upgrade; International Thermonuclear Experimental Reactor; International Collaboration; X-Ray Laser Studies; Hyperthermal Atomic Beam Source; Pure Electron Plasma Experiments; Plasma Processing: Deposition and Etching of Thin Films; Theoretical Studies; Tokamak Modeling; Engineering Department; Environment, Safety, and Health and Quality Assurance; Technology Transfer; Office of Human Resources and Administration; PPPL Patent Invention Disclosures; Office of Resource Management; Graduate Education: Plasma Physics; Graduate Education: Program in Plasma Science and Technology; and Science Education Program.
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...
DEFF Research Database (Denmark)
Avlonitis, Viktor; Hsuan, Juliana
2015-01-01
The purpose of this research is to investigate the studies on service modularity with a goal of informing service science and advancing contemporary service systems research. Modularity, a general systems property, can add theoretical underpinnings to the conceptual development of service science...... in general and service systems in particular. Our research is guided by the following question: how can modularity theory inform service system design? We present a review of the modularity literature and associated concepts. We then introduce the contemporary service science and service system discourse...
Edixhoven, B.; van der Geer, G.; Moonen, B.; Edixhoven, B.; van der Geer, G.; Moonen, B.
2008-01-01
Modular forms are functions with an enormous amount of symmetry that play a central role in number theory, connecting it with analysis and geometry. They have played a prominent role in mathematics since the 19th century and their study continues to flourish today. Modular forms formed the
(Automated) software modularization using community detection
DEFF Research Database (Denmark)
Hansen, Klaus Marius; Manikas, Konstantinos
2015-01-01
The modularity of a software system is known to have an effect on, among other, development effort, change impact, and technical debt. Modularizing a specific system and evaluating this modularization is, however, challenging. In this paper, we apply community detection methods to the graph...... of class dependencies in software systems to find optimal modularizations through communities. We evaluate this approach through a study of 111 Java systems contained in the Qualitas Corpus. We found that using the modularity function of Newman with an Erdős-Rényi null-model and using the community...... detection algorithm of Reichardt and Bornholdt improved community quality for all systems, that coupling decreased for 99 of the systems, and that coherence increased for 102 of the systems. Furthermore, the modularity function correlates with existing metrics for coupling and coherence....
Gualdi, Giulia; Giampaolo, Salvatore M; Illuminati, Fabrizio
2011-02-04
We introduce and discuss the concept of modular entanglement. This is the entanglement that is established between the end points of modular systems composed by sets of interacting moduli of arbitrarily fixed size. We show that end-to-end modular entanglement scales in the thermodynamic limit and rapidly saturates with the number of constituent moduli. We clarify the mechanisms underlying the onset of entanglement between distant and noninteracting quantum systems and its optimization for applications to quantum repeaters and entanglement distribution and sharing.
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...
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
Paris-Princeton lectures on mathematical finance 2002
2003-01-01
The Paris-Princeton Lectures in Financial Mathematics, of which this is the first volume, will, on an annual basis, publish cutting-edge research in self-contained, expository articles from outstanding - established or upcoming! - specialists. The aim is to produce a series of articles that can serve as an introductory reference for research in the field. It arises as a result of frequent exchanges between the finance and financial mathematics groups in Paris and Princeton. The present volume sets standards with articles by P. Bank/H. Föllmer, F. Baudoin, L.C.G. Rogers, and M. Soner/N. Touzi.
Modular Software-Defined Radio
Directory of Open Access Journals (Sweden)
Rhiemeier Arnd-Ragnar
2005-01-01
Full Text Available In view of the technical and commercial boundary conditions for software-defined radio (SDR, it is suggestive to reconsider the concept anew from an unconventional point of view. The organizational principles of signal processing (rather than the signal processing algorithms themselves are the main focus of this work on modular software-defined radio. Modularity and flexibility are just two key characteristics of the SDR environment which extend smoothly into the modeling of hardware and software. In particular, the proposed model of signal processing software includes irregular, connected, directed, acyclic graphs with random node weights and random edges. Several approaches for mapping such software to a given hardware are discussed. Taking into account previous findings as well as new results from system simulations presented here, the paper finally concludes with the utility of pipelining as a general design guideline for modular software-defined radio.
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...
A Formal Theory for Modular ERDF Ontologies
Analyti, Anastasia; Antoniou, Grigoris; Damásio, Carlos Viegas
The success of the Semantic Web is impossible without any form of modularity, encapsulation, and access control. In an earlier paper, we extended RDF graphs with weak and strong negation, as well as derivation rules. The ERDF #n-stable model semantics of the extended RDF framework (ERDF) is defined, extending RDF(S) semantics. In this paper, we propose a framework for modular ERDF ontologies, called modular ERDF framework, which enables collaborative reasoning over a set of ERDF ontologies, while support for hidden knowledge is also provided. In particular, the modular ERDF stable model semantics of modular ERDF ontologies is defined, extending the ERDF #n-stable model semantics. Our proposed framework supports local semantics and different points of view, local closed-world and open-world assumptions, and scoped negation-as-failure. Several complexity results are provided.
Virginia Tech among Princeton Review's and USA Today's top 10 'best value' public universities
Owczarski, Mark
2010-01-01
Virginia Tech was ranked eighth "best value" public university for 2010, according to "The Princeton Review," who teamed with USA Today, to present its list, "'The Princeton Review' Best Value Colleges for 2010."
Environmental Survey preliminary report, Princeton Plasma Physics Laboratory, Princeton, New Jersey
International Nuclear Information System (INIS)
1989-05-01
This report presents the preliminary findings of the first phase of the Environmental Survey of the United States Department of Energy's (DOE) Princeton Plasma Physics Laboratory (PPPL), conducted June 13 through 17, 1988. The Survey is being conducted by an interdisciplinary team of environmental specialists, led and managed by the Office of Environment, Safety and Health's Office of Environmental Audit. Team members are being provided by private contractors. The objective of the Survey is to identify environmental problems and areas of environmental risk associated with PPPL. The Survey covers all environmental media and all areas of environmental regulation. It is being performed in accordance with the DOE Environmental Survey Manual. This phase of the Survey involves the review of existing site environmental data, observations of the operations carried on at PPPL, and interviews with site personnel. The Survey team developed a Sampling and Analysis (S ampersand A) Plan to assist in further assessing certain of the environment problems identified during its on-site activities. The S ampersand A plan is being developed by the Idaho National Engineering Laboratory. When completed, the S ampersand A results will be incorporated into the PPPL Survey findings for inclusion in the Environmental Survey Summary Report. 70 refs., 17 figs., 21 tabs
Settlement Ends Dispute between Princeton and Donors' Heirs
Masterson, Kathryn; Gose, Ben
2009-01-01
This article reports that Princeton University has settled a long-running dispute with the heirs of a major donor by agreeing to pay $50-million to the heirs' foundation and approximately the same amount for their legal fees. The case has been closely watched as a test of how strictly institutions must adhere to donors' wishes. The settlement…
Decontamination/decommissioning of the Princeton Pennsylvania Accelerator Facility
International Nuclear Information System (INIS)
Bair, W.A.
1990-01-01
The Princeton Pennsylvania Accelerator Facility was a 3 GeV proton synchrotron operated jointly by Princeton University and the University of Pennsylvania from 1962 to 1972 on Princeton University's Forrestal Campus. During synchrotron operations, certain portions of the PPA central accelerator chamber and structural members became neutron activated. Upon termination of accelerator operations due to funding problems, Princeton desired to utilize the PPA site for other purposes, and commissioned a study to investigate Decommissioning and Decontamination options and methodologies. The study investigated several methods for in-place, surgically removing the neutron activated from the uncontaminated concrete. Since each technique produced different volumes of removed concrete all methods investigated were studied from the total economics of the problem and the cost of limiting and clean-up of secondary contamination. The decontamination method selected used a diamond wire cutting technique to sever in-place, the activated concrete from the uncontaminated. Large, intact, activated structural segments were cut and removed from the central accelerator chamber's floor, outer walls, internal columns and ceiling. Nonactivated portions of the structure, and the remainder of the central chamber were subsequently razed by conventional demolition methods. The paper describes the decontamination methodology, its effectiveness, disposal economics and radiological safety problems related thereto
DEFF Research Database (Denmark)
Müller, Anders Riel; Doucette, Jamie
a deeper and wider understanding of Korea’s development experience with the hope that Korea’s past can offer lessons for developing countries in search of sustainable and broad‐based development" (KSP 2011). To do so, the KSP provides users with a modularized set of policy narratives that represent Korea...
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
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...
Paris-Princeton lectures on mathematical finance 2010
Cousin, Areski; Guéant, Olivier; Hobson, David; Jeanblanc, Monique; Lasry, Jean-Michel; Laurent, Jean-Paul; Lions, Pierre-Louis; Tankov, Peter
2011-01-01
The Paris-Princeton Lectures on Mathematical Finance, of which this is the fourth volume, publish cutting-edge research in self-contained, expository articles from outstanding specialists - established or on the rise! The aim is to produce a series of articles that can serve as an introductory reference source for research in the field. The articles are the result of frequent exchanges between the finance and financial mathematics groups in Paris and Princeton. The present volume sets standards with articles by Areski Cousin, Monique Jeanblanc and Jean-Paul Laurent, Stéphane Crépey, Olivier Guéant, Jean-Michel Lasry and Pierre-Louis Lions, David Hobson, and Peter Tankov.
GATEWAY Demonstrations: Exterior LED Lighting Projects at Princeton University
Energy Technology Data Exchange (ETDEWEB)
Davis, Robert G. [Pacific Northwest National Lab. (PNNL), Richland, WA (United States); Evans, WIlliam E. [Princeton Univ., NJ (United States); Murphy, Arthur [Princeton Univ., NJ (United States); Perrin, Tess [Pacific Northwest National Lab. (PNNL), Richland, WA (United States)
2015-10-30
This report focuses on four exterior solid-state lighting projects that have been completed at Princeton since 2008, when the University adopted a comprehensive sustainability plan. Through these initial projects – which include a parking garage, a pedestrian path, and two parking lot installations – the school’s facilities engineering staff learned important lessons about SSL technology and gained experience in dealing with the rapidly changing landscape of lighting manufacturers and their suppliers.
Investigation of air transportation technology at Princeton University, 1986
Stengel, Robert F.
1988-01-01
The Air Transportation Technology Program at Princeton proceeded along four avenues: Guidance and control strategies for penetration of microbursts and wind shear; Application of artificial intelligence in flight control systems; Computer aided control system design; and Effects of control saturation on closed loop stability and response of open loop unstable aircraft. Areas of investigation relate to guidance and control of commercial transports as well as general aviation aircraft. Interaction between the flight crew and automatic systems is a subject of prime concern.
The Science on Saturday Program at Princeton Plasma Physics Laboratory
Bretz, N.; Lamarche, P.; Lagin, L.; Ritter, C.; Carroll, D. L.
1996-11-01
The Science on Saturday Program at Princeton Plasma Physics Laboratory consists of a series of Saturday morning lectures on various topics in science by scientists, engineers, educators, and others with an interesting story. This program has been in existence for over twelve years and has been advertised to and primarily aimed at the high school level. Topics ranging from superconductivity to computer animation and gorilla conservation to pharmaceutical design have been covered. Lecturers from the staff of Princeton, Rutgers, AT and T, Bristol Meyers Squibb, and many others have participated. Speakers have ranged from Nobel prize winners, astronauts, industrialists, educators, engineers, and science writers. Typically, there are eight to ten lectures starting in January. A mailing list has been compiled for schools, science teachers, libraries, and museums in the Princeton area. For the past two years AT and T has sponsored buses for Trenton area students to come to these lectures and an effort has been made to publicize the program to these students. The series has been very popular, frequently overfilling the 300 seat PPPL auditorium. As a result, the lectures are videotaped and broadcast to a large screen TV for remote viewing. Lecturers are encouraged to interact with the audience and ample time is provided for questions.
Chistyakov, Vyacheslav
2015-01-01
Aimed toward researchers and graduate students familiar with elements of functional analysis, linear algebra, and general topology; this book contains a general study of modulars, modular spaces, and metric modular spaces. Modulars may be thought of as generalized velocity fields and serve two important purposes: generate metric spaces in a unified manner and provide a weaker convergence, the modular convergence, whose topology is non-metrizable in general. Metric modular spaces are extensions of metric spaces, metric linear spaces, and classical modular linear spaces. The topics covered include the classification of modulars, metrizability of modular spaces, modular transforms and duality between modular spaces, metric and modular topologies. Applications illustrated in this book include: the description of superposition operators acting in modular spaces, the existence of regular selections of set-valued mappings, new interpretations of spaces of Lipschitzian and absolutely continuous mappings, the existe...
International Nuclear Information System (INIS)
Steiner, P.A.
1981-08-01
An aerial radiological survey was conducted during August 1980 to radiometrically survey a 10.4 km 2 area centered on the future site of the Tokamak Fusion Test Reactor (TFTR) located near Princeton, New Jersey. All detected radionuclides were consistent with normal background emitters and no man-made gamma emitters were detected. Average aerial exposure rates normalized to one meter above the ground are presented in the form of an isopleth map
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...
National Aeronautics and Space Administration — The AES Modular Power Systems (AMPS) project will demonstrate and infuse modular power electronics, batteries, fuel cells, and autonomous control for exploration...
5th Paris-Princeton Lectures on Mathematical Finance
Benth, Fred Espen; Guasoni, Paolo; Manolarakis, Konstantinos; Muhle-Karbe, Johannes; Nee, Colm; Protter, Philip
2013-01-01
The current volume presents four chapters touching on some of the most important and modern areas of research in Mathematical Finance: asset price bubbles (by Philip Protter); energy markets (by Fred Espen Benth); investment under transaction costs (by Paolo Guasoni and Johannes Muhle-Karbe); and numerical methods for solving stochastic equations (by Dan Crisan, K. Manolarakis and C. Nee).The Paris-Princeton Lecture Notes on Mathematical Finance, of which this is the fifth volume, publish cutting-edge research in self-contained, expository articles from renowned specialists. The aim is to produce a series of articles that can serve as an introductory reference source for research in the field.
Turbomolecular pump vacuum system for the Princeton Large Torus
International Nuclear Information System (INIS)
Dylla, H.F.
1977-10-01
A turbomolecular pump vacuum system has been designed and installed on the Princeton Large Torus (PLT). Four vertical shaft, oil-bearing, 1500 l/s turbomolecular pumps have been interfaced to the 6400 liter PLT Vacuum vessel to provide a net pumping speed of 3000 l/s for H 2 . The particular requirements and problems of tokamak vacuum systems are enumerated. A vacuum control system is described which protects the vacuum vessel from contamination, and protects the turbomolecular pumps from damage under a variety of possible failure modes. The performance of the vacuum system is presented in terms of pumping speed measurements and residual gas behavior
Health physics measurement of Princeton Tokamaks, 1977-1987
International Nuclear Information System (INIS)
Stencel, J.R.; Gilbert, J.D.; Couch, J.G.; Griesbach, O.A.; Fennimore, J.J.; Greco, J.M.
1989-01-01
The Princeton Plasma Physics Laboratory (PPPL) began fusion experiments in 1951. In the early years, the major health physics concerns were associated with x radiation produced by energetic electrons in the plasma. Within the past year, neutron and 3 H production from 2H-2H (represented hereafter as D-D) reactions has increased significantly on the larger fusion devices. Tritium retention noted in graphite tiles underscores the significance of material selection in present and future 3 H-fueled fusion devices. This paper reports on operational health physics radiation measurements made on various PPPL machines over the past 10 y
Investigation of air transportation technology at Princeton University, 1984
Stengel, Robert F.
1987-01-01
The Air Transportation Technology Program at Princeton University, a program emphasizing graduate and undergraduate student research, proceeded along four avenues during 1984: (1) guidance and control strategies for penetration of microbursts and wind shear; (2) application of artificial intelligence in flight control systems; (3) effects of control saturation on closed loop stability; and (4) response of open loop unstable aircraft. Areas of investigation relate to guidance and control of commercial transports as well as to general aviation aircraft. Interaction between the flight crew and automatic systems is a subject of principle concern. These areas of investigation are briefly discussed.
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.
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...
Directory of Open Access Journals (Sweden)
Natas Setiabudhi Daryono Putra
2017-09-01
Full Text Available Dualisme merupakan konsep filsafat yang menyatakan bahwa segala sesuatu memiliki dua hal yang berlawanan atau prinsip. Hidup dan mati, laki dan perempuan, siang dan malam, jiwa dan raga, sehat dan sakit, kaya dan miskin, baik dan buruk, halal dan haram, pro dan kontra, aktif dan pasif, statis dan dinamis, tampan dan buruk rupa, besar dan kecil, panjang dan pendek, manis dan pahit, mahal dan murah, kuat dan lemah, dan seterusnya. Dalam konteks karya ini merupakan representasi dari manusia yang pada dasarnya memiliki 2 kepribadian, baik dan buruk. Keduanya diterjemahkan ke dalam konsep modular dalam menyusun sebuah konfigurasi karya. Pesan yang ingin penulis sampaikan adalah seseorang tidak bisa dinilai dari “baju atau seragam” yang ia pakai. Selain itu keseimbangan dalam baik dan buruk yang direpresentasikan dengan modul positif dan negatif menjadi ambigu dalam kaitan dengan pahala dan dosa dalam Islam. Karya ini meminjam gambar Rubin’s vase/goblet (vas/piala Rubin karya seorang psikolog gestalt Edgar Rubin asal Denmark yang ditransformasi menjadi sebuah karya keramik 3 dimensional [1]. Vas/piala Rubin ini secara perseptual memiliki 2 makna, yaitu gambar vas/piala dan siluet wajah dari samping yang saling berhadapan (pengaruh antarobjek dan latar secara bergiliran. Proses kreasi berasal dari pengalaman empirik personal yang dihubungkan dengan teori-teori pendukung. Perpaduan keduanya menghasilkan karya seni yang merupakan representasi dari realitas. Dalam penciptaan karya seni rupa sebenarnya tidak ada metode baku seperti halnya dalam riset pada umumnya. Proses kreasi kadang berdasarkan intuisi, pengalaman personal yang dominan dan mengandung narasi yang sangat subjektif. Kesemuanya itu dikaitkan dengan disiplin ilmu lainnya (sosial, ekonomi, budaya dan politik untuk menghasilkan sebuah representasi. Modular Dualism Abstract. Dualism is the concept that everything has two opposite sides or principles. Life and death, male and female, day
Exploring Modularity in Services
DEFF Research Database (Denmark)
Avlonitis, Viktor; Hsuan, Juliana
2017-01-01
the effects of modularity and integrality on a range of different analytical levels in service architectures. Taking a holistic approach, the authors synthesize and empirically deploy a framework comprised of the three most prevalent themes in modularity and service design literature: Offering (service...... insights on the mirroring hypothesis of modularity theory to services. Originality/value The paper provides a conceptualization of service architectures drawing on service design, modularity, and market relationships. The study enriches service design literature with elements from modularity theory...
International Nuclear Information System (INIS)
Ferrante, T.A.
1997-01-01
A modular robot may comprise a main body having a structure defined by a plurality of stackable modules. The stackable modules may comprise a manifold, a valve module, and a control module. The manifold may comprise a top surface and a bottom surface having a plurality of fluid passages contained therein, at least one of the plurality of fluid passages terminating in a valve port located on the bottom surface of the manifold. The valve module is removably connected to the manifold and selectively fluidically connects the plurality of fluid passages contained in the manifold to a supply of pressurized fluid and to a vent. The control module is removably connected to the valve module and actuates the valve module to selectively control a flow of pressurized fluid through different ones of the plurality of fluid passages in the manifold. The manifold, valve module, and control module are mounted together in a sandwich-like manner and comprise a main body. A plurality of leg assemblies are removably connected to the main body and are removably fluidically connected to the fluid passages in the manifold so that each of the leg assemblies can be selectively actuated by the flow of pressurized fluid in different ones of the plurality of fluid passages in the manifold. 12 figs
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...
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...
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.
Estate of Behringer v. Medical Center at Princeton.
1991-04-25
Dr. William Behringer, a staff member at the Medical Center at Princeton, was diagnosed with AIDS. Afterwards, Behringer received numerous phone calls from various people expressing awareness of his illness, and his surgical privileges at the Center were suspended. He sued the Medical Center, alleging a breach of confidentiality and discrimination. The Superior Court of New Jersey, Mercer County, held that the Medical Center had breached its duty of confidentiality when it failed to take reasonable precautions to prevent Behringer's AIDS diagnosis from becoming public knowledge. Nevertheless, although New Jersey's anti-discrimination statutes protected Dr. Behringer from having his surgical privileges revoked, the Medical Center demonstrated a reasonable risk to patients that justified suspending Dr. Behringer's privileges, or alternatively, requiring his patients' informed consent before operating. The court found that the risk included not only actual HIV transmission, but also the possibility of surgical accidents.
Complexity in Managing Modularization
DEFF Research Database (Denmark)
Hansen, Poul H. Kyvsgård; Sun, Hongyi
2011-01-01
In general, the phenomenon of managing modularization is not well known. The cause-effect relationships between modularization and realized benefits are complex and comprehensive. Though a number of research works have contributed to the study of the phenomenon of efficient and effective...... modularization management it is far from clarified. Recognizing the need for further empirical research, we have studied 40 modularity cases in various companies. The studies have been designed as long-term studies leaving time for various types of modularization benefits to emerge. Based on these studies we...... have developed a framework to support the heuristic and iterative process of planning and realizing modularization benefits....
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
Understanding Socio Technical Modularity
DEFF Research Database (Denmark)
Thuesen, Christian Langhoff; Kudsk, Anders; Hvam, Lars
2011-01-01
Modularity has gained an increasing popularity as a central concept for exploring product structure, process structure, organization structure and supply chain structure. With the offset in system theory the predominant understanding of modularity however faces difficulties in explaining the social...... dimension of modularity like irrational behaviors, cultural differences, learning processes, social organization and institutional influences on modularity. The paper addresses this gab offering a reinterpretation of the modularity concept from a socio-technical perspective in general and Actor Network...... Theory in particular. By formulating modularity from an ANT perspective covering social, material and process aspects, the modularity of a socio-technical system can be understood as an entanglement of product, process, organizational and institutional modularity. The theoretical framework is illustrated...
Portable modular detection system
Brennan, James S [Rodeo, CA; Singh, Anup [Danville, CA; Throckmorton, Daniel J [Tracy, CA; Stamps, James F [Livermore, CA
2009-10-13
Disclosed herein are portable and modular detection devices and systems for detecting electromagnetic radiation, such as fluorescence, from an analyte which comprises at least one optical element removably attached to at least one alignment rail. Also disclosed are modular detection devices and systems having an integrated lock-in amplifier and spatial filter and assay methods using the portable and modular detection devices.
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
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.
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...
Planned Experiments on the Princeton Advanced Test Stand
Stepanov, A.; Gilson, E. P.; Grisham, L.; Kaganovich, I.; Davidson, R. C.
2010-11-01
The Princeton Advanced Test Stand (PATS) device is an experimental facility based on the STS-100 high voltage test stand transferred from LBNL. It consists of a multicusp RF ion source, a pulsed extraction system capable of forming high-perveance 100keV ion beams, and a large six-foot-long vacuum with convenient access for beam diagnostics. This results in a flexible system for studying high perveance ion beams relevant to NDCX-I/II, including experiments on beam neutralization by ferroelectric plasma sources (FEPS) being developed at PPPL. Research on PATS will concern the basic physics of beam-plasma interactions, such as the effects of volume neutralization on beam emittance, as well as optimizing technology of the FEPS. PATS combines the advantage of an ion beam source and a large-volume plasma source in a chamber with ample access for diagnostics, resulting in a robust setup for investigating and improving relevant aspects of neutralized drift. There are also plans for running the ion source with strongly electro-negative gases such as chlorine, making it possible to extract positive or negative ion beams.
The revival of General Relativity at Princeton: Daring Conservatism
Brill, Dieter; Blum, Alexander
2018-01-01
After General Relativity was established in essentially its present form in 1915 it was celebrated as a great success of mathematical physics. But the initial hopes for this theory as a basis for all of physics began to fade in the next several decades, as General Relativity was relegated to the margins of theoretical physics. Its fate began to rise in the 1950's in a revival of interest and research that over time made gravitational physics one of the hottest research topics it is today. One center of this renaissance was Princeton, where two relative newcomers explored new and different approaches to gravitational physics. Robert Dicke showed that gravity is not as inaccessible to experiment as was thought, and John Wheeler propelled it into the mainstream by proposing highly original and imaginative consequences of Einstein's theory. We will concentrate on these ideas that, in his characteristically intriguing style, Wheeler called "Daring Conservatism" - a term well known to his associates, but one he never mentioned in print. With the aid of unpublished manuscripts and notes we will explore Daring Conservatism's origin and motivation, its successes and failures, and the legacy it left behind.
Princeton Plasma Physics Laboratory for FY2003. Annual Highlights
International Nuclear Information System (INIS)
Phillips, Carol A.; DeMeo, Anthony R.
2004-01-01
The Princeton Plasma Physics Laboratory FY2003 Annual Highlights report provides a summary of the activities at the Laboratory for the fiscal year--1 October 2002 through 30 September 2003. The report includes the Laboratory's Mission and Vision Statements, a message ''From the Director,'' summaries of the research and engineering activities by project, and sections on Technology Transfer, the Graduate and Science Education Programs, Awards and Honors garnered by the Laboratory and the employees, and the Year in Pictures. There is also a listing of the Laboratory's publications for the year and a section of the abbreviations, acronyms, and symbols used throughout the report. In the PDF document, links have been created from the Table of Contents to each section. You can also return to the Table of Contents from the beginning page of each section. The PPPL Highlights for fiscal year 2003 is also available in hardcopy format. To obtain a copy e-mail Publications and Reports at: pub-reports at pppl.gov. Be sure to include your complete mailing address
Regimes of operation in the Princeton Large Torus
Energy Technology Data Exchange (ETDEWEB)
Hosea, J.C.
1979-10-01
In the quest for optimum discharge conditions in the Princeton Large Torus (PLT), a variety of discharge regimes have been produced. These separate broadly into two main categories - those regimes with m greater than or equal to 2 oscillatory MHD instabilities and often hollow electron profiles for tungsten limiters, and those regimes for which the electron temperature is sufficiently peaked to support the internal sawtooth or near-sawtooth (m = 1) instability. The internal sawtooth regime is found to be optimum for confinement but to be more difficult to select when low-Z impurity concentrations have been reduced with low power discharge cleaning or gettering to permit extension of the high density operation limit. Gas programming is used to cool the plasma periphery, thereby reducing the high-Z impurity concentrations and causing the current channel to constrict into the sawtooth regime, and then to attain the desired plasma density. With discharges selected in this manner, gross energetic confinement times up to approx. 100 msec have been obtained at densities of approx. 10/sup 14/ cm/sup -3/, and very high ion and electron temperatures have been produced with neutral beam injection heating at lower densities with no observable deleterious effect on energy confinement.
The revival of General Relativity at Princeton: Daring Conservatism
Directory of Open Access Journals (Sweden)
Brill Dieter
2018-01-01
Full Text Available After General Relativity was established in essentially its present form in 1915 it was celebrated as a great success of mathematical physics. But the initial hopes for this theory as a basis for all of physics began to fade in the next several decades, as General Relativity was relegated to the margins of theoretical physics. Its fate began to rise in the 1950's in a revival of interest and research that over time made gravitational physics one of the hottest research topics it is today. One center of this renaissance was Princeton, where two relative newcomers explored new and different approaches to gravitational physics. Robert Dicke showed that gravity is not as inaccessible to experiment as was thought, and John Wheeler propelled it into the mainstream by proposing highly original and imaginative consequences of Einstein's theory. We will concentrate on these ideas that, in his characteristically intriguing style, Wheeler called "Daring Conservatism" -- a term well known to his associates, but one he never mentioned in print. With the aid of unpublished manuscripts and notes we will explore Daring Conservatism's origin and motivation, its successes and failures, and the legacy it left behind.
Princeton Plasma Physics Laboratory (PPPL) seismic hazard analysis
International Nuclear Information System (INIS)
Savy, J.
1989-01-01
New design and evaluation guidelines for department of energy facilities subjected to natural phenomena hazard, are being finalized. Although still in draft form at this time, the document describing those guidelines should be considered to be an update of previously available guidelines. The recommendations in the guidelines document mentioned above, and simply referred to as the ''guidelines'' thereafter, are based on the best information at the time of its development. In particular, the seismic hazard model for the Princeton site was based on a study performed in 1981 for Lawrence Livermore National Laboratory (LLNL), which relied heavily on the results of the NRC's Systematic Evaluation Program and was based on a methodology and data sets developed in 1977 and 1978. Considerable advances have been made in the last ten years in the domain of seismic hazard modeling. Thus, it is recommended to update the estimate of the seismic hazard at the DOE sites whenever possible. The major differences between previous estimates and the ones proposed in this study for the PPPL are in the modeling of the strong ground motion at the site, and the treatment of the total uncertainty in the estimates to include knowledge uncertainty, random uncertainty, and expert opinion diversity as well. 28 refs
Princeton Plasma Physics Laboratory (PPPL) seismic hazard analysis
Energy Technology Data Exchange (ETDEWEB)
Savy, J.
1989-10-01
New design and evaluation guidelines for department of energy facilities subjected to natural phenomena hazard, are being finalized. Although still in draft form at this time, the document describing those guidelines should be considered to be an update of previously available guidelines. The recommendations in the guidelines document mentioned above, and simply referred to as the guidelines'' thereafter, are based on the best information at the time of its development. In particular, the seismic hazard model for the Princeton site was based on a study performed in 1981 for Lawrence Livermore National Laboratory (LLNL), which relied heavily on the results of the NRC's Systematic Evaluation Program and was based on a methodology and data sets developed in 1977 and 1978. Considerable advances have been made in the last ten years in the domain of seismic hazard modeling. Thus, it is recommended to update the estimate of the seismic hazard at the DOE sites whenever possible. The major differences between previous estimates and the ones proposed in this study for the PPPL are in the modeling of the strong ground motion at the site, and the treatment of the total uncertainty in the estimates to include knowledge uncertainty, random uncertainty, and expert opinion diversity as well. 28 refs.
Princeton Plasma Physics Laboratory FY2003 Annual Highlights
Energy Technology Data Exchange (ETDEWEB)
Editors: Carol A. Phillips; Anthony R. DeMeo
2004-08-23
The Princeton Plasma Physics Laboratory FY2003 Annual Highlights report provides a summary of the activities at the Laboratory for the fiscal year--1 October 2002 through 30 September 2003. The report includes the Laboratory's Mission and Vision Statements, a message ''From the Director,'' summaries of the research and engineering activities by project, and sections on Technology Transfer, the Graduate and Science Education Programs, Awards and Honors garnered by the Laboratory and the employees, and the Year in Pictures. There is also a listing of the Laboratory's publications for the year and a section of the abbreviations, acronyms, and symbols used throughout the report. In the PDF document, links have been created from the Table of Contents to each section. You can also return to the Table of Contents from the beginning page of each section. The PPPL Highlights for fiscal year 2003 is also available in hardcopy format. To obtain a copy e-mail Publications and Reports at: pub-reports@pppl.gov. Be sure to include your complete mailing address
Remote handling needs of the Princeton Plasma Physics Laboratory
International Nuclear Information System (INIS)
Smiltnieks, V.
1982-07-01
This report is the result of a Task Force study commissioned by the Canadian Fusion Fuels Technology Project (CFFTP) to investigate the remote handling requirements at the Princeton Plasma Physics Laboratory (PPPL) and identify specific areas where CFFTP could offer a contractual or collaborative participation, drawing on the Canadian industrial expertise in remote handling technology. The Task Force reviewed four areas related to remote handling requirements; the TFTR facility as a whole, the service equipment required for remote maintenance, the more complex in-vessel components, and the tritium systems. Remote maintenance requirements both inside the vacuum vessel and around the periphery of the machine were identified as the principal areas where Canadian resources could effectively provide an input, initially in requirement definition, concept evaluation and feasibility design, and subsequently in detailed design and manufacture. Support requirements were identified in such areas as the mock-up facility and a variety of planning studies relating to reliability, availability, and staff training. Specific tasks are described which provide an important data base to the facility's remote handling requirements. Canadian involvement in the areas is suggested where expertise exists and support for the remote handling work is warranted. Reliability, maintenance operations, inspection strategy and decommissioning are suggested for study. Several specific components are singled out as needing development
Modularity and Economic Organization
DEFF Research Database (Denmark)
Sanchez, Ron; Mahoney, Joseph T.
This paper addresses modularity as a basis for organizing economic activity. We first define the key concepts of architecture and of modularity as a special form of architecture. We then suggest how modular systems of all types may exhibit several properties of fundamental importance to the organ......This paper addresses modularity as a basis for organizing economic activity. We first define the key concepts of architecture and of modularity as a special form of architecture. We then suggest how modular systems of all types may exhibit several properties of fundamental importance...... to the organization of economic activities, including greater adaptability and evolvability than systems that lack modular properties. We draw extensively on our original 1996 paper on modularity and subsequent research to suggest broad theoretical implications of modularity for (i) firms' product strategies...... markets. We also discuss an evolutionary perspective on modularity as an emergent phenomenon in firms and industries. We explain how modularity as a relatively new field of strategy and economic research may provide a new theoretical perspective on economic organizing that has significant potential...
Product Architecture Modularity Strategies
DEFF Research Database (Denmark)
Mikkola, Juliana Hsuan
2003-01-01
The focus of this paper is to integrate various perspectives on product architecture modularity into a general framework, and also to propose a way to measure the degree of modularization embedded in product architectures. Various trade-offs between modular and integral product architectures...... and how components and interfaces influence the degree of modularization are considered. In order to gain a better understanding of product architecture modularity as a strategy, a theoretical framework and propositions are drawn from various academic literature sources. Based on the literature review......, the following key elements of product architecture are identified: components (standard and new-to-the-firm), interfaces (standardization and specification), degree of coupling, and substitutability. A mathematical function, termed modularization function, is introduced to measure the degree of modularization...
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.
Sven Heinicke; Michael S Livstone; Charles Lu; Rose Oughtred; Fan Kang; Samuel V Angiuoli; Owen White; David Botstein; Kara Dolinski
2007-01-01
Many biological databases that provide comparative genomics information and tools are now available on the internet. While certainly quite useful, to our knowledge none of the existing databases combine results from multiple comparative genomics methods with manually curated information from the literature. Here we describe the Princeton Protein Orthology Database (P-POD, http://ortholog.princeton.edu), a user-friendly database system that allows users to find and visualize the phylogenetic r...
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
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...
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.
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
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.
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.
Service Modularity and Architecture
DEFF Research Database (Denmark)
Brax, Saara A.; Bask, Anu; Hsuan, Juliana
2017-01-01
, platform-based and mass-customized service business models, comparative research designs, customer perspectives and service experience, performance in context of modular services, empirical evidence of benefits and challenges, architectural innovation in services, modularization in multi-provider contexts......Purpose: Services are highly important in a world economy which has increasingly become service driven. There is a growing need to better understand the possibilities for, and requirements of, designing modular service architectures. The purpose of this paper is to elaborate on the roots...... of the emerging research stream on service modularity, provide a concise overview of existing work on the subject, and outline an agenda for future research on service modularity and architecture. The articles in the special issue offer four diverse sets of research on service modularity and architecture. Design...
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.
DEFF Research Database (Denmark)
Lund, Henrik Hautop; Pagliarini, Luigi
2009-01-01
In this concept paper we trace the contours and define a new approach to robotic systems, composed of interactive robotic modules which are somehow worn on the body. We label such a field as Modular Robotic Wearable (MRW). We describe how, by using modular robotics for creating wearable....... Finally, by focusing on the intersection of the combination modular robotic systems, wearability, and bodymind we attempt to explore the theoretical characteristics of such approach and exploit the possible playware application fields....
Discrete optimization in architecture extremely modular systems
Zawidzki, Machi
2017-01-01
This book is comprised of two parts, both of which explore modular systems: Pipe-Z (PZ) and Truss-Z (TZ), respectively. It presents several methods of creating PZ and TZ structures subjected to discrete optimization. The algorithms presented employ graph-theoretic and heuristic methods. The underlying idea of both systems is to create free-form structures using the minimal number of types of modular elements. PZ is more conceptual, as it forms single-branch mathematical knots with a single type of module. Conversely, TZ is a skeletal system for creating free-form pedestrian ramps and ramp networks among any number of terminals in space. In physical space, TZ uses two types of modules that are mirror reflections of each other. The optimization criteria discussed include: the minimal number of units, maximal adherence to the given guide paths, etc.
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...
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
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
How Symmetric Are Real-World Graphs? A Large-Scale Study
Directory of Open Access Journals (Sweden)
Fabian Ball
2018-01-01
Full Text Available The analysis of symmetry is a main principle in natural sciences, especially physics. For network sciences, for example, in social sciences, computer science and data science, only a few small-scale studies of the symmetry of complex real-world graphs exist. Graph symmetry is a topic rooted in mathematics and is not yet well-received and applied in practice. This article underlines the importance of analyzing symmetry by showing the existence of symmetry in real-world graphs. An analysis of over 1500 graph datasets from the meta-repository networkrepository.com is carried out and a normalized version of the “network redundancy” measure is presented. It quantifies graph symmetry in terms of the number of orbits of the symmetry group from zero (no symmetries to one (completely symmetric, and improves the recognition of asymmetric graphs. Over 70% of the analyzed graphs contain symmetries (i.e., graph automorphisms, independent of size and modularity. Therefore, we conclude that real-world graphs are likely to contain symmetries. This contribution is the first larger-scale study of symmetry in graphs and it shows the necessity of handling symmetry in data analysis: The existence of symmetries in graphs is the cause of two problems in graph clustering we are aware of, namely, the existence of multiple equivalent solutions with the same value of the clustering criterion and, secondly, the inability of all standard partition-comparison measures of cluster analysis to identify automorphic partitions as equivalent.
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.
DEFF Research Database (Denmark)
Jørgensen, Simon Laumann
2012-01-01
Anmeldelse af Quentin Skinner, Staten og friheten, Oslo: Res Publica 2011, 199 NOK & José Luis Martí & Philip Pettit, A Political Philosophy in Public Life. Civic Republicanism in Zapatero’s Spain, Princeton: Princeton University Press 2010, $ 24.95......Anmeldelse af Quentin Skinner, Staten og friheten, Oslo: Res Publica 2011, 199 NOK & José Luis Martí & Philip Pettit, A Political Philosophy in Public Life. Civic Republicanism in Zapatero’s Spain, Princeton: Princeton University Press 2010, $ 24.95...
Development of an Extreme Environment Materials Research Facility at Princeton
International Nuclear Information System (INIS)
Cohen, A.B.; Gentile, C.A.; Tully, C.G.; Austin, R.; Calaprice, F.; McDonald, K.; Ascione, G.; Baker, G.; Davidson, R.; Dudek, L.; Grisham, L.; Kugel, H.; Pagdon, K.; Stevenson, T.; Woolley, R.; Zwicker, A.
2010-01-01
The need for a fundamental understanding of material response to a neutron and/or high heat flux environment can yield development of improved materials and operations with existing materials. Such understanding has numerous applications in fields such as nuclear power (for the current fleet and future fission and fusion reactors), aerospace, and other research fields (e.g., high-intensity proton accelerator facilities for high energy physics research). A proposal has been advanced to develop a facility for testing various materials under extreme heat and neutron exposure conditions at Princeton. The Extreme Environment Materials Research Facility comprises an environmentally controlled chamber (48 m 3 ) capable of high vacuum conditions, with extreme flux beams and probe beams accessing a central, large volume target. The facility will have the capability to expose large surface areas (1 m 2 ) to 14 MeV neutrons at a fluence in excess of 10 13 n/s. Depending on the operating mode. Additionally beam line power on the order of 15-75 MW/m 2 for durations of 1-15 seconds are planned. The multi-second duration of exposure can be repeated every 2-10 minutes for periods of 10-12 hours. The facility will be housed in the test cell that held the Tokamak Fusion Test Reactor (TFTR), which has the desired radiation and safety controls as well as the necessary loading and assembly infrastructure. The facility will allow testing of various materials to their physical limit of thermal endurance and allow for exploring the interplay between radiation-induced embrittlement, swelling and deformation of materials, and the fatigue and fracturing that occur in response to thermal shocks. The combination of high neutron energies and intense fluences will enable accelerated time scale studies. The results will make contributions for refining predictive failure modes (modeling) in extreme environments, as well as providing a technical platform for the development of new alloys, new
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...
International Nuclear Information System (INIS)
McGuire, K.M.; Kugel, H.W.; La Haye, R.J.; Mauel, M.E.; Nevins, W.M.; Prager, S.C.
1997-01-01
The transient operating performance of magnetic confinement devices is often limited by one or two unstable MHD modes. The feedback stabilization of MHD instabilities is an area of research that is critical for improving the steady state performance and economic attractiveness of magnetic confinement devices. This growing realization motivated a Workshop dedicated to feedback stabilization of MHD instabilities, which was held from 11 to 13 December 1996 at Princeton Plasma Physics Laboratory. The resulting presentations, conclusions and recommendations are summarized. (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.
Modularization and Flexibilization.
Van Meel, R. M.
Publications in the fields of educational science, organization theory, and project management were analyzed to identify the possibilities that modularization offers to institutions of higher professional education and to obtain background information for use in developing a method for modularization in higher professional education. It was…
DEFF Research Database (Denmark)
Bahr, Patrick
2012-01-01
Tree automata are traditionally used to study properties of tree languages and tree transformations. In this paper, we consider tree automata as the basis for modular and extensible recursion schemes. We show, using well-known techniques, how to derive from standard tree automata highly modular...
Implementing Modular A Levels.
Holding, Gordon
This document, which is designed for curriculum managers at British further education (FE) colleges, presents basic information on the implementation and perceived benefits of the General Certificate of Education (GCE) modular A (Advanced) levels. The information was synthesized from a survey of 12 FE colleges that introduced the modular A levels…
Proposal of 'Modular Heliotron'
International Nuclear Information System (INIS)
Yamazaki, Kozo
1994-01-01
A new modular helical system named 'Modular Heliotron' with clean and efficient helical magnetic divertor is proposed as an extension of the present conventional design of the continuous helical coil system. The sectored helical coils on one plane of the torus and the sectored returning vertical field coils on the other plane are combined. This coil system produces magnetic surfaces nearly equivalent to those of the l=2 helical system with one-pair poloidal coils, and overcomes the defects of construction and maintenance difficulties of the continuous coil systems. This concept satisfies the compatibility between the coil modularity and the sufficient divertor-space utilization, different from previous modular coil designs. The allowable length of the gap between each modular coil is clarified to keep good magnetic surfaces. Typical examples of the reactor coil configuration are described as an extension of the LHD (Large Helical Device) configuration. (author)
Evolution of Modularity Literature
DEFF Research Database (Denmark)
Frandsen, Thomas
2017-01-01
Purpose The purpose of this paper is to review and analyze the modularity literature to identify the established and emerging perspectives. Design/methodology/approach A systematic literature search and review was conducted through the use of bibliometrics and network analysis. The analysis...... identified structure within the literature, which revealed how the research area evolved between 1990 and 2015. Based on this search, the paper establishes the basis for analyzing the structure of modularity literature. Findings Factors were identified within the literature, demonstrating how it has evolved...... from a primary focus on the modularity of products to a broader view of the applicability of modularity. Within the last decade, numerous research areas have emerged within the broader area of modularity. Through core-periphery analysis, eight emerging sub-research areas are identified, of which one...
Designing Modular Robotic Playware
DEFF Research Database (Denmark)
Lund, Henrik Hautop; Marti, Patrizia
2009-01-01
In this paper, we explore the design of modular robotic objects that may enhance playful experiences. The approach builds upon the development of modular robotics to create a kind of playware, which is flexible in both set-up and activity building for the end-user to allow easy creation of games....... Key features of this design approach are modularity, flexibility, and construction, immediate feedback to stimulate engagement, activity design by end-users, and creative exploration of play activities. These features permit the use of such modular playware by a vast array of users, including disabled...... children who often could be prevented from using and taking benefits from modern technologies. The objective is to get any children moving, exchanging, experimenting and having fun, regardless of their cognitive or physical ability levels. The paper describes two prototype systems developed as modular...
Proposal of 'modular heliotron'
International Nuclear Information System (INIS)
Yamazaki, Kozo.
1993-11-01
A new modular helical configuration named 'Modular Heliotron' with clean and efficient helical magnetic divertor is proposed as an extension of the present conventional design of the continuous helical coil system. The sectored helical coils on one plane of the torus and the sectored returning vertical field coils on the other plane are combined. This coil system produces magnetic surfaces nearly equivalent to those of the l=2 helical system with one-pair poloidal coils, and overcomes the defects of construction and maintenance difficulties of the continuous coil systems. This concept satisfies the compatibility between the coil modularity and the sufficient divertor-space utilization, different from previous modular coil designs. The allowable length of the gap between each modular coil is clarified to keep good magnetic surfaces. Typical examples of the reactor coil configuration are described as an extension of the LHD (Large Helical Device) configuration. (author)
Conklin, John Albert
This dissertation presents the design of a modular, fiber-optic sensor and the results obtained from testing the modular sensor. The modular fiber-optic sensor is constructed in such manner that the sensor diaphragm can be replaced with different configurations to detect numerous physical phenomena. Additionally, different fiber-optic detection systems can be attached to the sensor. Initially, the modular sensor was developed to be used by university of students to investigate realistic optical sensors and detection systems to prepare for advance studies of micro-optical mechanical systems (MOMS). The design accomplishes this by doing two things. First, the design significantly lowers the costs associated with studying optical sensors by modularizing the sensor design. Second, the sensor broadens the number of physical phenomena that students can apply optical sensing techniques to in a fiber optics sensor course. The dissertation is divided into seven chapters covering the historical development of fiber-optic sensors, a theoretical overview of fiber-optic sensors, the design, fabrication, and the testing of the modular sensor developed in the course of this work. Chapter 1 discusses, in detail, how this dissertation is organized and states the purpose of the dissertation. Chapter 2 presents an historical overview of the development of optical fibers, optical pressure sensors, and fibers, optical pressure sensors, and optical microphones. Chapter 3 reviews the theory of multi-fiber optic detection systems, optical microphones, and pressure sensors. Chapter 4 presents the design details of the modular, optical sensor. Chapter 5 delves into how the modular sensor is fabricated and how the detection systems are constructed. Chapter 6 presents the data collected from the microphone and pressure sensor configurations of the modular sensor. Finally, Chapter 7 discusses the data collected and draws conclusions about the design based on the data collected. Chapter 7 also
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
SU (N) lattice integrable models and modular invariance
International Nuclear Information System (INIS)
Zuber, J.B.; Di Francesco, P.
1989-01-01
We first review some recent work on the construction of RSOS SU (N) critical integrable models. The models may be regarded as associated with a graph, extending from SU (2) to SU (N) an idea of Pasquier, or alternatively, with a representation of the fusion algebra over non-negative integer valued matrices. Some consistency conditions that the Boltzmann weights of these models must satisfy are then pointed out. Finally, the algebraic connections between (a subclass of) the admissible graphs and (a subclass of) modular invariants are discussed, based on the theory of C-algebras. The case of G 2 is also treated
International Nuclear Information System (INIS)
Busigin, A.; Busigin, C.J.; Robins, J.R.; Woodall, K.B.; Bellamy, D.G.; Fong, C.; Kalyanam, K.; Sood, S.K.
1995-01-01
A low inventory Tritium Purification System (TPS) has just been installed at the Princeton Plasma Physics Laboratory (PPPL). The TPS was designed specifically for PPPL, based on their specifications for exhaust gases. The generic design, however, can easily be modified to accept a large variety of input conditions. The Princeton system is designed to have a total tritium inventory of approximately 0.5 g while producing pure product streams consisting of H 2 , D 2 , and T 2 . The purpose of the system is to separate and recycle unburnt tritium from the TFTR and to produce hydrogen and deuterium streams that are free of tritium. These streams can be disposed by stacking, thus eliminating the need to create large volume waste streams that are contaminated with tritium and that must be managed for permanent disposal. This paper will discuss the installation, the modifications and preliminary results of operation of this system at Princeton. 2 refs., 3 figs
Modular architectures for quantum networks
Pirker, A.; Wallnöfer, J.; Dür, W.
2018-05-01
We consider the problem of generating multipartite entangled states in a quantum network upon request. We follow a top-down approach, where the required entanglement is initially present in the network in form of network states shared between network devices, and then manipulated in such a way that the desired target state is generated. This minimizes generation times, and allows for network structures that are in principle independent of physical links. We present a modular and flexible architecture, where a multi-layer network consists of devices of varying complexity, including quantum network routers, switches and clients, that share certain resource states. We concentrate on the generation of graph states among clients, which are resources for numerous distributed quantum tasks. We assume minimal functionality for clients, i.e. they do not participate in the complex and distributed generation process of the target state. We present architectures based on shared multipartite entangled Greenberger–Horne–Zeilinger states of different size, and fully connected decorated graph states, respectively. We compare the features of these architectures to an approach that is based on bipartite entanglement, and identify advantages of the multipartite approach in terms of memory requirements and complexity of state manipulation. The architectures can handle parallel requests, and are designed in such a way that the network state can be dynamically extended if new clients or devices join the network. For generation or dynamical extension of the network states, we propose a quantum network configuration protocol, where entanglement purification is used to establish high fidelity states. The latter also allows one to show that the entanglement generated among clients is private, i.e. the network is secure.
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
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.
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,.
Princeton University, Plasma Physics Laboratory annual report, October 1, 1988--September 30, 1989
Energy Technology Data Exchange (ETDEWEB)
1989-12-31
This report contains discussions on the following topics: principal parameters achieved in experimental devices (FY89); tokamak fusion test reactor; compact ignition tokamak; princeton beta experiment- modification; current drive experiment; international collaboration; x-ray laser studies; spacecraft glow experiment; plasma deposition and etching of thin films; theoretical studies; tokamak modeling; international thermonuclear experimental reactor; engineering department; project planning and safety office; quality assurance and reliability; technology transfer; administrative operations; PPPL patent invention disclosures for (FY89); graduate education: plasma physics; graduate education: plasma science and technology; and Princeton Plasmas Physics Laboratory Reports (FY89).
Princeton Plasma Physics Laboratory. Annual report, October 1, 1989--September 30, 1990
Energy Technology Data Exchange (ETDEWEB)
1990-12-31
This report discusses the following topics: principal parameters achieved in experimental devices fiscal year 1990; tokamak fusion test reactor; compact ignition tokamak; Princeton beta experiment- modification; current drive experiment-upgrade; international collaboration; x-ray laser studies; spacecraft glow experiment; plasma processing: deposition and etching of thin films; theoretical studies; tokamak modeling; international thermonuclear experimental reactor; engineering department; project planning and safety office; quality assurance and reliability; technology transfer; administrative operations; PPPL patent invention disclosures for fiscal year 1990; graduate education; plasma physics; graduate education: plasma science and technology; science education program; and Princeton Plasma Physics Laboratory reports fiscal year 1990.
Princeton University, Plasma Physics Laboratory annual report, October 1, 1988--September 30, 1989
Energy Technology Data Exchange (ETDEWEB)
1989-01-01
This report contains discussions on the following topics: principal parameters achieved in experimental devices (FY89); tokamak fusion test reactor; compact ignition tokamak; princeton beta experiment- modification; current drive experiment; international collaboration; x-ray laser studies; spacecraft glow experiment; plasma deposition and etching of thin films; theoretical studies; tokamak modeling; international thermonuclear experimental reactor; engineering department; project planning and safety office; quality assurance and reliability; technology transfer; administrative operations; PPPL patent invention disclosures for (FY89); graduate education: plasma physics; graduate education: plasma science and technology; and Princeton Plasmas Physics Laboratory Reports (FY89).
Princeton University, Plasma Physics Laboratory annual report, October 1, 1988--September 30, 1989
International Nuclear Information System (INIS)
1989-01-01
This report contains discussions on the following topics: principal parameters achieved in experimental devices (FY89); tokamak fusion test reactor; compact ignition tokamak; princeton beta experiment- modification; current drive experiment; international collaboration; x-ray laser studies; spacecraft glow experiment; plasma deposition and etching of thin films; theoretical studies; tokamak modeling; international thermonuclear experimental reactor; engineering department; project planning and safety office; quality assurance and reliability; technology transfer; administrative operations; PPPL patent invention disclosures for (FY89); graduate education: plasma physics; graduate education: plasma science and technology; and Princeton Plasmas Physics Laboratory Reports (FY89)
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
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
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 ...
International Nuclear Information System (INIS)
Knutson, D.
1984-01-01
The Poloidal Divertor Experiment at the Princeton Plasma Physics Laboratory has been recently transformed into the Princeton Beta Experiment. The purpose of the modification is to produce a bean-shaped plasma with beta values in excess of 10%, which is substantially above those achieved with more conventional plasma shapes. (author)
Shaikh, Sohail F.; Ghoneim, Mohamed T.; Bahabry, Rabab R.; Khan, Sherjeel M.; Hussain, Muhammad Mustafa
2017-01-01
. Here, a generic manufacturable method of converting state-of-the-art complementary metal oxide semiconductor-based ICs into modular Lego-electronics is shown with unique geometry that is physically identifiable to ease manufacturing and enhance
International Nuclear Information System (INIS)
Cruz, B.; Drexler, J.; Olcese, G.; Santome, D.
1990-01-01
The main objective of the modular control system is to provide the requirements to most of the processes supervision and control applications within the industrial automatization area. The design is based on distribution, modulation and expansion concepts. (Author) [es
Duality ensures modular covariance
International Nuclear Information System (INIS)
Li Miao; Yu Ming
1989-11-01
We show that the modular transformations for one point functions on the torus, S(n), satisfy the polynomial equations derived by Moore and Seiberg, provided the duality property of the model is ensured. The formula for S(n) is derived by us previously and should be valid for any conformal field theory. As a consequence, the full consistency conditions for modular invariance at higher genus are completely guaranteed by duality of the theory on the sphere. (orig.)
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.
Flato, J. B.
2007-01-01
Princeton Applied Research Corporation (PAR) was a small electronic instrument company in early 1960s but once they entered electrochemistry they were very successful. Since then they have developed and designed successful instruments with their tremendous knowledge and have made great contribution to the field of analytical chemistry.
Princeton Plasma Physics Laboratory: Annual report, October 1, 1986--September 30, 1987
International Nuclear Information System (INIS)
1987-01-01
This report contains papers on the following topics: Principle Parameters Achieved in Experimental Devices (FY87); Tokamak Fusion Test Reactor; Princeton Beta Experiment-Modification; S-1 Spheromak; Current-Drive Experiment; X-Ray Laser Studies; Theoretical Division; Tokamak Modeling; Compact Ignition Tokamak; Engineering Department; Project Planning and Safety Office; Quality Assurance and Reliability; Administrative Operations; and PPPL Patent Invention Disclosures (FY87)
After $74-Million and Counting, Frank Gehry's Library Opens at Princeton
Carlson, Scott
2008-01-01
In putting up its new, Frank Gehry-designed Lewis Library, Princeton University endured its share of challenges. It constructed models of the building to give the subcontractors a chance to practice. It fired a contractor halfway through the job when the building was past due. It learned that some subcontractors were trying to bribe their way onto…
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\
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...
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.
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.
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
Benchmarking Measures of Network Controllability on Canonical Graph Models
Wu-Yan, Elena; Betzel, Richard F.; Tang, Evelyn; Gu, Shi; Pasqualetti, Fabio; Bassett, Danielle S.
2018-03-01
The control of networked dynamical systems opens the possibility for new discoveries and therapies in systems biology and neuroscience. Recent theoretical advances provide candidate mechanisms by which a system can be driven from one pre-specified state to another, and computational approaches provide tools to test those mechanisms in real-world systems. Despite already having been applied to study network systems in biology and neuroscience, the practical performance of these tools and associated measures on simple networks with pre-specified structure has yet to be assessed. Here, we study the behavior of four control metrics (global, average, modal, and boundary controllability) on eight canonical graphs (including Erdős-Rényi, regular, small-world, random geometric, Barábasi-Albert preferential attachment, and several modular networks) with different edge weighting schemes (Gaussian, power-law, and two nonparametric distributions from brain networks, as examples of real-world systems). We observe that differences in global controllability across graph models are more salient when edge weight distributions are heavy-tailed as opposed to normal. In contrast, differences in average, modal, and boundary controllability across graph models (as well as across nodes in the graph) are more salient when edge weight distributions are less heavy-tailed. Across graph models and edge weighting schemes, average and modal controllability are negatively correlated with one another across nodes; yet, across graph instances, the relation between average and modal controllability can be positive, negative, or nonsignificant. Collectively, these findings demonstrate that controllability statistics (and their relations) differ across graphs with different topologies and that these differences can be muted or accentuated by differences in the edge weight distributions. More generally, our numerical studies motivate future analytical efforts to better understand the mathematical
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
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
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.
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
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.
Modular design in fahion industry
Directory of Open Access Journals (Sweden)
Ying Chen
2018-03-01
Full Text Available "Modular design" is a kind of design mode that not only can made clothing more interesting, makes the wearer can participate in choices, increase the possibility of clothing style .but also can extend the service cycle of clothing. In this "fast fashion" run market, the design idea of modular design can be a breakthrough point, help us find the way to balance the low-carbon and environmentally-friendly need and fashion. The article will combine the existing examples put the modular design summarized into three categories: component modular design and geometric modular design and compounded modular design.
Convergent evolution of modularity in metabolic networks through different community structures
Directory of Open Access Journals (Sweden)
Zhou Wanding
2012-09-01
Full Text Available Abstract Background It has been reported that the modularity of metabolic networks of bacteria is closely related to the variability of their living habitats. However, given the dependency of the modularity score on the community structure, it remains unknown whether organisms achieve certain modularity via similar or different community structures. Results In this work, we studied the relationship between similarities in modularity scores and similarities in community structures of the metabolic networks of 1021 species. Both similarities are then compared against the genetic distances. We revisited the association between modularity and variability of the microbial living environments and extended the analysis to other aspects of their life style such as temperature and oxygen requirements. We also tested both topological and biological intuition of the community structures identified and investigated the extent of their conservation with respect to the taxomony. Conclusions We find that similar modularities are realized by different community structures. We find that such convergent evolution of modularity is closely associated with the number of (distinct enzymes in the organism’s metabolome, a consequence of different life styles of the species. We find that the order of modularity is the same as the order of the number of the enzymes under the classification based on the temperature preference but not on the oxygen requirement. Besides, inspection of modularity-based communities reveals that these communities are graph-theoretically meaningful yet not reflective of specific biological functions. From an evolutionary perspective, we find that the community structures are conserved only at the level of kingdoms. Our results call for more investigation into the interplay between evolution and modularity: how evolution shapes modularity, and how modularity affects evolution (mainly in terms of fitness and evolvability. Further, our results
Convergent evolution of modularity in metabolic networks through different community structures.
Zhou, Wanding; Nakhleh, Luay
2012-09-14
It has been reported that the modularity of metabolic networks of bacteria is closely related to the variability of their living habitats. However, given the dependency of the modularity score on the community structure, it remains unknown whether organisms achieve certain modularity via similar or different community structures. In this work, we studied the relationship between similarities in modularity scores and similarities in community structures of the metabolic networks of 1021 species. Both similarities are then compared against the genetic distances. We revisited the association between modularity and variability of the microbial living environments and extended the analysis to other aspects of their life style such as temperature and oxygen requirements. We also tested both topological and biological intuition of the community structures identified and investigated the extent of their conservation with respect to the taxonomy. We find that similar modularities are realized by different community structures. We find that such convergent evolution of modularity is closely associated with the number of (distinct) enzymes in the organism's metabolome, a consequence of different life styles of the species. We find that the order of modularity is the same as the order of the number of the enzymes under the classification based on the temperature preference but not on the oxygen requirement. Besides, inspection of modularity-based communities reveals that these communities are graph-theoretically meaningful yet not reflective of specific biological functions. From an evolutionary perspective, we find that the community structures are conserved only at the level of kingdoms. Our results call for more investigation into the interplay between evolution and modularity: how evolution shapes modularity, and how modularity affects evolution (mainly in terms of fitness and evolvability). Further, our results call for exploring new measures of modularity and network
Visualizing Dataflow Graphs of Deep Learning Models in TensorFlow.
Wongsuphasawat, Kanit; Smilkov, Daniel; Wexler, James; Wilson, Jimbo; Mane, Dandelion; Fritz, Doug; Krishnan, Dilip; Viegas, Fernanda B; Wattenberg, Martin
2018-01-01
We present a design study of the TensorFlow Graph Visualizer, part of the TensorFlow machine intelligence platform. This tool helps users understand complex machine learning architectures by visualizing their underlying dataflow graphs. The tool works by applying a series of graph transformations that enable standard layout techniques to produce a legible interactive diagram. To declutter the graph, we decouple non-critical nodes from the layout. To provide an overview, we build a clustered graph using the hierarchical structure annotated in the source code. To support exploration of nested structure on demand, we perform edge bundling to enable stable and responsive cluster expansion. Finally, we detect and highlight repeated structures to emphasize a model's modular composition. To demonstrate the utility of the visualizer, we describe example usage scenarios and report user feedback. Overall, users find the visualizer useful for understanding, debugging, and sharing the structures of their models.
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
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...
Rome, J.A.; Harris, J.H.
1984-01-01
A fusion reactor device is provided in which the magnetic fields for plasma confinement in a toroidal configuration is produced by a plurality of symmetrical modular coils arranged to form a symmetric modular torsatron referred to as a symmotron. Each of the identical modular coils is helically deformed and comprise one field period of the torsatron. Helical segments of each coil are connected by means of toroidally directed windbacks which may also provide part of the vertical field required for positioning the plasma. The stray fields of the windback segments may be compensated by toroidal coils. A variety of magnetic confinement flux surface configurations may be produced by proper modulation of the winding pitch of the helical segments of the coils, as in a conventional torsatron, winding the helix on a noncircular cross section and varying the poloidal and radial location of the windbacks and the compensating toroidal ring coils.
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
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.
Criteria for software modularization
Card, David N.; Page, Gerald T.; Mcgarry, Frank E.
1985-01-01
A central issue in programming practice involves determining the appropriate size and information content of a software module. This study attempted to determine the effectiveness of two widely used criteria for software modularization, strength and size, in reducing fault rate and development cost. Data from 453 FORTRAN modules developed by professional programmers were analyzed. The results indicated that module strength is a good criterion with respect to fault rate, whereas arbitrary module size limitations inhibit programmer productivity. This analysis is a first step toward defining empirically based standards for software modularization.
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.
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
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.
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
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.
Edge compression techniques for visualization of dense directed graphs.
Dwyer, Tim; Henry Riche, Nathalie; Marriott, Kim; Mears, Christopher
2013-12-01
We explore the effectiveness of visualizing dense directed graphs by replacing individual edges with edges connected to 'modules'-or groups of nodes-such that the new edges imply aggregate connectivity. We only consider techniques that offer a lossless compression: that is, where the entire graph can still be read from the compressed version. The techniques considered are: a simple grouping of nodes with identical neighbor sets; Modular Decomposition which permits internal structure in modules and allows them to be nested; and Power Graph Analysis which further allows edges to cross module boundaries. These techniques all have the same goal--to compress the set of edges that need to be rendered to fully convey connectivity--but each successive relaxation of the module definition permits fewer edges to be drawn in the rendered graph. Each successive technique also, we hypothesize, requires a higher degree of mental effort to interpret. We test this hypothetical trade-off with two studies involving human participants. For Power Graph Analysis we propose a novel optimal technique based on constraint programming. This enables us to explore the parameter space for the technique more precisely than could be achieved with a heuristic. Although applicable to many domains, we are motivated by--and discuss in particular--the application to software dependency analysis.
Modular High Voltage Power Supply
Energy Technology Data Exchange (ETDEWEB)
Newell, Matthew R. [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
2017-05-18
The goal of this project is to develop a modular high voltage power supply that will meet the needs of safeguards applications and provide a modular plug and play supply for use with standard electronic racks.
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...
Final Report: High Energy Physics Program (HEP), Physics Department, Princeton University
Energy Technology Data Exchange (ETDEWEB)
Callan, Curtis G. [Princeton University; Gubser, Steven S. [Princeton University; Marlow, Daniel R. [Princeton University; McDonald, Kirk T. [Princeton University; Meyers, Peter D. [Princeton University; Olsen, James D. [Princeton University; Smith, Arthur J.S. [Princeton University; Steinhardt, Paul J. [Princeton University; Tully, Christopher G. [Princeton University; Stickland, David P. [Princeton University
2013-04-30
The activities of the Princeton Elementary particles group funded through Department of Energy Grant# DEFG02-91 ER40671 during the period October 1, 1991 through January 31, 2013 are summarized. These activities include experiments performed at Brookhaven National Lab; the CERN Lab in Geneva, Switzerland; Fermilab; KEK in Tsukuba City, Japan; the Stanford Linear Accelerator Center; as well as extensive experimental and the- oretical studies conducted on the campus of Princeton University. Funded senior personnel include: Curtis Callan, Stephen Gubser, Valerie Halyo, Daniel Marlow, Kirk McDonald, Pe- ter Meyers, James Olsen, Pierre Pirou e, Eric Prebys, A.J. Stewart Smith, Frank Shoemaker (deceased), Paul Steinhardt, David Stickland, Christopher Tully, and Liantao Wang.
DEFF Research Database (Denmark)
Lund, Henrik Hautop; Þorsteinsson, Arnar Tumi
2011-01-01
In this paper, we describe the concept of adaptive modular playware, where the playware adapts to the interaction of the individual user. We hypothesize that there are individual differences in user interaction capabilities and styles, and that adaptive playware may adapt to the individual user...
Eastern Arizona Coll., Thatcher.
Eastern Arizona College has developed a modularized system of instruction for five vocational and vocationally related courses--Introduction to Business, Business Mathematics, English, Drafting, and Electronics. Each course is divided into independent segments of instruction and students have open-entry and exit options. This document reviews the…
DEFF Research Database (Denmark)
Winther-Hansen, Casper; Frandsen, Thomas
facilitate co-creation through open platforms and service modularity. Based on data from two pharmaceuticals we explore issues of governance related to the relative openness of platforms and their completeness. Whereas some pharmaceuticals should cater to sophisticated needs of competent users through open...
The Challenges of Modularization.
Brown, Sally; Saunders, Danny
1995-01-01
Discusses the movement towards credit accumulation and transfer in higher education institutions based on experiences at two universities in the United Kingdom, the University of Northumbria and the University of Glamorgan. Modularization, or unitization, and semesterization are considered, and three key areas are addressed: management, student…
DEFF Research Database (Denmark)
Blach, K.
Notatet er på engelsk, idet det er lavet som et oplæg til den internationale standardiseringsorganisations (ISO) arbejde med målkoordinering i byggeriet. Materialet har også været forelagt ekspertgrupperne i CIB W24 og i International Modular Group. Det i notatet præsenterede materiale er blevet...
Ridley, Justin; Bluethmann, Bill
2015-01-01
The Modular Robotic Vehicle, or MRV, completed in 2013, was developed at the Johnson Space Center in order to advance technologies which have applications for future vehicles both in space and on Earth. With seating for two people, MRV is a fully electric vehicle modeled as a "city car", suited for busy urban environments.
International Nuclear Information System (INIS)
Finley, Virginia L.
2004-01-01
This report provides the U.S. Department of Energy (DOE) and the public with information on the level of radioactive and non-radioactive pollutants (if any) that are added to the environment as a result of Princeton Plasma Physics Laboratory's (PPPL) operations. The results of the 2002 and 2003 environmental surveillance and monitoring program for PPPL are presented and discussed. The report also summarizes environmental initiatives, assessments, and programs that were undertaken in 2002 and 2003
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.
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.
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
The National Spherical Tokamak Experiment at the Princeton Plasma Physics Laboratory
International Nuclear Information System (INIS)
1995-12-01
The Department of Energy (DOE) has prepared an Environmental Assessment (EA), DOE/EA-1108, evaluating the environmental effects of the proposed construction and operation of the National Spherical Tokamak Experiment (NSTX) within the existing C-Stellarator (CS) Building at the Princeton Plasma Physics Laboratory, Princeton, New Jersey. The purpose of the NSTX is to investigate the physics of spherically shaped plasmas as an alternative path to conventional tokamaks for development of fusion energy. Fusion energy has the potential to help compensate for dwindling supplies of fossil fuels and the eventual depletion of fissionable uranium used in present-day nuclear reactors. Construction of the NSTX in the CS Building would require the dismantling and removal of the existing unused Princeton Large Torus (PLT) device, part of which would be reused to construct the NSTX. Based on the analyses in the EA, the DOE has determined that the proposed action does not constitute a major federal action significantly affecting the quality of the human environment within the meaning of the National Environmental Policy Act (NEPA) of 1969, 42 U.S.C. 4,321 et seq. The preparation of an Environmental Impact Statement is not required. Thus, the DOE is issuing a FONSI pursuant to the Council on Environmental Quality regulations implementing NEPA (40 CFR Parts 1500--1508) and the DOE NEPA implementing regulations (10 CFR Part 1021)
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…
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
Modularization of Industrial Service Processes
DEFF Research Database (Denmark)
Frandsen, Thomas; Hsuan, Juliana
In this paper we examine how complex service processes can be dealt with through the lenses of modularization strategies. Through an illustrative case study of a manufacturer of industrial equipment for process industries we propose the use of the service modularity function to conceptualize...... and assess the service modularity of service offerings. The measured degree of modularity would allow us to sharpen our understanding of modularity in the context of industrial services, such as the role of standardization and component reuse on architecture flexibility. It would also provide a foundation...
Quantification of complex modular architecture in plants.
Reeb, Catherine; Kaandorp, Jaap; Jansson, Fredrik; Puillandre, Nicolas; Dubuisson, Jean-Yves; Cornette, Raphaël; Jabbour, Florian; Coudert, Yoan; Patiño, Jairo; Flot, Jean-François; Vanderpoorten, Alain
2018-04-01
Morphometrics, the assignment of quantities to biological shapes, is a powerful tool to address taxonomic, evolutionary, functional and developmental questions. We propose a novel method for shape quantification of complex modular architecture in thalloid plants, whose extremely reduced morphologies, combined with the lack of a formal framework for thallus description, have long rendered taxonomic and evolutionary studies extremely challenging. Using graph theory, thalli are described as hierarchical series of nodes and edges, allowing for accurate, homologous and repeatable measurements of widths, lengths and angles. The computer program MorphoSnake was developed to extract the skeleton and contours of a thallus and automatically acquire, at each level of organization, width, length, angle and sinuosity measurements. Through the quantification of leaf architecture in Hymenophyllum ferns (Polypodiopsida) and a fully worked example of integrative taxonomy in the taxonomically challenging thalloid liverwort genus Riccardia, we show that MorphoSnake is applicable to all ramified plants. This new possibility of acquiring large numbers of quantitative traits in plants with complex modular architectures opens new perspectives of applications, from the development of rapid species identification tools to evolutionary analyses of adaptive plasticity. © 2018 The Authors. New Phytologist © 2018 New Phytologist Trust.
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}$.
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...
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
The universal modular platform
International Nuclear Information System (INIS)
North, R.B.
1995-01-01
A new and patented design for offshore wellhead platforms has been developed to meet a 'fast track' requirement for increased offshore production, from field locations not yet identified. The new design uses modular construction to allow for radical changes in the water depth of the final location and assembly line efficiency in fabrication. By utilizing high strength steels and structural support from the well conductors the new design accommodates all planned production requirements on a support structure significantly lighter and less expensive than the conventional design it replaces. Twenty two platforms based on the new design were ready for installation within 18 months of the project start. Installation of the new platforms began in 1992 for drilling support and 1993 for production support. The new design has become the Company standard for all future production platforms. Large saving and construction costs have been realized through its light weight, flexibility in both positioning and water depth, and its modular construction
Energy Technology Data Exchange (ETDEWEB)
Alam, Maksudul M.; Sampathkumaran, Uma
2018-02-20
The present invention relates to a modular chemiresistive sensor. In particular, a modular chemiresistive sensor for hypergolic fuel and oxidizer leak detection, carbon dioxide monitoring and detection of disease biomarkers. The sensor preferably has two gold or platinum electrodes mounted on a silicon substrate where the electrodes are connected to a power source and are separated by a gap of 0.5 to 4.0 .mu.M. A polymer nanowire or carbon nanotube spans the gap between the electrodes and connects the electrodes electrically. The electrodes are further connected to a circuit board having a processor and data storage, where the processor can measure current and voltage values between the electrodes and compare the current and voltage values with current and voltage values stored in the data storage and assigned to particular concentrations of a pre-determined substance such as those listed above or a variety of other substances.
Fast quantum modular exponentiation
International Nuclear Information System (INIS)
Meter, Rodney van; Itoh, Kohei M.
2005-01-01
We present a detailed analysis of the impact on quantum modular exponentiation of architectural features and possible concurrent gate execution. Various arithmetic algorithms are evaluated for execution time, potential concurrency, and space trade-offs. We find that to exponentiate an n-bit number, for storage space 100n (20 times the minimum 5n), we can execute modular exponentiation 200-700 times faster than optimized versions of the basic algorithms, depending on architecture, for n=128. Addition on a neighbor-only architecture is limited to O(n) time, whereas non-neighbor architectures can reach O(log n), demonstrating that physical characteristics of a computing device have an important impact on both real-world running time and asymptotic behavior. Our results will help guide experimental implementations of quantum algorithms and devices
Modular Mobile Application Design
Jim Hahn; Nathaniel Ryckman
2012-01-01
This article describes the development of the Minrva library app for Android phones. The decisions to build a native application with Java and use a modular design are discussed. The application includes five modules: catalog search, in-building navigation, a barcode scanning feature, and up to date notifications of circulating technology availability. A sixth module, Amazon recommendations, that is not included in the version of the app that was released is also discussed. The article also r...
Modular remote radiation monitor
International Nuclear Information System (INIS)
Lacerda, Fabio; Farias, Marcos S.; Aghina, Mauricio A.C.; Oliveira, Mauro V.
2013-01-01
The Modular Remote Radiation Monitor (MRRM) is a novel radiation monitor suitable for monitoring environmental exposure to ionizing radiation. It is a portable compact-size low-power microprocessor-based electronic device which provides its monitoring data to other electronic systems, physically distant from it, by means of an electronic communication channel, which can be wired or wireless according to the requirements of each application. Besides its low-power highly-integrated circuit design, the Modular Remote Radiation Monitor is presented in a modular architecture, which promotes full compliance to the technical requirements of different applications while minimizing cost, size and power consumption. Its communication capability also supports the implementation of a network of multiple radiation monitors connected to a supervisory system, capable of remotely controlling each monitor independently as well as visualizing the radiation levels from all monitors. A prototype of the MRRM, functionally equivalent to the MRA-7027 radiation monitor, was implemented and connected to a wired MODBUS network of MRA-7027 monitors, responsible for monitoring ionizing radiation inside Argonauta reactor room at Instituto de Engenharia Nuclear. Based on the highly positive experimental results obtained, further design is currently underway in order to produce a consumer version of the MRRM. (author)
Directory of Open Access Journals (Sweden)
Javier Valenzuela
2007-06-01
Full Text Available First generation cognitive science has always maintained that the mind/brain is a modular system. This has been especially apparent in linguistics, where the modularity thesis goes largely unquestioned by the linguistic mainstream. Cognitive linguists have long disputed the reality of modular architectures of grammar. Instead of conceiving syntax as a computational system of a relatively small set of formal principles and parameters, cognitive linguists take the notion of grammatical construction to be the basic unit of syntax: syntax is simply our repertoire of form-meaning pairings. On such a view, there is no a-priori reason to believe that semantics and phonology cannot affect syntax. In the present paper, we want to take things a step further and suggest, more generally, that language is not a module of cognition in any strict sense. We present preliminary results from research in progress concerning the effect of music on grammatical constructions. More specifically, our experiment compares reaction times between two grammatical constructions that differ in semantics and intonational curves but share lexical material. Our data so far suggests that subjects take less time reading the construction when the semantic bias and intonation match than in non-matching cases. This, we argue, suggests not only that semantics, phonology and syntax form an information bundle (i.e. a construction in the cognitive linguistic sense, but that perceived similarity of music can influence linguistic cognition.
On sub-modularization and morphological heterogeneity in modular robotics
DEFF Research Database (Denmark)
Lyder, A. H.; Stoy, K.; Garciá, R. F. M.
2012-01-01
Modular robots are a kind of robots built from mechatronic modules, which can be assembled in many different ways allowing the modular robot to assume a wide range of morphologies and functions. An important question in modular robotics is to which degree modules should be heterogeneous....... In this paper we introduce two contributing factors to heterogeneity namely morphological heterogeneity and sub-functional modularization. Respectively, the ideas are to create modules with significantly different morphologies and to spread sub-functionality across modules. Based on these principles we design...... and implement the Thor robot and evaluate it by participating in the ICRA Planetary Robotic Contingency Challenge. The Thor robot demonstrates that sub-functional modularity and morphological heterogeneity may increase the versatility of modular robots while reducing the complexity of individual modules, which...
[Modular enteral nutrition in pediatrics].
Murillo Sanchís, S; Prenafeta Ferré, M T; Sempere Luque, M D
1991-01-01
Modular Enteral Nutrition may be a substitute for Parenteral Nutrition in children with different pathologies. Study of 4 children with different pathologies selected from a group of 40 admitted to the Maternal-Childrens Hospital "Valle de Hebrón" in Barcelona, who received modular enteral nutrition. They were monitored on a daily basis by the Dietician Service. Modular enteral nutrition consists of modules of proteins, peptides, lipids, glucids and mineral salts-vitamins. 1.--Craneo-encephalic traumatisms with loss of consciousness, Feeding with a combination of parenteral nutrition and modular enteral nutrition for 7 days. In view of the tolerance and good results of the modular enteral nutrition, the parenteral nutrition was suspended and modular enteral nutrition alone used up to a total of 43 days. 2.--55% burns with 36 days of hyperproteic modular enteral nutrition together with normal feeding. A more rapid recovery was achieved with an increase in total proteins and albumin. 3.--Persistent diarrhoea with 31 days of modular enteral nutrition, 5 days on parenteral nutrition alone and 8 days on combined parenteral nutrition and modular enteral nutrition. In view of the tolerance and good results of the modular enteral nutrition, the parenteral nutrition was suspended. 4.--Mucoviscidosis with a total of 19 days on modular enteral nutrition, 12 of which were exclusively on modular enteral nutrition and 7 as a night supplement to normal feeding. We administered proteic intakes of up to 20% of the total calorific intake and in concentrations of up to 1.2 calories/ml of the final preparation, always with a good tolerance. Modular enteral nutrition can and should be used as a substitute for parenteral nutrition in children with different pathologies, thus preventing the complications inherent in parenteral nutrition.
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...
Modular structure of functional networks in olfactory memory.
Meunier, David; Fonlupt, Pierre; Saive, Anne-Lise; Plailly, Jane; Ravel, Nadine; Royet, Jean-Pierre
2014-07-15
Graph theory enables the study of systems by describing those systems as a set of nodes and edges. Graph theory has been widely applied to characterize the overall structure of data sets in the social, technological, and biological sciences, including neuroscience. Modular structure decomposition enables the definition of sub-networks whose components are gathered in the same module and work together closely, while working weakly with components from other modules. This processing is of interest for studying memory, a cognitive process that is widely distributed. We propose a new method to identify modular structure in task-related functional magnetic resonance imaging (fMRI) networks. The modular structure was obtained directly from correlation coefficients and thus retained information about both signs and weights. The method was applied to functional data acquired during a yes-no odor recognition memory task performed by young and elderly adults. Four response categories were explored: correct (Hit) and incorrect (False alarm, FA) recognition and correct and incorrect rejection. We extracted time series data for 36 areas as a function of response categories and age groups and calculated condition-based weighted correlation matrices. Overall, condition-based modular partitions were more homogeneous in young than elderly subjects. Using partition similarity-based statistics and a posteriori statistical analyses, we demonstrated that several areas, including the hippocampus, caudate nucleus, and anterior cingulate gyrus, belonged to the same module more frequently during Hit than during all other conditions. Modularity values were negatively correlated with memory scores in the Hit condition and positively correlated with bias scores (liberal/conservative attitude) in the Hit and FA conditions. We further demonstrated that the proportion of positive and negative links between areas of different modules (i.e., the proportion of correlated and anti-correlated areas
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
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.
Princeton Plasma Physics Laboratory (PPPL) annual site environmental report for calendar year 1993
International Nuclear Information System (INIS)
Finley, V.L.; Wiezcorek, M.A.
1995-01-01
This report gives the results of the environmental activities and monitoring programs at the Princeton Plasma Physics Laboratory (PPPL) for CY93. The report is prepared to provide the U.S. Department of Energy (DOE) and the public with information on the level of radioactive and non-radioactive pollutants, if any, added to the environment as a result of PPPL operations, as well as environmental initiatives, assessments, and programs that were undertaken in 1993. The objective of the Annual Site Environmental Report is to document evidence that DOE facility environmental protection programs adequately protect the environment and the public health. The Princeton Plasma Physics Laboratory has engaged in fusion energy research since 1951. The long-range goal of the U.S. Magnetic Fusion Energy Research Program is to develop and demonstrate the practical application of fusion power as an alternate energy source. In 1993, PPPL had both of its two large tokamak devices in operation; the Tokamak Fusion Test Reactor (TFTR) and the Princeton Beta Experiment-Modification (PBX-M). PBX-M completed its modifications and upgrades and resumed operation in November 1991. TFTR began the deuterium-tritium (D-T) experiments in December 1993 and set new records by producing over six million watts of energy. The engineering design phase of the Tokamak Physics Experiment (TPX), which replaced the cancelled Burning Plasma Experiment in 1992 as PPPL's next machine, began in 1993 with the planned start up set for the year 2001. In 1993, the Environmental Assessment (EA) for the TFRR Shutdown and Removal (S ampersand R) and TPX was prepared for submittal to the regulatory agencies
Princeton Plasma Physics Laboratory (PPPL) annual site environmental report for calendar year 1994
International Nuclear Information System (INIS)
Finley, V.L.; Wieczorek, M.A.
1996-02-01
This report gives the results of the environmental activities and monitoring programs at the Princeton Plasma Physics Laboratory (PPPL) for CY94. The report is prepared to provide the US Department of Energy (DOE) and the public with information on the level of radioactive and nonradioactive pollutants, if any, added to the environment as a result of PPPL operations, as well as environmental initiatives, assessments, and programs that were undertaken in 1994. The objective of the Annual Site Environmental Report is to document evidence that PPPL's environmental protection programs adequately protect the environment and the public health. The Princeton Plasma Physics Laboratory has engaged in fusion energy research since 195 1. The long-range goal of the US Magnetic Fusion Energy Research Program is to develop and demonstrate the practical application of fusion power as an alternate energy source. In 1994, PPPL had one of its two large tokamak devices in operation-the Tokamak Fusion Test Reactor (TFTR). The Princeton Beta Experiment-Modification or PBX-M completed its modifications and upgrades and resumed operation in November 1991 and operated periodically during 1992 and 1993; it did not operate in 1994 for funding reasons. In December 1993, TFTR began conducting the deuterium-tritium (D-T) experiments and set new records by producing over ten at sign on watts of energy in 1994. The engineering design phase of the Tokamak Physics Experiment (T?X), which replaced the cancelled Burning Plasma Experiment in 1992 as PPPL's next machine, began in 1993 with the planned start up set for the year 2001. In December 1994, the Environmental Assessment (EA) for the TFTR Shutdown and Removal (S ampersand R) and TPX was submitted to the regulatory agencies, and a finding of no significant impact (FONSI) was issued by DOE for these projects
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.
Princeton Plasma Physics Laboratory (PPPL) annual site environmental report for calendar year 1991
Energy Technology Data Exchange (ETDEWEB)
Finley, V.L.; Stencel, J.R.
1992-11-01
This report gives the results of the environmental activities and monitoring programs at the Princeton Plasma Physics Laboratory (PPPL) for CY91. The report is prepared to provide the US Department of Energy (DOE) and the public with information on the level of radioactive and nonradioactive pollutants, if any, added to the environment as a result of PPPL operations, as well as environmental initiatives, assessments, and programs. The objective of the Annual Site Environmental Report is to document evidence that DOE facility environmental protection programs adequately protect the environment and the public health.
Princeton Plasma Physics Laboratory (PPPL) annual site environmental report for Calendar Year 1992
Energy Technology Data Exchange (ETDEWEB)
Finley, V.L.; Wieczorek, M.A.
1994-03-01
This report gives the results of the environmental activities and monitoring programs at the Princeton Plasma Physics Laboratory (PPPL) for CY92. The report is prepared to provide the US Department of Energy (DOE) and the public with information on the level of radioactive and nonradioactive pollutants, if any, added to the environment as a result of PPPL operations, as well as environmental initiatives, assessments, and programs. The objective of the Annual Site Environmental Report is to document evidence that DOE facility environmental protection programs adequately protect the environment and the public health.
Princeton Plasma Physics Laboratory (PPPL) annual site environmental report for Calendar Year 1992
International Nuclear Information System (INIS)
Finley, V.L.; Wieczorek, M.A.
1994-03-01
This report gives the results of the environmental activities and monitoring programs at the Princeton Plasma Physics Laboratory (PPPL) for CY92. The report is prepared to provide the US Department of Energy (DOE) and the public with information on the level of radioactive and nonradioactive pollutants, if any, added to the environment as a result of PPPL operations, as well as environmental initiatives, assessments, and programs. The objective of the Annual Site Environmental Report is to document evidence that DOE facility environmental protection programs adequately protect the environment and the public health
Princeton Plasma Physics Laboratory Annual Site Environmental Report for Calendar Year 1998
Energy Technology Data Exchange (ETDEWEB)
V. Finley
2000-03-06
The results of the 1998 environmental surveillance and monitoring program for the Princeton Plasma Physics Laboratory (PPPL) are presented and discussed. The purpose of this report is to provide the US Department of Energy and the public with information on the level of radioactive and non-radioactive pollutants, if any, that are added to the environment as a result of PPPL's operations. The report also summarizes environmental initiatives, assessments, and programs that were undertaken in 1998. One significant initiative is the Integrated Safety Management (ISM) program that embraces environment, safety, and health principles as one.
Princeton Plasma Physics Laboratory (PPPL) annual site environmental report for calendar year 1991
International Nuclear Information System (INIS)
Finley, V.L.; Stencel, J.R.
1992-11-01
This report gives the results of the environmental activities and monitoring programs at the Princeton Plasma Physics Laboratory (PPPL) for CY91. The report is prepared to provide the US Department of Energy (DOE) and the public with information on the level of radioactive and nonradioactive pollutants, if any, added to the environment as a result of PPPL operations, as well as environmental initiatives, assessments, and programs. The objective of the Annual Site Environmental Report is to document evidence that DOE facility environmental protection programs adequately protect the environment and the public health
Evaluation of an LED Retrofit Project at Princeton University's Carl Icahn Laboratory
Energy Technology Data Exchange (ETDEWEB)
Davis, Robert [Pacific Northwest National Lab. (PNNL), Richland, WA (United States); Murphy, Arthur [Princeton Univ., NJ (United States); Perrin, Tess [Pacific Northwest National Lab. (PNNL), Richland, WA (United States)
2015-11-01
At Princeton University’s Carl Icahn Laboratory, DOE’s Commercial Buildings Integration Program documented the implementation of LED retrofit products for recessed troffers, linear cove lighting, and downlights – as part of Princeton’s first building-wide interior LED project. The conversion to LED enables more extensive use of lighting controls to tailor the lighting to the task and limit the operating hours based on occupancy, and the estimated energy savings including controls is 62% compared to the incumbent system.
Deuterium implantation in first wall candidate materials by exposure in the Princeton large torus
Energy Technology Data Exchange (ETDEWEB)
Chang, J.; Tobin, A. (Grumman Aerospace Corp., Bethpage, NY (USA). Research and Development Center); Manos, D. (Princeton Univ., NJ (USA). Plasma Physics Lab.)
Titanium alloys are of interest as a first wall material in fusion reactors because of their excellent thermophysical and thermomechanical properties. A major concern with their application to the first wall is associated with the known affinity of titanium for hydrogen and the related consequences for fuel recycling, tritium inventory, and hydrogen embrittlement. Little information exists on trapping and release of hydrogen isotopes implanted at energies below 500 eV. This work was undertaken to measure hydrogen isotope trapping and release at the first wall of the Princeton Large Torus Tokamak (PLT).
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.
Modular organization and hospital performance.
Kuntz, Ludwig; Vera, Antonio
2007-02-01
The concept of modularization represents a modern form of organization, which contains the vertical disaggregation of the firm and the use of market mechanisms within hierarchies. The objective of this paper is to examine whether the use of modular structures has a positive effect on hospital performance. The empirical section makes use of multiple regression analyses and leads to the main result that modularization does not have a positive effect on hospital performance. However, the analysis also finds out positive efficiency effects of two central ideas of modularization, namely process orientation and internal market mechanisms.
Modular analysis of biological networks.
Kaltenbach, Hans-Michael; Stelling, Jörg
2012-01-01
The analysis of complex biological networks has traditionally relied on decomposition into smaller, semi-autonomous units such as individual signaling pathways. With the increased scope of systems biology (models), rational approaches to modularization have become an important topic. With increasing acceptance of de facto modularity in biology, widely different definitions of what constitutes a module have sparked controversies. Here, we therefore review prominent classes of modular approaches based on formal network representations. Despite some promising research directions, several important theoretical challenges remain open on the way to formal, function-centered modular decompositions for dynamic biological networks.
Robotic hand with modular extensions
Salisbury, Curt Michael; Quigley, Morgan
2015-01-20
A robotic device is described herein. The robotic device includes a frame that comprises a plurality of receiving regions that are configured to receive a respective plurality of modular robotic extensions. The modular robotic extensions are removably attachable to the frame at the respective receiving regions by way of respective mechanical fuses. Each mechanical fuse is configured to trip when a respective modular robotic extension experiences a predefined load condition, such that the respective modular robotic extension detaches from the frame when the load condition is met.
On an edge partition and root graphs of some classes of line graphs
Directory of Open Access Journals (Sweden)
K Pravas
2017-04-01
Full Text Available The Gallai and the anti-Gallai graphs of a graph $G$ are complementary pairs of spanning subgraphs of the line graph of $G$. In this paper we find some structural relations between these graph classes by finding a partition of the edge set of the line graph of a graph $G$ into the edge sets of the Gallai and anti-Gallai graphs of $G$. Based on this, an optimal algorithm to find the root graph of a line graph is obtained. Moreover, root graphs of diameter-maximal, distance-hereditary, Ptolemaic and chordal graphs are also discussed.
Disrupted modular organization of primary sensory brain areas in schizophrenia
Directory of Open Access Journals (Sweden)
Cécile Bordier
Full Text Available Abnormal brain resting-state functional connectivity has been consistently observed in patients affected by schizophrenia (SCZ using functional MRI and other neuroimaging techniques. Graph theoretical methods provide a framework to investigate these defective functional interactions and their effects on the organization of brain connectivity networks. A few studies have shown altered distribution of connectivity within and between functional modules in SCZ patients, an indication of imbalanced functional segregation ad integration. However, no major alterations of modular organization have been reported in patients, and unambiguous identification of the neural substrates affected remains elusive. Recently, it has been demonstrated that current modularity analysis methods suffer from a fundamental and severe resolution limit, as they fail to detect features that are smaller than a scale determined by the size of the entire connectivity network. This resolution limit is likely to have hampered the ability to resolve differences between patients and controls in previous studies. Here, we apply Surprise, a novel resolution limit-free approach, to study the modular organization of resting state functional connectivity networks in a large cohort of SCZ patients and in matched healthy controls. Leveraging these important methodological advances we find new evidence of substantial fragmentation and reorganization involving primary sensory, auditory and visual areas in SCZ patients. Conversely, frontal and prefrontal areas, typically associated with higher cognitive functions, appear to be largely unaffected, with changes selectively involving language and speech processing areas. Our findings support the hypothesis that cognitive dysfunction in SCZ may involve deficits occurring already at early stages of sensory processing. Keywords: Schizophrenia, Surprise, Asymptotical surprise, Functional connectivity, Community detection, Modularity, Graph theory
Hsu, Charles; Viazanko, Michael; O'Looney, Jimmy; Szu, Harold
2009-04-01
Modularity Biometric System (MBS) is an approach to support AiTR of the cooperated and/or non-cooperated standoff biometric in an area persistent surveillance. Advanced active and passive EOIR and RF sensor suite is not considered here. Neither will we consider the ROC, PD vs. FAR, versus the standoff POT in this paper. Our goal is to catch the "most wanted (MW)" two dozens, separately furthermore ad hoc woman MW class from man MW class, given their archrivals sparse front face data basis, by means of various new instantaneous input called probing faces. We present an advanced algorithm: mini-Max classifier, a sparse sample realization of Cramer-Rao Fisher bound of the Maximum Likelihood classifier that minimize the dispersions among the same woman classes and maximize the separation among different man-woman classes, based on the simple feature space of MIT Petland eigen-faces. The original aspect consists of a modular structured design approach at the system-level with multi-level architectures, multiple computing paradigms, and adaptable/evolvable techniques to allow for achieving a scalable structure in terms of biometric algorithms, identification quality, sensors, database complexity, database integration, and component heterogenity. MBS consist of a number of biometric technologies including fingerprints, vein maps, voice and face recognitions with innovative DSP algorithm, and their hardware implementations such as using Field Programmable Gate arrays (FPGAs). Biometric technologies and the composed modularity biometric system are significant for governmental agencies, enterprises, banks and all other organizations to protect people or control access to critical resources.
International Nuclear Information System (INIS)
Millegan, D.R.; Nixon, K.V.
1982-01-01
Nuclear safeguards requires sensitive, easily operated instruments for rapid inspection of personnel and vehicles to ensure that no uranium or plutonium is being diverted. Two portable gamma-ray detection systems have been developed. The Modular Gamma System (MGS) is very sensitive and two or more systems can be connected for even better performance. The multiunit configuration can be deployed by motor vehicle for search of large areas too extensive to search on foot. The Programmable Rate Monitor (PRM) is less sensitive but much smaller and therefore is more suitable for search of vehicles, personnel, or smaller areas. The PRM is programmable, which implements measurement and alarm algorithms for individual applications
Emotion, Modularity and Rationalaction
Martínez Manrique, Fernando; Universidad de Granada
2009-01-01
Contemporary theories of emotion view it as related to rational action. This paper begins stating two ways in which a system could be deemed rational, which I call the contributive and constitutive way. I assess the possibility whether emotion can be rational in both ways, as a system capable of producing rational action by itself. To this end I analyze the modular view of emotion, especially in a version of dual-system theory. I will argue that this view has at least two problems –the proble...
Modular Mobile Application Design
Directory of Open Access Journals (Sweden)
Jim Hahn
2012-10-01
Full Text Available This article describes the development of the Minrva library app for Android phones. The decisions to build a native application with Java and use a modular design are discussed. The application includes five modules: catalog search, in-building navigation, a barcode scanning feature, and up to date notifications of circulating technology availability. A sixth module, Amazon recommendations, that is not included in the version of the app that was released is also discussed. The article also reports on the findings of two rounds of usability testing and the plans for future development of the app.
Energy Technology Data Exchange (ETDEWEB)
Inoue, T; Kanazawa, T
1979-03-19
In order to shorten the construction period of powerstations, to reduce the number of specialists at site and to prevent technical breakdowns, it was proposed that considerable parts of the powerstation should be assembled on a floating platform and then be towed to site by water, where they are set on foundations and then connected. It is now proposed that the necessary additional equipment (such as water supply plant, storage plant, Diesel generator and service buildings etc.) should be assembled on a second platform, and also transported by water on this. This modular construction will also reduce costs.
Modular Biometric Monitoring System
Chmiel, Alan J. (Inventor); Humphreys, Bradley T. (Inventor)
2017-01-01
A modular system for acquiring biometric data includes a plurality of data acquisition modules configured to sample biometric data from at least one respective input channel at a data acquisition rate. A representation of the sampled biometric data is stored in memory of each of the plurality of data acquisition modules. A central control system is in communication with each of the plurality of data acquisition modules through a bus. The central control system is configured to control communication of data, via the bus, with each of the plurality of data acquisition modules.
The planar cubic Cayley graphs
Georgakopoulos, Agelos
2018-01-01
The author obtains a complete description of the planar cubic Cayley graphs, providing an explicit presentation and embedding for each of them. This turns out to be a rich class, comprising several infinite families. He obtains counterexamples to conjectures of Mohar, Bonnington and Watkins. The author's analysis makes the involved graphs accessible to computation, corroborating a conjecture of Droms.
Groupies in random bipartite graphs
Yilun Shang
2010-01-01
A vertex $v$ of a graph $G$ is called a groupie if its degree is notless than the average of the degrees of its neighbors. In thispaper we study the influence of bipartition $(B_1,B_2)$ on groupiesin random bipartite graphs $G(B_1,B_2,p)$ with both fixed $p$ and$p$ tending to zero.
Nested Dynamic Condition Response Graphs
DEFF Research Database (Denmark)
Hildebrandt, Thomas; Mukkamala, Raghava Rao; Slaats, Tijs
2012-01-01
We present an extension of the recently introduced declarative process model Dynamic Condition Response Graphs ( DCR Graphs) to allow nested subgraphs and a new milestone relation between events. The extension was developed during a case study carried out jointly with our industrial partner...
Bell inequalities for graph states
International Nuclear Information System (INIS)
Toth, G.; Hyllus, P.; Briegel, H.J.; Guehne, O.
2005-01-01
Full text: In the last years graph states have attracted an increasing interest in the field of quantum information theory. Graph states form a family of multi-qubit states which comprises many popular states such as the GHZ states and the cluster states. They also play an important role in applications. For instance, measurement based quantum computation uses graph states as resources. From a theoretical point of view, it is remarkable that graph states allow for a simple description in terms of stabilizing operators. In this contribution, we investigate the non-local properties of graph states. We derive a family of Bell inequalities which require three measurement settings for each party and are maximally violated by graph states. In turn, any graph state violates at least one of the inequalities. We show that for certain types of graph states the violation of these inequalities increases exponentially with the number of qubits. We also discuss connections to other entanglement properties such as the positively of the partial transpose or the geometric measure of entanglement. (author)
Graph Sampling for Covariance Estimation
Chepuri, Sundeep Prabhakar; Leus, Geert
2017-01-01
specialize for undirected circulant graphs in that the graph nodes leading to the best compression rates are given by the so-called minimal sparse rulers. A near-optimal greedy algorithm is developed to design the subsampling scheme for the non
Network reconstruction via graph blending
Estrada, Rolando
2016-05-01
Graphs estimated from empirical data are often noisy and incomplete due to the difficulty of faithfully observing all the components (nodes and edges) of the true graph. This problem is particularly acute for large networks where the number of components may far exceed available surveillance capabilities. Errors in the observed graph can render subsequent analyses invalid, so it is vital to develop robust methods that can minimize these observational errors. Errors in the observed graph may include missing and spurious components, as well fused (multiple nodes are merged into one) and split (a single node is misinterpreted as many) nodes. Traditional graph reconstruction methods are only able to identify missing or spurious components (primarily edges, and to a lesser degree nodes), so we developed a novel graph blending framework that allows us to cast the full estimation problem as a simple edge addition/deletion problem. Armed with this framework, we systematically investigate the viability of various topological graph features, such as the degree distribution or the clustering coefficients, and existing graph reconstruction methods for tackling the full estimation problem. Our experimental results suggest that incorporating any topological feature as a source of information actually hinders reconstruction accuracy. We provide a theoretical analysis of this phenomenon and suggest several avenues for improving this estimation problem.
A cluster algorithm for graphs
S. van Dongen
2000-01-01
textabstractA cluster algorithm for graphs called the emph{Markov Cluster algorithm (MCL~algorithm) is introduced. The algorithm provides basically an interface to an algebraic process defined on stochastic matrices, called the MCL~process. The graphs may be both weighted (with nonnegative weight)
Planar graphs theory and algorithms
Nishizeki, T
1988-01-01
Collected in this volume are most of the important theorems and algorithms currently known for planar graphs, together with constructive proofs for the theorems. Many of the algorithms are written in Pidgin PASCAL, and are the best-known ones; the complexities are linear or 0(nlogn). The first two chapters provide the foundations of graph theoretic notions and algorithmic techniques. The remaining chapters discuss the topics of planarity testing, embedding, drawing, vertex- or edge-coloring, maximum independence set, subgraph listing, planar separator theorem, Hamiltonian cycles, and single- or multicommodity flows. Suitable for a course on algorithms, graph theory, or planar graphs, the volume will also be useful for computer scientists and graph theorists at the research level. An extensive reference section is included.
Quantum chaos on discrete graphs
International Nuclear Information System (INIS)
Smilansky, Uzy
2007-01-01
Adapting a method developed for the study of quantum chaos on quantum (metric) graphs (Kottos and Smilansky 1997 Phys. Rev. Lett. 79 4794, Kottos and Smilansky 1999 Ann. Phys., NY 274 76), spectral ζ functions and trace formulae for discrete Laplacians on graphs are derived. This is achieved by expressing the spectral secular equation in terms of the periodic orbits of the graph and obtaining functions which belong to the class of ζ functions proposed originally by Ihara (1966 J. Mat. Soc. Japan 18 219) and expanded by subsequent authors (Stark and Terras 1996 Adv. Math. 121 124, Kotani and Sunada 2000 J. Math. Sci. Univ. Tokyo 7 7). Finally, a model of 'classical dynamics' on the discrete graph is proposed. It is analogous to the corresponding classical dynamics derived for quantum graphs (Kottos and Smilansky 1997 Phys. Rev. Lett. 79 4794, Kottos and Smilansky 1999 Ann. Phys., NY 274 76). (fast track communication)
RJSplot: Interactive Graphs with R.
Barrios, David; Prieto, Carlos
2018-03-01
Data visualization techniques provide new methods for the generation of interactive graphs. These graphs allow a better exploration and interpretation of data but their creation requires advanced knowledge of graphical libraries. Recent packages have enabled the integration of interactive graphs in R. However, R provides limited graphical packages that allow the generation of interactive graphs for computational biology applications. The present project has joined the analytical power of R with the interactive graphical features of JavaScript in a new R package (RJSplot). It enables the easy generation of interactive graphs in R, provides new visualization capabilities, and contributes to the advance of computational biology analytical methods. At present, 16 interactive graphics are available in RJSplot, such as the genome viewer, Manhattan plots, 3D plots, heatmaps, dendrograms, networks, and so on. The RJSplot package is freely available online at http://rjsplot.net. © 2018 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim.
On characterizing terrain visibility graphs
Directory of Open Access Journals (Sweden)
William Evans
2015-06-01
Full Text Available A terrain is an $x$-monotone polygonal line in the $xy$-plane. Two vertices of a terrain are mutually visible if and only if there is no terrain vertex on or above the open line segment connecting them. A graph whose vertices represent terrain vertices and whose edges represent mutually visible pairs of terrain vertices is called a terrain visibility graph. We would like to find properties that are both necessary and sufficient for a graph to be a terrain visibility graph; that is, we would like to characterize terrain visibility graphs.Abello et al. [Discrete and Computational Geometry, 14(3:331--358, 1995] showed that all terrain visibility graphs are “persistent”. They showed that the visibility information of a terrain point set implies some ordering requirements on the slopes of the lines connecting pairs of points in any realization, and as a step towards showing sufficiency, they proved that for any persistent graph $M$ there is a total order on the slopes of the (pseudo lines in a generalized configuration of points whose visibility graph is $M$.We give a much simpler proof of this result by establishing an orientation to every triple of vertices, reflecting some slope ordering requirements that are consistent with $M$ being the visibility graph, and prove that these requirements form a partial order. We give a faster algorithm to construct a total order on the slopes. Our approach attempts to clarify the implications of the graph theoretic properties on the ordering of the slopes, and may be interpreted as defining properties on an underlying oriented matroid that we show is a restricted type of $3$-signotope.
Borroni-Bird, Christopher E. (Inventor); Vitale, Robert L. (Inventor); Lee, Chunhao J. (Inventor); Ambrose, Robert O. (Inventor); Bluethmann, William J. (Inventor); Junkin, Lucien Q. (Inventor); Lutz, Jonathan J. (Inventor); Guo, Raymond (Inventor); Lapp, Anthony Joseph (Inventor); Ridley, Justin S. (Inventor)
2015-01-01
A modular robotic vehicle includes a chassis, driver input devices, an energy storage system (ESS), a power electronics module (PEM), modular electronic assemblies (eModules) connected to the ESS via the PEM, one or more master controllers, and various embedded controllers. Each eModule includes a drive wheel containing a propulsion-braking module, and a housing containing propulsion and braking control assemblies with respective embedded propulsion and brake controllers, and a mounting bracket covering a steering control assembly with embedded steering controllers. The master controller, which is in communication with each eModule and with the driver input devices, communicates with and independently controls each eModule, by-wire, via the embedded controllers to establish a desired operating mode. Modes may include a two-wheel, four-wheel, diamond, and omni-directional steering modes as well as a park mode. A bumper may enable docking with another vehicle, with shared control over the eModules of the vehicles.
Graph embedding with rich information through heterogeneous graph
Sun, Guolei
2017-11-12
Graph embedding, aiming to learn low-dimensional representations for nodes in graphs, has attracted increasing attention due to its critical application including node classification, link prediction and clustering in social network analysis. Most existing algorithms for graph embedding only rely on the topology information and fail to use the copious information in nodes as well as edges. As a result, their performance for many tasks may not be satisfactory. In this thesis, we proposed a novel and general framework for graph embedding with rich text information (GERI) through constructing a heterogeneous network, in which we integrate node and edge content information with graph topology. Specially, we designed a novel biased random walk to explore the constructed heterogeneous network with the notion of flexible neighborhood. Our sampling strategy can compromise between BFS and DFS local search on heterogeneous graph. To further improve our algorithm, we proposed semi-supervised GERI (SGERI), which learns graph embedding in an discriminative manner through heterogeneous network with label information. The efficacy of our method is demonstrated by extensive comparison experiments with 9 baselines over multi-label and multi-class classification on various datasets including Citeseer, Cora, DBLP and Wiki. It shows that GERI improves the Micro-F1 and Macro-F1 of node classification up to 10%, and SGERI improves GERI by 5% in Wiki.
Princeton Plasma Physics Laboratory (PPPL) annual site environmental report for calendar year 1990
Energy Technology Data Exchange (ETDEWEB)
Stencel, J.R.; Finley, V.L.
1991-12-01
This report gives the results of the environmental activities and monitoring programs at the Princeton Plasma Physics Laboratory for CY90. The report is prepared to provide the US Department of Energy (DOE) and the public with information on the level of radioactive and nonradioactive pollutants, if any, added to the environment as a result of PPPL operations, as well as environmental initiatives, assessments, and programs. The objective of the Annual Site Environmental Report is to document evidence that DOE facility environmental protection programs adequately protect the environment and the public health. The PPPL has engaged in fusion energy research since 1951 and in 1990 had one of its two large tokamak devices in operation: namely, the Tokamak Fusion Test Reactor. The Princeton Beta Experiment-Modification is undergoing new modifications and upgrades for future operation. A new machine, the Burning Plasma Experiment -- formerly called the Compact Ignition Tokamak -- is under conceptual design, and it is awaiting the approval of its draft Environmental Assessment report by DOE Headquarters. This report is required under the National Environmental Policy Act. The long-range goal of the US Magnetic Fusion Energy Research Program is to develop and demonstrate the practical application of fusion power as an alternate energy source. 59 refs., 39 figs., 45 tabs.
Implementation of a computer-controlled monitoring system at the Princeton AVF Cyclotron
International Nuclear Information System (INIS)
Moore, W.H.
1984-01-01
Stability in the parameters of the beams from cyclotrons is often crucial to the experiments laboratories perform. For example, when running a high-resolution experiment with Princeton's QDDD Spectrograph, there are 42 magnetic elements between the ion source and the detector. Instability or drift in any of these elements can easily nullify the sophisticated dispersion matching and kinematic correction that make such experiments possible with machines. At the Princeton Cyclotron they have purchased a commercial computer-controlled measurement system and interfaced it to 20 elements of their beamline. While this project is still far from complete, the authors have satisfied two of the conditions that must be met for such a system to be useful. These are, firstly, that measurements can be made under the conditions of a working laboratory to 1 part in 100,000, and secondly that the results can be presented in a form useful both to the experimenter concerned with the quality of his data and to the technical staff who must maintain and develop the equipment
Evaluation of an LED Retrofit Project at Princeton University’s Carl Icahn Laboratory
Energy Technology Data Exchange (ETDEWEB)
Davis, Robert G. [Pacific Northwest National Lab. (PNNL), Richland, WA (United States); Murphy, Arthur L. [Princeton Univ., NJ (United States); Perrin, Tess E. [Pacific Northwest National Lab. (PNNL), Richland, WA (United States)
2015-11-25
The LED lighting retrofit at the Carl Icahn Laboratory of the Lewis-Sigler Institute for Integrative Genomics was the first building-wide interior LED project at Princeton University, following the University’s experiences from several years of exterior and small-scale interior LED implementation projects. The project addressed three luminaire types – recessed 2x2 troffers, cove and other luminaires using linear T8 fluorescent lamps, and CFL downlights - which combined accounted for over 564,000 kWh of annual energy, over 90% of the lighting energy used in the facility. The Princeton Facilities Engineering staff used a thorough process of evaluating product alternatives before selecting an acceptable LED retrofit solution for each luminaire type. Overall, 815 2x2 luminaires, 550 linear fluorescent luminaires, and 240 downlights were converted to LED as part of this project. Based solely on the reductions in wattage in converting from the incumbent fluorescent lamps to LED retrofit kits, the annual energy savings from the project was over 190,000 kWh, a savings of 37%. An additional 125,000 kWh of energy savings is expected from the implementation of occupancy and task-tuning control solutions, which will bring the total savings for the project to 62%.
CORECLUSTER: A Degeneracy Based Graph Clustering Framework
Giatsidis , Christos; Malliaros , Fragkiskos; Thilikos , Dimitrios M. ,; Vazirgiannis , Michalis
2014-01-01
International audience; Graph clustering or community detection constitutes an important task forinvestigating the internal structure of graphs, with a plethora of applications in several domains. Traditional tools for graph clustering, such asspectral methods, typically suffer from high time and space complexity. In thisarticle, we present \\textsc{CoreCluster}, an efficient graph clusteringframework based on the concept of graph degeneracy, that can be used along withany known graph clusteri...
Fable: Socially Interactive Modular Robot
DEFF Research Database (Denmark)
Magnússon, Arnþór; Pacheco, Moises; Moghadam, Mikael
2013-01-01
Modular robots have a significant potential as user-reconfigurable robotic playware, but often lack sufficient sensing for social interaction. We address this issue with the Fable modular robotic system by exploring the use of smart sensor modules that has a better ability to sense the behavior...
Modular Engineering of Production Plants
DEFF Research Database (Denmark)
Miller, Thomas Dedenroth
1998-01-01
Based on a case-study on design of pharmaceutical production plants, this paper suggests that modularity may support business efficiency for companies with one-of-a-kind production and without in-house manufacturing. Modularity may support efficient management of design knowledge and may facilitate...
Semantic graphs and associative memories
Pomi, Andrés; Mizraji, Eduardo
2004-12-01
Graphs have been increasingly utilized in the characterization of complex networks from diverse origins, including different kinds of semantic networks. Human memories are associative and are known to support complex semantic nets; these nets are represented by graphs. However, it is not known how the brain can sustain these semantic graphs. The vision of cognitive brain activities, shown by modern functional imaging techniques, assigns renewed value to classical distributed associative memory models. Here we show that these neural network models, also known as correlation matrix memories, naturally support a graph representation of the stored semantic structure. We demonstrate that the adjacency matrix of this graph of associations is just the memory coded with the standard basis of the concept vector space, and that the spectrum of the graph is a code invariant of the memory. As long as the assumptions of the model remain valid this result provides a practical method to predict and modify the evolution of the cognitive dynamics. Also, it could provide us with a way to comprehend how individual brains that map the external reality, almost surely with different particular vector representations, are nevertheless able to communicate and share a common knowledge of the world. We finish presenting adaptive association graphs, an extension of the model that makes use of the tensor product, which provides a solution to the known problem of branching in semantic nets.
Thate, Robert
2012-01-01
The modular flooring system (MFS) was developed to provide a portable, modular, durable carpeting solution for NASA fs Robotics Alliance Project fs (RAP) outreach efforts. It was also designed to improve and replace a modular flooring system that was too heavy for safe use and transportation. The MFS was developed for use as the flooring for various robotics competitions that RAP utilizes to meet its mission goals. One of these competitions, the FIRST Robotics Competition (FRC), currently uses two massive rolls of broadloom carpet for the foundation of the arena in which the robots are contained during the competition. The area of the arena is approximately 30 by 72 ft (approximately 9 by 22 m). This carpet is very cumbersome and requires large-capacity vehicles, and handling equipment and personnel to transport and deploy. The broadloom carpet sustains severe abuse from the robots during a regular three-day competition, and as a result, the carpet is not used again for competition. Similarly, broadloom carpets used for trade shows at convention centers around the world are typically discarded after only one use. This innovation provides a green solution to this wasteful practice. Each of the flooring modules in the previous system weighed 44 lb (.20 kg). The improvements in the overall design of the system reduce the weight of each module by approximately 22 lb (.10 kg) (50 %), and utilize an improved "module-to-module" connection method that is superior to the previous system. The MFS comprises 4-by-4-ft (.1.2-by- 1.2-m) carpet module assemblies that utilize commercially available carpet tiles that are bonded to a lightweight substrate. The substrate surface opposite from the carpeted surface has a module-to-module connecting interface that allows for the modules to be connected, one to the other, as the modules are constructed. This connection is hidden underneath the modules, creating a smooth, co-planar flooring surface. The modules are stacked and strapped
XML Graphs in Program Analysis
DEFF Research Database (Denmark)
Møller, Anders; Schwartzbach, Michael I.
2011-01-01
of XML graphs against different XML schema languages, and provide a software package that enables others to make use of these ideas. We also survey the use of XML graphs for program analysis with four very different languages: XACT (XML in Java), Java Servlets (Web application programming), XSugar......XML graphs have shown to be a simple and effective formalism for representing sets of XML documents in program analysis. It has evolved through a six year period with variants tailored for a range of applications. We present a unified definition, outline the key properties including validation...
Rabern, Landon
2007-01-01
We improve upper bounds on the chromatic number proven independently in \\cite{reedNote} and \\cite{ingo}. Our main lemma gives a sufficient condition for two paths in graph to be completely joined. Using this, we prove that if a graph has an optimal coloring with more than $\\frac{\\omega}{2}$ singleton color classes, then it satisfies $\\chi \\leq \\frac{\\omega + \\Delta + 1}{2}$. It follows that a graph satisfying $n - \\Delta < \\alpha + \\frac{\\omega - 1}{2}$ must also satisfy $\\chi \\leq \\frac{\\ome...
Graphs with Eulerian unit spheres
Knill, Oliver
2015-01-01
d-spheres in graph theory are inductively defined as graphs for which all unit spheres S(x) are (d-1)-spheres and that the removal of one vertex renders the graph contractible. Eulerian d-spheres are geometric d-spheres which are d+1 colorable. We prove here that G is an Eulerian sphere if and only if the degrees of all the (d-2)-dimensional sub-simplices in G are even. This generalizes a Kempe-Heawood result for d=2 and is work related to the conjecture that all d-spheres have chromatic numb...
International Nuclear Information System (INIS)
McAskie, M.J.
1991-01-01
The CANDU 3 Heavy Water Reactor is the newest design developed by AECL CANDU. It has set as a major objective, the achievement of significant reductions in both cost and schedule over previous designs. The basic construction strategy is to incorporate extensive modularization of the plant in order to parallel the civil and mechanical installation works. This results in a target 38 month construction schedule from first concrete to in-service compared to 68 months for the Wolsong-1 CANDU 6 actually achieved and the 54 months envisaged for an improved CANDU 6. This paper describes the module concepts that have been developed and explains how they contribute to the overall construction program and achieve the desired cost and schedule targets set for the CANDU 3. (author). 7 figs, 2 tabs
Szabó, György; Fáth, Gábor
2007-07-01
Game theory is one of the key paradigms behind many scientific disciplines from biology to behavioral sciences to economics. In its evolutionary form and especially when the interacting agents are linked in a specific social network the underlying solution concepts and methods are very similar to those applied in non-equilibrium statistical physics. This review gives a tutorial-type overview of the field for physicists. The first four sections introduce the necessary background in classical and evolutionary game theory from the basic definitions to the most important results. The fifth section surveys the topological complications implied by non-mean-field-type social network structures in general. The next three sections discuss in detail the dynamic behavior of three prominent classes of models: the Prisoner's Dilemma, the Rock-Scissors-Paper game, and Competing Associations. The major theme of the review is in what sense and how the graph structure of interactions can modify and enrich the picture of long term behavioral patterns emerging in evolutionary games.
Princeton Plasma Physics Laboratory Annual Site Environmental Report for Calendar Year 1999
International Nuclear Information System (INIS)
Finley, Virginia
2001-01-01
The results of the 1999 environmental surveillance and monitoring program for the Princeton Plasma Physics Laboratory (PPPL) are presented and discussed. The purpose of this report is to provide the U.S. Department of Energy and the public with information on the level of radioactive and non-radioactive pollutants (if any) that are added to the environment as a result of PPPL's operations. The report also summarizes environmental initiatives, assessments, and programs that were undertaken in 1999. The Princeton Plasma Physics Laboratory has engaged in fusion energy research since 1951. The long-range goal of the U.S. Magnetic Fusion Energy Research Program is to create innovations to make fusion power a practical reality--an alternative energy source. 1999 marked the first year of National Spherical Torus Experiment (NSTX) operations and Tokamak Fusion Test Reactor (TFTR) dismantlement and deconstruction activities. A collaboration among fourteen national laboratories, universities, and research institutions, the NSTX is a major element in the U.S. Fusion Energy Sciences Program. It has been designed to test the physics principles of spherical torus (ST) plasmas. The ST concept could play an important role in the development of smaller, more economical fusion reactors. With its completion within budget and ahead of its target schedule, NSTX first plasma occurred on February 12, 1999. The 1999 performance of the Princeton Plasma Physics Laboratory was rated ''outstanding'' by the U.S. Department of Energy in the Laboratory Appraisal report issued early in 2000. The report cited the Laboratory's consistently excellent scientific and technological achievements, its successful management practices, and included high marks in a host of other areas including environmental management, employee health and safety, human resources administration, science education, and communications. Groundwater investigations continued under a voluntary agreement with the New Jersey
Princeton Plasma Physics Laboratory Annual Site Environmental Report for Calendar Year 1999
Energy Technology Data Exchange (ETDEWEB)
Virginia Finley
2001-04-20
The results of the 1999 environmental surveillance and monitoring program for the Princeton Plasma Physics Laboratory (PPPL) are presented and discussed. The purpose of this report is to provide the U.S. Department of Energy and the public with information on the level of radioactive and non-radioactive pollutants (if any) that are added to the environment as a result of PPPL's operations. The report also summarizes environmental initiatives, assessments, and programs that were undertaken in 1999. The Princeton Plasma Physics Laboratory has engaged in fusion energy research since 1951. The long-range goal of the U.S. Magnetic Fusion Energy Research Program is to create innovations to make fusion power a practical reality--an alternative energy source. 1999 marked the first year of National Spherical Torus Experiment (NSTX) operations and Tokamak Fusion Test Reactor (TFTR) dismantlement and deconstruction activities. A collaboration among fourteen national laboratories, universities, and research institutions, the NSTX is a major element in the U.S. Fusion Energy Sciences Program. It has been designed to test the physics principles of spherical torus (ST) plasmas. The ST concept could play an important role in the development of smaller, more economical fusion reactors. With its completion within budget and ahead of its target schedule, NSTX first plasma occurred on February 12, 1999. The 1999 performance of the Princeton Plasma Physics Laboratory was rated ''outstanding'' by the U.S. Department of Energy in the Laboratory Appraisal report issued early in 2000. The report cited the Laboratory's consistently excellent scientific and technological achievements, its successful management practices, and included high marks in a host of other areas including environmental management, employee health and safety, human resources administration, science education, and communications. Groundwater investigations continued under a voluntary
Properly colored connectivity of graphs
Li, Xueliang; Qin, Zhongmei
2018-01-01
A comprehensive survey of proper connection of graphs is discussed in this book with real world applications in computer science and network security. Beginning with a brief introduction, comprising relevant definitions and preliminary results, this book moves on to consider a variety of properties of graphs that imply bounds on the proper connection number. Detailed proofs of significant advancements toward open problems and conjectures are presented with complete references. Researchers and graduate students with an interest in graph connectivity and colorings will find this book useful as it builds upon fundamental definitions towards modern innovations, strategies, and techniques. The detailed presentation lends to use as an introduction to proper connection of graphs for new and advanced researchers, a solid book for a graduate level topics course, or as a reference for those interested in expanding and further developing research in the area.
Graph anomalies in cyber communications
Energy Technology Data Exchange (ETDEWEB)
Vander Wiel, Scott A [Los Alamos National Laboratory; Storlie, Curtis B [Los Alamos National Laboratory; Sandine, Gary [Los Alamos National Laboratory; Hagberg, Aric A [Los Alamos National Laboratory; Fisk, Michael [Los Alamos National Laboratory
2011-01-11
Enterprises monitor cyber traffic for viruses, intruders and stolen information. Detection methods look for known signatures of malicious traffic or search for anomalies with respect to a nominal reference model. Traditional anomaly detection focuses on aggregate traffic at central nodes or on user-level monitoring. More recently, however, traffic is being viewed more holistically as a dynamic communication graph. Attention to the graph nature of the traffic has expanded the types of anomalies that are being sought. We give an overview of several cyber data streams collected at Los Alamos National Laboratory and discuss current work in modeling the graph dynamics of traffic over the network. We consider global properties and local properties within the communication graph. A method for monitoring relative entropy on multiple correlated properties is discussed in detail.
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.
Woeginger, G.J.
1998-01-01
In this short note we argue that the toughness of split graphs can be computed in polynomial time. This solves an open problem from a recent paper by Kratsch et al. (Discrete Math. 150 (1996) 231–245).
Generating random networks and graphs
Coolen, Ton; Roberts, Ekaterina
2017-01-01
This book supports researchers who need to generate random networks, or who are interested in the theoretical study of random graphs. The coverage includes exponential random graphs (where the targeted probability of each network appearing in the ensemble is specified), growth algorithms (i.e. preferential attachment and the stub-joining configuration model), special constructions (e.g. geometric graphs and Watts Strogatz models) and graphs on structured spaces (e.g. multiplex networks). The presentation aims to be a complete starting point, including details of both theory and implementation, as well as discussions of the main strengths and weaknesses of each approach. It includes extensive references for readers wishing to go further. The material is carefully structured to be accessible to researchers from all disciplines while also containing rigorous mathematical analysis (largely based on the techniques of statistical mechanics) to support those wishing to further develop or implement the theory of rand...
Modular reconfigurable machines incorporating modular open architecture control
CSIR Research Space (South Africa)
Padayachee, J
2008-01-01
Full Text Available degrees of freedom on a single platform. A corresponding modular Open Architecture Control (OAC) system is presented. OAC overcomes the inflexibility of fixed proprietary automation, ensuring that MRMs provide the reconfigurability and extensibility...
Modular robotics for playful physiotherapy
DEFF Research Database (Denmark)
Lund, Henrik Hautop
2009-01-01
We developed modular robotic tiles to be used for playful physiotherapy, which is supposed to motivate patients to engage in and perform physical rehabilitation exercises. We tested the modular robotic tiles for an extensive period of time (3 years) in daily use in a hospital rehabilitation unit e.......g. for cardiac patients. Also, the tiles were tested for performing physical rehabilitation of stroke patients in their private home. In all pilot test cases qualitative feedback indicate that the patients find the playful use of modular robotic tiles engaging and motivating for them to perform...
Graph theory and its applications
Gross, Jonathan L
2006-01-01
Gross and Yellen take a comprehensive approach to graph theory that integrates careful exposition of classical developments with emerging methods, models, and practical needs. Their unparalleled treatment provides a text ideal for a two-semester course and a variety of one-semester classes, from an introductory one-semester course to courses slanted toward classical graph theory, operations research, data structures and algorithms, or algebra and topology.
Overview of the program on soft x-ray lasers and their applications at Princeton
International Nuclear Information System (INIS)
Suckewer, S.; Ilcisin, K.; Princeton Univ., NJ
1991-05-01
In the last several years, rapid progress in the development of soft x-ray lasers (SXL) has been observed at a number of laboratories worldwide. Although SXLs are very ''young'' devices they have already been used for microscopy and holography, and new ideas emerging for broader application of SXLs to microscopy, holography and lithography. This paper describes the work at Princeton University on the development of a soft x-ray imaging transmission microscopy using a SXL as a radiation source and work on the development of a novel soft x-ray reflection microscope and its application to biological cell studies and lithography. Progress in the development of a photopumped VUV laser (60 nm), and programs for the development of a small scale SXL and for the application of a powerful subpicosecond KrF laser system are also discussed. 35 refs., 9 figs., 1 tab
Time of use metering : the experience of Princeton Light and Power
International Nuclear Information System (INIS)
Hall, J.
2004-01-01
Princeton Light and Power (PLP) provides power distribution services to 7,000 customers in the Similkameen Valley in British Columbia. This PowerPoint presentation described how the utility has implemented time-of-use (TOU) rates and metering. The drivers for TOU that are most often overlooked include: the cost of additional power generation, deferral of system upgrades, improving system load factor, system reliability, controlling rate increase, growing sales, and offering choices to the customer. It was noted that unbundled rates are required for a successful TOU program. PLP's rate design and billing formula were presented along with its plan to make it worthwhile for the customers to install load shifting equipment such as delay timers, thermal storage heating units, and powerline carrier signal equipment. A review of peak hour operation and off-peak hour operation was also presented. tabs., figs
Princeton Plasma Physics Laboratory annual report, October 1, 1991--September 30, 1992
Energy Technology Data Exchange (ETDEWEB)
1992-12-31
This report discusses the following topics: Principal parameters achieved in experimental devices for fiscal year 1992; tokamak fusion test reactor; princeton beta experiment-modification; current drive experiment-upgrade; tokamak physics experiment/steady-state advanced tokamak; international thermonuclear experimental reactor; international collaboration; x-ray laser studies; plasma processing: Deposition and etching of thin films; pure electron plasma experiments; theoretical studies; tokamak modeling; high-field magnet project; engineering department; environment, safety, and health and quality assurance; technology transfer; office of human resources and administration; PPPL invention disclosures for fiscal year 1992; office of resource management; graduate education: plasma physics; graduate education: program in plasma science and technology; and science education program.
Princeton Plasma Physics Laboratory annual report, October 1, 1991--September 30, 1992
International Nuclear Information System (INIS)
1992-01-01
This report discusses the following topics: Principal parameters achieved in experimental devices for fiscal year 1992; tokamak fusion test reactor; princeton beta experiment-modification; current drive experiment-upgrade; tokamak physics experiment/steady-state advanced tokamak; international thermonuclear experimental reactor; international collaboration; x-ray laser studies; plasma processing: Deposition and etching of thin films; pure electron plasma experiments; theoretical studies; tokamak modeling; high-field magnet project; engineering department; environment, safety, and health and quality assurance; technology transfer; office of human resources and administration; PPPL invention disclosures for fiscal year 1992; office of resource management; graduate education: plasma physics; graduate education: program in plasma science and technology; and science education program
FY93 Princeton Plasma Physics Laboratory. Annual report, October 1, 1992--September 30, 1993
Energy Technology Data Exchange (ETDEWEB)
1995-02-01
This is the annual report from the Princeton Plasma Physics Laboratory for the period October 1, 1992 to September 30, 1993. The report describes work done on TFTR during the year, as well as preparatory to beginning of D-T operations. Design work is ongoing on the Tokamak Physics Experiment (TPX) which is to test very long pulse operations of tokamak type devices. PBX has come back on line with additional ion-Bernstein power and lower-hybrid current drive. The theoretical program is also described, as well as other small scale programs, and the growing effort in collaboration on international design projects on ITER and future collaborations at a larger scale.
FY93 Princeton Plasma Physics Laboratory. Annual report, October 1, 1992--September 30, 1993
International Nuclear Information System (INIS)
1995-01-01
This is the annual report from the Princeton Plasma Physics Laboratory for the period October 1, 1992 to September 30, 1993. The report describes work done on TFTR during the year, as well as preparatory to beginning of D-T operations. Design work is ongoing on the Tokamak Physics Experiment (TPX) which is to test very long pulse operations of tokamak type devices. PBX has come back on line with additional ion-Bernstein power and lower-hybrid current drive. The theoretical program is also described, as well as other small scale programs, and the growing effort in collaboration on international design projects on ITER and future collaborations at a larger scale
A faithful functor among algebras and graphs
Falcón Ganfornina, Óscar Jesús; Falcón Ganfornina, Raúl Manuel; Núñez Valdés, Juan; Pacheco Martínez, Ana María; Villar Liñán, María Trinidad; Vigo Aguiar, Jesús (Coordinador)
2016-01-01
The problem of identifying a functor between the categories of algebras and graphs is currently open. Based on a known algorithm that identifies isomorphisms of Latin squares with isomorphism of vertex-colored graphs, we describe here a pair of graphs that enable us to find a faithful functor between finite-dimensional algebras over finite fields and these graphs.
Graphs with branchwidth at most three
Bodlaender, H.L.; Thilikos, D.M.
1997-01-01
In this paper we investigate both the structure of graphs with branchwidth at most three, as well as algorithms to recognise such graphs. We show that a graph has branchwidth at most three, if and only if it has treewidth at most three and does not contain the three-dimensional binary cube graph
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
Graphs whose complement and square are isomorphic
DEFF Research Database (Denmark)
Pedersen, Anders Sune
2014-01-01
We study square-complementary graphs, that is, graphs whose complement and square are isomorphic. We prove several necessary conditions for a graph to be square-complementary, describe ways of building new square-complementary graphs from existing ones, construct infinite families of square-compl...
Acyclicity in edge-colored graphs
DEFF Research Database (Denmark)
Gutin, Gregory; Jones, Mark; Sheng, Bin
2017-01-01
A walk W in edge-colored graphs is called properly colored (PC) if every pair of consecutive edges in W is of different color. We introduce and study five types of PC acyclicity in edge-colored graphs such that graphs of PC acyclicity of type i is a proper superset of graphs of acyclicity of type...
Building Scalable Knowledge Graphs for Earth Science
Ramachandran, Rahul; Maskey, Manil; Gatlin, Patrick; Zhang, Jia; Duan, Xiaoyi; Miller, J. J.; Bugbee, Kaylin; Christopher, Sundar; Freitag, Brian
2017-01-01
Knowledge Graphs link key entities in a specific domain with other entities via relationships. From these relationships, researchers can query knowledge graphs for probabilistic recommendations to infer new knowledge. Scientific papers are an untapped resource which knowledge graphs could leverage to accelerate research discovery. Goal: Develop an end-to-end (semi) automated methodology for constructing Knowledge Graphs for Earth Science.
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
Constructing Dense Graphs with Unique Hamiltonian Cycles
Lynch, Mark A. M.
2012-01-01
It is not difficult to construct dense graphs containing Hamiltonian cycles, but it is difficult to generate dense graphs that are guaranteed to contain a unique Hamiltonian cycle. This article presents an algorithm for generating arbitrarily large simple graphs containing "unique" Hamiltonian cycles. These graphs can be turned into dense graphs…
Skew-adjacency matrices of graphs
Cavers, M.; Cioaba, S.M.; Fallat, S.; Gregory, D.A.; Haemers, W.H.; Kirkland, S.J.; McDonald, J.J.; Tsatsomeros, M.
2012-01-01
The spectra of the skew-adjacency matrices of a graph are considered as a possible way to distinguish adjacency cospectral graphs. This leads to the following topics: graphs whose skew-adjacency matrices are all cospectral; relations between the matchings polynomial of a graph and the characteristic
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.
Commuting graphs of matrix algebras
International Nuclear Information System (INIS)
Akbari, S.; Bidkhori, H.; Mohammadian, A.
2006-08-01
The commuting graph of a ring R, denoted by Γ(R), is a graph whose vertices are all non- central elements of R and two distinct vertices x and y are adjacent if and only if xy = yx. The commuting graph of a group G, denoted by Γ(G), is similarly defined. In this paper we investigate some graph theoretic properties of Γ(M n (F)), where F is a field and n ≥ 2. Also we study the commuting graphs of some classical groups such as GL n (F) and SL n (F). We show that Γ(M n (F)) is a connected graph if and only if every field extension of F of degree n contains a proper intermediate field. We prove that apart from finitely many fields, a similar result is true for Γ(GL n (F)) and Γ(SL n (F)). Also we show that for two fields E and F and integers m, n ≥> 2, if Γ(M m (E)) ≅ Γ(M n (F)), then m = n and vertical bar E vertical bar = vertical bar F vertical bar. (author)
Princeton Plasma Physics Laboratory Annual Site Environmental Report for Calendar Year 1996
International Nuclear Information System (INIS)
J.D. Levine; V.L. Finley
1998-01-01
The results of the 1996 environmental surveillance and monitoring program for the Princeton Plasma Physics Laboratory (PPPL) are presented and discussed. The purpose of this report is to provide the US Department of Energy and the public with information on the level of radioactive and nonradioactive pollutants, if any, that are added to the environment as a result of PPPL's operations. During Calendar Year 1996, PPPL's Tokamak Fusion Test Reactor (TFTR) continued to conduct fusion experiments. Having set a world record on November 2, 1994, by achieving approximately 10.7 million watts of controlled fusion power during the deuterium-tritium (D-T) plasma experiments, researchers turned their attention to studying plasma science experiments, which included ''enhanced reverse shear techniques.'' Since November 1993, more than 700 tritium-fueled experiments were conducted, which generated more than 4 x 10(superscript 20) neutrons and 1.4 gigajoules of fusion energy. In 1996, the overall performance of Princeton Plasma Physics Laboratory was rated ''excellent'' by the US Department of Energy in the Laboratory Appraisal report issued in early 1997. The report cited the Laboratory's consistently excellent scientific and technological achievements and its successful management practices, which included high marks for environmental management, employee health and safety, human resources administration, science education, and communications. Groundwater investigations continued under a voluntary agreement with the New Jersey Department of Environmental Protection. PPPL monitored for the presence of nonradiological contaminants, mainly volatile organic compounds (components of degreasing solvents) and petroleum hydrocarbons (past leaks of releases of diesel fuel from underground storage tanks). Also, PPPL's radiological monitoring program characterized the ambient, background levels of tritium in the environment and from the TFTR stack; the data are presented in this report
Graph Quasicontinuous Functions and Densely Continuous Forms
Directory of Open Access Journals (Sweden)
Lubica Hola
2017-07-01
Full Text Available Let $X, Y$ be topological spaces. A function $f: X \\to Y$ is said to be graph quasicontinuous if there is a quasicontinuous function $g: X \\to Y$ with the graph of $g$ contained in the closure of the graph of $f$. There is a close relation between the notions of graph quasicontinuous functions and minimal usco maps as well as the notions of graph quasicontinuous functions and densely continuous forms. Every function with values in a compact Hausdorff space is graph quasicontinuous; more generally every locally compact function is graph quasicontinuous.
Habidite: viviendas modulares industrializadas
Directory of Open Access Journals (Sweden)
Gómez Jáuregui, V.
2009-03-01
Full Text Available This paper is an introduction to one of the most relevant constructive systems of the last years: The integral industrialized construction. This method, based on three-dimensional modules, produces buildings made mainly from spatial cells of big dimensions; these three-dimensional modules are fabricated entirely in factory and, once they are finished, they are carried out to the site, where they are assembled in an easy manner. Even though it’s not a totally new system (in fact, the precedents will also be mentioned in this essay, Habidite is very confident in backing this tendency and doing its part in order to obtain modular reinforced concrete buildings of extraordinary quality, with domotic implements totally integrated in the dwellings and a high degree of sustainability, eco-technology and energetic efficiency. Many advantages are exposed and explained, dealing with the optimization of the productive processes in construction by means of the most advanced technologies.En este artículo se realiza una breve introducción a uno de los sistemas constructivos que más auge está teniendo en los últimos años: la edificación industrializada integral. Realizado a base de módulos tridimensionales, es éste un método de construcción en el cual los edificios se conforman básicamente por medio de células espaciales de grandes dimensiones; estos módulos tridimensionales se elaboran íntegramente en fábrica y, una vez están totalmente terminados, se transportan a obra, donde son montados de forma sencilla y rápida. Aunque no es un sistema totalmente novedoso (de hecho sus antecedentes también serán tratados brevemente en este texto, Habidite apuesta fuertemente por esta tendencia y aporta su grano de arena para conseguir edificios modulares de hormigón armado de extraordinaria calidad, con implementos domóticos totalmente integrados en la vivienda y un alto grado de sostenibilidad, eco-tecnología y eficiencia energética. Se abordan
Environmental versatility promotes modularity in genome-scale metabolic networks.
Samal, Areejit; Wagner, Andreas; Martin, Olivier C
2011-08-24
The ubiquity of modules in biological networks may result from an evolutionary benefit of a modular organization. For instance, modularity may increase the rate of adaptive evolution, because modules can be easily combined into new arrangements that may benefit their carrier. Conversely, modularity may emerge as a by-product of some trait. We here ask whether this last scenario may play a role in genome-scale metabolic networks that need to sustain life in one or more chemical environments. For such networks, we define a network module as a maximal set of reactions that are fully coupled, i.e., whose fluxes can only vary in fixed proportions. This definition overcomes limitations of purely graph based analyses of metabolism by exploiting the functional links between reactions. We call a metabolic network viable in a given chemical environment if it can synthesize all of an organism's biomass compounds from nutrients in this environment. An organism's metabolism is highly versatile if it can sustain life in many different chemical environments. We here ask whether versatility affects the modularity of metabolic networks. Using recently developed techniques to randomly sample large numbers of viable metabolic networks from a vast space of metabolic networks, we use flux balance analysis to study in silico metabolic networks that differ in their versatility. We find that highly versatile networks are also highly modular. They contain more modules and more reactions that are organized into modules. Most or all reactions in a module are associated with the same biochemical pathways. Modules that arise in highly versatile networks generally involve reactions that process nutrients or closely related chemicals. We also observe that the metabolism of E. coli is significantly more modular than even our most versatile networks. Our work shows that modularity in metabolic networks can be a by-product of functional constraints, e.g., the need to sustain life in multiple
Environmental versatility promotes modularity in genome-scale metabolic networks
Directory of Open Access Journals (Sweden)
Wagner Andreas
2011-08-01
Full Text Available Abstract Background The ubiquity of modules in biological networks may result from an evolutionary benefit of a modular organization. For instance, modularity may increase the rate of adaptive evolution, because modules can be easily combined into new arrangements that may benefit their carrier. Conversely, modularity may emerge as a by-product of some trait. We here ask whether this last scenario may play a role in genome-scale metabolic networks that need to sustain life in one or more chemical environments. For such networks, we define a network module as a maximal set of reactions that are fully coupled, i.e., whose fluxes can only vary in fixed proportions. This definition overcomes limitations of purely graph based analyses of metabolism by exploiting the functional links between reactions. We call a metabolic network viable in a given chemical environment if it can synthesize all of an organism's biomass compounds from nutrients in this environment. An organism's metabolism is highly versatile if it can sustain life in many different chemical environments. We here ask whether versatility affects the modularity of metabolic networks. Results Using recently developed techniques to randomly sample large numbers of viable metabolic networks from a vast space of metabolic networks, we use flux balance analysis to study in silico metabolic networks that differ in their versatility. We find that highly versatile networks are also highly modular. They contain more modules and more reactions that are organized into modules. Most or all reactions in a module are associated with the same biochemical pathways. Modules that arise in highly versatile networks generally involve reactions that process nutrients or closely related chemicals. We also observe that the metabolism of E. coli is significantly more modular than even our most versatile networks. Conclusions Our work shows that modularity in metabolic networks can be a by-product of functional
The modularity of pollination networks
DEFF Research Database (Denmark)
Olesen, Jens Mogens; Bascompte, J.; Dupont, Yoko
2007-01-01
In natural communities, species and their interactions are often organized as nonrandom networks, showing distinct and repeated complex patterns. A prevalent, but poorly explored pattern is ecological modularity, with weakly interlinked subsets of species (modules), which, however, internally...... consist of strongly connected species. The importance of modularity has been discussed for a long time, but no consensus on its prevalence in ecological networks has yet been reached. Progress is hampered by inadequate methods and a lack of large datasets. We analyzed 51 pollination networks including...... almost 10,000 species and 20,000 links and tested for modularity by using a recently developed simulated annealing algorithm. All networks with >150 plant and pollinator species were modular, whereas networks with
Interactive Graph Layout of a Million Nodes
Peng Mi; Maoyuan Sun; Moeti Masiane; Yong Cao; Chris North
2016-01-01
Sensemaking of large graphs, specifically those with millions of nodes, is a crucial task in many fields. Automatic graph layout algorithms, augmented with real-time human-in-the-loop interaction, can potentially support sensemaking of large graphs. However, designing interactive algorithms to achieve this is challenging. In this paper, we tackle the scalability problem of interactive layout of large graphs, and contribute a new GPU-based force-directed layout algorithm that exploits graph to...
Khovanov homology of graph-links
Energy Technology Data Exchange (ETDEWEB)
Nikonov, Igor M [M. V. Lomonosov Moscow State University, Faculty of Mechanics and Mathematics, Moscow (Russian Federation)
2012-08-31
Graph-links arise as the intersection graphs of turning chord diagrams of links. Speaking informally, graph-links provide a combinatorial description of links up to mutations. Many link invariants can be reformulated in the language of graph-links. Khovanov homology, a well-known and useful knot invariant, is defined for graph-links in this paper (in the case of the ground field of characteristic two). Bibliography: 14 titles.
Verifying large modular systems using iterative abstraction refinement
International Nuclear Information System (INIS)
Lahtinen, Jussi; Kuismin, Tuomas; Heljanko, Keijo
2015-01-01
Digital instrumentation and control (I&C) systems are increasingly used in the nuclear engineering domain. The exhaustive verification of these systems is challenging, and the usual verification methods such as testing and simulation are typically insufficient. Model checking is a formal method that is able to exhaustively analyse the behaviour of a model against a formally written specification. If the model checking tool detects a violation of the specification, it will give out a counter-example that demonstrates how the specification is violated in the system. Unfortunately, sometimes real life system designs are too big to be directly analysed by traditional model checking techniques. We have developed an iterative technique for model checking large modular systems. The technique uses abstraction based over-approximations of the model behaviour, combined with iterative refinement. The main contribution of the work is the concrete abstraction refinement technique based on the modular structure of the model, the dependency graph of the model, and a refinement sampling heuristic similar to delta debugging. The technique is geared towards proving properties, and outperforms BDD-based model checking, the k-induction technique, and the property directed reachability algorithm (PDR) in our experiments. - Highlights: • We have developed an iterative technique for model checking large modular systems. • The technique uses BDD-based model checking, k-induction, and PDR in parallel. • We have tested our algorithm by verifying two models with it. • The technique outperforms classical model checking methods in our experiments
Modularity in protein structures: study on all-alpha proteins.
Khan, Taushif; Ghosh, Indira
2015-01-01
Modularity is known as one of the most important features of protein's robust and efficient design. The architecture and topology of proteins play a vital role by providing necessary robust scaffolds to support organism's growth and survival in constant evolutionary pressure. These complex biomolecules can be represented by several layers of modular architecture, but it is pivotal to understand and explore the smallest biologically relevant structural component. In the present study, we have developed a component-based method, using protein's secondary structures and their arrangements (i.e. patterns) in order to investigate its structural space. Our result on all-alpha protein shows that the known structural space is highly populated with limited set of structural patterns. We have also noticed that these frequently observed structural patterns are present as modules or "building blocks" in large proteins (i.e. higher secondary structure content). From structural descriptor analysis, observed patterns are found to be within similar deviation; however, frequent patterns are found to be distinctly occurring in diverse functions e.g. in enzymatic classes and reactions. In this study, we are introducing a simple approach to explore protein structural space using combinatorial- and graph-based geometry methods, which can be used to describe modularity in protein structures. Moreover, analysis indicates that protein function seems to be the driving force that shapes the known structure space.
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.
Shaikh, Sohail F.
2017-10-24
Electronic system components have thousands of individual field effect transistors (FETs) interconnected executing dedicated functions. Assembly yield of >80% will guarantee system failure since a single interconnect failure will result in undesired performance. Hence, a paradigm shift is needed in the self-assembly or integration of state-of-the-art integrated circuits (ICs) for a physically compliant system. Traditionally, most ICs share same geometry with only variations in dimensions and packaging. Here, a generic manufacturable method of converting state-of-the-art complementary metal oxide semiconductor-based ICs into modular Lego-electronics is shown with unique geometry that is physically identifiable to ease manufacturing and enhance throughput. Various geometries at the backside of the silicon die and on the destination site having the same geometry with relaxed dimension (up to 50 µm extra) allow targeted site binding like DNA assembly. Different geometries, angles, and heights for different modules provide a unique identity to each of the ICs. A two-level geometric combination presented here helps in maintaining the uniqueness of individual module to assemble at exact matching site like a perfect lock-and-key model. The assembled ICs offer uncompromised electrical performance, higher yield, and fabrication ease. In future, this method can further be expanded for fluidic assisted self-assembly.
Modal Analysis of In-Wheel Motor-Driven Electric Vehicle Based on Bond Graph Theory
Directory of Open Access Journals (Sweden)
Di Tan
2017-01-01
Full Text Available A half-car vibration model of an electric vehicle driven by rear in-wheel motors was developed using bond graph theory and the modular modeling method. Based on the bond graph model, modal analysis was carried out to study the vibration characteristics of the electric vehicle. To verify the effectiveness of the established model, the results were compared to ones computed on the ground of modal analysis and Newton equations. The comparison shows that the vibration model of the electric vehicle based on bond graph theory not only is able to better compute the natural frequency but also can easily determine the deformation mode, momentum mode, and other isomorphism modes and describe the dynamic characteristics of an electric vehicle driven by in-wheel motors more comprehensively than other modal analysis methods.
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.
Directory of Open Access Journals (Sweden)
Andreas P. Braun
2016-04-01
Full Text Available Box graphs succinctly and comprehensively characterize singular fibers of elliptic fibrations in codimension two and three, as well as flop transitions connecting these, in terms of representation theoretic data. We develop a framework that provides a systematic map between a box graph and a crepant algebraic resolution of the singular elliptic fibration, thus allowing an explicit construction of the fibers from a singular Weierstrass or Tate model. The key tool is what we call a fiber face diagram, which shows the relevant information of a (partial toric triangulation and allows the inclusion of more general algebraic blowups. We shown that each such diagram defines a sequence of weighted algebraic blowups, thus providing a realization of the fiber defined by the box graph in terms of an explicit resolution. We show this correspondence explicitly for the case of SU(5 by providing a map between box graphs and fiber faces, and thereby a sequence of algebraic resolutions of the Tate model, which realizes each of the box graphs.
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
Integer Flows and Circuit Covers of Graphs and Signed Graphs
Cheng, Jian
The work in Chapter 2 is motivated by Tutte and Jaeger's pioneering work on converting modulo flows into integer-valued flows for ordinary graphs. For a signed graphs (G, sigma), we first prove that for each k ∈ {2, 3}, if (G, sigma) is (k - 1)-edge-connected and contains an even number of negative edges when k = 2, then every modulo k-flow of (G, sigma) can be converted into an integer-valued ( k + 1)-ow with a larger or the same support. We also prove that if (G, sigma) is odd-(2p+1)-edge-connected, then (G, sigma) admits a modulo circular (2 + 1/ p)-flows if and only if it admits an integer-valued circular (2 + 1/p)-flows, which improves all previous result by Xu and Zhang (DM2005), Schubert and Steffen (EJC2015), and Zhu (JCTB2015). Shortest circuit cover conjecture is one of the major open problems in graph theory. It states that every bridgeless graph G contains a set of circuits F such that each edge is contained in at least one member of F and the length of F is at most 7/5∥E(G)∥. This concept was recently generalized to signed graphs by Macajova et al. (JGT2015). In Chapter 3, we improve their upper bound from 11∥E( G)∥ to 14/3 ∥E(G)∥, and if G is 2-edgeconnected and has even negativeness, then it can be further reduced to 11/3 ∥E(G)∥. Tutte's 3-flow conjecture has been studied by many graph theorists in the last several decades. As a new approach to this conjecture, DeVos and Thomassen considered the vectors as ow values and found that there is a close relation between vector S1-flows and integer 3-NZFs. Motivated by their observation, in Chapter 4, we prove that if a graph G admits a vector S1-flow with rank at most two, then G admits an integer 3-NZF. The concept of even factors is highly related to the famous Four Color Theorem. We conclude this dissertation in Chapter 5 with an improvement of a recent result by Chen and Fan (JCTB2016) on the upperbound of even factors. We show that if a graph G contains an even factor, then it
Lectures on Hilbert modular varieties and modular forms
Goren, Eyal Z
2001-01-01
This book is devoted to certain aspects of the theory of p-adic Hilbert modular forms and moduli spaces of abelian varieties with real multiplication. The theory of p-adic modular forms is presented first in the elliptic case, introducing the reader to key ideas of N. M. Katz and J.-P. Serre. It is re-interpreted from a geometric point of view, which is developed to present the rudiments of a similar theory for Hilbert modular forms. The theory of moduli spaces of abelian varieties with real multiplication is presented first very explicitly over the complex numbers. Aspects of the general theory are then exposed, in particular, local deformation theory of abelian varieties in positive characteristic. The arithmetic of p-adic Hilbert modular forms and the geometry of moduli spaces of abelian varieties are related. This relation is used to study q-expansions of Hilbert modular forms, on the one hand, and stratifications of moduli spaces on the other hand. The book is addressed to graduate students and non-exper...
Modular Stirling Radioisotope Generator
Schmitz, Paul C.; Mason, Lee S.; Schifer, Nicholas A.
2016-01-01
High-efficiency radioisotope power generators will play an important role in future NASA space exploration missions. Stirling Radioisotope Generators (SRGs) have been identified as a candidate generator technology capable of providing mission designers with an efficient, high-specific-power electrical generator. SRGs high conversion efficiency has the potential to extend the limited Pu-238 supply when compared with current Radioisotope Thermoelectric Generators (RTGs). Due to budgetary constraints, the Advanced Stirling Radioisotope Generator (ASRG) was canceled in the fall of 2013. Over the past year a joint study by NASA and the Department of Energy (DOE) called the Nuclear Power Assessment Study (NPAS) recommended that Stirling technologies continue to be explored. During the mission studies of the NPAS, spare SRGs were sometimes required to meet mission power system reliability requirements. This led to an additional mass penalty and increased isotope consumption levied on certain SRG-based missions. In an attempt to remove the spare power system, a new generator architecture is considered, which could increase the reliability of a Stirling generator and provide a more fault-tolerant power system. This new generator called the Modular Stirling Radioisotope Generator (MSRG) employs multiple parallel Stirling convertor/controller strings, all of which share the heat from the General Purpose Heat Source (GPHS) modules. For this design, generators utilizing one to eight GPHS modules were analyzed, which provided about 50 to 450 W of direct current (DC) to the spacecraft, respectively. Four Stirling convertors are arranged around each GPHS module resulting in from 4 to 32 Stirling/controller strings. The convertors are balanced either individually or in pairs, and are radiatively coupled to the GPHS modules. Heat is rejected through the housing/radiator, which is similar in construction to the ASRG. Mass and power analysis for these systems indicate that specific
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.
Feder, Tomá s; Motwani, Rajeev
2009-01-01
Results on graph turnpike problem without distinctness, including its NP-completeness, and an O(m+n log n) algorithm, is presented. The usual turnpike problem has all pairwise distances given, but does not specify which pair of vertices w e corresponds to. There are two other problems that can be viewed as special cases of the graph turnpike problem, including the bandwidth problem and the low-distortion graph embedding problem. The aim for the turnpike problem in the NP-complete is to orient the edges with weights w i in either direction so that when the whole cycle is transversed in the real line, it returns to a chosen starting point for the cycle. An instance of the turnpike problem with or without distinctness is uniquely mappable if there exists at most one solution up to translation and choice of orientation.
Feder, Tomás
2009-06-01
Results on graph turnpike problem without distinctness, including its NP-completeness, and an O(m+n log n) algorithm, is presented. The usual turnpike problem has all pairwise distances given, but does not specify which pair of vertices w e corresponds to. There are two other problems that can be viewed as special cases of the graph turnpike problem, including the bandwidth problem and the low-distortion graph embedding problem. The aim for the turnpike problem in the NP-complete is to orient the edges with weights w i in either direction so that when the whole cycle is transversed in the real line, it returns to a chosen starting point for the cycle. An instance of the turnpike problem with or without distinctness is uniquely mappable if there exists at most one solution up to translation and choice of orientation.
Negation switching invariant signed graphs
Directory of Open Access Journals (Sweden)
Deepa Sinha
2014-04-01
Full Text Available A signed graph (or, $sigraph$ in short is a graph G in which each edge x carries a value $\\sigma(x \\in \\{-, +\\}$ called its sign. Given a sigraph S, the negation $\\eta(S$ of the sigraph S is a sigraph obtained from S by reversing the sign of every edge of S. Two sigraphs $S_{1}$ and $S_{2}$ on the same underlying graph are switching equivalent if it is possible to assign signs `+' (`plus' or `-' (`minus' to vertices of $S_{1}$ such that by reversing the sign of each of its edges that has received opposite signs at its ends, one obtains $S_{2}$. In this paper, we characterize sigraphs which are negation switching invariant and also see for what sigraphs, S and $\\eta (S$ are signed isomorphic.
International Nuclear Information System (INIS)
Rosmanis, Ansis
2011-01-01
I introduce a continuous-time quantum walk on graphs called the quantum snake walk, the basis states of which are fixed-length paths (snakes) in the underlying graph. First, I analyze the quantum snake walk on the line, and I show that, even though most states stay localized throughout the evolution, there are specific states that most likely move on the line as wave packets with momentum inversely proportional to the length of the snake. Next, I discuss how an algorithm based on the quantum snake walk might potentially be able to solve an extended version of the glued trees problem, which asks to find a path connecting both roots of the glued trees graph. To the best of my knowledge, no efficient quantum algorithm solving this problem is known yet.
Truong, Cong-Doan; Kwon, Yung-Keun
2017-12-21
Biological networks consisting of molecular components and interactions are represented by a graph model. There have been some studies based on that model to analyze a relationship between structural characteristics and dynamical behaviors in signaling network. However, little attention has been paid to changes of modularity and robustness in mutant networks. In this paper, we investigated the changes of modularity and robustness by edge-removal mutations in three signaling networks. We first observed that both the modularity and robustness increased on average in the mutant network by the edge-removal mutations. However, the modularity change was negatively correlated with the robustness change. This implies that it is unlikely that both the modularity and the robustness values simultaneously increase by the edge-removal mutations. Another interesting finding is that the modularity change was positively correlated with the degree, the number of feedback loops, and the edge betweenness of the removed edges whereas the robustness change was negatively correlated with them. We note that these results were consistently observed in randomly structure networks. Additionally, we identified two groups of genes which are incident to the highly-modularity-increasing and the highly-robustness-decreasing edges with respect to the edge-removal mutations, respectively, and observed that they are likely to be central by forming a connected component of a considerably large size. The gene-ontology enrichment of each of these gene groups was significantly different from the rest of genes. Finally, we showed that the highly-robustness-decreasing edges can be promising edgetic drug-targets, which validates the usefulness of our analysis. Taken together, the analysis of changes of robustness and modularity against edge-removal mutations can be useful to unravel novel dynamical characteristics underlying in signaling networks.
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...
The fascinating world of graph theory
Benjamin, Arthur; Zhang, Ping
2015-01-01
Graph theory goes back several centuries and revolves around the study of graphs-mathematical structures showing relations between objects. With applications in biology, computer science, transportation science, and other areas, graph theory encompasses some of the most beautiful formulas in mathematics-and some of its most famous problems. The Fascinating World of Graph Theory explores the questions and puzzles that have been studied, and often solved, through graph theory. This book looks at graph theory's development and the vibrant individuals responsible for the field's growth. Introducin
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. .
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....
Graph topologies on closed multifunctions
Directory of Open Access Journals (Sweden)
Giuseppe Di Maio
2003-10-01
Full Text Available In this paper we study function space topologies on closed multifunctions, i.e. closed relations on X x Y using various hypertopologies. The hypertopologies are in essence, graph topologies i.e topologies on functions considered as graphs which are subsets of X x Y . We also study several topologies, including one that is derived from the Attouch-Wets filter on the range. We state embedding theorems which enable us to generalize and prove some recent results in the literature with the use of known results in the hyperspace of the range space and in the function space topologies of ordinary functions.
Cyclic graphs and Apery's theorem
International Nuclear Information System (INIS)
Sorokin, V N
2002-01-01
This is a survey of results about the behaviour of Hermite-Pade approximants for graphs of Markov functions, and a survey of interpolation problems leading to Apery's result about the irrationality of the value ζ(3) of the Riemann zeta function. The first example is given of a cyclic graph for which the Hermite-Pade problem leads to Apery's theorem. Explicit formulae for solutions are obtained, namely, Rodrigues' formulae and integral representations. The asymptotic behaviour of the approximants is studied, and recurrence formulae are found
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
Princeton Plasma Physics Laboratory Annual Site Environmental Report for Calendar Year 2000
Energy Technology Data Exchange (ETDEWEB)
Virginia L. Finley
2002-04-22
The results of the 2000 environmental surveillance and monitoring program for the Princeton Plasma Physics Laboratory (PPPL) are presented and discussed. The purpose of this report is to provide the U.S. Department of Energy and the public with information on the level of radioactive and nonradioactive pollutants (if any) that are added to the environment as a result of PPPL's operations. The report also summarizes environmental initiatives, assessments, and programs that were undertaken in 2000. The Princeton Plasma Physics Laboratory has engaged in fusion energy research since 1951. The long-range goal of the U.S. Magnetic Fusion Energy Research Program is to create innovations to make fusion power a practical reality -- an alternative energy source. The year 2000 marked the second year of National Spherical Torus Experiment (NSTX) operations and Tokamak Fusion Test Reactor (TFTR) dismantlement and deconstruction activities. A collaboration among fourteen national laboratories, universities, and research institutions, the NSTX is a major element in the U.S. Fusion Energy Sciences Program. It has been designed to test the physics principles of spherical torus (ST) plasmas. The ST concept could play an important role in the development of smaller, more economical fusion power plants. With its completion within budget and ahead of its target schedule, NSTX first plasma occurred on February 12, 1999. In 2000, PPPL's radiological environmental monitoring program measured tritium in the air at on-site and off-site sampling stations. PPPL is capable of detecting small changes in the ambient levels of tritium by using highly sensitive monitors. The operation of an in-stack monitor located on D-site is a requirement of the National Emission Standard for Hazardous Air Pollutants (NESHAPs) regulations with limits set by the Environmental Protection Agency (EPA). Also included in PPPL's radiological environmental monitoring program, are precipitation, surface
Princeton Plasma Physics Laboratory Annual Site Environmental Report for Calendar Year 1997
Energy Technology Data Exchange (ETDEWEB)
Finley, V.L. and Levine, J.D.
1999-01-10
The results of the 1997 environmental surveillance and monitoring program for the Princeton Plasma Physics Laboratory (PPPL) are presented and discussed. The purpose of this report is to provide the U.S. Department of Energy and the public with information on the level of radioactive and non-radioactive pollutants, if any, that are added to the environment as a result of PPPL's operations. During Calendar Year 1997, PPPL's Tokamak Fusion Test Reactor (TFTR) completed fifteen years of fusion experiments begun in 1982. Over the course of three and half years of deuterium-tritium (D-T) plasma experiments, PPPL set a world record of 10.7 million watts of controlled fusion power, more than 700 tritium shots pulsed into the reactor vessel generating more than 5.6 x 10^{20} neutron and 1.6 gigajoules of fusion energy and researchers studied plasma science experimental data, which included "enhanced reverse shear techniques." As TFTR was completing its historic operations, PPPL participated with the Oak Ridge National Laboratory, Columbia University, and the University of Washington (Seattle) in a collaboration effort to design the National Spherical Torus Experiment (NSTX). This next device, NSTX, is located in the former TFTR Hot Cell on D site, and it is designed to be a smaller and more economical torus fusion reactor. Construction of this device began in late 1997, and first plasma in scheduled for early 1999. For 1997, the U.S. Department of Energy in its Laboratory Appraisal report rated the overall performance of Princeton Plasma Physics Laboratory as "excellent." The report cited the Laboratory's consistently excellent scientific and technological achievements and its successful management practices, which included high marks for environmental management, employee health and safety, human resources administration, science education, and communications. Groundwater investigations continued under a voluntary agreement with the New Jersey
Princeton Plasma Physics Laboratory Annual Site Environmental Report for Calendar Year 1996
Energy Technology Data Exchange (ETDEWEB)
J.D. Levine; V.L. Finley
1998-03-01
The results of the 1996 environmental surveillance and monitoring program for the Princeton Plasma Physics Laboratory (PPPL) are presented and discussed. The purpose of this report is to provide the US Department of Energy and the public with information on the level of radioactive and nonradioactive pollutants, if any, that are added to the environment as a result of PPPL's operations. During Calendar Year 1996, PPPL's Tokamak Fusion Test Reactor (TFTR) continued to conduct fusion experiments. Having set a world record on November 2, 1994, by achieving approximately 10.7 million watts of controlled fusion power during the deuterium-tritium (D-T) plasma experiments, researchers turned their attention to studying plasma science experiments, which included ''enhanced reverse shear techniques.'' Since November 1993, more than 700 tritium-fueled experiments were conducted, which generated more than 4 x 10(superscript 20) neutrons and 1.4 gigajoules of fusion energy. In 1996, the overall performance of Princeton Plasma Physics Laboratory was rated ''excellent'' by the US Department of Energy in the Laboratory Appraisal report issued in early 1997. The report cited the Laboratory's consistently excellent scientific and technological achievements and its successful management practices, which included high marks for environmental management, employee health and safety, human resources administration, science education, and communications. Groundwater investigations continued under a voluntary agreement with the New Jersey Department of Environmental Protection. PPPL monitored for the presence of nonradiological contaminants, mainly volatile organic compounds (components of degreasing solvents) and petroleum hydrocarbons (past leaks of releases of diesel fuel from underground storage tanks). Also, PPPL's radiological monitoring program characterized the ambient, background levels of tritium in the environment and
Princeton Plasma Physics Laboratory Annual Site Environmental Report for Calendar Year 2000
International Nuclear Information System (INIS)
Virginia L. Finley
2002-04-01
The results of the 2000 environmental surveillance and monitoring program for the Princeton Plasma Physics Laboratory (PPPL) are presented and discussed. The purpose of this report is to provide the U.S. Department of Energy and the public with information on the level of radioactive and nonradioactive pollutants (if any) that are added to the environment as a result of PPPL's operations. The report also summarizes environmental initiatives, assessments, and programs that were undertaken in 2000. The Princeton Plasma Physics Laboratory has engaged in fusion energy research since 1951. The long-range goal of the U.S. Magnetic Fusion Energy Research Program is to create innovations to make fusion power a practical reality -- an alternative energy source. The year 2000 marked the second year of National Spherical Torus Experiment (NSTX) operations and Tokamak Fusion Test Reactor (TFTR) dismantlement and deconstruction activities. A collaboration among fourteen national laboratories, universities, and research institutions, the NSTX is a major element in the U.S. Fusion Energy Sciences Program. It has been designed to test the physics principles of spherical torus (ST) plasmas. The ST concept could play an important role in the development of smaller, more economical fusion power plants. With its completion within budget and ahead of its target schedule, NSTX first plasma occurred on February 12, 1999. In 2000, PPPL's radiological environmental monitoring program measured tritium in the air at on-site and off-site sampling stations. PPPL is capable of detecting small changes in the ambient levels of tritium by using highly sensitive monitors. The operation of an in-stack monitor located on D-site is a requirement of the National Emission Standard for Hazardous Air Pollutants (NESHAPs) regulations with limits set by the Environmental Protection Agency (EPA). Also included in PPPL's radiological environmental monitoring program, are precipitation, surface, ground, a nd
Modular Power Standard for Space Explorations Missions
Oeftering, Richard C.; Gardner, Brent G.
2016-01-01
Future human space exploration will most likely be composed of assemblies of multiple modular spacecraft elements with interconnected electrical power systems. An electrical system composed of a standardized set modular building blocks provides significant development, integration, and operational cost advantages. The modular approach can also provide the flexibility to configure power systems to meet the mission needs. A primary goal of the Advanced Exploration Systems (AES) Modular Power System (AMPS) project is to establish a Modular Power Standard that is needed to realize these benefits. This paper is intended to give the space exploration community a "first look" at the evolving Modular Power Standard and invite their comments and technical contributions.
Multiple graph regularized protein domain ranking
Wang, Jim Jing-Yan
2012-11-19
Background: Protein domain ranking is a fundamental task in structural biology. Most protein domain ranking methods rely on the pairwise comparison of protein domains while neglecting the global manifold structure of the protein domain database. Recently, graph regularized ranking that exploits the global structure of the graph defined by the pairwise similarities has been proposed. However, the existing graph regularized ranking methods are very sensitive to the choice of the graph model and parameters, and this remains a difficult problem for most of the protein domain ranking methods.Results: To tackle this problem, we have developed the Multiple Graph regularized Ranking algorithm, MultiG-Rank. Instead of using a single graph to regularize the ranking scores, MultiG-Rank approximates the intrinsic manifold of protein domain distribution by combining multiple initial graphs for the regularization. Graph weights are learned with ranking scores jointly and automatically, by alternately minimizing an objective function in an iterative algorithm. Experimental results on a subset of the ASTRAL SCOP protein domain database demonstrate that MultiG-Rank achieves a better ranking performance than single graph regularized ranking methods and pairwise similarity based ranking methods.Conclusion: The problem of graph model and parameter selection in graph regularized protein domain ranking can be solved effectively by combining multiple graphs. This aspect of generalization introduces a new frontier in applying multiple graphs to solving protein domain ranking applications. 2012 Wang et al; licensee BioMed Central Ltd.
Multiple graph regularized protein domain ranking
Wang, Jim Jing-Yan; Bensmail, Halima; Gao, Xin
2012-01-01
Background: Protein domain ranking is a fundamental task in structural biology. Most protein domain ranking methods rely on the pairwise comparison of protein domains while neglecting the global manifold structure of the protein domain database. Recently, graph regularized ranking that exploits the global structure of the graph defined by the pairwise similarities has been proposed. However, the existing graph regularized ranking methods are very sensitive to the choice of the graph model and parameters, and this remains a difficult problem for most of the protein domain ranking methods.Results: To tackle this problem, we have developed the Multiple Graph regularized Ranking algorithm, MultiG-Rank. Instead of using a single graph to regularize the ranking scores, MultiG-Rank approximates the intrinsic manifold of protein domain distribution by combining multiple initial graphs for the regularization. Graph weights are learned with ranking scores jointly and automatically, by alternately minimizing an objective function in an iterative algorithm. Experimental results on a subset of the ASTRAL SCOP protein domain database demonstrate that MultiG-Rank achieves a better ranking performance than single graph regularized ranking methods and pairwise similarity based ranking methods.Conclusion: The problem of graph model and parameter selection in graph regularized protein domain ranking can be solved effectively by combining multiple graphs. This aspect of generalization introduces a new frontier in applying multiple graphs to solving protein domain ranking applications. 2012 Wang et al; licensee BioMed Central Ltd.
Multiple graph regularized protein domain ranking.
Wang, Jim Jing-Yan; Bensmail, Halima; Gao, Xin
2012-11-19
Protein domain ranking is a fundamental task in structural biology. Most protein domain ranking methods rely on the pairwise comparison of protein domains while neglecting the global manifold structure of the protein domain database. Recently, graph regularized ranking that exploits the global structure of the graph defined by the pairwise similarities has been proposed. However, the existing graph regularized ranking methods are very sensitive to the choice of the graph model and parameters, and this remains a difficult problem for most of the protein domain ranking methods. To tackle this problem, we have developed the Multiple Graph regularized Ranking algorithm, MultiG-Rank. Instead of using a single graph to regularize the ranking scores, MultiG-Rank approximates the intrinsic manifold of protein domain distribution by combining multiple initial graphs for the regularization. Graph weights are learned with ranking scores jointly and automatically, by alternately minimizing an objective function in an iterative algorithm. Experimental results on a subset of the ASTRAL SCOP protein domain database demonstrate that MultiG-Rank achieves a better ranking performance than single graph regularized ranking methods and pairwise similarity based ranking methods. The problem of graph model and parameter selection in graph regularized protein domain ranking can be solved effectively by combining multiple graphs. This aspect of generalization introduces a new frontier in applying multiple graphs to solving protein domain ranking applications.
Multiple graph regularized protein domain ranking
Directory of Open Access Journals (Sweden)
Wang Jim
2012-11-01
Full Text Available Abstract Background Protein domain ranking is a fundamental task in structural biology. Most protein domain ranking methods rely on the pairwise comparison of protein domains while neglecting the global manifold structure of the protein domain database. Recently, graph regularized ranking that exploits the global structure of the graph defined by the pairwise similarities has been proposed. However, the existing graph regularized ranking methods are very sensitive to the choice of the graph model and parameters, and this remains a difficult problem for most of the protein domain ranking methods. Results To tackle this problem, we have developed the Multiple Graph regularized Ranking algorithm, MultiG-Rank. Instead of using a single graph to regularize the ranking scores, MultiG-Rank approximates the intrinsic manifold of protein domain distribution by combining multiple initial graphs for the regularization. Graph weights are learned with ranking scores jointly and automatically, by alternately minimizing an objective function in an iterative algorithm. Experimental results on a subset of the ASTRAL SCOP protein domain database demonstrate that MultiG-Rank achieves a better ranking performance than single graph regularized ranking methods and pairwise similarity based ranking methods. Conclusion The problem of graph model and parameter selection in graph regularized protein domain ranking can be solved effectively by combining multiple graphs. This aspect of generalization introduces a new frontier in applying multiple graphs to solving protein domain ranking applications.
Modular invariance and stochastic quantization
International Nuclear Information System (INIS)
Ordonez, C.R.; Rubin, M.A.; Zwanziger, D.
1989-01-01
In Polyakov path integrals and covariant closed-string field theory, integration over Teichmueller parameters must be restricted by hand to a single modular region. This problem has an analog in Yang-Mills gauge theory---namely, the Gribov problem, which can be resolved by the method of stochastic gauge fixing. This method is here employed to quantize a simple modular-invariant system: the Polyakov point particle. In the limit of a large gauge-fixing force, it is shown that suitable choices for the functional form of the gauge-fixing force can lead to a restriction of Teichmueller integration to a single modular region. Modifications which arise when applying stochastic quantization to a system in which the volume of the orbits of the gauge group depends on a dynamical variable, such as a Teichmueller parameter, are pointed out, and the extension to Polyakov strings and covariant closed-string field theory is discussed
Modularity in New Market Formation
DEFF Research Database (Denmark)
Sanchez, Ron; Hang, Chang Chieh
2017-01-01
In this paper we appraise the ways in which use of closed-system proprietary product architectures versus open-system modular product architectures is likely to influence the dynamics and trajectory of new product market formation. We compare the evolutions of new markets in China for gas......-powered two-wheeled vehicles (G2WVs) based (initially) on closed-system proprietary architectures and for electric-powered two-wheeled vehicles (E2WVs) based on open-system modular architectures. We draw on this comparison to suggest ways in which the use of the two different kinds of architectures...... as the basis for new kinds of products may result in very different patterns and speeds of new market formation. We then suggest some key implications of the different dynamics of market formation associated with open-system modular architectures for both the competence-based strategic management (CBSM...
Modular assembly of optical nanocircuits
Shi, Jinwei; Monticone, Francesco; Elias, Sarah; Wu, Yanwen; Ratchford, Daniel; Li, Xiaoqin; Alù, Andrea
2014-05-01
A key element enabling the microelectronic technology advances of the past decades has been the conceptualization of complex circuits with versatile functionalities as being composed of the proper combination of basic ‘lumped’ circuit elements (for example, inductors and capacitors). In contrast, modern nanophotonic systems are still far from a similar level of sophistication, partially because of the lack of modularization of their response in terms of basic building blocks. Here we demonstrate the design, assembly and characterization of relatively complex photonic nanocircuits by accurately positioning a number of metallic and dielectric nanoparticles acting as modular lumped elements. The nanoparticle clusters produce the desired spectral response described by simple circuit rules and are shown to be dynamically reconfigurable by modifying the direction or polarization of impinging signals. Our work represents an important step towards extending the powerful modular design tools of electronic circuits into nanophotonic systems.
Modular system design and evaluation
Levin, Mark Sh
2015-01-01
This book examines seven key combinatorial engineering frameworks (composite schemes consisting of algorithms and/or interactive procedures) for hierarchical modular (composite) systems. These frameworks are based on combinatorial optimization problems (e.g., knapsack problem, multiple choice problem, assignment problem, morphological clique problem), with the author’s version of morphological design approach – Hierarchical Morphological Multicritieria Design (HMMD) – providing a conceptual lens with which to elucidate the examples discussed. This approach is based on ordinal estimates of design alternatives for systems parts/components, however, the book also puts forward an original version of HMMD that is based on new interval multiset estimates for the design alternatives with special attention paid to the aggregation of modular solutions (system versions). The second part of ‘Modular System Design and Evaluation’ provides ten information technology case studies that enriches understanding of th...
Automatic Prompt System in the Process of Mapping plWordNet on Princeton WordNet
Directory of Open Access Journals (Sweden)
Paweł Kędzia
2015-06-01
Full Text Available Automatic Prompt System in the Process of Mapping plWordNet on Princeton WordNet The paper offers a critical evaluation of the power and usefulness of an automatic prompt system based on the extended Relaxation Labelling algorithm in the process of (manual mapping plWordNet on Princeton WordNet. To this end the results of manual mapping – that is inter-lingual relations between plWN and PWN synsets – are juxtaposed with the automatic prompts that were generated for the source language synsets to be mapped. We check the number and type of inter-lingual relations introduced on the basis of automatic prompts and the distance of the respective prompt synsets from the actual target language synsets.
Optimization of Broadband Wavefront Correction at the Princeton High Contrast Imaging Laboratory
Groff, Tyler Dean; Kasdin, N.; Carlotti, A.
2011-01-01
Wavefront control for imaging of terrestrial planets using coronagraphic techniques requires improving the performance of the wavefront control techniques to expand the correction bandwidth and the size of the dark hole over which it is effective. At the Princeton High Contrast Imaging Laboratory we have focused on increasing the search area using two deformable mirrors (DMs) in series to achieve symmetric correction by correcting both amplitude and phase aberrations. Here we are concerned with increasing the bandwidth of light over which this correction is effective so we include a finite bandwidth into the optimization problem to generate a new stroke minimization algorithm. This allows us to minimize the actuator stroke on the DMs given contrast constraints at multiple wavelengths which define a window over which the dark hole will persist. This windowed stroke minimization algorithm is written in such a way that a weight may be applied to dictate the relative importance of the outer wavelengths to the central wavelength. In order to supply the estimates at multiple wavelengths a functional relationship to a central estimation wavelength is formed. Computational overhead and new experimental results of this windowed stroke minimization algorithm are discussed. The tradeoff between symmetric correction and achievable bandwidth is compared to the observed contrast degradation with wavelength in the experimental results. This work is supported by NASA APRA Grant #NNX09AB96G. The author is also supported under an NESSF Fellowship.
Beam-Plasma Interaction Experiments on the Princeton Advanced Test Stand
Stepanov, A.; Gilson, E. P.; Grisham, L.; Kaganovich, I. D.; Davidson, R. C.
2011-10-01
The Princeton Advanced Test Stand (PATS) is a compact experimental facility for studying the fundamental physics of intense beam-plasma interactions relevant to the Neutralized Drift Compression Experiment - II (NDCX-II). The PATS facility consists of a 100 keV ion beam source mounted on a six-foot-long vacuum chamber with numerous ports for diagnostic access. A 100 keV Ar+ beam is launched into a volumetric plasma, which is produced by a ferroelectric plasma source (FEPS). Beam diagnostics upstream and downstream of the FEPS allow for detailed studies of the effects that the plasma has on the beam. This setup is designed for studying the dependence of charge and current neutralization and beam emittance growth on the beam and plasma parameters. This work reports initial measurements of beam quality produced by the extraction electrodes that were recently installed on the PATS device. The transverse beam phase space is measured with double-slit emittance scanners, and the experimental results are compared to WARP simulations of the extraction system. This research is supported by the U.S. Department of Energy.
Characterizing the Performance of the Princeton Advanced Test Stand Ion Source
Stepanov, A.; Gilson, E. P.; Grisham, L.; Kaganovich, I.; Davidson, R. C.
2012-10-01
The Princeton Advanced Test Stand (PATS) is a compact experimental facility for studying the physics of intense beam-plasma interactions relevant to the Neutralized Drift Compression Experiment - II (NDCX-II). The PATS facility consists of a multicusp RF ion source mounted on a 2 m-long vacuum chamber with numerous ports for diagnostic access. Ar+ beams are extracted from the source plasma with three-electrode (accel-decel) extraction optics. The RF power and extraction voltage (30 - 100 kV) are pulsed to produce 100 μsec duration beams at 0.5 Hz with excellent shot-to-shot repeatability. Diagnostics include Faraday cups, a double-slit emittance scanner, and scintillator imaging. This work reports measurements of beam parameters for a range of beam energies (30 - 50 keV) and currents to characterize the behavior of the ion source and extraction optics. Emittance scanner data is used to calculate the beam trace-space distribution and corresponding transverse emittance. If the plasma density is changing during a beam pulse, time-resolved emittance scanner data has been taken to study the corresponding evolution of the beam trace-space distribution.
An update on the analysis of the Princeton 19Ne beta asymmetry measurement
Combs, Dustin; Calaprice, Frank; Jones, Gordon; Pattie, Robert; Young, Albert
2013-10-01
We report on the progress of a new analysis of the 1994 19Ne beta asymmetry measurement conducted at Princeton University. In this experiment, a beam of 19Ne atoms were polarized with a Stern-Gerlach magnet and then entered a thin-walled mylar cell through a slit fabricated from a piece of micro channel plate. A pair of Si(Li) detectors at either end of the apparatus were aligned with the direction of spin polarization (one parallel and one anti-parallel to the spin of the 19Ne) and detected positrons from the decays. The difference in the rate in the two detectors was used to calculate the asymmetry. A new analysis procedure has been undertaken using the Monte Carlo package PENELOPE with the goal of determining the systematic uncertainty due to positrons scattering from the face of the detectors causing the incorrect reconstruction of the initial direction of the positron momentum. This was a leading cause of systematic uncertainty in the experiment in 1994.
Safety assessment document (SAD) for the Princeton Beta Experiment Modification (PBX-M)
International Nuclear Information System (INIS)
Stencel, J.R.; Parsells, R.F.
1988-04-01
The Princeton Beta Experiment-Modification (PBX-M) is an experimental device of the tokamak type. A tokamak is characterized by a strong toroidal magnetic field composed of an externally driven component parallel to the torus centerline modified by the field produced by a transformer-driven current (OH) in the confined plasma. A second magnetic field parallel to the major toroidal axis is added to provide radial equilibrium for the plasma. As an advanced tokamak, PBX-M will have additional magnetic fields to reshape the plasma cross section from a circle into a kidney bean shape; it will also be equipped with 6MW or more of auxiliary heating power provided by four neutral beam injectors, with RF systems, and with an extensive set of diagnostics. Potential hazards associated with PBX-M, which are analyzed in this report, result from energy stored in the magnetic fields, high voltages necessary for the operation of some of the equipment and diagnostics, neutron radiation when the neutral beams are run with deuterium and x-rays, especially those emitted as a result of plasma-wall interaction. This report satisfies the requirements set forth in the PPPL Health and Safety Directives, specifically HSD-5003, and in DOE Order 5481.1B and its Chicago operations supplement (DOE86, DOE82)
Constructing Knowledge Graphs of Depression
Huang, Zhisheng; Yang, Jie; van Harmelen, Frank; Hu, Qing
2017-01-01
Knowledge Graphs have been shown to be useful tools for integrating multiple medical knowledge sources, and to support such tasks as medical decision making, literature retrieval, determining healthcare quality indicators, co-morbodity analysis and many others. A large number of medical knowledge
Partitioning graphs into connected parts
Hof, van 't P.; Paulusma, D.; Woeginger, G.J.; Frid, A.; Morozov, A.S.; Rybalchenko, A.; Wagner, K.W.
2009-01-01
The 2-DISJOINT CONNECTED SUBGRAPHS problem asks if a given graph has two vertex-disjoint connected subgraphs containing pre-specified sets of vertices. We show that this problem is NP-complete even if one of the sets has cardinality 2. The LONGEST PATH CONTRACTIBILITY problem asks for the largest
Isoperimetric inequalities for minimal graphs
International Nuclear Information System (INIS)
Pacelli Bessa, G.; Montenegro, J.F.
2007-09-01
Based on Markvorsen and Palmer's work on mean time exit and isoperimetric inequalities we establish slightly better isoperimetric inequalities and mean time exit estimates for minimal graphs in N x R. We also prove isoperimetric inequalities for submanifolds of Hadamard spaces with tamed second fundamental form. (author)
Ancestral Genres of Mathematical Graphs
Gerofsky, Susan
2011-01-01
Drawing from sources in gesture studies, cognitive science, the anthropology of religion and art/architecture history, this article explores cultural, bodily and cosmological resonances carried (unintentionally) by mathematical graphs on Cartesian coordinates. Concepts of asymmetric bodily spaces, grids, orthogonality, mapping and sacred spaces…
Humidity Graphs for All Seasons.
Esmael, F.
1982-01-01
In a previous article in this journal (Vol. 17, p358, 1979), a wet-bulb depression table was recommended for two simple experiments to determine relative humidity. However, the use of a graph is suggested because it gives the relative humidity directly from the wet and dry bulb readings. (JN)
Contracting a planar graph efficiently
DEFF Research Database (Denmark)
Holm, Jacob; Italiano, Giuseppe F.; Karczmarz, Adam
2017-01-01
the data structure, we can achieve optimal running times for decremental bridge detection, 2-edge connectivity, maximal 3-edge connected components, and the problem of finding a unique perfect matching for a static planar graph. Furthermore, we improve the running times of algorithms for several planar...
Graph Model Based Indoor Tracking
DEFF Research Database (Denmark)
Jensen, Christian Søndergaard; Lu, Hua; Yang, Bin
2009-01-01
The tracking of the locations of moving objects in large indoor spaces is important, as it enables a range of applications related to, e.g., security and indoor navigation and guidance. This paper presents a graph model based approach to indoor tracking that offers a uniform data management...
A graph with fractional revival
Bernard, Pierre-Antoine; Chan, Ada; Loranger, Érika; Tamon, Christino; Vinet, Luc
2018-02-01
An example of a graph that admits balanced fractional revival between antipodes is presented. It is obtained by establishing the correspondence between the quantum walk on a hypercube where the opposite vertices across the diagonals of each face are connected and, the coherent transport of single excitations in the extension of the Krawtchouk spin chain with next-to-nearest neighbour interactions.
Fixation Time for Evolutionary Graphs
Nie, Pu-Yan; Zhang, Pei-Ai
Evolutionary graph theory (EGT) is recently proposed by Lieberman et al. in 2005. EGT is successful for explaining biological evolution and some social phenomena. It is extremely important to consider the time of fixation for EGT in many practical problems, including evolutionary theory and the evolution of cooperation. This study characterizes the time to asymptotically reach fixation.
Coloring sums of extensions of certain graphs
Directory of Open Access Journals (Sweden)
Johan Kok
2017-12-01
Full Text Available We recall that the minimum number of colors that allow a proper coloring of graph $G$ is called the chromatic number of $G$ and denoted $\\chi(G$. Motivated by the introduction of the concept of the $b$-chromatic sum of a graph the concept of $\\chi'$-chromatic sum and $\\chi^+$-chromatic sum are introduced in this paper. The extended graph $G^x$ of a graph $G$ was recently introduced for certain regular graphs. This paper furthers the concepts of $\\chi'$-chromatic sum and $\\chi^+$-chromatic sum to extended paths and cycles. Bipartite graphs also receive some attention. The paper concludes with patterned structured graphs. These last said graphs are typically found in chemical and biological structures.
Mathematical Minute: Rotating a Function Graph
Bravo, Daniel; Fera, Joseph
2013-01-01
Using calculus only, we find the angles you can rotate the graph of a differentiable function about the origin and still obtain a function graph. We then apply the solution to odd and even degree polynomials.
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...
Bounds on Gromov hyperbolicity constant in graphs
Indian Academy of Sciences (India)
Infinite graphs; Cartesian product graphs; independence number; domin- ation number; geodesics ... the secure transmission of information through the internet (see [15, 16]). In particular, ..... In particular, δ(G) is an integer multiple of 1/4.
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
Torsional rigidity, isospectrality and quantum graphs
International Nuclear Information System (INIS)
Colladay, Don; McDonald, Patrick; Kaganovskiy, Leon
2017-01-01
We study torsional rigidity for graph and quantum graph analogs of well-known pairs of isospectral non-isometric planar domains. We prove that such isospectral pairs are distinguished by torsional rigidity. (paper)
Emergent interfaces for feature modularization
Ribeiro, Márcio; Brabrand, Claus
2014-01-01
Developers frequently introduce errors into software systems when they fail to recognise module dependencies. Using forty-three software families and Software Product Lines (SPLs), where the majority are commonly used in industrial practice, the authors reports on the feature modularization problem and provides a study of how often it may occur in practice. To solve the problem they present the concept of emergent feature modularization which aims to establish contracts between features to prevent developers from breaking other features when performing a maintenance task.
Modular Firewalls for Storage Areas
Fedor, O. H.; Owens, L. J.
1986-01-01
Giant honeycomb structures assembled in modular units. Flammable materials stored in cells. Walls insulated with firebrick to prevent spread of fire among cells. Portable, modular barrier withstands heat of combustion for limited time and confines combustion products horizontally to prevent fire from spreading. Barrier absorbs heat energy by ablation and not meant to be reused. Designed to keep fires from spreading among segments of solid rocket propellant in storage, barrier erected between storage units of other flammable or explosive materials; tanks of petroleum or liquid natural gas. Barrier adequate for most industrial purposes.
Inherent controllability in modular ALMRs
International Nuclear Information System (INIS)
Sackett, J.I.; Sevy, R.H.; Wei, T.Y.C.
1989-01-01
As part of recent development efforts on advanced reactor designs ANL has proposed the IFR (Integral Fast Reactor) concept. The IFR concept is currently being applied to modular sized reactors which would be built in multiple power paks together with an integrated fuel cycle facility. It has been amply demonstrated that the concept as applied to the modular designs has significant advantages in regard to ATWS transients. Attention is now being focussed on determining whether or not those advantages deriving from the traits of the IFR can be translated to the operational/DBA (design basis accident) class of transients. 5 refs., 3 figs., 3 tabs
Modular nuclear fuel assembly rack
International Nuclear Information System (INIS)
Davis, C.J.
1982-01-01
A modular nuclear fuel assembly rack constructed of an array of identical cells, each cell constructed of a plurality of identical flanged plates. The unique assembly of the plates into a rigid rack provides a cellular compartment for nuclear fuel assemblies and a cavity between the cells for accepting neutron absorbing materials thus allowing a closely spaced array. The modular rack size can be easily adapted to conform with available storage space. U-shaped flanges at the edges of the plates are nested together at the intersection of four cells in the array. A bar is placed at the intersection to lock the cells together
International Nuclear Information System (INIS)
Heidbrink, W.W.; Kaita, R.; Takahashi, H.; Gammel, G.; Hammett, G.W.; Kaye, S.
1987-01-01
During tangential injection of neutral beams into low density tokamak plasmas with β > 1% in the Princeton Beta Experiment (PBX), instabilities are observed that degrade the confinement of beam ions. Neutron, charge-exchange, and diamagnetic loop measurements are examined in order to identify the mechanism or mechanisms responsible for the beam-ion transport. The data suggest a resonant interaction between the instabilities and the parallel energetic beam ions. Evidence for some nonresonant transport also exists
Modular envelopes, OSFT and nonsymmetric (non-$\\sum$) modular operads
Czech Academy of Sciences Publication Activity Database
Markl, Martin
2016-01-01
Roč. 10, č. 2 (2016), s. 775-809 ISSN 1661-6952 Institutional support: RVO:67985840 Keywords : open string * surface * modular completion Subject RIV: BA - General Mathematics Impact factor: 0.625, year: 2016 http://www.ems-ph.org/journals/show_abstract.php?issn=1661-6952&vol=10&iss=2&rank=12
Landon, M.K.; Delin, G.N.; Lamb, J.A.; Anderson, J.L.; Dowdy, R.H.
1998-01-01
Ground-water quality in an unconfined sand and gravel aquifer was monitored during 1991-95 at the Minnesota Management Systems Evaluation Area (MSEA) near Princeton, Minnesota. The objectives of the study were to:
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...
A Graph Calculus for Predicate Logic
Directory of Open Access Journals (Sweden)
Paulo A. S. Veloso
2013-03-01
Full Text Available We introduce a refutation graph calculus for classical first-order predicate logic, which is an extension of previous ones for binary relations. One reduces logical consequence to establishing that a constructed graph has empty extension, i. e. it represents bottom. Our calculus establishes that a graph has empty extension by converting it to a normal form, which is expanded to other graphs until we can recognize conflicting situations (equivalent to a formula and its negation.
Sphere and dot product representations of graphs
R.J. Kang (Ross); T. Müller (Tobias)
2012-01-01
textabstractA graph $G$ is a $k$-sphere graph if there are $k$-dimensional real vectors $v_1,\\dots,v_n$ such that $ij\\in E(G)$ if and only if the distance between $v_i$ and $v_j$ is at most $1$. A graph $G$ is a $k$-dot product graph if there are $k$-dimensional real vectors $v_1,\\dots,v_n$ such
Deep Learning with Dynamic Computation Graphs
Looks, Moshe; Herreshoff, Marcello; Hutchins, DeLesley; Norvig, Peter
2017-01-01
Neural networks that compute over graph structures are a natural fit for problems in a variety of domains, including natural language (parse trees) and cheminformatics (molecular graphs). However, since the computation graph has a different shape and size for every input, such networks do not directly support batched training or inference. They are also difficult to implement in popular deep learning libraries, which are based on static data-flow graphs. We introduce a technique called dynami...
Constructs for Programming with Graph Rewrites
Rodgers, Peter
2000-01-01
Graph rewriting is becoming increasingly popular as a method for programming with graph based data structures. We present several modifications to a basic serial graph rewriting paradigm and discuss how they improve coding programs in the Grrr graph rewriting programming language. The constructs we present are once only nodes, attractor nodes and single match rewrites. We illustrate the operation of the constructs by example. The advantages of adding these new rewrite modifiers is to reduce t...
A modular interpretation of various cubic towers
DEFF Research Database (Denmark)
Anbar Meidl, Nurdagül; Bassa, Alp; Beelen, Peter
2017-01-01
In this article we give a Drinfeld modular interpretation for various towers of function fields meeting Zink's bound.......In this article we give a Drinfeld modular interpretation for various towers of function fields meeting Zink's bound....
On the sizes of expander graphs and minimum distances of graph codes
DEFF Research Database (Denmark)
Høholdt, Tom; Justesen, Jørn
2014-01-01
We give lower bounds for the minimum distances of graph codes based on expander graphs. The bounds depend only on the second eigenvalue of the graph and the parameters of the component codes. We also give an upper bound on the size of a degree regular graph with given second eigenvalue....
McMillen, Sue; McMillen, Beth
2010-01-01
Connecting stories to qualitative coordinate graphs has been suggested as an effective instructional strategy. Even students who are able to "create" bar graphs may struggle to correctly "interpret" them. Giving children opportunities to work with qualitative graphs can help them develop the skills to interpret, describe, and compare information…
The groupies of random multipartite graphs
Portmann, Marius; Wang, Hongyun
2012-01-01
If a vertex $v$ in a graph $G$ has degree larger than the average of the degrees of its neighbors, we call it a groupie in $G$. In the current work, we study the behavior of groupie in random multipartite graphs with the link probability between sets of nodes fixed. Our results extend the previous ones on random (bipartite) graphs.
Modeling Software Evolution using Algebraic Graph Rewriting
Ciraci, Selim; van den Broek, Pim
We show how evolution requests can be formalized using algebraic graph rewriting. In particular, we present a way to convert the UML class diagrams to colored graphs. Since changes in software may effect the relation between the methods of classes, our colored graph representation also employs the
A Type Graph Model for Java Programs
Rensink, Arend; Zambon, Eduardo
2009-01-01
In this report we present a type graph that models all executable constructs of the Java programming language. Such a model is useful for any graph-based technique that relies on a representation of Java programs as graphs. The model can be regarded as a common representation to which all Java
An intersection graph of straight lines
DEFF Research Database (Denmark)
Thomassen, Carsten
2002-01-01
G. Ehrlich, S. Even, and R.E. Tarjan conjectured that the graph obtained from a complete 3 partite graph K4,4,4 by deleting the edges of four disjoint triangles is not the intersection graph of straight line segments in the plane. We show that it is....
Girth 5 graphs from relative difference sets
DEFF Research Database (Denmark)
Jørgensen, Leif Kjær
2005-01-01
We consider the problem of construction of graphs with given degree $k$ and girth 5 and as few vertices as possible. We give a construction of a family of girth 5 graphs based on relative difference sets. This family contains the smallest known graph of degree 8 and girth 5 which was constructed ...
Cycles in weighted graphs and related topics
Zhang, Shenggui
2002-01-01
This thesis contains results on paths andcycles in graphs andon a more or less relatedtopic, the vulnerability of graphs. In the first part of the thesis, Chapters 2 through 5, we concentrate on paths andcycles in weightedgraphs. A number of sufficient conditions are presentedfor graphs to contain
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
Girth 5 graphs from relative difference sets
DEFF Research Database (Denmark)
Jørgensen, Leif Kjær
We consider the problem of construction of graphs with given degree and girth 5 and as few vertices as possible. We give a construction of a family of girth 5 graphs based on relative difference sets. This family contains the smallest known graph of degree 8 and girth 5 which was constructed by G...
Improper colouring of (random) unit disk graphs
Kang, R.J.; Müller, T.; Sereni, J.S.
2008-01-01
For any graph G, the k-improper chromatic number ¿k(G) is the smallest number of colours used in a colouring of G such that each colour class induces a subgraph of maximum degree k. We investigate ¿k for unit disk graphs and random unit disk graphs to generalise results of McDiarmid and Reed
Alliances and Bisection Width for Planar Graphs
DEFF Research Database (Denmark)
Olsen, Martin; Revsbæk, Morten
2013-01-01
An alliance in a graph is a set of vertices (allies) such that each vertex in the alliance has at least as many allies (counting the vertex itself) as non-allies in its neighborhood of the graph. We show that any planar graph with minimum degree at least 4 can be split into two alliances in polyn...
A Type Graph Model for Java Programs
Rensink, Arend; Zambon, Eduardo; Lee, D.; Lopes, A.; Poetzsch-Heffter, A.
2009-01-01
In this work we present a type graph that models all executable constructs of the Java programming language. Such a model is useful for any graph-based technique that relies on a representation of Java programs as graphs. The model can be regarded as a common representation to which all Java syntax
RATGRAPH: Computer Graphing of Rational Functions.
Minch, Bradley A.
1987-01-01
Presents an easy-to-use Applesoft BASIC program that graphs rational functions and any asymptotes that the functions might have. Discusses the nature of rational functions, graphing them manually, employing a computer to graph rational functions, and describes how the program works. (TW)
A new cluster algorithm for graphs
S. van Dongen
1998-01-01
textabstractA new cluster algorithm for graphs called the emph{Markov Cluster algorithm ($MCL$ algorithm) is introduced. The graphs may be both weighted (with nonnegative weight) and directed. Let~$G$~be such a graph. The $MCL$ algorithm simulates flow in $G$ by first identifying $G$ in a
Well-covered graphs and factors
DEFF Research Database (Denmark)
Randerath, Bert; Vestergaard, Preben D.
2006-01-01
A maximum independent set of vertices in a graph is a set of pairwise nonadjacent vertices of largest cardinality α. Plummer defined a graph to be well-covered, if every independent set is contained in a maximum independent set of G. Every well-covered graph G without isolated vertices has a perf...
A new characterization of trivially perfect graphs
Directory of Open Access Journals (Sweden)
Christian Rubio Montiel
2015-03-01
Full Text Available A graph $G$ is \\emph{trivially perfect} if for every induced subgraph the cardinality of the largest set of pairwise nonadjacent vertices (the stability number $\\alpha(G$ equals the number of (maximal cliques $m(G$. We characterize the trivially perfect graphs in terms of vertex-coloring and we extend some definitions to infinite graphs.
47 CFR 80.761 - Conversion graphs.
2010-10-01
... MARITIME SERVICES Standards for Computing Public Coast Station VHF Coverage § 80.761 Conversion graphs. The following graphs must be employed where conversion from one to the other of the indicated types of units is... 47 Telecommunication 5 2010-10-01 2010-10-01 false Conversion graphs. 80.761 Section 80.761...
Personalized PageRank Clustering: A graph clustering algorithm based on random walks
A. Tabrizi, Shayan; Shakery, Azadeh; Asadpour, Masoud; Abbasi, Maziar; Tavallaie, Mohammad Ali
2013-11-01
Graph clustering has been an essential part in many methods and thus its accuracy has a significant effect on many applications. In addition, exponential growth of real-world graphs such as social networks, biological networks and electrical circuits demands clustering algorithms with nearly-linear time and space complexity. In this paper we propose Personalized PageRank Clustering (PPC) that employs the inherent cluster exploratory property of random walks to reveal the clusters of a given graph. We combine random walks and modularity to precisely and efficiently reveal the clusters of a graph. PPC is a top-down algorithm so it can reveal inherent clusters of a graph more accurately than other nearly-linear approaches that are mainly bottom-up. It also gives a hierarchy of clusters that is useful in many applications. PPC has a linear time and space complexity and has been superior to most of the available clustering algorithms on many datasets. Furthermore, its top-down approach makes it a flexible solution for clustering problems with different requirements.
Fragmentation: Loss of global coherence or breakdown of modularity in functional brain architecture?
Directory of Open Access Journals (Sweden)
Daan evan den Berg
2012-03-01
Full Text Available Psychiatric illnesses characterised by disorganized cognition, such as schizophrenia, have been described in terms of fragmentation and hence understood as reduction in functional brain connectivity, particularly in prefrontal and parietal areas. However, as graph-theory shows, relatively small numbers of nonlocal connections are sufficient to ensure global coherence in the modular small world network structure of the brain. We reconsider fragmentation in this perspective. Computational studies have shown that for a given level of connectivity in a model of coupled nonlinear oscillators, modular small-world networks evolve from an initially random organization. Here we demonstrate that with decreasing connectivity, the probability of evolving into a modular small-world network breaks down at a critical point, which scales to the percolation function of random networks with a universal exponent of α=1.17. Thus, according to the model, local modularity systematically breaks down before there is loss of global coherence in network connectivity. We therefore propose that fragmentation may involve, at least in its initial stages, the inability of a dynamically evolving network to sustain a modular small-world structure. The result is in a shift in the balance in schizophrenia from local to global functional connectivity.
Reasoning and change management in modular ontologies
Stuckenschmidt, Heiner; Klein, Michel
2007-01-01
The benefits of modular representations are well known from many areas of computer science. While in software engineering modularization is mainly a vehicle for supporting distributed development and re-use, in knowledge representation, the main goal of modularization is efficiency of reasoning. In
Modular invariance of N=2 minimal models
International Nuclear Information System (INIS)
Sidenius, J.
1991-01-01
We prove modular covariance of one-point functions at one loop in the diagonal N=2 minimal superconformal models. We use the recently derived general formalism for computing arbitrary conformal blocks in these models. Our result should be sufficient to guarantee modular covariance at arbitrary genus. It is thus an important check on the general formalism which is not manifestly modular covariant. (orig.)
A Modularized Counselor-Education Program.
Miller, Thomas V.; Dimattia, Dominic J.
1978-01-01
Counselor-education programs may be enriched through the use of modularized learning experiences. This article notes several recent articles on competency-based counselor education, the concepts of simulation and modularization, and describes the process of developing a modularized master's program at the University of Bridgeport in Connecticut.…
Prospect of small modular reactor development
International Nuclear Information System (INIS)
Li Huailin; Zhu Qingyuan; Wang Suli; Xia Haihong
2014-01-01
Small modular reactor has the advantages of modular construction, enhanced safety/robustness from simplified designs, better ecomonic, clean and carbon free, compatible with the needs of smaller utilities and diversified application. In this paper, the prospect of small modular reactor is discussed from technology development status, constraints, economic. (authors)
Integrity and change in modular ontologies
Stuckenschmidt, Heiner; Klein, Michel
2003-01-01
The benefits of modular representations arc well known from many areas of computer science. In this paper, we concentrate on the benefits of modular ontologies with respect to local containment of terminological reasoning. We define an architecture for modular ontologies that supports local
Modular networks with hierarchical organization
Indian Academy of Sciences (India)
Several networks occurring in real life have modular structures that are arranged in a hierarchical fashion. In this paper, we have proposed a model for such networks, using a stochastic generation method. Using this model we show that, the scaling relation between the clustering and degree of the nodes is not a necessary ...
Modularity in Cancer Care Provision
DEFF Research Database (Denmark)
Gobbi, Chiara; Hsuan, Juliana
2012-01-01
The paper presents the findings of a case study research conducted within the Danish healthcare system aimed at analyzing how modularity is deployed in the process of delivery cancer care. Three cancer packages are presented into detailed describing the process of defining the diagnosis and treat...
Physical Modeling Modular Boxes: PHOXES
DEFF Research Database (Denmark)
Gelineck, Steven; Serafin, Stefania
2010-01-01
This paper presents the development of a set of musical instruments, which are based on known physical modeling sound synthesis techniques. The instruments are modular, meaning that they can be combined in various ways. This makes it possible to experiment with physical interaction and sonic...
Modular forms a classical approach
Cohen, Henri
2017-01-01
The theory of modular forms is a fundamental tool used in many areas of mathematics and physics. It is also a very concrete and "fun" subject in itself and abounds with an amazing number of surprising identities. This comprehensive textbook, which includes numerous exercises, aims to give a complete picture of the classical aspects of the subject, with an emphasis on explicit formulas. After a number of motivating examples such as elliptic functions and theta functions, the modular group, its subgroups, and general aspects of holomorphic and nonholomorphic modular forms are explained, with an emphasis on explicit examples. The heart of the book is the classical theory developed by Hecke and continued up to the Atkin-Lehner-Li theory of newforms and including the theory of Eisenstein series, Rankin-Selberg theory, and a more general theory of theta series including the Weil representation. The final chapter explores in some detail more general types of modular forms such as half-integral weight, Hilbert, Jacob...
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.
Centrosymmetric Graphs And A Lower Bound For Graph Energy Of Fullerenes
Directory of Open Access Journals (Sweden)
Katona Gyula Y.
2014-11-01
Full Text Available The energy of a molecular graph G is defined as the summation of the absolute values of the eigenvalues of adjacency matrix of a graph G. In this paper, an infinite class of fullerene graphs with 10n vertices, n ≥ 2, is considered. By proving centrosymmetricity of the adjacency matrix of these fullerene graphs, a lower bound for its energy is given. Our method is general and can be extended to other class of fullerene graphs.
Episodic Memory Retrieval Benefits from a Less Modular Brain Network Organization
2017-01-01
Most complex cognitive tasks require the coordinated interplay of multiple brain networks, but the act of retrieving an episodic memory may place especially heavy demands for communication between the frontoparietal control network (FPCN) and the default mode network (DMN), two networks that do not strongly interact with one another in many task contexts. We applied graph theoretical analysis to task-related fMRI functional connectivity data from 20 human participants and found that global brain modularity—a measure of network segregation—is markedly reduced during episodic memory retrieval relative to closely matched analogical reasoning and visuospatial perception tasks. Individual differences in modularity were correlated with memory task performance, such that lower modularity levels were associated with a lower false alarm rate. Moreover, the FPCN and DMN showed significantly elevated coupling with each other during the memory task, which correlated with the global reduction in brain modularity. Both networks also strengthened their functional connectivity with the hippocampus during the memory task. Together, these results provide a novel demonstration that reduced modularity is conducive to effective episodic retrieval, which requires close collaboration between goal-directed control processes supported by the FPCN and internally oriented self-referential processing supported by the DMN. SIGNIFICANCE STATEMENT Modularity, an index of the degree to which nodes of a complex system are organized into discrete communities, has emerged as an important construct in the characterization of brain connectivity dynamics. We provide novel evidence that the modularity of the human brain is reduced when individuals engage in episodic memory retrieval, relative to other cognitive tasks, and that this state of lower modularity is associated with improved memory performance. We propose a neural systems mechanism for this finding where the nodes of the frontoparietal
Subsampling for graph power spectrum estimation
Chepuri, Sundeep Prabhakar; Leus, Geert
2016-01-01
In this paper we focus on subsampling stationary random signals that reside on the vertices of undirected graphs. Second-order stationary graph signals are obtained by filtering white noise and they admit a well-defined power spectrum. Estimating the graph power spectrum forms a central component of stationary graph signal processing and related inference tasks. We show that by sampling a significantly smaller subset of vertices and using simple least squares, we can reconstruct the power spectrum of the graph signal from the subsampled observations, without any spectral priors. In addition, a near-optimal greedy algorithm is developed to design the subsampling scheme.
On 4-critical t-perfect graphs
Benchetrit, Yohann
2016-01-01
It is an open question whether the chromatic number of $t$-perfect graphs is bounded by a constant. The largest known value for this parameter is 4, and the only example of a 4-critical $t$-perfect graph, due to Laurent and Seymour, is the complement of the line graph of the prism $\\Pi$ (a graph is 4-critical if it has chromatic number 4 and all its proper induced subgraphs are 3-colorable). In this paper, we show a new example of a 4-critical $t$-perfect graph: the complement of the line gra...
Subsampling for graph power spectrum estimation
Chepuri, Sundeep Prabhakar
2016-10-06
In this paper we focus on subsampling stationary random signals that reside on the vertices of undirected graphs. Second-order stationary graph signals are obtained by filtering white noise and they admit a well-defined power spectrum. Estimating the graph power spectrum forms a central component of stationary graph signal processing and related inference tasks. We show that by sampling a significantly smaller subset of vertices and using simple least squares, we can reconstruct the power spectrum of the graph signal from the subsampled observations, without any spectral priors. In addition, a near-optimal greedy algorithm is developed to design the subsampling scheme.
Xiong, B.; Oude Elberink, S.; Vosselman, G.
2014-07-01
In the task of 3D building model reconstruction from point clouds we face the problem of recovering a roof topology graph in the presence of noise, small roof faces and low point densities. Errors in roof topology graphs will seriously affect the final modelling results. The aim of this research is to automatically correct these errors. We define the graph correction as a graph-to-graph problem, similar to the spelling correction problem (also called the string-to-string problem). The graph correction is more complex than string correction, as the graphs are 2D while strings are only 1D. We design a strategy based on a dictionary of graph edit operations to automatically identify and correct the errors in the input graph. For each type of error the graph edit dictionary stores a representative erroneous subgraph as well as the corrected version. As an erroneous roof topology graph may contain several errors, a heuristic search is applied to find the optimum sequence of graph edits to correct the errors one by one. The graph edit dictionary can be expanded to include entries needed to cope with errors that were previously not encountered. Experiments show that the dictionary with only fifteen entries already properly corrects one quarter of erroneous graphs in about 4500 buildings, and even half of the erroneous graphs in one test area, achieving as high as a 95% acceptance rate of the reconstructed models.
Princeton Plasma Physics Laboratory annual report, October 1, 1982-September 30, 1983
International Nuclear Information System (INIS)
Phillips, C.A.
1983-01-01
The Tokamak Fusion Test Reactor (TFTR) achieved first plasma at 3:05 a.m. on December 24, 1982. During the course of the year, the plasma current was raised to a maximum of 1 MA, and extensive confinement studies were carried out with ohmic-heated plasmas. The most important finding was that tokamak energy confinement time increases as the cube of the plasma size. The Princeton Large Torus (PLT) carried out a number of high-powered plasma-heating experiments in the ion cyclotron frequency range, and also demonstrated for the first time that a 100-kA tokamak discharge can be built up by means of rf-waves in the lower hybrid range, without any need for inductive current drive by the conventional tokamak transformer system. The Poloidal Divertor Experiment (PDX) demonstrated that substantial improvements in plasma confinement during intense neutral-beam heating can be obtained by means of either a magnetic divertor or a mechanical scoop limiter. The S-1 spheromak experiment has come into operation, with first plasma in January 1983, and machine completion in August. The soft X-ray laser development experiment continues to make strong progress towards the demonstration of laser amplification. Thus far, a single-pass gain of 3.5 has been achieved, using the 182 A line of CVI. Theoretical MHD-stability studies have shed new light on the nature of the energetic-ion-driven ''fishbone instability,'' and the utilization of the bean-shaping technique to reach higher beta values in the tokamak
Princeton Plasma Physics Laboratory annual report, October 1, 1982-September 30, 1983
Energy Technology Data Exchange (ETDEWEB)
Phillips, C.A. (ed.)
1983-01-01
The Tokamak Fusion Test Reactor (TFTR) achieved first plasma at 3:05 a.m. on December 24, 1982. During the course of the year, the plasma current was raised to a maximum of 1 MA, and extensive confinement studies were carried out with ohmic-heated plasmas. The most important finding was that tokamak energy confinement time increases as the cube of the plasma size. The Princeton Large Torus (PLT) carried out a number of high-powered plasma-heating experiments in the ion cyclotron frequency range, and also demonstrated for the first time that a 100-kA tokamak discharge can be built up by means of rf-waves in the lower hybrid range, without any need for inductive current drive by the conventional tokamak transformer system. The Poloidal Divertor Experiment (PDX) demonstrated that substantial improvements in plasma confinement during intense neutral-beam heating can be obtained by means of either a magnetic divertor or a mechanical scoop limiter. The S-1 spheromak experiment has come into operation, with first plasma in January 1983, and machine completion in August. The soft X-ray laser development experiment continues to make strong progress towards the demonstration of laser amplification. Thus far, a single-pass gain of 3.5 has been achieved, using the 182 A line of CVI. Theoretical MHD-stability studies have shed new light on the nature of the energetic-ion-driven ''fishbone instability,'' and the utilization of the bean-shaping technique to reach higher beta values in the tokamak.
Significance evaluation in factor graphs
DEFF Research Database (Denmark)
Madsen, Tobias; Hobolth, Asger; Jensen, Jens Ledet
2017-01-01
in genomics and the multiple-testing issues accompanying them, accurate significance evaluation is of great importance. We here address the problem of evaluating statistical significance of observations from factor graph models. Results Two novel numerical approximations for evaluation of statistical...... significance are presented. First a method using importance sampling. Second a saddlepoint approximation based method. We develop algorithms to efficiently compute the approximations and compare them to naive sampling and the normal approximation. The individual merits of the methods are analysed both from....... Conclusions The applicability of saddlepoint approximation and importance sampling is demonstrated on known models in the factor graph framework. Using the two methods we can substantially improve computational cost without compromising accuracy. This contribution allows analyses of large datasets...
Groups, graphs and random walks
Salvatori, Maura; Sava-Huss, Ecaterina
2017-01-01
An accessible and panoramic account of the theory of random walks on groups and graphs, stressing the strong connections of the theory with other branches of mathematics, including geometric and combinatorial group theory, potential analysis, and theoretical computer science. This volume brings together original surveys and research-expository papers from renowned and leading experts, many of whom spoke at the workshop 'Groups, Graphs and Random Walks' celebrating the sixtieth birthday of Wolfgang Woess in Cortona, Italy. Topics include: growth and amenability of groups; Schrödinger operators and symbolic dynamics; ergodic theorems; Thompson's group F; Poisson boundaries; probability theory on buildings and groups of Lie type; structure trees for edge cuts in networks; and mathematical crystallography. In what is currently a fast-growing area of mathematics, this book provides an up-to-date and valuable reference for both researchers and graduate students, from which future research activities will undoubted...
Flux networks in metabolic graphs
International Nuclear Information System (INIS)
Warren, P B; Queiros, S M Duarte; Jones, J L
2009-01-01
A metabolic model can be represented as a bipartite graph comprising linked reaction and metabolite nodes. Here it is shown how a network of conserved fluxes can be assigned to the edges of such a graph by combining the reaction fluxes with a conserved metabolite property such as molecular weight. A similar flux network can be constructed by combining the primal and dual solutions to the linear programming problem that typically arises in constraint-based modelling. Such constructions may help with the visualization of flux distributions in complex metabolic networks. The analysis also explains the strong correlation observed between metabolite shadow prices (the dual linear programming variables) and conserved metabolite properties. The methods were applied to recent metabolic models for Escherichia coli, Saccharomyces cerevisiae and Methanosarcina barkeri. Detailed results are reported for E. coli; similar results were found for other organisms
3-biplacement of bipartite graphs
Directory of Open Access Journals (Sweden)
Lech Adamus
2008-01-01
Full Text Available Let \\(G=(L,R;E\\ be a bipartite graph with color classes \\(L\\ and \\(R\\ and edge set \\(E\\. A set of two bijections \\(\\{\\varphi_1 , \\varphi_2\\}\\, \\(\\varphi_1 , \\varphi_2 :L \\cup R \\to L \\cup R\\, is said to be a \\(3\\-biplacement of \\(G\\ if \\(\\varphi_1(L= \\varphi_2(L = L\\ and \\(E \\cap \\varphi_1^*(E=\\emptyset\\, \\(E \\cap \\varphi_2^*(E=\\emptyset\\, \\(\\varphi_1^*(E \\cap \\varphi_2^*(E=\\emptyset\\, where \\(\\varphi_1^*\\, \\(\\varphi_2^*\\ are the maps defined on \\(E\\, induced by \\(\\varphi_1\\, \\(\\varphi_2\\, respectively. We prove that if \\(|L| = p\\, \\(|R| = q\\, \\(3 \\leq p \\leq q\\, then every graph \\(G=(L,R;E\\ of size at most \\(p\\ has a \\(3\\-biplacement.
On the centrality of some graphs
Directory of Open Access Journals (Sweden)
Vecdi Aytac
2017-10-01
Full Text Available A central issue in the analysis of complex networks is the assessment of their stability and vulnerability. A variety of measures have been proposed in the literature to quantify the stability of networks and a number of graph-theoretic parameters have been used to derive formulas for calculating network reliability. Different measures for graph vulnerability have been introduced so far to study different aspects of the graph behavior after removal of vertices or links such as connectivity, toughness, scattering number, binding number, residual closeness and integrity. In this paper, we consider betweenness centrality of a graph. Betweenness centrality of a vertex of a graph is portion of the shortest paths all pairs of vertices passing through a given vertex. In this paper, we obtain exact values for betweenness centrality for some wheel related graphs namely gear, helm, sunflower and friendship graphs.
Quantum walk on a chimera graph
Xu, Shu; Sun, Xiangxiang; Wu, Jizhou; Zhang, Wei-Wei; Arshed, Nigum; Sanders, Barry C.
2018-05-01
We analyse a continuous-time quantum walk on a chimera graph, which is a graph of choice for designing quantum annealers, and we discover beautiful quantum walk features such as localization that starkly distinguishes classical from quantum behaviour. Motivated by technological thrusts, we study continuous-time quantum walk on enhanced variants of the chimera graph and on diminished chimera graph with a random removal of vertices. We explain the quantum walk by constructing a generating set for a suitable subgroup of graph isomorphisms and corresponding symmetry operators that commute with the quantum walk Hamiltonian; the Hamiltonian and these symmetry operators provide a complete set of labels for the spectrum and the stationary states. Our quantum walk characterization of the chimera graph and its variants yields valuable insights into graphs used for designing quantum-annealers.
Fibonacci number of the tadpole graph
Directory of Open Access Journals (Sweden)
Joe DeMaio
2014-10-01
Full Text Available In 1982, Prodinger and Tichy defined the Fibonacci number of a graph G to be the number of independent sets of the graph G. They did so since the Fibonacci number of the path graph Pn is the Fibonacci number F(n+2 and the Fibonacci number of the cycle graph Cn is the Lucas number Ln. The tadpole graph Tn,k is the graph created by concatenating Cn and Pk with an edge from any vertex of Cn to a pendant of Pk for integers n=3 and k=0. This paper establishes formulae and identities for the Fibonacci number of the tadpole graph via algebraic and combinatorial methods.
Software for Graph Analysis and Visualization
Directory of Open Access Journals (Sweden)
M. I. Kolomeychenko
2014-01-01
Full Text Available This paper describes the software for graph storage, analysis and visualization. The article presents a comparative analysis of existing software for analysis and visualization of graphs, describes the overall architecture of application and basic principles of construction and operation of the main modules. Furthermore, a description of the developed graph storage oriented to storage and processing of large-scale graphs is presented. The developed algorithm for finding communities and implemented algorithms of autolayouts of graphs are the main functionality of the product. The main advantage of the developed software is high speed processing of large size networks (up to millions of nodes and links. Moreover, the proposed graph storage architecture is unique and has no analogues. The developed approaches and algorithms are optimized for operating with big graphs and have high productivity.
Bundling Products and Services Through Modularization Strategies
DEFF Research Database (Denmark)
Bask, Anu; Hsuan, Juliana; Rajahonka, Mervi
2012-01-01
Modularity has been recognized as a powerful tool in improving the efficiency and management of product design and manufacturing. However, the integrated view on covering both, product and service modularity for product-service systems (PSS), is under researched. Therefore, in this paper our...... objective is to contribute to the PSS modularity. Thus, we describe configurations of PSSs and the bundling of products and services through modularization strategies. So far there have not been tools to analyze and determine the correct combinations of degrees of product and service modularities....
RoboMusic with modular playware
DEFF Research Database (Denmark)
Falkenberg, Kasper; Bærendsen, Niels Kristian; Nielsen, Jacob
2011-01-01
Based on the concepts of RoboMusic and modular playware, we developed a system composed of modular playware devices which allow any user to perform music in a simple, interactive manner. The key features exploited in the modular playware approach are modularity, fl exibility, construction......, immediate feedback to stimulate engagement, creative exploration of play activities, and in some cases activity design by end-users (e.g., DJs). We exemplify the approach with the development of 11 rock genres and 6 pop music pieces for modular I-BLOCKS, which are exhibited and in daily use at the Rock Me...
RoboMusic with Modular Playware
DEFF Research Database (Denmark)
Lund, Henrik Hautop; Bærendsen, Niels Kristian; Nielsen, Jacob
2010-01-01
Based on the concepts of RoboMusic and Modular Playware, we developed a system composed of modular playware devices, which allow any user to perform music in a simple, interactive manner. The key features exploited from the Modular Playware approach are modularity, flexibility, and construction......, immediate feedback to stimulate engagement, creative exploration of play activities, and in some cases activity design by end-users (e.g. DJ’s). We exemplify the approach with the development of 11 rock genres and 6 pop music pieces for modular I-BLOCKS, which are exhibited and in daily use at the Rock Me...
Parallel External Memory Graph Algorithms
DEFF Research Database (Denmark)
Arge, Lars Allan; Goodrich, Michael T.; Sitchinava, Nodari
2010-01-01
In this paper, we study parallel I/O efficient graph algorithms in the Parallel External Memory (PEM) model, one o f the private-cache chip multiprocessor (CMP) models. We study the fundamental problem of list ranking which leads to efficient solutions to problems on trees, such as computing lowest...... an optimal speedup of Â¿(P) in parallel I/O complexity and parallel computation time, compared to the single-processor external memory counterparts....
Submanifolds weakly associated with graphs
Indian Academy of Sciences (India)
A CARRIAZO, L M FERN ´ANDEZ and A RODRÍGUEZ-HIDALGO. Department of Geometry and Topology, ..... by means of trees (connected graphs without cycles) and forests (disjoint unions of trees, see [6]) given in [3], by extending it to weak ... CR-submanifold. In this case, every tree is a K2. Finally, Theorem 3.8 of [3] can ...
Topological structure of dictionary graphs
International Nuclear Information System (INIS)
Fuks, Henryk; Krzeminski, Mark
2009-01-01
We investigate the topological structure of the subgraphs of dictionary graphs constructed from WordNet and Moby thesaurus data. In the process of learning a foreign language, the learner knows only a subset of all words of the language, corresponding to a subgraph of a dictionary graph. When this subgraph grows with time, its topological properties change. We introduce the notion of the pseudocore and argue that the growth of the vocabulary roughly follows decreasing pseudocore numbers-that is, one first learns words with a high pseudocore number followed by smaller pseudocores. We also propose an alternative strategy for vocabulary growth, involving decreasing core numbers as opposed to pseudocore numbers. We find that as the core or pseudocore grows in size, the clustering coefficient first decreases, then reaches a minimum and starts increasing again. The minimum occurs when the vocabulary reaches a size between 10 3 and 10 4 . A simple model exhibiting similar behavior is proposed. The model is based on a generalized geometric random graph. Possible implications for language learning are discussed.
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.)
Degree Associated Edge Reconstruction Number of Graphs with Regular Pruned Graph
Directory of Open Access Journals (Sweden)
P. Anusha Devi
2015-10-01
Full Text Available An ecard of a graph $G$ is a subgraph formed by deleting an edge. A da-ecard specifies the degree of the deleted edge along with the ecard. The degree associated edge reconstruction number of a graph $G,~dern(G,$ is the minimum number of da-ecards that uniquely determines $G.$ The adversary degree associated edge reconstruction number of a graph $G, adern(G,$ is the minimum number $k$ such that every collection of $k$ da-ecards of $G$ uniquely determines $G.$ The maximal subgraph without end vertices of a graph $G$ which is not a tree is the pruned graph of $G.$ It is shown that $dern$ of complete multipartite graphs and some connected graphs with regular pruned graph is $1$ or $2.$ We also determine $dern$ and $adern$ of corona product of standard graphs.
Modular Stellarator Fusion Reactor concept
International Nuclear Information System (INIS)
Miller, R.L.; Krakowski, R.A.
1981-08-01
A preliminary conceptual study is made of the Modular Stellarator Reactor (MSR). A steady-state ignited, DT-fueled, magnetic fusion reactor is proposed for use as a central electric-power station. The MSR concept combines the physics of the classic stellarator confinement topology with an innovative, modular-coil design. Parametric tradeoff calculations are described, leading to the selection of an interim design point for a 4-GWt plant based on Alcator transport scaling and an average beta value of 0.04 in an l = 2 system with a plasma aspect ratio of 11. The physics basis of the design point is described together with supporting magnetics, coil-force, and stress computations. The approach and results presented herein will be modified in the course of ongoing work to form a firmer basis for a detailed conceptual design of the MSR
CP violation and modular symmetries
Dent, Thomas
2001-01-01
We reconsider the origin of CP violation in fundamental theory. Existing string models of spontaneous CP violation make ambiguous predictions, due to the arbitrariness of CP transformation and the apparent non-invariance of the results under duality. We find an unambiguous modular CP invariance condition, applicable to predictive models of spontaneous CP violation, which circumvents these problems; it strongly constrains CP violation by heterotic string moduli. The dilaton is also evaluated a...
Modularity in Sensory Auditory Memory
Clement, Sylvain; Moroni, Christine; Samson, Séverine
2004-01-01
The goal of this paper was to review various experimental and neuropsychological studies that support the modular conception of auditory sensory memory or auditory short-term memory. Based on initial findings demonstrating that verbal sensory memory system can be dissociated from a general auditory memory store at the functional and anatomical levels. we reported a series of studies that provided evidence in favor of multiple auditory sensory stores specialized in retaining eit...
A Modular Instant Messaging System
Mohamad Raad; Zouhair Bazzal; Majd Ghareeb; Hanan Farhat; Semar Bahmad
2017-01-01
Instant Messaging (IM) Android applications are a trend nowadays. These applications are categorized according to their features: usability, flexibility, privacy and security. However, IM applications tend to be inflexible in terms of functionality offered. The “Dble-U” system was developed as a solution to this inflexibility, with a focus on privacy as an example use case. “Dble-U” is a configurable modular system consisting of an Android chatting application, a privacy controller applicatio...
CAMAC modular programmable function generator
Energy Technology Data Exchange (ETDEWEB)
Turner, G.W.; Suehiro, S.; Hendricks, R.W.
1980-12-01
A CAMAC modular programmable function generator has been developed. The device contains a 1024 word by 12-bit memory, a 12-bit digital-to-analog converter with a 600 ns settling time, an 18-bit programmable frequency register, and two programmable trigger output registers. The trigger registers can produce programmed output logic transitions at various (binary) points in the output function curve, and are used to synchronize various other data acquisition devices with the function curve.
CAMAC modular programmable function generator
International Nuclear Information System (INIS)
Turner, G.W.; Suehiro, S.; Hendricks, R.W.
1980-12-01
A CAMAC modular programmable function generator has been developed. The device contains a 1024 word by 12-bit memory, a 12-bit digital-to-analog converter with a 600 ns settling time, an 18-bit programmable frequency register, and two programmable trigger output registers. The trigger registers can produce programmed output logic transitions at various (binary) points in the output function curve, and are used to synchronize various other data acquisition devices with the function curve
Modular programming method at JAERI
International Nuclear Information System (INIS)
Asai, Kiyoshi; Katsuragi, Satoru
1982-02-01
In this report the histories, concepts and a method for the construction and maintenance of nuclear code systems of Japan Atomic Energy Research Institute (JAERI) are presented. The method is mainly consisted of novel computer features. The development process of the features and experiences with them which required many man-months and efforts of scientists and engineers of JAERI and a computer manufacturer are also described. One of the features is a file handling program named datapool. The program is being used in code systems which are under development at JAERI. The others are computer features such as dynamic linking, reentrant coding of Fortran programs, interactive programming facility, document editor, quick system output viewer and editor, flexible man-machine interactive Fortran executor, and selective use of time-sharing or batch oriented computer in an interactive porgramming environment. In 1980 JAERI has replaced its two old computer systems by three FACOM M-200 computer systems and they have such features as mentioned above. Since 1981 most code systems, or even big single codes can be changed to modular code systems even if the developers or users of the systems will not recognize the fact that they are using modular code systems. The purpose of this report is to describe our methodology of modular programming from aspects of computer features and some of their applications to nuclear codes to get sympathetic understanding of it from persons of organizations who are concerned with the effective use of computers, especially, in nuclear research fields. (author)
Princeton Plasma Physics Laboratory Annual Site Environmental Report for Calendar Year 2001
Energy Technology Data Exchange (ETDEWEB)
Virginia L. Finley
2004-04-07
The purpose of this report is to provide the U.S. Department of Energy (DOE) and the public with information on the level of radioactive and nonradioactive pollutants (if any) that are added to the environment as a result of the Princeton Plasma Physics Laboratory's (PPPL) operations. The results of the 2001 environmental surveillance and monitoring program for PPPL are presented and discussed. The report also summarizes environmental initiatives, assessments, and programs that were undertaken in 2001. PPPL has engaged in fusion energy research since 1951. The vision of the Laboratory is to create innovations to make fusion power a practical reality--a clean, alternative energy source. The Year 2001 marked the third year of National Spherical Torus Experiment (NSTX) operations and Tokamak Fusion Test Reactor (TFTR) dismantlement and deconstruction activities. A collaboration among fourteen national laboratories, universities, and research institutions, the NSTX is a major element in the U.S. Fusion Energy Sciences Program. It has been designed to test the physics principles of spherical torus (ST) plasmas. The ST concept could play an important role in the development of smaller, more economical fusion reactors. In 2001, PPPL's radiological environmental monitoring program measured tritium in the air at on- and off-site sampling stations. PPPL is capable of detecting small changes in the ambient levels of tritium by using highly sensitive monitors. The operation of an in-stack monitor located on D-site is a requirement of the National Emission Standard for Hazardous Air Pollutants (NESHAPs) regulations; also included in PPPL's radiological environmental monitoring program, are water monitoring--precipitation, ground-, surface-, and waste-waters. PPPL's radiological monitoring program characterized the ambient, background levels of tritium in the environment and from the D-site stack; the data are presented in this report. Groundwater monitoring
Princeton Plasma Physics Laboratory Annual Site Environmental Report for Calendar Year 2001
International Nuclear Information System (INIS)
Finley, Virginia L.
2004-01-01
The purpose of this report is to provide the U.S. Department of Energy (DOE) and the public with information on the level of radioactive and nonradioactive pollutants (if any) that are added to the environment as a result of the Princeton Plasma Physics Laboratory's (PPPL) operations. The results of the 2001 environmental surveillance and monitoring program for PPPL are presented and discussed. The report also summarizes environmental initiatives, assessments, and programs that were undertaken in 2001. PPPL has engaged in fusion energy research since 1951. The vision of the Laboratory is to create innovations to make fusion power a practical reality--a clean, alternative energy source. The Year 2001 marked the third year of National Spherical Torus Experiment (NSTX) operations and Tokamak Fusion Test Reactor (TFTR) dismantlement and deconstruction activities. A collaboration among fourteen national laboratories, universities, and research institutions, the NSTX is a major element in the U.S. Fusion Energy Sciences Program. It has been designed to test the physics principles of spherical torus (ST) plasmas. The ST concept could play an important role in the development of smaller, more economical fusion reactors. In 2001, PPPL's radiological environmental monitoring program measured tritium in the air at on- and off-site sampling stations. PPPL is capable of detecting small changes in the ambient levels of tritium by using highly sensitive monitors. The operation of an in-stack monitor located on D-site is a requirement of the National Emission Standard for Hazardous Air Pollutants (NESHAPs) regulations; also included in PPPL's radiological environmental monitoring program, are water monitoring--precipitation, ground-, surface-, and waste-waters. PPPL's radiological monitoring program characterized the ambient, background levels of tritium in the environment and from the D-site stack; the data are presented in this report. Groundwater monitoring continue d under a
Self-organized modularization in evolutionary algorithms.
Dauscher, Peter; Uthmann, Thomas
2005-01-01
The principle of modularization has proven to be extremely successful in the field of technical applications and particularly for Software Engineering purposes. The question to be answered within the present article is whether mechanisms can also be identified within the framework of Evolutionary Computation that cause a modularization of solutions. We will concentrate on processes, where modularization results only from the typical evolutionary operators, i.e. selection and variation by recombination and mutation (and not, e.g., from special modularization operators). This is what we call Self-Organized Modularization. Based on a combination of two formalizations by Radcliffe and Altenberg, some quantitative measures of modularity are introduced. Particularly, we distinguish Built-in Modularity as an inherent property of a genotype and Effective Modularity, which depends on the rest of the population. These measures can easily be applied to a wide range of present Evolutionary Computation models. It will be shown, both theoretically and by simulation, that under certain conditions, Effective Modularity (as defined within this paper) can be a selection factor. This causes Self-Organized Modularization to take place. The experimental observations emphasize the importance of Effective Modularity in comparison with Built-in Modularity. Although the experimental results have been obtained using a minimalist toy model, they can lead to a number of consequences for existing models as well as for future approaches. Furthermore, the results suggest a complex self-amplification of highly modular equivalence classes in the case of respected relations. Since the well-known Holland schemata are just the equivalence classes of respected relations in most Simple Genetic Algorithms, this observation emphasizes the role of schemata as Building Blocks (in comparison with arbitrary subsets of the search space).
International Nuclear Information System (INIS)
Hammett, G.W.; Kaita, R.; Wilson, J.R.
1988-01-01
Ion cyclotron radiofrequency heating experiments were performed with a 3 He minority ion species in a 4 He majority plasma in the Princeton Large Torus. The energetic 3 He ion 'tail' was measured directly with a charge exchange neutral analyser for the first time. Comparisons with bounce averaged quasi-linear calculations suggest a modestly peaked radiofrequency power deposition profile. The double charge exchange process 3 He ++ + 4 He o -> 3 He o + 4 He ++ demonstrated in these measurements may be useful as part of an alpha particle diagnostic in a fusion reactor experiment. (author). 21 refs, 4 figs
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)
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...
Predicting catastrophes of non-autonomous networks with visibility graphs and horizontal visibility
Zhang, Haicheng; Xu, Daolin; Wu, Yousheng
2018-05-01
Prediction of potential catastrophes in engineering systems is a challenging problem. We first attempt to construct a complex network to predict catastrophes of a multi-modular floating system in advance of their occurrences. Response time series of the system can be mapped into an virtual network by using visibility graph or horizontal visibility algorithm. The topology characteristics of the networks can be used to forecast catastrophes of the system. Numerical results show that there is an obvious corresponding relationship between the variation of topology characteristics and the onset of catastrophes. A Catastrophe Index (CI) is proposed as a numerical indicator to measure a qualitative change from a stable state to a catastrophic state. The two approaches, the visibility graph and horizontal visibility algorithms, are compared by using the index in the reliability analysis with different data lengths and sampling frequencies. The technique of virtual network method is potentially extendable to catastrophe predictions of other engineering systems.
Graph configuration model based evaluation of the education-occupation match.
Gadar, Laszlo; Abonyi, Janos
2018-01-01
To study education-occupation matchings we developed a bipartite network model of education to work transition and a graph configuration model based metric. We studied the career paths of 15 thousand Hungarian students based on the integrated database of the National Tax Administration, the National Health Insurance Fund, and the higher education information system of the Hungarian Government. A brief analysis of gender pay gap and the spatial distribution of over-education is presented to demonstrate the background of the research and the resulted open dataset. We highlighted the hierarchical and clustered structure of the career paths based on the multi-resolution analysis of the graph modularity. The results of the cluster analysis can support policymakers to fine-tune the fragmented program structure of higher education.
Reconstructing Topological Graphs and Continua
Gartside, Paul; Pitz, Max F.; Suabedissen, Rolf
2015-01-01
The deck of a topological space $X$ is the set $\\mathcal{D}(X)=\\{[X \\setminus \\{x\\}] \\colon x \\in X\\}$, where $[Z]$ denotes the homeomorphism class of $Z$. A space $X$ is topologically reconstructible if whenever $\\mathcal{D}(X)=\\mathcal{D}(Y)$ then $X$ is homeomorphic to $Y$. It is shown that all metrizable compact connected spaces are reconstructible. It follows that all finite graphs, when viewed as a 1-dimensional cell-complex, are reconstructible in the topological sense, and more genera...
Decomposing a graph into bistars
DEFF Research Database (Denmark)
Thomassen, Carsten
2013-01-01
Bárat and the present author conjectured that, for each tree T, there exists a natural number kT such that the following holds: If G is a kT-edge-connected graph such that |E(T)| divides |E(G)|, then G has a T-decomposition, that is, a decomposition of the edge set into trees each of which...... is isomorphic to T. The conjecture has been verified for infinitely many paths and for each star. In this paper we verify the conjecture for an infinite family of trees that are neither paths nor stars, namely all the bistars S(k,k+1)....
Vertex labeling and routing in self-similar outerplanar unclustered graphs modeling complex networks
International Nuclear Information System (INIS)
Comellas, Francesc; Miralles, Alicia
2009-01-01
This paper introduces a labeling and optimal routing algorithm for a family of modular, self-similar, small-world graphs with clustering zero. Many properties of this family are comparable to those of networks associated with technological and biological systems with low clustering, such as the power grid, some electronic circuits and protein networks. For these systems, the existence of models with an efficient routing protocol is of interest to design practical communication algorithms in relation to dynamical processes (including synchronization) and also to understand the underlying mechanisms that have shaped their particular structure.
On path hypercompositions in graphs and automata
Directory of Open Access Journals (Sweden)
Massouros Christos G.
2016-01-01
Full Text Available The paths in graphs define hypercompositions in the set of their vertices and therefore it is feasible to associate hypercompositional structures to each graph. Similarly, the strings of letters from their alphabet, define hypercompositions in the automata, which in turn define the associated hypergroups to the automata. The study of the associated hypercompositional structures gives results in both, graphs and automata theory.
Attack Graph Construction for Security Events Analysis
Directory of Open Access Journals (Sweden)
Andrey Alexeevich Chechulin
2014-09-01
Full Text Available The paper is devoted to investigation of the attack graphs construction and analysis task for a network security evaluation and real-time security event processing. Main object of this research is the attack modeling process. The paper contains the description of attack graphs building, modifying and analysis technique as well as overview of implemented prototype for network security analysis based on attack graph approach.
Steiner Distance in Graphs--A Survey
Mao, Yaping
2017-01-01
For a connected graph $G$ of order at least $2$ and $S\\subseteq V(G)$, the \\emph{Steiner distance} $d_G(S)$ among the vertices of $S$ is the minimum size among all connected subgraphs whose vertex sets contain $S$. In this paper, we summarize the known results on the Steiner distance parameters, including Steiner distance, Steiner diameter, Steiner center, Steiner median, Steiner interval, Steiner distance hereditary graph, Steiner distance stable graph, average Steiner distance, and Steiner ...
Density conditions for triangles in multipartite graphs
DEFF Research Database (Denmark)
Bondy, Adrian; Shen, Jin; Thomassé, Stephan
2006-01-01
subgraphs in G. We investigate in particular the case where G is a complete multipartite graph. We prove that a finite tripartite graph with all edge densities greater than the golden ratio has a triangle and that this bound is best possible. Also we show that an infinite-partite graph with finite parts has...... a triangle, provided that the edge density between any two parts is greater than 1/2....
Efficient Algorithmic Frameworks via Structural Graph Theory
2016-10-28
constant. For example, they measured that, on large samples of the entire network, the Amazon graph has average degree 17.7, the Facebook graph has average...department heads’ opinions of departments, and generally lack transparency and well-defined measures . On the other hand, the National Research Council (the...Efficient and practical resource block allocation for LTE -based D2D network via graph coloring. Wireless Networks 20(4): 611-624 (2014) 50. Hossein
Decomposing a planar graph into an independent set and a 3-degenerate graph
DEFF Research Database (Denmark)
Thomassen, Carsten
2001-01-01
We prove the conjecture made by O. V. Borodin in 1976 that the vertex set of every planar graph can be decomposed into an independent set and a set inducing a 3-degenerate graph. (C) 2001 Academic Press....
Modular properties of 6d (DELL) systems
Aminov, G.; Mironov, A.; Morozov, A.
2017-11-01
If super-Yang-Mills theory possesses the exact conformal invariance, there is an additional modular invariance under the change of the complex bare charge [InlineMediaObject not available: see fulltext.]. The low-energy Seiberg-Witten prepotential ℱ( a), however, is not explicitly invariant, because the flat moduli also change a - → a D = ∂ℱ/∂ a. In result, the prepotential is not a modular form and depends also on the anomalous Eisenstein series E 2. This dependence is usually described by the universal MNW modular anomaly equation. We demonstrate that, in the 6 d SU( N) theory with two independent modular parameters τ and \\widehat{τ} , the modular anomaly equation changes, because the modular transform of τ is accompanied by an ( N -dependent!) shift of \\widehat{τ} and vice versa. This is a new peculiarity of double-elliptic systems, which deserves further investigation.
Modular Design in Treaty Verification Equipment
Energy Technology Data Exchange (ETDEWEB)
Macarthur, Duncan Whittemore [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Benz, Jacob [Pacific Northwest National Lab. (PNNL), Richland, WA (United States); Tolk, Keith [Milagro Consulting, Albuquerque, NM (United States); Weber, Tom [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
2015-01-27
It is widely believed that modular design is a good thing. However, there are often few explicit arguments, or even an agreed range of definitions, to back up this belief. In this paper, we examine the potential range of design modularity, the implications of various amounts of modularity, and the advantages and disadvantages of each level of modular construction. We conclude with a comparison of the advantages and disadvantages of each type, as well as discuss many caveats that should be observed to take advantage of the positive features of modularity and minimize the effects of the negative. The tradeoffs described in this paper will be evaluated during the conceptual design to determine what amount of modularity should be included.
Modular Robotics in an African Context
DEFF Research Database (Denmark)
Lund, Henrik Hautop
2011-01-01
In this paper, we review the concept, development and use of modular robotic devices for education, health improvements, and business in Africa. The modular robotics inspired technology has the advantage of allowing any user easy access to a physical construction of new and advanced technology. We...... conceptualized several educational tools inspired by modular robotics for contextualized IT education in Tanzania, leading to a novel IT degree program and the development of East Africa’s first science and business park in Iringa, Tanzania. The prototypes inspired by modular robotics were developed in the local......, rural context and tested by local users in hospitals and rehabilitation centres. In this paper, we review the development of both modular building blocks for education and modular robotic tiles for rehabilitation in Tanzania....
Graph algorithms in the titan toolkit.
Energy Technology Data Exchange (ETDEWEB)
McLendon, William Clarence, III; Wylie, Brian Neil
2009-10-01
Graph algorithms are a key component in a wide variety of intelligence analysis activities. The Graph-Based Informatics for Non-Proliferation and Counter-Terrorism project addresses the critical need of making these graph algorithms accessible to Sandia analysts in a manner that is both intuitive and effective. Specifically we describe the design and implementation of an open source toolkit for doing graph analysis, informatics, and visualization that provides Sandia with novel analysis capability for non-proliferation and counter-terrorism.
Xu, Kexiang; Trinajstić, Nenad
2015-01-01
This is the first book to focus on the topological index, the Harary index, of a graph, including its mathematical properties, chemical applications and some related and attractive open problems. This book is dedicated to Professor Frank Harary (1921—2005), the grandmaster of graph theory and its applications. It has be written by experts in the field of graph theory and its applications. For a connected graph G, as an important distance-based topological index, the Harary index H(G) is defined as the sum of the reciprocals of the distance between any two unordered vertices of the graph G. In this book, the authors report on the newest results on the Harary index of a graph. These results mainly concern external graphs with respect to the Harary index; the relations to other topological indices; its properties and applications to pure graph theory and chemical graph theory; and two significant variants, i.e., additively and multiplicatively weighted Harary indices. In the last chapter, we present a number o...
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 ...
An algebraic approach to graph codes
DEFF Research Database (Denmark)
Pinero, Fernando
This thesis consists of six chapters. The first chapter, contains a short introduction to coding theory in which we explain the coding theory concepts we use. In the second chapter, we present the required theory for evaluation codes and also give an example of some fundamental codes in coding...... theory as evaluation codes. Chapter three consists of the introduction to graph based codes, such as Tanner codes and graph codes. In Chapter four, we compute the dimension of some graph based codes with a result combining graph based codes and subfield subcodes. Moreover, some codes in chapter four...
DEFF Research Database (Denmark)
Jensen, T.R.; Thomassen, Carsten
2000-01-01
If k is a prime power, and G is a graph with n vertices, then a k-coloring of G may be considered as a vector in GF(k)(n). We prove that the subspace of GF(3)(n) spanned by all 3-colorings of a planar triangle-free graph with n vertices has dimension n. In particular, any such graph has at least n...... - 1 nonequivalent 3-colorings, and the addition of any edge or any vertex of degree 3 results in a 3-colorable graph. (C) 2000 John Wiley & Sons, Inc....
Interactive Graph Layout of a Million Nodes
Directory of Open Access Journals (Sweden)
Peng Mi
2016-12-01
Full Text Available Sensemaking of large graphs, specifically those with millions of nodes, is a crucial task in many fields. Automatic graph layout algorithms, augmented with real-time human-in-the-loop interaction, can potentially support sensemaking of large graphs. However, designing interactive algorithms to achieve this is challenging. In this paper, we tackle the scalability problem of interactive layout of large graphs, and contribute a new GPU-based force-directed layout algorithm that exploits graph topology. This algorithm can interactively layout graphs with millions of nodes, and support real-time interaction to explore alternative graph layouts. Users can directly manipulate the layout of vertices in a force-directed fashion. The complexity of traditional repulsive force computation is reduced by approximating calculations based on the hierarchical structure of multi-level clustered graphs. We evaluate the algorithm performance, and demonstrate human-in-the-loop layout in two sensemaking case studies. Moreover, we summarize lessons learned for designing interactive large graph layout algorithms on the GPU.
Text-Filled Stacked Area Graphs
DEFF Research Database (Denmark)
Kraus, Martin
2011-01-01
-filled stacked area graphs; i.e., graphs that feature stacked areas that are filled with small-typed text. Since these graphs allow for computing the text layout automatically, it is possible to include large amounts of textual detail with very little effort. We discuss the most important challenges and some...... solutions for the design of text-filled stacked area graphs with the help of an exemplary visualization of the genres, publication years, and titles of a database of several thousand PC games....
Reconstructing Nearly Simple Polytopes from their Graph
Doolittle, Joseph
2017-01-01
We present a partial description of which polytopes are reconstructible from their graphs. This is an extension of work by Blind and Mani (1987) and Kalai (1988), which showed that simple polytopes can be reconstructed from their graphs. In particular, we introduce a notion of $h$-nearly simple and prove that 1-nearly simple and 2-nearly simple polytopes are reconstructible from their graphs. We also give an example of a 3-nearly simple polytope which is not reconstructible from its graph. Fu...
A Reduction of the Graph Reconstruction Conjecture
Directory of Open Access Journals (Sweden)
Monikandan S.
2014-08-01
Full Text Available A graph is said to be reconstructible if it is determined up to isomor- phism from the collection of all its one-vertex deleted unlabeled subgraphs. Reconstruction Conjecture (RC asserts that all graphs on at least three vertices are reconstructible. In this paper, we prove that interval-regular graphs and some new classes of graphs are reconstructible and show that RC is true if and only if all non-geodetic and non-interval-regular blocks G with diam(G = 2 or diam(Ḡ = diam(G = 3 are reconstructible
Total dominator chromatic number of a graph
Directory of Open Access Journals (Sweden)
Adel P. Kazemi
2015-06-01
Full Text Available Given a graph $G$, the total dominator coloring problem seeks a proper coloring of $G$ with the additional property that every vertex in the graph is adjacent to all vertices of a color class. We seek to minimize the number of color classes. We initiate to study this problem on several classes of graphs, as well as finding general bounds and characterizations. We also compare the total dominator chromatic number of a graph with the chromatic number and the total domination number of it.
Equitable Colorings Of Corona Multiproducts Of Graphs
Directory of Open Access Journals (Sweden)
Furmánczyk Hanna
2017-11-01
Full Text Available A graph is equitably k-colorable if its vertices can be partitioned into k independent sets in such a way that the numbers of vertices in any two sets differ by at most one. The smallest k for which such a coloring exists is known as the equitable chromatic number of G and denoted by =(G. It is known that the problem of computation of =(G is NP-hard in general and remains so for corona graphs. In this paper we consider the same model of coloring in the case of corona multiproducts of graphs. In particular, we obtain some results regarding the equitable chromatic number for the l-corona product G ◦l H, where G is an equitably 3- or 4-colorable graph and H is an r-partite graph, a cycle or a complete graph. Our proofs are mostly constructive in that they lead to polynomial algorithms for equitable coloring of such graph products provided that there is given an equitable coloring of G. Moreover, we confirm the Equitable Coloring Conjecture for corona products of such graphs. This paper extends the results from [H. Furmánczyk, K. Kaliraj, M. Kubale and V.J. Vivin, Equitable coloring of corona products of graphs, Adv. Appl. Discrete Math. 11 (2013 103–120].
VT Digital Line Graph Miscellaneous Transmission Lines
Vermont Center for Geographic Information — (Link to Metadata) This datalayer is comprised of Miscellaineous Transmission Lines. Digital line graph (DLG) data are digital representations of cartographic...
Semantic Mining based on graph theory and ontologies. Case Study: Cell Signaling Pathways
Directory of Open Access Journals (Sweden)
Carlos R. Rangel
2016-08-01
Full Text Available In this paper we use concepts from graph theory and cellular biology represented as ontologies, to carry out semantic mining tasks on signaling pathway networks. Specifically, the paper describes the semantic enrichment of signaling pathway networks. A cell signaling network describes the basic cellular activities and their interactions. The main contribution of this paper is in the signaling pathway research area, it proposes a new technique to analyze and understand how changes in these networks may affect the transmission and flow of information, which produce diseases such as cancer and diabetes. Our approach is based on three concepts from graph theory (modularity, clustering and centrality frequently used on social networks analysis. Our approach consists into two phases: the first uses the graph theory concepts to determine the cellular groups in the network, which we will call them communities; the second uses ontologies for the semantic enrichment of the cellular communities. The measures used from the graph theory allow us to determine the set of cells that are close (for example, in a disease, and the main cells in each community. We analyze our approach in two cases: TGF-ß and the Alzheimer Disease.
Directory of Open Access Journals (Sweden)
Gabriel Kocevar
2016-10-01
Full Text Available Purpose: In this work, we introduce a method to classify Multiple Sclerosis (MS patients into four clinical profiles using structural connectivity information. For the first time, we try to solve this question in a fully automated way using a computer-based method. The main goal is to show how the combination of graph-derived metrics with machine learning techniques constitutes a powerful tool for a better characterization and classification of MS clinical profiles.Materials and methods: Sixty-four MS patients (12 Clinical Isolated Syndrome (CIS, 24 Relapsing Remitting (RR, 24 Secondary Progressive (SP, and 17 Primary Progressive (PP along with 26 healthy controls (HC underwent MR examination. T1 and diffusion tensor imaging (DTI were used to obtain structural connectivity matrices for each subject. Global graph metrics, such as density and modularity, were estimated and compared between subjects’ groups. These metrics were further used to classify patients using tuned Support Vector Machine (SVM combined with Radial Basic Function (RBF kernel.Results: When comparing MS patients to HC subjects, a greater assortativity, transitivity and characteristic path length as well as a lower global efficiency were found. Using all graph metrics, the best F-Measures (91.8%, 91.8%, 75.6% and 70.6% were obtained for binary (HC-CIS, CIS-RR, RR-PP and multi-class (CIS-RR-SP classification tasks, respectively. When using only one graph metric, the best F-Measures (83.6%, 88.9% and 70.7% were achieved for modularity with previous binary classification tasks.Conclusion: Based on a simple DTI acquisition associated with structural brain connectivity analysis, this automatic method allowed an accurate classification of different MS patients’ clinical profiles.
Anomalies and modular invariance in string theory
International Nuclear Information System (INIS)
Schellekens, A.N.; Warner, N.P.
1986-01-01
All known anomaly cancellations of heterotic string theories are derived directly from one-loop modular invariance, and are shown to be related to a property of modular functions of weight 2. Using modular invariance infinite classes of anomaly free field theories are constructed in (8m+2) dimensions for any m. A generating function is obtained for the anomalies of string-related field theories in (8m+2) dimensions. (orig.)
KWU's modular approach to HTR commercialization
International Nuclear Information System (INIS)
Frewer, H.; Weisbrodt, I.
1983-01-01
As a way of avoiding the uncertainties, delays and unacceptable commercial risks which have plagued advanced reactor projects in Germany, KWU is advocating a modular approach to commercialization of the high-temperature reactor (HTR), using small size standard reactor units. KWU has received a contract for the study of a co-generation plant based on this modular system. Features of the KWU modular HTR, process heat, gasification, costs and future development are discussed. (UK)
Identification of drivers for modular production
DEFF Research Database (Denmark)
Brunoe, Thomas Ditlev; Bossen, Jacob; Nielsen, Kjeld
2015-01-01
Todays competitive environment in industry creates a need for companies to enhance their ability to introduce new products faster. To increase rampup speed reconfigurable manufacturing systems is a promising concept, however to implement this production platforms and modular manufacturing...... is required. This paper presents an analysis whether and which module drivers from general product development can be applied to the development process of a modular manufacturing system. The result is a compiled list of modular drivers for manufacturing and examples of their use....
The modular high temperature gas cooled reactor
International Nuclear Information System (INIS)
Lutz, D.E.; Lipps, A.J.
1984-01-01
Due to relatively high operating temperatures, the gas-cooled reactor has the potential to serve a wide variety of energy applications. This paper discusses the energy applications which can be served by the modular HTGR, the magnitude of the potential markets, and the HTGR product cost incentives relative to fossil fuel competition. Advantages of the HTGR modular systems are presented along with a description of the design features and performance characteristics of the current reference HTGR modular systems
Modular invariance, chiral anomalies and contact terms
International Nuclear Information System (INIS)
Kutasov, D.
1988-03-01
The chiral anomaly in heterotic strings with full and partial modular invariance in D=2n+2 dimensions is calculated. The boundary terms which were present in previous calculations are shown to be cancelled in the modular invariant case by contact terms, which can be obtained by an appropriate analytic continuation. The relation to the low energy field theory is explained. In theories with partial modular invariance, an expression for the anomaly is obtained and shown to be non zero in general. (author)
Modular Structures in a Multinational Force Headquarters
National Research Council Canada - National Science Library
Stewart, K; Christie, M
2004-01-01
.... It is proposed that future Multinational Force (MNF) military headquarters (HQ) can achieve this flexibility through a modular organizational structure enabled by networked information management and communication technologies...
A Modular SOS for Action Notation - Revisited
DEFF Research Database (Denmark)
Mosses, Peter David
A draft modular SOS for the new version of AN, referred to as AN-2, has been available since 2000. It is written in CASL and has been checked for well-formedness using CATS (CASL Tool Set). It appears to be significantly more accessible than the original SOS of AN-1. However, it now appears......-notation for the modular SOS rules. After discussing the issues, we look at some illustrative examples taken from an improved modular SOS of AN-2 (in preparation). We also look at the possibility of empirical testing of the modular SOS by a straightforward translation to Prolog....
Mapping Modular SOS to Rewriting Logic
DEFF Research Database (Denmark)
Braga, Christiano de Oliveira; Haeusler, Erik Hermann; Meseguer, José
Modular SOS (MSOS) is a framework created to improve the modularity of structural operational semantics specifications, a formalism frequently used in the fields of programming languages semantics and process algebras. With the objective of defining formal tools to support the execution and verif......Modular SOS (MSOS) is a framework created to improve the modularity of structural operational semantics specifications, a formalism frequently used in the fields of programming languages semantics and process algebras. With the objective of defining formal tools to support the execution...
Mapping Modular SOS to Rewriting Logic
DEFF Research Database (Denmark)
Braga, Christiano de Oliveira; Haeusler, Edward Hermann; Meseguer, José
2003-01-01
Modular SOS (MSOS) is a framework created to improve the modularity of structural operational semantics specifications, a formalism frequently used in the fields of programming languages semantics and process algebras. With the objective of defining formal tools to support the execution and verif......Modular SOS (MSOS) is a framework created to improve the modularity of structural operational semantics specifications, a formalism frequently used in the fields of programming languages semantics and process algebras. With the objective of defining formal tools to support the execution...
Modular representation and analysis of fault trees
Energy Technology Data Exchange (ETDEWEB)
Olmos, J; Wolf, L [Massachusetts Inst. of Tech., Cambridge (USA). Dept. of Nuclear Engineering
1978-08-01
An analytical method to describe fault tree diagrams in terms of their modular compositions is developed. Fault tree structures are characterized by recursively relating the top tree event to all its basic component inputs through a set of equations defining each of the modulus for the fault tree. It is shown that such a modular description is an extremely valuable tool for making a quantitative analysis of fault trees. The modularization methodology has been implemented into the PL-MOD computer code, written in PL/1 language, which is capable of modularizing fault trees containing replicated components and replicated modular gates. PL-MOD in addition can handle mutually exclusive inputs and explicit higher order symmetric (k-out-of-n) gates. The step-by-step modularization of fault trees performed by PL-MOD is demonstrated and it is shown how this procedure is only made possible through an extensive use of the list processing tools available in PL/1. A number of nuclear reactor safety system fault trees were analyzed. PL-MOD performed the modularization and evaluation of the modular occurrence probabilities and Vesely-Fussell importance measures for these systems very efficiently. In particular its execution time for the modularization of a PWR High Pressure Injection System reduced fault tree was 25 times faster than that necessary to generate its equivalent minimal cut-set description using MOCUS, a code considered to be fast by present standards.
Problems in the theory of modular forms
Murty, M Ram; Graves, Hester
2016-01-01
This book introduces the reader to the fascinating world of modular forms through a problem-solving approach. As such, besides researchers, the book can be used by the undergraduate and graduate students for self-instruction. The topics covered include q-series, the modular group, the upper half-plane, modular forms of level one and higher level, the Ramanujan τ-function, the Petersson inner product, Hecke operators, Dirichlet series attached to modular forms and further special topics. It can be viewed as a gentle introduction for a deeper study of the subject. Thus, it is ideal for non-experts seeking an entry into the field. .
Towards a Standard for Modular Petri Nets
DEFF Research Database (Denmark)
Kindler, Ekkart; Petrucci, Laure
2009-01-01
concepts could or should be subject to import and export in high-level Petri nets. In this paper, we formalise a minimal version of modular high-level Petri nets, which is based on the concepts of modular PNML. This shows that modular PNML can be formalised once a specific version of Petri net is fixed....... Moreover, we present and discuss some more advanced features of modular Petri nets that could be included in the standard. This way, we provide a formal foundation and a basis for a discussion of features to be included in the upcoming standard of a module concept for Petri nets in general and for high-level...