A FRAMEWORK FOR PROCESSING K-BEST SITE QUERY
|
|
- Myles Wilcox
- 6 years ago
- Views:
Transcription
1 Internatinal Jurnal f Database Management Systems ( IJDMS ) Vl., N., Octber 0 A FRAMEWORK FOR PROCESSING K-BEST SITE QUERY Yuan-K Huang * and Lien-Fa Lin Department f Infrmatin Cmmunicatin Ka-Yuan University; Kahsiung Cuntry, Taiwan R.O.C. ABSTRACT A nvel query in spatial databases is the K-Best Site Query (KBSQ fr shrt). Given a set f bjects O, a set f sites S, and a user-given value K, a KBSQ retrieves the K sites frm S such that the ttal distance frm each bject t its clsest site is minimized. The KBSQ is indeed an imprtant type f spatial queries with many real applicatins. In this paper, we investigate hw t efficiently prcess the KBSQ. We first prpse a straightfrward apprach with a cst analysis, and then develp the K Best Site Query (KBSQ) algrithm cmbined with the existing spatial indexes t imprve the perfrmance f prcessing KBSQ. Cmprehensive experiments are cnducted t demnstrate the efficiency f the prpsed methds. KEYWORDS spatial databases; K-Best Site Query; spatial indexes. INTRODUCTION With the fast advances f psitining techniques in mbile systems, spatial databases that aim at efficiently managing spatial bjects are becming mre pwerful and hence attract mre attentin than ever. Many applicatins, such as mbile cmmunicatin systems, traffic cntrl systems, and gegraphical infrmatin systems, can benefit frm efficient prcessing f spatial queries [- 7]. In this paper, we present a nvel and imprtant type f spatial query, namely the K-Best Site Query (KBSQ fr shrt). Given a set f bjects O, a set f sites S, and a user-given value K, a KBSQ retrieves the K sites s, s,, s K frm S such that d ( i, s j ) is minimized, where d( i, s j ) refers t the distance between bject i and its clsest site s j. We term the sites retrieved by executing the KBSQ the best sites (r bs fr shrt). The KBSQ prblem arises in many fields and applicatin dmains. As an example f real-wrld scenari, cnsider a set O f sldiers n the battlefields that is fighting the enemy. In rder t immediately supprt the injured sldiers, we need t chse K sites frm a set S f sites t build the emergicenters. Nte that there are many sldiers fighting n the battlefields and many sites culd be the emergicenters. T achieve the fastest respnse time, the sum f distances frm each battlefield t its clsest emergicenter shuld be minimized. Anther real-wrld example is that the McDnald's Crpratin may ask what are the ptimal lcatins in a city t pen new McDnald's stres. In this case, the KBSQ can be used t find ut the K best sites amng a set S f sites s that every custmer in set O can rapidly reach his/her clsest stre. DOI : 0./ijdms i O
2 Internatinal Jurnal f Database Management Systems ( IJDMS ) Vl., N., Octber 0 Let us use an example in Figure t illustrate the KBSQ prblem, where six bjects,,, and fur sites s, s,, s are depicted as circles and rectangles, respectively. Assume that tw best sites (i.e., bs) are t be fund in this example. There are six cmbinatins (s, s ), (s, s ),, (s, s ), and ne cmbinatin wuld be the result f KBSQ. As we can see, the sum f distances frm bjects,, t their clsest site s is equal t 9, and the sum f distances between bjects,, and site s is equal t. Because the cmbinatin (s, s ) leads t the minimum ttal distance (i.e., 9 + = ), the tw sites s and s are the bs. s s s s Figure. An example f the KBSQ T prcess the KBSQ, the clsest site fr each bject needs t be first determined and then the distance between bject and its clsest site is cmputed s as t find the best cmbinatin f K sites. When a database is large, it is crucial t avid reading the entire dataset in identifying the K best sites. Fr saving CPU and I/O csts, we develp an efficient methd cmbined with the existing spatial indexes t avid unnecessary reading f the entire dataset. A preliminary versin f this paper is [8], and the cntributins f this paper are summarized as fllws. We present a nvel query, namely the K Best Site Query, which is indeed an imprtant type f spatial queries with many real applicatins. We prpse a straightfrward apprach t prcess the KBSQ and als analyze the prcessing cst required fr this apprach. An efficient algrithm, namely the K Best Site Query (KBSQ) algrithm, perates by the supprt f R*-tree [9] and Vrni diagram [0] t imprve the perfrmance f KBSQ. A cmprehensive set f experiments is cnducted. The perfrmance results manifest the efficiency f ur prpsed appraches. The rest f this paper is rganized as fllws. In Sectin, we discuss sme related wrks n prcessing spatial queries similar t the KBSQ, and pint ut their differences. In Sectin, the straightfrward apprach and its cst analysis is presented. Sectin describes the KBSQ algrithm with the used indexes. Sectin shws extensive experiments n the perfrmance f ur appraches. Finally, Sectin 6 cncludes the paper with directins n future wrk. 8
3 Internatinal Jurnal f Database Management Systems ( IJDMS ) Vl., N., Octber 0. RELATED WORK In recent years, sme queries similar t the KBSQ are presented, including the Reverse Nearest Neighbr Query (RNNQ) [], the Grup Nearest Neighbr Query (GNNQ) [], and the Min- Dist Optimal-Lcatin Query (MDOLQ) []. Several methds have been designed t efficiently prcess these similar queries. Hwever, the query results btained by executing these queries are quite different frm that f the KBSQ. Als, the prpsed methds cannt be directly used t answer the KBSQ. In the fllwing, we investigate why the existing methds fr prcessing the similar queries cannt be applied t the KBSQ separately... Methds Fr RNNQ Given a set f bject O and a site s, a RNNQ can be used t retrieve a set S f bjects cntained in O whse clsest site is s. Each bject in S is termed a RNN f s. An intuitive way fr finding the query result f KBSQ is t utilize the RNNQ t find the RNNs fr each site. Then, the K sites having the maximum number f RNNs (meaning that they are clser t mst f the bjects) are chsen t be the K best sites. Taking Figure as an example, the RNNs f site s can be determined by executing the RNNQ and its RNNs are bjects and. Similarly, the RNNs f sites s, s, and s are determined as and,, and, respectively. As sites s and s have the maximum number f RNNs, they can be the bs fr the KBSQ. Hwever, sites s and s lead t the ttal distance (i.e., d(, s ) + d(, s ) + d(, s ) + d(, s ) + d(, s ) + d(, s )), which is greater than the ttal distance as sites s and s are chsen t be the bs. As a result, the intuitin f using the RNNQ result t be the KBSQ result is infeasible. s s 8 s s and 6 are s s RNN and are s s RNN is s s RNN is s s RNN.. Methds Fr GNNQ Figure. An example f the RNNQ A GNNQ retrieves a site s frm a set f sites S such that the ttal distance frm s t all bjects is the minimum amng all sites in S. Here, the result s f GNNQ is called a GNN. T find the K best sites, we can repeatedly evaluate the GNNQ K times s as t retrieve the first K GNNs. It means that the sum f distances between these K GNNs and all bjects is minimum, and thus they can be the K bs. Hwever, in sme cases the result btained by executing the GNNQ K times is still different frm the exact result f KBSQ. Let us cnsider an example shwn in Figure, where bs are required. As shwn in Figure (a), the first and secnd GNNs are sites s and s, respectively. As such, the bs are s and s, and the 9
4 Internatinal Jurnal f Database Management Systems ( IJDMS ) Vl., N., Octber 0 ttal distance d(, s ) + d(, s ) + d(, s ) + d(, s ) + d(, s ) + d(, s ) =. Hwever, anther cmbinatin (s, s ) shwn in Figure (b) can further reduce the ttal distance t. Therefre, using the way f executing GNNQ K times t find the K best sites culd return incrrect result. 6 s s s s The first The secnd The third GNN is s GNN is s GNN is s The last GNN is s (a) incrrect result s s s s.. Methds Fr MDOLQ (b) crrect result Figure. An example f the GNNQ Given a set f bjects O and a set f sites S, a MDOLQ returns a lcatin which, if a new site s nt in S is built there, minimizes d ( i, s j ) where d( i, s j ) is the distance between bject i and i O its clsest site SU{s}. At first glance, the MDOLQ is mre similar t the KBSQ than the s j ther queries mentined abve. Hwever, using the MDOLQ t btain the K best sites may still lead t incrrect result. Cnsider an example f using MDOLQ t find the K best sites in Figure. As bs are t be fund, we can evaluate the MDOLQ tw times t btain the result. In the first iteratin (as shwn in Figure (a)), the site s becmes the first bs because it has the minimum ttal distance t all bjects. Then, the MDOLQ is executed again by taking int accunt the remaining sites s, s, and s. As the site s can reduce mre distance cmpared t the ther tw sites, it becmes the secnd bs (shwn in Figure (b)). Finally, bs are s and s and the ttal distance is cmputed as d(, s ) + d(, s ) + d(, s ) + d(, s ) + d(, s ) + d(, s ) = 0. Hwever, the cmputed distance is nt 0
5 Internatinal Jurnal f Database Management Systems ( IJDMS ) Vl., N., Octber 0 minimum and can be further reduced. As we can see in Figure (c), if s and s are chsen t be the bs, the ttal distance can decrease t 6. s 6 s s s s s s s (a) Step (b) Step s s s s. STRAIGHTFORWARD APPROACH (c) crrect result Figure. An example f the MDOLQ In this sectin, we first prpse a straightfrward apprach t slve the KBSQ prblem, and then analyze the prcessing cst required fr this apprach. Assume that there are n bjects and m sites, and the K bs wuld be chsen frm the m sites. The straightfrward apprach cnsists f three steps. The first step is t cmpute the distance d( i, s j ) frm each bject i ( i n) t each site s j ( j m). As the K best sites are needed t be retrieved, there are ttally C m K pssible cmbinatins and each f the cmbinatins cmprises K sites. The secnd step is t cnsider all f the cmbinatins. Fr each cmbinatin, the distance frm each bject t its clsest site is determined s as t cmpute the ttal distance. In the last step, the cmbinatin f K sites having the minimum ttal distance is chsen t be the query result f KBSQ. Figure illustrates the three steps f the straightfrward apprach. As shwn in Figure (a), the distances between bjects and sites are cmputed and stred in a table, in which a tuple represents the distance frm an bject t all sites. Then, the C m K cmbinatins f K sites are cnsidered s that C m K tables are generated (shwn in Figure (b)). Fr each table, the minimum attribute value f each tuple (depicted as gray bx) refers t the distance between an bject and its clsest site. As such, the ttal distance fr each cmbinatin can be cmputed by summing up the minimum attribute value f each tuple. Finally, in Figure (c) the cmbinatin f K sites can be the K bs because its ttal distance is minimum amng all cmbinatins.
6 Internatinal Jurnal f Database Management Systems ( IJDMS ) Vl., N., Octber 0 n m n 6 6 m n K K n cmbinatin n K K+ 6 n 8 cmbinatin n K m 6 6 n (a) Step (b) Step cmbinatin C m K n K K n cmbinatin (c) Step Figure. Straightfrward apprach Since the straightfrward apprach includes three steps, we cnsider the three steps individually t analyze the prcessing cst. Let m and n be the numbers f sites and bjects, respectively. Then, the time cmplexity f the first step is m*n because the distances between all bjects and sites have t be cmputed. In the secnd step, C m K cmbinatins are cnsidered and thus the cmplexity is C m K *n*k. Finally, the cmbinatin having the minimum ttal distance is determined amng all cmbinatins s that the cmplexity f the last step is C m K. The prcessing m m cst f the straightfrward apprach is represented as m * n + C k * n * K + C k.. KBSQ ALGORITHM The abve apprach is perfrmed withut any index supprt, which is a majr weakness in dealing with large datasets. In this sectin, we prpse the KBSQ algrithm cmbined with the existing indexes R*-tree and Vrni diagram t efficiently prcess the KBSQ. Recall that, t prcess the KBSQ, we need t find the clsest site s fr each bject (that is, finding the RNN f site s). As the Vrni diagram can be used t effectively determine the RNN f each site [], we divide the data space s that each site has its wn Vrni cell. Fr example, in Figure 6(b), the fur sites s, s, s, and s have their crrespnding Vrni cells V,
7 Internatinal Jurnal f Database Management Systems ( IJDMS ) Vl., N., Octber 0 V, V, and V, respectively. Taking the cell V as an example, if bject lies in V, then must be the RNN f site s. Based n this characteristic, bject needs nt be cnsidered in finding the RNNs fr the ther sites. Then, we use the R*-tree, which is a height-balanced indexing structure, t index the bjects. In a R*-tree, bjects are recursively gruped in a bttm-up manner accrding t their lcatins. Fr instance, in Figure 6(a), eight bjects,,, 8 are gruped int fur leaf ndes E t E 7 (i.e., the minimum bunding rectangle MBR enclsing the bjects). Then, ndes E t E 7 are recursively gruped int ndes E and E, that becme the entries f the rt nde E. E 7 8 s V V E E 7 E E s s V s E E 6 V (a) R-tree (b) Vrni diagram Figure 6. Spatial indexes Cmbined with the R*-tree and Vrni diagram, we design the fllwing pruning criteria t greatly reduce the number f bjects cnsidered in query prcessing. Pruning bjects: given an bject and the K sites s, s,, s K, if lies in the Vrni cell V i f ne site s i cntained in {s, s,, s K }, then the distances between bject and the ther K- sites need nt be cmputed s as t reduce the prcessing cst. Pruning MBRs: given a MBR E enclsing a number f bjects and the K sites s, s,, s K, if E is fully cntained in the cell V i f ne site s i cntained in {s, s,, s K }, then the distances frm all bjects enclsed in E t the ther K- sites wuld nt be cmputed. T find the K bs fr the KBSQ, we need t cnsider C m K cmbinatins f K sites. Fr each cmbinatin f K sites s, s,, s K with their crrespnding Vrni cells V, V,, V K, the prcessing prcedure begins with the R*-tree rt nde and prceeds dwn the tree. When an internal nde E (i.e., MBR E) f the R*-tree is visited, the pruning criterin is utilized t determine which site is the clsest site f the bjects enclsed in E. If the MBR E is nt fully cntained in any f the K Vrni cells, then the child ndes f E need t be further visited. When a leaf nde f the R*-tree is checked, the pruning criterin is impsed n the entries (i.e., bjects) f this leaf nde. After the traversal f the R*-tree, the ttal distance fr the cmbinatin f K sites s, s,, s K can be cmputed. By taking int accunt the ttal cmbinatins, the cmbinatin f K sites whse ttal distance is minimum wuld be the query result f the KBSQ. Figure 7 cntinues the previus example in Figure 6 t illustrate the prcessing prcedure, where there are eight bjects t 8 and fur sites s t s in data space. Assume that the cmbinatin (s, s ) is cnsidered and the Vrni cells f sites s and s are shwn in Figure 7(a). As the MBR E is nt fully cntained in the Vrni cell V f site s, the MBRs E and E still need t be visited. When the MBR E is checked, based n the pruning criterin the distances frm bjects and t site s wuld nt be cmputed because their clsest site is s. Similarly, the clsest
8 Internatinal Jurnal f Database Management Systems ( IJDMS ) Vl., N., Octber 0 site f the bjects 7 and 8 enclsed in MBR E 7 is determined as site s. As fr bjects t, their clsest sites can be fund based n the pruning criterin. Having determined the clsest site f each bject, the ttal distance fr cmbinatin (s, s ) is btained. Cnsider anther cmbinatin (s, s ) shwn in Figure 7(b). The clsest site s f fur bjects t enclsed in MBR E can be fund when E is visited. Als, we can cmpute the ttal distance fr the cmbinatin (s, s ) after finding the clsest sites fr bjects t 8. By cmparing the distances fr all cmbinatins, the bs are retrieved. 8 s E 8 7 s E 7 E 7 s E s 7 E s E s E E E E 6 s E E 6 s (a) cmbinatin ( s, s ) (b) cmbinatin ( s, s ). PERFORMANCE EVALUATION Figure 7. Prcessing KBSQ with indexes We cnduct fur experiments fr the straightfrward apprach and the prpsed KBSQ algrithm in this sectin. The first three experiments are evaluated t study the perfrmance f the prpsed methds by measuring the CPU time fr prcessing a KBSQ. The last experiment demnstrates the usefulness f the KBSQ algrithm by cmparing the precisin f query result against its cmpetitrs... Experimental Setting All experiments are perfrmed n a PC with Intel.8 GHz CPU and GB RAM. The algrithms are implemented in Java. One synthetic dataset is used in ur simulatin. The synthetic dataset cnsists f 000 bjects whse lcatins are unifrmly spread ver a regin f * meters. In the experimental space, we als generate 0 query datasets, each f which cntains sites whse lcatins are in the same range as thse f the bjects mentined abve. Fr each query dataset, we perfrm a KBSQ t find the K best sites, where the default value f K is set t. The perfrmance is measured by the average CPU time in perfrming wrklad f the 0 queries. Table summarizes the parameters under investigatin, alng with their default values and ranges. We cmpare the prpsed KBSQ algrithm with the straightfrward apprach t investigate the perfrmance f prcessing a KBSQ. Als, we cmpare the precisin f the KBSQ algrithm against its cmpetitrs, including the RNNQ, the GNNQ, and the MDOLQ methds. Table. System parameters. Parameter Default Range Number f bjects (O) , 000, 000, 0000 Number f sites (S) 0,, 0, K,, 0, 0
9 Internatinal Jurnal f Database Management Systems ( IJDMS ) Vl., N., Octber 0.. Efficiency Of KBSQ Algrithm In this subsectin, we cmpare the KBSQ algrithm with the straightfrward apprach in terms f the CPU time. Three experiments are cnducted t investigate the effects f three imprtant factrs n the perfrmance f prcessing KBSQ. These imprtant factrs are the number f bjects O, the number f sites S, and the value f K. Figure 8 illustrates the perfrmance f the KBSQ algrithm and the straightfrward apprach as a functin f the number f bjects (ranging frm 00 t 0000). Nte that hereafter all figures use a lgarithmic scale fr the y-axis. As we can see frm the experimental result, the KBSQ algrithm significantly utperfrms the straightfrward apprach in the CPU time, even fr a smaller number f bjects (e.g., 00). This is mainly because fr the straightfrward apprach the distances f all bjects have t be cmputed which incurs high cmputatin cst. Mrever, the perfrmance gap between the KBSQ algrithm and the straightfrward apprach increases with the increasing number f bjects. The reasn is that mst distance cmputatins f bjects can be avided by using the KBSQ algrithm with the supprt f R*-tree, but these distance cmputatins are necessary fr the straightfrward apprach. Figure 8. Effect f number f bjects. Figure 9 demnstrates the effect f varius numbers f sites (i.e., varying S frm 0 t) n the perfrmance f the KBSQ algrithm and the straightfrward apprach. When the number f sites increases, the CPU verhead fr bth algrithms grws. The reasn is that as the number f sites becmes greater, the number f cmbinatins t be cnsidered increases s that mre distance cmputatins between bjects and sites are required. The experimental result shws that the KBSQ algrithm utperfrms its cmpetitr significantly in all cases, which cnfirms again that applying the KBSQ algrithm with R*-tree and Vrni diagram can greatly imprve the perfrmance f prcessing a KBSQ.
10 Internatinal Jurnal f Database Management Systems ( IJDMS ) Vl., N., Octber 0 Figure 9. Effect f number f sites Finally in this subsectin, we study hw the value f K affects the perfrmance f the KBSQ algrithm and the straightfrward apprach, by varying K frm t 0. Similar t the previus experimental results, the KBSQ algrithm achieves significantly better perfrmance than the straightfrward apprach (as shwn in Figure 0). The KBSQ algrithm utperfrms the straightfrward apprach by a factr f 70 t 0 in terms f the CPU cst. In additin, an interesting bservatin frm Figure 0 is that a smaller K (e.g., ) r a larger K (e.g., 0) results in a lwer CPU time fr the KBSQ algrithm and the straightfrward apprach. This is because fr a smaller (r larger) value f K, less number f cmbinatins needs t be cnsidered in prcessing a KBSQ s that the required CPU time can be reduced. Figure 0. Effect f K 6
11 Internatinal Jurnal f Database Management Systems ( IJDMS ) Vl., N., Octber 0.. Precisin Of KBSQ Algrithm The fllwing experiment demnstrates the precisin f the KBSQ algrithm and its cmpetitrs (including the RNNQ, the GNNQ, the MDOLQ methds) under varius values f K, where the precisin is represented as fllws: #( bsresult I bsreal ) precisin = 00% # bs In the abve equatin, bs result refers t the set f K best sites retrieved by executing the KBSQ algrithm, the RNNQ methd, the GNNQ methd, r the MDOLQ methd. As fr bs real, it is the set f the real K best sites. In Figure, we vary K frm t 0 t investigate the precisin f the KBSQ algrithm, the RNNQ methd, the GNNQ methd, and the MDOLQ methd. As we can see, as the real K best sites can be precisely determined by executing the KBSQ algrithm, the precisin f the KBSQ algrithm is always equal t 00% under different values f K. Hwever, if the RNNQ, the GNNQ, and the MDOLQ methds are adpted t answer a KBSQ, sme f the real K best sites are missed. As shwn in the experimental result, the precisin fr the MDOLQ methd can nly reach 60% t 8%. Even wrse, the precisin fr the RNNQ and the GNNQ methds is belw 60% fr a smaller value f K, which means that mst f the retrieved best sites are incrrect. real 6. CONCLUSIONS Figure. Precisin fr different K In this paper, we fcused n prcessing the K Best Site Query (KBSQ) which is a nvel and imprtant type f spatial queries. We highlighted the limitatins f the previus appraches fr the queries similar t the KBSQ, including the RNNQ, the GNNQ, and the MDOLQ. T slve the KBSQ prblem, we first prpsed a straightfrward apprach and then analyzed its prcessing cst. In rder t imprve the perfrmance f prcessing the KBSQ, we further prpsed a KBSQ algrithm cmbined with R*-tree and Vrni diagram t greatly reduce the CPU and I/O csts. Cmprehensive set f experiments demnstrated the efficiency and the precisin f the prpsed appraches. 7
12 Internatinal Jurnal f Database Management Systems ( IJDMS ) Vl., N., Octber 0 Our next step is t discuss the space requirement f the prpsed methds and design a nvel index structure fr answering the KBSQ. Then, we will fcus n prcessing the KBSQ fr mving bjects with fixed r uncertain velcity. Mre cmplicated issues will be intrduced because f the mvement f bjects. Finally, we wuld like t extend the prpsed apprach t prcess the KBSQ in rad netwrk. ACKNOWLEDGEMENTS This wrk was supprted by Natinal Science Cuncil f Taiwan (R.O.C.) under Grants NSC 0-9-M- -00 and NSC 0-9-M REFERENCES [] Benetis, R.; Jensen, C.S.; Karciauskas, G.; Saltenis, S. Nearest neighbr and reverse nearest neighbr queries fr mving bjects. VLDB Jurnal 006,, 9-9. [] Hakkymaz, V. A specificatin mdel fr tempral and spatial relatins f segments in multimedia presentatins. Jurnal f Digital Infrmatin Management 00, 8, 6-6. [] Huang, Y.-K.; Chen, C.-C.; Lee, C. Cntinuus k-nearest neighbr query fr mving bjects with uncertain velcity. GeInfrmatica 009,, -. [] Huang, Y.-K.; Lia, S.-J.; Lee C. Evaluating cntinuus k-nearest neighbr query n mving bjects with uncertainty. Infrmatin Systems 009,, -7. [] Mkbel, M.F.; Xing, X.; Aref, W.G. Sina: Scalable incremental prcessing f cntinuus queries in spati-tempral databases. In Prceedings f the ACM SIGMOD 00. [6] Pagel, B.-U.; Six, H.-W.; Winter, M. Windw query-ptimal clustering f spatial bjects. In Prceedings f the ACM SIGMOD 99. [7] Papadias, D.; Ta, Y.; Muratidis, K.; Hui, C.K. Aggregate nearest neighbr queries in spatial databases. ACM Trans. Database Syst. 00, 0, [8] Huang, Y.-K.; Lin, L.-F. Evaluating k-best site query n spatial bjects. In Prceedings f the NDT 0. [9] Guttman, A. R-trees: A dynamic index structure fr spatial searching. In Prceedings f the ACM SIGMOD 98. [0] Samet, H. The design and analysis f spatial data structures. Addisn-Wesley, Reading 990. [] Krn, F.; Muthukrishnan, S. Influence sets based n reverse nearest neighbr queries. In Prceedings f the ACM SIGMOD 00. [] Papadias, D.; Shen, Q.; Ta, Y.; Muratidis, K. Grup nearest neighbr queries. In Prceedings f the ICDE 00. [] Zhang, D.; Du, Y.; Xia, T.; Ta, Y. Prgressive cmputatin f the min-dist ptimal-lcatin query. In Prceedings f the VLDB 006. [] Zhang, J.; Zhu, M.; Papadias, D.; Ta, Y.; Lee, D.L. Lcatin-based spatial queries. In Prceedings f the ACM SIGMOD 00. 8
Using SPLAY Tree s for state-full packet classification
Curse Prject Using SPLAY Tree s fr state-full packet classificatin 1- What is a Splay Tree? These ntes discuss the splay tree, a frm f self-adjusting search tree in which the amrtized time fr an access,
More information1 Version Spaces. CS 478 Homework 1 SOLUTION
CS 478 Hmewrk SOLUTION This is a pssible slutin t the hmewrk, althugh there may be ther crrect respnses t sme f the questins. The questins are repeated in this fnt, while answers are in a mnspaced fnt.
More informationRetrieval Effectiveness Measures. Overview
Retrieval Effectiveness Measures Vasu Sathu 25th March 2001 Overview Evaluatin in IR Types f Evaluatin Retrieval Perfrmance Evaluatin Measures f Retrieval Effectiveness Single Valued Measures Alternative
More informationTL 9000 Quality Management System. Measurements Handbook. SFQ Examples
Quality Excellence fr Suppliers f Telecmmunicatins Frum (QuEST Frum) TL 9000 Quality Management System Measurements Handbk Cpyright QuEST Frum Sftware Fix Quality (SFQ) Examples 8.1 8.1.1 SFQ Example The
More informationINSTALLING CCRQINVOICE
INSTALLING CCRQINVOICE Thank yu fr selecting CCRQInvice. This dcument prvides a quick review f hw t install CCRQInvice. Detailed instructins can be fund in the prgram manual. While this may seem like a
More informationPlease contact technical support if you have questions about the directory that your organization uses for user management.
Overview ACTIVE DATA CALENDAR LDAP/AD IMPLEMENTATION GUIDE Active Data Calendar allws fr the use f single authenticatin fr users lgging int the administrative area f the applicatin thrugh LDAP/AD. LDAP
More informationStealing passwords via browser refresh
Stealing passwrds via brwser refresh Authr: Karmendra Khli [karmendra.khli@paladin.net] Date: August 07, 2004 Versin: 1.1 The brwser s back and refresh features can be used t steal passwrds frm insecurely
More informationHierarchical Classification of Amazon Products
Hierarchical Classificatin f Amazn Prducts Bin Wang Stanfrd University, bwang4@stanfrd.edu Shaming Feng Stanfrd University, superfsm@ stanfrd.edu Abstract - This prjects prpsed a hierarchical classificatin
More informationUsing CppSim to Generate Neural Network Modules in Simulink using the simulink_neural_net_gen command
Using CppSim t Generate Neural Netwrk Mdules in Simulink using the simulink_neural_net_gen cmmand Michael H. Perrtt http://www.cppsim.cm June 24, 2008 Cpyright 2008 by Michael H. Perrtt All rights reserved.
More informationReporting Requirements Specification
Cmmunity Mental Health Cmmn Assessment Prject OCAN 2.0 - ing Requirements Specificatin May 4, 2010 Versin 2.0.2 SECURITY NOTICE This material and the infrmatin cntained herein are prprietary t Cmmunity
More informationPriority-aware Coflow Placement and scheduling in Datacenters
Pririty-aware Cflw Placement and scheduling in Datacenters Speaker: Lin Wang Research Advisr: Biswanath Mukherjee Intrductin Cflw Represents a cllectin f independent flws that share a cmmn perfrmance gal.
More informationTutorial 5: Retention time scheduling
SRM Curse 2014 Tutrial 5 - Scheduling Tutrial 5: Retentin time scheduling The term scheduled SRM refers t measuring SRM transitins nt ver the whle chrmatgraphic gradient but nly fr a shrt time windw arund
More informationUiPath Automation. Walkthrough. Walkthrough Calculate Client Security Hash
UiPath Autmatin Walkthrugh Walkthrugh Calculate Client Security Hash Walkthrugh Calculate Client Security Hash Start with the REFramewrk template. We start ff with a simple implementatin t demnstrate the
More informationFIREWALL RULE SET OPTIMIZATION
Authr Name: Mungle Mukupa Supervisr : Mr Barry Irwin Date : 25 th Octber 2010 Security and Netwrks Research Grup Department f Cmputer Science Rhdes University Intrductin Firewalls have been and cntinue
More informationUsing the Swiftpage Connect List Manager
Quick Start Guide T: Using the Swiftpage Cnnect List Manager The Swiftpage Cnnect List Manager can be used t imprt yur cntacts, mdify cntact infrmatin, create grups ut f thse cntacts, filter yur cntacts
More information1 Binary Trees and Adaptive Data Compression
University f Illinis at Chicag CS 202: Data Structures and Discrete Mathematics II Handut 5 Prfessr Rbert H. Slan September 18, 2002 A Little Bttle... with the wrds DRINK ME, (r Adaptive data cmpressin
More informationHow to use DCI Contract Alerts
Hw t use DCI Cntract Alerts Welcme t the MyDCI Help Guide series Hw t use DCI Cntract Alerts In here, yu will find a lt f useful infrmatin abut hw t make the mst f yur DCI Alerts which will help yu t fully
More informationApp Center User Experience Guidelines for Apps for Me
App Center User Experience Guidelines fr Apps fr Me TABLE OF CONTENTS A WORD ON ACCESSIBILITY...3 DESIGN GUIDELINES...3 Accunt Linking Prcess... 3 Cnnect... 5 Accept Terms... 6 Landing Page... 6 Verificatin...
More informationChapter 6: Lgic Based Testing LOGIC BASED TESTING: This unit gives an indepth verview f lgic based testing and its implementatin. At the end f this unit, the student will be able t: Understand the cncept
More informationTest Pilot User Guide
Test Pilt User Guide Adapted frm http://www.clearlearning.cm Accessing Assessments and Surveys Test Pilt assessments and surveys are designed t be delivered t anyne using a standard web brwser and thus
More informationInterfacing to MATLAB. You can download the interface developed in this tutorial. It exists as a collection of 3 MATLAB files.
Interfacing t MATLAB Overview: Getting Started Basic Tutrial Interfacing with OCX Installatin GUI with MATLAB's GUIDE First Buttn & Image Mre ActiveX Cntrls Exting the GUI Advanced Tutrial MATLAB Cntrls
More informationRelius Documents ASP Checklist Entry
Relius Dcuments ASP Checklist Entry Overview Checklist Entry is the main data entry interface fr the Relius Dcuments ASP system. The data that is cllected within this prgram is used primarily t build dcuments,
More informationUsing the Swiftpage Connect List Manager
Quick Start Guide T: Using the Swiftpage Cnnect List Manager The Swiftpage Cnnect List Manager can be used t imprt yur cntacts, mdify cntact infrmatin, create grups ut f thse cntacts, filter yur cntacts
More informationCHAPTER 8. Clustering Algorithm for Outlier Detection in. Data Mining
CHAPTER 8 Clustering Algrithm fr Outlier Detectin in Data Mining 8.1 Intrductin In many data mining applicatins, the primary step is detecting utliers in a dataset. Outlier detectin fr data mining is nrmally
More informationLink-layer switches. Jurassic Park* LANs with backbone hubs are good. LANs with backbone hubs are bad. Hubs, bridges, and switches
Link-layer switches Jurassic Park* Hubs, bridges, and switches CS4 Cmputer Netwrks Department f Cmputer Science Wellesley Cllege *A multi-tier hub design. Switches 0- LANs with backbne hubs are gd. Prvide
More informationCntents 1 Intrductin Kit Cntents Requirements Installatin Gesture Sensr Kit Hardware and Jumper Settings De
Thin Film Pyrelectric IR Gesture Sensr Demnstratr Kit Fr lw pwer, high perfrmance gesture cntrl User Guide Versin 1.0 Dcument Revisin 1.00 20 th February 2012 Cntents 1 Intrductin... 3 1.1 Kit Cntents...
More informationUiPath Automation. Walkthrough. Walkthrough Calculate Client Security Hash
UiPath Autmatin Walkthrugh Walkthrugh Calculate Client Security Hash Walkthrugh Calculate Client Security Hash Start with the REFramewrk template. We start ff with a simple implementatin t demnstrate the
More informationTRAINING GUIDE. Overview of Lucity Spatial
TRAINING GUIDE Overview f Lucity Spatial Overview f Lucity Spatial In this sessin, we ll cver the key cmpnents f Lucity Spatial. Table f Cntents Lucity Spatial... 2 Requirements... 2 Setup... 3 Assign
More informationCustodial Integrator. Release Notes. Version 3.11 (TLM)
Custdial Integratr Release Ntes Versin 3.11 (TLM) 2018 Mrningstar. All Rights Reserved. Custdial Integratr Prduct Versin: V3.11.001 Dcument Versin: 020 Dcument Issue Date: December 14, 2018 Technical Supprt:
More informationIT Essentials (ITE v6.0) Chapter 7 Exam Answers 100% 2016
IT Essentials (ITE v6.0) Chapter 7 Exam Answers 100% 2016 1. Hw many devices can a Bluetth device cnnect t simultaneusly? 127 7 10 24 5 2. A device has an IPv6 address f 2001:0DB8:75a3:0214:0607:1234:aa10:ba01
More informationOverview of OPC Alarms and Events
Overview f OPC Alarms and Events Cpyright 2016 EXELE Infrmatin Systems, Inc. EXELE Infrmatin Systems (585) 385-9740 Web: http://www.exele.cm Supprt: supprt@exele.cm Sales: sales@exele.cm Table f Cntents
More information$ARCSIGHT_HOME/current/user/agent/map. The files are named in sequential order such as:
Lcatin f the map.x.prperties files $ARCSIGHT_HOME/current/user/agent/map File naming cnventin The files are named in sequential rder such as: Sme examples: 1. map.1.prperties 2. map.2.prperties 3. map.3.prperties
More informationUFuRT: A Work-Centered Framework and Process for Design and Evaluation of Information Systems
In: Prceedings f HCI Internatinal 2007 UFuRT: A Wrk-Centered Framewrk and Prcess fr Design and Evaluatin f Infrmatin Systems Jiajie Zhang 1, Keith A. Butler 2 1 University f Texas at Hustn, 7000 Fannin,
More informationUML : MODELS, VIEWS, AND DIAGRAMS
UML : MODELS, VIEWS, AND DIAGRAMS Purpse and Target Grup f a Mdel In real life we ften bserve that the results f cumbersme, tedius, and expensive mdeling simply disappear in a stack f paper n smene's desk.
More informationAustralian Statistics API Specification
Australian Statistics API Specificatin Versin: 1.2 Date Mdified: 23 March 2017 Page 1 The cntext... 2 Functins f the API... 2 2.1 Retail Trade API... 2 Input Parameters fr API... 3 Output Specificatin
More informationScatter Search And Bionomic Algorithms For The Aircraft Landing Problem
Scatter Search And Binmic Algrithms Fr The Aircraft Landing Prblem J. E. Beasley Mathematical Sciences Brunel University Uxbridge UB8 3PH United Kingdm http://peple.brunel.ac.uk/~mastjjb/jeb/jeb.html Abstract:
More informationCommon Language Runtime
Intrductin t.net framewrk.net is a general-purpse sftware develpment platfrm, similar t Java. Micrsft intrduced.net with purpse f bridging gap between different applicatins..net framewrk aims at cmbining
More informationPruning Dynamic Slices With Confidence
Pruning Dynamic Slices With Cnfidence Xiangyu Zhang Neelam Gupta Rajiv Gupta he University f Arizna, Department f Cmputer Science, ucsn, Arizna 8572 {xyzhang,ngupta,gupta}@cs.arizna.edu Abstract Given
More informationUPGRADING TO DISCOVERY 2005
Centennial Discvery 2005 Why Shuld I Upgrade? Discvery 2005 is the culminatin f ver 18 mnths wrth f research and develpment and represents a substantial leap frward in audit and decisin-supprt technlgy.
More informationIf you have any questions that are not covered in this manual, we encourage you to contact us at or send an to
Overview Welcme t Vercity, the ESS web management system fr rdering backgrund screens and managing the results. Frm any cmputer, yu can lg in and access yur applicants securely, rder a new reprt, and even
More informationDate: October User guide. Integration through ONVIF driver. Partner Self-test. Prepared By: Devices & Integrations Team, Milestone Systems
Date: Octber 2018 User guide Integratin thrugh ONVIF driver. Prepared By: Devices & Integratins Team, Milestne Systems 2 Welcme t the User Guide fr Online Test Tl The aim f this dcument is t prvide guidance
More informationNetwork Rail ARMS - Asbestos Risk Management System. Training Guide for use of the Import Survey Template
Netwrk Rail ARMS - Asbests Risk Management System Training Guide fr use f the Imprt Survey Template The ARMS Imprt Survey Template New Asbests Management Surveys and their Survey Detail reprts can be added
More informationThese tasks can now be performed by a special program called FTP clients.
FTP Cmmander FAQ: Intrductin FTP (File Transfer Prtcl) was first used in Unix systems a lng time ag t cpy and mve shared files. With the develpment f the Internet, FTP became widely used t uplad and dwnlad
More informationCreating a TES Encounter/Transaction Entry Batch
Creating a TES Encunter/Transactin Entry Batch Overview Intrductin This mdule fcuses n hw t create batches fr transactin entry in TES. Charges (transactins) are entered int the system in grups called batches.
More informationDesign Patterns. Collectional Patterns. Session objectives 11/06/2012. Introduction. Composite pattern. Iterator pattern
Design Patterns By Võ Văn Hải Faculty f Infrmatin Technlgies HUI Cllectinal Patterns Sessin bjectives Intrductin Cmpsite pattern Iteratr pattern 2 1 Intrductin Cllectinal patterns primarily: Deal with
More informationBI Publisher TEMPLATE Tutorial
PepleSft Campus Slutins 9.0 BI Publisher TEMPLATE Tutrial Lessn T2 Create, Frmat and View a Simple Reprt Using an Existing Query with Real Data This tutrial assumes that yu have cmpleted BI Publisher Tutrial:
More informationDashboard Extension for Enterprise Architect
Dashbard Extensin fr Enterprise Architect Dashbard Extensin fr Enterprise Architect... 1 Disclaimer... 2 Dependencies... 2 Overview... 2 Limitatins f the free versin f the extensin... 3 Example Dashbard
More information3.1 QUADRATIC FUNCTIONS IN VERTEX FORM
3.1 QUADRATIC FUNCTIONS IN VERTEX FORM PC0 T determine the crdinates f the vertex, the dmain and range, the axis f symmetry, the x and y intercepts and the directin f pening f the graph f f(x)=a(x p) +
More informationIntroduction. by Surekha Parekh
Intrductin by Surekha Parekh In the current ecnmic climate, businesses are under significant pressure t cntrl csts and increase efficiency t imprve their bttm line. IBM DB2 fr z/os custmers arund the wrld
More informationClassFlow Administrator User Guide
ClassFlw Administratr User Guide ClassFlw User Engagement Team April 2017 www.classflw.cm 1 Cntents Overview... 3 User Management... 3 Manual Entry via the User Management Page... 4 Creating Individual
More informationReport Writing Guidelines Writing Support Services
Reprt Writing Guidelines Writing Supprt Services Overview The guidelines presented here shuld give yu an idea f general cnventins fr writing frmal reprts. Hwever, yu shuld always cnsider yur particular
More informationProcessing Moving Queries over Moving Objects Using Motion Adaptive Indexes
Prcessing Mving Queries ver Mving Objects Using Mtin Adaptive Indexes Cllege f Cmputing Gergia Institute f Technlgy bgedik@cc.gatech.edu Kun-Lung Wu, Philip S. Yu T.J. Watsn Research Center IBM Research
More informationFaculty Textbook Adoption Instructions
Faculty Textbk Adptin Instructins The Bkstre has partnered with MBS Direct t prvide textbks t ur students. This partnership ffers ur students and parents mre chices while saving them mney, including ptins
More informationOPERATING MANUAL. Exceed GERMANY. Electronic Postage Computing Scale CONTENTS
Exceed GERMANY Electrnic Pstage Cmputing Scale OPERATING MANUAL CONTENTS INTRODUCTION Specificatins Preparing the scale fr use Operating the Exceed pstal scale KEYBOARD FUNCTIONS Basic services Supplementary
More informationHigh-dimensional Proximity Joins. Kyuseok Shim Ramakrishnan Srikant Rakesh Agrawal. IBM Almaden Research Center. 650 Harry Road, San Jose, CA 95120
High-dimensinal Prximity Jins Kyusek Shim Ramakrishnan Srikant Rakesh Agrawal IBM Almaden Research Center 650 Harry Rad, San Jse, CA 95120 Abstract Many emerging data mining applicatins require a prximity
More informationIntegrating QuickBooks with TimePro
Integrating QuickBks with TimePr With TimePr s QuickBks Integratin Mdule, yu can imprt and exprt data between TimePr and QuickBks. Imprting Data frm QuickBks The TimePr QuickBks Imprt Facility allws data
More informationAn Approach to Recognize Bangla Digits from Digital Image
248 IJCSNS Internatinal Jurnal f Cmputer Science and Netwrk Security, VOL.11 N.6, June 2011 An Apprach t Recgnize Bangla Digits frm Digital Image Abdul Kadar Muhammad Masum 1, Mhammad Shahjalal 2, Md.
More informationWITH the continued advances in mobile computing and
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, VOL. 18, NO. 5, MAY 2006 651 Prcessing Mving Queries ver Mving Objects Using Mtin-Adaptive Indexes Bugra Gedik, Student Member, IEEE Cmputer Sciety,
More informationA System for Generating Process and Material Selection Advice During Embodiment Design of Mechanical Components
A System fr Generating Prcess and Material Selectin Advice During Embdiment Design f Mechanical Cmpnents Satyandra K. Gupta and Yusheng Chen Mechanical Engineering Department and Institute fr Systems Research
More informationPAGE NAMING STRATEGIES
PAGE NAMING STRATEGIES Naming Yur Pages in SiteCatalyst May 14, 2007 Versin 1.1 CHAPTER 1 1 Page Naming The pagename variable is used t identify each page that will be tracked n the web site. If the pagename
More informationComputer Organization and Architecture
Campus de Gualtar 4710-057 Braga UNIVERSIDADE DO MINHO ESCOLA DE ENGENHARIA Departament de Infrmática Cmputer Organizatin and Architecture 5th Editin, 2000 by William Stallings Table f Cntents I. OVERVIEW.
More informationCopyrights and Trademarks
Cpyrights and Trademarks Sage One Accunting Cnversin Manual 1 Cpyrights and Trademarks Cpyrights and Trademarks Cpyrights and Trademarks Cpyright 2002-2014 by Us. We hereby acknwledge the cpyrights and
More informationOASIS SUBMISSIONS FOR FLORIDA: SYSTEM FUNCTIONS
OASIS SUBMISSIONS FOR FLORIDA: SYSTEM FUNCTIONS OASIS SYSTEM FUNCTIONS... 2 ESTABLISHING THE COMMUNICATION CONNECTION... 2 ACCESSING THE OASIS SYSTEM... 3 SUBMITTING OASIS DATA FILES... 5 OASIS INITIAL
More informationHigh Security SaaS Concept Software as a Service (SaaS) for Life Science
Sftware as a Service (SaaS) fr Life Science Cpyright Cunesft GmbH Cntents Intrductin... 3 Data Security and Islatin in the Clud... 3 Strage System Security and Islatin... 3 Database Security and Islatin...
More informationSmartPass User Guide Page 1 of 50
SmartPass User Guide Table f Cntents Table f Cntents... 2 1. Intrductin... 3 2. Register t SmartPass... 4 2.1 Citizen/Resident registratin... 4 2.1.1 Prerequisites fr Citizen/Resident registratin... 4
More informationExchange Archive Monitoring
Unified Archive \ Best Practices \ Mail Archiving Exchange Archive Mnitring ZL TECHNOLOGIES Last Updated: Octber 21, 2014 This dcument intrduces the numerus ZL UA features and functinalities an rganizatin
More informationThe Reporting Tool. An Overview of HHAeXchange s Reporting Tool
HHAeXchange The Reprting Tl An Overview f HHAeXchange s Reprting Tl Cpyright 2017 Hmecare Sftware Slutins, LLC One Curt Square 44th Flr Lng Island City, NY 11101 Phne: (718) 407-4633 Fax: (718) 679-9273
More informationQuick Guide on implementing SQL Manage for SAP Business One
Quick Guide n implementing SQL Manage fr SAP Business One The purpse f this dcument is t guide yu thrugh the quick prcess f implementing SQL Manage fr SAP B1 SQL Server databases. SQL Manage is a ttal
More informationPerformance of VSA in VMware vsphere 5
Perfrmance f VSA in VMware vsphere 5 Perfrmance Study TECHNICAL WHITE PAPER Table f Cntents Intrductin... 3 Executive Summary... 3 Test Envirnment... 3 Key Factrs f VSA Perfrmance... 4 Cmmn Strage Perfrmance
More informationAuthor guide to submission and publication
Authr guide t submissin and publicatin Cntents Cntents... 1 Preparing an article fr submissin... 1 Hw d I submit my article?... 1 The decisin prcess after submissin... 2 Reviewing... 2 First decisin...
More informationArius 3.0. Release Notes and Installation Instructions. Milliman, Inc Peachtree Road, NE Suite 1900 Atlanta, GA USA
Release Ntes and Installatin Instructins Milliman, Inc. 3424 Peachtree Rad, NE Suite 1900 Atlanta, GA 30326 USA Tel +1 800 404 2276 Fax +1 404 237 6984 actuarialsftware.cm 1. Release ntes Release 3.0 adds
More informationTN How to configure servers to use Optimise2 (ERO) when using Oracle
TN 1498843- Hw t cnfigure servers t use Optimise2 (ERO) when using Oracle Overview Enhanced Reprting Optimisatin (als knwn as ERO and Optimise2 ) is a feature f Cntrller which is t speed up certain types
More informationNetwork Rail ARMS - Asbestos Risk Management System. Training Guide for use of the Import Asset Template
Netwrk Rail ARMS - Asbests Risk Management System Training Guide fr use f the Imprt Asset Template The ARMS Imprt Asset Template New assets can be added t the Asbests Risk Management System (ARMS) using
More informationDue Date: Lab report is due on Mar 6 (PRA 01) or Mar 7 (PRA 02)
Lab 3 Packet Scheduling Due Date: Lab reprt is due n Mar 6 (PRA 01) r Mar 7 (PRA 02) Teams: This lab may be cmpleted in teams f 2 students (Teams f three r mre are nt permitted. All members receive the
More informationDefiniens XD Release Notes
Definiens XD 1.1.2 Release Ntes Errr! N text f specified style in dcument. Definiens XD 1.1.2 - Release Ntes Imprint and Versin Dcument Versin XD 1.1.2 Cpyright 2009 Definiens AG. All rights reserved.
More informationIntegration Framework for SAP Business One
Integratin Framewrk fr SAP Business One DIPrxy Cnfiguratin PUBLIC Glbal Rll-ut Octber 2018, B Zha TABLE OF CONTENTS 1 INTRODUCTION... 3 2 INSTALLATION... 3 3 CONFIGURATION... 5 3.1 Services in Service
More informationECE 545 Project Deliverables
Tp-level flder: _ Secnd-level flders: 1_assumptins 2_blck_diagrams 3_interface 4_ASM_charts 5_surce_cdes 6_verificatin 7_timing_analysis 8_results 9_benchmarking 10_bug_reprts
More informationTwo-Dimensional Topology Structure between Vector Layers in GIS
2011, Scienceline Publicatin Jurnal f Civil Engineering and Urbanism Vlume 1, Issue 1: 10-14 (2011) ISSN-2252-0430 Tw-Dimensinal Structure between Vectr Layers in GIS Davd Parvinnezhad Hkmabadi* 1, Ali
More informationVMware AirWatch Certificate Authentication for Cisco IPSec VPN
VMware AirWatch Certificate Authenticatin fr Cisc IPSec VPN Fr VMware AirWatch Have dcumentatin feedback? Submit a Dcumentatin Feedback supprt ticket using the Supprt Wizard n supprt.air-watch.cm. This
More informationColored Image Watermarking Technique Based on HVS using HSV Color Model Piyush Kapoor 1, Krishna Kumar Sharma 1, S.S. Bedi 2, Ashwani Kumar 3, 1
ACEEE Int. J. n Netwrk Security, Vl. 02, N. 03, July 2011 Clred Image Watermarking Technique Based n HVS using HSV Clr Mdel Piyush Kapr 1, Krishna Kumar Sharma 1, S.S. Bedi 2, Ashwani Kumar 3, 1 Indian
More informationof Prolog An Overview 1.1 An example program: defining family relations
An Overview f Prlg This chaptereviews basic mechanisms f Prlg thrugh an example prgram. Althugh the treatment is largely infrmal many imprtant cncepts are intrduced. 1.1 An example prgram: defining family
More informationHow To enrich transcribed documents with mark-up
Hw T enrich transcribed dcuments with mark-up Versin v1.4.0 (22_02_2018_15:07) Last update 30.09.2018 This guide will shw yu hw t add mark-up t dcuments which are already transcribed in Transkribus. This
More informationTIBCO Statistica Options Configuration
TIBCO Statistica Optins Cnfiguratin Sftware Release 13.3 June 2017 Tw-Secnd Advantage Imprtant Infrmatin SOME TIBCO SOFTWARE EMBEDS OR BUNDLES OTHER TIBCO SOFTWARE. USE OF SUCH EMBEDDED OR BUNDLED TIBCO
More informationOnce the Address Verification process is activated, the process can be accessed by employees in one of two ways:
Type: System Enhancements ID Number: SE 94 Date: June 29, 2012 Subject: New Address Verificatin Prcess Suggested Audience: Human Resurce Offices Details: Sectin I: General Infrmatin fr Address Verificatin
More informationAn Adaptive Updating Protocol for Reducing Moving Object Database Workload
An Adaptive pdating Prtcl fr Reducing Mving Object Database Wrlad Su Chen Beng Chin Oi Zhenjie Zhang Schl f Cmputing Natinal niversity f Singapre {chensu,ibc,zhenjie}@cmp.nus.edu.sg ABSTRACT In the last
More informationYou need to be able to define the following terms and answer basic questions about them:
CS440/ECE448 Fall 2016 Midterm Review Yu need t be able t define the fllwing terms and answer basic questins abut them: Intr t AI, agents and envirnments Pssible definitins f AI, prs and cns f each Turing
More informationThe Mathematics of the Rubik s Cube
The Mathematics f the Rubik s Cube Middle Schl Natinal Standards Cmmn Cre State Standards Materials Instructinal prgrams frm prekindergarten thrugh grade 12 shuld enable all students t: Understand numbers,
More informationStructure Query Language (SQL)
Structure Query Language (SQL) 1. Intrductin SQL 2. Data Definitin Language (DDL) 3. Data Manipulatin Language ( DML) 4. Data Cntrl Language (DCL) 1 Structured Query Language(SQL) 6.1 Intrductin Structured
More informationUser Guide. Document Version: 1.0. Solution Version:
User Guide Dcument Versin: 1.0 Slutin Versin: 365.082017.3.1 Table f Cntents Prduct Overview... 3 Hw t Install and Activate Custmer Satisfactin Survey Slutin?... 4 Security Rles in Custmer Satisfactin
More informationQUICK START GUIDE FOR THE TREB CONNECT INTERFACE
QUICK START GUIDE FOR THE TREB CONNECT INTERFACE CONNECT is a jint venture f the Trnt Real Estate Bard, REALTORS Assciatin f Hamiltn-Burlingtn, the Lndn and St. Thmas Assciatin f REALTORS and the Ottawa
More informationDear Milestone Customer,
Dear Milestne Custmer, With the purchase f Milestne Xprtect Transact yu have chsen a very flexible ptin t yur Milestne Xprtect Business slutin. Milestne Xprtect Transact enables yu t stre a serial data
More informationJSR Java API for JSON Binding (JSON- B)
JSR Java API fr JSON Binding (JSON- B) Title: * Java API fr JSON Binding (JSON- B) Summary: * A standard binding layer (metadata & runtime) fr cnverting Java bjects t/frm JSON messages. Sectin 1: Identificatin
More informationENERGY YIELD OF TRACKING PV SYSTEMS IN JORDAN
ENERGY YIELD OF TRACKING PV SYSTEMS IN JORDAN A. Al Tarabsheh, I. Etier, and A. Nimrat Hashemite University, Electrical Engineering Department, 13115 Zarqa, Jrdan. Abstract This paper analyzes the energy
More informationThe QMF Family V Newsletter 3rd Quarter 2013 Edition
The QMF Family Newsletter 3rd Quarter 2013 Editin In This Issue Dive int QMF at the IBM Infrmatin On Demand Cnference irtual data surces and analytic queries in QMF A message frm the develpers f QMF: Changing
More informationCS510 Concurrent Systems Class 2. A Lock-Free Multiprocessor OS Kernel
CS510 Cncurrent Systems Class 2 A Lck-Free Multiprcessr OS Kernel The Synthesis kernel A research prject at Clumbia University Synthesis V.0 ( 68020 Uniprcessr (Mtrla N virtual memry 1991 - Synthesis V.1
More informationWorking With Audacity
Wrking With Audacity Audacity is a free, pen-surce audi editing prgram. The majr user interface elements are highlighted in the screensht f the prgram s main windw belw. The editing tls are used t edit
More informationSummary. Server environment: Subversion 1.4.6
Surce Management Tl Server Envirnment Operatin Summary In the e- gvernment standard framewrk, Subversin, an pen surce, is used as the surce management tl fr develpment envirnment. Subversin (SVN, versin
More informationFinal Report. Graphical User Interface for the European Transport Model TREMOVE. June 15 th 2010
Date June 15 th 2010 Authrs Charitn Kuridis Dr Mia Fu Dr Andrew Kelly Thmas Papagergiu Client Eurpean Cmmissin DG Climate Actin Directrate A: Internatinal & Climate Strategy Unit A4: Strategy & Ecnmic
More informationEastern Mediterranean University School of Computing and Technology Information Technology Lecture2 Functions
Eastern Mediterranean University Schl f Cmputing and Technlgy Infrmatin Technlgy Lecture2 Functins User Defined Functins Why d we need functins? T make yur prgram readable and rganized T reduce repeated
More informationAnnouncing Veco AuditMate from Eurolink Technology Ltd
Vec AuditMate Annuncing Vec AuditMate frm Eurlink Technlgy Ltd Recrd any data changes t any SQL Server database frm any applicatin Database audit trails (recrding changes t data) are ften a requirement
More information