Homeomorphic Alignment of Weighted Trees
|
|
- Ethelbert Holmes
- 7 years ago
- Views:
Transcription
1 Author mnusript, pulish in "Pttrn Rogn., 8 (00) " DOI : 0.06/j.ptog Homomorphi Alignmnt o Wight Trs Bnjmin Rynl, Mihl Coupri, Vnsls Biri Univrsité Pris-Est,Lortoir Inormtiqu Gspr Mong, Equip ASI UMR 809 UPEMLV/ESIEE/CNRS hl , vrsion - Mr 0 Astrt Motion ptur, urrntly tiv rsrh r, ns stimtion o th pos o th sujt. For this purpos, w mth th tr rprsnttion o th sklton o th D shp to pr-spii tr mol. Unortuntly, th tr rprsnttion n ontin vrtis tht split lims in multipl prts, whih o not llow goo mth y usul mthos. To solv this prolm, w propos nw lignmnt, tking into ount th homomorphism twn trs, rthr thn th isomorphism, s in prior works. Thn, w vlop svrl omputtionlly iint lgorithms or rhing rl-tim motion ptur. Ky wors: Grphs, homomorphism, lignmnt, mthing lgorithm. Introution.. Motivtion Motion ptur without mrkrs is highly tiv rsrh r, s shown y Moslun t l. []: twn 000 n 006, mor thn 50 pprs on this topi wr pulish. Motion ptur is us in svrl pplitions whih hv irnt ims n onstrints: D mols nimtion, or movis FX or vio gms or xmpl, rqusts n highly urt mol, ut os not n rl-tim omputtion (olin vio prossing is ptl). Rl-tim intrtion, or virtul rlity pplitions, rqusts st omputtion, t th pri o lowr ury. This ppr is pl in th ontxt o rl-tim intrtion. Moslun t l. sri in prvious work [] th irnt stps o motion ptur. Th irst stp (ll initiliztion stp) onsists o ining th initil pos o th sujt, rprsnt hr y shp (visul hull) onstrut using multi-viw systm with n lgorithm o Shp From Silhoutt []. Emil rsss: rynl@univ-mlv.r (Bnjmin Rynl), ouprim@si.r (Mihl Coupri), iri@univ-mlv.r (Vnsls Biri) Prprint sumitt to Elsvir Mrh, 00
2 Most lgorithms o D pos stimtion us mnully initiliz mol, or sk th sujt to mov sussivly th irnt prts o his/hr oy [], ut svrl utomti pprohs hv n vlop, using n priori mol. This priori mol n pproximt irnt hrtristis o th sujt: Kinmti strutur: A strutur ontining ix numr o joints, with spii grs o rom, n lim lngths. Shp: A gnri humnoi mol, rprsnt y simpl shp primitivs [5]. Apprn: Th txtur o sujt sur. hl , vrsion - Mr 0 This kin o omplx priori mol is iiult to mth with rl t, n ns to pt to h sujt (spilly in th s o pprn). In shp mthing, ommon pproh onsists o using sur (or ontour, in s o D shps) inormtion, vi urvtur n istn to ntroi inormtion [6, 7, 8]. This kin o pproh n not us in our s or svrl rsons: it implis omplx priori mol, urvtur is vril or rtiult shp, n th visul hull n hv vry noisy sur, u to th mtho o quisition... Our pproh Two o th most prsrv hrtristis o th rl shp y its visul hull ronstrution r its topology n th istns twn th irnt prts o th shp. A usul tool or rprsnting ths hrtristis is th sklton o th shp. A lot o pprohs using th sklton o shp hv n vlop. In motion ptur rsrh r [9, 0, ], th st tim otin or ining th initil pos is roun on son [0], whih is too slow, vn or intrtiv tim intrtion. In D shp mthing rsrh r, sklton is ommon tool o rprsnttion n omprison [, ]. A wily us mtho onsist in omprison o shok grphs [], uilt rom oth th sklton n th rius istn o th shps. Howvr, vn i this mtho n ppli in th s o D shps [5], it is not intrsting in our s, us th rius istn o th visul hull n noisy. For our purpos, th sklton is still too omplx, n w o not n ll th involv inormtion. It n osrv tht only smll prt o th sklton points r intrsting: th ning points n th intrstion points. In ition to th position o ths points, w n to know how thy r link togthr, n wht is th lngth o th sklton rnh twn thm. Consiring ths osrvtions, w n rprsnt th sklton y unroot tr (ll th t tr): th vrtis rprsnt th ning or intrstion points, n th gs rprsnt th links twn th points. In ition, w giv wight to h g, orrsponing to th gosi istn twn th points involv. Thn, our priori mol is lso n unroot wight tr (ll th pttrn tr), whr vrtis rprsnt th irnt prts o th shp (h, torso,
3 6 7 g h i j k l m n H A T A 0 C 6 6 F F D SHAPE SKELETON 8 o DATA TREE PATTERN TREE Figur : Exmpl o t tr quisition n xpt lignmnt with pttrn (mol) tr. From th right to th lt: th originl D shp, its sklton, th t tr omput rom th sklton, n th pttrn tr. Th numrs rprsnt th wights o th gs (i.. th gosi istns in th sklton or th t tr, n th xpt ons or th pttrn tr).th gry sh lins rprsnt th xpt lignmnt twn th t tr n th mol. hl , vrsion - Mr 0 roth, hns n t), n h g rprsnts th link twn this prts, ssoit to wight, rprsnting th istn twn two prts. It n sn s vry simplii kinmti strutur, without inition o grs o rom. Our pproh to in th initil pos o th sujt is thror to in th st lignmnt twn th pttrn tr n th t tr, tht is to sy, th mthing whih involvs s w moiitions s possil, to trnsorm th t tr in th pttrn tr (s Fig. or n xmpl o our omplt piplin, n xpt lignmnt). As w know whih prt o th shp orrspon to h vrtx o th pttrn tr, n whih r th D oorints o h vrtx o th t tr, th lignmnt will giv th position o h prt o th D shp... Prolms Svrl kins o nois n ormitis n ppr in th t tr: Ghosts lims: Du to th ronstrution rom silhoutts, prts o sp nnot rv, rsulting in lims o th ojt whih o not xist on th rl mol. Our mtho must urt nough to istinguish ths ghosts lims rom rl ons. Spurious rnhs: Du to th skltoniztion lgorithm n to th mount o nois o th shp sur, rnhs without importnt topologil signiition n ppr on sklton. For xmpl, in Fig., th gs {g,h}, {l,m}, {i,j}, {j,k} r spurious rnhs. Our mtho must roust nough to work on t trs with onsqunt mount o spurious rnhs. Uslss vrtx: Vrtis with xtly two nighors r not usul to sri th topology o shp, n thn uslssly split n g (n its wight)
4 into two prts, mking iiult goo mthing. This kin o vrtis n ppr whn rmoving spurious rnhs or ghosts lims. For xmpl, in Fig., vrtis j,k,m r uslss tr spurious rnhs ltion. Our mtho must l to mth two gs join y this kin o vrtx, with uniqu g. Splitt vrtx: Vrtis with mor thn thr nighors in th pttrn tr n orrspon to lustr o vrtis link y wkly wight gs in th t tr, u to th skltoniztion lgorithm. For xmpl, in Fig., vrtx T o pttrn tr mths with vrtis n in t tr. Our mtho must l to mth thm. hl , vrsion - Mr 0.. Our ontriution Approhs oun in th litrtur (s St. ) o not prmit to hiv roust mthing, with rspt to ll ths prturtions. Howvr, som xisting it-s istn, th lignmnt istn [], is n intrsting wy to solv th prolm o splitt vrtis, n it prsrvs th topology uring th mthing. In ition, n oprtion sri in [0], th ut oprtion, is spilly sign or onsiring only suprt o th tr. This oprtion is xtly wht w n to voi th prolms o ghost lims n spurious rnhs, whih n onsir s uslss prts o th t tr. Th prolm o uslss vrtis nnot solv y mthos oun in th litrtur. W introu in this ppr nw kin o lignmnt, whih solvs this prolm y onsiring th homomorphism twn trs inst o th isomorphism. This ppr is orgniz s ollow: In St., w giv th si initions n nottions rlt to g-wight grphs tht will us in th squl. In St., w trmin whih it-s istn o th litrtur is th most pproprit to s our mtho. In St., w introu our min ontriution, th homomorphi lignmnt. W lso introu lgorithms to omput it iintly or root trs, s wll s unroot trs. In St. 5, w show how to us th ut oprtion [0] with homomorphi lignmnt. Finlly, in St. 6, w show th rsults o irnt xprimnttions, n omprison twn our homomorphi lignmnt istn n th lssil lignmnt istn.. Bsis notions n nottions.. Unirt grphs An unirt grph is pir (V,E), whr V is init st, n E sust o {{x,y},x V,y V,x y}. An lmnt o E is ll n g, n lmnt o V is ll vrtx. I {x,y} E, thn x n y r si to jnt or nighors. Th st o ll nighors o x is not y N(x). Th numr o vrtis jnt to vrtx v is ll th gr o v, n is not y g(v). Lt G = (V,E) n unirt grph, n lt x,y in V, pth rom x to y in G is squn o vrtis v 0,...,v k suh tht x = v 0, y = v k
5 n {v i,v i } E, i k. Th numr k is ll th lngth o th pth. I k = 0 th pth is ll trivil pth. Th pth is los i x = y. Th pth is simpl whn no vrtx ours mor thn on in th squn o vrtis o th pth (xpt possily x = y). A non-trivil simpl los pth in whih ll gs r istint is ll yl. A grph is onnt i or ll {x,y} V, pth rom x to y xists in G. A tr is onnt grph with no yls. A simpl pth rom x to y in tr is uniqu n is not y π(x,y). A grph with no yls is ll orst, h o its onnt omponnts ing tr. hl , vrsion - Mr 0.. Dirt grphs A irt grph is pir (V,A), whr V is init st, n A is sust o V V. An lmnt o A is ll n r, n lmnt o V is ll vrtx. Lt G = (V,A) irt grph, n lt x,y in V, pth rom x to y in G is squn o vrtis s 0,...,s k suh tht x = v 0, y = v k n (v i,v i ) A, i k. Th unirt grph ssoit to G is th unirt grph G = (V,E), suh tht {x,y} E i n only i (x,y) A or (y,x) A. A vrtx r V is root o G i or ll x V \ {r}, pth rom r to x in G xists. Th grph G is ntisymmtri i or ll (x,y) A suh tht x y, (y,x) / A. Th grph G is root tr (with root r) i r is root o G, G is ntisymmtri n i th unirt grph ssoit to G is tr. A grph, whr h o its onnt omponnts is tr, is ll root orst. Lt G = (V,A) root tr. I (y,x) A, w sy tht y is th prnt o x (not y pr(x)), n tht x is hil o y. Th st o ll hilrn o y is not y C(y). Th mximum lngth o pth twn th root n ny no is ll th hight o th tr. Th vrtis on th pth rom th root to vrtx x r ll th nstors o x. W not th st o th nstors o x y n(x)... Common initions Unlss othrwis init, ll th othr initions n nottions in this ppr r similr or th two kins o grphs. W giv thm or irt grphs, th vrsions or unirt grphs n otin y rpling rs y gs. Two grphs G = (V G,A G ) n G = (V G,A G ) r si to isomorphi i thr xists ijtion : V G V G, suh s or ny pir (x,y) V G V G, (x,y) A G i n only i ((x),(y)) A G. A wight grph is triplt (V,A,ω), whr V is init st, A sust o V V, n ω mpping rom A to R. In wight tr, th wight o th uniqu pth rom x to y, not y ω(x,y), is th sum o th wights o ll rs trvrs in th pth. In this ppr, w sy tht two wight grphs (V,E,ω) n (V,E,ω ) r isomorphi whnvr th grphs (V,E) n (V,E ) r isomorphi (rgrlss o th wights). Th mrging is n oprtion tht n ppli only on rs shring - gr vrtx. Th mrging o two rs (u,v) n (v,w) in wight grph G = (V,A,ω) onsists o rmoving v in V, rpling (u,v) n (v,w) y (u,w) in A, wight y ω((u,w)) = ω((u,v)) + ω((v,w)). 5
6 Two wight grphs G = (V G,A G,ω G ) n G = (V G,A G,ω G ) r homomorphi [6] i thr xists n isomorphism twn grph otin y mrgings on G n grph otin y mrgings on G. S Fig. or som xmpls o isomorphism n homomorphism. U U U U i j i x k l k m n y m n 5 g h g h p o p j l o hl , vrsion - Mr 0 g h g x h i k m n y p j l o i m D D D D D 5 k n 5 Figur : First row: U is otin rom U y mrging on x. U is otin rom U y mrging on y. U n U r isomorphi, U n U r homomorphi. Son row: D is otin rom D y mrging on x. D 5 is otin rom D y mrging on y. D n D r isomorphi, D n D 5 r homomorphi, D n D r not isomorphi (r rs hv irnt orinttions).. Eit-s istns Th prolm o ompring grphs (in prtiulr trs) ours in ivrs rs suh s omputtionl iology, img nlysis n strutur tss. Howvr, th grphs onsir in ths omins r most otn with ll vrtis. Hr, h notion will introu in th s o grphs with wight gs/rs. In this stion, w rviw irnt it-s istns propos in th litrtur, n slt th on tht is th st pt our ims. p j l o.. Eit oprtions A lot o mthos hv n vlop or tr omprison, s th mximl ommon sutr [7, 8], or th pproximt sutr homomorphism [9]. An pproh wily us to ompr trs is to srh or squn o simpl primitiv oprtions (ll it oprtions) tht trnsorms tr into th othr n tht hs miniml ost. 6
7 For grph G = (V,A,ω), lssil it oprtions r: Rsiz: Chng th wight o n r = (u,v) A. Dlt: Dlt n r = (u,v) A n mrg u n v into on vrtx. Insrt: Split vrtx in two vrtis, n link thm y nw r. S Fig. or illustrtions. Th ost o ths it oprtions is givn y ost untion γ(w,w ), whr w (rsptivly w ) is th totl wight o th rs involv in th oprtion or (rsptivly, tr) its pplition. As onsqun, th ost o rsizmnt n not y γ(w,w ), whr w is th ormr wight o th rsiz r n w is th nw wight, th ost o ltion n not y γ(w,0), whr w is th wight o th lt r, n th ost o n insrtion, γ(0,w), whr w is th wight o th rt r. Furthrmor, w ssum tht γ is mtri. Typilly, γ(w,w ) = w w or (w w ). hl , vrsion - Mr 0 U U Rsizmnt 5 Rsizmnt 5 u u U U v v 9 9 g g Dltion Insrtion Dltion Insrtion w w D D D D Figur : Exmpls o it oprtions: on th top, on unirt grphs. On th ottom, on irt grphs. 9 g 9 g.. Choi o it-s istn Vrious it-s istns hv n in, using irnt onstrints on th it oprtions orr or on th rsulting orrsponn twn th vrtis sts, n irnt initions o oprtions. Ths it-s istns n lssii, s propos y Wng t l. [0]: it istn [], lignmnt istn [, ], isolt-sutrs istn [, 5, 6], n top-own istn [7, 8, 9]. 7
8 ... Eit istn Lt G th grph tht rsults rom th pplition o n it oprtion s to grph G ; this is writtn G G vi s. Lt S squn s,s,...,s k o it oprtions. W sy tht S trnsorms grph G to grph G i thr is squn o grphs G 0,G,...,G k suh tht G = G 0, G = G k n G i G i vi s i or i k. Th ost o th squn S, not y γ(s), is th sum o osts o th onstitunt it oprtions. Th istn rom G to G, not y δ(g,g ), is th minimum ost o ll squns o it oprtions tking G to G. For our purpos, this kin o it-s istn nnot us, us th ssoit mthing os not prsrv topologil rltions twn trs. In ition, th lgorithm s on this istn is th on with th highst tim omplxity. hl , vrsion - Mr 0... Isolt-sutrs istn Isolt-sutrs istn is n it-s istn suh tht two isjoint sutrs in th pttrn tr will lwys mth with two isjoint sutrs in th t tr.... Top-own istn Top-own istn is n it-s istn suh tht n r (p,p ) in th pttrn tr n mth n r (, ) in th t tr, only i (pr(p),p) mths (pr(),). Isolt-sutrs istn n top-own istn nnot lwys mth ll th mol tr, ut only suprts, most otn unonnt. Howvr, w will s in th nxt sustion tht it is not th s or lignmnt istn... Alignmnt istn In [], Jing t l. propos similrity msur twn vrtx-ll trs, tht w trnspos hr or g-wight grphs. Lt G = (V,A,ω ) n G = (V,A,ω ) two wight grphs. Lt G = (V,A,ω ) n G = (V,A,ω ) wight grphs otin y insrting rs wight y 0 (zro) in G n G, suh tht thr xists n isomorphism I twn (V,A ) n (V,A ). Th st o ll oupls o rs A = {(, ); A, A, = I( )} is ll n lignmnt o G n G. Th ost C A o A is th sum o th osts o ll oprtions us to lign G n G : th insrtions o rs wight y 0 (zro) (whih is r, u to non-vrition o wights), n th rsizmnt or h r A to th wight o I( ). Mor ormlly : C A = γ(ω ( ),ω ( )). (, ) A Th miniml ost o ll lignmnts rom G n G, ll th lignmnt istn, is not y α(g,g ). Th lignmnt istn is spil s o 8
9 th it istn, whr ny insrtion ours or ny ltion. As rsult, α(g,g ) δ(g,g ). Alignmnt istn is intrsting in our s or thr rsons: it tks into ount topologil rltions twn trs, it n omput in polynomil tim, n it nls to rmov gs, rgrlss o th rst o th grph, solving th prolm o splitt vrtis.... Illustrtion W onsir only th prolm o splitt vrtis in this xmpl. In Fig., w show th wy to otin n lignmnt with miniml ost: only on g insrtion in th pttrn tr, on th vrtx T, rprsnting th torso. Th rsulting lignmnt, rprsnt y ott lins, hs ost o. Th orrsponing vrtis mthing is th ollowing: H mths with, T with {,}, A with, A with, C with, F with n, n F with o. hl , vrsion - Mr 0 A G F A G F 6 6 H T 0 C H T 0 0 T C 6 6 A 6 G F 6 n o A 6 Figur : Exmpl o lignmnt: G (rsp. G ) is otin rom G (rsp. G ) y insrtions o gs (hr G = G ). Th ott lins rprsnt on o th possil lignmnts o G n G. G 6 F n o. Homomorphi lignmnt istn I w now tk into ount th prolm o uslss -gr vrtis, w n s tht th lignmnt strtgy os not work nymor (s Fig.5). In this xmpl, th split o th lg gs o th t tr in svrl prts involvs tht th st lignmnt is otin y mthing th rms o th pttrn (gs {T,A } n {T,A }) with th prts o th lgs in th t tr whih r losst o thm, in rgr o thir wights (gs {m,o} n {j,n}). Th ost o th lignmnt, shown y th ott lins, is qul to 6 n is miniml. For th purpos o solving th uslss vrtx prolm, w propos nw lignmnt strtgy. 9
10 A F G H T 0 C 6 6 A F C 0 0 C 6 F F C G T 0 T A H T 0 T A 6 G 7 j h n m 8 o 6 G 7 j 0 h n m 8 o Figur 5: Exmpl o lignmnt, u to uslss -gr vrtis. hl , vrsion - Mr 0.. Mrging krnl Consiring tht mrging on vrtx v on th grph G = (V,A,ω) os not t th gr o ny vrtx in V \ {v} (y inition o mrging oprtion) n thror th possiility o mrging this vrtx, th numr o possil mrgings rss y on tr h mrging. In onsqun, th mximl siz o squn o mrging oprtions, trnsorming G into nothr grph G = (V,A,ω ) is qul to th initil numr o possil mrgings in G. It n rmrk tht ny squn o mrging oprtions o mximl siz yils th sm rsult. Th grph rsulting o suh squn on G is ll th mrging krnl o G, n is not y MK(G). Th ollowing proposition is strightorwr: Proposition. Two grphs G = (V,A,ω ) n G = (V,G,ω ) r homomorphi i MK(G ) n MK(G ) r isomorphi... Homomorphi lignmnt istn Lt G = (V,A,ω ) n G = (V,A,ω ) two wight grphs. Lt G = (V,A,ω ) n G = (V,A,ω ) wight grphs otin y lting rs in G n G, suh tht thr xists n homomorphism twn G n G (not nssrily uniqu). Lt G = (V,A,ω ) n G = (V,A,ω ) th mrging krnl o G n G, rsptivly. From proposition, thr xists n isomorphism I twn G n G. Th st o ll oupls o rs H = {(, ); A, A, = I()} is ll n homomorphi lignmnt o G with G (s igur 6). Th grph G is ll th lt grph o H. Th grph G is ll th right grph o H. Th ost C H o H is th sum o th osts o ll oprtions us to homomorphilly lign G n G : th ltion o rs in G n G, to otin G n G rsptivly, n th rsizmnt or h r A to th wight o H( ). Mor ormlly : 0
11 C H = (, ) H γ(ω (),ω ( )) + A \A γ(ω ( ),0) + A\A γ(0,ω ( )). This miniml ost o ll homomorphi lignmnts twn G n G, ll th homomorphi lignmnt istn, is not y η(g,g ). hl , vrsion - Mr 0... Illustrtion Lt us onsir gin th pttrn n t trs us in Fig. 5. In Fig.6 is shown th wy to otin homomorphi lignmnt with miniml ost: only on g ltion in th t tr (g {,}), is nssry to otin homomorphism. Th mrging krnl o G is qul to G, n th mrging krnl o G is otin y mrging on vrtis j, h n m. Th rsulting homomorphi lignmnt, rprsnt y ott lins, hs ost o. Th orrsponing vrtis mthing is th ollowing: H with, T with {,}, A with, A with, C with, F with n, n F with o. 6 A G F H T 0 C A G 7 j h 6 6 F n m 8 o A G F H T 0 C 6 6, A 6 G 7 j h F n m 8 o A G F H T 0 C 6 6 A, Figur 6: Exmpl o homomorphi lignmnt: G (rsp. G ) is otin rom G (rsp. G ) y ltions o gs. G = MK(G ) n G = MK(G ). Th ott lins rprsnt on o th possil homomorphi lignmnts o G n G. 6 G 6 F n o.. Algorithm or root trs In orr to omput homomorphi lignmnt istn with goo omplxity, w will us ottom-up pproh. This pproh, wily us in th litrtur on it-s istns, is s on rormultion o th istn twn trs in trms o oth th istn twn thir sutrs n th mthing o thir roots. Thn, using this rormultion, th omputtion strts y th istns twn th simplst sutrs (i. th ls), n gos up to th root. Th istns twn sutrs r kpt in mmory, voiing runny o omputtion. Howvr, thr r two min irns to tk into ount in th s o homomorphi lignmnt istn: th t tht inormtion is on rs, rthr
12 hl , vrsion - Mr 0 thn o vrtis, n th t tht n r n mth with st o rs mrg togthr (u to mrging krnl pplition). Th irst prolm involvs to tk into onsirtion svrl r wights in th rormultion (on or h r twn th root n its hilrn), inst o th uniqu vlu link to th root, s in th litrtur. Th son prolm involvs to tk into ount not only th sutrs o th tr, ut lso thos whih n gnrt y som mrging. Our pproh to solv ths two prolms is to us spil kin o tr, th root o whih hs only on hil. Thn, w mk rormultion o th homomorphi lignmnt istn twn this kin o trs, in untion o sutrs with th sm proprty. By this wy, thr is only on nw r to tk into onsirtion t h stp, th on twn th root n its hil. Morovr, w onsir tht this r n th rsult o mrging. In omintion with th rursiv ntur o th ottom-up pproh, it will l to onsir sutrs with ll possil mrgings. Finlly, w lso n rormultion o th homomorphi lignmnt istn twn lssi trs in untion o th on twn th sutrs sri ov.... Dinitions n nottions First, w n to in mor ormlly th prtiulr kin o tr sri ov. Lt T = (V,A,ω) wight tr root in r T. W not y T(v),v V, th sutr o T root in v (s Fig.7). Lt v n nstor o v, w not y T ut (v,v ) th sugrph o T otin rom T(v ) y rmoving ll omplt sutrs whih o not ontin vrtis o T(v). W not y T(v,v ) th tr otin rom T ut (v,v ) y mrging on h vrtx n n(v) \ {v,v}. W sy tht T(v,v ) is th sutr o T root in v prun in v, n w ll this kin o trs prun tr (s Fig.7 or n xmpl). W not y F(T, v) th prun orst, th onnt omponnts o whih r th trs T(p,v), or ll p C(v) (s Fig.7 or n xmpl). By us o nottion w lso not y F(T,v) th st o ll onnt omponnts o this orst.... Rormultions In orr to us ottom-up pproh, w hv to xprss th homomorphi lignmnt istn: twn trs in untion o th istns twn thir prun orsts (Prop. ). twn prun trs in untion o th istns twn thir prun sutrs (Prop. ). twn prun orsts in untion o th istns twn thir prun sutrs (Prop. 5).
13 g h i j h i j h i h i j T T() T(, ) F(T, ) Figur 7: From th lt to th right: tr T, sutr o T root in, sutr o T root in n prun in, n prun orst o T with origin. hl , vrsion - Mr 0 In ition, w hv to rormult ths istns in th spil ss whr t lst on o th trs is mpty (Prop. ). In th squl w onsir two wight trs P = (V P,A P,ω P ) n D = (V D,A D,ω D ), root rsptivly in r P n r D. Proposition. W hv : η(p,d) = η(f(p,r P ), F(D,r D )). Proo. Sin th root o tr nnot limint y ny oprtion (mrging, ltion) involv in th inition o η, it my sn tht ny homomorphi lignmnt H o P with D hs orrsponing lignmnt H o F(P,r P ) with F(D,r D ) o sm ost, n th onvrs lso hols. Proposition. Lt i V P \ {r P },j V D \ {r D },i n(i),j n(j), Proo. Strightorwr. η(, ) = 0 η(p(i,i ), ) = η(f(p,i), ) + γ(ω P (i,i),0) η(f(p,i ), ) = η(p(i,i ), ) i C(i ) η(,d(j,j )) = η(, F(D,j)) + γ(0,ω D (j,j)) η(, F(D,j )) = η(,d(j,j )). j C(j ) Proposition. Lt i V P \ {p},j V D \ {},i n(i),j n(j). η(p(i,i ),D(j,j )) = η(p(i,i ), ) + η(,d(j,j )), γ(ω min P (i,i),ω D (j,j)) + η(f(p,i), F(D,j)), min j C(j){η(P(i,i ),D(j,j )) + η(, F(D,j) \ D(j,j))}, min i C(i){η(P(i,i ),D(j,j )) + η(f(p,i) \ P(i,i), )}.
14 Proo. Lt H n homomorphi lignmnt o P(i,i ) with D(j,j ), n lt H L = (V L,A L,ω L ) n H R = (V R,A R,ω R ) th lt n right grphs o H, rsptivly. Thr r svn possil ss:. H is n mpty st (it is hpr to rmov oth P(i,i ) n D(j,j ) thn to lign thm).. {(i,i),(j,j)} H.. A R, ing otin y mrging (j,j) with othr rs. In this s, thr is on n only on hil j o j, suh (j,j ) is mrg with (j,j) in, n thn ll D(j,j),j C(j) \ {j } r lt.. A L, ing otin y mrging (i,i) with othr rs. In this s, thr is on n only on hil i o i, suh (i,i ) is mrg with (i,i) in, n thn ll P(i,i),i C(i) \ {i } r lt. hl , vrsion - Mr 0 Css,,, justiy, rsptivly, th lins,,, o th xprssion o η(p(i,i ),D(j,j )) in th proposition. Th thr lst ss nnot l to ttr homomorphi lignmnt: 5. Th ltion o (i,i) n (j,j) nnot prrr to th rsizmnt (possil s ), us γ(ω P (i,i),0) + γ(0,ω D (j,j)) γ(ω P (i,i),ω D (j,j)). 6. I (i,i) ws lt, n not (j,j), thn only on P(i,i),i C(i) is lign with D(j,j ), th othr ing rmov. It is lss xpnsiv to mrg (i,i) with (i,i ) (possil s ), us γ(ω P (i,i),0) + γ(ω P (i,i ),ω D (j,j)) γ(ω P (i,i ),ω D (j,j)). 7. Th ltion o (j,j) is mor xpnsiv thn th mrging o (j,j) (possil s ), or th sm rsons s ov. Proposition 5. A F(P,i),B F(D,j), η(a,b) = min D(j,j) B {η(a,b \ {D(j,j)}) + η(,d(j,j))}, min P(i,i) A {η(a \ {P(i,i)},B) + η(p(i,i), )}, min P(i,i) A,D(j,j) B {η(a \ {P(i,i)},B \ {D(j,j)}) +η(p(i min,i),d(j,j))}, min P(i,i) A,B B {η(a \ {P(i,i)},B \ B ), +η(f(p,i ),B ) + γ(ω P (i,i ),0)}, min A A,D(j,j) B {η(a \ A,B \ {D(j,j)})+ η(a, F(D,j )j) + γ(0,ω D (j,j ))}. Proo. Lt H n homomorphi lignmnt o A F(P,i) with B F(D,j), n lt P(i,i) A n D(j,j) B. Thr r iv possil ss:. D(j,j) is not lign with lmnt o A,
15 . P(i,i) is not lign with lmnt o B,. P(i,i) is lign with D(j,j),. isjoint suprts o P(i,i) r lign with lmnts o B, 5. isjoint suprts o D(j,j) r lign with lmnts o A. Css,,,, 5 justiy, rsptivly, th lins,,,, 5 o th xprssion o η(a,b) in th proposition. hl , vrsion - Mr 0... Algorithm Using th rormultions in ov, w n now sign our lgorithm ollowing th ottom-up pproh. Algorithm : Homomorphi Alignmnt Distn or Root Trs Dt: pttrn root tr P, t root tr D Rsult: η(p,d) = η(f(p,r P ), F(D,r D )); // Prop. gin orh p V P, in suix orr o orh A F(P,p) o Comput η(a, ); // Prop. orh p n(p) \ {p} o Comput η(p(p,p ), ); // Prop. orh V D, in suix orr o orh B F(D, ) o Comput η(,b); // Prop. orh n() \ {} o Comput η(,d(, )); // Prop. orh p V P, in suix orr o orh V D, in suix orr o orh A F(P,p) o orh B F(D, ) o Comput η(a,b); // Prop.5 orh p n(p) \ {p} o orh n() \ {} o Comput η(p(p,p ),D(, )); // Prop. n... Complxity W not y N th mximum gr o vrtx in th pttrn tr or in th t tr, H th mximl hight o oth trs n S th mximl siz (numr o vrtis) o oth trs. W rll tht st o siz n hs n susts. Th tim omplxity o omputing h rormultion us in th lgorithm is: 5
16 η(p(i,i ), ) n η(,d(j,j )) O(). η(a, ) n η(, B) O(N). η(p(i,i ),D(j,j )) O(N). η(a,b) O(N N ). Comining ths omplxitis with th irnt loops o th lgorithm, w otin tht th totl omputtion is in O(S (N N +H N)) tim omplxity. I th mximl gr is oun, th totl omputtion is in O(S H ) tim omplxity. hl , vrsion - Mr 0.. Algorithm or unroot trs First, lt us giv n xprssion o th homomorphi lignmnt istn twn unroot trs, in untion o th istns twn ll thir possil root vrsions. Lt G = (V,E,ω) wight tr, lt r V, w not y G r, th irt wight tr root in r, suh tht G is th unirt grph ssoit to G r (s Fig.8). G G G g Figur 8: A tr G n th root trs G n G. Proposition 6. Lt P = (V P,E P,ω P ) n D = (V D,E D,ω D ) two wight trs. W hv: η(p,d) = min i VP,j V D {η(p i,d j )}. g g Proo. Lt G = (V,E,ω) grph, n r V vrtx o G. Noti tht: mrging ourring on vrtx v V \ {r} in G n our in G r, ltion, insrtion, rsizmnt, n ivision ourring in G n our in G r. On th othr hn, or h optiml homomorphi lignmnt H o P in D, it is sy to s tht thr xists p V P n V D, suh tht p n r not t y mrging. For xmpl, i D = (V D,E D,ω D ) is sugrph suh s η(p,d) = η(p,d ), p n n hosn s -gr vrtis o V P n 6
17 V D, rsptivly. As rsult, η(p,d) = η(p p,d ). Sin th homomorphi lignmnt is mor onstrin in th s o root trs thn in th s o unroot trs, w n ssur thn η(p,d) η(p,d ), V P, V D. To sum up, knowing tht η(p,d) η(p,d ), V P, V D, n tht thr xists p V P n V D, suh tht η(p,d) = η(p p,d ), w onlu tht η(p,d) = min i VP,j V D η(p i,d j ).... Niv lgorithm Lt P = (V P,E P,ω P ) n D = (V D,E D,ω D ) two wight trs. From proposition 5, w propos irst, niv lgorithm to omput η(p, D), onsisting o omputing th homomorphi lignmnt istn or ll oupls o wight root trs w n otin rom P n D, n kping th minimum rh. hl , vrsion - Mr 0 Complxity. Lt P = (V P,E P,ω P ) n D = (V D,E D,ω D ) two wight trs. As th numr o root trs w n otin rom n unirt tr is qul to th numr o vrtis o this grph, th numr o oupls o wight root trs w n otin rom P n D is qul to V P V D. Th totl omputtion is thn in O( V P V D ( P D ( D P + P D ) + h P h D ( P + D ))) tim omplxity, whr h P (rsptivly, h D ) is th mximl hight o root tr otin rom P (rsptivly, D). I th mximl gr is oun, th totl omputtion is in O( V P V D h P h D ) tim omplxity.... Optimiz lgorithm It is sy to s tht th ov lgorithm omputs th lignmnt o suprts o P n D mor thn on tim. Using ynmi progrmming n n pt orr o nvigtion in th tr, w n voi uslss omputtion. Lt P = (V P,E P,ω P ) n D = (V D,E D,ω D ) two unirt wight trs. W not y F(P,,),, V P th st o root trs P r, r V P, suh tht is n nstor o in P r. W not y n(p,,),, V P th st o vrtis x V P suh tht x is n nstor o in t lst on root tr in F(P,,). W not y C(P,,),, V P th st o o vrtis x V P suh tht x is hil o in t lst on root tr in F(P,,). It is sy to s tht or omputing η(p p (i,i ),D (j,j )) n η(f(p p,i), F(D,j)), w n to know η(p p (i,i),d (j,j)) or ll i C(P,i,p), j C(D,j,). W n strt y omputing η(p p (i,i ),D (j,j )) n η(f(p p,i), F(D,j)), or ll i (rsptivly, j) ing l o P p (rsptivly, D ), whih hv no hil, y inition, n ontinu itrtivly with ll vrtis whih hv ll thir hilrn lry omput. An pt orr o nvigtion or tr T = (V,E,ω) n otin y th ollowing lgorithm. 7
18 hl , vrsion - Mr 0 Algorithm : Orr o nvigtion omputtion lgorithm (omput- Orr) Dt: unroot tr T Rsult: list o oupls o vrtis L gin list o oupls o vrtis L LIFO quu o vrtis Q orh v V o i g(v) = thn push v in Q n whil Q o pop v o Q orh w N(v) o i (v,w) / L thn i x N(v) \ {w},(x,v) L thn push w in Q (v,w) t th n o L Complxity. Lt T = (V,E,ω) n unroot tr. Eh vrtx o gr (on) will put in th quu, thn, or h g, h o its vrtis will put twi in th quu. As V = E +, th omplxity o omputorr is in O( E ). Finl lgorithm. W n omput Homomorphi Alignmnt or unroot trs with improv omplxity, using this orr o nvigtion. 8
19 Algorithm : Homomorphi Alignmnt Distn or Unroot Trs Dt: pttrn root tr P, t root tr D Rsult: η(p, D) gin list o oupls o vrtis L P omputorr(p) list o oupls o vrtis L D omputorr(d) orh (p,p ) L P o orh A F(P p,p) o Comput η(a, ); // Prop. orh p n(p,p,p ) \ {p} o Comput η(p p (p,p ), ); // Prop. hl , vrsion - Mr 0 orh (, ) L D o orh B F(D,) o Comput η(,b); // Prop. orh n(d,, ) \ {} o Comput η(,d (, )); // Prop. orh (p,p ) L P o orh (, ) L D o orh A F(P p,p) o orh B F(D,) o Comput η(a,b); // Prop.5 orh p n(p,p,p ) \ {p} o orh n(d,, ) \ {} o Comput η(p p (p,p ),D (, )); // Prop. Comput η(p,d); // Prop. n Prop.6 n Complxity. Lt P = (V P,E P,ω P ) n D = (V D,E D,ω D ) two wight trs. Th initiliztion o L P n L D is in O( V P P + V D T ) tim omplxity. Osrv tht, or p V P, n(p,p,p ) \ {p} = V P. As rsult, p N(p) (p,p ) L P n(p,p,p ) \ {p} = ( V P ) V P. Comining th tim omplxitis o omputing th rormultions (givn in th S...) with th loops o th lgorithm, n tking into ount th ov 9
20 osrvtion, w otin tht th totl omputtion tim o this lgorithm is in O(S (N N + S N)) omplxity, with N n S in s in S... I th mximl gr is oun, th totl omputtion is in O(S ) tim omplxity. 5. Cut oprtion hl , vrsion - Mr 0 For th purpos o rmoving spurious rnhs without ny ost, w propos to intgrt th ut oprtion in our lignmnt. In [0], Wng t l. propos nw oprtion llowing to onsir only prt o tr. Lt G = (V,A,ω) wight tr. Cutting G t n r A, mns rmoving, thus iviing G into two sutrs G n G. Th ut oprtion onsists o utting G t n r A, thn onsiring only on o th two sutrs. Lt K sust o A. W us Cut(G,K,v) to not th sutr o G ontining v n rsulting rom utting G t ll rs in K. In th s o root tr, w onsir tht th root r G o G nnot rmov y th ut oprtion, n thn w us th nottion Cut(G,K) = Cut(G,K,r G ). In th s o root orst, w onsir tht th root o h root tr omposing th root orst nnot rmov y th ut oprtion, n thn w us th sm nottion thn ov: Cut(G,K). S Fig.9 or som xmpls o ut oprtion. g h i j g h i j g h i G Cut(G, {{, }}, ) Cut(G, {{, }, {h, j}}, ) k o t k o t l p q u l q u m n r s n s F Cut(F, {(l,m),(o, p)}) Figur 9: Exmpls o ut oprtions. Top row: on n unroot tr. Bottom row: on root orst. 0
21 Our min prolm n stt s ollows: Givn wight tr P = (V P,A P,ω P ) (th pttrn tr) n wight tr G D = (V D,A D,ω D ) (th t tr), in η ut (P,D) = min K AD,v V D {η(p,cut(d,k,v)} n th ssoit homomorphi lignmnt. In th s o root trs n root orsts, η ut (P,D) = min K AD {η(p,cut(d,k))}. 5.. Intgrtion o ut oprtion in our lgorithm It n sn tht th ut oprtion n intgrt in th homomorphi lignmnt y rpling th ltion o omplt sutrs y thir ut. In orr to otin th lgorithms or th omputtion o η ut, w just n to rpl: η y η ut in th rormultions n lgorithms o th Sus.. n. Prop. y th ollowing: hl , vrsion - Mr 0 Proposition 7. Lt i V P \ {p},j V D \ {},i n(i),j n(j), η ut (, ) = 0 η ut (P(i,i ), ) = η ut (F(P,i), ) + γ(ω P (i,i),0) η ut (F(P,i ), ) = η ut (P(i,i ), ) η ut (,D(j,j )) = 0 η ut (, F(D,j )) = 0. i C(i ) It is intrsting to rmrk tht th omplxity is not moii. 6. Exprimnttion 6.. Usg o homomorphi lignmnt Thr r svrl wys to us th homomorphi lignmnt: I w hv no priori knowlg oth on pttrn tr P n on t tr D, w n to us th homomorphi lignmnt on th two unroot trs. In this s, th omplxity is in O( V P V D ). I w wnt to sur tht spii vrtx v in th t tr is lign with spii vrtx w in th t tr (or xmpl i w r sur thn th vrtx o th h in th t is th on with th highst z-oorint), w n us th homomorphi lignmnt twn P v n D w. In this s, th omplxity is in O( V P V D h P h D ), whr h P (rsptivly, h D ) rprsnts th hight o P (rsptivly, D). I w wnt to sur tht spii vrtx v in th mol tr is lign (i.. thr is no mrging on v), w n us th homomorphi lignmnt twn P v n D, y sussivly omputing th homomorphi lignmnt twn P v n D w, or ll w V D, n using optimiztions s in... In this s, th omplxity is in O( V P h P V D ).
22 I w wnt to sur tht spii vrtx v in th t tr is lign (i.. thr is no mrging or ut on v), w n us th homomorphi lignmnt twn P n D v, using th sm mtho s ov. In this s, th omplxity is in O( V P V D h D ). In our pplition, onsisting to in th initil pos o sujt, w n t lst ssum tht th torso o th sujt will lign. Thn, w n us th mthing with O( V P h P V D ) or th initiliztion. For th trking, i prt o th sujt is stti, w n us th lst lignmnt o this prt or otin mthing in O( V P V D h P h D ). hl , vrsion - Mr Rsults Our mol tr ontins svn vrtis, rprsnting h, torso, roth, th two hns n th two t. Exprimntlly, th t tr otin rom th sklton o th visul hull hs gr oun y, n its numr o vrtis is twn svn n twnty, with Gussin proility rprtition ntr on tn. All th rsults hv n otin on omputr with prossor Intl(R) Cor(TM) Qu Q800 t. GHz n Go o RAM, with Linux, Uuntu 9.0. Th lgorithms hv n implmnt in C Sp Protool. To in th vrg omputtion tim o involv lgorithms, w hv rnomly gnrt pttrn trs, n or h on, t trs, yiling 0 pirs o trs. Eh pttrn tr hs svn vrtis, on o whih hs gr qul to. Eh t tr hs t lst on -gr vrtx. Th rsults or oth lignmnt n homomorphi lignmnt lgorithms, or th irnt kins o trs, r shown in igur 0. Disussion. For our purpos o initilizing th pos o sujt, w n s tht in th vrg s ( V = ), th homomorphi lignmnt n omput vry quikly (rquny 00), vn in th s o unroot trs. Howvr, w prr to us th homomorphi lignmnt with root pttrn tr, us o its ttr sp, without loss o prision. Th min osrvtion w n o, in rgr o th rsults, is th wk irn o prormns twn lignmnt n homomorphi lignmnt in prti, vn i thr is signiint irn o omplxity twn lignmnt n homomorphi lignmnt. It is u to smll siz o th trs involv hr, n to th t tht, vn i th gr o th trs is oun, n y this wy, n onsir s onstnt, th omputtion o th lignmnt (or homomorphi lignmnt) o suorsts tk lrg prt o th omputtion tim. This omputtion prt ing similr or oth lgorithms, th rst (whr th omplxity irs) is lss signiint in rgr o th sp.
23 rquny (Hz) Frqunis or Vp = 7, on root trs rquny (Hz) Frqunis or Vp = 7, on root pttrn tr, unroot t tr hl , vrsion - Mr 0 rquny (Hz) Frqunis or Vp = 7, on unroot trs V Alignmnt Homomorphi Alignmnt Figur 0: Frqunis o lignmnt n homomorphi lignmnt or vril sizs o t tr, or th irnt rooting ss Aury Protool. Eh xprimnt onsists o th ollowing:. W rnomly gnrt pttrn tr P.. W gnrt t tr D rom P in two stps: wight vrition: w rnomly ltr th g wights y givn mount o vrition. struturl nois: w rnomly nw vrtis y thr wys, orrsponing to th irnt typs o nois: splitting n xisting vrtx, n linking th two prts y 0-wight g (splitt vrtis), ing nw -gr vrtx y th split o n g (uslss -gr vrtis), n ing nw -gr vrtx, link y n rnomly wight g (spurious rnhs n ghost lims).. W omput th lignmnt n th homomorphi lignmnt twn P n D.. Th prision is givn y th prntg o goo mthings, tht is th prntg o pttrn tr vrtis tht mth with thir quivlnt in th
24 t tr (whih is known, oring to th ov protool to gnrt th t tr). Th rsults, otin y vrging prisions ovr 000 xprimnts, r shown on Fig.. % o goo mth hl , vrsion - Mr 0 % o goo mth % o struturl nois % o struturl nois Alignmnt % o struturl nois Homomorphi Alignmnt Figur : Prision with irnt prnts o wight vrition, or irnt sizs o pttrn tr. First row: pttrn tr with 0 vrtis. Son row: pttrn tr with 0 vrtis. Columns, rom lt to right: 0%, 0% n 50% o wight vrition. Disussion. Th irst importnt point whih n osrv is tht homomorphi lignmnt giv lwys prt mthings whn only struturl nois ours. In th othr ss, th homomorphi lignmnt glolly givs mor urt mthing thn th lignmnt, spilly in rgr o th struturl nois. Howvr, in s o high wight vrition n low struturl nois, th rsults o lignmnt r ttr thn thos o homomorphi lignmnt. It is u to spil s o sutr n wight vrition, whih ts th ury o homomorphi lignmnt ut not th lignmnt (s Fig. or n xmpl). In th s o our pplition, w mpirilly osrv wight vrition twn 0 n prnt, n struturl nois twn 0 n 00 prnt. For th mjority o ths ss, homomorphi lignmnt giv snsily ttr rsults Pos Initiliztion W hv hk th lignmnt on svrl typs o visul hulls, with irnt rsolutions (6 n 8 ), with or without spurious rnhs n ghosts lims. Som o ths rsults r shown in Fig.. Th ghost lim n mth y th lgorithm only i its position on th sklton is th sm s nothr lim, n i it hs pproximtly th sm lngth. In th othr ss, it is sussully rmov.
25 P P 0 0 Alignmnt Homomorphi Alignmnt D D Figur : Spil s whr lignmnt is ttr thn homomorphi lignmnt. First olumn: P is th pttrn tr, D is otin rom P y wight vrition o 0% on {, }, n y ing nw -gr vrtx, link to y n g wight y. Son olumn: optiml lignmnt. P = P n D = Cut(D, {{, }}, ). Aury is qul to 00%. Lst olumn: homomorphi lignmnt. P n D r lry homomorphi. P = P n D = MK(D). Aury is qul to 50%. P 0 D hl , vrsion - Mr 0 Th spurious rnhs o not istur th goo lignmnt o th mol on th t. Th only s o lignmnt hs n otin on vry low qulity visul hull, whr th lngth o lgs ws shortr thn th lngth o rms. This s n solv y rooting th mol tr on th h, n th t tr on th vrtx with highst z-oorint. T H C A A F F A T C H A H A T A A A C F F F F F F Figur : Exmpls o rsults otin on D shps with irnt rsolutions n noiss: grn voxls rprsnt th points mthing with pttrn tr. C T H 7. Conlusion In this ppr, w hv introu nw typ o lignmnt twn wight trs, th homomorphi lignmnt, tking into ount th topology n voiing th nois inu y spurious rnhs, splitt n uslss -gr vrtis. W hv lso vlop svrl roust lgorithms to omput it with goo omplxity, whih nl its pplition in rl tim or motion ptur purpos. In utur works, w will tk into ount mor usul inormtion on th mol, suh s sptil oorints o t vrtis, n inlu thm in our lgorithm, or ttr roustnss. Finlly, using this lignmnt, w will propos nw st mtho o pos initiliztion or motion ptur pplitions. 5
26 Rrns [] T. Moslun, A. Hilton, V. Krügr, A survy o vns in vision-s humn motion ptur n nlysis, Computr Vision n Img Unrstning 0 (-) (006) [] T. Moslun, E. Grnum, A survy o omputr vision-s humn motion ptur, Computr Vision n Img Unrstning 8 () (00) 68. [] A. Lurntini, Th visul hull onpt or silhoutt-s img unrstning, IEEE Trnstions on Pttrn Anlysis n Mhin Intllign 6 () (99) [] K. Chung, S. Bkr, T. Kn, Shp-rom-silhoutt o rtiult ojts n its us or humn oy kinmtis stimtion n motion ptur, Computr Vision n Pttrn Rognition, IEEE Computr Soity Conrn on (00) 77. hl , vrsion - Mr 0 [5] B. Mihou, E. Guillou, H. Brino, S. Boukz, Rl-Tim Mrkr-r Motion Cptur rom multipl mrs, in: IEEE th Intrntionl Conrn on Computr Vision, 007. ICCV 007., 007, pp. 7. [6] L.F. Bstos n J. Tvrs, Mthing o ojts nol points improvmnt using optimiztion, Invrs Prolms in Sin n Enginring, (5) (006) [7] F.P.M. Olivir n J.M.R.S. Tvrs, Algorithm o ynmi progrmming or optimiztion o th glol mthing twn two ontours in y orr points, CMES: Computr Moling in Enginring & Sins, () (008). [8] F.P.M. Olivir, J.M.R.S. Tvrs, n C. Sour, Mthing ontours in imgs through th us o urvtur, istn to ntroi n glol optimiztion with orr-prsrving onstrint, CMES: Computr Moling in Enginring & Sins, () (009) 9 0. [9] C. Chu, O. Jnkins, M. Mtri, Mrkrlss kinmti mol n motion ptur rom volum squns, Computr Vision n Pttrn Rognition, IEEE Computr Soity Conrn on (00) 75. [0] C. Mnir, E. Boyr, B. Rin, sklton-s oy pos rovry, in: DPVT 06: Proings o th Thir Intrntionl Symposium on D Dt Prossing, Visuliztion, n Trnsmission (DPVT 06), IEEE Computr Soity, Wshington, DC, USA, 006, pp [] G. Brostow, I. Ess, D. Stly, V. Kwtr, Novl Skltl Rprsnttion or Artiult Crturs, in: Computr Vision - ECCV 00, Vol. 0 o LNCS, Springr, 00, pp
27 [] A. Torsllo, E. Hnok, A skltl msur o D shp similrity, Computr Vision n Img Unrstning 95 () (00) 9. [] X. Bi, L. Ltki, Pth similrity sklton grph mthing, IEEE Trnstions on Pttrn Anlysis n Mhin Intllign 0 (7) (008) 8 9. [] K. Siiqi, A. Shokounh, S. J. Dikinson, S. W. Zukr, Shok grphs n shp mthing, in: Intrntionl Conrn on Computr Vision, 998, pp. 9. [5] H. Sunr, D. Silvr, N. Ggvni, S. Dikinson, Sklton s shp mthing n rtrivl, Shp Moling Intrntionl (00) 0 9. [6] H. Whitny, A st o topologil invrints or grphs, Amrin Journl o Mthmtis, 55 () (9) 5. hl , vrsion - Mr 0 [7] M. Plillo, K. Siiqi, S. Zukr, Mny-to-mny mthing o ttriut trs using ssoition grphs n gm ynmis, Ltur nots in omputr sin (00) [8] A. Torsllo, D. Hiovi-Row, M. Plillo, Polynomil-tim mtris or ttriut trs, IEEE Trnstions on Pttrn Anlysis n Mhin Intllign 7 (7) (005) [9] R. Pintr, O. Rokhlnko, D. Tsur, M. Ziv-Uklson, Approximt lll sutr homomorphism, Journl o Disrt Algorithms 6 () (008) [0] J. Wng, K. Zhng, Fining similr onsnsus twn trs: n lgorithm n istn hirrhy, Pttrn Rognition () (00) 7 7. [] K. Ti, Th Tr-to-Tr Corrtion Prolm, Journl o th ACM 6 () (979). [] T. Jing, L. Wng, K. Zhng, Alignmnt o trs - n ltrntiv to tr it, in: CPM 9: Proings o th 5th Annul Symposium on Comintoril Pttrn Mthing, Springr-Vrlg, Lonon, UK, 99, pp [] J. Jnsson, A. Lings, A st lgorithm or optiml lignmnt twn similr orr trs, LNCS 089 (00) 0. [] E. Tnk, K. Tnk, Th tr-to-tr iting prolm., Intrntionl Journl o Pttrn Rognition n Artiiil Intllign () (988) 0. [5] G. Vlint, An iint ottom-up istn twn trs, Intrntionl Symposium on String Prossing n Inormtion Rtrivl 0 (00) 0. 7
28 [6] K. Zhng, Algorithms or th onstrin iting istn twn orr ll trs n rlt prolms, Pttrn Rognition 8 () (995) 6 7. [7] S. Slkow, Th Tr-to-Tr Eiting Prolm, Inormtion Prossing Lttrs 6 (6) (977) [8] W. Yng, Intiying Syntti irns Btwn Two Progrms, Sotwr - Prti n Exprin (7) (99) [9] J. Wng, K. Zhng, C. Chng, Intiying pproximtly ommon sustruturs in trs s on rstrit it istn, Inormtion Sins: n Intrntionl Journl (-) (999) [0] J. Wng, K. Zhng, G. Chng, D. Shsh, Fining pproximt pttrns in unirt yli grphs, Pttrn Rognition 5 () (00) 7 8. hl , vrsion - Mr 0 8
Reading. Minimum Spanning Trees. Outline. A File Sharing Problem. A Kevin Bacon Problem. Spanning Trees. Section 9.6
Rin Stion 9.6 Minimum Spnnin Trs Outlin Minimum Spnnin Trs Prim s Alorithm Kruskl s Alorithm Extr:Distriut Shortst-Pth Alorithms A Fil Shrin Prolm Sy unh o usrs wnt to istriut il monst thmslvs. Btwn h
More informationOutline. Binary Tree
Outlin Similrity Srh Th Nikolus Augstn Fr Univrsity of Bozn-Bolzno Fulty of Computr Sin DIS 1 Binry Rprsnttion of Tr Binry Brnhs Lowr Boun for th Eit Distn Unit 10 My 17, 2012 Nikolus Augstn (DIS) Similrity
More informationSchedule C. Notice in terms of Rule 5(10) of the Capital Gains Rules, 1993
(Rul 5(10)) Shul C Noti in trms o Rul 5(10) o th Cpitl Gins Ruls, 1993 Sttmnt to sumitt y trnsror o shrs whr thr is trnsr o ontrolling intrst Prt 1 - Dtils o Trnsror Nm Arss ROC No (ompnis only) Inom Tx
More informationAlgorithmic Aspects of Access Networks Design in B3G/4G Cellular Networks
Algorithmi Aspts o Ass Ntworks Dsign in BG/G Cllulr Ntworks Dvi Amzllg, Josph (Si) Nor,DnnyRz Computr Sin Dprtmnt Thnion, Hi 000, Isrl {mzllg,nny}@s.thnion..il Mirosot Rsrh On Mirosot Wy, Rmon, WA 980
More informationLink-Disjoint Paths for Reliable QoS Routing
Link-Disjoint Pths or Rlil QoS Routing Yuhun Guo, Frnno Kuiprs n Pit Vn Mighm # Shool o Eltril n Inormtion Enginring, Northrn Jiotong Univrsity, Bijing, 000, P.R. Chin Fulty o Inormtion Thnology n Systms,
More informationUses for Binary Trees -- Binary Search Trees
CS122 Algorithms n Dt Struturs MW 11:00 m 12:15 pm, MSEC 101 Instrutor: Xio Qin Ltur 10: Binry Srh Trs n Binry Exprssion Trs Uss or Binry Trs Binry Srh Trs n Us or storing n rtriving inormtion n Insrt,
More informationDiagram Editing with Hypergraph Parser Support
Copyright 1997 IEEE. Pulish in th Proings o VL 97, Sptmr 23-26, 1997 in Cpri, Itly. Prsonl us o this mtril is prmitt. Howvr, prmission to rprint/rpulish this mtril or vrtising or promotionl purposs or
More informationDistributed Systems Principles and Paradigms. Chapter 11: Distributed File Systems. Distributed File Systems. Example: NFS Architecture
Distriut Systms Prinipls n Prigms Mrtn vn Stn VU mstrm, Dpt. Computr Sin stn@s.vu.nl Chptr 11: Vrsion: Dmr 10, 2012 1 / 14 Gnrl gol Try to mk fil systm trnsprntly vill to rmot lints. 1. Fil mov to lint
More informationEnhancing Downlink Performance in Wireless Networks by Simultaneous Multiple Packet Transmission
Enhning Downlink Prormn in Wirlss Ntworks y Simultnous Multipl Pkt Trnsmission Zhngho Zhng n Yunyun Yng Dprtmnt o Eltril n Computr Enginring, Stt Univrsity o Nw York, Stony Brook, NY 11794, USA Astrt In
More informationLast time Interprocedural analysis Dimensions of precision (flow- and context-sensitivity) Flow-Sensitive Pointer Analysis
Flow-Insnsitiv Pointr Anlysis Lst tim Intrprocurl nlysis Dimnsions of prcision (flow- n contxt-snsitivity) Flow-Snsitiv Pointr Anlysis Toy Flow-Insnsitiv Pointr Anlysis CIS 570 Lctur 12 Flow-Insnsitiv
More informationIncrEase: A Tool for Incremental Planning of Rural Fixed Broadband Wireless Access Networks
InrEs: A Tool or Inrmntl Plnning o Rurl Fix Bron Wirlss Ass Ntworks Giomo Brnri n Mhsh K. Mrin Shool o Inormtis Th Univrsity o Einurgh, UK Frnso Tlmon n Dmitry Rykovnov EOLO L NGI SpA, Miln, Itly Astrt
More informationOracle PL/SQL Programming Advanced
Orl PL/SQL Progrmming Avn In orr to lrn whih qustions hv n nswr orrtly: 1. Print ths pgs. 2. Answr th qustions. 3. Sn this ssssmnt with th nswrs vi:. FAX to (212) 967-3498. Or. Mil th nswrs to th following
More informationNetwork Decoupling for Secure Communications in Wireless Sensor Networks
Ntwork Doupling for Sur Communitions in Wirlss Snsor Ntworks Wnjun Gu, Xiol Bi, Srirm Chllppn n Dong Xun Dprtmnt of Computr Sin n Enginring Th Ohio-Stt Univrsity, Columus, Ohio 43210 1277 Emil: gu, ixi,
More information11 + Non-verbal Reasoning
Prti Tst + Non-vrl Rsoning R th instrutions rfully. Do not gin th tst or opn th ooklt until tol to o so. Work s quikly n s rfully s you n. Cirl th orrt lttr from th options givn to nswr h qustion. You
More informationOne Ring to Rule them All: Service Discovery and Binding in Structured Peer-to-Peer Overlay Networks
On Ring to Rul thm All: Srvi Disovry n Bining in Strutur Pr-to-Pr Ovrly Ntworks Migul Cstro Mirosot Rsrh, J J Thomson Clos, Cmrig, CB 0FB, UK. mstro@mirosot.om Ptr Drushl Ri Univrsity, 100 Min Strt, MS-1,
More informationHospitals. Internal Revenue Service Information about Schedule H (Form 990) and its instructions is at www.irs.gov/form990.
SCHEDULE H Hospitls OMB No. 1545-0047 (Form 990) Complt if th orgniztion nswr "Ys" to Form 990, Prt IV, qustion 20. Atth to Form 990. Opn to Puli Dprtmnt of th Trsury Intrnl Rvnu Srvi Informtion out Shul
More informationUsability Test Checklist
Crtifi Profssionl for Usility n Usr Exprin Usility Tsting (CPUX-UT) Vrsion.0, Jun 0 Pulishr: UXQB. V. Contt: info@uxq.org www.uxq.org Autorn: R. Molih, T. Gis, B. Rumml, O. Klug, K. Polkhn Contnt Lgn...
More informationChapter 3 Chemical Equations and Stoichiometry
Chptr Chmicl Equtions nd Stoichiomtry Homwork (This is VERY importnt chptr) Chptr 27, 29, 1, 9, 5, 7, 9, 55, 57, 65, 71, 75, 77, 81, 87, 91, 95, 99, 101, 111, 117, 121 1 2 Introduction Up until now w hv
More informationDiscovering Petri Nets From Event Logs
Disovring Ptri Nts From Evnt Logs W.M.P. vn r Alst n B.F. vn Dongn Dprtmnt of Mthmtis n Computr Sin, Thnish Univrsitit Einhovn, Th Nthrlns. {W.M.P.v..Alst,B.F.v.Dongn}@tu.nl Astrt. As informtion systms
More informationUpward Planar Drawings of Series-Parallel Digraphs with Maximum Degree Three
Upwr Plnr Drwins of ris-prlll Dirps wit Mximum Dr Tr (Extn Astrt) M. Aul Hssn m n M. iur Rmn Dprtmnt of Computr in n Eninrin, Bnls Univrsity of Eninrin n Tnoloy (BUET). {sm,siurrmn}@s.ut.. Astrt. An upwr
More informationPredicting Current User Intent with Contextual Markov Models
Priting Currnt Usr Intnt with Contxtul Mrkov Mols Juli Kislv, Hong Thnh Lm, Mykol Phnizkiy Dprtmnt of Computr Sin Einhovn Univrsity of Thnology P.O. Box 513, NL-5600MB, th Nthrlns {t.l.hong, j.kislv, m.phnizkiy}@tu.nl
More informationApproximate Subtree Identification in Heterogeneous XML Document Collections
Approximat Sutr Intiiation in Htrognous XML Doumnt Colltions Ismal Sanz 1, Maro Msiti 2, Giovanna Gurrini 3 an Raal Brlanga 1 1 Univrsitat Jaum I, Spain 2 Univrsità gli Stui i Milano, Italy 3 Univrsità
More informationWhere preparation meets opportunity. My Academic Planner. Early Academic Outreach Program (EAOP)
Whr prprtion mts opportunity. My Ami Plnnr Erly Ami Outrh Prorm (EAOP) Follow this 4-stp pln to prpr or mission to th Univrsity o Cliorni (UC), Cliorni Stt Univrsity (CSU) n mny inpnnt olls with similr
More informationEconomics 340: International Economics Andrew T. Hill Nontariff Barriers to Trade
Eonomis 340: Intrntionl Eonomis Anrw T. Hill Nontri Brrirs to Tr Txtook Rings: ugl & Linrt, Intrntionl Eonomis, 11th Eition, pp. 139-162. 10th Eition, pp. 133-153. Txtook W Sit: Ky Grph 3 t http://www.mhh.om/onomis/pugl
More informationCompactPCI Connectors acc. to PIGMG 2.0 Rev. 3.0
Ctlog E 074486 08/00 Eition ComptPCI Conntors. to PIGMG.0 Rv. 3.0 Gnrl Lt in 999 PCI Inustril Computr Mnufturrs Group (PICMG) introu th nw rvision 3.0 of th ComptPCI Cor Spifition. Vrsion 3.0 of this spifition
More informationLevel 3. Monday FRACTIONS ⅔ ⅗ 2) ⅔ =?/18. 1) What is a) ⅕ of 30? b) ⅖ of 30?
2014 Th Wkly Pln. All rights rsrv. Mony 2) ⅔ =?/18 1) Wht is ) ⅕ o 30? ) ⅖ o 30? 4) Us or = to show th rltionship twn th ollowing rtions: 3) Writ n quivlnt rtion or ½ ⅔ ⅗ 5) Brook pik ouqut o 24 lowrs.
More informationFundamentals of Tensor Analysis
MCEN 503/ASEN 50 Chptr Fundmntls of Tnsor Anlysis Fll, 006 Fundmntls of Tnsor Anlysis Concpts of Sclr, Vctor, nd Tnsor Sclr α Vctor A physicl quntity tht cn compltly dscrid y rl numr. Exmpl: Tmprtur; Mss;
More informationDinh Hong Giang 1,2, Ed Sarobol 2, * and Sutkhet Nakasathien 2 ABSTRACT
Kstsrt J. (Nt. Si.) 49 : 1-12 (215) Et o Plnt Dnsity n Nitrogn Frtilizr Rt on Growth, Nitrogn Us Eiiny n Grin Yil o Dirnt Miz Hyris unr Rin Conitions in Southrn Vitnm Dinh Hong Ging 1,2, E Srool 2, * n
More informationA122 MARION COUNTY HEALTH BUILDING HVAC, GLAZING AND LIGHTING RENOVATION 75% DOCUMENTS 08/31/2015
7 ' 7 /" ' " ' /" ' 9 /" ' 0" ' 0" ' 0" ' 0" ' " ' /" 0 NRL SHT NOTS IL VRIY XISTIN PRIOR TO WORK N NOTIY RHITT/NINR O ISRPNIS TWN RWINS N XISTIN ONITIONS. 0 0 0 PTH LOTIONS N IR PROOIN WHR XISTIN WLLS
More informationP U B L I C A T I O N I N T E R N E 1800 PARTIAL ORDER TECHNIQUES FOR DISTRIBUTED DISCRETE EVENT SYSTEMS: WHY YOU CAN T AVOID USING THEM
I R I P U B L I C A T I O N I N T E R N E 1800 N o S INSTITUT DE RECHERCHE EN INFORMATIQUE ET SYSTÈMES ALÉATOIRES A PARTIAL ORDER TECHNIQUES FOR DISTRIBUTED DISCRETE EVENT SYSTEMS: WHY YOU CAN T AVOID
More informationMATH PLACEMENT REVIEW GUIDE
MATH PLACEMENT REVIEW GUIDE This guie is intene s fous for your review efore tking the plement test. The questions presente here my not e on the plement test. Although si skills lultor is provie for your
More informationDiscovering Block-Structured Process Models From Event Logs Containing Infrequent Behaviour
Disovring Blok-Strutur Pross Mols From Evnt Logs Contining Infrqunt Bhviour Snr J.J. Lmns, Dirk Fhln, n Wil M.P. vn r Alst Einhovn Univrsity of Thnology, th Nthrlns {s.j.j.lmns,.fhln, w.m.p.v..lst}@tu.nl
More informationDistributed Process Discovery and Conformance Checking
Distriut Pross Disovry n Conormn Chkin Wil M.P. vn r Alst 1,2 1 Einhovn Univrsity o Thnoloy, Einhovn, Th Nthrlns 2 Qunsln Univrsity o Thnoloy, Brisn, Austrli www.vlst.om Astrt. Pross minin thniqus hv mtur
More informationTurkish Keyphrase Extraction Using Multi-Criterion Ranking
Turkish Kyphrs Extrtion Using Multi-Critrion Rnking Bhır Özmir Dpt. of Computr Enginring Bilknt Univrsity 06800 Bilknt Ankr, Turky Emil: ozmir@s.ilknt.u.tr Ilys Cikli Dpt. of Computr Enginring Bilknt Univrsity
More informationSEE PAGE 2 FOR BRUSH MOTOR WIRING SEE PAGE 3 FOR MANUFACTURER SPECIFIC BLDC MOTOR WIRING EXAMPLES A
0V TO 0V SUPPLY +0V TO +0V RS85 ONVRTR 9 TO OM PORT ON P TO P OM PORT US 9600 U 8IT, NO PRITY, STOP, NO FLOW TRL. OPTO SNSOR # +0V TO +0V RS85 RS85 OPTO SNSOR # PHOTO TRNSISTOR OPTO SNSOR # L TO OTHR Z
More informationCPS 220 Theory of Computation REGULAR LANGUAGES. Regular expressions
CPS 22 Thory of Computation REGULAR LANGUAGES Rgular xprssions Lik mathmatical xprssion (5+3) * 4. Rgular xprssion ar built using rgular oprations. (By th way, rgular xprssions show up in various languags:
More informationBack left Back right Front left Front right. Blue Shield of California. Subscriber JOHN DOE. a b c d
Smpl ID r n sription o trms Bk lt Bk right Front lt Front right Provirs: Pls il ll lims with your lol BluCross BluShil lins in whos srvi r th mmr riv srvis or, whn Mir is primry, il ll Mir lims with Mir.
More informationRevised Conditions (January 2009) LLOYDS BANKING GROUP SHARE ISA CONDITIONS
Rvis Conitions (Jnury 2009) LLOYDS BANKING GROUP SHARE ISA CONDITIONS Contnts 1 Who r th prtis?... 2 Wht o wors n phrss in ol typ mn?... 3 Whn i my pln strt?... 4 How o I invst in my pln?... 5 Who owns
More informationOperational Procedure: ACNC Data Breach Response Plan
OP 2015/03 Oprtionl Prour: ACNC Dt Brh Rspons Pln This Oprtionl Prour is issu unr th uthority of th Assistnt Commissionr Gnrl Counsl n shoul r togthr with th ACNC Poliy Frmwork, whih sts out th sop, ontxt
More informationMatching Execution Histories of Program Versions
Mt Exuto Hstors o Prorm Vrsos Xyu Z Rv Gupt Dprtmt o Computr S T Uvrsty o Arzo Tuso, Arzo 85721 {xyz,upt}@s.rzo.u ABSTRACT W vlop mto or mt ym stors o prorm xutos o two prorm vrsos. T mts prou usul my
More informationWords Symbols Diagram. abcde. a + b + c + d + e
Logi Gtes nd Properties We will e using logil opertions to uild mhines tht n do rithmeti lultions. It s useful to think of these opertions s si omponents tht n e hooked together into omplex networks. To
More informationMenu Structure. Section 5. Introduction. General Functions Menu
Menu Structure Section 5 Introduction General Functions Menu Most workstation functions are accessed by menu selections. This section explains the menu structure and provides a tree structured view of
More informationSecurView 6-0-6 Antivirus Software Installation
SurViw 6-0-6 Antivirus Sotwr Instlltion 1. Introdution Antivirus sotwr is n tiv wy to ombt omputr viruss, trojns, worms, nd othr mliious sotwr tht my ttmpt to ompromis th intgrity o systm. It is ssntil
More informationChange Your History How Can Soccer Knowledge Improve Your Business Processes?
Symposium Inuurl Lctur o Hjo Rijrs, VU, 26-6-2015 Chn Your History How Cn Soccr Knowl Improv Your Businss Procsss? Wil vn r Alst TU/ n DSC/ 1970 born Oostrbk 1988-1992 CS TU/ 1992-1994 TS TU/ 1994-1996
More information1.- L a m e j o r o p c ió n e s c l o na r e l d i s co ( s e e x p li c a r á d es p u é s ).
PROCEDIMIENTO DE RECUPERACION Y COPIAS DE SEGURIDAD DEL CORTAFUEGOS LINUX P ar a p od e r re c u p e ra r nu e s t r o c o rt a f u e go s an t e un d es a s t r e ( r ot u r a d e l di s c o o d e l a
More informationStandard Conditions for Street Traders The Royal Borough of Kensington and Chelsea. Revised standard conditions for street trading
Stnr Conitions or Strt Trrs Th Royl Borough o Knsington n Chls Rvis stnr onitions or strt tring Th Royl Borough o Knsington n Chls strt tring linss stnr onitions 2006 1 Dinitions Th ollowing xprssions
More informationMANAGEMENT OF INFORMATION SECURITY AND FORENSICS
MANAGEMENT OF INFORMATION SECURITY AND FORENSICS CS 307 Ctlog Dsription PREREQUISITE: CS 0. Stuy of informtion surity n igitl fornsis using prtil s stuis. Emphsis is on vloping surity poliis, surity mngmnt
More informationProcess Mining Making Sense of Processes Hidden in Big Event Data
Pross Minin Mkin Sns o Prosss Hin in Bi Evnt Dt EIS Colloquium, 7-12-2012, TU/, Einovn Wil vn r Alst www.prossminin.or omplin-orint qustions, prolms n solutions prormn-orint qustions, prolms n solutions
More informationVictims Compensation Claim Status of All Pending Claims and Claims Decided Within the Last Three Years
Claim#:021914-174 Initials: J.T. Last4SSN: 6996 DOB: 5/3/1970 Crime Date: 4/30/2013 Status: Claim is currently under review. Decision expected within 7 days Claim#:041715-334 Initials: M.S. Last4SSN: 2957
More informationSummary of changes to Regulations recommended to the Senate by Graduate School Management Committee. Changed wording is shown in bold italics.
Summry of hngs to Rgultions rommn to th Snt y Grut Shool Mngmnt Committ. Chng woring is shown in ol itlis. Gnrl Rgultions for Dgrs y Rsrh n Thsis 1. Inlusion of th Dotor of Miin (MD) wr throughout. 2.
More informationc b 5.00 10 5 N/m 2 (0.120 m 3 0.200 m 3 ), = 4.00 10 4 J. W total = W a b + W b c 2.00
Chter 19, exmle rolems: (19.06) A gs undergoes two roesses. First: onstnt volume @ 0.200 m 3, isohori. Pressure inreses from 2.00 10 5 P to 5.00 10 5 P. Seond: Constnt ressure @ 5.00 10 5 P, isori. olume
More informationPLWAP Sequential Mining: Open Source Code
PL Sequentil Mining: Open Soure Code C.I. Ezeife Shool of Computer Siene University of Windsor Windsor, Ontrio N9B 3P4 ezeife@uwindsor. Yi Lu Deprtment of Computer Siene Wyne Stte University Detroit, Mihign
More informationGraph Theoretical Analysis and Design of Multistage Interconnection Networks
637 I TRNSTIONS ON OMPUTRS, VOL. -32, NO. 7, JULY 1983 [39].. svnt,.. jski, n. J. Kuck, "utomtic sign wit pnnc grps," in Proc. 17t s. utomt. on, I omput. Soc. TMSI, 1980, pp. 506-515. [40] M.. Mcrln, "
More information1. Definition, Basic concepts, Types 2. Addition and Subtraction of Matrices 3. Scalar Multiplication 4. Assignment and answer key 5.
. Definition, Bsi onepts, Types. Addition nd Sutrtion of Mtries. Slr Multiplition. Assignment nd nswer key. Mtrix Multiplition. Assignment nd nswer key. Determinnt x x (digonl, minors, properties) summry
More informationExample A rectangular box without lid is to be made from a square cardboard of sides 18 cm by cutting equal squares from each corner and then folding
1 Exmple A rectngulr box without lid is to be mde from squre crdbord of sides 18 cm by cutting equl squres from ech corner nd then folding up the sides. 1 Exmple A rectngulr box without lid is to be mde
More informationAttachment 1 Package D1-1 (Five (5) Locations) 9-26-13Revised 11-1-13
Space Identifier Near Gate ttachment Package - (Five (5) Locations) 9-26-3Revised --3 Proposed oncept Square Footage Minimum nnual Guarantee Term in Years --Z0 ustoms urrency xchange 98 $20,500 75-2-S06
More information1 Fractions from an advanced point of view
1 Frtions from n vne point of view We re going to stuy frtions from the viewpoint of moern lger, or strt lger. Our gol is to evelop eeper unerstning of wht n men. One onsequene of our eeper unerstning
More information1. Number of questions to be answered: ALL Multiple Choice (Section A) and 3 from 5 of the short answer questions (Section B)
LEEDS METROPOLITAN UNIVERSITY UK Cntr for Evnts Mngmnt (RESIT) Moul Titl: Evnts Mrkting Ativitis Ami Yr: 2011/12 Lvl: 4 Smstr: 2 Cours: BA(Hons)/ HND Evnt Mngmnt Intrnl Exminrs: Exmintion Dt: 2 n July
More informationRatio and Proportion
Rtio nd Proportion Rtio: The onept of rtio ours frequently nd in wide vriety of wys For exmple: A newspper reports tht the rtio of Repulins to Demorts on ertin Congressionl ommittee is 3 to The student/fulty
More informationA Note on Approximating. the Normal Distribution Function
Applid Mathmatical Scincs, Vol, 00, no 9, 45-49 A Not on Approimating th Normal Distribution Function K M Aludaat and M T Alodat Dpartmnt of Statistics Yarmouk Univrsity, Jordan Aludaatkm@hotmailcom and
More informationSKILL TEST IR(H) HELICOPTER SE ME Application and report form A. Udfyldes af ansøgeren/to be filled out by the applicant:
SKILL TEST IR(H) HELICOPTER SE ME Applition n rport orm A. Uyls nsørn/to ill out y th pplint: CPR-nr./Dt o Birth: Crtiikt nr./lin no.: (I ny) Ustn Stt/Stt o Lin Issu: Fornvn/First nm(s): Etrnvn/Lst nm:
More informationAC Circuits Three-Phase Circuits
AC Circuits Thr-Phs Circuits Contnts Wht is Thr-Phs Circuit? Blnc Thr-Phs oltgs Blnc Thr-Phs Connction Powr in Blncd Systm Unblncd Thr-Phs Systms Aliction Rsidntil Wiring Sinusoidl voltg sourcs A siml
More informationDecember Homework- Week 1
Dcmbr Hmwrk- Wk 1 Mth Cmmn Cr Stndrds: K.CC.A.1 - Cunt t 100 by ns nd by tns. K.CC.A.2 - Cunt frwrd bginning frm givn numbr within th knwn squnc (instd f hving t bgin t 1). K.CC.B.4.A - Whn cunting bjcts,
More informationModule 5. Three-phase AC Circuits. Version 2 EE IIT, Kharagpur
Module 5 Three-hse A iruits Version EE IIT, Khrgur esson 8 Three-hse Blned Suly Version EE IIT, Khrgur In the module, ontining six lessons (-7), the study of iruits, onsisting of the liner elements resistne,
More informationA Proxy Based Indirect Routing Scheme for Ad Hoc Wireless Networks
A Proxy Bs Inirt Routin Shm or A Ho Wirlss Ntworks Wook Choi n Sjl K. Ds Cntr or Rsrh in Wirlss Moility n Ntworkin (CRWMN Dprtmnt o Computr Sin n Eninrin Th Univrsity o Txs t Arlinton Arlinton, TX 719-1
More informationFunctional Valuation of Ecosystem Services on Bonaire
Funtionl Vlution of Eosystm Srvis on Bonir - An ologil nlysis of osystm funtions provi y orl rfs - Ingri J.M. vn Bk MS Aquultur n Fishris Spilistion Mrin Rsours n Eology Wgningn Univrsity Th Nthrlns MS-
More informationLINEAR TRANSFORMATIONS AND THEIR REPRESENTING MATRICES
LINEAR TRANSFORMATIONS AND THEIR REPRESENTING MATRICES DAVID WEBB CONTENTS Liner trnsformtions 2 The representing mtrix of liner trnsformtion 3 3 An ppliction: reflections in the plne 6 4 The lgebr of
More informationHigher. Exponentials and Logarithms 160
hsn uknt Highr Mthmtics UNIT UTCME Eponntils nd Logrithms Contnts Eponntils nd Logrithms 6 Eponntils 6 Logrithms 6 Lws of Logrithms 6 Eponntils nd Logrithms to th Bs 65 5 Eponntil nd Logrithmic Equtions
More informationQuick Guide to Lisp Implementation
isp Implementtion Hndout Pge 1 o 10 Quik Guide to isp Implementtion Representtion o si dt strutures isp dt strutures re lled S-epressions. The representtion o n S-epression n e roken into two piees, the
More informationUniversity of Mumbai Application for selection as Best College
Univrsity o Mumi Applition or sltion s Bst Collg 1 Inormtion o th Sponsoring Soity Nm o th Sponsoring Soity with Rgistrtion No. Nms o th Bor o Trusts Whthr Sponsoring Soity is running ny othr Institutions
More informationFive-Layer Density Column
Five-Layer ensity olumn density column consists of layers of liquids of different densities which do not mix with each other, and which are clearly distinguishable from each other. The highest density
More informationImmigrant Citizens Survey - questionnaire
Immigrnt Citizns Survy - qustionnir Short introution to r y intrviwrs: "Goo morning/trnoon/vning, th [Orgnistion o Sintii Bor Prtnr or Polling Prtnr -- not Suontrtor] is oing stuy o how popl rom irnt kgrouns
More informationPolynomial Functions. Polynomial functions in one variable can be written in expanded form as ( )
Polynomil Functions Polynomil functions in one vrible cn be written in expnded form s n n 1 n 2 2 f x = x + x + x + + x + x+ n n 1 n 2 2 1 0 Exmples of polynomils in expnded form re nd 3 8 7 4 = 5 4 +
More informationAngles 2.1. Exercise 2.1... Find the size of the lettered angles. Give reasons for your answers. a) b) c) Example
2.1 Angles Reognise lternte n orresponing ngles Key wors prllel lternte orresponing vertilly opposite Rememer, prllel lines re stright lines whih never meet or ross. The rrows show tht the lines re prllel
More informationPIN #1 ID FIDUCIAL LOCATED IN THIS AREA TOP VIEW. ccc C SIDE VIEW
Packag iagrams ruary 20 all W Packag Option : i0 P imnsions in illimtrs ata ht r PI # I IUI OT I TI R (X) 2 OTTO VIW. X Ø s TOP VIW Ø.0 Ø.0 I VIW OT:. IIO TOR PR Y. 99. 2. IIO R I IITR. IIO I UR T T XIU
More informationCHAPTER 31 CAPACITOR
. Given tht Numer of eletron HPTER PITOR Net hrge Q.6 9.6 7 The net potentil ifferene L..6 pitne v 7.6 8 F.. r 5 m. m 8.854 5.4 6.95 5 F... Let the rius of the is R re R D mm m 8.85 r r 8.85 4. 5 m.5 m
More informationThe Swedish Radiation Protection Institute s Regulations on X- ray Diagnostics;
SSI FS 2000:2 Th Swish Rition Prottion Institut s Rgultions on X- ry Dignostis; issu on April 28, 2000. On th sis of 7 of th Rition Prottion Orinn (1988:293) n ftr onsulttion with th Ntionl Bor of Hlth
More information4.1 Interval Scheduling. Chapter 4. Greedy Algorithms. Interval Scheduling. Interval Scheduling: Greedy Algorithms
1 ptr 4 41 Intrvl Suln ry lortms Sls y Kvn Wyn opyrt 5 Prson-son Wsly ll rts rsrv Intrvl Suln Intrvl Suln: ry lortms Intrvl suln Jo strts t s n nss t Two os omptl ty on't ovrlp ol: n mxmum sust o mutully
More informationThe art of Paperarchitecture (PA). MANUAL
The rt of Pperrhiteture (PA). MANUAL Introution Pperrhiteture (PA) is the rt of reting three-imensionl (3D) ojets out of plin piee of pper or ror. At first, esign is rwn (mnully or printe (using grphil
More informationRegular Sets and Expressions
Regulr Sets nd Expressions Finite utomt re importnt in science, mthemtics, nd engineering. Engineers like them ecuse they re super models for circuits (And, since the dvent of VLSI systems sometimes finite
More informationSEE PAGE 2 FOR BRUSH MOTOR WIRING SEE PAGE 3 FOR MANUFACTURER SPECIFIC BLDC MOTOR WIRING EXAMPLES
V TO 0V SUPPLY TO P OM PORT GROUN +0V TO +0V RS85 ONVRTR 9 TO OM PORT ON P US 9600 U 8IT, NO PRITY, STOP, NO FLOW TRL. NOT: INSTLL SHORTING JUMPR ON FOR V-5V OPRTION. JUMPR MUST RMOV FOR VOLTGS >5V TO
More informationEquivalence Checking. Sean Weaver
Equivlene Cheking Sen Wever Equivlene Cheking Given two Boolen funtions, prove whether or not two they re funtionlly equivlent This tlk fouses speifilly on the mehnis of heking the equivlene of pirs of
More informationOperation Transform Formulae for the Generalized. Half Canonical Sine Transform
Appl Mhmcl Scnc Vol 7 3 no 33-4 HIKARI L wwwm-hrcom Opron rnorm ormul or h nrl Hl Cnoncl Sn rnorm A S uh # n A V Joh * # ov Vrh Inu o Scnc n Humn Amrv M S In * Shnrll Khnlwl Coll Aol - 444 M S In luh@mlcom
More informationHomework 3 Solutions
CS 341: Foundtions of Computer Science II Prof. Mrvin Nkym Homework 3 Solutions 1. Give NFAs with the specified numer of sttes recognizing ech of the following lnguges. In ll cses, the lphet is Σ = {,1}.
More informationOutside Cut 1 of fabric Cut 1 of interfacing
a a Outsi Cut o abric Cut o intracing a a b b Outsi Cut o abric Cut o intracing Placmnt lin or Mony Pockts Dix Not: F. Cut Fol b. Pin t /8 in 5. Nx bottom pics sw th 6. For t Prss, 7. Lay togth on th 8.
More informationLearning Schemas for Unordered XML
Lning Shms fo Unodd XML Rdu Ciunu Univsity of Lill & INRIA, Fn du.iunu@ini.f S lwk Stwoko Univsity of Lill & INRIA, Fn slwomi.stwoko@ini.f Astt W onsid unodd XML, wh th ltiv od mong silings is ignod, nd
More informationChapter. Contents: A Constructing decimal numbers
Chpter 9 Deimls Contents: A Construting deiml numers B Representing deiml numers C Deiml urreny D Using numer line E Ordering deimls F Rounding deiml numers G Converting deimls to frtions H Converting
More informationUsing CrowdSourcing for Data Analytics
Using CrowdSouring for Dt Anlytis Hetor Gri-Molin (work with Steven Whng, Peter Lofgren, Adity Prmeswrn nd others) Stnford University 1 Big Dt Anlytis CrowdSouring 1 CrowdSouring 3 Rel World Exmples Ctegorizing
More informationIntegration by Substitution
Integrtion by Substitution Dr. Philippe B. Lvl Kennesw Stte University August, 8 Abstrct This hndout contins mteril on very importnt integrtion method clled integrtion by substitution. Substitution is
More informationMaximum area of polygon
Mimum re of polygon Suppose I give you n stiks. They might e of ifferent lengths, or the sme length, or some the sme s others, et. Now there re lots of polygons you n form with those stiks. Your jo is
More informationClause Trees: a Tool for Understanding and Implementing Resolution in Automated Reasoning
Cluse Trees: Tool for Understnding nd Implementing Resolution in Automted Resoning J. D. Horton nd Brue Spener University of New Brunswik, Frederiton, New Brunswik, Cnd E3B 5A3 emil : jdh@un. nd spener@un.
More informationGENERAL REGULATIONS FOR DEGREES BY RESEARCH AND THESIS
REG/14/463(1) 2014-15 GENERAL REGULATIONS FOR DEGREES BY RESEARCH AND THESIS Applil to stunts in ll Stgs/yrs of progrmms Ths Gnrl Rgultions, pprov y th Univrsity Snt, st out th rquirmnts for rsrh wrs ssss
More informationIf two triangles are perspective from a point, then they are also perspective from a line.
Mth 487 hter 4 Prtie Prolem Solutions 1. Give the definition of eh of the following terms: () omlete qudrngle omlete qudrngle is set of four oints, no three of whih re olliner, nd the six lines inident
More informationAn overview on XML similarity: background, current trends and future directions
Sumitt to Elsvi Sin An ovviw on XML simility: kgoun, unt tns n futu itions Jo Tkli, Rih Chi *, n Kokou Ytongnon LE2I Lotoy UMR-CNRS, Univsity of Bougogn, 21078 Dijon Cx Fn ABSTRACT In nt ys, XML hs n stlish
More informationNew Basis Functions. Section 8. Complex Fourier Series
Nw Basis Functions Sction 8 Complx Fourir Sris Th complx Fourir sris is prsntd first with priod 2, thn with gnral priod. Th connction with th ral-valud Fourir sris is xplaind and formula ar givn for convrting
More informationTransistor is a semiconductor device with fast respond and accuracy. There are two types
Tranitor Amplifir Prpard y: Poa Xuan Yap Thory: Tranitor i a miondutor dvi with fat rpond and auray. Thr ar two typ of tranitor, a Bipolar Juntion Tranitor and a Fild Efft Tranitor. Hr, w will looking
More informationNEGLIGENT INFLICTION OF EMOTIONAL DISTRESS IS STILL ALIVE IN TEXAS
NEGLIGENT INFLICTION OF EMOTIONAL DISTRESS IS STILL ALIVE IN TEXAS (I H Oy B Sy W) By F A. Sp 1 G W. (W) Hz 2 M Tx wy w p v w w Sp C Tx b 1993 By v. K. 3 Hwv, b Tx k k. T y b pp, b vb, y. I Tx p b by jy
More informationEarthquake Hazard Zones: The relative risk of damage to Canadian buildings
Earthquake Hazard Zones: The relative risk of damage to Canadian buildings by Paul Kovacs Executive Director, Institute for Catastrophic Loss Reduction Adjunct Research Professor, Economics, Univ. of Western
More informationQuality and Pricing for Outsourcing Service: Optimal Contract Design
Qulity nd Pricing for Outsourcing Srvic: Optiml Contrct Dsign Smr K. Mukhopdhyy Univrsity of Wisconsin-Milwuk Co-uthor: Xiowi Zhu, Wst Chstr Univrsity of PA Third nnul confrnc, POMS Collg of Srvic Oprtions
More information5.4 Exponential Functions: Differentiation and Integration TOOTLIFTST:
.4 Eponntial Functions: Diffrntiation an Intgration TOOTLIFTST: Eponntial functions ar of th form f ( ) Ab. W will, in this sction, look at a spcific typ of ponntial function whr th bas, b, is.78.... This
More information