International Journal of Scientific & Engineering Research Volume 8, Issue 7, July-2017 ISSN
|
|
- Delphia Greene
- 5 years ago
- Views:
Transcription
1 Iteratioal Joural of Scietific & Egieerig Research Volume 8, Issue, July- ISSN Estimatio of two layer soil parameters usig traditioal ad evolutioary methods Dr. Abraham George, M.S. Egieerig College, Bagalore, Idia. Soi.M, HKBK College of Egieerig, Bagalore, Idia. Abstract I this paper, the optimum values of the parameters of a two-layer soil model, are estimated by a traditioal method ad a evolutioary method. Both the methods start with the well-kow Weer resistivity measuremet data. I Weer method of measurig soil resistivity, a set of apparet resistivity measuremets are made with differet electrode spacig. For each measured value of apparet resistivity, the same is computed i terms of soil parameters, which are the upper layer soil resistivity, the lower layer soil resistivity ad the height of the upper layer. The optimal values of soil parameters are iteratively estimated. Optimal values are those values of soil parameters for which the sum of absolute values of ormalised error is the miimum. The differece betwee measured ad computed values of soil resistivity is termed as error. Particle Swarm Optimizatio is used as the evolutioary method i this paper. The search process is accelerated by a search space reductio techique to obtai the results i miimum umber of iteratios ad time. The algorithms have bee tested o ie sets of test data ad the results obtaied are better tha all the results published so far. Keywords Particle Swarm Optimizatio, Search space reductio, Soil parameter estimatio, Soil resistivity, Weer method, Evolutioary Computatio, Apparet resistivity. u. INTRODUCTION As soil resistivity is foud to vary with probe spacig, a set The Weer four probe method of measurig soil of measuremets are made with differet electrode spacig resistivity is very popular amog groud mat desig for estimatig the parameters of the two-layer soil model. egieers. Soil resistivity is rarely uiform ad a two-layer Usig the measuremet data, apparet resistivity model is widely accepted as the best for groud mat desig correspodig to each measured value are computed usig purpose. I Weer method, four probes are used for soil resistivity measuremet. They are placed alog a straight lie ad drive ito earth with equal spacig amog them. The depth of peetratio of a probe ito earth is adjusted approximately to te percet of the probe spacig. The outer probes are meat for passig a curret through earth ad the ier probes are meat for measurig the potetial differece betwee them. (). r I () é éæ k ö æ k öùù() ç ( h / a) ç 4 ( h / a) è + ø è + ø ë ûû a = r + 4å - = ë ρ is the upper layer soil resistivity, k is the reflectio factor give by (ρ - ρ)/( ρ + ρ), ρ is the lower layer soil resistivity, h is the height of the upper layer ad a is the probe spacig. ρ, ρ ad h are the three parameters of the two-layer soil model. Fig. Weer four probe method of measurig apparet resistivity The ifiite term give i () is computed a fiite umber of times depedig o the accuracy requiremet; is a quite reasoable value for the upper limit of as suggested by researchers. If a set of m measuremets are made, each measuremet correspodig to particular electrode spacig, the
2 Iteratioal Joural of Scietific & Egieerig Research Volume 8, Issue, July- ISSN apparet resistivity values are computed for each measured value. As computed value of apparet resistivity is a fuctio of ρ, ρ ad h, the optimizatio problem is stated as locatig values for ρ, ρ ad h such that the objective fuctio F is miimum ad stated as (). B T is the traspose of matrix B ad I is a idetity matrix of size m x m. α is a factor which decides the rate of covergece. The choice of α is ormally by trial ad error. But sufficiet care should be take as a wrog choice of α results i failure of covergece. m å meas comp meas miimize F = (( abs ( rai -rai )) / rai ) here i= r a meas i is the i th measured value of apparet resistivity ad apparet resistivity. () r a comp i is the i th computed value of Research has bee goig o i this filed for decades together ad plety of literature is already available o estimatio of two-layer soil parameters. Additioal iformatio o determiatio of soil parameters usig traditioal ad evolutioary methods ca be obtaied from [] - []. Now the elemets of A ad B are to be determied. If there are m measuremets, the for each measured value of apparet resistivity, the same is computed usig (). The differece betwee measured ad computed values is foud i all the m cases to form vector A. For determiig the elemets of B, the equatios give Fig. are made use of which give the partial derivatives of ρa with respect to ρ,ρ ad h. To evaluate these equatios, a iitial set of values of ρ,ρ ad h are essetial. These values ca be suitably assumed. A better practice is to take the iitial guess value of ρ as the measured value of apparet resistivity with miimum electrode spacig ad the iitial guess value of ρ as the measured value of apparet resistivity with imum electrode spacig. Iitial guess value of h is take as half of the imum. TRADITIONAL ALGORITHM electrode spacig. The traditioal method used here is a ucostraied, oliear optimizatio algorithm i which F, as suggested by = + 4å æ ö ç - - r é a æ ( -k ) ö k k ù (), is miimized without subjectig it to ay costrait. F is r = k ç ( ha / ) 4 ( ha / ) ë è ø è + + ø û zero whe measured ad computed values of apparet resistivity are the same i all the m cases. As apparet r é a æ ö k k ù = resistivity values are to be computed i m cases, there is a å ( k ) æ ö ç - - r = k ç ( h/ a) 4 ( h/ a) set of m o-liear equatios which are split ito a set of ë è øè + + ø û m liear equatios ad a correctio part. The equatios éæ ö æ öù ra 6r h k k are solved iteratively to obtai the optimum values of soil = å ç -ç.5.5 h a = ç parameters. ( 4 + ( h / a) ) ç ( + ( h / a) ) ëè ø è øû The liear equatios are of the form A=B*C where A is the vector of differece betwee measured ad computed values of apparet resistivity, B is the matrix of partial derivatives of ρa give i () with respect to ρ, ρ ad h C is the correctio vector cosistig of elemets ρ, ρ ad h. A is of size m x, B is of size m x 3 ad C is of size 3 x. Whe the set of liear equatios are solved, the correctio vector C ca be foud usig (3). Fig. Partial derivates of ρa with respect to ρ, ρ ad h. Structure of A,B ad C A elemet of vector A is the differece betwee the measured ad computed values of apparet resistivity. Vector A is of size m x. Matrix B cotais elemets which are the partial derivatives of ρa with respect to ρ, ρ ad h. There are m rows, where each row correspods to a measuremet. The matrix is of size m x 3. Vector C has correctio elemets to update the values of ρ, ρ ad h i iteratio. It is of size 3x. The structures are show i Fig.3. C BIB BIA a = (3) T - T ( ) ( )
3 Iteratioal Joural of Scietific & Egieerig Research Volume 8, Issue, July- ISSN meas comp éra -r ù a meas comp ra -ra A =... meas comp ëram -r am û B é r r r r r h r r r a a a ù a a a = r r h... ram ram ram ë r r h û C = h Fig.3. Structure of A.B ad C. Step-by-step procedure for estimatig optimal values of soil parameters by traditioal algorithm. Assig suitable iitial values for ρ, ρ ad h. Start iteratio cout. Specify tolerace.. Evaluate elemets of A usig the most recet values of ρ, ρ ad h. 3. Evaluate elemets of B usig the equatios give i Fig. with the most recet values of ρ, ρ ad h. Iitial guess value 4. Compute ( T - T C = B I B) ( B I A) a 5. If ρ, ρ ad h, the elemets of C, are less tha the specified tolerace, go to step. 6. Modify the preset values of ρ, ρ ad h to (ρ+ ρ), (ρ+ ρ) ad (h+ h). Advace iteratio cout ad go to step.. Display the fial values of ρ, ρ ad h. 8. Stop 3. THE PSO ALGORITHM The PSO method elimiates most of the mathematical computatios ivolved i the traditioal algorithm. The basic PSO algorithm for obtaiig the optimal values of soil parameters ρ, ρ ad h is the followig. A populatio of L umber of trial values is geerated for each soil parameter. With oe trial value for a parameter from each populatio, apparet resistivity values are computed for m measuremets ad the objective fuctio stated i () is evaluated. The process is repeated for the ext set of trial values ad so o till the ed of populatio. For each set of trial values persoal best is preserved ad at the ed of populatio global best is idetified. Now the populatio elemets are modified ad the process is repeated with the modified populatio elemets. The objective fuctio value keeps reducig ad the process is termiated after a defiite umber of iteratios. 3. Search Space Reductio The ormal PSO algorithm explores a large space for locatig optimal values of ρ, ρ ad h. The search space ca be reduced ad the process ca be expedited usig the followig techique. I ay traditioal iterative method, iitial guess values of the soil parameters ρ, ρ ad h are madatory for solvig the problem; also these guess values should be close to the fial coverged values. This aspect ca be icorporated i the PSO algorithm to reduce the search space. Thus the iitial search space for each soil parameter is defied by coverig a rage above ad below its iitial guess value. For example, at start, the upper limit of a soil parameter ca be set as thrice the iitial guess value ad the lower limit as zero. The iitial guess value is foud i the traditioal algorithm. Fig. 4. Iitial search space for a soil parameter Hece to reduce the search space, the ucostraied optimizatio problem is coverted to a costraied problem by imposig limits o variatio of the values of soil parameters ρ, ρ ad h. The modified optimizatio problem is stated as (4). miimize F = mi mi mi m i= meas comp meas (( abs( rai -rai ))/ rai ) subject to the imposed costraits r r r r r r h h h å The objective fuctio metioed above is costraied by upper ad lower limits of soil parameters ρ, ρ ad h at ay (4)
4 Iteratioal Joural of Scietific & Egieerig Research Volume 8, Issue, July- ISSN poit of time durig the iteratio process. Iitial guess values are foud as i the traditioal algorithm. Now the ρ, ρ ad h ad the fourth colum, to retai computed fitess values. The elemets of the first upper ad lower limits of ρ, ρ ad h ca be fixed. The three colums are iitialized with radom upper limit of a parameter ca be k times the iitial guess umbers mapped to the iitial search rage usig value ad the lower limit ca be zero. Normally k is stadard mappig rule. assiged a value greater tha. Due to the imposed costraits, the search for a parameter is carried out oly i the rage defied.. Copy the elemets of A to aother matrix B. I due course, B will retai the best persoal values of ρ, ρ, h ad the correspodig fitess value. As the search progresses, the upper ad lower limits of soil 3. Cosider the set of trial values for ρ, ρ ad h from parameters are reset about their most recet global best the first row of A. values istead of iitial guess values. The upper limits of 4. Compute the apparet resistivity the parameters are set as k times the most recet global best value of that parameter ad the lower limits are set as measured value of resistivity usig (). for each (-k) times the global best value. The limits are fixed as give i (4) with startig value for k equal to. This meas that the upper limit of the search space of a soil parameter has become twice its most recet global best value with Compute fitess usig (6) ad store the value i A as the fourth colum elemet of the same row. Compare the fitess values i A ad B. If the fitess value i A is higher, copy the row elemets lower limit remaiig zero. Subsequetly, say, whe k is to the correspodig positios i B. reduced to.5 o improvemet i global best fitess value,. Extract the set of trial values of ρ, ρ ad h from the upper limit ad lower limit of a parameter become.5 times ad.5 times its most recet global best value. The the ext row of A. value of k ca be gradually reduced to.. This meas that, 8. If ot ed-of-matrix, go to step 4. at ay poit of time durig the search, we are tryig to 9. Locate the highest fitess value i B ad the locate the optimal value of a parameter i a arrow rage correspodig global best values of ρ, ρ ad h. If above ad below its most recet global best value. Fig.5 fitess is more tha.999 or iteratio cout exceeds shows the reductio i search space as iteratio progresses. 5, stop the process. mi. Modify the search space usig (5) by reducig the r = (- k )* r gbest, r = k* rgbest value of k depedig o the curret best global mi r = (- k )* r gbest, r = k* rgbest fitess value. Modify all the values of ρ, ρ ad h mi h = (- k )* hgbest, h = k * hgbest (5) i matrix A without violatig limits. Go to step Modifyig the values of ρ, ρ ad h For modifyig the trial values of ρ, ρ ad h i matrix A, the followig well kow equatio is used. Fig. 5. Reductio i search space Fitess = / (+F). (6) 3. Step-by-step procedure for estimatig optimal values of soil parameters. Iitialize a matrix A of size L x 4, the first three colums of which are for retaiig trial values of v modified =w*v +c * rad * (pbest p) + c * rad * (gbest p) () The modified value of a soil parameter is the sum of three terms which are the followig. its preset value multiplied by a weightig fuctio the product of three parameters: a costat, the differece betwee its persoal best value ad the preset value ad a radom umber less tha oe the product of three parameters: a costat, the differece betwee its global best value ad the preset value ad a radom umber less tha oe While modifyig the soil parameter values i matrix A, their persoal best values ca be extracted from the same
5 Iteratioal Joural of Scietific & Egieerig Research Volume 8, Issue, July- ISSN row of matrix B ad the global best values as obtaied from step 9 of the step-by-step procedure. I case the modified value of a parameter violates the upper limit or lower limit, its value is fixed as the limitig value it has violated. This check retais the trial values i the search space. c, c ad w ca be assiged values as i ay stadard PSO algorithm. As this is a search for local optimum because of the ature of the problem it is ideal to choose a value of.4 for w. 4 EXECUTION AND RESULTS Table I ad Table II give the Weer resistivity measuremet data. Table I gives electrode spacig for ie differet set of measuremet data ad Table II gives the correspodig measured apparet resistivity values. Note that the first three sets of data are theoretically geerated. 4. Test data TABLE I ELECTRODE SPACING 4. Programmig tips for PSO algorithm Recommeded values: c=, c=, w=.4, iitial value of k=, fial value of k=., i ()= Covergece criterio: fitess >. 999/iteratio cout >5 4.3 Programmig tips for Traditioal algorithm The program is sesitive to the choice of α metioed i step 4 of the step-by-step procedure. I this algorithm a value of. give for α Covergece criterio: All the elemets of C are less tha tolerace, Executio results Executio results are show i Table III. Executio is doe usig a 3.5 GHz, AMD FX -83 Eight-Core processor with 4GB RAM. TABLE III EXECUTION RESULTS Set Electrode spacig (m) Set ρ ρ h Iterat Executi F Meth (Ω-m) (Ω-m) m io o time od cout (s) PSO Trad PSO Trad PSO Trad PSO Trad PSO Trad. TABLE II PSO Trad. MEASURED VALUES OF APPARENT RESISTIVITYCORRESPONDING PSO TO THE ELECTRODE SPACING GIVEN IN TABLE I Trad PSO Se Measured apparet resistivity (Ω-m) Trad. t PSO Trad Commets o results Data courtesy: [], [] Compariso of results obtaied by the two algorithms shows that PSO stads superior as far as simplicity ad miimizatio are cocered. Durig executio it has bee foud that PSO does t eed 5 iteratios for optimal results, i most of the cases covergece has bee obtaied withi 3 iteratios. Moreover PSO algorithm elimiates all complex mathematical steps ad the eed of derivatives. Objective fuctio values show that accuracy is more for PSO results. 4.6 Compariso of PSO results with GA solutios of Ioais [3] Table IV shows the compariso of PSO solutios with GA solutios of Ioais [3]. I all the six cases PSO solutios
6 Iteratioal Joural of Scietific & Egieerig Research Volume 8, Issue, July- ISSN are foud superior to GA solutios as far as accuracy is cocered. Also PSO works faster comparig with GA. [3] Del Alamo J. L.993. A compariso of eight differet techiques to achieve a optimum estimatio of electrical groudig parameter i two-layered earth. IEEE trasactio o power Delivery : TABLE IV COMPARISON OF PSO SOLUTION WITH GA SOLUTIONS OF IOANNIS [3] Set of data ρ (Ω-m) ρ (Ω-m) h m F Method GA PSO GA PSO GA PSO GA PSO GA PSO GA PSO [4] Ioais F. Goos., ad Ioais AStathopulos.5. Estimatio of multilayer soil parameters usig Geetic algorithm. IEEE Trasactio o Power Delivery:-6. [5] IEEE Guide for Measurig Earth Resistivity, Groud Impedace, ad Earth Surface Potetials of a Groudig System, IEEE Std [6] CalixtoW.P., Neto L.M.,YamaakaK.,ad Da Paz MoreiraE.. Parameter Estimatio of a Horizotal Multilayer Soil usig Geetic Algorithm. IEEE Trasactio o Power Delivery:5-5. [] IEEE Guide for Safety i AC Substatio groudig IEEE Std. 8-. [8] Soi. M ad Dr. Abraham George.5.. Cost Effective Groudig Grid Desig for Substatio. Iteratioal Joural of Scietific & Egieerig Research: Dr. Abraham George: He did his graduatio ad post 5 CONCLUSION graduatio i Egieerig from Calicut Uiversity ad PhD i Basically a PSO algorithm elimiates the eed of solvig Power system Optimizatio from Dr. MGR Uiversity. He has over 3 years of experiece i teachig. His area of iterest is a set of o-liear equatios for optimal values of soil power system related topics. parameters. A ormal PSO algorithm ca yield such accurate results oly with a large umber of iteratios. But, Soi M: Received B.E ad M.E degree from Bagalore the accelerated algorithm yields highly accurate results Uiversity. She is ito teachig sice 5 years ad presetly with the least umber of iteratios i the PSO eviromet. workig as associate prof. i EEE Dept. of HKBK College of The algorithm developed has bee tested o ie differet Egieerig, Begaluru. Her area of iterest is power system related topics. sets of data with three trials o each set of data. The stregth of this algorithm lies i reducig the search space gradually about the most recet global best values of soil. parameters. The comparative study of the PSO algorithm with the traditioal algorithm proves the superiority of the PSO algorithm i respect of simplicity ad accuracy. REFERENCES [] Has R. Sreedhar, ad J.K. Arora.99. Estimatio of two layer soil parameters usig fiite Weer resistivity equatios. IEEE Trasactio o Power Delivery:3-.. [] Del Alamo J. L. 99. A secod order gradiet techique for a improved estimatio of soil parameters i a two-layer earth. IEEE Trasactio o Power Delivery:66-.
Definitions and Theorems. where x are the decision variables. c, b, and a are constant coefficients.
Defiitios ad Theorems Remember the scalar form of the liear programmig problem, Miimize, Subject to, f(x) = c i x i a 1i x i = b 1 a mi x i = b m x i 0 i = 1,2,, where x are the decisio variables. c, b,
More informationVector Quantization: a Limiting Case of EM
. Itroductio & defiitios Assume that you are give a data set X = { x j }, j { 2,,, }, of d -dimesioal vectors. The vector quatizatio (VQ) problem requires that we fid a set of prototype vectors Z = { z
More informationMarkov Decision Processes
Markov Decisio Processes Defiitios; Statioary policies; Value improvemet algorithm, Policy improvemet algorithm, ad liear programmig for discouted cost ad average cost criteria. Markov Decisio Processes
More informationANALYSIS OF EXPERIMENTAL ERRORS
ANALYSIS OF EXPERIMENTAL ERRORS All physical measuremets ecoutered i the verificatio of physics theories ad cocepts are subject to ucertaities that deped o the measurig istrumets used ad the coditios uder
More informationDetection of Defective Element in a Space Borne Planar Array with Far-Field Power Pattern Using Particle Swarm Optimization
IOSR Joural of Electroics ad Commuicatio Egieerig (IOSR-JECE e-issn: 2278-2834,p- ISSN: 2278-8735.Volume, Issue 3, Ver. IV (Ma - Ju.2015, PP 17-22 www.iosrjourals.org Detectio of Defective Elemet i a Space
More informationREGRESSION (Physics 1210 Notes, Partial Modified Appendix A)
REGRESSION (Physics 0 Notes, Partial Modified Appedix A) HOW TO PERFORM A LINEAR REGRESSION Cosider the followig data poits ad their graph (Table I ad Figure ): X Y 0 3 5 3 7 4 9 5 Table : Example Data
More informationActivity 3: Length Measurements with the Four-Sided Meter Stick
Activity 3: Legth Measuremets with the Four-Sided Meter Stick OBJECTIVE: The purpose of this experimet is to study errors ad the propagatio of errors whe experimetal data derived usig a four-sided meter
More informationNUMERICAL METHODS FOR SOLVING EQUATIONS
Mathematics Revisio Guides Numerical Methods for Solvig Equatios Page 1 of 11 M.K. HOME TUITION Mathematics Revisio Guides Level: GCSE Higher Tier NUMERICAL METHODS FOR SOLVING EQUATIONS Versio:. Date:
More informationOptimization Methods MIT 2.098/6.255/ Final exam
Optimizatio Methods MIT 2.098/6.255/15.093 Fial exam Date Give: December 19th, 2006 P1. [30 pts] Classify the followig statemets as true or false. All aswers must be well-justified, either through a short
More informationOptimization Methods: Linear Programming Applications Assignment Problem 1. Module 4 Lecture Notes 3. Assignment Problem
Optimizatio Methods: Liear Programmig Applicatios Assigmet Problem Itroductio Module 4 Lecture Notes 3 Assigmet Problem I the previous lecture, we discussed about oe of the bech mark problems called trasportatio
More informationw (1) ˆx w (1) x (1) /ρ and w (2) ˆx w (2) x (2) /ρ.
2 5. Weighted umber of late jobs 5.1. Release dates ad due dates: maximimizig the weight of o-time jobs Oce we add release dates, miimizig the umber of late jobs becomes a sigificatly harder problem. For
More informationSequences, Mathematical Induction, and Recursion. CSE 2353 Discrete Computational Structures Spring 2018
CSE 353 Discrete Computatioal Structures Sprig 08 Sequeces, Mathematical Iductio, ad Recursio (Chapter 5, Epp) Note: some course slides adopted from publisher-provided material Overview May mathematical
More informationA NEW APPROACH TO SOLVE AN UNBALANCED ASSIGNMENT PROBLEM
A NEW APPROACH TO SOLVE AN UNBALANCED ASSIGNMENT PROBLEM *Kore B. G. Departmet Of Statistics, Balwat College, VITA - 415 311, Dist.: Sagli (M. S.). Idia *Author for Correspodece ABSTRACT I this paper I
More informationIntroduction to Optimization Techniques. How to Solve Equations
Itroductio to Optimizatio Techiques How to Solve Equatios Iterative Methods of Optimizatio Iterative methods of optimizatio Solutio of the oliear equatios resultig form a optimizatio problem is usually
More informationSequences I. Chapter Introduction
Chapter 2 Sequeces I 2. Itroductio A sequece is a list of umbers i a defiite order so that we kow which umber is i the first place, which umber is i the secod place ad, for ay atural umber, we kow which
More informationThe Method of Least Squares. To understand least squares fitting of data.
The Method of Least Squares KEY WORDS Curve fittig, least square GOAL To uderstad least squares fittig of data To uderstad the least squares solutio of icosistet systems of liear equatios 1 Motivatio Curve
More informationA statistical method to determine sample size to estimate characteristic value of soil parameters
A statistical method to determie sample size to estimate characteristic value of soil parameters Y. Hojo, B. Setiawa 2 ad M. Suzuki 3 Abstract Sample size is a importat factor to be cosidered i determiig
More informationSequences A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence
Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece 1, 1, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet
More informationMath 113, Calculus II Winter 2007 Final Exam Solutions
Math, Calculus II Witer 7 Fial Exam Solutios (5 poits) Use the limit defiitio of the defiite itegral ad the sum formulas to compute x x + dx The check your aswer usig the Evaluatio Theorem Solutio: I this
More informationWORKING WITH NUMBERS
1 WORKING WITH NUMBERS WHAT YOU NEED TO KNOW The defiitio of the differet umber sets: is the set of atural umbers {0, 1,, 3, }. is the set of itegers {, 3,, 1, 0, 1,, 3, }; + is the set of positive itegers;
More informationLecture 6 Chi Square Distribution (χ 2 ) and Least Squares Fitting
Lecture 6 Chi Square Distributio (χ ) ad Least Squares Fittig Chi Square Distributio (χ ) Suppose: We have a set of measuremets {x 1, x, x }. We kow the true value of each x i (x t1, x t, x t ). We would
More informationChapter 2 The Solution of Numerical Algebraic and Transcendental Equations
Chapter The Solutio of Numerical Algebraic ad Trascedetal Equatios Itroductio I this chapter we shall discuss some umerical methods for solvig algebraic ad trascedetal equatios. The equatio f( is said
More informationAn Introduction to Randomized Algorithms
A Itroductio to Radomized Algorithms The focus of this lecture is to study a radomized algorithm for quick sort, aalyze it usig probabilistic recurrece relatios, ad also provide more geeral tools for aalysis
More informationStatistical Inference Based on Extremum Estimators
T. Rotheberg Fall, 2007 Statistical Iferece Based o Extremum Estimators Itroductio Suppose 0, the true value of a p-dimesioal parameter, is kow to lie i some subset S R p : Ofte we choose to estimate 0
More informationMA131 - Analysis 1. Workbook 2 Sequences I
MA3 - Aalysis Workbook 2 Sequeces I Autum 203 Cotets 2 Sequeces I 2. Itroductio.............................. 2.2 Icreasig ad Decreasig Sequeces................ 2 2.3 Bouded Sequeces..........................
More informationOBJECTIVES. Chapter 1 INTRODUCTION TO INSTRUMENTATION FUNCTION AND ADVANTAGES INTRODUCTION. At the end of this chapter, students should be able to:
OBJECTIVES Chapter 1 INTRODUCTION TO INSTRUMENTATION At the ed of this chapter, studets should be able to: 1. Explai the static ad dyamic characteristics of a istrumet. 2. Calculate ad aalyze the measuremet
More informationAnalysis of Algorithms. Introduction. Contents
Itroductio The focus of this module is mathematical aspects of algorithms. Our mai focus is aalysis of algorithms, which meas evaluatig efficiecy of algorithms by aalytical ad mathematical methods. We
More informationTHE SOLUTION OF NONLINEAR EQUATIONS f( x ) = 0.
THE SOLUTION OF NONLINEAR EQUATIONS f( ) = 0. Noliear Equatio Solvers Bracketig. Graphical. Aalytical Ope Methods Bisectio False Positio (Regula-Falsi) Fied poit iteratio Newto Raphso Secat The root of
More informationLecture 6 Chi Square Distribution (χ 2 ) and Least Squares Fitting
Lecture 6 Chi Square Distributio (χ ) ad Least Squares Fittig Chi Square Distributio (χ ) Suppose: We have a set of measuremets {x 1, x, x }. We kow the true value of each x i (x t1, x t, x t ). We would
More informationsubject to A 1 x + A 2 y b x j 0, j = 1,,n 1 y j = 0 or 1, j = 1,,n 2
Additioal Brach ad Boud Algorithms 0-1 Mixed-Iteger Liear Programmig The brach ad boud algorithm described i the previous sectios ca be used to solve virtually all optimizatio problems cotaiig iteger variables,
More informationModified Ratio Estimators Using Known Median and Co-Efficent of Kurtosis
America Joural of Mathematics ad Statistics 01, (4): 95-100 DOI: 10.593/j.ajms.01004.05 Modified Ratio s Usig Kow Media ad Co-Efficet of Kurtosis J.Subramai *, G.Kumarapadiya Departmet of Statistics, Podicherry
More informationA sequence of numbers is a function whose domain is the positive integers. We can see that the sequence
Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece,, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet as
More informationSimulation. Two Rule For Inverting A Distribution Function
Simulatio Two Rule For Ivertig A Distributio Fuctio Rule 1. If F(x) = u is costat o a iterval [x 1, x 2 ), the the uiform value u is mapped oto x 2 through the iversio process. Rule 2. If there is a jump
More informationLinear Programming and the Simplex Method
Liear Programmig ad the Simplex ethod Abstract This article is a itroductio to Liear Programmig ad usig Simplex method for solvig LP problems i primal form. What is Liear Programmig? Liear Programmig is
More information7. Modern Techniques. Data Encryption Standard (DES)
7. Moder Techiques. Data Ecryptio Stadard (DES) The objective of this chapter is to illustrate the priciples of moder covetioal ecryptio. For this purpose, we focus o the most widely used covetioal ecryptio
More informationInfinite Sequences and Series
Chapter 6 Ifiite Sequeces ad Series 6.1 Ifiite Sequeces 6.1.1 Elemetary Cocepts Simply speakig, a sequece is a ordered list of umbers writte: {a 1, a 2, a 3,...a, a +1,...} where the elemets a i represet
More informationSample Size Determination (Two or More Samples)
Sample Sie Determiatio (Two or More Samples) STATGRAPHICS Rev. 963 Summary... Data Iput... Aalysis Summary... 5 Power Curve... 5 Calculatios... 6 Summary This procedure determies a suitable sample sie
More informationAnalysis of Experimental Measurements
Aalysis of Experimetal Measuremets Thik carefully about the process of makig a measuremet. A measuremet is a compariso betwee some ukow physical quatity ad a stadard of that physical quatity. As a example,
More informationµ and π p i.e. Point Estimation x And, more generally, the population proportion is approximately equal to a sample proportion
Poit Estimatio Poit estimatio is the rather simplistic (ad obvious) process of usig the kow value of a sample statistic as a approximatio to the ukow value of a populatio parameter. So we could for example
More informationNonlinear regression
oliear regressio How to aalyse data? How to aalyse data? Plot! How to aalyse data? Plot! Huma brai is oe the most powerfull computatioall tools Works differetly tha a computer What if data have o liear
More informationKinetics of Complex Reactions
Kietics of Complex Reactios by Flick Colema Departmet of Chemistry Wellesley College Wellesley MA 28 wcolema@wellesley.edu Copyright Flick Colema 996. All rights reserved. You are welcome to use this documet
More informationDifferent kinds of Mathematical Induction
Differet ids of Mathematical Iductio () Mathematical Iductio Give A N, [ A (a A a A)] A N () (First) Priciple of Mathematical Iductio Let P() be a propositio (ope setece), if we put A { : N p() is true}
More information6.867 Machine learning, lecture 7 (Jaakkola) 1
6.867 Machie learig, lecture 7 (Jaakkola) 1 Lecture topics: Kerel form of liear regressio Kerels, examples, costructio, properties Liear regressio ad kerels Cosider a slightly simpler model where we omit
More informationChandrasekhar Type Algorithms. for the Riccati Equation of Lainiotis Filter
Cotemporary Egieerig Scieces, Vol. 3, 00, o. 4, 9-00 Chadrasekhar ype Algorithms for the Riccati Equatio of Laiiotis Filter Nicholas Assimakis Departmet of Electroics echological Educatioal Istitute of
More informationEstimation of Population Mean Using Co-Efficient of Variation and Median of an Auxiliary Variable
Iteratioal Joural of Probability ad Statistics 01, 1(4: 111-118 DOI: 10.593/j.ijps.010104.04 Estimatio of Populatio Mea Usig Co-Efficiet of Variatio ad Media of a Auxiliary Variable J. Subramai *, G. Kumarapadiya
More informationMath 113 Exam 3 Practice
Math Exam Practice Exam will cover.-.9. This sheet has three sectios. The first sectio will remid you about techiques ad formulas that you should kow. The secod gives a umber of practice questios for you
More informationMonte Carlo Optimization to Solve a Two-Dimensional Inverse Heat Conduction Problem
Australia Joural of Basic Applied Scieces, 5(): 097-05, 0 ISSN 99-878 Mote Carlo Optimizatio to Solve a Two-Dimesioal Iverse Heat Coductio Problem M Ebrahimi Departmet of Mathematics, Karaj Brach, Islamic
More informationChapter 8: STATISTICAL INTERVALS FOR A SINGLE SAMPLE. Part 3: Summary of CI for µ Confidence Interval for a Population Proportion p
Chapter 8: STATISTICAL INTERVALS FOR A SINGLE SAMPLE Part 3: Summary of CI for µ Cofidece Iterval for a Populatio Proportio p Sectio 8-4 Summary for creatig a 100(1-α)% CI for µ: Whe σ 2 is kow ad paret
More informationIntroduction to Machine Learning DIS10
CS 189 Fall 017 Itroductio to Machie Learig DIS10 1 Fu with Lagrage Multipliers (a) Miimize the fuctio such that f (x,y) = x + y x + y = 3. Solutio: The Lagragia is: L(x,y,λ) = x + y + λ(x + y 3) Takig
More informationInformation-based Feature Selection
Iformatio-based Feature Selectio Farza Faria, Abbas Kazeroui, Afshi Babveyh Email: {faria,abbask,afshib}@staford.edu 1 Itroductio Feature selectio is a topic of great iterest i applicatios dealig with
More informationDotting The Dot Map, Revisited. A. Jon Kimerling Dept. of Geosciences Oregon State University
Dottig The Dot Map, Revisited A. Jo Kimerlig Dept. of Geoscieces Orego State Uiversity Dot maps show the geographic distributio of features i a area by placig dots represetig a certai quatity of features
More information15.081J/6.251J Introduction to Mathematical Programming. Lecture 21: Primal Barrier Interior Point Algorithm
508J/65J Itroductio to Mathematical Programmig Lecture : Primal Barrier Iterior Poit Algorithm Outlie Barrier Methods Slide The Cetral Path 3 Approximatig the Cetral Path 4 The Primal Barrier Algorithm
More informationMixtures of Gaussians and the EM Algorithm
Mixtures of Gaussias ad the EM Algorithm CSE 6363 Machie Learig Vassilis Athitsos Computer Sciece ad Egieerig Departmet Uiversity of Texas at Arligto 1 Gaussias A popular way to estimate probability desity
More informationIP Reference guide for integer programming formulations.
IP Referece guide for iteger programmig formulatios. by James B. Orli for 15.053 ad 15.058 This documet is iteded as a compact (or relatively compact) guide to the formulatio of iteger programs. For more
More informationECEN 655: Advanced Channel Coding Spring Lecture 7 02/04/14. Belief propagation is exact on tree-structured factor graphs.
ECEN 655: Advaced Chael Codig Sprig 014 Prof. Hery Pfister Lecture 7 0/04/14 Scribe: Megke Lia 1 4-Cycles i Gallager s Esemble What we already kow: Belief propagatio is exact o tree-structured factor graphs.
More informationLinear Regression Models
Liear Regressio Models Dr. Joh Mellor-Crummey Departmet of Computer Sciece Rice Uiversity johmc@cs.rice.edu COMP 528 Lecture 9 15 February 2005 Goals for Today Uderstad how to Use scatter diagrams to ispect
More information10.2 Infinite Series Contemporary Calculus 1
10. Ifiite Series Cotemporary Calculus 1 10. INFINITE SERIES Our goal i this sectio is to add together the umbers i a sequece. Sice it would take a very log time to add together the ifiite umber of umbers,
More informationAP Statistics Review Ch. 8
AP Statistics Review Ch. 8 Name 1. Each figure below displays the samplig distributio of a statistic used to estimate a parameter. The true value of the populatio parameter is marked o each samplig distributio.
More informationLinear regression. Daniel Hsu (COMS 4771) (y i x T i β)2 2πσ. 2 2σ 2. 1 n. (x T i β y i ) 2. 1 ˆβ arg min. β R n d
Liear regressio Daiel Hsu (COMS 477) Maximum likelihood estimatio Oe of the simplest liear regressio models is the followig: (X, Y ),..., (X, Y ), (X, Y ) are iid radom pairs takig values i R d R, ad Y
More informationf(x) dx as we do. 2x dx x also diverges. Solution: We compute 2x dx lim
Math 3, Sectio 2. (25 poits) Why we defie f(x) dx as we do. (a) Show that the improper itegral diverges. Hece the improper itegral x 2 + x 2 + b also diverges. Solutio: We compute x 2 + = lim b x 2 + =
More informationDisjoint set (Union-Find)
CS124 Lecture 7 Fall 2018 Disjoit set (Uio-Fid) For Kruskal s algorithm for the miimum spaig tree problem, we foud that we eeded a data structure for maitaiig a collectio of disjoit sets. That is, we eed
More informationProblem Cosider the curve give parametrically as x = si t ad y = + cos t for» t» ß: (a) Describe the path this traverses: Where does it start (whe t =
Mathematics Summer Wilso Fial Exam August 8, ANSWERS Problem 1 (a) Fid the solutio to y +x y = e x x that satisfies y() = 5 : This is already i the form we used for a first order liear differetial equatio,
More informationFourier Series and the Wave Equation
Fourier Series ad the Wave Equatio We start with the oe-dimesioal wave equatio u u =, x u(, t) = u(, t) =, ux (,) = f( x), u ( x,) = This represets a vibratig strig, where u is the displacemet of the strig
More informationOptimally Sparse SVMs
A. Proof of Lemma 3. We here prove a lower boud o the umber of support vectors to achieve geeralizatio bouds of the form which we cosider. Importatly, this result holds ot oly for liear classifiers, but
More informationMCT242: Electronic Instrumentation Lecture 2: Instrumentation Definitions
Faculty of Egieerig MCT242: Electroic Istrumetatio Lecture 2: Istrumetatio Defiitios Overview Measuremet Error Accuracy Precisio ad Mea Resolutio Mea Variace ad Stadard deviatio Fiesse Sesitivity Rage
More informationClassification of problem & problem solving strategies. classification of time complexities (linear, logarithmic etc)
Classificatio of problem & problem solvig strategies classificatio of time complexities (liear, arithmic etc) Problem subdivisio Divide ad Coquer strategy. Asymptotic otatios, lower boud ad upper boud:
More informationDETERMINATION OF MECHANICAL PROPERTIES OF A NON- UNIFORM BEAM USING THE MEASUREMENT OF THE EXCITED LONGITUDINAL ELASTIC VIBRATIONS.
ICSV4 Cairs Australia 9- July 7 DTRMINATION OF MCHANICAL PROPRTIS OF A NON- UNIFORM BAM USING TH MASURMNT OF TH XCITD LONGITUDINAL LASTIC VIBRATIONS Pavel Aokhi ad Vladimir Gordo Departmet of the mathematics
More information6.3 Testing Series With Positive Terms
6.3. TESTING SERIES WITH POSITIVE TERMS 307 6.3 Testig Series With Positive Terms 6.3. Review of what is kow up to ow I theory, testig a series a i for covergece amouts to fidig the i= sequece of partial
More informationAlgebra of Least Squares
October 19, 2018 Algebra of Least Squares Geometry of Least Squares Recall that out data is like a table [Y X] where Y collects observatios o the depedet variable Y ad X collects observatios o the k-dimesioal
More informationMATH 320: Probability and Statistics 9. Estimation and Testing of Parameters. Readings: Pruim, Chapter 4
MATH 30: Probability ad Statistics 9. Estimatio ad Testig of Parameters Estimatio ad Testig of Parameters We have bee dealig situatios i which we have full kowledge of the distributio of a radom variable.
More informationNumerical Solution of Non-linear Equations
Numerical Solutio of Noliear Equatios. INTRODUCTION The most commo reallife problems are oliear ad are ot ameable to be hadled by aalytical methods to obtai solutios of a variety of mathematical problems.
More informationBasics of Probability Theory (for Theory of Computation courses)
Basics of Probability Theory (for Theory of Computatio courses) Oded Goldreich Departmet of Computer Sciece Weizma Istitute of Sciece Rehovot, Israel. oded.goldreich@weizma.ac.il November 24, 2008 Preface.
More informationHOMEWORK #10 SOLUTIONS
Math 33 - Aalysis I Sprig 29 HOMEWORK # SOLUTIONS () Prove that the fuctio f(x) = x 3 is (Riema) itegrable o [, ] ad show that x 3 dx = 4. (Without usig formulae for itegratio that you leart i previous
More informationMath 155 (Lecture 3)
Math 55 (Lecture 3) September 8, I this lecture, we ll cosider the aswer to oe of the most basic coutig problems i combiatorics Questio How may ways are there to choose a -elemet subset of the set {,,,
More informationWeight Moving Average = n
1 Forecastig Simple Movig Average- F = 1 N (D + D 1 + D 2 + D 3 + ) Movig Weight Average- Weight Movig Average = W id i i=1 W i Sigle (Simple) Expoetial Smoothig- F t = F t 1 + α(d t 1 F t 1 ) or F t =
More informationAnalysis of Experimental Data
Aalysis of Experimetal Data 6544597.0479 ± 0.000005 g Quatitative Ucertaity Accuracy vs. Precisio Whe we make a measuremet i the laboratory, we eed to kow how good it is. We wat our measuremets to be both
More information4.3 Growth Rates of Solutions to Recurrences
4.3. GROWTH RATES OF SOLUTIONS TO RECURRENCES 81 4.3 Growth Rates of Solutios to Recurreces 4.3.1 Divide ad Coquer Algorithms Oe of the most basic ad powerful algorithmic techiques is divide ad coquer.
More informationNumber of fatalities X Sunday 4 Monday 6 Tuesday 2 Wednesday 0 Thursday 3 Friday 5 Saturday 8 Total 28. Day
LECTURE # 8 Mea Deviatio, Stadard Deviatio ad Variace & Coefficiet of variatio Mea Deviatio Stadard Deviatio ad Variace Coefficiet of variatio First, we will discuss it for the case of raw data, ad the
More informationDifferentiable Convex Functions
Differetiable Covex Fuctios The followig picture motivates Theorem 11. f ( x) f ( x) f '( x)( x x) ˆx x 1 Theorem 11 : Let f : R R be differetiable. The, f is covex o the covex set C R if, ad oly if for
More informationChapter 11 Output Analysis for a Single Model. Banks, Carson, Nelson & Nicol Discrete-Event System Simulation
Chapter Output Aalysis for a Sigle Model Baks, Carso, Nelso & Nicol Discrete-Evet System Simulatio Error Estimatio If {,, } are ot statistically idepedet, the S / is a biased estimator of the true variace.
More informationEcon 325 Notes on Point Estimator and Confidence Interval 1 By Hiro Kasahara
Poit Estimator Eco 325 Notes o Poit Estimator ad Cofidece Iterval 1 By Hiro Kasahara Parameter, Estimator, ad Estimate The ormal probability desity fuctio is fully characterized by two costats: populatio
More informationMATH/STAT 352: Lecture 15
MATH/STAT 352: Lecture 15 Sectios 5.2 ad 5.3. Large sample CI for a proportio ad small sample CI for a mea. 1 5.2: Cofidece Iterval for a Proportio Estimatig proportio of successes i a biomial experimet
More informationThe axial dispersion model for tubular reactors at steady state can be described by the following equations: dc dz R n cn = 0 (1) (2) 1 d 2 c.
5.4 Applicatio of Perturbatio Methods to the Dispersio Model for Tubular Reactors The axial dispersio model for tubular reactors at steady state ca be described by the followig equatios: d c Pe dz z =
More informationRecurrence Relations
Recurrece Relatios Aalysis of recursive algorithms, such as: it factorial (it ) { if (==0) retur ; else retur ( * factorial(-)); } Let t be the umber of multiplicatios eeded to calculate factorial(). The
More information(a) (b) All real numbers. (c) All real numbers. (d) None. to show the. (a) 3. (b) [ 7, 1) (c) ( 7, 1) (d) At x = 7. (a) (b)
Chapter 0 Review 597. E; a ( + )( + ) + + S S + S + + + + + + S lim + l. D; a diverges by the Itegral l k Test sice d lim [(l ) ], so k l ( ) does ot coverge absolutely. But it coverges by the Alteratig
More informationMathematical Modeling of Optimum 3 Step Stress Accelerated Life Testing for Generalized Pareto Distribution
America Joural of Theoretical ad Applied Statistics 05; 4(: 6-69 Published olie May 8, 05 (http://www.sciecepublishiggroup.com/j/ajtas doi: 0.648/j.ajtas.05040. ISSN: 6-8999 (Prit; ISSN: 6-9006 (Olie Mathematical
More informationRandom Variables, Sampling and Estimation
Chapter 1 Radom Variables, Samplig ad Estimatio 1.1 Itroductio This chapter will cover the most importat basic statistical theory you eed i order to uderstad the ecoometric material that will be comig
More informationMATH 10550, EXAM 3 SOLUTIONS
MATH 155, EXAM 3 SOLUTIONS 1. I fidig a approximate solutio to the equatio x 3 +x 4 = usig Newto s method with iitial approximatio x 1 = 1, what is x? Solutio. Recall that x +1 = x f(x ) f (x ). Hece,
More informationProblem Set 4 Due Oct, 12
EE226: Radom Processes i Systems Lecturer: Jea C. Walrad Problem Set 4 Due Oct, 12 Fall 06 GSI: Assae Gueye This problem set essetially reviews detectio theory ad hypothesis testig ad some basic otios
More informationCEE 522 Autumn Uncertainty Concepts for Geotechnical Engineering
CEE 5 Autum 005 Ucertaity Cocepts for Geotechical Egieerig Basic Termiology Set A set is a collectio of (mutually exclusive) objects or evets. The sample space is the (collectively exhaustive) collectio
More informationInteger Linear Programming
Iteger Liear Programmig Itroductio Iteger L P problem (P) Mi = s. t. a = b i =,, m = i i 0, iteger =,, c Eemple Mi z = 5 s. t. + 0 0, 0, iteger F(P) = feasible domai of P Itroductio Iteger L P problem
More informationECE 8527: Introduction to Machine Learning and Pattern Recognition Midterm # 1. Vaishali Amin Fall, 2015
ECE 8527: Itroductio to Machie Learig ad Patter Recogitio Midterm # 1 Vaishali Ami Fall, 2015 tue39624@temple.edu Problem No. 1: Cosider a two-class discrete distributio problem: ω 1 :{[0,0], [2,0], [2,2],
More informationModule 5 EMBEDDED WAVELET CODING. Version 2 ECE IIT, Kharagpur
Module 5 EMBEDDED WAVELET CODING Versio ECE IIT, Kharagpur Lesso 4 SPIHT algorithm Versio ECE IIT, Kharagpur Istructioal Objectives At the ed of this lesso, the studets should be able to:. State the limitatios
More informationChapter 8: Estimating with Confidence
Chapter 8: Estimatig with Cofidece Sectio 8.2 The Practice of Statistics, 4 th editio For AP* STARNES, YATES, MOORE Chapter 8 Estimatig with Cofidece 8.1 Cofidece Itervals: The Basics 8.2 8.3 Estimatig
More informationOPTIMAL ALGORITHMS -- SUPPLEMENTAL NOTES
OPTIMAL ALGORITHMS -- SUPPLEMENTAL NOTES Peter M. Maurer Why Hashig is θ(). As i biary search, hashig assumes that keys are stored i a array which is idexed by a iteger. However, hashig attempts to bypass
More informationA New Solution Method for the Finite-Horizon Discrete-Time EOQ Problem
This is the Pre-Published Versio. A New Solutio Method for the Fiite-Horizo Discrete-Time EOQ Problem Chug-Lu Li Departmet of Logistics The Hog Kog Polytechic Uiversity Hug Hom, Kowloo, Hog Kog Phoe: +852-2766-7410
More informationPROPERTIES OF THE POSITIVE INTEGERS
PROPERTIES OF THE POSITIVE ITEGERS The first itroductio to mathematics occurs at the pre-school level ad cosists of essetially coutig out the first te itegers with oe s figers. This allows the idividuals
More informationCHAPTER 5. Theory and Solution Using Matrix Techniques
A SERIES OF CLASS NOTES FOR 2005-2006 TO INTRODUCE LINEAR AND NONLINEAR PROBLEMS TO ENGINEERS, SCIENTISTS, AND APPLIED MATHEMATICIANS DE CLASS NOTES 3 A COLLECTION OF HANDOUTS ON SYSTEMS OF ORDINARY DIFFERENTIAL
More information6 Sample Size Calculations
6 Sample Size Calculatios Oe of the major resposibilities of a cliical trial statisticia is to aid the ivestigators i determiig the sample size required to coduct a study The most commo procedure for determiig
More informationLecture 8: Solving the Heat, Laplace and Wave equations using finite difference methods
Itroductory lecture otes o Partial Differetial Equatios - c Athoy Peirce. Not to be copied, used, or revised without explicit writte permissio from the copyright ower. 1 Lecture 8: Solvig the Heat, Laplace
More information