Estimation of Pedestrian Distribution in Indoor Environments using Multiple Pedestrian Tracking

Size: px
Start display at page:

Download "Estimation of Pedestrian Distribution in Indoor Environments using Multiple Pedestrian Tracking"

Transcription

1 Proceedngs of he IEEE ICRA 9 Workshop on People Deecon and Trackng Kobe, Japan, May 9 Esmaon of Pedesran Dsrbuon n Indoor Envronmens usng Mulple Pedesran Trackng Muhammad Emaduddn Robocs & AI Deparmen Naonal Unversy of Scences and Technology H-1, Islamabad, Paksan emadudd@usc.edu Absrac - We propose a wo-er daa analyss approach for esmang dsrbuon of pedesran locaons n an ndoor space usng mulple pedesran deecon and rackng. Mulple pedesran deecon uses laser measuremen for sensng pedesrans n a heavly occluded envronmen whch s usually he case wh mos ndoor envronmens.. We adap a parcle fler based mulple pedesran racker o address he consrans of a lmed number of sensors, heavy occluson and real-me execuon. Under hese condons any deecon and rackng echnque s lkely o encouner a degree of error n cardnaly and poson of pedesrans. A compleely new approach s employed whch measures he error n racker oupu due o occluson and uses o esmae a probably densy funcon whch represens he probable number of pedesrans locaed a a parcular exhb a a parcular me. The end resul of he sysem s a varable represenng cardnaly of pedesrans a a parcular exhb. Ths varable follows a dsrbuon whch s approxmaely normal where he varance of he probably dsrbuon funcon s drecly proporonal o he error encounered by he racker because of occluson. The accuracy of our deecon and rackng algorhm was esed boh separaely and n conuncon wh he second-er pedesran dsrbuon analyss and found marked mprovemen makng our average pedesran counng accuracy o a leas 9% for all he pedesran poson daa ha we gahered wh average pedesran densy a.34 pedesrans per sq. meer. Snce he envronmen consrans for our sysem are unprecedened, we were unable o compare our resul o any prevous expermens. We recorded he number of people a each exhb manually o esablsh he ground ruh and compare our resuls. I. INTRODUCTION Indoor deecon and rackng of pedesrans has a wde specrum of applcaons rangng from archecural desgn of walkways o conrollng pedesran flow a publc places lke heares, museums, arpors, spors arenas, convenons ceners and parks. Our effor n hs paper s o devse a sysem capable of rackng and counng pedesrans n real-me usng mnmal resources. The word mnmal here refers o he fewes possble laser measuremen sensors wh consrans on her orenaon and placemen. In real lfe applcaons, (e.g. narrow walkways, mounng on vehcles ec he se of feasble locaons for deployng sensors can be severely consraned. In our experence he requremens for non-nrusveness of sensors.e. relable elecrcal power and maxmum sensor coverage, lm he number and placemen of sensors. Among Ths work was parally suppored by.us Naonal Scence Foundaon under her Crosscung Human and Socal Dynamcs (HSD program. Dylan A. Shell Compuer Scence Deparmen Unversy of Souhern Calforna Los Angeles, CA 989, USA dshell@robocs.usc.edu he se of sensors ha are avalable for rackng pedesrans, laser-range fnders (LADAR are presenly among he mos relable and accurae; hey relably provde sub-cenmeer accuracy a mllsecond frequences n range of envronmens. Bu even wh he hgh fdely ha laser sensors provde, crcumsances exs n whch laser-based echnques fal o produce dependable pedesran rackng resuls. Whle he echnques nroduced n [1], [3], [4], [5], [6] and [7] are among he mos successful n erms of rackng accuracy, hey are sgnfcanly lmed when dealng wh occlusons [] and many have a compuaonal complexy ha means hey reman unsuable for real-me applcaons. Whle our developed sysem s no as accurae as he onlne-learnng racker descrbed n [4], produces dependable resuls n heavly occluded envronmens whle no compromsng s real-me applcaons. II. EXPERIMENT SETUP Our es-bed for he deecon and rackng algorhm consss of a unnel lke pahway whch has fve exhbs along s pah and wo access doorways o an unobserved heare exhb close o he cenre of he pahway as shown n Fgure. 1. Pedesrans can ener and ex he secon of museum under dscusson usng any of he wo accesses o he pahway. Pedesrans can also ener n and ou from any of he doorway accesses o he unobserved exhb. Ths pahway was chosen o be our es case as allows varous suaons ha can nroduce complcaons n ndoor pedesran deecon and rackng o be esed. These suaons nclude: ( Pedesrans move n a narrow unnel lke space hus here exss a hgh probably of occluson due o close proxmy of people: ( The pahway conans secons ha can help us observe compleely dsnc behavour of pedesrans e.g. a he exhbs where we expec pedesrans o sop and gaher, away from exhbs where we expec pedesrans o walk wh a relavely longer srde and a enrances where pedesrans are usually n an exploraory mode and end o change walkng drecon very quckly: ( The wo only access doorways o he crcular heare are observed by our laser scanners hus we were able o keep rack of people presen whn he heare whou even drecly observng hem by smple coun-keepng of people leavng and enerng he heare, (v Pedesrans vsng he exhbs were boh aduls and chldren whch requred us o une deecon o accep a relavely wde range of values for srde of a pedesran, (v Pedesran groups,

2 Enrances/exs for he arena Exhb 1 Exhb Exhb 4 Exhb 5 Fg.1. Tes arena whch were usually a group of sudens lead by a eacher were a frequen occurrence a our es bed. In order o mee our obecve of rackng a farly large number of people ulzng mnmum possble resources, we decded o place wo SICK Laser Measuremen Sensors (LMS a a dsance of approxmaely 8 meers from each oher o cover an area of roughly 7 sq. meers. Ranges of our laser sensors overlapped for almos 16 sq. meers of area ou of he oal hus gvng us a relavely accurae coun n he overlapped area. The oal area was dvded no 5 cells each represenng an exhb (as shown wh red lnes n Fgure 1. These cells wll be laer used o gaher coun of pedesrans vsng each exhb a any gven me. The off-he-ground hegh of roang mrror whn laser sensor was se a 9.9cm for all observaons durng he proec. Ths hegh plays a crucal role n deecon and assocaon of clusers o he pedesrans snce lowerng he sensor hegh gves us dscree clusers represenng fee bu a he same me decreases our chances of deecon of fee snce we rase our fee whle walkng. On he oher hand ncrease n hegh ends o gnore dscree clusers from fee of chldren or people wh shor heghs. The effecve scannng frequency of laser sensors s abou 39Hz. The foreground pons from he laser sensors were exraced easly by background learnng and subracng from laser sensor readngs. III. THE SYSTEM Laser sensor Exhb 3 Enrances/exs o unobserved exhb Laser sensor We presen a sysem ha s capable of deecng, rackng and he gvng us he probably of pedesran coun a requred locaons. I comprses of wo ers explaned n deal below Ter 1: Deecng and Trackng Pedesrans As wll be shown, hs nvolves a non-rval adapaon and exenson of he echnques developed n [1]. We descrbe he hree pars below. A. Cluserng: Our algorhm sars by cluserng ncomng pons from laser sensors usng mean shf cluserng algorhm. The sysem needs he sze of cluser parameer a hs pon whch s equvalen o he average area A of fooprn of an adul foo.e..4 sq. meers []. B. Temporal Correlaon Analyss: Afer classfcaon of pons no clusers we erae hrough clusers and esablsh whch clusers belong o whch pedesran based on he noon ha each pedesran can be assocaed wh a maxmum of wo clusers n nh frame whch le closes o he pedesran n (n- 1s frame, we call hs sep as emporal correlaon sep. We dvde hs sep no wo phases ( Phase one sars wh denfcaon of poenal fee of pedesrans by calculang closes clusers and separang hese as pars. Only hose clusers qualfy as fee par whch le whn a parameer know as ner-fee dsance I and have szes n he vcny of A sq. meers. es _ par( C, C { Par ( C, C dsa nce( C, C mn( dsa nce( C, C } max( sze( C, sze( C.4 Par 1 ( C, C I The remanng unpared clusers are hough o be clusers whch are formed due o he fac ha we cross our fee whle walkng hus renderng a sngle cluser n he laser sensor readngs. The area of such clusers can be a mos wce he fooprn area of an average human foo ( Second phase consss of deermnng wheher each cluser par belongs o a newly deeced pedesran or should be consdered an updae for an already racked pedesran P on he scene. Ths s done usng assocaon dsance D ha s he maxmum dsance ha a pedesran can ravel beween readngs colleced by laser sensors. Therefore he value of D s dependen upon he maxmum walkng speed of pedesrans n he arena. assocae ( Par { updae ( Par, P, P dsa nce ( Par, P D mn( dsa nce ( Par, P 1 } Inroducng above condon lms he dsance ravelled by pedesrans whle beng occluded and sll beng effecvely racked as a unque pedesran. We observed ha he perodc moon of pedesran fee descrbed n [1] remans undeecable mos of he me n envronmens cluered wh occlusons. Algorhm n [1] defnes merge as a sage durng walk when clusers of boh fee of a pedesran come close ogeher and her clusers merge whle spl s descrbed as a case when he pedesran connues o walk afer a merge and clusers of boh fee spl par. Whle merge and spl cases were occasonally encounered durng (1 (

3 our expermen, we found ou ha deecon of pedesrans n hs manner s boh naccurae and compuaonally burdensome. The reason of naccuracy les n followng noons (a Mos of he me we observe pedesrans walkng n close proxmy o oher pedesrans or n he shape of groups, hs ends o produce merges and spls ha nvolve fee of wo dfferen pedesrans (b Due o frequen occluson (see Fgure We are lkely o mss spls and merges belongng o a pedesran hus renderng our spl/merge deecon mechansm useless under hs suaon (c Pedesrans may no always walk, hey mgh us sand for a whle. Our soluon o hese problems as evden by (1 and ( s o gnore he merge and spl cases compleely hus reducng he me complexy of emporal correlaon sep o (n logn + (nm.log(nm/3 where n s he number of clusers and m s he number of pedesrans on he scene. Afer hs sep, deeced pedesrans along wh her assocaed clusers are provded o he racker.e. our nex sep n sequence. C. Trackng: The racker s he componen of our sysem ha s responsble for esmang he parameers of moon and locaon aached wh our pedesran based on gven updaes from emporal correlaon sep. I uses a parcle fler o esmae he poson p, srde s, drecon d and phase ph of a pedesran as already employed n [1]. In bref he racker keeps rack of he pedesrans n hree sub-seps ( Updae Sep: Tracker weghs each pedesran's parcles proporonal o her dsance o he pons belongng o s assocaed clusers: ( Samplng Sep: Afer updae sep, he racker randomly samples he weghed parcles where he lkelhood of any parcle o be chosen s proporonal o s wegh. Thus a ceran predefned number of parcles M are chosen: ( Propagaon Sep: In he las sep of rackng he sampled M parcles are propagaed hrough a muldmensonal space represenng he moon of he racked pedesran accordng o he walk model descrbed n deal n [1]. Ths sep modfes he poson, srde, drecon and he walkng phase of a pedesran and s performed whou akng no accoun wheher a pedesran has receved updaes or no. The propagaon of pedesrans ha do no receve updaes helps our racker o rack occluded pedesrans up ll a ceran amoun of dsance D. Durng rackng each foreground pon belongng o he pedesran s used for calculang s dsance wh each of M parcles belongng o he same pedesran n racker. For a maxmum densy of 1.8 pedesrans per sq. meer under whch our racker can perform opmally, performs on he average nearly 54, calculaons o updae, sample and propagae 16 pedesrans hrough a sngle eraon. Gven such hgh a penaly n erms of execuon me, we deemed exremely mporan for our algorhm o produce resuls wh nearly same accuracy usng fewer less compuaonal resources n order o reman useful n real-me applcaons. Consderng hs requremen, we were able o successfully rack pedesrans wh very lle degradaon of accuracy by skppng unnecessary observaons from laser sensors (See Occluson caused by anoher pedesran Fg. An S-T represenaon of observable fee daa Table 1. The laser sensors provde our sysem wh observaons effecvely afer every. seconds. We forced our sysem o consder observaons afer every.5 seconds.e. n effec droppng every second observaon. Ths reduced he oupu accuracy by a very neglgble value bu he performance gan was more han mes. Snce our sysem s specfcally desgned o handle occluson, skppng an observaon makes our sysem behave as f he skpped observaon s due o an occluson, hus by ncreasng he D parameer n emporal correlaon module compensaes for mos of he loss n accuracy. The resulan sysem descrbed up ll now s relavely robus and accurae means of deecng and rackng pedesrans gven he fac ha we are performng hese seps n real-me. Ter : Pedesran Dsrbuon Analyss Self occluson caused by one foo n fron of he oher Laser sensor Alhough relably n he resuls could have been acheved by negrang echnques lke onlne-supervsed learnng [4], Mulple Hypohess Trackng [3] or Auxlary Parcle Fler swchng [] n he frs er, bu dong so wll exclude our racker compleely from he realm of real-me sysems. Thus, he second er of our sysem s desgned o furher enhance he relably of he pedesran coun oupu for each exhb whle keepng he compuaonal complexy growh nearly consan. We erm hs er as he pedesran dsrbuon analyss er as s concerned wh keepng rack of pedesrans crossng n and ou of each cell cells whn he envronmen. A cell comprses of area n fron of an exhb defned usng cell boundares (as marked n Fgure 1. By mananng nformaon abou he dsrbuon of people over cells, alhough he sysem canno answer quesons abou where parcular pedesrans are, one may sll nvesgae quesons abou he flow of people and how her (average roue selecon depends on he (average presence or absence of people.

4 Fg.3. Pedesran Dsrbuon Analyss er Oupu Deecng number of people crossng no and ou of each cell we were able o deduce he number of people N n each cell a each me-sep. Ths number conans a ceran error drecly proporonal o he percenage of he cell boundary hdden from laser sensors due o he pedesrans sandng/walkng very close o he laser sensors. In order o facor-n he error presen n hs number, we choose o represen he oupu of he sysem for each cell as a dsrbuon over he number of people. A dsrbuon varable X for each cell a any gven me s a sae of our belef ha represens all pas observaons ncludng he curren one. Ths s acheved va updang he dsrbuon varable X for each exhb a each me-sep. Varable X s defned as X 1 1 1, u N r, N ( r 1,..., N r (3 u Here u s an ndex ha runs hrough he range of weghs whch represen our probably densy funcon (pdf. Mos generally he range adusmen value r s subec o he requremen of he analys whch dffers wh he applcaon of our sysem. (We used he physcal capacy of he exhbs o place lms on hs range of values. Changng he value of r ncreases or decreases he doman of our dsrbuon funcon. 1 N s a number ha has he maxmum wegh 1 u 1 assocaed o n he dsrbuon X from prevous mesep. Followng seps updae he varable va a Gaussan updae U X a each me-sep whose varance s deermned by he percenage of cell boundary occluded a any gven momen. The updae sep s gven below. X 1 where and X U 1 1 ( U 1, u N u X 1 1 r,..., N 1 r (4 1 1 Here f U has hgh varance relave o U hen s 1 small hus has lle mpac on value of X. Ths ensures ha updaes whch have more chance of error are facored-n 1 less no our curren belef X. n updae dsrbuon crera : s he adused-varance U and s deermned usng hs nuve Here g s he Gaussan varance of updae U. The crera descrbed n (5, ses he varance o be drecly proporonal o he rao of lengh of occluded boundary of cell o (calculaed a every me-sep o he oal vsble lengh l of he cell boundary. ( g Pedesran Dsrbuon analyss er hus represens snapshos of pdfs for each cell a each me-sep whch gves us a measured dea abou he confdence ha we can place on he pedesran coun n each cell (see Fgure 3. IV. DISCUSSION o ( l Trackng pedesrans a exs and enrances proved o be one of he rckes pars durng he sysem desgn. We know ha he racker oupu grows accurae wh ncrease n he me for whch a arge s observed snce racker ges more chances o updae and propagae s parcles so ha hese can mach arge dynamcs. Thus he places he racker ends o be mos naccurae are he enrances o he observed area where he observed me for enerng arges s lmed. In order o esmae by wha margn our racker fals o rack enerng pedesrans, we performed an expermen by frs measurng he number of pedesrans crossng eas o wes across a lne dvdng he observed area no wo halves. We dd hs because our racker s relavely accurae abou pedesrans n he mddle of observed area snce he racker had enough me o rack hese pedesrans. Then we consdered he same lne as an enrance and ran he racker for he second me on he same (5

5 8 8 runnng average of error percenage 6 4 runnng average of error percenage 6 4 se of observaons for people enerng n eas o wes drecon consderng updaes only from one half of he observed area and gnorng he res. The dfference beween he numbers of people crossng eas o wes n boh cases provded us wh he bas he racker had n rackng pedesrans near he enrances. We used hs bas b n followng manner o adus he number of people n cells ha are suaed a he enrances: N N b Usng updaed cardnaly as an npu o he second er of our sysem proved o be benefcal n erms of accuracy bu we resraned o declare a formal par of our sysem snce would make edous expermenaon o learn bas, a prerequse for deployng our sysem hus lmng s applcaons. V. RESULTS We esed our sysem n erms of accuracy and compuaonal effcency. In daa collecon phase we manually recorded he pedesran crossngs over ceran epsodes of me observed va laser daa sream for each of he cells. These me-samped recordngs were accurae up o 1 second resoluon and served as our ground ruh. For accuracy measuremen we compued followng wo errors. ( ( N ground _ ruh for exhbs =1 o 7 (Fgure 4a shows a sngle epsode depcng he error for each of he cells. Here error s calculaed usng pre er- measuremen.e. N from er-1. Here he cumulave average counng error for all our observaons for all he exhbs oalled o be 13.8%. ( ( ground _ ruh for exhbs =1 o 7 where s he value wh hghes probably n he pdf represenng X (Fgure 4b shows he same epsode as shown n fg. 4a me n secs (a Error before Ter- applcaon depcng he error for each of he cells. Ths error s compued usng oupu from er- of our sysem. The average counng error for all our observaons for all he exhbs n hs case sood a 9.83% whch shows marked mprovemen as a resul of applyng er Fg. 4 Sysem counng error comparson me n secs (b Error afer Ter- applcaon By applyng our er approach o laser daa colleced by recordng over 5 hours of museum vsors, we are able o plo locaons of hgh-raffc. Ths s shown n Fgure 5 usng a colour coded scheme n whch red hghlghs reflec he posons ha people spend mos of her me n. In a sense, hs represens he me-averaged dsrbuon from er-. VI. CONCLUSION Technques descrbed n [1], [3], [4] and [6] sress he rackng accuracy. Our effor s focused on rerevng analysable resuls usng fas rackng echnques n order o ge relable pedesran coun n heavly occluded envronmens. Our pedesran deecon and rackng algorhm s exremely compuaonally nensve as s he case wh all oher mulple arge rackng algorhms [7] and hs happens n our case due o compuaons lke ner-cluser, cluser o pedesran dsance calculaon and propagaon of a hgh number of parcles n parcle fler a each me-sep. Durng our expermen phase we were able o produce suffcenly accurae resuls n a more relable forma for scenfc analyss of pedesran dsrbuon n ndoor envronmens. ACKNOWLEDGEMENTS Suppor from Ineracon lab, Unversy of Souhern Calforna (USC s graefully acknowledged. Also suppor from all undergraduae sudens who worked under NSF s Research Experence for Undergraduaes (REU program s apprecaed. Scholarshp gran from Fulbrgh Commsson s acknowledged and apprecaed as funded he research asssanshp for one he auhors. We hank Professor Krsna Lerman from USC Informaon Scences Insue for her consan advce and menorng durng all phases of our research. Lasly hs work was made possble by he movaon gven o us by our ever helpful Professor Maa Maarc.

6 Fgure 5: Locaons of hgh raffc whn he museum exhb TABLE I COMPUTATIONAL EFFICIENCY FOR VARYING PEDESTRIAN DENSITY (Sysem: Ubunu 8.4, kernel , Inel Penum Moble 17 MHz Processor REFERENCES Frame skp rae Every ou of 3 Every ou of 3 Every ou of 3 Every oher Every oher Every oher None skpped None skpped None skpped Average execuon me for 1 sec of frames Peak densy encounered (people per sq. m Average densy (people per sq. m Average counng error % (error/ruh*.58 sec sec sec sec sec sec sec sec sec [1] Shao.X, Zhao.H, Nakamura.K, Kaabra.K, Shbasak.R, Deecon and Trackng of Mulple Pedesrans by Usng Laser Range Scanners n 7 IEEE/RSJ Inernaonal Conference on Inellgen Robos and Sysems, Aprl 7. [] Bando.T, Shbaa. T, Doya. K, Ish. S, Swchng Parcle Flers for Effcen Real-me Vsual Trackng n Proceedngs of he 17h Inernaonal Conference on Paern Recognon 4, vol., pp. 7-73, Aug 4. [3] Arras.K, Grzonka.S, Luber.M, Burgard.W, Effcen People Trackng n Laser Range Daa usng a Mul-Hypohess Leg-Tracker wh Adapve Occluson Probables n 8 IEEE Inernaonal Conference on Robocs and Auomaon, pp , May 8. [4] Song.X, Cu.J, Wang.X, Zhao.H, Zha.H, Trackng Ineracng Targes wh Laser Scanner va On-lne Supervsed Learnng n 8 IEEE Inernaonal Conference on Robocs and Auomaon, pp , May 8. [5] D. Red, An algorhm for rackng mulple arges, IEEE Transacons on Auomac Conrol, vol. 4, pp , Dec [6] Wang.J, Makhara.Y, Yag.Y, Human Trackng and Segmenaon Suppored by Slhouee-based Ga Recognon n 8 IEEE Inernaonal Conference on Robocs and Auomaon, pp , May 8. [7] Khan.Z, Balch.T, Dellaer.F, MCMC-Based Parcle Flerng for Trackng a Varable Number of Ineracng Targes n IEEE Transacons on Paern Analyss and Machne Inellgence, Vol. 7, Issue. 11, pp , Nov. 5. [8] Thrun, S., Parcle flers n robocs, Proceedngs of he 17h Annual Conference on Uncerany n AI (UAI,. [9] Hollnger.G, Dugash.J, Sngh.S, Trackng a Movng Targe n Cluered Envronmens wh Rangng Rados, n 8 IEEE Inernaonal Conference on Robocs and Auomaon, pp , May 8. [] Hawes, Mchael R., Quanave morphology of he human foo n a Norh Amercan populaon n Ergonomcs, Vol. 37, Issue. 7, pp 113, 1994.

Variants of Pegasos. December 11, 2009

Variants of Pegasos. December 11, 2009 Inroducon Varans of Pegasos SooWoong Ryu bshboy@sanford.edu December, 009 Youngsoo Cho yc344@sanford.edu Developng a new SVM algorhm s ongong research opc. Among many exng SVM algorhms, we wll focus on

More information

Robustness Experiments with Two Variance Components

Robustness Experiments with Two Variance Components Naonal Insue of Sandards and Technology (NIST) Informaon Technology Laboraory (ITL) Sascal Engneerng Dvson (SED) Robusness Expermens wh Two Varance Componens by Ana Ivelsse Avlés avles@ns.gov Conference

More information

In the complete model, these slopes are ANALYSIS OF VARIANCE FOR THE COMPLETE TWO-WAY MODEL. (! i+1 -! i ) + [(!") i+1,q - [(!

In the complete model, these slopes are ANALYSIS OF VARIANCE FOR THE COMPLETE TWO-WAY MODEL. (! i+1 -! i ) + [(!) i+1,q - [(! ANALYSIS OF VARIANCE FOR THE COMPLETE TWO-WAY MODEL The frs hng o es n wo-way ANOVA: Is here neracon? "No neracon" means: The man effecs model would f. Ths n urn means: In he neracon plo (wh A on he horzonal

More information

V.Abramov - FURTHER ANALYSIS OF CONFIDENCE INTERVALS FOR LARGE CLIENT/SERVER COMPUTER NETWORKS

V.Abramov - FURTHER ANALYSIS OF CONFIDENCE INTERVALS FOR LARGE CLIENT/SERVER COMPUTER NETWORKS R&RATA # Vol.) 8, March FURTHER AALYSIS OF COFIDECE ITERVALS FOR LARGE CLIET/SERVER COMPUTER ETWORKS Vyacheslav Abramov School of Mahemacal Scences, Monash Unversy, Buldng 8, Level 4, Clayon Campus, Wellngon

More information

Solution in semi infinite diffusion couples (error function analysis)

Solution in semi infinite diffusion couples (error function analysis) Soluon n sem nfne dffuson couples (error funcon analyss) Le us consder now he sem nfne dffuson couple of wo blocks wh concenraon of and I means ha, n a A- bnary sysem, s bondng beween wo blocks made of

More information

Department of Economics University of Toronto

Department of Economics University of Toronto Deparmen of Economcs Unversy of Torono ECO408F M.A. Economercs Lecure Noes on Heeroskedascy Heeroskedascy o Ths lecure nvolves lookng a modfcaons we need o make o deal wh he regresson model when some of

More information

Outline. Probabilistic Model Learning. Probabilistic Model Learning. Probabilistic Model for Time-series Data: Hidden Markov Model

Outline. Probabilistic Model Learning. Probabilistic Model Learning. Probabilistic Model for Time-series Data: Hidden Markov Model Probablsc Model for Tme-seres Daa: Hdden Markov Model Hrosh Mamsuka Bonformacs Cener Kyoo Unversy Oulne Three Problems for probablsc models n machne learnng. Compung lkelhood 2. Learnng 3. Parsng (predcon

More information

Fall 2010 Graduate Course on Dynamic Learning

Fall 2010 Graduate Course on Dynamic Learning Fall 200 Graduae Course on Dynamc Learnng Chaper 4: Parcle Flers Sepember 27, 200 Byoung-Tak Zhang School of Compuer Scence and Engneerng & Cognve Scence and Bran Scence Programs Seoul aonal Unversy hp://b.snu.ac.kr/~bzhang/

More information

Dynamic Team Decision Theory. EECS 558 Project Shrutivandana Sharma and David Shuman December 10, 2005

Dynamic Team Decision Theory. EECS 558 Project Shrutivandana Sharma and David Shuman December 10, 2005 Dynamc Team Decson Theory EECS 558 Proec Shruvandana Sharma and Davd Shuman December 0, 005 Oulne Inroducon o Team Decson Theory Decomposon of he Dynamc Team Decson Problem Equvalence of Sac and Dynamc

More information

Clustering (Bishop ch 9)

Clustering (Bishop ch 9) Cluserng (Bshop ch 9) Reference: Daa Mnng by Margare Dunham (a slde source) 1 Cluserng Cluserng s unsupervsed learnng, here are no class labels Wan o fnd groups of smlar nsances Ofen use a dsance measure

More information

Bayes rule for a classification problem INF Discriminant functions for the normal density. Euclidean distance. Mahalanobis distance

Bayes rule for a classification problem INF Discriminant functions for the normal density. Euclidean distance. Mahalanobis distance INF 43 3.. Repeon Anne Solberg (anne@f.uo.no Bayes rule for a classfcaon problem Suppose we have J, =,...J classes. s he class label for a pxel, and x s he observed feaure vecor. We can use Bayes rule

More information

doi: info:doi/ /

doi: info:doi/ / do: nfo:do/0.063/.322393 nernaonal Conference on Power Conrol and Opmzaon, Bal, ndonesa, -3, June 2009 A COLOR FEATURES-BASED METHOD FOR OBJECT TRACKNG EMPLOYNG A PARTCLE FLTER ALGORTHM Bud Sugand, Hyoungseop

More information

Lecture 6: Learning for Control (Generalised Linear Regression)

Lecture 6: Learning for Control (Generalised Linear Regression) Lecure 6: Learnng for Conrol (Generalsed Lnear Regresson) Conens: Lnear Mehods for Regresson Leas Squares, Gauss Markov heorem Recursve Leas Squares Lecure 6: RLSC - Prof. Sehu Vjayakumar Lnear Regresson

More information

Math 128b Project. Jude Yuen

Math 128b Project. Jude Yuen Mah 8b Proec Jude Yuen . Inroducon Le { Z } be a sequence of observed ndependen vecor varables. If he elemens of Z have a on normal dsrbuon hen { Z } has a mean vecor Z and a varancecovarance marx z. Geomercally

More information

WiH Wei He

WiH Wei He Sysem Idenfcaon of onlnear Sae-Space Space Baery odels WH We He wehe@calce.umd.edu Advsor: Dr. Chaochao Chen Deparmen of echancal Engneerng Unversy of aryland, College Par 1 Unversy of aryland Bacground

More information

Computer Robot Vision Conference 2010

Computer Robot Vision Conference 2010 School of Compuer Scence McGll Unversy Compuer Robo Vson Conference 2010 Ioanns Rekles Fundamenal Problems In Robocs How o Go From A o B? (Pah Plannng) Wha does he world looks lke? (mappng) sense from

More information

Bernoulli process with 282 ky periodicity is detected in the R-N reversals of the earth s magnetic field

Bernoulli process with 282 ky periodicity is detected in the R-N reversals of the earth s magnetic field Submed o: Suden Essay Awards n Magnecs Bernoull process wh 8 ky perodcy s deeced n he R-N reversals of he earh s magnec feld Jozsef Gara Deparmen of Earh Scences Florda Inernaonal Unversy Unversy Park,

More information

CS286.2 Lecture 14: Quantum de Finetti Theorems II

CS286.2 Lecture 14: Quantum de Finetti Theorems II CS286.2 Lecure 14: Quanum de Fne Theorems II Scrbe: Mara Okounkova 1 Saemen of he heorem Recall he las saemen of he quanum de Fne heorem from he prevous lecure. Theorem 1 Quanum de Fne). Le ρ Dens C 2

More information

TSS = SST + SSE An orthogonal partition of the total SS

TSS = SST + SSE An orthogonal partition of the total SS ANOVA: Topc 4. Orhogonal conrass [ST&D p. 183] H 0 : µ 1 = µ =... = µ H 1 : The mean of a leas one reamen group s dfferen To es hs hypohess, a basc ANOVA allocaes he varaon among reamen means (SST) equally

More information

THE PREDICTION OF COMPETITIVE ENVIRONMENT IN BUSINESS

THE PREDICTION OF COMPETITIVE ENVIRONMENT IN BUSINESS THE PREICTION OF COMPETITIVE ENVIRONMENT IN BUSINESS INTROUCTION The wo dmensonal paral dfferenal equaons of second order can be used for he smulaon of compeve envronmen n busness The arcle presens he

More information

Linear Response Theory: The connection between QFT and experiments

Linear Response Theory: The connection between QFT and experiments Phys540.nb 39 3 Lnear Response Theory: The connecon beween QFT and expermens 3.1. Basc conceps and deas Q: ow do we measure he conducvy of a meal? A: we frs nroduce a weak elecrc feld E, and hen measure

More information

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

CS434a/541a: Pattern Recognition Prof. Olga Veksler. Lecture 4 CS434a/54a: Paern Recognon Prof. Olga Veksler Lecure 4 Oulne Normal Random Varable Properes Dscrmnan funcons Why Normal Random Varables? Analycally racable Works well when observaon comes form a corruped

More information

Lecture VI Regression

Lecture VI Regression Lecure VI Regresson (Lnear Mehods for Regresson) Conens: Lnear Mehods for Regresson Leas Squares, Gauss Markov heorem Recursve Leas Squares Lecure VI: MLSC - Dr. Sehu Vjayakumar Lnear Regresson Model M

More information

Particle Filter Based Robot Self-localization Using RGBD Cues and Wheel Odometry Measurements Enyang Gao1, a*, Zhaohua Chen1 and Qizhuhui Gao1

Particle Filter Based Robot Self-localization Using RGBD Cues and Wheel Odometry Measurements Enyang Gao1, a*, Zhaohua Chen1 and Qizhuhui Gao1 6h Inernaonal Conference on Elecronc, Mechancal, Informaon and Managemen (EMIM 206) Parcle Fler Based Robo Self-localzaon Usng RGBD Cues and Wheel Odomery Measuremens Enyang Gao, a*, Zhaohua Chen and Qzhuhu

More information

This document is downloaded from DR-NTU, Nanyang Technological University Library, Singapore.

This document is downloaded from DR-NTU, Nanyang Technological University Library, Singapore. Ths documen s downloaded from DR-NTU, Nanyang Technologcal Unversy Lbrary, Sngapore. Tle A smplfed verb machng algorhm for word paron n vsual speech processng( Acceped verson ) Auhor(s) Foo, Say We; Yong,

More information

Filtrage particulaire et suivi multi-pistes Carine Hue Jean-Pierre Le Cadre and Patrick Pérez

Filtrage particulaire et suivi multi-pistes Carine Hue Jean-Pierre Le Cadre and Patrick Pérez Chaînes de Markov cachées e flrage parculare 2-22 anver 2002 Flrage parculare e suv mul-pses Carne Hue Jean-Perre Le Cadre and Parck Pérez Conex Applcaons: Sgnal processng: arge rackng bearngs-onl rackng

More information

CHAPTER 10: LINEAR DISCRIMINATION

CHAPTER 10: LINEAR DISCRIMINATION CHAPER : LINEAR DISCRIMINAION Dscrmnan-based Classfcaon 3 In classfcaon h K classes (C,C,, C k ) We defned dscrmnan funcon g j (), j=,,,k hen gven an es eample, e chose (predced) s class label as C f g

More information

Hidden Markov Models Following a lecture by Andrew W. Moore Carnegie Mellon University

Hidden Markov Models Following a lecture by Andrew W. Moore Carnegie Mellon University Hdden Markov Models Followng a lecure by Andrew W. Moore Carnege Mellon Unversy www.cs.cmu.edu/~awm/uorals A Markov Sysem Has N saes, called s, s 2.. s N s 2 There are dscree meseps, 0,, s s 3 N 3 0 Hdden

More information

A Bayesian algorithm for tracking multiple moving objects in outdoor surveillance video

A Bayesian algorithm for tracking multiple moving objects in outdoor surveillance video A Bayesan algorhm for racng mulple movng obecs n oudoor survellance vdeo Manunah Narayana Unversy of Kansas Lawrence, Kansas manu@u.edu Absrac Relable racng of mulple movng obecs n vdes an neresng challenge,

More information

Appendix to Online Clustering with Experts

Appendix to Online Clustering with Experts A Appendx o Onlne Cluserng wh Expers Furher dscusson of expermens. Here we furher dscuss expermenal resuls repored n he paper. Ineresngly, we observe ha OCE (and n parcular Learn- ) racks he bes exper

More information

Computing Relevance, Similarity: The Vector Space Model

Computing Relevance, Similarity: The Vector Space Model Compung Relevance, Smlary: The Vecor Space Model Based on Larson and Hears s sldes a UC-Bereley hp://.sms.bereley.edu/courses/s0/f00/ aabase Managemen Sysems, R. Ramarshnan ocumen Vecors v ocumens are

More information

FTCS Solution to the Heat Equation

FTCS Solution to the Heat Equation FTCS Soluon o he Hea Equaon ME 448/548 Noes Gerald Reckenwald Porland Sae Unversy Deparmen of Mechancal Engneerng gerry@pdxedu ME 448/548: FTCS Soluon o he Hea Equaon Overvew Use he forward fne d erence

More information

Lecture 2 L n i e n a e r a M od o e d l e s

Lecture 2 L n i e n a e r a M od o e d l e s Lecure Lnear Models Las lecure You have learned abou ha s machne learnng Supervsed learnng Unsupervsed learnng Renforcemen learnng You have seen an eample learnng problem and he general process ha one

More information

Performance Analysis for a Network having Standby Redundant Unit with Waiting in Repair

Performance Analysis for a Network having Standby Redundant Unit with Waiting in Repair TECHNI Inernaonal Journal of Compung Scence Communcaon Technologes VOL.5 NO. July 22 (ISSN 974-3375 erformance nalyss for a Nework havng Sby edundan Un wh ang n epar Jendra Sngh 2 abns orwal 2 Deparmen

More information

Machine Learning 2nd Edition

Machine Learning 2nd Edition INTRODUCTION TO Lecure Sldes for Machne Learnng nd Edon ETHEM ALPAYDIN, modfed by Leonardo Bobadlla and some pars from hp://www.cs.au.ac.l/~aparzn/machnelearnng/ The MIT Press, 00 alpaydn@boun.edu.r hp://www.cmpe.boun.edu.r/~ehem/mle

More information

Introduction ( Week 1-2) Course introduction A brief introduction to molecular biology A brief introduction to sequence comparison Part I: Algorithms

Introduction ( Week 1-2) Course introduction A brief introduction to molecular biology A brief introduction to sequence comparison Part I: Algorithms Course organzaon Inroducon Wee -2) Course nroducon A bref nroducon o molecular bology A bref nroducon o sequence comparson Par I: Algorhms for Sequence Analyss Wee 3-8) Chaper -3, Models and heores» Probably

More information

Single and Multiple Object Tracking Using a Multi-Feature Joint Sparse Representation

Single and Multiple Object Tracking Using a Multi-Feature Joint Sparse Representation Sngle and Mulple Objec Trackng Usng a Mul-Feaure Jon Sparse Represenaon Wemng Hu, We L, and Xaoqn Zhang (Naonal Laboraory of Paern Recognon, Insue of Auomaon, Chnese Academy of Scences, Bejng 100190) {wmhu,

More information

UNIVERSITAT AUTÒNOMA DE BARCELONA MARCH 2017 EXAMINATION

UNIVERSITAT AUTÒNOMA DE BARCELONA MARCH 2017 EXAMINATION INTERNATIONAL TRADE T. J. KEHOE UNIVERSITAT AUTÒNOMA DE BARCELONA MARCH 27 EXAMINATION Please answer wo of he hree quesons. You can consul class noes, workng papers, and arcles whle you are workng on he

More information

Kernel-Based Bayesian Filtering for Object Tracking

Kernel-Based Bayesian Filtering for Object Tracking Kernel-Based Bayesan Flerng for Objec Trackng Bohyung Han Yng Zhu Dorn Comancu Larry Davs Dep. of Compuer Scence Real-Tme Vson and Modelng Inegraed Daa and Sysems Unversy of Maryland Semens Corporae Research

More information

Polymerization Technology Laboratory Course

Polymerization Technology Laboratory Course Prakkum Polymer Scence/Polymersaonsechnk Versuch Resdence Tme Dsrbuon Polymerzaon Technology Laboraory Course Resdence Tme Dsrbuon of Chemcal Reacors If molecules or elemens of a flud are akng dfferen

More information

Increasing the Probablility of Timely and Correct Message Delivery in Road Side Unit Based Vehicular Communcation

Increasing the Probablility of Timely and Correct Message Delivery in Road Side Unit Based Vehicular Communcation Halmsad Unversy For he Developmen of Organsaons Producs and Qualy of Lfe. Increasng he Probablly of Tmely and Correc Message Delvery n Road Sde Un Based Vehcular Communcaon Magnus Jonsson Krsna Kuner and

More information

Time-interval analysis of β decay. V. Horvat and J. C. Hardy

Time-interval analysis of β decay. V. Horvat and J. C. Hardy Tme-nerval analyss of β decay V. Horva and J. C. Hardy Work on he even analyss of β decay [1] connued and resuled n he developmen of a novel mehod of bea-decay me-nerval analyss ha produces hghly accurae

More information

GENERATING CERTAIN QUINTIC IRREDUCIBLE POLYNOMIALS OVER FINITE FIELDS. Youngwoo Ahn and Kitae Kim

GENERATING CERTAIN QUINTIC IRREDUCIBLE POLYNOMIALS OVER FINITE FIELDS. Youngwoo Ahn and Kitae Kim Korean J. Mah. 19 (2011), No. 3, pp. 263 272 GENERATING CERTAIN QUINTIC IRREDUCIBLE POLYNOMIALS OVER FINITE FIELDS Youngwoo Ahn and Kae Km Absrac. In he paper [1], an explc correspondence beween ceran

More information

FI 3103 Quantum Physics

FI 3103 Quantum Physics /9/4 FI 33 Quanum Physcs Aleander A. Iskandar Physcs of Magnesm and Phooncs Research Grou Insu Teknolog Bandung Basc Conces n Quanum Physcs Probably and Eecaon Value Hesenberg Uncerany Prncle Wave Funcon

More information

John Geweke a and Gianni Amisano b a Departments of Economics and Statistics, University of Iowa, USA b European Central Bank, Frankfurt, Germany

John Geweke a and Gianni Amisano b a Departments of Economics and Statistics, University of Iowa, USA b European Central Bank, Frankfurt, Germany Herarchcal Markov Normal Mxure models wh Applcaons o Fnancal Asse Reurns Appendx: Proofs of Theorems and Condonal Poseror Dsrbuons John Geweke a and Gann Amsano b a Deparmens of Economcs and Sascs, Unversy

More information

CS 536: Machine Learning. Nonparametric Density Estimation Unsupervised Learning - Clustering

CS 536: Machine Learning. Nonparametric Density Estimation Unsupervised Learning - Clustering CS 536: Machne Learnng Nonparamerc Densy Esmaon Unsupervsed Learnng - Cluserng Fall 2005 Ahmed Elgammal Dep of Compuer Scence Rugers Unversy CS 536 Densy Esmaon - Cluserng - 1 Oulnes Densy esmaon Nonparamerc

More information

CS 268: Packet Scheduling

CS 268: Packet Scheduling Pace Schedulng Decde when and wha pace o send on oupu ln - Usually mplemened a oupu nerface CS 68: Pace Schedulng flow Ion Soca March 9, 004 Classfer flow flow n Buffer managemen Scheduler soca@cs.bereley.edu

More information

A Novel Efficient Stopping Criterion for BICM-ID System

A Novel Efficient Stopping Criterion for BICM-ID System A Novel Effcen Soppng Creron for BICM-ID Sysem Xao Yng, L Janpng Communcaon Unversy of Chna Absrac Ths paper devses a novel effcen soppng creron for b-nerleaved coded modulaon wh erave decodng (BICM-ID)

More information

HEAT CONDUCTION PROBLEM IN A TWO-LAYERED HOLLOW CYLINDER BY USING THE GREEN S FUNCTION METHOD

HEAT CONDUCTION PROBLEM IN A TWO-LAYERED HOLLOW CYLINDER BY USING THE GREEN S FUNCTION METHOD Journal of Appled Mahemacs and Compuaonal Mechancs 3, (), 45-5 HEAT CONDUCTION PROBLEM IN A TWO-LAYERED HOLLOW CYLINDER BY USING THE GREEN S FUNCTION METHOD Sansław Kukla, Urszula Sedlecka Insue of Mahemacs,

More information

Density Matrix Description of NMR BCMB/CHEM 8190

Density Matrix Description of NMR BCMB/CHEM 8190 Densy Marx Descrpon of NMR BCMBCHEM 89 Operaors n Marx Noaon If we say wh one bass se, properes vary only because of changes n he coeffcens weghng each bass se funcon x = h< Ix > - hs s how we calculae

More information

January Examinations 2012

January Examinations 2012 Page of 5 EC79 January Examnaons No. of Pages: 5 No. of Quesons: 8 Subjec ECONOMICS (POSTGRADUATE) Tle of Paper EC79 QUANTITATIVE METHODS FOR BUSINESS AND FINANCE Tme Allowed Two Hours ( hours) Insrucons

More information

PARTICLE FILTER BASED VEHICLE TRACKING APPROACH WITH IMPROVED RESAMPLING STAGE

PARTICLE FILTER BASED VEHICLE TRACKING APPROACH WITH IMPROVED RESAMPLING STAGE ISS: 0976-910(OLIE) ICTACT JOURAL O IMAGE AD VIDEO PROCESSIG, FEBRUARY 014, VOLUME: 04, ISSUE: 03 PARTICLE FILTER BASED VEHICLE TRACKIG APPROACH WITH IMPROVED RESAMPLIG STAGE We Leong Khong 1, We Yeang

More information

Foundations of State Estimation Part II

Foundations of State Estimation Part II Foundaons of Sae Esmaon Par II Tocs: Hdden Markov Models Parcle Flers Addonal readng: L.R. Rabner, A uoral on hdden Markov models," Proceedngs of he IEEE, vol. 77,. 57-86, 989. Sequenal Mone Carlo Mehods

More information

Robust and Accurate Cancer Classification with Gene Expression Profiling

Robust and Accurate Cancer Classification with Gene Expression Profiling Robus and Accurae Cancer Classfcaon wh Gene Expresson Proflng (Compuaonal ysems Bology, 2005) Auhor: Hafeng L, Keshu Zhang, ao Jang Oulne Background LDA (lnear dscrmnan analyss) and small sample sze problem

More information

Algorithm Research on Moving Object Detection of Surveillance Video Sequence *

Algorithm Research on Moving Object Detection of Surveillance Video Sequence * Opcs and Phooncs Journal 03 3 308-3 do:0.436/opj.03.3b07 Publshed Onlne June 03 (hp://www.scrp.org/journal/opj) Algorhm Research on Movng Objec Deecon of Survellance Vdeo Sequence * Kuhe Yang Zhmng Ca

More information

Density Matrix Description of NMR BCMB/CHEM 8190

Density Matrix Description of NMR BCMB/CHEM 8190 Densy Marx Descrpon of NMR BCMBCHEM 89 Operaors n Marx Noaon Alernae approach o second order specra: ask abou x magnezaon nsead of energes and ranson probables. If we say wh one bass se, properes vary

More information

e-journal Reliability: Theory& Applications No 2 (Vol.2) Vyacheslav Abramov

e-journal Reliability: Theory& Applications No 2 (Vol.2) Vyacheslav Abramov June 7 e-ournal Relably: Theory& Applcaons No (Vol. CONFIDENCE INTERVALS ASSOCIATED WITH PERFORMANCE ANALYSIS OF SYMMETRIC LARGE CLOSED CLIENT/SERVER COMPUTER NETWORKS Absrac Vyacheslav Abramov School

More information

Anomaly Detection. Lecture Notes for Chapter 9. Introduction to Data Mining, 2 nd Edition by Tan, Steinbach, Karpatne, Kumar

Anomaly Detection. Lecture Notes for Chapter 9. Introduction to Data Mining, 2 nd Edition by Tan, Steinbach, Karpatne, Kumar Anomaly eecon Lecure Noes for Chaper 9 Inroducon o aa Mnng, 2 nd Edon by Tan, Senbach, Karpane, Kumar 2/14/18 Inroducon o aa Mnng, 2nd Edon 1 Anomaly/Ouler eecon Wha are anomales/oulers? The se of daa

More information

5th International Conference on Advanced Design and Manufacturing Engineering (ICADME 2015)

5th International Conference on Advanced Design and Manufacturing Engineering (ICADME 2015) 5h Inernaonal onference on Advanced Desgn and Manufacurng Engneerng (IADME 5 The Falure Rae Expermenal Sudy of Specal N Machne Tool hunshan He, a, *, La Pan,b and Bng Hu 3,c,,3 ollege of Mechancal and

More information

A Novel Object Detection Method Using Gaussian Mixture Codebook Model of RGB-D Information

A Novel Object Detection Method Using Gaussian Mixture Codebook Model of RGB-D Information A Novel Objec Deecon Mehod Usng Gaussan Mxure Codebook Model of RGB-D Informaon Lujang LIU 1, Gaopeng ZHAO *,1, Yumng BO 1 1 School of Auomaon, Nanjng Unversy of Scence and Technology, Nanjng, Jangsu 10094,

More information

Object Tracking Based on Visual Attention Model and Particle Filter

Object Tracking Based on Visual Attention Model and Particle Filter Inernaonal Journal of Informaon Technology Vol. No. 9 25 Objec Trackng Based on Vsual Aenon Model and Parcle Fler Long-Fe Zhang, Yuan-Da Cao 2, Mng-Je Zhang 3, Y-Zhuo Wang 4 School of Compuer Scence and

More information

Graduate Macroeconomics 2 Problem set 5. - Solutions

Graduate Macroeconomics 2 Problem set 5. - Solutions Graduae Macroeconomcs 2 Problem se. - Soluons Queson 1 To answer hs queson we need he frms frs order condons and he equaon ha deermnes he number of frms n equlbrum. The frms frs order condons are: F K

More information

An introduction to Support Vector Machine

An introduction to Support Vector Machine An nroducon o Suppor Vecor Machne 報告者 : 黃立德 References: Smon Haykn, "Neural Neworks: a comprehensve foundaon, second edon, 999, Chaper 2,6 Nello Chrsann, John Shawe-Tayer, An Inroducon o Suppor Vecor Machnes,

More information

( ) () we define the interaction representation by the unitary transformation () = ()

( ) () we define the interaction representation by the unitary transformation () = () Hgher Order Perurbaon Theory Mchael Fowler 3/7/6 The neracon Represenaon Recall ha n he frs par of hs course sequence, we dscussed he chrödnger and Hesenberg represenaons of quanum mechancs here n he chrödnger

More information

New M-Estimator Objective Function. in Simultaneous Equations Model. (A Comparative Study)

New M-Estimator Objective Function. in Simultaneous Equations Model. (A Comparative Study) Inernaonal Mahemacal Forum, Vol. 8, 3, no., 7 - HIKARI Ld, www.m-hkar.com hp://dx.do.org/.988/mf.3.3488 New M-Esmaor Objecve Funcon n Smulaneous Equaons Model (A Comparave Sudy) Ahmed H. Youssef Professor

More information

J i-1 i. J i i+1. Numerical integration of the diffusion equation (I) Finite difference method. Spatial Discretization. Internal nodes.

J i-1 i. J i i+1. Numerical integration of the diffusion equation (I) Finite difference method. Spatial Discretization. Internal nodes. umercal negraon of he dffuson equaon (I) Fne dfference mehod. Spaal screaon. Inernal nodes. R L V For hermal conducon le s dscree he spaal doman no small fne spans, =,,: Balance of parcles for an nernal

More information

Single-loop System Reliability-Based Design & Topology Optimization (SRBDO/SRBTO): A Matrix-based System Reliability (MSR) Method

Single-loop System Reliability-Based Design & Topology Optimization (SRBDO/SRBTO): A Matrix-based System Reliability (MSR) Method 10 h US Naonal Congress on Compuaonal Mechancs Columbus, Oho 16-19, 2009 Sngle-loop Sysem Relably-Based Desgn & Topology Opmzaon (SRBDO/SRBTO): A Marx-based Sysem Relably (MSR) Mehod Tam Nguyen, Junho

More information

Lecture 11 SVM cont

Lecture 11 SVM cont Lecure SVM con. 0 008 Wha we have done so far We have esalshed ha we wan o fnd a lnear decson oundary whose margn s he larges We know how o measure he margn of a lnear decson oundary Tha s: he mnmum geomerc

More information

Cubic Bezier Homotopy Function for Solving Exponential Equations

Cubic Bezier Homotopy Function for Solving Exponential Equations Penerb Journal of Advanced Research n Compung and Applcaons ISSN (onlne: 46-97 Vol. 4, No.. Pages -8, 6 omoopy Funcon for Solvng Eponenal Equaons S. S. Raml *,,. Mohamad Nor,a, N. S. Saharzan,b and M.

More information

Existence and Uniqueness Results for Random Impulsive Integro-Differential Equation

Existence and Uniqueness Results for Random Impulsive Integro-Differential Equation Global Journal of Pure and Appled Mahemacs. ISSN 973-768 Volume 4, Number 6 (8), pp. 89-87 Research Inda Publcaons hp://www.rpublcaon.com Exsence and Unqueness Resuls for Random Impulsve Inegro-Dfferenal

More information

Sampling Procedure of the Sum of two Binary Markov Process Realizations

Sampling Procedure of the Sum of two Binary Markov Process Realizations Samplng Procedure of he Sum of wo Bnary Markov Process Realzaons YURY GORITSKIY Dep. of Mahemacal Modelng of Moscow Power Insue (Techncal Unversy), Moscow, RUSSIA, E-mal: gorsky@yandex.ru VLADIMIR KAZAKOV

More information

2. SPATIALLY LAGGED DEPENDENT VARIABLES

2. SPATIALLY LAGGED DEPENDENT VARIABLES 2. SPATIALLY LAGGED DEPENDENT VARIABLES In hs chaper, we descrbe a sascal model ha ncorporaes spaal dependence explcly by addng a spaally lagged dependen varable y on he rgh-hand sde of he regresson equaon.

More information

II. Light is a Ray (Geometrical Optics)

II. Light is a Ray (Geometrical Optics) II Lgh s a Ray (Geomercal Opcs) IIB Reflecon and Refracon Hero s Prncple of Leas Dsance Law of Reflecon Hero of Aleandra, who lved n he 2 nd cenury BC, posulaed he followng prncple: Prncple of Leas Dsance:

More information

Transcription: Messenger RNA, mrna, is produced and transported to Ribosomes

Transcription: Messenger RNA, mrna, is produced and transported to Ribosomes Quanave Cenral Dogma I Reference hp//book.bonumbers.org Inaon ranscrpon RNA polymerase and ranscrpon Facor (F) s bnds o promoer regon of DNA ranscrpon Meenger RNA, mrna, s produced and ranspored o Rbosomes

More information

Tight results for Next Fit and Worst Fit with resource augmentation

Tight results for Next Fit and Worst Fit with resource augmentation Tgh resuls for Nex F and Wors F wh resource augmenaon Joan Boyar Leah Epsen Asaf Levn Asrac I s well known ha he wo smple algorhms for he classc n packng prolem, NF and WF oh have an approxmaon rao of

More information

Effect of Resampling Steepness on Particle Filtering Performance in Visual Tracking

Effect of Resampling Steepness on Particle Filtering Performance in Visual Tracking 102 The Inernaonal Arab Journal of Informaon Technology, Vol. 10, No. 1, January 2013 Effec of Resamplng Seepness on Parcle Flerng Performance n Vsual Trackng Zahdul Islam, Ch-Mn Oh, and Chl-Woo Lee School

More information

Boosted LMS-based Piecewise Linear Adaptive Filters

Boosted LMS-based Piecewise Linear Adaptive Filters 016 4h European Sgnal Processng Conference EUSIPCO) Boosed LMS-based Pecewse Lnear Adapve Flers Darush Kar and Iman Marvan Deparmen of Elecrcal and Elecroncs Engneerng Blken Unversy, Ankara, Turkey {kar,

More information

( t) Outline of program: BGC1: Survival and event history analysis Oslo, March-May Recapitulation. The additive regression model

( t) Outline of program: BGC1: Survival and event history analysis Oslo, March-May Recapitulation. The additive regression model BGC1: Survval and even hsory analyss Oslo, March-May 212 Monday May 7h and Tuesday May 8h The addve regresson model Ørnulf Borgan Deparmen of Mahemacs Unversy of Oslo Oulne of program: Recapulaon Counng

More information

Appendix H: Rarefaction and extrapolation of Hill numbers for incidence data

Appendix H: Rarefaction and extrapolation of Hill numbers for incidence data Anne Chao Ncholas J Goell C seh lzabeh L ander K Ma Rober K Colwell and Aaron M llson 03 Rarefacon and erapolaon wh ll numbers: a framewor for samplng and esmaon n speces dversy sudes cology Monographs

More information

Building Temporal Models for Gesture Recognition

Building Temporal Models for Gesture Recognition Buldng Temporal Models for Gesure Recognon Rchard Bowden, Mansoor Sarhad Vson and VR Group Dep of Sysems Engneerng, Brunel Unversy Uxbrdge, Mddlesex, UB8 3PH, UK rchard.bowden@brunel.ac.uk Absrac Ths work

More information

Mechanics Physics 151

Mechanics Physics 151 Mechancs Physcs 5 Lecure 9 Hamlonan Equaons of Moon (Chaper 8) Wha We Dd Las Tme Consruced Hamlonan formalsm H ( q, p, ) = q p L( q, q, ) H p = q H q = p H = L Equvalen o Lagrangan formalsm Smpler, bu

More information

Including the ordinary differential of distance with time as velocity makes a system of ordinary differential equations.

Including the ordinary differential of distance with time as velocity makes a system of ordinary differential equations. Soluons o Ordnary Derenal Equaons An ordnary derenal equaon has only one ndependen varable. A sysem o ordnary derenal equaons consss o several derenal equaons each wh he same ndependen varable. An eample

More information

Chapter 6: AC Circuits

Chapter 6: AC Circuits Chaper 6: AC Crcus Chaper 6: Oulne Phasors and he AC Seady Sae AC Crcus A sable, lnear crcu operang n he seady sae wh snusodal excaon (.e., snusodal seady sae. Complee response forced response naural response.

More information

Advanced Machine Learning & Perception

Advanced Machine Learning & Perception Advanced Machne Learnng & Percepon Insrucor: Tony Jebara SVM Feaure & Kernel Selecon SVM Eensons Feaure Selecon (Flerng and Wrappng) SVM Feaure Selecon SVM Kernel Selecon SVM Eensons Classfcaon Feaure/Kernel

More information

Mechanics Physics 151

Mechanics Physics 151 Mechancs Physcs 5 Lecure 9 Hamlonan Equaons of Moon (Chaper 8) Wha We Dd Las Tme Consruced Hamlonan formalsm Hqp (,,) = qp Lqq (,,) H p = q H q = p H L = Equvalen o Lagrangan formalsm Smpler, bu wce as

More information

Econ107 Applied Econometrics Topic 5: Specification: Choosing Independent Variables (Studenmund, Chapter 6)

Econ107 Applied Econometrics Topic 5: Specification: Choosing Independent Variables (Studenmund, Chapter 6) Econ7 Appled Economercs Topc 5: Specfcaon: Choosng Independen Varables (Sudenmund, Chaper 6 Specfcaon errors ha we wll deal wh: wrong ndependen varable; wrong funconal form. Ths lecure deals wh wrong ndependen

More information

Tackling the Premature Convergence Problem in Monte Carlo Localization Gert Kootstra and Bart de Boer

Tackling the Premature Convergence Problem in Monte Carlo Localization Gert Kootstra and Bart de Boer Tacklng he Premaure Convergence Problem n Mone Carlo Localzaon Ger Koosra and Bar de Boer Auhors: Ger Koosra (correspondng auhor) Arfcal Inellgence Unvesy of Gronngen, The Neherlands Groe Krussraa 2/1

More information

Genetic Algorithm in Parameter Estimation of Nonlinear Dynamic Systems

Genetic Algorithm in Parameter Estimation of Nonlinear Dynamic Systems Genec Algorhm n Parameer Esmaon of Nonlnear Dynamc Sysems E. Paeraks manos@egnaa.ee.auh.gr V. Perds perds@vergna.eng.auh.gr Ah. ehagas kehagas@egnaa.ee.auh.gr hp://skron.conrol.ee.auh.gr/kehagas/ndex.hm

More information

SOME NOISELESS CODING THEOREMS OF INACCURACY MEASURE OF ORDER α AND TYPE β

SOME NOISELESS CODING THEOREMS OF INACCURACY MEASURE OF ORDER α AND TYPE β SARAJEVO JOURNAL OF MATHEMATICS Vol.3 (15) (2007), 137 143 SOME NOISELESS CODING THEOREMS OF INACCURACY MEASURE OF ORDER α AND TYPE β M. A. K. BAIG AND RAYEES AHMAD DAR Absrac. In hs paper, we propose

More information

Detection of Waving Hands from Images Using Time Series of Intensity Values

Detection of Waving Hands from Images Using Time Series of Intensity Values Deecon of Wavng Hands from Images Usng Tme eres of Inensy Values Koa IRIE, Kazunor UMEDA Chuo Unversy, Tokyo, Japan re@sensor.mech.chuo-u.ac.jp, umeda@mech.chuo-u.ac.jp Absrac Ths paper proposes a mehod

More information

Introduction to. Computer Animation

Introduction to. Computer Animation Inroducon o 1 Movaon Anmaon from anma (la.) = soul, spr, breah of lfe Brng mages o lfe! Examples Characer anmaon (humans, anmals) Secondary moon (har, cloh) Physcal world (rgd bodes, waer, fre) 2 2 Anmaon

More information

A Tour of Modeling Techniques

A Tour of Modeling Techniques A Tour of Modelng Technques John Hooker Carnege Mellon Unversy EWO Semnar February 8 Slde Oulne Med neger lnear (MILP) modelng Dsuncve modelng Knapsack modelng Consran programmng models Inegraed Models

More information

Relative controllability of nonlinear systems with delays in control

Relative controllability of nonlinear systems with delays in control Relave conrollably o nonlnear sysems wh delays n conrol Jerzy Klamka Insue o Conrol Engneerng, Slesan Techncal Unversy, 44- Glwce, Poland. phone/ax : 48 32 37227, {jklamka}@a.polsl.glwce.pl Keywor: Conrollably.

More information

We are estimating the density of long distant migrant (LDM) birds in wetlands along Lake Michigan.

We are estimating the density of long distant migrant (LDM) birds in wetlands along Lake Michigan. Ch 17 Random ffecs and Mxed Models 17. Random ffecs Models We are esmang he densy of long dsan mgran (LDM) brds n welands along Lake Mchgan. μ + = LDM per hecaren h weland ~ N(0, ) The varably of expeced

More information

Partial Availability and RGBI Methods to Improve System Performance in Different Interval of Time: The Drill Facility System Case Study

Partial Availability and RGBI Methods to Improve System Performance in Different Interval of Time: The Drill Facility System Case Study Open Journal of Modellng and Smulaon, 204, 2, 44-53 Publshed Onlne Ocober 204 n ScRes. hp://www.scrp.org/journal/ojms hp://dx.do.org/0.4236/ojms.204.2406 Paral Avalably and RGBI Mehods o Improve Sysem

More information

Approximate Analytic Solution of (2+1) - Dimensional Zakharov-Kuznetsov(Zk) Equations Using Homotopy

Approximate Analytic Solution of (2+1) - Dimensional Zakharov-Kuznetsov(Zk) Equations Using Homotopy Arcle Inernaonal Journal of Modern Mahemacal Scences, 4, (): - Inernaonal Journal of Modern Mahemacal Scences Journal homepage: www.modernscenfcpress.com/journals/jmms.aspx ISSN: 66-86X Florda, USA Approxmae

More information

Attribute Reduction Algorithm Based on Discernibility Matrix with Algebraic Method GAO Jing1,a, Ma Hui1, Han Zhidong2,b

Attribute Reduction Algorithm Based on Discernibility Matrix with Algebraic Method GAO Jing1,a, Ma Hui1, Han Zhidong2,b Inernaonal Indusral Informacs and Compuer Engneerng Conference (IIICEC 05) Arbue educon Algorhm Based on Dscernbly Marx wh Algebrac Mehod GAO Jng,a, Ma Hu, Han Zhdong,b Informaon School, Capal Unversy

More information

Hidden Markov Models

Hidden Markov Models 11-755 Machne Learnng for Sgnal Processng Hdden Markov Models Class 15. 12 Oc 2010 1 Admnsrva HW2 due Tuesday Is everyone on he projecs page? Where are your projec proposals? 2 Recap: Wha s an HMM Probablsc

More information

Fall 2009 Social Sciences 7418 University of Wisconsin-Madison. Problem Set 2 Answers (4) (6) di = D (10)

Fall 2009 Social Sciences 7418 University of Wisconsin-Madison. Problem Set 2 Answers (4) (6) di = D (10) Publc Affars 974 Menze D. Chnn Fall 2009 Socal Scences 7418 Unversy of Wsconsn-Madson Problem Se 2 Answers Due n lecure on Thursday, November 12. " Box n" your answers o he algebrac quesons. 1. Consder

More information

CHAPTER 5: MULTIVARIATE METHODS

CHAPTER 5: MULTIVARIATE METHODS CHAPER 5: MULIVARIAE MEHODS Mulvarae Daa 3 Mulple measuremens (sensors) npus/feaures/arbues: -varae N nsances/observaons/eamples Each row s an eample Each column represens a feaure X a b correspons o he

More information