Group Nearest Neighbor Queries


 Denis Warren
 2 years ago
 Views:
Transcription
1 Group Nearest Neghbor Queres Dmtrs Papadas Qogmao She Yufe Tao Kyrakos Mouratds Departmet of Computer Scece Hog Kog Uversty of Scece ad Techology Clear Water Bay, Hog Kog {dmtrs, qmshe, Abstract Gve two sets of pots P ad Q, a group earest eghbor (GNN) query retreves the pot(s) of P wth the smallest sum of dstaces to all pots Q. Cosder, for stace, three users at locatos q, q 2 ad q 3 that wat to fd a meetg pot (e.g., a restaurat); the correspodg query returs the data pot p that mmzes the sum of Eucldea dstaces pq for 3. Assumg that Q fts memory ad P s dexed by a Rtree, we propose several algorthms for fdg the group earest eghbors effcetly. As a secod step, we exted our techques for stuatos where Q caot ft memory, coverg both dexed ad odexed query pots. A expermetal evaluato detfes the best alteratve based o the data ad query propertes.. Itroducto Nearest eghbor (NN) search s oe of the oldest problems computer scece. Several algorthms ad theoretcal performace bouds have bee devsed for exact ad approxmate processg ma memory [S9, AMN+98]. Furthermore, the applcato of NN search to cotetbased ad smlarty retreval has led to the developmet of umerous cost models [PM97, WSB98, BGRS99, B00] ad dexg techques [SYUK00, YOTJ0] for hghdmesoal versos of the problem. I spatal databases most of the work has focused o the pot NN query that retreves the k ( ) objects from a dataset P that are closest (usually accordg to Eucldea dstace) to a query pot q. The exstg algorthms (revewed Secto 2) assume that P s dexed by a spatal access method ad utlze some prug bouds to restrct the search space. Shahab et al. [SKS02] ad Papadas et al. [PZMT03] deal wth earest eghbor queres spatal etwork databases, where the dstace betwee two pots s defed as the legth of the shortest path coectg them the etwork. I addto to covetoal (.e., pot) NN queres, recetly there has bee a creasg terest alteratve forms of spatal ad spatotemporal NN search. Ferhatosmaoglu et al. [FSAA0] dscover the NN a costraed area of the data space. Kor ad Muthukrsha [KM00] dscuss Departmet of Computer Scece Cty Uversty of Hog Kog Tat Chee Aveue, Hog Kog reverse earest eghbor queres, where the goal s to retreve the data pots whose earest eghbor s a specfed query pot. Kor et al. [KMS02] study the same problem the cotext of data streams. Gve a query movg wth steady velocty, [SR0, TP02] cremetally mata the NN (as the query moves), whle [BJKS02, TPS02] propose techques for cotuous NN processg, where the goal s to retur all results up to a future tme. Kollos et al. [KGT99] develop varous schemes for aswerg NN queres o D movg objects. A overvew of exstg NN methods for spatal ad spatotemporal databases ca be foud [TP03]. I ths paper we dscuss group earest eghbor (GNN) queres, a ovel form of NN search. The put of the problem cossts of a set P={p,,p N } of statc data pots multdmesoal space ad a group of query pots Q={q,,q }. The output cotas the k ( ) data pot(s) wth the smallest sum of dstaces to all pots Q. The dstace betwee a data pot p ad Q s defed as dst(p,q)= =~ pq, where pq s the Eucldea dstace betwee p ad query pot q. As a example cosder a database that maages (statc) facltes (.e., dataset P). The query cotas a set of user locatos Q={q,,q } ad the result returs the faclty that mmzes the total travel dstace for all users. I addto to ts relevace geographc formato systems ad moble computg applcatos, GNN search s mportat several other domas. For stace, clusterg [JMF99] ad outler detecto [AY0], the qualty of a soluto ca be evaluated by the dstaces betwee the pots ad ther earest cluster cetrod. Furthermore, the operablty ad speed of very large crcuts depeds o the relatve dstace betwee the varous compoets them. GNN ca be appled to detect abormaltes ad gude relocato of compoets [NO97]. Assumg that Q fts memory ad P s dexed by a R tree, we frst propose three algorthms for solvg ths problem. The, we exted our techques for cases that Q s too large to ft memory, coverg both dexed ad odexed query pots. The rest of the paper s structured as follows. Secto 2 outles the related work o covetoal earest eghbor search ad topk queres. Secto 3
2 descrbes algorthms for the case that Q fts memory ad Secto 4 for the case that Q resdes o the dsk. Secto 5 expermetally evaluates the algorthms ad detfes the best oe depedg o the problem characterstcs. Secto 6 cocludes the paper wth drectos for future work. 2. Related work Followg most approaches the relevat lterature, we assume 2D data pots dexed by a Rtree [G84]. The proposed techques, however, are applcable to hgher dmesos ad other datapartto access methods such as Atrees [SYUK00] etc. Fgure 2. shows a Rtree for pot set P={p,p 2,,p 2 } assumg a capacty of three etres per ode. Pots that are close space (e.g., p, p 2, p 3 ) are clustered the same leaf ode (N 3 ). Nodes are the recursvely grouped together wth the same prcple utl the top level, whch cossts of a sgle root. Exstg algorthms for pot NN queres usg Rtrees follow the brachadboud paradgm, utlzg some metrcs to prue the search space. The most commo such metrc s mdst(n,q), whch correspods to the closest possble dstace betwee q ad ay pot the subtree of ode N. Fgure 2.a shows the mdst betwee pot q ad odes N, N 2. Smlarly, mdst(n,n 2 ) s the mmum possble dstace betwee ay two pots that resde the subtrees of odes N ad N 2. p p 2 p 3 p 4 p 5 p 6 N 3 N 4 R N N 2 N N 2 N 3 N 4 N 5 N 6 p 7 p 8 p 9 p 0 p p 2 (a) Pots ad ode extets (b) The correspodg Rtree Fgure 2.: Example of a Rtree ad a pot NN query The frst NN algorthm for Rtrees [RKV95] searches the tree a depthfrst (DF) maer. Specfcally, startg from the root, t vsts the ode wth the mmum mdst from q (e.g., N Fgure 2.). The process s repeated recursvely utl the leaf level (ode N 4 ), where the frst potetal earest eghbor s foud (p 5 ). Durg backtrackg to the upper level (ode N ), the algorthm oly vsts etres whose mmum dstace s smaller tha the dstace of the earest eghbor already retreved. I the example of Fgure 2., after dscoverg p 5, DF wll backtrack to the root level (wthout vstg N 3 ), ad the follow the path N 2,N 6 where the actual NN p s foud. The DF algorthm s suboptmal,.e., t accesses more odes tha ecessary. I partcular, as prove [PM97], a optmal algorthm should vst oly odes tersectg the vcty crcle that ceters at the query pot q ad has radus equal to the dstace betwee q ad ts earest N 5 N 6 eghbor. I Fgure 2.a, for stace, a optmal algorthm should vst oly odes R, N, N 2, ad N 6 (whereas DF also vsts N 4 ). The bestfrst (BF) algorthm of [HS99] acheves the optmal I/O performace by matag a heap H wth the etres vsted so far, sorted by ther mdst. As wth DF, BF starts from the root, ad serts all the etres to H (together wth ther mdst), e.g., Fgure 2.a, H={<N, mdst(n,q)>, <N 2, mdst(n 2,q)>}. The, at each step, BF vsts the ode H wth the smallest mdst. Cotug the example, the algorthm retreves the cotet of N ad serts all ts etres H, after whch H={<N 2, mdst(n 2,q)>, <N 4, mdst(n 4,q)>, <N 3, mdst(n 3,q)>}. Smlarly, the ext two odes accessed are N 2 ad N 6 (serted H after vstg N 2 ), whch p s dscovered as the curret NN. At ths tme, the algorthm termates (wth p as the fal result) sce the ext etry (N 4 ) H s farther (from q) tha p. Both DF ad BF ca be easly exteded for the retreval of k> earest eghbors. I addto, BF s also cremetal. Namely, t reports the earest eghbors ascedg order of ther dstace to the query, so that k does ot have to be kow advace (allowg dfferet termato codtos to be used). The brachadboud framework also apples to closest par queres that fd the par of objects from two datasets, such that ther dstace s the mmum amog all pars. [HS98, CMTV00] propose varous algorthms based o the cocepts of DF ad BF traversal. The dfferece from NN s that the algorthms access two dex structures (oe for each data set) smultaeously. If the mdst of two termedate odes N ad N j (oe from each Rtree) s already greater tha the dstace of the closest par of objects foud so far, the subtrees of N ad N j caot cota a closest par (thus, the par s prued). As show the ext secto, a processg techque for GNN queres apples multple covetoal NN queres (oe for each query pot) ad the combes ther results. Some related work o ths topc has appeared the lterature of topk (or raked) queres over multple data repostores (see [FLN0, BCG02, F02] for represetatve papers). As a example, cosder that a user wats to fd the k mages that are most smlar to a query mage, where smlarty s defed accordg to features, e.g., color hstogram, object arragemet, texture, shape etc. The query s submtted to retreval eges that retur the best matches for partcular features together wth ther smlarty scores,.e., the frst ege wll output a set of matches accordg to color, the secod accordg to arragemet ad so o. The problem s to combe the multple puts order to determe the topk results terms of ther overall smlarty. The ma dea behd all techques s to mmze the extet ad cost of search performed o each retreval ege order to compute the fal result. The threshold algorthm [FLN0] works as follows (assumg retreval of
3 the sgle best match): the frst query s submtted to the frst search ege, whch returs the closest mage p accordg to the frst feature. The smlarty betwee p ad the query mage wth respect to the other features s computed. The, the secod query s submtted to the secod search ege, whch returs p 2 (best match accordg to the secod feature). The overall smlarty of p 2 s also computed, ad the best of p ad p 2 becomes the curret result. The process s repeated a roudrob fasho,.e., after the last search ege s quered, the secod match s retreved wth respect to the frst feature ad so o. The algorthm wll termate whe the smlarty of the curret result s hgher tha the smlarty that ca be acheved by ay subsequet soluto. I the ext secto we adapt ths approach to GNN processg. 3. Algorthms for memoryresdet queres Assumg that the set Q of query pots fts memory ad that the data pots are dexed by a Rtree, we preset three algorthms for processg GNN queres. For each algorthm we frst llustrate retreval of a sgle earest eghbor, ad the show the exteso to k>. Table 3. cotas the prmary symbols used our descrpto (some have ot appeared yet, but wll be clarfed shortly). Symbol Descrpto Q set of query pots Q a group of queres that fts memory ( ) umber of queres Q (Q ) M (M ) MBR of Q (Q ) q cetrod of Q dst(p,q) sum of dstaces betwee pot p ad query pots Q mdst(n,q) mmum dstace betwee MBR of ode N ad cetrod q mdst(p,m) mmum dstace betwee data pot p ad query MBR M mdst ( N, M ) weghted mdst of ode N wth respect to all query groups Table 3.: Frequetly used symbols 3. Multple query method The multple query method (MQM) utlzes the ma dea of the threshold algorthm,.e., t performs cremetal NN queres for each pot Q ad combes ther results. For stace, Fgure 3. (where Q ={q,q 2 }), MQM retreves the frst NN of q (pot p 0 wth p 0 q =2) ad computes the dstace p 0 q 2 (=5). Smlarly, t fds the frst NN of q 2 (pot p wth p q 2 =3) ad computes p q (=3). The pot (p ) wth the mmum sum of dstaces ( p q + p q 2 =6) to all query pots becomes the curret GNN of Q. For each query pot q, MQM stores a threshold t, whch s the dstace of the curret NN,.e., t = p 0 q =2 ad t 2 = p q 2 =3. The total threshold T s defed as the sum of all thresholds (=5). Cotug the example, sce T < dst(p,q), t s possble that there exsts a pot P whose dstace to Q s smaller tha dst(p,q). So MQM retreves the secod NN of q (p, whch has already bee ecoutered by q 2 ) ad updates the threshold t to p q (=3). Sce T (=6) ow equals the summed dstace betwee the best eghbor foud so far ad the pots of Q, MQM termates wth p as the fal result. I other words, every oecoutered pot has dstace greater or equal to T (=6), ad therefore t caot be closer to Q ( the global sese) tha p. Fgure 3.: Example of a GNN query Fgure 3.2 shows the pseudo code for MQM (NN), where best_dst (tally ) s the dstace of the best_nn foud so far. I order to acheve localty of the ode accesses for dvdual queres, we sort the pots Q accordg to ther Hlbert value; thus, two subsequet queres are lkely to correspod to earby pots ad access smlar Rtree odes. The algorthm for computg earest eghbors of query pots should be cremetal (e.g., bestfrst search dscussed Secto 2) because the termato codto s ot kow advace. The exteso for the retreval of k (>) earest eghbors s straghtforward. The k eghbors wth the mmum overall dstaces are serted a lst of k pars <p, dst(p,q)> (sorted o dst(p,q)) ad best_dst equals the dstace of the kth NN. The, MQM proceeds the same way as Fgure 3.2, except that wheever a better eghbor s foud, t s serted best_nn ad the last elemet of the lst s removed. MQM(Q: group of query pots) /* T : threshold ; best_dst dstace of the curret NN*/ sort pots Q accordg to Hlbert value; for each query pot: t =0; T=0; best_dst= ; best_nn=ull; //Italzato whle (T < best_dst) get the ext earest eghbor p j of the ext query pot q ; t = p j q ; update T; f dst(p j,q)<best_dst best_nn =p j ; //Update curret GNN of Q best_dst = dst(p j,q) ; ed of whle; retur best_nn; Fgure 3.2: The MQM algorthm
4 3.2 Sgle pot method MQM may cur multple accesses to the same ode (ad retreve the same data pot, e.g., p ) through dfferet queres. To avod ths problem, the sgle pot method (SPM) processes GNN queres by a sgle traversal. Frst, SPM computes the cetrod q of Q, whch s a pot space wth a small value of dst(q,q) (deally, q s the pot wth the mmum dst(q,q)). The tuto behd ths approach s that the earest eghbor s a pot of P "ear" q. It remas to derve () the computato of q, ad () the rage aroud q whch we should look for pots of P, before we coclude that o better NN ca be foud. Towards the frst goal, let (x,y) be the coordates of cetrod q ad (x,y ) be the coordates of query pot q. The cetrod q mmzes the dstace fucto: dst( q, Q) = ( x  x ) + ( y y ) = 2 2 Sce the partal dervatves of fucto dst(q,q) wth respect to ts depedet varables x ad y are zero at the cetrod q, we have the followg equatos: dst( q, Q) x x = = 0 x 2 2 = ( x x) + ( y y) dst( q, Q) y y = = 0 y 2 2 = ( x x) + ( y y) Ufortuately, the above equatos caot be solved to closed form for >2, or other words, they must be evaluated umercally, whch mples that the cetrod s approxmate. I our mplemetato, we use the gradet descet [HYC0] method to quckly obta a good approxmato. Specfcally, startg wth some arbtrary tal coordates, e.g. x=(/) =~ x ad, y=(/) =~ y, the method modfes the coordates as follows: dst( q, Q) x = x η dst( q, Q) ad y = y η, x y where ŋ s a step sze. The process s repeated utl the dstace fucto dst(q,q) coverges to a mmum value. Although the resultg pot q s oly a approxmato of the deal cetrod, t suffces for the purposes of SPM. Next we show how q ca be used to prue the search space based o the followg lemma. Lemma : Let Q={q,,q } be a group of query pots ad q a arbtrary pot space. The followg equalty holds for ay pot p: dst(p,q) p q  dst(q,q), where pq deotes the Eucldea dstace betwee p ad q. Proof: Due to the tragular equalty, for each query pot q we have that: pq + q q pq. By summg up the equaltes: pq + q q pq dst( p, Q) pq  dst( q, Q) q Q q Q Lemma provdes a threshold for the termato of SPM. I partcular, by applyg a cremetal pot NN query at q, we stop whe we fd the frst pot p such that: pq dst(q,q) dst(best_nn,q). By Lemma, dst(p,q) pq dst(q,q) ad, therefore, dst(p,q) dst(best_nn,q). The same dea ca be used for prug termedate odes, as summarzed by the followg heurstc. Heurstc : Let q be the cetrod of Q ad best_dst be the dstace of the best GNN foud so far. Node N ca be prued f: best_dst+ dst( q,q) mdst( N, q) where mdst(n,q) s the mmum dstace betwee the MBR of N ad the cetrod q. A example of the heurstc s show Fgure 3.3, where the best_dst = 5+4. Sce, dst(q,q)=+2, the rght part of the equalty equals 6, meag that both odes the fgure wll be prued. Fgure 3.3: Prug of odes SPM Based o the above observatos, t s straghtforward to mplemet SPM usg the depthfrst or bestfrst paradgms. Fgure 3.4 shows the pseudocode of DF SPM. Startg from the root of the Rtree (for P), etres are sorted a lst accordg to ther mdst from the query cetrod q ad are vsted (recursvely) ths order. Oce the frst etry wth mdst(n j,q) (best_dst+dst(q,q))/ has bee foud, the subsequet oes the lst are prued. The exteso to k (>) GNN queres s the same as covetoal (pot) NN algorthms. SPM(Node: Rtree ode, Q: group of query pots) /* q: the cetrod of Q*/ f Node s a termedate ode sort etres N j Node accordg to mdst(n j,q) lst; repeat get_ext etry N j from lst; f mdst(n j,q)< (best_dst+dst(q,q))/; /* Heurstc SPM(N j,q); /* recurso*/ utl mdst(n j,q) (best_dst+dst(q,q))/ or ed of lst; else f Node s a leaf ode sort pots p j Node accordg to mdst(p j,q) lst; repeat get_ext etry p j from lst; f p j q <(best_dst+dst(q,q))/; /* Heurstc for pots f dst(p j,q)< best_dst best_nn =p j ; //Update curret GNN best_dst = dst(p j,q) ; utl p j q (best_dst+dst(q,q))/ or ed of lst; retur best_nn; Fgure 3.4: The SPM algorthm
5 3.3 Mmum boudg method Lke SPM, the mmum boudg method (MBM) performs a sgle query, but uses the mmum boudg rectagle M of Q (stead of the cetrod q) to prue the search space. Specfcally, startg from the root of the R tree for dataset P, MBM vsts oly odes that may cota caddate pots. I the sequel, we dscuss heurstcs for detfyg such qualfyg odes. Heurstc 2: Let M be the MBR of Q, ad best_dst be the dstace of the best GNN foud so far. A ode N caot cota qualfyg pots, f: best_dst mdst( N, M ) where mdst(n,m) s the mmum dstace betwee M ad N, ad s the cardalty of Q. Fgure 3.5 shows a group of query pots Q={q,q 2 } ad the best_nn wth best_dst=5. Sce mdst(n,m) = 3 > best_dst/2 = 2.5, N ca be prued wthout beg vsted. I other words, eve f there s a data pot p at the upperrght corer of N ad all the query pots were at the lower rght corer of Q, t would stll be the case that dst(p,q)> best_dst. The cocept of heurstc 2 also apples to the leaf etres. Whe a pot p s ecoutered, we frst compute mdst(p,m) from p to the MBR of Q. If mdst(p,m) best_dst/, p s dscarded sce t caot be closer tha the best_nn. I ths way we avod performg the dstace computatos betwee p ad the pots of Q. Fgure 3.5: Example of heurstc 2 The heurstc curs mmum overhead, sce for every ode t requres a sgle dstace computato. However, t s ot very tght,.e., t leads to uecessary ode accesses. For stace, ode N 2 ( Fgure 3.5) passes heurstc 2 (ad should be vsted), although t caot cota qualfyg pots. Heurstc 3 presets a tghter boud for avodg such vsts. Heurstc 3: Let best_dst be the dstace of the best GNN foud so far. A ode N ca be safely prued f: mdst( N, q ) best_dst q Q where mdst(n,q ) s the mmum dstace betwee N ad query pot q Q. I Fgure 3.5, sce mdst(n 2, q ) + mdst(n 2, q 2 ) = 6 > best_dst = 5, N 2 s prued. Because heurstc 3 requres multple dstace computatos (oe for each query pot) t s appled oly for odes that pass heurstc 2. Note that (lke heurstc 2) heurstc 3 does represet the tghtest codto for successful ode vsts;.e., t s possble for a ode to satsfy the heurstc ad stll ot cota qualfyg pots. Cosder, for stace, Fgure 3.6, whch cludes 3 query pots. The curret best_dst s 7, ad ode N 3 passes heurstc 3, sce mdst(n 3,q ) + mdst(n 3,q 2 ) + mdst(n 3,q 3 ) = 5. Nevertheless, N 3 should ot be vsted, because the mmum dstace that ca be acheved by ay pot N 3 s greater tha 7. The dotted les Fgure 3.6 correspod to the dstace betwee the best possble pot p' (ot ecessarly a data pot) N 3 ad the three query pots. Fgure 3.6: Example of a hypothetcal optmal heurstc Assumg that we ca detfy the best pot p' the ode, we ca obta a tght heurstc a follows: f the dstace of p' s smaller tha best_dst vst the ode; otherwse, reject t. The combato of the bestfrst approach wth ths heurstc would lead to a I/O optmal method (such as the algorthm of [HS99] for covetoal NN queres). Fdg pot p', however, s smlar to the problem of locatg the query cetrod (but ths tme a rego costraed by the ode MBR), whch, as dscussed Secto 3.2, ca oly be solved umercally (.e., approxmately). Although a approxmato suffces for SPM, for the correctess of best_dst t s ecessary to have the precse soluto ( order to avod false msses). As a result, ths hypothetcal heurstc caot be appled for exact GNN retreval. Heurstcs 2 ad 3 ca be used wth both the depthfrst ad bestfrst traversal paradgms. For smplcty, we dscuss MBM based o depthfst traversal usg the example of Fgure 3.7. The root of the Rtree s retreved ad ts etres are sorted by ther mdst to M. The, the ode (N ) wth the mmum mdst s vsted, sde whch the etry of N 4 has the smallest mdst. Pots p 5, p 6, p 4 ( N 4 ) are processed accordg to the value of mdst(p j,m) ad p 5 becomes the curret GNN of Q (best_dst=). Pots p 6 ad p 4 have larger dstaces ad are dscarded. Whe backtrackg to N, the subtree of N 3 s prued by heurstc 2. Thus, MBM backtracks aga to the root ad vsts odes N 2 ad N 6, sde whch p 0 has the smallest mdst to M ad s processed frst, replacg p 5 as the GNN (best_dst=7). The, p becomes the best NN (best_dst=6). Fally, N 5 s prued by heurstc 2, ad the algorthm termates wth p as the fal GNN. The exteso to retreval of knn ad the bestfrst mplemetato are straghtforward.
6 p p 2 p 3 p 4 N 4 N 3 N p N 8 p 9 2 N 5 p 7 8 p 5 p 6 6 q q 2 M p 0 p N p 2 Fgure 3.7: Query processg of MBM 4. Algorthms for dskresdet queres We ow dscuss the stuato that the query set does ot ft ma memory. Secto 4. cosders that Q s dexed by a Rtree, ad shows how to adapt the Rtree closest par (CP) algorthm [HS98, CMTV00] for GNN queres wth addtoal prug rules. We argue, however, that the Rtree o Q offers lmted beefts towards reducg the query tme. Motvated by ths, Sectos 4.2 ad 4.3 we develop two alteratve methods, based o MQM ad MBM, whch do ot requre ay dex o Q. Aga, for smplcty, we descrbe the algorthms for sgle NN retreval before dscussg k>. 4. Group closest pars method Assume a cremetal CP algorthm that outputs closest pars <p,q j > (p P, q j Q) ascedg order of ther dstace. Cosder that we keep the cout(p ) of pars whch p has appeared, as well as, the accumulated dstace (curr_dst(p )) of p all these pars. Whe the cout of p equals the cardalty of Q, the global dstace of p, wth respect to all query pots, has bee computed. If ths dstace s smaller tha the best global dstace (best_dst) foud so far, p becomes the curret NN. Two questos rema to be aswered: () whch are the qualfyg data pots that ca lead to a better soluto? () whe ca the algorthm termate? Regardg the frst questo, clearly all pots ecoutered before the frst complete NN s foud, are qualfyg. Every such pot p s kept a lst < p, cout(p ), curr_dst(p )>. O the other had, f we already have a complete NN, every data pot that s ecoutered for the frst tme ca be dscarded sce t caot lead to a better soluto. I geeral, the lst of qualfyg pots keeps creasg utl a complete NN s foud. The, oqualfyg pots ca be gradually removed from the lst based o the followg heurstc: Heurstc 4: Assume that the curret output of the CP algorthm s <p,q j >. We ca mmedately dscard all pots p such that: (couter(p)) dst(p,q j ) + curr_dst(p) best_dst I other words, p caot yeld a global dstace smaller tha best_dst, eve f all ts ucomputed dstaces are equal to dst(p,q j ). Heurstc 4 s appled two cases: () for each output par <p,q j >, o the data pot p ad () whe the global NN chages, o all qualfyg pots. Every pot p that fals the heurstc s deleted from the qualfyg lst. If p s ecoutered aga a subsequet par, t wll be cosdered as a ew pot ad prued. Fgure 4.a shows a example where the closest pars are foud cremetally accordg to ther dstace.e., (<p,q >, 2), (< p,q 2 >, 2), (< p 2,q >, 3), (< p 2,q 3 >, 3), (< p 3,q 3 >, 4), (<p 2,q 2 >, 5). After par <p 2,q 2 > s output, we have a complete NN, p 2 wth global dstace. Heurstc 4 s appled to all qualfyg pots ad p 3 s dscarded; eve f ts (o yet dscovered) dstaces to q ad q 2 equal 5, ts global dstace wll be 4 (.e., greater tha best_dst). (a) Dscovery of st NN (b) Termato Fgure 4.: Example of GCP For each remag qualfyg pot p, we compute a threshold t as: t =(best_dstcurr_dst(p )) / (couter(p )). I the geeral case, that multple qualfyg pots exst, the global threshold T s the maxmum of dvdual thresholds t,.e., T s the largest dstace of the output closest par that ca lead to a better soluto tha the exstg oe. I Fgure 4.a, for stace, T=t =7, meag that whe the output par has dstace 7, the algorthm ca termate. Every applcato of heurstc 4 also modfes the correspodg thresholds, so that the value of T s always up to date. Based o these observatos we are ow ready to establsh the termato codto,.e., GCP termates whe () at least a GNN has bee foud (best_dst< ) ad () the qualfyg lst s empty, or the dstace of the curret par becomes larger tha the global threshold T. Fgure 4.b cotues the example of Fgure 4.a. I ths case the algorthm termates after the par (< p,q 3 >, 6.3) s foud, whch establshes p as the best NN (ad the lst becomes empty). The pseudocode of the GCP s show Fgure 4.2. We store the qualfyg lst as a memory hash table o pot ds to facltate the retreval of formato (.e., couter(p ), curr_dst(p )) about partcular pots (p ). If the sze of the lst exceeds the avalable memory, part of the table s stored to the dsk. I case of knn queres, best_dst equals the global dstace of the kth complete eghbor foud so far (.e., prug the qualfyg lst ca occur oly after k complete eghbors are retreved). I the worst case, the lst may cota a etry for each pot of P.
7 GCP best_nn = NULL; best_dst = ; /* talzato repeat output ext closest par <p,q j > ad dst(p,q j ) f p s ot lst f best_dst < cotue; /* dscard p ad process ext par else add < p,, dst(p,q j )> lst; else /* p has bee ecoutered before ad stll resdes lst couter(p )++; curr_dst(p )= curr_dst(p )+ dst(p,q j ); f couter(p )= f curr_dst(p )< best_dst best_nn = p ; //Update curret GNN best_dst = curr_dst(p ); T=0; for each caddate pot p lst f (couter(p)) dst(p,q j )+curr_dst(p) best_dst remove p from lst; /* prued by heurstc 6 else /* p ot prued by heurstc 6 t= (best_dstcurr_dst(p)) / (couter(p)); f t > T the T = t; /* update threshold else remove p from lst; else /* couter(p )< f best_dst < /* a NN has bee foud already f (couter(p )) dst(p,q j )+curr_dst(p ) best_dst remove p from lst; /* prued by heurstc 6 else /*ot prued by heurstc 6 t = (best_dstcurr_dst(p )) / (couter(p )); f t > T the T = t ; /* update threshold utl (best_dst < ) ad (dst(p,q j ) T or lst s empty); retur best_nn; Fgure 4.2: The GCP algorthm Whe the workspace (.e., MBR) of Q s small ad cotaed the workspace of P, GCP ca termate after outputtg a small percetage of the total umber of closest pars. Cosder, for stace, Fgure 4.3a, where there exst some pots of P (e.g., p 2 ) that are ear all query pots. The umber of closest pars that must be cosdered depeds oly o the dstace betwee p 2 ad ts farthest eghbor (q 5 ) Q. Data pot p 3, for example, wll ot partcpate ay output closest par sce ts earest dstace to ay query pot s larger tha p 2 q 5. O the other had, f the MBR of Q s large or partally overlaps (or s dsjot) wth the workspace of P, GCP must output may closestpars before t termates. Fgure 4.3b, shows such a example, where the dstace betwee the best_nn (p 2 ) ad ts farthest query pot (q 2 ) s hgh. I addto to the computatoal overhead of GCP ths case, aother dsadvatage s ts large heap requremets. Recall that GCP apples a cremetal CP algorthm that must keep all closest pars the heap utl the frst NN s foud. The umber of such pars the worst case equals the cardalty of the Cartesa product of the datasets 2. To 2 Ths may happe f there s a data pot (o the corer of the workspace) such that () ts dstace to most query pots s very small (so that the pot caot be prued) ad () ts dstace to a query pot (located o the opposte corer of the workspace) s the largest possble. allevate the problem, Hjaltaso ad Samet [HS99] proposed a heap maagemet techque (cluded our mplemetato), accordg to whch, part of the heap mgrates to the dsk whe ts sze exceeds the avalable memory space. Nevertheless, as show Secto 5, the cost of GCP s ofte very hgh, whch motvates the subsequet algorthms. p q q 2 q 3 p 2 q 4 workspace of Q q 5 workspace of P p 3 (a) Hgh prug (b) Low prug Fgure 4.3: Observatos about the performace of GCP 4.2 FMQM MQM ca be appled drectly for dskresdet, odexed Q, wth however, very hgh cost due to the large umber of dvdual queres that must be performed (as show Secto 5, ts cost creases fast wth the cardalty of Q). I order to overcome ths problem, we propose FMQM (flemultple query method), whch splts Q to blocks {Q,.., Q m } that ft memory. For each block, t computes the GNN usg oe of the ma memory algorthms (we apply MBM due to ts superor performace  see Secto 5), ad fally t combes ther results usg MQM. The complcato s that oce a NN of a group has bee retreved, we caot effectvely compute ts global dstace (.e., wth respect to all data pots) mmedately. Istead, we follow a lazy approach: frst we fd the GNN p of the frst group Q ; the, we load memory the secod group Q 2 ad retreve ts NN p 2. At the same tme, we also compute the dstace betwee p ad Q 2, whose curret dstace becomes curr_dst(p ) = dst(p,q ) + dst(p,q 2 ). Smlarly, whe we load Q 3, we update the curret dstaces of p ad p 2 takg to accout the objects of the thrd group. After the ed of the frst roud, we oly have oe data pot (p ), whose global dstace wth respect to all query pots has bee computed. Ths pot becomes the curret NN. The process s repeated a roud rob fasho ad at each step a ew global dstace s derved. For stace, whe we read aga the frst group (to retreve ts secod NN), the dstace of p 2 (frst NN of Q 2 ) s completed wth respect to all groups. Betwee p ad p 2, the pot wth the mmum global dstace becomes the curret NN. As the case of MQM, the threshold t j for each group Q j equals dst(p j,q j ), where p j s the last retreved eghbor of Q j. The global threshold T s the sum of all thresholds. FMQM termates whe T becomes equal or larger tha the global dstace of the best NN foud so far.
8 The algorthm s llustrated Fgure 4.4. I order to acheve localty, we frst sort (exterally) the pots of Q accordg to ther Hlbert value. The, each group s obtaed by takg a umber of cosecutve pages that ft memory. The exteso for the retreval of k (>) GNNs s smlar to mamemory MQM. I partcular, best_nn s ow a lst of k pars <p, dst(p,q)> (sorted by the global dst(p,q)) ad best_dst equals the dstace of the kth NN. The, t proceeds the same way as Fgure 4.4. FMQM(Q: group of query pots) best_nn = NULL; best_dst = ; T=0; /* talzato sort pots of Q accordg to Hlbert value ad splt them to groups {Q,.., Q m } so that each group fts memory; whle (T < best_dst) read ext group Q j ; get the ext earest eghbor p j of group Q j ; curr_dst(p j )= dst(p j,q j ) ; t j = dst(p j,q j ); update T; f t s the frst pass of the algorthm for each cur. eghbor p of Q ( <j) /*update other NN curr_dst(p )= curr_dst(p ) + dst(p,q j ) ; else /*local NN have bee computed for all m groups for each cur. eghbor p of Q ( m, j) /*update other NN curr_dst(p )= curr_dst(p ) + dst(p,q j ) ; ext=(j+) modulo m; /*group whose global dst. s complete f curr_dst(p ext )<best_dst best_nn =p ext ; /*update curret GNN of Q best_dst = curr_dst(p ext ) ; ext=(j+) modulo m; /*ext group to process ed whle; retur best_nn; Fgure 4.4: The FMQM algorthm FMQM s expected to perform well f the umber of query groups s relatvely small, mmzg the umber of applcatos of the ma memory algorthm. O the other had, f there are umerous groups, the combato of the dvdual results may be expesve. Furthermore, as the case of (mamemory) MQM, the algorthm may perform redudat computatos, f t ecouters the same data pot as a earest eghbor of dfferet query groups. A possble optmzato s to keep each NN memory, together wth ts dstaces to all groups, so that we avod these computatos f the same pot s ecoutered later through aother group. Ths however, may ot be possble f the ma memory sze s lmted. 4.3 FMBM We ca exted both SPM ad MBM for the case that Q does ot ft memory. Sce, as show the expermets, MBM s more effcet, here we descrbe FMBM, a adaptato of the mmum boudg method. Frst, the pots of Q are sorted by ther Hlbert value ad are serted pages accordg to ths order. A page Q cotas pots (t s possble that the umber of pots dffers, e.g., the last page may be halffull). For each group Q, we keep memory ts MBR M ad (but ot ts cotets). FMBM desceds the Rtree of P ( DF or BF traversal), oly followg odes that may cota qualfyg pots. Gve that we have the values of M ad for each query group memory, we ca quckly detfy qualfyg odes as follows. Heurstc 5: Let best_dst be the dstace of the best GNN foud so far ad M be the MBR of group Q. A ode N ca be safely prued f: mdst( N, M ) best_dst Q Q We refer to the left part of the equalty as the weghted mdst of N. Fgure 4.5 shows a example, where 5 query pots are splt to two groups wth MBRs M, M 2 ad best_dst = 20. Accordg to heurstc 5, N ca be prued because ts weghted mdst (2 mdst(n,m ) + 3 mdst(n,m 2 )) s 20, ad t caot cota a better NN. Fgure 4.5: Example of heurstc 5 Whe a leaf ode N s reached, we have to compute the global dstace of ts data pots wth all groups. Itally the curret dstace curr_dst(p j ) of each pot p j N s set to 0. The, for each ew group Q ( m) that s loaded memory, curr_dst(p j ) s updated as curr_dst(p j )+ dst(p j,q ). We ca reduce the CPUoverhead of the dstace computatos based o the followg heurstc. Heurstc 6: Let curr_dst(p j ) be the accumulated dstace of data pot p j wth respect to groups Q,.., Q . The, p j ca be safely excluded from further cosderato f: j l j l l= curr _ dst( p )+ mdst( p, M ) best_dst Fgure 4.6 shows a example of heurstc 6, where the frst group Q has bee processed ad curr_dst(p j ) = dst(p j,q ) = 5+3. Pot p j s ot compared wth the query pots of Q 2, sce 8+3 mdst(p j,m 2 )=20 s already equal to best_dst. Thus, p j wll ot be cosdered for further computatos (.e., whe subsequet groups are loaded memory). Fgure 4.6: Example of heurstc 6
9 The fal clarfcato regards the order accordg to whch qualfyg odes ad query groups are accessed. For odes we use the weghted mdst, based o the tuto that odes wth small values are lkely to lead to eghbors wth small global dstace, so that subsequet vsts ca be prued by heurstc 5. Whe a leaf ode N has bee reached, each group Q s read memory descedg order of mdst(n,m ). The motvato s that groups that are far from the ode are lkely to prue umerous data pots (thus, savg the dstace computatos for these pots wth respect to other groups). Fgure 4.7 shows the pseudocode of FMBM based o DF traversal (the BF mplemetato s smlar). FMBM(Node: Rtree ode, Q: group of query pots) /* Q cossts of {Q,.., Q m } that ft memory f Node s a termedate ode sort etres N j Node (accordg to weghted mdst) lst; repeat get_ext etry N j from lst; f weghted mdst(n j )< best_dst /*N passes heurstc 5 FMBM(N j, Q) ; /* Recurso utl weghted mdst(n j ) best_dst or ed of lst; else f Node s a leaf ode sort pots p j Node (accordg to weghted mdst) lst; for each pot p j lst : curr_dst(p j )=0; /* talzato sort groups Q descedg order of mdst(node, M ) ; repeat read ext group Q ( m) ; for each pot p j lst j l j l l= f curr _ dst( p )+ mdst( p, M ) best_dst remove p j from lst; /* p j fals heurstc 6 else /* p j passes heurstc 6 curr_dst(p j )= curr_dst(p j )+dst(p j,q ) ; utl weghted mdst(p j ) best_dst or ed lst or ed of groups; for each pot p that remas lst /*after termato of loops f curr_dst(p)< best_dst best_nn =p; //Update curret GNN best_dst = curr_dst(p) ; retur best_nn; Fgure 4.7: The FMBM algorthm Startg from the root of the Rtree of P, etres are sorted by ther weghted mdst, ad vsted (recursvely) ths order. Oce the frst ode that fals heurstc 5 s foud, all subsequet odes the sorted lst ca also be prued. For leaf odes, f a pot volates heurstc 6, t s removed from the lst ad s ot compared wth subsequet groups. The exteso to k NN s straghtforward. 5. Expermets I ths secto we evaluate the effcecy of the proposed algorthms, usg two real datasets: () PP [Web] wth populated places North Amerca, ad () TS [Web2], whch cotas the cetrods of 9497 MBRs represetg streams (polyles) of Iowa, Kasas, Mssour ad Nebraska. For all expermets we use a Petum 2.4GHz CPU wth GByte memory. The page sze of the R*trees [BKSS00] s set to KByte, resultg a capacty of 50 etres per ode. All mplemetatos are based o the bestfrst traversal. Both versos of MQM ad GCP requre BF due to ther cremetal behavor. SPM ad MBM (or FMBM) could also be used wth DF. 5. Comparso of algorthms for memoryresdet queres We frst compare the methods of Secto 3 (MQM, SPM ad MBM) for mamemory queres. For ths purpose, we use workloads of 00 queres. Each query has a umber of pots, dstrbuted uformly a MBR of area M, whch s radomly geerated the workspace of P. The values of ad M are detcal for all queres the same workload (.e., the oly chage betwee two queres the same workload s the posto of the query MBR). Frst we study the effect of the cardalty of Q, by fxg M to 8% of the workspace of P ad the umber k of retreved group earest eghbors to 8. Fgure 5. shows the average umber of ode accesses (NA) ad CPU cost as fuctos of for datasets PP ad TS. E umber of ode accesses (a) NA vs. (PP dataset) E+5 E umber of ode accesses MQM SPM MBM CPU cost (sec) (b) CPU vs. (PP dataset) CPU cost (sec) (c) NA vs. (TS dataset) (d) CPU vs. (TS dataset) Fgure 5.: Cost vs. cardalty of Q (M=8%, k=8) MQM s, geeral, the worst method ad ts cost creases fast wth the query cardalty, because ths leads to multple queres, some of whch access the same odes ad retreve the same pots. These redudat computatos, affect both the ode accesses ad the CPU cost sgfcatly (all dagrams are logarthmc scale). Although most queres access smlar paths the Rtree of P (ad, therefore, MQM beefts from the exstece of a LRU buffer), ts total cost s stll prohbtve for large due to the
10 hgh CPU overhead. O the other had, the cardalty of Q has lttle effect o the ode accesses of SPM ad MBM because t does ot play a mportat role the prug power of heurstc (for SPM) ad heurstcs 2, 3 (for MBM). It affects, however, the CPU tme, because the dstace computatos for qualfyg data pots crease wth the umber of query pots. MBM s better tha SPM due to the hgh prug power of heurstc 3, as opposed to heurstc 3. I order to measure the effect of the MBR sze of Q, we set =64, k=8 ad vary M from 2% to 32% of the workspace of P. As show Fgure 5.2, the cost (average NA ad CPU tme) of all algorthms creases wth the query MBR. For MQM, the termato codto s that the total threshold T (.e., sum of thresholds for each query pot) should exceed best_dst, whch, however, creases wth the MBR sze. Therefore, MQM retreves more NNs for each query pot. For SPM (MBM), the reaso s the degradato of prug power of heurstc (heurstc 2 ad 3) wth the MBR sze of Q. E+4 umber of ode accesses % 4% 8% 6% 32% MBR sze of Q (a) NA vs. M sze (PP) E+5 umber of ode accesses E % 4% 8% 6% 32% MBR sze of Q MQM SPM MBM CPU cost (sec) 2% 4% 8% 6% 32% MBR sze of Q (b)cpu vs. M sze (PP) CPU cost (sec) 2% 4% 8% 6% 32% MBR sze of Q (c) NA vs. M sze (TS) (d)cpu vs. M sze (TS) Fgure 5.2: Cost vs. sze of MBR of Q (=64, k=8) Fally, Fgure 5.3, we set = 64, M=8% ad vary the umber k of retreved eghbors from to 32. The value of k does ot fluece the cost of ay method sgfcatly, because most cases a large umber of eghbors are foud the same ode wth a few extra computatos. The relatve performace of the algorthms s smlar to the 3 We mplemeted a verso of MBM wth oly heurstc 2 ad we foud t feror to SPM. Nevertheless, heurstc 2 s useful ( cojucto wth heurstc 3) because t reduces the CPU tme requremets of the algorthm. prevous dagrams: MBM s clearly the most effcet method, followed by SPM umber of ode accesses k (a) NA vs. k (PP dataset) E umber of ode accesses k MQM SPM MBM CPU cost (sec) k (b) CPU vs. k (PP dataset) CPU cost (sec) k (c) NA vs. k (TS dataset) (d) CPU vs. k (TS dataset) Fgure 5.3: Cost vs. um. of retreved NNs (=64, M=8%) 5.2 Comparso of algorthms for dskresdet queres For ths set of expermets we use both datasets (PP, TS) alteratvely as query ad data pots. For GCP we assume that both datasets are dexed by Rtrees, whereas for F MQM ad FMBM, the dataset that plays the role of Q s sorted (accordg to Hlbert values) ad splt to blocks of 0000 pots, that ft memory. The cost of sortg ad buldg the Rtrees s ot take to accout. Sce ow the query cardalty s fxed to that of the correspodg dataset, we perform expermets by varyg the relatve workspaces of the two datasets. Frst, we assume that the workspaces of P ad Q have the same cetrod, but the area M (of the MBR of Q) vares betwee 2% ad 32% of the workspace of P (smlar to the expermets of Fgure 5.2). Fgure 5.4 shows NA ad CPU tme assumg that PP s the query dataset ad k=8. GCP has the worst performace ad ts cost creases fast wth M for the reasos dscussed Secto 4.. Whe M exceeds 8% percet of the workspace of P, GCP does ot termate at all due to the huge heap requremets. The other two algorthms are more tha a order of magtude faster. F MQM outperforms FMBM, except for NA case of large (> 4%) query workspaces. The good performace of F MQM (compared to the mamemory results) s due to the fact that the query set (PP) cotas data pots ad, therefore, t geerates oly 3 query groups. Each query group s processed memory (by MBM) ad ther results are combed wth relatvely small overhead.
11 E+7 E+6 E+5 E+4 GCP FMQM FMBM umber of ode accesses E+4 CPU tme (sec) E+2 E+ E+0 E 2% 4% 8% 6% 32% MBR area of Q (a) NA vs. M sze 2% 4% 8% 6% 32% MBR area of Q (b) CPU vs. M sze Fgure 5.4: Cost vs. sze of MBR of Q (k=8, P=TS, Q=PP) Fgure 5.5 llustrates a smlar expermet, where PP plays the role of the dataset ad TS the role of the query set (recall that the cardalty of TS s almost a order of magtude hgher tha that of PP). I ths case FMBM s clearly better, due to the large umber (20) of query groups whose results must be combed by FMQM. Comparg Fgure 5.5 wth 5.4, we observe that the performace of F MBM s smlar, whle FMQM s sgfcatly worse. Ths s cosstet wth the mamemory behavor of MQM (Fgure 5.) where the cost creases fast wth the cardalty of the query set. GCP s omtted from the dagrams because t curs excessvely hgh cost. E+8 E+7 E+6 E+5 E+4 FMQM umber of ode accesses 2% 4% 8% 6% 32% MBR area of Q (a) NA vs. M sze FMBM CPU tme (sec) E+2 E+ E+0 2% 4% 8% 6% 32% MBR area of Q (b) CPU vs. M sze Fgure 5.5: Cost vs. sze of MBR of Q (k=8, P=PP, Q=TS) I order to further vestgate the effect of the relatve workspace postos, for the ext set of expermets we assume that both datasets le workspaces of the same sze, ad vary the overlap area betwee the workspaces from 0% (.e., P ad Q are totally dsjot) to 00% (.e. o top of each other). Itermedate values are obtaed by startg from the 00% case ad shftg the query dataset o both axes. Fgure 5.6 shows the cost of the algorthms assumg that Q=PP. The cost of all algorthms grows fast wth the overlap area because t: () creases the umber of potetal caddates wth the threshold of FMQM () reduces the prug power of FMBM heurstcs ad () creases the umber of closest pars that must be output before the termato of GCP. FMQM clearly outperforms FMBM for up to 50% overlap. I order to expla ths, let us cosder the 0% overlap case assumg that the query workspace starts at the upperrght corer of the data workspace. The earest eghbors of all query groups must le ear ths upperrght corer, sce such pots mmze the total dstace. Therefore, FMQM ca fd the best NN relatvely fast, ad termate whe all the pots or ear the corer have bee cosdered. O the other had, because each query group has a large MBR (recall that t cotas 0000 pots), umerous odes satsfy the prug heurstc of FMBM ad are vsted. E+7 E+6 E+5 E+4 GCP FMQM FMBM umber of ode accesses E+4 E+2 E+ E+0 E CPU tme (sec) E2 0% 25% 50% 75% 00% 0% 25% 50% 75% 00% overlap area overlap area (a) NA vs. overlap area (b) CPU vs. overlap area Fgure 5.6: Cost vs. overlap area (k=8, P=TS, Q=PP) Fgure 5.7 repeats the expermet by settg Q=TS. The clear wer s FMBM, aga due to the umerous queres that must be performed by FMQM. We also performed expermets by varyg the umber of eghbors retreved, whle keepg the other parameters fxed. As the case of mamemory queres, k does ot have a sgfcat effect o performace (ad the dagrams are omtted). E+8 E+7 E+6 E+5 E+4 FMQM umber of ode accesses 0% 25% 50% 75% 00% overlap area FMBM E+4 CPU tme (sec) E+2 E+ E+0 E 0% 25% 50% 75% 00% overlap area (a) NA vs. overlap area (b) CPU vs. overlap area Fgure 5.7: Cost vs. overlap area (k=8, P=PP, Q=TS) I summary, the best algorthm for dskresdet queres depeds o the umber of query groups. FMQM s usually preferable whe the query dataset s parttoed a small umber of groups; otherwse, FMBM s better. GCP has very poor performace all cases. We also expermeted wth a alteratve verso of MBM that uses a Rtree o Q (stead of Hlbert sortg). The techque, however, dd ot provde performace beefts because for each qualfyg pot of P we have to compute ts accumulated dstace to all query pots ayway.
12 6. Cocluso Gve a dataset P ad a group of query pots Q, a group earest eghbor query retreves the pot of P that mmzes the sum of dstaces to all pots Q. I ths paper we descrbe several algorthms for processg such queres, cludg mamemory ad dskresdet Q, ad expermetally evaluate ther performace uder a varety of settgs. Sce the problem s by defto expesve, the performace of dfferet algorthms ormally vares up to orders of magtude, whch motvates effcet processg methods. I the future we ted to explore the applcato of related techques to varatos of group earest eghbor search. Cosder, for stace, that Q represets a set of facltes ad the goal s to assg each object of P to a sgle faclty so that the sum of dstaces (of each object to ts earest faclty) s mmzed. Addtoal costrats (e.g., a faclty may serve at most k users) may further complcate the solutos. Smlar problems have bee studed the cotext of clusterg ad recourse allocato, but the proposed methods are dfferet from the oes preseted ths paper. Furthermore, t would be terestg to study other dstace metrcs (e.g., etwork dstace) that ecesstate alteratve prug heurstcs ad algorthms. Ackowledgemets Ths work was supported by grat HKUST 680/03E from Hog Kog RGC. Refereces [AMN+98] Arya, S., Mout, D., Netayahu, N., Slverma, R., Wu, A. A Optmal Algorthm for Approxmate Nearest Neghbor Searchg, Joural of the ACM, 45(6): , 998. [AY0] Aggrawal, C., Yu, P. Outler Detecto for Hgh Dmesoal Data. SIGMOD, 200. [B00] Bohm, C. A Cost Model for Query Processg Hgh Dmesoal Data Spaces. TODS, Vol. 25(2): 2978, [BCG02] Bruo, N., Chaudhur, S., Gravao, L. Topk Selecto Queres over Relatoal Databases: Mappg Strateges ad Performace Evaluato. TODS 27(2): 5387, [BGRS99] Beyer, K., Goldste, J., Ramakrsha, R., Shaft, U. Whe Is Nearest Neghbor Meagful? ICDT, 999. [BJKS02] Beets, R., Jese, C., Karcauskas, G., Saltes, S. Nearest Neghbor ad Reverse Nearest Neghbor Queres for Movg Objects. IDEAS, [BKSS90] Beckma, N., Kregel, H.P., Scheder, R., Seeger, B. The R*tree: A Effcet ad Robust Access Method for Pots ad Rectagles. SIGMOD, 990. [CMTV00] Corral, A., Maolopoulos, Y., Theodords, Y., Vasslakopoulos, M. Closest Par Queres Spatal Databases. SIGMOD, [F02] Fag, R. Combg Fuzzy Iformato: a Overvew. SIGMOD Record, 3 (2): 098, [FLN0] Fag, R., Lotem, A., Naor, M. Optmal Aggregato Algorthms for Mddleware. PODS, 200. [FSAA0] Ferhatosmaoglu, H., Stao, I., Agrawal, D., Abbad, A. Costraed Nearest Neghbor Queres. SSTD, 200. [G84] Guttma, A. Rtrees: A Dyamc Idex Structure for Spatal Searchg. SIGMOD, 984. [JMF99] Ja, A., Murthy, M., Fly, P., Data Clusterg: A Revew. ACM Comp. Surveys, 3(3): , 999. [HS98] Hjaltaso, G., Samet, H. Icremetal Dstace Jo [HS99] Algorthms for Spatal Databases. SIGMOD, 998. Hjaltaso, G., Samet, H. Dstace Browsg Spatal Databases. TODS, 24(2), , 999. [HYC0] Hochreter, S., Youger, A.S., Cowell, P. Learg to Lear Usg Gradet Descet. ICANN, 200. [KGT99] Kollos, G., Guopulos, D., Tsotras, V. Nearest Neghbor Queres Moble Evromet. STDBM, 999. [KM00] Kor, F., Muthukrsha, S. Ifluece Sets Based o Reverse Nearest Neghbor Queres. SIGMOD, [KMS02] Kor, F., Muthukrsha, S. Srvastava, D. Reverse Nearest Neghbor Aggregates Over Data Streams. VLDB, [NO97] [PM97] Nakao, K., Olaru, S. A Optmal Algorthm for the AgleRestrcted All Nearest Neghbor Problem o the Recofgurable Mesh, wth Applcatos. IEEE Tras. o Parallel ad Dstrbuted Systems 8(9): , 997. Papadopoulos, A., Maolopoulos, Y. Performace of Nearest Neghbor Queres Rtrees. ICDT, 997. [PZMT03] Papadas, D., Zhag, J., Mamouls, N., Tao, Y. Query Processg Spatal Network Databases. VLDB, [RKV95] Roussopoulos, N., Kelly, S., Vcet, F. Nearest Neghbor Queres. SIGMOD, 995. [S9] Sproull, R. Refemets to Nearest Neghbor Searchg KDmesoal Trees. Algorthmca, 6(4): , 99. [SKS02] Shahab, C., Kolahdouza, M., Sharfzadeh, M. A Road Network Embeddg Techque for KNearest Neghbor Search Movg Object Databases. ACM GIS, [SR0] Sog, Z., Roussopoulos, N. KNearest Neghbor Search for Movg Query Pot. SSTD, 200. [SYUK00] Sakura, Y., Yoshkawa, M., Uemura, S., Kojma, H. The Atree: A Idex Structure for HghDmesoal Spaces Usg Relatve Approxmato. VLDB, [TP02] Tao, Y., Papadas, D. Tme Parameterzed Queres SpatoTemporal Databases. SIGMOD, [TP03] Tao, Y., Papadas, D. Spatal Queres Dyamc Evromets. ACM TODS, 28(2): 039, [TPS02] Tao, Y., Papadas, D., She, Q. Cotuous Nearest Neghbor Search. VLDB, [Web] [Web2] dke.ct.gr/people/ytheod/research/datasets/ [WSB98] Weber, R., Schek, H.J., Blott, S. A Quattatve Aalyss ad Performace Study for SmlartySearch Methods HghDmesoal Spaces. VLDB, 998. [YOTJ0] Yu, C., Oo, B, Ta, K., Jagadsh, H. Idexg the Dstace: A Effcet Method to KNN Processg. VLDB, 200.
6.7 Network analysis. 6.7.1 Introduction. References  Network analysis. Topological analysis
6.7 Network aalyss Le data that explctly store topologcal formato are called etwork data. Besdes spatal operatos, several methods of spatal aalyss are applcable to etwork data. Fgure: Network data Refereces
More informationIDENTIFICATION OF THE DYNAMICS OF THE GOOGLE S RANKING ALGORITHM. A. Khaki Sedigh, Mehdi Roudaki
IDENIFICAION OF HE DYNAMICS OF HE GOOGLE S RANKING ALGORIHM A. Khak Sedgh, Mehd Roudak Cotrol Dvso, Departmet of Electrcal Egeerg, K.N.oos Uversty of echology P. O. Box: 163151355, ehra, Ira sedgh@eetd.ktu.ac.r,
More informationAPPENDIX III THE ENVELOPE PROPERTY
Apped III APPENDIX III THE ENVELOPE PROPERTY Optmzato mposes a very strog structure o the problem cosdered Ths s the reaso why eoclasscal ecoomcs whch assumes optmzg behavour has bee the most successful
More informationPreprocess a planar map S. Given a query point p, report the face of S containing p. Goal: O(n)size data structure that enables O(log n) query time.
Computatoal Geometry Chapter 6 Pot Locato 1 Problem Defto Preprocess a plaar map S. Gve a query pot p, report the face of S cotag p. S Goal: O()sze data structure that eables O(log ) query tme. C p E
More informationChapter Eight. f : R R
Chapter Eght f : R R 8. Itroducto We shall ow tur our atteto to the very mportat specal case of fuctos that are real, or scalar, valued. These are sometmes called scalar felds. I the very, but mportat,
More informationSpeeding up kmeans Clustering by Bootstrap Averaging
Speedg up meas Clusterg by Bootstrap Averagg Ia Davdso ad Ashw Satyaarayaa Computer Scece Dept, SUNY Albay, NY, USA,. {davdso, ashw}@cs.albay.edu Abstract Kmeas clusterg s oe of the most popular clusterg
More informationANOVA Notes Page 1. Analysis of Variance for a OneWay Classification of Data
ANOVA Notes Page Aalss of Varace for a OeWa Classfcato of Data Cosder a sgle factor or treatmet doe at levels (e, there are,, 3, dfferet varatos o the prescrbed treatmet) Wth a gve treatmet level there
More informationNumerical Methods with MS Excel
TMME, vol4, o.1, p.84 Numercal Methods wth MS Excel M. ElGebely & B. Yushau 1 Departmet of Mathematcal Sceces Kg Fahd Uversty of Petroleum & Merals. Dhahra, Saud Araba. Abstract: I ths ote we show how
More informationInduction Proofs. ) ( for all n greater than or equal to n. is a fixed integer. A proof by Mathematical Induction contains two steps:
CMPS Algorthms ad Abstract Data Types Iducto Proofs Let P ( be a propostoal fucto, e P s a fucto whose doma s (some subset of) the set of tegers ad whose codoma s the set {True, False} Iformally, ths meas
More informationThe analysis of annuities relies on the formula for geometric sums: r k = rn+1 1 r 1. (2.1) k=0
Chapter 2 Autes ad loas A auty s a sequece of paymets wth fxed frequecy. The term auty orgally referred to aual paymets (hece the ame), but t s ow also used for paymets wth ay frequecy. Autes appear may
More informationCyber Journals: Multidisciplinary Journals in Science and Technology, Journal of Selected Areas in Telecommunications (JSAT), January Edition, 2011
Cyber Jourals: Multdscplary Jourals cece ad Techology, Joural of elected Areas Telecommucatos (JAT), Jauary dto, 2011 A ovel rtual etwork Mappg Algorthm for Cost Mmzg ZHAG hul, QIU Xuesog tate Key Laboratory
More informationAverage Price Ratios
Average Prce Ratos Morgstar Methodology Paper August 3, 2005 2005 Morgstar, Ic. All rghts reserved. The formato ths documet s the property of Morgstar, Ic. Reproducto or trascrpto by ay meas, whole or
More informationOptimal multidegree reduction of Bézier curves with constraints of endpoints continuity
Computer Aded Geometrc Desg 19 (2002 365 377 wwwelsevercom/locate/comad Optmal multdegree reducto of Bézer curves wth costrats of edpots cotuty GuoDog Che, GuoJ Wag State Key Laboratory of CAD&CG, Isttute
More informationOnline Appendix: Measured Aggregate Gains from International Trade
Ole Appedx: Measured Aggregate Gas from Iteratoal Trade Arel Burste UCLA ad NBER Javer Cravo Uversty of Mchga March 3, 2014 I ths ole appedx we derve addtoal results dscussed the paper. I the frst secto,
More informationEfficient Traceback of DoS Attacks using Small Worlds in MANET
Effcet Traceback of DoS Attacks usg Small Worlds MANET Yog Km, Vshal Sakhla, Ahmed Helmy Departmet. of Electrcal Egeerg, Uversty of Souther Calfora, U.S.A {yogkm, sakhla, helmy}@ceg.usc.edu Abstract Moble
More informationRecurrence Relations
CMPS Aalyss of Algorthms Summer 5 Recurrece Relatos Whe aalyzg the ru tme of recursve algorthms we are ofte led to cosder fuctos T ( whch are defed by recurrece relatos of a certa form A typcal example
More informationOverview. Eingebettete Systeme. Model of periodic tasks. Model of periodic tasks. Echtzeitverhalten und Betriebssysteme
Overvew Egebettete Systeme able of some kow preemptve schedulg algorthms for perodc tasks: Echtzetverhalte ud Betrebssysteme 5. Perodsche asks statc prorty dyamc prorty Deadle equals perod Deadle smaller
More informationChapter 11 Systematic Sampling
Chapter Sstematc Samplg The sstematc samplg techue s operatoall more coveet tha the smple radom samplg. It also esures at the same tme that each ut has eual probablt of cluso the sample. I ths method of
More informationMaintenance Scheduling of Distribution System with Optimal Economy and Reliability
Egeerg, 203, 5, 48 http://dx.do.org/0.4236/eg.203.59b003 Publshed Ole September 203 (http://www.scrp.org/joural/eg) Mateace Schedulg of Dstrbuto System wth Optmal Ecoomy ad Relablty Syua Hog, Hafeg L,
More informationMeasures of Dispersion, Skew, & Kurtosis (based on Kirk, Ch. 4) {to be used in conjunction with Measures of Dispersion Chart }
Percetles Psych 54, 9/8/05 p. /6 Measures of Dsperso, kew, & Kurtoss (based o Krk, Ch. 4) {to be used cojucto wth Measures of Dsperso Chart } percetle (P % ): a score below whch a specfed percetage of
More informationThe Digital Signature Scheme MQQSIG
The Dgtal Sgature Scheme MQQSIG Itellectual Property Statemet ad Techcal Descrpto Frst publshed: 10 October 2010, Last update: 20 December 2010 Dalo Glgorosk 1 ad Rue Stesmo Ødegård 2 ad Rue Erled Jese
More informationAbraham Zaks. Technion I.I.T. Haifa ISRAEL. and. University of Haifa, Haifa ISRAEL. Abstract
Preset Value of Autes Uder Radom Rates of Iterest By Abraham Zas Techo I.I.T. Hafa ISRAEL ad Uversty of Hafa, Hafa ISRAEL Abstract Some attempts were made to evaluate the future value (FV) of the expected
More informationECONOMIC CHOICE OF OPTIMUM FEEDER CABLE CONSIDERING RISK ANALYSIS. University of Brasilia (UnB) and The Brazilian Regulatory Agency (ANEEL), Brazil
ECONOMIC CHOICE OF OPTIMUM FEEDER CABE CONSIDERING RISK ANAYSIS I Camargo, F Fgueredo, M De Olvera Uversty of Brasla (UB) ad The Brazla Regulatory Agecy (ANEE), Brazl The choce of the approprate cable
More informationSHAPIROWILK TEST FOR NORMALITY WITH KNOWN MEAN
SHAPIROWILK TEST FOR NORMALITY WITH KNOWN MEAN Wojcech Zelńsk Departmet of Ecoometrcs ad Statstcs Warsaw Uversty of Lfe Sceces Nowoursyowska 66, 787 Warszawa emal: wojtekzelsk@statystykafo Zofa Hausz,
More informationModels for Selecting an ERP System with Intuitionistic Trapezoidal Fuzzy Information
JOURNAL OF SOFWARE, VOL 5, NO 3, MARCH 00 75 Models for Selectg a ERP System wth Itutostc rapezodal Fuzzy Iformato Guwu We, Ru L Departmet of Ecoomcs ad Maagemet, Chogqg Uversty of Arts ad Sceces, Yogchua,
More informationChapter 3 31. Chapter Goals. Summary Measures. Chapter Topics. Measures of Center and Location. Notation Conventions
Chapter 3 3 Chapter Goals Chapter 3 umercal Descrptve Measures After completg ths chapter, you should be able to: Compute ad terpret the mea, meda, ad mode for a set of data Fd the rage, varace, ad stadard
More informationA Study of Unrelated ParallelMachine Scheduling with Deteriorating Maintenance Activities to Minimize the Total Completion Time
Joural of Na Ka, Vol. 0, No., pp.59 (20) 5 A Study of Urelated ParallelMache Schedulg wth Deteroratg Mateace Actvtes to Mze the Total Copleto Te SuhJeq Yag, JaYuar Guo, HsTao Lee Departet of Idustral
More informationT = 1/freq, T = 2/freq, T = i/freq, T = n (number of cash flows = freq n) are :
Bullets bods Let s descrbe frst a fxed rate bod wthout amortzg a more geeral way : Let s ote : C the aual fxed rate t s a percetage N the otoal freq ( 2 4 ) the umber of coupo per year R the redempto of
More informationStatistical Pattern Recognition (CE725) Department of Computer Engineering Sharif University of Technology
I The Name of God, The Compassoate, The ercful Name: Problems' eys Studet ID#:. Statstcal Patter Recogto (CE725) Departmet of Computer Egeerg Sharf Uversty of Techology Fal Exam Soluto  Sprg 202 (50
More informationADAPTATION OF SHAPIROWILK TEST TO THE CASE OF KNOWN MEAN
Colloquum Bometrcum 4 ADAPTATION OF SHAPIROWILK TEST TO THE CASE OF KNOWN MEAN Zofa Hausz, Joaa Tarasńska Departmet of Appled Mathematcs ad Computer Scece Uversty of Lfe Sceces Lubl Akademcka 3, 95 Lubl
More informationApplications of Support Vector Machine Based on Boolean Kernel to Spam Filtering
Moder Appled Scece October, 2009 Applcatos of Support Vector Mache Based o Boolea Kerel to Spam Flterg Shugag Lu & Keb Cu School of Computer scece ad techology, North Cha Electrc Power Uversty Hebe 071003,
More informationGreen Master based on MapReduce Cluster
Gree Master based o MapReduce Cluster MgZh Wu, YuChag L, WeTsog Lee, YuSu L, FogHao Lu Dept of Electrcal Egeerg Tamkag Uversty, Tawa, ROC Dept of Electrcal Egeerg Tamkag Uversty, Tawa, ROC Dept of
More informationA New Bayesian Network Method for Computing Bottom Event's Structural Importance Degree using Jointree
, pp.277288 http://dx.do.org/10.14257/juesst.2015.8.1.25 A New Bayesa Network Method for Computg Bottom Evet's Structural Importace Degree usg Jotree Wag Yao ad Su Q School of Aeroautcs, Northwester Polytechcal
More informationFractalStructured Karatsuba`s Algorithm for Binary Field Multiplication: FK
FractalStructured Karatsuba`s Algorthm for Bary Feld Multplcato: FK *The authors are worg at the Isttute of Mathematcs The Academy of Sceces of DPR Korea. **Address : U Jog dstrct Kwahadog Number Pyogyag
More informationCH. V ME256 STATICS Center of Gravity, Centroid, and Moment of Inertia CENTER OF GRAVITY AND CENTROID
CH. ME56 STTICS Ceter of Gravt, Cetrod, ad Momet of Ierta CENTE OF GITY ND CENTOID 5. CENTE OF GITY ND CENTE OF MSS FO SYSTEM OF PTICES Ceter of Gravt. The ceter of gravt G s a pot whch locates the resultat
More informationDECISION MAKING WITH THE OWA OPERATOR IN SPORT MANAGEMENT
ESTYLF08, Cuecas Meras (Meres  Lagreo), 79 de Septembre de 2008 DECISION MAKING WITH THE OWA OPERATOR IN SPORT MANAGEMENT José M. Mergó Aa M. GlLafuete Departmet of Busess Admstrato, Uversty of Barceloa
More informationRQM: A new ratebased active queue management algorithm
: A ew ratebased actve queue maagemet algorthm Jeff Edmods, Suprakash Datta, Patrck Dymod, Kashf Al Computer Scece ad Egeerg Departmet, York Uversty, Toroto, Caada Abstract I ths paper, we propose a ew
More information1. The Time Value of Money
Corporate Face [000345]. The Tme Value of Moey. Compoudg ad Dscoutg Captalzato (compoudg, fdg future values) s a process of movg a value forward tme. It yelds the future value gve the relevat compoudg
More informationCHAPTER 2. Time Value of Money 61
CHAPTER 2 Tme Value of Moey 6 Tme Value of Moey (TVM) Tme Les Future value & Preset value Rates of retur Autes & Perpetutes Ueve cash Flow Streams Amortzato 62 Tme les 0 2 3 % CF 0 CF CF 2 CF 3 Show
More information10.5 Future Value and Present Value of a General Annuity Due
Chapter 10 Autes 371 5. Thomas leases a car worth $4,000 at.99% compouded mothly. He agrees to make 36 lease paymets of $330 each at the begg of every moth. What s the buyout prce (resdual value of the
More informationLocally Adaptive Dimensionality Reduction for Indexing Large Time Series Databases
Locally Adaptve Dmesoalty educto for Idexg Large Tme Seres Databases Kaushk Chakrabart Eamo Keogh Sharad Mehrotra Mchael Pazza Mcrosoft esearch Uv. of Calfora Uv. of Calfora Uv. of Calfora edmod, WA 985
More informationSTATISTICAL PROPERTIES OF LEAST SQUARES ESTIMATORS. x, where. = y  ˆ " 1
STATISTICAL PROPERTIES OF LEAST SQUARES ESTIMATORS Recall Assumpto E(Y x) η 0 + η x (lear codtoal mea fucto) Data (x, y ), (x 2, y 2 ),, (x, y ) Least squares estmator ˆ E (Y x) ˆ " 0 + ˆ " x, where ˆ
More informationBAYEH's theoretical periodic table of elements
CLAUDE ZIAD BAYEH Idepedet Researcher LEBANON Emal: claude_bayeh_cbegrd@hotmal.com Abstract: The s a orgal study troduced by the author Chemstry 00. I the past, may scetsts ad researchers have developed
More informationDynamic Twophase Truncated Rayleigh Model for Release Date Prediction of Software
J. Software Egeerg & Applcatos 3 6369 do:.436/jsea..367 Publshed Ole Jue (http://www.scrp.org/joural/jsea) Dyamc Twophase Trucated Raylegh Model for Release Date Predcto of Software Lafe Qa Qgchua Yao
More informationAn Effectiveness of Integrated Portfolio in Bancassurance
A Effectveess of Itegrated Portfolo Bacassurace Taea Karya Research Ceter for Facal Egeerg Isttute of Ecoomc Research Kyoto versty Sayouu Kyoto 606850 Japa arya@eryotouacp Itroducto As s well ow the
More informationThe GompertzMakeham distribution. Fredrik Norström. Supervisor: Yuri Belyaev
The GompertzMakeham dstrbuto by Fredrk Norström Master s thess Mathematcal Statstcs, Umeå Uversty, 997 Supervsor: Yur Belyaev Abstract Ths work s about the GompertzMakeham dstrbuto. The dstrbuto has
More informationRUSSIAN ROULETTE AND PARTICLE SPLITTING
RUSSAN ROULETTE AND PARTCLE SPLTTNG M. Ragheb 3/7/203 NTRODUCTON To stuatos are ecoutered partcle trasport smulatos:. a multplyg medum, a partcle such as a eutro a cosmc ray partcle or a photo may geerate
More informationLATERAL TRANSHIPMENTA TECHNIQUE FOR INVENTORY CONTROL IN MULTI RETAILER SUPPLY CHAIN SYSTEM
Iteratoal Joural of Iformato Techology ad Kowledge Maagemet JulyDecember 200, Volume 2, No. 2, pp. 335 LATERAL TRANSHIPMENTA TECHNIQUE FOR INVENTORY CONTROL IN MULTI RETAILER SUPPLY CHAIN SYSTEM Dharamvr
More informationAn Approach to Evaluating the Computer Network Security with Hesitant Fuzzy Information
A Approach to Evaluatg the Computer Network Securty wth Hestat Fuzzy Iformato Jafeg Dog A Approach to Evaluatg the Computer Network Securty wth Hestat Fuzzy Iformato Jafeg Dog, Frst ad Correspodg Author
More informationOn Error Detection with Block Codes
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 9, No 3 Sofa 2009 O Error Detecto wth Block Codes Rostza Doduekova Chalmers Uversty of Techology ad the Uversty of Gotheburg,
More informationBanking (Early Repayment of Housing Loans) Order, 5762 2002 1
akg (Early Repaymet of Housg Loas) Order, 5762 2002 y vrtue of the power vested me uder Secto 3 of the akg Ordace 94 (hereafter, the Ordace ), followg cosultato wth the Commttee, ad wth the approval of
More informationFast, Secure Encryption for Indexing in a ColumnOriented DBMS
Fast, Secure Ecrypto for Idexg a ColumOreted DBMS Tgja Ge, Sta Zdok Brow Uversty {tge, sbz}@cs.brow.edu Abstract Networked formato systems requre strog securty guaratees because of the ew threats that
More informationMobile Agents in Telecommunications Networks A Simulative Approach to Load Balancing
Moble Agets Telecommucatos Networks A Smulatve Approach to Load Balacg Steffe Lpperts Departmet of Computer Scece (4), Uversty of Techology Aache Aache, 52056, Germay Ad Brgt Kreller Corporate Techology
More informationChapter 3. AMORTIZATION OF LOAN. SINKING FUNDS R =
Chapter 3. AMORTIZATION OF LOAN. SINKING FUNDS Objectves of the Topc: Beg able to formalse ad solve practcal ad mathematcal problems, whch the subjects of loa amortsato ad maagemet of cumulatve fuds are
More informationIntegrating Production Scheduling and Maintenance: Practical Implications
Proceedgs of the 2012 Iteratoal Coferece o Idustral Egeerg ad Operatos Maagemet Istabul, Turkey, uly 3 6, 2012 Itegratg Producto Schedulg ad Mateace: Practcal Implcatos Lath A. Hadd ad Umar M. AlTurk
More informationA DISTRIBUTED REPUTATION BROKER FRAMEWORK FOR WEB SERVICE APPLICATIONS
L et al.: A Dstrbuted Reputato Broker Framework for Web Servce Applcatos A DISTRIBUTED REPUTATION BROKER FRAMEWORK FOR WEB SERVICE APPLICATIONS KweJay L Departmet of Electrcal Egeerg ad Computer Scece
More informationCapacitated Production Planning and Inventory Control when Demand is Unpredictable for Most Items: The No B/C Strategy
SCHOOL OF OPERATIONS RESEARCH AND INDUSTRIAL ENGINEERING COLLEGE OF ENGINEERING CORNELL UNIVERSITY ITHACA, NY 4853380 TECHNICAL REPORT Jue 200 Capactated Producto Plag ad Ivetory Cotrol whe Demad s Upredctable
More informationPerformance Attribution. Methodology Overview
erformace Attrbuto Methodology Overvew Faba SUAREZ March 2004 erformace Attrbuto Methodology 1.1 Itroducto erformace Attrbuto s a set of techques that performace aalysts use to expla why a portfolo's performace
More informationA particle swarm optimization to vehicle routing problem with fuzzy demands
A partcle swarm optmzato to vehcle routg problem wth fuzzy demads Yag Peg, Yeme Qa A partcle swarm optmzato to vehcle routg problem wth fuzzy demads Yag Peg 1,Yeme Qa 1 School of computer ad formato
More informationResearch on Cloud Computing and Its Application in Big Data Processing of Railway Passenger Flow
325 A publcato of CHEMICAL ENGINEERING TRANSACTIONS VOL. 46, 2015 Guest Edtors: Peyu Re, Yacag L, Hupg Sog Copyrght 2015, AIDIC Servz S.r.l., ISBN 9788895608372; ISSN 22839216 The Itala Assocato of
More informationRobust Realtime Face Recognition And Tracking System
JCS& Vol. 9 No. October 9 Robust Realtme Face Recogto Ad rackg System Ka Che,Le Ju Zhao East Cha Uversty of Scece ad echology Emal:asa85@hotmal.com Abstract here s some very mportat meag the study of realtme
More informationMEASURES OF CENTRAL TENDENCY
MODULE  6 Statstcs Measures of Cetral Tedecy 25 MEASURES OF CENTRAL TENDENCY I the prevous lesso, we have leart that the data could be summarsed to some extet by presetg t the form of a frequecy table.
More informationof the relationship between time and the value of money.
TIME AND THE VALUE OF MONEY Most agrbusess maagers are famlar wth the terms compoudg, dscoutg, auty, ad captalzato. That s, most agrbusess maagers have a tutve uderstadg that each term mples some relatoshp
More informationConstrained Cubic Spline Interpolation for Chemical Engineering Applications
Costraed Cubc Sple Iterpolato or Chemcal Egeerg Applcatos b CJC Kruger Summar Cubc sple terpolato s a useul techque to terpolate betwee kow data pots due to ts stable ad smooth characterstcs. Uortuatel
More informationOptimal replacement and overhaul decisions with imperfect maintenance and warranty contracts
Optmal replacemet ad overhaul decsos wth mperfect mateace ad warraty cotracts R. Pascual Departmet of Mechacal Egeerg, Uversdad de Chle, Caslla 2777, Satago, Chle Phoe: +5626784591 Fax:+562689657 rpascual@g.uchle.cl
More informationProjection model for Computer Network Security Evaluation with intervalvalued intuitionistic fuzzy information. Qingxiang Li
Iteratoal Joural of Scece Vol No7 05 ISSN: 834890 Proecto model for Computer Network Securty Evaluato wth tervalvalued tutostc fuzzy formato Qgxag L School of Software Egeerg Chogqg Uversty of rts ad
More informationOptimization Model in Human Resource Management for Job Allocation in ICT Project
Optmzato Model Huma Resource Maagemet for Job Allocato ICT Project Optmzato Model Huma Resource Maagemet for Job Allocato ICT Project Saghamtra Mohaty Malaya Kumar Nayak 2 2 Professor ad Head Research
More informationFinito: A Faster, Permutable Incremental Gradient Method for Big Data Problems
Fto: A Faster, Permutable Icremetal Gradet Method for Bg Data Problems Aaro J Defazo Tbéro S Caetao Just Domke NICTA ad Australa Natoal Uversty AARONDEFAZIO@ANUEDUAU TIBERIOCAETANO@NICTACOMAU JUSTINDOMKE@NICTACOMAU
More informationSecurity Analysis of RAPP: An RFID Authentication Protocol based on Permutation
Securty Aalyss of RAPP: A RFID Authetcato Protocol based o Permutato Wag Shaohu,,, Ha Zhje,, Lu Sujua,, Che Dawe, {College of Computer, Najg Uversty of Posts ad Telecommucatos, Najg 004, Cha Jagsu Hgh
More informationA Parallel Transmission Remote Backup System
2012 2d Iteratoal Coferece o Idustral Techology ad Maagemet (ICITM 2012) IPCSIT vol 49 (2012) (2012) IACSIT Press, Sgapore DOI: 107763/IPCSIT2012V495 2 A Parallel Trasmsso Remote Backup System Che Yu College
More informationA Single Machine Scheduling with Periodic Maintenance
A Sgle Mache Schedulg wth Perodc Mateace Fracsco ÁgelBello Ada Álvarez 2 Joaquí Pacheco 3 Irs Martíez Ceter for Qualty ad Maufacturg, Tecológco de Moterrey, Eugeo Garza Sada 250, 64849 Moterrey, NL, Meco
More informationWe present a new approach to pricing Americanstyle derivatives that is applicable to any Markovian setting
MANAGEMENT SCIENCE Vol. 52, No., Jauary 26, pp. 95 ss 2599 ess 52655 6 52 95 forms do.287/msc.5.447 26 INFORMS Prcg AmercaStyle Dervatves wth Europea Call Optos Scott B. Laprse BAE Systems, Advaced
More informationNetwork dimensioning for elastic traffic based on flowlevel QoS
Network dmesog for elastc traffc based o flowlevel QoS 1(10) Network dmesog for elastc traffc based o flowlevel QoS Pas Lassla ad Jorma Vrtamo Networkg Laboratory Helsk Uversty of Techology Itroducto
More informationVIDEO REPLICA PLACEMENT STRATEGY FOR STORAGE CLOUDBASED CDN
Joural of Theoretcal ad Appled Iformato Techology 31 st Jauary 214. Vol. 59 No.3 25214 JATIT & S. All rghts reserved. ISSN: 19928645 www.att.org EISSN: 18173195 VIDEO REPICA PACEMENT STRATEGY FOR STORAGE
More information= 1 lim sup{ sn : n > N} )
ATH 104, SUER 2006, HOEWORK 4 SOLUTION BENJAIN JOHNSON Due July 12 Assgmet: Secto 11: 11.4(b)(c), 11.8 Secto 12: 12.6(c), 12.12, 12.13 Secto 13: 13.1 Secto 11 11.4 Cosder the sequeces s = cos ( ) π 3,
More informationA Smart Machine Vision System for PCB Inspection
A Smart Mache Vso System for PCB Ispecto Te Q Che, JaX Zhag, YouNg Zhou ad Y Lu Murphey Please address all correspodece to Departmet of Electrcal ad Computer Egeerg Uversty of Mchga  Dearbor, Dearbor,
More informationAN ALGORITHM ABOUT PARTNER SELECTION PROBLEM ON CLOUD SERVICE PROVIDER BASED ON GENETIC
Joural of Theoretcal ad Appled Iformato Techology 0 th Aprl 204. Vol. 62 No. 2005204 JATIT & LLS. All rghts reserved. ISSN: 9928645 www.jatt.org EISSN: 87395 AN ALGORITHM ABOUT PARTNER SELECTION PROBLEM
More informationMaximization of Data Gathering in Clustered Wireless Sensor Networks
Maxmzato of Data Gatherg Clustere Wreless Sesor Networks Taq Wag Stuet Member I We Hezelma Seor Member I a Alreza Seye Member I Abstract I ths paper we vestgate the maxmzato of the amout of gathere ata
More informationImpact of Interference on the GPRS Multislot Link Level Performance
Impact of Iterferece o the GPRS Multslot Lk Level Performace Javer Gozalvez ad Joh Dulop Uversty of Strathclyde  Departmet of Electroc ad Electrcal Egeerg  George St  Glasgow GXW Scotlad Ph.: + 8
More informationWeb Service Composition Optimization Based on Improved Artificial Bee Colony Algorithm
JOURNAL OF NETWORKS, VOL. 8, NO. 9, SEPTEMBER 2013 2143 Web Servce Composto Optmzato Based o Improved Artfcal Bee Coloy Algorthm Ju He The key laboratory, The Academy of Equpmet, Beg, Cha Emal: heu0123@sa.com
More informationA COMPARATIVE STUDY BETWEEN POLYCLASS AND MULTICLASS LANGUAGE MODELS
A COMPARATIVE STUDY BETWEEN POLYCLASS AND MULTICLASS LANGUAGE MODELS I Ztou, K Smaïl, S Delge, F Bmbot To cte ths verso: I Ztou, K Smaïl, S Delge, F Bmbot. A COMPARATIVE STUDY BETWEEN POLY CLASS AND MULTICLASS
More informationUsing Phase Swapping to Solve Load Phase Balancing by ADSCHNN in LV Distribution Network
Iteratoal Joural of Cotrol ad Automato Vol.7, No.7 (204), pp.4 http://dx.do.org/0.4257/jca.204.7.7.0 Usg Phase Swappg to Solve Load Phase Balacg by ADSCHNN LV Dstrbuto Network Chuguo Fe ad Ru Wag College
More informationImpact of Mobility Prediction on the Temporal Stability of MANET Clustering Algorithms *
Impact of Moblty Predcto o the Temporal Stablty of MANET Clusterg Algorthms * Aravdha Vekateswara, Vekatesh Saraga, Nataraa Gautam 1, Ra Acharya Departmet of Comp. Sc. & Egr. Pesylvaa State Uversty Uversty
More informationStatistical Intrusion Detector with InstanceBased Learning
Iformatca 5 (00) xxx yyy Statstcal Itruso Detector wth IstaceBased Learg Iva Verdo, Boja Nova Faulteta za eletroteho raualštvo Uverza v Marboru Smetaova 7, 000 Marbor, Sloveja va.verdo@sol.et eywords:
More informationSettlement Prediction by Spatialtemporal Random Process
Safety, Relablty ad Rs of Structures, Ifrastructures ad Egeerg Systems Furuta, Fragopol & Shozua (eds Taylor & Fracs Group, Lodo, ISBN 97877 Settlemet Predcto by Spataltemporal Radom Process P. Rugbaapha
More informationProceedings of the 2010 Winter Simulation Conference B. Johansson, S. Jain, J. MontoyaTorres, J. Hugan, and E. Yücesan, eds.
Proceedgs of the 21 Wter Smulato Coferece B. Johasso, S. Ja, J. MotoyaTorres, J. Huga, ad E. Yücesa, eds. EMPIRICAL METHODS OR TWOECHELON INVENTORY MANAGEMENT WITH SERVICE LEVEL CONSTRAINTS BASED ON
More informationAnySee: PeertoPeer Live Streaming
ysee: PeertoPeer Lve Streamg School of Computer Scece ad Techology Huazhog Uversty of Scece ad Techology Wuha, 40074, Cha {xflao, hj, dfdeg }@hust.edu.c Xaofe Lao, Ha J, *Yuhao Lu, *Loel M. N, ad afu
More informationRESEARCH ON PERFORMANCE MODELING OF TRANSACTIONAL CLOUD APPLICATIONS
Joural of Theoretcal ad Appled Iformato Techology 3 st October 22. Vol. 44 No.2 2522 JATIT & LLS. All rghts reserved. ISSN: 9928645 www.jatt.org EISSN: 87395 RESEARCH ON PERFORMANCE MODELING OF TRANSACTIONAL
More informationA Novel Resource Pricing Mechanism based on MultiPlayer Gaming Model in Cloud Environments
1574 JOURNAL OF SOFTWARE, VOL. 9, NO. 6, JUNE 2014 A Novel Resource Prcg Mechasm based o MultPlayer Gamg Model Cloud Evromets Tea Zhag, Peg Xao School of Computer ad Commucato, Hua Isttute of Egeerg,
More informationThe impact of serviceoriented architecture on the scheduling algorithm in cloud computing
Iteratoal Research Joural of Appled ad Basc Sceces 2015 Avalable ole at www.rjabs.com ISSN 2251838X / Vol, 9 (3): 387392 Scece Explorer Publcatos The mpact of servceoreted archtecture o the schedulg
More informationThe Consumer Price Index for All Urban Consumers (Inflation Rate)
The Cosumer Prce Idex for All Urba Cosumers (Iflato Rate) Itroducto: The Cosumer Prce Idex (CPI) s the crtero of the average prce chage of goods ad servces cosumed by Iraa households. Ths crtero, as a
More informationNear Neighbor Distribution in Sets of Fractal Nature
Iteratoal Joural of Computer Iformato Systems ad Idustral Maagemet Applcatos. ISS 2507988 Volume 5 (202) 3 pp. 5966 MIR Labs, www.mrlabs.et/jcsm/dex.html ear eghbor Dstrbuto Sets of Fractal ature Marcel
More informationThe Time Value of Money
The Tme Value of Moey 1 Iversemet Optos Year: 1624 Property Traded: Mahatta Islad Prce : $24.00, FV of $24 @ 6%: FV = $24 (1+0.06) 388 = $158.08 bllo Opto 1 0 1 2 3 4 5 t ($519.37) 0 0 0 0 $1,000 Opto
More informationWe investigate a simple adaptive approach to optimizing seat protection levels in airline
Reveue Maagemet Wthout Forecastg or Optmzato: A Adaptve Algorthm for Determg Arle Seat Protecto Levels Garrett va Ryz Jeff McGll Graduate School of Busess, Columba Uversty, New York, New York 10027 School
More informationSimple Linear Regression
Smple Lear Regresso Regresso equato a equato that descrbes the average relatoshp betwee a respose (depedet) ad a eplaator (depedet) varable. 6 8 Slopetercept equato for a le m b (,6) slope. (,) 6 6 8
More informationEfficient Compensation for Regulatory Takings. and Oregon s Measure 37
Effcet Compesato for Regulatory Takgs ad Orego s Measure 37 Jack Scheffer Ph.D. Studet Dept. of Agrcultural, Evrometal ad Developmet Ecoomcs The Oho State Uversty 2120 Fyffe Road Columbus, OH 432101067
More informationSTOCHASTIC approximation algorithms have several
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL 60, NO 10, OCTOBER 2014 6609 Trackg a MarkovModulated Statoary Degree Dstrbuto of a Dyamc Radom Graph Mazyar Hamd, Vkram Krshamurthy, Fellow, IEEE, ad George
More informationn. We know that the sum of squares of p independent standard normal variables has a chi square distribution with p degrees of freedom.
UMEÅ UNIVERSITET Matematskstatstska sttutoe Multvarat dataaalys för tekologer MSTB0 PA TENTAMEN 00409 LÖSNINGSFÖRSLAG TILL TENTAMEN I MATEMATISK STATISTIK Multvarat dataaalys för tekologer B, 5 poäg.
More informationwhere p is the centroid of the neighbors of p. Consider the eigenvector problem
Vrtual avgato of teror structures by ldar Yogja X a, Xaolg L a, Ye Dua a, Norbert Maerz b a Uversty of Mssour at Columba b Mssour Uversty of Scece ad Techology ABSTRACT I ths project, we propose to develop
More information22. The accompanying data describe flexural strength (Mpa) for concrete beams of a certain type was introduced in Example 1.2.
. The accompayg data descrbe flexural stregth (Mpa) for cocrete beams of a certa type was troduced Example.. 9. 9.7 8.8 0.7 8.4 8.7 0.7 6.9 8. 8.3 7.3 9. 7.8 8.0 8.6 7.8 7.5 8.0 7.3 8.9 0.0 8.8 8.7.6.3.8.7
More information