ADVANCED SOFTWARE ENGINEERING

Size: px
Start display at page:

Download "ADVANCED SOFTWARE ENGINEERING"

Transcription

1 ADVANCED SOFTWARE ENGINEERING COMP 3705 Exercise Usage-based Testig ad Reliability Versio Departmet of Computer Ssciece Sada Narayaappa, Aeliese Adrews Versio Departmet of Commuicatio Systems Thomas Theli, Caria Adersso

2 1. Itroductio I this laboratory assigmet you should try to estimate the remaiig umber of faults i a software program based o the umber of faults that has bee foud i operatio. More iformatio about software reliability predictio may be foud i [Wood96], although it should be possible to solve these assigmets without further studies. You will use failure cout reliability models ad models which measure time betwee failure. The secod part of the laboratory, you will implemet a usage model of a program ad compare the test cases derived from a use model with test cases derived with other testig techiques. 2. Learig Objectives The exercise aims at givig a uderstadig of how usage models ca be desiged ad the basics of reliability models i software egieerig. 3. Preparatio Assigmet 1: Read the followig: Chapter i [Burstei03]. Appedix. Slides from the lecture Reliability. Optioal: pp i [Sommerville01] or pp i [Sommerville04]. Assigmet 2: Choose a program you have developed ad tested previously, for example, i aother course. It is importat that you have tested the program before. Recall the mai fuctioality of the program ad: a) if you have the test cases, brig them to the lab sessio. b) if you do ot have the test cases, desig at least 10 test cases usig a method of your choice. Assigmet 3: Desig a usage model o paper for the software program you tested i Assigmet 2. The usage model should cosist of states ad trasitios. Each state should have a ame ad each trasitio should have a label ad a probability value. If the model becomes too complex or too large, you oly have to develop a part of the model. 4. Reliability Goel-Oumoto Goel-Oumoto Subjective estimatio Assigmet 4 (computer): Use the file godata1.txt (load godata1.txt). The data is from a Brazilia Electroic Switchig System, TROPICO R-1500 for 1500 subscribers. Assigmet 5 (computer): Plot the cumulative umber of faults that has bee foud for every wee (e.g. for wee 3, plot the sum of the faults that has bee foud i wee 1, 2, ad 3). Which type of tred ca you idetify? 2

3 Assigmet 6: Imagie that you are resposible for the product. Estimate subjectively how may failures will be foud i the future. More specifically, estimate the followig: N future : the total umber of failures that will be foud i a period of time that is 50% loger tha the time that has bee plotted. (That is, the failures i the data set that you have plotted should be icluded i this figure). N tot : the total umber of umber of failures that will have bee foud after a ifiite period of time (icludig the failures i the data set you have plotted). Fill i the table i Sectio 6. Goal-Oumoto Estimatio The Goel-Oumoto model says that the expected umber of faults foud at time t could be described by mt () a( 1 e bt ), see Appedix A. The model is based o a o-homogeous poisso process. It assumes that the distributio of the umber of faults foud at time t is poisso with mea value m(t). Assigmet 7: Plot m(t) with pe ad paper or with Matlab. Assigmet 8: Give iterpretatios of a ad b. Assigmet 9 (computer): Use the file go.m This is a Matlab file which ca be used to estimate a ad b i the Goel-Oumoto model. The commad should be used i the followig way: load godata1.txt [a b] go(godata1(:,2)), where data(:,2) is a colum vector with the umber of failures foud i every time period (of equal legth), e.g. [ ]. The estimatio is doe as a Maximum lielihood estimatio, see Appedix A. Assigmet 10 (computer): Estimate a ad b with the Matlab commad. Assigmet 11: Estimate N future ad N tot based o the Goel-Oumoto model. Fill i the table i Sectio 6. Goal-Oumoto Real data Assigmet 12 (computer): Use the data file godata2.txt. The data set you received the last time was a trucated versio of this data. That is, this data set cotais more data poits ad it is ow possible to compare the estimates to real data. 3

4 Assigmet 13: Determie 1 the real values of N future ad N tot. Fill i the table i Sectio Reliability Jelisi-Morada Jelisi-Morada Subjective estimatio Assigmet 14 (computer): Use the file jmdata1.txt. Assigmet 15: Imagie that you are resposible for the product. Estimate subjectively how may failures will be foud i the future. More specifically, estimate the followig: N future : the total umber of failures that will be foud i a period of time that is 50% loger tha the time that has bee plotted. (That is, the failures i the data set that you have plotted should be icluded i this figure). N tot : the total umber of umber of failures that will have bee foud after a ifiite period time (icludig the failures i the data set you have plotted). Fill i the table i Sectio 6. Jelisi-Morada Estimatio The Jelisi-Morada model says that the failure itesity after the (i-1):th failure has occurred could be described by λ i φ( N ( i 1) ), see Appedix B. A assumptio of the model is that times betwee failures are idepedetly expoetially distributed. Assigmet 16: Plot λ i with pe ad paper or with Matlab. Assigmet 17: Give iterpretatios of N ad φ. Assigmet 18 (computer): Use the file jm.m This is a Matlab file which ca be used to estimate N ad φ i the Jelisi-Morada model. The commad should be used i the followig way: load jmdata1.txt [N φ ] jm(jmdata1(:,2) ), where data(:,2) is a colum vector with the times betwee failures (executio time i secods), e.g. [ ]. The estimatio is doe as a Maximum lielihood estimatio, see Appedix B. Assigmet 19 (computer): Estimate N ad φ with the Matlab commad. 1. It is ot really possible to decide N tot (why?), but you ca estimate it. 4

5 Assigmet 20: Estimate N future ad N tot based o the Jelisi-Morada model. Fill i the table i Sectio 6. Jelisi-Morada Real data Assigmet 21 (computer): Use the data file jmdata2.txt. The data set you received the last time was a trucated versio of this data. That is, this data set cotais more data poits ad it is ow possible to compare the estimates to real data. Determie the real values of N future ad N tot. Fill i the table i Sectio Estimatio tables N future N tot Subjective estimatio GO estimatio Actual values N future N tot Subjective estimatio JM estimatio Actual values 7. Report The purpose of the report is to dicuss the result of the exercise ad related topics. Write the ame of exercise, your ames, group umber ad addresses o the first page of the report. The size of the report should be 4-5 A4 pages (icludig the first page). 1. I the first part of the report (1-2 A4-pages), discuss the results of the reliability ad the usage modellig. Discuss the assigmets ad: Reliability: Decide which method that was best i this case - subjective estimatio or estimatio based o the reliability models. How do you compare the methods? What decisios durig software developmet ca be tae based o the estimatio results? Compare ad discuss the Goal-Oumoto model with the Jelisi-Morada model. What are the problems of usig these id of models? 2. I additio, the discuss the followig related topics i the report (1-2 A4 pages): [Burstei03, chapter 12, pages ] Exercise 2. [Burstei03, chapter 12, pages ] Exercise 6. [Burstei03, chapter 12, pages ] Exercise 8. 5

6 8. Appedix Appedix A: The Goel-Oumoto model Nohomogeeous Poisso process models have over the years bee successfully used i studyig hardware reliability problems, ad durig the last decades the applicatio of NHPP models to software reliability aalysis has also bee implemeted. The cumulative umber of software failures up to time t, N(t), ca be described by a NHPP ad may existig software reliability models belog to this class. N(t), modelled by NHPP, follows a Poisso distributio with parameter m(t), that is, the probability that N(t) is a give iteger is expressed by [ mt ()] P{ N() t } e mt (),! 012,,, where m(t) is called the mea value fuctio ad describes the expected cumulative umber of failures i the iterval from 0 to time t. Usually, m(t) cotais some uow parameters. The estimatio of them is geerally carried out by usig the method of maximum lielihood or the method of least squares [Xie91]. If you deote by i the umber of faults detected i time iterval betwee s i-1 ad s i, where 0 s 0 < s 1 < s 2 <...< s ad s i, i 0, are the ruig times sice the software testig begis, the lielihood fuctio for the NHPP model with mea value m(t) is the followig L ( 1, 2,, ) [ ms ( i ) ms ( i 1 )] i exp( { ms ( i ) ms ( i 1 )}) i! Usually, umerical methods have to be used i solvig the lielihood equatios. The geeral assumptios of the Goel-Oumoto model are 1. The cumulative umber of faults detected at time t follows a Poisso distributio. 2. All faults are idepedet ad have the same chace of beig detected. 3. All detected faults are removed immediately ad o ew faults are itroduced. The Goel-Oumoto model assumes that the failure process is modelled by a NHPP model, ad says that the expected umber of faults foud at time t could be described by the mea value fuctio mt () a( 1 e bt ) a total umber of faults i the program. b costat of proportioality. 6

7 Isertig the value of mt ( i ) for all i ito the lielihood fuctio for the geeral NHPP model, you get that the lielihood fuctio of the parameters a ad b is L ( 1, 2,, ) ae bs i 1 e bs i i [ ( )] a e bs i 1 e bs i exp ( ) i! Deoted by is the total umber of detected faults, that is i Estimatio of the model parameters a ad b ca be carried out by maximizig the lielihood fuctio. The atural logarithm of this lielihood fuctio is ll l ae bs i 1 e bs i i [ ( )] ae bs i 1 e bs i exp ( ) i! l( i a ) i e bs i 1 + e bs i l( ) ae bs i 1 e bs i ( ) l(! ) i By taig the partial derivatives of the log-lielihood fuctio with respect to a ad b ad equatig them to zero, that is ll a ll b you get two equatios for solvig a ad b. The partial derivatios are as follows ll a -- 1 e bs ( ) a ll s i e bs i s i 1 e bs i b i e bs i 1 e bs as e bs i 7

8 The estimate of a may the be foud as a e bs ad after isertig this expressios ito the secod of the partial derivatios above, the estimate of b ca be calculated by solvig the followig s i e bs i s i 1 e bs i 1 ( ) s e bs i e bs i 1 e bs 0 e bs i 1 Appedix B: The Jelisi-Morada model Time betwee failure models cocetrate o, as the ame idicates, modellig the times betwee occurred failures. The first developed time betwee failure model was the Jelisi- Morada model, which it is assumed that the times betwee failures are idepedetly expoetially distributed. This meas that, if X i deotes the time betwee the (i-1):th ad i:th failure, the probability desity fuctio of X i is defied as i equatio 1. f Xi () t λ i e λ i t (1) Where λ i is the failure itesity after the (i-1):th failure has occurred (ad before the i:th failure has occurred). I the Jelisi-Morada model, remaiig umber of failures ad is derived as i equatio 2. λ i is assumed to be a fuctio of the λ i φ( N ( i 1) ) (2) Where N is the iitial umber of faults i the program ad φ is a costat. The parameters i the model ca be iterpreted as follows. Let N be the iitial umber of faults i the program ad φ is a costat represetig the per fault failure itesity. The above formulas are together a model of the behaviour of the software with respect to failures. It is ot exactly represetig the real behaviour, merely a simplificatio of the real behaviour. To be able to use this model, for example for predictio, N ad φ must be estimated from the measured data. It is possible to mae a maximum lielihood estimate of the 8

9 parameters. The lielihood fuctio that ca be used to estimate N ad 3. φ is foud i equatio Lt ( 1, t ; N, φ) f Xi ( t i ) φ( N ( i 1) )e φ( N ( i 1) ) t i (3) Where t i is the measured values of X i, i.e. the measured times betwee failures, ad is the umber of measured times. By taig the atural logarithm of the lielihood fuctio ad simplifyig we obtai equatio 4. ll lφ + l( N i + 1 ) φ ( N i+ 1)t i (4) This fuctio should be maximized with respect to N ad φ. To do this the first derivative with respect to N ad φ ca be tae. The Nˆ ad φˆ, which satisfy that both the derivatives equals 0, are the estimates we are looig for. φ (5) ( N i+ 1)t i ( N i + 1) t i (6) ( N i + 1)t i After the Jelisi-Morada model was published a umber of differet variatios of the model have bee suggested. Examples are: Failures do ot have to be corrected util a major failure has occurred. The failure itesity does ot have to be costat betwee to successive failures. Oe proposal i the literature is to itroduce a icreasig failure rate (IFR) derived as λ i φ( N ( i 1) )t, where t is the time elapsed sice the last failure occurred. A variat of the Jelisi-Morada model, which accouts for the probability of imperfect debuggig, i.e. the probability that a fault is ot removed i a repair activity has bee developed. With this model the failure itesity ca be expressed as λ i φ( N p( i 1) ), where p is the probability of imperfect debuggig. 9

10 9. Refereces [Burstei03] Burstei, I., Practical Software Testig A Process-Orieted Approach, Spriger-Verlag, [Sommerville01] Sommerville, I. Software Egieerig, 6th editio, Addiso-Wesley, [Sommerville04] Sommerville, I. Software Egieerig, 7th editio, Addiso-Wesley, [Wood96] A. Wood, Predictig Software Reliability IEEE Computer, pp , Nov.,

Math 155 (Lecture 3)

Math 155 (Lecture 3) Math 55 (Lecture 3) September 8, I this lecture, we ll cosider the aswer to oe of the most basic coutig problems i combiatorics Questio How may ways are there to choose a -elemet subset of the set {,,,

More information

Summary: CORRELATION & LINEAR REGRESSION. GC. Students are advised to refer to lecture notes for the GC operations to obtain scatter diagram.

Summary: CORRELATION & LINEAR REGRESSION. GC. Students are advised to refer to lecture notes for the GC operations to obtain scatter diagram. Key Cocepts: 1) Sketchig of scatter diagram The scatter diagram of bivariate (i.e. cotaiig two variables) data ca be easily obtaied usig GC. Studets are advised to refer to lecture otes for the GC operatios

More information

Lecture 6 Chi Square Distribution (χ 2 ) and Least Squares Fitting

Lecture 6 Chi Square Distribution (χ 2 ) and Least Squares Fitting Lecture 6 Chi Square Distributio (χ ) ad Least Squares Fittig Chi Square Distributio (χ ) Suppose: We have a set of measuremets {x 1, x, x }. We kow the true value of each x i (x t1, x t, x t ). We would

More information

Reliability and Queueing

Reliability and Queueing Copyright 999 Uiversity of Califoria Reliability ad Queueig by David G. Messerschmitt Supplemetary sectio for Uderstadig Networked Applicatios: A First Course, Morga Kaufma, 999. Copyright otice: Permissio

More information

Math 2784 (or 2794W) University of Connecticut

Math 2784 (or 2794W) University of Connecticut ORDERS OF GROWTH PAT SMITH Math 2784 (or 2794W) Uiversity of Coecticut Date: Mar. 2, 22. ORDERS OF GROWTH. Itroductio Gaiig a ituitive feel for the relative growth of fuctios is importat if you really

More information

ECE 8527: Introduction to Machine Learning and Pattern Recognition Midterm # 1. Vaishali Amin Fall, 2015

ECE 8527: Introduction to Machine Learning and Pattern Recognition Midterm # 1. Vaishali Amin Fall, 2015 ECE 8527: Itroductio to Machie Learig ad Patter Recogitio Midterm # 1 Vaishali Ami Fall, 2015 tue39624@temple.edu Problem No. 1: Cosider a two-class discrete distributio problem: ω 1 :{[0,0], [2,0], [2,2],

More information

Lecture 6 Chi Square Distribution (χ 2 ) and Least Squares Fitting

Lecture 6 Chi Square Distribution (χ 2 ) and Least Squares Fitting Lecture 6 Chi Square Distributio (χ ) ad Least Squares Fittig Chi Square Distributio (χ ) Suppose: We have a set of measuremets {x 1, x, x }. We kow the true value of each x i (x t1, x t, x t ). We would

More information

NEW FAST CONVERGENT SEQUENCES OF EULER-MASCHERONI TYPE

NEW FAST CONVERGENT SEQUENCES OF EULER-MASCHERONI TYPE UPB Sci Bull, Series A, Vol 79, Iss, 207 ISSN 22-7027 NEW FAST CONVERGENT SEQUENCES OF EULER-MASCHERONI TYPE Gabriel Bercu We itroduce two ew sequeces of Euler-Mascheroi type which have fast covergece

More information

SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES

SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES Read Sectio 1.5 (pages 5 9) Overview I Sectio 1.5 we lear to work with summatio otatio ad formulas. We will also itroduce a brief overview of sequeces,

More information

Kinetics of Complex Reactions

Kinetics of Complex Reactions Kietics of Complex Reactios by Flick Colema Departmet of Chemistry Wellesley College Wellesley MA 28 wcolema@wellesley.edu Copyright Flick Colema 996. All rights reserved. You are welcome to use this documet

More information

An Introduction to Randomized Algorithms

An Introduction to Randomized Algorithms A Itroductio to Radomized Algorithms The focus of this lecture is to study a radomized algorithm for quick sort, aalyze it usig probabilistic recurrece relatios, ad also provide more geeral tools for aalysis

More information

Element sampling: Part 2

Element sampling: Part 2 Chapter 4 Elemet samplig: Part 2 4.1 Itroductio We ow cosider uequal probability samplig desigs which is very popular i practice. I the uequal probability samplig, we ca improve the efficiecy of the resultig

More information

Sequences. Notation. Convergence of a Sequence

Sequences. Notation. Convergence of a Sequence Sequeces A sequece is essetially just a list. Defiitio (Sequece of Real Numbers). A sequece of real umbers is a fuctio Z (, ) R for some real umber. Do t let the descriptio of the domai cofuse you; it

More information

Ma 530 Introduction to Power Series

Ma 530 Introduction to Power Series Ma 530 Itroductio to Power Series Please ote that there is material o power series at Visual Calculus. Some of this material was used as part of the presetatio of the topics that follow. What is a Power

More information

Keywords- Software Reliability, SRGMs, Non Homogeneous Poisson Process, Calendar time, Execution time. Fig 1. Types of Software Reliability Models

Keywords- Software Reliability, SRGMs, Non Homogeneous Poisson Process, Calendar time, Execution time. Fig 1. Types of Software Reliability Models Volume 4, Issue 4, April 2014 ISSN: 2277 128X Iteratioal Joural of Advaced Research i Computer Sciece ad Software Egieerig Research Paper Available olie at: www.ijarcsse.com A Study of Various Reliability

More information

A New Method to Order Functions by Asymptotic Growth Rates Charlie Obimbo Dept. of Computing and Information Science University of Guelph

A New Method to Order Functions by Asymptotic Growth Rates Charlie Obimbo Dept. of Computing and Information Science University of Guelph A New Method to Order Fuctios by Asymptotic Growth Rates Charlie Obimbo Dept. of Computig ad Iformatio Sciece Uiversity of Guelph ABSTRACT A ew method is described to determie the complexity classes of

More information

Holistic Approach to the Periodic System of Elements

Holistic Approach to the Periodic System of Elements Holistic Approach to the Periodic System of Elemets N.N.Truov * D.I.Medeleyev Istitute for Metrology Russia, St.Peterburg. 190005 Moskovsky pr. 19 (Dated: February 20, 2009) Abstract: For studyig the objectivity

More information

Statistical Intervals for a Single Sample

Statistical Intervals for a Single Sample 3/5/06 Applied Statistics ad Probability for Egieers Sixth Editio Douglas C. Motgomery George C. Ruger Chapter 8 Statistical Itervals for a Sigle Sample 8 CHAPTER OUTLINE 8- Cofidece Iterval o the Mea

More information

Randomized Algorithms I, Spring 2018, Department of Computer Science, University of Helsinki Homework 1: Solutions (Discussed January 25, 2018)

Randomized Algorithms I, Spring 2018, Department of Computer Science, University of Helsinki Homework 1: Solutions (Discussed January 25, 2018) Radomized Algorithms I, Sprig 08, Departmet of Computer Sciece, Uiversity of Helsiki Homework : Solutios Discussed Jauary 5, 08). Exercise.: Cosider the followig balls-ad-bi game. We start with oe black

More information

CEE 522 Autumn Uncertainty Concepts for Geotechnical Engineering

CEE 522 Autumn Uncertainty Concepts for Geotechnical Engineering CEE 5 Autum 005 Ucertaity Cocepts for Geotechical Egieerig Basic Termiology Set A set is a collectio of (mutually exclusive) objects or evets. The sample space is the (collectively exhaustive) collectio

More information

MATH 320: Probability and Statistics 9. Estimation and Testing of Parameters. Readings: Pruim, Chapter 4

MATH 320: Probability and Statistics 9. Estimation and Testing of Parameters. Readings: Pruim, Chapter 4 MATH 30: Probability ad Statistics 9. Estimatio ad Testig of Parameters Estimatio ad Testig of Parameters We have bee dealig situatios i which we have full kowledge of the distributio of a radom variable.

More information

REGRESSION (Physics 1210 Notes, Partial Modified Appendix A)

REGRESSION (Physics 1210 Notes, Partial Modified Appendix A) REGRESSION (Physics 0 Notes, Partial Modified Appedix A) HOW TO PERFORM A LINEAR REGRESSION Cosider the followig data poits ad their graph (Table I ad Figure ): X Y 0 3 5 3 7 4 9 5 Table : Example Data

More information

Statistical Inference (Chapter 10) Statistical inference = learn about a population based on the information provided by a sample.

Statistical Inference (Chapter 10) Statistical inference = learn about a population based on the information provided by a sample. Statistical Iferece (Chapter 10) Statistical iferece = lear about a populatio based o the iformatio provided by a sample. Populatio: The set of all values of a radom variable X of iterest. Characterized

More information

Properties and Hypothesis Testing

Properties and Hypothesis Testing Chapter 3 Properties ad Hypothesis Testig 3.1 Types of data The regressio techiques developed i previous chapters ca be applied to three differet kids of data. 1. Cross-sectioal data. 2. Time series data.

More information

NICK DUFRESNE. 1 1 p(x). To determine some formulas for the generating function of the Schröder numbers, r(x) = a(x) =

NICK DUFRESNE. 1 1 p(x). To determine some formulas for the generating function of the Schröder numbers, r(x) = a(x) = AN INTRODUCTION TO SCHRÖDER AND UNKNOWN NUMBERS NICK DUFRESNE Abstract. I this article we will itroduce two types of lattice paths, Schröder paths ad Ukow paths. We will examie differet properties of each,

More information

On a Smarandache problem concerning the prime gaps

On a Smarandache problem concerning the prime gaps O a Smaradache problem cocerig the prime gaps Felice Russo Via A. Ifate 7 6705 Avezzao (Aq) Italy felice.russo@katamail.com Abstract I this paper, a problem posed i [] by Smaradache cocerig the prime gaps

More information

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 19 11/17/2008 LAWS OF LARGE NUMBERS II THE STRONG LAW OF LARGE NUMBERS

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 19 11/17/2008 LAWS OF LARGE NUMBERS II THE STRONG LAW OF LARGE NUMBERS MASSACHUSTTS INSTITUT OF TCHNOLOGY 6.436J/5.085J Fall 2008 Lecture 9 /7/2008 LAWS OF LARG NUMBRS II Cotets. The strog law of large umbers 2. The Cheroff boud TH STRONG LAW OF LARG NUMBRS While the weak

More information

Mathematical Modeling of Optimum 3 Step Stress Accelerated Life Testing for Generalized Pareto Distribution

Mathematical Modeling of Optimum 3 Step Stress Accelerated Life Testing for Generalized Pareto Distribution America Joural of Theoretical ad Applied Statistics 05; 4(: 6-69 Published olie May 8, 05 (http://www.sciecepublishiggroup.com/j/ajtas doi: 0.648/j.ajtas.05040. ISSN: 6-8999 (Prit; ISSN: 6-9006 (Olie Mathematical

More information

OPTIMAL ALGORITHMS -- SUPPLEMENTAL NOTES

OPTIMAL ALGORITHMS -- SUPPLEMENTAL NOTES OPTIMAL ALGORITHMS -- SUPPLEMENTAL NOTES Peter M. Maurer Why Hashig is θ(). As i biary search, hashig assumes that keys are stored i a array which is idexed by a iteger. However, hashig attempts to bypass

More information

4.3 Growth Rates of Solutions to Recurrences

4.3 Growth Rates of Solutions to Recurrences 4.3. GROWTH RATES OF SOLUTIONS TO RECURRENCES 81 4.3 Growth Rates of Solutios to Recurreces 4.3.1 Divide ad Coquer Algorithms Oe of the most basic ad powerful algorithmic techiques is divide ad coquer.

More information

Table 12.1: Contingency table. Feature b. 1 N 11 N 12 N 1b 2 N 21 N 22 N 2b. ... a N a1 N a2 N ab

Table 12.1: Contingency table. Feature b. 1 N 11 N 12 N 1b 2 N 21 N 22 N 2b. ... a N a1 N a2 N ab Sectio 12 Tests of idepedece ad homogeeity I this lecture we will cosider a situatio whe our observatios are classified by two differet features ad we would like to test if these features are idepedet

More information

A statistical method to determine sample size to estimate characteristic value of soil parameters

A statistical method to determine sample size to estimate characteristic value of soil parameters A statistical method to determie sample size to estimate characteristic value of soil parameters Y. Hojo, B. Setiawa 2 ad M. Suzuki 3 Abstract Sample size is a importat factor to be cosidered i determiig

More information

A proposed discrete distribution for the statistical modeling of

A proposed discrete distribution for the statistical modeling of It. Statistical Ist.: Proc. 58th World Statistical Cogress, 0, Dubli (Sessio CPS047) p.5059 A proposed discrete distributio for the statistical modelig of Likert data Kidd, Marti Cetre for Statistical

More information

The Poisson Distribution

The Poisson Distribution MATH 382 The Poisso Distributio Dr. Neal, WKU Oe of the importat distributios i probabilistic modelig is the Poisso Process X t that couts the umber of occurreces over a period of t uits of time. This

More information

t distribution [34] : used to test a mean against an hypothesized value (H 0 : µ = µ 0 ) or the difference

t distribution [34] : used to test a mean against an hypothesized value (H 0 : µ = µ 0 ) or the difference EXST30 Backgroud material Page From the textbook The Statistical Sleuth Mea [0]: I your text the word mea deotes a populatio mea (µ) while the work average deotes a sample average ( ). Variace [0]: The

More information

Section 6.4: Series. Section 6.4 Series 413

Section 6.4: Series. Section 6.4 Series 413 ectio 64 eries 4 ectio 64: eries A couple decides to start a college fud for their daughter They pla to ivest $50 i the fud each moth The fud pays 6% aual iterest, compouded mothly How much moey will they

More information

COMPUTING SUMS AND THE AVERAGE VALUE OF THE DIVISOR FUNCTION (x 1) + x = n = n.

COMPUTING SUMS AND THE AVERAGE VALUE OF THE DIVISOR FUNCTION (x 1) + x = n = n. COMPUTING SUMS AND THE AVERAGE VALUE OF THE DIVISOR FUNCTION Abstract. We itroduce a method for computig sums of the form f( where f( is ice. We apply this method to study the average value of d(, where

More information

How to Maximize a Function without Really Trying

How to Maximize a Function without Really Trying How to Maximize a Fuctio without Really Tryig MARK FLANAGAN School of Electrical, Electroic ad Commuicatios Egieerig Uiversity College Dubli We will prove a famous elemetary iequality called The Rearragemet

More information

Expectation and Variance of a random variable

Expectation and Variance of a random variable Chapter 11 Expectatio ad Variace of a radom variable The aim of this lecture is to defie ad itroduce mathematical Expectatio ad variace of a fuctio of discrete & cotiuous radom variables ad the distributio

More information

Recurrence Relations

Recurrence Relations Recurrece Relatios Aalysis of recursive algorithms, such as: it factorial (it ) { if (==0) retur ; else retur ( * factorial(-)); } Let t be the umber of multiplicatios eeded to calculate factorial(). The

More information

Chapter 6 Principles of Data Reduction

Chapter 6 Principles of Data Reduction Chapter 6 for BST 695: Special Topics i Statistical Theory. Kui Zhag, 0 Chapter 6 Priciples of Data Reductio Sectio 6. Itroductio Goal: To summarize or reduce the data X, X,, X to get iformatio about a

More information

is also known as the general term of the sequence

is also known as the general term of the sequence Lesso : Sequeces ad Series Outlie Objectives: I ca determie whether a sequece has a patter. I ca determie whether a sequece ca be geeralized to fid a formula for the geeral term i the sequece. I ca determie

More information

Optimally Sparse SVMs

Optimally Sparse SVMs A. Proof of Lemma 3. We here prove a lower boud o the umber of support vectors to achieve geeralizatio bouds of the form which we cosider. Importatly, this result holds ot oly for liear classifiers, but

More information

ECE 901 Lecture 12: Complexity Regularization and the Squared Loss

ECE 901 Lecture 12: Complexity Regularization and the Squared Loss ECE 90 Lecture : Complexity Regularizatio ad the Squared Loss R. Nowak 5/7/009 I the previous lectures we made use of the Cheroff/Hoeffdig bouds for our aalysis of classifier errors. Hoeffdig s iequality

More information

SRC Technical Note June 17, Tight Thresholds for The Pure Literal Rule. Michael Mitzenmacher. d i g i t a l

SRC Technical Note June 17, Tight Thresholds for The Pure Literal Rule. Michael Mitzenmacher. d i g i t a l SRC Techical Note 1997-011 Jue 17, 1997 Tight Thresholds for The Pure Literal Rule Michael Mitzemacher d i g i t a l Systems Research Ceter 130 Lytto Aveue Palo Alto, Califoria 94301 http://www.research.digital.com/src/

More information

Section 14. Simple linear regression.

Section 14. Simple linear regression. Sectio 14 Simple liear regressio. Let us look at the cigarette dataset from [1] (available to dowload from joural s website) ad []. The cigarette dataset cotais measuremets of tar, icotie, weight ad carbo

More information

Principle Of Superposition

Principle Of Superposition ecture 5: PREIMINRY CONCEP O RUCUR NYI Priciple Of uperpositio Mathematically, the priciple of superpositio is stated as ( a ) G( a ) G( ) G a a or for a liear structural system, the respose at a give

More information

Lecture 1 Probability and Statistics

Lecture 1 Probability and Statistics Wikipedia: Lecture 1 Probability ad Statistics Bejami Disraeli, British statesma ad literary figure (1804 1881): There are three kids of lies: lies, damed lies, ad statistics. popularized i US by Mark

More information

THE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS

THE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS THE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS DEMETRES CHRISTOFIDES Abstract. Cosider a ivertible matrix over some field. The Gauss-Jorda elimiatio reduces this matrix to the idetity

More information

SINGLE-CHANNEL QUEUING PROBLEMS APPROACH

SINGLE-CHANNEL QUEUING PROBLEMS APPROACH SINGLE-CHANNEL QUEUING ROBLEMS AROACH Abdurrzzag TAMTAM, Doctoral Degree rogramme () Dept. of Telecommuicatios, FEEC, BUT E-mail: xtamta@stud.feec.vutbr.cz Supervised by: Dr. Karol Molár ABSTRACT The paper

More information

6.3 Testing Series With Positive Terms

6.3 Testing Series With Positive Terms 6.3. TESTING SERIES WITH POSITIVE TERMS 307 6.3 Testig Series With Positive Terms 6.3. Review of what is kow up to ow I theory, testig a series a i for covergece amouts to fidig the i= sequece of partial

More information

CHAPTER 10 INFINITE SEQUENCES AND SERIES

CHAPTER 10 INFINITE SEQUENCES AND SERIES CHAPTER 10 INFINITE SEQUENCES AND SERIES 10.1 Sequeces 10.2 Ifiite Series 10.3 The Itegral Tests 10.4 Compariso Tests 10.5 The Ratio ad Root Tests 10.6 Alteratig Series: Absolute ad Coditioal Covergece

More information

DISTRIBUTION LAW Okunev I.V.

DISTRIBUTION LAW Okunev I.V. 1 DISTRIBUTION LAW Okuev I.V. Distributio law belogs to a umber of the most complicated theoretical laws of mathematics. But it is also a very importat practical law. Nothig ca help uderstad complicated

More information

Bayesian and E- Bayesian Method of Estimation of Parameter of Rayleigh Distribution- A Bayesian Approach under Linex Loss Function

Bayesian and E- Bayesian Method of Estimation of Parameter of Rayleigh Distribution- A Bayesian Approach under Linex Loss Function Iteratioal Joural of Statistics ad Systems ISSN 973-2675 Volume 12, Number 4 (217), pp. 791-796 Research Idia Publicatios http://www.ripublicatio.com Bayesia ad E- Bayesia Method of Estimatio of Parameter

More information

Recursive Algorithms. Recurrences. Recursive Algorithms Analysis

Recursive Algorithms. Recurrences. Recursive Algorithms Analysis Recursive Algorithms Recurreces Computer Sciece & Egieerig 35: Discrete Mathematics Christopher M Bourke cbourke@cseuledu A recursive algorithm is oe i which objects are defied i terms of other objects

More information

Double Stage Shrinkage Estimator of Two Parameters. Generalized Exponential Distribution

Double Stage Shrinkage Estimator of Two Parameters. Generalized Exponential Distribution Iteratioal Mathematical Forum, Vol., 3, o. 3, 3-53 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/.9/imf.3.335 Double Stage Shrikage Estimator of Two Parameters Geeralized Expoetial Distributio Alaa M.

More information

CS / MCS 401 Homework 3 grader solutions

CS / MCS 401 Homework 3 grader solutions CS / MCS 401 Homework 3 grader solutios assigmet due July 6, 016 writte by Jāis Lazovskis maximum poits: 33 Some questios from CLRS. Questios marked with a asterisk were ot graded. 1 Use the defiitio of

More information

1 Inferential Methods for Correlation and Regression Analysis

1 Inferential Methods for Correlation and Regression Analysis 1 Iferetial Methods for Correlatio ad Regressio Aalysis I the chapter o Correlatio ad Regressio Aalysis tools for describig bivariate cotiuous data were itroduced. The sample Pearso Correlatio Coefficiet

More information

Department of Mathematics

Department of Mathematics Departmet of Mathematics Ma 3/103 KC Border Itroductio to Probability ad Statistics Witer 2017 Lecture 19: Estimatio II Relevat textbook passages: Larse Marx [1]: Sectios 5.2 5.7 19.1 The method of momets

More information

R. van Zyl 1, A.J. van der Merwe 2. Quintiles International, University of the Free State

R. van Zyl 1, A.J. van der Merwe 2. Quintiles International, University of the Free State Bayesia Cotrol Charts for the Two-parameter Expoetial Distributio if the Locatio Parameter Ca Take o Ay Value Betwee Mius Iity ad Plus Iity R. va Zyl, A.J. va der Merwe 2 Quitiles Iteratioal, ruaavz@gmail.com

More information

Recursive Algorithm for Generating Partitions of an Integer. 1 Preliminary

Recursive Algorithm for Generating Partitions of an Integer. 1 Preliminary Recursive Algorithm for Geeratig Partitios of a Iteger Sug-Hyuk Cha Computer Sciece Departmet, Pace Uiversity 1 Pace Plaza, New York, NY 10038 USA scha@pace.edu Abstract. This article first reviews the

More information

Linear Regression Demystified

Linear Regression Demystified Liear Regressio Demystified Liear regressio is a importat subject i statistics. I elemetary statistics courses, formulae related to liear regressio are ofte stated without derivatio. This ote iteds to

More information

Rademacher Complexity

Rademacher Complexity EECS 598: Statistical Learig Theory, Witer 204 Topic 0 Rademacher Complexity Lecturer: Clayto Scott Scribe: Ya Deg, Kevi Moo Disclaimer: These otes have ot bee subjected to the usual scrutiy reserved for

More information

MOMENT-METHOD ESTIMATION BASED ON CENSORED SAMPLE

MOMENT-METHOD ESTIMATION BASED ON CENSORED SAMPLE Vol. 8 o. Joural of Systems Sciece ad Complexity Apr., 5 MOMET-METHOD ESTIMATIO BASED O CESORED SAMPLE I Zhogxi Departmet of Mathematics, East Chia Uiversity of Sciece ad Techology, Shaghai 37, Chia. Email:

More information

The z-transform. 7.1 Introduction. 7.2 The z-transform Derivation of the z-transform: x[n] = z n LTI system, h[n] z = re j

The z-transform. 7.1 Introduction. 7.2 The z-transform Derivation of the z-transform: x[n] = z n LTI system, h[n] z = re j The -Trasform 7. Itroductio Geeralie the complex siusoidal represetatio offered by DTFT to a represetatio of complex expoetial sigals. Obtai more geeral characteristics for discrete-time LTI systems. 7.

More information

8. Applications To Linear Differential Equations

8. Applications To Linear Differential Equations 8. Applicatios To Liear Differetial Equatios 8.. Itroductio 8.. Review Of Results Cocerig Liear Differetial Equatios Of First Ad Secod Orders 8.3. Eercises 8.4. Liear Differetial Equatios Of Order N 8.5.

More information

Bernoulli numbers and the Euler-Maclaurin summation formula

Bernoulli numbers and the Euler-Maclaurin summation formula Physics 6A Witer 006 Beroulli umbers ad the Euler-Maclauri summatio formula I this ote, I shall motivate the origi of the Euler-Maclauri summatio formula. I will also explai why the coefficiets o the right

More information

1.010 Uncertainty in Engineering Fall 2008

1.010 Uncertainty in Engineering Fall 2008 MIT OpeCourseWare http://ocw.mit.edu.00 Ucertaity i Egieerig Fall 2008 For iformatio about citig these materials or our Terms of Use, visit: http://ocw.mit.edu.terms. .00 - Brief Notes # 9 Poit ad Iterval

More information

10. Comparative Tests among Spatial Regression Models. Here we revisit the example in Section 8.1 of estimating the mean of a normal random

10. Comparative Tests among Spatial Regression Models. Here we revisit the example in Section 8.1 of estimating the mean of a normal random Part III. Areal Data Aalysis 0. Comparative Tests amog Spatial Regressio Models While the otio of relative likelihood values for differet models is somewhat difficult to iterpret directly (as metioed above),

More information

6.867 Machine learning, lecture 7 (Jaakkola) 1

6.867 Machine learning, lecture 7 (Jaakkola) 1 6.867 Machie learig, lecture 7 (Jaakkola) 1 Lecture topics: Kerel form of liear regressio Kerels, examples, costructio, properties Liear regressio ad kerels Cosider a slightly simpler model where we omit

More information

MA131 - Analysis 1. Workbook 2 Sequences I

MA131 - Analysis 1. Workbook 2 Sequences I MA3 - Aalysis Workbook 2 Sequeces I Autum 203 Cotets 2 Sequeces I 2. Itroductio.............................. 2.2 Icreasig ad Decreasig Sequeces................ 2 2.3 Bouded Sequeces..........................

More information

Goodness-of-Fit Tests and Categorical Data Analysis (Devore Chapter Fourteen)

Goodness-of-Fit Tests and Categorical Data Analysis (Devore Chapter Fourteen) Goodess-of-Fit Tests ad Categorical Data Aalysis (Devore Chapter Fourtee) MATH-252-01: Probability ad Statistics II Sprig 2019 Cotets 1 Chi-Squared Tests with Kow Probabilities 1 1.1 Chi-Squared Testig................

More information

Chapter 6 Infinite Series

Chapter 6 Infinite Series Chapter 6 Ifiite Series I the previous chapter we cosidered itegrals which were improper i the sese that the iterval of itegratio was ubouded. I this chapter we are goig to discuss a topic which is somewhat

More information

Course Outline. Designing Control Systems. Proportional Controller. Amme 3500 : System Dynamics and Control. Root Locus. Dr. Stefan B.

Course Outline. Designing Control Systems. Proportional Controller. Amme 3500 : System Dynamics and Control. Root Locus. Dr. Stefan B. Amme 3500 : System Dyamics ad Cotrol Root Locus Course Outlie Week Date Cotet Assigmet Notes Mar Itroductio 8 Mar Frequecy Domai Modellig 3 5 Mar Trasiet Performace ad the s-plae 4 Mar Block Diagrams Assig

More information

Scheduling under Uncertainty using MILP Sensitivity Analysis

Scheduling under Uncertainty using MILP Sensitivity Analysis Schedulig uder Ucertaity usig MILP Sesitivity Aalysis M. Ierapetritou ad Zheya Jia Departmet of Chemical & Biochemical Egieerig Rutgers, the State Uiversity of New Jersey Piscataway, NJ Abstract The aim

More information

SEQUENCES AND SERIES

SEQUENCES AND SERIES Sequeces ad 6 Sequeces Ad SEQUENCES AND SERIES Successio of umbers of which oe umber is desigated as the first, other as the secod, aother as the third ad so o gives rise to what is called a sequece. Sequeces

More information

1 Generating functions for balls in boxes

1 Generating functions for balls in boxes Math 566 Fall 05 Some otes o geeratig fuctios Give a sequece a 0, a, a,..., a,..., a geeratig fuctio some way of represetig the sequece as a fuctio. There are may ways to do this, with the most commo ways

More information

Discrete Mathematics and Probability Theory Summer 2014 James Cook Note 15

Discrete Mathematics and Probability Theory Summer 2014 James Cook Note 15 CS 70 Discrete Mathematics ad Probability Theory Summer 2014 James Cook Note 15 Some Importat Distributios I this ote we will itroduce three importat probability distributios that are widely used to model

More information

Discrete-Time Systems, LTI Systems, and Discrete-Time Convolution

Discrete-Time Systems, LTI Systems, and Discrete-Time Convolution EEL5: Discrete-Time Sigals ad Systems. Itroductio I this set of otes, we begi our mathematical treatmet of discrete-time s. As show i Figure, a discrete-time operates or trasforms some iput sequece x [

More information

OPTIMAL PIECEWISE UNIFORM VECTOR QUANTIZATION OF THE MEMORYLESS LAPLACIAN SOURCE

OPTIMAL PIECEWISE UNIFORM VECTOR QUANTIZATION OF THE MEMORYLESS LAPLACIAN SOURCE Joural of ELECTRICAL EGIEERIG, VOL. 56, O. 7-8, 2005, 200 204 OPTIMAL PIECEWISE UIFORM VECTOR QUATIZATIO OF THE MEMORYLESS LAPLACIA SOURCE Zora H. Perić Veljo Lj. Staović Alesadra Z. Jovaović Srdja M.

More information

Information-based Feature Selection

Information-based Feature Selection Iformatio-based Feature Selectio Farza Faria, Abbas Kazeroui, Afshi Babveyh Email: {faria,abbask,afshib}@staford.edu 1 Itroductio Feature selectio is a topic of great iterest i applicatios dealig with

More information

Chapter 4. Fourier Series

Chapter 4. Fourier Series Chapter 4. Fourier Series At this poit we are ready to ow cosider the caoical equatios. Cosider, for eample the heat equatio u t = u, < (4.) subject to u(, ) = si, u(, t) = u(, t) =. (4.) Here,

More information

SNAP Centre Workshop. Basic Algebraic Manipulation

SNAP Centre Workshop. Basic Algebraic Manipulation SNAP Cetre Workshop Basic Algebraic Maipulatio 8 Simplifyig Algebraic Expressios Whe a expressio is writte i the most compact maer possible, it is cosidered to be simplified. Not Simplified: x(x + 4x)

More information

The Riemann Zeta Function

The Riemann Zeta Function Physics 6A Witer 6 The Riema Zeta Fuctio I this ote, I will sketch some of the mai properties of the Riema zeta fuctio, ζ(x). For x >, we defie ζ(x) =, x >. () x = For x, this sum diverges. However, we

More information

Engineering Analysis ( & ) Lec(7) CH 2 Higher Order Linear ODEs

Engineering Analysis ( & ) Lec(7) CH 2 Higher Order Linear ODEs Philadelphia Uiversit/Facult of Egieerig Commuicatio ad Electroics Egieerig Egieerig Aalsis (6500 & 6300) Higher Order Liear ODEs Istructor: Eg. Nada khatib Email: khatib@philadelphia.edu.jo Higher order

More information

Resolution Proofs of Generalized Pigeonhole Principles

Resolution Proofs of Generalized Pigeonhole Principles Resolutio Proofs of Geeralized Pigeohole Priciples Samuel R. Buss Departmet of Mathematics Uiversity of Califoria, Berkeley Győrgy Turá Departmet of Mathematics, Statistics, ad Computer Sciece Uiversity

More information

Linear Regression Models

Linear Regression Models Liear Regressio Models Dr. Joh Mellor-Crummey Departmet of Computer Sciece Rice Uiversity johmc@cs.rice.edu COMP 528 Lecture 9 15 February 2005 Goals for Today Uderstad how to Use scatter diagrams to ispect

More information

Product measures, Tonelli s and Fubini s theorems For use in MAT3400/4400, autumn 2014 Nadia S. Larsen. Version of 13 October 2014.

Product measures, Tonelli s and Fubini s theorems For use in MAT3400/4400, autumn 2014 Nadia S. Larsen. Version of 13 October 2014. Product measures, Toelli s ad Fubii s theorems For use i MAT3400/4400, autum 2014 Nadia S. Larse Versio of 13 October 2014. 1. Costructio of the product measure The purpose of these otes is to preset the

More information

Lecture 1 Probability and Statistics

Lecture 1 Probability and Statistics Wikipedia: Lecture 1 Probability ad Statistics Bejami Disraeli, British statesma ad literary figure (1804 1881): There are three kids of lies: lies, damed lies, ad statistics. popularized i US by Mark

More information

Infinite Sequences and Series

Infinite Sequences and Series Chapter 6 Ifiite Sequeces ad Series 6.1 Ifiite Sequeces 6.1.1 Elemetary Cocepts Simply speakig, a sequece is a ordered list of umbers writte: {a 1, a 2, a 3,...a, a +1,...} where the elemets a i represet

More information

Final Examination Solutions 17/6/2010

Final Examination Solutions 17/6/2010 The Islamic Uiversity of Gaza Faculty of Commerce epartmet of Ecoomics ad Political Scieces A Itroductio to Statistics Course (ECOE 30) Sprig Semester 009-00 Fial Eamiatio Solutios 7/6/00 Name: I: Istructor:

More information

Sequences of Definite Integrals, Factorials and Double Factorials

Sequences of Definite Integrals, Factorials and Double Factorials 47 6 Joural of Iteger Sequeces, Vol. 8 (5), Article 5.4.6 Sequeces of Defiite Itegrals, Factorials ad Double Factorials Thierry Daa-Picard Departmet of Applied Mathematics Jerusalem College of Techology

More information

Estimation for Complete Data

Estimation for Complete Data Estimatio for Complete Data complete data: there is o loss of iformatio durig study. complete idividual complete data= grouped data A complete idividual data is the oe i which the complete iformatio of

More information

Economics 241B Relation to Method of Moments and Maximum Likelihood OLSE as a Maximum Likelihood Estimator

Economics 241B Relation to Method of Moments and Maximum Likelihood OLSE as a Maximum Likelihood Estimator Ecoomics 24B Relatio to Method of Momets ad Maximum Likelihood OLSE as a Maximum Likelihood Estimator Uder Assumptio 5 we have speci ed the distributio of the error, so we ca estimate the model parameters

More information

Linear chord diagrams with long chords

Linear chord diagrams with long chords Liear chord diagrams with log chords Everett Sulliva Departmet of Mathematics Dartmouth College Haover New Hampshire, U.S.A. everett..sulliva@dartmouth.edu Submitted: Feb 7, 2017; Accepted: Oct 7, 2017;

More information

THE KALMAN FILTER RAUL ROJAS

THE KALMAN FILTER RAUL ROJAS THE KALMAN FILTER RAUL ROJAS Abstract. This paper provides a getle itroductio to the Kalma filter, a umerical method that ca be used for sesor fusio or for calculatio of trajectories. First, we cosider

More information

CHAPTER I: Vector Spaces

CHAPTER I: Vector Spaces CHAPTER I: Vector Spaces Sectio 1: Itroductio ad Examples This first chapter is largely a review of topics you probably saw i your liear algebra course. So why cover it? (1) Not everyoe remembers everythig

More information

ECE-S352 Introduction to Digital Signal Processing Lecture 3A Direct Solution of Difference Equations

ECE-S352 Introduction to Digital Signal Processing Lecture 3A Direct Solution of Difference Equations ECE-S352 Itroductio to Digital Sigal Processig Lecture 3A Direct Solutio of Differece Equatios Discrete Time Systems Described by Differece Equatios Uit impulse (sample) respose h() of a DT system allows

More information

2 A bijective proof of Theorem 1 I order to give a bijective proof of Theorem 1, we eed to itroduce the local biary search (LBS) trees, used by Postio

2 A bijective proof of Theorem 1 I order to give a bijective proof of Theorem 1, we eed to itroduce the local biary search (LBS) trees, used by Postio Eumeratig alteratig trees Cedric Chauve 1, Serge Dulucq 2 ad Adrew Rechitzer 2? 1 LaBRI, Uiversit Bordeaux I 31 Cours de la Lib ratio, 3340 Talece, Frace 2 Departmet of Mathematics, The Uiversity of Melboure

More information

Session 5. (1) Principal component analysis and Karhunen-Loève transformation

Session 5. (1) Principal component analysis and Karhunen-Loève transformation 200 Autum semester Patter Iformatio Processig Topic 2 Image compressio by orthogoal trasformatio Sessio 5 () Pricipal compoet aalysis ad Karhue-Loève trasformatio Topic 2 of this course explais the image

More information