REACTION ENUMERATION & CONDENSATION OF DOMAIN-LEVEL STRAND DISPLACEMENT SYSTEMS. Stefan Badelt DNA and Natural Algorithms (DNA) Group, Caltech

Size: px
Start display at page:

Download "REACTION ENUMERATION & CONDENSATION OF DOMAIN-LEVEL STRAND DISPLACEMENT SYSTEMS. Stefan Badelt DNA and Natural Algorithms (DNA) Group, Caltech"

Transcription

1 REACTION ENUMERATION & CONDENSATION OF DOMAIN-LEVEL STRAND DISPLACEMENT SYSTEMS Sefn Bdel DNA nd Nurl Algorihms (DNA) Group, Clech Fe 14 h, rd TBI Winerseminr, Bled, Sloveni Grun, Bdel, Srm, Shin, Wolfe, nd Winfree (mnuscrip in preprion) hp:// 1

2 MOLECULAR PROGRAMMING (in erms of he nuskell compiler projec) nucleic cids re rchiecure o implemen lgorihms chemicl recion neworks re progrmming lnguge forml/eperimenl verificion of correc implemenion miniml/opiml componens for iologicl sysems verifyly correc rificil sysems Ani- Lignd Terminor promoer region rioswich - Lignd + Lignd ON proein coding region rirry lgorihm sclle, correc componens Terminor promoer region rioswich OFF proein coding region condiionl swich iologicl relevnce is primry if eperimens fil, refine he mehod informion processing nework forml descripion is primry, iologicl relevnce secondry 2

3 DNA STRAND DISPLACEMENT = Adenine = Thymine = long domin = shor domin = Cyosine = Gunine = 5' end = Phosphe ckone = 3' end DNA DNA * * * * 3

4 DOMAIN-LEVEL STRAND DISPLACEMENT long (rnch-migrion) domin: inds irreversily shor (oehold) domin: inds reversily A F1 F2 + + * * * * * * B unind 3-wy rnch migrion ind * i1 * * * * * i2 * * i3 * 4

5 DOMAIN-LEVEL STRAND DISPLACEMENT long (rnch-migrion) domin: inds irreversily shor (oehold) domin: inds reversily deiled nework condensed nework A F1 F2 + + * * * * * * B ind 3-wy rnch migrion unind * i1 * * * * * * * i2 * 5

6 DOMAIN-LEVEL STRAND DISPLACEMENT long (rnch-migrion) domin: inds irreversily shor (oehold) domin: inds reversily deiled nework condensed nework A F1 F2 + + * * * * * * B unind 3-wy rnch migrion ind * i1 * * * * * * * i2 * 6

7 DOMAIN-LEVEL STRAND DISPLACEMENT long (rnch-migrion) domin: inds irreversily shor (oehold) domin: inds reversily A F1 F2 + + * * * * * * B unind forml CRN forml species: {A, B} * * * i1 3-wy rnch migrion ind DSD syem specificion signl species (low concenion): {A, B} * * * fuel species (high concenrion): {F1, F2} * * * i2 i3 7

8 FROM CRN TO DSD SYSTEMS Soloveichik e l. (2010) Lkin e l. (2012) Crdelli (2011) Qin e l. (2011) Chen e l. (2012), Crdelli (2013), Srinivs (2015), Lkin e l. (2016),... Imges drwn using VisulDSD, Lkin e l. (2012) 8

9 FROM A DIGITAL CIRCUIT TO DSD Qin e l. (2011) Inpu for he nuskell compiler: 32 forml recions. soloveichik2010.s: 52 signl species, 92 fuel species, 172 inermedie species, 180 recions. verifies s correc ccording o he phwy decomposiion nd CRN isimulion equivlence Bdel, Johnson, Dong, Shin, Thchuk nd Winfree: A generl-purpose CRN-o-DSD compiler wih forml verificion, opimizion, nd simulion cpiliies. LNCS (2017) 9

10 REACTION TYPES ind / open * * * * 3-wy rnch migrion * * c c c c* * * * c* * c* c c c c* 4-wy rnch migrion c c* * * d* d * * c c* * * * * d* d 10

11 REACTION TYPES ind / open * * * * llows ll secondry srucures (pseudoknos ecluded) open recions of domins wih lengh > L re foridden open & rnch migrion recions re lwys unimoleculr, u my led o dissociion. ind recions re he only vlid imoleculr recions 3-wy rnch migrion * * c c c c* * * * c* * c* c c c c* 4-wy rnch migrion c c* * * d* d * * c c* * * * * d* d 11

12 A B * * 12

13 A B * * * * 13

14 A B * * * * 14

15 * A B * * * * * 15

16 * A B * *? * * * 16

17 * A B * *? * * * + * * + + * *.. ( + (.. + ). ( + ). ) 17

18 * mulisrnded pseudokno A B * *? * * * + * * + + * *.. ( + (.. + ). ( + ). ) 18

19 SEPARATION OF TIMESCALES unimoleculr recions re fs imoleculr recions re slow A B + * * k α k β * * X resing complees rnsien comple k α k β {X A + B; A + B X} low concenrions: k β [A][B] << k α [X] 19

20 MODEL PARAMETERS re-independen model open recions where domin-lengh > L re negligile unimoleculr recions re fs imoleculr recions re slow re-dependen model ssume ypicl re consn for every recion: k = re(rype, dlengh) unimoleculr recions wih k < k slow re negligile unimoleculr recions wih k < k fs re slow unimoleculr recions wih k k fs re fs imoleculr recions re slow 20

21 REACTION ENUMERATION every comple hs ll vlid fs recions enumered rnsien complees hve no slow recions enumered resing complees hve ll vlid slow recions enumered ll iniil complees re included vlid ccording o enumerion semnics: ll vlid, ecep open > L m-heli semnics: recion ypes re greedy proiliy hreshold for recns of imoleculr recions. proiliy hreshold for producs of unimoleculr recions. 21

22 CRN CONDENSATION Gol: represen CRN in erms of overll slow recions properies / requiremens: ll fs recions re unimoleculr recions hve riy (n,m) wih n > 0 nd m > 0 recns of slow recions mus e resing ses recns nd producs of fs (1-2) recions re in differen SCCs (mss conservion) 22

23 CRN CONDENSATION Sep 1: Mke grph h conins only fs (1,1) recions 23

24 CRN CONDENSATION Sep 2: Idenify srongly conneced componens (SCCs) 24

25 CRN CONDENSATION Sep 3: Define rnsien nd resing mcroses A B C D E F 25

26 CRN CONDENSATION Sep 4: Assign fes o complees (or mcroses) 26

27 CRN CONDENSATION Sep 5: Inser slow recions & derive condensed recions 27

28 DSD CONDENSATION fs (1,1) recion fs (1,2) recion * {(B+F1)} i3 * * * * i4 * {(A+F2)} slow (2,1) recion resing mcrose rnsien mcrose {} se of fes F1 A * * * {(A)} {(F1)} {(B)} {(F2)} * i1 * * {(A+F1), (B+F2)} B * * i2 * F2 * * * deiled recions: A + F1 -> i1 i1 -> i2 i2 -> B + F2 B + F2 -> i2 i2 -> i1 i1 -> A + F1 A + F2 -> i4 i4 -> A + F2 B + F1 -> i3 i3 -> B + F1 condensed recions: A + F1 -> B + F2 B + F2 -> A + F1 28

29 REACTION RATE CONDENSATION Consider condensed recion: P + Q K + L + M I is composed of ll deiled slow recions: p + q I weighed y he decy proiliy over ll phwys: I k + l + m where p P, q Q, k K, l L, m M nd I is mulise of inermedie species 29

30 REACTION RATE CONDENSATION Noion: deiled recion: condensed recion: given: define: hen he condensed re is: microse (comple) fs (1,1) recion slow (1,1) recion fs (1,2) recion slow (2,1) recion resing mcrose rnsien mcrose {} se of fes 30

31 REACTION RATE CONDENSATION generl form: k r = P[ ] P[ : ] r=(a,b) R A k r T B B i A i i A i T B B P[ : ] = A i P[ ] = where sionry disriuion recion decy proiliy 31

32 A DNA OSCIALLATOR Srinivs, Prkin, Seelig, Winfree, Soloveichik: Enzyme-free nucleic cid dynmicl sysems. Science (2017) 32

33 A DNA OSCIALLATOR Srinivs, Prkin, Seelig, Winfree, Soloveichik: Enzyme-free nucleic cid dynmicl sysems. Science (2017) 33

34 DETAILED VS. CONDENSED SIMULATION rnslion scheme: srinivs2017.s 34

35 REACTION ENUMERATOR model limiions no mulisrnded pseudoknos ssumpion of low concenrions ssumpion of "ypicl" recion re consns model prmeers muliple lyers of recion-semnics recion ypes m-heli noion (represenion-independen) recion re dependen enumerion 35

36 Wh he domin level cn do: enumere inended recion phwys deec uninended recion phwys very fs ssessmen of overll dynmics define CRN for sequence-level simulions Wh he domin level cnno do: include sequence-level vriions wihin he domins Wh he domin level could do: deec nd qunify priculr lek recions provide corse-grining for sochsic simulions 36

37 THANKS TO Erik Winfree Csey Grun Krhik Srm Seung Woo Shin you Brin Wolfe hp:// This reserch ws funded in prs y: The Clech Biology nd Biologicl Engineering Division Fellowship. The U.S. Nionl Science Foundion NSF Grn CCF nd NSF Grn CCF The Gordon nd Bey Moore Foundion's Progrmmle Moleculr Technology Iniiive (PMTI). 37

CS 314 Principles of Programming Languages

CS 314 Principles of Programming Languages CS 314 Principles of Progrmming Lnguges Lecure 10: Synx Direced Trnslion Zheng (Eddy) Zhng Rugers Universiy Februry 19, 2018 Clss Informion Homework 2 is sill being grded. Projec 1 nd homework 4 will be

More information

Procedure Abstraction

Procedure Abstraction Compiler Design Procedure Absrcion Hwnsoo Hn Conrol Absrcion Procedures hve well-defined conrol-flow The Algol-60 procedure cll Invoked cll sie, wih some se of cul prmeers Conrol reurns o cll sie, immediely

More information

Stacking Tags in LLC Media

Stacking Tags in LLC Media Scking Tgs in LL Medi Normn Finn ugus 19, 2013 Ver. 2 (This presenion is lso uploded o 802.11 documen sysem s documen number 2013-0952-1.) bz-nfinn-ll-g-scking-0813-v01 IEEE 802.1 inerim meeing, Sep. 2013,

More information

Assignment 2. Due Monday Feb. 12, 10:00pm.

Assignment 2. Due Monday Feb. 12, 10:00pm. Faculy of rs and Science Universiy of Torono CSC 358 - Inroducion o Compuer Neworks, Winer 218, LEC11 ssignmen 2 Due Monday Feb. 12, 1:pm. 1 Quesion 1 (2 Poins): Go-ack n RQ In his quesion, we review how

More information

Lecture 18: Mix net Voting Systems

Lecture 18: Mix net Voting Systems 6.897: Advanced Topics in Crypography Apr 9, 2004 Lecure 18: Mix ne Voing Sysems Scribed by: Yael Tauman Kalai 1 Inroducion In he previous lecure, we defined he noion of an elecronic voing sysem, and specified

More information

Jorge Salvador Marques, Stereo Reconstruction

Jorge Salvador Marques, Stereo Reconstruction Jorge Slvdor Mrques, Sereo Reconsrucion roblem Gol: reconsruc he D she of objecs in he scene from or more imges. Jorge Slvdor Mrques, Jorge Slvdor Mrques, secil cse f f f f b model reconsrucion, b - fb,

More information

IDEF3 Process Description Capture Method

IDEF3 Process Description Capture Method IDEF3 Process Descripion Capure Mehod IDEF3 is par of he IDEF family of mehods developmen funded by he US Air Force o provide modelling suppor for sysems engineering and enerprise inegraion 2 IDEF3 Mehod

More information

A Matching Algorithm for Content-Based Image Retrieval

A Matching Algorithm for Content-Based Image Retrieval A Maching Algorihm for Conen-Based Image Rerieval Sue J. Cho Deparmen of Compuer Science Seoul Naional Universiy Seoul, Korea Absrac Conen-based image rerieval sysem rerieves an image from a daabase using

More information

Real Time Integral-Based Structural Health Monitoring

Real Time Integral-Based Structural Health Monitoring Real Time Inegral-Based Srucural Healh Monioring The nd Inernaional Conference on Sensing Technology ICST 7 J. G. Chase, I. Singh-Leve, C. E. Hann, X. Chen Deparmen of Mechanical Engineering, Universiy

More information

Grade 11 Physics Homework 3. Be prepared to defend your choices in class!

Grade 11 Physics Homework 3. Be prepared to defend your choices in class! Gre 11 Physics Homework 3 Be prepre o efen your choices in clss! 1. The grph shows he riion wih ime of he elociy of n objec. Which one of he following grphs bes represens he riion wih ime of he ccelerion

More information

Today. Quiz Introduction to pipelining

Today. Quiz Introduction to pipelining Pipelining 1 Tody Quiz Inroduion o pipelining 2 Pipelining 10ns (10ns) 20ns (10ns) 30ns (10ns) Wh s he leny for one uni of work? Wh s he hroughpu? Pipelining 1.Brek up he logi wih lhes ino pipeline sges

More information

Shortest Path Algorithms. Lecture I: Shortest Path Algorithms. Example. Graphs and Matrices. Setting: Dr Kieran T. Herley.

Shortest Path Algorithms. Lecture I: Shortest Path Algorithms. Example. Graphs and Matrices. Setting: Dr Kieran T. Herley. Shores Pah Algorihms Background Seing: Lecure I: Shores Pah Algorihms Dr Kieran T. Herle Deparmen of Compuer Science Universi College Cork Ocober 201 direced graph, real edge weighs Le he lengh of a pah

More information

Ins Net2 plus control unit

Ins Net2 plus control unit S ns 0 Server Link 00 0/00 Eherne End of Line Terminaion RS485 Nework xi -4V. Ins-30080 Ne plus conrol uni C auion: For DC readers y Inruder Ne plus O u pus r Powe DC Only Relay C onac E Buo n P SU/ Page

More information

Location. Electrical. Loads. 2-wire mains-rated. 0.5 mm² to 1.5 mm² Max. length 300 m (with 1.5 mm² cable). Example: Belden 8471

Location. Electrical. Loads. 2-wire mains-rated. 0.5 mm² to 1.5 mm² Max. length 300 m (with 1.5 mm² cable). Example: Belden 8471 Produc Descripion Insallaion and User Guide Transiser Dimmer (454) The DIN rail mouned 454 is a 4channel ransisor dimmer. I can operae in one of wo modes; leading edge or railing edge. All 4 channels operae

More information

Network Court Protocol and Malicious Node Conviction

Network Court Protocol and Malicious Node Conviction Nework Cour Proocol nd Mlicious Node Convicion N Li nd Dvid Lee Deprmen of Compuer Science nd Engineering, The Ohio Se Universiy lin,lee@cse.ohio-se.edu Absrc A Nework Cour Proocol is designed for mlicious

More information

Dimmer time switch AlphaLux³ D / 27

Dimmer time switch AlphaLux³ D / 27 Dimmer ime swich AlphaLux³ D2 426 26 / 27! Safey noes This produc should be insalled in line wih insallaion rules, preferably by a qualified elecrician. Incorrec insallaion and use can lead o risk of elecric

More information

CEE598 - Visual Sensing for Civil Infrastructure Eng. & Mgmt.

CEE598 - Visual Sensing for Civil Infrastructure Eng. & Mgmt. CEE598 - Visul Sensing for Civil Infrsrucure Eng. & Mgm. Session 2 Review of Liner Algebr nd Geomeric Trnsformions Mni Golprvr-Frd Deprmen of Civil nd Environmenl Engineering Deprmen of Compuer Science

More information

Test - Accredited Configuration Engineer (ACE) Exam - PAN-OS 6.0 Version

Test - Accredited Configuration Engineer (ACE) Exam - PAN-OS 6.0 Version Tes - Accredied Configuraion Engineer (ACE) Exam - PAN-OS 6.0 Version ACE Exam Quesion 1 of 50. Which of he following saemens is NOT abou Palo Alo Neworks firewalls? Sysem defauls may be resored by performing

More information

Graph Theory and DNA Nanostructures. Laura Beaudin, Jo Ellis-Monaghan*, Natasha Jonoska, David Miller, and Greta Pangborn

Graph Theory and DNA Nanostructures. Laura Beaudin, Jo Ellis-Monaghan*, Natasha Jonoska, David Miller, and Greta Pangborn Grph Theory nd DNA Nnostructures Lur Beudin, Jo Ellis-Monghn*, Ntsh Jonosk, Dvid Miller, nd Gret Pngborn A grph is set of vertices (dots) with edges (lines) connecting them. 1 2 4 6 5 3 A grph F A B C

More information

MOBILE COMPUTING. Wi-Fi 9/20/15. CSE 40814/60814 Fall Wi-Fi:

MOBILE COMPUTING. Wi-Fi 9/20/15. CSE 40814/60814 Fall Wi-Fi: MOBILE COMPUTING CSE 40814/60814 Fall 2015 Wi-Fi Wi-Fi: name is NOT an abbreviaion play on Hi-Fi (high fideliy) Wireless Local Area Nework (WLAN) echnology WLAN and Wi-Fi ofen used synonymous Typically

More information

MOBILE COMPUTING 3/18/18. Wi-Fi IEEE. CSE 40814/60814 Spring 2018

MOBILE COMPUTING 3/18/18. Wi-Fi IEEE. CSE 40814/60814 Spring 2018 MOBILE COMPUTING CSE 40814/60814 Spring 2018 Wi-Fi Wi-Fi: name is NOT an abbreviaion play on Hi-Fi (high fideliy) Wireless Local Area Nework (WLAN) echnology WLAN and Wi-Fi ofen used synonymous Typically

More information

Flow graph/networks MAX FLOW APPLICATIONS. Flow constraints. Max flow problem 4/26/12

Flow graph/networks MAX FLOW APPLICATIONS. Flow constraints. Max flow problem 4/26/12 4// low graph/nework MX LOW PPLIION 30, pring 0 avid Kauchak low nework direced, weighed graph (V, ) poiive edge weigh indicaing he capaciy (generally, aume ineger) conain a ingle ource V wih no incoming

More information

COSC 3213: Computer Networks I Chapter 6 Handout # 7

COSC 3213: Computer Networks I Chapter 6 Handout # 7 COSC 3213: Compuer Neworks I Chaper 6 Handou # 7 Insrucor: Dr. Marvin Mandelbaum Deparmen of Compuer Science York Universiy F05 Secion A Medium Access Conrol (MAC) Topics: 1. Muliple Access Communicaions:

More information

MIC2569. Features. General Description. Applications. Typical Application. CableCARD Power Switch

MIC2569. Features. General Description. Applications. Typical Application. CableCARD Power Switch CableCARD Power Swich General Descripion is designed o supply power o OpenCable sysems and CableCARD hoss. These CableCARDs are also known as Poin of Disribuion (POD) cards. suppors boh Single and Muliple

More information

Network management and QoS provisioning - QoS in Frame Relay. . packet switching with virtual circuit service (virtual circuits are bidirectional);

Network management and QoS provisioning - QoS in Frame Relay. . packet switching with virtual circuit service (virtual circuits are bidirectional); QoS in Frame Relay Frame relay characerisics are:. packe swiching wih virual circui service (virual circuis are bidirecional);. labels are called DLCI (Daa Link Connecion Idenifier);. for connecion is

More information

CENG 477 Introduction to Computer Graphics. Modeling Transformations

CENG 477 Introduction to Computer Graphics. Modeling Transformations CENG 477 Inroducion o Compuer Graphics Modeling Transformaions Modeling Transformaions Model coordinaes o World coordinaes: Model coordinaes: All shapes wih heir local coordinaes and sies. world World

More information

Reducing Costs with Duck Typing. Structural

Reducing Costs with Duck Typing. Structural Reducing Costs with Duck Typing Structurl 1 Duck Typing In computer progrmming with object-oriented progrmming lnguges, duck typing is lyer of progrmming lnguge nd design rules on top of typing. Typing

More information

Image segmentation. Motivation. Objective. Definitions. A classification of segmentation techniques. Assumptions for thresholding

Image segmentation. Motivation. Objective. Definitions. A classification of segmentation techniques. Assumptions for thresholding Moivaion Image segmenaion Which pixels belong o he same objec in an image/video sequence? (spaial segmenaion) Which frames belong o he same video sho? (emporal segmenaion) Which frames belong o he same

More information

EECS 487: Interactive Computer Graphics

EECS 487: Interactive Computer Graphics EECS 487: Ineracive Compuer Graphics Lecure 7: B-splines curves Raional Bézier and NURBS Cubic Splines A represenaion of cubic spline consiss of: four conrol poins (why four?) hese are compleely user specified

More information

MARSS Reference Sheet

MARSS Reference Sheet MARSS Reference Shee The defaul MARSS model (form="marxss") is wrien as follows: x = B x 1 + u + C c + w where w MVN( Q ) y = Z x + a + D d + v where v MVN( R ) x 1 MVN(π Λ) or x MVN(π Λ) c and d are inpus

More information

USING BRAT UPDATES 2 SYSTEM AND SPACE REQUIREMENTS

USING BRAT UPDATES 2 SYSTEM AND SPACE REQUIREMENTS USIN BR-1.1.17 1 UPDES In version 1.1.17, we fixed a bug in acgt-count: in the previous versions it had only option -s to accept the file with names of the files with mapping results of single-end reads;

More information

AML710 CAD LECTURE 11 SPACE CURVES. Space Curves Intrinsic properties Synthetic curves

AML710 CAD LECTURE 11 SPACE CURVES. Space Curves Intrinsic properties Synthetic curves AML7 CAD LECTURE Space Curves Inrinsic properies Synheic curves A curve which may pass hrough any region of hreedimensional space, as conrased o a plane curve which mus lie on a single plane. Space curves

More information

Maximum Flows: Polynomial Algorithms

Maximum Flows: Polynomial Algorithms Maximum Flow: Polynomial Algorihm Algorihm Augmening pah Algorihm - Labeling Algorihm - Capaciy Scaling Algorihm - Shore Augmening Pah Algorihm Preflow-Puh Algorihm - FIFO Preflow-Puh Algorihm - Highe

More information

4. Minimax and planning problems

4. Minimax and planning problems CS/ECE/ISyE 524 Inroducion o Opimizaion Spring 2017 18 4. Minima and planning problems ˆ Opimizing piecewise linear funcions ˆ Minima problems ˆ Eample: Chebyshev cener ˆ Muli-period planning problems

More information

Less Pessimistic Worst-Case Delay Analysis for Packet-Switched Networks

Less Pessimistic Worst-Case Delay Analysis for Packet-Switched Networks Less Pessimisic Wors-Case Delay Analysis for Packe-Swiched Neworks Maias Wecksén Cenre for Research on Embedded Sysems P O Box 823 SE-31 18 Halmsad maias.wecksen@hh.se Magnus Jonsson Cenre for Research

More information

Qubit allocation for quantum circuit compilers

Qubit allocation for quantum circuit compilers Quit lloction for quntum circuit compilers Nov. 10, 2017 JIQ 2017 Mrcos Yukio Sirichi Sylvin Collnge Vinícius Fernndes dos Sntos Fernndo Mgno Quintão Pereir Compilers for quntum computing The first genertion

More information

ENDA ETM442 DIGITAL TIMER

ENDA ETM442 DIGITAL TIMER Read his documen carefully before using his device. The guaranee will be expired by damaging of he device if you don' aend o he direcions in he user manual. Also we don' accep any compensaions for personal

More information

10.5 Graphing Quadratic Functions

10.5 Graphing Quadratic Functions 0.5 Grphing Qudrtic Functions Now tht we cn solve qudrtic equtions, we wnt to lern how to grph the function ssocited with the qudrtic eqution. We cll this the qudrtic function. Grphs of Qudrtic Functions

More information

MOTION DETECTORS GRAPH MATCHING LAB PRE-LAB QUESTIONS

MOTION DETECTORS GRAPH MATCHING LAB PRE-LAB QUESTIONS NME: TE: LOK: MOTION ETETORS GRPH MTHING L PRE-L QUESTIONS 1. Read he insrucions, and answer he following quesions. Make sure you resae he quesion so I don hae o read he quesion o undersand he answer..

More information

Strand Algebras for DNA Computing

Strand Algebras for DNA Computing Strand Algebras for DNA omputing Microsoft Research DNA 15 onference Fayetteville, 2009-06-10 http://lucacardelli.name How Process Algebra fits in DNA omputing Electronics has electrons o All electrons

More information

Chapter 4 Sequential Instructions

Chapter 4 Sequential Instructions Chaper 4 Sequenial Insrucions The sequenial insrucions of FBs-PLC shown in his chaper are also lised in secion 3.. Please refer o Chaper, "PLC Ladder diagram and he Coding rules of Mnemonic insrucion",

More information

Chapter Six Chapter Six

Chapter Six Chapter Six Chaper Si Chaper Si 0 CHAPTER SIX ConcepTess and Answers and Commens for Secion.. Which of he following graphs (a) (d) could represen an aniderivaive of he funcion shown in Figure.? Figure. (a) (b) (c)

More information

In the last lecture, we discussed how valid tokens may be specified by regular expressions.

In the last lecture, we discussed how valid tokens may be specified by regular expressions. LECTURE 5 Scnning SYNTAX ANALYSIS We know from our previous lectures tht the process of verifying the syntx of the progrm is performed in two stges: Scnning: Identifying nd verifying tokens in progrm.

More information

FIELD PROGRAMMABLE GATE ARRAY (FPGA) AS A NEW APPROACH TO IMPLEMENT THE CHAOTIC GENERATORS

FIELD PROGRAMMABLE GATE ARRAY (FPGA) AS A NEW APPROACH TO IMPLEMENT THE CHAOTIC GENERATORS FIELD PROGRAMMABLE GATE ARRAY (FPGA) AS A NEW APPROACH TO IMPLEMENT THE CHAOTIC GENERATORS Mohammed A. Aseeri and M. I. Sobhy Deparmen of Elecronics, The Universiy of Ken a Canerbury Canerbury, Ken, CT2

More information

Dynamic Programming. Andreas Klappenecker. [partially based on slides by Prof. Welch] Monday, September 24, 2012

Dynamic Programming. Andreas Klappenecker. [partially based on slides by Prof. Welch] Monday, September 24, 2012 Dynmic Progrmming Andres Klppenecker [prtilly bsed on slides by Prof. Welch] 1 Dynmic Progrmming Optiml substructure An optiml solution to the problem contins within it optiml solutions to subproblems.

More information

EP2200 Queueing theory and teletraffic systems

EP2200 Queueing theory and teletraffic systems EP2200 Queueing heory and eleraffic sysems Vikoria Fodor Laboraory of Communicaion Neworks School of Elecrical Engineering Lecure 1 If you wan o model neworks Or a comple daa flow A queue's he key o help

More information

ENDA ETM742 DIGITAL TIMER

ENDA ETM742 DIGITAL TIMER Read his documen carefully before using his device. The guaranee will be expired by damaging of he device if you don' aend o he direcions in he user manual. Also we don' accep any compensaions for personal

More information

Terrain Based GPS Independent Lane-Level Vehicle Localization using Particle Filter and Dead Reckoning

Terrain Based GPS Independent Lane-Level Vehicle Localization using Particle Filter and Dead Reckoning Terrain Based GPS Independen -Level Vehicle Localizaion using Paricle Filer and Dead Reckoning Hamad Ahmed and Muhammad Tahir Deparmen of Elecrical Engineering, Lahore Universiy of Managemen Sciences,

More information

USING BRAT ANALYSIS PIPELINE

USING BRAT ANALYSIS PIPELINE USIN BR-1.2.3 his new version has a new tool convert-to-sam that converts BR format to SM format. Please use this program as needed after remove-dupl in the pipeline below. 1 NLYSIS PIPELINE urrently BR

More information

Stained Glass Design. Teaching Goals:

Stained Glass Design. Teaching Goals: Stined Glss Design Time required 45-90 minutes Teching Gols: 1. Students pply grphic methods to design vrious shpes on the plne.. Students pply geometric trnsformtions of grphs of functions in order to

More information

Scanner Termination. Multi Character Lookahead. to its physical end. Most parsers require an end of file token. Lex and Jlex automatically create an

Scanner Termination. Multi Character Lookahead. to its physical end. Most parsers require an end of file token. Lex and Jlex automatically create an Scnner Termintion A scnner reds input chrcters nd prtitions them into tokens. Wht hppens when the end of the input file is reched? It my be useful to crete n Eof pseudo-chrcter when this occurs. In Jv,

More information

COMP26120: Algorithms and Imperative Programming

COMP26120: Algorithms and Imperative Programming COMP26120 ecure C3 1/48 COMP26120: Algorihms and Imperaive Programming ecure C3: C - Recursive Daa Srucures Pee Jinks School of Compuer Science, Universiy of Mancheser Auumn 2011 COMP26120 ecure C3 2/48

More information

Simple Network Management Based on PHP and SNMP

Simple Network Management Based on PHP and SNMP Simple Nework Managemen Based on PHP and SNMP Krasimir Trichkov, Elisavea Trichkova bsrac: This paper aims o presen simple mehod for nework managemen based on SNMP - managemen of Cisco rouer. The paper

More information

CS 430 Spring Mike Lam, Professor. Parsing

CS 430 Spring Mike Lam, Professor. Parsing CS 430 Spring 2015 Mike Lm, Professor Prsing Syntx Anlysis We cn now formlly descrie lnguge's syntx Using regulr expressions nd BNF grmmrs How does tht help us? Syntx Anlysis We cn now formlly descrie

More information

MA1008. Calculus and Linear Algebra for Engineers. Course Notes for Section B. Stephen Wills. Department of Mathematics. University College Cork

MA1008. Calculus and Linear Algebra for Engineers. Course Notes for Section B. Stephen Wills. Department of Mathematics. University College Cork MA1008 Clculus nd Liner Algebr for Engineers Course Notes for Section B Stephen Wills Deprtment of Mthemtics University College Cork s.wills@ucc.ie http://euclid.ucc.ie/pges/stff/wills/teching/m1008/ma1008.html

More information

Querying Moving Objects in SECONDO

Querying Moving Objects in SECONDO Querying Moving Objecs in SECONDO Vicor Teixeira de Almeida, Ralf Harmu Güing, and Thomas Behr LG Daenbanksyseme für neue Anwendungen Fachbereich Informaik, Fernuniversiä Hagen D-58084 Hagen, Germany {vicor.almeida,

More information

Solving Problems by Searching. CS 486/686: Introduction to Artificial Intelligence Winter 2016

Solving Problems by Searching. CS 486/686: Introduction to Artificial Intelligence Winter 2016 Solving Prolems y Serching CS 486/686: Introduction to Artificil Intelligence Winter 2016 1 Introduction Serch ws one of the first topics studied in AI - Newell nd Simon (1961) Generl Prolem Solver Centrl

More information

KRAMER ELECTRONICS Ltd.

KRAMER ELECTRONICS Ltd. KRAMER ELECRNICS Ltd. CMMNICAIN PRCL VS-804/6YC (VER-0.3) his RS-3 / RS-4 communication protocol uses four bytes of information as defined below. For RS-3, a null-modem connection between the machine and

More information

ETD-BL-1T-OFF-CC-... Timer relay with off delay (with control contact) and adjustable time. INTERFACE Data sheet _en_01. 1 Description.

ETD-BL-1T-OFF-CC-... Timer relay with off delay (with control contact) and adjustable time. INTERFACE Data sheet _en_01. 1 Description. Timer relay wih off delay (wih conrol conac) and adjusable ime INTERFACE Daa shee 103617_en_01 1 Descripion PHOENIX CONTACT - 09/2009 Feaures Compac ime relay in he 6.2 mm housing in order o conrol ime

More information

CMPSC 274: Transac0on Processing Lecture #6: Concurrency Control Protocols

CMPSC 274: Transac0on Processing Lecture #6: Concurrency Control Protocols CMPSC 274: Transac0on Processing Lecure #6: Concurrency Conrol Proocols Divy Agrawal Deparmen of Compuer Science UC Sana Barbara 4.4.1 Timesamp Ordering 4.4.2 Serializa0on Graph Tes0ng 4.4.3 Op0mis0c Proocols

More information

Today. CS 188: Artificial Intelligence Fall Recap: Search. Example: Pancake Problem. Example: Pancake Problem. General Tree Search.

Today. CS 188: Artificial Intelligence Fall Recap: Search. Example: Pancake Problem. Example: Pancake Problem. General Tree Search. CS 88: Artificil Intelligence Fll 00 Lecture : A* Serch 9//00 A* Serch rph Serch Tody Heuristic Design Dn Klein UC Berkeley Multiple slides from Sturt Russell or Andrew Moore Recp: Serch Exmple: Pncke

More information

Mobile Computing IEEE Standard 9/10/14. CSE 40814/60814 Fall 2014

Mobile Computing IEEE Standard 9/10/14. CSE 40814/60814 Fall 2014 Mobile Compuing CSE 40814/60814 Fall 2014 IEEE IEEE (Ins4ue of Elecrical and Elecronics Engineers) esablished he 802.11 Group in 1990. Specifica4ons for sandard ra4fied in 1997. Ini4al speeds were 1 and

More information

CSCI 3130: Formal Languages and Automata Theory Lecture 12 The Chinese University of Hong Kong, Fall 2011

CSCI 3130: Formal Languages and Automata Theory Lecture 12 The Chinese University of Hong Kong, Fall 2011 CSCI 3130: Forml Lnguges nd utomt Theory Lecture 12 The Chinese University of Hong Kong, Fll 2011 ndrej Bogdnov In progrmming lnguges, uilding prse trees is significnt tsk ecuse prse trees tell us the

More information

Definition of Regular Expression

Definition of Regular Expression Definition of Regulr Expression After the definition of the string nd lnguges, we re redy to descrie regulr expressions, the nottion we shll use to define the clss of lnguges known s regulr sets. Recll

More information

Unit #9 : Definite Integral Properties, Fundamental Theorem of Calculus

Unit #9 : Definite Integral Properties, Fundamental Theorem of Calculus Unit #9 : Definite Integrl Properties, Fundmentl Theorem of Clculus Gols: Identify properties of definite integrls Define odd nd even functions, nd reltionship to integrl vlues Introduce the Fundmentl

More information

Scheduling. Scheduling. EDA421/DIT171 - Parallel and Distributed Real-Time Systems, Chalmers/GU, 2011/2012 Lecture #4 Updated March 16, 2012

Scheduling. Scheduling. EDA421/DIT171 - Parallel and Distributed Real-Time Systems, Chalmers/GU, 2011/2012 Lecture #4 Updated March 16, 2012 EDA421/DIT171 - Parallel and Disribued Real-Time Sysems, Chalmers/GU, 2011/2012 Lecure #4 Updaed March 16, 2012 Aemps o mee applicaion consrains should be done in a proacive way hrough scheduling. Schedule

More information

REDUCTIONS BBM ALGORITHMS DEPT. OF COMPUTER ENGINEERING ERKUT ERDEM. Bird s-eye view. May. 12, Reduction.

REDUCTIONS BBM ALGORITHMS DEPT. OF COMPUTER ENGINEERING ERKUT ERDEM. Bird s-eye view. May. 12, Reduction. BBM 0 - ALGORITHMS DEPT. OF COMPUTER ENGINEERING ERKUT ERDEM REDUCTIONS May., 0 Bird s-eye view Desideraa. Classify problems according o compuaional requiremens. complexiy order of growh examples linear

More information

LD7832A 4/17/2013. High Power Factor LED Controller with HV Start-up. General Description. Features. Applications. Typical Application REV: 00

LD7832A 4/17/2013. High Power Factor LED Controller with HV Start-up. General Description. Features. Applications. Typical Application REV: 00 4/17/2013 High Power Facor LED Conroller wih HV Sar-up REV: 00 General Descripion The is a buck soluion wih high PFC conrol for LED lighing. I feaures HV sar-up, easy o design wih minimum cos and PCB size.

More information

Manual. Global Drive. PLC Developer Studio. Global Drive. Lenze9300Servo.lib. Function library

Manual. Global Drive. PLC Developer Studio. Global Drive. Lenze9300Servo.lib. Function library L Manual Global Drive PLC Developer Sudio Global Drive Funcion library Lenze9300Servo.lib The funcion library Lenze9300Servo.lib can be used for he following Lenze PLCs: Type from hardware version from

More information

CL-Path in B-Spline Form with Global Error Control for 3-Axis Sculptured Surface Machining

CL-Path in B-Spline Form with Global Error Control for 3-Axis Sculptured Surface Machining n Inernionl onference on Mechnicl, Proucion n Auomobile Engineering (IMPAE'0) Singpore April 8-9, 0 -Ph in B-Spline Form wih Globl Error onrol for 3-Axis Sculpure Surfce Mchining Mqsoo Ahme. Khn, n Zezhong.

More information

UNIVERSITY OF EDINBURGH COLLEGE OF SCIENCE AND ENGINEERING SCHOOL OF INFORMATICS INFORMATICS 1 COMPUTATION & LOGIC INSTRUCTIONS TO CANDIDATES

UNIVERSITY OF EDINBURGH COLLEGE OF SCIENCE AND ENGINEERING SCHOOL OF INFORMATICS INFORMATICS 1 COMPUTATION & LOGIC INSTRUCTIONS TO CANDIDATES UNIVERSITY OF EDINBURGH COLLEGE OF SCIENCE AND ENGINEERING SCHOOL OF INFORMATICS INFORMATICS COMPUTATION & LOGIC Sturdy st April 7 : to : INSTRUCTIONS TO CANDIDATES This is tke-home exercise. It will not

More information

Handling uncertainty in semantic information retrieval process

Handling uncertainty in semantic information retrieval process Handling uncerainy in semanic informaion rerieval process Chkiwa Mounira 1, Jedidi Anis 1 and Faiez Gargouri 1 1 Mulimedia, InfoRmaion sysems and Advanced Compuing Laboraory Sfax Universiy, Tunisia m.chkiwa@gmail.com,

More information

Image warping/morphing

Image warping/morphing Image arping/morphing Image arping Digial Visual Effecs Yung-Yu Chuang ih slides b Richard Szeliski, Seve Seiz, Tom Funkhouser and leei Efros Image formaion Sampling and quanizaion B Wha is an image We

More information

tr_lisp.asc Page 1 McESE-FranzLISP: McMASTER EXPERT SYSTEM EXTENSION OF FranzLISP F. Franek Technical Report no TR-22/88

tr_lisp.asc Page 1 McESE-FranzLISP: McMASTER EXPERT SYSTEM EXTENSION OF FranzLISP F. Franek Technical Report no TR-22/88 r_lisp.asc Page 1 McESE-FranzLISP: McMASTER EXPERT SYSTEM EXTENSION OF FranzLISP F. Franek Technical Repor no TR-22/88 Deparmen of Compuer Science and Sysems McMaser Universiy 1988 McESE-FranzLISP: McMASTER

More information

Nearest-Neighbor and Fault-Tolerant Quantum Circuit Implementation

Nearest-Neighbor and Fault-Tolerant Quantum Circuit Implementation Neres-Neighbor nd Ful-olern Qunum Circui Implemenion Lxmidhr Biswl, Chndn Bndyopdhyy, Anupm Chopdhyy 2, Rober Wille 3, Rolf Drechsler 4, fizur Rhmn Indin Insiue of Engineering cience nd echnology hibpur,

More information

FUZZY HUMAN/MACHINE RELIABILITY USING VHDL

FUZZY HUMAN/MACHINE RELIABILITY USING VHDL FUZZY HUMN/MCHINE RELIBILITY USING VHDL Carlos. Graciós M. 1, lejandro Díaz S. 2, Efrén Gorroiea H. 3 (1) Insiuo Tecnológico de Puebla v. Tecnológico 420. Col. Maravillas, C. P. 72220, Puebla, Pue. México

More information

CSCI1950 Z Computa4onal Methods for Biology Lecture 2. Ben Raphael January 26, hhp://cs.brown.edu/courses/csci1950 z/ Outline

CSCI1950 Z Computa4onal Methods for Biology Lecture 2. Ben Raphael January 26, hhp://cs.brown.edu/courses/csci1950 z/ Outline CSCI1950 Z Comput4onl Methods for Biology Lecture 2 Ben Rphel Jnury 26, 2009 hhp://cs.brown.edu/courses/csci1950 z/ Outline Review of trees. Coun4ng fetures. Chrcter bsed phylogeny Mximum prsimony Mximum

More information

Many analog implementations of CPG exist, typically using operational amplifier or

Many analog implementations of CPG exist, typically using operational amplifier or FPGA Implementtion of Centrl Pttern Genertor By Jmes J Lin Introuction: Mny nlog implementtions of CPG exist, typiclly using opertionl mplifier or trnsistor level circuits. These types of circuits hve

More information

CAMERA CALIBRATION BY REGISTRATION STEREO RECONSTRUCTION TO 3D MODEL

CAMERA CALIBRATION BY REGISTRATION STEREO RECONSTRUCTION TO 3D MODEL CAMERA CALIBRATION BY REGISTRATION STEREO RECONSTRUCTION TO 3D MODEL Klečka Jan Docoral Degree Programme (1), FEEC BUT E-mail: xkleck01@sud.feec.vubr.cz Supervised by: Horák Karel E-mail: horak@feec.vubr.cz

More information

Performance Evaluation of Implementing Calls Prioritization with Different Queuing Disciplines in Mobile Wireless Networks

Performance Evaluation of Implementing Calls Prioritization with Different Queuing Disciplines in Mobile Wireless Networks Journal of Compuer Science 2 (5): 466-472, 2006 ISSN 1549-3636 2006 Science Publicaions Performance Evaluaion of Implemening Calls Prioriizaion wih Differen Queuing Disciplines in Mobile Wireless Neworks

More information

Visualizing Complex Notions of Time

Visualizing Complex Notions of Time Visualizing Complex Noions of Time Rober Kosara, Silvia Miksch Insiue of Sofware Technology, Vienna Universiy of Technology, Vienna, Ausria Absrac Time plays an imporan role in medicine. Condiions are

More information

Outline. CS38 Introduction to Algorithms 5/8/2014. Network flow. Lecture 12 May 8, 2014

Outline. CS38 Introduction to Algorithms 5/8/2014. Network flow. Lecture 12 May 8, 2014 /8/0 Ouline CS8 Inroducion o Algorihm Lecure May 8, 0 Nework flow finihing capaciy-caling analyi Edmond-Karp, blocking-flow implemenaion uni-capaciy imple graph biparie maching edge-dijoin pah aignmen

More information

Voltair Version 2.5 Release Notes (January, 2018)

Voltair Version 2.5 Release Notes (January, 2018) Volair Version 2.5 Release Noes (January, 2018) Inroducion 25-Seven s new Firmware Updae 2.5 for he Volair processor is par of our coninuing effors o improve Volair wih new feaures and capabiliies. For

More information

Streamline Pathline Eulerian Lagrangian

Streamline Pathline Eulerian Lagrangian Sreamline Pahline Eulerian Lagrangian Sagnaion Poin Flow V V V = + = + = + o V xi y j a V V xi y j o Pahline and Sreakline Insananeous Sreamlines Pahlines Sreaklines Maerial Derivaive Acceleraion

More information

CS412/413. Introduction to Compilers Tim Teitelbaum. Lecture 4: Lexical Analyzers 28 Jan 08

CS412/413. Introduction to Compilers Tim Teitelbaum. Lecture 4: Lexical Analyzers 28 Jan 08 CS412/413 Introduction to Compilers Tim Teitelum Lecture 4: Lexicl Anlyzers 28 Jn 08 Outline DFA stte minimiztion Lexicl nlyzers Automting lexicl nlysis Jlex lexicl nlyzer genertor CS 412/413 Spring 2008

More information

Lecture 10 Splines Introduction to Splines

Lecture 10 Splines Introduction to Splines ES8 Economerics. Inroducion o Splines. Esiming Spline Mehod One. Esiming Spline Mehod To.4 Cuic Splines Lecure Splines. Inroducion o Splines Firs pplied Poirier & Grer (974) in sud of profi res in hree

More information

Data Structures and Algorithms. The material for this lecture is drawn, in part, from The Practice of Programming (Kernighan & Pike) Chapter 2

Data Structures and Algorithms. The material for this lecture is drawn, in part, from The Practice of Programming (Kernighan & Pike) Chapter 2 Daa Srucures and Algorihms The maerial for his lecure is drawn, in par, from The Pracice of Programming (Kernighan & Pike) Chaper 2 1 Moivaing Quoaion Every program depends on algorihms and daa srucures,

More information

MORPHOLOGICAL SEGMENTATION OF IMAGE SEQUENCES

MORPHOLOGICAL SEGMENTATION OF IMAGE SEQUENCES MORPHOLOGICAL SEGMENTATION OF IMAGE SEQUENCES B. MARCOTEGUI and F. MEYER Ecole des Mines de Paris, Cenre de Morphologie Mahémaique, 35, rue Sain-Honoré, F 77305 Fonainebleau Cedex, France Absrac. In image

More information

Hidden Markov Model and Chapman Kolmogrov for Protein Structures Prediction from Images

Hidden Markov Model and Chapman Kolmogrov for Protein Structures Prediction from Images Hidden Markov Model and Chapman Kolmogrov for Proein Srucures Predicion from Images Md.Sarwar Kamal 1, Linkon Chowdhury 2, Mohammad Ibrahim Khan 2, Amira S. Ashour 3, João Manuel R.S. Tavares 4, Nilanjan

More information

Engineer To Engineer Note

Engineer To Engineer Note Engineer To Engineer Note EE-169 Technicl Notes on using Anlog Devices' DSP components nd development tools Contct our technicl support by phone: (800) ANALOG-D or e-mil: dsp.support@nlog.com Or visit

More information

Analysis of Various Types of Bugs in the Object Oriented Java Script Language Coding

Analysis of Various Types of Bugs in the Object Oriented Java Script Language Coding Indian Journal of Science and Technology, Vol 8(21), DOI: 10.17485/ijs/2015/v8i21/69958, Sepember 2015 ISSN (Prin) : 0974-6846 ISSN (Online) : 0974-5645 Analysis of Various Types of Bugs in he Objec Oriened

More information

Alignment of Long Sequences. BMI/CS Spring 2012 Colin Dewey

Alignment of Long Sequences. BMI/CS Spring 2012 Colin Dewey Alignment of Long Sequences BMI/CS 776 www.biostt.wisc.edu/bmi776/ Spring 2012 Colin Dewey cdewey@biostt.wisc.edu Gols for Lecture the key concepts to understnd re the following how lrge-scle lignment

More information

! errors caused by signal attenuation, noise.!! receiver detects presence of errors:!

! errors caused by signal attenuation, noise.!! receiver detects presence of errors:! Daa Link Layer! The Daa Link layer can be furher subdivided ino:!.! Logical Link Conrol (LLC): error and flow conrol!.! Media Access Conrol (MAC): framing and media access! differen link proocols may provide

More information

Gauss-Jordan Algorithm

Gauss-Jordan Algorithm Gauss-Jordan Algorihm The Gauss-Jordan algorihm is a sep by sep procedure for solving a sysem of linear equaions which may conain any number of variables and any number of equaions. The algorihm is carried

More information

pdfapilot Server 2 Manual

pdfapilot Server 2 Manual pdfpilot Server 2 Mnul 2011 by clls softwre gmbh Schönhuser Allee 6/7 D 10119 Berlin Germny info@cllssoftwre.com www.cllssoftwre.com Mnul clls pdfpilot Server 2 Pge 2 clls pdfpilot Server 2 Mnul Lst modified:

More information

Why not experiment with the system itself? Ways to study a system System. Application areas. Different kinds of systems

Why not experiment with the system itself? Ways to study a system System. Application areas. Different kinds of systems Simulaion Wha is simulaion? Simple synonym: imiaion We are ineresed in sudying a Insead of experimening wih he iself we experimen wih a model of he Experimen wih he Acual Ways o sudy a Sysem Experimen

More information

Solving Problems by Searching. CS 486/686: Introduction to Artificial Intelligence

Solving Problems by Searching. CS 486/686: Introduction to Artificial Intelligence Solving Prolems y Serching CS 486/686: Introduction to Artificil Intelligence 1 Introduction Serch ws one of the first topics studied in AI - Newell nd Simon (1961) Generl Prolem Solver Centrl component

More information

Improving the Efficiency of Dynamic Service Provisioning in Transport Networks with Scheduled Services

Improving the Efficiency of Dynamic Service Provisioning in Transport Networks with Scheduled Services Improving he Efficiency of Dynamic Service Provisioning in Transpor Neworks wih Scheduled Services Ralf Hülsermann, Monika Jäger and Andreas Gladisch Technologiezenrum, T-Sysems, Goslarer Ufer 35, D-1585

More information

Architectural Design and Implementation of 2008 ZigBee Specification on TKNlS.4 Layer

Architectural Design and Implementation of 2008 ZigBee Specification on TKNlS.4 Layer rchiecural Design and mplemenaion of 2008 ZigBee Specificaion on TKNlS.4 Layer nh-vu Dinh-Due Universiy of nfonnaion Technology Ho Chi Minh ciy, Vie Nam anhvu@ui.edu.vn Ngoe-nLam HCMC Universiy of Technology

More information

F. R. K. Chung y. University ofpennsylvania. Philadelphia, Pennsylvania R. L. Graham. AT&T Labs - Research. March 2,1997.

F. R. K. Chung y. University ofpennsylvania. Philadelphia, Pennsylvania R. L. Graham. AT&T Labs - Research. March 2,1997. Forced convex n-gons in the plne F. R. K. Chung y University ofpennsylvni Phildelphi, Pennsylvni 19104 R. L. Grhm AT&T Ls - Reserch Murry Hill, New Jersey 07974 Mrch 2,1997 Astrct In seminl pper from 1935,

More information