A Linear Response Surface based on SVM for Structural Reliability Analysis
|
|
- Jonah Garrison
- 5 years ago
- Views:
Transcription
1 APCOM & ISCM -4 th December, 03, Sngapore A Lnear Response Surace based on SVM or Structural Relablty Analyss U. Albrand, C.Y. Ma, and C.G. Koh Department o Cvl and Envronmental Engneerng, Natonal Unversty o Sngapore, 7576 Sngapore Correspondng author: umberto.albrand@nus.edu.sg Key Words: Structural Relablty Analyss, FORM, desgn pont, Response Surace, Support Vector Method, Monte Carlo Smulaton Abstract The Structural Relablty theory allows the ratonal treatment o the uncertantes and gves the methods or the evaluaton o the saety o structures n presence o uncertan parameters. The man challenge s the computatonal cost, snce the alure probablty wth respect to an assgned lmt state s gven as the soluton o a very complcated multdmensonal ntegral. The most robust procedure s the Monte Carlo Smulaton (MCS), but especally n ts crude orm s very demandng. For ths reason, wde popularty has been ganed by the Frst Order Relablty Method (FORM) by ts smplcty and computatonal ecency. However, or strongly nonlnear systems the FORM approxmaton s not very close to the exact one. To ths am, n ths paper we ntroduce a novel Lnear approxmaton o the lmt state, based on the Support Vector Method (SVM), and whch allows to mprove the FORM soluton, startng rom the knowledge o the desgn pont. Introducton Recently t has been largely recognzed that a realstc analyss o the structural systems should take nto account all the unavodable uncertantes appearng n the problem at hand. In ths context a powerul tool s represented rom the structural relablty theory (Madsen et al. 986, Dtlevsen & Madsen 999, Melchers, 999) whch gves a ratonal treatment o the uncertantes and whch allows the assessment o the evaluaton o the saety o structures n presence o uncertan parameters. The alure probablty P wth respect to an assgned lmt state s dened as P X ( x) dx () g x0 where x s an n vector collectng the basc random varables, y g( x ) s the Lmt State Functon (LSF), g( x ) 0 s the Lmt State Surace (LSS) separatng the alure set g( x ) 0 rom the sae set g( x ) 0, ( x ) s the jont probablty densty uncton o the random varables X x, x,, x. The evaluaton o the alure probablty n P s known n closed orm only or a very restrcted number o cases, n the most general case t s necessary to solve numercally a multdmensonal ntegral, whch s computatonally demandng. The most robust procedure or the evaluaton o the alure probablty s represented by the Monte Carlo Smulaton (MCS), whch however, especally n ts crude orm, requres an excessve computatonal eort or the evaluaton o the very small alure probabltes. For ths reason, wde popularty has been ganed by the Frst Order Relablty Method (FORM) by ts smplcty and computatonal ecency, moreover extensve numercal expermentaton has
2 shown that t gves good approxmatons o the alure probablty or most practcal problems. However, t s known that the FORM approxmaton s not adequate or lmt state suraces whch depart sgncantly rom lnearty around the desgn pont. In ths paper we overcome ths shortcomng wth a partcular type o Response Surace Methodology (RSM) based on the Support Vector Method (SVM) and the theory o the statstcal learnng (Vapnk 995, Burges 998). The basc dea o the RSM s the buldng o a surrogate model o the target lmt state uncton, dened n a smple and explct mathematcal orm; once the Response Surace (RS) s bult, t s possble to substtute the RS wth the target LSF, and then t s no longer necessary to run demandng nte element analyses; startng rom ths denton, FORM tsel s a partcular knd o RS, whch approxmates the LSS wth the hyperplane passng through the desgn pont u and normal to the desgn pont drecton, the latter beng the ray jonng the orgn o the standard normal space wth the desgn pont. The RS models can be bult to nd the desgn pont wth reduced computatonal cost (Bucher & Burgound 990, Albrand & Der Kureghan 0); recently, many alternatve response surace methodologes have been proposed, whose am s the mprovement o the FORM approxmaton (Bucher & Most, 008; Albrand & Rccard 005, Albrand & Rccard 008, Albrand, Impollona & Rccard 00). To the latter cathegory belong the RS approaches based on the SVM (Hurtado 004; Albrand & Rccard 0). Usng the SVM the relablty problem s treated as a classcaton approach (Hurtado & Alvarez 003), snce we are not nterested to the exact value o the LSF, but only to ts sgn. Thereore the samples are labelled wth the value (sae sample) and (unsae sample) and ths requste s less strong than approxmatng the exact value o the LSF. In the exstng approaches based on SVM, the mprovement o the FORM soluton s obtaned by choosng non-lnear models or approxmatng the lmt state; conversely, n ths paper, we adopt a smple lnear model, where the constrants o correct classcaton are relaxed, acceptng thereore that some ponts may be msclassed (Albrand 0) The startng model s bult choosng a set o sample ponts along the desgn pont drecton, the latter beng the drecton o probablstc nterest. In ths way, startng rom the knowledge o the desgn pont, t s possble to approxmate the lmt state wth an hyperplane close to FORM but secant to the lmt state, gvng rse to an alternatve Lnear response surace based on SVM (LSVM), and gvng a better approxmaton than FORM. Structural Relablty Analyss as a classcaton approach Usually the multdmensonal ntegral () s very dcult to be evaluated, and then some approxmate technques are used. As a rst step, a probablstc coordnate transormaton s done toward the standard normal space and the alure probablty s gven as P U ( u) du () g u0 In () the ntegrand uncton s the multvarate normal standard probablty densty uncton (pd), whle the ntegraton doman s the regon alure g( u ) 0. Accordng to (), the alure probablty can be obtaned usng the Monte Carlo Smulaton (MCS), consderng a set o N samples u, u,, un and evaluatng the rato between the number N o samples belongng to the alure regon g( u ) 0 and the total number o smulated samples N :
3 N N P, MCS I g( j ) 0 N N u (3) j where I[ ] s an ndcator uncton, equal to g( u ) 0 and zero otherwse. The qualty o the obtaned approxmaton s determned evaluatng the coecent o varaton o P, MCS ; t s however well known that the MCS, especally n ts crude orm, requres an excessve computatonal eort. Alternatvely, a good estmate o () s obtaned by approxmatng the target Lmt State Functon (LSF) y g( u ), usually complcated and mplct, wth an approxmate model y g ( u), called Response Surace (RS). Once the RS s bult, t s no longer necessary to run demandng Fnte Element Analyses, but we can use the surrogate model. In the ollowng we wll consder only problems where the lmt state surace has nether peak or valleys, nor multple desgn ponts. From (3) t s seen that we are not nterested to the value y g( u ) o the LSF, but to ts sgn z sgn[ g( u )], so that the ponts u belongng to the sae regon have the value z, and the ponts u belongng to the alure regon have the value z. It s easy to see that the buldng o a surrogate model y g ( u) such that t satses only the sgn constrants z sgn[ g( u )], s equvalent to the buldng o a RS whch models drectly the LSS. Then, accordng to the RS Methodology, the estmated alure probablty can be evaluated usng (3), by substtutng the ndcator uncton I[ g( u ) 0] wth I[ g ( u ) 0]. j j A uncton whch separates the ponts belongng to the sae set rom the ones belongng to the alure set, s named classer, snce attrbutes a class ( sae or alure ) to each pont. The LSS g u s the target classer, whle a RS whch approxmates the LSS, s able to classy 0 correctly only a lmted number o ponts. Clearly, because the RS works well, t s necessary that t classes correctly the ponts at least n the regon o probablstc nterest. j A Lnear Response Surace based on SVM Let be known a set o m samplng ponts u, u,, um, whle y, y,, ym and z, z,, zm be the correspondng values o the LSF y g( u ) and sgns z sgn[ g( u )], respectvely. Suppose that the target LSS s lnear, g( u) a u c, then the samplng ponts u are lnearly separable. Consder now the approxmated LSS gˆ( u) w u b, where w determnes the orentaton o the plane, whle the scalar b determnes the oset o the plane rom the orgn. Clearly, when the number o support ponts converges toward nnty m, then the lnear classcaton uncton becomes concdng wth the target LSS,.e. w a, b c. Conversely, or a lmted number o support ponts, there are nnte possble planes that classy the ponts correctly. Intutvely, a hyperplane that passes too close to the samplng ponts wll be less lkely to generalze well or the unseen data, whle t seems reasonable to expect that a hyperplane that s arthest rom all ponts wll have better generalzaton capabltes. Gven a set o m samplng ponts, the margn s dened as the mnmum dstance between ponts belongng to derent classes. Thereore, the optmal separatng hyperplane s the one maxmzng the margn. Recall rom the elementary geometry that the dstance o a pont u rom the hyperplane gˆ( u ) 0 reads as w u b w ; notcng that gˆ( u) w u b 0 s nvarant under a postve rescalng, we choose the soluton or whch the uncton yˆ gˆ( u ) becomes one or the ponts 3
4 closest to the boundary,.e. w u b. The couple o hyperplanes gˆ ( u) w u b, u g( u ) 0 and gˆ ( u) w u b, u g( u ) 0, are called canoncal hyperplanes (or support hyperplanes). The dstance rom the closest ponts to the boundary gˆ( u ) 0 s w, and the margn becomes M w, as shown n Fgure (a). s u a u b w w u b w b w gˆ( u) 0 0 gˆ( u) 0 u u Fgure. (a) Lnear SVM, (b) Non-lnearly separable SVM Maxmzng the margn s equvalent to mnmze w, gvng rse to the ollowng Quadratc Programmng (QP) problem mn w w, b s. t. z w u b,,,, m (4) where the nequalty constrants are equvalent to w u b, u g( u ) 0, and w u b, u g( u ) 0. It s here noted that (4) s a standard convex optmzaton problem, so the unqueness o the soluton s guaranteed and moreover there are many robust algorthms that can eectvely solve t. Among the m samplng ponts, the support vectors are the m SV ponts lyng on the support hyperplanes w u b ; n Fgure (a) the support vectors are represented rom the lled markers. It s seen that only the support vectors contrbute to denng the optmal hyperplane, thus, the complete samplng set could be replaced by only the m SV support vectors, and the separatng hyperplane would be the same. Suppose now that the LSS s non-lnear, so that t s not possble to denty an hyperplane whch correctly classes all the samplng ponts. To ths am, we relax the constrants o (4) by ntroducng the slack varables 0, gvng rse to w u b, u g( u ) 0 and w u b, u g( u ) 0. The varables gve a measure o the departure rom the condton o correct classcaton. In partcular, when 0 the pont s well classed but alls nsde the margn, whle when the pont s not well classed. Fnally, 0 the pont s 4
5 correctly classed, see Fgure (b). Under ths hypothess, the optmal separatng hyperplane has maxmum margn wth mnmum classcaton error. The optmzaton problem (4) becomes m mn w w, b, ξ s. t. z wu b,,,, m 0,,, m (5) Outlne o the procedure It wll be used the ollowng teratve procedure: Probablstc transormaton toward the n-dmensonal standard normal space, as t s usually done n relablty analyss; Evaluaton o the desgn pont wth the FORM approxmaton P u and o the correspondng relablty ndex, FORM, see Fgure. u 3 Choce o a set o samplng ponts u k, k,, along the desgn pont drecton, together u u. Classcaton o alure and sae ponts belongng to the drecton through zk sgn[ g( u k )] ; 4 Buldng o a rst LSVM model through (5), together wth ts margns; 5 Choce o a new pont u k nsde the margn and ts classcaton; 6 Buldng o the SVM model through (5) and evaluaton o the estmated alure probablty. Snce the LSVM s a lnear response surace we have P, LSVM LSVM, LSVM beng the dstance o the LSVM rom the orgn o the standard normal space. 7 I the convergence on P s acheved stop, else go to step 5. u LSVM u FORM g u 0 LSVM Fgure. FORM and LSVM u 5
6 Example Statc Analyss o a -do rame As a rst example, we appled the proposed approach to a shear type rame wth two-stores, subjected to two determnstc concentrated loads, F F F wth random stnesses k k( x) and k k( x), beng F, k k and the luctuatons x, x modelled as two ndependent Gaussan random varables wth zero mean and standard devaton 0.0 (Fgure 3a). Be X ( x, x ) the horzontal dsplacement o the second storey, and the consdered lmt state s g( x, x) X ( x, x ) X,lm, wth X,lm.5. The alure probablty s 3 P obtaned usng MCS, wth an estmated coecent o varaton equal to P %, and requred,050,848 analyses. The correspondng generalzed relablty ndex s P.348. G a) F b) 5 4 LSVM k k F 3 u k k u FORM g u u Fgure 3. Example : (a) -do shear-type rame, (b) LSS, FORM and LSVM As shown n Fgure 3(b), the LSS s nonlnear, and The FORM soluton gves a alure probablty 3 P, FORM.593 0, wth a relatve error e.97%. The LSVM acheves the convergence FORM ater 38 samples, obtanng.344 and correspondng alure probablty P LSVM, (relatve error elsvm 0.46% ). In Fgure 4(a) we represent the obtaned alure probabltes n terms o the number o samples, whle n Fgure 4(b) the correspondng relatve errors are shown P 30 P,FORM P,LSVM 0 Falure Probablty 0-4 Error (%) e FORM e LSVM samples samples Fgure 4. Example : (a) Falure Probablty, (b) Relatve error, n terms o the number o samples 6
7 Example Nonlnear random waves Let S XX ( ) a wave spectrum parttoned nto N components o equal nterval. The secondorder wave elevaton s represented as (Longeut-Hggns 963, Moarezadeh & Melchers 006) N N N (6) u u u n n nm n m n n m where u, u,, u N are normal standard random varables, whle and are the rst and second order terms o the nonlnear sea elevaton,, 0, n n n N nm mn n, m n m, nn, m N max n, m n m, nn, m n, mn 0 g g n, m,,, N (7) beng, wth n G n G the spectral densty uncton o the sea elevaton. As a case study, we consdered the JONSWAP spectrum wth a shape actor o unty 5 4 G a exp[.5( p ) ], where p 0.4 rad/sec s the peak requency, a s a scalng actor that s selected so that the area under the spectrum s 5 m (Low 03). The spectrum s dvded nto N 40 harmonc components rom 0. to. rad/sec. It s requred to evaluate the probablty that the wave elevaton s greater than 5 m, that s P =Prob[ 5] ; the Lmt State Functon s G 5 u u, whle the number o basc random varables s n N 80. It s here noted that ( u ) s a quadratc uncton o the normal standard random varables, rom whch t ollows the nonlnearty o the Lmt State Surace. 4 The exact soluton obtaned wth a MCS s wth a coecent o varaton 5% and t requred 3,863,373 samples. The FORM approxmaton s P P P FORM,.5 0 wth a relatve error eform.%, whle the LSVM, ater 355 samples, gves 4 P, LSVM.0 0 ( elsvm.8% ). In Fgure 5 we represent the obtaned alure probabltes and the correspondng relatve errors n terms o the number o samples P 0 e FORM P,SVM 5 e SVM 0 Falure Probablty 0-4 Error (%) samples samples Fgure 5. Example : (a) Falure Probablty, (b) Relatve error, n terms o the number o samples 7
8 Conclusons FORM s a powerul tool or Structural Relablty Analyss, and n most cases o practcal nterest t gves a good approxmaton o the alure probablty. However, or lmt state suraces whch depart sgncantly rom lnearty around the desgn pont, the FORM soluton may be nadequate. In ths paper we presented a Lnear response surace based on SVM, called LSVM, whch startng rom the desgn pont drecton, allows an mprovement o FORM, requrng a reduced number o samplng ponts. Two smple numercal examples showed the accuracy and eectveness o the presented procedure. Acknowledgements The authors would lke to acknowledge the research grants (R ) unded by the Agency or Scence, Technology and Research o Sngapore. Reerences Albrand U. An alternatve lnear response surace mprovng FORM soluton or stochastc dynamc analyss, Relablty and Optmzaton o Structural Systems, IFIP WG 7.5 Workng conerence, 4-7 June 0, Yerevan, Armena Albrand U. & Der Kureghan A. (0), A Gradent-Free Method or Determnng the Desgn Pont n Nonlnear Stochastc Dynamc Analyss, Probablstc Engneerng Mechancs, 8, -0. Albrand U., Impollona N. & Rccard G. (00). Probablstc Egenvalue Bucklng Analyss solved through the Rato o Polynomal Response Surace, Computer Methods n Appled Mechancs and Engneerng, 99(9-), Albrand U. & Rccard G. (005), Bounds o the probablty o collapse o rgd-plastc structures by means o Stochastc Lmt Analyss, 9th Internatonal Conerence on Structural Saety and Relablty, Rome, Italy, 9-3 June 005 Albrand U. & Rccard G. (008), The use o stochastc stresses n the statc approach o probablstc lmt analyss. Internatonal Journal or Numercal Methods n Engneerng, 73(6), Albrand U. & Rccard G. (0). Structural Relablty Analyss solved through a SVM-based Response Surace, ICASP 0, The th Internatonal Conerence on applcatons o Statstcs and Probablty n Cvl Engneerng, -4 August 0, Zurch, Swtzerland Bucher C. & Burgound U. (990), A ast and ecent response surace approach or structural relablty problems, Structural Saety, 7, Bucher, C. & Most, T. (008), A comparson o approxmate response unctons n structural relablty analyss, Probablstc Engneerng Mechancs, 3, Burges, C.J.C. (998), A tutoral on Support Vector Machnes or Pattern Recognton. Data Mnng and Knowledge Dscovery : -67 Dtlevsen O., Madsen H.O. (999), Structural Relablty Methods, Wley Hurtado, J.E. & Alvarez, D.A. (003). A classcaton approach or relablty analyss wth stochastc nte element modellng, Journal o Structural Engneerng, 9, Hurtado, J.E. (004), An examnaton o methods or approxmatng mplct lmt state unctons rom the vewpont o statstcal learnng theory, Structural Saety, 6, Longeut-Hggns MS (963). The eect o nonlneartes on statstcal dstrbutons n the theory o sea wave, J Flud Mech, 7(3): Low Y.M. (03). A new dstrbuton or ttng our moments and ts applcatons to relablty analyss, Structural Saety, 4, -5 Madsen H.O., Krenk S. & Lnd, N.C. (986). Methods o Structural Saety, Prentce-Hall. Melchers R.E. (999), Structural Relablty, analyss and predcton, New York: Wley & Sons. Moarezadeh MR & Melchers RE (006). Nonlnear wave theory n relablty analyss o oshore structures, Probablstc Engneerng Mechancs, (), 99-. Vapnk, V. (995), The Nature o Statstcal Learnng Theory, New York: Sprnger-Verlag. 8
Lecture Notes on Linear Regression
Lecture Notes on Lnear Regresson Feng L fl@sdueducn Shandong Unversty, Chna Lnear Regresson Problem In regresson problem, we am at predct a contnuous target value gven an nput feature vector We assume
More informationProbability, Statistics, and Reliability for Engineers and Scientists SIMULATION
CHATER robablty, Statstcs, and Relablty or Engneers and Scentsts Second Edton SIULATIO A. J. Clark School o Engneerng Department o Cvl and Envronmental Engneerng 7b robablty and Statstcs or Cvl Engneers
More informationRELIABILITY ASSESSMENT
CHAPTER Rsk Analyss n Engneerng and Economcs RELIABILITY ASSESSMENT A. J. Clark School of Engneerng Department of Cvl and Envronmental Engneerng 4a CHAPMAN HALL/CRC Rsk Analyss for Engneerng Department
More informationKernel Methods and SVMs Extension
Kernel Methods and SVMs Extenson The purpose of ths document s to revew materal covered n Machne Learnng 1 Supervsed Learnng regardng support vector machnes (SVMs). Ths document also provdes a general
More informationOPTIMISATION. Introduction Single Variable Unconstrained Optimisation Multivariable Unconstrained Optimisation Linear Programming
OPTIMIATION Introducton ngle Varable Unconstraned Optmsaton Multvarable Unconstraned Optmsaton Lnear Programmng Chapter Optmsaton /. Introducton In an engneerng analss, sometmes etremtes, ether mnmum or
More informationModule 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:
More informationStatistics and Probability Theory in Civil, Surveying and Environmental Engineering
Statstcs and Probablty Theory n Cvl, Surveyng and Envronmental Engneerng Pro. Dr. Mchael Havbro Faber ETH Zurch, Swtzerland Contents o Todays Lecture Overvew o Uncertanty Modelng Random Varables - propertes
More informationU.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017
U.C. Berkeley CS94: Beyond Worst-Case Analyss Handout 4s Luca Trevsan September 5, 07 Summary of Lecture 4 In whch we ntroduce semdefnte programmng and apply t to Max Cut. Semdefnte Programmng Recall that
More informationGeneralized Linear Methods
Generalzed Lnear Methods 1 Introducton In the Ensemble Methods the general dea s that usng a combnaton of several weak learner one could make a better learner. More formally, assume that we have a set
More informationSome modelling aspects for the Matlab implementation of MMA
Some modellng aspects for the Matlab mplementaton of MMA Krster Svanberg krlle@math.kth.se Optmzaton and Systems Theory Department of Mathematcs KTH, SE 10044 Stockholm September 2004 1. Consdered optmzaton
More informationMarkov Chain Monte Carlo (MCMC), Gibbs Sampling, Metropolis Algorithms, and Simulated Annealing Bioinformatics Course Supplement
Markov Chan Monte Carlo MCMC, Gbbs Samplng, Metropols Algorthms, and Smulated Annealng 2001 Bonformatcs Course Supplement SNU Bontellgence Lab http://bsnuackr/ Outlne! Markov Chan Monte Carlo MCMC! Metropols-Hastngs
More informationLinear Classification, SVMs and Nearest Neighbors
1 CSE 473 Lecture 25 (Chapter 18) Lnear Classfcaton, SVMs and Nearest Neghbors CSE AI faculty + Chrs Bshop, Dan Klen, Stuart Russell, Andrew Moore Motvaton: Face Detecton How do we buld a classfer to dstngush
More informationCS 3710: Visual Recognition Classification and Detection. Adriana Kovashka Department of Computer Science January 13, 2015
CS 3710: Vsual Recognton Classfcaton and Detecton Adrana Kovashka Department of Computer Scence January 13, 2015 Plan for Today Vsual recognton bascs part 2: Classfcaton and detecton Adrana s research
More informationComputational Biology Lecture 8: Substitution matrices Saad Mneimneh
Computatonal Bology Lecture 8: Substtuton matrces Saad Mnemneh As we have ntroduced last tme, smple scorng schemes lke + or a match, - or a msmatch and -2 or a gap are not justable bologcally, especally
More informationChapter 3 Differentiation and Integration
MEE07 Computer Modelng Technques n Engneerng Chapter Derentaton and Integraton Reerence: An Introducton to Numercal Computatons, nd edton, S. yakowtz and F. zdarovsky, Mawell/Macmllan, 990. Derentaton
More informationWhich Separator? Spring 1
Whch Separator? 6.034 - Sprng 1 Whch Separator? Mamze the margn to closest ponts 6.034 - Sprng Whch Separator? Mamze the margn to closest ponts 6.034 - Sprng 3 Margn of a pont " # y (w $ + b) proportonal
More informationP R. Lecture 4. Theory and Applications of Pattern Recognition. Dept. of Electrical and Computer Engineering /
Theory and Applcatons of Pattern Recognton 003, Rob Polkar, Rowan Unversty, Glassboro, NJ Lecture 4 Bayes Classfcaton Rule Dept. of Electrcal and Computer Engneerng 0909.40.0 / 0909.504.04 Theory & Applcatons
More informationKristin P. Bennett. Rensselaer Polytechnic Institute
Support Vector Machnes and Other Kernel Methods Krstn P. Bennett Mathematcal Scences Department Rensselaer Polytechnc Insttute Support Vector Machnes (SVM) A methodology for nference based on Statstcal
More informationLecture 2 Solution of Nonlinear Equations ( Root Finding Problems )
Lecture Soluton o Nonlnear Equatons Root Fndng Problems Dentons Classcaton o Methods Analytcal Solutons Graphcal Methods Numercal Methods Bracketng Methods Open Methods Convergence Notatons Root Fndng
More informationMMA and GCMMA two methods for nonlinear optimization
MMA and GCMMA two methods for nonlnear optmzaton Krster Svanberg Optmzaton and Systems Theory, KTH, Stockholm, Sweden. krlle@math.kth.se Ths note descrbes the algorthms used n the author s 2007 mplementatons
More informationLecture 10 Support Vector Machines. Oct
Lecture 10 Support Vector Machnes Oct - 20-2008 Lnear Separators Whch of the lnear separators s optmal? Concept of Margn Recall that n Perceptron, we learned that the convergence rate of the Perceptron
More informationJournal of Universal Computer Science, vol. 1, no. 7 (1995), submitted: 15/12/94, accepted: 26/6/95, appeared: 28/7/95 Springer Pub. Co.
Journal of Unversal Computer Scence, vol. 1, no. 7 (1995), 469-483 submtted: 15/12/94, accepted: 26/6/95, appeared: 28/7/95 Sprnger Pub. Co. Round-o error propagaton n the soluton of the heat equaton by
More informationSupport Vector Machines. Vibhav Gogate The University of Texas at dallas
Support Vector Machnes Vbhav Gogate he Unversty of exas at dallas What We have Learned So Far? 1. Decson rees. Naïve Bayes 3. Lnear Regresson 4. Logstc Regresson 5. Perceptron 6. Neural networks 7. K-Nearest
More informationA Bayes Algorithm for the Multitask Pattern Recognition Problem Direct Approach
A Bayes Algorthm for the Multtask Pattern Recognton Problem Drect Approach Edward Puchala Wroclaw Unversty of Technology, Char of Systems and Computer etworks, Wybrzeze Wyspanskego 7, 50-370 Wroclaw, Poland
More informationMATH 829: Introduction to Data Mining and Analysis The EM algorithm (part 2)
1/16 MATH 829: Introducton to Data Mnng and Analyss The EM algorthm (part 2) Domnque Gullot Departments of Mathematcal Scences Unversty of Delaware Aprl 20, 2016 Recall 2/16 We are gven ndependent observatons
More informationCIS526: Machine Learning Lecture 3 (Sept 16, 2003) Linear Regression. Preparation help: Xiaoying Huang. x 1 θ 1 output... θ M x M
CIS56: achne Learnng Lecture 3 (Sept 6, 003) Preparaton help: Xaoyng Huang Lnear Regresson Lnear regresson can be represented by a functonal form: f(; θ) = θ 0 0 +θ + + θ = θ = 0 ote: 0 s a dummy attrbute
More information: Numerical Analysis Topic 2: Solution of Nonlinear Equations Lectures 5-11:
764: Numercal Analyss Topc : Soluton o Nonlnear Equatons Lectures 5-: UIN Malang Read Chapters 5 and 6 o the tetbook 764_Topc Lecture 5 Soluton o Nonlnear Equatons Root Fndng Problems Dentons Classcaton
More information18-660: Numerical Methods for Engineering Design and Optimization
8-66: Numercal Methods for Engneerng Desgn and Optmzaton n L Department of EE arnege Mellon Unversty Pttsburgh, PA 53 Slde Overve lassfcaton Support vector machne Regularzaton Slde lassfcaton Predct categorcal
More informationPattern Classification
Pattern Classfcaton All materals n these sldes ere taken from Pattern Classfcaton (nd ed) by R. O. Duda, P. E. Hart and D. G. Stork, John Wley & Sons, 000 th the permsson of the authors and the publsher
More information2E Pattern Recognition Solutions to Introduction to Pattern Recognition, Chapter 2: Bayesian pattern classification
E395 - Pattern Recognton Solutons to Introducton to Pattern Recognton, Chapter : Bayesan pattern classfcaton Preface Ths document s a soluton manual for selected exercses from Introducton to Pattern Recognton
More informationSnce h( q^; q) = hq ~ and h( p^ ; p) = hp, one can wrte ~ h hq hp = hq ~hp ~ (7) the uncertanty relaton for an arbtrary state. The states that mnmze t
8.5: Many-body phenomena n condensed matter and atomc physcs Last moded: September, 003 Lecture. Squeezed States In ths lecture we shall contnue the dscusson of coherent states, focusng on ther propertes
More informationReliability-Based Design Optimization Under Stationary Stochastic Process Loads
Engneerng Optmzaton 015: 1-17 DOI: 10.1080/030515X.015.1100956 Relablty-Based Desgn Optmzaton Under Statonary Stochastc rocess Loads hen Hu and Xaopng Du 1 Department o Mechancal and Aerospace Engneerng
More informationChapter 11: Simple Linear Regression and Correlation
Chapter 11: Smple Lnear Regresson and Correlaton 11-1 Emprcal Models 11-2 Smple Lnear Regresson 11-3 Propertes of the Least Squares Estmators 11-4 Hypothess Test n Smple Lnear Regresson 11-4.1 Use of t-tests
More informationUsing T.O.M to Estimate Parameter of distributions that have not Single Exponential Family
IOSR Journal of Mathematcs IOSR-JM) ISSN: 2278-5728. Volume 3, Issue 3 Sep-Oct. 202), PP 44-48 www.osrjournals.org Usng T.O.M to Estmate Parameter of dstrbutons that have not Sngle Exponental Famly Jubran
More informationDoubly weighted moving least squares and its application to structural reliability analysis
Doubly weghted movng least squares and ts applcaton to structural relablty analyss Jan L 1 Shangha Jao ong Unversty, Shangha 0040, Chna Nam H. Km Unversty o Florda, Ganesvlle, FL 3611, USA and Ha Wang
More informationFinding Dense Subgraphs in G(n, 1/2)
Fndng Dense Subgraphs n Gn, 1/ Atsh Das Sarma 1, Amt Deshpande, and Rav Kannan 1 Georga Insttute of Technology,atsh@cc.gatech.edu Mcrosoft Research-Bangalore,amtdesh,annan@mcrosoft.com Abstract. Fndng
More informationMAXIMUM A POSTERIORI TRANSDUCTION
MAXIMUM A POSTERIORI TRANSDUCTION LI-WEI WANG, JU-FU FENG School of Mathematcal Scences, Peng Unversty, Bejng, 0087, Chna Center for Informaton Scences, Peng Unversty, Bejng, 0087, Chna E-MIAL: {wanglw,
More informationLecture 10 Support Vector Machines II
Lecture 10 Support Vector Machnes II 22 February 2016 Taylor B. Arnold Yale Statstcs STAT 365/665 1/28 Notes: Problem 3 s posted and due ths upcomng Frday There was an early bug n the fake-test data; fxed
More informationCISE301: Numerical Methods Topic 2: Solution of Nonlinear Equations
CISE3: Numercal Methods Topc : Soluton o Nonlnear Equatons Dr. Amar Khoukh Term Read Chapters 5 and 6 o the tetbook CISE3_Topc c Khoukh_ Lecture 5 Soluton o Nonlnear Equatons Root ndng Problems Dentons
More informationFinite Element Modelling of truss/cable structures
Pet Schreurs Endhoven Unversty of echnology Department of Mechancal Engneerng Materals echnology November 3, 214 Fnte Element Modellng of truss/cable structures 1 Fnte Element Analyss of prestressed structures
More informationLecture 12: Discrete Laplacian
Lecture 12: Dscrete Laplacan Scrbe: Tanye Lu Our goal s to come up wth a dscrete verson of Laplacan operator for trangulated surfaces, so that we can use t n practce to solve related problems We are mostly
More informationA PROBABILITY-DRIVEN SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS
HCMC Unversty of Pedagogy Thong Nguyen Huu et al. A PROBABILITY-DRIVEN SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS Thong Nguyen Huu and Hao Tran Van Department of mathematcs-nformaton,
More informationTAIL BOUNDS FOR SUMS OF GEOMETRIC AND EXPONENTIAL VARIABLES
TAIL BOUNDS FOR SUMS OF GEOMETRIC AND EXPONENTIAL VARIABLES SVANTE JANSON Abstract. We gve explct bounds for the tal probabltes for sums of ndependent geometrc or exponental varables, possbly wth dfferent
More informationCHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE
CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE Analytcal soluton s usually not possble when exctaton vares arbtrarly wth tme or f the system s nonlnear. Such problems can be solved by numercal tmesteppng
More informationSpeeding up Computation of Scalar Multiplication in Elliptic Curve Cryptosystem
H.K. Pathak et. al. / (IJCSE) Internatonal Journal on Computer Scence and Engneerng Speedng up Computaton of Scalar Multplcaton n Ellptc Curve Cryptosystem H. K. Pathak Manju Sangh S.o.S n Computer scence
More informationChat eld, C. and A.J.Collins, Introduction to multivariate analysis. Chapman & Hall, 1980
MT07: Multvarate Statstcal Methods Mke Tso: emal mke.tso@manchester.ac.uk Webpage for notes: http://www.maths.manchester.ac.uk/~mkt/new_teachng.htm. Introducton to multvarate data. Books Chat eld, C. and
More informationThe Finite Element Method
The Fnte Element Method GENERAL INTRODUCTION Read: Chapters 1 and 2 CONTENTS Engneerng and analyss Smulaton of a physcal process Examples mathematcal model development Approxmate solutons and methods of
More informationSimulated Power of the Discrete Cramér-von Mises Goodness-of-Fit Tests
Smulated of the Cramér-von Mses Goodness-of-Ft Tests Steele, M., Chaselng, J. and 3 Hurst, C. School of Mathematcal and Physcal Scences, James Cook Unversty, Australan School of Envronmental Studes, Grffth
More informationLinear Approximation with Regularization and Moving Least Squares
Lnear Approxmaton wth Regularzaton and Movng Least Squares Igor Grešovn May 007 Revson 4.6 (Revson : March 004). 5 4 3 0.5 3 3.5 4 Contents: Lnear Fttng...4. Weghted Least Squares n Functon Approxmaton...
More informationUniversity of Washington Department of Chemistry Chemistry 452/456 Summer Quarter 2014
Lecture 16 8/4/14 Unversty o Washngton Department o Chemstry Chemstry 452/456 Summer Quarter 214. Real Vapors and Fugacty Henry s Law accounts or the propertes o extremely dlute soluton. s shown n Fgure
More information11 th World Congress on Structural and Multidisciplinary Optimisation. Po Ting Lin 1
11 th World Congress on Structural and Multdscplnary Optmsaton 07 th -12 th, June 2015, Sydney Australa Utlzaton of Gaussan Kernel Relablty Analyses n the Gradent-based Transformed Space for Desgn Optmzaton
More informationDETERMINATION OF TEMPERATURE DISTRIBUTION FOR ANNULAR FINS WITH TEMPERATURE DEPENDENT THERMAL CONDUCTIVITY BY HPM
Ganj, Z. Z., et al.: Determnaton of Temperature Dstrbuton for S111 DETERMINATION OF TEMPERATURE DISTRIBUTION FOR ANNULAR FINS WITH TEMPERATURE DEPENDENT THERMAL CONDUCTIVITY BY HPM by Davood Domr GANJI
More informationChapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems
Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons
More informationGenerative and Discriminative Models. Jie Tang Department of Computer Science & Technology Tsinghua University 2012
Generatve and Dscrmnatve Models Je Tang Department o Computer Scence & Technolog Tsnghua Unverst 202 ML as Searchng Hpotheses Space ML Methodologes are ncreasngl statstcal Rule-based epert sstems beng
More informationInductance Calculation for Conductors of Arbitrary Shape
CRYO/02/028 Aprl 5, 2002 Inductance Calculaton for Conductors of Arbtrary Shape L. Bottura Dstrbuton: Internal Summary In ths note we descrbe a method for the numercal calculaton of nductances among conductors
More information1 Convex Optimization
Convex Optmzaton We wll consder convex optmzaton problems. Namely, mnmzaton problems where the objectve s convex (we assume no constrants for now). Such problems often arse n machne learnng. For example,
More informationOn an Extension of Stochastic Approximation EM Algorithm for Incomplete Data Problems. Vahid Tadayon 1
On an Extenson of Stochastc Approxmaton EM Algorthm for Incomplete Data Problems Vahd Tadayon Abstract: The Stochastc Approxmaton EM (SAEM algorthm, a varant stochastc approxmaton of EM, s a versatle tool
More informationNatural Language Processing and Information Retrieval
Natural Language Processng and Informaton Retreval Support Vector Machnes Alessandro Moschtt Department of nformaton and communcaton technology Unversty of Trento Emal: moschtt@ds.untn.t Summary Support
More informationChapter Newton s Method
Chapter 9. Newton s Method After readng ths chapter, you should be able to:. Understand how Newton s method s dfferent from the Golden Secton Search method. Understand how Newton s method works 3. Solve
More informationProblem Set 9 Solutions
Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem
More informationBasic Statistical Analysis and Yield Calculations
October 17, 007 Basc Statstcal Analyss and Yeld Calculatons Dr. José Ernesto Rayas Sánchez 1 Outlne Sources of desgn-performance uncertanty Desgn and development processes Desgn for manufacturablty A general
More informationAPPROXIMATE PRICES OF BASKET AND ASIAN OPTIONS DUPONT OLIVIER. Premia 14
APPROXIMAE PRICES OF BASKE AND ASIAN OPIONS DUPON OLIVIER Prema 14 Contents Introducton 1 1. Framewor 1 1.1. Baset optons 1.. Asan optons. Computng the prce 3. Lower bound 3.1. Closed formula for the prce
More informationStatistical pattern recognition
Statstcal pattern recognton Bayes theorem Problem: decdng f a patent has a partcular condton based on a partcular test However, the test s mperfect Someone wth the condton may go undetected (false negatve
More informationErrors for Linear Systems
Errors for Lnear Systems When we solve a lnear system Ax b we often do not know A and b exactly, but have only approxmatons  and ˆb avalable. Then the best thng we can do s to solve ˆx ˆb exactly whch
More informationLearning Theory: Lecture Notes
Learnng Theory: Lecture Notes Lecturer: Kamalka Chaudhur Scrbe: Qush Wang October 27, 2012 1 The Agnostc PAC Model Recall that one of the constrants of the PAC model s that the data dstrbuton has to be
More informationSimulation and Random Number Generation
Smulaton and Random Number Generaton Summary Dscrete Tme vs Dscrete Event Smulaton Random number generaton Generatng a random sequence Generatng random varates from a Unform dstrbuton Testng the qualty
More informationSupport Vector Machines
CS 2750: Machne Learnng Support Vector Machnes Prof. Adrana Kovashka Unversty of Pttsburgh February 17, 2016 Announcement Homework 2 deadlne s now 2/29 We ll have covered everythng you need today or at
More informationA Hybrid Variational Iteration Method for Blasius Equation
Avalable at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 1932-9466 Vol. 10, Issue 1 (June 2015), pp. 223-229 Applcatons and Appled Mathematcs: An Internatonal Journal (AAM) A Hybrd Varatonal Iteraton Method
More informationRoles of FORM, System-FORM, SORM, and RSM in geotechnical reliability analysis
Roles of FORM, System-FORM, SORM, and RSM n geotechncal relablty analyss B. K. Low School of Cvl and Envronmental Engneerng, Nanyang Technologcal Unversty, N1-1B-40, 50 Nanyang Avenue, Sngapore 639798
More informationRepresentation Theorem for Convex Nonparametric Least Squares. Timo Kuosmanen
Representaton Theorem or Convex Nonparametrc Least Squares Tmo Kuosmanen 4th Nordc Econometrc Meetng, Tartu, Estona, 4-6 May 007 Motvaton Inerences oten depend crtcally upon the algebrac orm chosen. It
More information2 STATISTICALLY OPTIMAL TRAINING DATA 2.1 A CRITERION OF OPTIMALITY We revew the crteron of statstcally optmal tranng data (Fukumzu et al., 1994). We
Advances n Neural Informaton Processng Systems 8 Actve Learnng n Multlayer Perceptrons Kenj Fukumzu Informaton and Communcaton R&D Center, Rcoh Co., Ltd. 3-2-3, Shn-yokohama, Yokohama, 222 Japan E-mal:
More informationAn Application of Fuzzy Hypotheses Testing in Radar Detection
Proceedngs of the th WSES Internatonal Conference on FUZZY SYSEMS n pplcaton of Fuy Hypotheses estng n Radar Detecton.K.ELSHERIF, F.M.BBDY, G.M.BDELHMID Department of Mathematcs Mltary echncal Collage
More informationSampling-Based Stochastic Sensitivity Analysis Using Score Functions for RBDO Problems with Correlated Random Variables
Proceedngs of the ASME 00 Internatonal Desgn Engneerng Techncal Conferences & Computers and Informaton n Engneerng Conference IDETC/CIE 00 August 5 8, 00, Montreal, Canada DETC00-859 Samplng-Based Stochastc
More informationA Robust Method for Calculating the Correlation Coefficient
A Robust Method for Calculatng the Correlaton Coeffcent E.B. Nven and C. V. Deutsch Relatonshps between prmary and secondary data are frequently quantfed usng the correlaton coeffcent; however, the tradtonal
More informationMIMA Group. Chapter 2 Bayesian Decision Theory. School of Computer Science and Technology, Shandong University. Xin-Shun SDU
Group M D L M Chapter Bayesan Decson heory Xn-Shun Xu @ SDU School of Computer Scence and echnology, Shandong Unversty Bayesan Decson heory Bayesan decson theory s a statstcal approach to data mnng/pattern
More informationAdaptive multi-point sequential sampling methodology for highly nonlinear automotive crashworthiness design problems
11 th World Congress on Structural and Multdscplnary Optmsaton 07 th -12 th, June 2015, Sydney Australa Adaptve mult-pont sequental samplng methodology or hghly nonlnear automotve crashworthness desgn
More informationPHYS 705: Classical Mechanics. Calculus of Variations II
1 PHYS 705: Classcal Mechancs Calculus of Varatons II 2 Calculus of Varatons: Generalzaton (no constrant yet) Suppose now that F depends on several dependent varables : We need to fnd such that has a statonary
More informationStructural reliability analysis by univariate decomposition and numerical integration
Probablstc Engneerng Mechancs 22 (2007) 27 38 www.elsever.com/locate/probengmech Structural relablty analyss by unvarate decomposton and numercal ntegraton D. We, S. Rahman Department of Mechancal and
More information3.1 ML and Empirical Distribution
67577 Intro. to Machne Learnng Fall semester, 2008/9 Lecture 3: Maxmum Lkelhood/ Maxmum Entropy Dualty Lecturer: Amnon Shashua Scrbe: Amnon Shashua 1 In the prevous lecture we defned the prncple of Maxmum
More informationVARIATION OF CONSTANT SUM CONSTRAINT FOR INTEGER MODEL WITH NON UNIFORM VARIABLES
VARIATION OF CONSTANT SUM CONSTRAINT FOR INTEGER MODEL WITH NON UNIFORM VARIABLES BÂRZĂ, Slvu Faculty of Mathematcs-Informatcs Spru Haret Unversty barza_slvu@yahoo.com Abstract Ths paper wants to contnue
More informationComposite Hypotheses testing
Composte ypotheses testng In many hypothess testng problems there are many possble dstrbutons that can occur under each of the hypotheses. The output of the source s a set of parameters (ponts n a parameter
More informationAN ADAPTIVE IMPORTANCE SAMPLING-BASED ALGORITHM USING THE FIRST-ORDER METHOD FOR STRUCTURAL RELIABILITY
INTERNATIONAL JOURNAL OF OPTIMIZATION IN CIVIL ENGINEERING Int. J. Optm. Cvl Eng., 07; 7():93-07 AN ADAPTIVE IMPORTANCE SAMPLING-BASED ALGORITHM USING THE FIRST-ORDER METHOD FOR STRUCTURAL RELIABILITY
More informationAbsorbing Markov Chain Models to Determine Optimum Process Target Levels in Production Systems with Rework and Scrapping
Archve o SID Journal o Industral Engneerng 6(00) -6 Absorbng Markov Chan Models to Determne Optmum Process Target evels n Producton Systems wth Rework and Scrappng Mohammad Saber Fallah Nezhad a, Seyed
More informationClassification as a Regression Problem
Target varable y C C, C,, ; Classfcaton as a Regresson Problem { }, 3 L C K To treat classfcaton as a regresson problem we should transform the target y nto numercal values; The choce of numercal class
More informationGoal Programming Approach to Solve Multi- Objective Intuitionistic Fuzzy Non- Linear Programming Models
Internatonal Journal o Mathematcs rends and echnoloy IJM Volume Number 7 - January 8 Goal Prorammn Approach to Solve Mult- Objectve Intutonstc Fuzzy Non- Lnear Prorammn Models S.Rukman #, R.Sopha Porchelv
More informationDepartment of Computer Science Artificial Intelligence Research Laboratory. Iowa State University MACHINE LEARNING
MACHINE LEANING Vasant Honavar Bonformatcs and Computatonal Bology rogram Center for Computatonal Intellgence, Learnng, & Dscovery Iowa State Unversty honavar@cs.astate.edu www.cs.astate.edu/~honavar/
More informationCSE 252C: Computer Vision III
CSE 252C: Computer Vson III Lecturer: Serge Belonge Scrbe: Catherne Wah LECTURE 15 Kernel Machnes 15.1. Kernels We wll study two methods based on a specal knd of functon k(x, y) called a kernel: Kernel
More informationModule 11 Design of Joints for Special Loading. Version 2 ME, IIT Kharagpur
Module 11 Desgn o Jonts or Specal Loadng Verson ME, IIT Kharagpur Lesson 1 Desgn o Eccentrcally Loaded Bolted/Rveted Jonts Verson ME, IIT Kharagpur Instructonal Objectves: At the end o ths lesson, the
More informationComputing Correlated Equilibria in Multi-Player Games
Computng Correlated Equlbra n Mult-Player Games Chrstos H. Papadmtrou Presented by Zhanxang Huang December 7th, 2005 1 The Author Dr. Chrstos H. Papadmtrou CS professor at UC Berkley (taught at Harvard,
More informationIndeterminate pin-jointed frames (trusses)
Indetermnate pn-jonted frames (trusses) Calculaton of member forces usng force method I. Statcal determnacy. The degree of freedom of any truss can be derved as: w= k d a =, where k s the number of all
More informationBOOTSTRAP METHOD FOR TESTING OF EQUALITY OF SEVERAL MEANS. M. Krishna Reddy, B. Naveen Kumar and Y. Ramu
BOOTSTRAP METHOD FOR TESTING OF EQUALITY OF SEVERAL MEANS M. Krshna Reddy, B. Naveen Kumar and Y. Ramu Department of Statstcs, Osmana Unversty, Hyderabad -500 007, Inda. nanbyrozu@gmal.com, ramu0@gmal.com
More informationprinceton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg
prnceton unv. F 17 cos 521: Advanced Algorthm Desgn Lecture 7: LP Dualty Lecturer: Matt Wenberg Scrbe: LP Dualty s an extremely useful tool for analyzng structural propertes of lnear programs. Whle there
More information10-701/ Machine Learning, Fall 2005 Homework 3
10-701/15-781 Machne Learnng, Fall 2005 Homework 3 Out: 10/20/05 Due: begnnng of the class 11/01/05 Instructons Contact questons-10701@autonlaborg for queston Problem 1 Regresson and Cross-valdaton [40
More informationNote 10. Modeling and Simulation of Dynamic Systems
Lecture Notes of ME 475: Introducton to Mechatroncs Note 0 Modelng and Smulaton of Dynamc Systems Department of Mechancal Engneerng, Unversty Of Saskatchewan, 57 Campus Drve, Saskatoon, SK S7N 5A9, Canada
More informationCOMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS
Avalable onlne at http://sck.org J. Math. Comput. Sc. 3 (3), No., 6-3 ISSN: 97-537 COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS
More informationMarkov Chain Monte Carlo Lecture 6
where (x 1,..., x N ) X N, N s called the populaton sze, f(x) f (x) for at least one {1, 2,..., N}, and those dfferent from f(x) are called the tral dstrbutons n terms of mportance samplng. Dfferent ways
More information10.34 Fall 2015 Metropolis Monte Carlo Algorithm
10.34 Fall 2015 Metropols Monte Carlo Algorthm The Metropols Monte Carlo method s very useful for calculatng manydmensonal ntegraton. For e.g. n statstcal mechancs n order to calculate the prospertes of
More informationA PROCEDURE FOR SIMULATING THE NONLINEAR CONDUCTION HEAT TRANSFER IN A BODY WITH TEMPERATURE DEPENDENT THERMAL CONDUCTIVITY.
Proceedngs of the th Brazlan Congress of Thermal Scences and Engneerng -- ENCIT 006 Braz. Soc. of Mechancal Scences and Engneerng -- ABCM, Curtba, Brazl,- Dec. 5-8, 006 A PROCEDURE FOR SIMULATING THE NONLINEAR
More informationBézier curves. Michael S. Floater. September 10, These notes provide an introduction to Bézier curves. i=0
Bézer curves Mchael S. Floater September 1, 215 These notes provde an ntroducton to Bézer curves. 1 Bernsten polynomals Recall that a real polynomal of a real varable x R, wth degree n, s a functon of
More informationParametric fractional imputation for missing data analysis. Jae Kwang Kim Survey Working Group Seminar March 29, 2010
Parametrc fractonal mputaton for mssng data analyss Jae Kwang Km Survey Workng Group Semnar March 29, 2010 1 Outlne Introducton Proposed method Fractonal mputaton Approxmaton Varance estmaton Multple mputaton
More information