An Approach to Load Balancing & Unity Power Factor Control in Multi-phase (Six-phase) Load Circuits Using Multi-phase DSTATCOM

Size: px
Start display at page:

Download "An Approach to Load Balancing & Unity Power Factor Control in Multi-phase (Six-phase) Load Circuits Using Multi-phase DSTATCOM"

Transcription

1 An Approh to o Blnng & Unty Powr Ftor Control n Mult-phs (Sx-phs) o Cruts Usng Mult-phs DSTATCOM Zkr Hun, Mmr, IAENG Astrt Mult-phs los, wth phss mor thn thr, splly n orm o nrtr nuton motor rs sut to hgh powr n splz ppltons, r rng growng ttnton n th ltrtur. Ths multphs sour or suh r pplton my r rom trnsormr onnton (3 phs to 6 phs) or y DC lnk sx phs nrtrs. Ths sours wll th prolm o unln, hrmon storton n poor powr tor oprton. In w o ths lopmnts, ths ppr ls wth th supply s lo lnng n powr tor orrton n suh lo ruts. Th propos ompnton shm uss th shunt urrnt sour ompnton whos nstntnous lus r trmn y th nstntnous symmtrl omponnt thory. An l ompntor n pl o physl rlzton o th ompntor hs n propos n th orm o urrnt ontroll oltg sour nrtr. Th ompnton shm lop n th ppr s tst or thr lty on 6-phs ( 6-wr & 7-wr) ruts through xtns smultons or unln long, phs outgs, n non lnr long. Th smulton rsults o th ompnton thory n th l ompntor ry th ompnton mtho. Inx Trms o lnng, Powr tor orrton, Compntor, Sx-phs DSTATCOM, Mult-phs I. INTODUCTION UE to th potntl nts rsultng rom th us o Dphs orr hghr thn thr n trnsmsson, multphs (phs orr mor thn thr) mhn rs r gnng growng ttnton [-3] n rnt yrs, u to thr srl nhrnt nts suh s ru torqu pulton, hrmon ontnt, urrnt pr phs wthout nrsng th oltg pr phs, hghr rllty n nrs powr n th m rm s ompr to thr thr phs ountrprt. Mult-phs nrtr nuton motor rs h n oun to qut promsng or hgh powr rtngs n othr splz ppltons. Th us o suh rs n s prsnt mult-phs lo ruts tht my gt sujt to phs outgs, unln s wll s non-lnr longs smlr to thr thr phs ountr prts. Suh ontons my l to rty o unsrl ts on th supply systm suh s tonl losss n onntng lns n ntrng s, oslltory torqus n mhns, nrs rppl n rtrs, mluntonng n snst qupmnts, hrmon n xss nutrl urrnts t. It s thror sr to h th ln Zkr Hun s wth th Dprtmnt o Eltrl Engnrng, Ntonl Insttut o Thnology Hmrpur (H.P), In (phon: ; x: ; -ml: zhun@ yhoo.om). powr systm oprton wth mnmum lowr orr hrmons n n th prsn o suh oprtons. A urrnt ltrtur sury rls tht numr o mthos h n ol or th ompnton o hrmons n unlns [-] or th onntonl thr phs systms. Th mjorty o th mthos r s on th nstntnous rt powr thory [-8], thory o symmtrl omponnts [6-9], n rrn rm thory [-]. Utlzng ths thortl onpts, thnqus h n lop or lnng thr phs lo [6-7], powr tor orrton [7-8], oltg rgulton [-9] n mtng othr ojts. Ths ppr rsss th prolm o lnng n unln mult-phs lo n powr tor orrton on supply s. It s to not tht t powr ompnton rqurs sour, whh n supply th rl powr to lo. Thortlly lthough possl, ut prtlly powr sour t lo ntr rqurs strut gnrton sours. Ths ppr ssums onntonl powr systm wth ntrl gnrtng stton n thror t powr ompnton s not onsr. Th rt powr ompnton n h y rous Powr ontonng s lk DSTATCOM rlzng rl ptor or nutor wth th lo rut. Th mount o ompnton n th m o ompnton th ontrol strtgy o th powr ontonr. Th rt powr ompnton rqurs th msurmnt o rt powr o th lo rut. Altrntly, n nrt mtho suh s urrnt qulzton or phs onstrnt n mploy to rlz th sr ompnton or th lo ruts. A nw ompnton thnqu hs n propos usng th nstntnous symmtrl omponnts n [-3]. Th propos thnqu ompnts or th rt powr wthout sp msurmnt o rt powr n n ltrnt wy,.. trmnng th rrn urrnt o th shunt urrnt sour ompnt systm y nstntnous symmtrl omponnt. Ths ppr prsnts th shm or ompnton or 6-phs (6-wr & 7-wr) str onnt lo ompnton. Th propos ompnton shm hs n support y smulton o n l swth s ompntor. II. MUTIPHASE COMPENSATO A. Compnton Prnpl Th s ompnton shm or mult-phs (6- phs) lo suppl rom ln st mult-phs

2 sour s shown n Fg. A ompntor rprsnt s urrnt sour onnt n prlll to th lo t th no ll Pont o Common Couplng (PCC) s sgn to supply th rt powr rqur y th lo, whrs th t powr s suppl rom th sour. N s s s s s s s s s s n' Fg. A Conptul Sx-phs, 7- wr ompnton shm l l l l l l o A o B o C o D o E o F Sngl-phs mpnn los onnt n str ormton n rprsnt gnrl sx-phs lo or multphs lo. Th thr nos o th rut rprsnt grphlly n Fg. y n, N n n rprsnt nos t lo, sour n ompntng urrnt sours rsptly. Th no N my thr lotng or onnt wth lo pont n s pr th rqurmnt o th sour n th lo. Conntng n wth n orms lol loop o th ompntor urrnt sours n lo rut. Ths rsults phs ws n npnnt oprton o ompntor rom th supply oltg sours. As onsqun, unln oprton o th ompntor n h,.. th sum o th ompntor rrn urrnts,,, n not zro. Thror, h phs o th ompntor n supply urrnt npnnt to othr phss. B. A Sx-phs Symmtrl Componnt Thory t n unln sx phs nstntnous lo urrnts not y,,,,, n whrs th orrsponng sts o sx ln symmtrl omponnts r rprsnt y,,, 3,, n 5. Th powr nrnt nstntnous symmtrl omponnts o ths urrnts r gn y (). 3 5 = Whr xp ( j / 6 ). All th sx omponnts r grphlly rprsnt n Fg.. () n I 5 I 5 I 5 I 5 I 5 I 5 I 5 I 5 I I I I I I I 3 I 3 () () () I 5 I 5 I 5 I 5 I I I I () () () Fg. Squn omponnts o sx-phs sour () Frst-squn () Son-squn () Thr -squn () Fourth-squn () Fthsqun () Sxth- squn omponnt. Th rst-(post) squn omponnt systm onssts o sx phsors spl 6 rlt to h othr whrs th son-squn omponnt systm onssts o thr phsor spl rlt to h othr, h phsor rprsntng two phss- onsttutng two thr-phs suprmpos post squns. Th thr-squn omponnt systm hs two phsors spl 8 rlt to h othr, h rprsntng thr phss onsttutng two thr-phs zro squns n opposton whrs th ourth- squn omponnt systm s squn n th oppost sns o rotton to tht o th son-squn systm. Smlrly, th th-(ngt) squn omponnt systm s squn o phsors n th oppost sns o rotton to tht o th rst-squn systm. Th sxth squn omponnt lso known s zro squn omponnts hs ll th sx phsors pl t zro gr prt to h othr. It s to not tht th nstntnous tor prs, 5 n, 6 r omplx onjugt prs whrs n 3 r rl quntts, whh s zro, mns urrnts r ln. C Drton o rn Currnts Th m o th ompntor s to mk th sour urrnt ln n oprts t sr powr tor. As rlr, th mount o th shunt urrnt rqur to mk th sour urrnt ln n prsn o unln lo, s rrr s th rrn urrnt. Thr r sx ompntng urrnt n thror sx lnrly npnnt smultnous quton n to ormult n sol. As known rom th symmtrl omponnt thory, ln systm o urrnt, th zro squn omponnts wll h zro summton lu. Aorngly, to pro ln sour urrnts, th zro squn omponnts togthr must zro.. () s s s s s Th gr o ompnton rqur or systm s y shr o th rt powr suppl y th lo wth rspt to mount o rt powr suppl y th ompntor. In most l stuton, th ompntor my rqur to ompnt ompltly th lo rt powr. Howr, ths rqurs lrg sz o ompntng I I I 3 I 3 I 3 I 3 I I I I I I

3 , wstng ompltly th plty o th sour to supply th rt powr. Thror, ll th prt ompntors r xpt to prtlly ompnt. t th sr th powr tor ngl twn n (post squn omponnts), thn th ollowng quton must hol tru. ( ( s s 5 s s s s ) 5 ) s For ln oprton, ll squn omponnts xpt post squn wll zro. For ln rut, th ollowng hols tru. s, s s, s s () t th nstntnous rl powr o th lo gn y ss ss ss s s = p l. (5) / 3 Solng (3), y tkng j w otn / ( A B ) (6) whr, A n B Tkng tngnt on oth ss o (6) n solng togthr () to (6) or s s (3) (,, ); ll th sour urrnts, n th ln oprton o th powr systm, n xpltly n n trms o th othr rls. Phs urrnt s shown n (7) s n xmpl. s s p l (7) Whr, tn n = s s 3 It s to not tht th lult sour urrnts r or ln oprton o n unln lo. I th ompntor s sgn n suh wy tht th unln omponnt o th lo urrnts s suppl y th ompntor n ln omponnt rom th sour, KC t no pont o ommon ouplng (PCC) wll g th rrn urrnt or ompntor (8) to (3) s s pl l (8) s s p l l (9) s s pl l () l l l s s s s s s p p p l l l () () (3) For prtl rlzton o th ompntor, urrnt ontroll oltg sour nrtr n us or th urrnt sour wth th rrn urrnt, r o, trkng. In nxt ston, n l swth n o s ompntor hs n propos or sx-phs lo. III. A SIX-PASE COMPENSATION EAIZATION Currnt ontroll oltg sour nrtr n o prtl rlzton o th ompntor. Usng ths prnpl, n l swth s ompntor s propos. t t ll s sx-phs DSTATCOM s ts rut topology s n xtnson o onntonl thr-phs DSTATCOM. Th topologl srpton o th propos sx-phs DSTATCOM, ts rut nlyss n mthoology o smulton or rton r rly suss s ollows A. Topology o Sx-Phs DSTATCOM Th topology o th propos sx-phs DSTATCOM hs n r rom ts thr-phs ountrprt whr n nrtr rut s mploy wth sl-hrg ptor s DC sour n unln lo rut onnt t PCC s lo to th nrtr. Th propos sx-phs ompntor onssts o sx rms o sngl-phs H- nrtr ruts s shown n Fg.3 wth splt ptor or prong th nutrl pont n o th ompntor. N s s s s s S h h h S h s s s s s s To Error Amplr Choppr V n' V V +V St rn l l l l l l o Z A o Z B o Z C o Z D o Z E o Z F S S S S S S S S S S S S Error Amplr To swth S h n S h o Choppr PI Controllr Fg. 3. Sx-phs 7-wr struton Systm wth DSTATCOM B. Anlyss o sx-phs DSTATCOM To llustrt th workng o th onrtr, phs - o th sx-phs ompntor shown n Fg.3 hs n nlyz. Th qulnt rut o phs '' wth swth S los s shown n Fg.. Th urrnt through th swth S s th srs urrnt, whh n trmn y pplyng KV or th rut. n' V V S S Fg. Equlnt Crut or Phs '' oprton o th onrtr wth swth S los n

4 Th rsultng quton s gn y () V S V S t () Whr S s swthng unton n y (5) n s omplmnt o th swthng unton S. S swth s on othrws (5) Th sours r ssum to l n th mpn loks shown n Fg. xprss los or h phs. For physl rlzton o th onrtr rut, th loss ourrng n ll th lmnts o th ompntor n onntng nutor or trnsormr must ompnt y xhng o rl powr rom sour to DC s ptor o th DSTATCOM. Thror th rrn urrnts xprss n (8-3) r rpl y tonl loss trm ( P loss ) n th powr. Th mo rson or ompntor urrnt or phs- s gn y (6). * l ( s s ) ( P lg P loss ) (6) B. Mthmtl Molng n Smulton or Sxphs DSTATCOM Smultons h n rr out or th propos sxphs DSTATCOM to lt th propos ompnton shm. Th stt sp qutons hs n wrttn n trms o th swthng untons ( S, S ) o th onrtr n ( S u & Sl ) o hoppr o th DSTATCOM n sol y ung-kutt mtho n MATAB y o5 unton. Th stt sp qutons o th sx-phs ompntor systm r gn n (7-). V V s S S t (7) V V s S S t (8) V V s S S t (9) V V s S S t () V V s S S t () V V s S S t () Th hoppr ynms hs n rlz y wrtng th stt sp qutons or th rut shown n Fg. 3. t n th urrnts n rut o th hoppr (Fg. 3), thn (3) n () rprsnts th rlton o ths n trms o swthng unton n th onrtr urrnts. S * (3) S* S* S* S * S * S * () S * S * S * S * S * Th nl xprssons (5) - (7) n otn y pplyng th prnpl o KC n KV. VC h S * S * S * S * S * S * Su * t C C C C C C C (5) VC h S * S * S * S * S * S * Sl * t C C C C C C C (6) h h V V S u S l t (7) h h Th rls us n th xprssons (5)-(7) r nt n th rut grms. Th ptor oltgs ru not ompnt or th losss n th onntng trnsormr/ nutor, whh n ount y hngng th uty yl o th hoppr. Th hng n uty o th hoppr s s on th hng n th ptor oltg rom th st rrn oltg. Th rn n th ptor oltg n st oltg (.. th rror oltg) s put orwr to proportonl-ntgrl (PI) ontrollr. Th PI ontrollr stmts th P loss omponnt s stt n (6) n trmns th uty yl o th hoppr to mntn th ptor oltg t pr sp st rrn oltg. Th st lus r tkn pproxmtly.3 tms th pk AC oltg o th sour oltg or ompntor to work tstorly. IV. SIMUATION STUDIES Th smulton stuy hs n rr out to lt th propos sx-phs DSTACOM or rous ss o unln longs, n phs outgs. Th rsults n nlyss or h s r suss n th stons to ollow. A. Compnton o unln os Th smulton o th onrtr n ompntor hs n rr wth th ollowng prmtrs. Th oltgs sp ( p,,,,, ) n th mpns Z p ( p,,,,, ) ll n ohm or th sx-phs systm r mploy s ollows. s 35.6sn (t * / 3), whr =,,, 3,, 5 orrsponng to phs,,,,, rsptly. Z 5 j5, Z 5 j, Z j, j5, j5, 3 j3 (8) Z Z Th solton trnsormr prmtrs r s ollows: = n = mh. Th ontrol prmtrs or rgultng th ptor oltg o th hoppr r just hurstlly n r gn n (9). K = K = (9) p Th nrtr urrnt n ptor h oltg hystrss n o M n V rsptly. It s sr tht th sour urrnt ln n th sour oprts t unty powr tor unr ths onton. Th systm s run, wth unln lo or on yl (. s) whh ollows turnng on o th DSTATCOM. Th systm s run wth ompntor or nothr thr yls (.8 s). It n h Z

5 sn rom Fg. 5 () n Fg. 5() tht th lo urrnts r hghly unln n qul whn ompntor s not turn on. Atr. s. whn th ompntor s turn on sour urrnts r prtly ln s shown n Fg. 5 (). In orr to ompnt th unln lo urrnts, th ompntor urrnts om unln orngly s shown n Fg. 5(). Fg. 7 ()-() (:7) sl sour oltgs (sh ln), sour urrnts (sol ln) () rton o ompntor urrnts portryng unty powr tor oprton or 6-phs 7-wr supply systm Fg. 5 Vrton o sour oltgs n lo urrnt, sour n ompntor urrnts or 6-phs 7-wr supply systm. Th D.C. lnk ptor mntns th onstnt oltg through th PI ontrollr. Th oltg rton o nul ptor s shown n Fg. 8. Pls not tht th ptor oltg s ssum to ntlly hrg or prhrg Th thr nstntnous powrs nmly sour; lo n ompntor powrs r shown n Fg. 6 () & (), whl two nutrl urrnts (sour & lo nutrl urrnts) r plott n Fg. 6 (). It n sn tht or ompnton, tht s, whn ompntor s swth o, sour powr n lo powr h th m mgntu n r o oslltng ntur s shown n Fg. 6 (). Ths s u to unln n lo urrnts. But tr ompnton (whn ompntor s turn on) th sour powr ttns sty stt lu s n sn rom Fg. 6 () whl lo powr s oslltng Fg. 6(). Moror, th sour nutrl urrnt ttns zro lu s shown n Fg. 6() whn th ompntor s turn on s t lns th sour urrnts. Ths lso mpls tht th sum o th nstntnous ompntor urrnts s qul to lo nutrl urrnt Fg 8 Cptor oltg rton B. o Compnton or phs outgs Th ntgs o los lk motor n ts pty to oprt Th ntg o multphs los lk motor s n ts plty to oprt wth phs outg. Th motor oprts wth gr prormn n sour ss n unln oprton n thror othr los onnt to suh sour gt t. Th propos ompntor hs n tst wth rous omnton o phs outgs n t hs n oun tht t works tstorly n wth thr phss opn (wth phs outg (,, )) n sx phs sour. Th rsult s shown n Fg. 9 & whr th ntr sour urrnts r ln wth ompntor on. Fg. 6 Vrton o powr n nutrl urrnt or 6-phs 7-wr supply systm Th rton o ophsors-oltg n urrnts shows unty powr tor oprton wth ompntor s t s nt rom Fg.7 It n sn rom (8) tht mpns r unln n h ll rt lmnts xpt on, ut th urrnts r not only ln ut lso oprt t unty powr tor wth ompntor Fg. 9 Vrton o sour oltg & rous urrnts or th phs outg (,, ) o th lo or 6-phs supply systm.

6 Fg. Vrton o powrs n nutrl urrnts or phs phs outg (,, ) o lo or 6-phs supply systm Fg. 5 Vrton o powrs n nutrl urrnts wth non lnr long o 6-phs supply systm Fg. ()-() (:7) Sl sour oltgs (sh ln), sour urrnts (sol ln) & () rton o ompntor urrnts portryng unty powr tor oprton or phs outg (,, ) o th lo or 6- phs supply systm. Fg. 6 ()-() (:8) sl sour oltgs (sol ln), sour urrnts (sh ln) () rton o ompntor urrnts portryng unty powr tor oprton or 6-phs supply systm Fg Cptor oltg rton or phs outg (,, ) o th lo or 6-phs supply systm. C. o Compnton or non-lnr lo Th propos ompnton shm hs lso n tst wth nonlnr longs y smultng rtr lo or h phs rwng onstnt.. urrnt rom h phs. Th smulton rsults r prsnt n Fgs A r summry o osrton s s ollows: Volts Amps Amps Amps ()o urrnts ()Sour urrnts ()Compntor urrnts ()Sour oltgs Tm(s) Fg. Vrton o sour oltg & rous urrnts or 6-phs supply systm V. CONCUSION In ths ppr, th prolm o lo lnng n powr tor orrton t th sour s or mult-phs lo ruts n th nt o lnr unln long, phs outgs n non lnr longs h n rss. For th purpos, mult-phs ompntor (6-phs) h n rlz s mult-phs DSTACOM xtnng th pproh lop or thr phs systm n th ltrtur. Th ynm hor o th ompntor s lso smult urng th lo ompnton pross. An lort stuy hs lso n m on sour oltgs, lo urrnts, sour urrnts, n ompntor urrnts urng nonompntng n ompntng pro. Th ptor oltg rtons n th rton o th lo n sour powrs r lso nlyz. Th rton o th ompntor powr t th tm o ts rs hs n xpln. Th nlyss hs onrm unty powr tor oprton o th sour n ll ss s n y th oltg n urrnt worms. An ntrstng spt o th smulton stuy hs n to osr tht mult-phs systms qupp wth mult-phs ompntor n work wth phs outgs s hgh s 3 n 6- phs systm rsptly wthout ny grton n supply systm qulty - tur most lul or mult-phs sours n multphs nuton motor rs. Th nngs o th prsnt stuy r s on th onsrton o only str onnt, - los, howr, othr omnton n mor rlst mol o mult-phs los my nlyz mployng ths lopmnt.

7 EFEENCES [] E.,. Bojo, F. Proumo, H. A. Tolyt, S Wllmson,"Multphs nuton motor rs- thnology sttus rw, Eltr. Powr Appltons, IET, Vol., Issu, 7 [] D. Yzn, A. Khjhon, G. Joos, Full utlzton o nrtr o splt phs rs y mn o ul thr phs sp tor', IEEE Trns. on Inustrl Eltrons, Vol. 56, No., 9 [3] N. Gul. & M.J. Kmpr."Multphs g rotor nuton mhns r wth rt mplmntton o rush oprton" IEEE Int. Con. on Eltr Mhn n Dr, [] H. Akg,Y. Knzw, K. Fugt n A. N, "Gnrlz thory o nstntnous rt powr n ts pplton," Eltrl Engg. n Jpn, Vol. 3, No., 983 [5] H. Akg, Y. Knzw n A. N, "Instntnous rt powr ompntors omprng swthng s wthout nrgy storg omponnts", Trns. on In.App., ol.a-,no.3,98. [6] H, Akg, A. N n S. Atosh, "Control strtgy o t powr ltrs usng mult oltg-sour PWM onrtr, Trns. on In.App., ol.a-, No.3,986 [7] M. Z. Elk, "Blnng o unln los usng stt r opntor," Eltr..Powr.Syst. s., Vol., 987. [8] H. Wtn,.M. Stphn n M. Ars, "Nw onpts o nstntnous t n rt powrs n ltrl systms wth gnr los," IEEE Trns. On powr Dlry, Vol. 8, No., 993 [9] A. Krn n G. Shror, "A nol pproh to powr tor ontrol n lnng prolms Pro., IECON, 99 [] P. Vrlho, n G.D. Mrqus, "An t powr ltr n unln urrnt ompntor," IEEE Trns. On Inustrl Eltrons, Vol., No. 3,997 [] F. Z. Png, G.W. Ott, Jr., n D.J. Ams, "Hrmon n rt powr ompnton s on th gnrlz nstntnous rt powr thory or thr-phs our-wr systms," IEEE Trns. on Powr Eltros, Vol. 3, No. 6, 998. [] A.Ghosh, A.Josh, A nw pproh to lo lnng n powr tor orrton n powr struton systm, IEEE Trns.on powr lry ol. 5, No.,. [3] Zkr Hun,.K. Sngh, S. N. Twr, Blnng o Unln o Powr Ftor Corrton n Mult-phs (-phs) o Cruts usng DSTATCOM, WCE,, onon, U.K

b.) v d =? Example 2 l = 50 m, D = 1.0 mm, E = 6 V, " = 1.72 #10 $8 % & m, and r = 0.5 % a.) R =? c.) V ab =? a.) R eq =?

b.) v d =? Example 2 l = 50 m, D = 1.0 mm, E = 6 V,  = 1.72 #10 $8 % & m, and r = 0.5 % a.) R =? c.) V ab =? a.) R eq =? xmpl : An 8-gug oppr wr hs nomnl mtr o. mm. Ths wr rrs onstnt urrnt o.67 A to W lmp. Th nsty o r ltrons s 8.5 x 8 ltrons pr u mtr. Fn th mgntu o. th urrnt nsty. th rt vloty xmpl D. mm,.67 A, n N 8.5" 8

More information

CHAPTER 7 THREE-PHASE THREE-LEG THREE-LEVEL NEUTRAL POINT CLAMPED RECTIFIER. 7.1 Introduction

CHAPTER 7 THREE-PHASE THREE-LEG THREE-LEVEL NEUTRAL POINT CLAMPED RECTIFIER. 7.1 Introduction CAPTE 7 TEE-PASE TEE-EG TEE-EE NEUTA PONT CAMPED ECTFE 7. ntrouton Mny nhrnt nft of multll onrtr h l to thr nr ntrt mongt nutry utlt. At rnt, th two mot ommonly u multll toolog r th thr-ll nutrl-ont-lm

More information

Weighted Graphs. Weighted graphs may be either directed or undirected.

Weighted 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 information

5/1/2018. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees

5/1/2018. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees /1/018 W usully no strns y ssnn -lnt os to ll rtrs n t lpt (or mpl, 8-t on n ASCII). Howvr, rnt rtrs our wt rnt rquns, w n sv mmory n ru trnsmttl tm y usn vrl-lnt non. T s to ssn sortr os to rtrs tt our

More information

Speed Control of PFC Quadruple Lift Positive Output Luo Converter fed BLDC Motor Drive

Speed Control of PFC Quadruple Lift Positive Output Luo Converter fed BLDC Motor Drive Intrntonl OPEN ACCESS Journl Of odrn Engnrng srh (IJE) Spd Control of PFC Qudrupl ft Post Output uo Conrtr fd BDC otor Dr K. Srns o 1, G. Stynryn o 2, V.. N. Sstry 3 1 (EEE Dprtmnt, Ss Insttut of Thnology

More information

Platform Controls. 1-1 Joystick Controllers. Boom Up/Down Controller Adjustments

Platform 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 information

Lecture 20: Minimum Spanning Trees (CLRS 23)

Lecture 20: Minimum Spanning Trees (CLRS 23) Ltur 0: Mnmum Spnnn Trs (CLRS 3) Jun, 00 Grps Lst tm w n (wt) rps (unrt/rt) n ntrou s rp voulry (vrtx,, r, pt, onnt omponnts,... ) W lso suss jny lst n jny mtrx rprsntton W wll us jny lst rprsntton unlss

More information

Constructive Geometric Constraint Solving

Constructive Geometric Constraint Solving Construtiv Gomtri Constrint Solving Antoni Soto i Rir Dprtmnt Llngutgs i Sistms Inormàtis Univrsitt Politèni Ctluny Brlon, Sptmr 2002 CGCS p.1/37 Prliminris CGCS p.2/37 Gomtri onstrint prolm C 2 D L BC

More information

Depth First Search. Yufei Tao. Department of Computer Science and Engineering Chinese University of Hong Kong

Depth 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 information

The University of Sydney MATH 2009

The 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 information

CMSC 451: Lecture 4 Bridges and 2-Edge Connectivity Thursday, Sep 7, 2017

CMSC 451: Lecture 4 Bridges and 2-Edge Connectivity Thursday, Sep 7, 2017 Rn: Not ovr n or rns. CMSC 451: Ltr 4 Brs n 2-E Conntvty Trsy, Sp 7, 2017 Hr-Orr Grp Conntvty: (T ollown mtrl ppls only to nrt rps!) Lt G = (V, E) n onnt nrt rp. W otn ssm tt or rps r onnt, t somtms t

More information

SAMPLE CSc 340 EXAM QUESTIONS WITH SOLUTIONS: part 2

SAMPLE CSc 340 EXAM QUESTIONS WITH SOLUTIONS: part 2 AMPLE C EXAM UETION WITH OLUTION: prt. It n sown tt l / wr.7888l. I Φ nots orul or pprotng t vlu o tn t n sown tt t trunton rror o ts pproton s o t or or so onstnts ; tt s Not tt / L Φ L.. Φ.. /. /.. Φ..787.

More information

Improving Union. Implementation. Union-by-size Code. Union-by-Size Find Analysis. Path Compression! Improving Find find(e)

Improving Union. Implementation. Union-by-size Code. Union-by-Size Find Analysis. Path Compression! Improving Find find(e) POW CSE 36: Dt Struturs Top #10 T Dynm (Equvln) Duo: Unon-y-Sz & Pt Comprsson Wk!! Luk MDowll Summr Qurtr 003 M! ZING Wt s Goo Mz? Mz Construton lortm Gvn: ollton o rooms V Conntons twn t rooms (ntlly

More information

Present state Next state Q + M N

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 information

In which direction do compass needles always align? Why?

In 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 information

Spanning Trees. BFS, DFS spanning tree Minimum spanning tree. March 28, 2018 Cinda Heeren / Geoffrey Tien 1

Spanning 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 information

CS September 2018

CS September 2018 Loil los Distriut Systms 06. Loil los Assin squn numrs to msss All ooprtin prosss n r on orr o vnts vs. physil los: rport tim o y Assum no ntrl tim sour Eh systm mintins its own lol lo No totl orrin o

More information

Cycles and Simple Cycles. Paths and Simple Paths. Trees. Problem: There is No Completely Standard Terminology!

Cycles and Simple Cycles. Paths and Simple Paths. Trees. Problem: There is No Completely Standard Terminology! Outlin Computr Sin 331, Spnnin, n Surphs Mik Joson Dprtmnt o Computr Sin Univrsity o Clry Ltur #30 1 Introution 2 3 Dinition 4 Spnnin 5 6 Mik Joson (Univrsity o Clry) Computr Sin 331 Ltur #30 1 / 20 Mik

More information

Divided. diamonds. Mimic the look of facets in a bracelet that s deceptively deep RIGHT-ANGLE WEAVE. designed by Peggy Brinkman Matteliano

Divided. 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 information

RMMP Vianu 2013 Problema 1

RMMP Vianu 2013 Problema 1 RMMP Vnu Probl Dl DAVIDSCU Arn DAFINI sk. Knt nrgy o t r. Soluton Fgur Clulul ontulu nrţ nsty o wl trl ( t lngt o wl s ) s ( ) Consrng t lntry prs ng t ss y t lntry wt rspt o wl s s y r J ( ) wt y r (

More information

4.1 Interval Scheduling. Chapter 4. Greedy Algorithms. Interval Scheduling: Greedy Algorithms. Interval Scheduling. Interval scheduling.

4.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 information

The R-Tree. Yufei Tao. ITEE University of Queensland. INFS4205/7205, Uni of Queensland

The R-Tree. Yufei Tao. ITEE University of Queensland. INFS4205/7205, Uni of Queensland Yu To ITEE Unvrsty o Qunsln W wll stuy nw strutur ll t R-tr, w n tout o s mult-mnsonl xtnson o t B-tr. T R-tr supports ntly vrty o qurs (s w wll n out ltr n t ours), n s mplmnt n numrous ts systms. Our

More information

(2) If we multiplied a row of B by λ, then the value is also multiplied by λ(here lambda could be 0). namely

(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

Minimum Spanning Trees (CLRS 23)

Minimum Spanning Trees (CLRS 23) Mnmum Spnnn Trs (CLRS 3) T prolm Rll t nton o spnnn tr: Gvn onnt, unrt rp G = (V, E), sust o s o G su tt ty onnt ll vrts n G n orm no yls s ll spnnn tr (ST) o G. Any unrt, onnt rp s spnnn tr. Atully, rp

More information

ECE COMBINATIONAL BUILDING BLOCKS - INVEST 13 DECODERS AND ENCODERS

ECE 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 information

Graphs. Graphs. Graphs: Basic Terminology. Directed Graphs. Dr Papalaskari 1

Graphs. Graphs. Graphs: Basic Terminology. Directed Graphs. Dr Papalaskari 1 CSC 00 Disrt Struturs : Introuon to Grph Thory Grphs Grphs CSC 00 Disrt Struturs Villnov Univrsity Grphs r isrt struturs onsisng o vrs n gs tht onnt ths vrs. Grphs n us to mol: omputr systms/ntworks mthml

More information

# 1 ' 10 ' 100. Decimal point = 4 hundred. = 6 tens (or sixty) = 5 ones (or five) = 2 tenths. = 7 hundredths.

# 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 information

MATERIAL SEE BOM ANGLES = 2 FINISH N/A

MATERIAL SEE BOM ANGLES = 2 FINISH N/A 9 NOTS:. SSML N NSPT PR SOP 0-9... NSTLL K STKR N X L STKR TO NS O SROU WT TP. 3. PR-PK LNR RNS WT P (XTRM PRSSUR NL R ) RS OR NNRN PPROV QUVLNT. 4. OLOR TT Y T SLS ORR. RRN T MNS OM OR OMPONNTS ONTNN

More information

EE1000 Project 4 Digital Volt Meter

EE1000 Project 4 Digital Volt Meter Ovrviw EE1000 Projt 4 Diitl Volt Mtr In this projt, w mk vi tht n msur volts in th rn o 0 to 4 Volts with on iit o ury. Th input is n nlo volt n th output is sinl 7-smnt iit tht tlls us wht tht input s

More information

Multipoint Alternate Marking method for passive and hybrid performance monitoring

Multipoint Alternate Marking method for passive and hybrid performance monitoring Multipoint Altrnt Mrkin mtho or pssiv n hyri prormn monitorin rt-iool-ippm-multipoint-lt-mrk-00 Pru, Jul 2017, IETF 99 Giuspp Fiool (Tlom Itli) Muro Coilio (Tlom Itli) Amo Spio (Politnio i Torino) Riro

More information

An undirected graph G = (V, E) V a set of vertices E a set of unordered edges (v,w) where v, w in V

An undirected graph G = (V, E) V a set of vertices E a set of unordered edges (v,w) where v, w in V Unirt Grphs An unirt grph G = (V, E) V st o vrtis E st o unorr gs (v,w) whr v, w in V USE: to mol symmtri rltionships twn ntitis vrtis v n w r jnt i thr is n g (v,w) [or (w,v)] th g (v,w) is inint upon

More information

Planar Upward Drawings

Planar 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 information

(Minimum) Spanning Trees

(Minimum) Spanning Trees (Mnmum) Spnnn Trs Spnnn trs Kruskl's lortm Novmr 23, 2017 Cn Hrn / Gory Tn 1 Spnnn trs Gvn G = V, E, spnnn tr o G s onnt surp o G wt xtly V 1 s mnml sust o s tt onnts ll t vrts o G G = Spnnn trs Novmr

More information

CSE 373: More on graphs; DFS and BFS. Michael Lee Wednesday, Feb 14, 2018

CSE 373: More on graphs; DFS and BFS. Michael Lee Wednesday, Feb 14, 2018 CSE 373: Mor on grphs; DFS n BFS Mihl L Wnsy, F 14, 2018 1 Wrmup Wrmup: Disuss with your nighor: Rmin your nighor: wht is simpl grph? Suppos w hv simpl, irt grph with x nos. Wht is th mximum numr of gs

More information

CMPS 2200 Fall Graphs. Carola Wenk. Slides courtesy of Charles Leiserson with changes and additions by Carola Wenk

CMPS 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

Having a glimpse of some of the possibilities for solutions of linear systems, we move to methods of finding these solutions. The basic idea we shall

Having a glimpse of some of the possibilities for solutions of linear systems, we move to methods of finding these solutions. The basic idea we shall Hvn lps o so o t posslts or solutons o lnr systs, w ov to tos o nn ts solutons. T s w sll us s to try to sply t syst y lntn so o t vrls n so ts qutons. Tus, w rr to t to s lnton. T prry oprton nvolv s

More information

(A) the function is an eigenfunction with eigenvalue Physical Chemistry (I) First Quiz

(A) the function is an eigenfunction with eigenvalue Physical Chemistry (I) First Quiz 96- Physcl Chmstry (I) Frst Quz lctron rst mss m 9.9 - klogrm, Plnck constnt h 6.66-4 oul scon Sp of lght c. 8 m/s, lctron volt V.6-9 oul. Th functon F() C[cos()+sn()] s n gnfuncton of /. Th gnvlu s (A)

More information

Convergence Theorems for Two Iterative Methods. A stationary iterative method for solving the linear system: (1.1)

Convergence Theorems for Two Iterative Methods. A stationary iterative method for solving the linear system: (1.1) Conrgnc Thors for Two Itrt Mthods A sttonry trt thod for solng th lnr syst: Ax = b (.) ploys n trton trx B nd constnt ctor c so tht for gn strtng stt x of x for = 2... x Bx c + = +. (.2) For such n trton

More information

Why the Junction Tree Algorithm? The Junction Tree Algorithm. Clique Potential Representation. Overview. Chris Williams 1.

Why the Junction Tree Algorithm? The Junction Tree Algorithm. Clique Potential Representation. Overview. Chris Williams 1. Why th Juntion Tr lgorithm? Th Juntion Tr lgorithm hris Willims 1 Shool of Informtis, Univrsity of Einurgh Otor 2009 Th JT is gnrl-purpos lgorithm for omputing (onitionl) mrginls on grphs. It os this y

More information

Integration Continued. Integration by Parts Solving Definite Integrals: Area Under a Curve Improper Integrals

Integration Continued. Integration by Parts Solving Definite Integrals: Area Under a Curve Improper Integrals Intgrtion Continud Intgrtion y Prts Solving Dinit Intgrls: Ar Undr Curv Impropr Intgrls Intgrtion y Prts Prticulrly usul whn you r trying to tk th intgrl o som unction tht is th product o n lgric prssion

More information

12. Traffic engineering

12. Traffic engineering lt2.ppt S-38. Introution to Tltrffi Thory Spring 200 2 Topology Pths A tlommunition ntwork onsists of nos n links Lt N not th st of nos in with n Lt J not th st of nos in with j N = {,,,,} J = {,2,3,,2}

More information

Outline. 1 Introduction. 2 Min-Cost Spanning Trees. 4 Example

Outline. 1 Introduction. 2 Min-Cost Spanning Trees. 4 Example Outlin Computr Sin 33 Computtion o Minimum-Cost Spnnin Trs Prim's Alorithm Introution Mik Joson Dprtmnt o Computr Sin Univrsity o Clry Ltur #33 3 Alorithm Gnrl Constrution Mik Joson (Univrsity o Clry)

More information

DUET WITH DIAMONDS COLOR SHIFTING BRACELET By Leslie Rogalski

DUET WITH DIAMONDS COLOR SHIFTING BRACELET By Leslie Rogalski Dut with Dimons Brlt DUET WITH DIAMONDS COLOR SHIFTING BRACELET By Lsli Roglski Photo y Anrw Wirth Supruo DUETS TM from BSmith rt olor shifting fft tht mks your work tk on lif of its own s you mov! This

More information

EXAMPLE 87.5" APPROVAL SHEET APPROVED BY /150HP DUAL VFD CONTROL ASSEMBLY CUSTOMER NAME: CAL POLY SLO FINISH: F 20

EXAMPLE 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 information

1 Introduction to Modulo 7 Arithmetic

1 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 information

Strongly connected components. Finding strongly-connected components

Strongly connected components. Finding strongly-connected components Stronly onnt omponnts Fnn stronly-onnt omponnts Tylr Moor stronly onnt omponnt s t mxml sust o rp wt rt pt twn ny two vrts SE 3353, SMU, Dlls, TX Ltur 9 Som sls rt y or pt rom Dr. Kvn Wyn. For mor normton

More information

Scheduling for Synthesizing Portable System with Energy Harvesting and Storage

Scheduling for Synthesizing Portable System with Energy Harvesting and Storage Shulng or Synthszng Portl Systm wth Enrgy Hrvstng n Storg Hsn-Ho Hung n Youn-Long Ln Dprtmnt o Computr Sn Ntonl Tsng Hu Unvrsty, TAIWAN s986@m98.nthu.u.tw; yln@s.nthu.u.tw Astrt Shulng s on o th most mportnt

More information

CSC Design and Analysis of Algorithms. Example: Change-Making Problem

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 information

Lecture II: Minimium Spanning Tree Algorithms

Lecture II: Minimium Spanning Tree Algorithms Ltur II: Mnmum Spnnn Tr Alortms Dr Krn T. Hrly Dprtmnt o Computr Sn Unvrsty Coll Cork Aprl 0 KH (/0/) Ltur II: Mnmum Spnnn Tr Alortms Aprl 0 / 5 Mnmum Spnnn Trs Mnmum Spnnn Trs Spnnn Tr tr orm rom rp s

More information

, each of which is a tree, and whose roots r 1. , respectively, are children of r. Data Structures & File Management

, 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 information

Decimals DECIMALS.

Decimals DECIMALS. Dimls DECIMALS www.mthltis.o.uk ow os it work? Solutions Dimls P qustions Pl vlu o imls 0 000 00 000 0 000 00 0 000 00 0 000 00 0 000 tnths or 0 thousnths or 000 hunrths or 00 hunrths or 00 0 tn thousnths

More information

A general N-dimensional vector consists of N values. They can be arranged as a column or a row and can be real or complex.

A general N-dimensional vector consists of N values. They can be arranged as a column or a row and can be real or complex. Lnr lgr Vctors gnrl -dmnsonl ctor conssts of lus h cn rrngd s column or row nd cn rl or compl Rcll -dmnsonl ctor cn rprsnt poston, loct, or cclrton Lt & k,, unt ctors long,, & rspctl nd lt k h th componnts

More information

CSE 373: AVL trees. Warmup: Warmup. Interlude: Exploring the balance invariant. AVL Trees: Invariants. AVL tree invariants review

CSE 373: AVL trees. Warmup: Warmup. Interlude: Exploring the balance invariant. AVL Trees: Invariants. AVL tree invariants review rmup CSE 7: AVL trs rmup: ht is n invrint? Mihl L Friy, Jn 9, 0 ht r th AVL tr invrints, xtly? Disuss with your nighor. AVL Trs: Invrints Intrlu: Exploring th ln invrint Cor i: xtr invrint to BSTs tht

More information

Filter Design Techniques

Filter Design Techniques Fltr Dsgn chnqus Fltr Fltr s systm tht psss crtn frquncy componnts n totlly rcts ll othrs Stgs of th sgn fltr Spcfcton of th sr proprts of th systm ppromton of th spcfcton usng cusl scrt-tm systm Rlzton

More information

Algorithmic and NP-Completeness Aspects of a Total Lict Domination Number of a Graph

Algorithmic and NP-Completeness Aspects of a Total Lict Domination Number of a Graph Intrntionl J.Mth. Comin. Vol.1(2014), 80-86 Algorithmi n NP-Compltnss Aspts of Totl Lit Domintion Numr of Grph Girish.V.R. (PES Institut of Thnology(South Cmpus), Bnglor, Krntk Stt, Ini) P.Ush (Dprtmnt

More information

Graphs. CSC 1300 Discrete Structures Villanova University. Villanova CSC Dr Papalaskari

Graphs. CSC 1300 Discrete Structures Villanova University. Villanova CSC Dr Papalaskari Grphs CSC 1300 Disrt Struturs Villnov Univrsity Grphs Grphs r isrt struturs onsis?ng of vr?s n gs tht onnt ths vr?s. Grphs n us to mol: omputr systms/ntworks mthm?l rl?ons logi iruit lyout jos/prosss f

More information

Minimum Spanning Trees (CLRS 23)

Minimum Spanning Trees (CLRS 23) Mnmum Spnnn Trs (CLRS 3) T prolm Gvn onnt, unrt rp G = (V, E), sust o s o G su tt ty onnt ll vrts n G n orm no yls s ll spnnn tr (ST) o G. Clm: Any unrt, onnt rp s spnnn tr (n nrl rp my v mny spnnn trs).

More information

Graph Search (6A) Young Won Lim 5/18/18

Graph Search (6A) Young Won Lim 5/18/18 Grp Sr (6A) Youn Won Lm Copyrt () 2015 2018 Youn W. Lm. Prmon rnt to opy, trut n/or moy t oumnt unr t trm o t GNU Fr Doumntton Ln, Vron 1.2 or ny ltr vron pul y t Fr Sotwr Founton; wt no Invrnt Ston, no

More information

learning objectives learn what graphs are in mathematical terms learn how to represent graphs in computers learn about typical graph algorithms

learning 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 information

Appendix. In the absence of default risk, the benefit of the tax shield due to debt financing by the firm is 1 C E C

Appendix. In the absence of default risk, the benefit of the tax shield due to debt financing by the firm is 1 C E C nx. Dvon o h n wh In h sn o ul sk h n o h x shl u o nnng y h m s s h ol ouon s h num o ssus s h oo nom x s h sonl nom x n s h v x on quy whh s wgh vg o vn n l gns x s. In hs s h o sonl nom xs on h x shl

More information

A Simple Code Generator. Code generation Algorithm. Register and Address Descriptors. Example 3/31/2008. Code Generation

A Simple Code Generator. Code generation Algorithm. Register and Address Descriptors. Example 3/31/2008. Code Generation A Simpl Co Gnrtor Co Gnrtion Chptr 8 II Gnrt o for singl si lok How to us rgistrs? In most mhin rhitturs, som or ll of th oprnsmust in rgistrs Rgistrs mk goo tmporris Hol vlus tht r omput in on si lok

More information

QUESTIONS BEGIN HERE!

QUESTIONS BEGIN HERE! Points miss: Stunt's Nm: Totl sor: /100 points Est Tnnss Stt Univrsity Dprtmnt o Computr n Inormtion Sins CSCI 2710 (Trno) Disrt Struturs TEST or Sprin Smstr, 2005 R this or strtin! This tst is los ook

More information

V={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)}

V={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)} s s of s Computr Sin & Enginring 423/823 Dsign n Anlysis of Ltur 03 (Chptr 22) Stphn Sott (Apt from Vinohnrn N. Vriym) s of s s r strt t typs tht r pplil to numrous prolms Cn ptur ntitis, rltionships twn

More information

Module graph.py. 1 Introduction. 2 Graph basics. 3 Module graph.py. 3.1 Objects. CS 231 Naomi Nishimura

Module graph.py. 1 Introduction. 2 Graph basics. 3 Module graph.py. 3.1 Objects. CS 231 Naomi Nishimura Moul grph.py CS 231 Nomi Nishimur 1 Introution Just lik th Python list n th Python itionry provi wys of storing, ssing, n moifying t, grph n viw s wy of storing, ssing, n moifying t. Bus Python os not

More information

Theorem 1. An undirected graph is a tree if and only if there is a unique simple path between any two of its vertices.

Theorem 1. An undirected graph is a tree if and only if there is a unique simple path between any two of its vertices. Cptr 11: Trs 11.1 - Introuton to Trs Dnton 1 (Tr). A tr s onnt unrt rp wt no sp ruts. Tor 1. An unrt rp s tr n ony tr s unqu sp pt twn ny two o ts vrts. Dnton 2. A root tr s tr n w on vrtx s n snt s t

More information

V={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)}

V={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)} Introution Computr Sin & Enginring 423/823 Dsign n Anlysis of Algorithms Ltur 03 Elmntry Grph Algorithms (Chptr 22) Stphn Sott (Apt from Vinohnrn N. Vriym) I Grphs r strt t typs tht r pplil to numrous

More information

Outline. Computer Science 331. Computation of Min-Cost Spanning Trees. Costs of Spanning Trees in Weighted Graphs

Outline. Computer Science 331. Computation of Min-Cost Spanning Trees. Costs of Spanning Trees in Weighted Graphs Outlin Computr Sin 33 Computtion o Minimum-Cost Spnnin Trs Prim s Mik Joson Dprtmnt o Computr Sin Univrsity o Clry Ltur #34 Introution Min-Cost Spnnin Trs 3 Gnrl Constrution 4 5 Trmintion n Eiiny 6 Aitionl

More information

HIGH-SPEED REGULAR EXPRESSION MATCHING ENGINE USING MULTI-CHARACTER NFA

HIGH-SPEED REGULAR EXPRESSION MATCHING ENGINE USING MULTI-CHARACTER NFA HIGH-SPEED REGULAR EPRESSION MATCHING ENGINE USING MULTI-CHARACTER NFA Noro Ymgk, Rtnr Shu, Stosh Kmy Systm IP Cor Rsrh Lortors NEC Corporton Kwsk, Kngw, Jpn ml: {n-ymgk@j, kmy@k}.jp.n.om ABSTRACT An pproh

More information

Designing A Concrete Arch Bridge

Designing A Concrete Arch Bridge This is th mous Shwnh ri in Switzrln, sin y Rort Millrt in 1933. It spns 37.4 mtrs (122 t) n ws sin usin th sm rphil mths tht will monstrt in this lsson. To pro with this lsson, lik on th Nxt utton hr

More information

Solutions to Homework 5

Solutions to Homework 5 Solutions to Homwork 5 Pro. Silvia Frnánz Disrt Mathmatis Math 53A, Fall 2008. [3.4 #] (a) Thr ar x olor hois or vrtx an x or ah o th othr thr vrtis. So th hromati polynomial is P (G, x) =x (x ) 3. ()

More information

On Hamiltonian Tetrahedralizations Of Convex Polyhedra

On Hamiltonian Tetrahedralizations Of Convex Polyhedra O Ht Ttrrzts O Cvx Pyr Frs C 1 Q-Hu D 2 C A W 3 1 Dprtt Cputr S T Uvrsty H K, H K, C. E: @s.u. 2 R & TV Trsss Ctr, Hu, C. E: q@163.t 3 Dprtt Cputr S, Mr Uvrsty Nwu St. J s, Nwu, C A1B 35. E: w@r.s.u. Astrt

More information

The Mathematics of Harmonic Oscillators

The Mathematics of Harmonic Oscillators Th Mhcs of Hronc Oscllors Spl Hronc Moon In h cs of on-nsonl spl hronc oon (SHM nvolvng sprng wh sprng consn n wh no frcon, you rv h quon of oon usng Nwon's scon lw: con wh gvs: 0 Ths s sos wrn usng h

More information

Closed Monochromatic Bishops Tours

Closed Monochromatic Bishops Tours Cos Monoromt Bsops Tours Jo DMo Dprtmnt o Mtmts n Sttsts Knnsw Stt Unvrsty, Knnsw, Gor, 0, USA mo@nnsw.u My, 00 Astrt In ss, t sop s unqu s t s o to sn oor on t n wt or. Ts ms os tour n w t sop vsts vry

More information

SHELL CANADA PIPING AND INSTRUMENT DIAGRAM UNIT REGENERATION/COMMON LEAN / RICH AMINE EXCHANGER QUEST CCS PROJECT QUEST CCS PROJECT CONSTRUCTION

SHELL CANADA PIPING AND INSTRUMENT DIAGRAM UNIT REGENERATION/COMMON LEAN / RICH AMINE EXCHANGER QUEST CCS PROJECT QUEST CCS PROJECT CONSTRUCTION ). M 5 34 34..... / / / /......... / / / / / / / / / /. /.... 66...... / /... SSU T SPTON SHLL N NOTS: G Y K P S QUST S POJT M P PM LNT SL: NON NG N NSTUMNT GM QUST S POJT SHLL WG NO.:. 46...4.. 46. L:\\:\5\WNGS\O\46\46..pid

More information

Paths. Connectivity. Euler and Hamilton Paths. Planar graphs.

Paths. Connectivity. Euler and Hamilton Paths. Planar graphs. Pths.. Eulr n Hmilton Pths.. Pth D. A pth rom s to t is squn o gs {x 0, x 1 }, {x 1, x 2 },... {x n 1, x n }, whr x 0 = s, n x n = t. D. Th lngth o pth is th numr o gs in it. {, } {, } {, } {, } {, } {,

More information

Isomorphism In Kinematic Chains

Isomorphism In Kinematic Chains Intrntonl Journl o Rsr n Ennrn n Sn (IJRES) ISSN (Onln): 0-, ISSN (Prnt): 0- www.rs.or Volum Issu ǁ My. 0 ǁ PP.0- Isomorpsm In Knmt Cns Dr.Al Hsn Asstt.Prossor, Dprtmnt o Mnl Ennrn, F/O- Ennrn & Tnoloy,

More information

d e c b a d c b a d e c b a a c a d c c e b

d 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 information

CSE 373. Graphs 1: Concepts, Depth/Breadth-First Search reading: Weiss Ch. 9. slides created by Marty Stepp

CSE 373. Graphs 1: Concepts, Depth/Breadth-First Search reading: Weiss Ch. 9. slides created by Marty Stepp CSE 373 Grphs 1: Conpts, Dpth/Brth-First Srh ring: Wiss Ch. 9 slis rt y Mrty Stpp http://www.s.wshington.u/373/ Univrsity o Wshington, ll rights rsrv. 1 Wht is grph? 56 Tokyo Sttl Soul 128 16 30 181 140

More information

Problem solving by search

Problem solving by search Prolm solving y srh Tomáš voo Dprtmnt o Cyrntis, Vision or Roots n Autonomous ystms Mrh 5, 208 / 3 Outlin rh prolm. tt sp grphs. rh trs. trtgis, whih tr rnhs to hoos? trtgy/algorithm proprtis? Progrmming

More information

INSTALLATION MANUAL. intelligent Tablet Controller DCC601A51

INSTALLATION MANUAL. intelligent Tablet Controller DCC601A51 INSTALLATION MANUAL ntllgnt Tlt Controllr Contnts Instllton mnul ntllgnt Tlt Controllr pg 1. Aout ths oumnt... 1 1.1. Trgt un... 1 1.2. Doumntton st... 1 2. Gnrl sty prutons... 1 2.1. Gnrl... 1 2.2. Instllton

More information

Nefertiti. Echoes of. Regal components evoke visions of the past MULTIPLE STITCHES. designed by Helena Tang-Lim

Nefertiti. Echoes of. Regal components evoke visions of the past MULTIPLE STITCHES. designed by Helena Tang-Lim MULTIPLE STITCHES Nrtiti Ehos o Rgl omponnts vok visions o th pst sign y Hln Tng-Lim Us vrity o stiths to rt this rgl yt wrl sign. Prt sping llows squr s to mk roun omponnts tht rp utiully. FCT-SC-030617-07

More information

Applications of trees

Applications of trees Trs Apptons o trs Orgnzton rts Attk trs to syst Anyss o tr ntworks Prsng xprssons Trs (rtrv o norton) Don-n strutur Mutstng Dstnton-s orwrng Trnsprnt swts Forwrng ts o prxs t routrs Struturs or nt pntton

More information

The University of Sydney MATH2969/2069. Graph Theory Tutorial 5 (Week 12) Solutions 2008

The University of Sydney MATH2969/2069. Graph Theory Tutorial 5 (Week 12) Solutions 2008 Th Univrsity o Syny MATH2969/2069 Grph Thory Tutoril 5 (Wk 12) Solutions 2008 1. (i) Lt G th isonnt plnr grph shown. Drw its ul G, n th ul o th ul (G ). (ii) Show tht i G is isonnt plnr grph, thn G is

More information

More Foundations. Undirected Graphs. Degree. A Theorem. Graphs, Products, & Relations

More 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 information

RAMS C, 16 GA SLITTER 23

RAMS C, 16 GA SLITTER 23 RMS - 0-, G SLITTR N/ LLS /0/0 SSL UTION LL SRIL No. TG 0 S SHT OR UPPR SSMLY "M IN US" LL S SHT OR KGG SSMLY 0 ITM NO. PRT NUMR SRIPTION QTY. 00X/ " I X /" OR PULLY N/ L-0 V-LT K OR GRIP N/ POWR OR SL-0

More information

OpenMx Matrices and Operators

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 information

DOCUMENT STATUS: MINTP0 E-ST5080, BASE, NO DISPLAY VENDOR: 15.5 INCH MATERIAL SEE BOM FINISH REVISION HISTORY ITEM NO. PART NUMBER DESCRIPTION

DOCUMENT STATUS: MINTP0 E-ST5080, BASE, NO DISPLAY VENDOR: 15.5 INCH MATERIAL SEE BOM FINISH REVISION HISTORY ITEM NO. PART NUMBER DESCRIPTION RV T RVSON STORY SRPTON O Y 0-0-0 PROUTON RLS K. N NOTS:. SRL LL NORMTON: a) VOLTS: V b) MPS:.0 c) YLS: N/ d) WTTS: W e) PS: N/ f) PX #: PX. RTTON LOOS: S / / LN R WT SOPROPYL LOLOL PROR TO PLN.. PK M:

More information

New Biomaterials from Renewable Resources - Amphiphilic Block Copolymers from δ-decalactone. Figure S4 DSC plot of Propargyl PDL...

New Biomaterials from Renewable Resources - Amphiphilic Block Copolymers from δ-decalactone. Figure S4 DSC plot of Propargyl PDL... Eltron Supplmntry Mtrl (ESI) or Polymr Cmstry. Ts ournl s T Royl Soty o Cmstry 2015 Polymr Cmstry RSCPulsng Supportng Inormton Nw Bomtrls rom Rnwl Rsours - Amppl Blo Copolymrs rom δ-dlton Kulp K. Bnsl,

More information

CEDAR ISLAND / KEATON BEACH TAYLOR COUNTY, FLORIDA POST-HURRICANE HERMINE EXAMINATION SURVEY FY16 4-FOOT PROJECT

CEDAR ISLAND / KEATON BEACH TAYLOR COUNTY, FLORIDA POST-HURRICANE HERMINE EXAMINATION SURVEY FY16 4-FOOT PROJECT 10 9 8 7 6 5 JUG ISLN R KL H R H R ROSMR LN W W HITTIL R JO MORGN R LRW TR RK R L M PNSOL GUL G O R G I TLLHSS JKSONVILL ORLNO OO TMP TLNTI ON N US rmy orps of ngineers Jacksonville istrict ST ON THIS

More information

DETAIL B DETAIL A 7 8 APPLY PRODUCT ID LABEL SB838XXXX ADJ FOUR POST RACK SQUARE HOLE RAIL B REVISION

DETAIL B DETAIL A 7 8 APPLY PRODUCT ID LABEL SB838XXXX ADJ FOUR POST RACK SQUARE HOLE RAIL B REVISION RVISION RV SRIPTION Y T HNG NO NOT OR PROUT LL JJH // LR TIL PPLY PROUT I LL TIL INSI UPPR ROSS MMR ON PR RK IS J OUR POST RK SQUR HOL RIL IS MN MS G NUT, PNL RNG 99 PPLY PROUT I LL INSI UPPR ROSS MMR

More information

b. How many ternary words of length 23 with eight 0 s, nine 1 s and six 2 s?

b. How many ternary words of length 23 with eight 0 s, nine 1 s and six 2 s? MATH 3012 Finl Exm, My 4, 2006, WTT Stunt Nm n ID Numr 1. All our prts o this prolm r onrn with trnry strings o lngth n, i.., wors o lngth n with lttrs rom th lpht {0, 1, 2}.. How mny trnry wors o lngth

More information

Computer Graphics. Viewing & Projections

Computer Graphics. Viewing & Projections Vw & Ovrvw rr : rss r t -vw trsrt: st st, rr w.r.t. r rqurs r rr (rt syst) rt: 2 trsrt st, rt trsrt t 2D rqurs t r y rt rts ss Rr P usuy st try trsrt t wr rts t rs t surs trsrt t r rts u rt w.r.t. vw vu

More information

DOCUMENT STATUS: RELEASE

DOCUMENT STATUS: RELEASE RVSON STORY RV T SRPTON O Y 0-4-0 RLS OR PROUTON 5 MM -04-0 NS TRU PLOT PROUTON -- S O O OR TLS 30 MM 03-3-0 3-044 N 3-45, TS S T TON O PROTTV RM OVR. 3 05--0 LT 3-004, NOT, 3-050 3 0//00 UPT ST ROM SN,

More information

Exam 1 Solution. CS 542 Advanced Data Structures and Algorithms 2/14/2013

Exam 1 Solution. CS 542 Advanced Data Structures and Algorithms 2/14/2013 CS Avn Dt Struturs n Algorithms Exm Solution Jon Turnr //. ( points) Suppos you r givn grph G=(V,E) with g wights w() n minimum spnning tr T o G. Now, suppos nw g {u,v} is to G. Dsri (in wors) mtho or

More information

Math 61 : Discrete Structures Final Exam Instructor: Ciprian Manolescu. You have 180 minutes.

Math 61 : Discrete Structures Final Exam Instructor: Ciprian Manolescu. You have 180 minutes. Nm: UCA ID Numr: Stion lttr: th 61 : Disrt Struturs Finl Exm Instrutor: Ciprin nolsu You hv 180 minuts. No ooks, nots or lultors r llow. Do not us your own srth ppr. 1. (2 points h) Tru/Fls: Cirl th right

More information

Page 1. Question 19.1b Electric Charge II Question 19.2a Conductors I. ConcepTest Clicker Questions Chapter 19. Physics, 4 th Edition James S.

Page 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 information

Module 2 Motion Instructions

Module 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 information

COMPLEXITY OF COUNTING PLANAR TILINGS BY TWO BARS

COMPLEXITY OF COUNTING PLANAR TILINGS BY TWO BARS OMPLXITY O OUNTING PLNR TILINGS Y TWO RS KYL MYR strt. W show tht th prolm o trmining th numr o wys o tiling plnr igur with horizontl n vrtil r is #P-omplt. W uil o o th rsults o uquir, Nivt, Rmil, n Roson

More information

Numbering Boundary Nodes

Numbering Boundary Nodes Numring Bounry Nos Lh MBri Empori Stt Univrsity August 10, 2001 1 Introution Th purpos of this ppr is to xplor how numring ltril rsistor ntworks ffts thir rspons mtrix, Λ. Morovr, wht n lrn from Λ out

More information

MINI POST SERIES BALUSTRADE SYSTEM INSTALLATION GUIDE PRODUCT CODE: MPS-RP

MINI POST SERIES BALUSTRADE SYSTEM INSTALLATION GUIDE PRODUCT CODE: MPS-RP MN POST SRS LUSTR SYSTM NSTLLTON U PROUT O: MPS-RP 0 R0 WLL LN 0 RONT LVTON VW R0 N P 0 T RUR LOK LOT ON LSS. SLON SL TYP. OT SS 000 LSS T 0 00 SRS LSS WT 00/00 (0mm NRMNTS VLL) MX. 000 00-0 (ROMMN) 00

More information