A COMPARISON OF TWO METHODS FOR FITTING HIGH DIMENSIONAL RESPONSE SURFACES

Size: px
Start display at page:

Download "A COMPARISON OF TWO METHODS FOR FITTING HIGH DIMENSIONAL RESPONSE SURFACES"

Transcription

1 Mam, Florda, U.S.A., Aprl 6-8, 7 A COMPARISON OF TWO METHODS FOR FITTING HIGH DIMENSIONAL RESPONSE SURFACES Marcelo J. Colaço Department of Mechancal and Materals Eng. Mltary Insttute of Engneerng Ro de Janero, RJ, Brazl colaco@asme.org George S. Dulkravch Department of Mechancal and Materals Eng. Florda Internatonal Unversty Mam, Florda, USA dulkrav@fu.edu Debass Sahoo Infnte Cloud, LLC 48 Wall St. New York, NY dsahoo@nfntecloud.com ABSTRACT In ths paper we compare two methodologes to nterpolate lnear as well as hghly non-lnear functons n multdmensonal spaces havng up to 5 dmensons. Two methodologes are compared: the Radal Bass Functon (RBF) and the Wavelet based Neural Network (WNN). The accuracy, robustness, effcency, transparency and conceptual smplcty are dscussed. Based on the extensve testng performed on 3 test functons, the RBF approach seems easy to mplement computatonally and results are better nterpolaton for hgher dmensonal spaces than the WNN, requrng lesser computng tme. INTRODUCTION The use of RBFs followed by collocaton, a technque frst proposed by Kansa [Kansa, 99], after the work of Hardy [Hardy, 97] on multvarate approxmaton, s now becomng an establshed approach. Varous applcatons to problems n mechancs have been made n recent years see, for example Letão [Letão, ; Letão, 4]. Kansa's method (or asymmetrc collocaton) starts by buldng an approxmaton to the feld of nterest (normally dsplacement components) from the superposton of RBFs (globally or compactly supported) convenently placed at ponts n the doman and/or at the boundary. The unknowns (whch are the coeffcents of each RBF) are obtaned from the approxmate enforcement of the boundary condtons as well as the governng equatons by means of collocaton. Usually, ths approxmaton only consders regular RBFs, such as the globally supported multquadrcs or the compactly supported Wendland functons [Wendland, 998]. RBF may be classfed nto two man groups:. The globally supported ones namely the x x + c, where c j s a multquadrcs (MQ, ( ) shape parameter), the nverse multquadrcs, thn plate splnes, Gaussans, etc;. The compactly supported ones such as the Wendland [998] famly (for example, ( r) n + + p( r) where p(r) s a polynomal and ( r ) n + s for r greater than the support). Let us suppose that we have a functon of L varables x, =,,L. The RBF model used n ths work has the followng form N M L () s x = f x = α φ x x + β p x + β ( ) ( ) ( ) ( ) j j j, k k j= k= = j where x={x,,x,,x L ) and f(x) s known for a seres of ponts x. Here, p k (x ) s one of the M terms of a gven bass of polynomals [Buhmann, 3]. Ths approxmaton s solved for the α j and β,k unknowns from the system of N lnear equatons, subject to the condtons (for the sake of unqueness) N j= N j= N j= α p ( x ) j k α p ( x ) j k L α = j = = (.a) (.b) In ths work, the polynomal part of Eq. () was taken as k pk ( x ) = x (3) and the multquadrcs radal functon ( x x ) ( x x ) c j j j φ = + (4)

2 Mam, Florda, U.S.A., Aprl 6-8, 7 was used wth the shape parameter c j whch s kept constant as /N. Thus, a polynomal of order M s added to the radal bass functon. M was lmted to an upper value of. After nspectng Eqs. ()-(4), one can easly check that the fnal lnear system has [(N+M*L)+] equatons. The second method used for fttng hgh dmensonal functons was the Wavelets based Neural Network (WNN) model presented by Sahoo and Dulkravch [6] wth 5 neural subnets. Tranng the WNN for response surface generaton was done usng a random sequence dataset of Sobol and Levtan [976]. Typcally, the mother wavelet used n the WNN s Mexcan Hat wavelet gven by ψ x / (5) ( x) = π 4 ( x ) exp 3 Gaussan wavelets were also used along wth ths mother wavelet to construct the WNN. For each node of the WNN, genetc algorthm was used to search the best Mexcan Hat wavelet and the best Gaussan wavelet. The one havng a lower norm of resdue after performng multple lnear regresson was selected and used n the WNN archtecture. TEST FUNCTIONS In order to test the accuracy of the RBF model proposed, 3 test cases were used, representng lnear and non-lnear problems wth up to 6 varables. These test cases, defned as problems to 3 were selected by Jn et al. [] n a comparatve study among dfferent knds of metamodels. Such problems were selected from a collecton of 395 problems (actually 96 test cases), proposed by Hock and Schttkowsk [98] and Schttkowsk [987]. The frst problems do not have random errors added to the orgnal functon, whle the problem no. 3 has a nose added wth the followng form ε ( x, x ) = σ r (6) where σ s the standard devaton and r s a random number wth Gaussan dstrbuton and zero mean. In accordance wth havng multple metamodelng crtera, the performance of each metamodelng technque s measured from the followng aspects [Jn et al., ]. Accuracy the capablty of predctng the system response over the desgn space of nterest. Robustness the capablty of achevng good accuracy for dfferent problem types and sample szes. Effcency the computatonal effort requred for constructng the metamodel and for predctng the response for a set of new ponts by metamodels. Transparency the capablty of llustratng explct relatonshps between nput varables and responses. Conceptual Smplcty ease of mplementaton. Smple methods should requre mnmum user nput and be easly adapted to each problem. For accuracy, the goodness of ft obtaned from tranng data s not suffcent to assess the accuracy of newly predcted ponts. For ths reason, addtonal confrmaton samples are used to verfy the accuracy of the metamodels. To provde a more complete pcture of metamodel accuracy, three dfferent metrcs are used: R Square, Relatve Average Absolute Error (RAAE), and Relatve Maxmum Absolute Error (RMAE) [Jn et al., ]. a) (R) n ( y yˆ ) = MSE R = = n varance ( y y) = (7) where ŷ s the correspondng predcted value for the observed value y ; y s the mean of the observed values. Whle MSE (Mean Square Error) represents the departure of the metamodel from the real smulaton model, the varance captures how rregular the problem s. The larger the value of R, the more accurate the metamodel. b) Relatve Average Absolute Error (RAAE) RAAE = n = y yˆ n STD (8) where STD stands for standard devaton. The smaller the value of RAAE, the more accurate the metamodel. c) Relatve Maxmum Absolute Error (RMAE) max( y yˆ y yˆ,,..., yn yˆn ) RMAE = (9) STD Large RMAE ndcates large error n one regon of the desgn space even though the overall

3 Mam, Florda, U.S.A., Aprl 6-8, 7 accuracy ndcated by R and RAAE can be very good. Therefore, a small RMAE s preferred. However, snce ths metrc cannot show the overall performance n the desgn space, t s not as mportant as R and RAAE. RESULTS The RBF model presented here was compared WNN method for the 3 selected test cases. Table gves the number of tranng ponts, testng ponts, mnmum and maxmum value of each test functon, as well as the standard devaton and average value of each test functon. Table Parameters for the 3 test functons Number of tranng and testng ponts Standard Non Mnmum Maxmum Average Tranng devaton Testng Lnearty value of f value of f value of f PB # # Vars Scarce Small Large of f PB 3 98 Hgh PB 3 98 Low PB Hgh PB Low PB Low PB6 9 Hgh PB7 9 Hgh PB8 9 Low PB Hgh N/A PB Hgh PB Low PB 9 Low PB3 9 Low Three methodologes were used to solve the lnear algebrac system resultng from Eqs. ()- (4): LU decomposton, SVD and the Generalzed Mnmum Resdual (GMRES) teratve solver. When the number of equatons was small (less than 4), the LU solver was used. However, when the number of varables ncreased over 4, the resultng matrx becomes too ll-condtoned and the SVD solver had to be used. For more than 8 varables, the GMRES teratve method wth the Jacob precondtoner was used. In order to check the accuracy of the metamodel when dfferent samples were employed, three dfferent sets of tranng ponts were used, as suggested by Jn et al. []. Intally, the accuracy of the RBF expanson was tested for a large set of tranng ponts as defned n Table. Fgure shows the results for dfferent orders of the polynomal part of the RBF expanson presented n Eqs. ()-(3). From ths fgure, one can see that by ncreasng the order of the polynomal the results become much better, except for the problem no. 9, where the R metrc decreases when M ncreases. In fact, for all problems, except no., the RBF expanson acheves the R metrc over.9, showng a very good global accuracy. For a large set of tranng ponts, the man concluson s that a hgh polynomal order should be used n order to acheve hgh accuracy PB PB PB3 PB4 PB5 PB6 PB7 PB8 PB9 PB PB PB PB3 M= M= M=3 M=4 M=5 M=6 M=7 M=8 M=9 M= Fgure Influence of the polynomal order on the R metrc for a large set of tranng ponts Next, the same comparson was made for a small number of tranng ponts, as defned n Table. Fgure shows the results of the R metrc for ths comparson. It can be observed that problem no. s almost nsenstve to the order of the polynomal, except for M = 9. Problem no. s also nsenstve except for M greater than 8, where the performance drops rapdly. Problems no. and 4 are nsenstve to the value of M, whle problem number 7 shows a small decrease of the R value for hgh order polynomals. Problem no. 3 shows an ncrease n the R values

4 Mam, Florda, U.S.A., Aprl 6-8, 7 when M ncreases, just as n the case wth a large set of tranng ponts. However, problems no. 5, 6, 9, and 3 show a drop n the R value when the polynomal order s ncreased so that some metrcs were way below zero. From ths fgure, n order to keep the method robust, we conclude that, f the number of tranng ponts s small, the order of the polynomal should be kept small PB PB PB3 PB4 PB5 PB6 PB7 PB8 PB9 PB PB PB PB3 M= M= M=3 M=4 M=5 M=6 M=7 M=8 M=9 M= Fgure Influence of the polynomal order on the R metrc for a small set of tranng ponts Fgure 3 shows the comparson of the R metrcs for several polynomal orders for a scarce set of tranng ponts. Only problems no. to 5 were tested for a scarce set of tranng ponts, as suggested by Jn et al. []. Problems no. and 3 have the same behavor as for a small set of tranng ponts. However, problem no. rapdly drops ts value of R for a hgh polynomal order. Agan, the mnmum value of the scale was lmted to zero, because some of the R values were way below zero. The performance of problem no. 5 oscllates when M s vared. Agan, we concluded that for a scarce number of tranng ponts, a lower polynomal order should be used n order to keep the method more robust PB PB PB3 PB4 PB5 M= M= M=3 M=4 M=5 M=6 M=7 M=8 M=9 M= Fgure 3 Influence of the polynomal order on the R metrc for a scarce set of tranng ponts Next, the results obtaned wth a RBF polynomal of order usng a large number of tranng ponts and the results obtaned wth a polynomal of order for small and scarce sets of tranng ponts were compared wth the results obtaned by usng WNN method [Sahoo and Dulkravch, 6]. Agan, only problems no. to 5 were tested for a scarce set of tranng ponts, as suggested by Jn et al. []. The results for the R metrc are presented n Fg. 4, where one can see that the RBF formulaton performed better than the WNN for a scarce number of tranng ponts for problems no. and. For problem no. 4 the value of R s a lttle small for the RBF when compared to WNN. For problems no. 3 and 5 the RBF performed qute poorly, whle the WNN was able to obtan some results. For a small set of tranng ponts, the RBF was better than the WNN for problems no., 7, 8, 9, and 3, whle the WNN performed better for problems no. 3, 5, and. The performance was practcally the same for problems no., 4, 6 and. For a large number of tranng ponts, the WNN performed better for problems no. 9 and, whle the RBF had a better performance for problems no., 3 and 3. For problems no., 4, 5, 6, 7, 8, and the accuracy of both methods was almost the same. Fgure 5 shows the comparsons of RAAE for all 3 test functons, both for RBF and WNN. Recall that for ths metrc, lower values are better than hgh values. For a scarce set of tranng ponts, the RBF performed better for problem no., whle the WNN was better for problems no., 3 and 4. For problem no., RAAE values for both of the methods were comparable.

5 Mam, Florda, U.S.A., Aprl 6-8, PB PB PB3 PB4 PB5 PB6 PB7 PB8 PB9 PB PB PB PB WNN (Scarce) RBF (Scarce) WNN (Small) RBF (Small) WNN (Large) RBF (Large) Fgure 4 R metrc for WNN and RBF It s nterestng to note that the R value for problems no. 3 and 4 (see Fg. 4) were bad when the RBFs were used. However, the RAAE metrcs for these two problems are better when compared to the WNN. Actually, the RAAE metrc for problem no. 3 s approxmately 5% greater for RBF than for WNN, whle the R metrcs for ths problem was under zero for RBF. For small set of tranng ponts, the RBF performed better for problems no.,, 6, 7, 8, 9, and 3, whle the WNN performed better for problems no. 3, 4, 5 and. The values of RAAE for both methods were almost equal for problem no.. For a large set of tranng ponts, the RBF performed better than the WNN, except for problems no. 5 and. Thus, as t was observed n the R metrc, for large and small sets of tranng ponts, the RBF was better than the WNN, whle for a scarce number of tranng ponts, the WNN performed better. RAEE PB PB PB3 PB4 PB5 PB6 PB7 PB8 PB9 PB PB PB PB WNN (Scarce) RBF (Scarce) WNN (Small) RBF (Small) WNN (Large) RBF (Large) Fgure 5 RAAE metrc for WNN and RBF Fnally, Fg. 6 shows the results for the relatve maxmum absolute error (RMAE) for all 3 test functons. A hgh value of the RMAE means a bad local estmate. For a scarce set of tranng ponts, the general trend s very close to the prevous one, related to the RAAE metrc, showng a better performance for RBF n the problem no., whle the WNN performed better for problems no. 3, 4 and 5. However, for problem no., the RBF performed much better than WNN, ndcatng that the WNN had some naccurate local estmates. For a small set of tranng ponts, the RBF performed better for problems no., 7, 8 and, whle the WNN performed better for problems no. 3, 5, 6, and 3. For problems no., 4, 9 and the values of RMAE were close to each other. For a large set of tranng ponts, the RBF was better for problems no.,, 3, 4, 7, 8, 9, and 3, whle the WNN was better for the problems no. 5,. For problems no. 6 and the performance was practcally the same for both of them. RMAE PB PB PB3 PB4 PB5 PB6 PB7 PB8 PB9 PB PB PB PB WNN (Scarce) RBF (Scarce) WNN (Small) RBF (Small) WNN (Large) RBF (Large) Fgure 6 RMAE metrc for WNN and RBF

6 Mam, Florda, U.S.A., Aprl 6-8, 7 In order to check the robustness of the two models when nose s added, test problem no. 3 was used wth several values of σ. For ths test, tranng ponts and testng ponts were used. Fgure 7 shows how the R metrc decreases when the added nose n the orgnal functon ncreases. It s worth to note that the RBF performed better than the WNN. In fact, even for a hgh level of nose, the RBF stll shows a value of.8 for the R metrc when the order of the polynomal s equal to M =. It s qute nterestng that when no nose s added, the R metrc decreases when the order of the polynomal ncreases, whch s exactly the opposte trend to the one presented n Fg. for the functon number 3 wthout nose Nose RBF (M=) RBF (M=) WNN Fgure 7 Influence of nose on the R metrc Fnally, a test case wth progressvely large number of varables was proposed. For ths test case, test functon no. was chosen wth 5, and 4 tranng ponts and testng ponts for varous problem dmensons. Fgure 8 shows the results for the R metrcs when the RBF was used wth a polynomal of order M =. It s surprsng that the RBF s able to mantan a hgh level of R, even for a problem wth 5 varables. It s worth to note that when the number of tranng ponts decreases, the value of R also decreases, but not sgnfcantly # of varables RSQ (4 tranng) RSQ ( tranng) RSQ (5 tranng) Fgure 8 R results for a large number of varables (RBF wth M=) Fgure 9 shows the results for the same test case presented n Fg. 8, but now for a polynomal of order M =. Snce t was observed n Fgs. -3, the problem no. s nsenstve to the order of the polynomal for scarce, small and large set of tranng ponts. It s nterestng to note the smlar results when a hgh order polynomal was used (see Fg. 8). In fact, the results are even better for 5 varables # of varables RSQ (4 tranng) RSQ ( tranng) RSQ (5 tranng) Fgure 9 R results for a large number of varables (RBF wth M=)

7 Mam, Florda, U.S.A., Aprl 6-8, 7 CPU Tme (s)..... RSQ (4 tranng) RSQ ( tranng) RSQ (5 tranng) # of varables Fgure CPU tme for a large number of varables (RBF wth M=) The reason for ths s that the lnear system resultng from the RBF approxmaton has [(N+M*L)+] equatons, where N s the number of tranng ponts, L s the number of varables and M s the order of the polynomal. Thus, when a hgh order polynomal s used, the matrx becomes too large and mght become more llcondtoned. Fnally, Fg. shows the computatonal tme requred to run ths test case. It s qute surprsng that the computatonal tme was lower than seconds for all test cases, meanng that the RBF approxmaton s very fast. The code was wrtten n Fortran 9 and the CPU was an Intel T3.66Ghz (Centrno Duo) wth Gb RAM. Fgure shows the results for test problem no. for a large number of varables, usng the WNN. One can see that the accuracy, gven by the R metrc, decreases rapdly when usng tranng ponts. Also, for 4 tranng ponts, the R goes to a negatve value for more than varables, whle the RBF (see Fgs. 8 and 9) mantans good accuracy even when there are 5 varables. Fgure shows the computatonal tme requred by the WNN where one can notce the hgh computatonal cost. In fact, for varables, the tme requred was about 4 hours, whle for 3 varables t was more than hours. The code for the WNN was wrtten n Matlab 7..4 and the CPU was an Intel T3.66Ghz (Centrno Duo) wth Gb RAM. Some mprovement n the performance can be obtaned by convertng ths code to Fortran9 or C++ and ths should be nvestgated. However, the computatonal cost for the WNN for a problem wth 3 varables and 4 tranng ponts, even wth dfferent languages (Matlab and Fortran9) was approxmately 6 tmes greater than for the RBF. Fnally, the same problem was run agan usng WNN wth only one sub-net and 4 tranng ponts, usng the Mexcan Hat functon. The results are presented n Fg WNN (4 tranng) WNN ( tranng) # of varables Fgure R results wth WNN for a large number of varables (WNN wth fve subnets) CPU Tme (s) WNN (4 tranng) WNN ( tranng) # of varables Fgure CPU tme for a large number of varables (WNN wth fve subnets)

8 Mam, Florda, U.S.A., Aprl 6-8, RSQ CPU Tme # of varables CPU tme (s) Fgure 3 R results and CPU tme for a large number of varables (WNN wth one subnet) One can see that the computatonal tmes decrease when compared wth the ones presented n Fg. by a factor of fve, but the R metrcs also decreases. It s nterestng to note that, agan, after varables, the R metrcs goes to a negatve value when the WNN s used. Thus, t s not recommended to reduce the number of neural sub-nets n order to speed-up the tranng process, because the accuracy goes down. In concluson, at least for the problem no., the RBF s more robust than the WNN when a very large number of varables s used. CONCLUSIONS In ths work we performed a comparson of two nterpolaton technques for hghly non-lnear functons where large number of varables were nvolved. The RBF technque seems to be qute powerfull regardng ts accuracy and reduced CPU tme. Even when the number of varables were as large as 5, the RBF approxmaton was very fast and robust. Ths s a promsng technque for real tme nterpolatons such as target trackng or mage recognton. When only a scarce sets of data are avalable, WNN method typcally offers hgher accuracy. ACKNOWLEDGEMENTS Ths work was partally funded by CNPq (a Brazlan councl for scentfc development). The frst author s very gratefull to the fnancal support from FIU as well as the hosptally of the Dulkravch s famly durng hs stayng n Mam from September to November 6. REFERENCES Buhmann, M.D., 3, Radal Bass Functons on Grds and Beyond, Internatonal Workshop on Meshfree Methods, Lsbon. Hardy, R.L., 97, Multquadrc Equatons of Topography and Other Irregular Surfaces, Journal of Geophyscs Res., Vol. 76, pp Hock, W. and Schttkowsk, K., 98, Test Examples for Nonlnear Programmng Codes, Lecture Notes n Economcs and Mathematcal Systems, Vol. 87, Sprnger. Jn, R., Chen, W. and Smpson, T. W.,, Comparatve Studes of Metamodelng Technques under Multple Modelng Crtera, Proceedngs of the 8th AIAA / USAF / NASA / ISSMO Multdscplnary Analyss & Optmzaton Symposum, AIAA -48, Long Beach, CA, 6-8 Sept. Kansa, E.J., 99, Multquadrcs A Scattered Data Approxmaton Scheme wth Applcatons to Computatonal Flud Dynamcs II: Solutons to Parabolc, Hyperbolc and Ellptc Partal Dfferental Equatons, Comput. Math. Applc., Vol. 9, pp Letão, V.M.A.,, A Mesheless Method for Krchhoff Plate Bendng Problems, Internatonal Journal of Numercal Methods n Engneerng, Vol. 5, pp Letão, V.M.A., 4, RBF-Based Meshless Methods for D Elastostatc Problems, Engneerng Analyss wth Boundary Elements, Vol. 8, pp Sahoo, D. and Dulkravch, G. S., 6, Evolutonary Wavelet Neural Network for Large Scale Functon Estmaton n Optmzaton, th AIAA/ISSMO Multdscplnary Analyss and Optmzaton Conference, AIAA Paper AIAA , Portsmouth, VA, Sept Schttkowsk, K., 987, More Test Examples for Nonlnear Programmng, Lecture Notes n Economcs and Mathematcal Systems, Vol. 8, Sprnger. Sobol, I. and Levtan, 976, The Producton of Ponts Unformly Dstrbuted n a Multdmensonal Cube, Preprnt IPM Akad. Nauk SSSR, Number 4, Moscow, Russa. Wendland, H., 998, Error Estmates for Interpolaton by Compactly Supported Radal Bass Functons of Mnmal Degree, Journal of Approxmaton Theory, Vol. 93, pp

Evolutionary Wavelet Neural Network for Large Scale Function Estimation in Optimization

Evolutionary Wavelet Neural Network for Large Scale Function Estimation in Optimization AIAA Paper AIAA-006-6955, th AIAA/ISSMO Multdscplnary Analyss and Optmzaton Conference, Portsmouth, VA, September 6-8, 006. Evolutonary Wavelet Neural Network for Large Scale Functon Estmaton n Optmzaton

More information

S1 Note. Basis functions.

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

More information

Smoothing Spline ANOVA for variable screening

Smoothing 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 information

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS

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

More information

Learning the Kernel Parameters in Kernel Minimum Distance Classifier

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

More information

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

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

More information

A Binarization Algorithm specialized on Document Images and Photos

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

More information

An Accurate Evaluation of Integrals in Convex and Non convex Polygonal Domain by Twelve Node Quadrilateral Finite Element Method

An Accurate Evaluation of Integrals in Convex and Non convex Polygonal Domain by Twelve Node Quadrilateral Finite Element Method Internatonal Journal of Computatonal and Appled Mathematcs. ISSN 89-4966 Volume, Number (07), pp. 33-4 Research Inda Publcatons http://www.rpublcaton.com An Accurate Evaluaton of Integrals n Convex and

More information

Cluster Analysis of Electrical Behavior

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

More information

Machine Learning 9. week

Machine Learning 9. week Machne Learnng 9. week Mappng Concept Radal Bass Functons (RBF) RBF Networks 1 Mappng It s probably the best scenaro for the classfcaton of two dataset s to separate them lnearly. As you see n the below

More information

Parallelism for Nested Loops with Non-uniform and Flow Dependences

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

More information

Very simple computational domains can be discretized using boundary-fitted structured meshes (also called grids)

Very simple computational domains can be discretized using boundary-fitted structured meshes (also called grids) Structured meshes Very smple computatonal domans can be dscretzed usng boundary-ftted structured meshes (also called grds) The grd lnes of a Cartesan mesh are parallel to one another Structured meshes

More information

Hermite Splines in Lie Groups as Products of Geodesics

Hermite 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 information

Classifier Selection Based on Data Complexity Measures *

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

More information

Empirical Distributions of Parameter Estimates. in Binary Logistic Regression Using Bootstrap

Empirical 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 information

Mathematics 256 a course in differential equations for engineering students

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

More information

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

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

More information

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

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

More information

An Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices

An 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 information

Lecture 5: Multilayer Perceptrons

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

More information

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

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

More information

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

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

More information

Lecture 4: Principal components

Lecture 4: Principal components /3/6 Lecture 4: Prncpal components 3..6 Multvarate lnear regresson MLR s optmal for the estmaton data...but poor for handlng collnear data Covarance matrx s not nvertble (large condton number) Robustness

More information

Face Recognition University at Buffalo CSE666 Lecture Slides Resources:

Face Recognition University at Buffalo CSE666 Lecture Slides Resources: Face Recognton Unversty at Buffalo CSE666 Lecture Sldes Resources: http://www.face-rec.org/algorthms/ Overvew of face recognton algorthms Correlaton - Pxel based correspondence between two face mages Structural

More information

Support Vector Machines

Support Vector Machines Support Vector Machnes Decson surface s a hyperplane (lne n 2D) n feature space (smlar to the Perceptron) Arguably, the most mportant recent dscovery n machne learnng In a nutshell: map the data to a predetermned

More information

Solving two-person zero-sum game by Matlab

Solving 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 information

Parallel Numerics. 1 Preconditioning & Iterative Solvers (From 2016)

Parallel 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 information

NAG Fortran Library Chapter Introduction. G10 Smoothing in Statistics

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

More information

Solutions to Programming Assignment Five Interpolation and Numerical Differentiation

Solutions to Programming Assignment Five Interpolation and Numerical Differentiation College of Engneerng and Coputer Scence Mechancal Engneerng Departent Mechancal Engneerng 309 Nuercal Analyss of Engneerng Systes Sprng 04 Nuber: 537 Instructor: Larry Caretto Solutons to Prograng Assgnent

More information

An Optimal Algorithm for Prufer Codes *

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

More information

Radial Basis Functions

Radial Basis Functions Radal Bass Functons Mesh Reconstructon Input: pont cloud Output: water-tght manfold mesh Explct Connectvty estmaton Implct Sgned dstance functon estmaton Image from: Reconstructon and Representaton of

More information

Support Vector Machines

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

More information

Adaptive Virtual Support Vector Machine for the Reliability Analysis of High-Dimensional Problems

Adaptive Virtual Support Vector Machine for the Reliability Analysis of High-Dimensional Problems Proceedngs of the ASME 2 Internatonal Desgn Engneerng Techncal Conferences & Computers and Informaton n Engneerng Conference IDETC/CIE 2 August 29-3, 2, Washngton, D.C., USA DETC2-47538 Adaptve Vrtual

More information

Meta-heuristics for Multidimensional Knapsack Problems

Meta-heuristics for Multidimensional Knapsack Problems 2012 4th Internatonal Conference on Computer Research and Development IPCSIT vol.39 (2012) (2012) IACSIT Press, Sngapore Meta-heurstcs for Multdmensonal Knapsack Problems Zhbao Man + Computer Scence Department,

More information

Lecture #15 Lecture Notes

Lecture #15 Lecture Notes Lecture #15 Lecture Notes The ocean water column s very much a 3-D spatal entt and we need to represent that structure n an economcal way to deal wth t n calculatons. We wll dscuss one way to do so, emprcal

More information

Angle-Independent 3D Reconstruction. Ji Zhang Mireille Boutin Daniel Aliaga

Angle-Independent 3D Reconstruction. Ji Zhang Mireille Boutin Daniel Aliaga Angle-Independent 3D Reconstructon J Zhang Mrelle Boutn Danel Alaga Goal: Structure from Moton To reconstruct the 3D geometry of a scene from a set of pctures (e.g. a move of the scene pont reconstructon

More information

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision

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

More information

Problem Definitions and Evaluation Criteria for Computational Expensive Optimization

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

More information

Proper Choice of Data Used for the Estimation of Datum Transformation Parameters

Proper Choice of Data Used for the Estimation of Datum Transformation Parameters Proper Choce of Data Used for the Estmaton of Datum Transformaton Parameters Hakan S. KUTOGLU, Turkey Key words: Coordnate systems; transformaton; estmaton, relablty. SUMMARY Advances n technologes and

More information

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

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

More information

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS

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

More information

MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION

MULTISPECTRAL 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 information

High resolution 3D Tau-p transform by matching pursuit Weiping Cao* and Warren S. Ross, Shearwater GeoServices

High resolution 3D Tau-p transform by matching pursuit Weiping Cao* and Warren S. Ross, Shearwater GeoServices Hgh resoluton 3D Tau-p transform by matchng pursut Wepng Cao* and Warren S. Ross, Shearwater GeoServces Summary The 3D Tau-p transform s of vtal sgnfcance for processng sesmc data acqured wth modern wde

More information

SVM-based Learning for Multiple Model Estimation

SVM-based Learning for Multiple Model Estimation SVM-based Learnng for Multple Model Estmaton Vladmr Cherkassky and Yunqan Ma Department of Electrcal and Computer Engneerng Unversty of Mnnesota Mnneapols, MN 55455 {cherkass,myq}@ece.umn.edu Abstract:

More information

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

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

More information

Determining the Optimal Bandwidth Based on Multi-criterion Fusion

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

More information

A Fast Visual Tracking Algorithm Based on Circle Pixels Matching

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

More information

Analysis of Continuous Beams in General

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

More information

Image Representation & Visualization Basic Imaging Algorithms Shape Representation and Analysis. outline

Image Representation & Visualization Basic Imaging Algorithms Shape Representation and Analysis. outline mage Vsualzaton mage Vsualzaton mage Representaton & Vsualzaton Basc magng Algorthms Shape Representaton and Analyss outlne mage Representaton & Vsualzaton Basc magng Algorthms Shape Representaton and

More information

TECHNICAL TRANSACTIONS 7/2017 CZASOPISMO TECHNICZNE 7/2017 MECHANICS

TECHNICAL TRANSACTIONS 7/2017 CZASOPISMO TECHNICZNE 7/2017 MECHANICS TECHCAL TRASACTOS 7/207 CZASOPSMO TECHCZE 7/207 MECHACS DO: 0.4467/2353737XCT.7.5.6656 Artur Krowa (rowa@mech.p.edu.pl) nsttute of Computer Scence, Faculty of Mechancal Engneerng, Cracow Unversty of Technology

More information

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

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

More information

LS-TaSC Version 2.1. Willem Roux Livermore Software Technology Corporation, Livermore, CA, USA. Abstract

LS-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 information

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

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

More information

S.P.H. : A SOLUTION TO AVOID USING EROSION CRITERION?

S.P.H. : A SOLUTION TO AVOID USING EROSION CRITERION? S.P.H. : A SOLUTION TO AVOID USING EROSION CRITERION? Célne GALLET ENSICA 1 place Emle Bloun 31056 TOULOUSE CEDEX e-mal :cgallet@ensca.fr Jean Luc LACOME DYNALIS Immeuble AEROPOLE - Bat 1 5, Avenue Albert

More information

y and the total sum of

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

More information

Programming in Fortran 90 : 2017/2018

Programming 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 information

Wavefront Reconstructor

Wavefront Reconstructor A Dstrbuted Smplex B-Splne Based Wavefront Reconstructor Coen de Vsser and Mchel Verhaegen 14-12-201212 2012 Delft Unversty of Technology Contents Introducton Wavefront reconstructon usng Smplex B-Splnes

More information

3D vector computer graphics

3D 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 information

An Indian Journal FULL PAPER ABSTRACT KEYWORDS. Trade Science Inc.

An 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 information

Review of approximation techniques

Review of approximation techniques CHAPTER 2 Revew of appromaton technques 2. Introducton Optmzaton problems n engneerng desgn are characterzed by the followng assocated features: the objectve functon and constrants are mplct functons evaluated

More information

Solitary and Traveling Wave Solutions to a Model. of Long Range Diffusion Involving Flux with. Stability Analysis

Solitary and Traveling Wave Solutions to a Model. of Long Range Diffusion Involving Flux with. Stability Analysis Internatonal Mathematcal Forum, Vol. 6,, no. 7, 8 Soltary and Travelng Wave Solutons to a Model of Long Range ffuson Involvng Flux wth Stablty Analyss Manar A. Al-Qudah Math epartment, Rabgh Faculty of

More information

Feature Reduction and Selection

Feature Reduction and Selection Feature Reducton and Selecton Dr. Shuang LIANG School of Software Engneerng TongJ Unversty Fall, 2012 Today s Topcs Introducton Problems of Dmensonalty Feature Reducton Statstc methods Prncpal Components

More information

Positive Semi-definite Programming Localization in Wireless Sensor Networks

Positive Semi-definite Programming Localization in Wireless Sensor Networks Postve Sem-defnte Programmng Localzaton n Wreless Sensor etworks Shengdong Xe 1,, Jn Wang, Aqun Hu 1, Yunl Gu, Jang Xu, 1 School of Informaton Scence and Engneerng, Southeast Unversty, 10096, anjng Computer

More information

The Man-hour Estimation Models & Its Comparison of Interim Products Assembly for Shipbuilding

The Man-hour Estimation Models & Its Comparison of Interim Products Assembly for Shipbuilding Internatonal Journal of Operatons Research Internatonal Journal of Operatons Research Vol., No., 9 4 (005) The Man-hour Estmaton Models & Its Comparson of Interm Products Assembly for Shpbuldng Bn Lu and

More information

BOOSTING CLASSIFICATION ACCURACY WITH SAMPLES CHOSEN FROM A VALIDATION SET

BOOSTING CLASSIFICATION ACCURACY WITH SAMPLES CHOSEN FROM A VALIDATION SET 1 BOOSTING CLASSIFICATION ACCURACY WITH SAMPLES CHOSEN FROM A VALIDATION SET TZU-CHENG CHUANG School of Electrcal and Computer Engneerng, Purdue Unversty, West Lafayette, Indana 47907 SAUL B. GELFAND School

More information

An efficient method to build panoramic image mosaics

An efficient method to build panoramic image mosaics An effcent method to buld panoramc mage mosacs Pattern Recognton Letters vol. 4 003 Dae-Hyun Km Yong-In Yoon Jong-Soo Cho School of Electrcal Engneerng and Computer Scence Kyungpook Natonal Unv. Abstract

More information

Categories and Subject Descriptors B.7.2 [Integrated Circuits]: Design Aids Verification. General Terms Algorithms

Categories and Subject Descriptors B.7.2 [Integrated Circuits]: Design Aids Verification. General Terms Algorithms 3. Fndng Determnstc Soluton from Underdetermned Equaton: Large-Scale Performance Modelng by Least Angle Regresson Xn L ECE Department, Carnege Mellon Unversty Forbs Avenue, Pttsburgh, PA 3 xnl@ece.cmu.edu

More information

Why visualisation? IRDS: Visualization. Univariate data. Visualisations that we won t be interested in. Graphics provide little additional information

Why visualisation? IRDS: Visualization. Univariate data. Visualisations that we won t be interested in. Graphics provide little additional information Why vsualsaton? IRDS: Vsualzaton Charles Sutton Unversty of Ednburgh Goal : Have a data set that I want to understand. Ths s called exploratory data analyss. Today s lecture. Goal II: Want to dsplay data

More information

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

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

More information

Backpropagation: In Search of Performance Parameters

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

More information

Simulation Based Analysis of FAST TCP using OMNET++

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

More information

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

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

More information

X- Chart Using ANOM Approach

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

More information

Three supervised learning methods on pen digits character recognition dataset

Three supervised learning methods on pen digits character recognition dataset Three supervsed learnng methods on pen dgts character recognton dataset Chrs Flezach Department of Computer Scence and Engneerng Unversty of Calforna, San Dego San Dego, CA 92093 cflezac@cs.ucsd.edu Satoru

More information

Case. Anoop. A. Mullur. Sirisha. Pseudo Response Surfaces

Case. Anoop. A. Mullur. Sirisha. Pseudo Response Surfaces Case Studes n Pareto Set Identfcaton Usng Pseudo Response Surfaces Anoop A. Mullur Achlle Messac Srsha Rangavajhala Correspondng Author Achlle Messac, Ph.D. Dstngushed Professor and Department Char Mechancal

More information

Fuzzy Model Identification Using Support Vector Clustering Method

Fuzzy Model Identification Using Support Vector Clustering Method Fuzzy Model Identfcaton Usng Support Vector Clusterng Method $\úhj OUçar, Yakup Demr, and Cüneyt * ]HOLú Electrcal and Electroncs Engneerng Department, Engneerng Faculty, ÕUDW Unversty, Elazg, Turkey agulucar@eee.org,ydemr@frat.edu.tr

More information

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

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

More information

R s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes

R s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes SPH3UW Unt 7.3 Sphercal Concave Mrrors Page 1 of 1 Notes Physcs Tool box Concave Mrror If the reflectng surface takes place on the nner surface of the sphercal shape so that the centre of the mrror bulges

More information

An Image Fusion Approach Based on Segmentation Region

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

More information

Load Balancing for Hex-Cell Interconnection Network

Load 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 information

Biostatistics 615/815

Biostatistics 615/815 The E-M Algorthm Bostatstcs 615/815 Lecture 17 Last Lecture: The Smplex Method General method for optmzaton Makes few assumptons about functon Crawls towards mnmum Some recommendatons Multple startng ponts

More information

APPLICATION OF A COMPUTATIONALLY EFFICIENT GEOSTATISTICAL APPROACH TO CHARACTERIZING VARIABLY SPACED WATER-TABLE DATA

APPLICATION OF A COMPUTATIONALLY EFFICIENT GEOSTATISTICAL APPROACH TO CHARACTERIZING VARIABLY SPACED WATER-TABLE DATA RFr"W/FZD JAN 2 4 1995 OST control # 1385 John J Q U ~ M Argonne Natonal Laboratory Argonne, L 60439 Tel: 708-252-5357, Fax: 708-252-3 611 APPLCATON OF A COMPUTATONALLY EFFCENT GEOSTATSTCAL APPROACH TO

More information

USING LINEAR REGRESSION FOR THE AUTOMATION OF SUPERVISED CLASSIFICATION IN MULTITEMPORAL IMAGES

USING LINEAR REGRESSION FOR THE AUTOMATION OF SUPERVISED CLASSIFICATION IN MULTITEMPORAL IMAGES USING LINEAR REGRESSION FOR THE AUTOMATION OF SUPERVISED CLASSIFICATION IN MULTITEMPORAL IMAGES 1 Fetosa, R.Q., 2 Merelles, M.S.P., 3 Blos, P. A. 1,3 Dept. of Electrcal Engneerng ; Catholc Unversty of

More information

APPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT

APPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT 3. - 5. 5., Brno, Czech Republc, EU APPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT Abstract Josef TOŠENOVSKÝ ) Lenka MONSPORTOVÁ ) Flp TOŠENOVSKÝ

More information

Design for Reliability: Case Studies in Manufacturing Process Synthesis

Design for Reliability: Case Studies in Manufacturing Process Synthesis Desgn for Relablty: Case Studes n Manufacturng Process Synthess Y. Lawrence Yao*, and Chao Lu Department of Mechancal Engneerng, Columba Unversty, Mudd Bldg., MC 473, New York, NY 7, USA * Correspondng

More information

Lobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide

Lobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide Lobachevsky State Unversty of Nzhn Novgorod Polyhedron Quck Start Gude Nzhn Novgorod 2016 Contents Specfcaton of Polyhedron software... 3 Theoretcal background... 4 1. Interface of Polyhedron... 6 1.1.

More information

CS 534: Computer Vision Model Fitting

CS 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 information

Data Mining For Multi-Criteria Energy Predictions

Data Mining For Multi-Criteria Energy Predictions Data Mnng For Mult-Crtera Energy Predctons Kashf Gll and Denns Moon Abstract We present a data mnng technque for mult-crtera predctons of wnd energy. A mult-crtera (MC) evolutonary computng method has

More information

The Research of Support Vector Machine in Agricultural Data Classification

The 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 information

Data Mining: Model Evaluation

Data Mining: Model Evaluation Data Mnng: Model Evaluaton Aprl 16, 2013 1 Issues: Evaluatng Classfcaton Methods Accurac classfer accurac: predctng class label predctor accurac: guessng value of predcted attrbutes Speed tme to construct

More information

Some material adapted from Mohamed Younis, UMBC CMSC 611 Spr 2003 course slides Some material adapted from Hennessy & Patterson / 2003 Elsevier

Some 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 information

A New Token Allocation Algorithm for TCP Traffic in Diffserv Network

A New Token Allocation Algorithm for TCP Traffic in Diffserv Network A New Token Allocaton Algorthm for TCP Traffc n Dffserv Network A New Token Allocaton Algorthm for TCP Traffc n Dffserv Network S. Sudha and N. Ammasagounden Natonal Insttute of Technology, Truchrappall,

More information

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

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

More information

A Five-Point Subdivision Scheme with Two Parameters and a Four-Point Shape-Preserving Scheme

A Five-Point Subdivision Scheme with Two Parameters and a Four-Point Shape-Preserving Scheme Mathematcal and Computatonal Applcatons Artcle A Fve-Pont Subdvson Scheme wth Two Parameters and a Four-Pont Shape-Preservng Scheme Jeqng Tan,2, Bo Wang, * and Jun Sh School of Mathematcs, Hefe Unversty

More information

Metamodels in design of GFRP composite stiffened deck structure

Metamodels in design of GFRP composite stiffened deck structure Metamodels n desgn of GFRP composte stffened deck structure Kaspars Kalnns * and Olgerts Ozolns Rga Techncal Unversty, Insttute of Materals and Structures, Azenes 6/0, Rga, LV-048, Latva Gnts Jekabsons

More information

Computer Animation and Visualisation. Lecture 4. Rigging / Skinning

Computer Animation and Visualisation. Lecture 4. Rigging / Skinning Computer Anmaton and Vsualsaton Lecture 4. Rggng / Sknnng Taku Komura Overvew Sknnng / Rggng Background knowledge Lnear Blendng How to decde weghts? Example-based Method Anatomcal models Sknnng Assume

More information

Sequential Projection Maximin Distance Sampling Method

Sequential Projection Maximin Distance Sampling Method APCOM & ISCM 11-14 th December, 2013, Sngapore Sequental Projecton Maxmn Dstance Samplng Method J. Jang 1, W. Lm 1, S. Cho 1, M. Lee 2, J. Na 3 and * T.H. Lee 1 1 Department of automotve engneerng, Hanyang

More information

Outline. Discriminative classifiers for image recognition. Where in the World? A nearest neighbor recognition example 4/14/2011. CS 376 Lecture 22 1

Outline. Discriminative classifiers for image recognition. Where in the World? A nearest neighbor recognition example 4/14/2011. CS 376 Lecture 22 1 4/14/011 Outlne Dscrmnatve classfers for mage recognton Wednesday, Aprl 13 Krsten Grauman UT-Austn Last tme: wndow-based generc obect detecton basc ppelne face detecton wth boostng as case study Today:

More information

Analysis on the Workspace of Six-degrees-of-freedom Industrial Robot Based on AutoCAD

Analysis on the Workspace of Six-degrees-of-freedom Industrial Robot Based on AutoCAD Analyss on the Workspace of Sx-degrees-of-freedom Industral Robot Based on AutoCAD Jn-quan L 1, Ru Zhang 1,a, Fang Cu 1, Q Guan 1 and Yang Zhang 1 1 School of Automaton, Bejng Unversty of Posts and Telecommuncatons,

More information

Optimal Workload-based Weighted Wavelet Synopses

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

More information