Generating Editors for Direct Manipulation of Diagrams

Size: px
Start display at page:

Download "Generating Editors for Direct Manipulation of Diagrams"

Transcription

1 Generting Eitors for Diret Mnipultion of Digrms Gerhr Viehstet n Mrk Mins Lehrstuhl für Progrmmiersprhen Universität Erlngen-Nürnerg Mrtensstr. 3, Erlngen, Germny E-mil: fviehste,minsg@informtik.uni-erlngen.e Astrt. Digrms (e.g., trees for hierrhil strutures, or grphs for finite stte mhines) re often neee s prt of vne user interfes, n re frequently speifi to user s pplition. The implementtion of eitors for igrms shoul e supporte y tool n se on forml moel. This pper gives n overview of DiGen, our genertor for igrm eitors. An eitor for ertin kin of igrm is generte from speifition, whih inlues grmmr to esrie the struture of igrms. The user of igrm eitor, however, oes not hve to e onerne with the grmmr, ut n mnipulte igrms very onveniently y iret mnipultion. 1 Introution Toy s Grphil User Interfes (GUIs) re usully not very grphil, n ssessment lso me in reent CACM issue on GUIs [1]: Wht the mrket onsiers GUI is little more thn glorifie menu system, hving no grphis. This leves the grphil representtion of the pplition omin s n exerise for the eveloper, ::: More omplex strutures in the pplition omin n often e grphilly represente in n esily omprehensile wy y some kin of igrm. It is esirle to mke igrms prt of the user interfe n let user intertively eit them. These igrms my e ertin trees for epiting hierrhil reltionships, or grphs, e.g., for finite stte mhines. Nssi-Shneiermn igrms (NSDs) re nother lssil exmple [2]. We use the term igrm lss to refer to speifi kin of igrm. An eitor tilore to some igrm lss is lle igrm eitor. A igrm eitor is neee for supporting omplex eiting opertions n lyout. Furthermore, suh n eitor n ensure tht the igrms onstrute y the user hve vli struture, n thus re meningful. E.g., we my wnt to provie winow s prt of UI in whih the user n write simple progrms y rwing n NSD. Then only well-struture NSDs re meningful for the pplition. For the implementtion of igrm eitor, tool is neee in orer to reue the effort. Most user interfe tools provie no help for igrms. Some tools, e.g., Grnet [3], support simple kins of igrms. The struture of vli igrms, however, hs to e mintine y the progrmmer using Grnet n is more or less hien in the oe. There re only very few systems for generting igrm eitor tht re se on forml moel. Just onept for igrm eitors is presente in [4], ut genertor hs

2 not een relize. In the PAGG system [5] lyout of igrms is troulesome n eiting inonvenient. The Constrint system [6] uses grmmr moel se on onfree grmmrs n onstrints for utomti lyout of igrms. A isvntge is tht on-free grmmrs o not permit iret representtion of multiimensionl reltionships, s neee for the lyout of igrms. Furthermore, the eiting pilities re very restrite. DiGen, genertor for igrm eitors, will e outline in this pper. The nturl n onvenient wy of eiting will e illustrte in the next setion. Setion 3 gives n overview of the system. The grmmr moel for speifying the struture of igrms n lyout re the topi of Setion 3.1. User intertion with igrms will e riefly resse in Setion Diret Mnipultion A igrm eitor for Nssi-Shneiermn igrms (NSDs), whih ws generte with DiGen, serves for emonstrting iret mnipultion. An NSD minly onsists of lines n loks for sttements n onitions. These igrm elements n e selete in ifferent wys, whih re stte in the speifition n thus pte to the prtiulr eitor. For our smple eitor it hs een speifie tht susequent selete sttements (whih my e omplex) re utomtilly omine into single entity lle group. In Fig. 1 group of two susequent sttements is selete, whih is inite y the hnles. Fig. 1. Eiting stte with two NSDs. A group of two susequent sttements (onsisting of simple sttement n n if ) is selete in the lower NSD. Fig. 2. Sitution fter moving the group selete in Fig. 1 to the eginning of the while. As n exmple, we now wnt to remove this group from its position n insert it into the upper NSD s the first sttements of the while. Fig. 2 shows the result. One wy to

3 hieve this is to press the Cut-utton, n then selet the line immeitely elow the while s onition to inite the position for insertion. Finlly, the Insert-utton hs to e presse. This eiting style is solely se on seletion n pressing uttons or hoosing menu items. It is the only wy of eiting possile in igrm eitors whih n e generte with other tools like PAGG [5] or Constrints [6]. The onept is the sme s in the Synthesizer Genertor [7] for syntx-irete eiting. It is suffiient there, ut for igrms more nturl wy of eiting is esirle. With DiGen igrm eitors offering true iret mnipultion n e speifie. E.g., the moifition from Fig. 1 to Fig. 2 n lso e me y simply pressing the mouse utton while the mouse pointer is lote over the selete group, rgging this group to its estintion, n relesing the mouse utton over the line elow the while s onition. In the sme wy ny prt of igrm n e remove n inserte t ny other spot. A igrm prt n e me new NSD of its own in similr fshion y moving it roun n relesing the mouse utton outsie ny other NSD. Of ourse, n entire NSD n lso e inserte into nother igrm. A numer of other eiting opertions y iret mnipultion hve een speifie for the NSD eitor. E.g., the then-nelse-rnh of n if n e swithe y pressing the mouse utton over the if s tringle with y insie, rgging it to the right, n relesing it over the orresponing n (or the other wy roun). Another exmple of iret mnipultion is to hnge while into n until y moving the while s onition own to the en of the while n relesing the mouse utton there. Similrly, n until n e moifie into while. DiGen genertes igrm eitor for some igrm lss (e.g., NSDs) from speifition, whih onsists of the prts shown in Fig The Genertor DiGen A mjor prt is the grmmr for the igrm lss. Setion 3.1 will esrie smple grmmr. Some prtiulr igrm shown on the sreen is internlly represente in the igrm eitor y erivtion grph, whih is the min t struture (see Fig. 3). Lyout onitions re tthe to grmmr proutions in the speifition. They onstrin the vlues of lyout ttriutes n thus etermine igrm s lyout. The terminl symols in erivtion grph re mppe on the sreen. Their imge is ompose of primitive elements (lines,, et.) n lso prt of the speifition. The remining prts of igrm eitor s speifition in Fig. 3 re neee for user intertion. 3.1 Digrm ruture n Lyout A igrm lss, i.e., the syntti struture of igrms whih will e eite, is speifie y hypergrph grmmr. A hypergrph is generliztion of grph, in whih eges re hypereges, i.e., they n e onnete to ny (fixe) numer of noes [8]. Eh (hyper)ege hs type n numer of onnetion points tht etermine how mny noes the hyperege is onnete to. We sy the ege visits these noes. The fmilir

4 Digrm Eitor Groups Derivtion grph Lyout ttriutes Grphil interfe Grphil ojets Group efinition Digrm representtion n trnsformtion Constrint stisftion moules Intertion t ll t flow Group types Speifition Event utomt Grmmr n trnsformtions Lyout onitions Imge of terminl symols trget of speifition Fig. 3. Overview of igrm eitor generte with DiGen n its speifition. irete grph n e seen s hypergrph in whih ll (hyper)eges visit extly two noes. Con-free hypergrph grmmrs re nlogously efine s on-free (string) grmmrs n hve similr properties [9]. Terminl n nonterminl hypereges re use in hypergrph grmmrs inste of lphet symols in on-free string grmmrs. In ontrst to on-free string grmmrs, however, hypergrphs n represent multiimensionl reltionships iretly. Noes in hypergrph stn for points (e.g., in the plne), hypereges re igrm elements whose position is given y the noes eing visite y the ege. This is illustrte in Fig. 4, whih epits the hypergrph orresponing to the upper NSD in Fig. 1 (in slightly simplifie mnner). The representtion in the PAGG n Constrint systems [5, 6], whih o not use hypergrphs, woul e signifintly more omplite. Eh proution in on-free hypergrph grmmr onsists on its left hn sie (lhs) of hypergrph with single nonterminl ege n the noes visite, see Fig. 5. The lhs of proution P 1 is the strting grph of the grmmr. The right hn sie (rhs) of every proution is n ritrry hypergrph of terminl n nonterminl hypereges. Applition of proution to hypergrph is similr to on-free string grmmrs, too: if the lhs is sugrph of the hypergrph, this sugrph is remove n reple y the rhs. The resulting hypergrph is si to e erive from the first hypergrph. In

5 y on on n Fig. 4. Hypergrph orresponing to the upper NSD in Fig. 1. Noes re shown s lk irles. Lines,, on, y, n n re terminl hypereges. Lines hve rity 2, n on rity 4, y n n rity 3. P 1 P 2 NSD P 5.x = f.x.x = i.x.y = e.y =.y f.y = g.y f.x+0.5 = g.x h.x+0.5 = i.x f y e g Con h n i P 3 P 6 P 7 retngle(,,,).x+0.25 = e.x e Con e P 4 retngle(,,,).y-.y.h.x-.x.w retngle(,,,) stns for.x =.x.x =.x.y =.y.y =.y P 8 retngle(,,,).x+0.25 = e.x Con on retngle(,,,).y-.y on.h.x-.x on.w Con Fig. 5. Con-free hypergrph grmmr for NSDs. Terminl hypereges re the sme s in Fig. 4. Nonterminls (light she) n stn for sttement sequene resp. sttement, Con for onition. retngle(,,,) is use s shortut for.x =.x,.x =.x,.y =.y,.y =.y.

6 orer to speify whih rhs noe reples whih lhs noe, orresponing noes of the lhs n the rhs re lele with the sme letters. A smple erivtion sequene is shown in Fig. 6. Con-free hypergrph proutions re suffiient for the NSD exmple. There re lso on-sensitive proutions for speifying igrm struture, ut they re not resse here. NSD P 1 P 3 P 3 P 6 Con Fig. 6. Prt of the erivtion for the hypergrph in Fig. 4 using the proutions from Fig. 5. The igrm lss given y (on-free) hypergrph grmmr is the set of erivtion grphs tht re erivle from the strting grph n onsist of terminl hypereges only. Just these erivtion grphs re mppe on the sreen suh tht the user of igrm eitor only sees vli igrms. Furthermore, the user is not wre of the grmmr proutions n els with igrms in n pplition-oriente wy, s shown in Setion 2. Hypergrph grmmrs n esrie the syntti struture of igrms, ut lyout requirements re not inlue. For on-free (string) grmmrs this prolem n e solve y ttriutegrmmrs [10], i.e., y ssigning ttriutes to grmmr symols n funtionl epenenies to proutions tht etermine the ttriute vlues. Constrints were me populr y Borning [11] for lyout in intertive environments. Constrints re onitions utomtilly mintine y the system. They permit very high level speifition of lyout. The vntge of onstrints is tht they hve multiiretionl nture, wheres in ttriute grmmrs hnges re propgte only into one iretion. Vner Znen [6] omine onstrints with on-free (string) grmmrs y ssigning ttriutes to grmmr symols, n y ing onstrints, whih hve to e equtions, to eh proutionin orerto eterminethettriutes vlues. Hypergrph grmmrs re ttriute in similr wy. However, not only eges, whih orrespon to lphet symols in on-free (string) grmmrs, rry ttriutes, ut lso noes. Sine ny numer of hypereges n e onnete to noe,

7 noe ttriutes re ommon ttriutes for ll hypereges visiting this noe. The vntge is tht with using hypergrphs only few onstrints re neee ompre to [6]. Furthermore, onstrints n e liner inequlities in DiGen. Equtions etermine reltions etween ttriute vlues in efinite wy, wheres inequlity onstrints permit whole rnge of vlues s solutions. This is onvenient wy to omine utomti lyout of igrms provie y the system with user-efine moifitions. More etils on lyout n the inrementl lgorithm for onstrint stisftion uilt into our genertor n e foun in [12]. The onstrints for lyout of NSDs re shown in Fig. 5. Every noe hs ttriutes x n y for the noe s position. They re referre to y n:x n n:y for noe lele n.the only ege ttriutes neee re.h,.w, on.h, non.w for the miniml height n with of loks n onitions. The vlues of the ege ttriutes re etermine y the size of the tully ontine in the terminl symol. There re no onstrints neee for proutions P 1, P 2,nP 3. Just those in Fig. 5 re suffiient for lyout ue to noe ttriutes, whih re shre mong ll visiting hypereges. 3.2 User Intertion The min feture onerning user intertion is tht igrm n e moifie very onveniently in iret mnipultion style y just moving igrm elements roun on the sreen. This is not the se for other systems like PAGG or Constrints [5, 6], in whih eiting opertions hve to e hosen from menu. In igrm eitor generte with DiGen the intertion moule (see Fig. 3) is responsile for the retion on user s tions with mouse n keyor. They n, e.g., use seletion of igrm elements, lyout hnges, or trnsformtions of the igrm s struture. A trnsformtion is trnsition from set of igrms to nother set of igrms. The struture of one or more igrms n e hnge, ut the user of igrm eitor only sees vli igrms, i.e., igrms elonging to the speifie igrm lss. In ontrst to [6], trnsformtions in DiGen n e omplex n onsist of severl primitive steps. This enles more powerful trnsformtions n reusge of primitives. E.g., mny trnsformtions in the NSD eitor re se on primitives for eleting or inserting sequene of (ompoun) sttements. In igrm eitors generte with DiGen trnsformtions n lso e use to speify exeution of igrm, s in our smple eitor for finite stte mhines. A user first onstruts finite stte mhine with its sttes n trnsitions. Some sttes n e mrke s finl sttes, one s the initil stte. Fig. 7 shows the sitution fter onstruting finite stte mhine n pressing utton rt. The user ws ske to provie n input string for the finite stte mhine, n the urrent stte ws set to the initil stte. If there is suitle trnsition for the urrently first hrter in the input string, eh press on utton ep uses trnsition n removes the first hrter from the input. Pressing ep one yiels Fig Conlusions Diret mnipultion of igrms hs to e more thn seleting items n hoosing opertions from menu. DiGen genertes igrm eitors with iret mnipultion op-

8 Fig. 7. Simple finite stte mhine fter pressing utton rt. The finlstte is mrke y oule orer line, the initil stte y thik orer line. The urrent stte is set to the initil stte, whih is inite y the fille irle. Fig. 8. Sitution rising from Fig. 7 fter pressing utton ep one. ertions from speifition. A igrm lss is speifie y forml moel se on hypergrph grmmrs. This kin of grmmr is useful for esriing multiimensionl reltionships etween igrm elements. Furthermore, lyout of igrms is efine on high level y onstrints. Complex eiting opertions n exeution of igrm n e speifie in DiGen. Nevertheless, igrm eite y the user lwys is in onsistent stte, whih is hypergrph in the forml moel. This hypergrph n e use y other prts of the pplition. A prototype of DiGen hs een implemente. Future work will e to generte more smple eitors n link them to pplitions. Referenes 1. A. Morse n G. Reynols, Overoming urrent growth limits in UI evelopment, Communitions of the ACM, vol. 36, pp , Apr I. Nssi n B. Shneiermn, Flowhrt tehniques for struture progrmming, ACM SIGPLAN Noties, vol. 8, pp , Aug B.A. Myers, D.A. Giuse, R.B. Dnnenerg, et l., Grnet - Comprehensive support for grphil, highly intertive user interfes, Computer, vol.23, pp , Nov F. Arefi, C.E. Hughes, n D.A. Workmn, Automtilly generting visul syntx-irete eitors, Communitions of the ACM, vol. 33, pp , Mr H. Göttler, Grph grmmrs, new prigm for implementing visul lnguges, in N. Dershowitz, eitor, Rewriting Tehniques n Applitions, vol. 355 of Leture Notes in Computer Siene, pp Springer, 1989.

9 6. B.T. Vner Znen, Constrint grmmrs - new moel for speifying grphil pplitions, in K. Bie n C. Lewis, eitors, Pro. CHI 89, vol. 20 of SIGCHI Bulletin, pp , Mr T.W. Reps n T. Teitelum, The Synthesizer Genertor, Springer, New York, C. Berge, Hypergrphs, North-Holln, Amsterm, F. Drewes n H.-J. Kreowski, A note on hyperege replement, in H. Ehrig, H.-J. Kreowski, n G. Rozenerg, eitors, Leture Notes in Computer Siene, vol. 532, pp Springer, D.E. Knuth, Semntis of on-free lnguges, Mthemtil Systems Theory, vol. 2, pp , A. Borning, The progrmming lnguge spets of ThingL, onstrintoriente simultion lortory, ACM Trnstions on Progrmming Lnguges n Systems, vol. 3, pp , Ot M. Mins n G. Viehstet, Speifition of igrm eitors proviing lyout justment with miniml hnge, in Pro IEEE Symposium on Visul Lnguges, pp IEEE Computer Soiety Press, 1993.

Class Overview. Database Design. Database Design Process. Database Design. Introduction to Data Management CSE 414

Class Overview. Database Design. Database Design Process. Database Design. Introduction to Data Management CSE 414 Introution to Dt Mngement CSE 44 Unit 6: Coneptul Design E/R Digrms Integrity Constrints BCNF Introution to Dt Mngement CSE 44 E/R Digrms ( letures) CSE 44 Autumn 08 Clss Overview Dtse Design Unit : Intro

More information

10.2 Graph Terminology and Special Types of Graphs

10.2 Graph Terminology and Special Types of Graphs 10.2 Grph Terminology n Speil Types of Grphs Definition 1. Two verties u n v in n unirete grph G re lle jent (or neighors) in G iff u n v re enpoints of n ege e of G. Suh n ege e is lle inient with the

More information

Chapter 9. Greedy Technique. Copyright 2007 Pearson Addison-Wesley. All rights reserved.

Chapter 9. Greedy Technique. Copyright 2007 Pearson Addison-Wesley. All rights reserved. Chpter 9 Greey Tehnique Copyright 2007 Person Aison-Wesley. All rights reserve. Greey Tehnique Construts solution to n optimiztion prolem piee y piee through sequene of hoies tht re: fesile lolly optiml

More information

Distance vector protocol

Distance vector protocol istne vetor protool Irene Finohi finohi@i.unirom.it Routing Routing protool Gol: etermine goo pth (sequene of routers) thru network from soure to Grph strtion for routing lgorithms: grph noes re routers

More information

Table-driven look-ahead lexical analysis

Table-driven look-ahead lexical analysis Tle-riven look-he lexil nlysis WUU YANG Computer n Informtion Siene Deprtment Ntionl Chio-Tung University, HsinChu, Tiwn, R.O.C. Astrt. Moern progrmming lnguges use regulr expressions to efine vli tokens.

More information

CS 241 Week 4 Tutorial Solutions

CS 241 Week 4 Tutorial Solutions CS 4 Week 4 Tutoril Solutions Writing n Assemler, Prt & Regulr Lnguges Prt Winter 8 Assemling instrutions utomtilly. slt $d, $s, $t. Solution: $d, $s, nd $t ll fit in -it signed integers sine they re 5-it

More information

COMPUTER EDUCATION TECHNIQUES, INC. (WEBLOGIC_SVR_ADM ) SA:

COMPUTER EDUCATION TECHNIQUES, INC. (WEBLOGIC_SVR_ADM ) SA: In orer to lern whih questions hve een nswere orretly: 1. Print these pges. 2. Answer the questions. 3. Sen this ssessment with the nswers vi:. FAX to (212) 967-3498. Or. Mil the nswers to the following

More information

CS 340, Fall 2016 Sep 29th Exam 1 Note: in all questions, the special symbol ɛ (epsilon) is used to indicate the empty string.

CS 340, Fall 2016 Sep 29th Exam 1 Note: in all questions, the special symbol ɛ (epsilon) is used to indicate the empty string. CS 340, Fll 2016 Sep 29th Exm 1 Nme: Note: in ll questions, the speil symol ɛ (epsilon) is used to indite the empty string. Question 1. [10 points] Speify regulr expression tht genertes the lnguge over

More information

Greedy Algorithm. Algorithm Fall Semester

Greedy Algorithm. Algorithm Fall Semester Greey Algorithm Algorithm 0 Fll Semester Optimiztion prolems An optimiztion prolem is one in whih you wnt to fin, not just solution, ut the est solution A greey lgorithm sometimes works well for optimiztion

More information

UTMC APPLICATION NOTE UT1553B BCRT TO INTERFACE PSEUDO-DUAL-PORT RAM ARCHITECTURE INTRODUCTION ARBITRATION DETAILS DESIGN SELECTIONS

UTMC APPLICATION NOTE UT1553B BCRT TO INTERFACE PSEUDO-DUAL-PORT RAM ARCHITECTURE INTRODUCTION ARBITRATION DETAILS DESIGN SELECTIONS UTMC APPLICATION NOTE UT1553B BCRT TO 80186 INTERFACE INTRODUCTION The UTMC UT1553B BCRT is monolithi CMOS integrte iruit tht provies omprehensive Bus Controller n Remote Terminl funtions for MIL-STD-

More information

CSc 453 Compilers and Systems Software. 6 : Top-Down Parsing I

CSc 453 Compilers and Systems Software. 6 : Top-Down Parsing I C 45 Compilers n ystems oftwre 6 : op-down Prsing I Christin Collberg Deprtment of Computer iene University of rizon ollberg@gmil.om Copyright 2009 Christin Collberg eptember 14, 2009 1 Overview 2 Compiler

More information

CICS Application Design

CICS Application Design CICS Applition Design In orer to lern whih questions hve een nswere orretly: 1. Print these pges. 2. Answer the questions. 3. Sen this ssessment with the nswers vi:. FAX to (212) 967-3498. Or. Mil the

More information

V = set of vertices (vertex / node) E = set of edges (v, w) (v, w in V)

V = set of vertices (vertex / node) E = set of edges (v, w) (v, w in V) Definitions G = (V, E) V = set of verties (vertex / noe) E = set of eges (v, w) (v, w in V) (v, w) orere => irete grph (igrph) (v, w) non-orere => unirete grph igrph: w is jent to v if there is n ege from

More information

COMPUTER EDUCATION TECHNIQUES, INC. (XML ) SA:

COMPUTER EDUCATION TECHNIQUES, INC. (XML ) SA: In orer to lern whih questions hve een nswere orretly: 1. Print these pges. 2. Answer the questions. 3. Sen this ssessment with the nswers vi:. FAX to (212) 967-3498. Or. Mil the nswers to the following

More information

Duality in linear interval equations

Duality in linear interval equations Aville online t http://ijim.sriu..ir Int. J. Industril Mthemtis Vol. 1, No. 1 (2009) 41-45 Dulity in liner intervl equtions M. Movhedin, S. Slhshour, S. Hji Ghsemi, S. Khezerloo, M. Khezerloo, S. M. Khorsny

More information

Lesson 4.4. Euler Circuits and Paths. Explore This

Lesson 4.4. Euler Circuits and Paths. Explore This Lesson 4.4 Euler Ciruits nd Pths Now tht you re fmilir with some of the onepts of grphs nd the wy grphs onvey onnetions nd reltionships, it s time to egin exploring how they n e used to model mny different

More information

Internet Routing. Reminder: Routing. CPSC Network Programming

Internet Routing. Reminder: Routing. CPSC Network Programming PS 360 - Network Progrmming Internet Routing Mihele Weigle eprtment of omputer Siene lemson University mweigle@s.lemson.eu pril, 00 http://www.s.lemson.eu/~mweigle/ourses/ps360 Reminer: Routing Internet

More information

Containers: Queue and List

Containers: Queue and List Continers: Queue n List Queue A ontiner in whih insertion is one t one en (the til) n eletion is one t the other en (the he). Also lle FIFO (First-In, First-Out) Jori Cortell n Jori Petit Deprtment of

More information

Introduction to Algebra

Introduction to Algebra INTRODUCTORY ALGEBRA Mini-Leture 1.1 Introdution to Alger Evlute lgeri expressions y sustitution. Trnslte phrses to lgeri expressions. 1. Evlute the expressions when =, =, nd = 6. ) d) 5 10. Trnslte eh

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

Fig.25: the Role of LEX

Fig.25: the Role of LEX The Lnguge for Specifying Lexicl Anlyzer We shll now study how to uild lexicl nlyzer from specifiction of tokens in the form of list of regulr expressions The discussion centers round the design of n existing

More information

Error Numbers of the Standard Function Block

Error Numbers of the Standard Function Block A.2.2 Numers of the Stndrd Funtion Blok evlution The result of the logi opertion RLO is set if n error ours while the stndrd funtion lok is eing proessed. This llows you to rnh to your own error evlution

More information

Bayesian Networks: Directed Markov Properties (Cont d) and Markov Equivalent DAGs

Bayesian Networks: Directed Markov Properties (Cont d) and Markov Equivalent DAGs Byesin Networks: Direte Mrkov Properties (Cont ) n Mrkov Equivlent DAGs Huizhen Yu jney.yu@s.helsinki.fi Dept. Computer Siene, Univ. of Helsinki Proilisti Moels, Spring, 2010 Huizhen Yu (U.H.) Byesin Networks:

More information

COMMON FRACTIONS. or a / b = a b. , a is called the numerator, and b is called the denominator.

COMMON FRACTIONS. or a / b = a b. , a is called the numerator, and b is called the denominator. COMMON FRACTIONS BASIC DEFINITIONS * A frtion is n inite ivision. or / * In the frtion is lle the numertor n is lle the enomintor. * The whole is seprte into "" equl prts n we re onsiering "" of those

More information

Hypergraph Representation of Diagrams in Diagram Editors

Hypergraph Representation of Diagrams in Diagram Editors Hypergrph Representtion of Digrms in Digrm Editors Mrk Mins Lehrstuhl für Progrmmiersprchen Universität Erlngen-Nürnerg Mrtensstr. 3, 91058 Erlngen, Germny emil: mins@informtik.uni-erlngen.de Astrct When

More information

WORKSHOP 9 HEX MESH USING SWEEP VECTOR

WORKSHOP 9 HEX MESH USING SWEEP VECTOR WORKSHOP 9 HEX MESH USING SWEEP VECTOR WS9-1 WS9-2 Prolem Desription This exerise involves importing urve geometry from n IGES file. The urves re use to rete other urves. From the urves trimme surfes re

More information

Lexical analysis, scanners. Construction of a scanner

Lexical analysis, scanners. Construction of a scanner Lexicl nlysis scnners (NB. Pges 4-5 re for those who need to refresh their knowledge of DFAs nd NFAs. These re not presented during the lectures) Construction of scnner Tools: stte utomt nd trnsition digrms.

More information

CS321 Languages and Compiler Design I. Winter 2012 Lecture 5

CS321 Languages and Compiler Design I. Winter 2012 Lecture 5 CS321 Lnguges nd Compiler Design I Winter 2012 Lecture 5 1 FINITE AUTOMATA A non-deterministic finite utomton (NFA) consists of: An input lphet Σ, e.g. Σ =,. A set of sttes S, e.g. S = {1, 3, 5, 7, 11,

More information

Midterm Exam CSC October 2001

Midterm Exam CSC October 2001 Midterm Exm CSC 173 23 Otoer 2001 Diretions This exm hs 8 questions, severl of whih hve suprts. Eh question indites its point vlue. The totl is 100 points. Questions 5() nd 6() re optionl; they re not

More information

A matching algorithm for measuring the structural similarity between an XML document and a DTD and its applications $

A matching algorithm for measuring the structural similarity between an XML document and a DTD and its applications $ Informtion Systems 29 (2004) 23 46 A mthing lgorithm for mesuring the struturl similrity etween n XML oument n DTD n its pplitions $ Elis Bertino, Giovnn Guerrini, Mro Mesiti, * Diprtimento i Informti

More information

COMP108 Algorithmic Foundations

COMP108 Algorithmic Foundations Grph Theory Prudene Wong http://www.s.liv..uk/~pwong/tehing/omp108/201617 How to Mesure 4L? 3L 5L 3L ontiner & 5L ontiner (without mrk) infinite supply of wter You n pour wter from one ontiner to nother

More information

GENG2140 Modelling and Computer Analysis for Engineers

GENG2140 Modelling and Computer Analysis for Engineers GENG4 Moelling n Computer Anlysis or Engineers Letures 9 & : Gussin qurture Crete y Grn Romn Joles, PhD Shool o Mehnil Engineering, UWA GENG4 Content Deinition o Gussin qurture Computtion o weights n points

More information

MITSUBISHI ELECTRIC RESEARCH LABORATORIES Cambridge, Massachusetts. Introduction to Matroids and Applications. Srikumar Ramalingam

MITSUBISHI ELECTRIC RESEARCH LABORATORIES Cambridge, Massachusetts. Introduction to Matroids and Applications. Srikumar Ramalingam Cmrige, Msshusetts Introution to Mtrois n Applitions Srikumr Rmlingm MERL mm//yy Liner Alger (,0,0) (0,,0) Liner inepenene in vetors: v, v2,..., For ll non-trivil we hve s v s v n s, s2,..., s n 2v2...

More information

3D convex hulls. Convex Hull in 3D. convex polyhedron. convex polyhedron. The problem: Given a set P of points in 3D, compute their convex hull

3D convex hulls. Convex Hull in 3D. convex polyhedron. convex polyhedron. The problem: Given a set P of points in 3D, compute their convex hull Convex Hull in The rolem: Given set P of oints in, omute their onvex hull onvex hulls Comuttionl Geometry [si 3250] Lur Tom Bowoin College onvex olyheron 1 2 3 olygon olyheron onvex olyheron 4 5 6 Polyheron

More information

Lecture 8: Graph-theoretic problems (again)

Lecture 8: Graph-theoretic problems (again) COMP36111: Advned Algorithms I Leture 8: Grph-theoreti prolems (gin) In Prtt-Hrtmnn Room KB2.38: emil: iprtt@s.mn..uk 2017 18 Reding for this leture: Sipser: Chpter 7. A grph is pir G = (V, E), where V

More information

Type Checking. Roadmap (Where are we?) Last lecture Context-sensitive analysis. This lecture Type checking. Symbol tables

Type Checking. Roadmap (Where are we?) Last lecture Context-sensitive analysis. This lecture Type checking. Symbol tables Type Cheking Rodmp (Where re we?) Lst leture Contet-sensitie nlysis Motition Attriute grmmrs Ad ho Synt-direted trnsltion This leture Type heking Type systems Using synt direted trnsltion Symol tles Leil

More information

PROBLEM OF APOLLONIUS

PROBLEM OF APOLLONIUS PROBLEM OF APOLLONIUS In the Jnury 010 issue of Amerin Sientist D. Mkenzie isusses the Apollonin Gsket whih involves fining the rius of the lrgest irle whih just fits into the spe etween three tngent irles

More information

McAfee Web Gateway

McAfee Web Gateway Relese Notes Revision C MAfee We Gtewy 7.6.2.11 Contents Aout this relese Enhnement Resolved issues Instlltion instrutions Known issues Additionl informtion Find produt doumenttion Aout this relese This

More information

A decision support system prototype for fuzzy multiple objective optimization

A decision support system prototype for fuzzy multiple objective optimization EUSFLAT - LFA A eision support system prototype for fuzzy multiple ojetive optimiztion Fengjie Wu Jie Lu n Gungqun Zhng Fulty of Informtion Tehnology University of Tehnology Syney Austrli E-mil: {fengjiewjieluzhngg}@it.uts.eu.u

More information

CMPUT101 Introduction to Computing - Summer 2002

CMPUT101 Introduction to Computing - Summer 2002 CMPUT Introdution to Computing - Summer 22 %XLOGLQJ&RPSXWHU&LUFXLWV Chpter 4.4 3XUSRVH We hve looked t so fr how to uild logi gtes from trnsistors. Next we will look t how to uild iruits from logi gtes,

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

Photovoltaic Panel Modelling Using a Stochastic Approach in MATLAB &Simulink

Photovoltaic Panel Modelling Using a Stochastic Approach in MATLAB &Simulink hotovolti nel Modelling Using Stohsti Approh in MATLAB &Simulink KAREL ZALATILEK, JAN LEUCHTER eprtment of Eletril Engineering University of efene Kouniov 65, 61 City of Brno CZECH REUBLIC krelzpltilek@unoz,

More information

WORKSHOP 19 GLOBAL/LOCAL MODELING USING FEM FIELDS

WORKSHOP 19 GLOBAL/LOCAL MODELING USING FEM FIELDS WORKSHOP 19 GLOBAL/LOCAL MODELING USING FEM FIELDS WS19-1 WS19-2 Prolem Desription This exerise is use to emonstrte how to mp isplement results from the nlysis of glol(overll) moel onto the perimeter of

More information

Dr. D.M. Akbar Hussain

Dr. D.M. Akbar Hussain Dr. D.M. Akr Hussin Lexicl Anlysis. Bsic Ide: Red the source code nd generte tokens, it is similr wht humns will do to red in; just tking on the input nd reking it down in pieces. Ech token is sequence

More information

CS553 Lecture Introduction to Data-flow Analysis 1

CS553 Lecture Introduction to Data-flow Analysis 1 ! Ide Introdution to Dt-flow nlysis!lst Time! Implementing Mrk nd Sweep GC!Tody! Control flow grphs! Liveness nlysis! Register llotion CS553 Leture Introdution to Dt-flow Anlysis 1 Dt-flow Anlysis! Dt-flow

More information

this grammar generates the following language: Because this symbol will also be used in a later step, it receives the

this grammar generates the following language: Because this symbol will also be used in a later step, it receives the LR() nlysis Drwcks of LR(). Look-hed symols s eplined efore, concerning LR(), it is possile to consult the net set to determine, in the reduction sttes, for which symols it would e possile to perform reductions.

More information

Outline. CS38 Introduction to Algorithms. Graphs. Graphs. Graphs. Graph traversals

Outline. CS38 Introduction to Algorithms. Graphs. Graphs. Graphs. Graph traversals Outline CS38 Introution to Algorithms Leture 2 April 3, 2014 grph trversls (BFS, DFS) onnetivity topologil sort strongly onnete omponents heps n hepsort greey lgorithms April 3, 2014 CS38 Leture 2 2 Grphs

More information

Paradigm 5. Data Structure. Suffix trees. What is a suffix tree? Suffix tree. Simple applications. Simple applications. Algorithms

Paradigm 5. Data Structure. Suffix trees. What is a suffix tree? Suffix tree. Simple applications. Simple applications. Algorithms Prdigm. Dt Struture Known exmples: link tble, hep, Our leture: suffix tree Will involve mortize method tht will be stressed shortly in this ourse Suffix trees Wht is suffix tree? Simple pplitions History

More information

Advanced Programming Handout 5. Enter Okasaki. Persistent vs. Ephemeral. Functional Queues. Simple Example. Persistent vs.

Advanced Programming Handout 5. Enter Okasaki. Persistent vs. Ephemeral. Functional Queues. Simple Example. Persistent vs. Avne Progrmming Hnout 5 Purel Funtionl Dt Strutures: A Cse Stu in Funtionl Progrmming Persistent vs. Ephemerl An ephemerl t struture is one for whih onl one version is ville t time: fter n upte opertion,

More information

Parallelization Optimization of System-Level Specification

Parallelization Optimization of System-Level Specification Prlleliztion Optimiztion of System-Level Speifition Luki i niel. Gjski enter for Emedded omputer Systems University of liforni Irvine, 92697, US {li, gjski} @es.ui.edu strt This pper introdues the prlleliztion

More information

Lecture 12 : Topological Spaces

Lecture 12 : Topological Spaces Leture 12 : Topologil Spes 1 Topologil Spes Topology generlizes notion of distne nd loseness et. Definition 1.1. A topology on set X is olletion T of susets of X hving the following properties. 1. nd X

More information

WORKSHOP 6 FRAME SURFACE MODEL ANALYSIS

WORKSHOP 6 FRAME SURFACE MODEL ANALYSIS WORKSHOP 6 FRAME SURFACE MODEL ANALYSIS WS6-1 WS6-2 Workshop Ojetives Crete finite element moel (meshes; onnet jent elements; pply e los, operting los, n grvity los; onstrin noes) for intermeitely iffiult

More information

5 ANGLES AND POLYGONS

5 ANGLES AND POLYGONS 5 GLES POLYGOS urling rige looks like onventionl rige when it is extene. However, it urls up to form n otgon to llow ots through. This Rolling rige is in Pington sin in Lonon, n urls up every Friy t miy.

More information

ΕΠΛ323 - Θεωρία και Πρακτική Μεταγλωττιστών

ΕΠΛ323 - Θεωρία και Πρακτική Μεταγλωττιστών ΕΠΛ323 - Θωρία και Πρακτική Μταγλωττιστών Lecture 3 Lexicl Anlysis Elis Athnsopoulos elisthn@cs.ucy.c.cy Recognition of Tokens if expressions nd reltionl opertors if è if then è then else è else relop

More information

WORKSHOP 8B TENSION COUPON

WORKSHOP 8B TENSION COUPON WORKSHOP 8B TENSION COUPON WS8B-2 Workshop Ojetives Prtie reting n eiting geometry Prtie mesh seeing n iso meshing tehniques. WS8B-3 Suggeste Exerise Steps 1. Crete new tse. 2. Crete geometry moel of the

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

Graph theory Route problems

Graph theory Route problems Bhelors thesis Grph theory Route prolems Author: Aolphe Nikwigize Dte: 986 - -5 Sujet: Mthemtis Level: First level (Bhelor) Course oe: MAE Astrt In this thesis we will review some route prolems whih re

More information

Kulleġġ San Ġorġ Preca Il-Liċeo tas-subien Ħamrun. Name & Surname: A) Mark the correct answer by inserting an X in the correct box. a b c d.

Kulleġġ San Ġorġ Preca Il-Liċeo tas-subien Ħamrun. Name & Surname: A) Mark the correct answer by inserting an X in the correct box. a b c d. Kulleġġ Sn Ġorġ Pre Il-Liċeo ts-suien Ħmrun Hlf Yerly Exmintion 2012 Trk 3 Form 3 INFORMATION TECHNOLOGY Time : 1hr 30 mins Nme & Surnme: Clss: A) Mrk the orret nswer y inserting n X in the orret ox. 1)

More information

Solids. Solids. Curriculum Ready.

Solids. Solids. Curriculum Ready. Curriulum Rey www.mthletis.om This ooklet is ll out ientifying, rwing n mesuring solis n prisms. SOM CUES The Som Cue ws invente y Dnish sientist who went y the nme of Piet Hein. It is simple 3 # 3 #

More information

Comparing Hierarchical Data in External Memory

Comparing Hierarchical Data in External Memory Compring Hierrhil Dt in Externl Memory Surshn S. Chwthe Deprtment of Computer Siene University of Mryln College Prk, MD 090 hw@s.um.eu Astrt We present n externl-memory lgorithm for omputing minimum-ost

More information

2 Computing all Intersections of a Set of Segments Line Segment Intersection

2 Computing all Intersections of a Set of Segments Line Segment Intersection 15-451/651: Design & Anlysis of Algorithms Novemer 14, 2016 Lecture #21 Sweep-Line nd Segment Intersection lst chnged: Novemer 8, 2017 1 Preliminries The sweep-line prdigm is very powerful lgorithmic design

More information

Declarative Routing: Extensible Routing with Declarative Queries

Declarative Routing: Extensible Routing with Declarative Queries elrtive Routing: Extensile Routing with elrtive Queries Boon Thu Loo 1 Joseph M. Hellerstein 1,2, Ion toi 1, Rghu Rmkrishnn3, 1 University of Cliforni t Berkeley, 2 Intel Reserh Berkeley, 3 University

More information

Section 2.3 Functions. Definition: Let A and B be sets. A function (mapping, map) f from A to B, denoted f :A B, is a subset of A B such that

Section 2.3 Functions. Definition: Let A and B be sets. A function (mapping, map) f from A to B, denoted f :A B, is a subset of A B such that Setion 2.3 Funtions Definition: Let n e sets. funtion (mpping, mp) f from to, enote f :, is suset of suh tht x[x y[y < x, y > f ]] n [< x, y 1 > f < x, y 2 > f ] y 1 = y 2 Note: f ssoites with eh x in

More information

SAS Event Stream Processing 5.1: Using SAS Event Stream Processing Studio

SAS Event Stream Processing 5.1: Using SAS Event Stream Processing Studio SAS Event Strem Proessing 5.1: Using SAS Event Strem Proessing Stuio Overview to SAS Event Strem Proessing Stuio Overview SAS Event Strem Proessing Stuio is we-se lient tht enles you to rete, eit, uplo,

More information

Unit 5 Vocabulary. A function is a special relationship where each input has a single output.

Unit 5 Vocabulary. A function is a special relationship where each input has a single output. MODULE 3 Terms Definition Picture/Exmple/Nottion 1 Function Nottion Function nottion is n efficient nd effective wy to write functions of ll types. This nottion llows you to identify the input vlue with

More information

COMP 423 lecture 11 Jan. 28, 2008

COMP 423 lecture 11 Jan. 28, 2008 COMP 423 lecture 11 Jn. 28, 2008 Up to now, we hve looked t how some symols in n lphet occur more frequently thn others nd how we cn sve its y using code such tht the codewords for more frequently occuring

More information

Pattern Matching. Pattern Matching. Pattern Matching. Review of Regular Expressions

Pattern Matching. Pattern Matching. Pattern Matching. Review of Regular Expressions Pttern Mthing Pttern Mthing Some of these leture slides hve een dpted from: lgorithms in C, Roert Sedgewik. Gol. Generlize string serhing to inompletely speified ptterns. pplitions. Test if string or its

More information

Internet Routing. IP Packet Format. IP Fragmentation & Reassembly. Principles of Internet Routing. Computer Networks 9/29/2014.

Internet Routing. IP Packet Format. IP Fragmentation & Reassembly. Principles of Internet Routing. Computer Networks 9/29/2014. omputer Networks 9/29/2014 IP Pket Formt Internet Routing Ki Shen IP protool version numer heder length (words) for qulity of servie mx numer remining hops (deremented t eh router) upper lyer protool to

More information

Calculus Differentiation

Calculus Differentiation //007 Clulus Differentition Jeffrey Seguritn person in rowot miles from the nerest point on strit shoreline wishes to reh house 6 miles frther down the shore. The person n row t rte of mi/hr nd wlk t rte

More information

If you are at the university, either physically or via the VPN, you can download the chapters of this book as PDFs.

If you are at the university, either physically or via the VPN, you can download the chapters of this book as PDFs. Lecture 5 Wlks, Trils, Pths nd Connectedness Reding: Some of the mteril in this lecture comes from Section 1.2 of Dieter Jungnickel (2008), Grphs, Networks nd Algorithms, 3rd edition, which is ville online

More information

Honors Thesis: Investigating the Algebraic Properties of Cayley Digraphs

Honors Thesis: Investigating the Algebraic Properties of Cayley Digraphs Honors Thesis: Investigting the Algebri Properties of Cyley Digrphs Alexis Byers, Wittenberg University Mthemtis Deprtment April 30, 2014 This pper utilizes Grph Theory to gin insight into the lgebri struture

More information

WORKSHOP 3 FRAME MODEL CREATION USING CURVES, AND ANALYSIS

WORKSHOP 3 FRAME MODEL CREATION USING CURVES, AND ANALYSIS WORKSHOP 3 FRAME MODEL CREATION USING CURVES, AND ANALYSIS WS3-1 WS3-2 Workshop Ojetives Moel simple frme struture using geometri urves n 1D Br elements. The frme moel is to e onstrine using pin restrints,

More information

XML and Databases. Outline. XPath. Outline - Lectures. XPath Data Model. Outline - Assignments. XPath. Sebastian Maneth NICTA and UNSW

XML and Databases. Outline. XPath. Outline - Lectures. XPath Data Model. Outline - Assignments. XPath. Sebastian Maneth NICTA and UNSW Outline XML n Dtses Leture 6 Noe Seleting Queries: XPth 1.0 1. XPth Dt Moel: 7 types of noes 2. Simple Exmples 3. Lotion Steps n Pths 4. Vlue Comprison, n Other Funtions Sestin Mneth NICTA n UNSW CSE@UNSW

More information

Fault tree conversion to binary decision diagrams

Fault tree conversion to binary decision diagrams Loughorough University Institutionl Repository Fult tree onversion to inry deision digrms This item ws sumitted to Loughorough University's Institutionl Repository y the/n uthor. Cittion: ANDREWS, J.D.

More information

Structure in solution spaces: Three lessons from Jean-Claude

Structure in solution spaces: Three lessons from Jean-Claude Struture in solution spes: Three lessons from Jen-Clue Dvi Eppstein Computer Siene Deprtment, Univ. of Cliforni, Irvine Conferene on Meningfulness n Lerning Spes: A Triute to the Work of Jen-Clue Flmgne

More information

LR Parsing, Part 2. Constructing Parse Tables. Need to Automatically Construct LR Parse Tables: Action and GOTO Table

LR Parsing, Part 2. Constructing Parse Tables. Need to Automatically Construct LR Parse Tables: Action and GOTO Table TDDD55 Compilers nd Interpreters TDDB44 Compiler Construction LR Prsing, Prt 2 Constructing Prse Tles Prse tle construction Grmmr conflict hndling Ctegories of LR Grmmrs nd Prsers Peter Fritzson, Christoph

More information

The Droplet Virtual Brush for Chinese Calligraphic Character Modeling

The Droplet Virtual Brush for Chinese Calligraphic Character Modeling The Droplet Virtul Brush for Chinese Clligrphi Chrter Moeling Xiofeng Mi Jie Xu Min Tng Jinxing Dong CAD & CG Stte Key L of Chin, Zhejing University, Hngzhou, Chin Artifiil Intelligene Institute, Zhejing

More information

WORKSHOP 8A TENSION COUPON

WORKSHOP 8A TENSION COUPON WORKSHOP 8A TENSION COUPON WS8A-2 Workshop Ojetives Buil the tension oupon geometry Control the mesh y using tehniques isusse in lss Compre FEA stress results to theoretil results From Stress Conentrtion

More information

A GENERIC PROCEDURE FOR INTERACTIVE 3D MODEL REGISTRATION ON IMAGES

A GENERIC PROCEDURE FOR INTERACTIVE 3D MODEL REGISTRATION ON IMAGES A GENERIC PROCEDURE FOR INTERACTIVE 3D MODEL REGISTRATION ON IMAGES Philippe EVEN LORIA / IUT e St-Dié, 11, Rue e l Université, F-88100 Sint Dié es Vosges, Frne, Philippe.Even@lori.fr KEY WORDS: Three-imensionl,

More information

CS453 INTRODUCTION TO DATAFLOW ANALYSIS

CS453 INTRODUCTION TO DATAFLOW ANALYSIS CS453 INTRODUCTION TO DATAFLOW ANALYSIS CS453 Leture Register llotion using liveness nlysis 1 Introdution to Dt-flow nlysis Lst Time Register llotion for expression trees nd lol nd prm vrs Tody Register

More information

Cooperative Routing in Multi-Source Multi-Destination Multi-hop Wireless Networks

Cooperative Routing in Multi-Source Multi-Destination Multi-hop Wireless Networks oopertive Routing in Multi-Soure Multi-estintion Multi-hop Wireless Networks Jin Zhng Qin Zhng eprtment of omputer Siene n ngineering Hong Kong University of Siene n Tehnology, HongKong {zjzj, qinzh}@se.ust.hk

More information

Final Exam Review F 06 M 236 Be sure to look over all of your tests, as well as over the activities you did in the activity book

Final Exam Review F 06 M 236 Be sure to look over all of your tests, as well as over the activities you did in the activity book inl xm Review 06 M 236 e sure to loo over ll of your tests, s well s over the tivities you did in the tivity oo 1 1. ind the mesures of the numered ngles nd justify your wor. Line j is prllel to line.

More information

1.1. Interval Notation and Set Notation Essential Question When is it convenient to use set-builder notation to represent a set of numbers?

1.1. Interval Notation and Set Notation Essential Question When is it convenient to use set-builder notation to represent a set of numbers? 1.1 TEXAS ESSENTIAL KNOWLEDGE AND SKILLS Prepring for 2A.6.K, 2A.7.I Intervl Nottion nd Set Nottion Essentil Question When is it convenient to use set-uilder nottion to represent set of numers? A collection

More information

Agilent G3314AA BioConfirm Software

Agilent G3314AA BioConfirm Software Agilent G3314AA BioConfirm Softwre Quik Strt Guide Use this guide to instll nd get strted with the BioConfirm softwre. Wht is BioConfirm Softwre? Agilent G3314AA BioConfirm Softwre lets you onfirm the

More information

Width and Bounding Box of Imprecise Points

Width and Bounding Box of Imprecise Points Width nd Bounding Box of Impreise Points Vhideh Keikh Mrten Löffler Ali Mohdes Zhed Rhmti Astrt In this pper we study the following prolem: we re given set L = {l 1,..., l n } of prllel line segments,

More information

1. Be able to do System Level Designs by: 2. Become proficient in a hardware-description language (HDL)

1. Be able to do System Level Designs by: 2. Become proficient in a hardware-description language (HDL) Ojetives CENG53 Digitl Sstem Design Digitl Mhine Design Overview 1. Be le to do Sstem Level Designs : Mstering design issues in ottom-up fshion nd Designing sstems for speifi pplitions in top-down methodolog

More information

Lexical Analysis: Constructing a Scanner from Regular Expressions

Lexical Analysis: Constructing a Scanner from Regular Expressions Lexicl Anlysis: Constructing Scnner from Regulr Expressions Gol Show how to construct FA to recognize ny RE This Lecture Convert RE to n nondeterministic finite utomton (NFA) Use Thompson s construction

More information

CS143 Handout 07 Summer 2011 June 24 th, 2011 Written Set 1: Lexical Analysis

CS143 Handout 07 Summer 2011 June 24 th, 2011 Written Set 1: Lexical Analysis CS143 Hndout 07 Summer 2011 June 24 th, 2011 Written Set 1: Lexicl Anlysis In this first written ssignment, you'll get the chnce to ply round with the vrious constructions tht come up when doing lexicl

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

Outline. Motivation Background ARCH. Experiment Additional usages for Input-Depth. Regular Expression Matching DPI over Compressed HTTP

Outline. Motivation Background ARCH. Experiment Additional usages for Input-Depth. Regular Expression Matching DPI over Compressed HTTP ARCH This work ws supported y: The Europen Reserh Counil, The Isreli Centers of Reserh Exellene, The Neptune Consortium, nd Ntionl Siene Foundtion wrd CNS-119748 Outline Motivtion Bkground Regulr Expression

More information

Extended Pasting Scheme for Kolam Pattern Generation

Extended Pasting Scheme for Kolam Pattern Generation Originl Pper Form, 22, 55 64, 2007 Extended Psting Sheme for Kolm Pttern Genertion Thmurj ROBINSON Deprtment of Mthemtis, Mdrs Christin College, Chenni 600 059, Indi E-mil ddress: roin.m@gmil.om (Reeived

More information

Chapter 4 Fuzzy Graph and Relation

Chapter 4 Fuzzy Graph and Relation Chpter 4 Fuzzy Grph nd Reltion Grph nd Fuzzy Grph! Grph n G = (V, E) n V : Set of verties(node or element) n E : Set of edges An edge is pir (x, y) of verties in V.! Fuzzy Grph ~ n ( ~ G = V, E) n V :

More information

4452 Mathematical Modeling Lecture 4: Lagrange Multipliers

4452 Mathematical Modeling Lecture 4: Lagrange Multipliers Mth Modeling Lecture 4: Lgrnge Multipliers Pge 4452 Mthemticl Modeling Lecture 4: Lgrnge Multipliers Lgrnge multipliers re high powered mthemticl technique to find the mximum nd minimum of multidimensionl

More information

Lecture 13: Graphs I: Breadth First Search

Lecture 13: Graphs I: Breadth First Search Leture 13 Grphs I: BFS 6.006 Fll 2011 Leture 13: Grphs I: Bredth First Serh Leture Overview Applitions of Grph Serh Grph Representtions Bredth-First Serh Rell: Grph G = (V, E) V = set of verties (ritrry

More information

FEEDBACK: The standard error of a regression is not an unbiased estimator for the standard deviation of the error in a multiple regression model.

FEEDBACK: The standard error of a regression is not an unbiased estimator for the standard deviation of the error in a multiple regression model. Introutory Eonometris: A Moern Approh 6th Eition Woolrige Test Bnk Solutions Complete ownlo: https://testbnkre.om/ownlo/introutory-eonometris-moern-pproh-6th-eition-jeffreym-woolrige-test-bnk/ Solutions

More information

Robust internal multiple prediction algorithm Zhiming James Wu, Sonika, Bill Dragoset*, WesternGeco

Robust internal multiple prediction algorithm Zhiming James Wu, Sonika, Bill Dragoset*, WesternGeco Roust internl multiple preition lgorithm Zhiming Jmes Wu, Sonik, Bill Drgoset*, WesternGeo Summry Multiple ttenution is n importnt t proessing step for oth mrine n ln t. Tehniques for surfe- rpily in the

More information

6.045J/18.400J: Automata, Computability and Complexity. Quiz 2: Solutions. Please write your name in the upper corner of each page.

6.045J/18.400J: Automata, Computability and Complexity. Quiz 2: Solutions. Please write your name in the upper corner of each page. 6045J/18400J: Automt, Computbility nd Complexity Mrh 30, 2005 Quiz 2: Solutions Prof Nny Lynh Vinod Vikuntnthn Plese write your nme in the upper orner of eh pge Problem Sore 1 2 3 4 5 6 Totl Q2-1 Problem

More information

Start Here. Quick Setup Guide HL-5470DW(T) HL-6180DW(T) WARNING CAUTION WARNING. Note

Start Here. Quick Setup Guide HL-5470DW(T) HL-6180DW(T) WARNING CAUTION WARNING. Note Quik Setup Guie Strt Here HL-5470DW(T) HL-6180DW(T) Plese re the Prout Sfety Guie first, then re this Quik Setup Guie for the orret setup n instlltion proeure. To view the Quik Setup Guie in other lnguges,

More information

What are suffix trees?

What are suffix trees? Suffix Trees 1 Wht re suffix trees? Allow lgorithm designers to store very lrge mount of informtion out strings while still keeping within liner spce Allow users to serch for new strings in the originl

More information

Introduction. Example

Introduction. Example OMS0 Introution isjoint sets n minimum spnning trees In this leture we will strt by isussing t struture use for mintining isjoint subsets of some bigger set. This hs number of pplitions, inluing to mintining

More information