Graph-Based Workflow Recommendation: On Improving Business Process Modeling
|
|
- Philip Curtis
- 5 years ago
- Views:
Transcription
1 Grph-Bs Workflow ommntion: On Improving Businss Pross Moling Bin Co Collg of Computr Sin Zhjing Univrsity Hngzhou Chin 37 Dongjing Wng Collg of Computr Sin Zhjing Univrsity Hngzhou Chin 37 Jinwi Yin Collg of Computr Sin Zhjing Univrsity Hngzhou Chin 37 Zhohui Wu Collg of Computr Sin Zhjing Univrsity Hngzhou Chin 37 Shuigung Dng Collg of Computr Sin Zhjing Univrsity Hngzhou Chin 37 ABSTACT How to improv th moling ffiiny n ury hs om urning prolm. Th populriztion of rommntion thniqu in E-Commr provi us nw trjtoris tht n us for rssing th prolm. In this ppr, w propos grph-s workflow rommntion for improving usinss pross moling. Th strt point is so-ll workflow rpository inluing st of lry vlop pross mols. Grph mining mtho is us to xtrt th pross pttrns from th rpository. Bs on grph it istn (GED) [], w lult th istn twn pttrns n th prtil usinss pross, viw s rfrn mol, whih is unr moling n slt th nit nos with smllr istns for rommntion. Th prformn stuy show its fsiility for prtil uss. Ctgoris n Sujt Dsriptors H.4. [Informtion Systms Applitions]: Offi Automtion Workflow mngmnt Kywors Grph-Bs, Workflow ommntion, Businss Pross Moling, Grph Eit Distn. INTODUCTION With th mturity of workflow thnology, ntrpriss prfr to sri thir usinss oprtions in trms of usinss prosss. Dsriing usinss pross is pi of sign n moling work whih is th tivity of (r-)vluting n orgnizing tsks tht usinss pross is ompos of. Howvr, pross moling woul iffiult or vn Prmission to mk igitl or hr opis of ll or prt of this work for prsonl or lssroom us is grnt without f provi tht opis r not m or istriut for profit or ommril vntg n tht opis r this noti n th full ittion on th first pg. To opy othrwis, to rpulish, to post on srvrs or to ristriut to lists, rquirs prior spifi prmission n/or f. CIKM, Otor 9 Novmr,, Mui, HI, USA. Copyright ACM //...$5.. impossil whn omin knowlg is missing or prosss r to sri y mturs in th fil. Furthrmor, morn ommr lso rings forwr highr rquirmnt on th ffiiny n ury of usinss pross moling. Effiiny. Th usinss pross usully follows mrkt mns whih might hng frquntly. It is hr for molrs to figur out th hng mns within limit tim, whih woul l to rs ffiiny for moling. Aury. Th usinss oprtions r oming mor n mor omplit. Dsigning suh prosss rlis hvily on tit omin knowlg n prsonl xprins whih th molrs might not hv. An th prosss mol y thm r proly not suitl. Nowys, muh work is fousing on improving th usinss pross moling. Bs on vnt logs, workflow mining [] n isovr th tul usinss prosss whih r not proly s priv y th mngmnt n it n hlp molrs improv pross moling with isovr pross mols. Pross rtrivl [3, 4] n lso hlp molrs improv th moling y rtriving th similr frgmnts from th workflow rpository. Howvr, on th sis of ths two thniqus, th onstrution of nw usinss pross is still rfrr to th pr-isovr tmplt mols whih n muh mnul work to nlyz. In [6], th uthors propos workflow rommntion thniqu ll Flowommnr whih lvrgs provnn of workflows to provi rommntion for th st no tht ns to hosn to omplt th workflow. Howvr, Flowommnr osn t support pttrns whih onsists of omplx strutur (.g. AND-join, O-join, t.) n it will fil in f of nit no with multipl influning upstrm su-pths. Bsis, th tul usinss prosss r fr yon th stright lin struturs n Flowommnr n t wily us in rl pplition. Sin th workflow rpository usully ontins lrg mount of usinss prosss n ths prosss r typilly mol in form of irt grphs, strting from th grph strutur of th usinss pross n orrowing th is from tritionl rommntion systms, w pln to pro ssoition rul mining twn usinss tivity nos n pross frgmnts (i.., sugrphs) within workflow rpository, n provi rlt ision support for moling prosss. 57
2 W ll it grph-s workflow rommntion. A usinss pross frgmnt whih is unr moling is viw s rfrrn mol, n th pttrns r ll th influning upstrm sugrphs of th tivity nos tht trmin th ourrn of ths nos in th workflows. Th ssoition rul mining minly rfr to pttrn xtrtion whih is th fountion of workflow rommntion. Bs on msuring similrity n lulting istn twn rfrn mol n pross pttrns, this thniqu oul rommn pproprit nos for molrs to utomt th onstrution of usinss prosss. As rsult, it n not only Sp up th usinss pross moling y ruing th lirtion tim whih is n whn omin knowlg is inqut, ut lso provi guin for hoosing th most likly tsks y minimizing th rrors tht r possily m in usinss pross moling. In this ppr, w us grph mining thniqu to xtrt th pttrns from th workflow rpository. An s on th grph it istn (GED), w propos 3-imnsitonl istn lultion mtri for srhing th most rlvnt pttrns s th rommntion fountion. Thn w slt th orrsponing nos of thos pttrns n trmin whthr ths nos oul rommn to th molrs.. DISTANCE CALCULATION Firstly, w fin wht usinss pross grph is. Thr r mny moling mthos for usinss prosss. Diffrnt moling mtho hs iffrnt rprsnttion of workflow struturs, whih uss th onfusion of unrstning th ovrll strutur of usinss pross. Thus, w fin usinss pross grph in n strt viw. Dfinition. (Businss Pross Grph). Lt T st of no typs n L finit lpht of lls for nos. A usinss pross is onnt grph not y tupl P =(N,α, β) whr: (i)n is th finit st of nos; (ii) α : N T is th no typing funtion; (iii) β : N L is th no lling funtion. Lt E = N N st of irt gs n x N,y N. A no x is n input no of nothr no y iff thr is irt g from x to y (i.., (x, y) E). No x is n output no of y iff (y,x) E. Strt nos r nos without ny input n n nos r thos without ny output. In orr to pprntly sri th omplx struturs of pross mol, funtion α is us to istinguish twn no typs. Tk Ptri-nt for xmpl, pl ( p ) n trnsition ( t ) r two iffrnt no typs. As shown in Fig., th uppr mols r stnr workflow pttrns (i.., AND-split, AND-join, O-split, O-join) rprsnt y Ptri-nt n th lowr row shows orrsponing usinss pross grphs. Eh no is nnott with pir initingthnotypnthnoll. Dfinition. (Cnit No St, Upstrm Sugrph). Lt P =(N,α,β) np =(N,α,β )two usinss pross grphs. N <P,n> rprsnts th n nos of pross P, whih r ll nit nos. P is n upstrm sugrph for nit no st N <P,n> if (i) N <P > = N N <P,n> ; (ii) P is usinss pross sugrph of P. From Dfinition it follows tht, h usinss pross grph or sugrph oul ivi into two prts whih (t, ) (p, ) (p, ) (p, ) (p, ) (t, ) AND-split AND-join O-split O-join (p, ) (t, ) (t, ) (t, ) (t, ) (p, ) Figur : Ptri-nt mol n its pross grphs r nit no st n its orrsponing upstrm sugrph. Convrsly, h pir of thm orrspons to usinss pross grph or sugrph. In workflow rpositoris, thr r mny pirs n it oftn hppns tht on upstrm sugrph or nit no st my ppr in mor thn on pirs. Thus, w vlut th orrltion of nit no st n its upstrm sugrphs through th msur of onfin whih fin s follows. Dfinition 3. (Confin). Lt nit no st n u n upstrm sugrph. frq(, u) rprsnts th frquny tht n u our togthr. frq() rprsnts th frquny tht ours lon. Th onfin of givn u is: Conf(, u) = frq(,u) frq() Th nit no st n upstrm sugrph within pross grph or sugrph whih is of low frquny might proly orrlt strongly. If support msur of tritionl ssoit ruls is us, suh orrltions will limint n rommntions s on ths usinss prosss r impossil. Thrfor, w only lvrg th onfin in our work n support is not suppos to us. Bs on th Dfinition 3, w prsnt following finition. Dfinition 4. (Influning Upstrm Sugrph). Lt θ Conf onfin thrshol. For givn nit no st n its orrsponing upstrm sugrph u, u is influning iff: Conf(, u) θ Conf. In workflow rpositoris, influning upstrm sugrph trmins th ourrn of nit no st n w ll thm pttrns. Nxt, w prsnt our finition of pttrn tl whih is th input for istn lultion n no rommntion. Dfinition 5. (Pttrn Tl). Th pttrn tl is tupl T =(I,C,f)whr: (i)i is th finit st of influning upstrm sugrphs; (ii) C is th finit st of nit no sts; (iii) f : I C is surjtiv mpping. Th nit no sts in pttrn tl ontins th no(s) whih is(r) to rommn. In orr to pik th orrt nit no st, mthing th rfrn mol, whih is unr onstrution, with th influning upstrm sugrphs is rquir. Thus, GED (grph it istn []) oul us for this purpos. Th si i of GED is to sum th ost of lmntry rror-orrting oprtions: no sustitution, no insrtion/ltion, g insrtion/ltion. An th miniml ost tkn ovr ll oprtions is th it istn twn two grphs. Th smllr th it istn, th mor similr th two grphs. Howvr, GED oul not th only mtri for usinss pross grphs omprison unr th irumstn of workflow rommntion. Suppos tht thr is pross unr onstrution:? whr? rprsnts th 58
3 i iv 4 3 ii iii (4,3) Figur : An illustrtion for kwr lotion unknown no tht is to rommn. Two pttrns (, ) in pttrn tl r mth n thir orrsponing nit no st is {} n {f}. Th GED vlus for givn pross frgmnt ginst ov two pttrns r proly sm. Tht is to sy, th proility for rommning no n f is qul. In ft, no f shoul rommn inst of no. Bus th pttrn is losr to th pl whr th no rommntion ours. Thus, pprntly, whr th pttrn lot in givn pross ontriuts to rommntion ury. Dfinition 6. (Bkwr Lotion of A No). Lt P =(N,α,β) rfrn mol n ( N = ) st of rommntion nos for P. In P, i(x) no(x) rsptivly rprsnt th input nos st n output nos st of x (x (N )). N rprsnts th numr of th st N. x, y, z (N ), th kwr lotion of no x is: Lo n(x) = x Lo n(y)+ x i(y), o(i(y)) = mx(lo n(z)+) z o(i(x)), o(i(x)) > W illustrt Dfinition 6 in Fig.. Th pross in frm i is rfrn mol unr onstrution n rprsnts th st of rommntion nos. Two irt pths in frm ii r sugrphs of th pross in frm i. For h pth, th kwr lotion of h no is mrk ov. As for th lft sugrph in frm iii, no is th input of n (i.., i() n i()) n nos n r th output of (i..,, o()). Not tht, sin thr r two prlll pths for th pross in frm i, no hs two lotion vlus whih r 4 n 3. In this s, w hoos th mximum vlu. Thn w gt th finl kwr lotions of nos shown in frm iv. Dfinition 7. (Pttrn Lotion, Common Nos Numr). LtP =(N,α,β) pttrn from th pttrn tl T n P =(N,α,β ) rfrn mol unr onstrution. N rprsnts th numr of th st N. IfN N n x (N N ),α(x) =α (x),β(x) =β (x): Th lotion of P in P is: Lo p(p, P )=min(lo n(x)), x (N N ). Th numr of th ommon nos of P n P is: 3 Co n(p, P )= N N. As Dfinition 7 shows, pttrn lotion is ssign y th minimum kwr lotion of ll nos, whih oth xist in pttrn n th rfrn mol. Suppos tht thr is rfrn mol ( ) n two pttrns {( ),( )}. Gnrlly, ( ) is mor influning thn ( ) whn onsiring rommntion. An pttrn lotions for thm r n, whih mns th smllr lotion is th mor liklihoo to rommn. Somtims, th pttrn ing ompr hs th sm GED n pttrn lotion. In this s, w introu th thir msur of ommon nos numr to inrs th rommntion ury. Th mor ommon nos twn pttrn n usinss pross thr r, th mor similr thy r. Dfinition 8. (Distn Btwn Prosss). LtP = (N,α, β) rfrn mol, n P =(N,α,β ) pttrn from pttrn tl T. GED(P,P ) rprsnts th grph it istn twn P n P. mx n(p, P )rprsnts th mximum nos numr of P n P. φ, ϕ n ψ r wights for GED, pttrn lotion n ommon nos numr rsptivly. If x (N N ),α(x) =α (x),β(x) = β (x), th istn twn P n P is: Dist(P, P )=φ GED(P, P )+ϕ Lo p(p, P )+ ψ (mx n(p, P ) Co n(p, P )) As fin in Dfinition 8, w wights for ll msurs. Th omplx struturs n lrg volum of workflow rpository us th istn lultion vry omplit prolm in rl pplitions. As for rtin usinss pross, iffrnt msurs hv iffrnt ontriution to rommntion ury. Bsis, pross molrs my hv iffrnt is to iffrnt msurs. In our work, w lult th istn s on Dfinition 8. Apprntly, th smllr istn of pttrn mns th highr rommntion possiility for orrsponing nit no st. 3. ECOMMENDATION SCENAIOS Sin th rfrn mol my ontin mor thn on n no, thr r iffrnt rommntion rquirmnts. In this stion, w prsnt two rommntion snrios support in our work. Singl no s snrio is tht th rommntion rsult (i.., nit no st) is follow y on singl n no. It is triggr y rwing on g from on n no. Not tht, th nit no st whih woul rommn hr my ontin mor thn on no, th output of th n no, from whih nit no st is follow, is possily rnh strutur. Multipl nos s snrio is tht th rommntion rsult is follow y mor thn on no. It is triggr y rwing mor thn on g from svrl n nos. In this snrio, th molrs wnts to mrg th n nos of th rfrn mol to rommn no forming strutur lik AND-join, th no numr of nit no st hr shoul lwys on n w ovrlook thos sts whih ontin mor thn on no. For ths two snrios, mthing ll pths or sugrphs ginst pttrns in pttrn tl osts too muh n th istn lultion tim is intolrl. In ft, h xution pth hs its own usinss logi n th ownstrm no shoul in onformity with th logi of upstrm pth. Thrfor, w onsir th irt upstrm pth of th pl whr rommntion ours s th most importnt ftor. Ignoring othr pths(sugrphs), w only mth th upstrm xution pth or sugrph ginst th pttrns. As shown in Fig. 3, th no mrk rprsnts th pl whr rommntion ours n th right frms inluing singl no s n multipl nos s snrios prsnt thir orrsponing sugrphs for mthing. Apprntly, som xution pths r ignor. 59
4 f g j h i Singl no s Multipl nos s f g j Figur 3: A smpl of iffrnt snrios 4. POTOTYPE IMPLEMENTATION Th frmwork of grph-s workflow rommntion is shown in Fig. 4. In gnrl, thr r thr mouls in this frmwork n thy r frm y th ott lin in Fig. 4. Th first two mouls (i.., prprossing, pttrn isovry) r prform offlin whil th lst moul (i.., workflow rommntion) is onut onlin. Prprossing. In orr to filitt th pttrn xtrtion, rmoling usinss prosss mol y iffrnt nottions to uniform mols, whih r support y th high-lvl mouls in th frmwork, is nssry. Bs on th rmoling rsult, w us th ffiint grph mining lgorithm (.g. gspn [5]) to onut sugrph mining. Through this wy, w nlyz n min frgmnts of ll th usinss pross grph mols in workflow rpository. Not tht, th frquny hr is st to whih mns ll th sugrphs of ll th pross mols r foun. Th rson is tht no mttr how low-frquny th sugrph is, th nos in it might orrlt so strongly tht w n t ignor. Th output of this moul is st of sugrphs n thir own frqunis. Pttrn isovry. In this moul, firstly, h min sugrph is ompos to two prts whih r nit no st n upstrm sugrph (i.., Dfinition ). Th nit no st is us to xtn or omplt th rfrn mol unr onstrution whn rommntion ours, n th upstrm sugrph hr is us s th provnn for pttrn xtrtion. Thn, s on Dfinition 3 n Dfinition 4, w onut pttrn xtrtion slting th influning upstrm sugrphs. At lst, th slt pttrns n thir orrsponing nit no sts r rgistr into th pttrn tl (Dfinition 5), mking ry for susqunt workflow rommntion moul. Workflow rommntion. This moul gnrts th most likly tsks for pross molrs to xtn or omplt th usinss pross unr onstrution. Sin it is prform onlin, ompring with ov two mouls, its ury n ffiiny is mor onrn in prti. Th tils of th whol prour is shown in Algorithm. Thr r minly two omputtion stps in this moul. Th first stp hppns whn on of th rommntion snrios in- h i Algorithm Th lgorithm for workflow rommntion Input: A st of n nos E of th rfrn mol; th pttrn tl T ; wights for istn: φ, ϕ, ψ Output: Svrl nit no sts for rommntion : initiliz tl CNS =(C, D) whrd rprsnts istn vlus for C : P E gt th upstrm xution pth of E 3: for h ror (p, ) T o 4: if th th input t typ of nit no st mths th output t typ of E thn 5: S n(p, P E) gt th sm no numr 6: if S n(p, P E)! = thn 7: Lo p(p, P E) gt th pttrn lotion 8: GED(p, P E) gt th grph it istn 9: Dist(p, P E) φ GED(p, P E)+ϕ Lo p(p, P E)+ ψ (mx n(p, P E) S n(p, P E)) # Dfinition 8 : if CNS is not mpty n is sm with ((p, ) T,Dist(p,P E) D) thn : Conf(, P E) Conf(p, )+Conf(p, ) : if Dist(p, P E) Dist(p,P E) thn 3: Dist(p,P E) Dist(p, P E) 4: n if 5: ls 6: CNS (,Dist(p, P E)) 7: n if 8: n if 9: n if : n for : sort th lmnts in CNS y th vlu of istn : rturn first svrl nit no sts of CNS. trou in Stion 3 is triggr y th signr. Th xution pth within th rfrn mol is foun n us to mth ginst th pttrns isovr in th lst moul (lin ). Th son stp is just lulting th istn (Dfinition 8) twn pttrns n th xution pth (lin 5-9). Sin th omputtion omplxity of GED is high, it tks th most of tim for istn lultion. Bsis, w opt itionl msurs to inrs th ffiiny n ury, for xmpl, filtring th pttrns through I/O onstrints for istn lultion (lin 4) n summing th onfin vlus for sm nit no sts (lin - 7). Th nit no st is rommn to molrs on th istn twn its orrsponing pttrn (i.., influning upstrm sugrph) n th xution pth is suffiintly smll (lin -). As shown in Fig. 4, on th whol moling work is finish, th nwly omplt usinss pross n rhiv to th workflow rpository n srv s th provnn for futur rommntion. Sugrph Mining Pross -moling Workflow pository Prprossing Sugrph Domposition frn Mol Arhiving Dsignr Pttrn Extrtion Pttrn Disovry ommntion Triggring Cnit no st Workflow ommntion Pttrn Tl Exution Pth Distn Clultion Figur 4: Th frmwork of grph-s workflow rommntion 5. EXPEIMENTAL EVALUATION Bs on synthti tst, w fous on stuying th ffiiny n fftivnss of our grph-s workflow rommntion. In orr to mk omprison, w lso implmnt our vrsion of Flowommnr whih hivs similr prformn s tht rport in [6]. Aoring to [6], Flowommnr is ttr thn othr thniqus oth in fftivnss n ffiiny. Howvr, sin Flowommnr osn t support omplx workflow struturs ontining rnhs whih support y ours, th omprtiv 53
5 stuy hs n only onut on simpl tst whih is similr to th tst us in [6]. By simulting th rl usinss prosss, th omplx tst ontins vritis of struturs (i.., AND-join, O-join, AND-split, t.). Th systms r oth vlop in Jv (Jk.6) n ll xprimnts r on on.53ghz Intl Cor Duo E7 PC with 3.4GB min mmory, running Winows XP. In ition, th onfin for pttrn isovry of th whol prour is fix to.5. Efftivnss Stuy. Th fftivnss is msur y th ury for th tivitis or tsks for whih rommntion must givn. W st th wight vlus to: for GED, 6 for pttrn lotion, for ommon nos numr. Bs on this wights omintion, w stuy th fftivnss y iviing oth simpl n omplx tsts to iffrnt tst sts, of whih th sizs rng from to. In Fig. 5(), w rnomly hoos tst st n it is foun tht oth mthos prsnts th trns tht th ury inrss s th numr of top rommntions inrs. Howvr, from Fig. 5() w n s tht th Grph-s mtho hivs ttr ury thn tht of Flowommnr whn th top rommntion numr rh to 3. This is us thr is no strutur similrity msur involv in Flowommnr. Sin th usinss pross in omplx tst ontins iffrnt omplx struturs, Flowommnr fils on it. As shown in Fig. 5(), our mtho not only works wll on iffrnt tst sts ut lso prsnts sty ury of 8% rroun whn it msur y top rommntions. Effiiny Stuy. Th ffiiny is vlut y th vrg rommntion tim for tst nos. Gnrlly, th ffiiny is trmin y th numr of pttrns. To stuy th ffiiny, w lso ivi th simpl n omplx tsts into 5 tst sts with rng of -. Th isovr pttrn numrs r shown in Tl. Not tht, vn in sm tst st, th pttrn numrs of Flowommnr (not y F in th tl) n grph-s r iffrnt sin thir wy for isovring r iffrnt. Th tst rsults r shown in Fig. 6. From Fig. 6() w n s, Flowommnr spnt lss tim thn ours whih oul minly xplin y th rson tht th istn mtri of grph-s is mor omplit n involv mor msurs thn tht of Flowommnr. As for th tsts on omplx tst shown in Fig. 6(), th vrg rommntion tim for h no inrss s th numr of usinss prosss inrs. This is us th numr of pttrns grows with th inrs of usinss pross numr. Nvrthlss, th tim is ontroll within ms vn whn th pttrn numr xs 4. Th ov Aury Flowommnr Grph s Top ommntions (N) () simpl tst Aury S S S3 S4 S5 Tst Sts (ID) () omplx tst Figur 5: Th fftivnss stuy Top Top Tl : Th numr of pttrns for mthing Numr of BPs F Simpl Grph Complx Avrg tim (ms) Flowommnr Grph s Numr of usinss prosss () simpl tst Avrg Tim (ms) Grph s Numr of usinss prosss () omplx tst Figur 6: Th ffiiny stuy tsts prov tht th grph-s mtho w propos is ffiint nough for prtil uss. 6. CONCLUSION AND FUTUE WOK In this ppr, w propos grph-s workflow rommntion thniqu whih oul us for improving th ffiiny n ury of pross moling. W rss th prolm of istn lultion twn two prosss ontining omplx struturs. Th xprimntl vlutions shown tht th grph-s workflow rommntion w propos is fsil for prtil uss. Sin fw rsrhs fous on workflow rommntion n our work is tnttiv ttmpt, muh work still hs to on n improv in th futur. For xmpl, how to fin inirt influning pttrns whih nfit for rommntion ury is hllnging. 7. EFEENCES [] W.M.P.V.D.AlstnL.Mrustr.Workflow Mining: Disovring Pross Mols from Evnt Logs. IEEE Trnstions on Knowlg n Dt Enginring, 6:8 4, 4. [] H. Bunk. On rltion twn grph it istn n mximum ommon sugrph. Pttrn ognition Lttrs, 8(8): , 997. [3]. Dijkmn, M. Dums, n L. Grí-Bñulos. Grph mthing lgorithms for usinss pross mol similrity srh. Businss Pross Mngmnt, pgs 48 63, 9. [4]. Dijkmn, M. Dums, B. Vn Dongn,. Käärik, n J. Mnling. Similrity of usinss pross mols: Mtris n vlution. Informtion Systms, 36():498 56,. [5] X. Yn n J. Hn. gspn: Grph-Bs Sustrutur Pttrn Mining. In IEEE Intrntionl Confrn on Dt Mining, pgs 7 74,. [6] J. Zhng, Q. Liu, n K. Xu. Flowrommnr: workflow rommntion thniqu for pross provnn. In Proings of th 8th Austrlsin Dt Mining Confrn (AusDM 9): Dt Mining n Anlytis 9. ACS Prss, 9. 53
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, =
More informationCSE 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
More informationSimilarity 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
More informationModule 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
More informationOutline. 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)
More informationCSE 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
More informationV={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
More informationMath 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
More informationb. 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
More informationV={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
More informationConstructive 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
More information, 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
More informationGarnir 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,
More informationAlgorithmic 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
More information1 Introduction to Modulo 7 Arithmetic
1 Introution to Moulo 7 Arithmti Bor w try our hn t solvin som hr Moulr KnKns, lt s tk los look t on moulr rithmti, mo 7 rithmti. You ll s in this sminr tht rithmti moulo prim is quit irnt rom th ons w
More information12. 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}
More information(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,
More information12/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
More informationCOMPLEXITY 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
More information5/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
More informationAn 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
More informationPlanar Upward Drawings
C.S. 252 Pro. Rorto Tmssi Computtionl Gomtry Sm. II, 1992 1993 Dt: My 3, 1993 Sri: Shmsi Moussvi Plnr Upwr Drwings 1 Thorm: G is yli i n only i it hs upwr rwing. Proo: 1. An upwr rwing is yli. Follow th
More informationExam 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
More informationPresent 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
More informationCS 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
More informationPaths. 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. {, } {, } {, } {, } {, } {,
More informationGraph 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
More informationWhy 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
More informationCSE 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
More informationCOMP108 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
More informationA Low Noise and Reliable CMOS I/O Buffer for Mixed Low Voltage Applications
Proings of th 6th WSEAS Intrntionl Confrn on Miroltronis, Nnoltronis, Optoltronis, Istnul, Turky, My 27-29, 27 32 A Low Nois n Rlil CMOS I/O Buffr for Mix Low Voltg Applitions HWANG-CHERNG CHOW n YOU-GANG
More informationAnalysis 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
More informationCS 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
More informationNumbering 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
More informationOutline. 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
More informationCS61B 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:
More informationRegister 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
More informationProblem 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
More informationQUESTIONS 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
More informationOutline. 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
More informationA 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
More informationOutline. Binary Tree
Outlin Similrity Srh Th Binry Brnh Distn Nikolus Austn nikolus.ustn@s..t Dpt. o Computr Sins Univrsity o Slzur http://rsrh.uni-slzur.t 1 Binry Brnh Distn Binry Rprsnttion o Tr Binry Brnhs Lowr Boun or
More informationECE COMBINATIONAL BUILDING BLOCKS - INVEST 13 DECODERS AND ENCODERS
C 24 - COMBINATIONAL BUILDING BLOCKS - INVST 3 DCODS AND NCODS FALL 23 AP FLZ To o "wll" on this invstition you must not only t th riht nswrs ut must lso o nt, omplt n onis writups tht mk ovious wht h
More informationCS 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
More informationEE1000 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
More informationThe 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
More informationUsing 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
More informationWeighted 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 ) >.
More informationCycles 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
More information# 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
More informationGraphs. 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
More informationSection 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
More informationECE 407 Computer Aided Design for Electronic Systems. Circuit Modeling and Basic Graph Concepts/Algorithms. Instructor: Maria K. Michael.
0 Computr i Dsign or Eltroni Systms Ciruit Moling n si Grph Conptslgorithms Instrutor: Mri K. Mihl MKM - Ovrviw hviorl vs. Struturl mols Extrnl vs. Intrnl rprsnttions Funtionl moling t Logi lvl Struturl
More informationS 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
More informationDesigning 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
More informationSeven-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
More information0.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
More informationSection 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
More informationCS200: 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
More informationWalk Like a Mathematician Learning Task:
Gori Dprtmnt of Euction Wlk Lik Mthmticin Lrnin Tsk: Mtrics llow us to prform mny usful mthmticl tsks which orinrily rquir lr numbr of computtions. Som typs of problms which cn b on fficintly with mtrics
More informationAnnouncements. 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
More informationDUET 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
More informationXML 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
More informationLast 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
More informationA 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,
More informationComputational 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
More informationAquauno 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
More informationChapter 9. Graphs. 9.1 Graphs
Chptr 9 Grphs Grphs r vry gnrl lss of ojt, us to formliz wi vrity of prtil prolms in omputr sin. In this hptr, w ll s th sis of (finit) unirt grphs, inluing grph isomorphism, onntivity, n grph oloring.
More informationGraphs. 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
More informationQUESTIONS 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
More informationPage 1. Question 19.1b Electric Charge II Question 19.2a Conductors I. ConcepTest Clicker Questions Chapter 19. Physics, 4 th Edition James S.
ConTst Clikr ustions Chtr 19 Physis, 4 th Eition Jms S. Wlkr ustion 19.1 Two hrg blls r rlling h othr s thy hng from th iling. Wht n you sy bout thir hrgs? Eltri Chrg I on is ositiv, th othr is ngtiv both
More informationCSE303 - 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
More informationCS553 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
More informationlearning objectives learn what graphs are in mathematical terms learn how to represent graphs in computers learn about typical graph algorithms
rp loritms lrnin ojtivs loritms your sotwr systm sotwr rwr lrn wt rps r in mtmtil trms lrn ow to rprsnt rps in omputrs lrn out typil rp loritms wy rps? intuitivly, rp is orm y vrtis n s twn vrtis rps r
More informationSolutions 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 ):
More informationa b c cat CAT A B C Aa Bb Cc cat cat Lesson 1 (Part 1) Verbal lesson: Capital Letters Make The Same Sound Lesson 1 (Part 1) continued...
Progrssiv Printing T.M. CPITLS g 4½+ Th sy, fun (n FR!) wy to tch cpitl lttrs. ook : C o - For Kinrgrtn or First Gr (not for pr-school). - Tchs tht cpitl lttrs mk th sm souns s th littl lttrs. - Tchs th
More informationTrees as operads. Lecture A formalism of trees
Ltur 2 rs s oprs In this ltur, w introu onvnint tgoris o trs tht will us or th inition o nroil sts. hs tgoris r gnrliztions o th simpliil tgory us to in simpliil sts. First w onsir th s o plnr trs n thn
More informationMinimum Spanning Trees
Minimum Spnning Trs Minimum Spnning Trs Problm A town hs st of houss nd st of rods A rod conncts nd only houss A rod conncting houss u nd v hs rpir cost w(u, v) Gol: Rpir nough (nd no mor) rods such tht:
More informationC-201 Sheet Bar Measures 1 inch
Janine M. lexander, P.. P.. No. 9, L 0 N. PRK RO, SUIT 0 HOLLYWOO, LORI 0 PHON: (9) - X: (9) 08- No.: 9 I ST SRIPTION Y GT VLVS SHLL RSILINT ST, MNUTUR TO MT OR X TH RQUIRMNTS O WW 09 (LTST RVISION) N
More informationInstructions for Section 1
Instructions for Sction 1 Choos th rspons tht is corrct for th qustion. A corrct nswr scors 1, n incorrct nswr scors 0. Mrks will not b dductd for incorrct nswrs. You should ttmpt vry qustion. No mrks
More informationFSA. 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
More informationMultipoint 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
More informationFundamental Algorithms for System Modeling, Analysis, and Optimization
Fundmntl Algorithms for Sstm Modling, Anlsis, nd Optimiztion Edwrd A. L, Jijt Rohowdhur, Snjit A. Sshi UC Brkl EECS 144/244 Fll 2011 Copright 2010-11, E. A. L, J. Rohowdhur, S. A. Sshi, All rights rsrvd
More information16.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)
More informationModule 2 Motion Instructions
Moul 2 Motion Instrutions CAUTION: Bor you strt this xprimnt, unrstn tht you r xpt to ollow irtions EXPLICITLY! Tk your tim n r th irtions or h stp n or h prt o th xprimnt. You will rquir to ntr t in prtiulr
More informationMore Foundations. Undirected Graphs. Degree. A Theorem. Graphs, Products, & Relations
Mr Funtins Grphs, Pruts, & Rltins Unirt Grphs An unirt grph is pir f 1. A st f ns 2. A st f gs (whr n g is st f tw ns*) Friy, Sptmr 2, 2011 Ring: Sipsr 0.2 ginning f 0.4; Stughtn 1.1.5 ({,,,,}, {{,}, {,},
More informationThe 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
More informationEfficient Broadcast in MANETs Using Network Coding and Directional Antennas
Effiint Brost in MANETs Using Ntwork Coing n Dirtionl Antnns Shuhui Yng Dprtmnt of Computr Sin Rnsslr Polythni Institut Troy, NY 28 Ji Wu n Mihl Cri Dprtmnt of Computr Sin n Enginring Flori Atlnti Univrsity
More informationCompression. 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
More informationLayout Decomposition for Quadruple Patterning Lithography and Beyond
Lyout Domposition for Qurupl Pttrning Lithogrphy n Byon Bi Yu ECE Dprtmnt Univrsity of Txs t Austin, Austin, TX i@r.utxs.u Dvi Z. Pn ECE Dprtmnt Univrsity of Txs t Austin, Austin, TX pn@.utxs.u ABSTRACT
More informationTOPIC 5: INTEGRATION
TOPIC 5: INTEGRATION. Th indfinit intgrl In mny rspcts, th oprtion of intgrtion tht w r studying hr is th invrs oprtion of drivtion. Dfinition.. Th function F is n ntidrivtiv (or primitiv) of th function
More informationME 522 PRINCIPLES OF ROBOTICS. FIRST MIDTERM EXAMINATION April 19, M. Kemal Özgören
ME 522 PINCIPLES OF OBOTICS FIST MIDTEM EXAMINATION April 9, 202 Nm Lst Nm M. Kml Özgörn 2 4 60 40 40 0 80 250 USEFUL FOMULAS cos( ) cos cos sin sin sin( ) sin cos cos sin sin y/ r, cos x/ r, r 0 tn 2(
More informationDiscovering Frequent Graph Patterns Using Disjoint Paths
Disovring Frqunt Grph Pttrns Using Disjoint Pths E. Gus, S. E. Shimony, N. Vntik {hu,shimony,orlovn}@s.gu..il Dpt. of Computr Sin, Bn-Gurion Univrsity of th Ngv, Br-Shv, Isrl Astrt Whrs t-mining in strutur
More informationFormal 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
More informationExpert 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
More informationa b v a v b v c v = a d + bd +c d +ae r = p + a 0 s = r + b 0 4 ac + ad + bc + bd + e 5 = a + b = q 0 c + qc 0 + qc (a) s v (b)
Outlin MULTIPLE-LEVEL LOGIC OPTIMIZATION Gionni D Mihli Stnfor Unirsit Rprsnttions. Tonom of optimition mthos: { Gols: r/l. { Algorithms: lgri/booln. { Rul-s mthos. Empls of trnsformtions. Booln n lgri
More informationConstruction 11: Book I, Proposition 42
Th Visul Construtions of Euli Constrution #11 73 Constrution 11: Book I, Proposition 42 To onstrut, in givn rtilinl ngl, prlllogrm qul to givn tringl. Not: Equl hr mns qul in r. 74 Constrution # 11 Th
More information(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
More informationSAMPLE PAGES. Primary. Primary Maths Basics Series THE SUBTRACTION BOOK. A progression of subtraction skills. written by Jillian Cockings
PAGES Primry Primry Mths Bsis Sris THE SUBTRACTION BOOK A prorssion o sutrtion skills writtn y Jillin Cokins INTRODUCTION This ook is intn to hlp sur th mthmtil onpt o sutrtion in hilrn o ll s. Th mstry
More informationProcess Discovery. prof.dr.ir. Wil van der Aalst.
Pross Disovry prof.r.ir. Wil vn r Alst www.prossmining.org Positioning Pross Mining prformn-orint qustions, prolms n solutions pross mol nlysis (simultion, vrifition, t.) pross mining t-orint nlysis (t
More information