Simulating Correlated Multivariate Pseudorandom Numbers
|
|
- Georgina Knight
- 5 years ago
- Views:
Transcription
1 Simulating Correlated ultivariate Pseudorandom Numbers Ali A. Al-Subaihi Institute of Public Administration Riadh 4, Saudi Arabia
2 Abstract A modification of the Kaiser and Dichman (96) procedure of generating multivariate random numbers with specified intercorrelation is proposed. The procedure wors with positive and non-positive definite population correlation matri. A SAS module is also provided to run the procedure. Ke words: Random Numbers, ultivariate Random Numbers, Random Number Generation.
3 . INTRODUCTION A fundamental tas of quantitative researches is to mae probabilit-based inferences about population characteristics, θ, based on an estimator, θ ), using a "representative" sample drawn from that population. However, the statistics of classical parametric inference inform us about how the population wors to the etent necessar mathematical assumptions are met, and violation of an of the mathematical assumptions ma harm the accurac of the research conclusion(s). In regression, for instance, when the slope of the independent variable () is statisticall significant and BUE (best linear unbiased estimator), a researcher can clearl epect what happens to the dependent variable () when changes one unit provided that the usual mathematical assumptions of the regression (independence, homogeneit of variance, and normalit) are met. If an of these assumptions is violated, the ris of inference from the ordinar lease squares (OS) is seriousl off the mar (oon, 997). In real world, however, there are numerous situations where data violates at least one of the mathematical assumptions of the inferential statistic that is going to be used in analsis. Therefore, statisticians as well as researchers are interested to now how the mathematical assumptoin(s) violation affects the inferntial statistics power (the probabilit of correctl rejecting a false null hpothesis) and/or the Tpe I error rate (the probabilit of incorrectl rejecting a true null hpothesis). Fortunatel, meaningful investigation of man problems in statistics can be done through onte Carlo simulations (Broos et al., 999).. Statement of the Problem onte Carlo simulation is a computer-based technique that enables one to generate artificiall random samples from populations with nown characteristics in order to control some variables and manipulate others to investigate the effect of the manipulation on the robustness of a statistic. For more details about onte Carlo simulation, the reader is referred to Broos et al., 999 and oone,
4 onte Carlo simulations that require correlated data from normal and nonnormal populations are frequentl used to investigate the small sample properties of competing statistics, or the comparison of estimation techniques (Headric & Sawilows, 999). And, the widel used technique to generate correlated data from normal population (which is the paper's concentration) is the Kaiser and Dichman (96) procedure. The procedure uses a component analsis (e.g., principal components, square-root components) of a positive definite population correlation matri (R) for generating multivariate random numbers with specified intercorrelations. The procedure depends mainl on the decomposition of R and wors onl with a positive definite R. This limitation is an obstacle often faces users because not all real world situations have a positive definite R. Thus, a modification for this procedure (or development of a new one) is highl desired.. Purpose of the Stud The stud proposes a modification of the Kaiser and Dichman procedure in order to decrease its limitation effect. That is, the paper presents techniques that enable the Kaiser and Dichman procedure users to generate multivariate correlated pseudorandom numbers using a nonpositive definite R. 4
5 . REVIEW OF THE ITERATURE The importance of the problem of generating a correlated pseudorandom numbers comes up from the considerable attention that has been given to the onte Carlo studies; onte Carlo studies have been of interest to applied statisticians and continue to receive large focus in the recent statistical literature. The first to introduce a method for generating correlated pseudorandom numbers was Hoffman in 94. He presented a simple technique that is used onl to simulate two correlated variables. Then, Kaiser and Dicman (96) etended the Hoffman s procedure for m, where m is the number of the correlated variables. The proposed a method for generating sample and population score matrices and sample correlation matrices from a given R. The procedure utilizes component analsis for generating multivariate random numbers. The disadvantage of the Kaiser and Dicman procedure is that it depends on matri factorization that requires positive definiteness, and this condition does not frequentl hold. Fleishman (978) noted that real-world distributions of variables are tpicall characterized b their first four moments (i.e., mean, variance, sew, and urtosis) and presented a procedure for generating normal as well as nonnormal random numbers with these moments specified. The procedure accomplishes this b simpl taing a linear combination of a random number drawn from a normal distribution and its square and cube. Tadiamalla (980) criticized the Fleishman's procedure for producing distributions of variables for which the eact distribution was nown and thus laced probabilit-densit and cumulative-distribution functions and which, furthermore, could not produce distributions with all possible combinations of sew and urtosis. Tadiamalla (980) proposed five alternative procedures for generating nonnormal random numbers and compared them all with Fleishman power method for speed of 5
6 eecution, simplicit of implementation, and generalit of their abilit to generate nonnormal distributions. Vale and aurelli (983) etended the Fleishman (978) and Kaiser and Dicman (96) procedures to the multivariate case. The proposed a method for generating multivariate normal and nonnormal distributions with specified intercorrelations and marginal means, variances, sews, and urtoses. However, lie Kaiser and Dicman (96) procedure, the procedure fails to wor when R is not positive definite. Not onl that, but also the procedure fails to generate desired intercorrelations when the conditional distributions possess etreme sew and/or heav tails, even for sample sizes as large as N = 00 (Headric and Sawilows, 999). Headric and Sawilows (999) proposed a method that combines a generalization of Theorem and from Knapp and Swoer (967) with the Fleishman (978) procedure. The procedure generates multivariate nonnormal distributions with average values of intercorrelations closer to the population parameters for sewed and/or heav tailed distributions and for small sample sizes. Although the procedure eliminates the necessit of conducting a factorization procedure on R that underlies the random deviate, et it still requires the positive definiteness of R. Briefl, all procedures that can be used to generate multivariate pseudorandom numbers require either directl or indirectl positive definite R and do not wor without it, but the Fleishman s (978). This stud will present a modified technique that minimizes the reliance on positive definiteness condition for R. 6
7 3. DESCRIPTION OF THE PROCEDURES 3- Kaiser and Dichman procedure The Kaiser and Dichman (96) procedure is generall applied to generate multivariate normal random numbers, and uses a matri decomposition procedure. A Choles factorization (or an factorization, for that matter) is performed on R that is to underlie the random numbers. To generate a multivariate random number, one random number is generated for each component, and each random variable is defined as the sum of the products of the variable s component loadings and the random number corresponding to each of the components. When the random numbers input are normal, the resulting random numbers are multivariate normal with population intercorrelations equal to those of the matri originall decomposed. 3- The odified Procedure The modified procedure is also used to generate multivariate normal pseudorandom numbers utilizing R. However, unlie other procedures, it wors with a positive as well as a nonpositive definite R. n m n q n To generate a correlated multivariate data matri D = [ Y X ] with specific R, we rewrite R as a bloc matri such as A R = B B C q q q where A and C are the correlation matrices of Y and X, respectivel, and the B is the correlation matri between Y and X. The division is assumed to occur intentionall to ensure q q positive definiteness of both A and C. This is a necessar condition (i.e., the method dose not wor without it). Net, one of the following techniques ma be applied. 7
8 3-- When A q q and q = This technique is applied to generate multivariate pseudorandom numbers when R can be partitioned into three matrices: A, B, and C, where is the number of 's and > such as R = B B = C O O O The technique is performed as follows: A total of correlation matrices that contain the correlation between and each individuall are created such as B i = i i i =,,,. Then, a multivariate normal data matri ( X n ) is generated through the equation X =µ + XU ˆ where X is the multivariate normal data matri, µ is the vector containing the variable means, Xˆ contains vectors of independent and standard normal variates, U is the Choles upper triangular matri of C. The factorization C = UU T is nown as the Choles factorization. A data vector ( n ) of standard normal variates is generated and concatenated horizontall with each column of the matri X individuall such as T i =[ X i ] i =,,, ). This will gives us a total of matrices each of size (n ). A total of vectors Z i of size (n ) are generated independentl through the equation Z i = µ + T i U ic i =,,, 8
9 where U ic is the nd column of the Choles upper triangular matri of B i which was created in the beginning. The vector is then concatenated horizontall with Z i i =,,, to create data matri of size (n +) such as D n + = [ Z Z Z ]. The resulting data matri has a correlation matri that most liel varies from the given population matri (R) and the change taes place mainl in C. Thus, to get data matri that has a correlation matri close to (i.e. with average intercorrelation among the s around) the desired R, we manipulate the actual correlation value among the s, and repeat the process. The average intercorrelation among the s is assessed using the measure proposed b Kaiser (968) λ γ = O (3.) where λ is the largest eigenvalue of the correlation matri, and O is the number of variables (which is when measuring the average intercorrelation among the s). The larger the value of γ, the greater the correlation; if γ = 0, there is no correlation. γ = when the correlations among the variables in the set are quite high. Accordingl, one should epect that γ taes values near the values of. Simulation Eample Suppose a data matri of size (0 5) with specific intercorrelations need to be generated, and suppose 0.5 R =
10 The Kaiser and Dicman procedure cannot be used here to generate the required data because the provided R is not positive definite. Thus, the new procedure is going to be implemented instead (the SAS module in the Appendi A can be utilized to simulate the data using the modified procedure). Table shows the correlation matri (R i ) used in the procedure and the correlation matri of the simulated data (Re i ) at attempt i. At the second attempt (when the correlation among the s was replaced b 0.84 in the original R), we had data with correlation matri (Re ) that is closer to the original R (which equals R ) than those of the first (Re ) and the third (Re 3 ) attempts. Notice that Re i in the Table are full ran (i.e., Ran(Re i ) = 5), and usuall compared with the original R. R, R 3, etc. are onl used in the method to simulate the needed data. 0
11 TABE The Theoretical and Empirical Correlations Values The Correlation matri used The Correlation matri gotten R E Re E γ = R Re γ = R Re γ = Note: R i is the correlation matri used to simulate the required data; Re i is the average correlation matri of the data simulated 000 times; γ is the Kaiser s Gamma. The real and cpu times needed for 000 replications = 0.0 and 0.07 seconds, respectivel when a hp with.70ghz processor and 56 KB RA is used. The standard error matri of Re is as follows:
12 Re When A q q and q This technique is applied when R can be partitioned into three matrices:, B, and, where q > and > are numbers of the 's and the 's, respectivel, such as q q A q C = = C B B A q q q q q q O O O O O O R In this case, the technique is performed in this wa: A total of (q ) correlation matrices that contain the correlation between each and each are created such as i =,,, q and j =,,,. Then a multivariate normal data matri ( ) is generated through the equation = i j j i ij B n X XU X ˆ + =µ where X is the multivariate normal data matri, µ is the vector containing the variable means, contains vectors of independent and standard normal variates, U is the Choles upper triangular matri of C. Xˆ
13 Similarl, a multivariate normal data matri ( Y Choles upper triangular matri of q q A n q ) is generated using the. Net, each column of the matri Y is concatenate horizontall with each column of the matri X individuall (i.e., T ij =[ Y i X j ] i =,,, q and j =,,, ), which gives a total of (q ) matrices each of size (n ). A total of (q ) vectors Z ij of size (n ) are generated through the equation Z ij = µ + T ij U ijc i =,,, q and j =,,, where U ijc is the nd column of the Choles upper triangular of the matri B ij which was created at first. Afterward, the vectors Z j j =,,, are concatenate horizontall to ~ n create data matri of size (n ) for each Y i individuall such as X = [ Z Z... Z ] i i i i. The matrices X ~ n j i =,,, q are then summed together to create data matri ( q i= ~ X n i ), and then the matri Y is concatenate horizontall with the matri q ~ n Xi ~ i= n q+ X = to create the required data matri ( D ). q Similar to the first case, the resulting data matri ( D n q+ ) has a correlation matri that most liel varies from the population matri and the change, once again, taes place mainl in C. Thus, to get data matri that has a correlation matri close to (i.e. with average intercorrelation among the s around) the desired population correlation matri, we manipulate the actual correlation value among the s, and repeat the process. Simulation Eample Suppose a data matri of size (0 6) with specific intercorrelation need to be generated and suppose 3
14 R = Again, the Kaiser and Dicman procedure does not wor in this situation because the provided R is not positive definite. Consequentl, the modified procedure is going to be implemented as an alternative (the SAS module in Appendi A also can be utilized to simulate the data using the modified procedure). Table shows the correlation matri (R i ) used in the procedure and the correlation matri of the simulated data (Re i ) at attempt i. At the third attempt (when the correlation among the s was replaced b 0.84 in the original population correlation matri), we had data with correlation matri (Re 3 ) that is closer to the original population correlation matri (R ) than those of the first (Re ) and the second (Re ) attempts. 4
15 TABE The Theoretical and Empirical Correlations Values The Correlation matri used The Correlation matri gotten R Re γ = R Re γ = R Re γ = Note: R i is the correlation matri used to simulate the required data; Re i is the average correlation matri of the data simulated 000 times; γ is the Kaiser s Gamma; the real and cpu times needed for 000 replications = 0.57 and 0.0 seconds, respectivel. The real and cpu times needed for 000 replications = 0.57 and 0.0 seconds, respectivel when a hp with.70ghz processor and 56 KB RA is used. The standard error matri of Re is as follows: 5
16 Se =
17 4. CONCUSION The paper has suggested a modification to the Kaiser and Dicman (96) procedure of generating multivariate normal pseudorandom numbers. As demonstrated in the numerical eamples, the procedure can produce random numbers with intercorrelation near the population correlation matri when other procedures do not wor at all. Although there are few situations (especiall when A or C are not positive definite) where the procedure does not wor, still it might be used to generate numbers close to the preferred intercorrelations b manipulating the correlations among the s or the s beside the correlations between the s and the s. 7
18 proc iml; APPENDIX (A) OPTIONS ls=00 ps=60 nodate nonumber; /********* The Parameters **************/ NS=0; /* No. of subjects */ /* The population correlation matri is entered as YY YX, XY XX */ PopCor={ , , , , ,..... }; %et NY=3; /* No. of the 's */ %et NX=3; /* No. of the 's */ %et NPC=9; /* No. of correlations = NY*NX */ /***************************************************/ NV=&NY+&NX; /* No. of Variables */ CorY= PopCor[:&NY,:&NY]; /* Corr. among the 's */ CorX= PopCor[&NY+:NV,&NY+:NV]; /* Corr. among the 's */ CorYX= PopCor[&NY+:NV,:&NY]; /* Corr. betw. the 's & the 's */ do i= to ncol(coryx); /* Corr. betw. the 's & the 's as a column*/ CorYXs=CorYXs//CorYX[,i]; end; %macro loop(npc); %Do i= %to &NPC; /* Bi's Correlation matrices */ Cr&i=I(); Cr&i[,]=CorYXs[&i,]; Cr&i[,]=CorYXs[&i,]; %end; %mend loop; %loop (&npc); X=Rannor(Repeat(0,NS,&NX))*root(CorX); /* The X data matri */ =Rannor(Repeat(0,NS,&NY))*root(CorY); /* The Y data matri */ DaXs=0*j(ns,&NX); %macro loop (NY); %et =0; %do j= %to &NY; %do i= %to &NX; %et c=%eval(&i+&k); %put c=&c; dat=(y[,&j] X[,&i])*(root(CrYX&c)); dat=dat dat[,]; %end; %et =&c; daxs=daxs+dat; free dat; %end; 8
19 %mend loop; %loop (&NY ); daxs=daxs*(/&ny); data=y daxs; /* The final data matri */ eg=eigval(corr(daxs)); CXs=(eg[<>,]-)/(&NX-); /* The average Correlations among all 's */ eg=eigval(corr(y)); CYs=(eg[<>,]-)/(&NY-); /* The average Correlations among all 's */ Call=corr(data); /* Correlations among all data */ ca=call[:&ny,(&ny+):(&ny+&nx)]; print 'The Correlations between Xs and Ys',ca, 'The average Correlations among all Xs = ' CXs, 'The average Correlations among all Xs = 'CYs, 'The total correlation matri of the data', call; quit; 9
20 REFERENCES [] Broos, G. P.,& Robe, R. R. (999), "onte Carlo Simulation for Perusal and Practice", Paper presented at the meeting of the American Educational Research Association, otereal, Quebec, Canada. [] Fleishman, A. (978), "A ethod for Simulating Non-Normal Distributions", Pschomeria, 43 (4), [3] Headric, T. C., & Sawilows, S. S. (999), Simulating Correlated ultivariate Nonnormal Distributions Etending the Fleishman Power ethod, Pschomeria, 64 (), [4] Hoffman, P. J. (94), "Generating Variables with Arbitrar Parameters" Pschomeria, 4, [5] Kaiser, H. F., & Dicman, K. (96), "Sample and Population Score atrices and Sample Correlation atrices From an Arbitrar Population Correlation atri", Pschomeria, 7 (), [6] oon, C. Z. (997), "onte Carlo Simulation", Sage Publications, Thousand Oas, CA. [7] Tadiamalla, P. R. (980), "On Simulating Non-Normal Distributions", Pschomeria, 45 (), [8] Vale, C. D., & aurelli, V. A. (983), "Simulating ultivariate Nonnormal Distributions", Pschomeria, 48 (3), [9] Knapp, T.R., & Swoer, V. H. (967), "Some Empirical Results Concerning the Power of Bartlett's Test of the Significance of a Correlation atri", American Educational Research Journal, 4 (),
Simulating Multivariate Normal Data
Simulating Multivariate Normal Data You have a population correlation matrix and wish to simulate a set of data randomly sampled from a population with that structure. I shall present here code and examples
More informationDiscussion: Clustering Random Curves Under Spatial Dependence
Discussion: Clustering Random Curves Under Spatial Dependence Gareth M. James, Wenguang Sun and Xinghao Qiao Abstract We discuss the advantages and disadvantages of a functional approach to clustering
More informationA Novel Location Method for Multi-Target Based on the Maximum Likelihood Estimation
06 International Smposium on Advances in lectrical, lectronics and Computer ngineering (ISAC 06) A ovel Location Method for Multi-Target Based on the Maximum Lielihood stimation iantong Ma a, Jingqing
More informationModeling and Simulation Exam
Modeling and Simulation am Facult of Computers & Information Department: Computer Science Grade: Fourth Course code: CSC Total Mark: 75 Date: Time: hours Answer the following questions: - a Define the
More informationNote Set 4: Finite Mixture Models and the EM Algorithm
Note Set 4: Finite Mixture Models and the EM Algorithm Padhraic Smyth, Department of Computer Science University of California, Irvine Finite Mixture Models A finite mixture model with K components, for
More informationThermo vision system with embedded digital signal processor for real time objects detection
Thermo vision sstem with embedded digital signal processor for real time objects detection Snejana Pleshova, Aleander Beiarsi, Department of Telecommunications Technical Universit Kliment Ohridsi, 8 Sofia
More informationVision-based Real-time Road Detection in Urban Traffic
Vision-based Real-time Road Detection in Urban Traffic Jiane Lu *, Ming Yang, Hong Wang, Bo Zhang State Ke Laborator of Intelligent Technolog and Sstems, Tsinghua Universit, CHINA ABSTRACT Road detection
More informationTransformations of Functions. 1. Shifting, reflecting, and stretching graphs Symmetry of functions and equations
Chapter Transformations of Functions TOPICS.5.. Shifting, reflecting, and stretching graphs Smmetr of functions and equations TOPIC Horizontal Shifting/ Translation Horizontal Shifting/ Translation Shifting,
More informationy = f(x) x (x, f(x)) f(x) g(x) = f(x) + 2 (x, g(x)) 0 (0, 1) 1 3 (0, 3) 2 (2, 3) 3 5 (2, 5) 4 (4, 3) 3 5 (4, 5) 5 (5, 5) 5 7 (5, 7)
0 Relations and Functions.7 Transformations In this section, we stud how the graphs of functions change, or transform, when certain specialized modifications are made to their formulas. The transformations
More informationContrast Prediction for Fractal Image Compression
he 4th Worshop on Combinatorial Mathematics and Computation heor Contrast Prediction for Fractal Image Compression Shou-Cheng Hsiung and J. H. Jeng Department of Information Engineering I-Shou Universit,
More informationSECTION 3-4 Rational Functions
20 3 Polnomial and Rational Functions 0. Shipping. A shipping bo is reinforced with steel bands in all three directions (see the figure). A total of 20. feet of steel tape is to be used, with 6 inches
More informationA Comparison of Compressed Sensing and Sparse Recovery Algorithms Applied to Simulation Data
STATISTICS, OPTIMIZATION AND INFORMATION COMPUTING Stat., Optim. Inf. Comput., Vol., September 6, pp 9 3. Published online in International Academic Press (www.iapress.org) A Comparison of Compressed Sensing
More informationLecture 4: Viewing. Topics:
Lecture 4: Viewing Topics: 1. Classical viewing 2. Positioning the camera 3. Perspective and orthogonal projections 4. Perspective and orthogonal projections in OpenGL 5. Perspective and orthogonal projection
More informationScale Invariant Feature Transform (SIFT) CS 763 Ajit Rajwade
Scale Invariant Feature Transform (SIFT) CS 763 Ajit Rajwade What is SIFT? It is a technique for detecting salient stable feature points in an image. For ever such point it also provides a set of features
More informationCS 157: Assignment 6
CS 7: Assignment Douglas R. Lanman 8 Ma Problem : Evaluating Conve Polgons This write-up presents several simple algorithms for determining whether a given set of twodimensional points defines a conve
More informationApproaches to Simulate the Operation of the Bending Machine
Approaches to Simulate the Operation of the Bending Machine Ornwadee Ratanapinunchai Chanunchida Theerasilp Teerut Suksawai Project Advisors: Dr. Krit Chongsrid and Dr. Waree Kongprawechnon Department
More informationClosure Polynomials for Strips of Tetrahedra
Closure Polnomials for Strips of Tetrahedra Federico Thomas and Josep M. Porta Abstract A tetrahedral strip is a tetrahedron-tetrahedron truss where an tetrahedron has two neighbors ecept those in the
More informationCMSC 425: Lecture 10 Basics of Skeletal Animation and Kinematics
: Lecture Basics of Skeletal Animation and Kinematics Reading: Chapt of Gregor, Game Engine Architecture. The material on kinematics is a simplification of similar concepts developed in the field of robotics,
More informationNon-linear models. Basis expansion. Overfitting. Regularization.
Non-linear models. Basis epansion. Overfitting. Regularization. Petr Pošík Czech Technical Universit in Prague Facult of Electrical Engineering Dept. of Cbernetics Non-linear models Basis epansion.....................................................................................................
More informationPerformance Evaluation
Performance Evaluation Dan Lizotte 7-9-5 Evaluating Performance..5..5..5..5 Which do ou prefer and wh? Evaluating Performance..5..5 Which do ou prefer and wh?..5..5 Evaluating Performance..5..5..5..5 Performance
More information2.3 Polynomial Functions of Higher Degree with Modeling
SECTION 2.3 Polnomial Functions of Higher Degree with Modeling 185 2.3 Polnomial Functions of Higher Degree with Modeling What ou ll learn about Graphs of Polnomial Functions End Behavior of Polnomial
More informationOverfitting, Model Selection, Cross Validation, Bias-Variance
Statistical Machine Learning Notes 2 Overfitting, Model Selection, Cross Validation, Bias-Variance Instructor: Justin Domke Motivation Suppose we have some data TRAIN = {(, ), ( 2, 2 ),..., ( N, N )} that
More information3.6 Graphing Piecewise-Defined Functions and Shifting and Reflecting Graphs of Functions
76 CHAPTER Graphs and Functions Find the equation of each line. Write the equation in the form = a, = b, or = m + b. For Eercises through 7, write the equation in the form f = m + b.. Through (, 6) and
More informationCSC Computer Graphics
7//7 CSC. Computer Graphics Lecture Kasun@dscs.sjp.ac.l Department of Computer Science Universit of Sri Jaewardanepura Line drawing algorithms DDA Midpoint (Bresenham s) Algorithm Circle drawing algorithms
More informationGraphing Calculator Graphing with the TI-86
Graphing Calculator Graphing with the TI-86 I. Introduction The TI-86 has fift kes, man of which perform multiple functions when used in combination. Each ke has a smbol printed on its face. When a ke
More informationStatistically Analyzing the Impact of Automated ETL Testing on Data Quality
Chapter 5 Statisticall Analzing the Impact of Automated ETL Testing on Data Qualit 5.0 INTRODUCTION In the previous chapter some prime components of hand coded ETL prototpe were reinforced with automated
More informationThe Graph of an Equation
60_0P0.qd //0 :6 PM Page CHAPTER P Preparation for Calculus Archive Photos Section P. RENÉ DESCARTES (96 60) Descartes made man contributions to philosoph, science, and mathematics. The idea of representing
More informationStatistical matching: conditional. independence assumption and auxiliary information
Statistical matching: conditional Training Course Record Linkage and Statistical Matching Mauro Scanu Istat scanu [at] istat.it independence assumption and auxiliary information Outline The conditional
More informationTopic 2 Transformations of Functions
Week Topic Transformations of Functions Week Topic Transformations of Functions This topic can be a little trick, especiall when one problem has several transformations. We re going to work through each
More informationNUMERICAL PERFORMANCE OF COMPACT FOURTH ORDER FORMULATION OF THE NAVIER-STOKES EQUATIONS
Published in : Communications in Numerical Methods in Engineering (008 Commun.Numer.Meth.Engng. 008; Vol : pp 003-019 NUMERICAL PERFORMANCE OF COMPACT FOURTH ORDER FORMULATION OF THE NAVIER-STOKES EQUATIONS
More informationPackage MultiVarMI. April 9, 2018
Type Package Title Multiple Imputation for Multivariate Data Version 1.0 Date 2018-04-08 Author Rawan Allozi, Hakan Demirtas Maintainer Rawan Allozi Package MultiVarMI April 9, 2018 Fully
More informationThree-regular Subgraphs of Four-regular Graphs
Europ. J. Combinatorics (1998) 19, 369 373 Three-regular Subgraphs of Four-regular Graphs OSCAR MORENO AND VICTOR A. ZINOVIEV For an 4-regular graph G (possibl with multiple edges), we prove that, if the
More informationUnit 2: Function Transformation Chapter 1
Basic Transformations Reflections Inverses Unit 2: Function Transformation Chapter 1 Section 1.1: Horizontal and Vertical Transformations A of a function alters the and an combination of the of the graph.
More informationHeteroscedasticity-Consistent Standard Error Estimates for the Linear Regression Model: SPSS and SAS Implementation. Andrew F.
Heteroscedasticity-Consistent Standard Error Estimates for the Linear Regression Model: SPSS and SAS Implementation Andrew F. Hayes 1 The Ohio State University Columbus, Ohio hayes.338@osu.edu Draft: January
More informationCOPULA MODELS FOR BIG DATA USING DATA SHUFFLING
COPULA MODELS FOR BIG DATA USING DATA SHUFFLING Krish Muralidhar, Rathindra Sarathy Department of Marketing & Supply Chain Management, Price College of Business, University of Oklahoma, Norman OK 73019
More informationUnsupervised Learning. Supervised learning vs. unsupervised learning. What is Cluster Analysis? Applications of Cluster Analysis
7 Supervised learning vs unsupervised learning Unsupervised Learning Supervised learning: discover patterns in the data that relate data attributes with a target (class) attribute These patterns are then
More informationDiversity visualization in evolutionary algorithms
Diversit visualization in evolutionar algorithms Jan Drchal drchaj@fel.cvut.cz Miroslav Šnorek snorek@fel.cvut.cz Abstract: Evolutionar Algorithms (EAs) are well-known nature-inspired optimization methods.
More informationTransformations. which the book introduces in this chapter. If you shift the graph of y 1 x to the left 2 units and up 3 units, the
CHAPTER 8 Transformations Content Summar In Chapter 8, students continue their work with functions, especiall nonlinear functions, through further stud of function graphs. In particular, the consider three
More informationIntroduction to Homogeneous Transformations & Robot Kinematics
Introduction to Homogeneous Transformations & Robot Kinematics Jennifer Ka Rowan Universit Computer Science Department. Drawing Dimensional Frames in 2 Dimensions We will be working in -D coordinates,
More informationUsing Characteristics of a Quadratic Function to Describe Its Graph. The graphs of quadratic functions can be described using key characteristics:
Chapter Summar Ke Terms standard form of a quadratic function (.1) factored form of a quadratic function (.1) verte form of a quadratic function (.1) concavit of a parabola (.1) reference points (.) transformation
More informationTubes are Fun. By: Douglas A. Ruby Date: 6/9/2003 Class: Geometry or Trigonometry Grades: 9-12 INSTRUCTIONAL OBJECTIVES:
Tubes are Fun B: Douglas A. Rub Date: 6/9/2003 Class: Geometr or Trigonometr Grades: 9-2 INSTRUCTIONAL OBJECTIVES: Using a view tube students will conduct an eperiment involving variation of the viewing
More information2 Introduction to Function Approximation and Regression
2 Introduction to Function Approimation and Regression The first chapter of this thesis introduces Function Approimation (FA), also called regression, which is the basic feature required to learn sensorimotor
More informationLines and Their Slopes
8.2 Lines and Their Slopes Linear Equations in Two Variables In the previous chapter we studied linear equations in a single variable. The solution of such an equation is a real number. A linear equation
More informationRoberto s Notes on Differential Calculus Chapter 8: Graphical analysis Section 5. Graph sketching
Roberto s Notes on Differential Calculus Chapter 8: Graphical analsis Section 5 Graph sketching What ou need to know alread: How to compute and interpret limits How to perform first and second derivative
More informationClustering Part 2. A Partitional Clustering
Universit of Florida CISE department Gator Engineering Clustering Part Dr. Sanja Ranka Professor Computer and Information Science and Engineering Universit of Florida, Gainesville Universit of Florida
More informationAPPLICATION OF RECIRCULATION NEURAL NETWORK AND PRINCIPAL COMPONENT ANALYSIS FOR FACE RECOGNITION
APPLICATION OF RECIRCULATION NEURAL NETWORK AND PRINCIPAL COMPONENT ANALYSIS FOR FACE RECOGNITION Dmitr Brliuk and Valer Starovoitov Institute of Engineering Cbernetics, Laborator of Image Processing and
More informationREGULAR GRAPHS OF GIVEN GIRTH. Contents
REGULAR GRAPHS OF GIVEN GIRTH BROOKE ULLERY Contents 1. Introduction This paper gives an introduction to the area of graph theory dealing with properties of regular graphs of given girth. A large portion
More informationOLS Assumptions and Goodness of Fit
OLS Assumptions and Goodness of Fit A little warm-up Assume I am a poor free-throw shooter. To win a contest I can choose to attempt one of the two following challenges: A. Make three out of four free
More informationAppendix F: Systems of Inequalities
A0 Appendi F Sstems of Inequalities Appendi F: Sstems of Inequalities F. Solving Sstems of Inequalities The Graph of an Inequalit The statements < and are inequalities in two variables. An ordered pair
More information2.3. Horizontal and Vertical Translations of Functions. Investigate
.3 Horizontal and Vertical Translations of Functions When a video game developer is designing a game, she might have several objects displaed on the computer screen that move from one place to another
More informationBootstrap Confidence Interval of the Difference Between Two Process Capability Indices
Int J Adv Manuf Technol (2003) 21:249 256 Ownership and Copyright 2003 Springer-Verlag London Limited Bootstrap Confidence Interval of the Difference Between Two Process Capability Indices J.-P. Chen 1
More informationEstimation of Tikhonov Regularization Parameter for Image Reconstruction in Electromagnetic Geotomography
Rafał Zdunek Andrze Prałat Estimation of ikhonov Regularization Parameter for Image Reconstruction in Electromagnetic Geotomograph Abstract: he aim of this research was to devise an efficient wa of finding
More informationSimulation: effects of subgroup differences on principal component analyses
Simulation: effects of subgroup differences on principal component analses Chris Evans 31/07/2014 Document format and generation This is an R Markdown document. Markdown is a simple formatting snta for
More informationDiagonal Principal Component Analysis for Face Recognition
Diagonal Principal Component nalysis for Face Recognition Daoqiang Zhang,2, Zhi-Hua Zhou * and Songcan Chen 2 National Laboratory for Novel Software echnology Nanjing University, Nanjing 20093, China 2
More informationAn Approximate Singular Value Decomposition of Large Matrices in Julia
An Approximate Singular Value Decomposition of Large Matrices in Julia Alexander J. Turner 1, 1 Harvard University, School of Engineering and Applied Sciences, Cambridge, MA, USA. In this project, I implement
More informationST512. Fall Quarter, Exam 1. Directions: Answer questions as directed. Please show work. For true/false questions, circle either true or false.
ST512 Fall Quarter, 2005 Exam 1 Name: Directions: Answer questions as directed. Please show work. For true/false questions, circle either true or false. 1. (42 points) A random sample of n = 30 NBA basketball
More informationFind the Relationship: An Exercise in Graphical Analysis
Find the Relationship: An Eercise in Graphical Analsis In several laborator investigations ou do this ear, a primar purpose will be to find the mathematical relationship between two variables. For eample,
More informationThe Graph Scale-Change Theorem
Lesson 3-5 Lesson 3-5 The Graph Scale-Change Theorem Vocabular horizontal and vertical scale change, scale factor size change BIG IDEA The graph of a function can be scaled horizontall, verticall, or in
More informationA SCATTERED DATA INTERPOLANT FOR THE SOLUTION OF THREE-DIMENSIONAL PDES
European Conference on Computational Fluid Dnamics ECCOMAS CFD 26 P. Wesseling, E. Oñate and J. Périau (Eds) c TU Delft, The Netherlands, 26 A SCATTERED DATA INTERPOLANT FOR THE SOLUTION OF THREE-DIMENSIONAL
More informationHeteroskedasticity and Homoskedasticity, and Homoskedasticity-Only Standard Errors
Heteroskedasticity and Homoskedasticity, and Homoskedasticity-Only Standard Errors (Section 5.4) What? Consequences of homoskedasticity Implication for computing standard errors What do these two terms
More informationFuzzy Double-Threshold Track Association Algorithm Using Adaptive Threshold in Distributed Multisensor-Multitarget Tracking Systems
13 IEEE International Conference on Green Computing and Communications and IEEE Internet of Things and IEEE Cyber, Physical and Social Computing Fuzzy Double-Threshold Trac Association Algorithm Using
More informationToday s class. Geometric objects and transformations. Informationsteknologi. Wednesday, November 7, 2007 Computer Graphics - Class 5 1
Toda s class Geometric objects and transformations Wednesda, November 7, 27 Computer Graphics - Class 5 Vector operations Review of vector operations needed for working in computer graphics adding two
More informationLab 5 - Risk Analysis, Robustness, and Power
Type equation here.biology 458 Biometry Lab 5 - Risk Analysis, Robustness, and Power I. Risk Analysis The process of statistical hypothesis testing involves estimating the probability of making errors
More informationChapters 5-6: Statistical Inference Methods
Chapters 5-6: Statistical Inference Methods Chapter 5: Estimation (of population parameters) Ex. Based on GSS data, we re 95% confident that the population mean of the variable LONELY (no. of days in past
More information2.8 Distance and Midpoint Formulas; Circles
Section.8 Distance and Midpoint Formulas; Circles 9 Eercises 89 90 are based on the following cartoon. B.C. b permission of Johnn Hart and Creators Sndicate, Inc. 89. Assuming that there is no such thing
More informationMixture Models and the EM Algorithm
Mixture Models and the EM Algorithm Padhraic Smyth, Department of Computer Science University of California, Irvine c 2017 1 Finite Mixture Models Say we have a data set D = {x 1,..., x N } where x i is
More informationECONOMIC DESIGN OF STATISTICAL PROCESS CONTROL USING PRINCIPAL COMPONENTS ANALYSIS AND THE SIMPLICIAL DEPTH RANK CONTROL CHART
ECONOMIC DESIGN OF STATISTICAL PROCESS CONTROL USING PRINCIPAL COMPONENTS ANALYSIS AND THE SIMPLICIAL DEPTH RANK CONTROL CHART Vadhana Jayathavaj Rangsit University, Thailand vadhana.j@rsu.ac.th Adisak
More informationC URVES AND V ECTORS
96-ch- SB5-Ostebee June 6, 9:57 C H A P T E R O U T L I N E. Three-Dimensional Space. Curves and Parametric Equations. Polar Coordinates and Polar Curves.4 Vectors.5 Vector-Valued Functions, Derivatives,
More information2.2 Absolute Value Functions
. Absolute Value Functions 7. Absolute Value Functions There are a few was to describe what is meant b the absolute value of a real number. You ma have been taught that is the distance from the real number
More informationSection 2.2: Absolute Value Functions, from College Algebra: Corrected Edition by Carl Stitz, Ph.D. and Jeff Zeager, Ph.D. is available under a
Section.: Absolute Value Functions, from College Algebra: Corrected Edition b Carl Stitz, Ph.D. and Jeff Zeager, Ph.D. is available under a Creative Commons Attribution-NonCommercial-ShareAlike.0 license.
More informationExponential and Logarithmic Functions
Eponential and Logarithmic Functions Figure Electron micrograph of E. Coli bacteria (credit: Mattosaurus, Wikimedia Commons) CHAPTER OUTLINE. Eponential Functions. Logarithmic Properties. Graphs of Eponential
More informationExponential and Logarithmic Functions
Eponential and Logarithmic Functions Figure Electron micrograph of E. Coli bacteria (credit: Mattosaurus, Wikimedia Commons) Chapter Outline. Eponential Functions. Logarithmic Properties. Graphs of Eponential
More informationMultiple imputation of missing values: Update of ice
The Stata Journal (2005) 5, Number 4, pp. 527 536 Multiple imputation of missing values: Update of ice 1 Introduction Patrick Roston Cancer Group MRC Clinical Trials Unit 222 Euston Road London NW1 2DA
More informationPartial Fraction Decomposition
Section 7. Partial Fractions 53 Partial Fraction Decomposition Algebraic techniques for determining the constants in the numerators of partial fractions are demonstrated in the eamples that follow. Note
More informationTwo Dimensional Viewing
Two Dimensional Viewing Dr. S.M. Malaek Assistant: M. Younesi Two Dimensional Viewing Basic Interactive Programming Basic Interactive Programming User controls contents, structure, and appearance of objects
More informationLESSON 3.1 INTRODUCTION TO GRAPHING
LESSON 3.1 INTRODUCTION TO GRAPHING LESSON 3.1 INTRODUCTION TO GRAPHING 137 OVERVIEW Here s what ou ll learn in this lesson: Plotting Points a. The -plane b. The -ais and -ais c. The origin d. Ordered
More informationUsing a Table of Values to Sketch the Graph of a Polynomial Function
A point where the graph changes from decreasing to increasing is called a local minimum point. The -value of this point is less than those of neighbouring points. An inspection of the graphs of polnomial
More informationA Fourth-Order Gas-Kinetic CPR Method for the Navier-Stokes Equations on Unstructured Meshes
Tenth International Conference on Computational Fluid Dnamics (ICCFD), Barcelona,Spain, Jul 9-, 8 ICCFD-8- A Fourth-Order Gas-Kinetic CPR Method for the Navier-Stokes Equations on Unstructured Meshes Chao
More informationEvaluating Robot Systems
Evaluating Robot Systems November 6, 2008 There are two ways of constructing a software design. One way is to make it so simple that there are obviously no deficiencies. And the other way is to make it
More informationClustering. Supervised vs. Unsupervised Learning
Clustering Supervised vs. Unsupervised Learning So far we have assumed that the training samples used to design the classifier were labeled by their class membership (supervised learning) We assume now
More informationNumerical Analysis Notes
Numerical Analsis Notes Foes Team Plotting of = f() contour-lines with Ecel Macro isol.ls The Ecel (XP/) macro isol.ls developed b SimonLuca Santoro and kindl released in the free public domain allows
More informationThe Bootstrap and Jackknife
The Bootstrap and Jackknife Summer 2017 Summer Institutes 249 Bootstrap & Jackknife Motivation In scientific research Interest often focuses upon the estimation of some unknown parameter, θ. The parameter
More informationMS&E 226: Small Data
MS&E 226: Small Data Lecture 13: The bootstrap (v3) Ramesh Johari ramesh.johari@stanford.edu 1 / 30 Resampling 2 / 30 Sampling distribution of a statistic For this lecture: There is a population model
More informationYou ve already read basics of simulation now I will be taking up method of simulation, that is Random Number Generation
Unit 5 SIMULATION THEORY Lesson 39 Learning objective: To learn random number generation. Methods of simulation. Monte Carlo method of simulation You ve already read basics of simulation now I will be
More informationPolynomial and Rational Functions
Polnomial and Rational Functions Figure -mm film, once the standard for capturing photographic images, has been made largel obsolete b digital photograph. (credit film : modification of work b Horia Varlan;
More information5.5 Regression Estimation
5.5 Regression Estimation Assume a SRS of n pairs (x, y ),..., (x n, y n ) is selected from a population of N pairs of (x, y) data. The goal of regression estimation is to take advantage of a linear relationship
More informationUsing Mplus Monte Carlo Simulations In Practice: A Note On Non-Normal Missing Data In Latent Variable Models
Using Mplus Monte Carlo Simulations In Practice: A Note On Non-Normal Missing Data In Latent Variable Models Bengt Muth en University of California, Los Angeles Tihomir Asparouhov Muth en & Muth en Mplus
More informationSTAT 2607 REVIEW PROBLEMS Word problems must be answered in words of the problem.
STAT 2607 REVIEW PROBLEMS 1 REMINDER: On the final exam 1. Word problems must be answered in words of the problem. 2. "Test" means that you must carry out a formal hypothesis testing procedure with H0,
More informationA TWO-DIMENSIONAL CONTINUOUS ACTION LEARNING AUTOMATON
Control 4, Universit of Bath, UK, September 4 ID-34 A TWO-DIMENSIONAL CONTINUOUS ACTION LEARNING AUTOMATON K. Spurgeon, Q. H. Wu, Z. Richardson, J. Fitch Department of Electrical Eng. and Electronics,
More informationMinnesota State High School Mathematics League
2011-12 Meet 5, Individual vent uestion #1 is intended to be a quickie and is worth 1 point. ach of the net three questions is worth 2 points. Place our answer to each question on the line provided. You
More informationDatabase Design 1DL400. Assignment 2:2
Uppsala Universit Department of Information Technolog Kjell Orsborn Assignment : - Database Design II Database Design DL00 Assignment : A Scientific Database for Mesh-Based Data. Goals This eercise consists
More informationStudy on Image Retrieval Method of Integrating Color and Texture
International Journal of Science Vol. No.1 015 ISSN: 1813-4890 Stud on Image Retrieval Method of Integrating Color and Texture Lei Liu a, Xiafu Lv b, Junpeng Chen, Bohua Wang College of automation, Chongqing
More informationImage Metamorphosis By Affine Transformations
Image Metamorphosis B Affine Transformations Tim Mers and Peter Spiegel December 16, 2005 Abstract Among the man was to manipulate an image is a technique known as morphing. Image morphing is a special
More information[ ] [ ] Orthogonal Transformation of Cartesian Coordinates in 2D & 3D. φ = cos 1 1/ φ = tan 1 [ 2 /1]
Orthogonal Transformation of Cartesian Coordinates in 2D & 3D A vector is specified b its coordinates, so it is defined relative to a reference frame. The same vector will have different coordinates in
More informationMissing Data Analysis for the Employee Dataset
Missing Data Analysis for the Employee Dataset 67% of the observations have missing values! Modeling Setup For our analysis goals we would like to do: Y X N (X, 2 I) and then interpret the coefficients
More informationThe nonorientable genus of complete tripartite graphs
The nonorientable genus of complete tripartite graphs M. N. Ellingham Department of Mathematics, Stevenson Center Vanderbilt Universit, Nashville, TN 7, U. S. A. mne@math.vanderbilt.edu Chris Stephens
More informationWork Session 16a: Massaging data graphically
Work Session 6a: Massaging data graphicall Massaging data means to manipulate data. Massaging data graphicall often means to manipulate data so as to obtain a straight line. Example: Here is some x, data:
More informationMean Tests & X 2 Parametric vs Nonparametric Errors Selection of a Statistical Test SW242
Mean Tests & X 2 Parametric vs Nonparametric Errors Selection of a Statistical Test SW242 Creation & Description of a Data Set * 4 Levels of Measurement * Nominal, ordinal, interval, ratio * Variable Types
More informationData analysis using Microsoft Excel
Introduction to Statistics Statistics may be defined as the science of collection, organization presentation analysis and interpretation of numerical data from the logical analysis. 1.Collection of Data
More informationA Quick Guide for the EMCluster Package
A Quick Guide for the EMCluster Package Wei-Chen Chen 1, Ranjan Maitra 2 1 pbdr Core Team 2 Department of Statistics, Iowa State Universit, Ames, IA, USA Contents Acknowledgement ii 1. Introduction 1 2.
More information