Estimating Costs of Path Expression Evaluation in Distributed Object Databases

Size: px
Start display at page:

Download "Estimating Costs of Path Expression Evaluation in Distributed Object Databases"

Transcription

1 Estmatng Costs of Path Expresson Evaluaton n Dstrbuted Obect Databases Gabrela Ruberg, Fernanda Baão, and Marta Mattoso Department of Computer Scence COPPE/UFRJ P.O.Box 685, Ro de Janero, RJ, Brazl {gruberg, baao, marta}@cos.ufr.br Abstract. Effcent evaluaton of path expressons n dstrbuted obect databases nvolves choosng among several query processng strateges, due to the rch semantcs nvolved n obect-based data models and to the complexty added by the dstrbuton. Ths work presents a new cost model for obect-based query processors and addresses relevant ssues, whch are gnored or relaxed n other works n the lterature, such as the selectvty of the path expresson, the sharng degree of the referenced obects, the partal partcpaton of the collectons n the relatonshps, and the dstrbuton of the database obects across the nodes of a network. These ssues allowed us to present more realstc estmates for the query optmzer. Our cost model has been valdated aganst expermental results obtaned wth an obect DBMS prototype runnng n a dstrbuted archtecture, usng the OO7 benchmark applcaton. Introducton The development of realstc and effcent query optmzers s extremely mportant n enhancng the performance of database systems. In current query languages, path expresson processng optmzaton s a central and dffcult ssue. Reference attrbutes n path expressons provde drect (ponter) access through obect navgaton, such as n obect databases, or element navgaton n XML [6]. The choce of the best executon plan to process a query wth reference attrbutes s not smple for the query optmzer to make, due to the large number of executon strateges and algorthms to evaluate a path expresson. Relevant ssues must be consdered for ths problem, ncludng choosng from bnary or n-ary operators, ponter- or value-based algorthms, forward or reverse evaluaton drectons. These ssues are not fully addressed n current cost models for obect-based query optmzers, compromsng the accuracy of estmate models. In a dstrbuted envronment, the query executon search space s even larger because of fragmented data. Dstrbuted data processng s becomng popular due to performance gans obtaned from PC clusters, grd computng, and the Web, among others []. However, current path expresson optmzers lack practcal cost functons for ad-hoc queres n fragmented collectons of obects. These functons may not be drectly obtaned from centralzed cost models because some fragmented data may be prevously dsregarded durng the query executon, modfyng substantally the query R. Ccchett et al. (Eds.): DEXA 2002, LNCS 2453, pp , Sprnger-Verlag Berln Hedelberg 2002

2 352 G. Ruberg, F. Baão, and M. Mattoso costs. Even n a centralzed context, a realstc cost model can not be obtaned wth a smple combnaton of relevant ssues nto a sngle model, because these ssues are strongly related to each other and have to be remodeled. Table dentfes the presence of mportant ssues n current obect database cost models. Next, we dscuss the mpact of the ssues of Table n the cost estmates. Estmatng selectvty factor s essental to the performance analyss of query processng. The selectvty of path expressons can vary sgnfcantly accordng to partal or total partcpaton of a class n a relatonshp. Partal partcpaton means that only a subset of obects n a class are related to the obects of another class. However, most cost models [, 2, 7, 8, 9, 0, 3] dsregard partal partcpaton. Cho et al.[6] present a realstc method for the estmaton of selectvty factors, but only n centralzed obect databases. A path expresson can be evaluated n a forward drecton (from the frst to the last collecton) or n a reverse drecton (n the opposte way). Many cost models [, 2, 7, 8, 9] are lmted to the forward drecton. The reverse drecton s not obtaned by smply changng the ndex varaton, rather other parameters have to be added. The two basc algebra operators for path expresson evaluaton are the n-ary operator and the bnary operator. The executon costs of a path expresson may sgnfcantly vary for each par (evaluaton drecton, algebra operator), accordng to the selectvty of the nested predcates and to the partal partcpaton of the collectons n the relatonshps of the path expresson. A cost model restrcted to a specfc drecton or executon strategy may prevent the query optmzer from choosng the best executon plan. The amount of IO operatons, estmated n terms of data pages, s often presented as the basc cost n the query processng [, 2, 5, 8, 9, 0, 3], specally n a centralzed executon. The obect data model allows complex strateges due to the rch varety of constructors provded, and can drastcally affect cost estmates of IO operatons f technques of obect clusterng are appled. Ths aspect has been dsregarded by most cost models [, 2, 5, 7, 8, 0, 3]. Very few works analyze CPU costs [9, 0]. Communcaton costs of dstrbuted evaluaton of path expressons n vertcally and/or horzontally fragmented classes s not addressed n the lterature. Almost all processng cost factors are very nfluenced by the sze of avalable man memory, although ths factor s usually not taken nto account. In the small memory hypothess, the IO reload overhead of a path expresson evaluaton s tradtonally estmated usng the collecton fan-out parameter [8, 9, 0]. However, we have notced that practcally no addtonal IO operatons are necessary f there s no obect sharng n the relatonshps of the path expresson, even f the fan-out s greater than one. Works on dstrbuted obect-based cost functons are dedcated to algorthms for class parttonng n obect databases. They are focused on the analyss of prmary horzontal (P.H.F.) [, 2, 7], derved horzontal (D.H.F.) [2], and vertcal (V.F) [8] fragmentaton methodologes. Ther applcaton n a real query optmzer s somewhat restrcted, snce they dsregard mportant ssues n the path expresson evaluaton, such as the obect clusterng polcy, the evaluaton drecton, the bnary operator and algorthms, and CPU costs. These ssues are not trvally ncluded n the cost model of the algorthms.

3 Estmatng Costs of Path Expresson Evaluaton n Dstrbuted Obect Databases 353 Table. Important ssues n path expresson processng and related cost models Issues / Cost Models [] [2] [3] [5] [7] [8] [9] [0] [3] [4] C Partal partcpaton X X X E Physcal obect clusterng X X N Evaluaton drecton X X X X X T N-ary operator X X X X X X X X R A Bnary operator X X X X L IO overhead due to ob. sharng X I IO costs X X X X X X X X Z. CPU costs X X X D P.H.F. X X X X I D.H.F. X X S V.F. X X T. Communcaton costs X We present a new cost model that covers the most representatve algorthms for bnary and n-ary operators, as well as forward and reverse drectons for general path expresson evaluaton, n both centralzed and dstrbuted envronments. An extended verson of ths work wth detaled cost formulas may be found n [4]. In addton, our cost model has been valdated aganst expermental results obtaned n our prevous work [5]. The remanng of ths paper s organzed as follows. Secton 2 descrbes our cost model wth emphass n estmaton of selectvty factors. Secton 3 shows the valdaton of our cost model aganst expermental results, obtaned wth an obect DBMS prototype usng the OO7 benchmark. Fnally, Secton 4 draws some consderatons and future work. 2 Cost Model Invarably, the complexty of optmzaton problems requres some smplfcatons n the cost model. We assume that: () the query optmzer s able to break the encapsulaton property; () obects have a sze less than a database page; () the attrbute values are unformly dstrbuted among nstances of a class; and (v) each obect collecton has ust one class as ts doman. These assumptons are present n other cost models [, 2, 3, 5, 8, 9, 0, 3] snce they occur n most obect-based DBMS, as well as n ther typcal applcatons. Thus, they do not lmt the expressve power of our cost model. In our approach for estmatng the cost of query executon plans, we consder that queres are ssued aganst collectons, thus some statstcs are mantaned for collectons rather than for classes. The parameters of the fragments F are represented smlarly to the parameters of the collectons, addng the ndex, f. Therefore,

4 354 G. Ruberg, F. Baão, and M. Mattoso represents the selectvty of the path expresson over the fragment + D s the total number of dstnct ponters from C obects to F obects. +, F whle Table 2. Cost Model Parameters Para m SEL Descrpton Selectvty of nested predcate p over C Selectvty of the path expresson over C C Cardnalty of C C # pages of C S Average sze of one obect of C C f # fragments of C Z -, Average # dstnct ponters to C + obects from C obects that have at least one non null reference D Total # dstnct ponters from C, + obects to C + obects X # C, + obects havng all ponters to C + obects as null references sel Selectvty factor over the C cardnalty accordng to the F cardnalty REF # dstnct accessed obects from C n the path evaluaton. ref Analogous to REF, n F Length of the path expresson 2. Selectvty Factor of Path Expressons The bass for evaluatng query optmzaton strateges s the estmaton of the selectvty factor of selecton predcates and ons [5]. The selectvty factor of a path expresson s the selectvty factor resultant from the nested predcates and the partcpaton of each class collecton n path relatonshps. Partal partcpaton of a class collecton nfluences the predcton of the path expresson selectvty due not only to the estmaton of the selectvty of mplct ons, but also due to the estmaton of selectvty of nested predcates. Therefore, only the referenced obects n the path expresson must be taken nto account to estmate the selectvty factors over the collectons. When ponter-based algorthms are used, the path expresson selectvty over a collecton C represents the porton of the C obects that wll be accessed durng the path evaluaton. Moreover, the path expresson selectvty determnes the cardnalty of the ntermedate results generated by on algorthms (ponter and value-based). Its computaton over each collecton C,, also depends on the drecton used to evaluate the path expresson. Thus, gven a path expresson, we may express the number of dstnct accessed obects n collecton C durng the path navgaton as: The term, REF = SEL C. (), s obtaned accordng to the evaluaton drecton: In forward, SEL ' = and SEL D, = ; (2) C

5 Estmatng Costs of Path Expresson Evaluaton n Dstrbuted Obect Databases 355 In reverse, ' = SEL and + SEL+ ( C X, + ) =. (3) C Note that all obects n the startng collecton (C or C, accordng to the evaluaton drecton) are accessed because there s no flter from a prevous relatonshp n the path expresson. In path expressons nvolvng large collectons wth low selectvty factors, the tradtonal probablstc method for selectvty estmaton [, 2, 3, 5, 8, 0] results n an expressve devaton from real values, as shown n secton 3. Ths dfference, whch s avoded n our method, may be propagated to the estmaton of page hts and to all costs that are based on the selectvty factor (IO, CPU and communcaton costs). Addtonally, our method presents low computatonal complexty, thus mprovng processng costs n the optmzaton task. Fragmentaton Effects. Horzontal fragmentaton dstrbutes class nstances among fragments (obect collectons) wth the same structure, accordng to a gven fragmentaton crtera. Analogously, vertcal fragmentaton splts the logcal structure of a class and dstrbutes ts attrbutes (and methods) among fragments wth the same cardnalty. Let C,, be a collecton of a path expresson wth prmary horzontal or vertcal fragmentaton. Durng the evaluaton of ths path expresson, the query processor can prevously dentfy: ) a horzontal fragment F, f, where the selectvty of the assocated nested predcate p s zero; or ) a vertcal fragment F, f, whch attrbutes are not used n the query. In both cases, we assume SEL = 0, thus causng the elmnaton of F durng the query processng. If C s fragmented, only the set of fragments of C n whch SEL 0 wll be scanned durng the query evaluaton process. We may defne the Elm subset contanng all C fragments elmnated by SEL as: { F, f SEL = 0} Elm =. (4) In addton, we may defne the subset Elm that refers to the derved horzontal fragments from C whch were ndrectly elmnated by the path expresson selectvty (f ther prmary fragments were elmnated too), as follows: { F, f ( F F ) ( F E )} = Elm'. (5) The term F F denotes that the prmary fragment F determnes the derved fragment F, n the forward evaluaton. The reverse evaluaton formula s obtaned analogously to (5). We may defne the set E,, wth cardnalty #E, of all C fragments that wll not be scanned durng the path expresson evaluaton as: E = Elm Elm'. (6)

6 356 G. Ruberg, F. Baão, and M. Mattoso We estmate the selectvty factor of C obects that belong to E as: sele = sel. (7) F E The formal defnton of set E and of ts subsets, representng the fragmented data that s dsregarded durng the query evaluaton, allows us to properly estmate the selectvty factors and executon costs of a dstrbuted path expresson evaluaton. Path Expresson Selectvty n Horzontal Fragmentaton. The number of dstnct obects retreved from a horzontally fragmented collecton C,, durng the evaluaton of a path expresson s gven by: f = REF ref = where ref SEL F, (8) = ', f. (9) If F E then we have ref = 0. Otherwse, F E and s calculated accordng to both the horzontal fragmentaton strategy of C (prmary or derved) and to the path expresson evaluaton drecton. In a forward evaluaton, < and, we have: f In P.H.F., SEL ' = and In D.H.F., ' = SEL D, = ; (0) F SEL and part ( SEL ) D, =. () F In equaton (), the functon part ( factor) returns the partcpaton of the fragment F n the obects selected by factor from C. Modelng ths partcpaton s mportant because f derved horzontal fragmentaton s appled on C and some of ts fragments are elmnated by ther C - prmary fragments, then only non-elmnated C fragments contrbute to REF obects. Indeed, the selectvty term (SEL - x SEL - ) s not proportonally dstrbuted among all C fragments, but restrcted to non-elmnated C fragments. Therefore: part ( factor) = selelm' factor factor + ( selelm' ), f factor =,, otherwse. The selectvty factor selelm of obects from C fragments that were elmnated by the path expresson selectvty s analogous to formula (7). Fnally, the path (2) Estmaton n reverse evaluaton s obtaned analogously to (3), applyng the functon part(factor) f C has derved fragmentaton.

7 Estmatng Costs of Path Expresson Evaluaton n Dstrbuted Obect Databases 357 expresson selectvty and the nested predcate selectvty over a collecton C that s horzontally fragmented are gven respectvely by: f SEL and S = SEL ( sel ) = ' = f = SEL ( sel SEL ) = ' ; (3). (4) The term represents the selectvty factor of the path expresson n the S startng collecton. Note that partal partcpaton of collectons n path relatonshps nfluences the estmaton of the selectvty factors of each fragment nvolved n the path expresson evaluaton. In a dstrbuted context, f total partcpaton s assumed, then the dfference from real values to estmates s even larger due to accumulaton of many fragment devatons. Path Expresson Selectvty n Vertcal Fragmentaton. Let C,, be a vertcally fragmented collecton where only one C vertcal fragment contans the reference attrbute used n the path expresson navgaton. The remanng C fragments are accessed durng the query evaluaton only f ther attrbutes are necessary to probe the predcate p. The selectvty factor of the path expresson s the same n all C fragments and the total number of dstnct C obects whch are accessed durng the path expresson evaluaton s obtaned by: REF = ref, (5) * where ref = C. (6) * The term ref * denotes the number of dstnct C obects that are accessed n one C vertcal fragment. Note that SEL s obtaned accordng to equatons (2) and (3). However, each C obect corresponds to f stored obects, accordng to C vertcal fragments. Therefore, we estmate the total number of C obects whch are accessed n the non-elmnated vertcal fragments durng the path expresson evaluaton as: ( f #E ) ref REF_v =. (7) * Fnally, the nested predcate p has several selectvty factors accordng to C vertcal fragments, thus ts resultant selectvty factor s estmated as: F E ( ) SEL = mn SEL. (8) Both vertcal and horzontal fragmentaton estmates may be easly combned to calculate the selectvty factors of hybrd fragmentaton technques.

8 358 G. Ruberg, F. Baão, and M. Mattoso 3 Expermental Analyss In order to valdate our cost model, we have compared ts performance wth results prevously obtaned [5] n practcal experments. These expermental results were obtaned usng the OO7 benchmark [4] on top of the GOA DBMS prototype [2]. Expermental and smulaton results n terms of number of IO operatons per query are shown n Fgures to 4. The results focus on the performance of the path expresson evaluaton n queres Q-Q5 usng strategy NP-F (forward naïve ponter chasng) and n queres Q-Q2 usng strategy VJ-R (reverse value-based on), dsregardng the cost of dsplayng query results. Cost model results Expermental results Cost model results Expermental results #IO operatons Q-F Q2-F Q3-F Q4-F Q5-F Q-R Q2-R #IO operatons # nodes Fg.. NP-F and VJ-R executon IO cost (4Mbytes memory) Fg. 2. IO cost per node of Q-F executon n a dstrbuted envronment NP-F NP-R VJ-F VJ-R Cost model results Expermental results #IO operatons sharng degree #IO operatons # nodes Fg. 3. IO cost varyng the sharng degree (4Mbytes memory) Fg. 4. IO cost per node of Q4- F executon n a dstrbuted envronment Fgure shows the number of IO operatons that occurred n the executon of each path expresson evaluaton strategy n the centralzed envronment, and compares them to the predctons of our cost model, showng that the estmates are very close to all the evaluated scenaros. As expected, most of the predcted results are slghtly hgher than the expermental ones, snce some cost model formulas calculate the worst case for dsk random access. Queres Q3 and Q5, however, presented the

9 Estmatng Costs of Path Expresson Evaluaton n Dstrbuted Obect Databases 359 expermental result somewhat hgher than the predcted by the cost model. Ths s due to the fact that they are very fast queres, thus the overhead of catalog access n the real experment was more predomnant. Query Q4-F s defned over two large collectons (AtomcParts and Connectons). We assume that AtomcParts =00000 and Connectons = Accordng to [, 0], the number of accessed obects n the collecton Connectons s estmated as X 2 = Snce the partcpaton of the collectons n the path expresson s total, we observe that the real value of accessed obects from Connectons should be Accordng to our proposed formulas () and (2), the correspondng parameter s REF 2 = Ths example shows a dfference, whch s avoded n our estmaton method, of approxmately 37% between the result obtaned by the tradtonal probablstc estmaton method and the real result. In Fgure 3, we analyzed the effect of varyng the sharng degree (, 3, and 0 n each collecton) of the obects along a path expresson wth = 3. The n-ary operator (NP-F and NP-R) has the worst behavor as share ncreases, snce t gnores repeated obect access and thus performs very poorly. The value-based on (VJ-F and VJ-R) presented a constant behavor because t avods the bad effect of the obect sharng and should be consdered a good choce when obect sharng s very hgh. Ths example shows that f the cost model does not consder the reverse drecton or the value-based on algorthm, then the query executon strategy s lmted to a very neffcent choce. Queres Q-F and Q4-F were executed n a dstrbuted envronment usng 2, 4, 8, and 2 nodes. Fgures 2 and 4 show the number of IO operatons per node that occurred n the executon of each query. Our cost predctons are farly close to values from expermental dstrbuted executon, as n the centralzed case. 4 Conclusons Effcent processng of path expressons s fundamental for current query languages. The man contrbuton of ths work s a new, realstc cost model to estmate the executon costs of evaluatng path expressons n a dstrbuted envronment. The proposed cost model addresses bnary and n-ary operators, as well as forward and reverse drectons for path expresson evaluaton. It also consders ssues such as the selectvty of the path expresson, the sharng degree of the referenced obects whch contrbutes to IO reload overhead estmate, physcal clusterng of the obects n dsk, and the partal partcpaton of the class collectons n path relatonshps. These ssues were combned and extended to encompass dstrbuted processng, coverng both horzontal (prmary and derved) and vertcal fragmentaton of data. We have shown the expressve devaton from real results n the tradtonal probablstc method for estmaton of the path expresson selectvty when large collectons wth low selectvty factors are taken nto account. Our selectvty estmaton method avods ths devaton and presents low computatonal complexty, consequently dmnshng processng costs n the optmzaton task. We also presented the lmtatons of always usng the same algorthm and evaluaton drecton n path

10 360 G. Ruberg, F. Baão, and M. Mattoso expresson processng. The new cost model takes nto account a large number of dfferent factors, yet t remans farly smple. The estmates generated by our cost model are very close to observed expermental results. Currently we are workng on extendng ths model for regular path expresson processng. We are also expermentng the cost model to examne dfferent strateges and new algorthms for evaluatng path expressons. Acknowledgement Ths work was partally fnanced by CNPq and FAPERJ. The author G. Ruberg was supported by Central Bank of Brazl. References. Bellatreche, L., Karlapalem, K., Basak, G.: Query-Drven Horzontal Class Parttonng for Obect-Orented Databases. DEXA 998, Bellatreche, L., Karlapalem, K., L, Q.: Derved Horzontal Class Parttonng n OODBs: Desgn Strateges, Analytcal Model and Evaluaton. ER 998, Bertno, E., Foscol, P.: On Modelng Cost Functons for Obect-Orented Databases. IEEE TKDE 9(3), (997) 4. Carey, M., DeWtt D., Naughton, J.: The OO7 Benchmark. ACM SIGMOD 22(2), 2-2 (993) 5. Cho, W., Park, C., Whang, K., Son, S.: A New Method for Estmatng the Number of Obects Satsfyng an Obect-Orented Query Involvng Partal Partcpaton of Classes. Informaton Systems 2(3), (996) 6. Deutsch, A., Fernandez, M., et al.: Queryng XML Data. IEEE Data Engneerng Bulletn 22(3), 0-8 (999) 7. Ezefe, C., Zheng, J.: Measurng the Performance of Database Obect Horzontal Fragmentaton Schemes. IDEAS 999, Fung, C. Karlapalem, K., L, Q.: Cost-drven evaluaton of vertcal class parttonng n obect orented databases. DASFAA 997, Gardarn, G., Gruser, J., Tang, Z.: A Cost Model for Clustered Obect-Orented Databases. VLDB 995, Gardarn, G., Gruser, J., Tang, Z.: Cost-based Selecton of Path Expresson Processng Algorthms n Obect-Orented Databases. VLDB 996, Kossmann, D.: The State of the Art n Dstrbuted Query Processng. ACM Computng Surveys 32(4), (2000) 2. GOA++ Obect Management System. URL: 3. Ozkan, C., Dogac, A., Altnel, M.: A Cost Model for Path Expressons n Obect Orented Queres. Journal of Database Management 7(3), (996) 4. Ruberg, G.: A Cost Model for Query Processng n Dstrbuted-Obect Databases, M.Sc. Thess n Portuguese, COPPE/UFRJ, Brazl (200). Reduced verson n Englsh avalable n 5. Tavares, F.O., Vctor, A.O., Mattoso, M.: Parallel Processng Evaluaton of Path Expressons. SBBD 2000, 49-63

Parallelism for Nested Loops with Non-uniform and Flow Dependences

Parallelism for Nested Loops with Non-uniform and Flow Dependences Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr

More information

Needed Information to do Allocation

Needed Information to do Allocation Complexty n the Database Allocaton Desgn Must tae relatonshp between fragments nto account Cost of ntegrty enforcements Constrants on response-tme, storage, and processng capablty Needed Informaton to

More information

A Binarization Algorithm specialized on Document Images and Photos

A Binarization Algorithm specialized on Document Images and Photos A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a

More information

Determining the Optimal Bandwidth Based on Multi-criterion Fusion

Determining the Optimal Bandwidth Based on Multi-criterion Fusion Proceedngs of 01 4th Internatonal Conference on Machne Learnng and Computng IPCSIT vol. 5 (01) (01) IACSIT Press, Sngapore Determnng the Optmal Bandwdth Based on Mult-crteron Fuson Ha-L Lang 1+, Xan-Mn

More information

Problem Definitions and Evaluation Criteria for Computational Expensive Optimization

Problem Definitions and Evaluation Criteria for Computational Expensive Optimization Problem efntons and Evaluaton Crtera for Computatonal Expensve Optmzaton B. Lu 1, Q. Chen and Q. Zhang 3, J. J. Lang 4, P. N. Suganthan, B. Y. Qu 6 1 epartment of Computng, Glyndwr Unversty, UK Faclty

More information

Reducing Frame Rate for Object Tracking

Reducing Frame Rate for Object Tracking Reducng Frame Rate for Object Trackng Pavel Korshunov 1 and We Tsang Oo 2 1 Natonal Unversty of Sngapore, Sngapore 11977, pavelkor@comp.nus.edu.sg 2 Natonal Unversty of Sngapore, Sngapore 11977, oowt@comp.nus.edu.sg

More information

Content Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers

Content Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers IOSR Journal of Electroncs and Communcaton Engneerng (IOSR-JECE) e-issn: 78-834,p- ISSN: 78-8735.Volume 9, Issue, Ver. IV (Mar - Apr. 04), PP 0-07 Content Based Image Retreval Usng -D Dscrete Wavelet wth

More information

UB at GeoCLEF Department of Geography Abstract

UB at GeoCLEF Department of Geography   Abstract UB at GeoCLEF 2006 Mguel E. Ruz (1), Stuart Shapro (2), June Abbas (1), Slva B. Southwck (1) and Davd Mark (3) State Unversty of New York at Buffalo (1) Department of Lbrary and Informaton Studes (2) Department

More information

Cost-based Selection of Path Expression Processing. Algorithms in Object-Oriented Databases

Cost-based Selection of Path Expression Processing. Algorithms in Object-Oriented Databases Cost-based Selecton of Path Expresson Processng Algorthms n Object-Orented Databases Georges Gardarn a,b, Jean-Robert Gruser b, Zhao-Hu Tang a a CNRS-PRSM Laboratory b Projet Rodn Unversty of Versalles-St-Quentn

More information

An Optimal Algorithm for Prufer Codes *

An Optimal Algorithm for Prufer Codes * J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,

More information

Learning-Based Top-N Selection Query Evaluation over Relational Databases

Learning-Based Top-N Selection Query Evaluation over Relational Databases Learnng-Based Top-N Selecton Query Evaluaton over Relatonal Databases Lang Zhu *, Wey Meng ** * School of Mathematcs and Computer Scence, Hebe Unversty, Baodng, Hebe 071002, Chna, zhu@mal.hbu.edu.cn **

More information

Machine Learning: Algorithms and Applications

Machine Learning: Algorithms and Applications 14/05/1 Machne Learnng: Algorthms and Applcatons Florano Zn Free Unversty of Bozen-Bolzano Faculty of Computer Scence Academc Year 011-01 Lecture 10: 14 May 01 Unsupervsed Learnng cont Sldes courtesy of

More information

Performance Evaluation of Information Retrieval Systems

Performance Evaluation of Information Retrieval Systems Why System Evaluaton? Performance Evaluaton of Informaton Retreval Systems Many sldes n ths secton are adapted from Prof. Joydeep Ghosh (UT ECE) who n turn adapted them from Prof. Dk Lee (Unv. of Scence

More information

An Entropy-Based Approach to Integrated Information Needs Assessment

An Entropy-Based Approach to Integrated Information Needs Assessment Dstrbuton Statement A: Approved for publc release; dstrbuton s unlmted. An Entropy-Based Approach to ntegrated nformaton Needs Assessment June 8, 2004 Wllam J. Farrell Lockheed Martn Advanced Technology

More information

Petri Net Based Software Dependability Engineering

Petri Net Based Software Dependability Engineering Proc. RELECTRONIC 95, Budapest, pp. 181-186; October 1995 Petr Net Based Software Dependablty Engneerng Monka Hener Brandenburg Unversty of Technology Cottbus Computer Scence Insttute Postbox 101344 D-03013

More information

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster

More information

Term Weighting Classification System Using the Chi-square Statistic for the Classification Subtask at NTCIR-6 Patent Retrieval Task

Term Weighting Classification System Using the Chi-square Statistic for the Classification Subtask at NTCIR-6 Patent Retrieval Task Proceedngs of NTCIR-6 Workshop Meetng, May 15-18, 2007, Tokyo, Japan Term Weghtng Classfcaton System Usng the Ch-square Statstc for the Classfcaton Subtask at NTCIR-6 Patent Retreval Task Kotaro Hashmoto

More information

Helsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr)

Helsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr) Helsnk Unversty Of Technology, Systems Analyss Laboratory Mat-2.08 Independent research projects n appled mathematcs (3 cr) "! #$&% Antt Laukkanen 506 R ajlaukka@cc.hut.f 2 Introducton...3 2 Multattrbute

More information

Related-Mode Attacks on CTR Encryption Mode

Related-Mode Attacks on CTR Encryption Mode Internatonal Journal of Network Securty, Vol.4, No.3, PP.282 287, May 2007 282 Related-Mode Attacks on CTR Encrypton Mode Dayn Wang, Dongda Ln, and Wenlng Wu (Correspondng author: Dayn Wang) Key Laboratory

More information

Classifier Selection Based on Data Complexity Measures *

Classifier Selection Based on Data Complexity Measures * Classfer Selecton Based on Data Complexty Measures * Edth Hernández-Reyes, J.A. Carrasco-Ochoa, and J.Fco. Martínez-Trndad Natonal Insttute for Astrophyscs, Optcs and Electroncs, Lus Enrque Erro No.1 Sta.

More information

Simulation Based Analysis of FAST TCP using OMNET++

Simulation Based Analysis of FAST TCP using OMNET++ Smulaton Based Analyss of FAST TCP usng OMNET++ Umar ul Hassan 04030038@lums.edu.pk Md Term Report CS678 Topcs n Internet Research Sprng, 2006 Introducton Internet traffc s doublng roughly every 3 months

More information

S1 Note. Basis functions.

S1 Note. Basis functions. S1 Note. Bass functons. Contents Types of bass functons...1 The Fourer bass...2 B-splne bass...3 Power and type I error rates wth dfferent numbers of bass functons...4 Table S1. Smulaton results of type

More information

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration Improvement of Spatal Resoluton Usng BlockMatchng Based Moton Estmaton and Frame Integraton Danya Suga and Takayuk Hamamoto Graduate School of Engneerng, Tokyo Unversty of Scence, 6-3-1, Nuku, Katsuska-ku,

More information

Adjustment methods for differential measurement errors in multimode surveys

Adjustment methods for differential measurement errors in multimode surveys Adjustment methods for dfferental measurement errors n multmode surveys Salah Merad UK Offce for Natonal Statstcs ESSnet MM DCSS, Fnal Meetng Wesbaden, Germany, 4-5 September 2014 Outlne Introducton Stablsng

More information

Mathematics 256 a course in differential equations for engineering students

Mathematics 256 a course in differential equations for engineering students Mathematcs 56 a course n dfferental equatons for engneerng students Chapter 5. More effcent methods of numercal soluton Euler s method s qute neffcent. Because the error s essentally proportonal to the

More information

An Efficient Genetic Algorithm with Fuzzy c-means Clustering for Traveling Salesman Problem

An Efficient Genetic Algorithm with Fuzzy c-means Clustering for Traveling Salesman Problem An Effcent Genetc Algorthm wth Fuzzy c-means Clusterng for Travelng Salesman Problem Jong-Won Yoon and Sung-Bae Cho Dept. of Computer Scence Yonse Unversty Seoul, Korea jwyoon@sclab.yonse.ac.r, sbcho@cs.yonse.ac.r

More information

y and the total sum of

y and the total sum of Lnear regresson Testng for non-lnearty In analytcal chemstry, lnear regresson s commonly used n the constructon of calbraton functons requred for analytcal technques such as gas chromatography, atomc absorpton

More information

Explicit Formulas and Efficient Algorithm for Moment Computation of Coupled RC Trees with Lumped and Distributed Elements

Explicit Formulas and Efficient Algorithm for Moment Computation of Coupled RC Trees with Lumped and Distributed Elements Explct Formulas and Effcent Algorthm for Moment Computaton of Coupled RC Trees wth Lumped and Dstrbuted Elements Qngan Yu and Ernest S.Kuh Electroncs Research Lab. Unv. of Calforna at Berkeley Berkeley

More information

Course Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms

Course Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms Course Introducton Course Topcs Exams, abs, Proects A quc loo at a few algorthms 1 Advanced Data Structures and Algorthms Descrpton: We are gong to dscuss algorthm complexty analyss, algorthm desgn technques

More information

Evaluation of an Enhanced Scheme for High-level Nested Network Mobility

Evaluation of an Enhanced Scheme for High-level Nested Network Mobility IJCSNS Internatonal Journal of Computer Scence and Network Securty, VOL.15 No.10, October 2015 1 Evaluaton of an Enhanced Scheme for Hgh-level Nested Network Moblty Mohammed Babker Al Mohammed, Asha Hassan.

More information

Tsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance

Tsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance Tsnghua Unversty at TAC 2009: Summarzng Mult-documents by Informaton Dstance Chong Long, Mnle Huang, Xaoyan Zhu State Key Laboratory of Intellgent Technology and Systems, Tsnghua Natonal Laboratory for

More information

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision SLAM Summer School 2006 Practcal 2: SLAM usng Monocular Vson Javer Cvera, Unversty of Zaragoza Andrew J. Davson, Imperal College London J.M.M Montel, Unversty of Zaragoza. josemar@unzar.es, jcvera@unzar.es,

More information

2x x l. Module 3: Element Properties Lecture 4: Lagrange and Serendipity Elements

2x x l. Module 3: Element Properties Lecture 4: Lagrange and Serendipity Elements Module 3: Element Propertes Lecture : Lagrange and Serendpty Elements 5 In last lecture note, the nterpolaton functons are derved on the bass of assumed polynomal from Pascal s trangle for the fled varable.

More information

Self-tuning Histograms: Building Histograms Without Looking at Data

Self-tuning Histograms: Building Histograms Without Looking at Data Self-tunng Hstograms: Buldng Hstograms Wthout Lookng at Data Ashraf Aboulnaga Computer Scences Department Unversty of Wsconsn - Madson ashraf@cs.wsc.edu Surajt Chaudhur Mcrosoft Research surajtc@mcrosoft.com

More information

Querying by sketch geographical databases. Yu Han 1, a *

Querying by sketch geographical databases. Yu Han 1, a * 4th Internatonal Conference on Sensors, Measurement and Intellgent Materals (ICSMIM 2015) Queryng by sketch geographcal databases Yu Han 1, a * 1 Department of Basc Courses, Shenyang Insttute of Artllery,

More information

Chapter 6 Programmng the fnte element method Inow turn to the man subject of ths book: The mplementaton of the fnte element algorthm n computer programs. In order to make my dscusson as straghtforward

More information

Evaluation of Parallel Processing Systems through Queuing Model

Evaluation of Parallel Processing Systems through Queuing Model ISSN 2278-309 Vkas Shnde, Internatonal Journal of Advanced Volume Trends 4, n Computer No.2, March Scence - and Aprl Engneerng, 205 4(2), March - Aprl 205, 36-43 Internatonal Journal of Advanced Trends

More information

Virtual Memory. Background. No. 10. Virtual Memory: concept. Logical Memory Space (review) Demand Paging(1) Virtual Memory

Virtual Memory. Background. No. 10. Virtual Memory: concept. Logical Memory Space (review) Demand Paging(1) Virtual Memory Background EECS. Operatng System Fundamentals No. Vrtual Memory Prof. Hu Jang Department of Electrcal Engneerng and Computer Scence, York Unversty Memory-management methods normally requres the entre process

More information

A Fast Content-Based Multimedia Retrieval Technique Using Compressed Data

A Fast Content-Based Multimedia Retrieval Technique Using Compressed Data A Fast Content-Based Multmeda Retreval Technque Usng Compressed Data Borko Furht and Pornvt Saksobhavvat NSF Multmeda Laboratory Florda Atlantc Unversty, Boca Raton, Florda 3343 ABSTRACT In ths paper,

More information

Sequential search. Building Java Programs Chapter 13. Sequential search. Sequential search

Sequential search. Building Java Programs Chapter 13. Sequential search. Sequential search Sequental search Buldng Java Programs Chapter 13 Searchng and Sortng sequental search: Locates a target value n an array/lst by examnng each element from start to fnsh. How many elements wll t need to

More information

A Unified Framework for Semantics and Feature Based Relevance Feedback in Image Retrieval Systems

A Unified Framework for Semantics and Feature Based Relevance Feedback in Image Retrieval Systems A Unfed Framework for Semantcs and Feature Based Relevance Feedback n Image Retreval Systems Ye Lu *, Chunhu Hu 2, Xngquan Zhu 3*, HongJang Zhang 2, Qang Yang * School of Computng Scence Smon Fraser Unversty

More information

Optimizing Document Scoring for Query Retrieval

Optimizing Document Scoring for Query Retrieval Optmzng Document Scorng for Query Retreval Brent Ellwen baellwe@cs.stanford.edu Abstract The goal of ths project was to automate the process of tunng a document query engne. Specfcally, I used machne learnng

More information

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS ARPN Journal of Engneerng and Appled Scences 006-017 Asan Research Publshng Network (ARPN). All rghts reserved. NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS Igor Grgoryev, Svetlana

More information

Learning the Kernel Parameters in Kernel Minimum Distance Classifier

Learning the Kernel Parameters in Kernel Minimum Distance Classifier Learnng the Kernel Parameters n Kernel Mnmum Dstance Classfer Daoqang Zhang 1,, Songcan Chen and Zh-Hua Zhou 1* 1 Natonal Laboratory for Novel Software Technology Nanjng Unversty, Nanjng 193, Chna Department

More information

FEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur

FEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur FEATURE EXTRACTION Dr. K.Vjayarekha Assocate Dean School of Electrcal and Electroncs Engneerng SASTRA Unversty, Thanjavur613 41 Jont Intatve of IITs and IISc Funded by MHRD Page 1 of 8 Table of Contents

More information

Run-Time Operator State Spilling for Memory Intensive Long-Running Queries

Run-Time Operator State Spilling for Memory Intensive Long-Running Queries Run-Tme Operator State Spllng for Memory Intensve Long-Runnng Queres Bn Lu, Yal Zhu, and lke A. Rundenstener epartment of Computer Scence, Worcester Polytechnc Insttute Worcester, Massachusetts, USA {bnlu,

More information

Support Vector Machines

Support Vector Machines /9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.

More information

High-Boost Mesh Filtering for 3-D Shape Enhancement

High-Boost Mesh Filtering for 3-D Shape Enhancement Hgh-Boost Mesh Flterng for 3-D Shape Enhancement Hrokazu Yagou Λ Alexander Belyaev y Damng We z Λ y z ; ; Shape Modelng Laboratory, Unversty of Azu, Azu-Wakamatsu 965-8580 Japan y Computer Graphcs Group,

More information

Under-Sampling Approaches for Improving Prediction of the Minority Class in an Imbalanced Dataset

Under-Sampling Approaches for Improving Prediction of the Minority Class in an Imbalanced Dataset Under-Samplng Approaches for Improvng Predcton of the Mnorty Class n an Imbalanced Dataset Show-Jane Yen and Yue-Sh Lee Department of Computer Scence and Informaton Engneerng, Mng Chuan Unversty 5 The-Mng

More information

Query Clustering Using a Hybrid Query Similarity Measure

Query Clustering Using a Hybrid Query Similarity Measure Query clusterng usng a hybrd query smlarty measure Fu. L., Goh, D.H., & Foo, S. (2004). WSEAS Transacton on Computers, 3(3), 700-705. Query Clusterng Usng a Hybrd Query Smlarty Measure Ln Fu, Don Hoe-Lan

More information

Cluster Analysis of Electrical Behavior

Cluster Analysis of Electrical Behavior Journal of Computer and Communcatons, 205, 3, 88-93 Publshed Onlne May 205 n ScRes. http://www.scrp.org/ournal/cc http://dx.do.org/0.4236/cc.205.350 Cluster Analyss of Electrcal Behavor Ln Lu Ln Lu, School

More information

Sum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints

Sum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints Australan Journal of Basc and Appled Scences, 2(4): 1204-1208, 2008 ISSN 1991-8178 Sum of Lnear and Fractonal Multobjectve Programmng Problem under Fuzzy Rules Constrants 1 2 Sanjay Jan and Kalash Lachhwan

More information

Two-Stage Data Distribution for Distributed Surveillance Video Processing with Hybrid Storage Architecture

Two-Stage Data Distribution for Distributed Surveillance Video Processing with Hybrid Storage Architecture Two-Stage Data Dstrbuton for Dstrbuted Survellance Vdeo Processng wth Hybrd Storage Archtecture Yangyang Gao, Hatao Zhang, Bngchang Tang, Yanpe Zhu, Huadong Ma Bejng Key Lab of Intellgent Telecomm. Software

More information

Skew Angle Estimation and Correction of Hand Written, Textual and Large areas of Non-Textual Document Images: A Novel Approach

Skew Angle Estimation and Correction of Hand Written, Textual and Large areas of Non-Textual Document Images: A Novel Approach Angle Estmaton and Correcton of Hand Wrtten, Textual and Large areas of Non-Textual Document Images: A Novel Approach D.R.Ramesh Babu Pyush M Kumat Mahesh D Dhannawat PES Insttute of Technology Research

More information

An Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation

An Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation 17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 An Iteratve Soluton Approach to Process Plant Layout usng Mxed

More information

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields 17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 A mathematcal programmng approach to the analyss, desgn and

More information

PYTHON IMPLEMENTATION OF VISUAL SECRET SHARING SCHEMES

PYTHON IMPLEMENTATION OF VISUAL SECRET SHARING SCHEMES PYTHON IMPLEMENTATION OF VISUAL SECRET SHARING SCHEMES Ruxandra Olmd Faculty of Mathematcs and Computer Scence, Unversty of Bucharest Emal: ruxandra.olmd@fm.unbuc.ro Abstract Vsual secret sharng schemes

More information

Avoiding congestion through dynamic load control

Avoiding congestion through dynamic load control Avodng congeston through dynamc load control Vasl Hnatyshn, Adarshpal S. Seth Department of Computer and Informaton Scences, Unversty of Delaware, Newark, DE 976 ABSTRACT The current best effort approach

More information

Sensor-aware Adaptive Pull-Push Query Processing for Sensor Networks

Sensor-aware Adaptive Pull-Push Query Processing for Sensor Networks Sensor-aware Adaptve Pull-Push Query Processng for Sensor Networks Raja Bose Unversty of Florda Ganesvlle, FL 326 U.S.A. rbose@cse.ufl.edu Abdelsalam Helal Unversty of Florda Ganesvlle, FL 326 U.S.A. helal@cse.ufl.edu

More information

Module Management Tool in Software Development Organizations

Module Management Tool in Software Development Organizations Journal of Computer Scence (5): 8-, 7 ISSN 59-66 7 Scence Publcatons Management Tool n Software Development Organzatons Ahmad A. Al-Rababah and Mohammad A. Al-Rababah Faculty of IT, Al-Ahlyyah Amman Unversty,

More information

Lecture 5: Multilayer Perceptrons

Lecture 5: Multilayer Perceptrons Lecture 5: Multlayer Perceptrons Roger Grosse 1 Introducton So far, we ve only talked about lnear models: lnear regresson and lnear bnary classfers. We noted that there are functons that can t be represented

More information

On Some Entertaining Applications of the Concept of Set in Computer Science Course

On Some Entertaining Applications of the Concept of Set in Computer Science Course On Some Entertanng Applcatons of the Concept of Set n Computer Scence Course Krasmr Yordzhev *, Hrstna Kostadnova ** * Assocate Professor Krasmr Yordzhev, Ph.D., Faculty of Mathematcs and Natural Scences,

More information

A Fast Visual Tracking Algorithm Based on Circle Pixels Matching

A Fast Visual Tracking Algorithm Based on Circle Pixels Matching A Fast Vsual Trackng Algorthm Based on Crcle Pxels Matchng Zhqang Hou hou_zhq@sohu.com Chongzhao Han czhan@mal.xjtu.edu.cn Ln Zheng Abstract: A fast vsual trackng algorthm based on crcle pxels matchng

More information

Complex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following.

Complex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following. Complex Numbers The last topc n ths secton s not really related to most of what we ve done n ths chapter, although t s somewhat related to the radcals secton as we wll see. We also won t need the materal

More information

X- Chart Using ANOM Approach

X- Chart Using ANOM Approach ISSN 1684-8403 Journal of Statstcs Volume 17, 010, pp. 3-3 Abstract X- Chart Usng ANOM Approach Gullapall Chakravarth 1 and Chaluvad Venkateswara Rao Control lmts for ndvdual measurements (X) chart are

More information

Hierarchical clustering for gene expression data analysis

Hierarchical clustering for gene expression data analysis Herarchcal clusterng for gene expresson data analyss Gorgo Valentn e-mal: valentn@ds.unm.t Clusterng of Mcroarray Data. Clusterng of gene expresson profles (rows) => dscovery of co-regulated and functonally

More information

ON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE

ON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE Yordzhev K., Kostadnova H. Інформаційні технології в освіті ON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE Yordzhev K., Kostadnova H. Some aspects of programmng educaton

More information

Algorithms for data warehouse design to enhance decision-making

Algorithms for data warehouse design to enhance decision-making Algorthms for data warehouse desgn to enhance decson-makng ZIYATI ELHOUSSAINE, DRISS ABOUTAJDINE, EL QADI ABDERRAHIM Mohammed V Unversty GSCM-LRIT Agdal-Rabat MAROC zyat@gmal.com aboutaj@fsr.ac.ma elqad@est-um.ac.ma

More information

Efficient Semantically Equal Join on Strings in Practice

Efficient Semantically Equal Join on Strings in Practice Thammasat Int. J. Sc. Tech., Vol. 4, No., Aprl-June 009 Effcent Semantcally Equal Jon on Strngs n Practce Juggapong Natwcha Computer Engneerng Department, Faculty of Engneerng Chang Ma Unversty, Chang

More information

TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS. Muradaliyev A.Z.

TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS. Muradaliyev A.Z. TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS Muradalyev AZ Azerbajan Scentfc-Research and Desgn-Prospectng Insttute of Energetc AZ1012, Ave HZardab-94 E-mal:aydn_murad@yahoocom Importance of

More information

Type-2 Fuzzy Non-uniform Rational B-spline Model with Type-2 Fuzzy Data

Type-2 Fuzzy Non-uniform Rational B-spline Model with Type-2 Fuzzy Data Malaysan Journal of Mathematcal Scences 11(S) Aprl : 35 46 (2017) Specal Issue: The 2nd Internatonal Conference and Workshop on Mathematcal Analyss (ICWOMA 2016) MALAYSIAN JOURNAL OF MATHEMATICAL SCIENCES

More information

Oracle Database: SQL and PL/SQL Fundamentals Certification Course

Oracle Database: SQL and PL/SQL Fundamentals Certification Course Oracle Database: SQL and PL/SQL Fundamentals Certfcaton Course 1 Duraton: 5 Days (30 hours) What you wll learn: Ths Oracle Database: SQL and PL/SQL Fundamentals tranng delvers the fundamentals of SQL and

More information

FAHP and Modified GRA Based Network Selection in Heterogeneous Wireless Networks

FAHP and Modified GRA Based Network Selection in Heterogeneous Wireless Networks 2017 2nd Internatonal Semnar on Appled Physcs, Optoelectroncs and Photoncs (APOP 2017) ISBN: 978-1-60595-522-3 FAHP and Modfed GRA Based Network Selecton n Heterogeneous Wreless Networks Xaohan DU, Zhqng

More information

Real-time Motion Capture System Using One Video Camera Based on Color and Edge Distribution

Real-time Motion Capture System Using One Video Camera Based on Color and Edge Distribution Real-tme Moton Capture System Usng One Vdeo Camera Based on Color and Edge Dstrbuton YOSHIAKI AKAZAWA, YOSHIHIRO OKADA, AND KOICHI NIIJIMA Graduate School of Informaton Scence and Electrcal Engneerng,

More information

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points; Subspace clusterng Clusterng Fundamental to all clusterng technques s the choce of dstance measure between data ponts; D q ( ) ( ) 2 x x = x x, j k = 1 k jk Squared Eucldean dstance Assumpton: All features

More information

Wishing you all a Total Quality New Year!

Wishing you all a Total Quality New Year! Total Qualty Management and Sx Sgma Post Graduate Program 214-15 Sesson 4 Vnay Kumar Kalakband Assstant Professor Operatons & Systems Area 1 Wshng you all a Total Qualty New Year! Hope you acheve Sx sgma

More information

Analysis of Continuous Beams in General

Analysis of Continuous Beams in General Analyss of Contnuous Beams n General Contnuous beams consdered here are prsmatc, rgdly connected to each beam segment and supported at varous ponts along the beam. onts are selected at ponts of support,

More information

Introduction. Leslie Lamports Time, Clocks & the Ordering of Events in a Distributed System. Overview. Introduction Concepts: Time

Introduction. Leslie Lamports Time, Clocks & the Ordering of Events in a Distributed System. Overview. Introduction Concepts: Time Lesle Laports e, locks & the Orderng of Events n a Dstrbuted Syste Joseph Sprng Departent of oputer Scence Dstrbuted Systes and Securty Overvew Introducton he artal Orderng Logcal locks Orderng the Events

More information

An Efficient Garbage Collection for Flash Memory-Based Virtual Memory Systems

An Efficient Garbage Collection for Flash Memory-Based Virtual Memory Systems S. J and D. Shn: An Effcent Garbage Collecton for Flash Memory-Based Vrtual Memory Systems 2355 An Effcent Garbage Collecton for Flash Memory-Based Vrtual Memory Systems Seunggu J and Dongkun Shn, Member,

More information

VISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES

VISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES UbCC 2011, Volume 6, 5002981-x manuscrpts OPEN ACCES UbCC Journal ISSN 1992-8424 www.ubcc.org VISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES

More information

NAG Fortran Library Chapter Introduction. G10 Smoothing in Statistics

NAG Fortran Library Chapter Introduction. G10 Smoothing in Statistics Introducton G10 NAG Fortran Lbrary Chapter Introducton G10 Smoothng n Statstcs Contents 1 Scope of the Chapter... 2 2 Background to the Problems... 2 2.1 Smoothng Methods... 2 2.2 Smoothng Splnes and Regresson

More information

Parallel matrix-vector multiplication

Parallel matrix-vector multiplication Appendx A Parallel matrx-vector multplcaton The reduced transton matrx of the three-dmensonal cage model for gel electrophoress, descrbed n secton 3.2, becomes excessvely large for polymer lengths more

More information

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Proceedngs of the Wnter Smulaton Conference M E Kuhl, N M Steger, F B Armstrong, and J A Jones, eds A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Mark W Brantley Chun-Hung

More information

Constructing Minimum Connected Dominating Set: Algorithmic approach

Constructing Minimum Connected Dominating Set: Algorithmic approach Constructng Mnmum Connected Domnatng Set: Algorthmc approach G.N. Puroht and Usha Sharma Centre for Mathematcal Scences, Banasthal Unversty, Rajasthan 304022 usha.sharma94@yahoo.com Abstract: Connected

More information

Hybrid Non-Blind Color Image Watermarking

Hybrid Non-Blind Color Image Watermarking Hybrd Non-Blnd Color Image Watermarkng Ms C.N.Sujatha 1, Dr. P. Satyanarayana 2 1 Assocate Professor, Dept. of ECE, SNIST, Yamnampet, Ghatkesar Hyderabad-501301, Telangana 2 Professor, Dept. of ECE, AITS,

More information

Optimal Workload-based Weighted Wavelet Synopses

Optimal Workload-based Weighted Wavelet Synopses Optmal Workload-based Weghted Wavelet Synopses Yoss Matas School of Computer Scence Tel Avv Unversty Tel Avv 69978, Israel matas@tau.ac.l Danel Urel School of Computer Scence Tel Avv Unversty Tel Avv 69978,

More information

Scheduling Remote Access to Scientific Instruments in Cyberinfrastructure for Education and Research

Scheduling Remote Access to Scientific Instruments in Cyberinfrastructure for Education and Research Schedulng Remote Access to Scentfc Instruments n Cybernfrastructure for Educaton and Research Je Yn 1, Junwe Cao 2,3,*, Yuexuan Wang 4, Lanchen Lu 1,3 and Cheng Wu 1,3 1 Natonal CIMS Engneerng and Research

More information

Analysis of Collaborative Distributed Admission Control in x Networks

Analysis of Collaborative Distributed Admission Control in x Networks 1 Analyss of Collaboratve Dstrbuted Admsson Control n 82.11x Networks Thnh Nguyen, Member, IEEE, Ken Nguyen, Member, IEEE, Lnha He, Member, IEEE, Abstract Wth the recent surge of wreless home networks,

More information

Concurrent models of computation for embedded software

Concurrent models of computation for embedded software Concurrent models of computaton for embedded software and hardware! Researcher overvew what t looks lke semantcs what t means and how t relates desgnng an actor language actor propertes and how to represent

More information

Backpropagation: In Search of Performance Parameters

Backpropagation: In Search of Performance Parameters Bacpropagaton: In Search of Performance Parameters ANIL KUMAR ENUMULAPALLY, LINGGUO BU, and KHOSROW KAIKHAH, Ph.D. Computer Scence Department Texas State Unversty-San Marcos San Marcos, TX-78666 USA ae049@txstate.edu,

More information

SCALABLE AND VISUALIZATION-ORIENTED CLUSTERING FOR EXPLORATORY SPATIAL ANALYSIS

SCALABLE AND VISUALIZATION-ORIENTED CLUSTERING FOR EXPLORATORY SPATIAL ANALYSIS SCALABLE AND VISUALIZATION-ORIENTED CLUSTERING FOR EXPLORATORY SPATIAL ANALYSIS J.H.Guan, F.B.Zhu, F.L.Ban a School of Computer, Spatal Informaton & Dgtal Engneerng Center, Wuhan Unversty, Wuhan, 430079,

More information

An Image Fusion Approach Based on Segmentation Region

An Image Fusion Approach Based on Segmentation Region Rong Wang, L-Qun Gao, Shu Yang, Yu-Hua Cha, and Yan-Chun Lu An Image Fuson Approach Based On Segmentaton Regon An Image Fuson Approach Based on Segmentaton Regon Rong Wang, L-Qun Gao, Shu Yang 3, Yu-Hua

More information

CE 221 Data Structures and Algorithms

CE 221 Data Structures and Algorithms CE 1 ata Structures and Algorthms Chapter 4: Trees BST Text: Read Wess, 4.3 Izmr Unversty of Economcs 1 The Search Tree AT Bnary Search Trees An mportant applcaton of bnary trees s n searchng. Let us assume

More information

Array transposition in CUDA shared memory

Array transposition in CUDA shared memory Array transposton n CUDA shared memory Mke Gles February 19, 2014 Abstract Ths short note s nspred by some code wrtten by Jeremy Appleyard for the transposton of data through shared memory. I had some

More information

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009.

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009. Farrukh Jabeen Algorthms 51 Assgnment #2 Due Date: June 15, 29. Assgnment # 2 Chapter 3 Dscrete Fourer Transforms Implement the FFT for the DFT. Descrbed n sectons 3.1 and 3.2. Delverables: 1. Concse descrpton

More information

arxiv: v3 [cs.ds] 7 Feb 2017

arxiv: v3 [cs.ds] 7 Feb 2017 : A Two-stage Sketch for Data Streams Tong Yang 1, Lngtong Lu 2, Ybo Yan 1, Muhammad Shahzad 3, Yulong Shen 2 Xaomng L 1, Bn Cu 1, Gaogang Xe 4 1 Pekng Unversty, Chna. 2 Xdan Unversty, Chna. 3 North Carolna

More information

SAO: A Stream Index for Answering Linear Optimization Queries

SAO: A Stream Index for Answering Linear Optimization Queries SAO: A Stream Index for Answerng near Optmzaton Queres Gang uo Kun-ung Wu Phlp S. Yu IBM T.J. Watson Research Center {luog, klwu, psyu}@us.bm.com Abstract near optmzaton queres retreve the top-k tuples

More information

Simulation: Solving Dynamic Models ABE 5646 Week 11 Chapter 2, Spring 2010

Simulation: Solving Dynamic Models ABE 5646 Week 11 Chapter 2, Spring 2010 Smulaton: Solvng Dynamc Models ABE 5646 Week Chapter 2, Sprng 200 Week Descrpton Readng Materal Mar 5- Mar 9 Evaluatng [Crop] Models Comparng a model wth data - Graphcal, errors - Measures of agreement

More information

AADL : about scheduling analysis

AADL : about scheduling analysis AADL : about schedulng analyss Schedulng analyss, what s t? Embedded real-tme crtcal systems have temporal constrants to meet (e.g. deadlne). Many systems are bult wth operatng systems provdng multtaskng

More information

Parameter estimation for incomplete bivariate longitudinal data in clinical trials

Parameter estimation for incomplete bivariate longitudinal data in clinical trials Parameter estmaton for ncomplete bvarate longtudnal data n clncal trals Naum M. Khutoryansky Novo Nordsk Pharmaceutcals, Inc., Prnceton, NJ ABSTRACT Bvarate models are useful when analyzng longtudnal data

More information