Mode switching in modal domain models of overhead lines and underground cables
|
|
- Neal Wilkinson
- 5 years ago
- Views:
Transcription
1 Mo swithing in mol omin mols o ovrh lins n unrgroun ls I. Zltunić, S. Voopij, R. Goić Astrt- This ppr prsnts ri rviw o irnt mthos or lultion o ignvlus n ignvtors or pplition in th mol trnsmission lin thory. In this il o prtiulr intrst is th numril phnomnon known s mo swithing. Mo swithing is rlt to vry spii rqunis n must proprly trt in mol omin mols o ovrh lins n unrgroun ls. This ppr summrizs th mthos n intiis th irns mong thm. Impn n mittn mtris o ovrh lins n unrgroun ls r lult in wi rng o rqunis in orr to ompr irnt mthos. Kywors: Eignvlu, Eignvtor, Mol trnsmission lin thory, Mo swithing, Mol omin, Ovrh lin, Unrgroun l. U I. INTRODUCTION nrgroun ls n ovrh lins r in EMTPs simultion progrms mol s rqunypnnt lmnts known s FD (rquny-pnnt) or ULM (Univrsl lin mol). A numr o pprs r stritly ling with moling ltromgnti trnsint hvior o ovrh lins n ls []-[7]. Most o thm us mol omposition thory to oupl phs systm in quivlnt mol systm s i it is onsist o singl phs lins. In this pross it is vry importnt to vlop suitl lgorithm tht will lult ignvlus longing to th sm st o ignvtors. On o th most importnt onition tht hs to ulill is tht ignvtors lult rom Z r ontinuous n smooth throughout wi rng o rqunis. I th stnr routins r us or lultion o ignvlus n ignvtors it is oun tht ignvlus n ignvtors r not sort proprly n invitl swithing twn mos n our. For xmpl, this n our i w us stnr Mtl untion ig() or implmnting si QR or powr mtho lgorithm or lultion o ignvlus n ignvtors. To voi this prolm thr mthos whih r ommonly us in rport litrtur []-[3] r prsnt. Th irst on uss moii Joi lgorithm [], [2]. Joi I. Zltunić n S. Voopij r working t Frtl Lt Split, Croti, n oth r post grut stunts t th Fulty o Eltril Enginring, Mhnil nginring n Nvl rhittur, Dprtmnt o Eltril Enginring, Split, Croti (-mil:ivo@rtl.hr n stip@rtl.hr). R. Goić is n Assoit Prossor t th Fulty o Eltril Enginring, Mhnil nginring n Nvl rhittur, Dprtmnt o Eltril Enginring, Split, Croti, (-mil:rgoi@s.hr). Ppr sumitt to th Intrntionl Conrn on Powr Systms Trnsints (IPST25) in Cvtt, Croti Jun 5-8, 25 lgorithm is ommonly us or solving ignvlus n ignvtors prolms o rl symmtri mtris n with rtin hngs it n us or solving symmtril omplx mtris [8]. Th son on is th Nwton-Rphson mtho [3]. This mtho is not otn us in rport litrtur ut n riv smooth n ontinuous ignvtors n ignvlus throughout wi rng o rqunis. Sin this routin utilizs th rsults rom prvious rquny s strting vlu or nxt rquny it is rommn to us nothr lgorithm in orr to gt strt with Nwton-Rphson mtho. This will work iintly only i th ignvlus n ignvtors o not vry wily rom on rquny to th othr. Th thir on lso utilizs stnr routins (powr mtho, Joi mtho, mtl untion ig n othrs) with orrltion thniqu [3]. In this s mo swithing is invitl ut n rogniz using orrltion thniqu. Th orrltion thniqu hks i th ignvtors longing to th sm st o ignvlus r orthogonl rom on rquny to th othr. Bsi sription n lgorithm o ormntion mthos r provi in this ppr. For this purpos, rquny pnnt impn n mittn mtris r lult or unrgroun ls n ovrh lins using qutions rport in [4]-[6]. Th min ojtiv o this ppr is to rviw rport mthos or solving ignvlu n ignvtor prolm in mol omposition thory n to provi omprhnsiv sription n implmnttion o thm. This ppr is strutur s ollows: Stion II outlins th prolm o mo swithing. Stion III sris si inormtion o mthos rport in litrtur or solving prolm o mo swithing. Stion IV unrlins th ommonly us normliztion routins or ignvtors mtris. Stion V prsnts simultion xmpls n rsults or simpl iruits o ovrh lins n ls. Stion VI onlus with isussion o th otin rsults. II. MODE SWITCHING IN THE MODAL DOMAIN MODELS Figur. shows n xmpl o multipl ignvlu swithovrs whn lulting mol vloity or unrgroun l givn in stion V. Mol vloity is otin or six mos o propgtion -. In mol thory o unrgroun ls, mo in ig. prsnts zro squn mo o onutor whih is nrgiz y injting unit urrnt into h l onutor n xtrting it rom orrsponing shth. Mos n rprsnt intronutor mos o propgtion. Mo is zro squn shth mo n
2 Mol vloity (m/s) mos n r intrshth mos o propgtion. Mo hs lowst mol vloity u to high inutiv impn o soil pth. Mos - hv mount o mol vloity in mount o 2/3 sp o light in ss o rquny lrgr thn Hz. Eignvlus n ignvtor or vry spii rquny r lult using stnr Joi routin. Almost th sm rsults n otin whn using othr stnr routins s mtl untion ig(), QR lgorithm, powr mthos n othrs. In this s whn ignvlus swithing hs ourr it lso mns tht ignvtors swith pls t rtin rqunis. Figur. shows n xmpl o swithovrs with mos, n n t rqunis nr Hz, 3 Hz, 4 Hz, 5 Hz, n 5 khz x Frquny (Hz) Fig.. Mol vloity hrtristis o nturl mos o propgtion or th kv unrgroun l with mo swithing Aoring to [], [2] two onitions hv to ulill in orr to mol FD mol o unrgroun ls n powr lins in mol omin: Th ignvtors lult rom prouts Z hv to ontinuous n smooth throughout wi rng o rqunis. In orr to otin minimum-phs shit untions, ignvtors o Z mtris n to normliz so tht on o thir lmnts oms rl n onstnt throughout wi rng o rqunis. It is ovious tht irst onition nnot ulill with stnr ignprolm routins. For this rson spil mthos r vlop in orr to l with th irst onition. Th son onition n sily mng using pproprit normliztion routin with ignvtors. III. DEALING WITH MODE SWITCHING This stion prsnts si inormtion out thr ormntion mthos. In orr to voi unsir ovrlow rrors proprly sling is utiliz iviing h lmnt o mtrix with lmnt (-ω 2 ε μ ) or lling ignvlu n ignvtor routin. At th n lult ignvlus must multipli with sm lmnt in orr to otin goo rsults. A. Moii Joi mtho Stnr Joi mtho uss Joi rottions to igonliz rl n symmtri mtris n to in pproprit ignvlus n ignvtors [], [2], [7]. Th irst ssumption tht hs to ulill is tht mtrix prout Z is igonlizl. Our xprin n t prsnt in litrtur show tht in prtil ss Z or powr ls n lins is lwys igonlizl throughout wi rng o rqunis (.- MHz). I this is not s it is still possil to otin ignvtor mtris using prturtion thniqus in orr to insur tht ignvlus r istint [2]. In orr to utiliz Joi mtho qut trnsormtion is n to insur tht mtrix is symmtri. Sin mtrix prout Z is symmtri, ignprolm () hs to trnsorm in (2). ZQ Q HR R H S S ZS R Q S S whr: - mittn mtrix, Z - impn mtrix, Z - prout o n Z mtris, Q - ignvtors o mtrix Z, λ ignvlus o mtrix Z, H symmtri mtrix, R ignvtors o mtrix H, S ignvtors o mtrix, λ - ignvlus o mtrix. Eignprolm (2) mns tht: Th mtrix H is symmtri throughout wi rng o rqunis n th ignvlus λ o H r th sm s ignvlus o Z. Sin H is symmtri, th ignvtor mtrix stisis R - =R T. Eignvtors Q o mtrix prout Z n otin using qution (4). Eignvtors S o n sily otin using stnr routins. Amittn mtrix is lmost igonl mtrix n ignprolm n sily solv. Using this pproh it is possil to lult ignvlus λ n ignvtors R pplying stnr Joi routin. Atr lulting ignvtor mtrix R it is possil to lult ignvtors o mtrix Z using qution (4). In orr to insur ontinuous n smooth ignvtors n ignvlus throughout wi rng o rqunis it is nssry to utiliz ignvtors otin in prvious rquny stp. This is on y qution (6) in whih mtrix H or prsnt rquny is prn post multipli with ignvtors lult or prvious rquny. R HR P P Hn 6
3 Whr: R P is ignvtor lult or prvious rquny. Invrsion o R P is not n sin it is orthogonl n stisis R - =R T. Hn is nw mtrix whih is lmost igonl n us or lulting ignvlus n ignvtors or prsnt rquny. Sin mtrix Hn is lmost igonl Joi rottions will lmost unit mtrix n this will tivly spup lultions. This mtho is tst or unrgroun ls in [], [2]. B. Nwton Rphson mtho In Nwton-Rphson mtho thr is no n or symmtri mtrix to lult ignvlus n ignvtors o Z. It utilizs qution (7) in orr to in ignvlus n ignvtors 7 ( Z U) Q kk k Whr: Q k is ignvtor longing to th ignvlu λ kk. U is unit mtrix. Eqution (7) is rpt or ll ignvtors n ignvlus in orr to lult xt vlus. As n xmpl or thr phs powr lin or l ths qutions n writtn s: ( Z ) Q Z Q Z Q Z Q ( Z ) Q Z Q Z Q Z Q ( Z ) Q In qutions (8) thr r our unknowns n thr qutions. In orr to otin solution it is possil to rpl lrgst vlu t th initil rquny n st it qul to on or ll rqunis. Aoring to [3] this normliztion is not goo us it n somtims l to unsirl rrors. Inst, thy rommn spiying sums o th squrs o th lmnts o th ignvtor to unity (8.4) Q Q Q Using ormntion our qutions (8. to 8.4) n stnr Nwton Rphson mtho nw untion G(x) n in s: G( x) x J( x) F( x) 9 Whr J(x) is th Join mtrix n F(x) is mtrix orm y qutions (8). Sin Nwton Rphson is itrtion mtho, initil vlus o ignvlus n longing ignvtors is n. Oviously th ignvlus n ignvtors otin rom prvious rquny r us s strting vlus or prsnt rquny. Also this mtho is not sl-strting mtho n nothr routin must us to lult ignvlus n ignvtors or irst rquny. This mtho is tst or ovrh lins in [3]. C. Corrltion thniqu Corrltion thniqu n us to voi multipl swithovrs twn ignvtors. In orr to in out swithing rqunis it is nssry to trk ignvtors throughout th wi rquny rng. Th orrltion thniqu propos in [3] is s on th t tht th ignvtors longing to th sm st o ignvlu r orthogonl rom on rquny to th othr. Th lgorithm or orrltion thniqu propos in [3] n summriz in iv stps: Clult th ignvtor mtrix Q or prsnt rquny. Otin omplx onjugt trnspos mtrix Q T *. Clult mtrix prout (Q T *)Q p. Q p is ignvtor mtrix rom prvious rquny. In h row o th ormntion prout in th lrgst lmnts. Th row numr o this lmnt ins th olumn numr o th ignvtor rom th prvious rquny. Convrsly, olumn numr ins olumn numr o th ignvtor t th prsnt rquny. This mns i mo swithing hs not ourr, ll lrgst numrs will sort in igonl o ormntion mtrix prout. I ignvtor swithing hs ourr it is nssry to swith ignvtors n ignvlus in orr to mth prvious rquny. Our xprin shows tht this mtho works iintly with stnr ignprolms routins (powr mtho, mtl untion ig() n joi mtho) ut lso shows tht it nnot ppli with QR mtho. IV. EIGENVECTOR NORMALIZATION Aoring to [], [2] uthor rommns to normliz ignvtors o Z mtris in orr to otin minimum phs shit untions. For unrgroun ls uthor rommns to multiply h ignvtor y tor suh tht on o its lmnts oms onstnt n rl throughout whol rquny rng. This sling pross utomtilly ors ll lmnts o ignvtor to minimum-phs-shit-untions. In [3] uthors rommn using sums o squrs o th lmnts o th ignvtors to unity. In this ppr uthor prsnts tht oring on lmnt to rl n onstnt n somtims tk wy nturl vrition hvior n prou unsirl rrors. In this ppr or th purpos o omprison in stion V th irst normliztion routin will utiliz or ll mthos. In utur rsrh it is rommn to in optiml normliztion routins or ovrh lins n unrgroun ls. V. SIMULATION EXAMPLES AND RESULTS For simultion purposs two xmpls r prsnt. First simultion xmpl with rsults is prsnt or kv unrgroun ls n son on or kv ovrh lins. Mtris n Z or unrgroun ls with shths r lult throughout wi rng o rqunis (. Hz
4 MHz) with 5 points or vry in log sl. Mtl untion is implmnt to lult lmnts o impn n mittn mtris using wll known qutions [4]. Frquny pnnt intrnl impn o or n shths r lult using ull lssil ormuls. Erth-rturn impn n mutul rth-rturn impn r lult solving Pollzk intgrl with onvrgnt sris n y implmnting numril intgrtion mtho using utious, ptiv Romrg xtrpoltion [4]. Also lultions r implmnt n ompr with pproximt ormuls givn in [4]. All rsults r otin s on homognous soil rsistivity. Physil n gomtry t or kv thr phs unrgroun ls with shths n isoltion r shown in igur 2. Th ls us s n xmpl in igur 2. r singl or, with luminium phs onutors, with ross link polythyln insultion (XLPE) n smi-onutiv lyr nth n ovr insultion. Outr insultion is high-nsity polythyln (PEHD). Angl ( ) Amplitu Angl ( ) Amplitu Mol vloity (m/s) x Frquny (Hz) Fig. 3. Mol vloity hrtristis o nturl mos o propgtion or th kv unrgroun l without mo swithing r r 2 r 3 r h=m s=5 m ρ= Ωm r = 9 mm r 2= 35 mm r 3= mm r 4= 43 mm ρ C= Ωm ρ S=.72-8 Ωm tnδ XLPE =. tnδ PE-HD =. ε rxlpe=2.3 ε rpe-hd=2.5 μ r= L=5 km Fig. 2. Dt n gomtry or kv thr phs unrgroun ls For omprison purposs smooth n ontinuous untions o mplitu n ngl o ignvtors or ls r prsnt in Figur 4. Figur 3 shows mol vloity or six nturl mos o propgtion (-). Corrltion thniqu is us with stnr mtl untion ig() n sling pross o ignvtors is m oring to stion IV. Simultion with irnt kins o ls gomtry n physil t shows tht ll mthos giv goo n lmost intil rsults. Nwton-Rphson mtho n moii Joi mthos giv rsonly goo rsults tr w itrtion. Mximum rltiv rror twn ths mthos in this xmpl o not x,3%, whih is ngligil. Th irns mong orrltion thniqu n Nwton-Rphson mtho (4 itrtion us in simultions) us in this simultion r shown in igur 5. Figur 6 shows irns mong orrltion thniqu n moii Joi mtho. In this s or moii Joi lgorithm is implmnt with vrg 9 itrtion or olumn 5 ignvtor Frquny (Hz) Frquny (Hz)
5 Angl ( ) Amplitu Mgnitu irn o ignvtor olumn 5 (%) Angl ( ) Amplitu Mgnitu irn o ignvtor olumn 5 (%) Angl ( ) Angl ( ) Amplitu Amplitu Frquny (Hz) Frquny (Hz) Fig. 4. Amplitu n ngl o ignvtors to 6 or unrgroun l Frquny (Hz) Fig. 5. Mgnitu irn o Nwton-Rphson (itr. 4) ompr to Corrltion thniqu Frquny (Hz) Frquny (Hz) 8 x Frquny (Hz) Fig. 6. Mgnitu irn o Joi mtho (vrg itrtion 9) ompr to Corrltion thniqu Similrly, or ovrh lins, lultion o mtris n Z r lso implmnt in mtl throughout sm rng o rqunis. For ovrh lins xplntions out mos o propgtion r similr with ls. Figur 8 shows ontinuous n smooth untion o mol vloity or our nturl mos o propgtion (zro squn mos n intronutor mos) or ovrh lins with ssumption o uniorm soil rsistivity. At high rqunis
6 Angl ( ) Angl ( ) Amplitu Amplitu Mol vloity (m/s) Angl ( ) Amplitu Angl ( ) Amplitu mol vloity or ll mos hs mount nr sp o light. Physil n gomtry t or thr phs ovrh lin with on sky wir is shown in igur 7. Figur 9 shows lultion untions o ngl n mplitu o our ignvtors sl in orn with stion IV. 3, Sky wir 2,5 3,5 3, m 2,2 m 2,2 m 3,8 m Conutors: n= 3 r C = 9.48 mm R C =.88 Ω/km Sky wir: n= r w = 6.97 mm R w =.342 Ω/km Lin lngth: 5 km Frquny (Hz).5 ρ rth = Ωm Fig. 7. Dt n gomtry or kv thr phs ovrh lin 3 x Frquny (Hz) Fig. 8. Mol vloity hrtristis o nturl mos o propgtion or th kv ovrh lins without mo swithing Frquny (Hz) Frquny (Hz) Frquny (Hz) Fig. 9. Amplitu n ngl o ignvtors to 4 or ovrh lin VI. CONCLUSIONS This ppr provis rviw, implmnttion n simultion xmpls o mthos or ling with mo swithing in
7 mol trnsmission lin thory. Th mthos rport in litrtur r: moii Joi lgorithm, Nwton Rphson mtho n orrltion thniqu. All mthos n sily implmnt in EMTP progrms n prou smooth n ontinuous untions o ignvlus n ignvtors throughout wi rng o rqunis. Th omprison twn mthos using ormntion unrgroun ls n ovrh lins shows tht irns r ngligil ut utur nlysis with mor omplit gomtry mols o ls (pip typ l n othrs) n ovrh lins n to invstigt. Aoring to rport litrtur mo swithing is importnt to solv only in mol omins FD mols us ignvtors untions n to ontinuous n smooth throughout wi rng o rqunis. I phs mols r us thn mo swithing is not importnt. Nwton-Rphson mtho n moii Joi mtho utiliz ignvtors lultion rom prvious rquny stp n tht is rson wy untions r smooth, ontinuous n th lultion pross is vry st. Corrltion mtho uss trking lgorithm in orr to rogniz mo swithing. VII. REFERENCES [] L. Mrti, "Simultion o trnsints in unrgroun ls with rquny pnnt mol trnsormtion mtris," IEEE Trns. on Powr Dlivry, vol. 3, pp. 99-, July 988. [2] L. Mrti, "Simultion o ltromgnti trnsints in unrgroun ls with rquny pnnt mol trnsormtion mtris," Ph.D issrttion, Th Univrsity o British Columi, Nov [3] L. M. Wpohl, H. V. Nguyn, G. D. Irwin, "Frquny pnnt trnsormtion mtris or untrnspos trnsmission lins using Nwton-Rphson mtho," IEEE Trns. on Powr Systms, vol., No.3, pp , Aug [4] S. Nvrtnm, "Sris impn n shunt mittn mtris o n unrgroun l systm," Ph.D issrttion, Th Univrsity o British Columi, Nov [5] O. R. Lnos, J. L. Nro, J. A. G. Rols, "An vn trnsmission lin n l mol in Mtl or th simultion o powr-systm trnsints, Mtl A Funmntl Tool or sintii omputing n nginring pplitions,",vol, Inth, Spt. 22. [6] A. Morh, B. Gustvsn, M. Trtii, "A univrsl mol or urt lultion o ltromgnti trnsints, on ovrh lins n unrgroun ls", IEEE trns., on Powr Dlivry, July 999. [7] T. C. u, "Full rquny pnnt molling o unrgroun ls or ltromgnti trnsint nlysis," Ph.D issrttion, Th Univrsity o British Columi, Sp. 2. [8] R. W. Hornk, Numril mthos, Quntum Pulishrs, pp , 98.
(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 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 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 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 informationPresent state Next state Q + M N
Qustion 1. An M-N lip-lop works s ollows: I MN=00, th nxt stt o th lip lop is 0. I MN=01, th nxt stt o th lip-lop is th sm s th prsnt stt I MN=10, th nxt stt o th lip-lop is th omplmnt o th prsnt stt I
More 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 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 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 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 informationOpenMx 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 informationDEVELOPING COMPUTER PROGRAM FOR COMPUTING EIGENPAIRS OF 2 2 MATRICES AND 3 3 UPPER TRIANGULAR MATRICES USING THE SIMPLE ALGORITHM
Fr Est Journl o Mthtil Sins (FJMS) Volu 6 Nur Pgs 8- Pulish Onlin: Sptr This ppr is vill onlin t http://pphjo/journls/jsht Pushp Pulishing Hous DEVELOPING COMPUTER PROGRAM FOR COMPUTING EIGENPAIRS OF MATRICES
More informationCSC Design and Analysis of Algorithms. Example: Change-Making Problem
CSC 801- Dsign n Anlysis of Algorithms Ltur 11 Gry Thniqu Exmpl: Chng-Mking Prolm Givn unlimit mounts of oins of nomintions 1 > > m, giv hng for mount n with th lst numr of oins Exmpl: 1 = 25, 2 =10, =
More information, 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 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 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 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 informationModule 2 Motion Instructions
Moul 2 Motion Instrutions CAUTION: Bor you strt this xprimnt, unrstn tht you r xpt to ollow irtions EXPLICITLY! Tk your tim n r th irtions or h stp n or h prt o th xprimnt. You will rquir to ntr t in prtiulr
More 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 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 informationA 4-state solution to the Firing Squad Synchronization Problem based on hybrid rule 60 and 102 cellular automata
A 4-stt solution to th Firing Squ Synhroniztion Prolm s on hyri rul 60 n 102 llulr utomt LI Ning 1, LIANG Shi-li 1*, CUI Shung 1, XU Mi-ling 1, ZHANG Ling 2 (1. Dprtmnt o Physis, Northst Norml Univrsity,
More 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 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 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 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 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 informationS i m p l i f y i n g A l g e b r a SIMPLIFYING ALGEBRA.
S i m p l i y i n g A l g r SIMPLIFYING ALGEBRA www.mthltis.o.nz Simpliying SIMPLIFYING Algr ALGEBRA Algr is mthmtis with mor thn just numrs. Numrs hv ix vlu, ut lgr introus vrils whos vlus n hng. Ths
More 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 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 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 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 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 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 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 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 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 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 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 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 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 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 informationOutline. Binary Tree
Outlin Similrity Srh Th Binry Brnh Distn Nikolus Austn nikolus.ustn@s..t Dpt. o Computr Sins Univrsity o Slzur http://rsrh.uni-slzur.t 1 Binry Brnh Distn Binry Rprsnttion o Tr Binry Brnhs Lowr Boun or
More informationECE 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 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 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 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 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 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 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 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 informationAn Efficient FPGA Implementation of the Advanced Encryption Standard Algorithm G. Mohan 1 K. Rambabu 2
IJSRD - Intrntionl Journl or Sintii Rsrh & Dvlopmnt Vol., Issu, ISSN (onlin): - An Eiint FPGA Implmnttion o th Avn Enryption Stnr Algorithm G. Mohn K. Rmu M.Th Assistnt Prossor Dprtmnt o Eltronis n ommunition
More 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 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 informationNefertiti. Echoes of. Regal components evoke visions of the past MULTIPLE STITCHES. designed by Helena Tang-Lim
MULTIPLE STITCHES Nrtiti Ehos o Rgl omponnts vok visions o th pst sign y Hln Tng-Lim Us vrity o stiths to rt this rgl yt wrl sign. Prt sping llows squr s to mk roun omponnts tht rp utiully. FCT-SC-030617-07
More 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 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 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 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 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 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 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 informationHIGHER ORDER DIFFERENTIAL EQUATIONS
Prof Enriqu Mtus Nivs PhD in Mthmtis Edution IGER ORDER DIFFERENTIAL EQUATIONS omognous linr qutions with onstnt offiints of ordr two highr Appl rdution mthod to dtrmin solution of th nonhomognous qution
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 informationDETAIL 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 informationA PROPOSAL OF FE MODELING OF UNIDIRECTIONAL COMPOSITE CONSIDERING UNCERTAIN MICRO STRUCTURE
18 TH INTERNATIONAL CONFERENCE ON COMPOSITE MATERIALS A PROPOSAL OF FE MODELING OF UNIDIRECTIONAL COMPOSITE CONSIDERING UNCERTAIN MICRO STRUCTURE Y.Fujit 1*, T. Kurshii 1, H.Ymtsu 1, M. Zo 2 1 Dpt. o Mngmnt
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 informationDecimals 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 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 informationCompression. Compression. Compression. This part of the course... Ifi, UiO Norsk Regnesentral Vårsemester 2005 Wolfgang Leister
Kurs INF5080 Ifi, UiO Norsk Rgnsntrl Vårsmstr 2005 Wolfgng Listr This prt of th ours...... is hl t Ifi, UiO... (Wolfgng Listr) n t ontins mtril from Univrsity Collg Krlsruh (Ptr Ol, Clmns Knorzr) Informtion
More informationFloating Point Number System -(1.3)
Floting Point Numbr Sstm -(.3). Floting Point Numbr Sstm: Comutrs rrsnt rl numbrs in loting oint numbr sstm: F,k,m,M 0. 3... k ;0, 0 i, i,...,k, m M. Nottions: th bs 0, k th numbr o igits in th bs xnsion
More informationFloating Point Number System -(1.3)
Floting Point Numbr Sstm -(.3). Floting Point Numbr Sstm: Comutrs rrsnt rl numbrs in loting oint numbr sstm: F,k,m,M 0. 3... k ;0, 0 i, i,...,k, m M. Nottions: th bs 0, k th numbr o igts in th bs xnsion
More informationDUET WITH DIAMONDS COLOR SHIFTING BRACELET By Leslie Rogalski
Dut with Dimons Brlt DUET WITH DIAMONDS COLOR SHIFTING BRACELET By Lsli Roglski Photo y Anrw Wirth Supruo DUETS TM from BSmith rt olor shifting fft tht mks your work tk on lif of its own s you mov! This
More informationCORNER LAYER PROPERTIES AND INTERMEDIATE ASYMPTOTICS OF WAITING TIME SOLUTIONS OF NONLINEAR DIFFUSION EQUATIONS ABSTRACT
CORNER LAYER PROPERTIES AND INTERMEDIATE ASYMPTOTICS OF WAITING TIME SOLUTIONS OF NONLINEAR DIFFUSION EQUATIONS Crlos A. Przzo, Cluio L. M. Vigo 2 n Julio Grtton 2* Univrsi Fvloro, Solís 453, 78, Bunos
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 informationC-201 Sheet Bar Measures 1 inch
Janine M. lexander, P.. P.. No. 9, L 0 N. PRK RO, SUIT 0 HOLLYWOO, LORI 0 PHON: (9) - X: (9) 08- No.: 9 I ST SRIPTION Y GT VLVS SHLL RSILINT ST, MNUTUR TO MT OR X TH RQUIRMNTS O WW 09 (LTST RVISION) N
More informationlearning objectives learn what graphs are in mathematical terms learn how to represent graphs in computers learn about typical graph algorithms
rp loritms lrnin ojtivs loritms your sotwr systm sotwr rwr lrn wt rps r in mtmtil trms lrn ow to rprsnt rps in omputrs lrn out typil rp loritms wy rps? intuitivly, rp is orm y vrtis n s twn vrtis rps r
More informationProperties of Hexagonal Tile local and XYZ-local Series
1 Proprtis o Hxgonl Til lol n XYZ-lol Sris Jy Arhm 1, Anith P. 2, Drsnmik K. S. 3 1 Dprtmnt o Bsi Sin n Humnitis, Rjgiri Shool o Enginring n, Thnology, Kkkn, Ernkulm, Krl, Ini. jyjos1977@gmil.om 2 Dprtmnt
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 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 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 information5/1/2018. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees
/1/018 W usully no strns y ssnn -lnt os to ll rtrs n t lpt (or mpl, 8-t on n ASCII). Howvr, rnt rtrs our wt rnt rquns, w n sv mmory n ru trnsmttl tm y usn vrl-lnt non. T s to ssn sortr os to rtrs tt our
More informationSAMPLE PAGES. Primary. Primary Maths Basics Series THE SUBTRACTION BOOK. A progression of subtraction skills. written by Jillian Cockings
PAGES Primry Primry Mths Bsis Sris THE SUBTRACTION BOOK A prorssion o sutrtion skills writtn y Jillin Cokins INTRODUCTION This ook is intn to hlp sur th mthmtil onpt o sutrtion in hilrn o ll s. Th mstry
More 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 informationSolutions 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 informationAPPLICATIONS OF THE LAPLACE-MELLIN INTEGRAL TRANSFORM TO DIFFERNTIAL EQUATIONS
Intrntionl Journl o Sintii nd Rrh Publition Volum, Iu 5, M ISSN 5-353 APPLICATIONS OF THE LAPLACE-MELLIN INTEGRAL TRANSFORM TO DIFFERNTIAL EQUATIONS S.M.Khirnr, R.M.Pi*, J.N.Slun** Dprtmnt o Mthmti Mhrhtr
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 informationOrthogonal and Biorthogonal FIR Hexagonal Filter Banks with Sixfold Symmetry
IEEE TRANS. SIGNAL PROC. VOL. 56 NO. 586-58 DEC. 008 Orthogonl n Biorthogonl FIR Hxgonl Filtr Bns with Sixol Symmtry Qingtng Jing Astrt Rntly hxgonl img prossing hs ttrt ttntion. Th hxgonl ltti hs svrl
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 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 informationJonathan Turner Exam 2-10/28/03
CS Algorihm n Progrm Prolm Exm Soluion S Soluion Jonhn Turnr Exm //. ( poin) In h Fioni hp ruur, u wn vrx u n i prn v u ing u v i v h lry lo hil in i l m hil o om ohr vrx. Suppo w hng hi, o h ing u i prorm
More informationNMEA 2000 GATEWAY ASSEMBLY
Noti NOTICE Atr omplting instllti, ths instrutis shoul pl with th prout or th ownr's utur us. NOTICE This oumnt is writtn to i our lrs n ompny srvi prsnl in th propr instllti or srvi o our prouts. Prss
More informationSteinberg s Conjecture is false
Stinrg s Conjtur is als arxiv:1604.05108v2 [math.co] 19 Apr 2016 Vinnt Cohn-Aa Mihal Hig Danil Král Zhntao Li Estan Salgao Astrat Stinrg onjtur in 1976 that vry planar graph with no yls o lngth our or
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 informationGraph Contraction and Connectivity
Chptr 17 Grph Contrtion n Conntivity So r w hv mostly ovr thniqus or solving prolms on grphs tht wr vlop in th ontxt o squntil lgorithms. Som o thm r sy to prllliz whil othrs r not. For xmpl, w sw tht
More information1. Determine whether or not the following binary relations are equivalence relations. Be sure to justify your answers.
Mth 0 Exm - Prti Prolm Solutions. Dtrmin whthr or not th ollowing inry rltions r quivln rltions. B sur to justiy your nswrs. () {(0,0),(0,),(0,),(,),(,),(,),(,),(,0),(,),(,),(,0),(,),(.)} on th st A =
More informationSegmentation and tracking of the electro-encephalogram signal using an adaptive recursive bandpass lter
Sgmnttion n trking o th ltro-nphlogrm signl using n ptiv rursiv npss ltr R. R. Ghri 1,2 A. Cihoki 1,3 1 Lortory or Avn Brin Signl Prossing, Brin Sin Institut, RIKEN, Wko-Shi, Sitm, Jpn 2 Assiut Univrsity,
More informationChem 104A, Fall 2016, Midterm 1 Key
hm 104A, ll 2016, Mitrm 1 Ky 1) onstruct microstt tl for p 4 configurtion. Pls numrt th ms n ml for ch lctron in ch microstt in th tl. (Us th formt ml m s. Tht is spin -½ lctron in n s oritl woul writtn
More informationIntegration 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 information8Algebraic UNCORRECTED SAMPLE PAGES. techniques. What you will learn. Australian curriculum. Chapter 8A 8B 8C 8D 8E 8F
8A 8B 8C 8D 8E 8F 8G 8H 8I 8J 8K Chptr Wht you will lrn 8Algri thniqus Epning inomil prouts Prt squrs n irn o prt squrs Ftorising lgri prssions Ftorising th irn o two squrs Ftoristion y grouping Ftorising
More information