Detecting Change in Snapshot Sequences
|
|
- Kimberly Neal
- 5 years ago
- Views:
Transcription
1 Dttn Cn n Snpsot Squns Mnzn S n Stpn Wntr Dprtnt o Gots, Unvrsty o Mourn, Vtor, 3010, ustr.s@pr.un.u.u, wntr@un.u.u strt. Wrss snsor ntwors r poy to ontor yn orp pnon, or ots, ovr sp n t. Ts ppr prsnts nw sptotpor t o or yn r ots n snsor ntwors. Our o supports or t rst t t nyss o n n squns o snpsots tt r ptur y rnt rnurty o osrvtons, n our o ows ot nrnt n nonnrnt ns. Ts ppr ouss on ttn quttv spt ns, su s r n spt o r ots. ntrz ort s vop, su tt spt ns n nty tt y n-ntwor rton o ntrz tsts. 1 Introuton Mny spt pnon r ontnuousy nn n t n sp [5]. Envronnt ontorn, or xp, ouss spy on rs o nvronnt sturn, su s rzn, rtzn, pouton, n on. Envronnt sturn s on o t y rvn ors or nvronnt ns, n rnt sturn vnts n rsut n vrs ns. For xp, on vnt n rsut n t rs o orst ovr n t n ro orst to t n. oon vnt n rsut n t nrs o so ostur n t trnsor ro t n to wtn [9]. Wrss snsor ntwors (WSNs) r nrsny n us n spt pptons to tt n n t nvronnts. WSN s ntwor o oputn vs tt n oort v ro ountons. WSN s so ntwor o osrvton vs, sn no n t WSN s qupp wt snsors tt n tty n-rn osrvton o t nvronnts. WSN s to osrv n n r-t, n n, wt ost ny tpor rnurty (ut typy orsr spt rnurty). In t ontxt o orp norton sn, snpsot-s n vnts ppros v n us to o wrss snsor ntwors. Snpsots ppro r oony us n pptons, wr snsor nos r ts to proy sns n trnst snpsots o n nvronnt y sttn t WSN to rtn tpor snsn rsouton (.., [16]). tou t snpsot ppro s or prt, tort stus (.., [18]) r or ntrst n vnt-s o o WSNs u to ts vnts o ttn snt ns or vnts.
2 () () () () F. 1. T vovn o spt ots ovr t. ()-() r t rnt t stps,.., t 1, t 2, t 3, n t 4. Howvr, prty so vnt-s os r sut to rnurty ts. y rtn spt n tpor rsouton o osrvton, vnts y not ror sowr, sot. Evn soon y ru tt ontnuous osrvton s poss wt utur tnoos, tr s st t pro o runny o osrvtons. Lr ount o nry n onsu to osrv n nvronnt wr no n s ourr. In ts rustn, ts ppr vops nw sptotpor t o tt norports ot snpsots n vnt-s ppros, su tt t o n pt to rnt rnurts o osrvtons, n n tt n nyz spt ns. In our sptotpor t o, WSN s o s st o pont ots wt pont osrvtons, n t prry strutur n our o r s. Es r portnt oponnts or spt ots. For xp, n r s n poyon tt s onsttut s squn o s. y snsor ntwor pont osrvtons, orp pnon w strt s r ots tt onsst o ponts, n ts ponts w tn ornz s squn o s. Sn tpor rnurty o osrvton s ow n our o, orp pnon r rprsnt s squns o snpsots. Our o supports t nyss o n n squns o snpsots tt s ptur y rnt rnurty o osrvtons. Fur 1 ustrts n xp out t rprsntton o yn r ots n snsor ntwor. Ts ppr s our or ontrutons. Frsty, w propos nw t strutur tt nsurs t ounrs o r ots r wys os trvrs trs. Sony, w propos t n nsrt s to rprsnt ns o r ots n snpsot squns. T squns o t n nsrt s wys or os trvrs trs, n tr r t rnt typs o ts os trs tt n us to stnus sx topoo ns n two non-topoo ns. Try, our ppro n support ot nrnt n non-nrnt ns. n ny, w vop ntrz ort to nty tt t t rnt typs o ns n snsor ntwor. 2 Rt Wor T n nvstt n ts ppr s t n o spt ntts. n ours wnvr spt ntts possss rnt spt ttruts t rnt
3 ts [2]. Grnon n St [4] ssy ntts n t sptotpor wor nto two tors: on s ontnunts, n t otr s ourrnts. T stuy o ts ppr s on t prsptv o ontnunts tt xst t vn t t vn v o rnurty n unro rnt typs o ns ovr t. Hornsy n Enor [5] sust quttv rprsntton o n. Tr noton o n s s on ot ntty, n st o oprtons tt tr prsrv or n ntty. Ts ppr pps tr onpt o ntty ssun tt snsor ntwor n st up wt rtn pproprt rnurty o osrvtons or rtn nvronnt pnonon, orn to t spn tor [14]. Grnon n St [4] propos SNP n SPN ontoos. T SNP ontooy s snpsot-s vw, wr ntts r ornz s tpor squns o snpsots. On t otr n, vnt-s sptotpor t os n SPN ontooy (.., [10, 11, 17]) n unrstoo s ron-s o tt s u to t snpsot-s o [3]. Snpsot-s n vnts ppros r oony us n wrss snsor ntwor pptons. Ln t. [6] propos rnt ounry tton ppro, wr snpsots o ontor ron r trnstt to snt ntr oputr v t sn o t ntwor t rtn t ntrvs. snpsot t vn t t s strt s ontour p, w onssts o rnt ounrs. Ony t nos on t rnt ounrs n to rport to t sn, w onstruts ontour p. unqu wor or otn snpsot t s propos y Sr t. [15]. Tr to s swp,.., wvront tt trvrss t wo ntwor n psss nos n t ntwor xty on. Ts ppros r t to stt snpsots. Ty nnot yny nyz snpsot squns to rv snt ns. Du t. [1] vops o to tr snt ns or vnts n t nvronnt. Ty o snsor ntwor s trnuton ntwor. T trnuton n n ovr t n rspons to t ovnt o spt pnon. Woroys n Du [18] so us trnutons, n spt ots r rprsnt s st o trns. Cns o spt ots r rprsnt s t nsrton or ton o trns ro t st. Howvr, tr ppro s t to nrnt ns,.., t n o sn trn t t stp. Sq n Du [13] nvstt rnt snsor ntwor struturs or ttn topoo ns. Svr oony-us noroo struturs, su s Duny trnuton, Gr rp, rtv noroo rp, n ry trnuton, v n tst. Tr ppro so ssus nrnt ns. Tr sston o spt ns s s on t tort stuy o Jn n Woroys [8]. r ount o xstn wor on quttv ppros to rtrz topooy n topoo ns n snsor ntwor xsts,.., [7]. Ts ppr s stnus ro otr rt wor y usn squns or quttv rsonn. W us t n nsrt s to rprsnt ns o r ots, n t squns o t n nsrt s r wys os trs rrss t nur o nos on t trs. Tus, our ppro ows or t rst t ot nrnt n non-nrnt ns.
4 3 Cn Rprsntton n Snsor Ntwor snsor ntwor n o s rt pnr rp G = (V,E), w s ut y Duny trnuton [12]. In ts ppr w ssu tt t snsor ntwor s ns nou to nsur t onstruton o trnuton rwor. In t rp G, V s st o nos n E s st o s,.., (v,v ), w rprsnt t rt ounton ns twn t nos v,v V. W ssu tt E s sytr,.., (v,v ) E, tn (v,v) E. Not tt t rton o rt w ustrt n ur wn t s rvnt, otrws t rprsntton o G n sp s n Fur 2(). T st o nors o v V s not s nr(v) = {v : (v,v ) E}. For xp n Fur 2(), nr(v) = {,,,,}, n t st nr(v) s sort nto ows orr. E no ony stors t out ts n ts t nors. v () v () v () v () F. 2. Snsor ntwor strutur. () T st nr(v) o no v s sort nto ows orr. () T rt s n ys o no v. () T trvrs o ounry s s on t ows ru. () ron wt o n tt y t trvrs ornttons. T st o rt s nt to no v s not s (v). Sn E s sytr, t st (v) n rv ro nr(v),.., (v) = {(v,v ) : v nr(v)} {(v,v) : v nr(v)}. In Fur 2(), or xp, t no v s v nors, so tt v s tn rt s. T st (v) s so sort n ows orr, n or s norn no v, t (v,v) s wys t nxt o t (v,v ), s n Fur 2(). no v n ts nors r ornz nto rt ys, or spy ys. y s not s (v,,,v), wr t tr nos v, n r stnt, n tr s n or ny two onsutv nos n t y,.., (v,), (,), (,v) E. Sn nr(v) s n ows orr, t ys r ountrows, n n xp,.., (v,,,v), s sown n Fur 2(). s on t ov nton, w n n t rprsntton o r ots n snsor ntwor: Dntons: rt (v,v ) E s n ot, ot v n v r ot n n r ot. y (v,,,v) s n ot y, t vrtxs o t y,.., v,,, r n n r ot. n ot (v,v ) E
5 v () t 0 v () t 1 v () t 2 F. 3. Insrt n t ounry s r r y t so-n rrows n t s-n rrows rsptvy. Ony ounry s r ustrt n t ur. s non-ounry, t ons to n ot y. n ot (v,v ) E s ounry, t os not on to ny ot y. r ots n rprsnt s squn o ounry s. n xp s sown n Fur 2(), n w t nos,, n v r ot n n r ot. T s (,v), (v,), (,), (,v), (v,) r ounry s, sn ty o not on to ny ot ys. Usuy ony ounry s w ustrt n t urs, s n Fur 2 () n (). Trvrss on ounry s o r ots wys or os trs. For xp, n Fur 2(), suppos t trvrs s strt t no, tn t trvrs w os tr oow t ows ru: v v. Fory, t pt o st o onnt ounry s s Eurn tr, sn t nur o ounry s n no s wys vn. n portnt proprty o ts trs s t trvrs orntton. Gvn ron wt o, or xp n Fur 2(), xtrn trvrss o t ron r ows n ntrn trvrss o t o r ountrows. Sn t r o poyon s postv t vrtxs o t poyon r rrn n ountrows orr, n ntv ty r n ows orr, t rsut o r uton n us to trn t orrn o t vrts o poyon, n tus t orntton o trvrs. In our o, t n o r ots w ptur s squns o snpsots n t snsor ntwor. In snpsot, squns o ounry s r us to rprsnt r ots. Sn r ots r vovn ovr t, t squns o ounry s wou yny n t rnt snpsots, s n Fur 3()-(). T n o ounry s twn two onsutv snpsots s rprsnt y t nsrton n ton o ounry s: Dntons: ounry (v,v ) E s n nsrt ounry, or spy n nsrt, t t t t s not ounry t prvous t t 1, ut o ounry t t t. ounry (v,v ) E s t t t t t s ounry t prvous t t 1, ut s not ounry t t t. W ssu t snsor rn s nry,.., {0,1}, wr t rn o 1 rprsnts tt t snsor no s ot n n r ot. W n tt no v ns ts snsor rns,.., ro 1 to 0, t t stp t, tn v
6 r xpnson ppr prt-spt spt ontrton sppr s-r F. 4. Sx topoo ns n two non-topoo ns. s n tv no t t. For xp, n Fur 3, nos,, n v r tv nos t t 1, n no s t ony tv no t t 2. W n tt twn two onsutv t stps t n t 1, n o r ot s nrnt tr s on n ony on tv no t t stp t. In Fur 3, t n twn t 0 n t 1 s non-nrnt n t n twn t 1 n t 2 s nrnt. Our o supports ot nrnt n non-nrnt ns. 4 Dttn Cn T trvrss on t n/or nsrt s n us to stnus t rnt typs o ns o r ots. Ts t typs o ns nu sx topoo ns n two non-topoo ns. T sx topoo ns r pprn, spprn, r, spt, s-r n prt-spt [8, 13]. T two non-topoo ns r xpnson n ontrton. Exps o t t typs o ns r sown n Fur 4. s w suss, rnt typs o ns w v rnt typs o trvrss on t/nsrt s, n o t trvrss w or os trvrs trs. W suss t t typs o ns n our roups. 4.1 pprn n Dspprn Tr s os trvrs tr or t pprn o r ots. In Fur 5(), n r ot pprs, n st o ounry s s n nsrt. T st o nsrt ounry s ors os tr. Suppos t trvrs strts t no, tn t tr s:. n strt rprsntton o t trvrs n Fur 5() s sown n (), wr t so-n rrow rprsnts trvrs on nsrt s, n t r rprsnts no tt s no ntty o. Not tt Fur 5 ustrts t st wn ns v our ut r ot ntts v not yt n upt. In Fur 5(), n r ot spprs, n t ounry s wt r ot ntty o v n t. n n Fur 5(), t s-n rrow nots trvrs on t s. Not tt r ot ntty s ntry stor n ounry o t r ot. 4.2 Expnson n Contrton For t xpnson n ontrton o r ots, t os tr w nu two snts. On snt o t trvrs onssts o nsrt s,
7 n notr snt onssts o t s. In Fur 5(), or xp, n r ot xpns. T nsrt s or on snt o t trvrs:. T t s or notr snt:. Not tt t son snt o t trvrs s n rvrs rton. Fur 5() ustrts tt t two snts o t trvrs r onnt y two nos n. T two nos n r t trnston nos o t trvrs. Snt 2 s wr t r ot ntty, w Snt 1 o not v r ot ntty yt. Sry, n Fur 5() n (), n r ot ontrts, n tr r two snts tt s onnt y two trnston nos n. Ston 5 w onstrt ow xpnson n ontrton n stnus: t trvrs o xpnson onssts o (1) nsrt s n (2) t s, n t trvrs o ontrton onssts o (1) t s n (2) nsrt s. 4.3 Mr n Spt T os tr or t r o two r ots nus our snts. Fur 5() sows r o two r ots n. T rst snt o t trvrs s on nsrt s ro no to no :. Two trnston nos n r ot n rnt r ots,.., n rsptvy. T son snt o t trvrs s on t t s o r ot ro no to no :, n t t s v t r ot ntty, s sown n Fur 5() n (). T tr snt w strt ro r ot n rturn to r ot v nsrt s:. Fny, t ourt snt o t trvrs w rturn to t orn no v t t s o r ot :. Not tt Snts 2 n 4 r n rvrs rton. Ts our snts o trvrs r onnt y our trnston nos,,, n, n w two nos r ot n r ot, n t otr two r n r ot. T trvrs o spt so nus our snts, n t our snts r n t squns o (1) t s n (2) nsrt s n (3) t s n (4) nsrt s, s n Fur 5() n (). T our snts o trvrs r so onnt y our trnston nos,,, n. Snts 1 n 3 on t s r wr t r ot ntty. In oprson, t our trvrs snts o r r n rnt orr: (1) nsrt s n (2) t s n (3) nsrt s n (4) t s, s n Fur 5(). ot o t trvrss n Fur 5() n () strt t no. T ston o t trvrs strtn no w suss n Ston S-r n Prt-spt In Fur 5(), n r ot s-rs nto ron wt o. T trvrs o s-r s sr strutur s r: (1) nsrt s n (2) t s n (3) nsrt s n (4) t s, s sown n Fur 5(n). Snts 2 n 4 o s-r v t s r ot ntty, s ustrt n Fur 5() n (n). In oprson, Snt 2 n
8 ppr () 1 () sppr () () 1 xpn () () 1 2 ontrt () () 1 2 r () () spt () () (n) n n () s r (p) n n (o) spt prt F. 5. Et trvrss or t rnt os trvrs trs
9 o n () xpn o n () F. 6. Otr typs o trvrss n onsr s t ontons o t t s trvrs typs. T trvrs n () s onton o two trvrss n Fur 5() n (). 4 o r n Fur 5() n () v rnt r ot ntts,.., n rsptvy. Tus, rs n s-rs n stnus y t r ot ntts o t trvrs snts, s n Fur 5() n (n). In Fur 5(o), n r ot wt o prt-spts. T r ot wt o onssts o two os trs: on s ntrn or t o n t otr s xtrn or t r ot, s ry ntrou n Ston 3. T r ot ntty or o o n r ot s sp s. Fur 5(o) sows tt t ntrn s wt or os tr: n. Sr to spts, t trvrs or prt-spt s our snts, n t orr s (1) t s n (2) nsrt s n (3) t s n (4) nsrt s. For spt, Snts 1 n 3, n Fur 5(), v t s r ot ntty, w n t s o prt-spt n Fur 5(p), Snt 1 s n r ot ntty o n Snt 3 s rnt ntty. 4.5 Sury s sury, tr r t rnt typs o s trvrss on t n nsrt s. Ts t trvrss n stnus s on tr snts. E typ o trvrs n unquy nty on typ o n. Tr r poss otr typs o trvrss, n ty n onsr s t ontons o t t s trvrs typs. For xp, n Fur 6, n r ot xpns, n t t n nsrt s v n sprt nto two os trs:.., o n n. T trvrss n Fur 6 n onsr s onton o t two trvrss n Fur 5() n (). Our orts r to n t onton o t t s trvrss su tt rnt n typs n nt. 5 ort s suss n Ston 4, tr r t rnt typs o trvrss tt n us to stnus t typs o ns. Ts ston w prov ntrz
10 orts or trvrs ornzton n n tton. T s o our ort s to ntz trvrs t vn no v wt ss, n t ss w pss ro on no to notr urn t trvrs. so, ntrz t w rt nto t ss urn t trvrs. Sn t trvrss or os trs, t rt ss w rturn to ts orn no v, so tt no v w to tt rnt typs o ns s on t rt ss. 5.1 Msss Sn r ot ntts o trvrs snts n us to ntty rnt typs o ns s n Fur 5, rvnt r ot ntts w rt urn t trvrs. ss w ntz t t nnn o trvrs or t rton n t ntwor. ss ntz t no v s not s: s(v) = (p 1,p 2,p 3,p 4 ). T our nts,., p 1, p 2, p 3, n p 4, not t r ot ntts o t our snts n trvrs. W us s(v).p 1, or xp, to rprsnt t nt p 1 n s(v). In t nnn o trvrs, t nts n ss r pty, n t ss n rprsnt s: s(v) = (,,, ). T trnston nos r rspons to upt t nts o ss urn trvrs. For xp, t os tr or spt n Fur 5() onssts o our trnston nos,,, n, n our snts. I no ntzs trvrs wt ss s(), tn no w upt t nt s().p 1, n,, n w upt s().p 2, s().p 3, n s().p 4 rsptvy. Fny, t trvrs w rturn to t nt no wt ss tt ontns t norton out t os tr. t s n t s snt v t s r ot ntty. For xp, n Fur 5(), t s (,), (,) n (,) n t rst snt v t s ntty o, n tus s().p 1 =. Sry, s().p 2 = I, s().p 3 =, n s().p 4 = I. Not tt s().p 2 = I n s().p 4 = I r us to spy tt t son n ourt snts o t trvrs r on nsrt s n r ot ntts v not n prov. In Fur 5(), opt ss or t trvrs strt t no wou : s() = (,I,,I). 5.2 snt Trvrs Snts In so trvrss, t s poss tt tr s no n snt, n t snt s rr s n snt snt. For xp, n Fur 7(), no strts trvrs, tn t trvrs wou ony ontns tr snts: on nsrt s, on nsrt s, n on t. Sn trvrs o r s (1) nsrt s n (2) t s n (3) nsrt s n (4) t s, s n Ston 4.3, w rr t son snt on t s s n snt snt t no. T r ot ntty or t snt snt sou prov y no. s sown n Fur 7(), no n qur t r ot ntty,..,, ro ts ounry s
11 xpn () r () F. 7. It s poss tt tr r snt snts n trvrs. Trnston nos r r y rs. () snt on t s s snt t no. () snt on t s s snt t no. {(,),(,)}. T opt ss ntz y no wou : s() = (I,,I,). Gnry, n trvrss o r, spt, s-r n prt-spt, t rst n tr snts wys xst, w t son n ourt snts y snt. In t trvrss or xpnson n ontrton, t rst snt wys xsts, w t son snt y snt, s n xp n Fur 7(). 5.3 Trnston Es Sn our ort sou to nty ornz trvrss or ntrz t rton, ony s sust o snsor nos sou nont or ntzn trvrss. W n tt n nsrt or t s trnston t onnts n tv no n non-tv no. For xp, n Fur 5(), t t (,) s trnston tt s nt non-tv no n trn tv no. so (,) s trnston, ut t ns t n tv no n ns t non-tv no. Trnston s r wys n prs. I tr s trnston wt n nt non-tv no n trn tv no, tn tr wys xsts notr trnston wt n nt tv no n trn non-tv no. pr o trnston s s wys onnt y tr. For xp, n Fur 5(), (,) n (,) r onnt y t tr. I no v s non-tv no n s t nt no o trnston, tn no v s t rsponsty to ntz trvrs (typ 1) wt ss s(v). For xp, n Fur 5(), no s non-tv no, n t s t nt no o trnston (,), so sou strt trvrs wt nw ss s(). T trvrs w vst nos,,,,,,, n, n rturn to t strtn no wt opt ss s(). Sry, n Fur 5(), t non-tv no s t nt no o (,), n tus no sou so ntz trvrs. In t s o pprn or spprn o n r ot, t nos n t r ot r tv nos, n tus tr s no trnston. notr typ o trvrs (typ 2) s rqur or ts ss. tou our ort nus t ornzton n onton o trvrss typ 1 n typ 2, t ts r not urtr suss.
12 ort 1: Dttn Cn 1 Vrs: no v; 2 v rvs ss s(v) ntz y ts tn 3 s(v).p 1 n s(v).p 2 = tn 4 s(v).p 1 = I tn v tts n pprn; 5 s(v).p 1 I tn v tts spprn; 6 s s(v).p 2 n s(v).p 3 = tn 7 s(v).p 1 = I tn v tts n xpnson; 8 s(v).p 1 I tn v tts ontrton; 9 s s(v).p 4 tn 10 s(v).p 1 = I tn 11 s(v).p 2 s(v).p 4 tn v tts r; 12 s(v).p 2 = s(v).p 4 tn v tts s-r; 13 s s(v).p 1 I tn 14 s(v).p 1 s(v).p 3 tn v tts prt-spt; 15 s(v).p 1 = s(v).p 3 tn v tts spt; 5.4 Dttn Cn I no v rvs ss s(v) ntz y ts, tn no v s to tt rnt typs o ns s on t ss s(v) (s ort 1, n 2). I t ss ontns ony on snt,.., s(v).p 1 n s(v).p 2 =, tn no v tts n pprn or spprn (ns 3-5). I t snt s on nsrt s,.., s(v).p 1 = I, tn no v tts n pprn (n 4). I t snt s on t s,.., s(v).p 1 I, tn no v tts spprn (n 5). I t ss ontns two snts,.., s(v).p 2 n s(v).p 3 =, tn no v wou tt n xpnson or ontrton (ns 6-8). s ustrt n Fur 5() n (), t rst snt o xpnson s on nsrt s (n 7), w t rst snt o ontrton s on t s (n 8). Tr r our typs o ns,.., r, spt, s-r, n prt-spt tt v our trvrs snts (ns 9-15). In t ss o r n sr, t rst snt s on nsrt s (ns 10-12). Mr n s-r n tn stnus y t son n ourt snts o trvrss. T son n ourt snts v rnt r ot ntts or r, n v t s r ot ntty or s-r. W or spt n prt-spt, t rst snt s on t s (ns 13-15). T rst n tr snts v t s r ot ntty or spt, n v rnt r ot ntts or prt-spt. 6 Evuton T ntrz ort n Ston 5 ws vut n suton nvronnt. Rpst (ttp://rpst.souror.nt/) ws us or suton. T
13 rt pnr rp strutur ws ut y Duny trnuton n Rpst. T pnr rp onssts o 500 snsor nos tt r poy n ron o squr unts, wt ounton rn o 80 unts. In t xprnt, w out 2000 suton runs, n typ o n out 250 runs. n r ot s sut s on or svr r r squr oxs, s xps n Fur 8. Fro t 1st to t 2000t suton runs, t prtr r ruy nrs, n tus t nur o tv nos sou so ruy nrs. t suton run, sp typ o spt n n our t rnoz otons wtn t snsor ntwor. Fur 8 () n () sow xps o r n prt-spt tt our t rnt otons o t snsor ntwor. Our orts wr nst n snsor no n t ntwor. In t suton runs, t t rnt typs o ns wr orrty tt y t rt pnr rp strutur, s on s t rnurty o osrvton s st up pproprty s on t rnurty o r ots. T xprnt nvstt t sty o t ort. T sty ws sur y nur o sss snt wt nrsn nur o tv nos. T rsuts o powr rrsson nyss or pprn, xpnson, n r, or xp, s sown n Fur 9(), (), n () rsptvy. Fur 9() sts t rsuts o rrsson nyss or t t typs o ns. powr rrsson (y = x ) s us to t t 250 pott rsuts or typ o n. t rrsson rsuts v oonss o t, wt t rn o R 2 ro to s n Fur 9(), tr s < 1 or t t typs o ns, n tus our ort sou v n orr o O(n) or ss. T xprnt sows tt our ntrz ort s y s. To opr wt our ntrz ort, w so pnt ntrz sns-n-trnst ort, n w tv no w spy orwr ts snsor rn to sn y ut-op routns. T rsuts o t ntrz ort s sown n t st row o Fur 9(). y oprn n n y = x, t s r tt our ntrz ort s or ss nt n s tn ntrz ort. r prt spt () () F. 8. Spt ns our t rnoz otons wtn snsor ntwor.
14 Msss snt ppr y = x R 2 = Msss snt Expn y = x R 2 = Msss snt Nur o tv nos () pprn () r Mr y = x R 2 = Nur o tv nos Nur o tv nos () xpnson Typs o n R 2 pprn Dspprn Expnson Contrton Mr Spt S-r Prt-spt Cntrz () rrsson nyss y = x F. 9. Sty o t ort. 7 Conuson In ts ppr, w v vop nw sptotpor t o tt ns t tton o quttv spt ns n snpsot squns. In our o, ounrs o r ots r os trvrs trs. Et typs o ns o r ots n so rprsnt n stnus y t rnt os trs tt onsst o nsrt n/or t s. W v so vop ntrz ort or WSNs to tt ns y n-ntwor rtons. T xprnt provs tt our ort s s n nt, n s to tt ns wt rnt nurs o tv nos. In t utur wor, our t o n urtr vop to support ntrz spt qurs, or xp, t qury o t topoo rtons twn two spt rons. Rrns 1. M. Du, S. Ntt, n M.F. Woroys. Montorn yn spt s usn rsponsv osnsor ntwors. In Prons o 13t nnu CM Intrnton Worsop on Gorp Inorton Systs (GIS05), ps 51-60, Gton. Quttv Spt Cn. Oxor Unvrsty Prss, Gton. Fs n ots n sp, t, n sp-t. Spt Conton n Coputton, 4(1):39-67, 2004.
15 4. P. Grnon n. St. SNP n SPN: Towrs yn spt ontooy. Spt Conton n Coputton, 4(1):69-104, K. Hornsy n M. Enor. Quttv Rprsntton o Cn. In S. Hrt n.u. Frn, s.: COSIT 1997, Vou 1329 o Ltur Nots n Coputr Sn, ps Sprnr, Hr, J. Ln, L. Cn, K. N, Y. Lu, n G.. nw: Grnt ounry tton or t srs snpsot onstruton n snsor ntwors. IEEE Trnstons on Pr n Dstrut Systs, 18(10): , J. Jn n M. Woroys. Dttn s topoo ns n snsor ntwors y o rton. CM GIS, Irvn, C, US, J. Jn n M. Woroys. Evnt-s topooy or yn pnr r ots. Intrnton Journ o Gorp Inorton Sn, 23(1):33-60, I. Mu, K. Hornsy, n I.D. sop. Mon ospt vnts n pts trou quttv n. In T. rowsy t., s.: Spt Conton V, Vou 4387 o Ltur Nots n rt Intn, p Sprnr, rn, D.J. Puqut n N. Dun. n vnt-s sptotpor t o (ESTDM) or tpor nyss o orp t. Intrnton Journ o Gorp Inorton Systs, 9:7-24, D.J. Puqut. Mn Sp or T: Issus n Sp-T Dt Rprsntton. Gonort. 5(1):11-32, F.P. Prprt n M.I. Sos. Coputton Gotry: n Introuton. Sprnr, Nw Yor, M.J. Sq n M. Du. Et o noroo on n-ntwor prossn n snsor ntwors. In T.J. Cov t., s.: GISn 2008, LNCS, vou 5266, ps Sprnr, Hr, C.E. Snnon. Counton n t prsn o nos. In Prons o t Insttut o Ro Ennrs 37(1), ps 10-21, P. Sr, Q. Fn,. Nuyn, n L. Gus. Swps ovr wrss snsor ntwors. In IPSN 06: Prons o t 5t Intrnton Conrn on Inorton Prossn n Snsor Ntwors. ps , T. Wr, P. Cor, P. S, L. Kn, Y. Guo, C. Crossn, P. Vn, D. Swn, n G. sop-hury. Trnsorn rutur trou Prvsv Wrss Snsor Ntwors. IEEE Prvsv Coputn, 6:2(50-57), M. Woroys. Evnt-ornt ppros to orp pnon. Intrnton Journ o Gorp Inorton Sn, 19(1):128, M. Woroys n M. Du. Montorn quttv sptotpor n or osnsor ntwors. Intrnton Journ o Gorp Inorton Sn, 20(10): , 2006.
Theorem 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 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 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 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 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 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 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 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 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 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 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 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 information5/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 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 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 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 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 informationVerification of DAG Structures in Cooperative Belief Network Based Multi-agent Systems
Vrton o AG Struturs n Cooprtv B Ntwor Bs Mut-nt Systs Y. Xn prtnt o Coputr Sn, Unvrsty o Rn Rn, Sstwn, Cn S4S 0A, yxn@s.urn. Astrt Mutpy ston Bysn ntwors (MSBNs) prov rwor or prost rsonn n opx sn usr ornt
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 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 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 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 informationAn action with positive kinetic energy term for general relativity. T. Mei
An ton wt post nt ny t fo n tty T (Dptnt of Jon Cnt Cn o Unsty Wn H PRO Pop s Rp of Cn E-: to@nn tow@pwn ) Astt: At fst w stt so sts n X: 7769 n tn sn post nt ny oont onton n y X: 7769 w psnt n ton wt
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 informationComputer Graphics. Viewing & Projections
Vw & Ovrvw rr : rss r t -vw trsrt: st st, rr w.r.t. r rqurs r rr (rt syst) rt: 2 trsrt st, rt trsrt t 2D rqurs t r y rt rts ss Rr P usuy st try trsrt t wr rts t rs t surs trsrt t r rts u rt w.r.t. vw vu
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 informationSOCKET WELD OR THREADED BODY TYPE (3051SFP FLOWMETER SHOWN THROUGHOUT / 3051CFP, 2051CFP AVAILABLE)
9 10 12 13 14 15 16 RVISION T RVISION O NO. PP' T SI1053953 3/30/17 03/31/17 SRIPTION NOT 10 N RIITION ON ST 10. T 1 - OY INSIONS 2X 1/4" NPT VNT VVS INSIONS IN SIZ 3.4 [86.0] 3.8 [97.0] 4.5 [4.0] 4.7
More informationDifferentiation of allergenic fungal spores by image analysis, with application to aerobiological counts
15: 211 223, 1999. 1999 Kuw Puss. Pt t ts. 211 tt u ss y yss, wt t t uts.. By 1, S. s 2,EuR.Tvy 2 St 3 1 tt Ss, R 407 Bu (05), Uvsty Syy, SW, 2006, ust; 2 st ty, v 4 Bu u (6), sttut Rsty, Uvsty Syy, SW,
More informationGraphs Breadth First Search
Grp Brdt Frt Sr SFO ORD LAX DFW - 1 - Outo Ø By undrtndn t tur, you oud to: q L rp ordn to t ordr n w vrt r dovrd n rdt-rt r. q Idnty t urrnt tt o rdt-rt r n tr o vrt tt r prvouy dovrd, ut dovrd or undovrd.
More informationVOID CABLE REQUIREMENTS
XST & W OTOS 0 SURTY SYOS Orange ounty onvention enter PORTT OTS R OTS W TV R # PX TYP RQURS /" OUT RO R OTO T..., WT US. OR RS OT OT SS, OUT T T, U.O.. W 0 R POR R 0 R R RQURS O () TYP. PX TYP #. OTRTOR
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 informationSAN JOSE CITY COLLEGE PHYSICAL EDUCATION BUILDING AND RENOVATED LAB BUILDING SYMBOL LIST & GENERAL NOTES - MECHANICAL
S SRUUR OR OORO SU sketch SYO SRPO OO OU O SUPPOR YP SUPPOR O UR SOS OVR SOS (xwx) X W (S) RR RWS U- R R OR ROO OR P S SPR SO S OS OW "Wx00"x0" 000.0, 8/7.0 Z U- R R UPPR ROO S S S SPR SO S OS OW 0"Wx0"x90"
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 informationGraph Search Algorithms
Grp Sr Aortms 1 Grp 2 No ~ ty or omputr E ~ ro or t Unrt or Drt A surprsny r numr o omputton proms n xprss s rp proms. 3 Drt n Unrt Grps () A rt rp G = (V, E), wr V = {1,2,3,4,5,6} n E = {(1,2), (2,2),
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 informationBASIC CAGE DETAILS D C SHOWN CLOSED TOP SPRING FINGERS INNER WALL TABS ARE COINED OVER BASE AND COVER FOR RIGIDITY
SI TIS SOWN OS TOP SPRIN INRS INNR W TS R OIN OVR S N OVR OR RIIITY. R IMNSIONS O INNR SIN TO UNTION WIT QU SM ORM-TOR (zqsp+) TRNSIVR. R. RR S OPTION (S T ON ST ) TURS US WIT OPTION T SINS. R (INSI TO
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 informationCHELOURANYAN CALENDAR FOR YEAR 3335 YEAR OF SAI RHAVË
CHELOURANYAN CALENDAR FOR YEAR YEAR OF SAI RHAVË I tou woust n unon wt our Motr, now tt tou st nvr t Hr. I tou woust sp t v o mttr, now tt tr s no mttr n no v. ~Cry Mry KEY TO CALENDAR T Dys o t W In t
More informationDetermination of slot leakage inductance for three-phase induction motor winding using an analytical method
ACHIVES OF EECTICA EGIEEIG VO 6 pp 569-59 DOI 78/--6 Dtnton of ot ntn fo t-p nton oto wnn n n nt to JA STASZAK Dptnt of Et Mn n Mton St K Unvt of Tnoo Tą PP 7 K Pon -: j@tp v: v: 5 Att: T t nto o pon fo
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 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 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 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 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 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 informationIntroduction to Fourier optics. Textbook: Goodman (chapters 2-4) Overview:
Introuton to ourr opts Ttbook: Goon (ptrs -) Ovrv: nr n nvrnt ssts T ourr trnsor Slr rton rsnl n runor pprotons. . nr ssts n ourr trnsor tutorl (rnr) sst onnts n nput to n output su tt: It s s to b lnr
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 informationT H E S C I E N C E B E H I N D T H E A R T
A t t R u r s - L x C t I. xtr turs t Lx Ct Rurs. Rr qurtr s s r t surt strutur. Ts Att Rurs rv ut us, s srt t tr t rtt rt yur t w yu ru. T uqu Lx st ut rv ss ts ss t t y rt t tys t r ts w wr rtts. Atrx
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 informationA ' / 1 6 " 5 ' / 4 " A4.2 48' - 0" 3 12' - 7" 13' - 11" 10' - 0" 9' - 0" 2' - 6" 1. 2: 12 INDICATES SHOW MELT TYP ABV ABV
4. 4. 4. K ' - / " ' - / 4 " 0 ' - / " ' - 0 " ' - 0 " ' - / " 4 ' - 0 " 4. M U PPR 48' - 0" ' - ' - " 0' - 0" ' - 0" ' - ". : WOM ' - 0 " OT: PROV URROU TR OUT SVS OR UTUR SP UTTY T OR QUSTR MPUS OTO
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 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 informationSHELL CANADA PIPING AND INSTRUMENT DIAGRAM QUEST CCS PROJECT LEGENDS AND SYMBOLS QUEST CCS PROJECT UNIT COMMON "!!
.. 2 S 222... 2. SSU TON Y K PS S M P PM T S N QUST S POJT. S NON N N NSTUMNT M QUST S POJT S W NO.. 2... NT M T \\\2\WNS\UTTS\2\2..pid MO T22 PM Yahm 2. UNT 2 OMMON NS N SYMOS .. SSU T 2 2 2. TON Y K
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 informationDesigning A Uniformly Loaded Arch Or Cable
Dsinin A Unirmy Ar Or C T pr wit tis ssn, i n t Nxt uttn r r t t tp ny p. Wn yu r n wit tis ssn, i n t Cntnts uttn r r t t tp ny p t rturn t t ist ssns. Tis is t Mx Eyt Bri in Stuttrt, Grmny, sin y Si
More informationNORTHLAKE APARTMENTS
PRT RW RVTO VTY P PROT RPTO TR # UR P PROPRTY.. /..T..... T. R. V..W.P.. '. OT......... R...U..O. O. O. OT. OOR. PT..T..Y...... P. V.. R... W....... V.. Q. QUP..W.. XT.....O.................. OR OT R OTO
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 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 informationTrader Horn at Strand This Week
- -N { 6 7 8 9 3 { 6 7 8 9 3 O OO O N U R Y Y 28 93 OU XXXX UO ONR ON N N Y OOR U RR NO N O 8 R Y R YR O O U- N O N N OR N RR R- 93 q 925 N 93; ( 928 ; 8 N x 5 z 25 x 2 R x q x 5 $ N x x? 7 x x 334 U 2
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 Optimal and Progressive Algorithm for Skyline Queries
A Opt Prorssv Aort or S Qurs Dtrs Pps Yu To Gr Fu Brr Sr* Dprtt o Coputr S Ho Ko Uvrst o S Too Cr Wtr B, Ho Ko {trs,r}@s.ust. Dprtt o Coputr S Cr Mo Uvrst Pttsur, USA to@s.u.u * Dpt. o Mtts Coputr S Ppps-Uvrst
More informationTelecommunications BUILDING INTERCOM CALL BUTTON WITH 3/4"C AND PULL STRING TO ACCESSIBLE CEILING SPACE. MOUNT 48" AFF.
0 NOOY SYMO S N NOOY NOS: NO: his is a standard symbol list and not all items listed may be used. bbreviations () XSN OV NS OO NMW - UNOUN ONU OY ONO UNS ONO NS O ONO UNS OWN NS OX OX U OP SUON UN OO,
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 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 informationT h e C S E T I P r o j e c t
T h e P r o j e c t T H E P R O J E C T T A B L E O F C O N T E N T S A r t i c l e P a g e C o m p r e h e n s i v e A s s es s m e n t o f t h e U F O / E T I P h e n o m e n o n M a y 1 9 9 1 1 E T
More informationP a g e 5 1 of R e p o r t P B 4 / 0 9
P a g e 5 1 of R e p o r t P B 4 / 0 9 J A R T a l s o c o n c l u d e d t h a t a l t h o u g h t h e i n t e n t o f N e l s o n s r e h a b i l i t a t i o n p l a n i s t o e n h a n c e c o n n e
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 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 informationFL/VAL ~RA1::1. Professor INTERVI of. Professor It Fr recru. sor Social,, first of all, was. Sys SDC? Yes, as a. was a. assumee.
B Pror NTERV FL/VAL ~RA1::1 1 21,, 1989 i n or Socil,, fir ll, Pror Fr rcru Sy Ar you lir SDC? Y, om um SM: corr n 'd m vry ummr yr. Now, y n y, f pr my ry for ummr my 1 yr Un So vr ummr cour d rr o l
More informationROSEMOUNT 3051S SCALABLE OR 3051SMV MULTIVARIABLE COPLANAR PRESSURE TRANSMITTER COPLANAR FLANGE PROCESS CONNECTION
1 2 3 4 5 6 7 8 ROSOUNT 3051S S OR 3051SV UTIVRI OPNR PRSSUR TRNSITTR OPNR N PROSS ONNTION RVISION T RVISION O NO. PP' T RT1071620 SRIPTION N NTNN NT STNR 2.4..TISON 10/25/18 PNTW OUSIN SOWN WIT OPTION
More informationUNCONTROLLED COPY. ERGON ENERGY SUBSTATION STANDARD CIVIL WORKS - STRUCTURES AND POLES 66kV EARTHING TRANSFORMER CABLE SUPPORT STEELWORK DETAILS
2 3 9 2 RRN RWNS 2 3 UNONTRO OPY RVSON ONTRO RON NRY SUSTTON STNR V WORKS STRUTURS N POS kv RTN TRNSORMR SUPPORT STWORK TS 9 2 x 9 3 O SUR RRSTOR PT 3=;.., PT t/lmm VNT O N WT NTRN O MOUNTN OTS!, q>. O
More information16.unified Introduction to Computers and Programming. SOLUTIONS to Examination 4/30/04 9:05am - 10:00am
16.unii Introution to Computrs n Prormmin SOLUTIONS to Exmintion /30/0 9:05m - 10:00m Pro. I. Kristin Lunqvist Sprin 00 Grin Stion: Qustion 1 (5) Qustion (15) Qustion 3 (10) Qustion (35) Qustion 5 (10)
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 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 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 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 informationTRASH ENCLOSURE WITH SOLID GATE 4 STORY BUSINESS / RESIDENTIAL BUILDING CONTAINING 2 BUSINESS SPACES AND 6 DWELLING UNITS 6' - 0"
NSN N. PUN WY R. P 0. SG S 4 SRY USNSS / RSN UNG NNNG USNSS SPS N 6 WNG UNS RS NSUR W S G.. RSRV PRKNG $50 N SGN RV S (7) UR PRKNG SPS ' - PRPRY N M N, YP PU Y SG RNGS S GNR NS 6" G UR rchitecture nteriors
More information176 5 t h Fl oo r. 337 P o ly me r Ma te ri al s
A g la di ou s F. L. 462 E l ec tr on ic D ev el op me nt A i ng er A.W.S. 371 C. A. M. A l ex an de r 236 A d mi ni st ra ti on R. H. (M rs ) A n dr ew s P. V. 326 O p ti ca l Tr an sm is si on A p ps
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 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 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 informationP a g e 3 6 of R e p o r t P B 4 / 0 9
P a g e 3 6 of R e p o r t P B 4 / 0 9 p r o t e c t h um a n h e a l t h a n d p r o p e r t y fr om t h e d a n g e rs i n h e r e n t i n m i n i n g o p e r a t i o n s s u c h a s a q u a r r y. J
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 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 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 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 information24CKT POLARIZATION OPTIONS SHOWN BELOW ARE REPRESENTATIVE FOR 16 AND 20CKT
0 NOTS: VI UNSS OTRWIS SPII IRUIT SMT USR R PORIZTION OPTION IRUIT SMT USR R PORIZTION OPTION IRUIT SMT USR R PORIZTION OPTION. NR: a. PPITION SPIITION S: S--00 b. PROUT SPIITION S: PS--00 c. PIN SPIITION
More informationOutline. 1 Introduction. 2 Min-Cost Spanning Trees. 4 Example
Outlin Computr Sin 33 Computtion o Minimum-Cost Spnnin Trs Prim's Alorithm Introution Mik Joson Dprtmnt o Computr Sin Univrsity o Clry Ltur #33 3 Alorithm Gnrl Constrution Mik Joson (Univrsity o Clry)
More informationA T.O. MECH. ROOF SCREEN T.O. MECH. ROOF SCREEN SHOWER / TUB RM KITCHEN / SERVERY LOUNGE / DINING SINGLE ROOM ACTIVITY AREA
' /" R INT 450 ORNW VNU 68.0 59.40 ORNW VNU X. UIIN NVOP IT IN T 4' /8" (.9 m) SOR S YROW RIT O WY S S S 98'" N N N ' /8" 4'0 /4" '6" '8" '8" '8" '6" ' 5/8" 6' /8" ' /8".05.0 T.O. PRPT 65.9 ' /" 5'6" '0"
More informationCHICAGO, O'HARE INTERNATIONAL AIRPORT
O' o dern izat ion r re ogr am a O, O'R NTRNTON RORT TY O O R NU YOR O'R NTRNTON RORT TY O O O'R ORNZTON ROR R NU YOR O RTNT O VTON O'R ORNZTON ROR ROSR S. NONO OSSONR ROSSON SS ROSR S. NONO OSSONR t:
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 informationMODEL 304R NATURAL GAS MANIFOLD FOR COPLANAR STYLE TRANSMITTER WITH G2 DIELECTRIC ISOLATORS AND DH STABILIZED EXTENDED CONNECTORS
O 304R NTUR S NIO OR OPNR STY TRNSITTR WIT 2 ITRI ISOTORS N STIIZ XTN ONNTORS RVISION T RVISION O NO. PP' T RT1067996 SRIPTION T. STROT 4/24/17 UPT SPIN 5.85 [148,6] X OPN SOWN WIT 3051S TRNSITTR 304 NTUR
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 informationExhibit 2-9/30/15 Invoice Filing Page 1841 of Page 3660 Docket No
xhibit 2-9/3/15 Invie Filing Pge 1841 f Pge 366 Dket. 44498 F u v 7? u ' 1 L ffi s xs L. s 91 S'.e q ; t w W yn S. s t = p '1 F? 5! 4 ` p V -', {} f6 3 j v > ; gl. li -. " F LL tfi = g us J 3 y 4 @" V)
More informationAsh Wednesday. First Introit thing. * Dómi- nos. di- di- nos, tú- ré- spi- Ps. ne. Dó- mi- Sál- vum. intra-vé-runt. Gló- ri-
sh Wdsdy 7 gn mult- tú- st Frst Intrt thng X-áud m. ns ní- m-sr-cór- Ps. -qu Ptr - m- Sál- vum m * usqu 1 d fc á-rum sp- m-sr-t- ó- num Gló- r- Fí- l- Sp-rí- : quó-n- m ntr-vé-runt á- n-mm c * m- quó-n-
More informationA L A BA M A L A W R E V IE W
A L A BA M A L A W R E V IE W Volume 52 Fall 2000 Number 1 B E F O R E D I S A B I L I T Y C I V I L R I G HT S : C I V I L W A R P E N S I O N S A N D TH E P O L I T I C S O F D I S A B I L I T Y I N
More informationPR D NT N n TR T F R 6 pr l 8 Th Pr d nt Th h t H h n t n, D D r r. Pr d nt: n J n r f th r d t r v th tr t d rn z t n pr r f th n t d t t. n
R P RT F TH PR D NT N N TR T F R N V R T F NN T V D 0 0 : R PR P R JT..P.. D 2 PR L 8 8 J PR D NT N n TR T F R 6 pr l 8 Th Pr d nt Th h t H h n t n, D.. 20 00 D r r. Pr d nt: n J n r f th r d t r v th
More information3WN6 Circuit-Breakers
i WN Ciruit-Brrs WN iruit-rrs fix-out, usw- u -po Bstt Horizot otio 0 70 S- S- 7 7 0 0 0 S-7 S-, 70 f Fixi os for outi rt S- 0 $ Sp for rov of r r % Cr for uxiiry pu & r vti sp ( uxiiry pu ) Cui oor *
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 information