Process Discovery. prof.dr.ir. Wil van der Aalst.
|
|
|
- Joshua Bradford
- 5 years ago
- Views:
Transcription
1 Pross Disovry prof.r.ir. Wil vn r Alst
2 Positioning Pross Mining prformn-orint qustions, prolms n solutions pross mol nlysis (simultion, vrifition, t.) pross mining t-orint nlysis (t mining, mhin lrning, usinss intllign) omplin-orint qustions, prolms n solutions 1
3 PAGE 2
4 PAGE 3
5 Ovrviw worl usinss prosss popl mhins omponnts orgniztions mols nlyzs supports/ ontrols spifis onfigurs implmnts nlyzs softwr systm rors vnts,.g., mssgs, trnstions, t. (pross) mol isovry onformn nhnmnt vnt logs PAGE 4
6 Hunrs of plug-ins vill ovring th whol pross mining sptrum opn-sour (L-GPL) Downlo from: PAGE 5
7 Commril Altrntivs Diso (Fluxion) Prptiv Pross Mining (for Futur Rflt n BPM on) ARIS Pross Prformn Mngr QPR ProssAnlyzr Intrstg Pross Disovry (Fujitsu) Disovry Anlyst (StroLOGIC) XMAnlyzr (XMPro) 6
8 Pross Disovry PAGE 7
9 Pross Disovry (smll sltion) utomt-s lrning huristi mining istriut gnti mining lngug-s rgions gnti mining stohsti tsk grphs stt-s rgions LTL mining nurl ntworks fuzzy mining mining lok struturs hin Mrkov mols α lgorithm α# lgorithm onforml pross grph multi-phs mining prtil-orr s mining α++ lgorithm ILP mining PAGE 8
10 Typil Rprsnttionl Bis (Ll) Ptri Nts, WFnts, t. Susts of BPMN igrms, UML Ativity Digrms, Evnt-Drivn Pross Chins (EPCs), YAWL, Stthrts? t. Trnsition Systms (Hin) Mrkov Mols PAGE 9 [strt] rgistr rqust strt strt strt rgistr rqust [1,2] rgistr rqust xmin thoroughly xmin sully hk tikt rgistr rqust XOR [2,3] [1,4] OR AND hk tikt 1 rinitit rqust xmin sully xmin thoroughly [5] i [3,4] xmin thoroughly xmin sully hk tikt py ompnstion xmin thoroughly rjt rqust xmin sully hk tikt xmin thoroughly xmin sully hk tikt [n] 3 4 rinitit rqust OR AND strt rgistr rqust i f i rinitit rqust 4 i XOR OR-split 5 6 xmin thoroughly xmin sully py ompnstion py ompnstion rjt rqust py ompnstion hk tikt OR-join rjt rqust i nw informtion 3 g h rjt rqust n py ompnstion rjt rqust n n n n
11 Altrntiv Rprsnttionl Bis 1. C-nts (XOR/AND/ORsplit/join grphs; mor likly to soun u to lrtiv smntis). 2. Dlr mols (onstrint s, groun in LTL; nything is possil unlss forin) 3. Pross Trs (similr to susts of vrious pross lgrs; soun y strutur) rgistr rqust toy's fous xmin thoroughly xmin sully hk tikt f rinitit rqust i rgistr rqust g py ompnstion h rjt rqust z n py ompnstion g h rjt rqust i PAGE 10
12 Ptri nt/rgion-s Viw PAGE 11
13 Ptri nt viw: Just isovr th pls Aing pl limits hvior: ovrfitting ing too mny pls unrfitting ing too fw pls p (A,B)... m n A={ 1, 2, m } B={ 1, 2, n } PAGE 12
14 Th Ptri nt low n rply ny tr ovr {,,,,} PAGE 13
15 Pl limits hvior PAGE 14
16 Exmpl: Pross Disovry Using Stt-Bs Rgions vnt log [ ] [] [,] [,] [,,] [,] [,,] [,,,] p1 p3 strt n p2 p4 PAGE 15
17 Exmpl of Stt-Bs Rgion [,] [,] [,,] [ ] [] [,] [,,] [,,,] ntr:, lv: o-not-ross:, p1 p3 strt n p2 p4 PAGE 16
18 Exmpl: Pross Disovry Using Lngug-Bs Rgions f 1 A pl is fsil if it n without isling ny of th trs in th vnt log p R 2 X Y PAGE 17
19 Exmpl of Lngug-Bs Rgions : : : : : X Y : : < 0 PAGE 18
20 Crting Trnsition Systm PAGE 19
21 Lrning Trnsition Systm urrnt stt tr: f g h h h i pst futur pst n futur pst, futur, pst+futur squn, multist, st strtion limit horizon to strt furthr filtring.g. s on trnstion typ, nms, t. lls s on tivity nm or othr fturs PAGE 20
22 Pst Without Astrtion (Full Squn) Somtims ll th "prfix utomton",,,,,,,,,,,,,,, PAGE 21
23 Futur Without Astrtion,,,,,,,,,,,,,,, PAGE 22
24 Pst with Multist Astrtion [,] [,] [,,] [ ] [] [,] [,,] [,,,] PAGE 23
25 Only Lst Evnt Mttrs For Stt PAGE 24
26 Using ProM PAGE 25
27 Inspt Evnt Log PAGE 26
28 Inspt Trs PAGE 27
29 Run Plugin PAGE 28
30 Slt (sroll or y nm) PAGE 29
31 Strt Plugin "Min Trnsition Systm" PAGE 30
32 Strt Winow pst futur ttriuts PAGE 31
33 Astrtion list, multist, or st ll, or only lst k vnts PAGE 32
34 Whih vnts to filtr? PAGE 33
35 Whih lls n to visil? PAGE 34
36 Any rpir tions? x rmov slf loops improv imon strutur mrg stts with intil inflow PAGE 35
37 Chk onfigurtion PAGE 36
38 Rsulting trnsition systm,,,,,,,,,,,,,,, PAGE 37
39 Convrt trnsition systm to Ptri nt PAGE 38
40 Rsulting Ptri nt B A p1 E p3 D strt n p2 C p4 PAGE 39
41 Summry vnt log [ ] [] [,] [,] [,,] [,] [,,] [,,,] p1 p3 strt n p2 p4 PAGE 40
42 Stt-Bs Rgions PAGE 41
43 Wht is (stt-s) rgion? f = ntr = ntr = xit = xit = o not ross f = o not ross f R f p R PAGE 42
44 Strting point: A Trnsition Systm s1 s2 W ssum tht thr is only on initil stt (othrwis prprossing n). s3 s6 s4 s7 s9 s5 s8 It is onvnint to lso hv just on finl stt tht n lwys rh (not stritly nssry) s10 All stts n to rhl! PAGE 43
45 Dfinition A rgion r is st of stts, suh tht for ll trnsitions (s 0,, s 0 ), (s 1,, s 1 ) in th trnsition systm hols tht: 1) s 0 r n s 0 r implis tht s 1 r n s 1 r 2) s 0 r n s 0 r implis tht s 1 r n s 1 r In wors: A rgion is st of stts, suh tht, if trnsition xits th rgion, thn ll qully ll trnsitions xit th rgion, n if trnsition ntrs th rgion, thn ll qully ll trnsitions ntr th rgion. All vnts not ntring or xiting th rgion o not ross th rgion. PAGE 44
46 Exmpl of rgion s1 ntrs xits s3 s2 s4 s5 os not ross os not ross os not ross s6 s7 s8 s9 s10 PAGE 45
47 Exmpl of rgion s1 os not ross ntrs s3 s2 s4 s5 os not ross os not ross xits s6 s7 s8 s9 s10 PAGE 46
48 Exmpl of rgion s1 xits os not ross s3 s2 s4 s5 os not ross os not ross os not ross s6 s7 s8 s9 s10 Pls orrsponing to rgions ontining th initil stt r initilly mrk. PAGE 47
49 Exmpl of rgion s1 ntrs os not ross s3 s2 s4 s5 os not ross xits os not ross s6 s7 s8 s9 s10 PAGE 48
50 Not rgion s1 ntrs s3 s6 s2 s4 s7 s9 s5 s8 os not ross n xits os not ross n xits os not ross n xits os not ross s10 PAGE 49
51 Not rgion s1 os not ross s3 s6 s2 s4 s7 s9 s5 s8 os not ross n xits os not ross n xits os not ross n xits os not ross s10 PAGE 50
52 Multipl rgions PAGE 51 s1 s10 s2 s4 s3 s5 s6 s9 s7 s8 s1 s10 s2 s4 s3 s5 s6 s9 s7 s8 s1 s10 s2 s4 s3 s5 s6 s9 s7 s8 s1 s10 s2 s4 s3 s5 s6 s9 s7 s8 s1 s10 s2 s4 s3 s5 s6 s9 s7 s8 Et.
53 Sltivly hosn rgions PAGE 52 s1 s10 s2 s4 s3 s5 s6 s9 s7 s8 p1 p2 p3 p4 p5 p6 p7 p8 s1 s10 s2 s4 s3 s5 s6 s9 s7 s8 s1 s10 s2 s4 s3 s5 s6 s9 s7 s8
54 Rgions Rgion Proprtis Lt S th st of ll stts of trnsition systm. Trivil Rgions: Both S n r ll th trivil rgions, Complmnts: If r is rgion, thn S\ r is rgion, Pr-/Post-rgions: If vnt xits (ntrs) rgion r, thn r is pr- (post-)rgion of, Miniml rgions: If r 0 n r 1 r rgions, n r 0 is sust of r 1, thn r 1 \ r 0 is rgion. Th lttr implis th xistn of (non-trivil) miniml rgions. PAGE 53
55 Trivil rgions PAGE 54 s1 s10 s2 s4 s3 s5 s6 s9 s7 s8 s1 s10 s2 s4 s3 s5 s6 s9 s7 s8,,,, o not ross
56 Complmnt: If r is rgion, thn S\ r is rgion s1 s1 s2 s2 s3 s4 s5 s3 s4 s5 s6 s7 s9 s10 s8 "xits" n "ntrs" r swpp s6 s7 s9 s10 s8 PAGE 55
57 If r 0 n r 1 r rgions, n r 0 is sust of r 1, thn r 1 \ r 0 is rgion. s1 s1 s1 s2 s2 s2 s3 s4 s5 s3 s4 s5 s3 s4 s5 s6 s7 s8 s6 s7 s8 s6 s7 s8 s9 s9 s9 s10 s10 s10 PAGE 56
58 Not miniml yt PAGE 57 s1 s10 s2 s4 s3 s5 s6 s9 s7 s8 s1 s10 s2 s4 s3 s5 s6 s9 s7 s8 s1 s10 s2 s4 s3 s5 s6 s9 s7 s8
59 Pr n post rgions - If vnt ntrs rgion r, thn r is post-rgion of. - r is post-rgion of - r is post-rgion of f g h h r - If vnt xits rgion r, thn r is pr-rgion of. - r is pr-rgion of - r is pr-rgion of pr() is th st of ll (miniml) pr-rgions or. pr() is th st of ll (miniml) pr-rgions or. Both r sts of sts!
60 Bsi lgorithm to onstrut Ptri nt For h vnt in th trnsition systm, trnsition is gnrt in th Ptri nt. Comput th miniml non-trivil rgions. For h miniml non-trivil in th trnsition systm, pl is gnrt in th Ptri nt. A orrsponing rs (post-rgions r output pls n pr-rgions r input pls). A tokn is to h pl tht orrspons to rgion ontining th initil stt. Th rsulting Ptri nt is ll th miniml sturt nt. PAGE 59
61 Lo Ptri nt with 10 prlll tivitis PAGE 60
62 Construt rhility grph PAGE 61
63 Rhility grph ( =1026 stts) PAGE 62
64 Apply stt-s rgions to fol stt sp PAGE 63
65 Disovr Ptri nt Ptri nt is risovr! O xmpl, normlly th trnsition systm is onstrut from n vnt log. PAGE 64
66
67 stts, trnsitions 26 trnsitions, 28 pls, 1 tokn
68 It is not tht simpl (ut ll prolms n rpir) PAGE 67
69 Consir n vnt log ontining just <,> trs prfix utomton s1 s2 s3 Only trivil rgions: n {s1,s2,s3} Ptri nt Also llows for: PAGE 68
70 Consir n vnt log ontining trs <,>, <,,>, <,,,>,<,,,,>, trnsition systm l to gnrt log s1 s2 s3 Rgions: {s1} ( xits, n o not ross) {s2} ( ntrs, os not ross, xits) {s3} ( n os not ross, ntrs) Ptri nt Also llows for: {s1} {s2} {s3} PAGE 69
71 Consir n vnt log ontining trs <,>, <> trnsition systm l to gnrt log s1 s1 s2 s3 s2 s3 s4 s4 Rgions: {s1,s2} ( os not ross, xits) {s3,s4} ( os not ross, ntrs) {s1,s3} ( xits n os not ross) {s2,s4} ( ntrs n os not ross) s2 s1 s4 s3 PAGE 70
72 Ptri nt s2 s1 s3 {s1,s3} {s1,s2} s4 s1 s2 s3 {s2,s4} {s3,s4} s4 Also llows for tr <,>! PAGE 71
73 All unrfitting, ut fsil s1 s2 s3 s1 s2 s3 {s1} {s2} {s3} s1 {s1,s3} {s1,s2} s2 s3 s4 {s2,s4} {s3,s4} PAGE 72
74 Using ProM (uss ll splitting to solv prolm) s1 s2 s3 two "" trnsitions PAGE 73
75 Using ProM (rsss slf-loop prolm) s1 s2 s3 PAGE 74
76 Using ProM (uss ll splitting to solv prolm) s1 s2 s3 s4 two "" trnsitions PAGE 75
77 At th othr n of th sptrum PAGE 76
78 A ompltly iffrnt xmpl of pross isovry thniqu: Gnti Mining rquirs lot of omputing powr, ut n istriut sily, n l with nois, infrqunt hvior, uplit tsks, invisil tsks, llows for inrmntl improvmnt n omintions with othr pprohs (huristis post-optimiztion, t.). PAGE 77
79 Gnti pross mining: Ovrviw rt initil popultion vnt log muttion trmintion omput fitnss tournmnt nxt gnrtion litism hilrn rossovr slt st iniviul prnts iniviuls PAGE 78
80 Exmpl: rossovr PAGE 79 strt rgistr rqust xmin thoroughly xmin sully hk tikt i py ompnstion rjt rqust rinitit rqust g h f n strt rgistr rqust xmin thoroughly xmin sully hk tikt i py ompnstion rjt rqust rinitit rqust g h f n strt rgistr rqust xmin thoroughly xmin sully hk tikt i rinitit rqust f strt rgistr rqust xmin thoroughly xmin sully hk tikt i py ompnstion rjt rqust rinitit rqust g h f n py ompnstion rjt rqust g h n
81 Exmpl: muttion rmov pl xmin thoroughly g xmin thoroughly g strt rgistr rqust xmin sully hk tikt i f rinitit rqust py ompnstion h rjt rqust n strt rgistr rqust r xmin sully hk tikt i f rinitit rqust py ompnstion h rjt rqust n PAGE 80
82 Link twn pross isovry n onformn hking rt initil popultion vnt log muttion trmintion omput fitnss tournmnt nxt gnrtion litism hilrn rossovr slt st iniviul prnts iniviuls PAGE 81
83 How goo is my mol? PAGE 82
84 Four Compting Qulity Critri l to rply vnt log fitnss Om s rzor simpliity pross isovry gnrliztion not ovrfitting th log prision not unrfitting th log PAGE 83
85 Exmpl: on log four mols strt rgistr rqust xmin thoroughly xmin sully hk tikt i f rinitit rqust g py ompnstion h rjt rqust N 1 : fitnss = +, prision = +, gnrliztion = +, simpliity = + n # tr 455 h 191 g 177 h 144 h l to rply vnt log fitnss pross isovry Om s rzor simpliity strt strt rgistr rqust rgistr rqust xmin sully xmin sully xmin thoroughly i hk tikt f hk tikt i rinitit rqust py ompnstion rjt rqust rjt rqust N 2 : fitnss = -, prision = +, gnrliztion = -, simpliity = + N 3 : fitnss = +, prision = -, gnrliztion = +, simpliity = + g h h n n 111 g 82 g 56 h 47 fh 38 g 33 fh 14 fg 11 fg 9 fh 8 fh gnrliztion not ovrfitting th log prision not unrfitting th log strt rgistr rqust rgistr rqust rgistr rqust rgistr rqust hk tikt xmin sully hk tikt xmin sully (ll xmin sully hk tikt xmin sully hk tikt i i i i 21 vrints sn in th log) g py ompnstion g py ompnstion h rjt rqust h rjt rqust n 5 fg 3 ffg 2 fg 2 ffg 1 ffh 1 ffg 1 fffg 1391 rgistr rqust xmin thoroughly hk tikt i g py ompnstion rgistr rqust hk tikt xmin thoroughly i h rjt rqust rgistr rqust xmin thoroughly hk tikt i rjt rqust N 4 : fitnss = +, prision = +, gnrliztion = -, simpliity = - h PAGE 84
86 strt Mol N 1 rgistr rqust xmin thoroughly xmin sully hk tikt i rinitit rqust py ompnstion rjt rqust N 1 : fitnss = +, prision = +, gnrliztion = +, simpliity = + f g h n # tr 455 h 191 g 177 h 144 h 111 g 82 g 56 h 47 fh 38 g 33 fh 14 fg 11 fg 9 fh 8 fh 5 fg 3 ffg 2 fg 2 ffg 1 ffh 1 ffg 1 fffg 1391 PAGE 85
87 strt Mol N 2 rgistr rqust xmin sully hk tikt i rjt rqust N 2 : fitnss = -, prision = +, gnrliztion = -, simpliity = + h n # tr 455 h 191 g 177 h 144 h 111 g 82 g 56 h 47 fh 38 g 33 fh 14 fg 11 fg 9 fh 8 fh 5 fg 3 ffg 2 fg 2 ffg 1 ffh 1 ffg 1 fffg 1391 PAGE 86
88 strt Mol N 3 rgistr rqust xmin sully xmin thoroughly i hk tikt rinitit rqust py ompnstion rjt rqust N 3 : fitnss = +, prision = -, gnrliztion = +, simpliity = + f g h n # tr 455 h 191 g 177 h 144 h 111 g 82 g 56 h 47 fh 38 g 33 fh 14 fg 11 fg 9 fh 8 fh 5 fg 3 ffg 2 fg 2 ffg 1 ffh 1 ffg 1 fffg 1391 PAGE 87
89 Mol N 4 strt rgistr rqust rgistr rqust rgistr rqust rgistr rqust hk tikt xmin sully hk tikt xmin sully (ll xmin sully hk tikt xmin sully hk tikt rgistr rqust rgistr rqust rgistr rqust xmin thoroughly hk tikt xmin thoroughly hk tikt i i i i rjt rqust h rjt rqust N 4 : fitnss = +, prision = +, gnrliztion = -, simpliity = - 21 vrints sn in th log) hk tikt xmin thoroughly i i i g py ompnstion g py ompnstion h g py ompnstion h rjt rqust h rjt rqust n # tr 455 h 191 g 177 h 144 h 111 g 82 g 56 h 47 fh 38 g 33 fh 14 fg 11 fg 9 fh 8 fh 5 fg 3 ffg 2 fg 2 ffg 1 ffh 1 ffg 1 fffg 1391 PAGE 88
90 Conlusion Still mny hllnging n highly rlvnt opn prolms in pross isovry! prformn-orint qustions, prolms n solutions pross mol nlysis (simultion, vrifition, t.) pross mining t-orint nlysis (t mining, mhin lrning, usinss intllign) omplin-orint qustions, prolms n solutions PAGE 89
On the Role of Fitness, Precision, Generalization and Simplicity in Process Discovery
On th Rol of Fitnss, Prcision, Gnrliztion n Simplicity in Procss Discovry Joos Buijs Bouwijn vn Dongn Wil vn r Alst http://www.win.tu.nl/coslog/ Avncs in Procss ining ny procss iscovry n conformnc chcking
Chapter 7 Conformance Checking
Cptr 7 Conormn Ckin pro.r.ir. Wil vn r Alst www.prossminin.or Ovrviw Cptr 1 Introution Prt I: Prliminris Cptr 2 Pross Molin n Anlysis Cptr 3 Dt Minin Prt II: From Evnt Los to Pross Mols Cptr 4 Gttin t
A Simple Code Generator. Code generation Algorithm. Register and Address Descriptors. Example 3/31/2008. Code Generation
A Simpl Co Gnrtor Co Gnrtion Chptr 8 II Gnrt o for singl si lok How to us rgistrs? In most mhin rhitturs, som or ll of th oprnsmust in rgistrs Rgistrs mk goo tmporris Hol vlus tht r omput in on si lok
Math 61 : Discrete Structures Final Exam Instructor: Ciprian Manolescu. You have 180 minutes.
Nm: UCA ID Numr: Stion lttr: th 61 : Disrt Struturs Finl Exm Instrutor: Ciprin nolsu You hv 180 minuts. No ooks, nots or lultors r llow. Do not us your own srth ppr. 1. (2 points h) Tru/Fls: Cirl th right
CSC Design and Analysis of Algorithms. Example: Change-Making Problem
CSC 801- Dsign n Anlysis of Algorithms Ltur 11 Gry Thniqu Exmpl: Chng-Mking Prolm Givn unlimit mounts of oins of nomintions 1 > > m, giv hng for mount n with th lst numr of oins Exmpl: 1 = 25, 2 =10, =
Paths. Connectivity. Euler and Hamilton Paths. Planar graphs.
Pths.. Eulr n Hmilton Pths.. Pth D. A pth rom s to t is squn o gs {x 0, x 1 }, {x 1, x 2 },... {x n 1, x n }, whr x 0 = s, n x n = t. D. Th lngth o pth is th numr o gs in it. {, } {, } {, } {, } {, } {,
COMP108 Algorithmic Foundations
Grdy mthods Prudn Wong http://www.s.liv..uk/~pwong/thing/omp108/01617 Coin Chng Prolm Suppos w hv 3 typs of oins 10p 0p 50p Minimum numr of oins to mk 0.8, 1.0, 1.? Grdy mthod Lrning outoms Undrstnd wht
Module graph.py. 1 Introduction. 2 Graph basics. 3 Module graph.py. 3.1 Objects. CS 231 Naomi Nishimura
Moul grph.py CS 231 Nomi Nishimur 1 Introution Just lik th Python list n th Python itionry provi wys of storing, ssing, n moifying t, grph n viw s wy of storing, ssing, n moifying t. Bus Python os not
Constructive Geometric Constraint Solving
Construtiv Gomtri Constrint Solving Antoni Soto i Rir Dprtmnt Llngutgs i Sistms Inormàtis Univrsitt Politèni Ctluny Brlon, Sptmr 2002 CGCS p.1/37 Prliminris CGCS p.2/37 Gomtri onstrint prolm C 2 D L BC
Alpha Algorithm: A Process Discovery Algorithm
Proess Mining: Dt Siene in Ation Alph Algorithm: A Proess Disovery Algorithm prof.dr.ir. Wil vn der Alst www.proessmining.org Proess disovery = Ply-In Ply-In event log proess model Ply-Out Reply proess
Why the Junction Tree Algorithm? The Junction Tree Algorithm. Clique Potential Representation. Overview. Chris Williams 1.
Why th Juntion Tr lgorithm? Th Juntion Tr lgorithm hris Willims 1 Shool of Informtis, Univrsity of Einurgh Otor 2009 Th JT is gnrl-purpos lgorithm for omputing (onitionl) mrginls on grphs. It os this y
CS61B Lecture #33. Administrivia: Autograder will run this evening. Today s Readings: Graph Structures: DSIJ, Chapter 12
Aministrivi: CS61B Ltur #33 Autogrr will run this vning. Toy s Rings: Grph Struturs: DSIJ, Chptr 12 Lst moifi: W Nov 8 00:39:28 2017 CS61B: Ltur #33 1 Why Grphs? For xprssing non-hirrhilly rlt itms Exmpls:
An undirected graph G = (V, E) V a set of vertices E a set of unordered edges (v,w) where v, w in V
Unirt Grphs An unirt grph G = (V, E) V st o vrtis E st o unorr gs (v,w) whr v, w in V USE: to mol symmtri rltionships twn ntitis vrtis v n w r jnt i thr is n g (v,w) [or (w,v)] th g (v,w) is inint upon
V={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)}
Introution Computr Sin & Enginring 423/823 Dsign n Anlysis of Algorithms Ltur 03 Elmntry Grph Algorithms (Chptr 22) Stphn Sott (Apt from Vinohnrn N. Vriym) I Grphs r strt t typs tht r pplil to numrous
V={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)}
s s of s Computr Sin & Enginring 423/823 Dsign n Anlysis of Ltur 03 (Chptr 22) Stphn Sott (Apt from Vinohnrn N. Vriym) s of s s r strt t typs tht r pplil to numrous prolms Cn ptur ntitis, rltionships twn
CSE303 - Introduction to the Theory of Computing Sample Solutions for Exercises on Finite Automata
CSE303 - Introduction to th Thory of Computing Smpl Solutions for Exrciss on Finit Automt Exrcis 2.1.1 A dtrministic finit utomton M ccpts th mpty string (i.., L(M)) if nd only if its initil stt is finl
Present state Next state Q + M N
Qustion 1. An M-N lip-lop works s ollows: I MN=00, th nxt stt o th lip lop is 0. I MN=01, th nxt stt o th lip-lop is th sm s th prsnt stt I MN=10, th nxt stt o th lip-lop is th omplmnt o th prsnt stt I
FSA. CmSc 365 Theory of Computation. Finite State Automata and Regular Expressions (Chapter 2, Section 2.3) ALPHABET operations: U, concatenation, *
CmSc 365 Thory of Computtion Finit Stt Automt nd Rgulr Exprssions (Chptr 2, Sction 2.3) ALPHABET oprtions: U, conctntion, * otin otin Strings Form Rgulr xprssions dscri Closd undr U, conctntion nd * (if
Algorithmic and NP-Completeness Aspects of a Total Lict Domination Number of a Graph
Intrntionl J.Mth. Comin. Vol.1(2014), 80-86 Algorithmi n NP-Compltnss Aspts of Totl Lit Domintion Numr of Grph Girish.V.R. (PES Institut of Thnology(South Cmpus), Bnglor, Krntk Stt, Ini) P.Ush (Dprtmnt
12/3/12. Outline. Part 10. Graphs. Circuits. Euler paths/circuits. Euler s bridge problem (Bridges of Konigsberg Problem)
12/3/12 Outlin Prt 10. Grphs CS 200 Algorithms n Dt Struturs Introution Trminology Implmnting Grphs Grph Trvrsls Topologil Sorting Shortst Pths Spnning Trs Minimum Spnning Trs Ciruits 1 Ciruits Cyl 2 Eulr
5/9/13. Part 10. Graphs. Outline. Circuits. Introduction Terminology Implementing Graphs
Prt 10. Grphs CS 200 Algorithms n Dt Struturs 1 Introution Trminology Implmnting Grphs Outlin Grph Trvrsls Topologil Sorting Shortst Pths Spnning Trs Minimum Spnning Trs Ciruits 2 Ciruits Cyl A spil yl
CSE 373: More on graphs; DFS and BFS. Michael Lee Wednesday, Feb 14, 2018
CSE 373: Mor on grphs; DFS n BFS Mihl L Wnsy, F 14, 2018 1 Wrmup Wrmup: Disuss with your nighor: Rmin your nighor: wht is simpl grph? Suppos w hv simpl, irt grph with x nos. Wht is th mximum numr of gs
, each of which is a tree, and whose roots r 1. , respectively, are children of r. Data Structures & File Management
nrl tr T is init st o on or mor nos suh tht thr is on sint no r, ll th root o T, n th rminin nos r prtition into n isjoint susts T, T,, T n, h o whih is tr, n whos roots r, r,, r n, rsptivly, r hilrn o
Graphs. CSC 1300 Discrete Structures Villanova University. Villanova CSC Dr Papalaskari
Grphs CSC 1300 Disrt Struturs Villnov Univrsity Grphs Grphs r isrt struturs onsis?ng of vr?s n gs tht onnt ths vr?s. Grphs n us to mol: omputr systms/ntworks mthm?l rl?ons logi iruit lyout jos/prosss f
12. Traffic engineering
lt2.ppt S-38. Introution to Tltrffi Thory Spring 200 2 Topology Pths A tlommunition ntwork onsists of nos n links Lt N not th st of nos in with n Lt J not th st of nos in with j N = {,,,,} J = {,2,3,,2}
CSE 373. Graphs 1: Concepts, Depth/Breadth-First Search reading: Weiss Ch. 9. slides created by Marty Stepp
CSE 373 Grphs 1: Conpts, Dpth/Brth-First Srh ring: Wiss Ch. 9 slis rt y Mrty Stpp http://www.s.wshington.u/373/ Univrsity o Wshington, ll rights rsrv. 1 Wht is grph? 56 Tokyo Sttl Soul 128 16 30 181 140
(2) If we multiplied a row of B by λ, then the value is also multiplied by λ(here lambda could be 0). namely
. DETERMINANT.. Dtrminnt. Introution:I you think row vtor o mtrix s oorint o vtors in sp, thn th gomtri mning o th rnk o th mtrix is th imnsion o th prlllppi spnn y thm. But w r not only r out th imnsion,
Problem solving by search
Prolm solving y srh Tomáš voo Dprtmnt o Cyrntis, Vision or Roots n Autonomous ystms Mrh 5, 208 / 3 Outlin rh prolm. tt sp grphs. rh trs. trtgis, whih tr rnhs to hoos? trtgy/algorithm proprtis? Progrmming
Using the Printable Sticker Function. Using the Edit Screen. Computer. Tablet. ScanNCutCanvas
SnNCutCnvs Using th Printl Stikr Funtion On-o--kin stikrs n sily rt y using your inkjt printr n th Dirt Cut untion o th SnNCut mhin. For inormtion on si oprtions o th SnNCutCnvs, rr to th Hlp. To viw th
Cycles and Simple Cycles. Paths and Simple Paths. Trees. Problem: There is No Completely Standard Terminology!
Outlin Computr Sin 331, Spnnin, n Surphs Mik Joson Dprtmnt o Computr Sin Univrsity o Clry Ltur #30 1 Introution 2 3 Dinition 4 Spnnin 5 6 Mik Joson (Univrsity o Clry) Computr Sin 331 Ltur #30 1 / 20 Mik
Alpha Algorithm: Limitations
Proess Mining: Dt Siene in Ation Alph Algorithm: Limittions prof.dr.ir. Wil vn der Alst www.proessmining.org Let L e n event log over T. α(l) is defined s follows. 1. T L = { t T σ L t σ}, 2. T I = { t
CS September 2018
Loil los Distriut Systms 06. Loil los Assin squn numrs to msss All ooprtin prosss n r on orr o vnts vs. physil los: rport tim o y Assum no ntrl tim sour Eh systm mintins its own lol lo No totl orrin o
b. How many ternary words of length 23 with eight 0 s, nine 1 s and six 2 s?
MATH 3012 Finl Exm, My 4, 2006, WTT Stunt Nm n ID Numr 1. All our prts o this prolm r onrn with trnry strings o lngth n, i.., wors o lngth n with lttrs rom th lpht {0, 1, 2}.. How mny trnry wors o lngth
Graphs. Graphs. Graphs: Basic Terminology. Directed Graphs. Dr Papalaskari 1
CSC 00 Disrt Struturs : Introuon to Grph Thory Grphs Grphs CSC 00 Disrt Struturs Villnov Univrsity Grphs r isrt struturs onsisng o vrs n gs tht onnt ths vrs. Grphs n us to mol: omputr systms/ntworks mthml
Multipoint Alternate Marking method for passive and hybrid performance monitoring
Multipoint Altrnt Mrkin mtho or pssiv n hyri prormn monitorin rt-iool-ippm-multipoint-lt-mrk-00 Pru, Jul 2017, IETF 99 Giuspp Fiool (Tlom Itli) Muro Coilio (Tlom Itli) Amo Spio (Politnio i Torino) Riro
Exam 1 Solution. CS 542 Advanced Data Structures and Algorithms 2/14/2013
CS Avn Dt Struturs n Algorithms Exm Solution Jon Turnr //. ( points) Suppos you r givn grph G=(V,E) with g wights w() n minimum spnning tr T o G. Now, suppos nw g {u,v} is to G. Dsri (in wors) mtho or
Last time: introduced our first computational model the DFA.
Lctur 7 Homwork #7: 2.2.1, 2.2.2, 2.2.3 (hnd in c nd d), Misc: Givn: M, NFA Prov: (q,xy) * (p,y) iff (q,x) * (p,) (follow proof don in clss tody) Lst tim: introducd our first computtionl modl th DFA. Tody
DUET WITH DIAMONDS COLOR SHIFTING BRACELET By Leslie Rogalski
Dut with Dimons Brlt DUET WITH DIAMONDS COLOR SHIFTING BRACELET By Lsli Roglski Photo y Anrw Wirth Supruo DUETS TM from BSmith rt olor shifting fft tht mks your work tk on lif of its own s you mov! This
CSE 373: AVL trees. Warmup: Warmup. Interlude: Exploring the balance invariant. AVL Trees: Invariants. AVL tree invariants review
rmup CSE 7: AVL trs rmup: ht is n invrint? Mihl L Friy, Jn 9, 0 ht r th AVL tr invrints, xtly? Disuss with your nighor. AVL Trs: Invrints Intrlu: Exploring th ln invrint Cor i: xtr invrint to BSTs tht
COMPLEXITY OF COUNTING PLANAR TILINGS BY TWO BARS
OMPLXITY O OUNTING PLNR TILINGS Y TWO RS KYL MYR strt. W show tht th prolm o trmining th numr o wys o tiling plnr igur with horizontl n vrtil r is #P-omplt. W uil o o th rsults o uquir, Nivt, Rmil, n Roson
Register Allocation. How to assign variables to finitely many registers? What to do when it can t be done? How to do so efficiently?
Rgistr Allotion Rgistr Allotion How to ssign vrils to initly mny rgistrs? Wht to o whn it n t on? How to o so iintly? Mony, Jun 3, 13 Mmory Wll Disprity twn CPU sp n mmory ss sp improvmnt Mony, Jun 3,
CS 461, Lecture 17. Today s Outline. Example Run
Prim s Algorithm CS 461, Ltur 17 Jr Si Univrsity o Nw Mxio In Prim s lgorithm, th st A mintin y th lgorithm orms singl tr. Th tr strts rom n ritrry root vrtx n grows until it spns ll th vrtis in V At h
Outline. 1 Introduction. 2 Min-Cost Spanning Trees. 4 Example
Outlin Computr Sin 33 Computtion o Minimum-Cost Spnnin Trs Prim's Alorithm Introution Mik Joson Dprtmnt o Computr Sin Univrsity o Clry Ltur #33 3 Alorithm Gnrl Constrution Mik Joson (Univrsity o Clry)
Numbering Boundary Nodes
Numring Bounry Nos Lh MBri Empori Stt Univrsity August 10, 2001 1 Introution Th purpos of this ppr is to xplor how numring ltril rsistor ntworks ffts thir rspons mtrix, Λ. Morovr, wht n lrn from Λ out
Graph Isomorphism. Graphs - II. Cayley s Formula. Planar Graphs. Outline. Is K 5 planar? The number of labeled trees on n nodes is n n-2
Grt Thortil Is In Computr Sin Vitor Amhik CS 15-251 Ltur 9 Grphs - II Crngi Mllon Univrsity Grph Isomorphism finition. Two simpl grphs G n H r isomorphi G H if thr is vrtx ijtion V H ->V G tht prsrvs jny
Outline. Circuits. Euler paths/circuits 4/25/12. Part 10. Graphs. Euler s bridge problem (Bridges of Konigsberg Problem)
4/25/12 Outlin Prt 10. Grphs CS 200 Algorithms n Dt Struturs Introution Trminology Implmnting Grphs Grph Trvrsls Topologil Sorting Shortst Pths Spnning Trs Minimum Spnning Trs Ciruits 1 2 Eulr s rig prolm
Register Allocation. Register Allocation. Principle Phases. Principle Phases. Example: Build. Spills 11/14/2012
Rgistr Allotion W now r l to o rgistr llotion on our intrfrn grph. W wnt to l with two typs of onstrints: 1. Two vlus r liv t ovrlpping points (intrfrn grph) 2. A vlu must or must not in prtiulr rhitturl
# 1 ' 10 ' 100. Decimal point = 4 hundred. = 6 tens (or sixty) = 5 ones (or five) = 2 tenths. = 7 hundredths.
How os it work? Pl vlu o imls rprsnt prts o whol numr or ojt # 0 000 Tns o thousns # 000 # 00 Thousns Hunrs Tns Ons # 0 Diml point st iml pl: ' 0 # 0 on tnth n iml pl: ' 0 # 00 on hunrth r iml pl: ' 0
XML and Databases. Outline. Recall: Top-Down Evaluation of Simple Paths. Recall: Top-Down Evaluation of Simple Paths. Sebastian Maneth NICTA and UNSW
Smll Pth Quiz ML n Dtss Cn you giv n xprssion tht rturns th lst / irst ourrn o h istint pri lmnt? Ltur 8 Strming Evlution: how muh mmory o you n? Sstin Mnth NICTA n UNSW
Designing A Concrete Arch Bridge
This is th mous Shwnh ri in Switzrln, sin y Rort Millrt in 1933. It spns 37.4 mtrs (122 t) n ws sin usin th sm rphil mths tht will monstrt in this lsson. To pro with this lsson, lik on th Nxt utton hr
Expert System. Knowledge-Based Systems. Page 1. Development of KB Systems. Knowledge base. Expert system = Structured computer program
Knowlg-Bs Systms Exprt Systm Anrw Kusik 2139 Smns Cntr Iow City, Iow 52242-1527 nrw-kusik@uiow.u http://www.in.uiow.u/~nkusik Tl: 319-335 5934 Fx: 319-335 5669 Knowlg s Infrn Engin Dt Exprt systm = Strutur
QUESTIONS BEGIN HERE!
Points miss: Stunt's Nm: Totl sor: /100 points Est Tnnss Stt Univrsity Dprtmnt of Computr n Informtion Sins CSCI 710 (Trnoff) Disrt Struturs TEST for Fll Smstr, 00 R this for strtin! This tst is los ook
Solutions for HW11. Exercise 34. (a) Use the recurrence relation t(g) = t(g e) + t(g/e) to count the number of spanning trees of v 1
Solutions for HW Exris. () Us th rurrn rltion t(g) = t(g ) + t(g/) to ount th numr of spnning trs of v v v u u u Rmmr to kp multipl gs!! First rrw G so tht non of th gs ross: v u v Rursing on = (v, u ):
Section 10.4 Connectivity (up to paths and isomorphism, not including)
Toy w will isuss two stions: Stion 10.3 Rprsnting Grphs n Grph Isomorphism Stion 10.4 Conntivity (up to pths n isomorphism, not inluing) 1 10.3 Rprsnting Grphs n Grph Isomorphism Whn w r working on n lgorithm
Outline. Computer Science 331. Computation of Min-Cost Spanning Trees. Costs of Spanning Trees in Weighted Graphs
Outlin Computr Sin 33 Computtion o Minimum-Cost Spnnin Trs Prim s Mik Joson Dprtmnt o Computr Sin Univrsity o Clry Ltur #34 Introution Min-Cost Spnnin Trs 3 Gnrl Constrution 4 5 Trmintion n Eiiny 6 Aitionl
Compression. Compression. Compression. This part of the course... Ifi, UiO Norsk Regnesentral Vårsemester 2005 Wolfgang Leister
Kurs INF5080 Ifi, UiO Norsk Rgnsntrl Vårsmstr 2005 Wolfgng Listr This prt of th ours...... is hl t Ifi, UiO... (Wolfgng Listr) n t ontins mtril from Univrsity Collg Krlsruh (Ptr Ol, Clmns Knorzr) Informtion
Seven-Segment Display Driver
7-Smnt Disply Drivr, Ron s in 7-Smnt Disply Drivr, Ron s in Prolm 62. 00 0 0 00 0000 000 00 000 0 000 00 0 00 00 0 0 0 000 00 0 00 BCD Diits in inry Dsin Drivr Loi 4 inputs, 7 outputs 7 mps, h with 6 on
Weighted graphs -- reminder. Data Structures LECTURE 15. Shortest paths algorithms. Example: weighted graph. Two basic properties of shortest paths
Dt Strutur LECTURE Shortt pth lgorithm Proprti of hortt pth Bllmn-For lgorithm Dijktr lgorithm Chptr in th txtook (pp ). Wight grph -- rminr A wight grph i grph in whih g hv wight (ot) w(v i, v j ) >.
0.1. Exercise 1: the distances between four points in a graph
Mth 707 Spring 2017 (Drij Grinrg): mitrm 3 pg 1 Mth 707 Spring 2017 (Drij Grinrg): mitrm 3 u: W, 3 My 2017, in lss or y mil (grinr@umn.u) or lss S th wsit or rlvnt mtril. Rsults provn in th nots, or in
Motivation. Problems. Puzzle 1
Introution to Roust Algorithms Séstin Tixuil UPMC & IUF Motition Approh Fults n ttks our in th ntwork Th ntwork s usr must not noti somthing wrong hppn A smll numr of fulty omponnts Msking pproh to fult/ttk
Garnir Polynomial and their Properties
Univrsity of Cliforni, Dvis Dprtmnt of Mthmtis Grnir Polynomil n thir Proprtis Author: Yu Wng Suprvisor: Prof. Gorsky Eugny My 8, 07 Grnir Polynomil n thir Proprtis Yu Wng mil: uywng@uvis.u. In this ppr,
CS 241 Analysis of Algorithms
CS 241 Anlysis o Algorithms Prossor Eri Aron Ltur T Th 9:00m Ltur Mting Lotion: OLB 205 Businss HW6 u lry HW7 out tr Thnksgiving Ring: Ch. 22.1-22.3 1 Grphs (S S. B.4) Grphs ommonly rprsnt onntions mong
Announcements. Not graphs. These are Graphs. Applications of Graphs. Graph Definitions. Graphs & Graph Algorithms. A6 released today: Risk
Grphs & Grph Algorithms Ltur CS Spring 6 Announmnts A6 rls toy: Risk Strt signing with your prtnr sp Prlim usy Not grphs hs r Grphs K 5 K, =...not th kin w mn, nywy Applitions o Grphs Communition ntworks
Formal Concept Analysis
Forml Conpt Anlysis Conpt intnts s losd sts Closur Systms nd Implitions 4 Closur Systms 0.06.005 Nxt-Closur ws dvlopd y B. Gntr (984). Lt M = {,..., n}. A M is ltilly smllr thn B M, if B A if th smllst
Aquauno Video 6 Plus Page 1
Connt th timr to th tp. Aquuno Vio 6 Plus Pg 1 Usr mnul 3 lik! For Aquuno Vio 6 (p/n): 8456 For Aquuno Vio 6 Plus (p/n): 8413 Opn th timr unit y prssing th two uttons on th sis, n fit 9V lklin ttry. Whn
5/1/2018. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees
/1/018 W usully no strns y ssnn -lnt os to ll rtrs n t lpt (or mpl, 8-t on n ASCII). Howvr, rnt rtrs our wt rnt rquns, w n sv mmory n ru trnsmttl tm y usn vrl-lnt non. T s to ssn sortr os to rtrs tt our
Quartets and unrooted level-k networks
Phylogntis Workshop, Is Nwton Institut or Mthmtil Sins Cmrig 21/06/2011 Qurtts n unroot lvl-k ntworks Philipp Gmtt Outlin Astrt n xpliit phylognti ntworks Lvl-k ntworks Unroot lvl-1 ntworks n irulr split
Process Windows. Fig. 1: Motivational example.
1 Pross Winows Anry Mokhov, Jori Cortll, Alssnro Gnnro Nwstl Univrsity, Unit Kingom Univrsitt Politèni Ctluny, Brlon, Spin Astrt W sri mtho for formlly rprsnting th hviour of omplx prosss y pross winows.
Basis of test: VDE 0660, part 500/IEC Rated peak withstand current I pk. Ip peak short-circuit current [ka] Busbar support spacing [mm]
![Basis of test: VDE 0660, part 500/IEC Rated peak withstand current I pk. Ip peak short-circuit current [ka] Busbar support spacing [mm]](/thumbs/74/70457982.jpg "Basis of test: VDE 0660, part 500/IEC Rated peak withstand current I pk. Ip peak short-circuit current [ka] Busbar support spacing [mm]")
Powr istriution Short-iruit withstn strngth to EC Short-iruit withstn strngth to EC 439-1 Typ tsting to EC 439-1 During th ours of systm typ-tsting, th following tsts wr onut on th Rittl usr systms n on
The Plan. Honey, I Shrunk the Data. Why Compress. Data Compression Concepts. Braille Example. Braille. x y xˆ
h ln ony, hrunk th t ihr nr omputr in n nginring nivrsity of shington t omprssion onpts ossy t omprssion osslss t omprssion rfix os uffmn os th y 24 2 t omprssion onpts originl omprss o x y xˆ nor or omprss
Similarity Search. The Binary Branch Distance. Nikolaus Augsten.
Similrity Srh Th Binry Brnh Distn Nikolus Augstn nikolus.ugstn@sg..t Dpt. of Computr Sins Univrsity of Slzurg http://rsrh.uni-slzurg.t Vrsion Jnury 11, 2017 Wintrsmstr 2016/2017 Augstn (Univ. Slzurg) Similrity
(a) v 1. v a. v i. v s. (b)
Outlin RETIMING Struturl optimiztion mthods. Gionni D Mihli Stnford Unirsity Rtiming. { Modling. { Rtiming for minimum dly. { Rtiming for minimum r. Synhronous Logi Ntwork Synhronous Logi Ntwork Synhronous
Lecture 20: Minimum Spanning Trees (CLRS 23)
Ltur 0: Mnmum Spnnn Trs (CLRS 3) Jun, 00 Grps Lst tm w n (wt) rps (unrt/rt) n ntrou s rp voulry (vrtx,, r, pt, onnt omponnts,... ) W lso suss jny lst n jny mtrx rprsntton W wll us jny lst rprsntton unlss
A 4-state solution to the Firing Squad Synchronization Problem based on hybrid rule 60 and 102 cellular automata
A 4-stt solution to th Firing Squ Synhroniztion Prolm s on hyri rul 60 n 102 llulr utomt LI Ning 1, LIANG Shi-li 1*, CUI Shung 1, XU Mi-ling 1, ZHANG Ling 2 (1. Dprtmnt o Physis, Northst Norml Univrsity,
Computational Biology, Phylogenetic Trees. Consensus methods
Computtionl Biology, Phylognti Trs Consnsus mthos Asgr Bruun & Bo Simonsn Th 16th of Jnury 2008 Dprtmnt of Computr Sin Th univrsity of Copnhgn 0 Motivtion Givn olltion of Trs Τ = { T 0,..., T n } W wnt
S i m p l i f y i n g A l g e b r a SIMPLIFYING ALGEBRA.
S i m p l i y i n g A l g r SIMPLIFYING ALGEBRA www.mthltis.o.nz Simpliying SIMPLIFYING Algr ALGEBRA Algr is mthmtis with mor thn just numrs. Numrs hv ix vlu, ut lgr introus vrils whos vlus n hng. Ths
In order to learn which questions have been answered correctly: 1. Print these pages. 2. Answer the questions.
Crystl Rports for Visul Stuio.NET In orr to lrn whih qustions hv n nswr orrtly: 1. Print ths pgs. 2. Answr th qustions. 3. Sn this ssssmnt with th nswrs vi:. FAX to (212) 967-3498. Or. Mil th nswrs to
CS200: Graphs. Graphs. Directed Graphs. Graphs/Networks Around Us. What can this represent? Sometimes we want to represent directionality:
CS2: Grphs Prihr Ch. 4 Rosn Ch. Grphs A olltion of nos n gs Wht n this rprsnt? n A omputr ntwork n Astrtion of mp n Soil ntwork CS2 - Hsh Tls 2 Dirt Grphs Grphs/Ntworks Aroun Us A olltion of nos n irt
CS553 Lecture Register Allocation I 3
Low-Lvl Issus Last ltur Intrproural analysis Toay Start low-lvl issus Rgistr alloation Latr Mor rgistr alloation Instrution shuling CS553 Ltur Rgistr Alloation I 2 Rgistr Alloation Prolm Assign an unoun
EE1000 Project 4 Digital Volt Meter
Ovrviw EE1000 Projt 4 Diitl Volt Mtr In this projt, w mk vi tht n msur volts in th rn o 0 to 4 Volts with on iit o ury. Th input is n nlo volt n th output is sinl 7-smnt iit tht tlls us wht tht input s
Nefertiti. Echoes of. Regal components evoke visions of the past MULTIPLE STITCHES. designed by Helena Tang-Lim
MULTIPLE STITCHES Nrtiti Ehos o Rgl omponnts vok visions o th pst sign y Hln Tng-Lim Us vrity o stiths to rt this rgl yt wrl sign. Prt sping llows squr s to mk roun omponnts tht rp utiully. FCT-SC-030617-07
QUESTIONS BEGIN HERE!
Points miss: Stunt's Nm: Totl sor: /100 points Est Tnnss Stt Univrsity Dprtmnt o Computr n Inormtion Sins CSCI 2710 (Trno) Disrt Struturs TEST or Sprin Smstr, 2005 R this or strtin! This tst is los ook
CS553 Lecture Register Allocation 1
Low-Lvl Issus Lst ltur Livnss nlysis Rgistr llotion Toy Mor rgistr llotion Wnsy Common suxprssion limintion or PA2 Logistis PA1 is u PA2 hs n post Mony th 15 th, no lss u to LCPC in Orgon CS553 Ltur Rgistr
16.unified Introduction to Computers and Programming. SOLUTIONS to Examination 4/30/04 9:05am - 10:00am
16.unii Introution to Computrs n Prormmin SOLUTIONS to Exmintion /30/0 9:05m - 10:00m Pro. I. Kristin Lunqvist Sprin 00 Grin Stion: Qustion 1 (5) Qustion (15) Qustion 3 (10) Qustion (35) Qustion 5 (10)
Convert the NFA into DFA
Convert the NF into F For ech NF we cn find F ccepting the sme lnguge. The numer of sttes of the F could e exponentil in the numer of sttes of the NF, ut in prctice this worst cse occurs rrely. lgorithm:
Section 3: Antiderivatives of Formulas
Chptr Th Intgrl Appli Clculus 96 Sction : Antirivtivs of Formuls Now w cn put th is of rs n ntirivtivs togthr to gt wy of vluting finit intgrls tht is ct n oftn sy. To vlut finit intgrl f(t) t, w cn fin
Prefix-Free Regular-Expression Matching
Prefix-Free Regulr-Expression Mthing Yo-Su Hn, Yjun Wng nd Derik Wood Deprtment of Computer Siene HKUST Prefix-Free Regulr-Expression Mthing p.1/15 Pttern Mthing Given pttern P nd text T, find ll sustrings
From Automata Networks to HMSCs: A Reverse Model Engineering Perspective
From Automt Ntworks to HMSCs: A Rvrs Modl Enginring Prsptiv Thoms Chtin,Loï Hélouët, nd Clud Jrd 3 IRISA/ENS Chn-Brtgn, Cmpus d Buliu, F-354 Rnns d, Frn Thoms.Chtin@iris.fr IRISA/INRIA, Cmpus d Buliu,
Graph Contraction and Connectivity
Chptr 17 Grph Contrtion n Conntivity So r w hv mostly ovr thniqus or solving prolms on grphs tht wr vlop in th ontxt o squntil lgorithms. Som o thm r sy to prllliz whil othrs r not. For xmpl, w sw tht
Analysis for Balloon Modeling Structure based on Graph Theory
Anlysis for lloon Moling Strutur bs on Grph Thory Abstrt Mshiro Ur* Msshi Ym** Mmoru no** Shiny Miyzki** Tkmi Ysu* *Grut Shool of Informtion Sin, Ngoy Univrsity **Shool of Informtion Sin n Thnology, hukyo
Improving Union. Implementation. Union-by-size Code. Union-by-Size Find Analysis. Path Compression! Improving Find find(e)
POW CSE 36: Dt Struturs Top #10 T Dynm (Equvln) Duo: Unon-y-Sz & Pt Comprsson Wk!! Luk MDowll Summr Qurtr 003 M! ZING Wt s Goo Mz? Mz Construton lortm Gvn: ollton o rooms V Conntons twn t rooms (ntlly
Nondeterministic Automata vs Deterministic Automata
Nondeterministi Automt vs Deterministi Automt We lerned tht NFA is onvenient model for showing the reltionships mong regulr grmmrs, FA, nd regulr expressions, nd designing them. However, we know tht n
The University of Sydney MATH2969/2069. Graph Theory Tutorial 5 (Week 12) Solutions 2008
Th Univrsity o Syny MATH2969/2069 Grph Thory Tutoril 5 (Wk 12) Solutions 2008 1. (i) Lt G th isonnt plnr grph shown. Drw its ul G, n th ul o th ul (G ). (ii) Show tht i G is isonnt plnr grph, thn G is
Recursive neural networks for object detection
Rursiv nurl ntworks for ojt ttion M. inhini, M. Mggini, L. Srti,. Srslli iprtimnto i Inggnri ll Informzion Univrsità gli Stui i Sin Vi Rom, 56 53100 Sin (Itly) -mil: {moni,mggini,srti,frno}@ii.unisi.it
Finite Automata. d: Q S Q. Finite automaton is M=(Q, S, d, q 0, F) Ex: an FA that accepts all odd-length strings of zeros: q 0 q 1. q i. q k.
Finit Automt Bsic id: FA is mchin tht chngs stts whil procssing symols, on t tim. Finit st of stts: Q = {q 0, q 1, q 3,..., q k } Trnsition function: Initil stt: Finl stts: d: Q S Q q 0 Q F Q Finit utomton
Decimals DECIMALS.
Dimls DECIMALS www.mthltis.o.uk ow os it work? Solutions Dimls P qustions Pl vlu o imls 0 000 00 000 0 000 00 0 000 00 0 000 00 0 000 tnths or 0 thousnths or 000 hunrths or 00 hunrths or 00 0 tn thousnths
Unfoldings of Networks of Timed Automata
Unfolings of Networks of Time Automt Frnk Cssez Thoms Chtin Clue Jr Ptrii Bouyer Serge H Pierre-Alin Reynier Rennes, Deemer 3, 2008 Unfolings [MMilln 93] First efine for Petri nets Then extene to other
Polygons POLYGONS.
Polgons PLYGNS www.mthltis.o.uk ow os it work? Solutions Polgons Pg qustions Polgons Polgon Not polgon Polgon Not polgon Polgon Not polgon Polgon Not polgon f g h Polgon Not polgon Polgon Not polgon Polgon
Full Review Condominium
Full Rviw Conominium I. Bsi Projt Inormtion 1 Projt Lgl Nm 2 Projt Physil Arss 3 HOA Mngmnt Arss 4 HOA Nm (i irnt rom Projt Lgl Nm) 5 HOA Tx ID # 6 HOA Mngmnt Compny Tx ID # 7 Nm o Mstr or Umrll Assoition
Announcements. Programming Project 4 due Saturday, August 18 at 11:30AM
Rgistr Allotion Announmnts Progrmming Projt 4 u Stury, August 18 t 11:30AM OH ll this wk. Ask qustions vi mil! Ask qustions vi Pizz! No lt sumissions. Pls vlut this ours on Axss. Your k rlly mks irn. Whr