Person Movement Prediction Using Hidden Markov Models

Size: px
Start display at page:

Download "Person Movement Prediction Using Hidden Markov Models"

Transcription

1 Person Movemen Predcon Usng dden Mrkov Models Arpd Geller Lucn Vnn Compuer Scence Deprmen Lucn Blg Unversy of Su E Corn Sr o 4 Su-5525 omn {rpdgeller lucnvnn}@ulsuro Asrc: Uquous sysems use conex nformon o dp pplnce ehvor o humn needs Even more convenence s reched f he pplnce foresees he user s desres nd cs procvely hs pper nroduces dden Mrkov Models n order o ncpe he nex movemen of some persons he opml confguron of he model s deermned y evlung some movemen sequences of rel persons whn n offce uldng he smulon resuls show ccurcy n nex locon predcon rechng up o 92% Keywords: Uquous Compung Conex Predcon Mehods dden Mrkov Models eurl eworks Professor Lucn Vnţn PhD Lucn Blg Unversy of Su s n cve resercher n Advnced Compuer Archecure Conex Predcon n Uquous Compung Sysems Prllel nd Dsrued Sysems e s memer of Acdemy of echncl Scences from omn Europen Commsson Exper n Compuer Scence Vsng esercher Fellow Unversy of erfordshre UK Professor Vnţn pulshed 8 ooks nd over scenfc ppers omn USA Ily UK Porugl ungry Ausr Germny Polnd ec e nroduced some well-known orgnl rchecurl conceps n Compuer Archecure domn Dynmc eurl Brnch Predcon Pre-Compued Brnches Vlue Predcon focused on CPU's Conex ec recognzed ced nd deed hrough over 5 ppers pulshed n mny presgous nernonl conferences nd scenfc revews ACM IEEE IEE ec Arpd Geller MSc s workng s echng sssn Compuer Scence Deprmen from Lucn Blg Unversy of Su omn e receved he Mser of Scence degree n Compuer Scence he sme unversy n 23 Arpd Geller s currenly PhD suden n Compuer Scence workng on hess enled Advnced Predcon Mehods Inegred no Speculve Compuer Archecures hvng s supervsor professor dr Lucn Vnţn nd co-supervsor professor dr heo Ungerer from Unversy of Augsurg Germny e s n cve resercher n Advnced Compuer Archecure Conex Predcon n Uquous Compung Sysems nd he pulshed over scenfc ppers n some pprece revews IEE Proc Compuer nd Dgl echnques nd nernonl conferences UK Germny Belgum nd omn Inroducon Uquous sysems srve for dpon o user needs y ulzng nformon ou he curren conex n whch user s pplnce works A new quly of uquous sysems my e reched f conex wreness s enhnced y predcons of fuure conexs sed on curren nd prevous conex nformon Such predcon enles he sysem o procvely ne cons h enhnce he convenence of he user or h led o n mproved overll sysem umns ypclly c n cern hul pern however hey somemes nerrup her ehvor pern nd hey somemes compleely chnge he pern ur m s o releve people of cons h re done hully whou deermnng person s con he sysem should lern hs uomclly nd reverse ssumpons f h chnges he predcor nformon should herefore e sed on prevous ehvor perns nd ppled o specule on he fuure ehvor of person If he speculon fls he flng mus e recognzed nd he predcor mus e upded o mprove fuure predcon ccurcy [4 5] For our pplcon domn we chose nex locon predcon nsed of generl conex predcon he lgorhms my lso e pplcle for oher more generl conex domns; however here lredy exs numerous scenros whn our pplcon s domn Some smple scenros my e he followng [4]: Smr doorples h re le o drec vsors o he curren locon of n offce owner sed on locon-rckng sysem nd predc f he offce owner s soon comng ck hs scenro s currenly developed Augsurg Unversy nd we re nvolved n he conex predcon pproch Elevor predcon could ncpe whch floor n elevor wll e needed nex oung predcon for cellulr phone sysems my predc he nex rdo cell cellulr phone owner wll ener sed on hs prevous movemen ehvor Sudes n Informcs nd Conrol Vol 5 o Mrch26 7

2 o predc or ncpe fuure suon lernng echnques s eg Mrkov Chns dden Mrkov Models Byesn eworks me Seres or eurl eworks re ovous cnddes he chllenge s o rnsfer hese lgorhms o work wh conex nformon Pezold e l n her work [4] rnsformed some predcon lgorhms used n rnch predcon echnques of curren hgh-performnce mcroprocessors o hndle conex predcon hey evlued he one-level onese wo-se nd mulple-se predcors nd he wo-level wo-se predcors wh locl nd glol frslevel hsores he evluon ws performed y smulng he predcors wh ehvor perns of people wlkng hrough uldng s worklod her smulon resuls show h he conex predcors perform well u exh dfferences n rnng nd rernng speed nd n her ly o lern complex perns In noher work [5] Pezold e l nroduced conex predcon echnques sed on prevous ehvor perns n order o ncpe person s nex movemen hey nlyzed he wo-level predcors wh glol frs-level hsores nd he wo-se predcors nd hey compred hese predcors wh he Predcon y Prl Mchng PPM mehod hey evlued he predcors y some movemen sequences of rel persons whn n offce uldng rechng up o 59% ccurcy n nex locon predcon whou pre-rnng nd respecvely up o 98% wh pre-rnng ner n hs work [7] shows how MMs cn e ppled o seleced prolems n speech recognon s pper presens he heory of MMs from he smples conceps dscree Mrkov chns o he mos sophsced models vrle duron connuous densy models ec e lso llusred some pplcons of he heory of MMs o smple prolems n speech recognon nd poned ou how he echnques hve een ppled o more dvnced speech recognon prolems Lu e l n her work [3] descre MM sed frmework for hnd gesure deecon nd recognon he gol of gesure nerpreon s o mprove humn-mchne communcon nd o rng humnmchne nercon closer o humn-humn nercon mkng possle new pplcons such s sgn lnguge rnslon hey presen n effcen mehod for exrcng he oservon sequence usng he feure model nd Vecor Qunzon nd demonsre h compred o he clssc emple-sed mehods he MM-sed pproch offers more flexle frmework for recognon Gl e l n her work [2] presen novel pproch for uomclly cqurng sochsc models of he hgh-level srucure of humn cvy whou he ssumpon of ny pror knowledge he process nvolves emporl segmenon no plusle omc ehvour componens nd he use of vrle lengh Mrkov models for he effcen represenon of ehvours her expermenl resuls demonsre h he use of vrle lengh Mrkov models provdes n effcen mechnsm for lernng complex ehvorl dependences nd consrns Mchne Lernng echnques sed on MMs hs een lso ppled o prolems n compuonl ology nd hey cn e used s mhemcl models of moleculr processes nd ologcl sequences he gol of compuonl ology s o elucde ddonl nformon requred for drug desgn medcl dgnoss nd medcl remen he mory of moleculr d used n compuonl ology consss n sequences of nucleodes correspondng o he prmry srucure of DA nd A or sequences of mno cds correspondng o he prmry srucure of proens Brney n hs work [] revews gene-predcon MMs nd proen fmly MMs he role of gene-predcon n DA s o dscover he locon of genes on he genome MMs hve lso een used n proen proflng o dscrmne eween dfferen proen fmles nd predc new proen-fmly or sufmly Yoon e l n her work [] proposed new mehod sed on conexsensve MMs whch cn e used for predcng A secondry srucure he A secondry srucure resuls from he se prs formed y he nucleodes of A he conex-sensve MM cn e vewed s n exenson of he rdonl MM where some of he ses re equpped wh uxlry memory Symols h re emed cern ses re sored n he memory nd hey serve s he conex h ffecs he emsson nd rnson proles of he model hey demonsred h he proposed model predcs he secondry srucure very ccurely low compuonl cos hs pper focuses on dden Mrkov Model MM pproch nroducng he MM-sed predcors nd comprng hem wh smple Mrkov nd respecvely neurl predcors ur pplcon predcs he nex room sed on he hsory of rooms vsed y cern person movng whn n offce uldng We evlue hese predcors y some movemen sequences of rel persons cqured from he Smr Doorples proec developed Augsurg Unversy [4 5 6] he nex secons descre he proposed dden Mrkov Models nd presen he smulon resuls 8 Sudes n Informcs nd Conrol Vol 5 o Mrch26

3 2 dden Mrkov Models of order 2 Elemens of MM of rder - he numer of hdden ses wh S {S S S - } he se of hdden ses nd q he hdden se me wll e vred n order o on he opml vlue 2 M - he numer of oservle ses wh V {V V V M- } he se of oservle ses symols nd he oservle se me 3 A { } - he rnson proles eween he hdden ses S nd S where P[ q S q S ] 4 B { k} - he proles of he oservle ses V k n hdden ses S where k P[ V q S ] k M k 5 π {π } - he nl hdden se proles where π P[ q S ] here re lso defned he followng vrles: P 2 q λ - he forwrd vrle [7] represenng he proly of he prl oservon sequence unl me nd hdden se S me gven he model λ A π P 2 q λ - he ckwrd vrle [7] represenng he proly of he prl oservon sequence from o he end gven hdden se S me nd he model λ A π ξ P q q S 2 λ - he proly of eng n hdden se S me nd hdden se S me gven he model λ A π nd he oservon sequence γ P q 2 λ - he proly of eng n hdden se S me gven he model λ A π nd he oservon sequence - he hsory he numer of oservons used n he predcon process In [7] nd [8] he enre oservon sequence s used n he predcon process u n some prccl pplcons he oservon sequence ncreses connuously herefore s necessry s lmon hus he ls oservons cn e sored n lef shf regser I - he mxmum numer of erons n he dusmen process Usully he dusmen process ends when he proly of he oservon sequence doesn ncrese nymore u for fser dusmen s lmed he numer of erons 22 Adusmen Process of MM of rder IIIALIZE λ A π ; 2 CMPUE ξ γ ; 3 ADJUS E MDEL λ A π ; 4 IF P ICEASES G 2 λ 23 Inlzon of he Model of rder he rnson proles eween he hdden ses AX {} re rndomly nlzed o pproxmely / ech row summng o he proles of he oservle ses BXM {k} re rndomly nlzed o pproxmely /M ech row summng o he nl hdden se proles πx {π} re rndomly se o pproxmely / her sum eng Sudes n Informcs nd Conrol Vol 5 o Mrch26 9

4 24 Predcon Algorhm Usng MM of rder s he lengh of he oservon sequence; 2 ; f < go o 2 3 c c s he numer of curren eron s mxmum vlue s gven y I; 4 he model λ A π s repeedly dused sed on he ls oservons 2 he enre oservon sequence f n order o ncrese he proly of he oservon sequence P 2 λ In 4 42 nd 43 seps he denomnors re used n order o on proly mesure nd o vod underflow As Smp showed n [8] underflow s nevle whou sclng snce he proles end o exponenlly s ncreses 4 Compue he forwrd vrle n recursve mnner: π where s he π proly of oservon symol - nd nl hdden se S gven he model λ A π ; 2 where s he proly of he prl oservon sequence unl me - nd hdden se S me gven he model λ A π Snce y defnon P 2 q S λ he sum of he ermnl forwrd vrles gves he proly of he oservon sequence: P 2 λ 42 Compue he ckwrd vrle n recursve mnner: ; where s he proly of he prl oservon sequence from o he end 2 gven hdden se S me nd he model λ A π 43 Compue ξ : 2 Sudes n Informcs nd Conrol Vol 5 o Mrch26

5 ξ where ξ s he proly of eng n hdden se S me nd respecvely S me gven he oservon sequence 2 nd he model λ A π 44 Compue γ : γ ξ where γ s he proly of eng n he hdden se S me gven he model λ A π nd he oservon sequence 2 45 Adus π: π γ - represens he expeced numer of mes he hdden se s S he nl me 46 Adus A: ξ γ - represens he proly of rnson from hdden se S o S he numeror s he expeced numer of rnsons from se S o S whle he denomnor s he expeced numer of rnsons from se S o ny se 47 Adus B: Vk k γ - he proly of oservon symol V k gven h he model s n γ hdden se S he numeror s he expeced numer of mes he model s n hdden se S nd he oservon symol s V k whle he denomnor s he expeced numer of mes he model s n hdden se S 48 cc; f log[ P λ] > log[ P λ] nd c<i hen go o 4 Snce P would e ou of he dynmc rnge of he mchne [7] we compue he log of P usng he followng formul [8]: log[ P λ] log log 2 π A curren me s predced he nex oservon symol usng he dused model λ A π : - choose hdden se S me - mxmzng ; - choose nex hdden se S me - mxmzng ; - predc nex symol V k me k M- mxmzng k If he process connues hen nd go o 3 Sudes n Informcs nd Conrol Vol 5 o Mrch26 2

6 3 A Possle Generlzon: dden Mrkov Models of rder In hs prgrph we ry o develop dden Mrkov Model of order here re mulple possles for dong hs u we presen here only one we consdered he mos ppropre he key of our proposed model s represened y he so-clled hdden super-ses comnon of prmve hdden ses herefore he mn dfference comprng wh n order MM consss n he fc h he sochsc hdden Mrkov model s of order nsed of order one hs new model s usfed ecuse we suppose h n some specfc pplcons here re longer correlons whn he hdden se model In oher words we suppose h he nex hdden se s eer deermned y he curren super-se rher hn y he curren prmve se As cn e furher seen he new proposed model s smlr wh he well-known MM of order one excepng h he generc prmve hdden se ecomes now generc super-se 3 Elemens of MM of rder - he order of MM comnon of prmve hdden ses form so clled super-se 2 - he numer of prmve hdden ses elongng o MM of order wh S { S S S } eng he se of hdden super-ses nd q S he hdden superse me he curren super-se deermnes he rnson no he nex one sed on super-se rnson mrx wh resrcons hs rnson mrx nvolve non-ergodc model see exmple of le wll e vred n order o on he opml vlue 3 M - he numer of oservle ses wh V {V V V M- } he se of oservle ses symols nd he oservle se me 4 A { } - he rnson proles eween he hdden super-ses S nd S where P[ q S q S ] 5 B { k} - he proles of he oservle ses V k consderng he curren hdden superse S where k P[ V q S ] k M k 6 π {π } - he nl hdden super-se proles where π P[ q S ] In order o smplfy he ermnology n he res of he pper we ll refer o he hdden super-ses s smply hdden ses elongng o he MM of order We lso defne he followng vrles: P 2 q λ - he forwrd vrle [7] represenng he proly of he prl oservon sequence unl me nd hdden se S me gven he model λ A π P 2 q λ - he ckwrd vrle [7] represenng he proly of he prl oservon sequence from o he end gven hdden se S me nd he model λ A π ξ P q q S 2 λ - he proly of eng n hdden se S me nd hdden se S me gven he model λ A π nd he oservon sequence γ P q 2 λ - he proly of eng n hdden se S me gven he model λ A π nd he oservon sequence - he hsory he numer of oservons used n he predcon process In [7] nd [8] he enre oservon sequence s used n he predcon process u n some prccl pplcons he oservon sequence ncreses connuously herefore s necessry s lmon hus he ls oservons cn e sored n lef shf regser hvng cern lengh 22 Sudes n Informcs nd Conrol Vol 5 o Mrch26

7 I - he mxmum numer of erons n he dusmen process Usully he dusmen process ends when he proly of he ls oservons doesn ncrese nymore u for fser dusmen s lmed he numer of erons For MM of order wh hdden ses he rnson proles eween he hdden ses A X { } re sored n le wh rows nd columns u no ll cells of he le re used; here re only conssen possle rnsons from ech se nvolvng non-ergodc model he followng le for exmple corresponds o MM of order 3 3 wh 2 prmve hdden ses 2: AAA ABA ABB BAA BAB BBA BBB AAB AAA X X AAB X X 2 ABA X X 3 ABB X X 4 BAA X X 5 BAB X X 6 BBA X X 7 BBB X X le Conssen rnsons for MM of rder 3 3 wh 2 dden Ses 2 here re used only he conssen cells mrked wh X ecuse rnsons re possle only eween ses whch end nd respecvely sr wh he sme - prmve hdden ses he conssen cells of he rnson le re gven y he followng formuls: For nex hdden ses columns re conssen only he curren hdden ses rows ; For curren hdden ses rows re conssen only he nex hdden ses columns mod mod 32 Adusmen Process of MM of rder Inlze λ A π ; 2 Compue ξ γ ; 3 Adus he model λ A π ; 4 If P λ ncreses go o 2 33 Inlzon of he Model of rder he rnson proles eween he hdden ses A X { } re rndomly nlzed o pproxmely /; he sum of ech row s elemens mus e he hdden se rnson proles re nlzed for nd mod mod 2 he proles of he oservle ses B XM { k} re rndomly nlzed o pproxmely /M; he sum of ech row s elemens mus e 3 he nl hdden se proles πx {π } re rndomly se o pproxmely / her sum eng Sudes n Informcs nd Conrol Vol 5 o Mrch26 23

8 24 Sudes n Informcs nd Conrol Vol 5 o Mrch26 34 Predcon Algorhm Usng MM of rder s he lengh of he oservon sequence; 2 ; f < go o 2 3 c c s he numer of curren eron s mxmum vlue s gven y I; 4 he model π λ B A s repeedly dused sed on he ls oservons 2 he enre oservon sequence f n order o ncrese he proly of he oservon sequence 2 λ P In 4 42 nd 43 he denomnors re used n order o on proly mesure nd o vod underflow As Smp showed n [8] underflow s nevle whou sclng snce he proles end o exponenlly s ncreses 4 Compue he forwrd vrle n recursve mnner: π π where s he proly of oservon symol - nd nl hdden se S gven he model π λ B A ; 2 where s he proly of he prl oservon sequence unl me - nd hdden se S me gven he model π λ B A Snce y defnon 2 λ S q P he sum of he ermnl forwrd vrles gves he proly of he oservon sequence: 2 P λ 42 Compue he ckwrd vrle n recursve mnner: ; mod mod mod mod

9 where s he proly of he prl oservon sequence from o he end 2 gven hdden se S me nd he model λ A π 43 Compue ξ : ξ mod mod mod mod where ξ s he proly of eng n hdden se S me nd respecvely S me gven he oservon sequence 2 nd he model λ A π 44 Compue γ : mod mod γ ξ where γ s he proly of eng n hdden se S me gven he model λ A π nd he oservon sequence 2 45 Adus π: π γ - represens he expeced numer of mes he hdden se s S he nl me 46 Adus A: ξ γ - he proly of rnson from hdden se S o S where nd mod mod he numeror s he expeced numer of rnsons from se S o S whle he denomnor s he expeced numer of rnsons from se S o ny se 47 Adus B: Vk k γ - he proly of oservon symol V k k M gven γ h he model s n hdden se S he numeror s he expeced numer of mes he model s n hdden se S nd he oservon symol s V k whle he denomnor s he expeced numer of mes he model s n hdden se S 48 cc; f log[ P λ] > log[ P λ] nd c<i hen go o 4 Snce P would e ou of he dynmc rnge of he mchne [7] we compue he log of P usng he followng formul [8]: Sudes n Informcs nd Conrol Vol 5 o Mrch26 25

10 log[ P λ] log π 2 log A me s predced he nex oservon symol usng he dused model λ A π : - choose hdden se S me mxmzng ; - choose nex hdden se S me mod mod mxmzng ; - predc nex symol V k me k M mxmzng k If he process connues hen nd go o 3 4 Expermenl esuls ur pplcon predcs he nex room sed on he hsory of rooms vsed y cern person movng whn n offce uldng We evlue hese MM predcors y some movemen sequences of rel persons developed y he reserch group he Unversy of Augsurg [6] In hs work we re neresed n predcng he nex room from ll rooms excep for he own offce Ech lne from he orgnl enchmrks [6] represens person s movemen hs/her enry n room I conns he movemen s de nd hour he room s nme he person s nme nd mesmp In he codfcon process we elmned from he enchmrk he common corrdor ecuse could ehve s nose le 2 shows how looks he enchmrk efore nd fer he room codfcon process rgnl enchmrk Benchmrk fer room codfcon 2377 :3:45; 42; Employee2; :2:4; corrdor; Employee2; :2:45; 4; Employee2; :2:48; corrdor; Employee2; :2:54; 42; Employee2; le 2 he Frs Lnes From Cern Benchmrk Wh Movemen Sequence of Employee 2 Before nd Afer he oom Codfcon Process Afer he codfcon process he enchmrks conn only he room codes 3 ecuse n hs srng sge of our work only hs nformon s used n he predcon process We used wo enchmrk ypes: some shor enchmrks connng ou 3-4 movemens nd some long enchmrks connng ou movemens We used he shor enchmrks o pre-rn he MM predcors nd he long enchmrks for evluons We sred wh MM of order wh 2 hdden ses 2 nd we esed on he fll enchmrks developed Augsurg Unversy [6] whou corrdor he followng smulon mehodology ws used n order o predc ech room from cern enchmrk: we predced he nex room me sed on he enre room sequence from h enchmrk unl me - We compred MM whou ched confdence uom wh MMs usng dfferen confdence uom We denoed s n rooms m ses conf n m-se confdence couner ssoced o ech sequence of he ls n rooms vsed y he person he 4-se uom hve 2 predcle ses whle he 2-se uom hve only predcle se In he cse of usng 4-se uom predcon s genered n ech of he wo predcle ses [9] le 3 shows h he es verge predcon ccurcy AM s oned when usng 4-se confdence for ech sequence of 2 rooms: 26 Sudes n Informcs nd Conrol Vol 5 o Mrch26

11 Benchmrk no conf 2 rooms 4 ses conf 2 rooms 2 ses conf room 4 ses conf Employee Employee Employee Boss AM le 3 Comprng MM Whou Confdence wh MMs Usng Dfferen ypes of Confdence We connued our smulons vryng he numer of hdden ses We used gn he fll enchmrks [6] nd MM of order wh 4-se confdence uom ssoced o ech sequence of wo rooms le 4 shows how s ffeced he predcon ccurcy of MM y he numer of hdden ses: Benchmrk Employee Employee Employee Boss AM le 4 Sudy of he umer of dden Ses Usng MM wh 4-Se Confdence Auom I cn e oserved n le 4 h for MM of order he opml numer of hdden ses s 5 ur scenfc hypohess s h he hdden ses re he fve workng dys of week We vred gn he numer of hdden ses whou usng he confdence uom le 5 shows h n hs cse he opml numer of hdden ses s Benchmrk Employee Employee Employee Boss AM le 5 Sudy of he umer of dden Ses Usng MM Whou Confdence Auom We compre now he es MM of order wh dfferen confgurons of some equvlen s eurl eworks developed n our prevous work [9] nd respecvely smple Mrkov predcors Equvlen mens n hs cse h we compre ll hese dfferen predcors consderng h hey hve however he sme npus We used he MM of order wh 5 hdden ses consderng n ched 4-se confdence uom We compred wh sclly pre-rned wh room hsory lengh of of order nd 2 of order 2 lernng re of 2 nd hreshold of 3 hvng he sme confdence uom We lso compred he MM wh some smple Mrkov predcors of order nd 2 hvng he sme confdence uom he ws sclly rned on he summer enchmrks [6] nd ech predcor ws esed on he longer fll enchmrks [6] le 6 presens he predcon ccurces oned wh he MM nd Mrkov predcors ll wh 4-se confdence uom ssoced o ech sequence of wo rooms: Benchmrk MM of order of order of order 2 Mrkov of order Mrkov of order 2 5 Employee Employee Employee Boss AM le 6 Comprng MM of rder wh nd Mrkov Predcors Usng 4-Se Confdence Auom Employee 2 hsn go ehvor correled wh dys of week see le 4 nd lso le 6 I cn e seen n le 6 oo ecuse he Mrkov predcor of order ouperforms he MM of order s re eer hn MM on Employee 2 u we suspec h hese resuls re oo opmsc due o he s prernng frs cse nd respecvely due o he s order 2 second cse Sudes n Informcs nd Conrol Vol 5 o Mrch26 27

12 le 7 presens he predcon ccurces oned wh he MM nd smple Mrkov predcors he sme confguron whou confdence uom: Benchmrk MM of order of order of order 2 Mrkov of order Mrkov of order 2 Employee Employee Employee Boss AM le 7 Comprng MM of order wh nd smple Mrkov predcors whou confdence uom In order o confrm or nfrm our scenfc hypohess h n he cse of MM wh 4-se confdence uom he fve hdden ses mgh e he workng dys of he week we mplemened predcor whch consss of fve smple Mrkov predcors Ech Mrkov predcor s ssoced o one of he 5 dys Mondy uesdy Frdy le 8 compres hs predcor connng 5 smple Mrkov predcors wh MMs nd smple Mrkov predcors usng he 4-se confdence uom nd shows h only on one person Boss s confrmed our hypohess Benchmrk MM of order 5 Mrkov of order 5 Mrkov predcors of order Employee Employee Employee Boss AM le 8 Comprng MM of order wh Mrkov of order nd predcor conssng n 5 Mrkov predcors usng 4-se confdence uom le 9 compres he sme predcors MM Mrkov 5 Mrkovs whou usng he confdence uom In hs cse however he es numer of hdden ses ws We oned for ll enchmrks lower predcon ccurces when we used 5 smple Mrkov predcors even reled o he smple Mrkov predcor Benchmrk MM of order Mrkov of order 5 Mrkov predcors of order Employee Employee Employee Boss AM le 9 Comprng MM of order wh Mrkov of order nd predcor conssng n 5 Mrkov predcors whou usng confdence uom In order o decrese predcon lency we pre-rned MMs on he summer enchmrks [6] nd fer h we esed hem on he longer fll enchmrks [6] le presens comprvely he oned resuls when we used MM wh 5 hdden ses nd 4-se confdence uom: MM of order 5 Pre-rned MM of order 5 Benchmrk Predcon ccurcy [%] ol me Predcon me of he ls room Predcon ccurcy [%] ol me Predcon me of he ls room Employee Employee Employee Boss AM le Comprng smple MMs wh pre-rned MMs oh wh 4-se confdence uom n erms of predcon lency 28 Sudes n Informcs nd Conrol Vol 5 o Mrch26

13 As cn e oserved wh pre-rned MMs we oned eer predcon lences ou 85 ms u for Employee 3 nd Boss we oned lower predcon ccurces he sme predcon ccurces were oned usng he unrned MM wh only hdden se see le 4 hus n our opnon hrough pre-rnng he MM wh 5 hdden ses uses only of he hdden ses We repeed he sme smulons whou usng he confdence uom le presens he resuls for MM wh 5 hdden ses nd le 2 presens he resuls for MM wh hdden se: MM of order 5 Pre-rned MM of order 5 Benchmrk Predcon ccurcy [%] ol me Predcon me of he ls room Predcon ccurcy [%] ol me Predcon me of he ls room Employee Employee Employee Boss AM le Comprng smple MMs wh pre-rned MMs oh whou confdence uom n erms of predcon lency 5 MM of order Pre-rned MM of order Benchmrk Predcon ccurcy [%] ol me Predcon me of he ls room Predcon ccurcy [%] ol me Predcon me of he ls room Employee Employee Employee Boss AM le 2 Comprng smple MMs wh pre-rned MMs oh whou confdence uom n erms of predcon lency As cn e seen n le for MM wh 5 hdden ses hrough pre-rnng here re oned eer predcon lences nd eer predcon ccurces I s neresng h we oned he sme predcon ccurces usng he unrned MM wh hdden se see le 7 And s more neresng h for MM wh hdden se fer pre-rnng he predcon ccurcy s he sme gn hese resuls encourge our prevous concluson h he es numer of hdden ses s when we don use confdence uom hrough pre-rnng he MM wh 5 hdden ses nd whou confdence uom uses only of he hdden ses he nex prmeer we vred ws he order of MM We suded MMs of dfferen orders nd he sme numer of hdden ses 2 As cn e oserved n le 3 wh frs order MM were oned he es predcon ccurces: BECMAK Wh 4-se confdence Whou confdence EMPLYEE EMPLYEE EMPLYEE BSS AM le 3 Sudyng MMs of dfferen orders Sudes n Informcs nd Conrol Vol 5 o Mrch26 29

14 5 Conclusons nd Furher Work hs pper nlyzed mchne lernng echnques sed on MMs used n uquous compung pplcon ur gol ws o predc ccurely he movemens of persons whn n offce uldng wo predcor ypes were nlyzed: MMs wh confdence uom nd respecvely whou confdence uom he expermenl resuls show h MMs ouperform oher mplemened predcon echnques such s eurl ework nd respecvely Mrkov predcors he evluons show h he smples confguron of MM nd equvlen wh smple Mrkov model of order s he mos ccure for hs specfc pplcon We connued our sudy mplemenng sclly pre-rned MM nd we oned lower predcon lences Predcng from ll rooms excep own room nd usng MM wh 4-se confdence uom we oned n verge predcon ccurcy of 848% u he predcon ccurcy mesured on some locl predcors grew up o over hn 92% As furher work we nend o use our nd MM developed predcors n oher conex predcon n uquous compung pplcons eg nex cell movemens n GSM communcons sed on ok s enchmrks Acknowledgmens hs work ws suppored n pr y he omnn onl Councl of Acdemc eserch CCSIS hrough he grn CCSIS 7 / Also our grude o Professor heo Ungerer from he Unversy of Augsurg Germny for provdng us he used enchmrks for persons movemens nd for supporng he second uhor durng wo monhs reserch sge Augsurg n 23 EFEECES BIEY E dden Mrkov Models n Bologcl Sequence Anlyss IBM Journl of eserch nd Developmen Volume 45 umers 3/4 2 2 GALAA A JS GG D Lernng Behvour Models of umn Acves Proceedngs of Brsh Mchne Vson Conference pges 2-22 onghm UK Sepemer LIU LVELL B C Gesure Clssfcon Usng dden Mrkov Models nd Ver Ph Counng Proceedngs of he Sevenh Inernonl Conference on Dgl Imge Compung: echnques nd Applcons pges Sydney Ausrl Decemer 23 4 PEZLD J BAGCI F UMLE W UGEE Conex Predcon Bsed on Brnch Predcon Mehods echncl epor Unversy of Augsurg Germny 23 5 PEZLD J BAGCI F UMLE W UGEE VIA L Glol Se Conex Predcon echnques Appled o Smr ffce Buldng Communcon eworks nd Dsrued Sysems Modelng nd Smulon Conference Sn Dego Clforn SUA Jnury PEZLD J Augsurg Indoor Locon rckng Benchmrks echncl epor 24-9 Insue of Compuer Scence Unversy of Augsurg Germny 24 hp://wwwnformkunugsurgde/skrps/echrepors/ 7 ABIE L A uorl on dden Mrkov Models nd Seleced Applcons n Speech ecognon Proceedngs of he IEEE Vol 77 o 2 Ferury SAMP M A evelng Inroducon o dden Mrkov Models Jnury 24 hp://wwwcsssuedu/fculy/smp/ua/mmpdf 9 VIA L GELLE A PEZLD J UGEE Person Movemen Predcon Usng eurl eworks Proceedngs of he KI24 Inernonl Workshop on Modelng nd erevl of Conex MC 24 Vol-4 ISS Ulm Germny Sepemer 24 Y VAIDYAA P P A Secondry Srucure Predcon Usng Conex-Sensve dden Mrkov Models Proceedngs of Inernonl Workshop on Bomedcl Crcus nd Sysems Sngpore Decemer 24 3 Sudes n Informcs nd Conrol Vol 5 o Mrch26

Hidden Markov Model. a ij. Observation : O1,O2,... States in time : q1, q2,... All states : s1, s2,..., sn

Hidden Markov Model. a ij. Observation : O1,O2,... States in time : q1, q2,... All states : s1, s2,..., sn Hdden Mrkov Model S S servon : 2... Ses n me : 2... All ses : s s2... s 2 3 2 3 2 Hdden Mrkov Model Con d Dscree Mrkov Model 2 z k s s s s s s Degree Mrkov Model Hdden Mrkov Model Con d : rnson roly from

More information

Supporting information How to concatenate the local attractors of subnetworks in the HPFP

Supporting information How to concatenate the local attractors of subnetworks in the HPFP n Effcen lgorh for Idenfyng Prry Phenoype rcors of Lrge-Scle Boolen Newor Sng-Mo Choo nd Kwng-Hyun Cho Depren of Mhecs Unversy of Ulsn Ulsn 446 Republc of Kore Depren of Bo nd Brn Engneerng Kore dvnced

More information

Electromagnetic Transient Simulation of Large Power Transformer Internal Fault

Electromagnetic Transient Simulation of Large Power Transformer Internal Fault Inernonl Conference on Advnces n Energy nd Envronmenl Scence (ICAEES 5) Elecromgnec Trnsen Smulon of rge Power Trnsformer Inernl Ful Jun u,, Shwu Xo,, Qngsen Sun,c, Huxng Wng,d nd e Yng,e School of Elecrcl

More information

A NEW INTERPRETATION OF INTERVAL-VALUED FUZZY INTERIOR IDEALS OF ORDERED SEMIGROUPS

A NEW INTERPRETATION OF INTERVAL-VALUED FUZZY INTERIOR IDEALS OF ORDERED SEMIGROUPS ScInLhore),7),9-37,4 ISSN 3-536; CODEN: SINTE 8 9 A NEW INTERPRETATION O INTERVAL-VALUED UZZY INTERIOR IDEALS O ORDERED SEMIGROUPS Hdy Ullh Khn, b, Nor Hnz Srmn, Asghr Khn c nd z Muhmmd Khn d Deprmen of

More information

Advanced Electromechanical Systems (ELE 847)

Advanced Electromechanical Systems (ELE 847) (ELE 847) Dr. Smr ouro-rener Topc 1.4: DC moor speed conrol Torono, 2009 Moor Speed Conrol (open loop conrol) Consder he followng crcu dgrm n V n V bn T1 T 5 T3 V dc r L AA e r f L FF f o V f V cn T 4

More information

II The Z Transform. Topics to be covered. 1. Introduction. 2. The Z transform. 3. Z transforms of elementary functions

II The Z Transform. Topics to be covered. 1. Introduction. 2. The Z transform. 3. Z transforms of elementary functions II The Z Trnsfor Tocs o e covered. Inroducon. The Z rnsfor 3. Z rnsfors of eleenry funcons 4. Proeres nd Theory of rnsfor 5. The nverse rnsfor 6. Z rnsfor for solvng dfference equons II. Inroducon The

More information

Minimum Squared Error

Minimum Squared Error Minimum Squred Error LDF: Minimum Squred-Error Procedures Ide: conver o esier nd eer undersood prolem Percepron y i > for ll smples y i solve sysem of liner inequliies MSE procedure y i = i for ll smples

More information

Research Article Oscillatory Criteria for Higher Order Functional Differential Equations with Damping

Research Article Oscillatory Criteria for Higher Order Functional Differential Equations with Damping Journl of Funcon Spces nd Applcons Volume 2013, Arcle ID 968356, 5 pges hp://dx.do.org/10.1155/2013/968356 Reserch Arcle Oscllory Crer for Hgher Order Funconl Dfferenl Equons wh Dmpng Pegung Wng 1 nd H

More information

The Concepts of Hidden Markov Model in Speech Recognition

The Concepts of Hidden Markov Model in Speech Recognition he Conceps of Hdden Mrov Model n Speech Recognon echncl Repor R99/9 Wleed H Adull nd ol K KsovDeprmen of Knowledge Engneerng L Informon Scence Deprmen Unversy of go ew Zelnd 999 he Conceps of Hdden Mrov

More information

Minimum Squared Error

Minimum Squared Error Minimum Squred Error LDF: Minimum Squred-Error Procedures Ide: conver o esier nd eer undersood prolem Percepron y i > 0 for ll smples y i solve sysem of liner inequliies MSE procedure y i i for ll smples

More information

The solution is often represented as a vector: 2xI + 4X2 + 2X3 + 4X4 + 2X5 = 4 2xI + 4X2 + 3X3 + 3X4 + 3X5 = 4. 3xI + 6X2 + 6X3 + 3X4 + 6X5 = 6.

The solution is often represented as a vector: 2xI + 4X2 + 2X3 + 4X4 + 2X5 = 4 2xI + 4X2 + 3X3 + 3X4 + 3X5 = 4. 3xI + 6X2 + 6X3 + 3X4 + 6X5 = 6. [~ o o :- o o ill] i 1. Mrices, Vecors, nd Guss-Jordn Eliminion 1 x y = = - z= The soluion is ofen represened s vecor: n his exmple, he process of eliminion works very smoohly. We cn elimine ll enries

More information

Query Data With Fuzzy Information In Object- Oriented Databases An Approach The Semantic Neighborhood Of Hedge Algebras

Query Data With Fuzzy Information In Object- Oriented Databases An Approach The Semantic Neighborhood Of Hedge Algebras (IJCSIS) Inernonl Journl of Compuer Scence nd Informon Secury, Vol 9, No 5, My 20 Query D Wh Fuzzy Informon In Obec- Orened Dbses An Approch The Semnc Neghborhood Of edge Algebrs Don Vn Thng Kore-VeNm

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

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

Multi-load Optimal Design of Burner-inner-liner Under Performance Index Constraint by Second-Order Polynomial Taylor Series Method

Multi-load Optimal Design of Burner-inner-liner Under Performance Index Constraint by Second-Order Polynomial Taylor Series Method , 0005 (06) DOI: 0.05/ mecconf/06700005 ICMI 06 Mul-lod Opml Desgn of Burner-nner-lner Under Performnce Index Consrn by Second-Order Polynoml ylor Seres Mehod U Goqo, Wong Chun Nm, Zheng Mn nd ng Kongzheng

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

4.8 Improper Integrals

4.8 Improper Integrals 4.8 Improper Inegrls Well you ve mde i hrough ll he inegrion echniques. Congrs! Unforunely for us, we sill need o cover one more inegrl. They re clled Improper Inegrls. A his poin, we ve only del wih inegrls

More information

THE EXISTENCE OF SOLUTIONS FOR A CLASS OF IMPULSIVE FRACTIONAL Q-DIFFERENCE EQUATIONS

THE EXISTENCE OF SOLUTIONS FOR A CLASS OF IMPULSIVE FRACTIONAL Q-DIFFERENCE EQUATIONS Europen Journl of Mhemcs nd Compuer Scence Vol 4 No, 7 SSN 59-995 THE EXSTENCE OF SOLUTONS FOR A CLASS OF MPULSVE FRACTONAL Q-DFFERENCE EQUATONS Shuyun Wn, Yu Tng, Q GE Deprmen of Mhemcs, Ynbn Unversy,

More information

An improved statistical disclosure attack

An improved statistical disclosure attack In J Grnulr Compung, Rough Ses nd Inellgen Sysems, Vol X, No Y, xxxx An mproved sscl dsclosure c Bn Tng* Deprmen of Compuer Scence, Clforn Se Unversy Domnguez Hlls, Crson, CA, USA Eml: bng@csudhedu *Correspondng

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

Origin Destination Transportation Models: Methods

Origin Destination Transportation Models: Methods In Jr. of Mhemcl Scences & Applcons Vol. 2, No. 2, My 2012 Copyrgh Mnd Reder Publcons ISSN No: 2230-9888 www.journlshub.com Orgn Desnon rnsporon Models: Mehods Jyo Gup nd 1 N H. Shh Deprmen of Mhemcs,

More information

Developing Communication Strategy for Multi-Agent Systems with Incremental Fuzzy Model

Developing Communication Strategy for Multi-Agent Systems with Incremental Fuzzy Model (IJACSA) Inernonl Journl of Advnced Compuer Scence nd Applcons, Developng Communcon Sregy for Mul-Agen Sysems wh Incremenl Fuzzy Model Sm Hmzeloo, Mnsoor Zolghdr Jhrom Deprmen of Compuer Scence nd Engneerng

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

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

Chapter 2: Evaluative Feedback

Chapter 2: Evaluative Feedback Chper 2: Evluive Feedbck Evluing cions vs. insrucing by giving correc cions Pure evluive feedbck depends olly on he cion ken. Pure insrucive feedbck depends no ll on he cion ken. Supervised lerning is

More information

September 20 Homework Solutions

September 20 Homework Solutions College of Engineering nd Compuer Science Mechnicl Engineering Deprmen Mechnicl Engineering A Seminr in Engineering Anlysis Fll 7 Number 66 Insrucor: Lrry Creo Sepember Homework Soluions Find he specrum

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

EEM 486: Computer Architecture

EEM 486: Computer Architecture EEM 486: Compuer Archecure Lecure 4 ALU EEM 486 MIPS Arhmec Insrucons R-ype I-ype Insrucon Exmpe Menng Commen dd dd $,$2,$3 $ = $2 + $3 sub sub $,$2,$3 $ = $2 - $3 3 opernds; overfow deeced 3 opernds;

More information

Privacy-Preserving Bayesian Network Parameter Learning

Privacy-Preserving Bayesian Network Parameter Learning 4h WSEAS In. Conf. on COMUTATIONAL INTELLIGENCE, MAN-MACHINE SYSTEMS nd CYBERNETICS Mm, Flord, USA, November 7-9, 005 pp46-5) rvcy-reservng Byesn Nework rmeer Lernng JIANJIE MA. SIVAUMAR School of EECS,

More information

e t dt e t dt = lim e t dt T (1 e T ) = 1

e t dt e t dt = lim e t dt T (1 e T ) = 1 Improper Inegrls There re wo ypes of improper inegrls - hose wih infinie limis of inegrion, nd hose wih inegrnds h pproch some poin wihin he limis of inegrion. Firs we will consider inegrls wih infinie

More information

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

Li An-Ping. Beijing , P.R.China

Li An-Ping. Beijing , P.R.China A New Type of Cpher: DICING_csb L An-Png Bejng 100085, P.R.Chna apl0001@sna.com Absrac: In hs paper, we wll propose a new ype of cpher named DICING_csb, whch s derved from our prevous sream cpher DICING.

More information

On One Analytic Method of. Constructing Program Controls

On One Analytic Method of. Constructing Program Controls Appled Mahemacal Scences, Vol. 9, 05, no. 8, 409-407 HIKARI Ld, www.m-hkar.com hp://dx.do.org/0.988/ams.05.54349 On One Analyc Mehod of Consrucng Program Conrols A. N. Kvko, S. V. Chsyakov and Yu. E. Balyna

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

Visual Robot Homing using Sarsa(λ), Whole Image Measure, and Radial Basis Function.

Visual Robot Homing using Sarsa(λ), Whole Image Measure, and Radial Basis Function. Vsul Robo Homng usng Srs(λ, Whole Imge Mesure, nd Rdl Bss Funcon. Abdulrhmn Alhhn, Kevn Burn, Sefn Wermer Hybrd Inellgen Sysems Reserch Group, School of Compung nd echnology, Unversy of Sunderlnd, SR6

More information

Motion Feature Extraction Scheme for Content-based Video Retrieval

Motion Feature Extraction Scheme for Content-based Video Retrieval oon Feure Exrcon Scheme for Conen-bsed Vdeo Rerevl Chun Wu *, Yuwen He, L Zho, Yuzhuo Zhong Deprmen of Compuer Scence nd Technology, Tsnghu Unversy, Bejng 100084, Chn ABSTRACT Ths pper proposes he exrcon

More information

Simplified Variance Estimation for Three-Stage Random Sampling

Simplified Variance Estimation for Three-Stage Random Sampling Deprmen of ppled Sscs Johnnes Kepler Unversy Lnz IFS Reserch Pper Seres 04-67 Smplfed rnce Esmon for Three-Sge Rndom Smplng ndres Quember Ocober 04 Smplfed rnce Esmon for Three-Sge Rndom Smplng ndres Quember

More information

Physics 201 Lecture 2

Physics 201 Lecture 2 Physcs 1 Lecure Lecure Chper.1-. Dene Poson, Dsplcemen & Dsnce Dsngush Tme nd Tme Inerl Dene Velocy (Aerge nd Insnneous), Speed Dene Acceleron Undersnd lgebrclly, hrough ecors, nd grphclly he relonshps

More information

ANOTHER CATEGORY OF THE STOCHASTIC DEPENDENCE FOR ECONOMETRIC MODELING OF TIME SERIES DATA

ANOTHER CATEGORY OF THE STOCHASTIC DEPENDENCE FOR ECONOMETRIC MODELING OF TIME SERIES DATA Tn Corn DOSESCU Ph D Dre Cner Chrsn Unversy Buchres Consnn RAISCHI PhD Depren of Mhecs The Buchres Acdey of Econoc Sudes ANOTHER CATEGORY OF THE STOCHASTIC DEPENDENCE FOR ECONOMETRIC MODELING OF TIME SERIES

More information

A Deterministic Algorithm for Summarizing Asynchronous Streams over a Sliding Window

A Deterministic Algorithm for Summarizing Asynchronous Streams over a Sliding Window A Deermnsc Algorhm for Summarzng Asynchronous Sreams over a Sldng ndow Cosas Busch Rensselaer Polyechnc Insue Srkana Trhapura Iowa Sae Unversy Oulne of Talk Inroducon Algorhm Analyss Tme C Daa sream: 3

More information

ENGR 1990 Engineering Mathematics The Integral of a Function as a Function

ENGR 1990 Engineering Mathematics The Integral of a Function as a Function ENGR 1990 Engineering Mhemics The Inegrl of Funcion s Funcion Previously, we lerned how o esime he inegrl of funcion f( ) over some inervl y dding he res of finie se of rpezoids h represen he re under

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

OPERATOR-VALUED KERNEL RECURSIVE LEAST SQUARES ALGORITHM

OPERATOR-VALUED KERNEL RECURSIVE LEAST SQUARES ALGORITHM 3rd Europen Sgnl Processng Conference EUSIPCO OPERATOR-VALUED KERNEL RECURSIVE LEAST SQUARES ALGORITM P. O. Amblrd GIPSAlb/CNRS UMR 583 Unversé de Grenoble Grenoble, Frnce. Kdr LIF/CNRS UMR 779 Ax-Mrselle

More information

To Possibilities of Solution of Differential Equation of Logistic Function

To Possibilities of Solution of Differential Equation of Logistic Function Arnold Dávd, Frnše Peller, Rená Vooroosová To Possbles of Soluon of Dfferenl Equon of Logsc Funcon Arcle Info: Receved 6 My Acceped June UDC 7 Recommended con: Dávd, A., Peller, F., Vooroosová, R. ().

More information

FURTHER GENERALIZATIONS. QI Feng. The value of the integral of f(x) over [a; b] can be estimated in a variety ofways. b a. 2(M m)

FURTHER GENERALIZATIONS. QI Feng. The value of the integral of f(x) over [a; b] can be estimated in a variety ofways. b a. 2(M m) Univ. Beogrd. Pul. Elekroehn. Fk. Ser. M. 8 (997), 79{83 FUTHE GENEALIZATIONS OF INEQUALITIES FO AN INTEGAL QI Feng Using he Tylor's formul we prove wo inegrl inequliies, h generlize K. S. K. Iyengr's

More information

AN INTRODUCTORY GUIDELINE FOR THE USE OF BAYESIAN STATISTICAL METHODS IN THE ANALYSIS OF ROAD TRAFFIC ACCIDENT DATA

AN INTRODUCTORY GUIDELINE FOR THE USE OF BAYESIAN STATISTICAL METHODS IN THE ANALYSIS OF ROAD TRAFFIC ACCIDENT DATA AN INTRODUCTORY GUIDELINE FOR THE USE OF BAYESIAN STATISTICAL METHODS IN THE ANALYSIS OF ROAD TRAFFIC ACCIDENT DATA CJ Molle Pr Eng Chef Engneer : Trffc Engneerng Deprmen of Economc Affrs, Agrculure nd

More information

Concise Derivation of Complex Bayesian Approximate Message Passing via Expectation Propagation

Concise Derivation of Complex Bayesian Approximate Message Passing via Expectation Propagation Concse Dervon of Complex Byesn Approxme Messge Pssng v Expecon Propgon Xngmng Meng, Sheng Wu, Lnlng Kung, Jnhu Lu Deprmen of Elecronc Engneerng, Tsnghu Unversy, Bejng, Chn Tsnghu Spce Cener, Tsnghu Unversy,

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

MODELLING AND EXPERIMENTAL ANALYSIS OF MOTORCYCLE DYNAMICS USING MATLAB

MODELLING AND EXPERIMENTAL ANALYSIS OF MOTORCYCLE DYNAMICS USING MATLAB MODELLING AND EXPERIMENTAL ANALYSIS OF MOTORCYCLE DYNAMICS USING MATLAB P. Florn, P. Vrání, R. Čermá Fculy of Mechncl Engneerng, Unversy of Wes Bohem Asrc The frs pr of hs pper s devoed o mhemcl modellng

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

1.B Appendix to Chapter 1

1.B Appendix to Chapter 1 Secon.B.B Append o Chper.B. The Ordnr Clcl Here re led ome mporn concep rom he ordnr clcl. The Dervve Conder ncon o one ndependen vrble. The dervve o dened b d d lm lm.b. where he ncremen n de o n ncremen

More information

The Characterization of Jones Polynomial. for Some Knots

The Characterization of Jones Polynomial. for Some Knots Inernon Mhemc Forum,, 8, no, 9 - The Chrceron of Jones Poynom for Some Knos Mur Cncn Yuuncu Y Ünversy, Fcuy of rs nd Scences Mhemcs Deprmen, 8, n, Turkey m_cencen@yhoocom İsm Yr Non Educon Mnsry, 8, n,

More information

Numerical Simulations of Femtosecond Pulse. Propagation in Photonic Crystal Fibers. Comparative Study of the S-SSFM and RK4IP

Numerical Simulations of Femtosecond Pulse. Propagation in Photonic Crystal Fibers. Comparative Study of the S-SSFM and RK4IP Appled Mhemcl Scences Vol. 6 1 no. 117 5841 585 Numercl Smulons of Femosecond Pulse Propgon n Phoonc Crysl Fbers Comprve Sudy of he S-SSFM nd RK4IP Mourd Mhboub Scences Fculy Unversy of Tlemcen BP.119

More information

Calculus 241, section 12.2 Limits/Continuity & 12.3 Derivatives/Integrals notes by Tim Pilachowski r r r =, with a domain of real ( )

Calculus 241, section 12.2 Limits/Continuity & 12.3 Derivatives/Integrals notes by Tim Pilachowski r r r =, with a domain of real ( ) Clculu 4, econ Lm/Connuy & Devve/Inel noe y Tm Plchow, wh domn o el Wh we hve o : veco-vlued uncon, ( ) ( ) ( ) j ( ) nume nd ne o veco The uncon, nd A w done wh eul uncon ( x) nd connuy e he componen

More information

Properties of Logarithms. Solving Exponential and Logarithmic Equations. Properties of Logarithms. Properties of Logarithms. ( x)

Properties of Logarithms. Solving Exponential and Logarithmic Equations. Properties of Logarithms. Properties of Logarithms. ( x) Properies of Logrihms Solving Eponenil nd Logrihmic Equions Properies of Logrihms Produc Rule ( ) log mn = log m + log n ( ) log = log + log Properies of Logrihms Quoien Rule log m = logm logn n log7 =

More information

Jordan Journal of Physics

Jordan Journal of Physics Volume, Number, 00. pp. 47-54 RTICLE Jordn Journl of Physcs Frconl Cnoncl Qunzon of he Free Elecromgnec Lgrngn ensy E. K. Jrd, R. S. w b nd J. M. Khlfeh eprmen of Physcs, Unversy of Jordn, 94 mmn, Jordn.

More information

. The geometric multiplicity is dim[ker( λi. number of linearly independent eigenvectors associated with this eigenvalue.

. The geometric multiplicity is dim[ker( λi. number of linearly independent eigenvectors associated with this eigenvalue. Lnear Algebra Lecure # Noes We connue wh he dscusson of egenvalues, egenvecors, and dagonalzably of marces We wan o know, n parcular wha condons wll assure ha a marx can be dagonalzed and wha he obsrucons

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

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

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

. The geometric multiplicity is dim[ker( λi. A )], i.e. the number of linearly independent eigenvectors associated with this eigenvalue.

. The geometric multiplicity is dim[ker( λi. A )], i.e. the number of linearly independent eigenvectors associated with this eigenvalue. Mah E-b Lecure #0 Noes We connue wh he dscusson of egenvalues, egenvecors, and dagonalzably of marces We wan o know, n parcular wha condons wll assure ha a marx can be dagonalzed and wha he obsrucons are

More information

2.1 Constitutive Theory

2.1 Constitutive Theory Secon.. Consuve Theory.. Consuve Equaons Governng Equaons The equaons governng he behavour of maerals are (n he spaal form) dρ v & ρ + ρdv v = + ρ = Conservaon of Mass (..a) d x σ j dv dvσ + b = ρ v& +

More information

Average & instantaneous velocity and acceleration Motion with constant acceleration

Average & instantaneous velocity and acceleration Motion with constant acceleration Physics 7: Lecure Reminders Discussion nd Lb secions sr meeing ne week Fill ou Pink dd/drop form if you need o swich o differen secion h is FULL. Do i TODAY. Homework Ch. : 5, 7,, 3,, nd 6 Ch.: 6,, 3 Submission

More information

Pen Tip Position Estimation Using Least Square Sphere Fitting for Customized Attachments of Haptic Device

Pen Tip Position Estimation Using Least Square Sphere Fitting for Customized Attachments of Haptic Device for Cuomed Ahmen of Hp Deve Mno KOEDA nd Mhko KAO Deprmen of Compuer Sene Ful of Informon Sene nd Ar Ok Elero-Communon Unver Kok 30-70, Shjonwe, Ok, 575-0063, JAPA {koed, 0809@oeu.jp} Ar In h pper, mehod

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

Motion. Part 2: Constant Acceleration. Acceleration. October Lab Physics. Ms. Levine 1. Acceleration. Acceleration. Units for Acceleration.

Motion. Part 2: Constant Acceleration. Acceleration. October Lab Physics. Ms. Levine 1. Acceleration. Acceleration. Units for Acceleration. Moion Accelerion Pr : Consn Accelerion Accelerion Accelerion Accelerion is he re of chnge of velociy. = v - vo = Δv Δ ccelerion = = v - vo chnge of velociy elpsed ime Accelerion is vecor, lhough in one-dimensionl

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

Fingerprint Registration Using Centroid Structure and Line Segments 1

Fingerprint Registration Using Centroid Structure and Line Segments 1 IJCSS Inernonl Journl of Copuer Scence nd ewor Secur, VOL.6 o.3, Mrch 006 97 Fngerprn Regsron Usng Cenrod Srucure nd Lne Segens Deun Zho, Fe Su nd nn C ejng Unvers of Poss nd elecouncons, School of elecouncon

More information

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

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

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

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

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

Interval Estimation. Consider a random variable X with a mean of X. Let X be distributed as X X

Interval Estimation. Consider a random variable X with a mean of X. Let X be distributed as X X ECON 37: Ecoomercs Hypohess Tesg Iervl Esmo Wh we hve doe so fr s o udersd how we c ob esmors of ecoomcs reloshp we wsh o sudy. The queso s how comforble re we wh our esmors? We frs exme how o produce

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

1.0 Electrical Systems

1.0 Electrical Systems . Elecricl Sysems The ypes of dynmicl sysems we will e sudying cn e modeled in erms of lgeric equions, differenil equions, or inegrl equions. We will egin y looking fmilir mhemicl models of idel resisors,

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

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

Lecture 4: Trunking Theory and Grade of Service (GOS)

Lecture 4: Trunking Theory and Grade of Service (GOS) Lecure 4: Trunkng Theory nd Grde of Servce GOS 4.. Mn Problems nd Defnons n Trunkng nd GOS Mn Problems n Subscrber Servce: lmed rdo specrum # of chnnels; mny users. Prncple of Servce: Defnon: Serve user

More information

Research on Negotiation based Bargaining Strategies in e-commerce Jiang Jianhua 1,a, Zhang Guangyun 1,b, Hong Niansong 2,c

Research on Negotiation based Bargaining Strategies in e-commerce Jiang Jianhua 1,a, Zhang Guangyun 1,b, Hong Niansong 2,c Inernon Conference on Apped Scence nd Engneerng Innovon (ASEI 05) Reserch on egoon sed Brgnng Sreges n e-commerce Jng Jnhu,, Zhng Gungyun,, Hong nsong,c Coege of Compuer Engneerng, Gungdong Insue of Scence

More information

( ) ( ) ( ) ( ) ( ) ( y )

( ) ( ) ( ) ( ) ( ) ( y ) 8. Lengh of Plne Curve The mos fmous heorem in ll of mhemics is he Pyhgoren Theorem. I s formulion s he disnce formul is used o find he lenghs of line segmens in he coordine plne. In his secion you ll

More information

A Kalman filtering simulation

A Kalman filtering simulation A Klmn filering simulion The performnce of Klmn filering hs been esed on he bsis of wo differen dynmicl models, ssuming eiher moion wih consn elociy or wih consn ccelerion. The former is epeced o beer

More information

Epistemic Game Theory: Online Appendix

Epistemic Game Theory: Online Appendix Epsemc Game Theory: Onlne Appendx Edde Dekel Lucano Pomao Marcano Snscalch July 18, 2014 Prelmnares Fx a fne ype srucure T I, S, T, β I and a probably µ S T. Le T µ I, S, T µ, βµ I be a ype srucure ha

More information

Direct Current Circuits

Direct Current Circuits Eler urren (hrges n Moon) Eler urren () The ne moun of hrge h psses hrough onduor per un me ny pon. urren s defned s: Dre urren rus = dq d Eler urren s mesured n oulom s per seond or mperes. ( = /s) n

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

Mathematics 805 Final Examination Answers

Mathematics 805 Final Examination Answers . 5 poins Se he Weiersrss M-es. Mhemics 85 Finl Eminion Answers Answer: Suppose h A R, nd f n : A R. Suppose furher h f n M n for ll A, nd h Mn converges. Then f n converges uniformly on A.. 5 poins Se

More information

Macroscopic quantum effects generated by the acoustic wave in a molecular magnet

Macroscopic quantum effects generated by the acoustic wave in a molecular magnet Cudnovsky-Fes-09034 Mcroscopc qunum effecs genered by e cousc wve n moleculr mgne Gwng-Hee Km ejong Unv., Kore Eugene M. Cudnovksy Lemn College, CUNY Acknowledgemens D. A. Grnn Lemn College, CUNY Oulne

More information

1. Consider a PSA initially at rest in the beginning of the left-hand end of a long ISS corridor. Assume xo = 0 on the left end of the ISS corridor.

1. Consider a PSA initially at rest in the beginning of the left-hand end of a long ISS corridor. Assume xo = 0 on the left end of the ISS corridor. In Eercise 1, use sndrd recngulr Cresin coordine sysem. Le ime be represened long he horizonl is. Assume ll ccelerions nd decelerions re consn. 1. Consider PSA iniilly res in he beginning of he lef-hnd

More information

An Intelligent Agent Negotiation Strategy in the Electronic Marketplace Environment

An Intelligent Agent Negotiation Strategy in the Electronic Marketplace Environment An Inellgen Agen Negoon regy n he Elecronc Mreplce Envronmen Mlm Lou, Ionn Rouss, Lmbros Pechlvnos 3 Technologcl Educonl Insue of Wesern Mcedon, Deprmen of Busness Admnsron, Kol, Kozn 5, GREECE e-ml: lou@elecom.nu.gr

More information

Tighter Bounds for Multi-Armed Bandits with Expert Advice

Tighter Bounds for Multi-Armed Bandits with Expert Advice Tgher Bounds for Mul-Armed Bnds wh Exper Advce H. Brendn McMhn nd Mhew Sreeer Google, Inc. Psburgh, PA 523, USA Absrc Bnd problems re clssc wy of formulng exploron versus exploon rdeoffs. Auer e l. [ACBFS02]

More information

Discrete Markov Process. Introduction. Example: Balls and Urns. Stochastic Automaton. INTRODUCTION TO Machine Learning 3rd Edition

Discrete Markov Process. Introduction. Example: Balls and Urns. Stochastic Automaton. INTRODUCTION TO Machine Learning 3rd Edition EHEM ALPAYDI he MI Press, 04 Lecure Sldes for IRODUCIO O Machne Learnng 3rd Edon alpaydn@boun.edu.r hp://www.cmpe.boun.edu.r/~ehem/ml3e Sldes from exboo resource page. Slghly eded and wh addonal examples

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

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

Review: Transformations. Transformations - Viewing. Transformations - Modeling. world CAMERA OBJECT WORLD CSE 681 CSE 681 CSE 681 CSE 681

Review: Transformations. Transformations - Viewing. Transformations - Modeling. world CAMERA OBJECT WORLD CSE 681 CSE 681 CSE 681 CSE 681 Revew: Trnsforons Trnsforons Modelng rnsforons buld cople odels b posonng (rnsforng sple coponens relve o ech oher ewng rnsforons plcng vrul cer n he world rnsforon fro world coordnes o cer coordnes Perspecve

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

CH.3. COMPATIBILITY EQUATIONS. Continuum Mechanics Course (MMC) - ETSECCPB - UPC

CH.3. COMPATIBILITY EQUATIONS. Continuum Mechanics Course (MMC) - ETSECCPB - UPC CH.3. COMPATIBILITY EQUATIONS Connuum Mechancs Course (MMC) - ETSECCPB - UPC Overvew Compably Condons Compably Equaons of a Poenal Vecor Feld Compably Condons for Infnesmal Srans Inegraon of he Infnesmal

More information

Integral Equations and their Relationship to Differential Equations with Initial Conditions

Integral Equations and their Relationship to Differential Equations with Initial Conditions Scece Refleco SR Vol 6 wwwscecereflecocom Geerl Leers Mhemcs GLM 6 3-3 Geerl Leers Mhemcs GLM Wese: hp://wwwscecereflecocom/geerl-leers--mhemcs/ Geerl Leers Mhemcs Scece Refleco Iegrl Equos d her Reloshp

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

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

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