Suggestions - Problem Set (a) Show the discriminant condition (1) takes the form. ln ln, # # R R
|
|
- Deborah Norman
- 6 years ago
- Views:
Transcription
1 Suggetion - Problem Set (a) Show the dicriminant condition (1) take the form x D Ð.. Ñ. D.. D. ln ln, a deired. We then replace the quantitie. 3ß D3 by their etimate to get the proper form for thi dicriminant. (b) Here uing the output notation C œ ß C œ for clae 1 and 2 repectively, you want to minimize ÐC x Ñ œ Ðy Ñ, 3œ 3! 3 Ô x x! x Ô where œ, letting œ Ö Ùand œ Ò1 Ó œ ã ã Þ ã Õ Õ x x In general vector/matrice with a ~ on them can repreent vector augmented with 1' (and in ome cae!'). Ue the uual leat quare o that approximate. œð ) y Thu œ y. ÐÑ Firt conider the right hand ide, y. Without lo you can arrange the data o the firt example Ð ßCÑ are in the firt cla and the lat are in the econd. x 3 3 Thu how the right ide of (1) become: 1 1 y y y! œ œ œ y y. Meantime how y œ x3 x3 œ Ð.. Ñ 4œ 4œ. So
2 ! y œ Ð.. Ñ. ÐÑ To calculate the left ide of (1), you can write Ô x ã x ë œ œ x, Ö ã ã Ù Õ x Let 1 1 Më œ œ Ò1 M 1 1 ] i.e. M i the matrix whoe firt row are copie of., and whoe lat row are copie of.. Here i alway a column vector of length with all 1'. Then how œ = Ò Ó œ Thu how! ë.. œ.. Now from the relationhip Ð Ñ œ!.. Þ Ð.. Ñ! y œ! œ Ò 1 Ó œ 1!, if you average over the entrie C 3 of y, how o!œ1 y œ 1 œ Ð.. Ñ,!!!œ Ð.. Ñ,!
3 o now œ..! Š, You can write Ô! œ Þ Ð$Ñ Õ Ð.. ÑŠ.. œ Ð MÑ Ð MÑ M M M M But how Ð MÑ Ð MÑ œ Ð Ñ D M œ x. x. œ.... 4œ 4 4 4œ Thu So by (3) above, how M M œ.... Þ œð ÑD..... Ô! œ Ö Ù Þ Ð Ñ Ð Ñ Õ œ.. Œ.. D.... (4) Now how the bottom term coefficient i Ð Ñ Ð Ñ.. Š.. D.... œ Ð Ñ D Ð.. ÑÐ.. Ñ
4 Now ue (1), (2), (4) and (5). œ Ð Ñ D DF (5) (c) It follow that D œð.. ÑÒÐ.. Ñ ÓœÒÐ.. Ñ ÓÐ.. Ñß F which i clearly in the direction of Ð.. Ñß ince ÒÐ.. Ñ Ó i a calar (why?) Finally from (4.56), œ ÐÐ ÑD Ñ Ð.. Ñ ÒÐ.. Ñ ÓÐ.. Ñ œðcalarñ Þ D Ð.. ÑÞ (d) Changing the coding for the two C value tranform the pair of number and repectively into another pair + and, of poible C value. Show that there i a linear calar tranformation C œ-c.œ0ðcñuch that 0 Š œ+ and 0 Š œ,. What are - and.? Now how that if y ha only entrie and, then in their place the vector y œ-y. 1 will have + and, repectively Þ Further how that if we replace y by y in the dataet Ö x ßC, then we will have a new 3 3 3œ y œ œ Ð Ñ y œ Hy œ HÐ-y. 1 Ñ œ -y. 1. (why i H1 œ 1à recall H i a projection). Thu the tranformation to y i exactly the ame a the tranformation to y above. Show in fact that the tranformation act in exactly the ame way on each component of y. Now how that the final election of Ô C C clae baed on the new y œ Ö Ù will be baed on each entry C3, and whether it i ã Õ C cloer to + (chooe cla 1 Ñ or, (chooe cla 2). Show that C 3 i cloer to + iff C3 i cloer to. (e) Now you have and! and the regreion function 0ÐxÑœ! x.
5 From part (c), œ5d Ð.. Ñ for ome 5. Thu how from above that œ.. 5D! Š Ð.. Ñ. ecall the group target (y-value) on which we have trained the regreion are: cla À Cœ à cla2 À Cœ. For an input tet vector x, how that the correponding C will be in cla 1 if 0ÐxÑ i cloer to, than to, and otherwie cla 2. Show C hould be aigned to cla 2 if 0ÐxÑ Š. Show from above that the criterion for cla 2 aignment i: 0ÐxÑœ Š. x 5. D Ð.. Ñ Š or x D Ð Ñ. Ð Ñ. Š.. D.. Š Þ 5 I thi the ame a the LDA criterion in (a)? Now aume happen then? œ œ Î - what 4.3 ecall the LDA criterion for chooing the group 6 out of group ß ÞÞÞß O given a tet feature vector x i 6œ arg max $ ÐxÑ, 5 5 i.e., finding the 6œ5 which make $ 5 ÐxÑ the larget. Here a uual $ 5 ÐxÑœx D D ln 15Þ Thi problem i related to the dicuion in ection 4.2 involving the ue of a regreion approach to ditinguih among the O prediction. Thi work by chooing target (repreentative of the O clae to be et equal to the repone variable C) a follow. For a vector x whoe cla i 5, we chooe the repone variable to be y œ Ð!ß ÞÞÞß!ß ß!ÞÞÞß!Ñ (a row vector), with a 1 only in the 5 >2 poition. Then if we are given a training et 7 œöðx3ßy3ñ 3œ, the repone are no longer C3 œ 0 or 1, but >2 vector y with a 1 in the 5 poition if the cla aigned to x i group Ð(Ñ
6 A hown in the text, the appropriate regreion here work exactly a in the cae the repone are calar, except that the uual vector C 3 Ô C C y œ Ö Ù ã ÕC with each row a calar (0 or 1) repreenting the cla of the Ô y y Y œ Ö Ù, ã Õy x 3 i replaced by a matrix with each cla indicator y 3 indicating the cla through the poition of it only entry 1 (note again that each i a row vector). By adding the uual column of 1' we form y 3 Ô y Y œ ã ã Þ Õ y Otherwie the regreion proce i the ame, with the vector y replaced by the matrix Y. Now following the regreion dicuion in the text, the uual etimated value y of y i replaced uing the ame formula to get an etimated value Y of Y: Y œ Ð Ñ Y, (7) which ha exactly the ame form a tandard regreion, with y replaced by Y. Notice with Y œ B (8a) B œ ( Ñ Y. (8c) Note that a in our general regreion dicuion the matrix i aumed to already contain an initial column of 1'. ow-wie, defining y 3 to be the 3 >2 row of Ô y y Y œ Ö Ù, equation (8a) i equivalent to y œ x B ã 3 3 ; here and elewhere the tilde ~ on Õy a vector mean we have added 1' in the initial poition: x 3 œ x. 3
7 Note that wherea previouly wa given by the ame formula (8c), now B i a matrix intead of a vector. Wherea previouly we had C 3 œ x 3 a the etimated value of C3 within the dataet, we now have intead where y 3 i a vector (the 3 >2 row of Y ). y œ x B, (9) 3 3 We are aking what would happen if we imply replace thi training et 7 œöðx3ßy3ñ with a new training et replacing the input vector x 3 by the correponding etimate y3, o that the training et now look like 7 w œöðy3 ßy3Ñ 3œ. Note that we are uing the tranpoe in y 3 becaue we want it to be a column vector (why?), replacing the original column input vector x 3. Equivalently, we are replacing the training matrix Ô x Ô y œ ã ã by the repone vector et Y œ ã ã. Õ x Õ y We wih to how that if we ue thi new dataet in both training and teting, then we will till get the ame cla prediction for a new tet vector x, but uing LDA (not regreion here). Show that given that 6œarg max 5$ 5ÐxÑ, we jut need to check how the computation of the $ 5 ÐxÑ change uing the new data et. Note the training data now have the form 7 w œöðy ßy Ñ œ ÖÐB x ßy Ñ Þ 3 3 3œ 3 3 3œ The original dicriminant function ha the form $ 5 Ðx) œ x D. 5. 5D. 5 ln 1 5 ß Ð!Ñ where where 1 œ Þ Show the new dicriminant function $ ÐxÑ ha the form $ 5Ðy ) œyd D. 5 ln 1 5,. 5 œ y œ B x œ B Þ ë4 ë x4 œ B.ë 5 4œà1Ð4Ñœ œà1Ð4Ñœ5 5 4œà1Ð4Ñœ5 D œ 4œ Ð O y 4. 1Ð4ÑÑÐy4. 1Ð4ÑÑ where, a uual, thi etimator repreent the pooled etimate of the variance of the
8 vector of interet baed on their individual group, but with x replaced by y. Here >2 1Ð4Ñ repreent the group (out of the O total) of the 4 ample. 3 3 You wih to how that the modified dicriminant function make the ame deciion a the original one, i.e., that whenever y œ x B, But note that and how $ 5 Ðy Ñ $ 5 Ðy Ñ $ Ðy Ñ iff $ ÐxÑ $ ÐxÑÞ ha the form (10), with. œð.ë B œ B 5 5 D œ 4œ Ð O y ).ë 5 3. ÑÐy3. 1Ð3Ñ Ñ 1Ð3Ñ œ O B Ðx 3. ÑÐx3 Ñ B 1Ð3Ñ. 1Ð3Ñ 4œ œ B D B where, becaue our vector are augmented to have a 1 in the firt poition (and thu are of length : ) we mut alo augment the covariance matrix D in order to be Ð: Ñ Ð: Ñ, by adding a firt row and firt column of 0'. That i, we define! 0: D œ ß 0 D : where 0 : i a column vector of length : with all zeroe, and the upper left corner i Þ Of coure D i the etimator of D. Thu how we can write $ 5 Ðy ÑœyD.. D. ln œ x B B B B B B Ð D Ñ.. Ð D BÑ B. ln Ð!+Ñ Now to define the quare root of a matrix. For any : : quare ymmetric invertible : matrix E, aume that Ö- 3 ß a 3 3œ are it eigenvalue and correponding eigenvector. For a function 0ÐBÑ define 0ÐEÑ to be the matrix with the ame eigenvector a 3, but Î Î : eigenvalue 0Ð-3Ñ. Thu E would have Ö-3 ß a 3 3=1 a it eigenvalue-eigenvector pair.
9 Now we replace our dataet x Î 3 Ä D x3. Thi lead to the replacement Ä D. Clearly Y in (7) doe not change under thi tranformation (why?). However, now with the tranformed value, how we have Î Î Î Î ZÐÑœZÐD ÑœD DD œm. Thi tranformed dataet thu lead to the ame function which ha changed to (now D œm) Y, but give a linear dicriminant $ 5 ÐxÑœx ln 1 5, (11) Show thi i actually identical to that before remember that the new x equal the old x Î time D and we have alo computed the. 5 from the new dataet; thu the clae obtained from uing the dicriminant in (11) (uing the new tranformed data et) will be identical to what the predicted clae were before. Alo how the tranformed dicriminant function (now changing thee x into the unchanged y and forming the reulting dicriminant) mut be exactly the ame a when we replaced by y before, ince the dataet Öy 3 ß y3 3œ i identical (ee (9a)). Thu we need only how the reult of thi problem for the new (tranformed) dataet Öx3ß y3, where the new are defined a above. x 3 Show uing the ame argument we will again replace our dataet o that each current datapoint x will be replaced by x., with., i.e. the overall current mean of all x (regardle of cla). Show thi doe not change the covariance D, and in term of the new dataet the identical dicriminant function will now be $ 5 ÐxÑ œ Ðx. Ñ Ð. 5. Ñ Ð. 5. Ñ Ð. 5. Ñ ln 1 5 (13) (again with x obtained from the new mean-ubtracted dataet). Show by tranlating all data by the ame amount. will not change the relative ize of the dicriminant function, and o if we replace the old dicriminant function (13) by $ 5 ÐxÑœx ln 1 5 (15) then clearly thi will not affect whether $ 5 ÐxÑ $ 6 ÐxÑ or not. Furthermore, ince Y i a tandard regreion etimator (jut with multiple column), how a tranlation of the dataet will not affect the prediction, o that with thi new dataet the Y we obtain i identical to the previou one.
10 Thu at thi point you have reduced the problem to having a dataet with empirical mean 0 and tandard deviation 1 for each coordinate, and we till have the ame dicriminant function (15) and etimator Y, derived in the ame way from the new data and the outcome matrix Y. Thi mean we are uing the dicriminant function (11) above à how equation (10a) become $ 5 Ðy Ñœx BB Ð B B BB Ð B ). 5. B 5 ). 5 ln. 5Þ But how that H B ÐB B) B i jut the projection onto the column pace of B (ee ' ' the dicuion on p. 46 of the hat function, which project y onto the column pace of, giving y). Now how that. 5 i in the column pace of B. Note our aumption of covariance M and mean! for the x3, it follow that œm, o B œð Ñ Y œ YÞThu the 5 >2 column b5 of B i jut b5 œ C5, where C5 denote the 5 >2 column (not >2 row) of Y. But from the definition of œ Ò x x ÞÞÞ xó and C5 (whoe 3 entry i 0 unle x i in cla 5), the column b mut be jut b œ x, i.e., a multiple of K. 5. Thu, clearly all. 5 are in the column pace of B, and hence H. 5 œ. 5 for all 5. Thu by (17) how $ 5 Ðy Ñ œ x L L. 5 ln 1 5 œ x ln 15, that i, the dicriminant from the Y -baed dicriminant function give identical value to the dicriminant (15), which we have hown give identical choice to the dicriminant baed on the original dataet, a deired. 5
Social Studies 201 Notes for March 18, 2005
1 Social Studie 201 Note for March 18, 2005 Etimation of a mean, mall ample ize Section 8.4, p. 501. When a reearcher ha only a mall ample ize available, the central limit theorem doe not apply to the
More informationSocial Studies 201 Notes for November 14, 2003
1 Social Studie 201 Note for November 14, 2003 Etimation of a mean, mall ample ize Section 8.4, p. 501. When a reearcher ha only a mall ample ize available, the central limit theorem doe not apply to the
More informationComparing Means: t-tests for Two Independent Samples
Comparing ean: t-tet for Two Independent Sample Independent-eaure Deign t-tet for Two Independent Sample Allow reearcher to evaluate the mean difference between two population uing data from two eparate
More informationClustering Methods without Given Number of Clusters
Clutering Method without Given Number of Cluter Peng Xu, Fei Liu Introduction A we now, mean method i a very effective algorithm of clutering. It mot powerful feature i the calability and implicity. However,
More informationLecture 21. The Lovasz splitting-off lemma Topics in Combinatorial Optimization April 29th, 2004
18.997 Topic in Combinatorial Optimization April 29th, 2004 Lecture 21 Lecturer: Michel X. Goeman Scribe: Mohammad Mahdian 1 The Lovaz plitting-off lemma Lovaz plitting-off lemma tate the following. Theorem
More information1. The F-test for Equality of Two Variances
. The F-tet for Equality of Two Variance Previouly we've learned how to tet whether two population mean are equal, uing data from two independent ample. We can alo tet whether two population variance are
More informationIf Y is normally Distributed, then and 2 Y Y 10. σ σ
ull Hypothei Significance Teting V. APS 50 Lecture ote. B. Dudek. ot for General Ditribution. Cla Member Uage Only. Chi-Square and F-Ditribution, and Diperion Tet Recall from Chapter 4 material on: ( )
More informationChapter 2 Sampling and Quantization. In order to investigate sampling and quantization, the difference between analog
Chapter Sampling and Quantization.1 Analog and Digital Signal In order to invetigate ampling and quantization, the difference between analog and digital ignal mut be undertood. Analog ignal conit of continuou
More informationIntroduction to Laplace Transform Techniques in Circuit Analysis
Unit 6 Introduction to Laplace Tranform Technique in Circuit Analyi In thi unit we conider the application of Laplace Tranform to circuit analyi. A relevant dicuion of the one-ided Laplace tranform i found
More informationProblem Set 8 Solutions
Deign and Analyi of Algorithm April 29, 2015 Maachuett Intitute of Technology 6.046J/18.410J Prof. Erik Demaine, Srini Devada, and Nancy Lynch Problem Set 8 Solution Problem Set 8 Solution Thi problem
More informationCHAPTER 6. Estimation
CHAPTER 6 Etimation Definition. Statitical inference i the procedure by which we reach a concluion about a population on the bai of information contained in a ample drawn from that population. Definition.
More informationThe Hassenpflug Matrix Tensor Notation
The Haenpflug Matrix Tenor Notation D.N.J. El Dept of Mech Mechatron Eng Univ of Stellenboch, South Africa e-mail: dnjel@un.ac.za 2009/09/01 Abtract Thi i a ample document to illutrate the typeetting of
More informationSource slideplayer.com/fundamentals of Analytical Chemistry, F.J. Holler, S.R.Crouch. Chapter 6: Random Errors in Chemical Analysis
Source lideplayer.com/fundamental of Analytical Chemitry, F.J. Holler, S.R.Crouch Chapter 6: Random Error in Chemical Analyi Random error are preent in every meaurement no matter how careful the experimenter.
More informationMINITAB Stat Lab 3
MINITAB Stat 20080 Lab 3. Statitical Inference In the previou lab we explained how to make prediction from a imple linear regreion model and alo examined the relationhip between the repone and predictor
More informationZ a>2 s 1n = X L - m. X L = m + Z a>2 s 1n X L = The decision rule for this one-tail test is
M09_BERE8380_12_OM_C09.QD 2/21/11 3:44 PM Page 1 9.6 The Power of a Tet 9.6 The Power of a Tet 1 Section 9.1 defined Type I and Type II error and their aociated rik. Recall that a repreent the probability
More informationLecture 8: Period Finding: Simon s Problem over Z N
Quantum Computation (CMU 8-859BB, Fall 205) Lecture 8: Period Finding: Simon Problem over Z October 5, 205 Lecturer: John Wright Scribe: icola Rech Problem A mentioned previouly, period finding i a rephraing
More informationμ + = σ = D 4 σ = D 3 σ = σ = All units in parts (a) and (b) are in V. (1) x chart: Center = μ = 0.75 UCL =
Our online Tutor are available 4*7 to provide Help with Proce control ytem Homework/Aignment or a long term Graduate/Undergraduate Proce control ytem Project. Our Tutor being experienced and proficient
More informationSuggested Answers To Exercises. estimates variability in a sampling distribution of random means. About 68% of means fall
Beyond Significance Teting ( nd Edition), Rex B. Kline Suggeted Anwer To Exercie Chapter. The tatitic meaure variability among core at the cae level. In a normal ditribution, about 68% of the core fall
More informationTHE THERMOELASTIC SQUARE
HE HERMOELASIC SQUARE A mnemonic for remembering thermodynamic identitie he tate of a material i the collection of variable uch a tre, train, temperature, entropy. A variable i a tate variable if it integral
More informationSolution to Test #1.
Solution to Tet #. Problem #. Lited below are recorded peed (in mile per hour, mph) of randomly elected car on a ection of Freeway 5 in Lo Angele. Data are orted. 56 58 58 59 60 60 6 6 65 65 65 65 66 66
More informationLecture 7: Testing Distributions
CSE 5: Sublinear (and Streaming) Algorithm Spring 014 Lecture 7: Teting Ditribution April 1, 014 Lecturer: Paul Beame Scribe: Paul Beame 1 Teting Uniformity of Ditribution We return today to property teting
More informationCHAPTER 8 OBSERVER BASED REDUCED ORDER CONTROLLER DESIGN FOR LARGE SCALE LINEAR DISCRETE-TIME CONTROL SYSTEMS
CHAPTER 8 OBSERVER BASED REDUCED ORDER CONTROLLER DESIGN FOR LARGE SCALE LINEAR DISCRETE-TIME CONTROL SYSTEMS 8.1 INTRODUCTION 8.2 REDUCED ORDER MODEL DESIGN FOR LINEAR DISCRETE-TIME CONTROL SYSTEMS 8.3
More informationSOLUTIONS TO ALGEBRAIC GEOMETRY AND ARITHMETIC CURVES BY QING LIU. I will collect my solutions to some of the exercises in this book in this document.
SOLUTIONS TO ALGEBRAIC GEOMETRY AND ARITHMETIC CURVES BY QING LIU CİHAN BAHRAN I will collect my olution to ome of the exercie in thi book in thi document. Section 2.1 1. Let A = k[[t ]] be the ring of
More informationLinear Motion, Speed & Velocity
Add Important Linear Motion, Speed & Velocity Page: 136 Linear Motion, Speed & Velocity NGSS Standard: N/A MA Curriculum Framework (006): 1.1, 1. AP Phyic 1 Learning Objective: 3.A.1.1, 3.A.1.3 Knowledge/Undertanding
More informationDIFFERENTIAL EQUATIONS Laplace Transforms. Paul Dawkins
DIFFERENTIAL EQUATIONS Laplace Tranform Paul Dawkin Table of Content Preface... Laplace Tranform... Introduction... The Definition... 5 Laplace Tranform... 9 Invere Laplace Tranform... Step Function...
More informationConfusion matrices. True / False positives / negatives. INF 4300 Classification III Anne Solberg The agenda today: E.g., testing for cancer
INF 4300 Claification III Anne Solberg 29.10.14 The agenda today: More on etimating claifier accuracy Cure of dimenionality knn-claification K-mean clutering x i feature vector for pixel i i- The cla label
More informationList Coloring Graphs
Lit Coloring Graph February 6, 004 LIST COLORINGS AND CHOICE NUMBER Thomaen Long Grotzch girth 5 verion Thomaen Long Let G be a connected planar graph of girth at leat 5. Let A be a et of vertice in G
More informationSIMPLE LINEAR REGRESSION
SIMPLE LINEAR REGRESSION In linear regreion, we conider the frequency ditribution of one variable (Y) at each of everal level of a econd variable (). Y i known a the dependent variable. The variable for
More informationMath 273 Solutions to Review Problems for Exam 1
Math 7 Solution to Review Problem for Exam True or Fale? Circle ONE anwer for each Hint: For effective tudy, explain why if true and give a counterexample if fale (a) T or F : If a b and b c, then a c
More informationWeek 3 Statistics for bioinformatics and escience
Week 3 Statitic for bioinformatic and escience Line Skotte 28. november 2008 2.9.3-4) In thi eercie we conider microrna data from Human and Moue. The data et repreent 685 independent realiation of the
More informationSIMON FRASER UNIVERSITY School of Engineering Science ENSC 320 Electric Circuits II. Solutions to Assignment 3 February 2005.
SIMON FRASER UNIVERSITY School of Engineering Science ENSC 320 Electric Circuit II Solution to Aignment 3 February 2005. Initial Condition Source 0 V battery witch flip at t 0 find i 3 (t) Component value:
More informationControl Systems Analysis and Design by the Root-Locus Method
6 Control Sytem Analyi and Deign by the Root-Locu Method 6 1 INTRODUCTION The baic characteritic of the tranient repone of a cloed-loop ytem i cloely related to the location of the cloed-loop pole. If
More informationChapter 4. The Laplace Transform Method
Chapter 4. The Laplace Tranform Method The Laplace Tranform i a tranformation, meaning that it change a function into a new function. Actually, it i a linear tranformation, becaue it convert a linear combination
More informationBogoliubov Transformation in Classical Mechanics
Bogoliubov Tranformation in Claical Mechanic Canonical Tranformation Suppoe we have a et of complex canonical variable, {a j }, and would like to conider another et of variable, {b }, b b ({a j }). How
More informationMATEMATIK Datum: Tid: eftermiddag. A.Heintz Telefonvakt: Anders Martinsson Tel.:
MATEMATIK Datum: 20-08-25 Tid: eftermiddag GU, Chalmer Hjälpmedel: inga A.Heintz Telefonvakt: Ander Martinon Tel.: 073-07926. Löningar till tenta i ODE och matematik modellering, MMG5, MVE6. Define what
More information7.2 INVERSE TRANSFORMS AND TRANSFORMS OF DERIVATIVES 281
72 INVERSE TRANSFORMS AND TRANSFORMS OF DERIVATIVES 28 and i 2 Show how Euler formula (page 33) can then be ued to deduce the reult a ( a) 2 b 2 {e at co bt} {e at in bt} b ( a) 2 b 2 5 Under what condition
More information: œ Ö: =? À =ß> real numbers. œ the previous plane with each point translated by : Ðfor example,! is translated to :)
â SpanÖ?ß@ œ Ö =? > @ À =ß> real numbers : SpanÖ?ß@ œ Ö: =? > @ À =ß> real numbers œ the previous plane with each point translated by : Ðfor example, is translated to :) á In general: Adding a vector :
More informationLecture 4 Topic 3: General linear models (GLMs), the fundamentals of the analysis of variance (ANOVA), and completely randomized designs (CRDs)
Lecture 4 Topic 3: General linear model (GLM), the fundamental of the analyi of variance (ANOVA), and completely randomized deign (CRD) The general linear model One population: An obervation i explained
More informationDIFFERENTIAL EQUATIONS
DIFFERENTIAL EQUATIONS Laplace Tranform Paul Dawkin Table of Content Preface... Laplace Tranform... Introduction... The Definition... 5 Laplace Tranform... 9 Invere Laplace Tranform... Step Function...4
More informationAlternate Dispersion Measures in Replicated Factorial Experiments
Alternate Diperion Meaure in Replicated Factorial Experiment Neal A. Mackertich The Raytheon Company, Sudbury MA 02421 Jame C. Benneyan Northeatern Univerity, Boton MA 02115 Peter D. Krau The Raytheon
More informationWhat lies between Δx E, which represents the steam valve, and ΔP M, which is the mechanical power into the synchronous machine?
A 2.0 Introduction In the lat et of note, we developed a model of the peed governing mechanim, which i given below: xˆ K ( Pˆ ˆ) E () In thee note, we want to extend thi model o that it relate the actual
More informationGiven the following circuit with unknown initial capacitor voltage v(0): X(s) Immediately, we know that the transfer function H(s) is
EE 4G Note: Chapter 6 Intructor: Cheung More about ZSR and ZIR. Finding unknown initial condition: Given the following circuit with unknown initial capacitor voltage v0: F v0/ / Input xt 0Ω Output yt -
More informationPreemptive scheduling on a small number of hierarchical machines
Available online at www.ciencedirect.com Information and Computation 06 (008) 60 619 www.elevier.com/locate/ic Preemptive cheduling on a mall number of hierarchical machine György Dóa a, Leah Eptein b,
More informationDimensional Analysis A Tool for Guiding Mathematical Calculations
Dimenional Analyi A Tool for Guiding Mathematical Calculation Dougla A. Kerr Iue 1 February 6, 2010 ABSTRACT AND INTRODUCTION In converting quantitie from one unit to another, we may know the applicable
More informationAvoiding Forbidden Submatrices by Row Deletions
Avoiding Forbidden Submatrice by Row Deletion Sebatian Wernicke, Jochen Alber, Jen Gramm, Jiong Guo, and Rolf Niedermeier Wilhelm-Schickard-Intitut für Informatik, niverität Tübingen, Sand 13, D-72076
More informationThe Laplace Transform , Haynes Miller and Jeremy Orloff
The Laplace Tranform 8.3, Hayne Miller and Jeremy Orloff Laplace tranform baic: introduction An operator take a function a input and output another function. A tranform doe the ame thing with the added
More informationSVM example: cancer classification Support Vector Machines
SVM example: cancer classification Support Vector Machines 1. Cancer genomics: TCGA The cancer genome atlas (TCGA) will provide high-quality cancer data for large scale analysis by many groups: SVM example:
More information(3) A bilinear map B : S(R n ) S(R m ) B is continuous (for the product topology) if and only if there exist C, N and M such that
The material here can be found in Hörmander Volume 1, Chapter VII but he ha already done almot all of ditribution theory by thi point(!) Johi and Friedlander Chapter 8. Recall that S( ) i a complete metric
More informationChapter 12 Simple Linear Regression
Chapter 1 Simple Linear Regreion Introduction Exam Score v. Hour Studied Scenario Regreion Analyi ued to quantify the relation between (or more) variable o you can predict the value of one variable baed
More informationLecture 9: Shor s Algorithm
Quantum Computation (CMU 8-859BB, Fall 05) Lecture 9: Shor Algorithm October 7, 05 Lecturer: Ryan O Donnell Scribe: Sidhanth Mohanty Overview Let u recall the period finding problem that wa et up a a function
More informationMoment of Inertia of an Equilateral Triangle with Pivot at one Vertex
oment of nertia of an Equilateral Triangle with Pivot at one Vertex There are two wa (at leat) to derive the expreion f an equilateral triangle that i rotated about one vertex, and ll how ou both here.
More informationTHE SPLITTING SUBSPACE CONJECTURE
THE SPLITTING SUBSPAE ONJETURE ERI HEN AND DENNIS TSENG Abtract We anwer a uetion by Niederreiter concerning the enumeration of a cla of ubpace of finite dimenional vector pace over finite field by proving
More information(b) Is the game below solvable by iterated strict dominance? Does it have a unique Nash equilibrium?
14.1 Final Exam Anwer all quetion. You have 3 hour in which to complete the exam. 1. (60 Minute 40 Point) Anwer each of the following ubquetion briefly. Pleae how your calculation and provide rough explanation
More informationList coloring hypergraphs
Lit coloring hypergraph Penny Haxell Jacque Vertraete Department of Combinatoric and Optimization Univerity of Waterloo Waterloo, Ontario, Canada pehaxell@uwaterloo.ca Department of Mathematic Univerity
More informationDesign By Emulation (Indirect Method)
Deign By Emulation (Indirect Method he baic trategy here i, that Given a continuou tranfer function, it i required to find the bet dicrete equivalent uch that the ignal produced by paing an input ignal
More informationRegression. What is regression? Linear Regression. Cal State Northridge Ψ320 Andrew Ainsworth PhD
Regreion Cal State Northridge Ψ30 Andrew Ainworth PhD What i regreion? How do we predict one variable from another? How doe one variable change a the other change? Caue and effect Linear Regreion A technique
More informationNotes on Phase Space Fall 2007, Physics 233B, Hitoshi Murayama
Note on Phae Space Fall 007, Phyic 33B, Hitohi Murayama Two-Body Phae Space The two-body phae i the bai of computing higher body phae pace. We compute it in the ret frame of the two-body ytem, P p + p
More informationLINEAR ALGEBRA METHOD IN COMBINATORICS. Theorem 1.1 (Oddtown theorem). In a town of n citizens, no more than n clubs can be formed under the rules
LINEAR ALGEBRA METHOD IN COMBINATORICS 1 Warming-up example Theorem 11 (Oddtown theorem) In a town of n citizen, no more tha club can be formed under the rule each club have an odd number of member each
More informationMarch 18, 2014 Academic Year 2013/14
POLITONG - SHANGHAI BASIC AUTOMATIC CONTROL Exam grade March 8, 4 Academic Year 3/4 NAME (Pinyin/Italian)... STUDENT ID Ue only thee page (including the back) for anwer. Do not ue additional heet. Ue of
More informationEigenvalues and eigenvectors
Eigenvalue and eigenvector Defining and computing uggeted problem olution For each matri give below, find eigenvalue and eigenvector. Give a bai and the dimenion of the eigenpace for each eigenvalue. P:
More informationCorrection for Simple System Example and Notes on Laplace Transforms / Deviation Variables ECHE 550 Fall 2002
Correction for Simple Sytem Example and Note on Laplace Tranform / Deviation Variable ECHE 55 Fall 22 Conider a tank draining from an initial height of h o at time t =. With no flow into the tank (F in
More informationComputers and Mathematics with Applications. Sharp algebraic periodicity conditions for linear higher order
Computer and Mathematic with Application 64 (2012) 2262 2274 Content lit available at SciVere ScienceDirect Computer and Mathematic with Application journal homepage: wwweleviercom/locate/camwa Sharp algebraic
More informationDigital Control System
Digital Control Sytem Summary # he -tranform play an important role in digital control and dicrete ignal proceing. he -tranform i defined a F () f(k) k () A. Example Conider the following equence: f(k)
More informationInference for Two Stage Cluster Sampling: Equal SSU per PSU. Projections of SSU Random Variables on Each SSU selection.
Inference for Two Stage Cluter Sampling: Equal SSU per PSU Projection of SSU andom Variable on Eac SSU election By Ed Stanek Introduction We review etimating equation for PSU mean in a two tage cluter
More informationDepartment of Mechanical Engineering Massachusetts Institute of Technology Modeling, Dynamics and Control III Spring 2002
Department of Mechanical Engineering Maachuett Intitute of Technology 2.010 Modeling, Dynamic and Control III Spring 2002 SOLUTIONS: Problem Set # 10 Problem 1 Etimating tranfer function from Bode Plot.
More informationMAP METHODS FOR MACHINE LEARNING. Mark A. Kon, Boston University Leszek Plaskota, Warsaw University, Warsaw Andrzej Przybyszewski, McGill University
MAP METHODS FOR MACHINE LEARNING Mark A. Kon, Boston University Leszek Plaskota, Warsaw University, Warsaw Andrzej Przybyszewski, McGill University Example: Control System 1. Paradigm: Machine learning
More informationAn Inequality for Nonnegative Matrices and the Inverse Eigenvalue Problem
An Inequality for Nonnegative Matrice and the Invere Eigenvalue Problem Robert Ream Program in Mathematical Science The Univerity of Texa at Dalla Box 83688, Richardon, Texa 7583-688 Abtract We preent
More informationLecture 10 Filtering: Applied Concepts
Lecture Filtering: Applied Concept In the previou two lecture, you have learned about finite-impule-repone (FIR) and infinite-impule-repone (IIR) filter. In thee lecture, we introduced the concept of filtering
More informationinto a discrete time function. Recall that the table of Laplace/z-transforms is constructed by (i) selecting to get
Lecture 25 Introduction to Some Matlab c2d Code in Relation to Sampled Sytem here are many way to convert a continuou time function, { h( t) ; t [0, )} into a dicrete time function { h ( k) ; k {0,,, }}
More informationNAME (pinyin/italian)... MATRICULATION NUMBER... SIGNATURE
POLITONG SHANGHAI BASIC AUTOMATIC CONTROL June Academic Year / Exam grade NAME (pinyin/italian)... MATRICULATION NUMBER... SIGNATURE Ue only thee page (including the bac) for anwer. Do not ue additional
More informationSampling and the Discrete Fourier Transform
Sampling and the Dicrete Fourier Tranform Sampling Method Sampling i mot commonly done with two device, the ample-and-hold (S/H) and the analog-to-digital-converter (ADC) The S/H acquire a CT ignal at
More informationNCAAPMT Calculus Challenge Challenge #3 Due: October 26, 2011
NCAAPMT Calculu Challenge 011 01 Challenge #3 Due: October 6, 011 A Model of Traffic Flow Everyone ha at ome time been on a multi-lane highway and encountered road contruction that required the traffic
More informationSMALL-SIGNAL STABILITY ASSESSMENT OF THE EUROPEAN POWER SYSTEM BASED ON ADVANCED NEURAL NETWORK METHOD
SMALL-SIGNAL STABILITY ASSESSMENT OF THE EUROPEAN POWER SYSTEM BASED ON ADVANCED NEURAL NETWORK METHOD S.P. Teeuwen, I. Erlich U. Bachmann Univerity of Duiburg, Germany Department of Electrical Power Sytem
More informationMath Skills. Scientific Notation. Uncertainty in Measurements. Appendix A5 SKILLS HANDBOOK
ppendix 5 Scientific Notation It i difficult to work with very large or very mall number when they are written in common decimal notation. Uually it i poible to accommodate uch number by changing the SI
More information1 Routh Array: 15 points
EE C28 / ME34 Problem Set 3 Solution Fall 2 Routh Array: 5 point Conider the ytem below, with D() k(+), w(t), G() +2, and H y() 2 ++2 2(+). Find the cloed loop tranfer function Y () R(), and range of k
More informationChapter 13. Root Locus Introduction
Chapter 13 Root Locu 13.1 Introduction In the previou chapter we had a glimpe of controller deign iue through ome imple example. Obviouly when we have higher order ytem, uch imple deign technique will
More informationSingular perturbation theory
Singular perturbation theory Marc R. Rouel June 21, 2004 1 Introduction When we apply the teady-tate approximation (SSA) in chemical kinetic, we typically argue that ome of the intermediate are highly
More informationStatistics and Data Analysis
Simulation of Propenity Scoring Method Dee H. Wu, Ph.D, David M. Thompon, Ph.D., David Bard, Ph.D. Univerity of Oklahoma Health Science Center, Oklahoma City, OK ABSTRACT In certain clinical trial or obervational
More informationCumulative Review of Calculus
Cumulative Review of Calculu. Uing the limit definition of the lope of a tangent, determine the lope of the tangent to each curve at the given point. a. f 5,, 5 f,, f, f 5,,,. The poition, in metre, of
More informationOptimal Coordination of Samples in Business Surveys
Paper preented at the ICES-III, June 8-, 007, Montreal, Quebec, Canada Optimal Coordination of Sample in Buine Survey enka Mach, Ioana Şchiopu-Kratina, Philip T Rei, Jean-Marc Fillion Statitic Canada New
More informationThe continuous time random walk (CTRW) was introduced by Montroll and Weiss 1.
1 I. CONTINUOUS TIME RANDOM WALK The continuou time random walk (CTRW) wa introduced by Montroll and Wei 1. Unlike dicrete time random walk treated o far, in the CTRW the number of jump n made by the walker
More informationElectronic Theses and Dissertations
Eat Tenneee State Univerity Digital Common @ Eat Tenneee State Univerity Electronic Thee and Diertation Student Work 5-208 Vector Partition Jennifer French Eat Tenneee State Univerity Follow thi and additional
More informationStatistical machine learning and kernel methods. Primary references: John Shawe-Taylor and Nello Cristianini, Kernel Methods for Pattern Analysis
Part 5 (MA 751) Statistical machine learning and kernel methods Primary references: John Shawe-Taylor and Nello Cristianini, Kernel Methods for Pattern Analysis Christopher Burges, A tutorial on support
More informationEE Control Systems LECTURE 14
Updated: Tueday, March 3, 999 EE 434 - Control Sytem LECTURE 4 Copyright FL Lewi 999 All right reerved ROOT LOCUS DESIGN TECHNIQUE Suppoe the cloed-loop tranfer function depend on a deign parameter k We
More informationAP Physics Charge Wrap up
AP Phyic Charge Wrap up Quite a few complicated euation for you to play with in thi unit. Here them babie i: F 1 4 0 1 r Thi i good old Coulomb law. You ue it to calculate the force exerted 1 by two charge
More informationSymmetry Lecture 9. 1 Gellmann-Nishijima relation
Symmetry Lecture 9 1 Gellmann-Nihijima relation In the lat lecture we found that the Gell-mann and Nihijima relation related Baryon number, charge, and the third component of iopin. Q = [(1/2)B + T 3 ]
More informationON THE APPROXIMATION ERROR IN HIGH DIMENSIONAL MODEL REPRESENTATION. Xiaoqun Wang
Proceeding of the 2008 Winter Simulation Conference S. J. Maon, R. R. Hill, L. Mönch, O. Roe, T. Jefferon, J. W. Fowler ed. ON THE APPROXIMATION ERROR IN HIGH DIMENSIONAL MODEL REPRESENTATION Xiaoqun Wang
More informationOne Class of Splitting Iterative Schemes
One Cla of Splitting Iterative Scheme v Ciegi and V. Pakalnytė Vilniu Gedimina Technical Univerity Saulėtekio al. 11, 2054, Vilniu, Lithuania rc@fm.vtu.lt Abtract. Thi paper deal with the tability analyi
More informationConvex Hulls of Curves Sam Burton
Convex Hull of Curve Sam Burton 1 Introduction Thi paper will primarily be concerned with determining the face of convex hull of curve of the form C = {(t, t a, t b ) t [ 1, 1]}, a < b N in R 3. We hall
More informationCHAPTER 4 DESIGN OF STATE FEEDBACK CONTROLLERS AND STATE OBSERVERS USING REDUCED ORDER MODEL
98 CHAPTER DESIGN OF STATE FEEDBACK CONTROLLERS AND STATE OBSERVERS USING REDUCED ORDER MODEL INTRODUCTION The deign of ytem uing tate pace model for the deign i called a modern control deign and it i
More informationPhysics 741 Graduate Quantum Mechanics 1 Solutions to Final Exam, Fall 2014
Phyic 7 Graduate Quantum Mechanic Solution to inal Eam all 0 Each quetion i worth 5 point with point for each part marked eparately Some poibly ueful formula appear at the end of the tet In four dimenion
More informationRoot Locus Diagram. Root loci: The portion of root locus when k assume positive values: that is 0
Objective Root Locu Diagram Upon completion of thi chapter you will be able to: Plot the Root Locu for a given Tranfer Function by varying gain of the ytem, Analye the tability of the ytem from the root
More informationPythagorean Triple Updated 08--5 Drlnoordzij@leennoordzijnl wwwleennoordzijme Content A Roadmap for generating Pythagorean Triple Pythagorean Triple 3 Dicuion Concluion 5 A Roadmap for generating Pythagorean
More informationFUNDAMENTALS OF POWER SYSTEMS
1 FUNDAMENTALS OF POWER SYSTEMS 1 Chapter FUNDAMENTALS OF POWER SYSTEMS INTRODUCTION The three baic element of electrical engineering are reitor, inductor and capacitor. The reitor conume ohmic or diipative
More informationAssessing the Discriminatory Power of Credit Scores under Censoring
Aeing the Dicriminatory Power of Credit Score under Cenoring Holger Kraft, Gerald Kroiandt, Marlene Müller Fraunhofer Intitut für Techno- und Wirtchaftmathematik (ITWM) Thi verion: Augut 27, 2003 Abtract:
More informationTUTORIAL PROBLEMS 1 - SOLUTIONS RATIONAL CHEREDNIK ALGEBRAS
TUTORIAL PROBLEMS 1 - SOLUTIONS RATIONAL CHEREDNIK ALGEBRAS ALGEBRAIC LIE THEORY AND REPRESENTATION THEORY, GLASGOW 014 (-1) Let A be an algebra with a filtration 0 = F 1 A F 0 A F 1 A... uch that a) F
More informationNotes on the geometry of curves, Math 210 John Wood
Baic definition Note on the geometry of curve, Math 0 John Wood Let f(t be a vector-valued function of a calar We indicate thi by writing f : R R 3 and think of f(t a the poition in pace of a particle
More informationonline learning Unit Workbook 4 RLC Transients
online learning Pearon BTC Higher National in lectrical and lectronic ngineering (QCF) Unit 5: lectrical & lectronic Principle Unit Workbook 4 in a erie of 4 for thi unit Learning Outcome: RLC Tranient
More informationAdvanced Digital Signal Processing. Stationary/nonstationary signals. Time-Frequency Analysis... Some nonstationary signals. Time-Frequency Analysis
Advanced Digital ignal Proceing Prof. Nizamettin AYDIN naydin@yildiz.edu.tr Time-Frequency Analyi http://www.yildiz.edu.tr/~naydin 2 tationary/nontationary ignal Time-Frequency Analyi Fourier Tranform
More informationUSPAS Course on Recirculated and Energy Recovered Linear Accelerators
USPAS Coure on Recirculated and Energy Recovered Linear Accelerator G. A. Krafft and L. Merminga Jefferon Lab I. Bazarov Cornell Lecture 6 7 March 005 Lecture Outline. Invariant Ellipe Generated by a Unimodular
More information