FPGA Implementation of CubeHash, Grøstel, JH, and SHAvite-3 Hash Functions
|
|
- Marshall Underwood
- 6 years ago
- Views:
Transcription
1 FPGA Implmnttion o CuHs, Grøstl, JH, n SHAvit-3 Hs Funtions A. H. Nmin, G. Li, J. Wu, J. Xu, Y. Hun, O. Nm, R. Elz n M. A. Hsn Dprtmnt o Eltril n Computr Eninrin, Univrsity o Wtrloo Wtrloo, Ontrio N2L 3G Cn Emil: {nmin,27li,xwu,j27xu,y43un,onm,rouvn}@nmil.uwtrloo., sn@uwtrloo. Astrt In tis work, FPGA implmnttion o t omprssion untion or our o t son roun nits o t SHA-3 omptition r prsnt. All implmnttions wr prorm usin t sm tnoloy n optimiztion tniqus to prsnt ir omprison twn t nits. For our implmnttions w v us t Strtix III FPGA mily rom Altr. Aiv rsults r ompr wit similr implmnttions to provi ir omprison o nits prormn in rwr. Inx trms : Hs untions, SHA-3, CuHs, Grøstl, JH, SHAvit-3, rwr implmnttion, omprssion untion, FPGA. I. INTRODUCTION A ryptorpi s untion (or loritm) is untion tt tks vril-siz mss n rturns ixsiz output, wi is ll t mss-ist []. Hs untions r us in vrity o pplitions inluin, mss utntition, iitl sintur, inrprintin, n t inxin []. Sur Hs Aloritm- (SHA-) is s untion sin y t Ntionl Surity Any (NSA) n pulis s U.S. Frl Inormtion Prossin Stnr [2]. It is y r t most wily us s loritm or surity pplitions n protools. Rntly mtmtil wknss s n oun in t rittur o SHA- sustin mor sur s untion woul sirl or utur us [3]. Ntionl Institut o Stnrs n Tnoloy (NIST) is urrntly onutin n opn, puli omptition to intiy suitl nits or t nw s loritm (SHA-3) [4]. NIT s lso rommn rpi trnsition rom SHA- to SHA-2 ( stronr vrsion o SHA-) till omplt vlopmnt o SHA-3. At prsnt, ourtn nits xist in t son roun o t SHA-3 omptition. T sotwr sour o o ll t nits is vill onlin wi n sily ompil or irnt pltorms. A omprnsiv omprison o sotwr implmnttion n prormn o t nits n oun in [6]. Rrttly, only w o t nits ontin rwr implmnttion rsults o tir proposl. Also, ir omprison o t implmnttion rsults oul not on sily sin irnt pltorm n tnolois v n us or t implmnttions. T min ol o tis work is to implmnt numr o SHA-3 nits in rwr usin t sm tnoloy n sin tniqus n rt ir omprison o tir rwr prormn. An rlir vrsion o tis work rsult in rwr implmnttion o iv o t nits nmly, Blu Minit Wis, Lu, Skin, Sl, n Blk [3]. In tis work w prsnt rwr implmnttion rsults o our otr nits nmly, Cus, Grøstl, JH, n SHAvit-3 lon wit tt o SHA-2. For our rwr implmnttions w v us t Sttix III FPGA mily rom Altr. A omplt omprison o rwr prormn o ll nin nits is prsnt in t omprison stion. T rst o tis work is strutur s ollows. In Stion II, nrl isussion out s untions n our sin ppro is prsnt. A summry o CuHs, Gostl, JH, SHAvit-3 n SHA-2 s loritms n tir rwr implmnttion is ivn in Stion III-VII. Stion VIII isusss summry o rwr implmnttion rsults n omprison to otr nits rwr implmnttions. Som onluin rmrks r prsnt in Stion IX.
2 II. A BRIEF REVIEW OF HASH ALGORITHMS AND GENERAL DESIGN APPROACH To pross vril-siz input mss, most s untions r s on two st pross. T irst st ll t Prprossin st rivs t vril-siz input, ps it to t propr siz n tn rks it own into ix-siz mss loks. Pin t mss to t propr siz vris twn irnt loritms n mit inlu in t mss lnt, ountr vlu, or vn onstnt vlu to t input. T mss loks tn rriv onsutivly t t son st rrr to s t Hs omputtion st. Hr, t mss loks r pross itrtivly y untion ll t omprssion untion trou numr o rouns. T inputs o t omprssion untion r t mss lok n t output o t omprssion untion rom t prvious roun. Usin tis -k strutur, t inl ix-siz output woul ist s wi is untion o ll prvious inputs. NIST s mn tt ll nits to provi irnt mss ists o 224,, 384 n its sizs. Howvr, in tis work w just ous on t -it vrsions o t loritms. Our implmnttions v n rri out usin t VHDL to sri t loritms in rwr. T VHDL ils wr tn ompil wit t Qurtus II sotwr pk rom ALtr unr UNIX nvironmnt. For our implmnttions w trt t Strtix III FPGA mily. All sins ontin sril-in prlll-out (SIPO) n prlll-in sril-out (PISO) mouls to trnsr t t in/out o t FPGA. Usin ts mouls, w woul tk into ount t limit numr o I/O pins n t I/O pins sp limits o t FPGA. Mor tils o ts mouls r ivn in t omprison stion. III. CUBEHASH HASH FUNCTION CuHs s n propos y Dn Brnstin in [8]. It mks us o our irnt oprtions in its omprssion untion; 32-it ition, rott, swp n XOR oprtions. Two tunl prmtrs (r, ) r us to st t surity/prormn tr-os o t systm. For CuHs-, r n r qul to n 32, rsptivly. T omprssion untion strts y initilizin 24 it intrnl stt rom t input mss n t prvious s vlu. Tn tr xists on roun o trnsormtion to t stt. T roun is ompos o two ition, two rott, our swp, n two XOR oprtions. Dtils out ts oprtions n tir orr o pplitions n oun in [8]. Atr t roun oprtion, intr is XOR into t lst stt wor n t inliztion st ins wi is m o tn intil roun oprtions similr to t initil roun. T rsult is 24 it stt, o wi t lst siniint -its rt t output s. T nrl lok irm us or t rwr implmnttion o CuHs- is sown in Fi.. M i Comprssion On XOR '' Finliztion Tn 24 Trunt... Fi.. Hrwr ritturs us or t omprssion untion o CuHs- FPGA implmnttion rsult o Cus- is summriz in t irst row o Tl I. In tis tl, C.F. Clk Frquny rprsnts t mximum rquny tt t omprssion untion oul lok t. C.F. Clk Cyls rprsnts t rquir numr o lok yls or t omprssion untion to rt it mss ist. Comintionl ALUTs rprsnts t numr o LUTs rquir or implmnttion o t omintionl iruits. Dit loi Ristrs sows t numr o ALUTs us s ristrs y In r n Out r ristrs. Also in t tl, I/O Clk yls n rquny r t rsult o usin PISO n SIPO mouls wi r xplin in t omprison stion.
3 IV. GRØSTEL HASH FUNCTION T Grøstl loritm is u to L. R. Knusn t l. [9]. T omprssion untion is s on two unrlyin prmuttion mouls P n Q runnin in prlll. Dsin o t prmuttion mouls ws inspir y t Rijnl lok ipr, onsistin o numr o rouns (tn rouns or t -it vrsion). E roun ontins our sprt trnsormtions: Aonstnt, SuByt, SitByt, n MixByt. T AConstnt s roun-pnnt onstnt to t stt vril. T SuByts sustituts yt in t stt y notr yt usin S-ox. T SitByt ylilly sits t yts insi t stt vril. In MixBy yt o t stt is sn s n lmnt in GF(2 8 ) n is in multipli y notr onstnt lmnt insi t il. SuByt n MixByt trnsormtion r in t sm wy s in Rijnl loritm. T inl s is rt y xlusiv-orin o t prvious s wit t outputs o t P n Q mouls. T nrl lok irm us or t rwr implmnttion o Grøstl- is sown in Fi. 2. FPGA implmnttion rsults o Grøstl- r summriz in t son row o Tl I. M i -.. AConstnt_Q SuByt SitByt MixByt AConstnt_P SuByt SitByt MixByt Q P AConstnt_Q SuByt SitByt MixByt AConstnt_P SuByt SitByt MixByt Fi. 2. Hrwr ritturs us or t omprssion untion o Grøstl- V. JH HASH FUNCTION Honjun Wu s propos t JH loritm []. T omprssion pross strts y xlusiv-orin t input mss to t irst prt o t prvious s. Atr rroupin t its, tr xist 35 rouns o t roun untion. T roun untion uss t nrliz sin mtooloy n is m o tr sprt lyrs: S-Box, Linr trnsormtion (L), n Prmuttion (P). Tr xist two irnt S-oxs insi t S-ox lyr. T prmtr roun onstnt trmins wi o t S-oxs is us or roun. T linr trnsormtion lyr uss multiplition ovr t init il GF(2 4 ) usin t irruil polynomil x 4 x. T prmuttion lyr is similr to t row rottion in t. T nxt stps in omprssion r on lyr o S-Box n -roupin moul. At t n, t ms prt o t stt vril is xlusiv-or wit t input to rt t output s. T nrl lok irm us or t rwr implmnttion o JH- is sown in Fi. 3. FPGA implmnttion rsults o JH- r summriz in t tir row o Tl I. VI. SHAVITE-3 HASH FUNCTION T SHAvit-3 loritm s n propos y Eli Bim n Orr Dunklmn []. It is s on t Hs Itrtiv Frm Work (HAIFA) onstrution n it uss uilin loks wit lok siz o 28 its [],[2]. E roun uss our oprtions: 8-it S-ox, yli sit, multiplition ovr init il GF(2 8 ), n XOR. T omprssion untion is m o lok ipr (E) in t Dvis-Myr mo. E is twlv roun Fistl lok ipr wr roun is ompos o tr ull rouns o. E roun rquirs ky wi is otin rom mss xpnsion o t mss loks y t ky nrtor moul. T ky nrtor moul uss 6 rouns o n 28 XOR ts to rt 36 ky o siz 28-its (, usin t mss lok, n t ountr s t inputs. T nrl lok irm us or t rwr implmnttion o SHAvit-3- is sown in Fi. 4. FPGA implmnttion rsult o t JH- is summriz in t ourt row o Tl I.
4 M i i- H ls i- H ms. S-Box S S S S Groupin Trnsormtion L Prmution P Trnsormtion L E 8 S-Box Prmution P S-Box S S D-roupin i H ms i H ls Fi. 3. Hrwr ritturs us or t omprssion untion o JH- - M i- C i- 64 Ky Gnrtor k Fi. 4. Hrwr ritturs us or t omprssion untion o SHAvit-3- VII. SHA-2 HASH FUNCTION Consirin t isovry o t wknss in SHA-, NIST s rqust t rpi trnsition to t stronr SHA-2 mily o s untions. T SHA-2 s untions r struturlly similr to SHA- n potntilly rry t sm wknss ut sin ty r mu stronr, prtil ttks r unlikly in nr utur. T si t lok us in SHA-2 (SHA-) is wor wi is 32 its lon. SHA- mks us o itwis loil wor XOR n AND oprtions lon wit wor ition (moulo 232), rott rit n sit rit oprtions. T omprssion untion is m o 64 onsutiv roun untions. E roun untion riv tr inputs: 28-it stt vril (in 32-it roups s input wors -), K t wi is 32-it onstnts n w t wi is vril rt trou t mss sul pross rom input mss loks. t output o t roun untion is t nxt stt vlu (output wors -). T rwr rittur us or implmnttion o SHA- is sown in Fi. 5. In tis iur loks,, C, n Mj r loil untions m o rott, sit n loil oprtions [5]. FPGA implmnttion rsult o t SHA- is summriz in t lst row o Tl I. - K t W t C Mj 64 K t W t C Mj { Fi. 5. Hrwr ritturs us or t omprssion untion o SHA-
5 Hs C.F. Clk C.F. Clk I/O Clk I/O Clk Totl Comintionl Dit Loi Ar Dly I/O Frquny Cyls Frquny Cyls Dly ALUTs Ristrs Cost Funtion Pins CuHs 2.88 MHz 4 MHz 4 47 ns Grøstl 9.59 MHz 4 MHz 32 3 ns JH 5.79 MHz 4 MHz ns SHAvit MHz 4 MHz ns BMW[3] 9.55 MHz 4 MHz ns Lu[3] 47.4 MHz 4 MHz 6 6 ns Skin-[3] 6.42 MHz 72 4 MHz 8 49 ns Sl[3] MHz 48 4 MHz ns Blk[3] MHz 4 MHz ns SHA MHz 4 MHz ns TABLE I FPGA IMPLEMENTATION SUMMARY OF THE DIFFERENT COMPRESSION FUNCTIONS VIII. FPGA IMPLEMENTATION COMPARISON W v us Strtix III FPGA mily rom Altr or our Implmnttions. Qurtus II sotwr pk rom Altr unr UNIX nvironmnt ws us to implmnt t sins. All implmnttions ontin SIPO n PISO mouls to trnsr t t into or out o t FPGA. Usin ts mouls, t limit numr o I/O pins n t I/O sp limits o t FPGA r tkn into ount. T SIPO moul rivs t input t s 32-it wors n tn stors tm or t propr output slt y t input slt lins. Usin tis mto input its n lo into t SIPO moul 32-its t tim. Tn t t n trnsr to t omprssion untion in prlll. T PISO moul uss similr i; it los t t rom t omprssion untion in prlll n tn trnsrs tm to t output 32-its t tim. FPGA implmnttion rsults o t our nits nmly CuHs, Grøstl, JH, n SHAvit-3 r list in t irst our rows o t Tl I. For t purpos o omprison, implmnttion rsults or our prvious work [3] on iv otr nits nmly Blu Minit Wis, Lu, Skin, Sl, n Blk usin t sm FPGA tnoloy r list in t nxt iv rows o t tl [3]. T lst row o t tl, rprsnts t implmnttion rsults o SHA-2 rom Stion VII. In Tl I, t I/O Clk Frquny rprsnts t mximum sp t wi t SIPO n PISO mouls oul lok t. T I/O sp is limit y t FPGA itsl wi in our s is 2.5ns [4]. Also in t sm tl I/O Clk yls, rprsnts t rquir numr o lok yls y SIPO n PISO mouls to lo t t into/out o t FPGA. T tils o SIPO n PISO mouls r sown in Fi. 6. Fi. 6. SIPO n PISO mouls us in FPGA implmnttions Rrin t omprssion untion sp, s n sn rom t tl, Lu prsnts t stst rittur ollow y CuHs, Grøstl n JH. Tkin into ount t I/O ly, t stst nit is still Lu ollow y Grøstl, CuHs, n Blu Minit Wis. Rrin r us, Skin, Sl, n Blk prsnt t smllst r utiliztion. Comprin t nits to SHA-, ll onsir nits prorm str tn SHA- (wit or witout tkin into ount t I/O ly) xpt Skin wi is lmost prsntin t sm prormn. Rrin t r us Grøstl, JH, n SHAvit-3 rquir mor r ompr to SHA-. Not tt usully minimizin r n ly r ot importnt ols in ny rwr implmnttion. To tis n, w v in r tims ly s msur o prormn in our omprison tl. W n s tt Lu outprorms ll otr sins ollowin y Skin, CuHs, n Sl s it is sown in t Ar Dly Cost Funtion olumn in Tl I.
6 IX. CONCLUSIONS W v prsnt FPGA implmnttion o t omprssion untion or our nits o t SHA-3 omptition. Implmnttions v n rri out usin t Strtix III FPGA mily rom Altr. Rsults v lso n ompr wit t implmnttion rsults o som otr nits usin t sm pltorm. X. ACKNOWLEDGMENTS T utors woul lik to tnk CMC or proviin t CAD tools n support. Tis work ws support in prt y NSERC strti projt rnt wr to Dr. Hsn. REFERENCES [] Mnzs, A. J., Vn Oorsot, P. C., Vnston, S. A.: Hnook o Appli Cryptorpy. T CRC Prss sris on isrt mtmtis n its pplitions, pp , 997. [2] Ntionl Institut o Stnrs n Tnoloy: Sur Hs Stnr, Frl Inormtion Prossin Stnrs (FIPS) Pulition 8-3, Otor, 28. [3] Wn, X., Yo, A., Yo, F.: Nw Collision sr or SHA-. Crypto 25 rump ssson. [4] Ntionl Institut o Stnr n Tnoloy (NIST): Cryptorpi Hs Aloritm Comptition Wsit: ttp://sr.nist.ov/roups/st/s/s-3/. [5] T SHA-3 Zoo - T ECRYPT s untion wsit. Wsit: ttp://s.iik.turz.t/wiki/t SHA-3 Zoo. [6] Europn Ntwork o Exlln or Cryptoloy II (ECRYPT II): ECRYPT Bnmrkin o All Sumitt Hss (EBASH): ttp://n.r.yp.to/s.tml. [7] Flismnn, E., Forlr, C., Gorski, M.: Clssiition o t SHA-3 Cnits. Intrntionl Assoition or Cryptoloi Rsr (IACR) Print riv [8] Brnstin, D. J., CuHs spiition, Wsit: ttp://us.r.yp.to/ [9] Gurvrm, p.,knusn, L. R., Mtusiwiz, K., Mnl, F., Rrr, C., Slr, M., Tomsn, S. S., Grøstl - SHA-3 nit, Wsit: ttp:// [] Wu, H., SHA-3 proposl JH, Wsit: ttp://is.i2r.-str.u.s/st/onjun/j/. [] Bim, E., Dunklmn, O., T SHAvit-3 Hs Funtion, Wsit: ttp:// orr/shavit-3/. [2] Bim, E., n Dunklmn, O.: A Frmwork or Itrtiv Hs Funtions HAIFA, NIST 2n s untion worksop, Snt Brr, Auust 26. [3] Nmin, A. H., Hsn, M. A.: Implmnttion o t Comprssion Funtion or Slt SHA-3 Cnits on FPGA, 7t Roniurl Aritturs Worksop, pt. [4] ALTERA: Strtix III Dvi Hnook, Volum, My 29. [5] Frl Inormtion Prossin Stnrs Pulition (FIPS PUB) 8-2: Sur Hs Sintur Stnr (SHS), pp. -79, Au. 22.
OpenMx Matrices and Operators
OpnMx Mtris n Oprtors Sr Mln Mtris: t uilin loks Mny typs? Dnots r lmnt mxmtrix( typ= Zro", nrow=, nol=, nm="" ) mxmtrix( typ= Unit", nrow=, nol=, nm="" ) mxmtrix( typ= Int", nrow=, nol=, nm="" ) mxmtrix(
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 informationMAT3707. Tutorial letter 201/1/2017 DISCRETE MATHEMATICS: COMBINATORICS. Semester 1. Department of Mathematical Sciences MAT3707/201/1/2017
MAT3707/201/1/2017 Tutoril lttr 201/1/2017 DISCRETE MATHEMATICS: COMBINATORICS MAT3707 Smstr 1 Dprtmnt o Mtmtil Sins SOLUTIONS TO ASSIGNMENT 01 BARCODE Din tomorrow. univrsity o sout ri SOLUTIONS TO ASSIGNMENT
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 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 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 informationTangram Fractions Overview: Students will analyze standard and nonstandard
ACTIVITY 1 Mtrils: Stunt opis o tnrm mstrs trnsprnis o tnrm mstrs sissors PROCEDURE Skills: Dsriin n nmin polyons Stuyin onrun Comprin rtions Tnrm Frtions Ovrviw: Stunts will nlyz stnr n nonstnr tnrms
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(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 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 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 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 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 informationd e c b a d c b a d e c b a a c a d c c e b
FLAT PEYOTE STITCH Bin y mkin stoppr -- sw trou n pull it lon t tr until it is out 6 rom t n. Sw trou t in witout splittin t tr. You soul l to sli it up n own t tr ut it will sty in pl wn lt lon. Evn-Count
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 informationAn Efficient FPGA Implementation of the Advanced Encryption Standard Algorithm G. Mohan 1 K. Rambabu 2
IJSRD - Intrntionl Journl or Sintii Rsrh & Dvlopmnt Vol., Issu, ISSN (onlin): - An Eiint FPGA Implmnttion o th Avn Enryption Stnr Algorithm G. Mohn K. Rmu M.Th Assistnt Prossor Dprtmnt o Eltronis n ommunition
More informationGrade 7/8 Math Circles March 4/5, Graph Theory I- Solutions
ulty o Mtmtis Wtrloo, Ontrio N ntr or ution in Mtmtis n omputin r / Mt irls Mr /, 0 rp Tory - Solutions * inits lln qustion. Tr t ollowin wlks on t rp low. or on, stt wtr it is pt? ow o you know? () n
More information5/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
More informationWeighted Graphs. Weighted graphs may be either directed or undirected.
1 In mny ppltons, o rp s n ssot numrl vlu, ll wt. Usully, t wts r nonntv ntrs. Wt rps my tr rt or unrt. T wt o n s otn rrr to s t "ost" o t. In ppltons, t wt my msur o t lnt o rout, t pty o ln, t nry rqur
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 informationMath 166 Week in Review 2 Sections 1.1b, 1.2, 1.3, & 1.4
Mt 166 WIR, Sprin 2012, Bnjmin urisp Mt 166 Wk in Rviw 2 Stions 1.1, 1.2, 1.3, & 1.4 1. S t pproprit rions in Vnn irm tt orrspon to o t ollowin sts. () (B ) B () ( ) B B () (B ) B 1 Mt 166 WIR, Sprin 2012,
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 informationEdge-Triggered D Flip-flop. Formal Analysis. Fundamental-Mode Sequential Circuits. D latch: How do flip-flops work?
E-Trir D Flip-Flop Funamntal-Mo Squntial Ciruits PR A How o lip-lops work? How to analys aviour o lip-lops? R How to sin unamntal-mo iruits? Funamntal mo rstrition - only on input an an at a tim; iruit
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 informationComplete Solutions for MATH 3012 Quiz 2, October 25, 2011, WTT
Complt Solutions or MATH 012 Quiz 2, Otor 25, 2011, WTT Not. T nswrs ivn r r mor omplt tn is xpt on n tul xm. It is intn tt t mor omprnsiv solutions prsnt r will vlul to stunts in stuyin or t inl xm. In
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 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 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 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 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 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 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 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 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 information4.1 Interval Scheduling. Chapter 4. Greedy Algorithms. Interval Scheduling: Greedy Algorithms. Interval Scheduling. Interval scheduling.
Cptr 4 4 Intrvl Suln Gry Alortms Sls y Kvn Wyn Copyrt 005 Prson-Ason Wsly All rts rsrv Intrvl Suln Intrvl Suln: Gry Alortms Intrvl suln! Jo strts t s n nss t! Two os omptl ty on't ovrlp! Gol: n mxmum sust
More informationCS 103 BFS Alorithm. Mark Redekopp
CS 3 BFS Aloritm Mrk Rkopp Brt-First Sr (BFS) HIGHLIGHTED ALGORITHM 3 Pt Plnnin W'v sn BFS in t ontxt o inin t sortst pt trou mz? S?? 4 Pt Plnnin W xplor t 4 niors s on irtion 3 3 3 S 3 3 3 3 3 F I you
More informationThe University of Sydney MATH 2009
T Unvrsty o Syny MATH 2009 APH THEOY Tutorl 7 Solutons 2004 1. Lt t sonnt plnr rp sown. Drw ts ul, n t ul o t ul ( ). Sow tt s sonnt plnr rp, tn s onnt. Du tt ( ) s not somorp to. ( ) A onnt rp s on n
More informationLecture 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
More informationIn which direction do compass needles always align? Why?
AQA Trloy Unt 6.7 Mntsm n Eltromntsm - Hr 1 Complt t p ll: Mnt or s typ o or n t s stronst t t o t mnt. Tr r two typs o mnt pol: n. Wrt wt woul ppn twn t pols n o t mnt ntrtons low: Drw t mnt l lns on
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 informationDivided. diamonds. Mimic the look of facets in a bracelet that s deceptively deep RIGHT-ANGLE WEAVE. designed by Peggy Brinkman Matteliano
RIGHT-ANGLE WEAVE Dv mons Mm t look o ts n rlt tt s ptvly p sn y Py Brnkmn Mttlno Dv your mons nto trnls o two or our olors. FCT-SCON0216_BNB66 2012 Klm Pulsn Co. Ts mtrl my not rprou n ny orm wtout prmsson
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 informationBASIC CAGE DETAILS D C SHOWN CLOSED TOP SPRING FINGERS INNER WALL TABS ARE COINED OVER BASE AND COVER FOR RIGIDITY
SI TIS SOWN OS TOP SPRIN INRS INNR W TS R OIN OVR S N OVR OR RIIITY. R IMNSIONS O INNR SIN TO UNTION WIT QU SM ORM-TOR (zqsp+) TRNSIVR. R. RR S OPTION (S T ON ST ) TURS US WIT OPTION T SINS. R (INSI TO
More informationCSC 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 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 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 informationBASIC CAGE DETAILS SHOWN 3D MODEL: PSM ASY INNER WALL TABS ARE COINED OVER BASE AND COVER FOR RIGIDITY SPRING FINGERS CLOSED TOP
MO: PSM SY SI TIS SOWN SPRIN INRS OS TOP INNR W TS R OIN OVR S N OVR OR RIIITY. R TURS US WIT OPTION T SINS. R (UNOMPRSS) RR S OPTION (S T ON ST ) IMNSIONS O INNR SIN TO UNTION WIT QU SM ORM-TOR (zqsp+)
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 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 information160 SSC Variable Speed Drive (Series C)
0 SS Variable Speed rive (Series ) Publication 0-P onfigured rive Package Important User Information Solid state equipment has operational characteristics differing from those of electromechanical equipment.
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 informationECE Experiment #6 Kitchen Timer
ECE 367 - Exprimnt #6 Kithn Timr Sprin 2006 Smstr Introution This xprimnt hs you onstrut iruit intrfin nin I/O lins from th 68HC11 with two svn smnt isplys n mtrix kyp, n writ ssmbly lnu o to rliz prormmbl
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 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 informationIndices. Indices. Curriculum Ready ACMNA: 209, 210, 212,
Inis Inis Curriulum Ry ACMNA: 09, 0,, 6 www.mtltis.om Inis INDICES Inis is t plurl or inx. An inx is us to writ prouts o numrs or pronumrls sily. For xmpl is tully sortr wy o writin #. T is t inx. Anotr
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 information24CKT POLARIZATION OPTIONS SHOWN BELOW ARE REPRESENTATIVE FOR 16 AND 20CKT
0 NOTS: VI UNSS OTRWIS SPII IRUIT SMT USR R PORIZTION OPTION IRUIT SMT USR R PORIZTION OPTION IRUIT SMT USR R PORIZTION OPTION. NR: a. PPITION SPIITION S: S--00 b. PROUT SPIITION S: PS--00 c. PIN SPIITION
More informationVLSI Testing Assignment 2
1. 5-vlu D-clculus trut tbl or t XOR unction: XOR 0 1 X D ~D 0 0 1 X D ~D 1 1 0 X ~D D X X X X X X D D ~D X 0 1 ~D ~D D X 1 0 Tbl 1: 5-vlu D-clculus Trut Tbl or t XOR Function Sinc 2-input XOR t wors s
More informationCS150 Sp 98 R. Newton & K. Pister 1
Outin Cok Synronous Finit- Mins Lst tim: Introution to numr systms: sin/mnitu, ons ompmnt, twos ompmnt Rviw o ts, ip ops, ountrs Tis tur: Rviw Ts & Trnsition Dirms Impmnttion Usin D Fip-Fops Min Equivn
More informationExperiment # 3 Introduction to Digital Logic Simulation and Xilinx Schematic Editor
EE2L - Introution to Diitl Ciruits Exprimnt # 3 Exprimnt # 3 Introution to Diitl Loi Simultion n Xilinx Smti Eitor. Synopsis: Tis l introus CAD tool (Computr Ai Dsin tool) ll Xilinx Smti Eitor, wi is us
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 informationGray Encoded Arithmetic Operators Applied to FFT and FIR Dedicated Datapaths
Gry Eno Aritmti Oprtors Appli to FF n FI Dit Dtpts Euro A.. ost José. ontiro Srio Bmpi Pl IS/IES FGS Plots, Brzil Liso, Portul P. Alr, Brzil ABSA is ppr rsss t us o low powr tniqus ppli to FI iltr n FF
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 informationMulti-criteria p-cycle network design
Multi-ritri p-yl ntwork sin Hmz Dri, Brnr Cousin, Smr Lou, Miklos Molnr To it tis vrsion: Hmz Dri, Brnr Cousin, Smr Lou, Miklos Molnr. Multi-ritri p-yl ntwork sin. r IEEE Conrn on Lol Computr Ntworks (LCN
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 informationNefertiti. 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
More information(4, 2)-choosability of planar graphs with forbidden structures
1 (4, )-oosility o plnr rps wit orin struturs 4 5 Znr Brikkyzy 1 Cristopr Cox Mil Diryko 1 Kirstn Honson 1 Moit Kumt 1 Brnr Liiký 1, Ky Mssrsmit 1 Kvin Moss 1 Ktln Nowk 1 Kvin F. Plmowski 1 Drrik Stol
More informationSWAGELOK BRISTOL SOPFAB SOPFAB04-AR-271A/B SAMPLE TO ANALYSER SURPLUS TUBE CUTBACK TO SUIT AIR IN CAL 1 FLARE CAL 2 STEAM IN AIR IN
00 0 SMPL TO NLYSR LR STM IN SURPLUS TU UTK TO SUIT IR IN L L IR IN 0 n TYP. 0 00 STM ONNST ST LOOP ST LOOP SRUR RIN TR RIN RVISION ISTORY RV T SRIPTION PPROV V0 /0/0 INITIL RLS K RIN V0 0/0/0 UPT K RIN
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 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 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 informationDepth First Search. Yufei Tao. Department of Computer Science and Engineering Chinese University of Hong Kong
Dprtmnt o Computr Sn n Ennrn Cns Unvrsty o Hon Kon W v lry lrn rt rst sr (BFS). Toy, w wll suss ts sstr vrson : t pt rst sr (DFS) lortm. Our susson wll on n ous on rt rps, us t xtnson to unrt rps s strtorwr.
More informationSelf-Adjusting Top Trees
Th Polm Sl-jsting Top Ts ynmi ts: ol: mintin n n-tx ost tht hngs o tim. link(,w): ts n g twn tis n w. t(,w): lts g (,w). pplition-spii t ssoit with gs n/o tis. ont xmpls: in minimm-wight g in th pth twn
More informationTCI SERIES, 3 CELL THE COOLING TOWER CO., L.C. TCI 3 CELL SERIES GA
of T SIN IS T PROPRTY O T OOLIN TOWR OMPNY, L, N IS LON OR MUTUL SSISTN. IT IS NOT TO ORWR NOR RPRINT IN NY ORM WITOUT WRITTN PRMISSION. L W OPTIONL SS PLTORM " x " STNR PLTORM PR LL OPTIONL VIRTION SWIT
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 informationDistributed community detection over dynamic networks using neighborhood similarity
ERCIM SNA WG Aloritmi Aspts o Soil Ntwork Anlysis Guillum-Jn Hrit Mr, 11t 2010, UCD, Dulin Distriut ommunity ttion ovr ynmi ntworks usin nioroo similrity Rtionl or tis ppro 2 Rtionl or tis ppro In wirlss
More informationSTRUCTURAL GENERAL NOTES
UILIN OS: SIN LOS: RUTURL NRL NOTS NRL NOTS: US ROUP: - SSMLY USS INTN OR PRTIIPTION IN OR VIWIN OUTOOR TIVITIS PR MIIN UILIN O STION. SSONL. T UNTION O TIS ILITY IS NOT OR QUIPP OR OUPNY URIN WINTR/ TIN
More informationAIR FORCE STANDARD DESIGN MILITARY WORKING DOG FACILITY
1. NRL NOTS US THS OUMNTS IN ONJUTION WITH TH STNR SIN OUMNT N INTRTIV PRORMMIN WORKSHT. NUMR RWIN LIST NM -1 OVR SHT -1 STNR SIN PLN - 1-2 STNR SIN PLN - 2-3 MOULS,, & PLNS & XONS -4 MOULS PLNS & XONS
More informationPlatform Controls. 1-1 Joystick Controllers. Boom Up/Down Controller Adjustments
Ston 7 - Rpr Prours Srv Mnul - Son Eton Pltorm Controls 1-1 Joystk Controllrs Mntnn oystk ontrollrs t t propr sttns s ssntl to s mn oprton. Evry oystk ontrollr soul oprt smootly n prov proportonl sp ontrol
More informationImproving 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
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 informationSpanning Trees. BFS, DFS spanning tree Minimum spanning tree. March 28, 2018 Cinda Heeren / Geoffrey Tien 1
Spnnn Trs BFS, DFS spnnn tr Mnmum spnnn tr Mr 28, 2018 Cn Hrn / Gory Tn 1 Dpt-rst sr Vsts vrts lon snl pt s r s t n o, n tn ktrks to t rst junton n rsums own notr pt Mr 28, 2018 Cn Hrn / Gory Tn 2 Dpt-rst
More informationBiddle Consulting Group s Standard AAP Reports
Bil Consultin Group s Stnr AAP Rports Th Workor Anlysis is h ount o mploys in ivn Orniztionl Unit, rokn own y nr n til r. It provis n ovrll mploymnt proil n intiis possil rs o isrimintion. Givs th prtmnt
More informationChapter 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
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 informationPhysics 222 Midterm, Form: A
Pysis 222 Mitrm, Form: A Nm: Dt: Hr r som usul onstnts. 1 4πɛ 0 = 9 10 9 Nm 2 /C 2 µ0 4π = 1 10 7 tsl s/c = 1.6 10 19 C Qustions 1 5: A ipol onsistin o two r point-lik prtils wit q = 1 µc, sprt y istn
More informationEXAMPLE 87.5" APPROVAL SHEET APPROVED BY /150HP DUAL VFD CONTROL ASSEMBLY CUSTOMER NAME: CAL POLY SLO FINISH: F 20
XMPL XMPL RVISIONS ZON RV. SRIPTION T PPROV 0.00 THIS IS N PPROVL RWING OR YOUR ORR. OR MNUTURING N GIN, THIS RWING MUST SIGN N RTURN TO MOTION INUSTRIS. NY HNGS M TO THIS RWING, TR MNUTURING HS GUN WILL
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 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 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 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 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 informationLarge Graphs Compression using a combined algorithm
Bulltin of Environmnt, Prmology n Lif Sins Bull. Env.Prmol. Lif Si., Vol 4 [Spl issu 1] 2015: 261-268 2014 Amy for Environmnt n Lif Sins, Ini Onlin ISSN 2277-1808 Journl s URL:ttp://www.pls.om CODEN: BEPLAD
More informationOverview. Usages of Fault Simulators. Problem and Motivation. Alternatives and Their Limitations. VLSI Design Verification and Testing
VLSI Dsin Vriiction n Tstin Fult Simultion Mohmm Thrnipoor Elctricl n Computr Eninrin Univrsity o Conncticut Ovrviw Prolm n motivtion Fult simultion lorithms Sril Prlll Ductiv Concurrnt Othr lorithms Rnom
More informationOptimization of Multistage Interconnection Networks
IEEE TRNSCTIONS ON COMPUTERS, VOL. C-34, NO. 3, MRCH 985 Dynmi ssiility Tstin n Pt Lnt Optimiztion o Multist Intronntion Ntworks 55 DHRM P. GRWL, SENIOR MEMBER, IEEE, ND J-SONG LEU, STUDENT MEMBER, IEEE
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 informationOPERATING HEAD CODE SIDE ROTARY COUNTRY USE CODE US, CANADA, MEXICO ALL OTHER APPROVED COUNTRIES
O-- ONWLL PRT NUMR - RV OUMNT N K 0 S SP M WL SPILS O TP O N, MTL IN NLOSUR NTNN TP O LLOW OR US 0 0 0 0 0 0 0 0 0 WIRLSS STNR SINL RN T RT OPRTIN RQUN SOTWR VRSION O VRSION R MOUL TRNSMIT POWR MX RIV
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 informationNew challenges on Independent Gate FinFET Transistor Network Generation
Nw hllngs on Inpnnt Gt FinFET Trnsistor Ntwork Gnrtion Viniius N. Possni, Anré I. Ris, Rnto P. Ris, Flip S. Mrqus, Lomr S. Ros Junior Thnology Dvlopmnt Cntr, Frl Univrsity o Plots, Plots, Brzil Institut
More informationCMPS 2200 Fall Graphs. Carola Wenk. Slides courtesy of Charles Leiserson with changes and additions by Carola Wenk
CMPS 2200 Fll 2017 Grps Crol Wnk Sls ourtsy o Crls Lsrson wt ns n tons y Crol Wnk 10/23/17 CMPS 2200 Intro. to Alortms 1 Grps Dnton. A rt rp (rp) G = (V, E) s n orr pr onsstn o st V o vrts (snulr: vrtx),
More information