Origin-Destination Table Disaggregation Using Fratar Biproportional Least Squares Estimation

Size: px
Start display at page:

Download "Origin-Destination Table Disaggregation Using Fratar Biproportional Least Squares Estimation"

Transcription

1 Orgn-Destnton Tble Dsggregton Usng Frtr Bproportonl Lest Squres Estmton Aln J. Horowtz (Correspondng Author) Professor, Center for Urbn Trnsportton Studes, Unversty of Wsconsn Mlwukee, PO Box 784, Mlwukee, WI 53201, voce: , fx: , e-ml: November 2, 2009 Word Count: 5744 words + 5 fgures + 2 tbles Pper Number

2 Horowtz 2 Orgn-Destnton Tble Dsggregton Usng Frtr Bproportonl Lest Squres Estmton Abstrct: Ths pper descrbes group of technques for dsggregtng orgn-destnton tbles for trvel forecstng tht mkes explct use of observed trffc on network. Fve models wthn the group re presented, ech of whch uses nonlner lest-squres estmton to obtn row nd column fctors for splttng trp totls from nd to lrger geogrphcl res nto smller ones. The technques re phlosophclly smlr to Frtr fctorng, lthough the soluton method s qute dfferent. The technques re tested on full-szed network for Northfeld, MN nd re found to work effectvely.

3 Orgn-Destnton Tble Dsggregton Usng Frtr Bproportonl Lest Squres Estmton INTRODUCTION AND PREVIOUS WORK It s often desrble to obtn hghly detled orgn-destnton (OD) tble for vehcles or commodtes, when only much more ggregted tble s vlble. These stutons typclly rse when survey dt re orgnzed nto frly lrge dstrcts (zp codes, ctes, countes or sttes) n order to preserve confdentlly or smply to provde menngful flow comprsons when the number of dt smples s lmted. Commercl vehcle nd freght dt, n prtculr, re prone to ths type of sptl ggregton. Ths subect hs gotten recent ttenton n the professonl lterture wth the relese of the Freght Anlyss Frmework 2 (FAF 2 ) nd subsequent nterest expressed by mny plnners n dsggregtng commodty flows from the 114 domestc regons to smller zones, such s countes. In pper tht drectly ddress the FAF 2 dsggregton problem, Run nd Ln (1) dentfed two prevlng methods of OD tble dsggregton nd present ther own sttstcl method of usng economc dt. Run nd Ln observed tht the proportonl weghtng method s most often chosen by plnners. Exmples of the proportonl weghtng method n the freght plnnng lterture bound, for exmple studes by Fsher, Ang-Olson nd L (2), Sorrtn nd Smth (3), Vswnthn, et l. (4), nd Rownsk, Ope nd Spsovc (5). These studes prncplly use economc dt, wth n occsonl use of ggregted trffc sttstcs, to crete the dsggregton fctors. For the purposes of ths dscusson, the ggregted OD tble wll be sd to contn trp dt between dstrcts, whle the dsggregted OD tble wll be sd to contn trp dt between zones. Trdtonl pplcton of the proportonl weghtng method hs been to dsggregte dstrct-level orgn-destnton tble by fctorng t long ts rows nd columns, smultneously. Tht s: T = A B τ (1) kl where: = n orgn (row) n the dsggregted (zonl) tble nd where s n element n the set of zones I; = destnton (column) n the dsggregted (zonl) tble nd where s lso n element n the set of zones I k = n orgn (row) n the ggregted (dstrct-level) tble nd k s n element n the set of dstrcts K; l = destnton (column) n the ggregted (dstrct-level) tble nd l s lso n element n the set of dstrcts K; T = the dsggregted orgn-destnton tble, zone-to-zone; A = row splt fctor for ech zonl tble orgn; B = column splt fctor for ech zonl tble destnton; τ kl = the ggregted orgn-destnton tble, dstrct-to-dstrct.

4 Horowtz 4 The sets of splts, A nd B, hve the effect of spredng lrge number of trps between n orgn nd destnton nto smller numbers of trps between, perhps, mny orgns nd mny destntons. Ech nd ech s ssocted wth one nd only one k or l, respectvely. So A B for notton purposes, t s necessry to defne two further sets, L k nd L l, whch keep trck of the structurl reltonshp between the two tbles. Tht s, A L k B L l = the set of rows tht re ssocted wth row k n the ggregted dstrct tble; = the set of columns tht re ssocted wth column l n the ggregted dstrct tble. Zones nest nto dstrcts nd no zone my occur n multple dstrcts. Ech dstrct tble ndex cn be computed s functon of gven zonl tble ndex. Ths s, when s known, then A k cn be found by referencng the set,. L k It should be recognzed tht ths trdtonl prctce gnores the possblty tht there re specl zone-to-zone nterctons tht re hdden n the ggregton t the dstrct-to-dstrct level. For exmple, lrge fctory mght shp to lrge wrehouse, cretng prtculrly lrge OD flow between two zones tht mght not be pprent by ust lookng t the flow between the two respectve dstrcts. Orgn-destnton tbles re often thought to be nerly symmetrc over 24-hour perod for pssenger trvel; however, commodty flow tbles cnnot be ssumed to be symmetrc nd vehcle flow tbles, both pssenger nd freght, re rrely symmetrc for perods of tme shorter thn dy. Although the term orgn-to-destnton s used n ths dscusson, the procedures developed heren re eqully pplcble to producton-to-ttrcton flows for pssenger trvel nd producton-to-consumpton flows for commodtes. The mount of dt vlble to determne A nd B vres consderbly dependng upon the plnnng problem. Very often plnners wll clculte the splts from socoeconomc dt or by pplyng trp generton equtons, s they mght hve been prepred for trvel forecstng model. Another possble method s to determne the splts by observng the mount of trvel n ech dsggregted zone, such s the zone s VMT (vehcle mles of trvel), s llustrted by Rownsk, Ope nd Spsovc (5) nd Bttelle (6). Bttelle (6) used zonl VMT to crete the FAF 2 trffc ssgnments. Rownsk, Ope nd Spsovc (5) concluded tht zonl VMT ws helpful n cretng dsggregted truck OD mtrx n New Jersey. The use of zonl VMT dt to supplement socoeconomc nformton s good de, but t s lso problemtcl. To cte n extreme exmple, zone wth lrge nterstte hghwy could hve huge VMT even though the zone s otherwse desolte. A potentlly rcher dt source s trffc counts on ndvdul lnks, whch would be needed nywy to clculte zonl VMT. However, ndvdul trffc counts re dffcult to use drectly for determnng the splts becuse ny one count s not usully ssocted wth ny specfc zone. Indeed, the reltonshp between trffc count nd the number of trps tht re generted n nerby zone s qute complex. However, to properly nclude trffc counts n cretng row nd column fctors, there s need to pull certn key concepts from the feld of estmtng synthetc OD tbles usng ground counts. The erlest methods dte from the lte 1970s nd mny mprovements hve been proposed snce. A very complete revew of the lterture s t reltes to sttc methods through 1998 hs been wrtten by Abrhmsson (7). Severl such methods re derved from the concept of lest-squres estmton, whch s the steppng-off pont for the work presented here.

5 Horowtz 5 Some recent work on estmton of orgn-destnton tbles from trffc counts by Horowtz (8) hs drect mplctons for the OD tble dsggregton problem. One technque n prtculr, Frtr bproportonl lest-squres estmton, cn be sutbly modfed to crete needed row nd column splts. In prtculr, Frtr bproportonl estmton seeks the soluton of ths nonlner, lest-squres mnmzton problem to obtn sets of row nd column fctors to refne rough (or seed ) tble t the sme level of ggregton: 2 * * mn P = w C s p + 2 x y T z T ( 1 x y ) (2) A I I I I where x = row (orgn) fctor for zone ; y = column (destnton) fctor for zone ; C = ground count for lnk drecton, wth ech drecton on two-wy lnks tbulted seprtely, nd s n element n the set of ll counted drectons A; T = number of trps between orgn nd destnton to be estmted; * T = seed trp tble; p = estmted proporton of trps between zones nd tht use lnk drecton (s determned by n equlbrum trffc ssgnment); I = set of zones, = 1 to N or = 1 to N; A = set of lnk drectons; w = lnk weght for lnk drecton ; z = the trp tble weght; nd s = scle fctor tht s ether set to 1 or selected utomtclly to scle the trp tble to produce the correct verge trffc count before optmzton. Ths technque ws lter extended to dynmc OD tbles by Horowtz nd Dn (9). For exmple, ths equton mght be useful for pproxmtng pek-hour orgndestnton tble, zone-to-zone, from pek-hour trffc counts nd from 24-hour orgndestnton tble, lso zone-to-zone. Seed tbles re often bult from survey dt, behvorl trvel theory or expert udgment. The estmton fnds the best compromse set of orgn nd destnton fctors tht gves good greement wth trffc counts nd does not devte hugely from the seed tble. It s lso mthemtclly necessry to constrn the fctors to be greter thn zero, nd t s qute desrble n most crcumstnces to keep them wthn resonble bounds, sy no smller thn 0.2 nd no lrger thn 5. If n ggregted, dstrct-level OD tble s perfect, then the followng reltonshp must hold: τkl = T (3) A B Lk Ll 2

6 Horowtz 6 However, t s entrely possble tht the dstrct-level OD tble s less thn perfect, becuse t too s subect to vrous dt collecton errors or ndequces n theory. In such cses, t my be pproprte to vod usng Equton 3 s strct constrnt. Prevous reserch nd prctce suggests tht plnner should be ble to fnd some socoeconomc dt to suggest how the dstrct-level OD tble mght be dsggregted, ustfyng the use of splts, A nd B, t lest tenttvely. However, trffc counts mght suggest tht dfferent splts re better for the purpose. Therefore, Equton 1 should be modfed to nclude the nformton comng from ll sources: T = sx A y B τ (4) kl where x nd y re emprcl modfers, somehow derved from trffc counts, of A nd B. Thus, s, x nd y hve smlr purposes to the sme vrbles n Equton 2. In mny plnnng stutons socoeconomc dt nd trffc dt would be to some extent redundnt wth ech other, so well constructed dsggregton should fnd x s nd y s tht re close to 1. Plcng tght bounds on the x s nd y s would tend to strengthen the contrbuton of the socoeconomc dt to the computed zonl OD tble. There re lmts s to how mny x s nd y s cn be estmted, gven the mount of dt vlble to the problem from the dstrct-level OD tble nd from the trffc counts. It s lso entrely possble tht gven zone s trffc (orgns or destntons) mght not trvel on ny of the counted lnks; n such cses the x s nd y s must defult to 1.0, wth ll the fctorng crred by the predetermned s, A s nd B s. The strength of the soluton depends upon how much trffc dt re vlble nd the szes of the two OD tbles. There re 2N vrbles, where N s the number of zones n the zonl OD tble. For exmple, f the dstrct-level OD tble hs 12 dstrcts nd f there re 400 trffc counts, then there re 544 dt tems n the estmton ( ). Ths mens tht the estmton cn relbly expnd ths tble to t most 272 zones,.e., hlf the number of dt tems, but probbly somewht less. The loctons of the 400 trffc counts mtter. More splts cn be estmted when the trffc counts re spred evenly throughout the regon nd where the countng sttons re locted on mor rods. There re number of dfferent wys to formulte the estmton methodology, nd fve of these wys re dscussed n ths pper. Model I: Dstrct-level OD tble s pproxmte Model II: Dstrct-level OD tble s perfect Model III: Dstrct-level OD tble s pproxmte, OD s re ffected by trp utlty Model IV: Dstrct-level OD tble s perfect, OD s re ffected by trp utlty Model V: Dstrct-level OD tble s pproxmte, some zone-to-zone flows re specl MODEL FORUMULATIONS Model I: Dstrct-Level OD Tble Is Approxmte Model I s consstent wth pst prctce n OD tble estmton from ground counts, where the seed tble s consdered to be, t best, rough pproxmton of relty. Assumng tht the dstrct-level OD tble s pproxmte provdes some flexblty to the estmton nd recognzes

7 Horowtz 7 tht there my be serous nconsstences between the ground count dt nd the survey dt tht were used to buld the dstrct-level OD tble. mn P = w C s p τ + τ x A y B kl z kl s A x 0, I y 0, I I I 2 k K l K or s possble user opton to lend strength to ny socoeconomc dt, x y mn x x mx mn y y mx, I, I A k L B l L x A y where both x mn nd y mn re greter thn zero. Agn, k nd l re functons of nd. Judgment s to whch re most ccurte, ether ground counts or ggregted OD flows, s expressed by the set of lnk-drecton weghts, w, nd by the sole tble weght, z. The ctul effects of these weghts re not obvous beforehnd, so the effects re best evluted fter trl optmzton hs been completed. The scle fctor, s, hs been retned from Equton 2. A scle fctor cn help elmnte systemtc errors n dt collecton or dust for dfferent sets of unts. For exmple, t s concevble, though not recommended, tht n ggregted freght OD tble cn be gven n unts of tons of whle the lnk volumes cn be gven n unts of trucks. At the surfce, s ppers to be entrely redundnt. However, upper nd lower bound constrnts plced on x s nd y s cn mke t desrble to keep them close to 1, nd vlue of s 1 llows ths to hppen more redly. Model II: Dstrct-Level OD Tble Is Perfect The lest squres estmton for ths model tres to mtch ground counts whle fttng the dstrctlevel OD tble exctly. B τ kl 2 (5) mn = w C s 2 P p x A y B τkl (6) A I I where k nd l re tken to be functons of nd, respectvely. These constrnts must hold. τ kl = s x A y B τ, k K, l K (6b) A B Lk Ll kl x 0, I

8 Horowtz 8 y 0, I Ths method cn be mplemented wthn the mthemtcs of Model I, f sutbly lrge vlue of z (see Equton 2 nd prevous secton) s selected to ssure tht the frst constrnt s stsfed. Externl Sttons n Models I nd II As prctcl mtter, ll of the models must ccount for the presence of externl sttons on the network. There cn be no ntrzonl trps wthn externl sttons. Ths s perhps mnor detl, but t cn be hndled by ntroducng nother fctor G (ner where A nd B pper n ll expressons) whch pples to ll zones wthn the set E of externl sttons, where E I. Thus, G = 0, f = nd E (7) G = 1, otherwse (7b) Ths sme vrble should be ntroduced n the mplementton of ny of the models descrbed here. Models III nd IV: OD s Are Affected by Trp Utlty Model IV (perfect dstrct-level tble) cn be treted s specl cse of Model III (pproxmte dstrct-level tble). Both models ntroduce the de from grvty model of trp dstrbuton or logt model of destnton choce tht there s less lkelhood of trp between pr of zones f there s consderble sptl seprton between them. Sptl seprton s mesured by trveler s utlty, whch s lmost lwys ncresngly more negtve or less postve s trp dstnce ncreses. Most trvel forecstng models clculte vlue of utlty prmrly from the trvel tme between the two zones. Defne: U V kl = utlty of trvel from zone to zone ; nd = utlty of trvel from dstrct k to dstrct l. Utlty n these cses re determnstc nd cn be obtned drectly from the trffc network. The dstrct-to-dstrct utlty of trvel my be pproxmted by tkng weghted verge of ll zoneto-zone utltes. Thus, x A B Lk Ll V kl = (8) x A y B A k L B l L A y B U whch would need to be recomputed repetedly s the set of x s nd y s become better known. If the A s nd B s re known frly well, then ntlly, x = 1 nd y = 1. Assumng logt or mxmum-entropy reltonshp for destnton choce, then the followng correcton,, mght be needed for zone prs from prtculrly lrge dstrcts: F

9 Horowtz 9 U F = e V, (9) kl e nd k nd l re functons of nd. Model III s obectve functon cn be obtned by slghtly enhncng Model I: mn P = w C s p τ + τ x A y B F kl z kl s A I I 2 k K l K A k L B l L x A y B Fτkl (10) Prmeters of U could be dopted from trp dstrbuton model for the regon, or t could be obtned drectly through the optmzton process. Model IV could be mplemented by settng z to lrge number. Both Models III nd IV re mld deprtures form the proportonl weghtng prdgm, s they nclude nformton bove nd beyond wht cn be gotten from smply lookng t orgn zones by themselves or destnton zones by themselves. One would surmse tht Models III nd IV would work best when zones re lrge (for exmple, countes) reltve to verge trps lengths. Model V: Dstrct-Level OD Tble Is Approxmte, Some Zone-to-Zone Flows Are Specl In some crcumstnces t mght be necessry to ccount for known hgh nterctons between specfc prs of zones. Model V represents mor deprture from the proportonl weghtng prdgm. The number of such zone prs must be kept to ust few so s not to overwhelm the estmton process. Therefore, t s ssumed tht these zone prs cn be dentfed n dvnce, even f the ctul level of ntercton s unknown. Such nterctons cn be ncorported nto the model by defnng msk for specl zone prs: H H H = 1, f the ntercton between nd s specl, nd (11) = 0, otherwse. (11b) The ddtve dustment for specl trps between n OD pr, M, cn then be nserted nto ny of the prevous models. For exmple, for Model I the obectve functon becomes: 2 mn P = z k K l K A τ w C kl s L s A k I I B l L A B p A B ( x y + H M ) ( x y + H M ) τ kl 2 τ kl 2 + (12) nd, x y H M 0, + whch llows M to be ether postve or negtve. It s dffcult to mgne how specl zonl nterctons could otherwse be dscerned from the trdtonl pproch (tht s wth zonl

10 Horowtz 10 socoeconomc nd/or VMT dt) wthout consderble locl knowledge, specl surveys or trffc counts. Blevel Soluton Algorthm The OD dsggregton problem, ny model, s solved by embeddng t wthn trvel forecstng frmework, s llustrted n Fgure 1. Two seprte nput OD tbles must be provded: the dstrct-to-dstrct OD tble nd n ntl zone-to-zone OD tble. The sole reson for the ntl zone-to-zone tble s to obtn trffc ssgnment tht cn be used to compute the p rry nd to obtn n ntl set of delys on lnks nd t ntersectons. A good source of n ntl zone-to-zone OD tble s Equton 1. The ntl zone-to-zone OD tble does not drectly contrbute to the creton of orgn nd destnton fctors, but the ntl tble s retned n the method of successve verges (MSA) process nd cn slghtly nfluence ssgned volumes, dependng upon the number of MSA tertons. Blevel lgorthms smlr to Fgure 1 must be used when the OD tble hs not been fully determned t the pont of ntl trffc ssgnment nd congeston s present on the network (10,11). An ccurte trffc ssgnment needs ccurte lnk delys tht requre the correct lodngs, whch cn only be found for congested networks fter szble number of MSA tertons. The lgorthm selected for the soluton of the lower-level mnmzton problem s the grdent proecton method wth PARTAN. Serches n the grdent proected drecton re stopped when the step sze, η, decreses beyond: η < θ 2N (13) where θ s sutbly smll number nd 2N s the number of zones. The optmzton s termnted when the reltve chnge n the obectve functon between PARTAN steps s smller thn nother smll rbtrry number, determned through trl nd error process. Trls on bg networks reveled tht speed of convergence could be n ssue becuse rther lrge optmzton problem s solved t ech MSA terton. Therefore, cre ws tken to fne-tune the optmzton step by mplementng nlytcl dfferentton nd prllel processng.

11 Horowtz 11 Dstrct-toDstrct OD Tble Intl Zone-to- Zone OD Tble All-or-Nothng Trffc Assgnment MSA Volume Avergng, OD Tble Avergng nd Dely Clcultons Fnd Orgn nd Destnton Fctors New Zone-to- Zone OD Tble FIGURE 1 Blevel Algorthm for Solvng the OD Tble Dsggregton Problem COMPUTATIONAL TESTS, ALL VEHICLE OD TABLE ESTIMATION IN NORTHFIELD The Northfeld, MN network ws selected for testng the computtonl propertes of OD tble dssggregton. Northfeld ws the smllest of three networks tested n the erler study by Horowtz (8). The network s ust 4.7 mles cross (est-west) for ts longest dmenson. Northfeld hs populton of bout 17,000 people. These current tests nvolved pssenger, commercl nd freght vehcles n sngle-clss trffc ssgnment. The Northfeld network s shown n Fgure 1. It hs 29 zones nd 12 externl sttons, whch were orgnzed nto 11 dstrcts. Externl sttons were treted smlrly to zones n the tests. Becuse ll streets were ncluded n the network, there were 819 lnks, but ust 60 lnk drectons hd trffc counts. The number of ground counts s undesrbly less thn the number of vrbles. In Fgure 1, dstrct boundres re ncluded s thck blue lnes whle zonl centrods nd externl sttons re shown s lrge green dots. Dstrctng for externl sttons, whch do not hve logcl polygons, s shown by thck blck lnes.

12 Horowtz 12 FIGURE 2 Northfeld Test Network nd Internl Dstrctng The ggregted OD tble ws creted by grvty model t the zone-to-zone level wth home-bsed-work, home-bsed-nonwork, nd nonhome-bsed trp purposes for pssengers, then ggregted to the dstrct level. The zone-to-zone OD tble ws retned for comprson purposes. All prmeters were tken from NCHRP Report #365 for pssenger trvel (12). Becuse the ggregted OD tble omtted ny consderton of freght or commercl vehcles, substntl dsgreement wth the ground counts ws ntcpted. So not only would the model be expected to dsggregte the OD tble, but t would lso be expected to correct for errors nherent n the ggregted OD tble cused by omttng mny trucks. Zonl chrcterstcs were vlble tht could hve permtted the creton of frly good sets of zone splts, A nd B, but there ws prtculr nterest n seeng wht cruder set of zone splts would ccomplsh. So for these tests ll A s nd B s were set to the recprocl of the number of zones n ther respectve dstrcts. Models I through IV pply to the Northfeld cse. Optmzton prmeters were set s follows:

13 Horowtz 13 All lnk weghts, w, were set to 1; The OD tble weght, z, ws set to 100 for Models II nd IV nd 10,000 for Models I nd III; There ws pror sclng of the OD tble,.e., s 1, to t lest ccount for the omsson of trucks from the dstrct-to-dstrct OD tble; Equton 9 for Models III nd IV set U = -0.1t, where t s the congested nterzonl trvel tme. All x s nd y s were constrned to be between 0.2 nd 5. All smultons nd optmztons used re spred equlbrum trffc ssgnment (13), whch lods trffc t lmost ll ntersectons nd dspenses wth centrod connectors, whch re common devces n trvel forecstng networks. Ths ssgnment method s ble to ssgn the vst morty of ntrzonl trps to the network nd s hghly multpth, propertes whch re benefcl to the process of estmtng row nd column fctors. Equlbrum ws cheved by runnng 40 tertons of the method of successve verges (MSA), whch s more thn n most trvel forecstng pplctons, but not suffcent to reduce convergence error to neglgble mount, s wll be seen lter. Lnk delys were clculted usng opertonl nlyss methods from the 2000 Hghwy Cpcty Mnul for both sgnlzed nd unsgnlzed ntersectons. The tme perod of the smultons ws full 24-hours, ssgned sttclly. Computtonl results were obtned for the frst four models (I through IV) nd the ffth model (some specl flows) ws checked for resonbleness. A sttstcl summry of the frst four models nd n ordnry smulton re shown on Tble 1. Dt re gven for the 60 lnk drectons wth ground counts. TABLE 1 Summry of Computtonl Tests, Inexct Input Dt Model Averge Ground Count Averge Assgned Lnk Volume RMS Dfference n Volumes RMS Dfference n Aggregte OD Tble I II III IV Smulton The RMS dfference n the OD tble for the smulton ws zero becuse the orgnl zone-tozone OD tble ws not chnged durng the smulton nd the dstrct OD tble ws bult by ggregtng the orgnl zone-to-zone OD tble. The verge ggregted OD flow ws 554 vehcles. The ordnry smulton performed very poorly n mtchng ground counts n relton to Models I to IV, even though t hd the dvntge of beng provded zone-to-zone (41 by 41) OD tble nsted of dstrct-to-dstrct (11 by 11) OD tble. A mor contrbutor to the error of the smulton ws n verge of pproxmtely 1200-vehcle systemtc underestmte of ll ground counts; presumbly mny of these were trucks. Another possblty for the underestmte s tht the smulton does not hve enough congeston to crete dverson due to equlbrum effects nd trffc s unrelstclly beng kept on some routes wth slght dvntges n free trvel tme nd were not mong those counted.

14 Horowtz 14 Models III nd IV dd slghtly worse thn Models I nd II, whch ws unexpected gven tht the dstrct-to-dstrct OD tble ws creted wth grvty model nd Model III dffers from Model I by mkng grvty-type dustments. Tble 1 shows tht Model II preserves the dstrctto-dstrct OD tbles (to wthn one-hlf of trp), wth only slght ncrese n the RMS dfference between the forecst nd the ground counts over Model I. Even the 9.2 trp error n the ggregted OD tble for Model III s not lrge. It s lkely tht Northfeld s too smll cty to show tht zonl-level, grvty-type dustment re sgnfcnt over nd bove the grvty model ssumptons lredy embedded n the dstrct-to-dstrct OD tble. The zonl-level grvty model effects re smply too subtle gven the need to lmt the number of MSA tertons, the need to set optmzton convergence crter, errors nherent wthn the trffc counts nd devtons n the trffc counts from theory. As n exmple, Fgure 3 shows mp of the computed destnton fctors from Model I. These destnton fctors hve been multpled by the scle fctor, s. Drker red htchng ndctes zones tht hve destnton fctors between 0.2 nd 0.4 nd the drker green htchng sgnfes destnton fctors between 3.2 nd 4. Brown zones re neutrl. A zone could hve lrge destnton fctor becuse t hs more ctvty, overll, thn ts compnon zones or becuse t hs ctvtes tht generte dsproportonte mount of trvel not ccounted for n the NCHRP Report #365 prmeters, such s truck trvel. The mp confrms ntuton by hvng bout s mny green zones s red zones n ech dstrct. The results for orgn fctors nd for Model I were smlr. It s dffcult to further nterpret Fgure 3 wthout consderble locl knowledge. A vsul comprson of lnk counts to ssgned volumes dd not provde ny ddtonl nsghts s to how the models could be further mproved. The scle fctor, s, ws selected by the lgorthm to be between 1.12 nd 1.17, dependng upon the model. The 1996 Quck Response Freght Mnul (14) sttes tht commercl vehcles mke up 10.5% of trffc on urbn prncpl rterls, so these scle fctors re bt greter thn wht would be expected f they were only ccountng for the bsence of trucks n the dstrct-todstrct OD tble. The reson for the lrger scle fctors thn expected s not entrely obvous, but mght be ttrbutble to prmeters from NCHRP Report #365 not beng exctly pproprte for Northfeld. All of the fctors chnged from ther orgnl vlues of x nd y of 1.0, nd ll of the fctors fell esly wthn the constrnts of beng between 0.2 nd 5.0. These ntl tests of Models I to IV demonstrte tht they cn gve plusble results, but these tests do not necessrly demonstrte tht the results re ccurte. Model V ws not tested s fully s the other four models becuse t ws not possble to dentfy sets of zone prs pror tht needed specl ttenton n Northfeld. When rndom zone prs were selected for Model V, both the ft to ground counts nd to the dstrct-level OD tble mproved n ech cse, but not to n nterestng degree. Lettng the lgorthm select the zone prs s not computtonlly fesble.

15 Horowtz FIGURE 3 Destnton Fctors for Model I t Zones (Shded Ares) nd t Externl Sttons (Dots) (Drker Green Indctes Lrger Fctors, Drker Red Indctes Smller Fctors nd Brown s Neutrl) To better guge the ccurcy of the models n reconstructng n underlyng zone-to-zone OD tble, these steps were performed: 1. Crete resonble zone-to-zone OD tble for Northfeld, n ths cse by doptng the output tble from the lst terton of Model I of the prevous tests. Retn the orgn nd destnton fctors. 2. Buld dstrct OD tble from the zone-to-zone OD tble by smply ddng up zone prs. 3. Assgn the zone-to-zone OD tble to the network nd obtn ssgned lnk volumes. 4. Set the ground count on ll rterl lnks equl to the ssgned lnk volumes, rtfclly. 5. Usng the dstrct-to-dstrct OD tble nd the rtfcl ground counts, compute new zone-to-zone OD tble.

16 Horowtz Compre the orgnl nd new orgn nd destnton fctors. Ths procedure resulted n 527 ground counts on the network tht were perfectly consstent wth the zone-to-zone OD tble. For these tests, the OD tble weght, z, ws left t 100, even though there were greter number of ground counts thn the erler tests. It should be noted tht the nput zone-to-zone tble ws computed from Equton 4, so the reltonshp between the zonl nd dstrct-level OD tbles perfectly dheres to the theory. Tble 2 shows tht the optmzton, s expected, s fndng soluton tht s very close to n exct ft to both the dstrct-to-dstrct OD tble nd the ground counts. The verge OD flow n the dstrct-todstrct tble ws 623 vehcles, so the errors n mtchng the ggregted OD tble s ust 1% nd the error n mtchng ground counts s less thn 3%. The remnng smll dfferences between ssgned volumes nd ground counts n the OD tble re ttrbuted mnly to convergence error of the equlbrum trffc ssgnment lgorthm. The test ws repeted by elmntng the bounds on x s nd y s (0.2 to 5.0) to determne of these bounds were nhbtng the estmton process. The results n Tble 2 for the less-constrned optmzton, lthough brely mproved, ndcte tht the constrnts were not serous ssue n fndng orgn nd destnton fctors. TABLE 2 Summry of Computtonl Tests, Artfcl Input Dt Model Averge Ground Count Averge Assgned Lnk Volume n Volumes RMS Dfference I Constrned I Unbounded RMS Dfference n Aggregte OD Tble The most nterestng outputs of these tests re shown n the sctter chrts of Fgures 4 nd 5, whch compre the results of the optmzton wth the known orgn nd destnton fctors. The orgnl nd computed sets of fctors compre very well to ech other.

17 Horowtz Recovered Orgn Fctors Orgnl Orgn Fctors FIGURE 4 Sctter Chrt Showng the Computed Orgn Fctors Agnst the Known Orgn Fctors

18 Horowtz Recovered Destnton Fctors Orgnl Destnton Fctors FIGURE 5 Sctter Chrt Showng the Computed Destnton Fctors Agnst the Known Destnton Fctors The tests of Tble 2 nd Fgures 4 nd 5 were delzed so tht they could be redly nterpreted. They do not represent the sternest test of the models nd soluton lgorthm. However, these tests ndcte tht f the dt ft the theory of the model, f there s consstency between the ggregted OD tble nd ground counts nd f there re suffcent number of ground counts, lest squres optmzton cn do very well n estmtng orgn nd destnton fctors. It s lkely tht more MSA tertons or tghter optmzton convergence crter would strghten the sctter chrts even more. Of course, there s lwys trdeoff between computtonl precson nd the need for mngeble executon tmes whle recognzng the mount of error nherent n the source dt. CONCLUSIONS Ths pper outlnes severl optmzton models tht cn dsggregte orgn destnton tbles by usng nformton from ground counts. Four of the optmzton models were tested on rel dt from Northfeld, MN nd were found to work effectvely. One of these optmztons models ws tested on relstc, but rtfcl dt, on the sme Northfeld network nd ws found to be ble to ccurtely reproduce known underlyng orgn nd destnton fctors n ground counts.

19 Horowtz 19 These methods developed n ths pper re prmrly ntended for commercl vehcle or freght forecsts becuse orgn-destnton dt for these flows re often ggregted to level where they re no longer useful for detled plnnng purposes. The methods mke effectve use of trffc count dt for dsggregtng OD tbles wthout resortng to cretng zonl VMT sttstcs, whch cn dstort the reltonshp between zone s level of ctvty nd trffc wthn tht zone. The choce mong the set of models lrgely rests on the needs of the study, but the smplest model (I) worked well for Northfeld. It gve ssgned volumes tht were respectbly close to trffc counts nd dd not serously dstort the dstrct-level OD tble. Models III nd IV, whch ncluded grvty-type ssumptons fled to mprove upon Models I nd II. The tests presented here mnly delt wth pssenger trvel, but the most nterest n OD tble dsggregton n recent yers reltes to freght. Therefore, ddtonl tests re needed on full-scle freght networks. ACKNOWLEDGMENTS Ths study ws funded by the Center for Infrstructure Reserch nd Educton, ntonl unversty reserch center of the US Deprtment of Trnsportton. REFERENCES 1. Mnyn Run nd Je Ln, Genertng County-Level Freght Dt Usng Freght Anlyss Frmework (FAF2.2) for Regonl Truck Emssons Estmton, pper presented t Trnsport Chcgo, June 5, Mchel Fscher, Jeffrey Ang-Olson nd Anthony L, Externl Urbn Truck Trps Bsed on Commodty Flows: A Model, Trnsportton Reserch Record, #1707, 2000, pp Jose A. Sorrtn nd Robert L. Smth, Development of Sttewde Truck Trp Forecstng Model Bsed on Commodty Flows nd Input-Output Coeffcents, Trnsportton Reserch Record, #1707, 2000, pp Krshnn Vswnthn, Dnel Begn, Vdy Mysore, nd Nnd Srnvsn, Dsggregtng Freght Anlyss Frmework Verson 2 Dt for Flord: Methodology nd Results, Trnsportton Reserch Record, #2049, 2008, pp Jkub Rownsk, Ker Ope nd Lzr N. Spsovc, Development of Method to Dsggregte the 2002 FAF2 Dt Down to the County Level for New Jersey, pper presented t the 87th Annul Meetng of the Trnsportton Reserch Bord, , Jnury Mks Alm, Edwrd Fekpe, Mohmmed Med, FAF2 Freght Trffc Anlyss, June 27, 2007, reports7/ndex.htm#toc 7. Torgn Abrhmsson, Estmton of Orgn-Destnton Mtrces Usng Trffc Counts A Lterture Survey, Interntonl Insttute for Appled Systems Anlyss, IR , My Aln J. Horowtz, Tests of Fmly of Trp Tble Refnements for Quck Response Trvel Forecstng, Trnsportton Reserch Record, Journl of the Trnsportton Reserch Bord, Number 1921, 2005, pp

20 Horowtz Aln J. Horowtz nd Lyl Dn, Tests of Dynmc Extensons to Fmly of Trp Tble Refnements Methods, Trnsportton Reserch Record, Journl of the Trnsportton Reserch Bord, #2003, 2007, pp Y. Chen, Blevel Progrmmng Problems: Anlyss, Algorthms nd Applctons, PhD Thess, Unversty of Montrel, C. S. Fsk, Trp Mtrx Estmton from Lnk Trffc Counts: The Congested Network Cse, Trnsportton Reserch B, Vol 23B, No. 5, 1989, pp Wllm Mrtn nd Nncy A. McGuckn, Trvel Estmton Technques for Urbn Plnnng, NCHRP Report #365, Aln J. Horowtz, Computtonl Issues n Incresng the Sptl Precson of Trffc Assgnments, Trnsportton Reserch Record Journl, #1777, 2001, pp Cmbrdge Systemtcs, et. l., The Quck Response Freght Mnul, Federl Hghwy Admnstrton, DOT-T-97-10, September 1996.

Applied Statistics Qualifier Examination

Applied Statistics Qualifier Examination Appled Sttstcs Qulfer Exmnton Qul_june_8 Fll 8 Instructons: () The exmnton contns 4 Questons. You re to nswer 3 out of 4 of them. () You my use ny books nd clss notes tht you mght fnd helpful n solvng

More information

Remember: Project Proposals are due April 11.

Remember: Project Proposals are due April 11. Bonformtcs ecture Notes Announcements Remember: Project Proposls re due Aprl. Clss 22 Aprl 4, 2002 A. Hdden Mrov Models. Defntons Emple - Consder the emple we tled bout n clss lst tme wth the cons. However,

More information

Bi-level models for OD matrix estimation

Bi-level models for OD matrix estimation TNK084 Trffc Theory seres Vol.4, number. My 2008 B-level models for OD mtrx estmton Hn Zhng, Quyng Meng Abstrct- Ths pper ntroduces two types of O/D mtrx estmton model: ME2 nd Grdent. ME2 s mxmum-entropy

More information

Dennis Bricker, 2001 Dept of Industrial Engineering The University of Iowa. MDP: Taxi page 1

Dennis Bricker, 2001 Dept of Industrial Engineering The University of Iowa. MDP: Taxi page 1 Denns Brcker, 2001 Dept of Industrl Engneerng The Unversty of Iow MDP: Tx pge 1 A tx serves three djcent towns: A, B, nd C. Ech tme the tx dschrges pssenger, the drver must choose from three possble ctons:

More information

Chapter Newton-Raphson Method of Solving a Nonlinear Equation

Chapter Newton-Raphson Method of Solving a Nonlinear Equation Chpter.4 Newton-Rphson Method of Solvng Nonlner Equton After redng ths chpter, you should be ble to:. derve the Newton-Rphson method formul,. develop the lgorthm of the Newton-Rphson method,. use the Newton-Rphson

More information

Rank One Update And the Google Matrix by Al Bernstein Signal Science, LLC

Rank One Update And the Google Matrix by Al Bernstein Signal Science, LLC Introducton Rnk One Updte And the Google Mtrx y Al Bernsten Sgnl Scence, LLC www.sgnlscence.net here re two dfferent wys to perform mtrx multplctons. he frst uses dot product formulton nd the second uses

More information

Quiz: Experimental Physics Lab-I

Quiz: Experimental Physics Lab-I Mxmum Mrks: 18 Totl tme llowed: 35 mn Quz: Expermentl Physcs Lb-I Nme: Roll no: Attempt ll questons. 1. In n experment, bll of mss 100 g s dropped from heght of 65 cm nto the snd contner, the mpct s clled

More information

4. Eccentric axial loading, cross-section core

4. Eccentric axial loading, cross-section core . Eccentrc xl lodng, cross-secton core Introducton We re strtng to consder more generl cse when the xl force nd bxl bendng ct smultneousl n the cross-secton of the br. B vrtue of Snt-Vennt s prncple we

More information

Chapter Newton-Raphson Method of Solving a Nonlinear Equation

Chapter Newton-Raphson Method of Solving a Nonlinear Equation Chpter 0.04 Newton-Rphson Method o Solvng Nonlner Equton Ater redng ths chpter, you should be ble to:. derve the Newton-Rphson method ormul,. develop the lgorthm o the Newton-Rphson method,. use the Newton-Rphson

More information

Variable time amplitude amplification and quantum algorithms for linear algebra. Andris Ambainis University of Latvia

Variable time amplitude amplification and quantum algorithms for linear algebra. Andris Ambainis University of Latvia Vrble tme mpltude mplfcton nd quntum lgorthms for lner lgebr Andrs Ambns Unversty of Ltv Tlk outlne. ew verson of mpltude mplfcton;. Quntum lgorthm for testng f A s sngulr; 3. Quntum lgorthm for solvng

More information

DCDM BUSINESS SCHOOL NUMERICAL METHODS (COS 233-8) Solutions to Assignment 3. x f(x)

DCDM BUSINESS SCHOOL NUMERICAL METHODS (COS 233-8) Solutions to Assignment 3. x f(x) DCDM BUSINESS SCHOOL NUMEICAL METHODS (COS -8) Solutons to Assgnment Queston Consder the followng dt: 5 f() 8 7 5 () Set up dfference tble through fourth dfferences. (b) Wht s the mnmum degree tht n nterpoltng

More information

Definition of Tracking

Definition of Tracking Trckng Defnton of Trckng Trckng: Generte some conclusons bout the moton of the scene, objects, or the cmer, gven sequence of mges. Knowng ths moton, predct where thngs re gong to project n the net mge,

More information

Principle Component Analysis

Principle Component Analysis Prncple Component Anlyss Jng Go SUNY Bufflo Why Dmensonlty Reducton? We hve too mny dmensons o reson bout or obtn nsghts from o vsulze oo much nose n the dt Need to reduce them to smller set of fctors

More information

6 Roots of Equations: Open Methods

6 Roots of Equations: Open Methods HK Km Slghtly modfed 3//9, /8/6 Frstly wrtten t Mrch 5 6 Roots of Equtons: Open Methods Smple Fed-Pont Iterton Newton-Rphson Secnt Methods MATLAB Functon: fzero Polynomls Cse Study: Ppe Frcton Brcketng

More information

The Schur-Cohn Algorithm

The Schur-Cohn Algorithm Modelng, Estmton nd Otml Flterng n Sgnl Processng Mohmed Njm Coyrght 8, ISTE Ltd. Aendx F The Schur-Cohn Algorthm In ths endx, our m s to resent the Schur-Cohn lgorthm [] whch s often used s crteron for

More information

UNIVERSITY OF IOANNINA DEPARTMENT OF ECONOMICS. M.Sc. in Economics MICROECONOMIC THEORY I. Problem Set II

UNIVERSITY OF IOANNINA DEPARTMENT OF ECONOMICS. M.Sc. in Economics MICROECONOMIC THEORY I. Problem Set II Mcroeconomc Theory I UNIVERSITY OF IOANNINA DEPARTMENT OF ECONOMICS MSc n Economcs MICROECONOMIC THEORY I Techng: A Lptns (Note: The number of ndctes exercse s dffculty level) ()True or flse? If V( y )

More information

Lecture 4: Piecewise Cubic Interpolation

Lecture 4: Piecewise Cubic Interpolation Lecture notes on Vrtonl nd Approxmte Methods n Appled Mthemtcs - A Perce UBC Lecture 4: Pecewse Cubc Interpolton Compled 6 August 7 In ths lecture we consder pecewse cubc nterpolton n whch cubc polynoml

More information

CALIBRATION OF SMALL AREA ESTIMATES IN BUSINESS SURVEYS

CALIBRATION OF SMALL AREA ESTIMATES IN BUSINESS SURVEYS CALIBRATION OF SMALL AREA ESTIMATES IN BUSINESS SURVES Rodolphe Prm, Ntle Shlomo Southmpton Sttstcl Scences Reserch Insttute Unverst of Southmpton Unted Kngdom SAE, August 20 The BLUE-ETS Project s fnnced

More information

523 P a g e. is measured through p. should be slower for lesser values of p and faster for greater values of p. If we set p*

523 P a g e. is measured through p. should be slower for lesser values of p and faster for greater values of p. If we set p* R. Smpth Kumr, R. Kruthk, R. Rdhkrshnn / Interntonl Journl of Engneerng Reserch nd Applctons (IJERA) ISSN: 48-96 www.jer.com Vol., Issue 4, July-August 0, pp.5-58 Constructon Of Mxed Smplng Plns Indexed

More information

ESCI 342 Atmospheric Dynamics I Lesson 1 Vectors and Vector Calculus

ESCI 342 Atmospheric Dynamics I Lesson 1 Vectors and Vector Calculus ESI 34 tmospherc Dnmcs I Lesson 1 Vectors nd Vector lculus Reference: Schum s Outlne Seres: Mthemtcl Hndbook of Formuls nd Tbles Suggested Redng: Mrtn Secton 1 OORDINTE SYSTEMS n orthonorml coordnte sstem

More information

In this Chapter. Chap. 3 Markov chains and hidden Markov models. Probabilistic Models. Example: CpG Islands

In this Chapter. Chap. 3 Markov chains and hidden Markov models. Probabilistic Models. Example: CpG Islands In ths Chpter Chp. 3 Mrov chns nd hdden Mrov models Bontellgence bortory School of Computer Sc. & Eng. Seoul Ntonl Unversty Seoul 5-74, Kore The probblstc model for sequence nlyss HMM (hdden Mrov model)

More information

Linear and Nonlinear Optimization

Linear and Nonlinear Optimization Lner nd Nonlner Optmzton Ynyu Ye Deprtment of Mngement Scence nd Engneerng Stnford Unversty Stnford, CA 9430, U.S.A. http://www.stnford.edu/~yyye http://www.stnford.edu/clss/msnde/ Ynyu Ye, Stnford, MS&E

More information

Partially Observable Systems. 1 Partially Observable Markov Decision Process (POMDP) Formalism

Partially Observable Systems. 1 Partially Observable Markov Decision Process (POMDP) Formalism CS294-40 Lernng for Rootcs nd Control Lecture 10-9/30/2008 Lecturer: Peter Aeel Prtlly Oservle Systems Scre: Dvd Nchum Lecture outlne POMDP formlsm Pont-sed vlue terton Glol methods: polytree, enumerton,

More information

GAUSS ELIMINATION. Consider the following system of algebraic linear equations

GAUSS ELIMINATION. Consider the following system of algebraic linear equations Numercl Anlyss for Engneers Germn Jordnn Unversty GAUSS ELIMINATION Consder the followng system of lgebrc lner equtons To solve the bove system usng clsscl methods, equton () s subtrcted from equton ()

More information

Chapter 5 Supplemental Text Material R S T. ij i j ij ijk

Chapter 5 Supplemental Text Material R S T. ij i j ij ijk Chpter 5 Supplementl Text Mterl 5-. Expected Men Squres n the Two-fctor Fctorl Consder the two-fctor fxed effects model y = µ + τ + β + ( τβ) + ε k R S T =,,, =,,, k =,,, n gven s Equton (5-) n the textook.

More information

Investigation phase in case of Bragg coupling

Investigation phase in case of Bragg coupling Journl of Th-Qr Unversty No.3 Vol.4 December/008 Investgton phse n cse of Brgg couplng Hder K. Mouhmd Deprtment of Physcs, College of Scence, Th-Qr, Unv. Mouhmd H. Abdullh Deprtment of Physcs, College

More information

International Journal of Pure and Applied Sciences and Technology

International Journal of Pure and Applied Sciences and Technology Int. J. Pure Appl. Sc. Technol., () (), pp. 44-49 Interntonl Journl of Pure nd Appled Scences nd Technolog ISSN 9-67 Avlle onlne t www.jopst.n Reserch Pper Numercl Soluton for Non-Lner Fredholm Integrl

More information

Course Review Introduction to Computer Methods

Course Review Introduction to Computer Methods Course Revew Wht you hopefully hve lerned:. How to nvgte nsde MIT computer system: Athen, UNIX, emcs etc. (GCR). Generl des bout progrmmng (GCR): formultng the problem, codng n Englsh trnslton nto computer

More information

An Introduction to Support Vector Machines

An Introduction to Support Vector Machines An Introducton to Support Vector Mchnes Wht s good Decson Boundry? Consder two-clss, lnerly seprble clssfcton problem Clss How to fnd the lne (or hyperplne n n-dmensons, n>)? Any de? Clss Per Lug Mrtell

More information

18.7 Artificial Neural Networks

18.7 Artificial Neural Networks 310 18.7 Artfcl Neurl Networks Neuroscence hs hypotheszed tht mentl ctvty conssts prmrly of electrochemcl ctvty n networks of brn cells clled neurons Ths led McCulloch nd Ptts to devse ther mthemtcl model

More information

Online Appendix to. Mandating Behavioral Conformity in Social Groups with Conformist Members

Online Appendix to. Mandating Behavioral Conformity in Social Groups with Conformist Members Onlne Appendx to Mndtng Behvorl Conformty n Socl Groups wth Conformst Members Peter Grzl Andrze Bnk (Correspondng uthor) Deprtment of Economcs, The Wllms School, Wshngton nd Lee Unversty, Lexngton, 4450

More information

Two Coefficients of the Dyson Product

Two Coefficients of the Dyson Product Two Coeffcents of the Dyson Product rxv:07.460v mth.co 7 Nov 007 Lun Lv, Guoce Xn, nd Yue Zhou 3,,3 Center for Combntorcs, LPMC TJKLC Nnk Unversty, Tnjn 30007, P.R. Chn lvlun@cfc.nnk.edu.cn gn@nnk.edu.cn

More information

Model Fitting and Robust Regression Methods

Model Fitting and Robust Regression Methods Dertment o Comuter Engneerng Unverst o Clorn t Snt Cruz Model Fttng nd Robust Regresson Methods CMPE 64: Imge Anlss nd Comuter Vson H o Fttng lnes nd ellses to mge dt Dertment o Comuter Engneerng Unverst

More information

INTRODUCTION TO COMPLEX NUMBERS

INTRODUCTION TO COMPLEX NUMBERS INTRODUCTION TO COMPLEX NUMBERS The numers -4, -3, -, -1, 0, 1,, 3, 4 represent the negtve nd postve rel numers termed ntegers. As one frst lerns n mddle school they cn e thought of s unt dstnce spced

More information

PLEASE SCROLL DOWN FOR ARTICLE

PLEASE SCROLL DOWN FOR ARTICLE Ths rtcle ws downloded by:ntonl Cheng Kung Unversty] On: 1 September 7 Access Detls: subscrpton number 7765748] Publsher: Tylor & Frncs Inform Ltd Regstered n Englnd nd Wles Regstered Number: 17954 Regstered

More information

Demand. Demand and Comparative Statics. Graphically. Marshallian Demand. ECON 370: Microeconomic Theory Summer 2004 Rice University Stanley Gilbert

Demand. Demand and Comparative Statics. Graphically. Marshallian Demand. ECON 370: Microeconomic Theory Summer 2004 Rice University Stanley Gilbert Demnd Demnd nd Comrtve Sttcs ECON 370: Mcroeconomc Theory Summer 004 Rce Unversty Stnley Glbert Usng the tools we hve develoed u to ths ont, we cn now determne demnd for n ndvdul consumer We seek demnd

More information

Smart Motorways HADECS 3 and what it means for your drivers

Smart Motorways HADECS 3 and what it means for your drivers Vehcle Rentl Smrt Motorwys HADECS 3 nd wht t mens for your drvers Vehcle Rentl Smrt Motorwys HADECS 3 nd wht t mens for your drvers You my hve seen some news rtcles bout the ntroducton of Hghwys Englnd

More information

Computing a complete histogram of an image in Log(n) steps and minimum expected memory requirements using hypercubes

Computing a complete histogram of an image in Log(n) steps and minimum expected memory requirements using hypercubes Computng complete hstogrm of n mge n Log(n) steps nd mnmum expected memory requrements usng hypercubes TAREK M. SOBH School of Engneerng, Unversty of Brdgeport, Connectcut, USA. Abstrct Ths work frst revews

More information

Introduction to Numerical Integration Part II

Introduction to Numerical Integration Part II Introducton to umercl Integrton Prt II CS 75/Mth 75 Brn T. Smth, UM, CS Dept. Sprng, 998 4/9/998 qud_ Intro to Gussn Qudrture s eore, the generl tretment chnges the ntegrton prolem to ndng the ntegrl w

More information

ICS 252 Introduction to Computer Design

ICS 252 Introduction to Computer Design ICS 252 Introducton to Computer Desgn Prttonng El Bozorgzdeh Computer Scence Deprtment-UCI Prttonng Decomposton of complex system nto smller susystems Done herrchclly Prttonng done untl ech susystem hs

More information

Statistics 423 Midterm Examination Winter 2009

Statistics 423 Midterm Examination Winter 2009 Sttstcs 43 Mdterm Exmnton Wnter 009 Nme: e-ml: 1. Plese prnt your nme nd e-ml ddress n the bove spces.. Do not turn ths pge untl nstructed to do so. 3. Ths s closed book exmnton. You my hve your hnd clcultor

More information

3/6/00. Reading Assignments. Outline. Hidden Markov Models: Explanation and Model Learning

3/6/00. Reading Assignments. Outline. Hidden Markov Models: Explanation and Model Learning 3/6/ Hdden Mrkov Models: Explnton nd Model Lernng Brn C. Wllms 6.4/6.43 Sesson 2 9/3/ courtesy of JPL copyrght Brn Wllms, 2 Brn C. Wllms, copyrght 2 Redng Assgnments AIMA (Russell nd Norvg) Ch 5.-.3, 2.3

More information

Katholieke Universiteit Leuven Department of Computer Science

Katholieke Universiteit Leuven Department of Computer Science Updte Rules for Weghted Non-negtve FH*G Fctorzton Peter Peers Phlp Dutré Report CW 440, Aprl 006 Ktholeke Unverstet Leuven Deprtment of Computer Scence Celestjnenln 00A B-3001 Heverlee (Belgum) Updte Rules

More information

Lecture 36. Finite Element Methods

Lecture 36. Finite Element Methods CE 60: Numercl Methods Lecture 36 Fnte Element Methods Course Coordntor: Dr. Suresh A. Krth, Assocte Professor, Deprtment of Cvl Engneerng, IIT Guwht. In the lst clss, we dscussed on the ppromte methods

More information

Structure and Drive Paul A. Jensen Copyright July 20, 2003

Structure and Drive Paul A. Jensen Copyright July 20, 2003 Structure and Drve Paul A. Jensen Copyrght July 20, 2003 A system s made up of several operatons wth flow passng between them. The structure of the system descrbes the flow paths from nputs to outputs.

More information

4. More general extremum principles and thermodynamic potentials

4. More general extremum principles and thermodynamic potentials 4. More generl etremum prncples nd thermodynmc potentls We hve seen tht mn{u(s, X )} nd m{s(u, X)} mply one nother. Under certn condtons, these prncples re very convenent. For emple, ds = 1 T du T dv +

More information

Fitting a Polynomial to Heat Capacity as a Function of Temperature for Ag. Mathematical Background Document

Fitting a Polynomial to Heat Capacity as a Function of Temperature for Ag. Mathematical Background Document Fttng Polynol to Het Cpcty s Functon of Teperture for Ag. thetcl Bckground Docuent by Theres Jul Zelnsk Deprtent of Chestry, edcl Technology, nd Physcs onouth Unversty West ong Brnch, J 7764-898 tzelns@onouth.edu

More information

Physics 121 Sample Common Exam 2 Rev2 NOTE: ANSWERS ARE ON PAGE 7. Instructions:

Physics 121 Sample Common Exam 2 Rev2 NOTE: ANSWERS ARE ON PAGE 7. Instructions: Physcs 121 Smple Common Exm 2 Rev2 NOTE: ANSWERS ARE ON PAGE 7 Nme (Prnt): 4 Dgt ID: Secton: Instructons: Answer ll 27 multple choce questons. You my need to do some clculton. Answer ech queston on the

More information

A Tri-Valued Belief Network Model for Information Retrieval

A Tri-Valued Belief Network Model for Information Retrieval December 200 A Tr-Vlued Belef Networ Model for Informton Retrevl Fernndo Ds-Neves Computer Scence Dept. Vrgn Polytechnc Insttute nd Stte Unversty Blcsburg, VA 24060. IR models t Combnng Evdence Grphcl

More information

Electrochemical Thermodynamics. Interfaces and Energy Conversion

Electrochemical Thermodynamics. Interfaces and Energy Conversion CHE465/865, 2006-3, Lecture 6, 18 th Sep., 2006 Electrochemcl Thermodynmcs Interfces nd Energy Converson Where does the energy contrbuton F zϕ dn come from? Frst lw of thermodynmcs (conservton of energy):

More information

6.6 The Marquardt Algorithm

6.6 The Marquardt Algorithm 6.6 The Mqudt Algothm lmttons of the gdent nd Tylo expnson methods ecstng the Tylo expnson n tems of ch-sque devtves ecstng the gdent sech nto n tetve mtx fomlsm Mqudt's lgothm utomtclly combnes the gdent

More information

Lecture 5 Single factor design and analysis

Lecture 5 Single factor design and analysis Lectue 5 Sngle fcto desgn nd nlss Completel ndomzed desgn (CRD Completel ndomzed desgn In the desgn of expements, completel ndomzed desgns e fo studng the effects of one pm fcto wthout the need to tke

More information

The solution of transport problems by the method of structural optimization

The solution of transport problems by the method of structural optimization Scentfc Journls Mrtme Unversty of Szczecn Zeszyty Nukowe Akdem Morsk w Szczecne 2013, 34(106) pp. 59 64 2013, 34(106) s. 59 64 ISSN 1733-8670 The soluton of trnsport problems by the method of structurl

More information

Jean Fernand Nguema LAMETA UFR Sciences Economiques Montpellier. Abstract

Jean Fernand Nguema LAMETA UFR Sciences Economiques Montpellier. Abstract Stochstc domnnce on optml portfolo wth one rsk less nd two rsky ssets Jen Fernnd Nguem LAMETA UFR Scences Economques Montpeller Abstrct The pper provdes restrctons on the nvestor's utlty functon whch re

More information

Investigation of Fatality Probability Function Associated with Injury Severity and Age. Toshiyuki Yanaoka, Akihiko Akiyama, Yukou Takahashi

Investigation of Fatality Probability Function Associated with Injury Severity and Age. Toshiyuki Yanaoka, Akihiko Akiyama, Yukou Takahashi Investgton of Ftlty Probblty Functon Assocted wth Injury Severty nd Age Toshyuk Ynok, Akhko Akym, Yukou Tkhsh Abstrct The gol of ths study s to develop ftlty probblty functon ssocted wth njury severty

More information

Many-Body Calculations of the Isotope Shift

Many-Body Calculations of the Isotope Shift Mny-Body Clcultons of the Isotope Shft W. R. Johnson Mrch 11, 1 1 Introducton Atomc energy levels re commonly evluted ssumng tht the nucler mss s nfnte. In ths report, we consder correctons to tomc levels

More information

CHAPTER - 7. Firefly Algorithm based Strategic Bidding to Maximize Profit of IPPs in Competitive Electricity Market

CHAPTER - 7. Firefly Algorithm based Strategic Bidding to Maximize Profit of IPPs in Competitive Electricity Market CHAPTER - 7 Frefly Algorthm sed Strtegc Bddng to Mxmze Proft of IPPs n Compettve Electrcty Mrket 7. Introducton The renovton of electrc power systems plys mjor role on economc nd relle operton of power

More information

CS434a/541a: Pattern Recognition Prof. Olga Veksler. Lecture 9

CS434a/541a: Pattern Recognition Prof. Olga Veksler. Lecture 9 CS434/541: Pttern Recognton Prof. Olg Veksler Lecture 9 Announcements Fnl project proposl due Nov. 1 1-2 prgrph descrpton Lte Penlt: s 1 pont off for ech d lte Assgnment 3 due November 10 Dt for fnl project

More information

Statistics and Probability Letters

Statistics and Probability Letters Sttstcs nd Probblty Letters 79 (2009) 105 111 Contents lsts vlble t ScenceDrect Sttstcs nd Probblty Letters journl homepge: www.elsever.com/locte/stpro Lmtng behvour of movng verge processes under ϕ-mxng

More information

Multiple view geometry

Multiple view geometry EECS 442 Computer vson Multple vew geometry Perspectve Structure from Moton - Perspectve structure from moton prolem - mgutes - lgerc methods - Fctorzton methods - Bundle djustment - Self-clrton Redng:

More information

Lecture 12: Discrete Laplacian

Lecture 12: Discrete Laplacian Lecture 12: Dscrete Laplacan Scrbe: Tanye Lu Our goal s to come up wth a dscrete verson of Laplacan operator for trangulated surfaces, so that we can use t n practce to solve related problems We are mostly

More information

Pyramid Algorithms for Barycentric Rational Interpolation

Pyramid Algorithms for Barycentric Rational Interpolation Pyrmd Algorthms for Brycentrc Rtonl Interpolton K Hormnn Scott Schefer Astrct We present new perspectve on the Floter Hormnn nterpolnt. Ths nterpolnt s rtonl of degree (n, d), reproduces polynomls of degree

More information

M/G/1/GD/ / System. ! Pollaczek-Khinchin (PK) Equation. ! Steady-state probabilities. ! Finding L, W q, W. ! π 0 = 1 ρ

M/G/1/GD/ / System. ! Pollaczek-Khinchin (PK) Equation. ! Steady-state probabilities. ! Finding L, W q, W. ! π 0 = 1 ρ M/G//GD/ / System! Pollcze-Khnchn (PK) Equton L q 2 2 λ σ s 2( + ρ ρ! Stedy-stte probbltes! π 0 ρ! Fndng L, q, ) 2 2 M/M/R/GD/K/K System! Drw the trnston dgrm! Derve the stedy-stte probbltes:! Fnd L,L

More information

NUMERICAL MODELLING OF A CILIUM USING AN INTEGRAL EQUATION

NUMERICAL MODELLING OF A CILIUM USING AN INTEGRAL EQUATION NUEICAL ODELLING OF A CILIU USING AN INTEGAL EQUATION IHAI EBICAN, DANIEL IOAN Key words: Cl, Numercl nlyss, Electromgnetc feld, gnetton. The pper presents fst nd ccurte method to model the mgnetc behvour

More information

Review of linear algebra. Nuno Vasconcelos UCSD

Review of linear algebra. Nuno Vasconcelos UCSD Revew of lner lgebr Nuno Vsconcelos UCSD Vector spces Defnton: vector spce s set H where ddton nd sclr multplcton re defned nd stsf: ) +( + ) (+ )+ 5) λ H 2) + + H 6) 3) H, + 7) λ(λ ) (λλ ) 4) H, - + 8)

More information

Study of Trapezoidal Fuzzy Linear System of Equations S. M. Bargir 1, *, M. S. Bapat 2, J. D. Yadav 3 1

Study of Trapezoidal Fuzzy Linear System of Equations S. M. Bargir 1, *, M. S. Bapat 2, J. D. Yadav 3 1 mercn Interntonl Journl of Reserch n cence Technology Engneerng & Mthemtcs vlble onlne t http://wwwsrnet IN (Prnt: 38-349 IN (Onlne: 38-3580 IN (CD-ROM: 38-369 IJRTEM s refereed ndexed peer-revewed multdscplnry

More information

A Family of Multivariate Abel Series Distributions. of Order k

A Family of Multivariate Abel Series Distributions. of Order k Appled Mthemtcl Scences, Vol. 2, 2008, no. 45, 2239-2246 A Fmly of Multvrte Abel Seres Dstrbutons of Order k Rupk Gupt & Kshore K. Ds 2 Fculty of Scence & Technology, The Icf Unversty, Agrtl, Trpur, Ind

More information

Math 497C Sep 17, Curves and Surfaces Fall 2004, PSU

Math 497C Sep 17, Curves and Surfaces Fall 2004, PSU Mth 497C Sep 17, 004 1 Curves nd Surfces Fll 004, PSU Lecture Notes 3 1.8 The generl defnton of curvture; Fox-Mlnor s Theorem Let α: [, b] R n be curve nd P = {t 0,...,t n } be prtton of [, b], then the

More information

Formulated Algorithm for Computing Dominant Eigenvalue. and the Corresponding Eigenvector

Formulated Algorithm for Computing Dominant Eigenvalue. and the Corresponding Eigenvector Int. J. Contemp. Mth. Scences Vol. 8 23 no. 9 899-9 HIKARI Ltd www.m-hkr.com http://dx.do.org/.2988/jcms.23.3674 Formulted Algorthm for Computng Domnnt Egenlue nd the Correspondng Egenector Igob Dod Knu

More information

Three hours UNIVERSITY OF MANCHESTER SCHOOL OF COMPUTER SCIENCE. Date: Wednesday 16th January 2013 Time: 09:45-12:45

Three hours UNIVERSITY OF MANCHESTER SCHOOL OF COMPUTER SCIENCE. Date: Wednesday 16th January 2013 Time: 09:45-12:45 Three hours UNIVERSITY OF MANHESTER SHOOL OF OMPUTER SIENE Prllel Progrms nd ther Performnce Dte: Wednesdy 16th Jnury 2013 Tme: 09:45-12:45 Plese nswer ny TWO Questons from the FOUR Questons provded. Ths

More information

Using Predictions in Online Optimization: Looking Forward with an Eye on the Past

Using Predictions in Online Optimization: Looking Forward with an Eye on the Past Usng Predctons n Onlne Optmzton: Lookng Forwrd wth n Eye on the Pst Nngjun Chen Jont work wth Joshu Comden, Zhenhu Lu, Anshul Gndh, nd Adm Wermn 1 Predctons re crucl for decson mkng 2 Predctons re crucl

More information

Identification of Robot Arm s Joints Time-Varying Stiffness Under Loads

Identification of Robot Arm s Joints Time-Varying Stiffness Under Loads TELKOMNIKA, Vol.10, No.8, December 2012, pp. 2081~2087 e-issn: 2087-278X ccredted by DGHE (DIKTI), Decree No: 51/Dkt/Kep/2010 2081 Identfcton of Robot Arm s Jonts Tme-Vryng Stffness Under Lods Ru Xu 1,

More information

7.2 Volume. A cross section is the shape we get when cutting straight through an object.

7.2 Volume. A cross section is the shape we get when cutting straight through an object. 7. Volume Let s revew the volume of smple sold, cylnder frst. Cylnder s volume=se re heght. As llustrted n Fgure (). Fgure ( nd (c) re specl cylnders. Fgure () s rght crculr cylnder. Fgure (c) s ox. A

More information

Torsion, Thermal Effects and Indeterminacy

Torsion, Thermal Effects and Indeterminacy ENDS Note Set 7 F007bn orson, herml Effects nd Indetermncy Deformton n orsonlly Loded Members Ax-symmetrc cross sectons subjected to xl moment or torque wll remn plne nd undstorted. At secton, nternl torque

More information

Homogeneous and Heterogeneous Traffic of Data Packets on Complex Networks: The Traffic Congestion Phenomenon *

Homogeneous and Heterogeneous Traffic of Data Packets on Complex Networks: The Traffic Congestion Phenomenon * Communctons nd Network, 2012, 4, 157-182 http://dx.do.org/10.4236/cn.2012.42021 Publshed Onlne My 2012 (http://www.scrp.org/journl/cn) Homogeneous nd Heterogeneous Trffc of Dt Pckets on Complex Networks:

More information

Strong Gravity and the BKL Conjecture

Strong Gravity and the BKL Conjecture Introducton Strong Grvty nd the BKL Conecture Dvd Slon Penn Stte October 16, 2007 Dvd Slon Strong Grvty nd the BKL Conecture Introducton Outlne The BKL Conecture Ashtekr Vrbles Ksner Sngulrty 1 Introducton

More information

Effects of polarization on the reflected wave

Effects of polarization on the reflected wave Lecture Notes. L Ros PPLIED OPTICS Effects of polrzton on the reflected wve Ref: The Feynmn Lectures on Physcs, Vol-I, Secton 33-6 Plne of ncdence Z Plne of nterfce Fg. 1 Y Y r 1 Glss r 1 Glss Fg. Reflecton

More information

THE COMBINED SHEPARD ABEL GONCHAROV UNIVARIATE OPERATOR

THE COMBINED SHEPARD ABEL GONCHAROV UNIVARIATE OPERATOR REVUE D ANALYSE NUMÉRIQUE ET DE THÉORIE DE L APPROXIMATION Tome 32, N o 1, 2003, pp 11 20 THE COMBINED SHEPARD ABEL GONCHAROV UNIVARIATE OPERATOR TEODORA CĂTINAŞ Abstrct We extend the Sheprd opertor by

More information

Goals: Determine how to calculate the area described by a function. Define the definite integral. Explore the relationship between the definite

Goals: Determine how to calculate the area described by a function. Define the definite integral. Explore the relationship between the definite Unit #8 : The Integrl Gols: Determine how to clculte the re described by function. Define the definite integrl. Eplore the reltionship between the definite integrl nd re. Eplore wys to estimte the definite

More information

LOCAL FRACTIONAL LAPLACE SERIES EXPANSION METHOD FOR DIFFUSION EQUATION ARISING IN FRACTAL HEAT TRANSFER

LOCAL FRACTIONAL LAPLACE SERIES EXPANSION METHOD FOR DIFFUSION EQUATION ARISING IN FRACTAL HEAT TRANSFER Yn, S.-P.: Locl Frctonl Lplce Seres Expnson Method for Dffuson THERMAL SCIENCE, Yer 25, Vol. 9, Suppl., pp. S3-S35 S3 LOCAL FRACTIONAL LAPLACE SERIES EXPANSION METHOD FOR DIFFUSION EQUATION ARISING IN

More information

NUMERICAL DIFFERENTIATION

NUMERICAL DIFFERENTIATION NUMERICAL DIFFERENTIATION 1 Introducton Dfferentaton s a method to compute the rate at whch a dependent output y changes wth respect to the change n the ndependent nput x. Ths rate of change s called the

More information

CENTROID (AĞIRLIK MERKEZİ )

CENTROID (AĞIRLIK MERKEZİ ) CENTOD (ĞLK MEKEZİ ) centrod s geometrcl concept rsng from prllel forces. Tus, onl prllel forces possess centrod. Centrod s tougt of s te pont were te wole wegt of pscl od or sstem of prtcles s lumped.

More information

Proof that if Voting is Perfect in One Dimension, then the First. Eigenvector Extracted from the Double-Centered Transformed

Proof that if Voting is Perfect in One Dimension, then the First. Eigenvector Extracted from the Double-Centered Transformed Proof tht f Votng s Perfect n One Dmenson, then the Frst Egenvector Extrcted from the Doule-Centered Trnsformed Agreement Score Mtrx hs the Sme Rn Orderng s the True Dt Keth T Poole Unversty of Houston

More information

Solubilities and Thermodynamic Properties of SO 2 in Ionic

Solubilities and Thermodynamic Properties of SO 2 in Ionic Solubltes nd Therodync Propertes of SO n Ionc Lquds Men Jn, Yucu Hou, b Weze Wu, *, Shuhng Ren nd Shdong Tn, L Xo, nd Zhgng Le Stte Key Lbortory of Checl Resource Engneerng, Beng Unversty of Checl Technology,

More information

Least squares. Václav Hlaváč. Czech Technical University in Prague

Least squares. Václav Hlaváč. Czech Technical University in Prague Lest squres Václv Hlváč Czech echncl Unversty n Prgue hlvc@fel.cvut.cz http://cmp.felk.cvut.cz/~hlvc Courtesy: Fred Pghn nd J.P. Lews, SIGGRAPH 2007 Course; Outlne 2 Lner regresson Geometry of lest-squres

More information

8 Transportation Problem Alpha-Beta

8 Transportation Problem Alpha-Beta 8 rnsportton Proble Alph-Bet Now, we ntroduce n ddtonl lgorth for the Htchcock rnsportton proble, whch ws lredy ntroduced before hs s the Alph-Bet Algorth It copletes the lst of soluton pproches for solvng

More information

CISE 301: Numerical Methods Lecture 5, Topic 4 Least Squares, Curve Fitting

CISE 301: Numerical Methods Lecture 5, Topic 4 Least Squares, Curve Fitting CISE 3: umercl Methods Lecture 5 Topc 4 Lest Squres Curve Fttng Dr. Amr Khouh Term Red Chpter 7 of the tetoo c Khouh CISE3_Topc4_Lest Squre Motvton Gven set of epermentl dt 3 5. 5.9 6.3 The reltonshp etween

More information

Limited Dependent Variables

Limited Dependent Variables Lmted Dependent Varables. What f the left-hand sde varable s not a contnuous thng spread from mnus nfnty to plus nfnty? That s, gven a model = f (, β, ε, where a. s bounded below at zero, such as wages

More information

Name Solutions to Test 3 November 8, 2017

Name Solutions to Test 3 November 8, 2017 Nme Solutions to Test 3 November 8, 07 This test consists of three prts. Plese note tht in prts II nd III, you cn skip one question of those offered. Some possibly useful formuls cn be found below. Brrier

More information

We consider a finite-state, finite-action, infinite-horizon, discounted reward Markov decision process and

We consider a finite-state, finite-action, infinite-horizon, discounted reward Markov decision process and MANAGEMENT SCIENCE Vol. 53, No. 2, Februry 2007, pp. 308 322 ssn 0025-1909 essn 1526-5501 07 5302 0308 nforms do 10.1287/mnsc.1060.0614 2007 INFORMS Bs nd Vrnce Approxmton n Vlue Functon Estmtes She Mnnor

More information

DESIGN OF MULTILOOP CONTROLLER FOR THREE TANK PROCESS USING CDM TECHNIQUES

DESIGN OF MULTILOOP CONTROLLER FOR THREE TANK PROCESS USING CDM TECHNIQUES DESIGN OF MULTILOOP CONTROLLER FOR THREE TANK PROCESS USING CDM TECHNIQUES N. Kngsb 1 nd N. Jy 2 1,2 Deprtment of Instrumentton Engneerng,Annml Unversty, Annmlngr, 608002, Ind ABSTRACT In ths study the

More information

Psychology 282 Lecture #24 Outline Regression Diagnostics: Outliers

Psychology 282 Lecture #24 Outline Regression Diagnostics: Outliers Psychology 282 Lecture #24 Outlne Regresson Dagnostcs: Outlers In an earler lecture we studed the statstcal assumptons underlyng the regresson model, ncludng the followng ponts: Formal statement of assumptons.

More information

Math 1B, lecture 4: Error bounds for numerical methods

Math 1B, lecture 4: Error bounds for numerical methods Mth B, lecture 4: Error bounds for numericl methods Nthn Pflueger 4 September 0 Introduction The five numericl methods descried in the previous lecture ll operte by the sme principle: they pproximte the

More information

Math 8 Winter 2015 Applications of Integration

Math 8 Winter 2015 Applications of Integration Mth 8 Winter 205 Applictions of Integrtion Here re few importnt pplictions of integrtion. The pplictions you my see on n exm in this course include only the Net Chnge Theorem (which is relly just the Fundmentl

More information

LAPLACE TRANSFORM SOLUTION OF THE PROBLEM OF TIME-FRACTIONAL HEAT CONDUCTION IN A TWO-LAYERED SLAB

LAPLACE TRANSFORM SOLUTION OF THE PROBLEM OF TIME-FRACTIONAL HEAT CONDUCTION IN A TWO-LAYERED SLAB Journl of Appled Mthemtcs nd Computtonl Mechncs 5, 4(4), 5-3 www.mcm.pcz.pl p-issn 99-9965 DOI:.75/jmcm.5.4. e-issn 353-588 LAPLACE TRANSFORM SOLUTION OF THE PROBLEM OF TIME-FRACTIONAL HEAT CONDUCTION

More information

INTERPOLATION(1) ELM1222 Numerical Analysis. ELM1222 Numerical Analysis Dr Muharrem Mercimek

INTERPOLATION(1) ELM1222 Numerical Analysis. ELM1222 Numerical Analysis Dr Muharrem Mercimek ELM Numercl Anlss Dr Muhrrem Mercmek INTEPOLATION ELM Numercl Anlss Some of the contents re dopted from Lurene V. Fusett, Appled Numercl Anlss usng MATLAB. Prentce Hll Inc., 999 ELM Numercl Anlss Dr Muhrrem

More information

Temperature. Chapter Heat Engine

Temperature. Chapter Heat Engine Chapter 3 Temperature In prevous chapters of these notes we ntroduced the Prncple of Maxmum ntropy as a technque for estmatng probablty dstrbutons consstent wth constrants. In Chapter 9 we dscussed the

More information

1 Online Learning and Regret Minimization

1 Online Learning and Regret Minimization 2.997 Decision-Mking in Lrge-Scle Systems My 10 MIT, Spring 2004 Hndout #29 Lecture Note 24 1 Online Lerning nd Regret Minimiztion In this lecture, we consider the problem of sequentil decision mking in

More information

For now, let us focus on a specific model of neurons. These are simplified from reality but can achieve remarkable results.

For now, let us focus on a specific model of neurons. These are simplified from reality but can achieve remarkable results. Neural Networks : Dervaton compled by Alvn Wan from Professor Jtendra Malk s lecture Ths type of computaton s called deep learnng and s the most popular method for many problems, such as computer vson

More information