A METHOD FOR FACTOR SCREENING OF SIMULATION EXPERIMENTS BASED ON ASSOCIATION RULE MINING
|
|
- Sibyl Griselda Jacobs
- 5 years ago
- Views:
Transcription
1 A METHOD FOR FACTOR SCREENING OF SIMULATION EXPERIMENTS BASED ON ASSOCIATION RULE MINING Lngyun Lu (a), We L (b), Png Ma (c), Mng Yang (d) Control and Smulaton Center, Harbn Insttute of Technology, Harbn 158, P.R. Chna (a) jyzluht@gmal.com, (b) fran@ht.edu.cn, (c) pngma@ht.edu.cn, (d) myang@ht.edu.cn ABSTRACT Snce complex smulaton models contan a large number of nputs and parameters, t s meanngful to dentfy the most mportant ones for further studes. The tradtonal procedure of factor screenng s to desgn smulaton experment schemes and generate smulaton output data frst. Furthermore, due to rgorous hypothess and fewer levels for each factor, the exstng screenng methods are usually not approprate for complex smulaton. In ths paper, a new method for factor screenng of smulaton experments s proposed. It s based on data mnng technque and exstng smulaton data. The relatonshps between factors and the output are dscovered from the sets of smulaton data usng the assocaton rule mnng algorthm frstly. Then the mportant factors can be dentfed by syntheszng the assocaton rules. Fnally, the proposed method s verfed by the test functon. Keywords: smulaton experments, factor screenng, assocaton rules, quanttatve attrbutes 1. INTRODUCTION Complex smulaton models consst of a large number of nputs and parameters whch are generally referred to as factors n desgn of experments (DOE). DOE s essental for dong certan analyses nclude valdaton, uncertanty analyss, senstvty analyss, optmzaton, etc (Klejnen 28, L 216). However, t s usually prohbtve or mpractcal to do these analyses wth the large number of factors nvolved, especally for computer smulaton models wth hgh computatonal cost. An mportant queston s whch factors are really sgnfcant when there are potentally a large number factors nvolved (Alam 24)? The Pareto prncple or 2-8 rule mples that only a few factors are really mportant (Wrght 21). In order to mprove effcency, t s reasonable to screen a small number of factors before analyzed. Factor screenng s performed to elmnate unmportant factors so that the remanng mportant factors can be more thoroughly studed n later experments, regardless of the applcaton doman of area, ncludng natonal defense, logstcs, ndustry, healthcare, etc (L 216, Bruzzone 214, Padh 213, Rantanen 215). Several types of factor screenng methods have been developed to dentfy mportant factors wth a lmted set of smulaton experments. The most common ones are fractonal factoral, central composte, and Placett Burman desgns (Myers 22). However, these screenng desgns developed for physcal experments are not approprate for smulaton physcal experments. Procedures developed for stochastc smulaton experments nclude Morrs randomzed one-factor-ata-tme desgn (Morrs 1991), frequency doman method (Morrce 1995), edge desgns (Elster 1995), terated fractonal factoral desgns (Campolongo 2) and the Trocne screenng procedure (Trocne 21). Some methods developed for dscrete-event smulaton experments nclude sequental bfurcaton (SB), SB wth nteractons (SB-X), Cheng s method, controlled sequental bfurcaton (CSB), CSB wth nteractons (CSB-X), controlled sequental factoral desgn (CSFD), fractonal factoral controlled sequental bfurcaton (FFCSB), etc (Wan 27, Shen 29). However, the majorty of these methods have many assumptons or lmtatons, such as monotoncty of the functon, the smoothness of the nputs/outputs functon, etc. These methods are effcent and effectve when ther assumptons are satsfed. From the factor screenng methods descrbed above, t can be concluded that these methods easly neglect some mportant factors due to rgorous hypothess and few factor levels. It s possbly unsutable for the complex smulaton models. As s nown to all, the mportance of factors depends on the expermental doman. The effectve way s to select levels as many as possble durng factor screenng whch can represent smulaton model more precsely and mprove the accuracy of the classfcaton. So the data mnng algorthm s adopted to solve ths problem, whch can be based on the exstng smulaton data and regardless of mathematcs assumptons. In ths paper, the assocaton rule mnng algorthm s nvestgated as a potental factor screenng method. It should be based on smulaton data, ncludng smulaton nputs/parameters and the output. The remander of the paper s organzed as follows. In Secton 2, the procedure of the Apror algorthm and the algorthm of parttonng quanttatve attrbutes are descrbed. In Secton 3, a method for factor screenng of smulaton experments s proposed. Through ths method, mportant factors can be dentfed by syntheszng the assocaton rules. In Secton 4, the Proceedngs of the European Modelng and Smulaton Symposum, 217 ISBN ; Affenzeller, Bruzzone, Jménez, Longo and Pera Eds. 34
2 proposed method s llustrated and verfed by the test functon. Fnally, the paper s concluded n Secton RELATED WORK The objectve of factor screenng s to dentfy the mportant factors among many factors nvolved. In ths secton, the procedure of the Apror algorthm wll be descrbed. However, ths algorthm can only cope wth boolean attrbutes nstead of quanttatve attrbutes. But quanttatve attrbutes usually exst n smulaton models. So the algorthm of parttonng quanttatve attrbutes s adopted Apror Algorthm The Apror algorthm s proposed by Agrawal (1994) whch s used to fnd potental relatonshps between the tems (Data_Attrbutes). The result of the algorthm wll be expressed n the form of assocaton rules. In order to clarfy the Apror algorthm clearly, some notatons s llustrated n the followng. -temset: An temset havng tems. L : Set of large -temsets wth mnmum support. C : Set of canddate -temsets whch has potentally large temsets. D : Set of transactons where each transacton T s a set of tems,.e., T D. Gven a set of transactons D, the use of the Apror algorthm s to generate all assocaton rules whch the support and confdence are larger than the gven mnmum values. The mnmum support and mnmum confdence are referred to as mn_sup and mn_conf respectvely. The procedure of the Apror algorthm s descrbed as follows: Apror algorthm 1: L 1 ={large 1-temsets}; 2: For ( 2 ; L ; ) do begn 3: C apror-gen( L ); 4: For all transactons t D do begn 5: Ct subset( C, t); 6: For all canddates c Ct do 7: c.count ; 8: end 9: end 1: L { c C c.count mn_sup }; 11: end 12: return L L. At the begnnng, the large 1-temsets s determned by smply counts tem occurrences. Then subsequent pass conssts of two phases. One s the canddate temsets C whch s generated by the apror-gen functon; and the other s the support of canddates n C whch s counted by scannng the database. The apror-gen functon descrbed above returns a superset of the set of all large -temsets. And the subset functon returns all the canddates contaned n a transacton t wth some rules. The more detals of these two functons can be referred to the lterature Agrawal (1994) The Algorthm of Parttonng Quanttatve Attrbutes However, quanttatve attrbutes need to be dscretzed when usng the Apror algorthm. Two problems may be occurred after dscretzaton (Srant 1996). mn_sup. If the number of ntervals for a quanttatve attrbute (or values, f the attrbute s not parttoned) s large, the support for any sngle nterval can be low. Hence, wthout usng larger ntervals, some rules nvolvng ths attrbute may not be found because they lac mnmum support. mn_conf. There s some nformaton lost whenever we partton values nto ntervals. Some rules may have mnmum confdence only when an tem n the antecedent conssts of a sngle value (or a small nterval). Ths nformaton loss ncreases as the nterval szes become larger. In order to solve problems descrbed above, the algorthm of the equ-depth parttonng (Fuuda 1999) s adopted, whch can dvde N data nto M bucets almost evenly. The procedure of the algorthm s descrbed as follows. Step 1: Mae an S-szed random sample from N data. Step 2: Sort the sample n OS ( log S ) tme. Step 3: Scan the sorted sample and set SM ( )-th the smallest sample to p for each 1,, M. Let p be and p M be. Step 4: For each tuple x n the orgnal N data, fnd such that p x p and assgn x to the -th bucet. Ths chec can be done n O(log M ) tme by usng the bnary search tree for the bucets. Thus, for all, the sze u of B can be computed n ON ( log M) tme. 3. THE METHOD FOR FACTOR SCREENING OF SIMULATION EXPERIMENTS To dentfy mportant factors from many factors nvolved n smulaton models, the Apror algorthm descrbed n Secton 2 s adopted. However, n many cases, factors used n smulaton are quanttatve attrbutes, whch the Apror algorthm cannot cope wth them. So data preprocessng s used to partton the doman of quanttatve attrbutes nto several ntervals and mapped these ntervals nto dscrete attrbutes. And the algorthm of the equ-depth parttonng s adopted to prunng the search space. What need to be ponted out that calculaton of strong rules s not nterestng whle usng support-confdent framewor, lft for mnng postve non-redundant assocaton rules s adopted here. It s assume that temsets A and B are denote the premse and consequent of assocaton rules, respectvely, where A, B, A B. Here A B s used to represent the relatonshp between Proceedngs of the European Modelng and Smulaton Symposum, 217 ISBN ; Affenzeller, Bruzzone, Jménez, Longo and Pera Eds. 341
3 C C apror-gen( ) L Fgure 1: Flow of Factor Screenng Based on the Improved Apror Algorthm factors and the output. Then the confdence of A B can be calculated as support( A B) confdence( A B) P( B A) (1) support( A) where support( A ) s the support of A. The flow of factor screenng based on the mproved Apror algorthm s shown n Fgure 1. The procedure of the proposed method manly conssts of four steps: Step 1: Data preprocessng conssts of partton quanttatve attrbutes nto several ntervals and dscretzaton. Step 2: Obtan the set of all frequent temsets by fndng all temsets where the support of the correspondng temsets satsfes mn_sup. Step 3: Generate assocaton rules usng frequent emsets where the confdence of the correspondng frequent temsets satsfes mn_conf. Step 4: Calculate the senstvty ndces of factors by Equaton (2), and eventually obtan the mportant factors by comparng the values of senstvty ndces. The equaton of calculatng senstvty ndces s gven as r max(confdence(x y)) mn(confdence(x y)) (2) r S r where x s factor and y s the output. 4. CASE STUDY The method proposed n ths paper can be used for factor screenng of smulaton experment. In ths secton, a test functon s used to demonstrate the effectveness of the proposed method. Consder the test functon y 1x 9x 2x x 15x 3x 2x 16x x (3) where x1, x2,, x 7 s an..d. sample from U (,1). The set of data { x1, x2,, x7, y } s obtaned frst, where the sample sze s 5. Then each factor x s parttoned nto seven ntervals through the algorthm of the equ-depth parttonng. Each nterval of x and y are dscretzed n the form of { x _1, x _2,, x _7} and { y_1, y_2,, y _7}, respectvely. The assocaton Proceedngs of the European Modelng and Smulaton Symposum, 217 ISBN ; Affenzeller, Bruzzone, Jménez, Longo and Pera Eds. 342
4 1 Emprcal CDF x 1 x 2 x 3 x 4 x 5 F( x ).5 x 6 x x Fgure 2: An Ensemble of 7 CDFs of the Factors rules are generated by the Apror algorthm, as shown n Table 1. Only 2-temsets s taen to be consdered,.e., A only contans one factor n each rule. Accordng to the fourth column of Table 1, the cumulatve dstrbuton functon (CDF) for the confdence of each factor x s drawn n Fgure 2. The relatve mportance of the factors s qualtatvely expressed by the gradents of the curves, whch the smaller one s more mportant. In other words, the range of confdence for each factor reflects the mportance of factors. Furthermore, the senstvty ndces for each factor are calculated and shown n Fgure 3. It can be quanttatvely conclude that the order of factors s x6 x3 x1 x2 x4 x5 x7 accordng to the mportance. The mportant factors are x 6, x 3, x 1 and x 2. The expermental results obtaned above are n agreement wth the theoretcal results whch are easly concluded from Equaton (3). Table 1: Lst of the Assocaton Rules ID A B confdence( A B) 1 x _ 2 1 y _ x _ 2 1 y _ x _ 4 1 y _ x _1 y _ x _ 7 y _ x _ 3 y _ Above all, t s demonstrated that the proposed method n ths paper s an effectve method whch can be used for factor screenng. Compared wth the tradtonal screenng methods, the proposed method can dentfy mportant factors based on the exstng smulaton data and regardless of mathematcs assumptons. S x1 x2 x3 x4 x5 x6 x7 Fgure 3: Hstogram of Senstvty Indces for Test Functon Usng the Proposed Method 5. CONCLUSIONS Factor screenng s very mportant whle smulaton models to be analyzed wth many factors nvolved. In ths paper, the use of assocaton rule mnng algorthm as a nd of factor screenng method has been studed. The relatonshps between factors and the output are consdered to be a measure of ndex to dentfy mportant factors from many factors nvolved. As a classc algorthm of assocaton rule mnng, Apror algorthm can only be used to solve the problem of mnng boolean assocaton rules. So the algorthm of equ-depth parttonng s adopted to transform quanttatve attrbutes nto boolean attrbutes. After the assocaton rules are generated, the results of confdence are used to calculate the senstvty ndces of factors. And the mportant factors are dentfed accordng to the senstvty ndces. It s demonstrated from the case study that the proposed method appears to perform well n factor screenng. To mprove the effcency of factor screenng and nsure ts accuracy, two aspects are deserved to be further Proceedngs of the European Modelng and Smulaton Symposum, 217 ISBN ; Affenzeller, Bruzzone, Jménez, Longo and Pera Eds. 343
5 studes. One s to study how to synthesze the assocaton rules n other ways, and the other s how to process the unbalanced data. ACKNOWLEDGMENTS Ths research s supported by the Natonal Natural Scence Foundaton of Chna (Grant No ). REFERENCES Klejnen J.P.C., 28. Desgn and analyss of smulaton experments. New Yor:Sprnger. L W., Lu L.Y., Lu Z.Z. et al., 216. HIT-SEDAES: An ntegrated software envronment of smulaton experment desgn, analyss and evaluaton. Internatonal Journal of Modelng, Smulaton, and Scentfc Computng, 7 (3), Alam F.M., McNaught K.R., Rngrose T.J., 24. Usng Morrs' randomzed OAT desgn as a factor screenng method for developng smulaton metamodels. Proceedngs of the 24 Wnter Smulaton Conference, pp December 5-8, Washngton DC, Unted States. Wrght A., Bates D.W., 21. Dstrbuton of Problems, Medcatons and Lab Results n Electronc Health Records: The Pareto Prncple at wor. Appled Clncal Informatcs, 1 (1), Sanchez S.M., Wan H., 215. Wor smarter, not harder: a tutoral on desgnng and conductng smulaton experments. Proceedngs of the 215 Wnter Smulaton Conference, pp December 6-9, Huntngton Beach, Unted States. Bruzzone, A., Longo, F., 214. An applcaton methodology for logstcs and transportaton scenaros analyss and comparson wthn the retal supply chan. European Journal of Industral Engneerng, 8 (1), Padh S.S., Wagner S.M., Nranjan T.T. et al., 213. A smulaton-based methodology to analyse producton lne dsruptons. Internatonal Journal of Producton Research, 51 (6), Rantanen J., Khnast J., 215. The future of pharmaceutcal manufacturng scences. Journal of Pharmaceutcal Scences, 14 (11), Myers, R.H., Montgomery, D.C., 22. Response surface methodology: process and product optmzaton usng desgned experments, second ed. John Wley & Sons, New Yor. Morrs M.D., Factoral samplng plans for prelmnary computatonal experments. Technometrcs, 33: Morrce, D.J., Bardhan, I.R., A weghted least squares approach to computer smulaton factor screenng. Operatons Research, 43 (5), Elster, C., Neumaer, A., Screenng by conference desgns. Bometra 82 (3), Campolongo, F., Klejnen, J.P.C., Andres, T., 2. Screenng methods. In: Saltell, A., Chan, K., Scott, E.M. (Eds.), Senstvty Analyss. John Wley & Sons, New Yor, pp Trocne L., Malone L.C., 21. An overvew of newer advanced screenng methods for the ntal phase n an expermental desgn. Proceedngs of the 21 Wnter Smulaton Conference, pp December 9-12, Arlngton, Unted States. Wan H., Anenman B., 27. Two-stage Controlled Fractonal Factoral Screenng for Smulaton Experments. Journal of Qualty Technology, 39 (2), Shen H., Wan H., 29. Controlled sequental factoral desgn for smulaton factor screenng. European Journal of Operatonal Research, 198, Agrawal R., Srant R., Fast algorthms for mnng assocaton rules. Proceedngs of the 2th Internatonal Conference on Very Large Data Bases, pp September 12-15, Santago, Chle. Srant R., Agrawal R., Mnng quanttatve assocaton rules n large relatonal tables. Proceedngs of the 1996 ACM SIGMOD Internatonal Conference on Management of Data pp June 4-6, Montreal, Canada. Fuuda T., Mormoto Y., et al., Mnng optmzed assocaton rules for numerc attrbutes. Journal of Computer and System Scences, 58 (1), Rastog R., Shm K., 22. Mnng optmzed assocaton rules wth categorcal and numerc attrbutes. IEEE Transactons on Knowledge and Data Engneerng, 14 (1), Ke Y.P., Cheng J., Ng W., 28. An nformatontheoretc approach to quanttatve assocaton rule mnng. Knowledge and Informaton Systems, 16 (2), AUTHORS BIOGRAPHY LINGYUN LU s a Ph.D. student at Harbn Insttute of Technology (HIT), and receved the M.E. from HIT n 213. Hs research nterests nclude smulaton experment desgn and smulaton data analyss. Hs emal s jyzluht@gmal.com. WEI LI s an assocate professor at HIT, and receved the B.S., M.E. and Ph.D. from HIT n 23, 26 and 29 respectvely. Hs research nterests nclude smulaton evaluaton, smulaton data analyss, and dstrbuted smulaton. Hs emal s fran@ht.edu.cn. PING MA s a professor at HIT, and receved Ph.D. from HIT n 23. Her research nterests nclude dstrbuted smulaton technque and VV&A. Her emal s pngma@ht.edu.cn. MING YANG s the correspondng author. He s a professor and the drector of control and smulaton center at HIT. Also he s the vce edtor-n-chef for Journal of System Smulaton and edtor for Internatonal Journal of Modelng Smulaton and Scence Computng. Hs research nterests nclude system smulaton theory and VV&A. Hs emal s myang@ht.edu.cn. Proceedngs of the European Modelng and Smulaton Symposum, 217 ISBN ; Affenzeller, Bruzzone, Jménez, Longo and Pera Eds. 344
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 informationConcurrent 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 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 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 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 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 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 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 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 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 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 informationTECHNIQUE 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 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 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 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 informationDetermining 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 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 informationPrivate Information Retrieval (PIR)
2 Levente Buttyán Problem formulaton Alce wants to obtan nformaton from a database, but she does not want the database to learn whch nformaton she wanted e.g., Alce s an nvestor queryng a stock-market
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 informationLearning-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 informationScheduling 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 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 informationImprovement 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 informationX- 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 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 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 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 informationA 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 informationQuery 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 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 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 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 informationThe Research of Support Vector Machine in Agricultural Data Classification
The Research of Support Vector Machne n Agrcultural Data Classfcaton Le Sh, Qguo Duan, Xnmng Ma, Me Weng College of Informaton and Management Scence, HeNan Agrcultural Unversty, Zhengzhou 45000 Chna Zhengzhou
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 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 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 informationHelsinki 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 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 informationA Saturation Binary Neural Network for Crossbar Switching Problem
A Saturaton Bnary Neural Network for Crossbar Swtchng Problem Cu Zhang 1, L-Qng Zhao 2, and Rong-Long Wang 2 1 Department of Autocontrol, Laonng Insttute of Scence and Technology, Benx, Chna bxlkyzhangcu@163.com
More informationUsing Fuzzy Logic to Enhance the Large Size Remote Sensing Images
Internatonal Journal of Informaton and Electroncs Engneerng Vol. 5 No. 6 November 015 Usng Fuzzy Logc to Enhance the Large Sze Remote Sensng Images Trung Nguyen Tu Huy Ngo Hoang and Thoa Vu Van Abstract
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 informationUSING GRAPHING SKILLS
Name: BOLOGY: Date: _ Class: USNG GRAPHNG SKLLS NTRODUCTON: Recorded data can be plotted on a graph. A graph s a pctoral representaton of nformaton recorded n a data table. t s used to show a relatonshp
More informationA 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 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 informationAn Improved Image Segmentation Algorithm Based on the Otsu Method
3th ACIS Internatonal Conference on Software Engneerng, Artfcal Intellgence, Networkng arallel/dstrbuted Computng An Improved Image Segmentaton Algorthm Based on the Otsu Method Mengxng Huang, enjao Yu,
More informationWireless Sensor Networks Fault Identification Using Data Association
Journal of Computer Scence 8 (9): 1501-1505, 2012 ISSN 1549-3636 2012 Scence Publcatons Wreless Sensor Networks Fault Identfcaton Usng Data Assocaton 1 Abram Kongu, T., 2 P. Thangaraj and 1 P. Prakanth
More informationClassifier 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 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 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 informationA Deflected Grid-based Algorithm for Clustering Analysis
A Deflected Grd-based Algorthm for Clusterng Analyss NANCY P. LIN, CHUNG-I CHANG, HAO-EN CHUEH, HUNG-JEN CHEN, WEI-HUA HAO Department of Computer Scence and Informaton Engneerng Tamkang Unversty 5 Yng-chuan
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 informationQuerying 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 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 informationAn 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 informationAn Indian Journal FULL PAPER ABSTRACT KEYWORDS. Trade Science Inc.
[Type text] [Type text] [Type text] ISSN : 97-735 Volume Issue 9 BoTechnology An Indan Journal FULL PAPER BTAIJ, (9), [333-3] Matlab mult-dmensonal model-based - 3 Chnese football assocaton super league
More informationy 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 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 informationASSOCIATION RULE MINING BASED ON IMAGE CONTENT
Internatonal Journal of Informaton Technology and Knowledge Management January-June 011, Volume 4, No. 1, pp. 143-146 ASSOCIATION RULE MINING BASED ON IMAGE CONTENT Deepa S. Deshpande Image mnng s concerned
More informationF Geometric Mean Graphs
Avalable at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 1932-9466 Vol. 10, Issue 2 (December 2015), pp. 937-952 Applcatons and Appled Mathematcs: An Internatonal Journal (AAM) F Geometrc Mean Graphs A.
More informationBIN XIA et al: AN IMPROVED K-MEANS ALGORITHM BASED ON CLOUD PLATFORM FOR DATA MINING
An Improved K-means Algorthm based on Cloud Platform for Data Mnng Bn Xa *, Yan Lu 2. School of nformaton and management scence, Henan Agrcultural Unversty, Zhengzhou, Henan 450002, P.R. Chna 2. College
More informationSkew 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 informationQuality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation
Intellgent Informaton Management, 013, 5, 191-195 Publshed Onlne November 013 (http://www.scrp.org/journal/m) http://dx.do.org/10.36/m.013.5601 Qualty Improvement Algorthm for Tetrahedral Mesh Based on
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 informationFINDING IMPORTANT NODES IN SOCIAL NETWORKS BASED ON MODIFIED PAGERANK
FINDING IMPORTANT NODES IN SOCIAL NETWORKS BASED ON MODIFIED PAGERANK L-qng Qu, Yong-quan Lang 2, Jng-Chen 3, 2 College of Informaton Scence and Technology, Shandong Unversty of Scence and Technology,
More informationEmpirical Distributions of Parameter Estimates. in Binary Logistic Regression Using Bootstrap
Int. Journal of Math. Analyss, Vol. 8, 4, no. 5, 7-7 HIKARI Ltd, www.m-hkar.com http://dx.do.org/.988/jma.4.494 Emprcal Dstrbutons of Parameter Estmates n Bnary Logstc Regresson Usng Bootstrap Anwar Ftranto*
More informationType-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 informationFrom Comparing Clusterings to Combining Clusterings
Proceedngs of the Twenty-Thrd AAAI Conference on Artfcal Intellgence (008 From Comparng Clusterngs to Combnng Clusterngs Zhwu Lu and Yuxn Peng and Janguo Xao Insttute of Computer Scence and Technology,
More informationContent 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 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 informationSuppression for Luminance Difference of Stereo Image-Pair Based on Improved Histogram Equalization
Suppresson for Lumnance Dfference of Stereo Image-Par Based on Improved Hstogram Equalzaton Zhao Llng,, Zheng Yuhu 3, Sun Quansen, Xa Deshen School of Computer Scence and Technology, NJUST, Nanjng, Chna.School
More informationSimulation: 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 informationMaintaining temporal validity of real-time data on non-continuously executing resources
Mantanng temporal valdty of real-tme data on non-contnuously executng resources Tan Ba, Hong Lu and Juan Yang Hunan Insttute of Scence and Technology, College of Computer Scence, 44, Yueyang, Chna Wuhan
More informationREFRACTIVE INDEX SELECTION FOR POWDER MIXTURES
REFRACTIVE INDEX SELECTION FOR POWDER MIXTURES Laser dffracton s one of the most wdely used methods for partcle sze analyss of mcron and submcron sze powders and dspersons. It s quck and easy and provdes
More informationAlgorithms for Frequent Pattern Mining of Big Data
Research Inda Publcatons. http://www.rpublcaton.com Algorthms for Frequent Pattern Mnng of Bg Data Syed Zubar Ahmad Shah 1, Mohammad Amjad 1, Ahmad Al Habeeb 2, Mohd Huzafa Faruqu 1 and Mudasr Shaf 3 1
More informationBioTechnology. An Indian Journal FULL PAPER. Trade Science Inc.
[Type text] [Type text] [Type text] ISSN : 0974-74 Volume 0 Issue BoTechnology 04 An Indan Journal FULL PAPER BTAIJ 0() 04 [684-689] Revew on Chna s sports ndustry fnancng market based on market -orented
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 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 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 informationNetwork Intrusion Detection Based on PSO-SVM
TELKOMNIKA Indonesan Journal of Electrcal Engneerng Vol.1, No., February 014, pp. 150 ~ 1508 DOI: http://dx.do.org/10.11591/telkomnka.v1.386 150 Network Intruson Detecton Based on PSO-SVM Changsheng Xang*
More informationTerm 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 informationAssociation Rule Mining with Parallel Frequent Pattern Growth Algorithm on Hadoop
Assocaton Rule Mnng wth Parallel Frequent Pattern Growth Algorthm on Hadoop Zhgang Wang 1,2, Guqong Luo 3,*,Yong Hu 1,2, ZhenZhen Wang 1 1 School of Software Engneerng Jnlng Insttute of Technology Nanng,
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 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 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 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 informationConstructing 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 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 informationLoad-Balanced Anycast Routing
Load-Balanced Anycast Routng Chng-Yu Ln, Jung-Hua Lo, and Sy-Yen Kuo Department of Electrcal Engneerng atonal Tawan Unversty, Tape, Tawan sykuo@cc.ee.ntu.edu.tw Abstract For fault-tolerance and load-balance
More informationProceedings of the 2014 Winter Simulation Conference A. Tolk, S. Y. Diallo, I. O. Ryzhov, L. Yilmaz, S. Buckley, and J. A. Miller, eds.
Proceedngs of the 2014 Wnter Smulaton Conference A. Tolk, S. Y. Dallo, I. O. Ryzhov, L. Ylmaz, S. Buckley, and J. A. Mller, eds. TOPSIS BASED TAGUCHI METHOD FOR MULTI-RESPONSE SIMULATION OPTIMIZATION OF
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 informationA Statistical Model Selection Strategy Applied to Neural Networks
A Statstcal Model Selecton Strategy Appled to Neural Networks Joaquín Pzarro Elsa Guerrero Pedro L. Galndo joaqun.pzarro@uca.es elsa.guerrero@uca.es pedro.galndo@uca.es Dpto Lenguajes y Sstemas Informátcos
More informationUnsupervised Learning
Pattern Recognton Lecture 8 Outlne Introducton Unsupervsed Learnng Parametrc VS Non-Parametrc Approach Mxture of Denstes Maxmum-Lkelhood Estmates Clusterng Prof. Danel Yeung School of Computer Scence and
More informationEffective Page Recommendation Algorithms Based on. Distributed Learning Automata and Weighted Association. Rules
Effectve Page Recommendaton Algorthms Based on Dstrbuted Learnng Automata and Weghted Assocaton Rules R. Forsat 1*, M. R. Meybod 2 1 Department of Computer Engneerng, Islamc Azad Unversty, Karaj Branch,
More informationAssociation Analysis for an Online Education System
Assocaton Analyss for an Onlne Educaton System Behrouz Mnae-Bdgol, Gerd Kortemeyer, and Wllam Punch Computer Scence Department, Mchgan State Unversty, East Lansng, MI, 4884, USA {mnaeb, punch}@cse.msu.edu
More informationFast Computation of Shortest Path for Visiting Segments in the Plane
Send Orders for Reprnts to reprnts@benthamscence.ae 4 The Open Cybernetcs & Systemcs Journal, 04, 8, 4-9 Open Access Fast Computaton of Shortest Path for Vstng Segments n the Plane Ljuan Wang,, Bo Jang
More informationA User Selection Method in Advertising System
Int. J. Communcatons, etwork and System Scences, 2010, 3, 54-58 do:10.4236/jcns.2010.31007 Publshed Onlne January 2010 (http://www.scrp.org/journal/jcns/). A User Selecton Method n Advertsng System Shy
More informationAssociative Based Classification Algorithm For Diabetes Disease Prediction
Internatonal Journal of Engneerng Trends and Technology (IJETT) Volume-41 Number-3 - November 016 Assocatve Based Classfcaton Algorthm For Dabetes Dsease Predcton 1 N. Gnana Deepka, Y.surekha, 3 G.Laltha
More informationMultiway pruning for efficient iceberg cubing
Multway prunng for effcent ceberg cubng Xuzhen Zhang & Paulne Lenhua Chou School of CS & IT, RMIT Unversty, Melbourne, VIC 3001, Australa {zhang,lchou}@cs.rmt.edu.au Abstract. Effectve prunng s essental
More informationChinese Word Segmentation based on the Improved Particle Swarm Optimization Neural Networks
Chnese Word Segmentaton based on the Improved Partcle Swarm Optmzaton Neural Networks Ja He Computatonal Intellgence Laboratory School of Computer Scence and Engneerng, UESTC Chengdu, Chna Department of
More informationGSLM Operations Research II Fall 13/14
GSLM 58 Operatons Research II Fall /4 6. Separable Programmng Consder a general NLP mn f(x) s.t. g j (x) b j j =. m. Defnton 6.. The NLP s a separable program f ts objectve functon and all constrants are
More information