Boosting Margin Based Distance Functions for Clustering
|
|
- Cora Reed
- 5 years ago
- Views:
Transcription
1 Boostn Mrn Bs Dstn Funtons or Clustrn Tomr Hrtz Aron Br-Hlll Dpn Wnsll Sool o Computr Sn n Ennrn n t Cntr or Nurl Computton, T Hrw Unvrsty o Jruslm, Jruslm, Isrl Astrt T prormn o rp s lustrn mtos rtlly pns on t qulty o t stn unton, us to omput smlrts twn prs o norn nos. In ts ppr w lrn stn untons y trnn nry lssrs wt mrns. T lssrs r n ovr t prout sp o prs o ponts n r trn to stnus wtr two ponts om rom t sm lss or not. T sn mrn s us s t stn vlu. Our mn ontruton s stn lrnn mto (DstBoost), w omns oostn ypotss ovr t prout sp wt wk lrnr s on prttonn t ornl tur sp. E wk ypotss s Gussn mxtur mol omput usn sm-suprvs onstrn EM lortm, w s trn usn ot unll n ll t. W lso onsr SVM n son trs oostn s mrn s lssrs n t prout sp. W xprmntlly ompr t mrn s stn untons wt otr xstn mtr lrnn mtos, n wt xstn tnqus or t rt norporton o onstrnts nto vrous lustrn lortms. Clustrn prormn s msur on som nmrk tss rom t UCI rpostory, smpl rom t MNIST ts, n t st o olor ms o nmls. In most ss t DstBoost lortm snntly n roustly outprorm ts ompttors. 1. Introuton Grp s lustrn mtos v n wly n sussully us n mny omns su s omputr vson, onormts n xplortory t nlyss. Ts tory spns w rn o lortms, rom lssl lomr- Prlmnry work. Unr rvw y t Intrntonl Conrn on Mn Lrnn (ICML). Do not strut. tv mtos su s vr lnk (Du t l., 2001), to t rntly vlop n mor sopstt sptrl mtos (S & Mlk, 2000) n stost ormultons (Bltt t l., 1997; Glyu t l., 2001). T ntl rprsntton n ll ts mtos s mtrx (or rp) o stns twn ll prs o tponts. T omputton o ts stn mtrx s onsr prprossn stp, n typlly on uss som norm on t tur sp (or rlt vrnt). Dspt t mportnt rns twn t vrous rp-s lustrn lortms, t s wly knowl tt lustrn prormn rtlly pns on t qulty o t stn unton us. Otn t qulty o t stn unton s mor mportnt tn t sps o t lustrn lortm. In ts ppr w ous on t quston o ow to lrn oo stn unton, w wll l to mprov lustrn. Our mn ontruton s DstBoost - novl sm-suprvs lortm or lrnn stn untons. W onsr sm-suprvs lustrn snro n w t t s umnt y som sprs s normton, n t orm o quvln onstrnts. Equvln onstrnts r rltons twn prs o t ponts, w nt wtr t ponts lon to t sm tory or not. W trm onstrnt postv wn t ponts r known to rom t sm lss, n ntv otrws. Su onstrnts rry lss normton tn xplt lls on t ornl tponts, sn lrly quvln onstrnts n otn rom xplt lls ut not v vrs. Mor mportntly, t s n sust tt n som ss quvln onstrnts r sr to otn, splly wn t ts s vry lr n ontns lr numr o tors wtout pr-n nms (Hrtz t l., 2003). In rnt yrs tr s n rown ntrst n sm suprvs lustrn snros, ln to two rnt (n rlt) lns o rsr. In t rst, t onstrnts r norport rtly nto t lustrn lortm, lmtn t lustrn solutons onsr to tos tt omply wt t vn onstrnts. Exmpls r t onstrn omplt lnk lortm (Kln t l., 2002), onstrn K-mns (Wst t l., 2001) n on-
2 strn EM o Gussn mxtur (Sntl t l., 2003). T son ln o rsr, to w ts work lons, uss t onstrnts to lrn n normtv stn unton (pror to lustrn). Most o t work n ts r s ous on t lrnn o Mlnos stn untons o t orm (Sntl t l., 2002; Xn t l., 2002). In ts pprs t prmtr Mlnos mtr ws us n omnton wt som sutl prmtr lustrn lortm, su s K-mns or EM o mxtur o Gussns. In ontrst, w vlop n ts ppr mto tt lrns non-prmtr stn unton, w n mor nturlly us n non-prmtr rp s lustrn. Mor ormlly, lt not t ornl t sp, n ssum tt t t s smpl rom srt lls. Our ol s to lrn stn unton!. 1 Our ky osrvton s tt w n lrn su unton, y posn rlt nry lsston prolm ovr t prout sp "#, n solvn t usn mrn s lsston tnqus. T nry prolm s t prolm o stnusn twn prs o ponts tt lon to t sm lss n prs o ponts tt lon to rnt lsss. 2 T trnn t nlu st o quvln onstrnts, w n ormlly rr s nry lls on ponts n $%. I w ll prs o ponts rom t sm lss y n prs o ponts lonn to rnt lsss y, w n ntrprt t lssr s mrn s t rqur stn unton. Hvn ru stn lrnn to nry lsston wt mrns, w n now ttmpt to solv ts prolm usn stnr powrul mrn s lssrs. W v xplor ot support vtor mns (SVM s) n oostn lortms. Howvr, xprmnts wt svrl SVM vrnts n son trs(c4.5) oostn v l us to ronz tt t sp lsston prolm w r ntrst n s som unqu turs w rqur spl trtmnt: 1. T prout sp nry unton w ws to lrn s som unqu strutur w my l to unnturl prttons o t sp twn t lls. T onpt w ws to lrn s n ntor o n quvln rlton ovr t ornl sp. Tus t proprts o trnstvty n symmtry o t rlton pl omtrl onstrnts on t nry ypotss. Ovously, trtonl mls o ypotss, su s lnr sprtors or son trs, r not lmt to 1 Not tt ts unton s not nssrly mtr, s t trnl nqulty my not ol. 2 Not tt ts prolm s losly rlt to t mult lss lsston prolm: w n orrtly nrt nry prtton o t t n prout sp, w mpltly n mult-lss lssr n t ornl vtor sp &. quvln rlton ntors, n t s not sy to nor ts onstrnts wn su lssrs r us. 2. In t lrnn sttn w v sr ov, w r prov wt ' tponts n n wt sprs st o quvln onstrnts (or lls n prout sp) ovr som prs o ponts n our t. W ssum tt t numr o quvln onstrnts prov s mu smllr tn t totl numr o quvln onstrnts () *',+-, n s o orr () '. W tror v ss to lr mounts o unll t, n n sm-suprvs lrnn sms lk n ttrtv opton. Howvr, lssl nry lssrs lk SVM n oostn mtos r trn usn ll t only. Ts onsrtons l us to vlop t DstBoost lortm, w s our mn ontruton n ts ppr. DstBoost s stn lrnn lortm w ttmpts to rss t ssus suss ov. It lrns stn unton w s s on oostn nry lssrs wt onn ntrvl n prout sp, usn wk lrnr tt lrns n t ornl tur sp (n not n prout sp). W sust oostn sm tt norports unll t ponts. Ts unll ponts prov nsty pror, n tr wts rply y urn t oostn pross. T wk lrnr w us s s on onstrn Exptton Mxmzton (EM) lortm, w omputs Gussn mxtur mol, n n provs prtton o t ornl sp. T onstrn EM prour uss unll t n quvln onstrnts to n Gussn mxtur tt ompls wt tm. A wk prout sp ypotss s tn orm s t quvln rlton o t omput prtton. W v xprmnt wt DstBoost n onut svrl mprl omprsons o ntrst. T rst s omprson o DstBoost to otr mrn s stn untons otn usn t mor trtonl lortms o SVM n son tr oostn. Anotr omprson s twn DstBoost n prvously sust stn lrnn lortms w r s on Mlnos mtr stmton. Fnlly, lustrn usn t stn unton lrnt y DstBoost s ompr to prvously sust mtos o norportn quvln onstrnts rtly nto lustrn lortms. Durn t omprtv ssssmnt DstBoost ws vlut wt svrl lomrtv lustrn lortms n wt rnt mounts o quvln onstrnts normton. W us svrl tsts rom t UCI rpostory (Blk & Mrz, 1998), A smpl rom t MNIST tst (LCun t l., 1998), n tst o nturl ms otn rom ommrl m CD. In most o our xprmnts t DstBoost mto outprorm ts ompttors.
3 2. Boostn ornl sp prttons usn DstBoost T DstBoost lortm uls stn untons s on t wt mjorty vot o st o ornl sp sot prttons. T wk lrnr s tsk n ts rmwork s to n plusl prttons o t sp, w omply wt t vn quvln onstrnts. In ts tsk, t unll t n o onsrl lp, s t llows to n pror on wt r plusl prttons. In orr to norport t unll t nto t oostn pross, w umnt t Aoost wt onn ntrvls prsnt n (Spr & Snr, 1999). T tls o ts umntton r prsnt n Ston 2.1. T tls o t wk lrnr w us r prsnt n Ston Sm suprvs oostn n prout sp Our oostn sm s n xtnson o t Aoost lortm wt onn ntrvls (Spr & Snr, 1999; Spr t l., 1997) to nl unsuprvs t ponts. As n Aoost, w us t oostn pross to mxmz t mrns o t ll ponts. T unll ponts only prov yn nsty pror or t wk lrnr. T lortm w us s skt n F. 1. Gvn prtlly ll tst wr, t lortm srs or ypotss w mnmzs t ollown loss unton:! "$#%'&(*),+ * - (1) Not tt t unll ponts o not ontrut to t mnmzton ojtv (1). Rtr, t oostn roun ty r vn to t wk lrnr n supply t wt som (opully usul) normton rrn t omn s nsty. T unll ponts tvly onstrn t sr sp urn t wk lrnr stmton, vn prorty to ypotss w ot omply wt t prws onstrnts n wt t nsty normton. Sn t wk lrnr s tsk oms rr n ltr oostn rouns, t oostn lortm slowly rus t wt o t unll ponts vn to t wk lrnr. Ts s ompls n stp 4 o t lortm (s F. 1). In prout sp tr r () '+- unll ponts, w orrspon to ll t possl prs o ornl ponts, n t numr o wts s tror () *',+. Howvr, t upt ruls or t wt o unll pont r ntl, n so ll t unll ponts n sr t sm wt. Hn t numr o upts w tvly o n roun s proportonl to t numr o ll prs only. T wt o t unll prs s urnt to Alortm 1 Boostn wt unll t Gvn / *2 43$ 5 6 Intlz7 8 :9:;<8= >.. '; For? >.. '@ 1. Trn wk lrnr usn struton7ba 2. Gt wk ypotss A C3! wt D A 1 7EA 8 A 8 GF. I no su ypotss n oun, trmnt t loop n st@hi?. 3. Coos A= NMPO +KJ0L #QO 4. Upt: 7RA M! 8 TS 7RAU8 (*),+ A A 5 7RAU8 (*),+ A V 5. Normlz: 7EA M 8 KH7RA M! 8 W9>XYA M! wrx=a M 1 7EA MU8 6. Output t nl ypotss A A A y t lst s st s t wt o ny ll pr. Ts mmtly ollows rom t upt rul n stp 4 o t lortm (F. 1), s unll pr s trt s ll pr wt mxml mrn o 1. W not n pssn tt t s possl to norport unll t nto t oostn pross tsl, s s n sust n ( Al Bu t l., 2002; Grnvlt t l., 2001). In ts work t mrn onpt ws xtn to unll t ponts. T mrn or su pont s postv numr rlt to t onn t ypotss s n lssyn ts pont. T lortm tn trs to mnmz t totl (ot ll n unll) mrn ost. T prolm wt ts rmwork s tt ypotss n vry rtn out t lsston o unll ponts, n n v low mrn osts, vn wn t lsss ts ponts norrtly. In t sm suprvs lustrn ontxt t totl mrn ost my omnt y t mrns o unonstrn pont prs, n n mnmzn t osn t nssrly l to ypotss tt omply wt t onstrnts. In, w v mprlly tst som vrnts o ts lortms n oun tt ty l to nror prormn Mxturs o Gussns s wk ypotss T wk lrnr n DstBoost s s on t onstrn EM lortm prsnt y (Sntl t l., 2003). Ts l-
4 X 1 $ ortm lrns mxtur o Gussns ovr t ornl t sp, usn unll t n st o postv n ntv onstrnts. Blow w rly rvw t s lortm, n tn sow ow t n mo to norport wts on smpl t ponts. W lso sr ow to trnslt t oostn wts rom prout sp ponts to ornl t ponts, n ow to xtrt prout sp ypotss rom t sot prtton oun y t EM lortm. A Gussn mxtur mol (GMM) s prmtr sttstl mol w ssums tt t t ornts rom wt sum o svrl Gussn sours. Mor ormlly, GMM s vn y, wr nots t wt o Gussn, ts rsptv prmtrs, n nots t numr o Gussn sours n t GMM. EM s wly us mto or stmtn t prmtr st o t mol ( ) usn unll t (Dmpstr t l., 1977). In t onstrn EM lortm quvln onstrnts r ntrou nto t E (Exptton) stp, su tt t xptton s tkn only ovr ssnmnts w omply wt t vn onstrnts (nst o summn ovr ll possl ssnmnts o t ponts to sours). Assum w r vn st o unll... smpl ponts3 < N, n st o prws onstrnts ovr ts ponts. Dnot t nx prs o postvly onstrn ponts y + 6 n t nx prs o ntvly onstrn ponts y U; '; +. T GMM mol ontns st o srt n vrls, wr t Gussn sour o pont Q s trmn y t n vrl. T onstrn EM lortm ssums t ollown jont struton o t osrvls 3 n t ns : 3 = (2) 0!! T lortm sks to mxmz t t lkloo, w s t mrnl struton o (2) wt rspt to. T quvln onstrnts rt omplx pnns twn t n vrls o rnt t ponts. Howvr, t jont struton n xprss usn Mrkov ntwork, s sn n F. 1. In t E stp o t lortm t prolts 3 r omput y pplyn stnr nrn lortm to t ntwork. Su nrn s sl t numr o ntv onstrnts s () *',, n t ntwork s sprsly onnt. T mol prmtrs r tn upt s on t omput prolts. T upt o t Gussn prmtrs n on n los orm, usn ruls smlr to t stnr EM upt ruls. T upt o t lustr wts! s mor omplt, sn ts prmtrs ppr n t normlzton onstnt X n (2), n t soluton s oun Fur 1. A Mrkov ntwork rprsntton o t onstrn mxtur sttn. E osrvl t no s srt n no s ts nstor. Postvly onstrn nos v t sm n no s tr nstor. Ntv onstrnts r xprss usn s twn t n nos o ntvly onstrn ponts.hr ponts 2,3,4 r onstrn to totr, n pont 1 s onstrn to rom rnt lss. wt rnt snt prour. T lortm ns lol mxmum o t lkloo, ut t prtton oun s not urnt to stsy ny sp onstrnt. Howvr, sn t oostn prour nrss t wts o ponts w lon to unsts quvln onstrnts, t s most lkly tt ny onstrnt wll sts n on or mor prttons. W v norport wts nto t onstrn EM prour orn to t ollown smnts: T lortm s prsnt wt vrtul smpl o sz '#". A trnn pont wt wt $ pprs $ '%" tms n ts smpl. All t rpt tokns o t sm pont r onsr to postvly onstrn, n r tror ssn to t sm sour n vry vluton n t E stp. In ll o our xprmnts w v st ' " to t tul smpl sz. Wl t wk lrnr pts struton ovr t ornl sp ponts, t oostn pross sr n 2.1 nrts struton ovr t smpl prout sp n roun. T prout sp struton s onvrt to struton ovr t smpl ponts y smpl mrnlzton. Splly, not y $ t wt o pru8 '& ; t wt $)( o pont s n to $ ( (3) In roun, t mxtur mol omput y t onstrn EM s us to ul nry unton ovr t prout sp n onn msur. W rst rv prtton o t t rom t Mxmum A Postror (MAP) ssnmnt o ponts. A nry prout sp ypotss s tn n y vn t vlu to prs o ponts rom t sm Gussn sour, n to prs o ponts rom rnt sours. Ts vlu trmns t sn o t ypotss output. Ts sttn urtr supports nturl onn msur - t prolty o t pr s
5 ) ) MAP ssnmnt w s: H8 + I8 + wr + r t n vrls tt to t two ponts. T wk ypotss output s t sn onn msur n!, n so t wk ypotss n vw s wk stn unton. 3. Lrnn n t prout sp usn trtonl lssrs W v tr to solv t stn lrnn prolm ovr t prout sp usn two mor trtonl mrn s lssrs. T rst s support vtor mn, tt trs to n lnr sprtor twn t t xmpls n mnsonl tur sp. T son s t ABoost lortm, wr t wk ypotss r son trs lrnt usn t C4.5 lortm. Bot lortms to sltly pt to t tsk o prout sp lrnn, n w v mprlly tst possl pttons usn t sts rom t UCI rpostory. Splly, w to l wt t ollown tnl ssus: Prout sp rprsntton: A pr o ornl sp ponts must onvrt nto snl pont, w rprsnts ts pr n t prout sp. T smplst rprsntton s t ontnton o t two ponts. Anotr ntutv rprsntton s t ontnton o t sum n rn vtors o t two ponts. Our mprl tsts nt tt wl SVM works ttr wt t rst rprsntton, t C4.5 oostn vs ts st prormn wt t sum n rn rprsntton. Enorn symmtry: I w wnt to lrn symmtr stn unton stsyn C, w v to xpltly nor ts proprty. Wt t rst rprsntton ts n on smply y ouln t numr o trnn ponts, ntroun onstrn pr tw: s t pont! n s t pont!. In ts sttn t SVM lortm ns t lol optmum o symmtr Lrnn n t soluton s urnt to symmtr. Wt t son rprsntton w oun tt moyn t rprsntton to symmtrlly nvrnt v t st rsults. Splly, w rprsnt pr o ponts /8 ;!, wr usn t vtor Q r t rst oornts o t ponts. W onsr two lnr prprossn trnsormtons o t ornl t or rtn t prout sp ponts: t wtnn trnsormton, n t RCA trnsormton (Br-Hll t l., 2003) w uss postv quvln onstrnts. In nrl w oun tt pr-prossn wt RCA ws most nl or ot t SVM n C4.5 oostn lortms. Prmtr tunn: or t SVM w us t polynoml krnl o orr 4, n tr-o onstnt o 1 twn rror n mrn. T oostn lortm ws run or rouns (pnn on t tst), n t son trs wr ult wt stoppn rtron o trn rror smllr tn 0.05 n l. T lustrn prormn otn usn ts two vrnts s ompr to DstBoost n ston 4. T sn ssus mnton ov wr s on t prormn ovr t UCI tsts, n t sttns rmn x or t rst o t xprmnts. 4. Exprmntl Rsults W ompr our DstBoost lortm wt otr tnqus or sm-suprvs lustrn usn quvln onstrnts. W us ot stn lrnn tnqus, nlun our two smplr vrnts or lrnn n prout sp (SVM n oostn son trs), n onstrn lustrn tnqus. W n y ntroun our xprmntl stup n t vlut mtos. Tn w prsnt t rsults o ll ts mtos on svrl tsts rom t UCI rpostory, sust o t MNIST lttr ronton tst, n n nml m ts Exprmntl stup Gtrn quvln onstrnts: Follown (Hrtz t l., 2003), w smult strut lrnn snro, wr lls r prov y numr o unoornt npnnt trs. Aornly, w rnomly os smll susts o t ponts rom t tst n prtton o t susts nto quvln lsss. T onstrnts otn rom ll t susts r tr n us y t vrous lortms. T sz o sust n ts xprmnts ws osn to, wr s t numr o lsss n t t. In xprmnt w us susts, n t mount o prtl normton ws ontroll y t onstrnt nx ; ts nx msurs t mount o ponts w prtpt n t lst on onstrnt. In our xprmnts w us.. Howvr, t s mportnt to not tt t numr o quvln onstrnts tus prov typlly nlus only smll sust o ll possl prs o tponts, w s ',+-. Evlut Mtos: w ompr t lustrn prormn o t ollown tnqus: 1. Our propos oostn lortm (DstBoost).
6 2. Mlnos stn lrnn wt Rlvnt Componnt Anlyss (RCA) (Br-Hll t l., 2003). 3. Mlnos stn lrnn wt non-lnr optmzton (Xn) (Xn t l., 2002). 4. Mrn s stn lrnn usn SVM s prout sp lrnr (SVM) (sr n Ston 3). 5. Mrn s stn lrnn usn prout sp son trs oostn (DToost). 6. Constrn EM o Gussn Mxtur Mol (Constrn EM) (Sntl t l., 2003). 7. Constrn Complt Lnk (Constrn Complt Lnk) (Kln t l., 2002). 8. Constrn K-mns (COP K-mns) (Wst t l., 2001). Mtos 1-5 omput stn unton, n ty r vlut y pplyn stnr lomrtv lustrn lortm (Wr) to t stn rp ty nu. Mtos 6-8 norport quvln onstrnts rtly nto t lustrn pross. All mtos wr vlut y lustrn t t n msurn t sor n s (4) wr nots prson n nots rll. For t stn lrnn tnqus w lso sow umultv nor purty urvs. Cumultv nor purty msurs t prnt o orrt nors up to t nor, vr ovr ll t tponts. In xprmnt w vr t rsults ovr 50 or mor rnt quvln onstrnt rlztons. Bot DstBoost n t son tr oostn lortms wr run or onstnt numr o oostn (pnn on t tst). In rlzton ll t lortms wr vn t xt sm quvln onstrnts. Dmnsonlty ruton: t onstrn LDA lortm Som o t tsts rs n mnsonl sp, w must ru n orr to prorm prmtr stmton rom trnn t. W us two mtos or mnsonlty ruton: stnr Prnpl Componnts Anlyss (PCA), n onstrn Lnr Dsrmnnt Anlyss (LDA) lortm w s s on quvln onstrnts. Clssl LDA (lso ll FDA, (Fukun, 1990)) omputs projton rtons tt mnmz t wtn-lss sttr n mxmz t twn-lss sttr. Mor ormlly, vn ll tst wr -t >.. n G, LDA s vn y t mtrx tt mxmzs QA wr A nots t totl sttr mtrx ( # nots t wtn- s t t s mprl mn) n lss sttr mtrx ( s t mprl mn o t & -t lss). Sn n our sm-suprvs lrnn snro w v ss to quvln onstrnts nst o lls, w n wrt own onstrn LDA lortm. Tus w stmt t wtn lss sttr mtrx usn postv quvln onstrnts nst o lls. Splly, vn st o postv quvln onstrnts, w us trnstv losur ovr ts st to otn smll susts o ponts tt r known to lon to t sm lss. Dnot ts susts y #%, wr sust s ompos o vrl numr o t ponts - + >.. 1. W us ts susts to stmt s ollows # 0! (5) (6) wr r nots t mn o sust Rsults on UCI tsts W slt svrl tsts rom t UCI t rpostory n us t xprmntl stup ov to vlut t vrous mtos. F. 2 sows lustrn sor plots or svrl t sts usn Wr s lomrtv lustrn lortm. Clrly DstBoost vs snnt mprovmnts ovr Mlnos s stn msurs n otr prout sp lrnn mtos. Comprn DstBoost to mtos w norport onstrnts rtly, lrly t only tru ompttor o DstBoost s ts own wk lrnr, t onstrn EM lortm. Stll, n t vst mjorty o ss DstBoost vs n tonl snnt mprovmnt ovr t EM Rsults on t MNIST lttr ronton tst W ompr ll lustrn mtos on sust o t MNIST lttr ronton tst (LCun t l., 1998). W rnomly slt trnn smpls ( rom o t lsss). T ornl t mnson ws!, w ws projt y stnr PCA to t rst prnpl mnsons. W tn urtr projt t t usn t onstrn LDA lortm to! mnsons. Clustrn n nor purty plots r prsnt on t lt s o F 3. T lustrn prormn o t DstBoost lortm s snntly ttr tn t otr mtos. T
7 protn onospr 1 ln oston Fur 2. Clustrn sor ovr 4 t sts rom t UCI rpostory usn Wr s lustrn lortm. Mtos sown r: () Euln, () RCA, () onstrn EM, () SVM, () DToost, () DstBoost, () Xn, () Constrn Complt Lnk, () Constrn K-mns. T rsults wr vr ovr 100 rlztons o onstrnts, n 1-st rror rs r sown. T onstrnt nx ws n ll ss. umultv purty urvs sust tt ts suss my rlt to t slowr y o t nor purty sors or DstBoost Rsults on Anml m tst W rt n m ts w ontn ms o nmls tkn rom ommrl m CD, n tr to lustr tm s on olor turs. T lustrn tsk n ts s s mu rr tn n t prvous ppltons. T ts ontn 10 lsss wt totl o 565 ms. F. 3 sows w xmpls o ms rom t ts. T ornl ms wr vly omprss jp ms. T ms wr rprsnt usn Color Corn Vtors (Pss t l., 1996) (CCV s). Ts rprsntton xtns t olor storm rprsntton, y pturn som ru sptl proprts o t olor struton n n m. Splly, n CCV vtor storm n s v nto two ns, rprsntn t numr o Cornt n Non-Cornt pxls rom olor. Cornt pxls r pxls wos noroo ontns mor tn nors w v t sm olor. W rprsnt t ms n HSV olor sp, quntz t ms to R olor ns, n omput t CCV o m -!. 3 mnsonl vtor - usn In orr to ru t mnson o our t, w rst rmov ll zro mnsons n tn us t rst PCA mnsons, ollow y Constrn LDA to urtr ru t mnson o t t to!. T lustrn rsults n nor purty rps r prsnt on t rt s o F 3. 4 T ulty o t tsk s wll rlt n t low lustrn sors o ll t mtos. 3 T stnr stn msur us on CCV turs s C-squr stn (lso ommonly us to msur stn twn storms). W lso tr to lustr t t usn t C-squr stns, n t sor otn ws. 4 On ts tst t COP k-mns lortm only onvr o ts runs. on Howvr, DstBoost stll outprorms ts ompttors, s t n ll prvous xmpls. 5. Dsusson In ts ppr, w v sr DstBoost - novl lortm w lrns stn untons tt nn lustrn prormn usn sprs s normton. Our xtnsv omprsons sow t vnt o our mto ovr mny omptn mtos or lrnn stn untons n or lustrn usn quvln onstrnts. Anotr pplton w w v not xplor r, s nrst nor lsston. Nrst nor lsston lso rtlly pns on t stn unton twn tponts; our op s tt stn untons lrn rom quvln onstrnts n lso us or mprovn nrst nor lsston. Rrns Br-Hll, A., Hrtz, T., Sntl, N., & Wnsll, D. (2003). Lrnn stn untons usn quvln rltons. Blk, C., & Mrz, C. (1998). UCI rpostory o mn lrnn tss. Bltt, M., Wsmn, S., & Domny, E. (1997). Dt lustrn usn mol rnulr mnt. Nurl Computton, 9, Al Bu, F., Grnvlt, Y., & Amros, C. (2002). Sm-suprvs mrnoost. Dmpstr, A. P., Lr, N. M., & Run, D. B. (1977). Mxmum lkloo rom nomplt t v t EM lortm. JRSSB, 39, Du, R. O., Hrt, P. E., & Stork, D. G. (2001). Pttrn Clsston. Jon Wly n Sons In. Fukun, K. (1990). Sttstl pttrn ronton. Sn Do: Am Prss. 2n ton.
8 0.9 Mnst CCV Mnst 0.9 CCV % o orrt nors 0.9 % o orrt nors Numr o nors Numr o nors Fur 3. Top Clustrn rsults usn Wr s lortm on sust o t MNIST tst (500 tponts, 10 lsss) n on t nml olor m ts (565 ms, 10 lsss). Bottom: Cumultv nor purty rps on t sm tsts. Mtos sown r: () Euln, () RCA, () onstrn EM, () SVM, () DToost, () DstBoost, () Xn, () Constrn Complt Lnk, () Constrn K-mns. Rsults wr vr ovr 50 rlztons. T onstrnt nx s 1 n ll ss. Glyu, Y., Wnsll, D., & Wrmn., M. (2001). Sl ornzton n vson: stost lustrn or m smntton, prptul roupn, n m ts ornzton. Grnvlt, Y., Al Bu, F., & Amros, C. (2001). Boostn mxtur mols or sm suprvs lrnn. Hrtz, T., Br-Hlll, A., Sntl, N., & Wnsll, D. (2003). Ennn m n vo rtrvl: Lrnn v quvln onstrnts. IEEE Con. on Computr Vson n Pttrn Ronton, Mson WI, Jun Kln, D., Kmvr, S., & Mnnn, C. (2002). From nstn-lvl onstrnts to sp-lvl onstrnts: Mkn t most o pror knowl n t lustrn. LCun, Y., Bottou, L., Bno, Y., & Hnr, P. (1998). Grnt-s lrnn ppl to oumnt ronton. Prons o t IEEE, 86, Pss, G., Z, R., & Mllr, J. (1996). Comprn ms usn olor orn vtors. ACM Multm (pp ). Spr, R. E., Frun, Y., Brtltt, P., & L, W. S. (1997). Boostn t mrn: nw xplnton or t tvnss o votn mtos. Pro. 14t Intrntonl Conrn on Mn Lrnn (pp ). Morn Kumnn. Spr, R. E., & Snr, Y. (1999). Improv oostn usn onn-rt prtons. Mn Lrnn, 37, Sntl, N., Hrtz, T., Br-Hll, A., & Wnsll, D. (2003). Computn ussn mxtur mols wt EM usn quvln onstrnts. Sntl, N., Hrtz, T., Wnsll, D., & Pvl, M. (2002). Ajustmnt lrnn n rlvnt omponnt nlyss. Computr Vson - ECCV. S, J., & Mlk, J. (2000). Normlz uts n m smntton. IEEE Trnstons on Pttrn Anlyss n Mn Intlln, 22, Wst, K., Cr, C., Rors, S., & Srol, S. (2001). Constrn K-mns lustrn wt kroun knowl. Pro. 18t Intrntonl Con. on Mn Lrnn (pp ). Morn Kumnn, Sn Frnso, CA. Xn, E., N, A., Jorn, M., & Russll, S. (2002). Dstn mtr lrnn wt pplton to lustrn wt s-normton. Avns n Nurl Inormton Prossn Systms. T MIT Prss.
5/1/2018. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees
/1/018 W usully no strns y ssnn -lnt os to ll rtrs n t lpt (or mpl, 8-t on n ASCII). Howvr, rnt rtrs our wt rnt rquns, w n sv mmory n ru trnsmttl tm y usn vrl-lnt non. T s to ssn sortr os to rtrs tt our
More informationWeighted Graphs. Weighted graphs may be either directed or undirected.
1 In mny ppltons, o rp s n ssot numrl vlu, ll wt. Usully, t wts r nonntv ntrs. Wt rps my tr rt or unrt. T wt o n s otn rrr to s t "ost" o t. In ppltons, t wt my msur o t lnt o rout, t pty o ln, t nry rqur
More informationLecture 20: Minimum Spanning Trees (CLRS 23)
Ltur 0: Mnmum Spnnn Trs (CLRS 3) Jun, 00 Grps Lst tm w n (wt) rps (unrt/rt) n ntrou s rp voulry (vrtx,, r, pt, onnt omponnts,... ) W lso suss jny lst n jny mtrx rprsntton W wll us jny lst rprsntton unlss
More informationDepth First Search. Yufei Tao. Department of Computer Science and Engineering Chinese University of Hong Kong
Dprtmnt o Computr Sn n Ennrn Cns Unvrsty o Hon Kon W v lry lrn rt rst sr (BFS). Toy, w wll suss ts sstr vrson : t pt rst sr (DFS) lortm. Our susson wll on n ous on rt rps, us t xtnson to unrt rps s strtorwr.
More informationThe University of Sydney MATH 2009
T Unvrsty o Syny MATH 2009 APH THEOY Tutorl 7 Solutons 2004 1. Lt t sonnt plnr rp sown. Drw ts ul, n t ul o t ul ( ). Sow tt s sonnt plnr rp, tn s onnt. Du tt ( ) s not somorp to. ( ) A onnt rp s on n
More informationDivided. diamonds. Mimic the look of facets in a bracelet that s deceptively deep RIGHT-ANGLE WEAVE. designed by Peggy Brinkman Matteliano
RIGHT-ANGLE WEAVE Dv mons Mm t look o ts n rlt tt s ptvly p sn y Py Brnkmn Mttlno Dv your mons nto trnls o two or our olors. FCT-SCON0216_BNB66 2012 Klm Pulsn Co. Ts mtrl my not rprou n ny orm wtout prmsson
More informationImproving Union. Implementation. Union-by-size Code. Union-by-Size Find Analysis. Path Compression! Improving Find find(e)
POW CSE 36: Dt Struturs Top #10 T Dynm (Equvln) Duo: Unon-y-Sz & Pt Comprsson Wk!! Luk MDowll Summr Qurtr 003 M! ZING Wt s Goo Mz? Mz Construton lortm Gvn: ollton o rooms V Conntons twn t rooms (ntlly
More informationCMSC 451: Lecture 4 Bridges and 2-Edge Connectivity Thursday, Sep 7, 2017
Rn: Not ovr n or rns. CMSC 451: Ltr 4 Brs n 2-E Conntvty Trsy, Sp 7, 2017 Hr-Orr Grp Conntvty: (T ollown mtrl ppls only to nrt rps!) Lt G = (V, E) n onnt nrt rp. W otn ssm tt or rps r onnt, t somtms t
More informationCMPS 2200 Fall Graphs. Carola Wenk. Slides courtesy of Charles Leiserson with changes and additions by Carola Wenk
CMPS 2200 Fll 2017 Grps Crol Wnk Sls ourtsy o Crls Lsrson wt ns n tons y Crol Wnk 10/23/17 CMPS 2200 Intro. to Alortms 1 Grps Dnton. A rt rp (rp) G = (V, E) s n orr pr onsstn o st V o vrts (snulr: vrtx),
More information4.1 Interval Scheduling. Chapter 4. Greedy Algorithms. Interval Scheduling: Greedy Algorithms. Interval Scheduling. Interval scheduling.
Cptr 4 4 Intrvl Suln Gry Alortms Sls y Kvn Wyn Copyrt 005 Prson-Ason Wsly All rts rsrv Intrvl Suln Intrvl Suln: Gry Alortms Intrvl suln! Jo strts t s n nss t! Two os omptl ty on't ovrlp! Gol: n mxmum sust
More informationIn which direction do compass needles always align? Why?
AQA Trloy Unt 6.7 Mntsm n Eltromntsm - Hr 1 Complt t p ll: Mnt or s typ o or n t s stronst t t o t mnt. Tr r two typs o mnt pol: n. Wrt wt woul ppn twn t pols n o t mnt ntrtons low: Drw t mnt l lns on
More informationMinimum Spanning Trees (CLRS 23)
Mnmum Spnnn Trs (CLRS 3) T prolm Rll t nton o spnnn tr: Gvn onnt, unrt rp G = (V, E), sust o s o G su tt ty onnt ll vrts n G n orm no yls s ll spnnn tr (ST) o G. Any unrt, onnt rp s spnnn tr. Atully, rp
More informationSpanning Trees. BFS, DFS spanning tree Minimum spanning tree. March 28, 2018 Cinda Heeren / Geoffrey Tien 1
Spnnn Trs BFS, DFS spnnn tr Mnmum spnnn tr Mr 28, 2018 Cn Hrn / Gory Tn 1 Dpt-rst sr Vsts vrts lon snl pt s r s t n o, n tn ktrks to t rst junton n rsums own notr pt Mr 28, 2018 Cn Hrn / Gory Tn 2 Dpt-rst
More informationLecture II: Minimium Spanning Tree Algorithms
Ltur II: Mnmum Spnnn Tr Alortms Dr Krn T. Hrly Dprtmnt o Computr Sn Unvrsty Coll Cork Aprl 0 KH (/0/) Ltur II: Mnmum Spnnn Tr Alortms Aprl 0 / 5 Mnmum Spnnn Trs Mnmum Spnnn Trs Spnnn Tr tr orm rom rp s
More informationHaving a glimpse of some of the possibilities for solutions of linear systems, we move to methods of finding these solutions. The basic idea we shall
Hvn lps o so o t posslts or solutons o lnr systs, w ov to tos o nn ts solutons. T s w sll us s to try to sply t syst y lntn so o t vrls n so ts qutons. Tus, w rr to t to s lnton. T prry oprton nvolv s
More informationThe R-Tree. Yufei Tao. ITEE University of Queensland. INFS4205/7205, Uni of Queensland
Yu To ITEE Unvrsty o Qunsln W wll stuy nw strutur ll t R-tr, w n tout o s mult-mnsonl xtnson o t B-tr. T R-tr supports ntly vrty o qurs (s w wll n out ltr n t ours), n s mplmnt n numrous ts systms. Our
More information(Minimum) Spanning Trees
(Mnmum) Spnnn Trs Spnnn trs Kruskl's lortm Novmr 23, 2017 Cn Hrn / Gory Tn 1 Spnnn trs Gvn G = V, E, spnnn tr o G s onnt surp o G wt xtly V 1 s mnml sust o s tt onnts ll t vrts o G G = Spnnn trs Novmr
More informationMinimum Spanning Trees (CLRS 23)
Mnmum Spnnn Trs (CLRS 3) T prolm Gvn onnt, unrt rp G = (V, E), sust o s o G su tt ty onnt ll vrts n G n orm no yls s ll spnnn tr (ST) o G. Clm: Any unrt, onnt rp s spnnn tr (n nrl rp my v mny spnnn trs).
More informationIsomorphism In Kinematic Chains
Intrntonl Journl o Rsr n Ennrn n Sn (IJRES) ISSN (Onln): 0-, ISSN (Prnt): 0- www.rs.or Volum Issu ǁ My. 0 ǁ PP.0- Isomorpsm In Knmt Cns Dr.Al Hsn Asstt.Prossor, Dprtmnt o Mnl Ennrn, F/O- Ennrn & Tnoloy,
More informationThe Constrained Longest Common Subsequence Problem. Rotem.R and Rotem.H
T Constrn Lonst Common Susqun Prolm Rotm.R n Rotm.H Prsntton Outln. LCS Alortm Rmnr Uss o LCS Alortm T CLCS Prolm Introuton Motvton For CLCS Alortm T CLCS Prolm Nïv Alortm T CLCS Alortm A Dynm Prormmn
More informationDental PBRN Study: Reasons for replacement or repair of dental restorations
Dntl PBRN Stuy: Rsons or rplmnt or rpr o ntl rstortons Us ts Dt Collton Form wnvr stuy rstorton s rpl or rpr. For nrollmnt n t ollton you my rpl or rpr up to 4 rstortons, on t sm ptnt, urn snl vst. You
More informationTheorem 1. An undirected graph is a tree if and only if there is a unique simple path between any two of its vertices.
Cptr 11: Trs 11.1 - Introuton to Trs Dnton 1 (Tr). A tr s onnt unrt rp wt no sp ruts. Tor 1. An unrt rp s tr n ony tr s unqu sp pt twn ny two o ts vrts. Dnton 2. A root tr s tr n w on vrtx s n snt s t
More informationA Simple Method for Identifying Compelled Edges in DAGs
A Smpl Mto or Intyn Compll Es n DAGs S.K.M. Won n D. Wu Dprtmnt o Computr Sn Unvrsty o Rn Rn Ssktwn Cn S4S 0A2 Eml: {won, nwu}@s.urn. Astrt Intyn ompll s s mportnt n lrnn t strutur (.., t DAG) o Bysn ntwork.
More informationGraph Search (6A) Young Won Lim 5/18/18
Grp Sr (6A) Youn Won Lm Copyrt () 2015 2018 Youn W. Lm. Prmon rnt to opy, trut n/or moy t oumnt unr t trm o t GNU Fr Doumntton Ln, Vron 1.2 or ny ltr vron pul y t Fr Sotwr Founton; wt no Invrnt Ston, no
More informationClosed Monochromatic Bishops Tours
Cos Monoromt Bsops Tours Jo DMo Dprtmnt o Mtmts n Sttsts Knnsw Stt Unvrsty, Knnsw, Gor, 0, USA mo@nnsw.u My, 00 Astrt In ss, t sop s unqu s t s o to sn oor on t n wt or. Ts ms os tour n w t sop vsts vry
More information2 Trees and Their Applications
Trs n Tr Appltons. Proprts o trs.. Crtrzton o trs Dnton. A rp s ll yl (or orst) t ontns no yls. A onnt yl rp s ll tr. Quston. Cn n yl rp v loops or prlll s? Notton. I G = (V, E) s rp n E, tn G wll not
More informationMATERIAL SEE BOM ANGLES = 2 FINISH N/A
9 NOTS:. SSML N NSPT PR SOP 0-9... NSTLL K STKR N X L STKR TO NS O SROU WT TP. 3. PR-PK LNR RNS WT P (XTRM PRSSUR NL R ) RS OR NNRN PPROV QUVLNT. 4. OLOR TT Y T SLS ORR. RRN T MNS OM OR OMPONNTS ONTNN
More informationPlatform Controls. 1-1 Joystick Controllers. Boom Up/Down Controller Adjustments
Ston 7 - Rpr Prours Srv Mnul - Son Eton Pltorm Controls 1-1 Joystk Controllrs Mntnn oystk ontrollrs t t propr sttns s ssntl to s mn oprton. Evry oystk ontrollr soul oprt smootly n prov proportonl sp ontrol
More informationStrongly connected components. Finding strongly-connected components
Stronly onnt omponnts Fnn stronly-onnt omponnts Tylr Moor stronly onnt omponnt s t mxml sust o rp wt rt pt twn ny two vrts SE 3353, SMU, Dlls, TX Ltur 9 Som sls rt y or pt rom Dr. Kvn Wyn. For mor normton
More informationSAMPLE CSc 340 EXAM QUESTIONS WITH SOLUTIONS: part 2
AMPLE C EXAM UETION WITH OLUTION: prt. It n sown tt l / wr.7888l. I Φ nots orul or pprotng t vlu o tn t n sown tt t trunton rror o ts pproton s o t or or so onstnts ; tt s Not tt / L Φ L.. Φ.. /. /.. Φ..787.
More informationMINI POST SERIES BALUSTRADE SYSTEM INSTALLATION GUIDE PRODUCT CODE: MPS-RP
MN POST SRS LUSTR SYSTM NSTLLTON U PROUT O: MPS-RP 0 R0 WLL LN 0 RONT LVTON VW R0 N P 0 T RUR LOK LOT ON LSS. SLON SL TYP. OT SS 000 LSS T 0 00 SRS LSS WT 00/00 (0mm NRMNTS VLL) MX. 000 00-0 (ROMMN) 00
More informationAn Application to Search for High-Priority War Opponent in Spatial Games Using Dynamic Skyline Query
Intrntonl Journl o Appl Ennrn Rsr ISSN 973-4562 Volum 13, Numr 2 (218) pp. 1496-15 An Applton to Sr or H-Prorty Wr Opponnt n Sptl Gms Usn Qury Jonwn Km Smt Lrl Arts Coll, Smyook Unvrsty, 815 Hwrn-ro, Nowon-u,
More informationExam 2 Solutions. Jonathan Turner 4/2/2012. CS 542 Advanced Data Structures and Algorithms
CS 542 Avn Dt Stutu n Alotm Exm 2 Soluton Jontn Tun 4/2/202. (5 ont) Con n oton on t tton t tutu n w t n t 2 no. Wt t mllt num o no tt t tton t tutu oul ontn. Exln you nw. Sn n mut n you o u t n t, t n
More informationd e c b a d c b a d e c b a a c a d c c e b
FLAT PEYOTE STITCH Bin y mkin stoppr -- sw trou n pull it lon t tr until it is out 6 rom t n. Sw trou t in witout splittin t tr. You soul l to sli it up n own t tr ut it will sty in pl wn lt lon. Evn-Count
More informationCOMP 250. Lecture 29. graph traversal. Nov. 15/16, 2017
COMP 250 Ltur 29 rp trvrsl Nov. 15/16, 2017 1 Toy Rursv rp trvrsl pt rst Non-rursv rp trvrsl pt rst rt rst 2 Hs up! Tr wr w mstks n t sls or S. 001 or toy s ltur. So you r ollown t ltur rorns n usn ts
More information23 Minimum Spanning Trees
3 Mnmum Spnnn Trs Eltron rut sns otn n to mk t pns o svrl omponnts ltrlly quvlnt y wrn tm totr. To ntronnt st o n pns, w n us n rrnmnt o n wrs, onntn two pns. O ll su rrnmnts, t on tt uss t lst mount o
More informationApplications of trees
Trs Apptons o trs Orgnzton rts Attk trs to syst Anyss o tr ntworks Prsng xprssons Trs (rtrv o norton) Don-n strutur Mutstng Dstnton-s orwrng Trnsprnt swts Forwrng ts o prxs t routrs Struturs or nt pntton
More informationMath 166 Week in Review 2 Sections 1.1b, 1.2, 1.3, & 1.4
Mt 166 WIR, Sprin 2012, Bnjmin urisp Mt 166 Wk in Rviw 2 Stions 1.1, 1.2, 1.3, & 1.4 1. S t pproprit rions in Vnn irm tt orrspon to o t ollowin sts. () (B ) B () ( ) B B () (B ) B 1 Mt 166 WIR, Sprin 2012,
More informationSingle Source Shortest Paths (with Positive Weights)
Snl Sour Sortst Pts (wt Postv Wts) Yuf To ITEE Unvrsty of Qunslnd In ts ltur, w wll rvst t snl sour sortst pt (SSSP) problm. Rll tt w v lrdy lrnd tt t BFS lortm solvs t problm ffntly wn ll t ds v t sm
More informationPRECAST APPROACH SLAB NOTES
ULNS TS ULN RWNS RPRSNT TYPL TLS OR T SN N TLN O PRST PPRO SLS. TS STS R NLU TO PROV N XMPL O T RTN LYOUT O TYPL PRST PPRO SL. TWO RNT PPRO SL SYSTMS R SOWN: SUR PPRO SLS: SLS TT R PL WT T TOP SUR T OR
More informationTangram Fractions Overview: Students will analyze standard and nonstandard
ACTIVITY 1 Mtrils: Stunt opis o tnrm mstrs trnsprnis o tnrm mstrs sissors PROCEDURE Skills: Dsriin n nmin polyons Stuyin onrun Comprin rtions Tnrm Frtions Ovrviw: Stunts will nlyz stnr n nonstnr tnrms
More information(4, 2)-choosability of planar graphs with forbidden structures
(4, )-ooslty o plnr rps wt orn struturs Znr Brkkyzy 1 Crstopr Cox Ml Dryko 1 Krstn Honson 1 Mot Kumt 1 Brnr Lký 1, Ky Mssrsmt 1 Kvn Moss 1 Ktln Nowk 1 Kvn F. Plmowsk 1 Drrk Stol 1,4 Dmr 11, 015 Astrt All
More information, each of which is a tree, and whose roots r 1. , respectively, are children of r. Data Structures & File Management
nrl tr T is init st o on or mor nos suh tht thr is on sint no r, ll th root o T, n th rminin nos r prtition into n isjoint susts T, T,, T n, h o whih is tr, n whos roots r, r,, r n, rsptivly, r hilrn o
More informationAn Introduction to Clique Minimal Separator Decomposition
Alortms 2010, 3, 197-215; o:10.3390/3020197 Rvw OPEN ACCESS lortms ISSN 1999-4893 www.mp.om/ournl/lortms An Introuton to Clqu Mnml Sprtor Domposton Ann Brry 1,, Romn Poorln 1 n Gnvèv Smont 2 1 LIMOS UMR
More informationL.3922 M.C. L.3922 M.C. L.2996 M.C. L.3909 M.C. L.5632 M.C. L M.C. L.5632 M.C. L M.C. DRIVE STAR NORTH STAR NORTH NORTH DRIVE
N URY T NORTON PROV N RRONOUS NORTON NVRTNTY PROV. SPY S NY TY OR UT T TY RY OS NOT URNT T S TT T NORTON PROV S ORRT, NSR S POSS, VRY ORT S N ON N T S T TY RY. TS NORTON S N OP RO RORS RT SU "" YW No.
More informationlearning objectives learn what graphs are in mathematical terms learn how to represent graphs in computers learn about typical graph algorithms
rp loritms lrnin ojtivs loritms your sotwr systm sotwr rwr lrn wt rps r in mtmtil trms lrn ow to rprsnt rps in omputrs lrn out typil rp loritms wy rps? intuitivly, rp is orm y vrtis n s twn vrtis rps r
More informationFace Detection and Recognition. Linear Algebra and Face Recognition. Face Recognition. Face Recognition. Dimension reduction
F Dtto Roto Lr Alr F Roto C Y I Ursty O solto: tto o l trs s s ys os ot. Dlt to t to ltpl ws. F Roto Aotr ppro: ort y rry s tor o so E.. 56 56 > pot 6556- stol sp A st o s t ps to ollto o pots ts sp. F
More informationOn Hamiltonian Tetrahedralizations Of Convex Polyhedra
O Ht Ttrrzts O Cvx Pyr Frs C 1 Q-Hu D 2 C A W 3 1 Dprtt Cputr S T Uvrsty H K, H K, C. E: @s.u. 2 R & TV Trsss Ctr, Hu, C. E: q@163.t 3 Dprtt Cputr S, Mr Uvrsty Nwu St. J s, Nwu, C A1B 35. E: w@r.s.u. Astrt
More informationDOCUMENT STATUS: RELEASE
RVSON STORY RV T SRPTON O Y 0-4-0 RLS OR PROUTON 5 MM -04-0 NS TRU PLOT PROUTON -- S O O OR TLS 30 MM 03-3-0 3-044 N 3-45, TS S T TON O PROTTV RM OVR. 3 05--0 LT 3-004, NOT, 3-050 3 0//00 UPT ST ROM SN,
More informationGraphs Depth First Search
Grp Dpt Frt Sr SFO 337 LAX 1843 1743 1233 802 DFW ORD - 1 - Grp Sr Aort - 2 - Outo Ø By unrtnn t tur, you ou to: q L rp orn to t orr n w vrt r ovr, xpor ro n n n pt-rt r. q Cy o t pt-rt r tr,, orwr n ro
More informationCS September 2018
Loil los Distriut Systms 06. Loil los Assin squn numrs to msss All ooprtin prosss n r on orr o vnts vs. physil los: rport tim o y Assum no ntrl tim sour Eh systm mintins its own lol lo No totl orrin o
More informationCSE 332. Data Structures and Parallelism
Am Blnk Ltur 20 Wntr 2017 CSE 332 Dt Struturs n Prlllsm CSE 332: Dt Struturs n Prlllsm Grps 1: Wt s Grp? DFS n BFS LnkLsts r to Trs s Trs r to... 1 Wr W v Bn Essntl ADTs: Lsts, Stks, Quus, Prorty Quus,
More informationCatalytic S N Ar of Unactivated Aryl Chlorides ESI
Eltron Supplmntry Mtrl (ESI) or CmComm. Ts journl s T Royl Soty o Cmstry 2014 Ctlyt S Ar o Untvt Aryl Clors ESI Tl o Contnts 1. Prour n Full Tl o Contons - Prour S1 - Intl solvnt srn (no tlyst) - Solvnt
More informationCSE 332. Graphs 1: What is a Graph? DFS and BFS. Data Abstractions. CSE 332: Data Abstractions. A Graph is a Thingy... 2
Am Blnk Ltur 19 Summr 2015 CSE 332: Dt Astrtons CSE 332 Grps 1: Wt s Grp? DFS n BFS Dt Astrtons LnkLsts r to Trs s Trs r to... 1 A Grp s Tny... 2 Wr W v Bn Essntl ADTs: Lsts, Stks, Quus, Prorty Quus, Hps,
More informationPower-Aware Scheduling under Timing Constraints for Mission-Critical Embedded Systems
owr-wr Suln unr Tmn onstrnts or Msson-rtl Em Systms Jnn Lu, H. ou, Nr rz, F Kur Dpt. o Eltrl & omputr Ennrn Unvrsty o lorn Irvn, 92697-262 US jnnl, ou, nr, kur@.u.u Dpt. o Eltrl & omputr Ennrn Unvrsty
More informationPhylogenetic Tree Inferences Using Quartet Splits. Kevin Michael Hathcock. Bachelor of Science Lenoir-Rhyne University 2010
Pylont Tr Inrns Usn Qurtt Splts By Kvn Ml Htok Blor o Sn Lnor-Ryn Unvrsty 2010 Sumtt n Prtl Fulllmnt o t Rqurmnts or t Dr o Mstr o Sn n Mtmts Coll o Arts n Sns Unvrsty o Sout Croln 2012 Apt y: Év Czrk,
More informationA RANKING PROCEDURE FOR FUZZY DECISION-MAKING IN PRODUCT DESIGN
Ornl rtl rons o IDMME - Vrtl Conpt 2008 jn Cn Otor 8 0 2008 RNKING ROCEDURE FOR FUZZY DECISION-MKING IN RODUCT DESIGN Mro rjs r r 2 ): Déprtmnt Mtémtqs t Gén Instrl Éol olytnq Montrél C.. 6079 S. Cntr-vll
More informationMATERIAL SEE BOM ANGLES = 2 > 2000 DATE MEDIUM FINISH
NOTS:. LN MTN SUR WT NTUR/SOPROPYL LOOL PROR TO RN L OR LOO. PPLY LOTT 4 ON TRS. TORQU TO. Nm / 00 lb-in 4. TORQU TO 45-50 Nm / - lb-ft 5. TORQU TO Nm / 4.5 lb-ft. TORQU TO 0 Nm / lb-in. TORQU TO 5.5 Nm
More informationMAT3707. Tutorial letter 201/1/2017 DISCRETE MATHEMATICS: COMBINATORICS. Semester 1. Department of Mathematical Sciences MAT3707/201/1/2017
MAT3707/201/1/2017 Tutoril lttr 201/1/2017 DISCRETE MATHEMATICS: COMBINATORICS MAT3707 Smstr 1 Dprtmnt o Mtmtil Sins SOLUTIONS TO ASSIGNMENT 01 BARCODE Din tomorrow. univrsity o sout ri SOLUTIONS TO ASSIGNMENT
More informationConstructive Geometric Constraint Solving
Construtiv Gomtri Constrint Solving Antoni Soto i Rir Dprtmnt Llngutgs i Sistms Inormàtis Univrsitt Politèni Ctluny Brlon, Sptmr 2002 CGCS p.1/37 Prliminris CGCS p.2/37 Gomtri onstrint prolm C 2 D L BC
More informationEE1000 Project 4 Digital Volt Meter
Ovrviw EE1000 Projt 4 Diitl Volt Mtr In this projt, w mk vi tht n msur volts in th rn o 0 to 4 Volts with on iit o ury. Th input is n nlo volt n th output is sinl 7-smnt iit tht tlls us wht tht input s
More informationA New Interface to Render Graphs Using Rgraphviz
A Nw Intr to Rnr Grps Usn Rrpvz Florn Hn Otor 30, 2017 Contnts 1 Ovrvw 1 2 Introuton 1 3 Dult rnrn prmtrs 3 3.1 Dult no prmtrs....................... 4 3.2 Dult prmtrs....................... 6 3.3 Dult
More informationFirst Principles Calculation of Fe L 2;3 -edge X-ray Absorption Near Edge Structures of Iron Oxides
Mtrls Trnstons, Vol. 45, No. 5 (2004) pp. 1414 to 1418 Spl Issu on Avns n Computtonl Mtrls Sn n Ennrn III #2004 Th Jpn Insttut o Mtls Frst Prnpls Clulton o F L 2;3 - X-ry Asorpton Nr E Struturs o Iron
More information23 Minimum Spanning Trees
3 Mnmum Spnnn Trs Eltron rut sns otn n to mk t pns o svrl omponnts ltrlly quvlnt y wrn tm totr. To ntronnt st o n pns, w n us n rrnmnt o n wrs, onntn two pns. O ll su rrnmnts, t on tt uss t lst mount o
More informationEFFICIENT EXTRACTION OF CLOSED MOTIVIC PATTERNS IN MULTI-DIMENSIONAL SYMBOLIC REPRESENTATIONS OF MUSIC
EFFICIENT EXTRACTION OF CLOSED MOTIVIC PATTERNS IN MULTI-DIMENSIONAL SYMBOLIC REPRESENTATIONS OF MUSIC Olvr Lrtllot Unvrsty o Jyväskylä Dprtmnt o Mus ABSTRACT In ts ppr, w prsnt n nt mol or sovrn rpt pttrns
More informationCSE 332. Graphs 1: What is a Graph? DFS and BFS. Data Abstractions. CSE 332: Data Abstractions. A Graph is a Thingy... 2
Am Blnk Ltur 0 Autumn 0 CSE 33: Dt Astrtons CSE 33 Grps : Wt s Grp? DFS n BFS Dt Astrtons LnkLsts r to Trs s Trs r to... A Grp s Tny... Wr W v Bn Essntl ADTs: Lsts, Stks, Quus, Prorty Quus, Hps, Vnll Trs,
More information17 Basic Graph Properties
Ltur 17: Bs Grp Proprts [Sp 10] O look t t sn y o. Tn t t twnty-svn 8 y 10 olor lossy pturs wt t rls n rrows n prrp on t k o on... n tn look t t sn y o. An tn t t twnty-svn 8 y 10 olor lossy pturs wt t
More informationSolving Problems with Uncertainty: A case study using Tsuitate-Tsume-Shogi
olvn Prolms wt nrtnty: A s stuy usn sutt-sum-o Mkoto kut n Hroyuk I Dprtmnt o Computr n, zuok nvrsty {skut, }@s.n.szuok..jp Astrt s ppr xplors t posslty o omputn mprt-normton ms wt ous on ts nm, nmly,
More informationTelecommunications 1-1/4" RACEWAY WITH DOUBLE-GANG ADAPTER PLATE AND A/V CABLING.
2 3 2 TNOOY SYMO ST NR TNOOY NOTS: NOT: This is a standard symbol list and not all items listed may be used. bbreviations () XSTN OV NS OOR NMW - UNRROUN ONUT T TORY ONTRTOR URNS ONTRTOR NST O ONTRTOR
More informationCycles and Simple Cycles. Paths and Simple Paths. Trees. Problem: There is No Completely Standard Terminology!
Outlin Computr Sin 331, Spnnin, n Surphs Mik Joson Dprtmnt o Computr Sin Univrsity o Clry Ltur #30 1 Introution 2 3 Dinition 4 Spnnin 5 6 Mik Joson (Univrsity o Clry) Computr Sin 331 Ltur #30 1 / 20 Mik
More informationPlanar convex hulls (I)
Covx Hu Covxty Gv st P o ots 2D, tr ovx u s t sst ovx oyo tt ots ots o P A oyo P s ovx or y, P, t st s try P. Pr ovx us (I) Coutto Gotry [s 3250] Lur To Bowo Co ovx o-ovx 1 2 3 Covx Hu Covx Hu Covx Hu
More informationb.) v d =? Example 2 l = 50 m, D = 1.0 mm, E = 6 V, " = 1.72 #10 $8 % & m, and r = 0.5 % a.) R =? c.) V ab =? a.) R eq =?
xmpl : An 8-gug oppr wr hs nomnl mtr o. mm. Ths wr rrs onstnt urrnt o.67 A to W lmp. Th nsty o r ltrons s 8.5 x 8 ltrons pr u mtr. Fn th mgntu o. th urrnt nsty. th rt vloty xmpl D. mm,.67 A, n N 8.5" 8
More informationA Gentle Introduction to Matroid Algorithmics
A Gntl Introuton to Mtro Alortms Mtts F. Stllmnn Aprl, 06 Mtro xoms T trm mtro ws rst us n 9 y Hsslr Wtny []. ovrvw oms rom t txtooks o Lwlr [] n Wls []. Most o t mtrl n ts A mtro s n y st o xoms wt rspt
More informationData-Parallel Primitives for Spatial Operations Using PM. Quadtrees* primitives that are used to construct the data. concluding remarks.
Dt-rlll rmtvs or Sptl Oprtons Usn M Qutrs* Erk G. Hol Hnn Smt Computr Sn Dprtmnt Computr Sn Dprtmnt Cntr or Automton Rsr Cntr or Automton Rsr Insttut or Avn Computr Sns Insttut or Avn Computr Sns Unvrsty
More informationEFFICIENT EXTRACTION OF CLOSED MOTIVIC PATTERNS IN MULTI-DIMENSIONAL SYMBOLIC REPRESENTATIONS OF MUSIC
EFFICIENT EXTRACTION OF CLOSED MOTIVIC PATTERNS IN MULTI-DIMENSIONAL SYMBOLIC REPRESENTATIONS OF MUSIC Olvr Lrtllot Unvrsty o Jyväskylä PL 35(A) 4004 Jyväskylä, Fnln lrtllo@mpus.jyu. ABSTRACT An nt mol
More informationPriority Search Trees - Part I
.S. 252 Pro. Rorto Taassa oputatoal otry S., 1992 1993 Ltur 9 at: ar 8, 1993 Sr: a Q ol aro Prorty Sar Trs - Part 1 trouto t last ltur, w loo at trval trs. or trval pot losur prols, ty us lar spa a optal
More informationDistributed Memory Allocation Technique for Synchronous Dataflow Graphs
Dstrut Mmory Alloton Tnqu or Synronous Dtlow Grps Krol Dsnos, Mxm Plt, Jn-Frnços Nzn, Sln Ar To t ts vrson: Krol Dsnos, Mxm Plt, Jn-Frnços Nzn, Sln Ar. Dstrut Mmory Alloton Tnqu or Synronous Dtlow Grps.
More informationOpenMx Matrices and Operators
OpnMx Mtris n Oprtors Sr Mln Mtris: t uilin loks Mny typs? Dnots r lmnt mxmtrix( typ= Zro", nrow=, nol=, nm="" ) mxmtrix( typ= Unit", nrow=, nol=, nm="" ) mxmtrix( typ= Int", nrow=, nol=, nm="" ) mxmtrix(
More informationMechanisms of 10 Links, 13-Joints, 1-F Kinematic Chains of Group B
IJSTE Intrntonl Journl o Sn Tnoloy & Ennrn Volum 2 Issu 08 Frury 201 ISSN (onln): 2349784X Mnsms o Lnks, 13Jonts, 1F Knmt Cns o Group B Dr. Al Hsn Dprtmnt o Mnl Ennrn Jm Mll Islm, Nw Dl Astrt Autor s otv
More informationProblem solving by search
Prolm solving y srh Tomáš voo Dprtmnt o Cyrntis, Vision or Roots n Autonomous ystms Mrh 5, 208 / 3 Outlin rh prolm. tt sp grphs. rh trs. trtgis, whih tr rnhs to hoos? trtgy/algorithm proprtis? Progrmming
More informationWhy the Junction Tree Algorithm? The Junction Tree Algorithm. Clique Potential Representation. Overview. Chris Williams 1.
Why th Juntion Tr lgorithm? Th Juntion Tr lgorithm hris Willims 1 Shool of Informtis, Univrsity of Einurgh Otor 2009 Th JT is gnrl-purpos lgorithm for omputing (onitionl) mrginls on grphs. It os this y
More informationDOCUMENT STATUS: MINTP0 E-ST5080, BASE, NO DISPLAY VENDOR: 15.5 INCH MATERIAL SEE BOM FINISH REVISION HISTORY ITEM NO. PART NUMBER DESCRIPTION
RV T RVSON STORY SRPTON O Y 0-0-0 PROUTON RLS K. N NOTS:. SRL LL NORMTON: a) VOLTS: V b) MPS:.0 c) YLS: N/ d) WTTS: W e) PS: N/ f) PX #: PX. RTTON LOOS: S / / LN R WT SOPROPYL LOLOL PROR TO PLN.. PK M:
More informationIntegration Continued. Integration by Parts Solving Definite Integrals: Area Under a Curve Improper Integrals
Intgrtion Continud Intgrtion y Prts Solving Dinit Intgrls: Ar Undr Curv Impropr Intgrls Intgrtion y Prts Prticulrly usul whn you r trying to tk th intgrl o som unction tht is th product o n lgric prssion
More informationDistributed Caching of Multi-dimensional Data in Mobile Environments
Dstrut Cn o Mut-mnson Dt n Mo Envronmnts Bn Lu Wn-Cn L D Lun L Dprtmnt o Computr Sn Hon Kon Unvrst o Sn n Tnoo Crwtr B, Hon Kon {un, }@s.ust. Dprtmnt o Computr Sn n Ennrn Pnnsvn Stt Unvrst Unvrst Pr, PA
More informationData Mining in Bioinformatics Day 10: Graph Mining in Bioinformatics
Dt Mnn n Bonormts Dy 10: Grp Mnn n Bonormts Krstn Borwrt Frury 21 to Mr 4, 2011 Mn Lrnn & Computtonl Boloy Rsr Group MPIs Tünn wt prmsson rom Xn Yn n Xnon Jsmn Zou Krstn Borwrt: Dt Mnn n Bonormts, P 1
More informationNew Biomaterials from Renewable Resources - Amphiphilic Block Copolymers from δ-decalactone. Figure S4 DSC plot of Propargyl PDL...
Eltron Supplmntry Mtrl (ESI) or Polymr Cmstry. Ts ournl s T Royl Soty o Cmstry 2015 Polymr Cmstry RSCPulsng Supportng Inormton Nw Bomtrls rom Rnwl Rsours - Amppl Blo Copolymrs rom δ-dlton Kulp K. Bnsl,
More informationFun sheet matching: towards automatic block decomposition for hexahedral meshes
DOI 10.1007/s00366-010-0207-5 ORIGINAL ARTICLE Fun st mtn: towrs utomt lok omposton or xrl mss Nols Kowlsk Frnk Loux Mttw L. Sttn Stv J. Own Rv: 19 Frury 2010 / Apt: 22 Dmr 2010 Ó Sprnr-Vrl Lonon Lmt 2011
More informationGrenchMark : a framework for analyzing, testing, and comparing grids Iosup, A.; Epema, D.H.J.
GrnMr : rmwor or nlyzn, tstn, n omprn rs Iosup, A.; Epm, D.H.J. Puls n: Prons o t 6t Intrntonl Symposum on Clustr Computn n t Gr (CCGr 26, Snpor, My 16-19, 26) DOI: 1.119/CCGRID.26.49 Puls: 1/1/26 Doumnt
More informationThe Appendicular Skeleton
NAME LAB TIME/DATE R v w S t Exrs 10 T Appnulr Sklton Bons o t Ptorl Grl n Uppr Lm 1. Mt t on nms or mrkns n olumn B wt t srptons n olumn A. T tms n olumn B my us mor tn on. Column A Column B ; lto turosty
More informationSheet Title: Building Renderings M. AS SHOWN Status: A.R.H.P.B. SUBMITTAL August 9, :07 pm
1 2 3 4 5 6 7 8 9 1 11 12 13 14 15 16 17 18 19 orthstar expressly reserves its common law copyright and other property rights for all ideas, provisions and plans represented or indicated by these drawings,
More informationGrade 7/8 Math Circles March 4/5, Graph Theory I- Solutions
ulty o Mtmtis Wtrloo, Ontrio N ntr or ution in Mtmtis n omputin r / Mt irls Mr /, 0 rp Tory - Solutions * inits lln qustion. Tr t ollowin wlks on t rp low. or on, stt wtr it is pt? ow o you know? () n
More informationQUESTIONS BEGIN HERE!
Points miss: Stunt's Nm: Totl sor: /100 points Est Tnnss Stt Univrsity Dprtmnt o Computr n Inormtion Sins CSCI 2710 (Trno) Disrt Struturs TEST or Sprin Smstr, 2005 R this or strtin! This tst is los ook
More information18 Basic Graph Properties
O look t t sn y o. Tn t t twnty-svn 8 y 10 olor lossy pturs wt t rls n rrows n prrp on t k o on... n tn look t t sn y o. An tn t t twnty-svn 8 y 10 olor lossy pturs wt t rls n rrows n prrp on t k o on
More informationELECTRONIC SUPPLEMENTARY INFORMATION
Elctronc Supplmntry Mtrl (ESI) or Polymr Cmstry. Ts ournl s T Royl Socty o Cmstry 2015 ELECTRONIC SUPPLEMENTARY INFORMATION Poly(lyln tcont)s An ntrstn clss o polystrs wt proclly loct xo-cn oul ons suscptl
More informationCS 103 BFS Alorithm. Mark Redekopp
CS 3 BFS Aloritm Mrk Rkopp Brt-First Sr (BFS) HIGHLIGHTED ALGORITHM 3 Pt Plnnin W'v sn BFS in t ontxt o inin t sortst pt trou mz? S?? 4 Pt Plnnin W xplor t 4 niors s on irtion 3 3 3 S 3 3 3 3 3 F I you
More informationA Scalable Double In-memory Checkpoint and Restart Scheme towards Exascale
A Sll Doul In-mmory Ckpont n Rstrt Sm towrs Exsl Gnn Zn, Xn N, Lxmknt V. Klé Dprtmnt o Computr Sn Unvrsty o Illnos t Urn-Cmpn Urn, IL 6181, USA E-ml: {zn, xnn2, kl}@llnos.u Astrt As t sz o supromputrs
More informationBASIC CAGE DETAILS SHOWN 3D MODEL: PSM ASY INNER WALL TABS ARE COINED OVER BASE AND COVER FOR RIGIDITY SPRING FINGERS CLOSED TOP
MO: PSM SY SI TIS SOWN SPRIN INRS OS TOP INNR W TS R OIN OVR S N OVR OR RIIITY. R TURS US WIT OPTION T SINS. R (UNOMPRSS) RR S OPTION (S T ON ST ) IMNSIONS O INNR SIN TO UNTION WIT QU SM ORM-TOR (zqsp+)
More informationRMMP Vianu 2013 Problema 1
RMMP Vnu Probl Dl DAVIDSCU Arn DAFINI sk. Knt nrgy o t r. Soluton Fgur Clulul ontulu nrţ nsty o wl trl ( t lngt o wl s ) s ( ) Consrng t lntry prs ng t ss y t lntry wt rspt o wl s s y r J ( ) wt y r (
More informationInstitute for Advanced Computer Sciences. Abstract. are described for building these three data structures that make use of these
Dt-Prlll Prmtvs or Sptl Oprtons Erk G. Holy Computr Sn Dprtmnt Unvrsty o Mryln Coll Prk, Mryln 074 ol@s.um.u Hnn Smt Computr Sn Dprtmnt Cntr or Automton Rsr Insttut or Avn Computr Sns Unvrsty o Mryln Coll
More information1 Introduction to Modulo 7 Arithmetic
1 Introution to Moulo 7 Arithmti Bor w try our hn t solvin som hr Moulr KnKns, lt s tk los look t on moulr rithmti, mo 7 rithmti. You ll s in this sminr tht rithmti moulo prim is quit irnt rom th ons w
More information