Random-effects and conditional fixed-effects overdispersion models
|
|
- Jordan Holt
- 6 years ago
- Views:
Transcription
1 Title xtbreg Fixed-effects, radom-effects, & populatio-averaged egative biomial models Sytax Radom-effects ad coditioal fixed-effects overdispersio models xtbreg depvar varlist weight if exp i rage, re j fe i(varame) irr ocostat oskip exposure(varame) offset(varame) level(#) maximize optios Populatio-averaged model xtbreg depvar varlist weight if exp i rage, pa i(varame) irr robust ocostat exposure(varame) offset(varame) level(#) xtgee optios maximize optios iweights, aweights, ad pweights are allowed for the populatio-averaged model ad iweights are allowed i the radom-effects ad fixed-effects models; see [U] weight. Note that weights must be costat withi paels. xtbreg shares the features of all estimatio commads; see [U] 23 Estimatio ad post-estimatio commads. Sytax for predict Radom-effects ad coditioal fixed-effects overdispersio models predict type ewvarame if exp i rage, xb j stdp ooffset Populatio-averaged model predict type ewvarame if exp i rage, mu j rate j xb j stdp ooffset These statistics are available both i ad out of sample; type predict ::: if e(sample) ::: if wated oly for the estimatio sample. Descriptio xtbreg estimates radom-effects overdispersio models, coditioal fixed-effects overdispersio models, ad populatio-averaged egative biomial models. Here radom-effects ad fixed-effects apply to the distributio of the dispersio parameter, ad ot to the x term i the model. I the radom-effects ad fixed-effects overdispersio models, the dispersio is the same for all elemets i the same group (i.e., elemets with the same value of the i() variable). I the radom-effects model, the dispersio varies radomly from group to group such that the iverse of the dispersio has a Beta(r s) distributio. I the fixed-effects model, the dispersio parameter i a group ca take o ay value, sice a coditioal likelihood is used i which the dispersio parameter drops out of the estimatio. 383
2 384 xtbreg Fixed-effects, radom-effects, & populatio-averaged egative biomial models By default, the populatio-averaged model is a equal-correlatio model; xtbreg assumes corr(exchageable). See [R] xtgee for details o this optio to fit other populatio-averaged models. Optios re requests the radom-effects estimator. re is the default if oe of re, fe, adpa is specified. fe requests the coditioal fixed-effects estimator. pa requests the populatio-averaged estimator. i(varame) specifies the variable ame that cotais the uit to which the observatio belogs. You ca specify the i() optio the first time you estimate or use the iis commad to set i() beforehad. After that, Stata will remember the variable s idetity. See [R] xt. irr reports expoetiated coefficiets e b rather tha coefficiets b. For the egative biomial model, expoetiated coefficiets have the iterpretatio of icidece rate ratios. robust (pa oly) specifies the Huber/White/sadwich estimator of variace is to be used i place of the IRLS variace estimator; see [R] xtgee. This alterative produces valid stadard errors eve if the correlatios withi group are ot as hypothesized by the specified correlatio structure. It does, however, require that the model correctly specifies the mea. As such, the resultig stadard errors are labeled semi-robust istead of robust. Note that although there is o cluster() optio, results are as if there were a cluster() optio ad you specified clusterig o i(). ocostat suppresses the costat term (itercept) i the model. oskip specifies that a full maximum-likelihood model with oly a costat for the regressio equatio be estimated. This costat-oly model is used as the base model to compute a likelihood-ratio 2 statistic for the model test. By default, the model test uses a asymptotically equivalet Wald 2 statistic. For may models, this optio ca sigificatly icrease estimatio time. exposure(varame) ad offset(varame) are differet ways of specifyig the same thig. exposure() specifies a variable that reflects the amout of exposure over which the depvar evets were observed for each observatio; l(varame) with coefficiet costraied to be 1 is etered ito the regressio equatio. offset() specifies a variable that is to be etered directly ito the regressio equatio with coefficiet costraied to be 1; thus exposure is assumed to be e varame. level(#) specifies the cofidece level, i percet, for cofidece itervals. The default is level(95) or as set by set level; see[u] 23.5 Specifyig the width of cofidece itervals. xtgee optios specifies ay other optios allowed by xtgee for family(biom) lik(log); see [R] xtgee. maximize optios cotrol the maximizatio process; see [R] maximize. Usethetrace optio to view parameter covergece. Optios for predict xb calculates the liear predictio. This is the default for the radom-effects ad fixed-effects models. stdp calculates the stadard error of the liear predictio. mu ad rate both calculate the predicted probability of depvar. mu takes ito accout the offset(). rate igores those adjustmets. mu ad rate are equivalet if you did ot specify offset(). mu is the default for the populatio-averaged model.
3 xtbreg Fixed-effects, radom-effects, & populatio-averaged egative biomial models 385 ooffset is relevat oly if you specified offset(varame) for xtbreg. It modifies the calculatios made by predict so that they igore the offset variable; the liear predictio is treated as x it b rather tha x it b + oset it. Remarks xtbreg is a coveiece commad if you wat the populatio-averaged model. Typig. xtbreg :::, ::: pa exposure(time) is equivalet to typig. xtgee :::, ::: family(biom) lik(log) corr(exchageable) exposure(time) Thus, alsosee[r] xtgee for iformatio about xtbreg. By default, or whe re is specified, xtbreg estimates a maximum-likelihood radom-effects overdispersio model. Example You have (fictioal) data o ijury icidets icurred amog 20 airlies i each of 4 years. (Icidets rage from major ijuries to exceedigly mior oes.) The govermet agecy i charge of regulatig airlies has ru a experimetal safety traiig program ad, i each of the years, some airlies have participated ad some have ot. You ow wish to aalyze whether the icidet rate is affected by the program. You choose to estimate usig radom-effects egative biomial regressio because the dispersio might vary across the airlies because of uidetified airlie-specific reasos. Your measure of exposure is passeger miles for each airlie i each year.. xtbreg i_ct iprog, i(airlie) exposure(pmiles) irr olog Radom-effects egative biomial Number of obs = 80 Group variable (i) : airlie Number of groups = 20 Radom effects u_i ~ Beta Obs per group: mi = 4 avg = 4.0 max = 4 Wald chi2(1) = 2.04 Log likelihood = Prob > chi2 = i_ct IRR Std. Err. z P> z [95% Cof. Iterval] iprog pmiles (exposure) /l_r /l_s r s Likelihood ratio test versus pooled: chi2(1) = Prob > chi2 = I the output above, the /l r ad /l s lies refer to l(r) ad l(s), where the iverse of the dispersio is assumed to follow a Beta(r s) radom distributio. The output also icludes a likelihood-ratio test which compares the pael estimator with the pooled estimator (i.e., a egative biomial estimator with costat dispersio).
4 386 xtbreg Fixed-effects, radom-effects, & populatio-averaged egative biomial models You fid that the icidece rate for accidets is ot sigificatly differet for participatio i the program ad that the pael estimator is sigificatly differet from the pooled estimator. We may alteratively estimate a fixed-effects overdispersio model:. xtbreg i_ct iprog, i(airlie) exposure(pmiles) irr fe olog Coditioal fixed-effects egative biomial Number of obs = 80 Group variable (i) : airlie Number of groups = 20 Obs per group: mi = 4 avg = 4.0 max = 4 Wald chi2(1) = 2.11 Log likelihood = Prob > chi2 = i_ct IRR Std. Err. z P> z [95% Cof. Iterval] iprog pmiles (exposure) Example Reruig our previous example i order to fit a robust equal-correlatio populatio-averaged model:. xtbreg i_ct iprog, i(airlie) exposure(pmiles) eform robust pa Iteratio 1: tolerace = Iteratio 2: tolerace = Iteratio 3: tolerace = 2.914e-07 GEE populatio-averaged model Number of obs = 80 Group variable: airlie Number of groups = 20 Lik: log Obs per group: mi = 4 Family: egative biomial(k=1) avg = 4.0 Correlatio: exchageable max = 4 Wald chi2(1) = 1.28 Scale parameter: 1 Prob > chi2 = (stadard errors adjusted for clusterig o airlie) Semi-robust i_ct IRR Std. Err. z P> z [95% Cof. Iterval] iprog pmiles (exposure) We may compare this with a pooled estimator with cluster robust variace estimates:
5 xtbreg Fixed-effects, radom-effects, & populatio-averaged egative biomial models 387. breg i_ct iprog, exposure(pmiles) robust cluster(airlie) irr olog Negative biomial regressio Number of obs = 80 Wald chi2(1) = 0.60 Log likelihood = Prob > chi2 = (stadard errors adjusted for clusterig o airlie) Robust i_ct IRR Std. Err. z P> z [95% Cof. Iterval] iprog pmiles (exposure) /lalpha alpha Saved Results Scalars xtbreg, re saves i e(): e(n) umber of observatios e(ll c) log likelihood, compariso model e(k) umber of estimated parameters e(df m) model degrees of freedom e(k eq) umber of equatios e(chi2) model 2 e(k dv) umber of depedet variables e(p) model sigificace e(n g) umber of groups e(chi2 c) 2 for compariso test e(g mi) smallest group size e(r) value of r i Beta(r,s) e(g avg) average group size e(s) value of s i Beta(r,s) e(g max) largest group size e(ic) umber of iteratios e(ll) log likelihood e(rc) retur code e(ll 0) log likelihood, costat-oly model Macros e(cmd) xtbreg e(opt) type of optimizatio e(cmd2) xt re e(chi2type) Wald or LR; type of model 2 test e(depvar) ame of depedet variable e(chi2 ct) Wald or LR; type of model 2 test e(title) title i estimatio output correspodig to e(chi2 c) e(ivar) variable deotig groups e(offset) offset e(wtype) weight type e(distrib) Beta; the distributio of the e(wexp) weight expressio radom effect e(method) estimatio method e(predict) program used to implemet predict e(user) ame of likelihood-evaluatio program Matrices e(b) coefficiet vector e(v) variace covariace matrix of the estimators Fuctios e(sample) marks estimatio sample
6 388 xtbreg Fixed-effects, radom-effects, & populatio-averaged egative biomial models xtbreg, fe saves i e(): Scalars e(n) umber of observatios e(ll) log likelihood e(k) umber of estimated parameters e(ll 0) log likelihood, costat-oly model e(k eq) umber of equatios e(df m) model degrees of freedom e(k dv) umber of depedet variables e(chi2) model 2 e(n g) umber of groups e(p) model sigificace e(g mi) smallest group size e(ic) umber of iteratios e(g avg) average group size e(rc) retur code e(g max) largest group size Macros e(cmd) xtbreg e(method) requested estimatio method e(cmd2) xt fe e(user) ame of likelihood-evaluator program e(depvar) ame of depedet variable e(opt) type of optimizatio e(title) title i estimatio output e(chi2type) Wald or LR; type of model 2 test e(ivar) variable deotig groups e(offset) offset e(wtype) weight type e(predict) program used to implemet predict e(wexp) weight expressio Matrices e(b) coefficiet vector e(v) variace covariace matrix of the estimators Fuctios e(sample) marks estimatio sample xtbreg, pa saves i e(): Scalars Macros e(n) umber of observatios e(deviace) deviace e(n g) umber of groups e(chi2 dev) 2 test of deviace e(g mi) smallest group size e(dispers) deviace dispersio e(g avg) average group size e(chi2 dis) 2 test of deviace dispersio e(g max) largest group size e(tol) target tolerace e(df m) model degrees of freedom e(dif) achieved tolerace e(chi2) model 2 e(phi) scale parameter e(df pear) degrees of freedom for Pearso 2 e(cmd) xtgee e(ivar) variable deotig groups e(cmd2) xtbreg e(vcetype) covariace estimatio method e(depvar) ame of depedet variable e(chi2type) Wald; type of model 2 test e(family) egative biomial(k=1) e(offset) offset e(lik) log; lik fuctio e(balpha) e(corr) correlatio structure e(predict) program used to implemet predict e(scale) x2, dev, phi, or#; scale parameter Matrices e(b) coefficiet vector e(v) variace covariace matrix of the e(r) estimated workig correlatio matrix estimators Fuctios e(sample) marks estimatio sample
7 xtbreg Fixed-effects, radom-effects, & populatio-averaged egative biomial models 389 Methods ad Formulas xtbreg is implemeted as a ado-file. xtbreg reports the populatio-averaged results obtaied by usig xtgee, family(breg) lik(log) to obtai estimates. See [R] xtgee for details o the methods ad formulas. For the radom-effects ad fixed-effects overdispersio models, we let y it be the cout for the t th observatio i the ith group. We begi with the model y it j it Poisso( it ), where it j i Gamma( it 1= i ) with it = exp(x it + offset it ) ad i is the dispersio parameter. This yields the model Pr(Y it = y it j i ) = ;( it + y it ) ;( it );(y it + 1) i it yit i 1 + i Lookig at withi-group effects oly, this specificatio yields a egative biomial model for the ith group with dispersio (variace divided by the mea) equal to 1 + i ; i.e., costat dispersio withi group. Note that this parameterizatio of the egative biomial model differs from the default parameterizatio of breg, which has dispersio equal to 1 + exp(x + offset); see[r] breg. For a radom-effects overdispersio model, we allow i to vary radomly across groups; amely, we assume that 1=(1 + i ) Beta(r s). The joit probability of the couts for the ith group is Pr(Y i1 = y i1 ::: Y ii = y ii ) = The resultig log likelihood is l L = X w i l ;(r + s) + l ; i=1 ; l ; r + s + Z i Y P = ;(r + s);(r + i P i ;(r);(s);(r + s + k=1 i ik + r + X k=1 k=1 y ik + Pr(Y it = y it j i ) f ( i ) d i Y i P i it);(s + P y it) i it + y it) ik + l ; h s + k=1 ;( it + y it ) ;( it );(y it + 1) y ik ; l ;(r) ; l ;(s) l ;( it + y it ) ; l ;( it ) ; l ;(y it + 1) where it = exp(x it + offset it ) ad w i is the weight for the ith group. For the fixed-effects overdispersio model, we coditio the joit P probability of the couts for each group o the sum of the couts for the group (i.e., the observed i y it). This yields Pr(Y i1 = y i1 ::: Y ii = y ii P i Y it = P i y it) The coditioal log likelihood is l L = X w i (l ; i=1 + h = ;(P i P i it);( P y it + 1) i it + y it) ;( P i it! + l ; y it + 1! Y i l ;( it + y it ) ; l ;( it ) ; l ;(y it + 1) ; l ; ;( it + y it ) ;( it );(y it + 1) i ) i! X it + y it i
8 390 xtbreg Fixed-effects, radom-effects, & populatio-averaged egative biomial models See Hausma et al. (1984) for a more thorough developmet of the radom-effects ad fixed-effects models. Note that Hausma et al. (1984) use a that is the iverse of the we have used here. Refereces Hausma, J., B. H. Hall, ad Z. Griliches Ecoometric models for cout data with a applicatio to the patets R & D relatioship. Ecoometrica 52: Liag, K.-Y. ad S. L. Zeger Logitudial data aalysis usig geeralized liear models. Biometrika 73: Also See Complemetary: Related: Backgroud: [R] licom, [R] predict, [R] test, [R] testl, [R] vce, [R] xtdata, [R] xtdes, [R] xtsum, [R] xttab [R] breg, [R] xtgee, [R] xtpois [U] 16.5 Accessig coefficiets ad stadard errors, [U] 23 Estimatio ad post-estimatio commads, [U] Obtaiig robust variace estimates, [R] xt
Analysis Metrics. Intro to Algorithm Analysis. Slides. 12. Alg Analysis. 12. Alg Analysis
Itro to Algorithm Aalysis Aalysis Metrics Slides. Table of Cotets. Aalysis Metrics 3. Exact Aalysis Rules 4. Simple Summatio 5. Summatio Formulas 6. Order of Magitude 7. Big-O otatio 8. Big-O Theorems
More informationDescriptive Statistics Summary Lists
Chapter 209 Descriptive Statistics Summary Lists Itroductio This procedure is used to summarize cotiuous data. Large volumes of such data may be easily summarized i statistical lists of meas, couts, stadard
More informationBayesian approach to reliability modelling for a probability of failure on demand parameter
Bayesia approach to reliability modellig for a probability of failure o demad parameter BÖRCSÖK J., SCHAEFER S. Departmet of Computer Architecture ad System Programmig Uiversity Kassel, Wilhelmshöher Allee
More informationEM375 STATISTICS AND MEASUREMENT UNCERTAINTY LEAST SQUARES LINEAR REGRESSION ANALYSIS
EM375 STATISTICS AND MEASUREMENT UNCERTAINTY LEAST SQUARES LINEAR REGRESSION ANALYSIS I this uit of the course we ivestigate fittig a straight lie to measured (x, y) data pairs. The equatio we wat to fit
More informationAnalysis of Algorithms
Aalysis of Algorithms Ruig Time of a algorithm Ruig Time Upper Bouds Lower Bouds Examples Mathematical facts Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite
More informationPerformance Plus Software Parameter Definitions
Performace Plus+ Software Parameter Defiitios/ Performace Plus Software Parameter Defiitios Chapma Techical Note-TG-5 paramete.doc ev-0-03 Performace Plus+ Software Parameter Defiitios/2 Backgroud ad Defiitios
More informationPseudocode ( 1.1) Analysis of Algorithms. Primitive Operations. Pseudocode Details. Running Time ( 1.1) Estimating performance
Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Pseudocode ( 1.1) High-level descriptio of a algorithm More structured
More information3D Model Retrieval Method Based on Sample Prediction
20 Iteratioal Coferece o Computer Commuicatio ad Maagemet Proc.of CSIT vol.5 (20) (20) IACSIT Press, Sigapore 3D Model Retrieval Method Based o Sample Predictio Qigche Zhag, Ya Tag* School of Computer
More informationPattern Recognition Systems Lab 1 Least Mean Squares
Patter Recogitio Systems Lab 1 Least Mea Squares 1. Objectives This laboratory work itroduces the OpeCV-based framework used throughout the course. I this assigmet a lie is fitted to a set of poits usig
More information( n+1 2 ) , position=(7+1)/2 =4,(median is observation #4) Median=10lb
Chapter 3 Descriptive Measures Measures of Ceter (Cetral Tedecy) These measures will tell us where is the ceter of our data or where most typical value of a data set lies Mode the value that occurs most
More informationWhat are we going to learn? CSC Data Structures Analysis of Algorithms. Overview. Algorithm, and Inputs
What are we goig to lear? CSC316-003 Data Structures Aalysis of Algorithms Computer Sciece North Carolia State Uiversity Need to say that some algorithms are better tha others Criteria for evaluatio Structure
More informationHow do we evaluate algorithms?
F2 Readig referece: chapter 2 + slides Algorithm complexity Big O ad big Ω To calculate ruig time Aalysis of recursive Algorithms Next time: Litterature: slides mostly The first Algorithm desig methods:
More informationPackage popkorn. R topics documented: February 20, Type Package
Type Pacage Pacage popkor February 20, 2015 Title For iterval estimatio of mea of selected populatios Versio 0.3-0 Date 2014-07-04 Author Vi Gopal, Claudio Fuetes Maitaier Vi Gopal Depeds
More information. Written in factored form it is easy to see that the roots are 2, 2, i,
CMPS A Itroductio to Programmig Programmig Assigmet 4 I this assigmet you will write a java program that determies the real roots of a polyomial that lie withi a specified rage. Recall that the roots (or
More informationENGI 4421 Probability and Statistics Faculty of Engineering and Applied Science Problem Set 1 Descriptive Statistics
ENGI 44 Probability ad Statistics Faculty of Egieerig ad Applied Sciece Problem Set Descriptive Statistics. If, i the set of values {,, 3, 4, 5, 6, 7 } a error causes the value 5 to be replaced by 50,
More informationNumerical Methods Lecture 6 - Curve Fitting Techniques
Numerical Methods Lecture 6 - Curve Fittig Techiques Topics motivatio iterpolatio liear regressio higher order polyomial form expoetial form Curve fittig - motivatio For root fidig, we used a give fuctio
More informationAlgorithm. Counting Sort Analysis of Algorithms
Algorithm Coutig Sort Aalysis of Algorithms Assumptios: records Coutig sort Each record cotais keys ad data All keys are i the rage of 1 to k Space The usorted list is stored i A, the sorted list will
More informationThe Closest Line to a Data Set in the Plane. David Gurney Southeastern Louisiana University Hammond, Louisiana
The Closest Lie to a Data Set i the Plae David Gurey Southeaster Louisiaa Uiversity Hammod, Louisiaa ABSTRACT This paper looks at three differet measures of distace betwee a lie ad a data set i the plae:
More informationFundamentals of Media Processing. Shin'ichi Satoh Kazuya Kodama Hiroshi Mo Duy-Dinh Le
Fudametals of Media Processig Shi'ichi Satoh Kazuya Kodama Hiroshi Mo Duy-Dih Le Today's topics Noparametric Methods Parze Widow k-nearest Neighbor Estimatio Clusterig Techiques k-meas Agglomerative Hierarchical
More informationLecture 1: Introduction and Strassen s Algorithm
5-750: Graduate Algorithms Jauary 7, 08 Lecture : Itroductio ad Strasse s Algorithm Lecturer: Gary Miller Scribe: Robert Parker Itroductio Machie models I this class, we will primarily use the Radom Access
More informationNormal Distributions
Normal Distributios Stacey Hacock Look at these three differet data sets Each histogram is overlaid with a curve : A B C A) Weights (g) of ewly bor lab rat pups B) Mea aual temperatures ( F ) i A Arbor,
More informationLecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming
Lecture Notes 6 Itroductio to algorithm aalysis CSS 501 Data Structures ad Object-Orieted Programmig Readig for this lecture: Carrao, Chapter 10 To be covered i this lecture: Itroductio to algorithm aalysis
More informationRunning Time. Analysis of Algorithms. Experimental Studies. Limitations of Experiments
Ruig Time Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Most algorithms trasform iput objects ito output objects. The
More informationDATA MINING II - 1DL460
DATA MINING II - 1DL460 Sprig 2017 A secod course i data miig http://www.it.uu.se/edu/course/homepage/ifoutv2/vt17/ Kjell Orsbor Uppsala Database Laboratory Departmet of Iformatio Techology, Uppsala Uiversity,
More informationMath Section 2.2 Polynomial Functions
Math 1330 - Sectio. Polyomial Fuctios Our objectives i workig with polyomial fuctios will be, first, to gather iformatio about the graph of the fuctio ad, secod, to use that iformatio to geerate a reasoably
More informationData Structures and Algorithms. Analysis of Algorithms
Data Structures ad Algorithms Aalysis of Algorithms Outlie Ruig time Pseudo-code Big-oh otatio Big-theta otatio Big-omega otatio Asymptotic algorithm aalysis Aalysis of Algorithms Iput Algorithm Output
More informationRunning Time ( 3.1) Analysis of Algorithms. Experimental Studies. Limitations of Experiments
Ruig Time ( 3.1) Aalysis of Algorithms Iput Algorithm Output A algorithm is a step- by- step procedure for solvig a problem i a fiite amout of time. Most algorithms trasform iput objects ito output objects.
More informationAnalysis of Algorithms
Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Ruig Time Most algorithms trasform iput objects ito output objects. The
More informationLearning to Shoot a Goal Lecture 8: Learning Models and Skills
Learig to Shoot a Goal Lecture 8: Learig Models ad Skills How do we acquire skill at shootig goals? CS 344R/393R: Robotics Bejami Kuipers Learig to Shoot a Goal The robot eeds to shoot the ball i the goal.
More informationECE4050 Data Structures and Algorithms. Lecture 6: Searching
ECE4050 Data Structures ad Algorithms Lecture 6: Searchig 1 Search Give: Distict keys k 1, k 2,, k ad collectio L of records of the form (k 1, I 1 ), (k 2, I 2 ),, (k, I ) where I j is the iformatio associated
More informationCapability Analysis (Variable Data)
Capability Aalysis (Variable Data) Revised: 0/0/07 Summary... Data Iput... 3 Capability Plot... 5 Aalysis Summary... 6 Aalysis Optios... 8 Capability Idices... Prefereces... 6 Tests for Normality... 7
More informationML Estimation of the Multivariate t Distribution and the EM Algorithm
Joural of Multivariate Aalysis 63, 9631 (1997) Article No. MV971703 ML Estimatio of the Multivariate t Distributio ad the EM Algorithm Chuahai Liu Bell Laboratories, Lucet Techologies Maximum likelihood
More informationProject 2.5 Improved Euler Implementation
Project 2.5 Improved Euler Implemetatio Figure 2.5.10 i the text lists TI-85 ad BASIC programs implemetig the improved Euler method to approximate the solutio of the iitial value problem dy dx = x+ y,
More informationData diverse software fault tolerance techniques
Data diverse software fault tolerace techiques Complemets desig diversity by compesatig for desig diversity s s limitatios Ivolves obtaiig a related set of poits i the program data space, executig the
More informationSAMPLE VERSUS POPULATION. Population - consists of all possible measurements that can be made on a particular item or procedure.
SAMPLE VERSUS POPULATION Populatio - cosists of all possible measuremets that ca be made o a particular item or procedure. Ofte a populatio has a ifiite umber of data elemets Geerally expese to determie
More informationTitle. Syntax. stata.com. intreg Interval regression. weight. indepvars. intreg depvar 1 depvar 2. , options. Description. options
Title stata.com intreg Interval regression Syntax Menu Description Options Remarks and examples Stored results Methods and formulas References Also see Syntax intreg depvar 1 depvar 2 [ indepvars ] [ if
More informationConsider the following population data for the state of California. Year Population
Assigmets for Bradie Fall 2016 for Chapter 5 Assigmet sheet for Sectios 5.1, 5.3, 5.5, 5.6, 5.7, 5.8 Read Pages 341-349 Exercises for Sectio 5.1 Lagrage Iterpolatio #1, #4, #7, #13, #14 For #1 use MATLAB
More informationFURTHER INTEGRATION TECHNIQUES (TRIG, LOG, EXP FUNCTIONS)
Mathematics Revisio Guides More Trigoometric ad Log Itegrals Page of 7 MK HOME TUITION Mathematics Revisio Guides Level: AS / A Level AQA : C Edexcel: C OCR: C OCR MEI: C FURTHER INTEGRATION TECHNIQUES
More informationIMP: Superposer Integrated Morphometrics Package Superposition Tool
IMP: Superposer Itegrated Morphometrics Package Superpositio Tool Programmig by: David Lieber ( 03) Caisius College 200 Mai St. Buffalo, NY 4208 Cocept by: H. David Sheets, Dept. of Physics, Caisius College
More informationAdministrative UNSUPERVISED LEARNING. Unsupervised learning. Supervised learning 11/25/13. Final project. No office hours today
Admiistrative Fial project No office hours today UNSUPERVISED LEARNING David Kauchak CS 451 Fall 2013 Supervised learig Usupervised learig label label 1 label 3 model/ predictor label 4 label 5 Supervised
More informationChapter 4. Procedural Abstraction and Functions That Return a Value. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 4 Procedural Abstractio ad Fuctios That Retur a Value Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 4.1 Top-Dow Desig 4.2 Predefied Fuctios 4.3 Programmer-Defied Fuctios 4.4
More informationPolynomial Functions and Models. Learning Objectives. Polynomials. P (x) = a n x n + a n 1 x n a 1 x + a 0, a n 0
Polyomial Fuctios ad Models 1 Learig Objectives 1. Idetify polyomial fuctios ad their degree 2. Graph polyomial fuctios usig trasformatios 3. Idetify the real zeros of a polyomial fuctio ad their multiplicity
More informationCMPT 125 Assignment 2 Solutions
CMPT 25 Assigmet 2 Solutios Questio (20 marks total) a) Let s cosider a iteger array of size 0. (0 marks, each part is 2 marks) it a[0]; I. How would you assig a poiter, called pa, to store the address
More informationImproved Random Graph Isomorphism
Improved Radom Graph Isomorphism Tomek Czajka Gopal Paduraga Abstract Caoical labelig of a graph cosists of assigig a uique label to each vertex such that the labels are ivariat uder isomorphism. Such
More informationGeneral Deming Regression for Estimating Systematic Bias and Its Confidence Interval in Method-Comparison Studies
Cliical Chemistry 46:1 100 104 (2000) Laboratory Maagemet Geeral Demig Regressio for Estimatig Systematic Bias ad Its Cofidece Iterval i Method-Compariso Studies Robert F. Marti Backgroud: Various forms
More informationSorting in Linear Time. Data Structures and Algorithms Andrei Bulatov
Sortig i Liear Time Data Structures ad Algorithms Adrei Bulatov Algorithms Sortig i Liear Time 7-2 Compariso Sorts The oly test that all the algorithms we have cosidered so far is compariso The oly iformatio
More informationChapter 10. Defining Classes. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 10 Defiig Classes Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 10.1 Structures 10.2 Classes 10.3 Abstract Data Types 10.4 Itroductio to Iheritace Copyright 2015 Pearso Educatio,
More informationThe Extended Weibull Geometric Family
The Exteded Weibull Geometric Family Giovaa Oliveira Silva 1 Gauss M. Cordeiro 2 Edwi M. M. Ortega 3 1 Itroductio The literature o Weibull models is vast, disjoited, ad scattered across may differet jourals.
More informationCivil Engineering Computation
Civil Egieerig Computatio Fidig Roots of No-Liear Equatios March 14, 1945 World War II The R.A.F. first operatioal use of the Grad Slam bomb, Bielefeld, Germay. Cotets 2 Root basics Excel solver Newto-Raphso
More informationRandom Graphs and Complex Networks T
Radom Graphs ad Complex Networks T-79.7003 Charalampos E. Tsourakakis Aalto Uiversity Lecture 3 7 September 013 Aoucemet Homework 1 is out, due i two weeks from ow. Exercises: Probabilistic iequalities
More informationMarkov Chain Model of HomePlug CSMA MAC for Determining Optimal Fixed Contention Window Size
Markov Chai Model of HomePlug CSMA MAC for Determiig Optimal Fixed Cotetio Widow Size Eva Krimiger * ad Haiph Latchma Dept. of Electrical ad Computer Egieerig, Uiversity of Florida, Gaiesville, FL, USA
More informationChapter 5. Functions for All Subtasks. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 5 Fuctios for All Subtasks Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 5.1 void Fuctios 5.2 Call-By-Referece Parameters 5.3 Usig Procedural Abstractio 5.4 Testig ad Debuggig
More informationBig-O Analysis. Asymptotics
Big-O Aalysis 1 Defiitio: Suppose that f() ad g() are oegative fuctios of. The we say that f() is O(g()) provided that there are costats C > 0 ad N > 0 such that for all > N, f() Cg(). Big-O expresses
More informationOutline and Reading. Analysis of Algorithms. Running Time. Experimental Studies. Limitations of Experiments. Theoretical Analysis
Outlie ad Readig Aalysis of Algorithms Iput Algorithm Output Ruig time ( 3.) Pseudo-code ( 3.2) Coutig primitive operatios ( 3.3-3.) Asymptotic otatio ( 3.6) Asymptotic aalysis ( 3.7) Case study Aalysis
More informationAPPLICATION NOTE PACE1750AE BUILT-IN FUNCTIONS
APPLICATION NOTE PACE175AE BUILT-IN UNCTIONS About This Note This applicatio brief is iteded to explai ad demostrate the use of the special fuctios that are built ito the PACE175AE processor. These powerful
More information6.854J / J Advanced Algorithms Fall 2008
MIT OpeCourseWare http://ocw.mit.edu 6.854J / 18.415J Advaced Algorithms Fall 2008 For iformatio about citig these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 18.415/6.854 Advaced Algorithms
More informationPython Programming: An Introduction to Computer Science
Pytho Programmig: A Itroductio to Computer Sciece Chapter 6 Defiig Fuctios Pytho Programmig, 2/e 1 Objectives To uderstad why programmers divide programs up ito sets of cooperatig fuctios. To be able to
More informationPython Programming: An Introduction to Computer Science
Pytho Programmig: A Itroductio to Computer Sciece Chapter 1 Computers ad Programs 1 Objectives To uderstad the respective roles of hardware ad software i a computig system. To lear what computer scietists
More informationOCR Statistics 1. Working with data. Section 3: Measures of spread
Notes ad Eamples OCR Statistics 1 Workig with data Sectio 3: Measures of spread Just as there are several differet measures of cetral tedec (averages), there are a variet of statistical measures of spread.
More informationCSC 220: Computer Organization Unit 11 Basic Computer Organization and Design
College of Computer ad Iformatio Scieces Departmet of Computer Sciece CSC 220: Computer Orgaizatio Uit 11 Basic Computer Orgaizatio ad Desig 1 For the rest of the semester, we ll focus o computer architecture:
More informationOne advantage that SONAR has over any other music-sequencing product I ve worked
*gajedra* D:/Thomso_Learig_Projects/Garrigus_163132/z_productio/z_3B2_3D_files/Garrigus_163132_ch17.3d, 14/11/08/16:26:39, 16:26, page: 647 17 CAL 101 Oe advatage that SONAR has over ay other music-sequecig
More informationRedundancy Allocation for Series Parallel Systems with Multiple Constraints and Sensitivity Analysis
IOSR Joural of Egieerig Redudacy Allocatio for Series Parallel Systems with Multiple Costraits ad Sesitivity Aalysis S. V. Suresh Babu, D.Maheswar 2, G. Ragaath 3 Y.Viaya Kumar d G.Sakaraiah e (Mechaical
More information9.1. Sequences and Series. Sequences. What you should learn. Why you should learn it. Definition of Sequence
_9.qxd // : AM Page Chapter 9 Sequeces, Series, ad Probability 9. Sequeces ad Series What you should lear Use sequece otatio to write the terms of sequeces. Use factorial otatio. Use summatio otatio to
More informationThe VSS CCD photometry spreadsheet
The VSS CCD photometry spreadsheet Itroductio This Excel spreadsheet has bee developed ad tested by the BAA VSS for aalysig results files produced by the multi-image CCD photometry procedure i AIP4Wi v2.
More informationBig-O Analysis. Asymptotics
Big-O Aalysis 1 Defiitio: Suppose that f() ad g() are oegative fuctios of. The we say that f() is O(g()) provided that there are costats C > 0 ad N > 0 such that for all > N, f() Cg(). Big-O expresses
More informationBAYESIAN WITH FULL CONDITIONAL POSTERIOR DISTRIBUTION APPROACH FOR SOLUTION OF COMPLEX MODELS. Pudji Ismartini
Proceedig of Iteratioal Coferece O Research, Implemetatio Ad Educatio Of Mathematics Ad Scieces 014, Yogyakarta State Uiversity, 18-0 May 014 BAYESIAN WIH FULL CONDIIONAL POSERIOR DISRIBUION APPROACH FOR
More informationCSC165H1 Worksheet: Tutorial 8 Algorithm analysis (SOLUTIONS)
CSC165H1, Witer 018 Learig Objectives By the ed of this worksheet, you will: Aalyse the ruig time of fuctios cotaiig ested loops. 1. Nested loop variatios. Each of the followig fuctios takes as iput a
More information15-859E: Advanced Algorithms CMU, Spring 2015 Lecture #2: Randomized MST and MST Verification January 14, 2015
15-859E: Advaced Algorithms CMU, Sprig 2015 Lecture #2: Radomized MST ad MST Verificatio Jauary 14, 2015 Lecturer: Aupam Gupta Scribe: Yu Zhao 1 Prelimiaries I this lecture we are talkig about two cotets:
More informationENGR Spring Exam 1
ENGR 300 Sprig 03 Exam INSTRUCTIONS: Duratio: 60 miutes Keep your eyes o your ow work! Keep your work covered at all times!. Each studet is resposible for followig directios. Read carefully.. MATLAB ad
More informationOnes Assignment Method for Solving Traveling Salesman Problem
Joural of mathematics ad computer sciece 0 (0), 58-65 Oes Assigmet Method for Solvig Travelig Salesma Problem Hadi Basirzadeh Departmet of Mathematics, Shahid Chamra Uiversity, Ahvaz, Ira Article history:
More informationBaan Tools User Management
Baa Tools User Maagemet Module Procedure UP008A US Documetiformatio Documet Documet code : UP008A US Documet group : User Documetatio Documet title : User Maagemet Applicatio/Package : Baa Tools Editio
More informationUNIT 4 Section 8 Estimating Population Parameters using Confidence Intervals
UNIT 4 Sectio 8 Estimatig Populatio Parameters usig Cofidece Itervals To make ifereces about a populatio that caot be surveyed etirely, sample statistics ca be take from a SRS of the populatio ad used
More informationRecursive Estimation
Recursive Estimatio Raffaello D Adrea Sprig 2 Problem Set: Probability Review Last updated: February 28, 2 Notes: Notatio: Uless otherwise oted, x, y, ad z deote radom variables, f x (x) (or the short
More informationParabolic Path to a Best Best-Fit Line:
Studet Activity : Fidig the Least Squares Regressio Lie By Explorig the Relatioship betwee Slope ad Residuals Objective: How does oe determie a best best-fit lie for a set of data? Eyeballig it may be
More informationA graphical view of big-o notation. c*g(n) f(n) f(n) = O(g(n))
ca see that time required to search/sort grows with size of We How do space/time eeds of program grow with iput size? iput. time: cout umber of operatios as fuctio of iput Executio size operatio Assigmet:
More informationThe isoperimetric problem on the hypercube
The isoperimetric problem o the hypercube Prepared by: Steve Butler November 2, 2005 1 The isoperimetric problem We will cosider the -dimesioal hypercube Q Recall that the hypercube Q is a graph whose
More informationChapter 9. Pointers and Dynamic Arrays. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 9 Poiters ad Dyamic Arrays Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 9.1 Poiters 9.2 Dyamic Arrays Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Slide 9-3
More informationCAEN Tools for Discovery
Applicatio Note AN2086 Sychroizatio of CAEN Digitizers i Multiple Board Acquisitio Systems Viareggio 9 May 2013 Itroductio High speed digitizers fid applicatios i several fields ragig from the idustry
More information1 Graph Sparsfication
CME 305: Discrete Mathematics ad Algorithms 1 Graph Sparsficatio I this sectio we discuss the approximatio of a graph G(V, E) by a sparse graph H(V, F ) o the same vertex set. I particular, we cosider
More informationMATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fitting)
MATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fittig) I this chapter, we will eamie some methods of aalysis ad data processig; data obtaied as a result of a give
More informationCS200: Hash Tables. Prichard Ch CS200 - Hash Tables 1
CS200: Hash Tables Prichard Ch. 13.2 CS200 - Hash Tables 1 Table Implemetatios: average cases Search Add Remove Sorted array-based Usorted array-based Balaced Search Trees O(log ) O() O() O() O(1) O()
More informationBezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only
Edited: Yeh-Liag Hsu (998--; recommeded: Yeh-Liag Hsu (--9; last updated: Yeh-Liag Hsu (9--7. Note: This is the course material for ME55 Geometric modelig ad computer graphics, Yua Ze Uiversity. art of
More informationEffect of control points distribution on the orthorectification accuracy of an Ikonos II image through rational polynomial functions
Effect of cotrol poits distributio o the orthorectificatio accuracy of a Ikoos II image through ratioal polyomial fuctios Marcela do Valle Machado 1, Mauro Homem Atues 1 ad Paula Debiasi 1 1 Federal Rural
More informationIntroduction to GAMIT/GLOBK Applications of GLOBK. Lecture 11 OVERVIEW
Itroductio to GAMIT/GLOBK Applicatios of GLOBK Lecture 11 GAMIT/GLOBK Lec11 1 OVERVIEW o I this lecture we cover: o Basic types of aalyses with globk l Velocity ad repeatability rus o GLOBK acillary programs
More informationCopyright 2016 Ramez Elmasri and Shamkant B. Navathe
Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe CHAPTER 18 Strategies for Query Processig Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Itroductio DBMS techiques to process a query Scaer idetifies
More informationAlgorithms Chapter 3 Growth of Functions
Algorithms Chapter 3 Growth of Fuctios Istructor: Chig Chi Li 林清池助理教授 chigchi.li@gmail.com Departmet of Computer Sciece ad Egieerig Natioal Taiwa Ocea Uiversity Outlie Asymptotic otatio Stadard otatios
More informationLecture 5. Counting Sort / Radix Sort
Lecture 5. Coutig Sort / Radix Sort T. H. Corme, C. E. Leiserso ad R. L. Rivest Itroductio to Algorithms, 3rd Editio, MIT Press, 2009 Sugkyukwa Uiversity Hyuseug Choo choo@skku.edu Copyright 2000-2018
More informationStructuring Redundancy for Fault Tolerance. CSE 598D: Fault Tolerant Software
Structurig Redudacy for Fault Tolerace CSE 598D: Fault Tolerat Software What do we wat to achieve? Versios Damage Assessmet Versio 1 Error Detectio Iputs Versio 2 Voter Outputs State Restoratio Cotiued
More informationON THE QUALITY OF AUTOMATIC RELATIVE ORIENTATION PROCEDURES
ON THE QUALITY OF AUTOMATIC RELATIVE ORIENTATION PROCEDURES Thomas Läbe, Timo Dickscheid ad Wolfgag Förster Istitute of Geodesy ad Geoiformatio, Departmet of Photogrammetry, Uiversity of Bo laebe@ipb.ui-bo.de,
More informationOptimal Mapped Mesh on the Circle
Koferece ANSYS 009 Optimal Mapped Mesh o the Circle doc. Ig. Jaroslav Štigler, Ph.D. Bro Uiversity of Techology, aculty of Mechaical gieerig, ergy Istitut, Abstract: This paper brigs out some ideas ad
More informationCreating Exact Bezier Representations of CST Shapes. David D. Marshall. California Polytechnic State University, San Luis Obispo, CA , USA
Creatig Exact Bezier Represetatios of CST Shapes David D. Marshall Califoria Polytechic State Uiversity, Sa Luis Obispo, CA 93407-035, USA The paper presets a method of expressig CST shapes pioeered by
More informationLU Decomposition Method
SOLUTION OF SIMULTANEOUS LINEAR EQUATIONS LU Decompositio Method Jamie Traha, Autar Kaw, Kevi Marti Uiversity of South Florida Uited States of America kaw@eg.usf.edu http://umericalmethods.eg.usf.edu Itroductio
More informationProbabilistic Fuzzy Time Series Method Based on Artificial Neural Network
America Joural of Itelliget Systems 206, 6(2): 42-47 DOI: 0.5923/j.ajis.2060602.02 Probabilistic Fuzzy Time Series Method Based o Artificial Neural Network Erol Egrioglu,*, Ere Bas, Cagdas Haka Aladag
More informationA SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON
A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON Roberto Lopez ad Eugeio Oñate Iteratioal Ceter for Numerical Methods i Egieerig (CIMNE) Edificio C1, Gra Capitá s/, 08034 Barceloa, Spai ABSTRACT I this work
More informationLecture 6. Lecturer: Ronitt Rubinfeld Scribes: Chen Ziv, Eliav Buchnik, Ophir Arie, Jonathan Gradstein
068.670 Subliear Time Algorithms November, 0 Lecture 6 Lecturer: Roitt Rubifeld Scribes: Che Ziv, Eliav Buchik, Ophir Arie, Joatha Gradstei Lesso overview. Usig the oracle reductio framework for approximatig
More informationChapter 11. Friends, Overloaded Operators, and Arrays in Classes. Copyright 2014 Pearson Addison-Wesley. All rights reserved.
Chapter 11 Frieds, Overloaded Operators, ad Arrays i Classes Copyright 2014 Pearso Addiso-Wesley. All rights reserved. Overview 11.1 Fried Fuctios 11.2 Overloadig Operators 11.3 Arrays ad Classes 11.4
More informationENGR 132. Fall Exam 1
ENGR 3 Fall 03 Exam INSTRUCTIONS: Duratio: 60 miutes Keep your eyes o your ow work. Keep your work covered at all times.. Each studet is resposible for followig directios. Read carefully.. MATLAB ad Excel
More information1.2 Binomial Coefficients and Subsets
1.2. BINOMIAL COEFFICIENTS AND SUBSETS 13 1.2 Biomial Coefficiets ad Subsets 1.2-1 The loop below is part of a program to determie the umber of triagles formed by poits i the plae. for i =1 to for j =
More informationMOTIF XF Extension Owner s Manual
MOTIF XF Extesio Ower s Maual Table of Cotets About MOTIF XF Extesio...2 What Extesio ca do...2 Auto settig of Audio Driver... 2 Auto settigs of Remote Device... 2 Project templates with Iput/ Output Bus
More informationAnalysis of Server Resource Consumption of Meteorological Satellite Application System Based on Contour Curve
Advaces i Computer, Sigals ad Systems (2018) 2: 19-25 Clausius Scietific Press, Caada Aalysis of Server Resource Cosumptio of Meteorological Satellite Applicatio System Based o Cotour Curve Xiagag Zhao
More information