Constraining the Sum of Multivariate Estimates. Behrang Koushavand and Clayton V. Deutsch

Size: px
Start display at page:

Download "Constraining the Sum of Multivariate Estimates. Behrang Koushavand and Clayton V. Deutsch"

Transcription

1 Constranng the Sm of Mltarate Estmates Behrang Koshaand and Clayton V. Detsch Geostatstcans are ncreasngly beng faced wth compostonal data arsng from fll geochemcal samplng or some other sorce. Logratos are sed at tmes to ensre the resltng estmates sm to nty; howeer, the logarthm transform can ntrodce a bas. We may want to cokrge the arables drectly whle ensrng that the estmates sm to nty. A lnear constrant s added to the Cokrgng system. The large cokrgng system estmates all arables at the same tme sch that the sm of all arables to be a specfed constant ale. The methodology and practcal concerns are dscssed. Introdcton Compostonal data are represented as ector arables, wth nddal ector components rangng between zero and a poste maxmm ale representng a constant sm constrant, sally nty (or 00%. The earth scences commonly enconter spatal dstrbtons of compostonal data, sch as concentratons of consttents n natral waters (e.g., mole, mass, or olme fractons, mneral percentages, ore grades, or proportons of mtally exclse categores (e.g., a water ol rock system. Tradtonal geostatstcal methods, sch as krgng or co-krgng, wll not respect the compostonal natre of data f appled drectly becase these methods calclate estmates that are ndependently optmal. A constant sm constrant ntrodces negate correlatons. The constant sm constrant also prodces cokrgng systems of eqatons that are ntractable for conentonal lnear eqaton solers (Carle, 004. Most of the methods amed at compostonal data are based on data re-expresson or transformaton. The data mst be transformed to new arables to elmnate the constrants. Then geostatstcal models of new arables hae been created, ths model shold be back transformed to orgnal nt data, whch most of these methods do not hae a lnear back transformaton and ntrodce seros rsk of bas. The approach presented here s a lnear estmaton that mnmzes estmaton arance. In practce, the proposal s the conentonal cokrgng wth an addtonal constrant. Methodology Consder the staton where the composte data { z,,..,n,,..., } = = at any, possbly dfferent, locatons. The lnear estmator for each of arables s (Gooaerts, 997: n ( k Zk( mk( = λ ( Z m k,..., = = k λ s the weght assgn to the datm Z ( to estmate Zk where random arable (RV k mnmze error arance ( Z s denoted m σ, that s (Gooaerts, 997: k k( Var{ Zk( Zk( } n ( nj( k k..c j j β = j= = β j= n ( k Ckk ( 0 (.C k = = σ = k = (. The expected ale of the. All co-krgng estmator shold be nbased and = λ λ + λ k =,..., ( where C j s cross coarance fncton between arables and j, C k s coarance fncton of arable k. The estmaton arance s mnmzed nder the constant that the expected error s zero: 308-

2 { k k} E Z Z = 0 ; k =,..., (3 It has been shown that smple co-krgng (SCK s nbased snce statonary mean of each RVs s constant oer the entre doman: mk( = m k, =..n ; k =,..., (4 Smple Co-krgng system s wrtten as: n ( nj( n ( k k λ. λβ.cj β = Ck =,...,, k =,..., j j = = β j= = The matrx notaton for fll Co-krgng system s shown below: A sck. Γ sck = bsck (5 where, C ( C ( β β Asck = C( β C ( β λ β λ ( β Γ sck = ( λβ λ ( β C ( C bsck = C( C ( There are lnear systems that shold be soled separately. There s no garantee for sch lnear systems that sm of estmated arables to be a constant ale whch s ery mportant n compostonal data. A compostonal Co-krgng (CCK system has been defned here, soles a ery bg lnear system sch that sm of all estmated arables hae to be a constant ale. The compostonal smple co-krgng (CSCK system s defned as below: A CSCK. Γ CSCK = bcsck (6 T C ( β C Z Z( β [ 0] [ 0 ] C C Z ( Z A CSCK ( β ( β [ 0] [ 0] T C ( C β ( β = Z( Z( [ 0] [ 0] C( β C Z Z β T T Z( Z( Z Z [ 0] Z ( Z Z Z 308-

3 ( λ β C ( λβ ( C( Γ = CSCK λ β ( b = CSCK C ( λβ ( C ( 0 Const The estmaton arance for each of arables s larger than SCK estmator. Ordnary and tradtonal ordnary co-krgng systems also ntrodce lnear constrants for each arable, whch shold consder at lnear system (6. Cokt3D_ (Detsch and Jornel 997 program has been modfed to sole a fll cokrgng whch estmated ales hae a constrant sm to a constant. Dscsson The constraned cokrgng system ensres that the estmates sm to nty, bt there s no garantee to get non-negate estmates. To sole ths problem, we need to mnmze the estmaton arance wth other algorthms. Ths leads to excesse CPU reqrements. The second and more reasonable method s to replace negate ales wth 0 and remoe them form system of eqatons and resole for the optmal estmates. Ths method also forces algorthm to sole cokrgng two tmes for each negate estmate, bt t s more effcent and faster then solng krgng system wth another algorthm. Ths algorthm s referred to as constraned poste Cokrgng. The second sse s bas n the constraned co-krgng system. All krgng estmates are nbased becase the expected ale of dfference between estmate and tre ale s 0. Ths means that these estmates dose not hae any systematc error. E{ Zk( Zk( } = 0 So, E λ( Z( Z( = 0 (7 = Howeer, n constraned co-krgng, the system of eqatons s soled sch that estmates are forced to sm to nty. These means that krgng weght λ ( are not ndependent from arables Z( and may case based estmate ale. Ths sse needs more stdy. Small Example Consder two data wth three arables: Z = 0.0 Z = 0.50 Z = Z =? Z =? Z =? Z = 0.0 Z = 0.70 Z = m where the arogram of ths data set s: 6m 308-3

4 h h γ Z ( h = 0.5.Sph Sph 5 0 h h γ Z ( h = 0..Sph 0.8.Sph h h γ Z ( h = 0.8.Sph 0..Sph h h γ ZZ ( h =0..Sph 0.3.Sph 5 0 h h γ ZZ ( h =0.3.Sph 0..Sph h h γ ZZ3( h = 0. 3.Sph 0.3.Sph Tables below show the Left hand sde matrx A and rght hand sde ector CSCK b. CSCK The table below shows the solton of lnear system of CSCK, estmate and estmaton arance ales. Z W W W3 ZW ZW ZW Large Data Set Z = Z = Z = σ csck = σ csck = σ csck = = Z = There s three arable n ths data set that shold be sm to at each sample or estmated locaton. Fgre shows the locaton map and fgre shows hstograms and Scatter plot of arables. Cokt3D and Cokt3D_ wth and wthot forced to poste estmate were sed to an ordnary fll co-krgng estmaton to compare the reslts. All three methods were sed wth the same LMC model sed n small data set aboe. Pxel plot of estmate and estmaton arance ales are presented at fgre 3 and 4 respectely. The blank blocks on rght colmn maps, whch appear on the second arable, are zero estmates replaced wth negate estmate ales on the mddle colmn. Hstograms of estmated ales and scatter plot of estmate arance ales are shown at fgre 5, 6 and 7 respectely. There s no sch a bg dfference at estmate arance ales between three methods, bt t s clear that addng sm to constrant and forcng to get poste estmates ncrease estmaton arance

5 There are 36 negate estmates wth Cokrgng and 35 estmates wth constraned Cokrgng and the sm of all negate ales of second arable for frst and second method respectely are and -3.. Addng sm to constrant to Cokrgng system decrease nmber of negate estmates for second arable bt we stll hae negate estmates, whch are replaced wth zero by constraned poste Cokrgng; Sgsm (Detsch and Jornel 997 was sed to generate 00 realzatons of ncondtonal smlaton for each of arables n Gassan space and then all realzatons were back transferred to orgnal nts and standardzed to get sm of arables n eery locaton to. The same sample locatons were extracted from each realzaton. Cokrgng and constraned poste Cokrgng were sed to estmate n-sampled locatons that we already hae the tre ales. Fgre 8 shows the hstograms of Error (Estmate-Tre wth these two methods. As we expected there s a ery small based on estmaton of V and V, bt for ths case stdy constraned poste Cokrgng dose not nject sgnfcant based to the estmaton. Conclson Geostatstcans commonly enconter compostonal data. on lnear transformaton of these arables wth technqes lke logratos s problematc becase of sgnfcant bas. Krgng n orgnal nts prodes a best lnear nbased estmator. Tradtonal cokrgng does not constran the sm of estmates. The approach presented here leads to a large cokrgng system that has a constrant to force estmated ales to sm to a constant. egate estmated arables was set to 0 and remoed form system of eqatons and a new system of eqatons s soled. Ths method reqres more CPU tme than tradtonal Cokrgng becase algorthm soles a bg lnear system rather than (nmber of arables smaller lnear systems n Cokrgng. References Carle, S. F., 004, Geostatstcal Analyss of Compostonal Data : Oxford Unersty Press, ew York Detsch, C. V., and Jornel, A. G., 998, GSLIB: Geostatstcal software lbrary and sers gde, nd ed.: Oxford Unersty Press, ew York, 369 p. Gooaerts, P., 997, Geostatstcs for atral Resorces Ealaton: Oxford Unersty Press, ew York Woronow, A. 995, A Psedo-Genetc Algorthm Sted to Compostonal Data: Math Geology,. 7, no., p Locatons of V 6 Locatons of V 6 Locatons of V Fgre. Locaton map of samples and three arables content 308-5

6 mber of Data 67 mean 0.8 std. de coef. of ar maxmm 0.63 pper qartle 0.95 medan 0.4 lower qartle 3 mnmm 00 V mber of data 67 mber plotted 67 X Varable: mean 0.8 std. de mn. 00 max Y Varable: mean 39 std. de. 55 mn. 00 max correlaton 0.5 rank correlaton V V mber of Data 67 mean 39 std. de. 55 coef. of ar.409 maxmm 0.74 pper qartle 5 medan lower qartle 0 mnmm 00 V mber of data 67 mber plotted 67 X Varable: mean 0.8 std. de mn. 00 max Y Varable: mean std. de mn max..000 correlaton rank correlaton V V mber of Data 67 mean std. de coef. of ar 0.30 maxmm.000 pper qartle 0.96 medan lower qartle mnmm 0.85 V mber of data 67 mber plotted 67 X Varable: mean 39 std. de. 55 mn. 00 max Y Varable: mean std. de mn max..000 correlaton rank correlaton V3 Fgre. Hstograms and Scatter plot of arables V 308-6

7 600 V Co-Krggn Estmate V Compo. Co-Krggn Estmate 600 V Compo. Co-Krggn Estmate V Co-Krggn Estmate V Compo. Co-Krggn Estmate V3 Co-Krggn Estmate V3 Compo. Co-Krggn Estmate 300 V Compo. Co-Krggn Estmate V3 Compo. Co-Krggn Estmate Fgre 3. Co krgng Estmate map: wthot constrants(left, constrant sm to (mddle and constrant sm to whch forced to poste ales (rght 308-7

8 600 V Co-Krggn Estmate Var. V Compo. Co-Krggn Estmate Var. 600 V Compo. Co-Krggn Estmate Var V Co-Krggn Estmate Var. V Compo. Co-Krggn Estmate Var V3 Co-Krggn Estmate Var. V3 Compo. Co-Krggn Estmate Var. 300 V Compo. Co-Krggn Estmate Var V3 Compo. Co-Krggn Estmate Var Fgre 4. Co krgng Estmaton arance map: wthot constrants(left, constrant sm to (mddle and constrant sm to whch forced to poste ales (rght 308-8

9 mber of Data 800 mean 0.69 std. de. 0.0 coef. of ar maxmm 0.67 pper qartle 0.38 medan 0.73 lower qartle 0.97 mnmm mber of Data 800 mean std. de. 0.3 coef. of ar maxmm 0.68 pper qartle medan lower qartle 0.65 mnmm mber of Data 800 mean 0.35 std. de. 0. coef. of ar maxmm 0.68 pper qartle medan lower qartle 0.64 mnmm estmate V estmate V_C estmate V_C mber of Data 800 mean -33 std. de. 67 maxmm 0.33 pper qartle 05 medan -37 lower qartle -74 mnmm mber of Data 800 mean 47 std. de. 5 maxmm 0.8 pper qartle 70 medan 34 lower qartle mnmm mber of Data 567 nmber trmmed 33 mean 57 std. de. 5 coef. of ar maxmm 0.80 pper qartle 78 medan 4 lower qartle 0 mnmm estmate V estmate V_C estmate V_C mber of Data 800 mean std. de coef. of ar 0.65 maxmm pper qartle 0.68 medan lower qartle 0.48 mnmm mber of Data 800 mean std. de coef. of ar 0.4 maxmm pper qartle 0.73 medan 0.60 lower qartle 0.47 mnmm mber of Data 800 mean std. de coef. of ar 0.4 maxmm pper qartle 0.70 medan 0.60 lower qartle mnmm estmate V estmate V3_C estmate V3_C Fgre 5. hstogram of Co krgng Estmate: wthot constrants(left, constrant sm to (mddle and constrant sm to whch forced to poste ales (rght 308-9

10 estmate V_C mber of data 800 mber plotted 800 X Varable: mean 0.69 std. de. 0.0 mn. 5 max Y Varable: mean std. de. 0.3 mn. 43 max correlaton 0.93 rank correlaton 0.93 estmaton arance V_C mber of data 800 mber plotted 800 X Varable: mean std. de. 0.7 mn. 9 max..050 Y Varable: mean std. de mn. 8 max..3 correlaton rank correlaton estmate V estmaton arance V 0.59 mber of data 800 mber plotted mber of data 800 mber plotted 800 estmate V_C X Varable: mean -33 std. de. 67 mn max Y Varable: mean 47 std. de. 5 mn. -4 max. 0.8 correlaton rank correlaton estmaton arance V_C X Varable: mean std. de. 0.0 mn. max..034 Y Varable: mean 0.47 std. de. 0.3 mn. max..090 correlaton rank correlaton estmate V estmaton arance V mber of data 800 mber plotted mber of data 800 mber plotted 800 estmate V3_C X Varable: mean std. de mn max Y Varable: mean std. de mn max correlaton rank correlaton estmaton arance V3_C X Varable: mean 0.79 std. de mn. 5 max..06 Y Varable: mean 0.79 std. de mn. 5 max..36 correlaton rank correlaton estmate V 3 estmaton arance V 3 Fgre 6. Scatterplots of estmated ales and estmaton arance ales: Cokrgng s. Constraned Cokrgng 308-0

11 estmate V_C mber of data 800 mber plotted 800 X Varable: mean 0.69 std. de. 0.0 mn. 5 max Y Varable: mean 0.35 std. de. 0. mn. 4 max correlaton rank correlaton 0.93 estmaton arance V_C mber of data 800 mber plotted 800 X Varable: mean std. de. 0.7 mn. 9 max..050 Y Varable: mean std. de mn. 8 max..59 correlaton rank correlaton estmate V estmaton arance V estmate V_C mber of data 567 mber plotted 567 mber trmmed 33 X Varable: mean - std. de. 6 mn max Y Varable: mean 57 std. de. 5 mn. 00 max correlaton 0.73 rank correlaton estmaton arance V_C mber of data 567 mber plotted 567 mber trmmed 33 X Varable: mean 0.47 std. de. 0.0 mn. max..034 Y Varable: mean 0.47 std. de mn. max..8 correlaton rank correlaton estmate V estmaton arance V estmate V3_C mber of data 800 mber plotted 800 X Varable: mean std. de mn max Y Varable: mean std. de mn max correlaton 0.98 rank correlaton estmaton arance V3_C mber of data 800 mber plotted 800 X Varable: mean 0.79 std. de mn. 5 max..06 Y Varable: mean 0.79 std. de mn. 5 max..84 correlaton rank correlaton estmate V 3 estmaton arance V 3 Fgre 7. Scatterplots of estmated ales and estmaton arance ales: Cokrgng s. Constraned Poste Cokrgng 308-

12 V: Tre-Est mber of Data nmber trmmed 45 mean -50 std. de maxmm pper qartle 89 medan -48 lower qartle -586 mnmm V: Tre-Est mber of Data nmber trmmed 457 mean -368 std. de maxmm pper qartle 53 medan lower qartle -853 mnmm V: Tre-Est _Tre-Est mber of Data nmber trmmed 45 mean -060 std. de. 943 maxmm pper qartle 366 medan 056 lower qartle -389 mnmm V: Tre-Est _Tre-Est mber of Data nmber trmmed 3 mean -95 std. de. 86 maxmm 0.93 pper qartle 056 medan -60 lower qartle -67 mnmm V3: Tre-Est _Tre-Est mber of Data nmber trmmed 45 mean 746 std. de maxmm pper qartle 0.30 medan 670 lower qartle 9 mnmm V3: Tre-Est _Tre-Est mber of Data nmber trmmed 454 mean 650 std. de maxmm pper qartle 0.05 medan 598 lower qartle 084 mnmm _Tre-Est _Tre-Est Fgre 8. Hstograms of Error: Cokrgng Estmate Tre Vale ; Left: Cokrgng (left and Rght: Constraned poste Cokrgng 308-

ESS 265 Spring Quarter 2005 Time Series Analysis: Error Analysis

ESS 265 Spring Quarter 2005 Time Series Analysis: Error Analysis ESS 65 Sprng Qarter 005 Tme Seres Analyss: Error Analyss Lectre 9 May 3, 005 Some omenclatre Systematc errors Reprodcbly errors that reslt from calbraton errors or bas on the part of the obserer. Sometmes

More information

Reading Assignment. Panel Data Cross-Sectional Time-Series Data. Chapter 16. Kennedy: Chapter 18. AREC-ECON 535 Lec H 1

Reading Assignment. Panel Data Cross-Sectional Time-Series Data. Chapter 16. Kennedy: Chapter 18. AREC-ECON 535 Lec H 1 Readng Assgnment Panel Data Cross-Sectonal me-seres Data Chapter 6 Kennedy: Chapter 8 AREC-ECO 535 Lec H Generally, a mxtre of cross-sectonal and tme seres data y t = β + β x t + β x t + + β k x kt + e

More information

AE/ME 339. K. M. Isaac. 8/31/2004 topic4: Implicit method, Stability, ADI method. Computational Fluid Dynamics (AE/ME 339) MAEEM Dept.

AE/ME 339. K. M. Isaac. 8/31/2004 topic4: Implicit method, Stability, ADI method. Computational Fluid Dynamics (AE/ME 339) MAEEM Dept. AE/ME 339 Comptatonal Fld Dynamcs (CFD) Comptatonal Fld Dynamcs (AE/ME 339) Implct form of dfference eqaton In the prevos explct method, the solton at tme level n,,n, depended only on the known vales of,

More information

Centre for Efficiency and Productivity Analysis

Centre for Efficiency and Productivity Analysis Centre for Effcency and Prodctty Analyss Workng Paper Seres No. WP/7 Ttle On The Dstrbton of Estmated Techncal Effcency n Stochastc Fronter Models Athors We Sang Wang & Peter Schmdt Date: May, 7 School

More information

MEMBRANE ELEMENT WITH NORMAL ROTATIONS

MEMBRANE ELEMENT WITH NORMAL ROTATIONS 9. MEMBRANE ELEMENT WITH NORMAL ROTATIONS Rotatons Mst Be Compatble Between Beam, Membrane and Shell Elements 9. INTRODUCTION { XE "Membrane Element" }The comple natre of most bldngs and other cvl engneerng

More information

3/31/ = 0. φi φi. Use 10 Linear elements to solve the equation. dx x dx THE PETROV-GALERKIN METHOD

3/31/ = 0. φi φi. Use 10 Linear elements to solve the equation. dx x dx THE PETROV-GALERKIN METHOD THE PETROV-GAERKIN METHO Consder the Galern solton sng near elements of the modfed convecton-dffson eqaton α h d φ d φ + + = α s a parameter between and. If α =, we wll have the dscrete Galern form of

More information

Bruce A. Draper & J. Ross Beveridge, January 25, Geometric Image Manipulation. Lecture #1 January 25, 2013

Bruce A. Draper & J. Ross Beveridge, January 25, Geometric Image Manipulation. Lecture #1 January 25, 2013 Brce A. Draper & J. Ross Beerdge, Janar 5, Geometrc Image Manplaton Lectre # Janar 5, Brce A. Draper & J. Ross Beerdge, Janar 5, Image Manplaton: Contet To start wth the obos, an mage s a D arra of pels

More information

Uncertainty as the Overlap of Alternate Conditional Distributions

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

Cokriging Partial Grades - Application to Block Modeling of Copper Deposits

Cokriging Partial Grades - Application to Block Modeling of Copper Deposits Cokrgng Partal Grades - Applcaton to Block Modelng of Copper Deposts Serge Séguret 1, Julo Benscell 2 and Pablo Carrasco 2 Abstract Ths work concerns mneral deposts made of geologcal bodes such as breccas

More information

The Bellman Equation

The Bellman Equation The Bellman Eqaton Reza Shadmehr In ths docment I wll rovde an elanaton of the Bellman eqaton, whch s a method for otmzng a cost fncton and arrvng at a control olcy.. Eamle of a game Sose that or states

More information

MMA and GCMMA two methods for nonlinear optimization

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

CLOSED-FORM CHARACTERIZATION OF THE CHANNEL CAPACITY OF MULTI-BRANCH MAXIMAL RATIO COMBINING OVER CORRELATED NAKAGAMI FADING CHANNELS

CLOSED-FORM CHARACTERIZATION OF THE CHANNEL CAPACITY OF MULTI-BRANCH MAXIMAL RATIO COMBINING OVER CORRELATED NAKAGAMI FADING CHANNELS CLOSED-FORM CHARACTERIZATION OF THE CHANNEL CAPACITY OF MULTI-BRANCH MAXIMAL RATIO COMBINING OVER CORRELATED NAKAGAMI FADING CHANNELS Yawgeng A. Cha and Karl Yng-Ta Hang Department of Commncaton Engneerng,

More information

KULLBACK-LEIBER DIVERGENCE MEASURE IN CORRELATION OF GRAY-SCALE OBJECTS

KULLBACK-LEIBER DIVERGENCE MEASURE IN CORRELATION OF GRAY-SCALE OBJECTS The Second Internatonal Conference on Innovatons n Informaton Technology (IIT 05) KULLBACK-LEIBER DIVERGENCE MEASURE IN CORRELATION OF GRAY-SCALE OBJECTS M. Sohal Khald Natonal Unversty of Scences and

More information

The Geometry of Logit and Probit

The Geometry of Logit and Probit The Geometry of Logt and Probt Ths short note s meant as a supplement to Chapters and 3 of Spatal Models of Parlamentary Votng and the notaton and reference to fgures n the text below s to those two chapters.

More information

A Robust Method for Calculating the Correlation Coefficient

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

Lecture 21: Numerical methods for pricing American type derivatives

Lecture 21: Numerical methods for pricing American type derivatives Lecture 21: Numercal methods for prcng Amercan type dervatves Xaoguang Wang STAT 598W Aprl 10th, 2014 (STAT 598W) Lecture 21 1 / 26 Outlne 1 Fnte Dfference Method Explct Method Penalty Method (STAT 598W)

More information

Complex Numbers Practice 0708 & SP 1. The complex number z is defined by

Complex Numbers Practice 0708 & SP 1. The complex number z is defined by IB Math Hgh Leel: Complex Nmbers Practce 0708 & SP Complex Nmbers Practce 0708 & SP. The complex nmber z s defned by π π π π z = sn sn. 6 6 Ale - Desert Academy (a) Express z n the form re, where r and

More information

Cathy Walker March 5, 2010

Cathy Walker March 5, 2010 Cathy Walker March 5, 010 Part : Problem Set 1. What s the level of measurement for the followng varables? a) SAT scores b) Number of tests or quzzes n statstcal course c) Acres of land devoted to corn

More information

Experimental Errors and Error Analysis

Experimental Errors and Error Analysis Expermental Errors and Error Analss Rajee Prabhakar Unerst of Texas at Astn, Astn, TX Freeman Research Grop Meetng March 10, 004 Topcs coered Tpes of expermental errors Redcng errors Descrbng errors qanttatel

More information

Modeling Mood Variation and Covariation among Adolescent Smokers: Application of a Bivariate Location-Scale Mixed-Effects Model

Modeling Mood Variation and Covariation among Adolescent Smokers: Application of a Bivariate Location-Scale Mixed-Effects Model Modelng Mood Varaton and Covaraton among Adolescent Smokers: Applcaton of a Bvarate Locaton-Scale Mxed-Effects Model Oksana Pgach, PhD, Donald Hedeker, PhD, Robn Mermelsten, PhD Insttte for Health Research

More information

Lecture 10 Support Vector Machines II

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

The Impact of Instrument Transformer Accuracy Class on the Accuracy of Hybrid State Estimation

The Impact of Instrument Transformer Accuracy Class on the Accuracy of Hybrid State Estimation 1 anel Sesson: Addressng Uncertanty, Data alty and Accracy n State Estmaton The mpact of nstrment Transformer Accracy Class on the Accracy of Hybrd State Estmaton Elas Kyrakdes and Markos Aspro KOS Research

More information

Chapter 3 Describing Data Using Numerical Measures

Chapter 3 Describing Data Using Numerical Measures Chapter 3 Student Lecture Notes 3-1 Chapter 3 Descrbng Data Usng Numercal Measures Fall 2006 Fundamentals of Busness Statstcs 1 Chapter Goals To establsh the usefulness of summary measures of data. The

More information

STRATEGIES FOR BUILDING AN AC-DC TRANSFER SCALE

STRATEGIES FOR BUILDING AN AC-DC TRANSFER SCALE Smposo de Metrología al 7 de Octbre de 00 STRATEGIES FOR BUILDING AN AC-DC TRANSFER SCALE Héctor Laz, Fernando Kornblt, Lcas D Lllo Insttto Naconal de Tecnología Indstral (INTI) Avda. Gral Paz, 0 San Martín,

More information

Notes on Frequency Estimation in Data Streams

Notes on Frequency Estimation in Data Streams Notes on Frequency Estmaton n Data Streams In (one of) the data streamng model(s), the data s a sequence of arrvals a 1, a 2,..., a m of the form a j = (, v) where s the dentty of the tem and belongs to

More information

An Expansion of the Derivation of the Spline Smoothing Theory Alan Kaylor Cline

An Expansion of the Derivation of the Spline Smoothing Theory Alan Kaylor Cline A Epaso of the Derato of the Sple Smoothg heory Ala Kaylor Cle he classc paper "Smoothg by Sple Fctos", Nmersche Mathematk 0, 77-83 967) by Chrsta Resch showed that atral cbc sples were the soltos to a

More information

1 i. δ ε. so all the estimators will be biased; in fact, the less correlated w. (i.e., more correlated to ε. is perfectly correlated to x 4 i.

1 i. δ ε. so all the estimators will be biased; in fact, the less correlated w. (i.e., more correlated to ε. is perfectly correlated to x 4 i. Specal Topcs I. Use Instrmental Varable to F Specfcaton Problem (e.g., omtted varable 3 3 Assme we don't have data on If s correlated to,, or s mssng from the regresson Tradtonal Solton - pro varable:

More information

Quality Assessment of Restored Satellite Data. Based on Signal to Noise Ratio

Quality Assessment of Restored Satellite Data. Based on Signal to Noise Ratio Appled Mathematcal Scences, Vol. 0, 06, no. 49, 443-450 IKARI Ltd, www.m-hkar.com http://dx.do.org/0.988/ams.06.6448 ualty Assessment of Restored Satellte Data Based on Sgnal to Nose Rato Asmala Ahmad

More information

BAR & TRUSS FINITE ELEMENT. Direct Stiffness Method

BAR & TRUSS FINITE ELEMENT. Direct Stiffness Method BAR & TRUSS FINITE ELEMENT Drect Stness Method FINITE ELEMENT ANALYSIS AND APPLICATIONS INTRODUCTION TO FINITE ELEMENT METHOD What s the nte element method (FEM)? A technqe or obtanng approxmate soltons

More information

Econ107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4)

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

EMISSION MEASUREMENTS IN DUAL FUELED INTERNAL COMBUSTION ENGINE TESTS

EMISSION MEASUREMENTS IN DUAL FUELED INTERNAL COMBUSTION ENGINE TESTS XVIII IEKO WORLD NGRESS etrology for a Sstanable Development September, 17, 006, Ro de Janero, Brazl EISSION EASUREENTS IN DUAL FUELED INTERNAL BUSTION ENGINE TESTS A.F.Orlando 1, E.Santos, L.G.do Val

More information

CDS M Phil Econometrics

CDS M Phil Econometrics 6//9 OLS Volaton of Assmptons an Plla N Assmpton of Sphercal Dstrbances Var( E( T I n E( T E( E( E( n E( E( E( n E( n E( n E( n I n Therefore the reqrement for sphercal dstrbances s ( Var( E(,..., n homoskedastcty

More information

Parametric fractional imputation for missing data analysis. Jae Kwang Kim Survey Working Group Seminar March 29, 2010

Parametric 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

Navier Stokes Second Exact Transformation

Navier Stokes Second Exact Transformation Unversal Jornal of Appled Mathematcs (3): 136-140, 014 DOI: 1013189/jam01400303 http://wwwhrpborg Naver Stokes Second Eact Transformaton Aleandr Koachok Kev, Ukrane *Correspondng Athor: a-koachok1@andea

More information

CSci 6974 and ECSE 6966 Math. Tech. for Vision, Graphics and Robotics Lecture 21, April 17, 2006 Estimating A Plane Homography

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

Homework 9 for BST 631: Statistical Theory I Problems, 11/02/2006

Homework 9 for BST 631: Statistical Theory I Problems, 11/02/2006 Due Tme: 5:00PM Thursda, on /09/006 Problem (8 ponts) Book problem 45 Let U = X + and V = X, then the jont pmf of ( UV, ) s θ λ θ e λ e f( u, ) = ( = 0, ; u =, +, )! ( u )! Then f( u, ) u θ λ f ( x x+

More information

Inner Product. Euclidean Space. Orthonormal Basis. Orthogonal

Inner Product. Euclidean Space. Orthonormal Basis. Orthogonal Inner Product Defnton 1 () A Eucldean space s a fnte-dmensonal vector space over the reals R, wth an nner product,. Defnton 2 (Inner Product) An nner product, on a real vector space X s a symmetrc, blnear,

More information

The Analysis and the Performance Simulation of the Capacity of Bit-interleaved Coded Modulation System

The Analysis and the Performance Simulation of the Capacity of Bit-interleaved Coded Modulation System Sensors & Transdcers, Vol. 79, Isse 9, September 4, pp. 5-57 Sensors & Transdcers 4 by IFSA Pblshng, S. L. http://www.sensorsportal.com The Analyss and the Performance Smlaton of the Capacty of Bt-nterleaved

More information

Graphical Analysis of a BJT Amplifier

Graphical Analysis of a BJT Amplifier 4/6/2011 A Graphcal Analyss of a BJT Amplfer lecture 1/18 Graphcal Analyss of a BJT Amplfer onsder agan ths smple BJT amplfer: ( t) = + ( t) O O o B + We note that for ths amplfer, the output oltage s

More information

between standard Gibbs free energies of formation for products and reactants, ΔG! R = ν i ΔG f,i, we

between standard Gibbs free energies of formation for products and reactants, ΔG! R = ν i ΔG f,i, we hermodynamcs, Statstcal hermodynamcs, and Knetcs 4 th Edton,. Engel & P. ed Ch. 6 Part Answers to Selected Problems Q6.. Q6.4. If ξ =0. mole at equlbrum, the reacton s not ery far along. hus, there would

More information

Analysis of Variance and Design of Experiments-II

Analysis of Variance and Design of Experiments-II Analyss of Varance and Desgn of Experments-II MODULE - III LECTURE - 8 PARTIALLY BALANCED INCOMPLETE BLOCK DESIGN (PBIBD) Dr Shalah Department of Mathematcs & Statstcs Indan Insttute of Technology Kanpur

More information

Queens College, CUNY, Department of Computer Science Numerical Methods CSCI 361 / 761 Spring 2018 Instructor: Dr. Sateesh Mane.

Queens College, CUNY, Department of Computer Science Numerical Methods CSCI 361 / 761 Spring 2018 Instructor: Dr. Sateesh Mane. Queens College, CUNY, Department of Computer Scence Numercal Methods CSCI 361 / 761 Sprng 2018 Instructor: Dr. Sateesh Mane c Sateesh R. Mane 2018 16 Lecture 16a May 3, 2018 Numercal soluton of systems

More information

LINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity

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

Lecture 2: Prelude to the big shrink

Lecture 2: Prelude to the big shrink Lecture 2: Prelude to the bg shrnk Last tme A slght detour wth vsualzaton tools (hey, t was the frst day... why not start out wth somethng pretty to look at?) Then, we consdered a smple 120a-style regresson

More information

Chapter 2 - The Simple Linear Regression Model S =0. e i is a random error. S β2 β. This is a minimization problem. Solution is a calculus exercise.

Chapter 2 - The Simple Linear Regression Model S =0. e i is a random error. S β2 β. This is a minimization problem. Solution is a calculus exercise. Chapter - The Smple Lnear Regresson Model The lnear regresson equaton s: where y + = β + β e for =,..., y and are observable varables e s a random error How can an estmaton rule be constructed for the

More information

CinChE Problem-Solving Strategy Chapter 4 Development of a Mathematical Model. formulation. procedure

CinChE Problem-Solving Strategy Chapter 4 Development of a Mathematical Model. formulation. procedure nhe roblem-solvng Strategy hapter 4 Transformaton rocess onceptual Model formulaton procedure Mathematcal Model The mathematcal model s an abstracton that represents the engneerng phenomena occurrng n

More information

Traceability and uncertainty for phase measurements

Traceability and uncertainty for phase measurements Traceablty and ncertanty for phase measrements Karel Dražl Czech Metrology Insttte Abstract In recent tme the problems connected wth evalatng and expressng ncertanty n complex S-parameter measrements have

More information

Outline and Reading. Dynamic Programming. Dynamic Programming revealed. Computing Fibonacci. The General Dynamic Programming Technique

Outline and Reading. Dynamic Programming. Dynamic Programming revealed. Computing Fibonacci. The General Dynamic Programming Technique Outlne and Readng Dynamc Programmng The General Technque ( 5.3.2) -1 Knapsac Problem ( 5.3.3) Matrx Chan-Product ( 5.3.1) Dynamc Programmng verson 1.4 1 Dynamc Programmng verson 1.4 2 Dynamc Programmng

More information

Probability Theory (revisited)

Probability Theory (revisited) Probablty Theory (revsted) Summary Probablty v.s. plausblty Random varables Smulaton of Random Experments Challenge The alarm of a shop rang. Soon afterwards, a man was seen runnng n the street, persecuted

More information

A Modeling System to Combine Optimization and Constraint. Programming. INFORMS, November Carnegie Mellon University.

A Modeling System to Combine Optimization and Constraint. Programming. INFORMS, November Carnegie Mellon University. A Modelng Sstem to Combne Optmzaton and Constrant Programmng John Hooker Carnege Mellon Unverst INFORMS November 000 Based on ont work wth Ignaco Grossmann Hak-Jn Km Mara Axlo Osoro Greger Ottosson Erlendr

More information

Introduction to Algorithms

Introduction to Algorithms Introducton to Algorthms 6.046J/8.40J/SMA5503 Lecture 9 Prof. Erk Demane Shortest paths Sngle-source shortest paths Nonnegate edge weghts Djkstra s algorthm: OE + V lg V General Bellman-Ford: OVE DAG One

More information

Kernel Methods and SVMs Extension

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

NUMERICAL DIFFERENTIATION

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

Linear Approximation with Regularization and Moving Least Squares

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

Systems of Equations (SUR, GMM, and 3SLS)

Systems of Equations (SUR, GMM, and 3SLS) Lecture otes on Advanced Econometrcs Takash Yamano Fall Semester 4 Lecture 4: Sstems of Equatons (SUR, MM, and 3SLS) Seemngl Unrelated Regresson (SUR) Model Consder a set of lnear equatons: $ + ɛ $ + ɛ

More information

β0 + β1xi. You are interested in estimating the unknown parameters β

β0 + β1xi. You are interested in estimating the unknown parameters β Ordnary Least Squares (OLS): Smple Lnear Regresson (SLR) Analytcs The SLR Setup Sample Statstcs Ordnary Least Squares (OLS): FOCs and SOCs Back to OLS and Sample Statstcs Predctons (and Resduals) wth OLS

More information

Chapter 15 - Multiple Regression

Chapter 15 - Multiple Regression Chapter - Multple Regresson Chapter - Multple Regresson Multple Regresson Model The equaton that descrbes how the dependent varable y s related to the ndependent varables x, x,... x p and an error term

More information

4.1 The Ideal Diode. Reading Assignment: pp Before we get started with ideal diodes, let s first recall linear device behavior!

4.1 The Ideal Diode. Reading Assignment: pp Before we get started with ideal diodes, let s first recall linear device behavior! 1/25/2012 secton3_1the_ideal_ode 1/2 4.1 The Ideal ode Readng Assgnment: pp.165-172 Before we get started wth deal dodes, let s frst recall lnear dece behaor! HO: LINEAR EVICE BEHAVIOR Now, the deal dode

More information

Feature Selection: Part 1

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

C PLANE ELASTICITY PROBLEM FORMULATIONS

C PLANE ELASTICITY PROBLEM FORMULATIONS C M.. Tamn, CSMLab, UTM Corse Content: A ITRODUCTIO AD OVERVIEW mercal method and Compter-Aded Engneerng; Phscal problems; Mathematcal models; Fnte element method. B REVIEW OF -D FORMULATIOS Elements and

More information

COS 521: Advanced Algorithms Game Theory and Linear Programming

COS 521: Advanced Algorithms Game Theory and Linear Programming COS 521: Advanced Algorthms Game Theory and Lnear Programmng Moses Charkar February 27, 2013 In these notes, we ntroduce some basc concepts n game theory and lnear programmng (LP). We show a connecton

More information

Solution Thermodynamics

Solution Thermodynamics Soluton hermodynamcs usng Wagner Notaton by Stanley. Howard Department of aterals and etallurgcal Engneerng South Dakota School of nes and echnology Rapd Cty, SD 57701 January 7, 001 Soluton hermodynamcs

More information

Transfer Functions. Convenient representation of a linear, dynamic model. A transfer function (TF) relates one input and one output: ( ) system

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

where I = (n x n) diagonal identity matrix with diagonal elements = 1 and off-diagonal elements = 0; and σ 2 e = variance of (Y X).

where I = (n x n) diagonal identity matrix with diagonal elements = 1 and off-diagonal elements = 0; and σ 2 e = variance of (Y X). 11.4.1 Estmaton of Multple Regresson Coeffcents In multple lnear regresson, we essentally solve n equatons for the p unnown parameters. hus n must e equal to or greater than p and n practce n should e

More information

Economics 130. Lecture 4 Simple Linear Regression Continued

Economics 130. Lecture 4 Simple Linear Regression Continued Economcs 130 Lecture 4 Contnued Readngs for Week 4 Text, Chapter and 3. We contnue wth addressng our second ssue + add n how we evaluate these relatonshps: Where do we get data to do ths analyss? How do

More information

Comparison of Regression Lines

Comparison of Regression Lines STATGRAPHICS Rev. 9/13/2013 Comparson of Regresson Lnes Summary... 1 Data Input... 3 Analyss Summary... 4 Plot of Ftted Model... 6 Condtonal Sums of Squares... 6 Analyss Optons... 7 Forecasts... 8 Confdence

More information

x i1 =1 for all i (the constant ).

x i1 =1 for all i (the constant ). Chapter 5 The Multple Regresson Model Consder an economc model where the dependent varable s a functon of K explanatory varables. The economc model has the form: y = f ( x,x,..., ) xk Approxmate ths by

More information

Number of cases Number of factors Number of covariates Number of levels of factor i. Value of the dependent variable for case k

Number of cases Number of factors Number of covariates Number of levels of factor i. Value of the dependent variable for case k ANOVA Model and Matrx Computatons Notaton The followng notaton s used throughout ths chapter unless otherwse stated: N F CN Y Z j w W Number of cases Number of factors Number of covarates Number of levels

More information

1 Derivation of Rate Equations from Single-Cell Conductance (Hodgkin-Huxley-like) Equations

1 Derivation of Rate Equations from Single-Cell Conductance (Hodgkin-Huxley-like) Equations Physcs 171/271 -Davd Klenfeld - Fall 2005 (revsed Wnter 2011) 1 Dervaton of Rate Equatons from Sngle-Cell Conductance (Hodgkn-Huxley-lke) Equatons We consder a network of many neurons, each of whch obeys

More information

1. Inference on Regression Parameters a. Finding Mean, s.d and covariance amongst estimates. 2. Confidence Intervals and Working Hotelling Bands

1. 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 information

CS 3750 Machine Learning Lecture 6. Monte Carlo methods. CS 3750 Advanced Machine Learning. Markov chain Monte Carlo

CS 3750 Machine Learning Lecture 6. Monte Carlo methods. CS 3750 Advanced Machine Learning. Markov chain Monte Carlo CS 3750 Machne Learnng Lectre 6 Monte Carlo methods Mlos Haskrecht mlos@cs.ptt.ed 5329 Sennott Sqare Markov chan Monte Carlo Importance samplng: samples are generated accordng to Q and every sample from

More information

β0 + β1xi and want to estimate the unknown

β0 + β1xi and want to estimate the unknown SLR Models Estmaton Those OLS Estmates Estmators (e ante) v. estmates (e post) The Smple Lnear Regresson (SLR) Condtons -4 An Asde: The Populaton Regresson Functon B and B are Lnear Estmators (condtonal

More information

Optimization Methods for Engineering Design. Logic-Based. John Hooker. Turkish Operational Research Society. Carnegie Mellon University

Optimization Methods for Engineering Design. Logic-Based. John Hooker. Turkish Operational Research Society. Carnegie Mellon University Logc-Based Optmzaton Methods for Engneerng Desgn John Hooker Carnege Mellon Unerst Turksh Operatonal Research Socet Ankara June 1999 Jont work wth: Srnas Bollapragada General Electrc R&D Omar Ghattas Cl

More information

Circuit Variables. Unit: volt (V = J/C)

Circuit Variables. Unit: volt (V = J/C) Crcut Varables Scentfc nestgaton of statc electrcty was done n late 700 s and Coulomb s credted wth most of the dscoeres. He found that electrc charges hae two attrbutes: amount and polarty. There are

More information

EE215 FUNDAMENTALS OF ELECTRICAL ENGINEERING

EE215 FUNDAMENTALS OF ELECTRICAL ENGINEERING EE215 FUNDAMENTALS OF ELECTRICAL ENGINEERING TaChang Chen Unersty of Washngton, Bothell Sprng 2010 EE215 1 WEEK 8 FIRST ORDER CIRCUIT RESPONSE May 21 st, 2010 EE215 2 1 QUESTIONS TO ANSWER Frst order crcuts

More information

Problem Set 1 Issued: Wednesday, February 11, 2015 Due: Monday, February 23, 2015

Problem Set 1 Issued: Wednesday, February 11, 2015 Due: Monday, February 23, 2015 MASSACHUSETTS INSTITUTE OF TECHNOLOGY DEPARTMENT OF MECHANICAL ENGINEERING CAMBRIDGE MASSACHUSETTS 09.9 NUMERICAL FLUID MECHANICS SPRING 05 Problem Set Issed: Wednesday Febrary 05 De: Monday Febrary 05

More information

Estimation of Inefficiency using a Firm-specific Frontier Model

Estimation of Inefficiency using a Firm-specific Frontier Model MPRA Mnch Personal RePEc Archve Estmaton of Ineffcency sng a Frm-specfc Fronter Model Arabnda Das Acharya Praflla Chandra College 13. Aprl 013 Onlne at http://mpra.b.n-menchen.de/46168/ MPRA Paper No.

More information

Y = β 0 + β 1 X 1 + β 2 X β k X k + ε

Y = β 0 + β 1 X 1 + β 2 X β k X k + ε Chapter 3 Secton 3.1 Model Assumptons: Multple Regresson Model Predcton Equaton Std. Devaton of Error Correlaton Matrx Smple Lnear Regresson: 1.) Lnearty.) Constant Varance 3.) Independent Errors 4.) Normalty

More information

Unified Subspace Analysis for Face Recognition

Unified Subspace Analysis for Face Recognition Unfed Subspace Analyss for Face Recognton Xaogang Wang and Xaoou Tang Department of Informaton Engneerng The Chnese Unversty of Hong Kong Shatn, Hong Kong {xgwang, xtang}@e.cuhk.edu.hk Abstract PCA, LDA

More information

The Folded Normal Stochastic Frontier. Gholamreza Hajargasht Department of Economics University of Melbourne, Australia

The Folded Normal Stochastic Frontier. Gholamreza Hajargasht Department of Economics University of Melbourne, Australia The Folded Normal Stochastc Fronter Gholamreza Hajargasht Department of Economcs Unversty of Melborne, Astrala Abstract We ntrodce a stochastc fronter model wth a folded normal neffcency dstrbton. Ths

More information

Time-Varying Systems and Computations Lecture 6

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

4DVAR, according to the name, is a four-dimensional variational method.

4DVAR, 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 information

princeton univ. F 13 cos 521: Advanced Algorithm Design Lecture 3: Large deviations bounds and applications Lecturer: Sanjeev Arora

princeton univ. F 13 cos 521: Advanced Algorithm Design Lecture 3: Large deviations bounds and applications Lecturer: Sanjeev Arora prnceton unv. F 13 cos 521: Advanced Algorthm Desgn Lecture 3: Large devatons bounds and applcatons Lecturer: Sanjeev Arora Scrbe: Today s topc s devaton bounds: what s the probablty that a random varable

More information

3.2 Terminal Characteristics of Junction Diodes (pp )

3.2 Terminal Characteristics of Junction Diodes (pp ) /9/008 secton3_termnal_characterstcs_of_juncton_odes.doc /6 3. Termnal Characterstcs of Juncton odes (pp.47-53) A Juncton ode I.E., A real dode! Smlar to an deal dode, ts crcut symbol s: HO: The Juncton

More information

9 Derivation of Rate Equations from Single-Cell Conductance (Hodgkin-Huxley-like) Equations

9 Derivation of Rate Equations from Single-Cell Conductance (Hodgkin-Huxley-like) Equations Physcs 171/271 - Chapter 9R -Davd Klenfeld - Fall 2005 9 Dervaton of Rate Equatons from Sngle-Cell Conductance (Hodgkn-Huxley-lke) Equatons We consder a network of many neurons, each of whch obeys a set

More information

Some modelling aspects for the Matlab implementation of MMA

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

Report on Image warping

Report on Image warping Report on Image warpng Xuan Ne, Dec. 20, 2004 Ths document summarzed the algorthms of our mage warpng soluton for further study, and there s a detaled descrpton about the mplementaton of these algorthms.

More information

Introduction to Algorithms

Introduction to Algorithms Introducton to Algorthms 6.046J/8.40J LECTURE 6 Shortest Paths III All-pars shortest paths Matrx-multplcaton algorthm Floyd-Warshall algorthm Johnson s algorthm Prof. Charles E. Leserson Shortest paths

More information

Chapter 13: Multiple Regression

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

Lecture 6: Introduction to Linear Regression

Lecture 6: Introduction to Linear Regression Lecture 6: Introducton to Lnear Regresson An Manchakul amancha@jhsph.edu 24 Aprl 27 Lnear regresson: man dea Lnear regresson can be used to study an outcome as a lnear functon of a predctor Example: 6

More information

Lecture 17: Lee-Sidford Barrier

Lecture 17: Lee-Sidford Barrier CSE 599: Interplay between Convex Optmzaton and Geometry Wnter 2018 Lecturer: Yn Tat Lee Lecture 17: Lee-Sdford Barrer Dsclamer: Please tell me any mstake you notced. In ths lecture, we talk about the

More information

Statistics Chapter 4

Statistics Chapter 4 Statstcs Chapter 4 "There are three knds of les: les, damned les, and statstcs." Benjamn Dsrael, 1895 (Brtsh statesman) Gaussan Dstrbuton, 4-1 If a measurement s repeated many tmes a statstcal treatment

More information

Chapter 3. Two-Variable Regression Model: The Problem of Estimation

Chapter 3. Two-Variable Regression Model: The Problem of Estimation Chapter 3. Two-Varable Regresson Model: The Problem of Estmaton Ordnary Least Squares Method (OLS) Recall that, PRF: Y = β 1 + β X + u Thus, snce PRF s not drectly observable, t s estmated by SRF; that

More information

Chapter 7 Generalized and Weighted Least Squares Estimation. In this method, the deviation between the observed and expected values of

Chapter 7 Generalized and Weighted Least Squares Estimation. In this method, the deviation between the observed and expected values of Chapter 7 Generalzed and Weghted Least Squares Estmaton The usual lnear regresson model assumes that all the random error components are dentcally and ndependently dstrbuted wth constant varance. When

More information

G = G 1 + G 2 + G 3 G 2 +G 3 G1 G2 G3. Network (a) Network (b) Network (c) Network (d)

G = G 1 + G 2 + G 3 G 2 +G 3 G1 G2 G3. Network (a) Network (b) Network (c) Network (d) Massachusetts Insttute of Technology Department of Electrcal Engneerng and Computer Scence 6.002 í Electronc Crcuts Homework 2 Soluton Handout F98023 Exercse 21: Determne the conductance of each network

More information

VARIATION OF CONSTANT SUM CONSTRAINT FOR INTEGER MODEL WITH NON UNIFORM VARIABLES

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

Now we relax this assumption and allow that the error variance depends on the independent variables, i.e., heteroskedasticity

Now we relax this assumption and allow that the error variance depends on the independent variables, i.e., heteroskedasticity ECON 48 / WH Hong Heteroskedastcty. Consequences of Heteroskedastcty for OLS Assumpton MLR. 5: Homoskedastcty var ( u x ) = σ Now we relax ths assumpton and allow that the error varance depends on the

More information

U.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017

U.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 information

PHYS 705: Classical Mechanics. Calculus of Variations II

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

e i is a random error

e i is a random error Chapter - The Smple Lnear Regresson Model The lnear regresson equaton s: where + β + β e for,..., and are observable varables e s a random error How can an estmaton rule be constructed for the unknown

More information