Graphs in L A TEX. Robert A. Beeler. January 8, 2017
|
|
- Alicia Simpson
- 5 years ago
- Views:
Transcription
1 Graphs in L A TEX Robert A. Beeler January 8, Introdution This doument is to provide a quik and dirty guide for building graphs in L A TEX. Muh of the doument is devoted to examples of things that you an do with graphs in L A TEX. No doubt that there are a number of things that I have negleted to inlude in this doument. Mainly, this is beause there are things that I have never had reason to do (yet) and haven t figured out. This being said, if you figure something out that I haven t figured out, then I would be honored if you would let me know. This way, I an add these doument next time I update it. In most ases, I have simply inluded output in this doument. However, as I am also inluding the orresponding Tex ode, you an generate it yourself. First of all, you will need to add several pakages: pstriks, pst-node, and pst-plot. These an be added in the preamble using the ommand \usepakage{pstriks,pst-node,pst-plot}. Next, a word about ompiling your ode. I use the WinEdt ompiler (MiKTeX). When ompiling, I get the best result if I use the L A TEXompiler (this reates a dvi file). I then onvert the dvi file to a ps (postsript) file. Finally, I onvert the postsript to a pdf. Department of Mathematis and Statistis, East Tennessee State University, Johnson City, TN USA beelerr@etsu.edu 1
2 2 2 Basi ommands First of all, you need to reate an environment for your graph. To begin this, use the ommand \pspiture(a,b). You end this environment with the ommand \endpspiture. In the \pspiture(a,b), you fill in speifi numbers for a and b. This reates a box for you to work in. This box is bounded by the lines x = 0, x = a, y = 0, and y = b. NOTE: L A TEXis so powerful that you an break the rules of L A TEXwithin L A TEX. So you an plae points outside of the box that you reated. However, you may get unexpeted results. Next, you want to populate the box with verties. This is done with the ommand \node[](x,y){size}{label}. The brakets an be filled with options, whih we will talk about later. By default, you have a hollow vertex. The (x, y) gives the Cartesian oordinate where you will plae the vertex. Instead of size, you will plae a numeri value whih determines the size of the vertex. Finally, you replae label with a mnemoni that you an refer to later. So, \node[](1.5,0){.3}{ne} reates a hollow vertex of size.3 at point (1.5,0) with label ne. After you have plaed several verties in your box, you an onnet them. This is done with the ommand\nline[]{vertex1}{vertex2}. The brakets an be filled with options that we will disuss later. vertex1 you will replae with the mnemoni of the first endpoint of the edge. Likewise, vertex2 will be replaed with the label of the seond endpoint of the edge. Now, let s pull it all together. Suppose that we want a box of width 2 and height. There are two verties. The first is size.1 and is at (1,1) (label v1). The seond is at (2,3) and is size.3 (label v2). They are onneted by an edge. Here is the required ode: \pspiture(2,) \node[](1,1){.1}{v1} \node[](2,3){.3}{v2} \nline[]{v1}{v2} \endpspiture Here is the result:
3 3 Notie that the assigned labels don t atually appear in your graph. For this reason, you may also want to add labels to your graph. This is aomplished with the ommand \rput(x,y){text}. Again, (x, y) gives the oordinates where you will plae the label. Replae text with your desired label. Suppose that we want to modify the above graph to plae label Q above the vertex at (1,1), label X inside of the vertex at (2,3), and label 7 below and to the right of the edge. This is aomplished with the ode: \pspiture(2,) \node[](1,1){.1}{v1} \node[](2,3){.3}{v2} \rput(1,1.){$q$} \rput(2,3){$x$} \nline[]{v1}{v2} \rput(1.8,1.7){7} \endpspiture Here is the result: X Q 7 NOTE: When using \rput it sometimes takes a bit of trial and error to get your labels right where you want them. This is espeially true when labeling edges or graphs with a lot of verties or edges.
4 3 Options and variations One option that you may want to take advantage of is olor. Color an be added to be added to both edges and verties. There are various olors available, inluding blue, red, yellow, orange, purple, green, blak, and gray. For verties, add the line fillolor=olor, fillstyle=solid inside the braes. Likewise, we an add olor to edges using the ommand lineolor=olor inside of the braes. As usual, you replae olor with your hosen olor. Often, journals want to print in blak and white, but you still want to distinguish types of verties. One way is to use dotted and dashed lines. This is done by adding the lines linestyle=dotted and linestyle=dashed, respetively, within the braes of \nline. A sample output that mixes the different options is below. Another way to distinguish verties is with the \nbox ommand. Two example outputs are below.
5 5 Another option is to use multiple edges or direted edges. Normally, L A TEXreates straight lines between verties. To give it a bit of urve, use the ommand \nar[arangle=a]{v1}{v2}. Here, a is the angle of ar, relative to the straight between the verties labeled v1 and v2. Note that you an add the various olor and style options to the \nar ommand. To reate a direted edge, we an modify either the \nline or the \nar ommand by inluding {->,arrowsize=size} after the braes. Note that you need to replae size with how big you want the arrow to be (say 6pt). A sample output is below. a b s d t e f Making loops an be triky. One option is to use the \nar ommand along with an invisible vertex. To reate an invisible vertex, use the ommand\node*(x,y){0}{label}. This is useful if you need a loop or to make an edge go around a group of verties. An example output is given below.
6 6 x 1, x 1,5 x 1,6 x 2,1 x 3,3 x 3, x,2 x,3 x 1 x 2 x 3 x x 1,1 x 1,2 x 1,3 x 3,1 x 3,2 x,1 Figure 1: The aterpillar P (6,1,,3) Figures and tables Usually, when we inlude a graph in either a paper or a thesis, we plae it in a figure environment. This allows us to aption it and refer to it later. To enter into the figure environment, use \begin{figure}. To end the figure environment, use \end{figure}. You an add aptions and labels as usual. For best results, I usually plae the graph itself in the enter environment. To enter this environment, use \begin{enter}. To end it, use \end{enter}. By default, figures are plaed on the next available page, as we see with Figure 1 (whih appears immediately after this paragraph in the ode). Other options for the figure environment are \begin{figure}[t] (plaes the figure at the top of the urrent page), \begin{figure}[h] (plaes the figure HERE in the text), and \begin{figure}[b] (plaes the figure at the bottom of the urrent page). In my experiene, it is usually best to avoid these qualifiers and let L A TEXdetermine the best plae to put your figure. Often times, we want multiple graphs to appear next to eah other or on top of eah other in the same figure. This is aomplished using the tabular environment. An example output is given below in Figure 2.
7 7 u 1 u 1 u 1 u u 2 u u 2 u 5 u 2 u 3 u 3 u u 3 K 1, B 1 B 2 v 0 v 0 v 0 v 1 v 2 v 3 v v P 5 v Figure 2: A tabular example 5 Additional examples We end this manual by providing several templates for graphs of various sizes. As usual,i simply provide the output in this doument and refer you to the assoiated tex ode. a b d e f g h i
8 g i n a 3 f h 7 1 k 5 8 m 3 b d j l 0 1 a b 2 5 3
Chapter 2: Introduction to Maple V
Chapter 2: Introdution to Maple V 2-1 Working with Maple Worksheets Try It! (p. 15) Start a Maple session with an empty worksheet. The name of the worksheet should be Untitled (1). Use one of the standard
More informationCalculation of typical running time of a branch-and-bound algorithm for the vertex-cover problem
Calulation of typial running time of a branh-and-bound algorithm for the vertex-over problem Joni Pajarinen, Joni.Pajarinen@iki.fi Otober 21, 2007 1 Introdution The vertex-over problem is one of a olletion
More informationReading Object Code. A Visible/Z Lesson
Reading Objet Code A Visible/Z Lesson The Idea: When programming in a high-level language, we rarely have to think about the speifi ode that is generated for eah instrution by a ompiler. But as an assembly
More informationVideo Data and Sonar Data: Real World Data Fusion Example
14th International Conferene on Information Fusion Chiago, Illinois, USA, July 5-8, 2011 Video Data and Sonar Data: Real World Data Fusion Example David W. Krout Applied Physis Lab dkrout@apl.washington.edu
More informationReading Object Code. A Visible/Z Lesson
Reading Objet Code A Visible/Z Lesson The Idea: When programming in a high-level language, we rarely have to think about the speifi ode that is generated for eah instrution by a ompiler. But as an assembly
More informationType of document: Usebility Checklist
Projet: JEGraph Type of doument: Usebility Cheklist Author: Max Bryan Version: 1.30 2011 Envidate GmbH Type of Doumet Developer guidelines User guidelines Dutybook Speifiation Programming and testing Test
More informationDrawing lines. Naïve line drawing algorithm. drawpixel(x, round(y)); double dy = y1 - y0; double dx = x1 - x0; double m = dy / dx; double y = y0;
Naïve line drawing algorithm // Connet to grid points(x0,y0) and // (x1,y1) by a line. void drawline(int x0, int y0, int x1, int y1) { int x; double dy = y1 - y0; double dx = x1 - x0; double m = dy / dx;
More informationAn Event Display for ATLAS H8 Pixel Test Beam Data
An Event Display for ATLAS H8 Pixel Test Beam Data George Gollin Centre de Physique des Partiules de Marseille and University of Illinois April 17, 1999 g-gollin@uiu.edu An event display program is now
More informationA Unified Subdivision Scheme for Polygonal Modeling
EUROGRAPHICS 2 / A. Chalmers and T.-M. Rhyne (Guest Editors) Volume 2 (2), Number 3 A Unified Subdivision Sheme for Polygonal Modeling Jérôme Maillot Jos Stam Alias Wavefront Alias Wavefront 2 King St.
More informationColouring contact graphs of squares and rectilinear polygons de Berg, M.T.; Markovic, A.; Woeginger, G.
Colouring ontat graphs of squares and retilinear polygons de Berg, M.T.; Markovi, A.; Woeginger, G. Published in: nd European Workshop on Computational Geometry (EuroCG 06), 0 Marh - April, Lugano, Switzerland
More informationCleanUp: Improving Quadrilateral Finite Element Meshes
CleanUp: Improving Quadrilateral Finite Element Meshes Paul Kinney MD-10 ECC P.O. Box 203 Ford Motor Company Dearborn, MI. 8121 (313) 28-1228 pkinney@ford.om Abstrat: Unless an all quadrilateral (quad)
More informationAlgebra Lab Investigating Trigonometri Ratios You an use paper triangles to investigate the ratios of the lengths of sides of right triangles. Virginia SOL Preparation for G.8 The student will solve realworld
More informationTavultesoft Keyboard Manager. User s Guide and Reference. Tavultesoft
Tavultesoft Keyboard Manager User s Guide and Referene VERSION 4.0 Tavultesoft This doumentation may be freely opied, but the opyright notie must not be altered or removed. No part of this doumentation
More informationPIC A Graphics Language for Typesetting Revised User Manual
Bell Laboratories Murray Hill, New Jersey 07974 Computing Siene Tehnial Report No. 116 PIC A Graphis Language for Typesetting Revised User Manual Brian W. Kernighan Deember, 1984 PIC A Graphis Language
More informationThe Happy Ending Problem
The Happy Ending Problem Neeldhara Misra STATUTORY WARNING This doument is a draft version 1 Introdution The Happy Ending problem first manifested itself on a typial wintery evening in 1933 These evenings
More informationSolutions to Tutorial 2 (Week 9)
The University of Syney Shool of Mathematis an Statistis Solutions to Tutorial (Week 9) MATH09/99: Disrete Mathematis an Graph Theory Semester, 0. Determine whether eah of the following sequenes is the
More informationUCSB Math TI-85 Tutorials: Basics
3 UCSB Math TI-85 Tutorials: Basis If your alulator sreen doesn t show anything, try adjusting the ontrast aording to the instrutions on page 3, or page I-3, of the alulator manual You should read the
More informationENGINEERING update FOR 2.0 PRINTGEN. A C Page 1 of 120 PRINTGEN. Engineering Update (DAA -170)
o ENGINEERING update FOR 2.0 A-09-01159-01-C Page 1 of 120 Speifiations Subjet to Change. Convergent Tehnologies and NGEN are registered trademarks of Convergent Tehnologies, In. Convergent, CT-DBMS, CT-MAIL,
More informationOvidSP Quick Reference Card
OvidSP Quik Referene Card Searh in any of several dynami modes, ombine results, apply limits, use improved researh tools, develop strategies, save searhes, set automati alerts and RSS feeds, share results...
More informationIncremental Mining of Partial Periodic Patterns in Time-series Databases
CERIAS Teh Report 2000-03 Inremental Mining of Partial Periodi Patterns in Time-series Dataases Mohamed G. Elfeky Center for Eduation and Researh in Information Assurane and Seurity Purdue University,
More informationSANDIA REPORT. R. E. Kidner. SAND UC Unlimited Release Printed January MS 0100 Document Processing for DOE/OSTI, (2)
SANDIA REPORT MS Doument Proessing for DOE/OSTI, 763-2 (2) SAND94-3 72 U - 96 Unlimited Release Printed January 995? J Real-Time Data ompression Using a Fixed Huffman Enoding Sheme R. E. Kidner Prepared
More informationGray Codes for Reflectable Languages
Gray Codes for Refletable Languages Yue Li Joe Sawada Marh 8, 2008 Abstrat We lassify a type of language alled a refletable language. We then develop a generi algorithm that an be used to list all strings
More informationDefine - starting approximation for the parameters (p) - observational data (o) - solution criterion (e.g. number of iterations)
Global Iterative Solution Distributed proessing of the attitude updating L. Lindegren (21 May 2001) SAG LL 37 Abstrat. The attitude updating algorithm given in GAIA LL 24 (v. 2) is modified to allow distributed
More informationPathRings. Manual. Version 1.0. Yongnan Zhu December 16,
PathRings Version 1.0 Manual Yongnan Zhu E-mail: yongnan@umb.edu Deember 16, 2014-1 - PathRings This tutorial introdues PathRings, the user interfae and the interation. For better to learn, you will need
More informationAlgorithms for External Memory Lecture 6 Graph Algorithms - Weighted List Ranking
Algorithms for External Memory Leture 6 Graph Algorithms - Weighted List Ranking Leturer: Nodari Sithinava Sribe: Andi Hellmund, Simon Ohsenreither 1 Introdution & Motivation After talking about I/O-effiient
More informationWORKSHOP 20 CREATING PCL FUNCTIONS
WORKSHOP 20 CREATING PCL FUNCTIONS WS20-1 WS20-2 Problem Desription This exerise involves reating two PCL funtions that an be used to easily hange the view of a model. The PCL funtions are reated by reording
More informationMultiple Assignments
Two Outputs Conneted Together Multiple Assignments Two Outputs Conneted Together if (En1) Q
More informationTitle: Time-Based Tree Graphs for Stabilized Force Structure Representations
Paper for the 8 th International Command & Control Researh & Tehnology Symposium Title: Time-Based Tree Graphs for Stabilized Fore Struture Representations Submitted by: Sam Chamberlain U.S. Army Researh
More informationFinding the Equation of a Straight Line
Finding the Equation of a Straight Line You should have, before now, ome aross the equation of a straight line, perhaps at shool. Engineers use this equation to help determine how one quantity is related
More information1 The Knuth-Morris-Pratt Algorithm
5-45/65: Design & Analysis of Algorithms September 26, 26 Leture #9: String Mathing last hanged: September 26, 27 There s an entire field dediated to solving problems on strings. The book Algorithms on
More informationMedial Graphs and the Penrose Polynomial. Joanna A. Ellis-Monaghan Department of Mathematics and Statistics University of Vermont Burlington, VT 05405
Medial Graphs and the Penrose Polynoial Joanna. Ellis-Monaghan Departent of Matheatis and Statistis University of Veront Burlington, VT 05405 Irasea Sariento Departaento de Mateátias CINVESTV v. IPN 2508
More informationCA Release Automation 5.x Implementation Proven Professional Exam (CAT-600) Study Guide Version 1.1
Exam (CAT-600) Study Guide Version 1.1 PROPRIETARY AND CONFIDENTIAL INFORMATION 2016 CA. All rights reserved. CA onfidential & proprietary information. For CA, CA Partner and CA Customer use only. No unauthorized
More informationIntroduction to Seismology Spring 2008
MIT OpenCourseWare http://ow.mit.edu 1.510 Introdution to Seismology Spring 008 For information about iting these materials or our Terms of Use, visit: http://ow.mit.edu/terms. 1.510 Leture Notes 3.3.007
More information1. Introduction. 2. The Probable Stope Algorithm
1. Introdution Optimization in underground mine design has reeived less attention than that in open pit mines. This is mostly due to the diversity o underground mining methods and omplexity o underground
More informationSCREEN LAYOUT AND HANDLING
Sreen layout & handling SCREEN LAYOUT AND HANDLING Generally, 7-1 Keyboard shortuts, 7-3 Keyboard Must Know, 7-5 Generally It is not intended that the manual or on-line Help should replae knowledge of
More informationMulti-Piece Mold Design Based on Linear Mixed-Integer Program Toward Guaranteed Optimality
INTERNATIONAL CONFERENCE ON MANUFACTURING AUTOMATION (ICMA200) Multi-Piee Mold Design Based on Linear Mixed-Integer Program Toward Guaranteed Optimality Stephen Stoyan, Yong Chen* Epstein Department of
More informationwith respect to the normal in each medium, respectively. The question is: How are θ
Prof. Raghuveer Parthasarathy University of Oregon Physis 35 Winter 8 3 R EFRACTION When light travels from one medium to another, it may hange diretion. This phenomenon familiar whenever we see the bent
More informationAnalysis of input and output configurations for use in four-valued CCD programmable logic arrays
nalysis of input and output onfigurations for use in four-valued D programmable logi arrays J.T. utler H.G. Kerkhoff ndexing terms: Logi, iruit theory and design, harge-oupled devies bstrat: s in binary,
More informationSparse Certificates for 2-Connectivity in Directed Graphs
Sparse Certifiates for 2-Connetivity in Direted Graphs Loukas Georgiadis Giuseppe F. Italiano Aikaterini Karanasiou Charis Papadopoulos Nikos Parotsidis Abstrat Motivated by the emergene of large-sale
More informationAN INTRODUCTION TO FORTRAN AND NUMERICAL MODELING
AN INTRODUCTION TO FORTRAN AND NUMERICAL MODELING Dr. L. W. Shwartz Department of Mehanial Engineering University of Delaware September, 2000 INTRODUCTION The first part of this short doument ontains a
More informationGrade 6. Mathematics. Student Booklet SPRING 2009 RELEASED ASSESSMENT QUESTIONS. Assessment of Reading, Writing and Mathematics, Junior Division
Grade 6 Assessment of Reading, Writing and Mathematis, Junior Division Student Booklet Mathematis SPRING 2009 RELEASED ASSESSMENT QUESTIONS Please note: The format of these booklets is slightly different
More informationVertex Unfoldings of Orthogonal Polyhedra: Positive, Negative, and Inconclusive Results
CCCG 2018, Winnipeg, Canada, August 8 10, 2018 Vertex Unfoldings of Orthogonal Polyhedra: Positive, Negative, and Inonlusive Results Luis A. Garia Andres Gutierrrez Isaa Ruiz Andrew Winslow Abstrat We
More informationSmooth Trajectory Planning Along Bezier Curve for Mobile Robots with Velocity Constraints
Smooth Trajetory Planning Along Bezier Curve for Mobile Robots with Veloity Constraints Gil Jin Yang and Byoung Wook Choi Department of Eletrial and Information Engineering Seoul National University of
More informationElectromagnetic Waves
Eletromagneti Waves Physis 6C Eletromagneti (EM) waves are produed by an alternating urrent in a wire. As the harges in the wire osillate bak and forth, the eletri field around them osillates as well,
More information1. The collection of the vowels in the word probability. 2. The collection of real numbers that satisfy the equation x 9 = 0.
C HPTER 1 SETS I. DEFINITION OF SET We begin our study of probability with the disussion of the basi onept of set. We assume that there is a ommon understanding of what is meant by the notion of a olletion
More informationGetting started with Latex
Getting started with Latex Robert G. Niemeyer University of New Mexico, Albuquerque October 15, 2012 What is Latex? Latex is a mathematical typesetting language. Essentially, when you are using Latex to
More informationRed-Black Trees 10/19/2009. Red-Black Trees. Example. Red-Black Properties. Black Height. Example
lgorithms Red-lak Trees 13-2 Red-lak Trees Red-lak Trees ll binar searh tree operations take O(h) time, here h is the height of the tree Therefore, it is important to `balane the tree so that its height
More informationOptimizing Correlated Path Queries in XML Languages. Technical Report CS November 2002
Optimizing Correlated Path Queries in XML Languages Ning Zhang and M. Tamer Özsu Tehnial Report CS-2002-36 November 2002 Shool Of Computer Siene, University of Waterloo, {nzhang,tozsu}@uwaterloo.a 1 Abstrat
More informationOn - Line Path Delay Fault Testing of Omega MINs M. Bellos 1, E. Kalligeros 1, D. Nikolos 1,2 & H. T. Vergos 1,2
On - Line Path Delay Fault Testing of Omega MINs M. Bellos, E. Kalligeros, D. Nikolos,2 & H. T. Vergos,2 Dept. of Computer Engineering and Informatis 2 Computer Tehnology Institute University of Patras,
More informationNONLINEAR BACK PROJECTION FOR TOMOGRAPHIC IMAGE RECONSTRUCTION. Ken Sauer and Charles A. Bouman
NONLINEAR BACK PROJECTION FOR TOMOGRAPHIC IMAGE RECONSTRUCTION Ken Sauer and Charles A. Bouman Department of Eletrial Engineering, University of Notre Dame Notre Dame, IN 46556, (219) 631-6999 Shool of
More informationWe P9 16 Eigenray Tracing in 3D Heterogeneous Media
We P9 Eigenray Traing in 3D Heterogeneous Media Z. Koren* (Emerson), I. Ravve (Emerson) Summary Conventional two-point ray traing in a general 3D heterogeneous medium is normally performed by a shooting
More informationTriangles. Learning Objectives. Pre-Activity
Setion 3.2 Pre-tivity Preparation Triangles Geena needs to make sure that the dek she is building is perfetly square to the brae holding the dek in plae. How an she use geometry to ensure that the boards
More informationCracked Hole Finite Element Modeling
Craked Hole Finite Element Modeling (E-20-F72) Researh Report Submitted to: Lokheed Martin, Program Manager: Dr. Stephen P. Engelstad Prinipal Investigator: Dr. Rami M. Haj-Ali Shool of Civil and Environmental
More informationOrientation of the coordinate system
Orientation of the oordinate system Right-handed oordinate system: -axis by a positive, around the -axis. The -axis is mapped to the i.e., antilokwise, rotation of The -axis is mapped to the -axis by a
More informationA DYNAMIC ACCESS CONTROL WITH BINARY KEY-PAIR
Malaysian Journal of Computer Siene, Vol 10 No 1, June 1997, pp 36-41 A DYNAMIC ACCESS CONTROL WITH BINARY KEY-PAIR Md Rafiqul Islam, Harihodin Selamat and Mohd Noor Md Sap Faulty of Computer Siene and
More informationEXODUS II: A Finite Element Data Model
SAND92-2137 Unlimited Release Printed November 1995 Distribution Category UC-705 EXODUS II: A Finite Element Data Model Larry A. Shoof, Vitor R. Yarberry Computational Mehanis and Visualization Department
More informationarxiv: v1 [cs.gr] 10 Apr 2015
REAL-TIME TOOL FOR AFFINE TRANSFORMATIONS OF TWO DIMENSIONAL IFS FRACTALS ELENA HADZIEVA AND MARIJA SHUMINOSKA arxiv:1504.02744v1 s.gr 10 Apr 2015 Abstrat. This work introdues a novel tool for interative,
More informationSupplementary Material: Geometric Calibration of Micro-Lens-Based Light-Field Cameras using Line Features
Supplementary Material: Geometri Calibration of Miro-Lens-Based Light-Field Cameras using Line Features Yunsu Bok, Hae-Gon Jeon and In So Kweon KAIST, Korea As the supplementary material, we provide detailed
More information特集 Road Border Recognition Using FIR Images and LIDAR Signal Processing
デンソーテクニカルレビュー Vol. 15 2010 特集 Road Border Reognition Using FIR Images and LIDAR Signal Proessing 高木聖和 バーゼル ファルディ Kiyokazu TAKAGI Basel Fardi ヘンドリック ヴァイゲル Hendrik Weigel ゲルド ヴァニーリック Gerd Wanielik This paper
More informationrepresent = as a finite deimal" either in base 0 or in base. We an imagine that the omputer first omputes the mathematial = then rounds the result to
Sientifi Computing Chapter I Computer Arithmeti Jonathan Goodman Courant Institute of Mathemaial Sienes Last revised January, 00 Introdution One of the many soures of error in sientifi omputing is inexat
More informationDynamic Programming. Lecture #8 of Algorithms, Data structures and Complexity. Joost-Pieter Katoen Formal Methods and Tools Group
Dynami Programming Leture #8 of Algorithms, Data strutures and Complexity Joost-Pieter Katoen Formal Methods and Tools Group E-mail: katoen@s.utwente.nl Otober 29, 2002 JPK #8: Dynami Programming ADC (214020)
More informationThe HuMAnS toolbox, a homogenous framework for motion capture, analysis and simulation
The HuMAnS toolbox, a homogenous framework for motion apture, analysis and simulation Pierre-Brie Wieber, Florene Billet, Laurene Boissieux, Roger Pissard-Gibollet To ite this version: Pierre-Brie Wieber,
More informationHEXA: Compact Data Structures for Faster Packet Processing
Washington University in St. Louis Washington University Open Sholarship All Computer Siene and Engineering Researh Computer Siene and Engineering Report Number: 27-26 27 HEXA: Compat Data Strutures for
More informationSAND Unlimited Release Printed November 1995 Updated November 29, :26 PM EXODUS II: A Finite Element Data Model
SAND92-2137 Unlimited Release Printed November 1995 Updated November 29, 2006 12:26 PM EXODUS II: A Finite Element Data Model Gregory D. Sjaardema (updated version) Larry A. Shoof, Vitor R. Yarberry Computational
More informationBackground/Review on Numbers and Computers (lecture)
Bakground/Review on Numbers and Computers (leture) ICS312 Mahine-Level and Systems Programming Henri Casanova (henri@hawaii.edu) Numbers and Computers Throughout this ourse we will use binary and hexadeimal
More informationThis fact makes it difficult to evaluate the cost function to be minimized
RSOURC LLOCTION N SSINMNT In the resoure alloation step the amount of resoures required to exeute the different types of proesses is determined. We will refer to the time interval during whih a proess
More informationCUTTING FORCES AND CONSECUTIVE DEFORMATIONS AT MILLING PARTS WITH THIN WALLS
Proeedings of the International Conferene on Manufaturing Systems ICMaS Vol. 4, 2009, ISSN 1842-3183 University POLITEHNICA of Buharest, Mahine and Manufaturing Systems Department Buharest, Romania CUTTING
More informationMATH STUDENT BOOK. 12th Grade Unit 6
MATH STUDENT BOOK 12th Grade Unit 6 Unit 6 TRIGONOMETRIC APPLICATIONS MATH 1206 TRIGONOMETRIC APPLICATIONS INTRODUCTION 3 1. TRIGONOMETRY OF OBLIQUE TRIANGLES 5 LAW OF SINES 5 AMBIGUITY AND AREA OF A TRIANGLE
More informationExploring the Commonality in Feature Modeling Notations
Exploring the Commonality in Feature Modeling Notations Miloslav ŠÍPKA Slovak University of Tehnology Faulty of Informatis and Information Tehnologies Ilkovičova 3, 842 16 Bratislava, Slovakia miloslav.sipka@gmail.om
More informationAPPM 2460 PLOTTING IN MATLAB
APPM 2460 PLOTTING IN MATLAB. Introduction Matlab is great at crunching numbers, and one of the fundamental ways that we understand the output of this number-crunching is through visualization, or plots.
More information(Refer Slide Time: 00:02:02)
Computer Graphics Prof. Sukhendu Das Dept. of Computer Science and Engineering Indian Institute of Technology, Madras Lecture - 20 Clipping: Lines and Polygons Hello and welcome everybody to the lecture
More informationChromaticity-matched Superimposition of Foreground Objects in Different Environments
FCV216, the 22nd Korea-Japan Joint Workshop on Frontiers of Computer Vision Chromatiity-mathed Superimposition of Foreground Objets in Different Environments Yohei Ogura Graduate Shool of Siene and Tehnology
More informationXpander Rack Mount 2 Gen 3 HPC Version User Guide
Xpander Rak Mount 2 Gen 3 HPC Version User Guide Xpander Rak Mount 2 is a 2U rak mount PCI Express (PCIe) expansion enlosure that enables onnetion of two passively-ooled aelerators to a host omputer. The
More informationPHYS 3437: Computational Methods in Physics, Assignment 2
PHYS 3437: Computational Methods in Physis, Assignment 2 Set January 27th due Feb 26th NOTE: This assignment is potentially quite lengthy if you are urrently developing your programming skills. If so,
More informationConnection Guide. Installing the printer locally (Windows) What is local printing? Installing the printer using the Software and Documentation CD
Connetion Guide Page 1 of 5 Connetion Guide Installing the printer loally (Windows) Note: If the Software and Doumentation CD does not support the operating system, you must use the Add Printer Wizard.
More informationAbstract. Key Words: Image Filters, Fuzzy Filters, Order Statistics Filters, Rank Ordered Mean Filters, Channel Noise. 1.
Fuzzy Weighted Rank Ordered Mean (FWROM) Filters for Mixed Noise Suppression from Images S. Meher, G. Panda, B. Majhi 3, M.R. Meher 4,,4 Department of Eletronis and I.E., National Institute of Tehnology,
More informationDepartment of Electrical Engineering and Computer Science MASSACHUSETTS INSTITUTE OF TECHNOLOGY Fall Test I Solutions
Department of Eletrial Engineering and Computer iene MAACHUETT INTITUTE OF TECHNOLOGY 6.035 Fall 2016 Test I olutions 1 I Regular Expressions and Finite-tate Automata For Questions 1, 2, and 3, let the
More informationFUZZY WATERSHED FOR IMAGE SEGMENTATION
FUZZY WATERSHED FOR IMAGE SEGMENTATION Ramón Moreno, Manuel Graña Computational Intelligene Group, Universidad del País Vaso, Spain http://www.ehu.es/winto; {ramon.moreno,manuel.grana}@ehu.es Abstrat The
More information5.2.1 Ant, indispensable Ant
5.2.1 Ant, indispensale Ant Apahe s Ant produt (http://ant.apahe.org/) is a uild tool that lets you easily ompile and test appliations (among other things). It is the de fato standard for uilding Java
More informationA {k, n}-secret Sharing Scheme for Color Images
A {k, n}-seret Sharing Sheme for Color Images Rastislav Luka, Konstantinos N. Plataniotis, and Anastasios N. Venetsanopoulos The Edward S. Rogers Sr. Dept. of Eletrial and Computer Engineering, University
More informationPartial Character Decoding for Improved Regular Expression Matching in FPGAs
Partial Charater Deoding for Improved Regular Expression Mathing in FPGAs Peter Sutton Shool of Information Tehnology and Eletrial Engineering The University of Queensland Brisbane, Queensland, 4072, Australia
More informationAnalyzing PDFs with Citavi 6
Analyzing PDFs with Citavi 6 Introduction Just Like on Paper... 2 Methods in Detail Highlight Only (Yellow)... 3 Highlighting with a Main Idea (Red)... 4 Adding Direct Quotations (Blue)... 5 Adding Indirect
More informationSystem-Level Parallelism and Throughput Optimization in Designing Reconfigurable Computing Applications
System-Level Parallelism and hroughput Optimization in Designing Reonfigurable Computing Appliations Esam El-Araby 1, Mohamed aher 1, Kris Gaj 2, arek El-Ghazawi 1, David Caliga 3, and Nikitas Alexandridis
More informationXpander Rack Mount 8 5U Gen 3 with Redundant Power [Part # XPRMG3-81A5URP] User Guide
Xpander Rak Mount 8 5U Gen 3 with Redundant Power [Part # XPRMG3-81A5URP] User Guide Xpander Rak Mount 8 5U Gen 3 with Redundant Power (RP) supplies is a rak mount PCI Express (PCIe) expansion enlosure
More informationPASCAL 64. "The" Pascal Compiler for the Commodore 64. A Data Becker Product. >AbacusiII Software P.O. BOX 7211 GRAND RAPIDS, MICK 49510
PASCAL 64 "The" Pasal Compiler for the Commodore 64 A Data Beker Produt >AbausiII Software P.O. BOX 7211 GRAND RAPIDS, MICK 49510 7010 COPYRIGHT NOTICE ABACUS Software makes this pakage available for use
More informationSelf-Adaptive Parent to Mean-Centric Recombination for Real-Parameter Optimization
Self-Adaptive Parent to Mean-Centri Reombination for Real-Parameter Optimization Kalyanmoy Deb and Himanshu Jain Department of Mehanial Engineering Indian Institute of Tehnology Kanpur Kanpur, PIN 86 {deb,hjain}@iitk.a.in
More informationBoundary Correct Real-Time Soft Shadows
Boundary Corret Real-Time Soft Shadows Bjarke Jakobsen Niels J. Christensen Bent D. Larsen Kim S. Petersen Informatis and Mathematial Modelling Tehnial University of Denmark {bj, nj, bdl}@imm.dtu.dk, kim@deadline.dk
More informationXpander Rack Mount 8 5U Gen 3 User Guide
Xpander Rak Mount 8 5U Gen 3 User Guide Xpander Rak Mount 8 5U is a rak mount PCI Express (PCIe) expansion enlosure that enables onnetion of 8 double-wide graphis or other ontrollers with top-onneted auxiliary
More informationConnection Guide. Installing the printer locally (Windows) What is local printing? Installing the printer using the Software and Documentation CD
Page 1 of 7 Connetion Guide Installing the printer loally (Windows) Note: When installing a loally attahed printer, if the operating system is not supported y the Software and Doumentation CD, then the
More informationL A TEX: Online module 6
L A TEX: Online module 6 Venkata Manem Univ. of Waterloo August 4, 2011 Venkata Manem (Univ. of Waterloo) LATEX: Online module 6 August 4, 2011 1 / 41 Topics to be covered Introduction Image formats Importing
More informationTriangle LMN and triangle OPN are similar triangles. Find the angle measurements for x, y, and z.
1 Use measurements of the two triangles elow to find x and y. Are the triangles similar or ongruent? Explain. 1a Triangle LMN and triangle OPN are similar triangles. Find the angle measurements for x,
More informationLAMC Junior Circle April 15, Constructing Triangles.
LAMC Junior Cirle April 15, 2012 Olga Radko radko@math.ula.edu Oleg Gleizer oleg1140@gmail.om Construting Triangles. Copyright: for home use only. This handout is a part of the book in preparation. Using
More informationPipelined Multipliers for Reconfigurable Hardware
Pipelined Multipliers for Reonfigurable Hardware Mithell J. Myjak and José G. Delgado-Frias Shool of Eletrial Engineering and Computer Siene, Washington State University Pullman, WA 99164-2752 USA {mmyjak,
More informationOFF-LINE ROBOT VISION SYSTEM PROGRAMMING USING A COMPUTER AIDED DESIGN SYSTEM S. SRIDARAN. Thesis submitted to the Faculty of the
OFF-LINE ROBOT VISION SYSTEM PROGRAMMING USING A COMPUTER AIDED DESIGN SYSTEM by S. SRIDARAN Thesis submitted to the Faulty of the Virginia Polytehni Institute and State University in partial fulfillment
More informationThe following slides present guidelines and suggestions for the use of fonts, colors, and graphics when preparing PowerPoint presentations.
PowerPoint Presentation Guidelines The following slides present guidelines and suggestions for the use of fonts, colors, and graphics when preparing PowerPoint presentations. This media (PPT) is designed
More informationConstructing Hierarchies for Triangle Meshes
IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS VOL. 4 NO. APRIL-JUNE 1998 145 Construting Hierarhies for Triangle Meshes Tran S. Gieng Bernd Hamann Member IEEE Kenneth I. Joy Member IEEE Gregory
More information9.4 Exponential Growth and Decay Functions
Setion 9. Eponential Growth and Dea Funtions 56 9. Eponential Growth and Dea Funtions S Model Eponential Growth. Model Eponential Dea. Now that we an graph eponential funtions, let s learn about eponential
More informationSimple strategy Computes shortest paths from the start note
Leture Notes for I500 Fall 2009 Fundamental Computer Conepts of Informatis by Xiaoqian Zhang (Instrutor: Predrag Radivoja) Last time: dynami programming Today: Elementary graph algorithm (textbook Chapter
More informationThe Mathematics of Simple Ultrasonic 2-Dimensional Sensing
The Mathematis of Simple Ultrasoni -Dimensional Sensing President, Bitstream Tehnology The Mathematis of Simple Ultrasoni -Dimensional Sensing Introdution Our ompany, Bitstream Tehnology, has been developing
More informationInteractive Order-Independent Transparency
Interative Order-Independent Transpareny Cass Everitt NVIDIA OpenGL Appliations Engineering ass@nvidia.om (a) (b) Figure. These images illustrate orret (a) and inorret (b) rendering of transparent surfaes.
More information