REAL-TIME ESTIMATION OF O-D MATRICES WITH PARTIAL TRAJECTORIES FROM ETC TAG DATA

Size: px
Start display at page:

Download "REAL-TIME ESTIMATION OF O-D MATRICES WITH PARTIAL TRAJECTORIES FROM ETC TAG DATA"

Transcription

1 REAL-TIME ESTIMATION OF O-D MATRICES WITH PARTIAL TRAJECTORIES FROM ETC TAG DATA Jimyoung Kwon 1 Institut of Trnsporttion Stuis Univrsity of Cliforni, Brkly 6 Evns Hll, Brkly, CA Tl: (510)64-1; Fx: (510)64-9 kwon@stt.brkly.u Prvin Vriy Dprtmnt of Elctricl Enginring n Computr Scinc Univrsity of Cliforni, Brkly, Tl:(510)64-50; Fx:(510)64-15 vriy@cs.brkly.u Trnsporttion Rsrch Bor 4 th Annul Mting Jnury 005 Wshington, DC 400 wors (xcluing Figur cptions) Plus Figurs (150) totl 5950 wors 1 Corrsponing uthor

2 Kwon,Vriy 1 ABSTRACT Th origin-stintion (O-D) mtrix of trffic ntwork is usully stimt from link trffic counts combin with smpl survy. Prtilly obsrv vhicl trjctoris obtin with vhicl r-intifiction tchniqus such s lctronic tgs provi nw t sourc for rl-tim O-D mtrix stimtion. Howvr, u to incomplt smpling, ccurt stimtion of O-D mtrics from ths t is not trivil. W vlop sttisticlly soun, unbis stimtor for O-D stimtion, bs on th mtho of momnts. Th lgorithm prforms vry wll unr simultion, compr with simplr stimtors. Appli to t from vhicls with lctronic toll collction tgs in th Sn Frncisco By Ar, th lgorithm proucs rlistic tim sris of th hourly O-D mtrix. Kywors: rl-tim O-D mtrix stimtion; vhicl rintifiction; lctronic toll collction tgs; mtho of momnt stimtion

3 Kwon,Vriy 1 INTRODUCTION Knowlg of th origin-stintion (O-D) mtrix of trffic ntwork is usful for vrious plnning n oprtions tsks. Th mtrix givs th numbr of vhicls trvling btwn iffrnt zons in rgion. Tritionlly, th O-D mtrix is stimt from link trffic counts combin with smpl survy. Approchs to O-D mtrix stimtion using ths t inclu ntwork quilibrium, grvity, n istribution-ssignmnt mols (1). Vhicl loctions obsrv using vhicl r-intifiction tchniqus provi nw t sourc for rl-tim O-D mtrix stimtion. Tchniqus bs on vio imgry, inuctnc loop signturs, n lsrbs systms rport whn n whr crtin vhicl is obsrv (). Similr t my b obtin from vhicls with Elctronic Toll Collction (ETC) tgs n tg rrs instll t vrious loctions in th rgion. ETC tg systms in us inclu th E-Z pss in th Est Cost n FsTrk in th Sn Frncisco By Ar (). Bcus vhicl r-intifiction systms o not tct ll vhicls, vhicl trjctoris r only prtilly obsrv. Du to this incomplt smpling ccurt stimtion of O-D stimtion from such t is not sy, s will b m clr in Sction. This ppr proposs sttisticlly soun, unbis O-D mtrix stimtor, bs on th momnt stimtor from such t. Th rst of th ppr is orgniz s follows. Sction brifly scribs th ETC tg rr systm ploy in th By Ar n points out th smpling problms it crts. Sction scribs th sttisticl mtho in til. Sction 4 invstigts th prformnc of th propos lgorithm using simult t n rl t st from Sn Frncisco By Ar. Sction 5 conclus th ppr. BAY AREA ETC TAG READER SYSTEM Th FsTrk systm oprts ccoring to th Cltrns Titl 1 stnr (4). Th systm hs two lmnts, rr n trnsponr. Th rr is mount on pol, th trnsponr is mount on th vhicl winshil. Th rr trnsmits RF triggr puls to turn th trnsponr on. Aftr short tim ly, th rr trnsmits n nco, polling signl, which, upon tction n coing by th trnsponr, provis initil informtion to th trnsponr incluing th typ of trnsction th rr wishs to conuct. Th rr thn trnsmits n unmoult CW (continuous wv) RF signl for th trnsponr to moult with rply t mssg, incluing th trnsponr ID, whil bckscttring to th rr. Th rr thn trnsmits n nco cknowlg mssg n rqusts tht th trnsponr not rspon to th sm polling mssg gin for 10 scons (4). A rr systm srvs four trnsponr-ring loctions, ch with its own ntnn (5). In th By Ar ploymnt, ll four ntnns r mount on th sm sign structur, loct in th frwy ivir. Thr of th four ntnns point in on frwy irction th mjor irction, n on ntnn points in th opposit irction th minor irction. Th r covr in th minor irction, n th numbr of tct vhicls, is consquntly smllr. Th ntnns r mount t hight of btwn 16 n 4 ft, unlik t th toll booth whr th ntnn is clos to th vhicl. As rsult, only frction of tgg vhicls r tct. Th pssg of tgg vhicl gnrts rcor, comprising scrmbl vrsion of th tg (to protct privcy) n squnc of rr loctions whr th vhicl is tct n th corrsponing tim stmp. Th rsulting t st is incomplt for two rsons. First, th pntrtion rt, th frction of vhicls tht crry tgs, is btwn 15 n 40 prcnt, pning on th tim of y. Scon, th tction

4 Kwon,Vriy rt, th frction of tgg vhicls tht r tct by rr is bout 0% in th mjor irction n 40% in th minor irction. Consquntly, if tgg vhicl psss unr svrl rrs, only som of ths my tct it. A propr sttisticl nlysis must tk into ccount th incompltnss of th t. METHOD Consir rgion comprising svrl zons, inx j = 1,, J. For two zons or nos j n k, writ j k if j is immitly upstrm of k. This rltion fins n g in th frwy ntwork viw s irct grph (6). An O-D pir is ny pir [j, k], somtims writtn [jk]. Not tht j = k is llow, in which cs w simply writ [j]. A pth is squnc of nos (j 1,, j A ) connct by gs. An O-D pir [j, k] is trvrsbl if pth xists strting from j n ning t k. It is uniquly trvrsbl if such pth is uniqu. A pth contins nothr pth if th lttr is inclu in th formr. An O-D pir contins nothr O-D pir if ny pth tht contins th lttr is contin by pth for th formr. W ssum th frwy ntwork stisfis th following rquirmnts: 1. Th grph is connct, i.., thr is pth conncting vry pir of nos;. An O-D pir is uniquly trvrsbl if it is trvrsbl;.th grph hs no cycl,i.., pth which strts n ns t th sm no. W iscuss how to rlx ths rquirmnts in Sction 4. Inx tim prios, sy hours of th y by t = 1,, T. Dnot by N(t) th totl numbr of vhicls tht mk trip uring t. Inx vhicls by i = 1,, N(t). Ths vhicls r group into isjoint sts of vhicls corrsponing to iffrnt O-D pirs. Th O-D volum btwn zons j n k uring prio tis not by N jk (t). At t th O-D mtrix is simply {N jk (t), j, k = 1,, J}. Lt ψ b th pntrtion probbility, i.., th probbility tht n iniviul vhicl is quipp with tg. Lt π j b th probbility tht cr with tg trvling th link j is tct by th tg rr. W ssum tht for vry vhicl, rgrlss of its O-D, th vnt tht it is quipp with tg n th vnt tht it is tct r inpnnt. Although our nrrtion is in trms of lctronic tgs, similr formultion pplis with othr vhicl rintifiction tchniqus. For n O-D pir [j, k], w fin M[jk] = Numbr of crs tct t j n k but not bfor j nor ftr k. (1) Not tht trms lik bfor (ftr) zon r wll fin thnks to rquirmnts bov on th frwy ntwork. W cn rwrit M[jk] s th sum M[jk] = 1(vhicl i hs O-D pth [l, m] () [l,m] i n vhicl i is quipp with tg n vhicl i is tct t j n k but not bfor j nor ftr k) ovr ll vhicls i ovr ll O-D pirs [lm] tht contin [jk]. Th nottion 1( ) is th inictor function. Although th ccounting intity () pprs complict, it llows th computtion of vrious momnts in xplicit form. Th xpcttion is givn by EM[j, k] = {N lm p l(jk)m : ovr ll O-D pirs [l, m] tht contin [j, k]}. ()

5 Kwon,Vriy 4 Hr p l(jk)m = (1 π l ) (1 π j 1 )π j π k (1 π k+1 ) (1 π m ) (4) is th probbility tht vhicl with pth [l, m] is tct t j n k but not bfor j nor ftr k. Similrly, th lmnts of th vrinc-covrinc mtrix of th lmnts of M r Cov(M[j, k], M[j, k ]) = {N lm ψ [ 1([jk] = [j k ] ])p l(jk)m p l(jk)m p l(j k )m (5) : ovr ll O-D pirs [l, m] tht contin both [j, k] n [j, k ]} Dfin th vctors M = (M[jk] : for ll O-D pirs [jk]), (6) N = (N[jk] : for ll O-D pirs [jk]). () For lrg numbr of vhicls N jk, by th Cntrl Limit Thorm, M pproximtly hs multivrit norml istribution, M N(AN, Σ(N)), () in which th mtrix A n th function Σ( ) r spcifi by () n (5) rspctivly. Sinc hols, th mtho of momnt stimtor () of th unknown N is givn by E(M) = AN (9) η = A 1 M. (10) Th pproximt rror istribution of th stimtor η cn b obtin from ()-(10) s η N(N, A 1 Σ(N)(A 1 ) T ). Computing Σ(N) is complict, n so w us th bootstrp procur () to stimt th rror of th stimtor. Givn n stimt η, on simults bootstrp smpls M (b), b = 1,, B, for lrg B, ssuming η to b th tru prmtr. For ch of ths bootstrp smpls, on stimt η (b) gin n uss th bis n stnr rror of th bootstrp smpl s n stimt of th bis n stnr rror of th stimtor itslf. ANALYSIS W pply th lgorithm to simult t st s wll s th rl ETC tg t from Sn Frncisco By Ar. Simultion Consir rgion with thr zons j = 1,,. Th frwy ntwork is fin by gs 1 n. Th six O-D pirs r list in Tbl 1, togthr with th pths contining thm. Evn for this simpl ntwork, ll O-D pirs xcpt [1, ] r contin in multipl pths. Assum th tction probbility is 0.5 for ll thr rrs, i.. π 1 = π = π = 0.5 n N jk = 1, 000 for ll O-D [j, k]. Also ssum ll vhicls r quipp with tg, so th pntrtion rt ψ = 1. W simult M jk s th sum of bionmil rnom vribls with istribution bin(n lm, ψp lm ), summ ovr ll O-D pir [l, m] contining pth [j, k].

6 Kwon,Vriy 5 For comprison, w lso comput th niv stimtor η jk = Numbr of vhicls tht r obsrv t both j n k π j π k. (11) Th niv stimtor givs rough i bout th numbr of vhicls tht trvl btwn two loctions, but it is obviously incorrct for stimtion of N. Figur 1 n Tbl show th istribution of th stimts from th two mthos stimt with 00 simultion runs. Momnt stimtors r vry ccurt, xhibiting lss thn 1% bis for ll O-D pirs. Th rltiv rrors r lss thn 10%. As xpct, th niv stimtor prforms vry poorly by comprison. Excpt for O-D pir [1, ], it hs hug biss. On th othr hn, thir stnr rrors r of similr mgnitu s thos of th momnt stimtors. To summriz, niv pproch cnnot b us for nlysis of O-D pttrns, whil th momnt stimtor provis vry ccurt stimts for ll O-D pirs. By Ar ETC Dt Figur shows th topology of th frwy ntwork n ntnn loctions, which cn b viw s zon lbls. Th t wr collct ovr 4-hours of Thursy, 4 July, 00. Th currnt rr covrg is incomplt. It only inclus th northrn prt of Est By n smll prt of Sn Frncisco. Thus, for xmpl, zon inclus not only th r btwn zons n 9 but lso th hug r tht lis byon 50 Wst. Th rr covrg is bing xtn. Th grph rprsnttion shows ll th nos n gs. If w llow trips btwn nos (st n wst) n 5 (north n south), not by rrows in sh lins, thr r cycls (E 5N E n W W 5S), so w o not llow ths trips. For illustrtion, w consir only stboun/southboun trffic involving nos 1E, E, E, 9E, 5S, n E (gry nos). Th grph is thn compltly scrib by fiv gs: 1 5, 1,,, n 9. Thr r J = 6 nos n 15 trvrsbl O-Ds. For ch O-D (pth), th st of contining O-Ds (pths) is shown in Tbl. Not tht th pth-contining rltionship is much mor complict thn th ntwork consir for simultion. Th pntrtion rt ψ is tkn to b 15% n w us this vlu in th ppliction. Th tction rt prmtrs π j r stimt using th totl volum t obtin from th loop tctors instll t th loction clos to ch ntnns. W us th PMS systm () to obtin th loop t. From ths t, w fin π j = 0. for ll loctions. W first pply th lgorithm to stimt th O-D mtrix for th whol 4-hour prio. Tbl 4 shows th stimts n th bootstrp stimts of its bis n vrinc. Most biss r controll unr 1% of th stimts n th rltiv rrors unr 5%, xcpt for O-Ds [1, 1] n [, ]. Figur shows th bootstrp istribution of th stimts. W thn stimt hourly O-D mtrics by splitting smpls into hours ccoring to th vhicl s lst obsrv timstmp n pplying th lgorithm for ch hourly smpls. Figur 4 show th rsult. Th trn clrly rvls th chnging pttrn of vhicl trvl mn for ch O-D pir ovr th y. For xmpl, th O-D [1, ] (Sn Frncisco to Est By) [5] (Est By to Sn Jos) hs highr mn in th morning whil th O-D [] (Est By to Richmon) n [9] (Northst By to Th Crquins brig) hs highr mn in th vning. 5 DISCUSSION AND CONCLUSION W vlop mtho of momnts lgorithm for stimting tim-vrying OD mtrics from prtilly obsrv vhicl trjctoris t, togthr with bootstrp procur to stimt th stnr rror of th stimtor.

7 Kwon,Vriy 6 W rstrict our ttntion to frwys with rltivly simpl topology, in which th corrsponing grph is connct, ll trvrsbl O-Ds r uniquly trvrsbl, n thr is no cycl. Ths rquirmnts r too strict for mny rl worl frwy ntworks n cn b rlx with vrying ifficulty. For isconnct grph, on only ns to compos it into connct componnts n pply th lgorithm to ch componnt. For non-uniquly trvrsbl O-Ds, th ccounting qution () ns to b ppropritly moifi. If th rout choic probbilitis r known, such moifiction is rltivly strightforwr, but if thy r unknown, thy bcom xtr prmtrs in th mol n th xtnsion is not trivil nymor. Whn thr r cycls, on promising pproch woul b to rmov non-likly pths from consirtion to ruc th imnsion of M n N n simplify A. Ovrll, ths r ll intrsting chllngs n w r currntly working on xtning th currnt lgorithm to cop with such complx ntworks. Th propos lgorithm prform wll. Th simultion stuy shows tht th propos momnt stimtor n bootstrp stnr rrors r ccurt unr il sttings. Th ppliction to t from vhicls quipp with ETC trnsponrs n rrs instll t vrious loctions in Sn Frncisco By Ar, ls to cribl hourly OD mtrics. Combin with th wir ploymnt of tg rrs n grtr pntrtion of tgs in th vhicl popultion, th propos mthos woul nbl istrict-wi O-D rl-tim rporting in timly n ccurt mnnr. ACKNOWLEDGEMENT This stuy is prt of th PMS projct, which is support by grnts from Cltrns to th Cliforni PATH Progrm. W r vry grtful to John Wolf of Cltrns for his support. W thnk th Mtropolitn Trnsporttion Commision n Cho Chn for hlp in scuring th ETC t. Th contnts of this ppr rflct th viws of th uthors who r rsponsibl for th fcts n th ccurcy of th t prsnt hrin. Th contnts o not ncssrily rflct th officil viws of or policy of th Cliforni Dprtmnt of Trnsporttion. This ppr os not constitut stnr, spcifiction or rgultion. REFERENCES [1] T. Abrhmsson. Estimtion of Origin-Dstintion Mtrics using Trffic Counts A Litrtur Survy. Tchnicl Rport IR-901, Intrntionl Institut for Appli Systms Anlysis, ccss /19/004. [] C. Oh, S.G. Ritchi, n R. Jykrishnn. Rl-Tim Origin-Dstintion (OD) Estimtion vi Anonymous Vhicl Trcking. Tchnicl Rport Ppr UCI-ITS-TS-WP-0-0, Cntr for Trffic Simultion Stuis. Univrsity of Cliforni, Irvin., 00. [] Fstrk wbsit. ccss /19/004. [4] Cliforni Dprtmnt of Trnsporttion. lcsys/titl1/ocs/t1upt.htm, ccss /19/004. [5] Sirit Tchnologis. Automtic Vhicl Intifiction. Intity Flx Instlltion Mnul, n. [6] S. Evn. Grph Algorithms. Computr Scinc Prss, 199. [] P. Bickl n K.A. Doksum. Mthmticl Sttistics: Bsis Is n Slct Topics. Prntic-Hll, 000.

8 Kwon,Vriy [] PMS wbsit.

9 Kwon,Vriy LIST OF TABLES 1 O-D pth n pths contining th O-D pth for th simult linr frwy Bis n stnr rror of th Momnt n Niv Estimtors from simultion with 00 runs whn tru N = 1, O-D pth n pths tht contining th O-D pth for th By Ar ntwork Estimt of 4-hour O-D mtrix n stnr rrors from By Ar ETC t for 4 July,

10 Kwon,Vriy 9 LIST OF FIGURES 1 Simultion rsults for mtho of momnt stimtor (top) n niv stimtor (bottom). For ch O-D pir, th istribution of th stimtor is shown s boxplot. Th vrticl lin is th tru vlu N jk = 1, Mp of th Stuy Sit in Sn Frncisco By Ar with pproximt loction of th tg rrs (lft) n grph rprsnttion of th frwy Momnt stimtor n bootstrp istribution of th stimtor for By Ar t Estimt of hourly O-D volums for By Ar t. Two blck soli lins corrspon to O-D pirs (1,) n (5) tht hv highr morning trffic n blck ott lins corrspon to () n (9) tht hv highr vning trffic

11 Kwon,Vriy 10 TABLE 1 O-D pth n pths contining th O-D pth for th simult linr frwy O-D pth Pths contining th O-D pth (1) (1), (1,), (1,,) (1,) (1,), (1,,) (1,,) (1,,) () (1,), (1,,), (), (,) (,) (1,,), (,) () (1,,), (,), ()

12 Kwon,Vriy 11 TABLE Bis n stnr rror of th Momnt n Niv Estimtors from simultion with 00 runs whn tru N = 1, 000 Bis SE O-D Momnt Niv Momnt Niv pir Estimtor Estimtor 1, , , , , ,

13 Kwon,Vriy 1 TABLE O-D pth n pths tht contining th O-D pth for th By Ar ntwork O-D pth Pths contining th O-D pth (1) (1), (1,), (1,,), (1,,,9), (1,,), (1,5) (1,) (1,), (1,,), (1,,,9), (1,,) (1,,) (1,,), (1,,,9) (1,,,9) (1,,,9) (1,,) (1,,) (1,5) (1,5) () (1,,), (1,,,9), (), (,9), (,), (,,9) (,9) (1,,,9), (,9), (,,9) () (1,), (1,,), (1,,,9), (1,,), (), (,), (,,9), (,) (,) (1,,), (1,,,9), (,), (,,9) (,,9) (1,,,9), (,,9) (,) (1,,), (,) (5) (1,5), (5) () (1,,), (,), () (9) (1,,,9), (,9), (,,9), (9)

14 Kwon,Vriy 1 TABLE 4 Estimt of 4-hour O-D mtrix n stnr rrors from By Ar ETC t for 4 July, 00 O-D Momnt Bootstrp Bootstrp Bootstrp Bootstrp pth Estimtor Bis Rltiv S.E Rltiv (vhicls/y) Bis Error (1) (1,) (1,,) (1,,,9) (1,,) (1,5) () (,9) () (,) (,,9) (,) (5) () (9)

15 Kwon,Vriy 14 Momnt Estimtor,, O D pir, 1, 1, 1, Niv Estimtor,, O D pir, 1, 1, 1, FIGURE 1 Simultion rsults for mtho of momnt stimtor (top) n niv stimtor (bottom). For ch O-D pir, th istribution of th stimtor is shown s boxplot. Th vrticl lin is th tru vlu N jk = 1, 000.

16 Kwon,Vriy 15 Rt 4 (9) 0 9W 9E 50 I 50 split () 4/90 split () 4 50 W E W E 50 E&W split () split (5) W E 5N 5S By Brig 1W 1E 5th St (1) FIGURE Mp of th Stuy Sit in Sn Frncisco By Ar with pproximt loction of th tg rrs (lft) n grph rprsnttion of th frwy.

17 Kwon,Vriy ,,,9, O D,9 1,5 1,, 1,,,9 1,, 1, Volum FIGURE Momnt stimtor n bootstrp istribution of th stimtor for By Ar t.

18 Kwon,Vriy 1 Estimt O D Counts (vh/hour) , 1,, 4 1,,,9 5 1,, 6 1,5,9 9 0,,,9 b, c 5 9 c c c 9 c c c c c c c c c c c c b c b 6 6 b b c c c b 9 4 b b b c b b b b b b b b b c c c b b b b b b Tim of Dy (Hour) FIGURE 4 Estimt of hourly O-D volums for By Ar t. Two blck soli lins corrspon to O-D pirs (1,) n (5) tht hv highr morning trffic n blck ott lins corrspon to () n (9) tht hv highr vning trffic.

Walk Like a Mathematician Learning Task:

Walk Like a Mathematician Learning Task: Gori Dprtmnt of Euction Wlk Lik Mthmticin Lrnin Tsk: Mtrics llow us to prform mny usful mthmticl tsks which orinrily rquir lr numbr of computtions. Som typs of problms which cn b on fficintly with mtrics

More information

ME 522 PRINCIPLES OF ROBOTICS. FIRST MIDTERM EXAMINATION April 19, M. Kemal Özgören

ME 522 PRINCIPLES OF ROBOTICS. FIRST MIDTERM EXAMINATION April 19, M. Kemal Özgören ME 522 PINCIPLES OF OBOTICS FIST MIDTEM EXAMINATION April 9, 202 Nm Lst Nm M. Kml Özgörn 2 4 60 40 40 0 80 250 USEFUL FOMULAS cos( ) cos cos sin sin sin( ) sin cos cos sin sin y/ r, cos x/ r, r 0 tn 2(

More information

Lecture 11 Waves in Periodic Potentials Today: Questions you should be able to address after today s lecture:

Lecture 11 Waves in Periodic Potentials Today: Questions you should be able to address after today s lecture: Lctur 11 Wvs in Priodic Potntils Tody: 1. Invrs lttic dfinition in 1D.. rphicl rprsnttion of priodic nd -priodic functions using th -xis nd invrs lttic vctors. 3. Sris solutions to th priodic potntil Hmiltonin

More information

TOPIC 5: INTEGRATION

TOPIC 5: INTEGRATION TOPIC 5: INTEGRATION. Th indfinit intgrl In mny rspcts, th oprtion of intgrtion tht w r studying hr is th invrs oprtion of drivtion. Dfinition.. Th function F is n ntidrivtiv (or primitiv) of th function

More 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

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

2-D ARMA MODEL PARAMETER ESTIMATION BASED ON THE EQUIVALENT 2-D AR MODEL APPROACH

2-D ARMA MODEL PARAMETER ESTIMATION BASED ON THE EQUIVALENT 2-D AR MODEL APPROACH -D AMA MODEL PAAMETE ESTIMATION BASED ON THE EQUIVALENT -D A MODEL APPOAH Ayın Kıılky Ahmt Hmi Kyrn -mil: yin@hituutr -mil: kyrn@hituutr Istnul Tchnicl Univrsity, Fculty of Elctricl n Elctronics Enginring,

More information

Section 3: Antiderivatives of Formulas

Section 3: Antiderivatives of Formulas Chptr Th Intgrl Appli Clculus 96 Sction : Antirivtivs of Formuls Now w cn put th is of rs n ntirivtivs togthr to gt wy of vluting finit intgrls tht is ct n oftn sy. To vlut finit intgrl f(t) t, w cn fin

More information

12/3/12. Outline. Part 10. Graphs. Circuits. Euler paths/circuits. Euler s bridge problem (Bridges of Konigsberg Problem)

12/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 information

Instructions for Section 1

Instructions for Section 1 Instructions for Sction 1 Choos th rspons tht is corrct for th qustion. A corrct nswr scors 1, n incorrct nswr scors 0. Mrks will not b dductd for incorrct nswrs. You should ttmpt vry qustion. No mrks

More information

5/9/13. Part 10. Graphs. Outline. Circuits. Introduction Terminology Implementing Graphs

5/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 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

Minimum Spanning Trees

Minimum Spanning Trees Minimum Spnning Trs Minimum Spnning Trs Problm A town hs st of houss nd st of rods A rod conncts nd only houss A rod conncting houss u nd v hs rpir cost w(u, v) Gol: Rpir nough (nd no mor) rods such tht:

More information

Floating Point Number System -(1.3)

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

Floating Point Number System -(1.3)

Floating 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 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

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

Linear Algebra Existence of the determinant. Expansion according to a row.

Linear Algebra Existence of the determinant. Expansion according to a row. Lir Algbr 2270 1 Existc of th dtrmit. Expsio ccordig to row. W dfi th dtrmit for 1 1 mtrics s dt([]) = (1) It is sy chck tht it stisfis D1)-D3). For y othr w dfi th dtrmit s follows. Assumig th dtrmit

More information

CSE303 - Introduction to the Theory of Computing Sample Solutions for Exercises on Finite Automata

CSE303 - Introduction to the Theory of Computing Sample Solutions for Exercises on Finite Automata CSE303 - Introduction to th Thory of Computing Smpl Solutions for Exrciss on Finit Automt Exrcis 2.1.1 A dtrministic finit utomton M ccpts th mpty string (i.., L(M)) if nd only if its initil stt is finl

More information

Chem 104A, Fall 2016, Midterm 1 Key

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

The second condition says that a node α of the tree has exactly n children if the arity of its label is n.

The second condition says that a node α of the tree has exactly n children if the arity of its label is n. CS 6110 S14 Hanout 2 Proof of Conflunc 27 January 2014 In this supplmntary lctur w prov that th λ-calculus is conflunt. This is rsult is u to lonzo Church (1903 1995) an J. arkly Rossr (1907 1989) an is

More information

a b c cat CAT A B C Aa Bb Cc cat cat Lesson 1 (Part 1) Verbal lesson: Capital Letters Make The Same Sound Lesson 1 (Part 1) continued...

a b c cat CAT A B C Aa Bb Cc cat cat Lesson 1 (Part 1) Verbal lesson: Capital Letters Make The Same Sound Lesson 1 (Part 1) continued... Progrssiv Printing T.M. CPITLS g 4½+ Th sy, fun (n FR!) wy to tch cpitl lttrs. ook : C o - For Kinrgrtn or First Gr (not for pr-school). - Tchs tht cpitl lttrs mk th sm souns s th littl lttrs. - Tchs th

More 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

, between the vertical lines x a and x b. Given a demand curve, having price as a function of quantity, p f (x) at height k is the curve f ( x,

, between the vertical lines x a and x b. Given a demand curve, having price as a function of quantity, p f (x) at height k is the curve f ( x, Clculus for Businss nd Socil Scincs - Prof D Yun Finl Em Rviw vrsion 5/9/7 Chck wbsit for ny postd typos nd updts Pls rport ny typos This rviw sht contins summris of nw topics only (This rviw sht dos hv

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

Errata for Second Edition, First Printing

Errata for Second Edition, First Printing Errt for Scond Edition, First Printing pg 68, lin 1: z=.67 should b z=.44 pg 71: Eqution (.3) should rd B( R) = θ R 1 x= [1 G( x)] pg 1: Eqution (.63) should rd B( R) = x= R = θ ( x R) p( x) R 1 x= [1

More information

Errata for Second Edition, First Printing

Errata for Second Edition, First Printing Errt for Scond Edition, First Printing pg 68, lin 1: z=.67 should b z=.44 pg 1: Eqution (.63) should rd B( R) = x= R = θ ( x R) p( x) R 1 x= [1 G( x)] = θp( R) + ( θ R)[1 G( R)] pg 15, problm 6: dmnd of

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

Garnir Polynomial and their Properties

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

SOLVED EXAMPLES. be the foci of an ellipse with eccentricity e. For any point P on the ellipse, prove that. tan

SOLVED EXAMPLES. be the foci of an ellipse with eccentricity e. For any point P on the ellipse, prove that. tan LOCUS 58 SOLVED EXAMPLES Empl Lt F n F th foci of n llips with ccntricit. For n point P on th llips, prov tht tn PF F tn PF F Assum th llips to, n lt P th point (, sin ). P(, sin ) F F F = (-, 0) F = (,

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

13. Binary tree, height 4, eight terminal vertices 14. Full binary tree, seven vertices v 7 v13. v 19

13. Binary tree, height 4, eight terminal vertices 14. Full binary tree, seven vertices v 7 v13. v 19 0. Spnning Trs n Shortst Pths 0. Consir th tr shown blow with root v 0.. Wht is th lvl of v 8? b. Wht is th lvl of v 0? c. Wht is th hight of this root tr?. Wht r th chilrn of v 0?. Wht is th prnt of v

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

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

FSA. CmSc 365 Theory of Computation. Finite State Automata and Regular Expressions (Chapter 2, Section 2.3) ALPHABET operations: U, concatenation, *

FSA. CmSc 365 Theory of Computation. Finite State Automata and Regular Expressions (Chapter 2, Section 2.3) ALPHABET operations: U, concatenation, * CmSc 365 Thory of Computtion Finit Stt Automt nd Rgulr Exprssions (Chptr 2, Sction 2.3) ALPHABET oprtions: U, conctntion, * otin otin Strings Form Rgulr xprssions dscri Closd undr U, conctntion nd * (if

More 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

Chapter 16. 1) is a particular point on the graph of the function. 1. y, where x y 1

Chapter 16. 1) is a particular point on the graph of the function. 1. y, where x y 1 Prctic qustions W now tht th prmtr p is dirctl rltd to th mplitud; thrfor, w cn find tht p. cos d [ sin ] sin sin Not: Evn though ou might not now how to find th prmtr in prt, it is lws dvisl to procd

More information

Multi-Section Coupled Line Couplers

Multi-Section Coupled Line Couplers /0/009 MultiSction Coupld Lin Couplrs /8 Multi-Sction Coupld Lin Couplrs W cn dd multipl coupld lins in sris to incrs couplr ndwidth. Figur 7.5 (p. 6) An N-sction coupld lin l W typiclly dsign th couplr

More information

CS61B Lecture #33. Administrivia: Autograder will run this evening. Today s Readings: Graph Structures: DSIJ, Chapter 12

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

On the Role of Fitness, Precision, Generalization and Simplicity in Process Discovery

On the Role of Fitness, Precision, Generalization and Simplicity in Process Discovery On th Rol of Fitnss, Prcision, Gnrliztion n Simplicity in Procss Discovry Joos Buijs Bouwijn vn Dongn Wil vn r Alst http://www.win.tu.nl/coslog/ Avncs in Procss ining ny procss iscovry n conformnc chcking

More information

Using the Printable Sticker Function. Using the Edit Screen. Computer. Tablet. ScanNCutCanvas

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

Winter 2016 COMP-250: Introduction to Computer Science. Lecture 23, April 5, 2016

Winter 2016 COMP-250: Introduction to Computer Science. Lecture 23, April 5, 2016 Wintr 2016 COMP-250: Introduction to Computr Scinc Lctur 23, April 5, 2016 Commnt out input siz 2) Writ ny lgorithm tht runs in tim Θ(n 2 log 2 n) in wors cs. Explin why this is its running tim. I don

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

Ch 1.2: Solutions of Some Differential Equations

Ch 1.2: Solutions of Some Differential Equations Ch 1.2: Solutions of Som Diffrntil Equtions Rcll th fr fll nd owl/mic diffrntil qutions: v 9.8.2v, p.5 p 45 Ths qutions hv th gnrl form y' = y - b W cn us mthods of clculus to solv diffrntil qutions of

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

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

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

Theoretical Study on the While Drilling Electromagnetic Signal Transmission of Horizontal Well

Theoretical Study on the While Drilling Electromagnetic Signal Transmission of Horizontal Well 7 nd ntrntionl Confrnc on Softwr, Multimdi nd Communiction Enginring (SMCE 7) SBN: 978--6595-458-5 Thorticl Study on th Whil Drilling Elctromgntic Signl Trnsmission of Horizontl Wll Y-huo FAN,,*, Zi-ping

More information

Lecture contents. Bloch theorem k-vector Brillouin zone Almost free-electron model Bands Effective mass Holes. NNSE 508 EM Lecture #9

Lecture contents. Bloch theorem k-vector Brillouin zone Almost free-electron model Bands Effective mass Holes. NNSE 508 EM Lecture #9 Lctur contnts Bloch thorm -vctor Brillouin zon Almost fr-lctron modl Bnds ffctiv mss Hols Trnsltionl symmtry: Bloch thorm On-lctron Schrödingr qution ch stt cn ccommo up to lctrons: If Vr is priodic function:

More information

Similarity Search. The Binary Branch Distance. Nikolaus Augsten.

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

Outline. Circuits. Euler paths/circuits 4/25/12. Part 10. Graphs. Euler s bridge problem (Bridges of Konigsberg Problem)

Outline. 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 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

CONTINUITY AND DIFFERENTIABILITY

CONTINUITY AND DIFFERENTIABILITY MCD CONTINUITY AND DIFFERENTIABILITY NCERT Solvd mpls upto th sction 5 (Introduction) nd 5 (Continuity) : Empl : Chck th continuity of th function f givn by f() = + t = Empl : Emin whthr th function f

More information

cycle that does not cross any edges (including its own), then it has at least

cycle that does not cross any edges (including its own), then it has at least W prov th following thorm: Thorm If a K n is drawn in th plan in such a way that it has a hamiltonian cycl that dos not cross any dgs (including its own, thn it has at last n ( 4 48 π + O(n crossings Th

More information

Oppgavesett kap. 6 (1 av..)

Oppgavesett kap. 6 (1 av..) Oppgvstt kp. 6 (1 v..) hns.brnn@go.uio.no Problm 1 () Wht is homognous nucltion? Why dos Figur 6.2 in th book show tht w won't gt homognous nucltion in th tmosphr? ˆ Homognous nucltion crts cloud droplts

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

Last time: introduced our first computational model the DFA.

Last time: introduced our first computational model the DFA. Lctur 7 Homwork #7: 2.2.1, 2.2.2, 2.2.3 (hnd in c nd d), Misc: Givn: M, NFA Prov: (q,xy) * (p,y) iff (q,x) * (p,) (follow proof don in clss tody) Lst tim: introducd our first computtionl modl th DFA. Tody

More information

The SuperFET: A High-Performance GaAs Voltage-Controlled Current Source for Cryogenic Applications

The SuperFET: A High-Performance GaAs Voltage-Controlled Current Source for Cryogenic Applications The SuperFT: High-Perormace Gas Voltage-Cotrolled Curret Source or Cryogeic pplicatios.v.cami, G.Pessia,.Previtali ad P. Ramaioli*. ipartimeto di Fisica dell'uiversita' ad Istituto Nazioale di Fisica Nucleare,

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

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

COMP108 Algorithmic Foundations

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

The Matrix Exponential

The Matrix Exponential Th Matrix Exponntial (with xrciss) by Dan Klain Vrsion 28928 Corrctions and commnts ar wlcom Th Matrix Exponntial For ach n n complx matrix A, dfin th xponntial of A to b th matrix () A A k I + A + k!

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

Case Study VI Answers PHA 5127 Fall 2006

Case Study VI Answers PHA 5127 Fall 2006 Qustion. A ptint is givn 250 mg immit-rls thophyllin tblt (Tblt A). A wk ltr, th sm ptint is givn 250 mg sustin-rls thophyllin tblt (Tblt B). Th tblts follow on-comprtmntl mol n hv first-orr bsorption

More information

CIVL 8/ D Boundary Value Problems - Rectangular Elements 1/7

CIVL 8/ D Boundary Value Problems - Rectangular Elements 1/7 CIVL / -D Boundr Vlu Prolms - Rctngulr Elmnts / RECANGULAR ELEMENS - In som pplictions, it m mor dsirl to us n lmntl rprsnttion of th domin tht hs four sids, ithr rctngulr or qudriltrl in shp. Considr

More information

Overview. Usages of Fault Simulators. Problem and Motivation. Alternatives and Their Limitations. VLSI Design Verification and Testing

Overview. Usages of Fault Simulators. Problem and Motivation. Alternatives and Their Limitations. VLSI Design Verification and Testing VLSI Dsin Vriiction n Tstin Fult Simultion Mohmm Thrnipoor Elctricl n Computr Eninrin Univrsity o Conncticut Ovrviw Prolm n motivtion Fult simultion lorithms Sril Prlll Ductiv Concurrnt Othr lorithms Rnom

More information

Derangements and Applications

Derangements and Applications 2 3 47 6 23 Journal of Intgr Squncs, Vol. 6 (2003), Articl 03..2 Drangmnts and Applications Mhdi Hassani Dpartmnt of Mathmatics Institut for Advancd Studis in Basic Scincs Zanjan, Iran mhassani@iasbs.ac.ir

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

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

Analysis for Balloon Modeling Structure based on Graph Theory

Analysis 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 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

Examples and applications on SSSP and MST

Examples and applications on SSSP and MST Exampls an applications on SSSP an MST Dan (Doris) H & Junhao Gan ITEE Univrsity of Qunslan COMP3506/7505, Uni of Qunslan Exampls an applications on SSSP an MST Dijkstra s Algorithm Th algorithm solvs

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

QUESTIONS BEGIN HERE!

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

64. A Conic Section from Five Elements.

64. A Conic Section from Five Elements. . onic Sction from Fiv Elmnts. To raw a conic sction of which fiv lmnts - points an tangnts - ar known. W consir th thr cass:. Fiv points ar known.. Four points an a tangnt lin ar known.. Thr points an

More information

The Matrix Exponential

The Matrix Exponential Th Matrix Exponntial (with xrciss) by D. Klain Vrsion 207.0.05 Corrctions and commnts ar wlcom. Th Matrix Exponntial For ach n n complx matrix A, dfin th xponntial of A to b th matrix A A k I + A + k!

More information

Graph 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

Graph Isomorphism. Graphs - II. Cayley s Formula. Planar Graphs. Outline. Is K 5 planar? The number of labeled trees on n nodes is n n-2 Grt Thortil Is In Computr Sin Vitor Amhik CS 15-251 Ltur 9 Grphs - II Crngi Mllon Univrsity Grph Isomorphism finition. Two simpl grphs G n H r isomorphi G H if thr is vrtx ijtion V H ->V G tht prsrvs jny

More information

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

EEO 401 Digital Signal Processing Prof. Mark Fowler

EEO 401 Digital Signal Processing Prof. Mark Fowler EEO 401 Digital Signal Procssing Prof. Mark Fowlr Dtails of th ot St #19 Rading Assignmnt: Sct. 7.1.2, 7.1.3, & 7.2 of Proakis & Manolakis Dfinition of th So Givn signal data points x[n] for n = 0,, -1

More information

MASSACHUSETTS INSTITUTE OF TECHNOLOGY HAYSTACK OBSERVATORY WESTFORD, MASSACHUSETTS

MASSACHUSETTS INSTITUTE OF TECHNOLOGY HAYSTACK OBSERVATORY WESTFORD, MASSACHUSETTS VSRT MEMO #05 MASSACHUSETTS INSTITUTE OF TECHNOLOGY HAYSTACK OBSERVATORY WESTFORD, MASSACHUSETTS 01886 Fbrury 3, 009 Tlphon: 781-981-507 Fx: 781-981-0590 To: VSRT Group From: Aln E.E. Rogrs Subjct: Simplifid

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

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

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

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

INTEGRALS. Chapter 7. d dx. 7.1 Overview Let d dx F (x) = f (x). Then, we write f ( x)

INTEGRALS. Chapter 7. d dx. 7.1 Overview Let d dx F (x) = f (x). Then, we write f ( x) Chptr 7 INTEGRALS 7. Ovrviw 7.. Lt d d F () f (). Thn, w writ f ( ) d F () + C. Ths intgrls r clld indfinit intgrls or gnrl intgrls, C is clld constnt of intgrtion. All ths intgrls diffr y constnt. 7..

More information

Aquauno Video 6 Plus Page 1

Aquauno Video 6 Plus Page 1 Connt th timr to th tp. Aquuno Vio 6 Plus Pg 1 Usr mnul 3 lik! For Aquuno Vio 6 (p/n): 8456 For Aquuno Vio 6 Plus (p/n): 8413 Opn th timr unit y prssing th two uttons on th sis, n fit 9V lklin ttry. Whn

More information

CS200: Graphs. Graphs. Directed Graphs. Graphs/Networks Around Us. What can this represent? Sometimes we want to represent directionality:

CS200: 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 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

SIGNIFICANCE OF SMITH CHART IN ANTENNA TECHNOLOGY

SIGNIFICANCE OF SMITH CHART IN ANTENNA TECHNOLOGY SIGNIFICANCE OF SMITH CHART IN ANTENNA TECHNOLOGY P. Poornima¹, Santosh Kumar Jha² 1 Associat Profssor, 2 Profssor, ECE Dpt., Sphoorthy Enginring Collg Tlangana, Hyraba (Inia) ABSTRACT This papr prsnts

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

First order differential equation Linear equation; Method of integrating factors

First order differential equation Linear equation; Method of integrating factors First orr iffrntial quation Linar quation; Mtho of intgrating factors Exampl 1: Rwrit th lft han si as th rivativ of th prouct of y an som function by prouct rul irctly. Solving th first orr iffrntial

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

This Week. Computer Graphics. Introduction. Introduction. Graphics Maths by Example. Graphics Maths by Example

This Week. Computer Graphics. Introduction. Introduction. Graphics Maths by Example. Graphics Maths by Example This Wk Computr Grphics Vctors nd Oprtions Vctor Arithmtic Gomtric Concpts Points, Lins nd Plns Eploiting Dot Products CSC 470 Computr Grphics 1 CSC 470 Computr Grphics 2 Introduction Introduction Wh do

More information

HIGHER ORDER DIFFERENTIAL EQUATIONS

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

Multiple Short Term Infusion Homework # 5 PHA 5127

Multiple Short Term Infusion Homework # 5 PHA 5127 Multipl Short rm Infusion Homwork # 5 PHA 527 A rug is aministr as a short trm infusion. h avrag pharmacokintic paramtrs for this rug ar: k 0.40 hr - V 28 L his rug follows a on-compartmnt boy mol. A 300

More information

VLSI Testing Assignment 2

VLSI Testing Assignment 2 1. 5-vlu D-clculus trut tbl or t XOR unction: XOR 0 1 X D ~D 0 0 1 X D ~D 1 1 0 X ~D D X X X X X X D D ~D X 0 1 ~D ~D D X 1 0 Tbl 1: 5-vlu D-clculus Trut Tbl or t XOR Function Sinc 2-input XOR t wors s

More information

Euler, Ioachimescu and the trapezium rule. G.J.O. Jameson (Math. Gazette 96 (2012), )

Euler, Ioachimescu and the trapezium rule. G.J.O. Jameson (Math. Gazette 96 (2012), ) Euler, Iochimescu nd the trpezium rule G.J.O. Jmeson (Mth. Gzette 96 (0), 36 4) The following results were estblished in recent Gzette rticle [, Theorems, 3, 4]. Given > 0 nd 0 < 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

Analysis of Algorithms - Elementary graphs algorithms -

Analysis of Algorithms - Elementary graphs algorithms - Analysis of Algorithms - Elmntary graphs algorithms - Anras Ermahl MRTC (Mälaralns Ral-Tim Rsach Cntr) anras.rmahl@mh.s Autumn 00 Graphs Graphs ar important mathmatical ntitis in computr scinc an nginring

More information

Analysis of Algorithms - Elementary graphs algorithms -

Analysis of Algorithms - Elementary graphs algorithms - Analysis of Algorithms - Elmntary graphs algorithms - Anras Ermahl MRTC (Mälaralns Ral-Tim Rsarch Cntr) anras.rmahl@mh.s Autumn 004 Graphs Graphs ar important mathmatical ntitis in computr scinc an nginring

More information