SPECTRAL ANALYSIS USING EVOLUTION STRATEGIES
|
|
- Alisha Hubbard
- 5 years ago
- Views:
Transcription
1 SPECTRAL ANALYSIS USING EVOLUTION STRATEGIES J. FEDERICO RAMÍREZ AND OLAC FUENTES Insttuto Naconal de Astrofísca, Óptca y Electrónca Lus Enrque Erro # 1 Santa María Tonanzntla, Puebla, 784, Méxco framrez@cseg.naoep.mx, fuentes@cseg.naoep.mx ABSTRACT In ths paper we show how evoluton strateges (ES) are successfully appled to the problem of fttng lne profles of stellar spectra, whch provdes a relable decomposton. Usng a stellar spectrum as nput, we mplemented an evoluton strategy to fnd ts components: contnuos spectrum and spectral lnes. In our experments we used Gaussan functons to match spectral lnes and three dfferent equatons to represent the contnuos spectrum. We appled ths method to smulated and real spectra. Keywords: Spectral Analyss, Evoluton Strateges, and Optmzaton 1. INTRODUCTION A task n the analyss of stellar spectra s to dentfy and measure the flux of emsson and absorpton lnes n the spectra. These lne profles can be compared wth the spectral profle of onc and atomc transtons of known wavelengths. Sometmes, the observer bases these assocatons producng an ncorrect nterpretaton of the data. The lne flux n spectra may be measured by multple technques, ncludng fttng ndvdual lnes. Standard spectral decomposton technques usng non-lnear least squares fttng algorthms such as the Levenberg- Marquardt method [1, ] or unconstraned optmzaton methods such as smplex search of Nelder and Mead [3] proved to be unstable wth nosy data and dependent on ntal parameters provded by the user [4]. In ths paper we use a summaton of Gaussan functons for fttng lne profles and an evoluton strategy as optmzaton method to fnd the parameters of the model. ES are stable n the presence of nosy data, and can be appled to non-lnear systems [5]. Another advantage of ths technque s that ES does not requre the ntalzaton of search parameters n contrast to other optmzaton algorthms. The remander of ths paper s organzed as follows: Secton gves a bref overvew of evoluton strateges. Secton 3 presents a bref descrpton of stellar spectra. Secton 4 presents the method used n our experments, Secton 5 presents expermental results and dscusson and Secton 6 presents conclusons and outlnes drectons for future work.. EVOLUTION STRATEGIES Evoluton Strateges (ES) are a class of probablstc search algorthms loosely based on bologcal evoluton. They work on a populaton of ndvduals, where each of them represents a search pont n the space of potental solutons to a gven problem. In evoluton strateges a vector of real numbers represents an ndvdual. Ths s a good representaton when the problem at hand deals wth contnuous parameters. Each ndvdual s formed by a vector of elements called object varables x, and each varable has assocated to t a standard devaton called strategy parameter σ, as shown n fgure 1. x 1 x x 3 x n σ 1 σ σ 3. σ n Fgure 1. Representaton of ndvdual Intally, the algorthm randomly generates a populaton of ndvduals; subsequently ths populaton s updated by means of randomzed processes of recombnaton, mutaton, and selecton. Each ndvdual s evaluated accordng to a ftness functon that depends on the problem to be solved. The selecton process favors the ft ndvduals from the current populaton to reproduce n the next generaton. In evoluton strateges, ths process s completely determnstc. In (µ+λ)-selecton, the µ best ndvduals from the unon of µ parents and λ offsprng are selected to form the next parent generaton, and n (µ, λ)-selecton ths operator selects the µ best ndvduals from the λ offsprng only; for ths µ< λ s requred. The recombnaton process allows to combne nformaton from dfferent members of a populaton, creatng offsprng from them. In [5] Bäck shows a varety of recombnaton mechansms used n evoluton strateges. Typcal examples of them are: dscrete recombnaton, whch s a sexual operaton that creates two offsprng vectors from two parent vectors copyng selected elements from each parent; and ntermedate recombnaton, whch s commonly used as an arthmetc average wth some
2 varants. These operators can be used n sexual or panmctc form. In the sexual form, every element of an offsprng s the result of recombnaton between two ndvduals randomly chosen from the parent populaton. In panmctc form, each element of an offsprng may be the result of recombnaton among one ndvdual and several other ndvduals randomly chosen from the parent populaton. Mutaton s an asexual operator that generates random changes to an ndvdual and often provdes new relevant nformaton. The mutaton operator s appled ndependently to each object varable of an ndvdual. It s carred out as shown n equaton 1. The strategy parameters may be mutated usng a multplcatve, logarthmc normally dstrbuted process as shown n equaton. x = x + σ N(,1) (1) σ = σ exp( N (,1) + N (,1)) () Where N (,1) s a normally dstrbuted random varable havng an expectaton of zero and a standard devaton of one, N (,1) ndcates that the random varable s sampled anew every tme the ndex changes. Rechenberg proposed a determnstc adjustment of strategy parameters durng evoluton, called the 1/5- success rule [6], whch reflects that, on average, one out of fve mutatons should cause an mprovement n the objectve functon values to acheve best convergence rates. If more than 1/5 of the mutatons are successful, σ s ncreased, otherwse t s decreased. narrow dscontnutes supermposed. These dscontnutes are called absorpton lnes when the total flux s less than the contnuum or emsson lnes when the total flux s greater than the contnuum, and are caused by the presence of certan atoms n the star's atmosphere. Each absorpton lne appears as a valley, whle each emsson lne appears as a peak n a stellar spectrum. The depth or heght of each lne ndcates ts strength. The wdth of each lne ndcates the range of wavelengths. Fnally, each lne has a specfc shape. All of these characterstcs convey nformaton about the star. An expert astronomer can analyze these lnes and estmate wth good accuracy several of the most mportant propertes of the star. In ths paper we used the spectrum of a star of type A8V obtaned from a dgtal optcal stellar lbrary [7]. It conssts of fluxes coverng 351. to 893. nm n wavelength wth a resoluton of.5 nm. 4. THE METHODS We can defne a Gaussan functon wth three parameters: a center pont (λ ο ), a varance (σ) and an ampltude (A), as shown n fgure 3. Ths functon s defned by equaton 3. The varance determnes the shape of the Gaussan functon. Two or more Gaussan functons can be combned to ft data as shown n fgure 4. Ampltude A λ ο λ σ S t Fgure 3. Standard Gaussan Functon ( x λ ) G ( x) = Aexp (3) σ A Fgure. Sample stellar spectrum 3. THE STELLAR SPECTRA Astronomers can determne the chemcal composton and physcal nature of a star by analyzng ts spectrum, whch s a plot of flux densty as a functon of wavelength, as shown n fgure. Stellar spectra consst of a contnuous spectrum (background or contnuum), wth λ A λ Fgure 4. Combnaton of Gaussan Functons
3 We can represent a stellar spectrum wth a functon defnng the background and a set of Gaussan functons representng the stellar lnes. The frst functon may be a quadratc equaton, another Gaussan functon coverng the entre spectrum or the Planck functon, whch approxmates a blackbody emsson [8]. Equaton 4 shows the functon used for ths purpose. N P( λ ) = F( λ) + = G 1 ( λ) (4) F(λ) represents the background or contnuum, and G (λ) s are the Gaussan functons supermposed on t. These functons must be spread over the range of the evaluaton data and each one must be assgned wth an approprate varance and central pont n order to cause the requred overlap among Gaussan functons. F(λ) can have one of the followng forms: quadratc aλ + bλ + c1 equaton ( λ λ ) Gaussan Aexp F( λ) = w Functon hc 1 Planck Cy 5 λ hc Functon exp 1 λkt where h = Planck Constant k = Boltzmann Constant c = Speed of Lght T = Temperature of the Star Cy = Adjustment constante An evoluton strategy s used to fnd the free parameters of P(λ). The representaton of the object varables nto an ndvdual for ths problem has the form shown n fgure 5. n g Free Parameters of F(λ) λ o1 A 1 W 1... λ on A N W M Fgure 5. Representaton of the object varables nto an Indvdual Where n g corresponds to the number of Gaussan functons. It means that ndvduals may have dfferent szes. The free parameters of F(λ) are a, b, and c 1 for the quadratc equaton, Cy and T for Planck s functon, and λ o, A, w for the Gaussan functon. Also, the free parameters of G (λ) are λ o, A, W. In our evoluton strategy mplementaton (hereafter GaES), we added an operator called ntellgent-mutaton. Ths procedure checks for the poston of the greatest dfference between data generated by the fttng model and the orgnal data, and adds a Gaussan functon n ths poston wth the same ampltude as the error sze and a random varance value, as shown n fgure 6. Also, we added another procedure called elmnatonmutaton, whch carres out the opposte functon. It suppresses the Gaussan functon that produces the smallest reducton n the error. Ampltude Ampltude Ampltude Max Error Orgnal Data - Predcted o Corrected + Added Functon X Fgure 6 Added functon by Intellgent Mutaton ( P( λ ) f ( λ )) nd = 1 _ = + α n (5) g nd Ftness GaES The ftness functon s shown n equaton 5, where n d s the number of ponts n the dgtal spectrum, P(λ ) s a pont generated by the model, f(λ ) s a pont n the orgnal data, n g s the number of Gaussan functons, and α s a constant. The frst term of the ftness functon corresponds to the root mean squared error and the second term s a penalty, whch favors ndvduals wth fewer Gaussan functons. 5. EXPERIMENTAL RESULTS In ths secton we detal the result of applyng GaES to a smulated spectrum and a real dgtal optcal spectrum obtaned from Davs database [7]. We generate a smulated spectrum P(λ) wth 5 spectral lnes G (λ) s wth parameters [λ o, A, W ]= [396.8x x x x x x x x x x1-7 ] and usng the Planck s functon wth a temperature of 6,5K for contnuum approxmaton. GaES-planck found the temperature and smulated spectral lnes wth an rms error of 4.38x1-8 as shown n fgure 7. The GaES ran for 5 generatons, but good ftness values were attaned after about 15 generatons, as shown n fgure 8.
4 Fgure 7. Smulated Spectrum and GaES Planck ft model. Fgure 9. Dgtal spectrum of a star of type A8V and GaES-Quadratc ft model. The evoluton strategy ran for 5 generatons. We used n all the experments a populaton of 5 ndvduals, mplyng 5, evaluatons of the objectve functon. Also, we used two dfferent recombnaton methods: dscrete recombnaton on 1% of the parent populaton and ntermedate recombnaton on another 1% of the parent populaton. Mutaton s the most mportant operator n ES and we used t on 68% of the parent populaton. We used elmnaton-mutaton on 1% and ntellgentmutaton on % of the parent populaton. Fgure 8. Ftnees of GaES-Planck for a smulated spectrum. Real data possess nherent nose, and ths s a problem for tradtonal technques, but ES have shown to be nsenstve to nosy data. We appled our method to the analyss of a real dgtal optcal spectrum of a star of type A8V n the 38-5 nm wavelength range. In the frst experment we used the GaES-Quadratc model, where t acheved to an rms error of.74, fndng 8 Gaussan functons as shown n fgure 9. In the second experment, we used the GaES-Gaussan model, where t acheved an rms error of.7 and 8 Gaussan functons as shown n fgure 1. In the last experment we used the GaES-Planck model achevng an rms error of.199 and fndng 8 Gaussan functons as shown n fgure 11. Fgure 1. Dgtal spectrum of a star of type A8V and GaES Gaussan ft model. The behavor of each GaES s shown n fgures 1, 13 and 14. As can be seen n the fgures, good ftness values can be attaned quckly after a few hundred teratons; after that, progress becomes slower. Ths behavor s typcal of stochastc optmzaton algorthms.
5 Fgure 11. Dgtal spectrum of a star of type A8V and GaES-Planck ft model. Fgure 14. Ftness functon of GaES-Planck. For comparson we made an experment usng the Nelder-Mead Smplex drect search from the MatLab Optmzaton Toolbox gvng the ntal parameters as shown n fgure 15. After 46,9 teratons and 5, evaluatons of objectve functon, we acheved an rms error of.379 as shown n fgure 16. We use the same ftness functon from ES to evaluate the objectve functon and ts behavor s shown n fgure 17. The run tme was smlar for both algorthms. One dsadvantage of ths method s the dependence on ntal search parameters, but a combnaton of ths algorthm wth the ES to fnd the ntal search parameters may be an alternate soluton to reduce the search tme and to acheve a better accuracy. Fgure 1. Ftness functon of GaES-Quadratc. Fgure 15. Dgtal spectrum of a star of type A8V and Smplex-Planck ntal ft model. Fgure 13. Ftness functon of GaES-Gaussan.
6 7. REFERENCES [1] Levenberg, K., A Method for the Soluton of Certan Problems n Last Squares, Quart. Appl. Math. Vol., pp , [] Marquardt, D., An Algorthm for Least Squares Estmaton of Nonlnear Parameters, SIAM J. Appl. Math. Vol. 11, pp , [3] Nelder, J.A. and R. Mead, A Smplex Method for Functon Mnmzaton, Computer J., Vol.7, pp , Fgure 16. Dgtal spectrum of a star of type A8V and Smplex-Planck ft model. [4] S. W. McIntosh, D. A. Dver, P. G. Judge, P. Charbonneau, J. Ireland, and J. C. Brown. Spectral decomposton by genetc forward modellng, Astronomy & Astrophyscs Supplement Seres, 13, 1998, [5] Tomas Bäck, Evolutonary Algorthms n Theory and Practce, Oxford Unversty Press, [6] I. Rechenberg, Evolutonsstratege: Optmerung technscher Systeme nach Prnzpen der bologschen Evoluton, (Stuttgart: Frommann-Holzboog Verlag), [7] D. R. Slva, A New Lbrary of Stellar Optcal Spectra, Astrophyscal Journal Supplement Seres Vol. 81, p , 199 Fgure 17. Ftness functon of Smplex Method. [8] H. Karttunen, P. Kröger, H. Oja, M. Poutanen, K. J. Donner. Fundamental Astronomy: Second Enlarged Edton. Sprnger Verlag, CONCLUSIONS In ths paper we have presented an approach to ft a model of Gaussan functons to dgtal spectra n order to fnd spectral lnes and background usng ES. Our expermental results show that applyng ths method to a dgtal stellar spectrum provdes the followng advantages: It does not requre user nput regardng search parameter ntalzaton nor the number of Gaussan functons. It s stable n the presence of nosy data. It s less senstve to local mnma than gradent-based methods. Future work wll extend the expermental results to more spectra and compare the results wth theoretcal models. Also, we wll attempt to combne ES wth standard optmzaton methods to reduce the search tme.
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 informationThe Study of Teaching-learning-based Optimization Algorithm
Advanced Scence and Technology Letters Vol. (AST 06), pp.05- http://dx.do.org/0.57/astl.06. The Study of Teachng-learnng-based Optmzaton Algorthm u Sun, Yan fu, Lele Kong, Haolang Q,, Helongang Insttute
More informationChapter 13: Multiple Regression
Chapter 13: Multple Regresson 13.1 Developng the multple-regresson Model The general model can be descrbed as: It smplfes for two ndependent varables: The sample ft parameter b 0, b 1, and b are used to
More informationGlobal Optimization Using Hybrid Approach
Tng-Yu Chen, Y Lang Cheng Global Optmzaton Usng Hybrd Approach TING-YU CHEN, YI LIANG CHENG Department of Mechancal Engneerng Natonal Chung Hsng Unversty 0 Kuo Kuang Road Tachung, Tawan 07 tyc@dragon.nchu.edu.tw
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 informationLinear Regression Analysis: Terminology and Notation
ECON 35* -- Secton : Basc Concepts of Regresson Analyss (Page ) Lnear Regresson Analyss: Termnology and Notaton Consder the generc verson of the smple (two-varable) lnear regresson model. It s represented
More informationEEE 241: Linear Systems
EEE : Lnear Systems Summary #: Backpropagaton BACKPROPAGATION The perceptron rule as well as the Wdrow Hoff learnng were desgned to tran sngle layer networks. They suffer from the same dsadvantage: they
More informationCSci 6974 and ECSE 6966 Math. Tech. for Vision, Graphics and Robotics Lecture 21, April 17, 2006 Estimating A Plane Homography
CSc 6974 and ECSE 6966 Math. Tech. for Vson, Graphcs and Robotcs Lecture 21, Aprl 17, 2006 Estmatng A Plane Homography Overvew We contnue wth a dscusson of the major ssues, usng estmaton of plane projectve
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 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 informationDesign and Optimization of Fuzzy Controller for Inverse Pendulum System Using Genetic Algorithm
Desgn and Optmzaton of Fuzzy Controller for Inverse Pendulum System Usng Genetc Algorthm H. Mehraban A. Ashoor Unversty of Tehran Unversty of Tehran h.mehraban@ece.ut.ac.r a.ashoor@ece.ut.ac.r Abstract:
More informationGlobal Sensitivity. Tuesday 20 th February, 2018
Global Senstvty Tuesday 2 th February, 28 ) Local Senstvty Most senstvty analyses [] are based on local estmates of senstvty, typcally by expandng the response n a Taylor seres about some specfc values
More informationDETERMINATION OF UNCERTAINTY ASSOCIATED WITH QUANTIZATION ERRORS USING THE BAYESIAN APPROACH
Proceedngs, XVII IMEKO World Congress, June 7, 3, Dubrovn, Croata Proceedngs, XVII IMEKO World Congress, June 7, 3, Dubrovn, Croata TC XVII IMEKO World Congress Metrology n the 3rd Mllennum June 7, 3,
More informationStructure and Drive Paul A. Jensen Copyright July 20, 2003
Structure and Drve Paul A. Jensen Copyrght July 20, 2003 A system s made up of several operatons wth flow passng between them. The structure of the system descrbes the flow paths from nputs to outputs.
More informationAppendix B: Resampling Algorithms
407 Appendx B: Resamplng Algorthms A common problem of all partcle flters s the degeneracy of weghts, whch conssts of the unbounded ncrease of the varance of the mportance weghts ω [ ] of the partcles
More informationPHYS 450 Spring semester Lecture 02: Dealing with Experimental Uncertainties. Ron Reifenberger Birck Nanotechnology Center Purdue University
PHYS 45 Sprng semester 7 Lecture : Dealng wth Expermental Uncertantes Ron Refenberger Brck anotechnology Center Purdue Unversty Lecture Introductory Comments Expermental errors (really expermental uncertantes)
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 informationTransfer Functions. Convenient representation of a linear, dynamic model. A transfer function (TF) relates one input and one output: ( ) system
Transfer Functons Convenent representaton of a lnear, dynamc model. A transfer functon (TF) relates one nput and one output: x t X s y t system Y s The followng termnology s used: x y nput output forcng
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 informationPsychology 282 Lecture #24 Outline Regression Diagnostics: Outliers
Psychology 282 Lecture #24 Outlne Regresson Dagnostcs: Outlers In an earler lecture we studed the statstcal assumptons underlyng the regresson model, ncludng the followng ponts: Formal statement of assumptons.
More informationImplicit Integration Henyey Method
Implct Integraton Henyey Method In realstc stellar evoluton codes nstead of a drect ntegraton usng for example the Runge-Kutta method one employs an teratve mplct technque. Ths s because the structure
More information1 The Mistake Bound Model
5-850: Advanced Algorthms CMU, Sprng 07 Lecture #: Onlne Learnng and Multplcatve Weghts February 7, 07 Lecturer: Anupam Gupta Scrbe: Bryan Lee,Albert Gu, Eugene Cho he Mstake Bound Model Suppose there
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 informationTurbulence classification of load data by the frequency and severity of wind gusts. Oscar Moñux, DEWI GmbH Kevin Bleibler, DEWI GmbH
Turbulence classfcaton of load data by the frequency and severty of wnd gusts Introducton Oscar Moñux, DEWI GmbH Kevn Blebler, DEWI GmbH Durng the wnd turbne developng process, one of the most mportant
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 informationis the calculated value of the dependent variable at point i. The best parameters have values that minimize the squares of the errors
Multple Lnear and Polynomal Regresson wth Statstcal Analyss Gven a set of data of measured (or observed) values of a dependent varable: y versus n ndependent varables x 1, x, x n, multple lnear regresson
More informationRobert Eisberg Second edition CH 09 Multielectron atoms ground states and x-ray excitations
Quantum Physcs 量 理 Robert Esberg Second edton CH 09 Multelectron atoms ground states and x-ray exctatons 9-01 By gong through the procedure ndcated n the text, develop the tme-ndependent Schroednger equaton
More informationLOW BIAS INTEGRATED PATH ESTIMATORS. James M. Calvin
Proceedngs of the 007 Wnter Smulaton Conference S G Henderson, B Bller, M-H Hseh, J Shortle, J D Tew, and R R Barton, eds LOW BIAS INTEGRATED PATH ESTIMATORS James M Calvn Department of Computer Scence
More informationNumerical Heat and Mass Transfer
Master degree n Mechancal Engneerng Numercal Heat and Mass Transfer 06-Fnte-Dfference Method (One-dmensonal, steady state heat conducton) Fausto Arpno f.arpno@uncas.t Introducton Why we use models and
More informationA New Evolutionary Computation Based Approach for Learning Bayesian Network
Avalable onlne at www.scencedrect.com Proceda Engneerng 15 (2011) 4026 4030 Advanced n Control Engneerng and Informaton Scence A New Evolutonary Computaton Based Approach for Learnng Bayesan Network Yungang
More informationSuppose that there s a measured wndow of data fff k () ; :::; ff k g of a sze w, measured dscretely wth varable dscretzaton step. It s convenent to pl
RECURSIVE SPLINE INTERPOLATION METHOD FOR REAL TIME ENGINE CONTROL APPLICATIONS A. Stotsky Volvo Car Corporaton Engne Desgn and Development Dept. 97542, HA1N, SE- 405 31 Gothenburg Sweden. Emal: astotsky@volvocars.com
More informationChapter - 2. Distribution System Power Flow Analysis
Chapter - 2 Dstrbuton System Power Flow Analyss CHAPTER - 2 Radal Dstrbuton System Load Flow 2.1 Introducton Load flow s an mportant tool [66] for analyzng electrcal power system network performance. Load
More informationLINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity
LINEAR REGRESSION ANALYSIS MODULE IX Lecture - 30 Multcollnearty Dr. Shalabh Department of Mathematcs and Statstcs Indan Insttute of Technology Kanpur 2 Remedes for multcollnearty Varous technques have
More informationChapter 1. Probability
Chapter. Probablty Mcroscopc propertes of matter: quantum mechancs, atomc and molecular propertes Macroscopc propertes of matter: thermodynamcs, E, H, C V, C p, S, A, G How do we relate these two propertes?
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 informationNUMERICAL DIFFERENTIATION
NUMERICAL DIFFERENTIATION 1 Introducton Dfferentaton s a method to compute the rate at whch a dependent output y changes wth respect to the change n the ndependent nput x. Ths rate of change s called the
More informationStanford University CS359G: Graph Partitioning and Expanders Handout 4 Luca Trevisan January 13, 2011
Stanford Unversty CS359G: Graph Parttonng and Expanders Handout 4 Luca Trevsan January 3, 0 Lecture 4 In whch we prove the dffcult drecton of Cheeger s nequalty. As n the past lectures, consder an undrected
More informationχ x B E (c) Figure 2.1.1: (a) a material particle in a body, (b) a place in space, (c) a configuration of the body
Secton.. Moton.. The Materal Body and Moton hyscal materals n the real world are modeled usng an abstract mathematcal entty called a body. Ths body conssts of an nfnte number of materal partcles. Shown
More informationx = , so that calculated
Stat 4, secton Sngle Factor ANOVA notes by Tm Plachowsk n chapter 8 we conducted hypothess tests n whch we compared a sngle sample s mean or proporton to some hypotheszed value Chapter 9 expanded ths to
More informationT E C O L O T E R E S E A R C H, I N C.
T E C O L O T E R E S E A R C H, I N C. B rdg n g En g neern g a nd Econo mcs S nce 1973 THE MINIMUM-UNBIASED-PERCENTAGE ERROR (MUPE) METHOD IN CER DEVELOPMENT Thrd Jont Annual ISPA/SCEA Internatonal Conference
More informationSolving Nonlinear Differential Equations by a Neural Network Method
Solvng Nonlnear Dfferental Equatons by a Neural Network Method Luce P. Aarts and Peter Van der Veer Delft Unversty of Technology, Faculty of Cvlengneerng and Geoscences, Secton of Cvlengneerng Informatcs,
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 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 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 informationMACHINE APPLIED MACHINE LEARNING LEARNING. Gaussian Mixture Regression
11 MACHINE APPLIED MACHINE LEARNING LEARNING MACHINE LEARNING Gaussan Mture Regresson 22 MACHINE APPLIED MACHINE LEARNING LEARNING Bref summary of last week s lecture 33 MACHINE APPLIED MACHINE LEARNING
More informationAnnexes. EC.1. Cycle-base move illustration. EC.2. Problem Instances
ec Annexes Ths Annex frst llustrates a cycle-based move n the dynamc-block generaton tabu search. It then dsplays the characterstcs of the nstance sets, followed by detaled results of the parametercalbraton
More informationStatistical Circuit Optimization Considering Device and Interconnect Process Variations
Statstcal Crcut Optmzaton Consderng Devce and Interconnect Process Varatons I-Jye Ln, Tsu-Yee Lng, and Yao-Wen Chang The Electronc Desgn Automaton Laboratory Department of Electrcal Engneerng Natonal Tawan
More informationDifferential Evolution Algorithm with a Modified Archiving-based Adaptive Tradeoff Model for Optimal Power Flow
1 Dfferental Evoluton Algorthm wth a Modfed Archvng-based Adaptve Tradeoff Model for Optmal Power Flow 2 Outlne Search Engne Constrant Handlng Technque Test Cases and Statstcal Results 3 Roots of Dfferental
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 informationEstimating the Fundamental Matrix by Transforming Image Points in Projective Space 1
Estmatng the Fundamental Matrx by Transformng Image Ponts n Projectve Space 1 Zhengyou Zhang and Charles Loop Mcrosoft Research, One Mcrosoft Way, Redmond, WA 98052, USA E-mal: fzhang,cloopg@mcrosoft.com
More informationLaboratory 3: Method of Least Squares
Laboratory 3: Method of Least Squares Introducton Consder the graph of expermental data n Fgure 1. In ths experment x s the ndependent varable and y the dependent varable. Clearly they are correlated wth
More information4 Analysis of Variance (ANOVA) 5 ANOVA. 5.1 Introduction. 5.2 Fixed Effects ANOVA
4 Analyss of Varance (ANOVA) 5 ANOVA 51 Introducton ANOVA ANOVA s a way to estmate and test the means of multple populatons We wll start wth one-way ANOVA If the populatons ncluded n the study are selected
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 informationChapter 9: Statistical Inference and the Relationship between Two Variables
Chapter 9: Statstcal Inference and the Relatonshp between Two Varables Key Words The Regresson Model The Sample Regresson Equaton The Pearson Correlaton Coeffcent Learnng Outcomes After studyng ths chapter,
More informationAppendix B. The Finite Difference Scheme
140 APPENDIXES Appendx B. The Fnte Dfference Scheme In ths appendx we present numercal technques whch are used to approxmate solutons of system 3.1 3.3. A comprehensve treatment of theoretcal and mplementaton
More informationPolynomial Regression Models
LINEAR REGRESSION ANALYSIS MODULE XII Lecture - 6 Polynomal Regresson Models Dr. Shalabh Department of Mathematcs and Statstcs Indan Insttute of Technology Kanpur Test of sgnfcance To test the sgnfcance
More informationLaboratory 1c: Method of Least Squares
Lab 1c, Least Squares Laboratory 1c: Method of Least Squares Introducton Consder the graph of expermental data n Fgure 1. In ths experment x s the ndependent varable and y the dependent varable. Clearly
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 informationMeasurement Uncertainties Reference
Measurement Uncertantes Reference Introducton We all ntutvely now that no epermental measurement can be perfect. It s possble to mae ths dea quanttatve. It can be stated ths way: the result of an ndvdual
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 informationCurve Fitting with the Least Square Method
WIKI Document Number 5 Interpolaton wth Least Squares Curve Fttng wth the Least Square Method Mattheu Bultelle Department of Bo-Engneerng Imperal College, London Context We wsh to model the postve feedback
More informationChapter 2 Real-Coded Adaptive Range Genetic Algorithm
Chapter Real-Coded Adaptve Range Genetc Algorthm.. Introducton Fndng a global optmum n the contnuous doman s challengng for Genetc Algorthms (GAs. Tradtonal GAs use the bnary representaton that evenly
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 informationGrover s Algorithm + Quantum Zeno Effect + Vaidman
Grover s Algorthm + Quantum Zeno Effect + Vadman CS 294-2 Bomb 10/12/04 Fall 2004 Lecture 11 Grover s algorthm Recall that Grover s algorthm for searchng over a space of sze wors as follows: consder the
More informationPARTICIPATION FACTOR IN MODAL ANALYSIS OF POWER SYSTEMS STABILITY
POZNAN UNIVE RSITY OF TE CHNOLOGY ACADE MIC JOURNALS No 86 Electrcal Engneerng 6 Volodymyr KONOVAL* Roman PRYTULA** PARTICIPATION FACTOR IN MODAL ANALYSIS OF POWER SYSTEMS STABILITY Ths paper provdes a
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 informationFeature Selection: Part 1
CSE 546: Machne Learnng Lecture 5 Feature Selecton: Part 1 Instructor: Sham Kakade 1 Regresson n the hgh dmensonal settng How do we learn when the number of features d s greater than the sample sze n?
More informationKinematics of Fluids. Lecture 16. (Refer the text book CONTINUUM MECHANICS by GEORGE E. MASE, Schaum s Outlines) 17/02/2017
17/0/017 Lecture 16 (Refer the text boo CONTINUUM MECHANICS by GEORGE E. MASE, Schaum s Outlnes) Knematcs of Fluds Last class, we started dscussng about the nematcs of fluds. Recall the Lagrangan and Euleran
More informationTitle: Radiative transitions and spectral broadening
Lecture 6 Ttle: Radatve transtons and spectral broadenng Objectves The spectral lnes emtted by atomc vapors at moderate temperature and pressure show the wavelength spread around the central frequency.
More informationTime-Varying Systems and Computations Lecture 6
Tme-Varyng Systems and Computatons Lecture 6 Klaus Depold 14. Januar 2014 The Kalman Flter The Kalman estmaton flter attempts to estmate the actual state of an unknown dscrete dynamcal system, gven nosy
More informationONE DIMENSIONAL TRIANGULAR FIN EXPERIMENT. Technical Advisor: Dr. D.C. Look, Jr. Version: 11/03/00
ONE IMENSIONAL TRIANGULAR FIN EXPERIMENT Techncal Advsor: r..c. Look, Jr. Verson: /3/ 7. GENERAL OJECTIVES a) To understand a one-dmensonal epermental appromaton. b) To understand the art of epermental
More informationDigital Signal Processing
Dgtal Sgnal Processng Dscrete-tme System Analyss Manar Mohasen Offce: F8 Emal: manar.subh@ut.ac.r School of IT Engneerng Revew of Precedent Class Contnuous Sgnal The value of the sgnal s avalable over
More informationUsing Immune Genetic Algorithm to Optimize BP Neural Network and Its Application Peng-fei LIU1,Qun-tai SHEN1 and Jun ZHI2,*
Advances n Computer Scence Research (ACRS), volume 54 Internatonal Conference on Computer Networks and Communcaton Technology (CNCT206) Usng Immune Genetc Algorthm to Optmze BP Neural Network and Its Applcaton
More informationFor now, let us focus on a specific model of neurons. These are simplified from reality but can achieve remarkable results.
Neural Networks : Dervaton compled by Alvn Wan from Professor Jtendra Malk s lecture Ths type of computaton s called deep learnng and s the most popular method for many problems, such as computer vson
More informationNewton s Method for One - Dimensional Optimization - Theory
Numercal Methods Newton s Method for One - Dmensonal Optmzaton - Theory For more detals on ths topc Go to Clck on Keyword Clck on Newton s Method for One- Dmensonal Optmzaton You are free to Share to copy,
More informationXII.3 The EM (Expectation-Maximization) Algorithm
XII.3 The EM (Expectaton-Maxzaton) Algorth Toshnor Munaata 3/7/06 The EM algorth s a technque to deal wth varous types of ncoplete data or hdden varables. It can be appled to a wde range of learnng probles
More informationA Multi-modulus Blind Equalization Algorithm Based on Memetic Algorithm Guo Yecai 1, 2, a, Wu Xing 1, Zhang Miaoqing 1
Internatonal Conference on Materals Engneerng and Informaton Technology Applcatons (MEITA 1) A Mult-modulus Blnd Equalzaton Algorthm Based on Memetc Algorthm Guo Yeca 1,, a, Wu Xng 1, Zhang Maoqng 1 1
More informationUncertainty as the Overlap of Alternate Conditional Distributions
Uncertanty as the Overlap of Alternate Condtonal Dstrbutons Olena Babak and Clayton V. Deutsch Centre for Computatonal Geostatstcs Department of Cvl & Envronmental Engneerng Unversty of Alberta An mportant
More informationOn the Interval Zoro Symmetric Single-step Procedure for Simultaneous Finding of Polynomial Zeros
Appled Mathematcal Scences, Vol. 5, 2011, no. 75, 3693-3706 On the Interval Zoro Symmetrc Sngle-step Procedure for Smultaneous Fndng of Polynomal Zeros S. F. M. Rusl, M. Mons, M. A. Hassan and W. J. Leong
More informationLeast squares cubic splines without B-splines S.K. Lucas
Least squares cubc splnes wthout B-splnes S.K. Lucas School of Mathematcs and Statstcs, Unversty of South Australa, Mawson Lakes SA 595 e-mal: stephen.lucas@unsa.edu.au Submtted to the Gazette of the Australan
More informationCapacitor Placement In Distribution Systems Using Genetic Algorithms and Tabu Search
Capactor Placement In Dstrbuton Systems Usng Genetc Algorthms and Tabu Search J.Nouar M.Gandomar Saveh Azad Unversty,IRAN Abstract: Ths paper presents a new method for determnng capactor placement n dstrbuton
More information4DVAR, according to the name, is a four-dimensional variational method.
4D-Varatonal Data Assmlaton (4D-Var) 4DVAR, accordng to the name, s a four-dmensonal varatonal method. 4D-Var s actually a drect generalzaton of 3D-Var to handle observatons that are dstrbuted n tme. The
More informationEcon107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4)
I. Classcal Assumptons Econ7 Appled Econometrcs Topc 3: Classcal Model (Studenmund, Chapter 4) We have defned OLS and studed some algebrac propertes of OLS. In ths topc we wll study statstcal propertes
More informationOn a direct solver for linear least squares problems
ISSN 2066-6594 Ann. Acad. Rom. Sc. Ser. Math. Appl. Vol. 8, No. 2/2016 On a drect solver for lnear least squares problems Constantn Popa Abstract The Null Space (NS) algorthm s a drect solver for lnear
More informationPulse Coded Modulation
Pulse Coded Modulaton PCM (Pulse Coded Modulaton) s a voce codng technque defned by the ITU-T G.711 standard and t s used n dgtal telephony to encode the voce sgnal. The frst step n the analog to dgtal
More informationSupporting Information
Supportng Informaton The neural network f n Eq. 1 s gven by: f x l = ReLU W atom x l + b atom, 2 where ReLU s the element-wse rectfed lnear unt, 21.e., ReLUx = max0, x, W atom R d d s the weght matrx to
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 information3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X
Statstcs 1: Probablty Theory II 37 3 EPECTATION OF SEVERAL RANDOM VARIABLES As n Probablty Theory I, the nterest n most stuatons les not on the actual dstrbuton of a random vector, but rather on a number
More information1. Inference on Regression Parameters a. Finding Mean, s.d and covariance amongst estimates. 2. Confidence Intervals and Working Hotelling Bands
Content. Inference on Regresson Parameters a. Fndng Mean, s.d and covarance amongst estmates.. Confdence Intervals and Workng Hotellng Bands 3. Cochran s Theorem 4. General Lnear Testng 5. Measures of
More informationA discrete differential evolution algorithm for multi-objective permutation flowshop scheduling
A dscrete dfferental evoluton algorthm for mult-objectve permutaton flowshop schedulng M. Baolett, A. Mlan, V. Santucc Dpartmento d Matematca e Informatca Unverstà degl Stud d Peruga Va Vanvtell, 1 Peruga,
More informationAn Algorithm to Solve the Inverse Kinematics Problem of a Robotic Manipulator Based on Rotation Vectors
An Algorthm to Solve the Inverse Knematcs Problem of a Robotc Manpulator Based on Rotaton Vectors Mohamad Z. Al-az*, Mazn Z. Othman**, and Baker B. Al-Bahr* *AL-Nahran Unversty, Computer Eng. Dep., Baghdad,
More informationFUZZY FINITE ELEMENT METHOD
FUZZY FINITE ELEMENT METHOD RELIABILITY TRUCTURE ANALYI UING PROBABILITY 3.. Maxmum Normal tress Internal force s the shear force, V has a magntude equal to the load P and bendng moment, M. Bendng moments
More informationTHE ROBUSTNESS OF GENETIC ALGORITHMS IN SOLVING UNCONSTRAINED BUILDING OPTIMIZATION PROBLEMS
Nnth Internatonal IBPSA Conference Montréal, Canada August 5-8, 2005 THE ROBUSTNESS OF GENETIC ALGORITHMS IN SOLVING UNCONSTRAINED BUILDING OPTIMIZATION PROBLEMS Jonathan Wrght, and Al Alajm Department
More informationConstitutive Modelling of Superplastic AA-5083
TECHNISCHE MECHANIK, 3, -5, (01, 1-6 submtted: September 19, 011 Consttutve Modellng of Superplastc AA-5083 G. Gulano In ths study a fast procedure for determnng the constants of superplastc 5083 Al alloy
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 informationReview of Taylor Series. Read Section 1.2
Revew of Taylor Seres Read Secton 1.2 1 Power Seres A power seres about c s an nfnte seres of the form k = 0 k a ( x c) = a + a ( x c) + a ( x c) + a ( x c) k 2 3 0 1 2 3 + In many cases, c = 0, and the
More informationAn Interactive Optimisation Tool for Allocation Problems
An Interactve Optmsaton ool for Allocaton Problems Fredr Bonäs, Joam Westerlund and apo Westerlund Process Desgn Laboratory, Faculty of echnology, Åbo Aadem Unversty, uru 20500, Fnland hs paper presents
More informationResearch Article Green s Theorem for Sign Data
Internatonal Scholarly Research Network ISRN Appled Mathematcs Volume 2012, Artcle ID 539359, 10 pages do:10.5402/2012/539359 Research Artcle Green s Theorem for Sgn Data Lous M. Houston The Unversty of
More informationStatistical Inference. 2.3 Summary Statistics Measures of Center and Spread. parameters ( population characteristics )
Ismor Fscher, 8//008 Stat 54 / -8.3 Summary Statstcs Measures of Center and Spread Dstrbuton of dscrete contnuous POPULATION Random Varable, numercal True center =??? True spread =???? parameters ( populaton
More informationCOMPUTATIONALLY EFFICIENT WAVELET AFFINE INVARIANT FUNCTIONS FOR SHAPE RECOGNITION. Erdem Bala, Dept. of Electrical and Computer Engineering,
COMPUTATIONALLY EFFICIENT WAVELET AFFINE INVARIANT FUNCTIONS FOR SHAPE RECOGNITION Erdem Bala, Dept. of Electrcal and Computer Engneerng, Unversty of Delaware, 40 Evans Hall, Newar, DE, 976 A. Ens Cetn,
More information