Design Optimization Based on Diagnosis Techniques
|
|
- Donna Butler
- 5 years ago
- Views:
Transcription
1 Dsign Optimiztion Bs on Dignosis Thniqus Anrs Vnris Mgy S. Air Irhim N. Hjj Univrsity of Toronto Motorol Univrsity of Illinois ECE Dprtmnt 77 W. Prmr ECE Dprtmnt n CSL Toronto, ON M5S 34 Austin, T Urn, IL 6181 vnris@g.toronto.u m.ir@motorol.om hjj@uivlsi.sl.uiu.u Astrt Logi optimiztion is th stp of th VLSI sign yl whr th signr prforms moifitions on th sign otin to stisfy iffrnt onstrints suh s r, powr or ly. In this ppr w propos novl ATPs optimiztion mthoology tht orrows from prvious sign rror ignosis n orrtion thniqus. W lso prsnt xmpls n xprimnts tht init tht our pproh hs itionl potntil whn ompr to prvious ATP/simultion-s optimiztion mthos. 1 Logi Dsign Optimiztion Th sign of igitl iruits usully strts with hviorl sription (spifition) o in som high lvl sription lngug. At som point of th sign yl, logi synthsis is rri out to otin multilvl implmnttion (ntlist) using lls (gts) from som thnology lirry. As nxt stp, logi optimiztion is usully prform, whr th ojtiv is to moify th ntlist to hiv iffrnt onstrints suh s minimiz th r, ru powr onsumption, stisfy timing onstrints, ru swithing nois or improv th tstility of th finl iruit. Rntly, ATP/simultion-s optimiztion thniqus [6] [7] [8] [9] [1] [11] [16] hv gin inrsing populrity. Thir min strngth, ompr to forml Booln funtion (i.. symoli) [4] s optimiztion mthos, lis in thir flxiility sin thy r mmory ffiint, thy hv goo filur hrtristis n lthough, thortilly, thy n xponntil in tim, in prti this is rrly th s. In this rsrh w propos nw pproh to ATP-s sign optimiztion. Th propos pproh orrows from our prvious fforts on Dsign Error Dignosis n Corrtion (DEDC) n it provis mor powrful rout to ATP-s optimiztion. To illustrt th ntrl points of th propos rsrh w n to tk losr viw on xisting ATP-s optimiztion thniqus n th prolm of DEDC. This is th topi of stions 2 n 3, rsptivly. In stion 4 w xmin th rltionship of ths two prolms n prsnt our mtho. Stion 5 ontins th xprimntl rsults n stion 6 onlus this ppr. 2 Dsign Optimiztion Vi Rwiring ATP-s sign optimiztion thniqus r usully s on sign rwiring s thy try to optimiz givn ntlist with squn of simpl logi trnsformtions suh s ing/lting singl wir, gt..., t. A signifint mount of optimiztion through rwiring is prform through runny ition n rmovl [6] [7] [8] [9] [1] [16]. Ths mthos trgt wir tht violts rtin spifition onstrints n ttmpt to rmov it y ithr ing runnt logi (so tht th trgt wir oms itslf runnt), or y loking ll possil snsitiz pths tht xist from th trgt wir to primry outputs. Th following xmpl, tkn from [9], outlins th mjor stps of th singl wir runny ition/rmovl sign optimiztion mtho. Exmpl: Consir th simpl iruit in Figur 1() whr wir g5 g9, init y ott lin, is not prt of th originl ntlist. Also ssum tht wir w T = g1 g4, nm trgt wir hrftr, ns to rmov us it violts som spifition onstrint(s). In runny ition/rmovl, th trgt wir w T is rmov without ltring th funtion(s) implmnt t th primry output(s) y ing nw runnt onntion tht mks w T runnt. Suh
2 runnt onntion is wir w R = g5 g9, shown s ott lin. Unr th prsns of w R, wir w T oms runnt n nw runnis r introu in th iruit suh s wir g 6 g 7. As nxt stp, w R is n runnis w T n g 6 g 7 r rmov s wll s logi tht no longr hs n influn on th primry outputs suh s gts g 6 n g 4, wir g 4 g 8, t. Th nw, simplifi, iruit is shown in Figur 1() whr wir w T hs n rmov n th gt ount hs n ru ling to n optimiz sign. f f g1 g2 g3 g1 g2 g3 g4 g5 g6 () g5 () Trgt Wir g8 g7 g9 g8 O1 O2 Figur 1: Optimiztion through rwiring 3 Dsign Error Dignosis n Corrtion Logi sign rrors my our uring th sign yl of VLSI hip whn th signr hs to just mnully th ntlists gnrt y synthsis tools in orr to stisfy spifi sign gols. Dsign rrors r funtionl mismths twn th spifition n th gt lvl sription. Exprimntl t hs shown tht th ntur of th sign rrors usully involvs th funtionl mishvior of som gt lmnt(s) n/or som intronntion rror(s). Th vrg numr of sign rrors is 2. Most of th litrtur, inluing our work in th fil [12] [13], uss sign rror (orrtion) mol, i.. smll prtrmin st of possil rror typs, propos y Air t l. [1]. This mol ontins tn iffrnt typs of possil sign rrors suh s missing invrtr, xtr invrtr, gt rplmnt, xtr gt, g9 O1 O2 xtr input wir, missing input wir,... t. For xmpl, rmoving w T from th iruit in Figur 1() givs missing input wir sign rror. DEDC is th prolm whr givn n rronous sign n spifition w n to intify lins in th sign tht r potntil sours of rror (ignosis) n suggst pproprit moifitions, from th sign rror mol, tht rtify it (orrtion). In [12] [13] w prsnt run-tim ffiint mtho for multipl DEDC. Th input to th lgorithm is n rronous sign n its spifition. Th output of th lgorithm is list of ll pplil orrtions tht rtify th sign from th sign rror mol n th tst vtor st tht it is us. Sin thr my mor thn on wy to synthsiz prtiulr funtion, thr my quivlnt orrtions, long with th tul on, tht rtify th sign. Th xistn of quivlnt orrtions is of prmount importn for th potntil of th propos optimiztion mtho. With rspt to th xmpl in Figur 1(), rmoving trgt wir w T n running th DEDC lgorithm sri in [12] [13], it rturns onntion g 5 g 9, mong othrs, in th list of quivlnt orrtions. 3.1 Th Signl Error Cs In this sustion w rviw our DEDC [12] [13] mthoology for singl sign rrors s it will us for th optimiztion pross sri in stion 4. Dignosis uss th pth tr prour, lin mrking lgorithm vlop for fult ignosis y Vnktrmn t l. [14] [15] tht is s on th ritil pth tring lgorithm [2]. In til, lt iruit C orrupt with sign rror n input tst vtor v with filing primry output rspons(s) for C. Pth tr [14] [15] strts from n rronous primry output n trs kwrs towr th primry inputs mrking lins s follows: if th output of gt hs n mrk n hs on or mor fn in(s) with ontrolling vlus thn th prour rnomly mrks ny on ontrolling fn in; if hs ll fn ins with non ontrolling inputs, thn ll fn ins r mrk; if rnh is mrk, thn th lgorithm utomtilly mrks th stm of th rnh. For xmpl, onsir th iruit of Fig. 2 with primry outputs O 1 n O 2. If O 1 hs n mrk y pth tr, it n pro y mrking st of lins S 1 = {O 1, 4, 3, B 1, I 2 }. If pth tr gins from O 2, st of lins S 2 = {O 2, B 4, 2, B 2, I 2 } r mrk. It n shown [12] [13], tht givn n rronous iruit C n st of input tst vtors v 1, v 2,..., v k h of thm filing primry output rsponss for C, vry lin tht my ontin sign rror is gurnt to in th intrstion of th lins mrk y istint pth-tr runs for iffrnt rronous primry outputs
3 1 I1 3 I2 I3 1 B1 B2 2 B3 B4 4 O1 Figur 2: Singl sign rror ignosis n orrtion n vtors v j, j = 1,..., k. Agin, onsir th iruit of Fig. 2 n ssum tht thr is n invrtr missing on lin I 2. In suh s, input vtor (1,, 1) prous rronous rsponss t oth primry outputs O 1 n O 2 n vry lin with sign rror longs in th intrstion of th st of lins S 1 n S 2 mrk y pth tr, nmly S 1 S2 = {I 2 }. To ompil list of nit rror sits uring ignosis, w simply run pth-tr for th vtors v 1, v 2,..., v k n iffrnt filing primry outputs n w rturn th intrstion of th lins mrk t vry istint run of th prour. For rror orrtion, th lgorithm xhustivly ompils list of ll possil orrtions for vry nit tht qulifi ignosis. In til, for vry nit rror lin l it pplis ll moifitions of th mol of Air t l. [1], on t tim, on th gt riving l n kps th orrtion if n only if it givs omplmnt logi vlus for vry vtor v j, j = 1,..., k t th output of th gt. 4 Dsign Optimiztion Bs on Dignosis Thniqus A losr viw of th two prolms sri ov shows tht th prour of rwiring n viw from DEDC prsptiv s follows. Suppos tht trgt wir w T ns to rmov. Inst of ttmpting to fin runnt onntion tht mks w T runnt, w n tully rmov th trgt wir n rtifiilly introu sign rror. Unlik DEDC whr th lotion of th sign rror is unknown n tst vtor gnrtion (in th gnrl s) is iffiult prolm [1] [3] [13], in th sitution sri ov, th lotion of th rror is known n w n riv input tst vtors with PODEM-lik prour [5] to tt it. Ths vtors n us to run DEDC lgorithm n otin st of orrtions tht rtify th sign. Susquntly, th lgorithm slts n pproprit orrtion tht stisfis th optimiztion ritri from th list of quivlnt orrtions n simultion-s vrifition of th finl O2 sign is prform. It shoul not tht in th DEDC ontxt, vrifition, long with tst vtor gnrtion, of th finl sign with th us of tst vtor simultion is hr prolm [1] [3] [13]. In til, it is thortilly [1] n xprimntlly [3] [13] provn tht unlss xhustiv tst vtor simultion is prform, whih is prtilly unrlisti for most ommril signs, logi vrifir is rquir t th k-n of DEDC mtho to gurnt th qulity of th propos orrtions. Howvr, this is not prtil for DEDCs optimiztion lgorithm tht itrts for signifintly lrg numr of trgt logi n forml vrifir t th k-n of h itrtion will gr th ovrll prformn signifintly. To llvit this prolm w vlop run-tim/mmory ffiint ATP-s thniqus tht gurnt th orrtnss of th finl sign. Ths thniqus r sri in sustion 4.1. In sns, th optimiztion prour sri ov (rmov/ logi) works in th opposit irtion from wht xisting ATP/simultion-s optimiztion thniqus o (/rmov logi). Howvr, whn oprting in this nw irtion, our pproh hs th potntil to l to grtr optimiztion gins sin, s illustrt in th xmpl of sustion 4.2, it n rturn logi trnsformtions ( orrtions ) tht r not nssrily runnt in th prsns of th trgt wir ( sign rror ) w T. 4.1 Mtho Ovrviw Th propos optimiztion mtho ompriss of four min stps: (1) introu sign rror y rmoving th trgt logi, (2) riv tst vtors for this sign rror, (3) us DEDC lgorithm to srh for orrtion tht rtifis th sign, n (4) vrify th orrtnss of th finl sign. All four stps r s on th rsults of n ATP-lik lgorithm. In th prgrphs tht follow w isuss th implmnttion of th iffrnt stps of our mtho. During this isussion, w ssum tht non-runnt trgt wir w T is fn-in to gt T n T is th nm of tht gt whn w T is rmov. W lso ssum tht A is gt whr w n fn-in wir w A, rsulting in gt A. As xplin rlir, th first stp of th lgorithm rtifiilly introus sign rror in th iruit y rmoving trgt wir w T. Nxt, 2-input multiplxr is in th iruit with fn-ins th outputs of gts T n T. To riv vtors tht tt th sign rror w run PODEM-lik [5] prour for S stukt 1 or, whr S is th slt lin of th multiplxr. Eh of th vtors rturn y th ATP lgorithm will lso vtor tht istinguishs twn th ol (orrt) n nw (rronous) iruit.
4 To implmnt th thir stp of our mtho w run th simultion-s DEDC lgorithm outlin in sustion 3.1. Th input to this lgorithm is th orrt n rronous iruit long with th tst vtors riv in stp (2). Th output of this lgorithm is list of ll (tul n quivlnt) orrtions tht rtify th sign for ll th tst vtors rturn y th ATP tool. Missing input wir w A is ontin in this list of quivlnt orrtions. 3 4 () () () () S M U 2 S M U S M U 1 2 () Figur 3: A Ciruit with OR gts () Originl Dsign () Driving Tst Vtors () Ciruit Corrtnss () Finl Dsign () Inorrt Dsign As lst stp, w n to vrify th orrtnss of th finl sign whn w A is n w T is rmov. To prform this vrifition stp, w tth son 2-input multiplxr to th fn-outs of A n A with th sm slt lin S n run th PODEM-lik [5] prour for S stuk-t 1 or. It is lr tht if th prour rturns with non-mpty tst-vtor st it inits tht th nw iruit (w T rmov, w A ) is inorrt. Howvr, if th prour rturns with filur, i.. nnot fin vtors for th stuk-t fult, thn w gurnt th orrtnss of th nw sign. 4.2 Exmpl In this stion w giv n xmpl to illustrt th stps of th lgorithm sri in sustion 4.1. This xmpl lso inits th potntil of our pproh ompr to prvious runny ition/rmovl logi optimiztion mthos. With rspt to th iruit in Fig. 3() ssum tht w T =, tht is, fn-in of gt T = 1, ns to rmov. During first two stps of th lgorithm, gt T = 3 is introu whr w T is rmov long with multiplxr MU tht fn-ins th outputs of 1 n 3 n hs slt lin S, s shown in Fig. 3(). As xplin in th prvious sustion, input tst vtors tht tt th fult S stuk-t 1 or r lso vtors tht giv rronous primry output rsponss whn w T is rmov from th iruit in Fig. 3(). Without loss of gnrlity, w ssum tht th ATP tool rturns with vtor V = (,,,, ) = (1, v, v, v, v), whr v inits som wll-fin vlu ( or 1). During th thir stp of our lgorithm, DEDC [12] [13] is prform. Th input to th DEDC lgorithm is th originl iruit (Fig. 3()), th rronous on (Fig. 3() with w T rmov) n vtor st V. Th DEDC lgorithm rturns with th tul rror (missing input wir to 1 ) n quivlnt orrtion missing input wir w A = fn-in to 2. To vrify th orrtnss of th finl sign whn trgt logi w T is rmov n th quivlnt orrtion is ppli, stp (4) rquirs th ition of gt 4 n son multiplxr with th sm slt lin S s th first on tht fn-ins 2 n 4, s shown in Fig. 3(). A PODEM-lik [5] prour for fult S stuk-t 1 or rturns with filur, initing tht th fult is runnt. Thrfor, th iruits in Fig. 3() n Fig. 3() implmnt th sm funtion t th primry output n th orrtion qulifis. Not, tht th solution rturn y th propos mtho nnot foun y runny ition/rmovl optimiztion prour, s monstrt in Fig. 3(). It is lr tht wir w A is not runnt in prsns of w T n our solution woul
5 Tl 1: Exprimntl Rsults kt # of primry # of # w A # w A suss mx. # of vrg nm inputs/outputs lins sm gt iff. gt rtio w A rturn CPU tim C432 36/ % C88 6/ % C499 41/ % C / % C198 33/ % C / % C / % C / % not onsir y xisting singl runny ition/rmovl mthos. 5 Exprimnts W implmnt our lgorithm in C lngug n rn it on n Ultr 5 Spr worksttion for th ISCAS 85 nhmrk iruits. W rn 2 xprimnts for h iruit. During h xprimnt w rnomly pik n lt n input wir to gt n w ount th numr of ltrnt wirs tht n orrt th sign. In th s tht th gt originlly h 2 fn-ins w rpl th AND/OR (NAND/NOR) gt with BUFFER (NOT). Th vrg vlus of th rsults of our xprimnts r rport in Tl 1. All run tims r in sons. Th first thr olumns of Tl 1 ontin iruit hrtristis, i.. th nm, numr of primry inputs/outputs n th numr of intrnl lins for h iruit. In h of our xprimnts, w first rnomly pik th trgt wir w T whih is fn-in to gt T n run th lgorithm sri in sustion 4.1 to fin ltrnt wirs w A tht n fn-in to gt A n orrt th sign. In th ontxt of DEDC [12, 13], w rnomly slt n lt wir, introuing sign rror in th sign, n thn w ttmpt to fin quivlnt missing input wir orrtions. W ivi th orrtions w fin in two istint fmilis, th ons tht fn-in to th originl gt ( T = A ) n th ons tht fn-in to iffrnt gt ( T A ). Th vrg numr of wirs tht fn-in to th sm gt n foun in olumn 4 of Tl 1 whil th vrg numr of wirs tht fn-in to iffrnt gt is ontin in olumn 5. Ths numrs r th vrg vlus ovr th numr xprimnts whr our lgorithm rturn with non-mpty numr of quivlnt orrtions (lq 2). Th numr of tims tht our pproh oul not fin ltrnt wirs to orrt th sign is ontin in olumn 6. It is mong our futur rsrh plns to vlop fmily of mor omplx logi trnsformtions, suh s ing multipl input wirs n/or gts, to prform orrtion whn singl wir ition is not suffiint to rtify th sign. In olumn 7 w prsnt th mximum numr of ltrnt wirs tht our pproh rturn throughout ths 2 xprimnts for h iruit n th lst olumn ontins th ovrll run tim to fin ll quivlnt orrtions. 6 Conlusions W prsnt novl ATP-s logi optimiztion mthoology. Our mthoology trgts wir tht violts som optimiztion onstrints n ttmpts to fin ltrnt onntions with th us of xisting sign rror ignosis n orrtion prours. W lso propos ffiint thniqus to gurnt th orrtnss of th finl sign n w prov, with th us of n xmpl, tht th propos mtho xhiits itionl potntil for optimiztion gins whn ompr to xisting singl wir runny ition/rmovl prour. This is lso onfirm y our xprimntl rsults. In th futur, w intn to vlop n pply fmily of mor omplx logi trnsformtions uring th orrtion stg. It is lso mong our futur rsrh plns to vlut th prformn of our mtho on iruits wr th gts hv n ompos, s sri in [8], n for iffrnt optimiztion gols suh s powr n ly. Rfrns [1] M. S. Air, J. Frguson n T. E. Kirkln, Logi Vrifition Vi Tst nrtion, in IEEE Trns. on Computr Ai Dsign, vol. 7, pp , Jnury [2] M. Armovii, P. R. Mnon n D. T. Millr, Critil pth tring: n ltrntiv to fult simultion, in IEEE Dsign n Tst of Computrs, vol. 1, pp , Frury 1984.
6 [3] H. A. As, n J. Hys, Dsign vrifition vi simultion n utomti tst pttrn gnrtion, in Pro. IEEE/ACM Int l Conf. on Computr Ai Dsign, pp , [4] R. E. Brynt, rph s lgorithms for Booln funtion mnipultion, in IEEE Trns. on Computrs, vol. C 35, no. 8, pp , [5] P. ol, An Impliit Enumrtion Algorithm to nrt Tst for Comintionl Ciruits, in IEEE Trns. on Computrs, vol. C-3, pp , Mrh [6] S. C. Chng, K. T. Chng, N. S.Woo, n M. M.- Sowsk, Lyout Drivn Logi Synthsis for FP- As, in Pro. of ACM/IEEE Dsign Automtion Confrn, pp , [7] S. C. Chng n M. Mrk-Sowsk, Prtur n Simplify:Multi-Lvl Booln Ntwork Optimizr, in Pro. Int l Conf. on Computr-Ai Dsign, pp. 2-5, [8] S. C. Chng, J. C. Chung, n Z. Z. Wu, Synthsis for Multipl Input Wirs Rplmnt of t for Wiring Consirtion, in Int l Conf. on Computr Ai Dsign, pp , [9] L. A. Entrn, n K. T. Chng, Comintionl n Squntil Logi Optimiztion y Runny Aition n Rmovl, in IEEE Trns. on Computr Ai Dsign of Intgrt Ciruits n Systms, vol.14, no.7, pp , July [1] R. C-Y. Hung, Y. Wng, n K. T. Chng, Lir A Lir-Inpnnt Frmwork for Post- Lyout Prformn Optimiztion, in Pro. Int l Symp. on Physil Dsign, pp , [11] M. Chttrj, D. Prhm, n W. Kunz, LOT: Logi Optimiztion with Tstility Nw Trnsformtions Using Rursiv Lrning, in Int l Conf. on Computr Ai Dsign, pp , [12] A. Vnris, S.Vnktrmn, I. N. Hjj n W. K. Fuhs, Multipl sign rror ignosis n orrtion in igitl VLSI iruits, in Pro. of IEEE VLSI Tst Symp., pp , [13] A. Vnris, n I. N. Hjj, Dsign Error Dignosis n Corrtion Vi Tst Vtor Simultion, in IEEE Trns. on Computr Ai Dsign,vol. 18, no. 12, pp , Dmr [14] S. Vnktrmn, I. Hrtnto n W. K. Fuhs, Dynmi ignosis of squntil iruits s on stuk t fults, in Pro. of th VLSI Tst Symp., pp , [15] S. Vnktrmn n W. K. Fuhs, A utiv thniqu for ignosis of riging fults, in Pro. IEEE/ACM Int l Conf. on Computr Ai Dsign, pp , [16] Q. Wng, n S. B. K. Vruhul, Multi Lvl Optimiztion for Low Powr Using Lol Logi Trnsformtions, in Pro. ACM/IEEE Dsign Automtion Confrn, pp , 1996.
Present state Next state Q + M N
Qustion 1. An M-N lip-lop works s ollows: I MN=00, th nxt stt o th lip lop is 0. I MN=01, th nxt stt o th lip-lop is th sm s th prsnt stt I MN=10, th nxt stt o th lip-lop is th omplmnt o th prsnt stt I
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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 information35 th Design Automation Conference Copyright 1998 ACM
Eint Booln ivision n Sustitution Shih-Chih Chng vi Ihsin Chng pt. o CS n IE Ntionl Chung Chng Univrsit Ultim Intronnt Th. Chi-Yi, TAIWAN, ROC Sunnvl, CA 94086 Astrt Booln ivision, n hn Booln sustitution,
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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 informationtemporally share the same FPGA Large circuit PI s micro-cycle one user cycle PO s
Ciruit Prtitioning for Dynmilly Rongurl FPGAs Huiqun Liu n D. F. Wong Dprtmnt of Computr Sins Unirsity of Txs t Austin Austin, T 787 Emil: fhqliu, wongg@s.utxs.u Astrt Dynmilly rongurl FPGAs h th potntil
More informationReducing the Depth of Quantum Circuits Using Additional Circuit Lines
Ruing th Dpth of Quntum Ciruits Using Aitionl Ciruit Lins Nil Assi 1, Rort Will 1,2, Mthis Sokn 1,2, n Rolf Drhslr 1,2 1 Institut of Computr Sin, Univrsity of Brmn Group of Computr Arhittur, D-28359 Brmn,
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 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 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 informationExact Template Matching Using Boolean Satisfiability
2013 IEEE 43r Intrntionl Symposium on Multipl-Vlu Logi Ext Tmplt Mthing Using Booln Stisfiility Nil Assi Mthis Sokn Rort Will Rolf Drhslr Institut of Computr Sin, Univrsity of Brmn, 28359 Brmn, Grmny Cyr-Physil
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 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 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 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 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 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 informationClustering for Processing Rate Optimization
Clustring for Prossing Rt Optimiztion Chun Lin, Ji Wng, n Hi Zhou Eltril n Computr Enginring Northwstrn Univrsity Evnston, IL 60208 Astrt Clustring (or prtitioning) is ruil stp twn logi synthsis n physil
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 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 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 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 informationMultiple Faults: Modeling, Simulation and Test Λ
Multipl Fults: Modling, Simultion nd Tst Λ Yong hng Kim y Vishwni. grwl Kwl K. Sluj Univrsity of Wisonsin-Mdison gr Systms Univrsity of Wisonsin-Mdison Mdison, WI 53706 US Murry Hill, NJ 07974 US Mdison,
More information5/7/13. Part 10. Graphs. Theorem Theorem Graphs Describing Precedence. Outline. Theorem 10-1: The Handshaking Theorem
Thorm 10-1: Th Hnshkin Thorm Lt G=(V,E) n unirt rph. Thn Prt 10. Grphs CS 200 Alorithms n Dt Struturs v V (v) = 2 E How mny s r thr in rph with 10 vrtis h of r six? 10 * 6 /2= 30 1 Thorm 10-2 An unirt
More informationMulti-Way VLSI Circuit Partitioning Based on Dual Net Representation
Multi-Wy VLSI Ciruit Prtitioning Bs on Dul Nt Rprsnttion Json Cong Dprtmnt of Computr Sin Univrsity of Cliforni, Los Angls, CA 90024 Wilurt Lio n Nrynn Shivkumr Dprtmnt of Computr Sin Stnfor Univrsity,
More informationPartitioning Algorithms. UCLA Department of Computer Science, Los Angeles, CA y Cadence Design Systems, Inc., San Jose, CA 95134
On Implmnttion Chois for Itrtiv Improvmnt Prtitioning Algorithms Lrs W. Hgn y, Dnnis J.-H. Hung n Anrw B. Khng UCLA Dprtmnt of Computr Sin, Los Angls, CA 90024-1596 y Cn Dsign Systms, In., Sn Jos, CA 95134
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 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 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 informationClustering Techniques for Coarse-grained, Antifuse-based FPGAs
Clustring Thniqus or Cors-grin, Antius-s FPGAs Chng-woo Kng n Mssou Prm Astrt In this ppr, w prsnt r n prormn-rivn lustring thniqus or ors-grin, ntius-s FPGAs. A mro logi ll in this lss o FPGAs hs multipl
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 informationLogic Redundancy Identication. September 14, target specic faults and are sometimes referred to as. \fault-independent methods.
Fix-Vlu n Stm Unosrvility Thorms or Loi Runny Intition Sptmr 14, 2003 Astrt { Thr is lss o implition-s mthos tht intiy loi runny rom iruit topoloy n without ny primry input ssinmnt. Ths mthos r lss omplx
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 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 informationSEE PAGE 2 FOR BRUSH MOTOR WIRING SEE PAGE 3 FOR MANUFACTURER SPECIFIC BLDC MOTOR WIRING EXAMPLES EZ SERVO EZSV17 WIRING DIAGRAM FOR BLDC MOTOR
0V TO 0V SUPPLY GROUN +0V TO +0V RS85 ONVRTR 9 TO OM PORT ON P TO P OM PORT US 9600 U 8IT, NO PRITY, STOP, NO FLOW TRL. OPTO SNSOR # GROUN +0V TO +0V GROUN RS85 RS85 OPTO SNSOR # PHOTO TRNSISTOR TO OTHR
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 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 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 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 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 informationRegister Allocation. How to assign variables to finitely many registers? What to do when it can t be done? How to do so efficiently?
Rgistr Allotion Rgistr Allotion How to ssign vrils to initly mny rgistrs? Wht to o whn it n t on? How to o so iintly? Mony, Jun 3, 13 Mmory Wll Disprity twn CPU sp n mmory ss sp improvmnt Mony, Jun 3,
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 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 informationJournal of Solid Mechanics and Materials Engineering
n Mtrils Enginring Strss ntnsit tor of n ntrf Crk in Bon Plt unr Uni-Axil Tnsion No-Aki NODA, Yu ZHANG, Xin LAN, Ysushi TAKASE n Kzuhiro ODA Dprtmnt of Mhnil n Control Enginring, Kushu nstitut of Thnolog,
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 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 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 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 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 informationMULTIPLE-LEVEL LOGIC OPTIMIZATION II
MUTIPE-EVE OGIC OPTIMIZATION II Booln mthos Eploit Booln proprtis Giovnni D Mihli Don t r onitions Stnfor Univrsit Minimition of th lol funtions Slowr lgorithms, ttr qulit rsults Etrnl on t r onitions
More informationA comparison of routing sets for robust network design
A omprison of routing sts for roust ntwork sign Mihl Poss Astrt Dsigning ntwork l to rout st of non-simultnous mn vtors is n importnt prolm rising in tlommunitions. Th prolm n sn two-stg roust progrm whr
More informationarxiv: v1 [cs.ds] 20 Feb 2008
Symposium on Thortil Aspts of Computr Sin 2008 (Borux), pp. 361-372 www.sts-onf.org rxiv:0802.2867v1 [s.ds] 20 F 2008 FIXED PARAMETER POLYNOMIAL TIME ALGORITHMS FOR MAXIMUM AGREEMENT AND COMPATIBLE SUPERTREES
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 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 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 informationWORKSHOP 6 BRIDGE TRUSS
WORKSHOP 6 BRIDGE TRUSS WS6-2 Workshop Ojtivs Lrn to msh lin gomtry to gnrt CBAR lmnts Bom fmilir with stting up th CBAR orinttion vtor n stion proprtis Lrn to st up multipl lo ss Lrn to viw th iffrnt
More informationSEE PAGE 2 FOR BRUSH MOTOR WIRING SEE PAGE 3 FOR MANUFACTURER SPECIFIC BLDC MOTOR WIRING EXAMPLES A
7V TO 0V SUPPLY +7V TO +0V RS85 ONVRTR TO P OM PORT OR US US 9600 U 8IT, NO PRITY, STOP, NO FLOW TRL. 9 TO OM PORT ON P TO OTHR Z SRVOS OR Z STPPRS OPTO SNSOR # OPTO SNSOR # PHOTO TRNSISTOR OPTO SNSOR
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 informationGreedy Algorithms, Activity Selection, Minimum Spanning Trees Scribes: Logan Short (2015), Virginia Date: May 18, 2016
Ltur 4 Gry Algorithms, Ativity Sltion, Minimum Spnning Trs Sris: Logn Short (5), Virgini Dt: My, Gry Algorithms Suppos w wnt to solv prolm, n w r l to om up with som rursiv ormultion o th prolm tht woul
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 information