METHODS FOR BATCH PROCESSING OF DATA MINING QUERIES
|
|
- Piers Woods
- 5 years ago
- Views:
Transcription
1 ETHOS FOR TH PROESSING OF T INING QUERIES arek Wojcechowsk and acej Zakrzewcz Insttute of omputng Scence Poznan Unversty of Technology ul. Potrowo 3a Poznan, Poland bstract: ey words: ata mnng s a useful decson support technque, whch can be used to fnd trends and regulartes n warehouses of corporate data. serous problem of ts practcal applcatons s long processng tme requred by data mnng algorthms. urrent systems consume mnutes or hours to answer sngle requests, whle typcally batches of the requests are delvered the systems. In ths paper we present the problem of batch processng of data mnng requests. We ntroduce methods that analyze smlartes between separate requests to reduce the processng. We also perform a comparatve performance analyss of the proposed methods. data mnng, multple query optmzaton. INTROUTION ata mnng, also referred to as database mnng or knowledge dscovery n databases (), ams at dscovery of useful patterns from large databases or warehouses [][][4][6][0][][]. urrently we are observng the evoluton of data mnng envronments from specalzed tools to mult-purpose data mnng systems offerng some level of ntegraton wth exstng database management systems. From a user s pont of vew data mnng can be seen as advanced queryng: a user specfes the source data set and the requested class of patterns, the system chooses the rght data mnng algorthm and returns dscovered patterns to the user [3][5][7][8][9]. The
2 arek Wojcechowsk and acej Zakrzewcz most serous problem concernng data mnng queres s a long response tme. urrent systems consume mnutes or hours to answer sngle queres. ata mnng applcatons typcally execute data mnng queres durng nghts, when system actvty s low. Sets of data mnng queres are scheduled and then automatcally evaluated by a data mnng system. It s possble that the data mnng queres delvered to the system are somehow smlar, eg. ther source data sets overlap. Unfortunately, none of the proposed data mnng algorthms tred to employ such smlarty of data mnng requests to reduce ther processng. In ths paper we present the problem of batch processng of data mnng queres. We descrbe and analyze three methods of executng batches of data mnng queres n a more effcent way. We llustrate our methods wth many examples expressed n nesq, whch s a declaratve, mult-purpose SQlke language for nteractve and teratve data mnng n relatonal databases, developed by us over the last couple of years [8][9].. asc efntons Frequent temsets. et {l, l,..., l m } be a set of lterals, called tems. et a non-empty set of tems T be called an temset. et be a set of varable length temsets, where each temset T. We say that an temset T supports an tem x f x s n T. We say that an temset T supports an temset X f T supports every tem n the set X. The support of the temset X s the percentage of T n that support X. The problem of mnng frequent temsets n conssts n dscoverng all temsets whose support s above a user-defned support threshold. pror algorthm. pror s an example of a level-wse algorthm for assocaton dscovery. It makes multple passes over the nput data to determne all frequent temsets. et k denote the set of frequent temsets of sze k and let k denote the set of canddate temsets of sze k. efore makng the k-th pass, pror generates k usng k-. Its canddate generaton process ensures that all subsets of sze k- of k are all members of the set k-. In the k-th pass, t then counts the support for all the temsets n k. t the end of the pass all temsets n k wth a support greater than or equal to the mnmum support form the set of frequent temsets k. Fgure provdes the pseudocode for the general level-wse algorthm, and ts pror mplementaton. The subset(t, k) functon gves all the subsets of sze k n the set t. Ths method of prunng the k set usng k- results n a much more effcent support countng phase for pror when compared to the earler algorthms. In addton, the usage of a hash-tree data structure for storng the canddates provdes a very effcent support-countng process.
3 ethods for atch Processng of ata nng Queres 3 {all -temsets from } for (k; k ; k) count( k, ); k {c k c.count mnsup}; k generate_canddates( k ); nswer U k k ; {frequent -temsets} for (k ; k- ; k) k generate_canddates( k- ); forall tuples t t k subset(t, k); forall canddates c t c.count; k {c k c.count mnsup} nswer U k k ; Fgure -. evel-wse algorthm for assocaton dscovery and ts pror mplementaton. nesq ata nng Query anguage nesq s a SQ language extenson we presented n [9] as a tool to formulate data mnng queres. The man nesq statement s INE, desgned to dscover frequent patterns from a result of a SEET query. The dscovered patterns may be fltered by means of user-defned condtons. We also ntroduced new datatypes to allow to store temsets n database relatons: SET OF HR, SET OF INTEGER, etc., the SET() groupng functon, as well as the ONTINS operator used to determne f one set of tems contans another set of tems. In [8][3] we extended nesq wth data mnng materalzed vews and sequental pattern processng operators. The followng example statements llustrate nesq capabltes to create a database relaton to hold sets of ntegers and to dscover all frequent temsets wth support greater than 0 n the frst 00 tuples of the relaton. create table mysets ( nteger, s set of nteger) mne temset from (select s from mysets where <00) where support(temset) > 0 The next example llustrates nesq capabltes to store results of a data mnng query: create table mypatterns (s set of nteger) nsert nto mypatterns mne temset from (select s from mysets where <00) where support(temset) > 0. PREIINRIES N PROE STTEENT ata mnng query. data mnng query s a tuple Q (R, a, Σ, Φ), where R s a relaton, a s an attrbute of R, Σ s a condton nvolvng the attrbutes of the relaton R, Φ s a condton nvolvng dscovered patterns.
4 4 arek Wojcechowsk and acej Zakrzewcz The result of the data mnng query s a set of patterns dscovered n π a σ Σ and satsfyng Φ. Example. Gven the relaton R shown n Fg. a, the result of the data mnng query Q (R, set, d>5 N d<0, mnsup 3 ) s shown n Fg. b. mne temset from (select tems from R where d>5 and d<0) where support(temset)>3; R : d set a,b,c 4 a,c 6 d,f,g 7 f,g,k,m 8 e,f,g 5 a,f Fgure -a Example relaton R result of Q : {f} {g} {f,g} Fgure -b Q query result Problem statement. Gven a set S {Q, Q,, Q n } of data mnng queres, where Q (R, a, Σ, Φ ) and j σ Σ (R ) σ Σj (R j ), the goal s to mnmze the I/O and the PU of executng S.. otvatng example onsder a relaton Sales(uad, basket, tme) to store purchases made by users of an nternet shop. Snce data sets of ths knd tend to be very large, there s a need for automated analyss of ther contents. ssume a shop manager s nterested n fndng sets of products that were frequently cooccurrng n the users purchases. The shop manager plans to create two reports: one showng the frequent sets that appeared n more than 350 purchases n Jan 00 and one showng the frequent sets that appeared n more than 0 purchases made by clents from France. Two requred data mnng queres are shown below. Q mne temset from (select basket from sales where tme between and ) where support(temset) > 350 Q mne temset from (select basket from sales where uad lke %.fr ) where support(temset) > 0 If the sze of the Sales relaton s very large, each of the above data mnng queres can take a sgnfcant amount of tme to execute. Part of ths tme wll be spent on readng the Sales relaton from dsk n order to count occurrences of canddate temsets. Notce that the sets of bloks to be read by the two data mnng queres may overlap. If we try to merge the processng of the two data mnng queres, we can reduce redundancy resultng from ths overlappng. In the remanng of ths paper we wll use ths example to llustrate partcular methods.
5 ethods for atch Processng of ata nng Queres 5 3. OE OF EVE-WISE SSOITION ISOVERY GORITH In order to descrbe methods for batch processng of data mnng queres, we frst need to ntroduce a notaton to express steps of a level-wse assocaton dscovery algorthm. We decded to use the extended relatonal algebra to model the level-wse algorthm processng n the followng way. Each canddate countng step s represented as a relatonal jon, followed by groupng and selecton operatons. Fgure 3 shows the SQ query and the relatonal algebra graph for the canddate countng step; (s) s the canddates relaton, R(s) s the database relaton. The canddate generaton step s represented as a smple relatonal jon. Fgure 4 shows the SQ query and the relatonal algebra graph for ths case. select c.s, count(r.s) from c, r where r.s contans c.s group by c.s havng count(r.s)>mnsup σ OUNT(R.s) mnsup γ.s, OUNT(R.s).s R.s Fgure -3. anddate countng-prunng step modeled wth relatonal algebra select unon(l.s, l.s) as cand from l l, l l where sze(dfference(l.s,l.s)) group by cand havng count(*) k*(k-)/ π.s.s R σ OUNT(*) k(k-)/ γ.s.s, OUNT(*).s -.s Fgure -4. anddate generaton step for k modeled wth relatonal algebra In order to analyze the general model of the level-wse assocaton dscovery algorthm, we make the followng assumptons: () the sze of the database s much larger than the sze of all canddate temsets, () the sze of all canddate temsets s larger than the memory sze, and (3) frequent temsets ft n memory. The notaton we use s gven n Table.
6 6 arek Wojcechowsk and acej Zakrzewcz Table. Notaton used n models man memory sze (blocks) number of temsets n the database sze of the database (blocks) number of canddate temsets for step I sze of all canddate temsets for step (blocks), <<, < number of frequent temsets for step, < sze of all frequent temsets for step (blocks), < The of performng the general level-wse assocaton dscovery algorthm s as follows:. anddate countng-prunng. anddate temsets must be read from dsk n portons equal to the avalable memory sze. For each porton, the database must be scanned to jon temsets from wth temsets from. Next, the canddate temsets wth support greater or equal to mnsup become frequent temsets and must be wrtten to dsk. The I/O of a sngle teraton s the followng: I / O The domnant part of the PU s jon condton verfcaton. For the smplcty, we assume the of comparng two temsets does not depend on ther szes and equals. Thus, the PU of a sngle teraton s the followng: PU. anddate generaton. Frequent temsets from the prevous teraton must be read from dsk, joned n memory, and saved as new canddate temsets. The I/O of a sngle teraton s the followng: I / O The PU of ths phase of the algorthm s the followng: PU Therefore, f s the number of teratons, the overall of the levelwse algorthm s as follows: I / O PU ( )
7 ethods for atch Processng of ata nng Queres 7 4. ETHOS FOR TH PROESSING OF T INING QUERIES In ths Secton we present three methods for processng batches of data mnng queres. The frst one represents a trval approach, where we execute each Q separately. We call ths method Sequental Processng. The second method, called ommon ountng, ntegrates the countng phase of the level-wse algorthm to reduce I/O. The thrd method, called ne erge, splts Qs nto a new set of dsjont Qs. Ther results are used to answer the orgnal queres. 4. Sequental Processng In the Sequental Processng method, each Q s executed separately. We do not try to beneft from usng common dsk blocks by two separate data mnng queres. Fgure 5 gves the model and pseudocode for ths method ( means generated for Q, etc.). The of ths method s equal to the sum of ndependent executon of each of the queres: I / O PU 4. ommon ountng When two or more dfferent Qs count ther canddate temsets n the same part of the database, the common part of ther countng steps s ntegrated and requres only one scan of the nvolved part of the database. model of a sngle step of the ommon ountng algorthm and ts procedural mplementaton are shown n Fg 6. Example. Usng the orgnal database selecton condtons, we construct three separate dataset defntons:. select basket from sales where tme between and and NOT uad lke %.fr. select basket from sales where tme between and and uad lke %.fr
8 8 arek Wojcechowsk and acej Zakrzewcz π.s.s σ OUNT(*) k(k-)/ γ.s.s, OUNT(*).s -.s π.s.s σ OUNT(*) k(k-)/ γ.s.s, OUNT(*).s -.s {all -temsets from } for (k; k k ; k) count( k, ); k {c k c.count mnsup }; k generate_canddates( k ); nswer U k k ; {all -temsets from } for (k; k ; k) count( k, ); k {c k c.count mnsup }; k generate_canddates( k ); nswer U k k ; π.s π.s σ OUNT(.s) mnsup σ OUNT(.s) mnsup γ.s, OUNT(.s) γ.s, OUNT(.s).s.s.s.s Fgure -5 odel of the Sequental Processng method π.s.s.s -.s π.s σ OUNT(.s) mnsup π.s.s.s -.s π.s σ OUNT(.s) mnsup {all -temsets from } {all -temsets from } for (k; k k ; k) f k count( k, - ); f k count( k, - ); count( k k, ); k {c k c.count mnsup }; k {c k c.count mnsup }; k generate_canddates( k ); k generate_canddates( k ); nswer U k k ; nswer U k k ; π.s,.ount(.s).ount(.s) π.s,.ount(.s).ount(.s).s.s.s.s γ.s, OUNT(.s) γ.s, OUNT(.s) γ.s, OUNT(.s).s.s.s.s.s.s - - Fgure -6. odel of the ommon ountng method
9 ethods for atch Processng of ata nng Queres 9 3. select basket from sales where NOT tme between and and uad lke %.fr Next, we scan the frst query s result n order to count Q canddate temsets, then we scan the second query s result n order to count both Q and Q canddate temsets, fnally we scan the thrd query s result n order to count Q canddate temsets. Notce that none of the database blocks nedeed to be read twce, f the canddate temsets ft n memory. et us analyze the of ths method. anddate temsets of Q must be read, joned wth -, counted, and saved to dsk. lso, canddate temsets of Q must be read, joned wth -, counted, and saved to dsk. Next, all canddates of Q and Q must be read, joned wth, counted, and saved to dsk. The canddate temsets wth support greater or equal to, respectvely, mnsup or mnsup, become frequent temsets and are wrtten to dsk. In order to generate new canddate temsets, all frequent temsets must be read from dsk and new canddate temsets must be wrtten to dsk. Therefore, the I/O of ths method s the followng: 3 3 max(, ) I / O Smlarly, the PU s as follows: max(, ) PU ( ) ) 4.3 ne erge Ths method employs the property that an temset whch s frequent n a whole data set, must also be frequent n at least one porton of t [4,3]. In the ne erge method, each par of overlappng Qs s dvded nto three separate Qs. Next, the new Qs are executed sequentally. The results of the new Qs are canddates to determne the results of the orgnal Qs. Therefore, an addtonal countng step s needed to fnally answer the orgnal Qs. The pseudocode of the method and a model of the addtonal step are gven n Fg. 7.
10 0 arek Wojcechowsk and acej Zakrzewcz U - U σ OUNT(.s) mnsup γ.s, OUNT(.s).s.s σ OUNT(.s) mnsup - {all -temsets from - } for (k; - k ; k) count( - k, - ); γ.s, OUNT(.s) - k {c - k c.count mnsup }; - k generate_canddates( - k ); nswer - U k - k ;.s.s U - U - {all -temsets from - } for (k; k - ; k) count( k -, ); k - {c k - c.count mnsup }; k - generate_canddates( k - ); nswer - U k k - ; {all -temsets from } for (k; k ; k) count( k, ); k {c k c.count mn(mnsup, mnsup )}; k generate_canddates( k ); nswer U k k ; count(nswer - nswer, ); nswer {c nswer - nswer c.count mnsup ); count(nswer - nswer, ); nswer {c nswer - nswer c.count mnsup ); Fgure 7. odel of the ne erge method Example. Usng the orgnal database selecton condtons, we construct three new data mnng queres. ssume the ntermedate results are wrtten to the relaton Intermedate(label,temset). Q: nsert nto ntermedate mne Q, temset from ( select basket from sales where tme between and and NOT uad lke %.fr ) where support(temset)>350 Q: nsert nto ntermedate mne Q, temset from (select basket from sales where tme between and and uad lke %.fr ) where support(temset)>0 Q3: nsert nto ntermedate mne Q3, temset from (select basket from sales where NOT tme between and and uad lke %.fr ) where support(temset)>0
11 ethods for atch Processng of ata nng Queres The above queres dscover frequent temsets n the three parttons of the orgnal data sets. In the next step, we have to merge the parttons and verfy the temsets fnal supports:. select temset from (select dstnct temset from ntermedate), sales s where label n ( Q, Q ) and s.temset contans.temset group by.temset havng count(*)>350;. select temset from (select dstnct temset from ntermedate), sales s where label n ( Q, Q3 ) and s.temset contans.temset group by.temset havng count(*)>0; The temsets selected by the frst Select query form the result of Q, and the temsets selected by the second Select query form the result of Q. et us analyze the of ths method. The I/O of executng the three new data mnng queres s the followng: O I / The I/O of verfyng the dscovered temsets supports s the of performng the jon operaton: ( ) ( ) O I U U / The PU of the complete method s the followng: PU ) ( ) ( U U
12 arek Wojcechowsk and acej Zakrzewcz 5. ONUSIONS In ths paper we have presented the problem of effcent executng batches of data mnng queres. We have bult a relatonal algebra model for a level-wse assocaton dscovery algorthm and we used ths model to descrbe our methods of executng batched data mnng queres. For the three descrbed methods, we analyzed ther performance n terms of I/O and PU. REFERENES. grawal R., Imelnsk T., Swam.: nng ssocaton Rules etween Sets of Items n arge atabases. Proc. of the 993 SIGO onf. on anagement of ata (993). grawal R., Srkant R.: Fast lgorthms for nng ssocaton Rules. Proc. of the 0th Int l onf. on Very arge ata ases (994) 3. er S., eo R., Psala G.: New SQ-lke Operator for nng ssocaton Rules. Proc. of the nd Int l onference on Very arge ata ases (996) 4. heung.w., Han J., Ng V., Wong.Y.: antenance of scovered ssocaton Rules n arge atabases: n Incremental Updatng Technque. Proc. of the th IE (996) 5. Han J., Fu Y., Wang W., hang J., Gong W., opersk.,., u Y., Rajan., Stefanovc N., Xa., Zaane O.R.: ner: System for nng nowledge n arge Relatonal atabases. Proc. of the nd onference (996) 6. Imelnsk T., annla H.: atabase Perspectve on nowledge scovery. ommuncatons of the, Vol. 39, No. (996) 7. Imelnsk T., Vrman., bdulghan.: atamne: pplcaton programmng nterface and query language for data mnng. Proc. of the nd onference (996) 8. orzy T., Wojcechowsk., Zakrzewcz.: ata nng Support n atabase anagement Systems. Proc. of the nd awa onference (000) 9. orzy T., Zakrzewcz.: SQ-lke anguage for atabase nng. IS 97 Symposum (997) 0. Nag., eshpande P.., ewtt.j.: Usng a nowledge ache for Interactve scovery of ssocaton Rules. Proc. of the 5th onference (999).Thomas S., odagala S., lsabt., Ranka S.: n Effcent lgorthm for the Incremental Updaton of ssocaton Rules n arge atabases. Proc. of the 3rd onference (997).Tovonen H.: Samplng arge atabases for ssocaton Rules. Proc. of the nd Int l onference on Very arge ata ases (996) 3.Wojcechowsk., Zakrzewcz.: Itemset ateralzng for Fast nng of ssocaton Rules. Proc. of the nd IS onference (998)
Concurrent Apriori Data Mining Algorithms
Concurrent Apror Data Mnng Algorthms Vassl Halatchev Department of Electrcal Engneerng and Computer Scence York Unversty, Toronto October 8, 2015 Outlne Why t s mportant Introducton to Assocaton Rule Mnng
More informationA 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 informationParallel and Distributed Association Rule Mining - Dr. Giuseppe Di Fatta. San Vigilio,
Parallel and Dstrbuted Assocaton Rule Mnng - Dr. Guseppe D Fatta fatta@nf.un-konstanz.de San Vglo, 18-09-2004 1 Overvew Assocaton Rule Mnng (ARM) Apror algorthm Hgh Performance Parallel and Dstrbuted Computng
More informationCompiler 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 informationProgramming in Fortran 90 : 2017/2018
Programmng n Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Exercse 1 : Evaluaton of functon dependng on nput Wrte a program who evaluate the functon f (x,y) for any two user specfed values
More informationParallelism 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 informationAn 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 informationToday s Outline. Sorting: The Big Picture. Why Sort? Selection Sort: Idea. Insertion Sort: Idea. Sorting Chapter 7 in Weiss.
Today s Outlne Sortng Chapter 7 n Wess CSE 26 Data Structures Ruth Anderson Announcements Wrtten Homework #6 due Frday 2/26 at the begnnng of lecture Proect Code due Mon March 1 by 11pm Today s Topcs:
More informationCMPS 10 Introduction to Computer Science Lecture Notes
CPS 0 Introducton to Computer Scence Lecture Notes Chapter : Algorthm Desgn How should we present algorthms? Natural languages lke Englsh, Spansh, or French whch are rch n nterpretaton and meanng are not
More informationThe Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique
//00 :0 AM Outlne and Readng The Greedy Method The Greedy Method Technque (secton.) Fractonal Knapsack Problem (secton..) Task Schedulng (secton..) Mnmum Spannng Trees (secton.) Change Money Problem Greedy
More informationAssignment # 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 informationAnalysis 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 informationSum 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 informationThe Codesign Challenge
ECE 4530 Codesgn Challenge Fall 2007 Hardware/Software Codesgn The Codesgn Challenge Objectves In the codesgn challenge, your task s to accelerate a gven software reference mplementaton as fast as possble.
More informationCluster 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 informationMathematics 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 informationMachine Learning. Topic 6: Clustering
Machne Learnng Topc 6: lusterng lusterng Groupng data nto (hopefully useful) sets. Thngs on the left Thngs on the rght Applcatons of lusterng Hypothess Generaton lusters mght suggest natural groups. Hypothess
More informationKent State University CS 4/ Design and Analysis of Algorithms. Dept. of Math & Computer Science LECT-16. Dynamic Programming
CS 4/560 Desgn and Analyss of Algorthms Kent State Unversty Dept. of Math & Computer Scence LECT-6 Dynamc Programmng 2 Dynamc Programmng Dynamc Programmng, lke the dvde-and-conquer method, solves problems
More informationCourse 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 informationProblem Set 3 Solutions
Introducton to Algorthms October 4, 2002 Massachusetts Insttute of Technology 6046J/18410J Professors Erk Demane and Shaf Goldwasser Handout 14 Problem Set 3 Solutons (Exercses were not to be turned n,
More informationCSCI 104 Sorting Algorithms. Mark Redekopp David Kempe
CSCI 104 Sortng Algorthms Mark Redekopp Davd Kempe Algorthm Effcency SORTING 2 Sortng If we have an unordered lst, sequental search becomes our only choce If we wll perform a lot of searches t may be benefcal
More informationTF 2 P-growth: An Efficient Algorithm for Mining Frequent Patterns without any Thresholds
TF 2 P-growth: An Effcent Algorthm for Mnng Frequent Patterns wthout any Thresholds Yu HIRATE, Ego IWAHASHI, and Hayato YAMANA Graduate School of Scence and Engneerng, Waseda Unversty {hrate, ego, yamana}@yama.nfo.waseda.ac.jp
More informationLearning 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 informationAn 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 informationHierarchical 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 informationSupport 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 informationRelated-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 informationFor instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1)
Secton 1.2 Subsets and the Boolean operatons on sets If every element of the set A s an element of the set B, we say that A s a subset of B, or that A s contaned n B, or that B contans A, and we wrte A
More informationA 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 informationOracle 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 informationModule 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 informationARTICLE IN PRESS. Signal Processing: Image Communication
Sgnal Processng: Image Communcaton 23 (2008) 754 768 Contents lsts avalable at ScenceDrect Sgnal Processng: Image Communcaton journal homepage: www.elsever.com/locate/mage Dstrbuted meda rate allocaton
More informationActive Contours/Snakes
Actve Contours/Snakes Erkut Erdem Acknowledgement: The sldes are adapted from the sldes prepared by K. Grauman of Unversty of Texas at Austn Fttng: Edges vs. boundares Edges useful sgnal to ndcate occludng
More informationA Combined Approach for Mining Fuzzy Frequent Itemset
A Combned Approach for Mnng Fuzzy Frequent Itemset R. Prabamaneswar Department of Computer Scence Govndammal Adtanar College for Women Truchendur 628 215 ABSTRACT Frequent Itemset Mnng s an mportant approach
More informationCan We Beat the Prefix Filtering? An Adaptive Framework for Similarity Join and Search
Can We Beat the Prefx Flterng? An Adaptve Framework for Smlarty Jon and Search Jannan Wang Guolang L Janhua Feng Department of Computer Scence and Technology, Tsnghua Natonal Laboratory for Informaton
More informationLecture 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 informationRun-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 informationArray 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 informationDiscovering Relational Patterns across Multiple Databases
Dscoverng Relatonal Patterns across Multple Databases Xngquan Zhu, 3 and Xndong Wu Dept. of Computer Scence & Eng., Florda Atlantc Unversty, Boca Raton, FL 3343, USA Dept. of Computer Scence, Unversty
More informationSmoothing Spline ANOVA for variable screening
Smoothng Splne ANOVA for varable screenng a useful tool for metamodels tranng and mult-objectve optmzaton L. Rcco, E. Rgon, A. Turco Outlne RSM Introducton Possble couplng Test case MOO MOO wth Game Theory
More informationBrave New World Pseudocode Reference
Brave New World Pseudocode Reference Pseudocode s a way to descrbe how to accomplsh tasks usng basc steps lke those a computer mght perform. In ths week s lab, you'll see how a form of pseudocode can be
More informationA Heuristic for Mining Association Rules In Polynomial Time*
Complete reference nformaton: Ylmaz, E., E. Trantaphyllou, J. Chen, and T.W. Lao, (3), A Heurstc for Mnng Assocaton Rules In Polynomal Tme, Computer and Mathematcal Modellng, No. 37, pp. 9-33. A Heurstc
More informationFuzzy Weighted Association Rule Mining with Weighted Support and Confidence Framework
Fuzzy Weghted Assocaton Rule Mnng wth Weghted Support and Confdence Framework M. Sulaman Khan, Maybn Muyeba, Frans Coenen 2 Lverpool Hope Unversty, School of Computng, Lverpool, UK 2 The Unversty of Lverpool,
More informationA New Approach For the Ranking of Fuzzy Sets With Different Heights
New pproach For the ankng of Fuzzy Sets Wth Dfferent Heghts Pushpnder Sngh School of Mathematcs Computer pplcatons Thapar Unversty, Patala-7 00 Inda pushpndersnl@gmalcom STCT ankng of fuzzy sets plays
More information3D vector computer graphics
3D vector computer graphcs Paolo Varagnolo: freelance engneer Padova Aprl 2016 Prvate Practce ----------------------------------- 1. Introducton Vector 3D model representaton n computer graphcs requres
More informationSecurity Enhanced Dynamic ID based Remote User Authentication Scheme for Multi-Server Environments
Internatonal Journal of u- and e- ervce, cence and Technology Vol8, o 7 0), pp7-6 http://dxdoorg/07/unesst087 ecurty Enhanced Dynamc ID based Remote ser Authentcaton cheme for ult-erver Envronments Jun-ub
More informationA Heuristic for Mining Association Rules In Polynomial Time
A Heurstc for Mnng Assocaton Rules In Polynomal Tme E. YILMAZ General Electrc Card Servces, Inc. A unt of General Electrc Captal Corporaton 6 Summer Street, MS -39C, Stamford, CT, 697, U.S.A. egemen.ylmaz@gecaptal.com
More information6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour
6.854 Advanced Algorthms Petar Maymounkov Problem Set 11 (November 23, 2005) Wth: Benjamn Rossman, Oren Wemann, and Pouya Kheradpour Problem 1. We reduce vertex cover to MAX-SAT wth weghts, such that the
More informationAn Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices
Internatonal Mathematcal Forum, Vol 7, 2012, no 52, 2549-2554 An Applcaton of the Dulmage-Mendelsohn Decomposton to Sparse Null Space Bases of Full Row Rank Matrces Mostafa Khorramzadeh Department of Mathematcal
More informationCE 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 informationA Clustering Algorithm for Chinese Adjectives and Nouns 1
Clusterng lgorthm for Chnese dectves and ouns Yang Wen, Chunfa Yuan, Changnng Huang 2 State Key aboratory of Intellgent Technology and System Deptartment of Computer Scence & Technology, Tsnghua Unversty,
More informationOn Correctness of Nonserializable Executions
Journal of Computer and System Scences 56, 688 (1998) Artcle No. SS971536 On Correctness of Nonseralzable Executons Rajeev Rastog,* Sharad Mehrotra, - Yur Bretbart, [,1 Henry F. Korth,* and Av Slberschatz*
More informationSome material adapted from Mohamed Younis, UMBC CMSC 611 Spr 2003 course slides Some material adapted from Hennessy & Patterson / 2003 Elsevier
Some materal adapted from Mohamed Youns, UMBC CMSC 611 Spr 2003 course sldes Some materal adapted from Hennessy & Patterson / 2003 Elsever Scence Performance = 1 Executon tme Speedup = Performance (B)
More informationAn 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 informationOutline. Type of Machine Learning. Examples of Application. Unsupervised Learning
Outlne Artfcal Intellgence and ts applcatons Lecture 8 Unsupervsed Learnng Professor Danel Yeung danyeung@eee.org Dr. Patrck Chan patrckchan@eee.org South Chna Unversty of Technology, Chna Introducton
More informationHermite Splines in Lie Groups as Products of Geodesics
Hermte Splnes n Le Groups as Products of Geodescs Ethan Eade Updated May 28, 2017 1 Introducton 1.1 Goal Ths document defnes a curve n the Le group G parametrzed by tme and by structural parameters n the
More informationOptimal 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 informationLS-TaSC Version 2.1. Willem Roux Livermore Software Technology Corporation, Livermore, CA, USA. Abstract
12 th Internatonal LS-DYNA Users Conference Optmzaton(1) LS-TaSC Verson 2.1 Wllem Roux Lvermore Software Technology Corporaton, Lvermore, CA, USA Abstract Ths paper gves an overvew of LS-TaSC verson 2.1,
More informationCS 534: Computer Vision Model Fitting
CS 534: Computer Vson Model Fttng Sprng 004 Ahmed Elgammal Dept of Computer Scence CS 534 Model Fttng - 1 Outlnes Model fttng s mportant Least-squares fttng Maxmum lkelhood estmaton MAP estmaton Robust
More informationSorting: The Big Picture. The steps of QuickSort. QuickSort Example. QuickSort Example. QuickSort Example. Recursive Quicksort
Sortng: The Bg Pcture Gven n comparable elements n an array, sort them n an ncreasng (or decreasng) order. Smple algorthms: O(n ) Inserton sort Selecton sort Bubble sort Shell sort Fancer algorthms: O(n
More informationInsertion Sort. Divide and Conquer Sorting. Divide and Conquer. Mergesort. Mergesort Example. Auxiliary Array
Inserton Sort Dvde and Conquer Sortng CSE 6 Data Structures Lecture 18 What f frst k elements of array are already sorted? 4, 7, 1, 5, 1, 16 We can shft the tal of the sorted elements lst down and then
More informationsuch that is accepted of states in , where Finite Automata Lecture 2-1: Regular Languages be an FA. A string is the transition function,
* Lecture - Regular Languages S Lecture - Fnte Automata where A fnte automaton s a -tuple s a fnte set called the states s a fnte set called the alphabet s the transton functon s the ntal state s the set
More informationOn 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 informationSubspace 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 informationSequential 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 informationA Fuzzy Image Matching Algorithm with Linguistic Spatial Queries
Fuzzy Matchng lgorthm wth Lngustc Spatal Queres TZUNG-PEI HONG, SZU-PO WNG, TIEN-HIN WNG, EEN-HIN HIEN epartment of Electrcal Engneerng, Natonal Unversty of Kaohsung Insttute of Informaton Management,
More informationNAG 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 informationA SYSTOLIC APPROACH TO LOOP PARTITIONING AND MAPPING INTO FIXED SIZE DISTRIBUTED MEMORY ARCHITECTURES
A SYSOLIC APPROACH O LOOP PARIIONING AND MAPPING INO FIXED SIZE DISRIBUED MEMORY ARCHIECURES Ioanns Drosts, Nektaros Kozrs, George Papakonstantnou and Panayots sanakas Natonal echncal Unversty of Athens
More informationCHAPTER 2 DECOMPOSITION OF GRAPHS
CHAPTER DECOMPOSITION OF GRAPHS. INTRODUCTION A graph H s called a Supersubdvson of a graph G f H s obtaned from G by replacng every edge uv of G by a bpartte graph,m (m may vary for each edge by dentfyng
More informationSorting. Sorting. Why Sort? Consistent Ordering
Sortng CSE 6 Data Structures Unt 15 Readng: Sectons.1-. Bubble and Insert sort,.5 Heap sort, Secton..6 Radx sort, Secton.6 Mergesort, Secton. Qucksort, Secton.8 Lower bound Sortng Input an array A of data
More informationTsinghua 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 informationTopology Design using LS-TaSC Version 2 and LS-DYNA
Topology Desgn usng LS-TaSC Verson 2 and LS-DYNA Wllem Roux Lvermore Software Technology Corporaton, Lvermore, CA, USA Abstract Ths paper gves an overvew of LS-TaSC verson 2, a topology optmzaton tool
More informationEnhancement of Infrequent Purchased Product Recommendation Using Data Mining Techniques
Enhancement of Infrequent Purchased Product Recommendaton Usng Data Mnng Technques Noraswalza Abdullah, Yue Xu, Shlomo Geva, and Mark Loo Dscplne of Computer Scence Faculty of Scence and Technology Queensland
More informationNUMERICAL 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 informationMULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION
MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION Paulo Quntlano 1 & Antono Santa-Rosa 1 Federal Polce Department, Brasla, Brazl. E-mals: quntlano.pqs@dpf.gov.br and
More informationON 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 informationDetermining Fuzzy Sets for Quantitative Attributes in Data Mining Problems
Determnng Fuzzy Sets for Quanttatve Attrbutes n Data Mnng Problems ATTILA GYENESEI Turku Centre for Computer Scence (TUCS) Unversty of Turku, Department of Computer Scence Lemmnkäsenkatu 4A, FIN-5 Turku
More informationA 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 informationAssembler. Building a Modern Computer From First Principles.
Assembler Buldng a Modern Computer From Frst Prncples www.nand2tetrs.org Elements of Computng Systems, Nsan & Schocken, MIT Press, www.nand2tetrs.org, Chapter 6: Assembler slde Where we are at: Human Thought
More informationSLAM 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 informationAn 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 informationETAtouch RESTful Webservices
ETAtouch RESTful Webservces Verson 1.1 November 8, 2012 Contents 1 Introducton 3 2 The resource /user/ap 6 2.1 HTTP GET................................... 6 2.2 HTTP POST..................................
More informationLinkSelector: A Web Mining Approach to. Hyperlink Selection for Web Portals
nkselector: A Web Mnng Approach to Hyperlnk Selecton for Web Portals Xao Fang and Olva R. u Sheng Department of Management Informaton Systems Unversty of Arzona, AZ 8572 {xfang,sheng}@bpa.arzona.edu Submtted
More informationA 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 informationLoad Balancing for Hex-Cell Interconnection Network
Int. J. Communcatons, Network and System Scences,,, - Publshed Onlne Aprl n ScRes. http://www.scrp.org/journal/jcns http://dx.do.org/./jcns.. Load Balancng for Hex-Cell Interconnecton Network Saher Manaseer,
More informationSolving two-person zero-sum game by Matlab
Appled Mechancs and Materals Onlne: 2011-02-02 ISSN: 1662-7482, Vols. 50-51, pp 262-265 do:10.4028/www.scentfc.net/amm.50-51.262 2011 Trans Tech Publcatons, Swtzerland Solvng two-person zero-sum game by
More informationComplex 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 informationParallel Numerics. 1 Preconditioning & Iterative Solvers (From 2016)
Technsche Unverstät München WSe 6/7 Insttut für Informatk Prof. Dr. Thomas Huckle Dpl.-Math. Benjamn Uekermann Parallel Numercs Exercse : Prevous Exam Questons Precondtonng & Iteratve Solvers (From 6)
More informationNeeded 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 informationA Simple Methodology for Database Clustering. Hao Tang 12 Guangdong University of Technology, Guangdong, , China
for Database Clusterng Guangdong Unversty of Technology, Guangdong, 0503, Chna E-mal: 6085@qq.com Me Zhang Guangdong Unversty of Technology, Guangdong, 0503, Chna E-mal:64605455@qq.com Database clusterng
More informationCS1100 Introduction to Programming
Factoral (n) Recursve Program fact(n) = n*fact(n-) CS00 Introducton to Programmng Recurson and Sortng Madhu Mutyam Department of Computer Scence and Engneerng Indan Insttute of Technology Madras nt fact
More informationLoop Transformations, Dependences, and Parallelization
Loop Transformatons, Dependences, and Parallelzaton Announcements Mdterm s Frday from 3-4:15 n ths room Today Semester long project Data dependence recap Parallelsm and storage tradeoff Scalar expanson
More informationFuzzy C-Means Initialized by Fixed Threshold Clustering for Improving Image Retrieval
Fuzzy -Means Intalzed by Fxed Threshold lusterng for Improvng Image Retreval NAWARA HANSIRI, SIRIPORN SUPRATID,HOM KIMPAN 3 Faculty of Informaton Technology Rangst Unversty Muang-Ake, Paholyotn Road, Patumtan,
More informationA Facet Generation Procedure. for solving 0/1 integer programs
A Facet Generaton Procedure for solvng 0/ nteger programs by Gyana R. Parja IBM Corporaton, Poughkeepse, NY 260 Radu Gaddov Emery Worldwde Arlnes, Vandala, Oho 45377 and Wlbert E. Wlhelm Teas A&M Unversty,
More informationParallel 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 informationThe Shortest Path of Touring Lines given in the Plane
Send Orders for Reprnts to reprnts@benthamscence.ae 262 The Open Cybernetcs & Systemcs Journal, 2015, 9, 262-267 The Shortest Path of Tourng Lnes gven n the Plane Open Access Ljuan Wang 1,2, Dandan He
More informationAvailable online at Available online at Advanced in Control Engineering and Information Science
Avalable onlne at wwwscencedrectcom Avalable onlne at wwwscencedrectcom Proceda Proceda Engneerng Engneerng 00 (2011) 15000 000 (2011) 1642 1646 Proceda Engneerng wwwelsevercom/locate/proceda Advanced
More informationIntra-Parametric Analysis of a Fuzzy MOLP
Intra-Parametrc Analyss of a Fuzzy MOLP a MIAO-LING WANG a Department of Industral Engneerng and Management a Mnghsn Insttute of Technology and Hsnchu Tawan, ROC b HSIAO-FAN WANG b Insttute of Industral
More informationChapter 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 informationProblem 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