An Input Domain-Based Reliability Growth Model and Its Applications in Comparing Software Testing Strategies

Size: px
Start display at page:

Download "An Input Domain-Based Reliability Growth Model and Its Applications in Comparing Software Testing Strategies"

Transcription

1 CENTRE NATIONAL DE LA RECHERCHE SCIENTIFIQUE LABORATOIRE D'ANALYSE ET D'ARCHITECTURE DES SYSTÈMES A Iput Domai-Based Reliability Growth Model ad Its Applicatios i Comparig Software Testig Strategies Yiog Che ad Jea Arlat LAAS REPORT 9505 April 995 LIMITED DISTRIBUTION NOTICE This report has bee submitted for publicatio outside of CNRS. It has bee issued as a Research Report for early peer distributio.

2 A Iput Domai-Based Reliability Growth Model ad Its Applicatios i Comparig Software Testig Strategies Yiog Che * ad Jea Arlat LAAS-CNRS, 7 Aveue du Coloel Roche 3077 Toulouse Cedex - FRANCE Abstract Existig iput domai-based models do ot accout for software growth, because they do ot cosider fault correctios. This paper proposes a iput domai-based growth model with fault correctio history beig take ito accout. Both partitio ad radom testig ca be used to geerate iput cases for test rus. It is geerally cosidered i the model that iput case geeratio, fault detectio ad fault correctio ca all be imperfect. As a applicatio of the proposed iput domai-based growth model, the efficiecy of radom ad partitio testig i terms of growth is studied ad compared aalytically. The impacts o the efficiecy of testig strategies due to the umber of faults i the program, the distributio of fault i the iput domai of the program, as well as the imperfectios of iput case geeratio, fault detectio ad fault correctio are studied. Through sophisticated aalysis we obtai some ew results which explai why ad uder which coditios radom testig has the same efficiecy as, a higher or lower efficiecy tha partitio testig. As a further applicatio of the proposed iput domai-based growth model, the efficiecy of variats of partitio testig are studied ad compared. Keywords software fault model, imperfect fault correctio, software model, testig coverage, compariso betwee testig strategies * O leave from the Departmet of Computer Sciece, Uiversity of the Witwatersrad, Johaesburg. He is curretly a postdoctoral fellow at LAAS-CNRS, Toulouse, uder the Europea Commissio Huma Capital ad Mobility Programme, CaberNet.

3 A Iput Domai-Based Reliability Growth Model ad Its Applicatios i Comparig Testig Strategies Itroductio Software has bee defied as the probability that o failure occurs i a specified eviromet durig a specified (cotiued) exposure period. For some programs the appropriate time uit of exposure period is the caledar or CPU time, ad for some other programs the appropriate time uit of exposure period is a applicatio ru correspodig to a selectio of a iput case (a vector of iput values eeded to make a applicatio ru) from the iput case domai (ICD) of the programs [Musa&87]. For the evaluatio of software there exist differet kids of models. [Ramamoorthy&Bastai82] classifies software models accordig to the developmet phases of software life-cycle, while [Goel85] divides the them accordig to the ature of failure process ito times-betwee-failures models, failure-cout models, fault seedig models, ad iput domai based models, as outlied i Fig.. Sice fault correctios are ecessary i the testig ad debuggig phase of life-cycle, growth models which take fault correctios ito accout are maily used i this phase. The models without dealig with fault correctios, say iput domai models, ca oly be applied i this phase by treatig the program after each correctio as a ew program. Withi the frame of Goel's classificatio, times-betwee-failures models ad failure-cout models belog to growth models. Reliability growth models usually defie the software as the probability R(T) = Prob{o failure withi time period [0, T] } where T is the exposure period whose time uit is the caledar or CPU time. It is usually assumed that R(T) follows certai probability distributio, for example, R(T) = e -z(t), where z(t) is the failure rate fuctio. The mai cocer of these growth models is to estimate the value of the failure rate fuctio z(t). Thus, [Ramamoorthy&Bastai82] classified the growth models ito three types accordig to the strategies evaluatig the failure rate fuctio: discrete chages at correctios of faults, e.g., JM model [Jelisky&Morada72]; cotiuous chages i elapsed time, e.g., [Goel&Okumoto79, Laprie84, Laprie&9, Musa&Okumoto83]; ad icorporatig both discrete chages at correctios of faults ad cotiuous chages i elapsed time [e.g., Littlewood8, Littlewood&Verrall73]. These three types of models are plotted i the bottom left of Fig.. O the other had, iput domai-based models [e.g., MacWilliams73, Brow&Lipow75, Nelso78, Tsoukalas&93, Weiss&Weyuker88], defie software as the probability R(N) = Prob{o failure over N applicatio rus} where N is the exposure period whose time uit is the umber of applicatio rus. Assumig that iput cases are selected idepedetly, the R(N) ca be expressed by R(N) = (R()) N = R N where, R R() is the per applicatio ru, or for short. Sice R(N) ca be simply calculated from R, R becomes the mai objective to be estimated by iput domaibased models.

4 2 A Iput Domai-Based Reliability Growth Model ad Its Applicatios i Comparig Testig Strategies Reliability Models ( evaluatio) [Ramamoorthy Bastai 82] Desig phase ( predicatio) Testig & debuggig phase ( estimatio) Validatio phase ( validatio Operatio phase ( assessmet) [Goel 85] Time-betwee-failures models Failure-cout Models Fault seedig models Iput domai models (without error correctios) Reliability growth models with error correctios R(t) = e -λt λ is to be estimated by testig λ = f(t) R() s f [MacWilliams73] R(t) = R() N R() m Σ ( j= f j s p(cj j )) [Brow&Lipow 75] f(t) λ [Ramamoorthy Bastai 82] [Littlewood 90] Jeliski- Morada t, testig time λ Musa, Goel, Okumoto Laprie, Kaou Tohma, Jacoby λ HE, HPP, NHPP models Littlewood Littlewood-Verrall radom testig Partitio based Iput domai models With error correctios imperfect testig partitio testig PB-SRGM imperfect detectio modified partitio testig imperfect correctio Fig. Classificatios of software models Obviously, the R is related to the applicatio iput profile of the program. However, i the testig phase, the applicatio iput profile may be ukow. I this case, a uiform distributio ca be assumed [Hamlet94] to be the applicatio iput profile. More cocretely, the per test ru ca be defied by the ratio of the umber of test rus i which failures are observed ad the total umber of test rus whe ifiite umber of differet iput cases are applied for test rus: R = F = lim s ( f s) where, s is the total umber of test rus carried out ad f is the umber of test rus i which failures have occurred. F = lim( f s) is called failure rate per applicatio ru, or error size of the program s uder test [Ramamoorthy&Bastai82]. Because of test time limit oly a subset of the etire ICD ca be applied to test the program i practice. Thus the per test ru, R, is usually estimated by ˆR = ˆF = ( f s) I the primary form of iput domai based model [MacWilliams73], the s iput cases are supposed to be selected radomly from ICD. [Brow&Lipow75] suggested a alterative model i which the ICD is supposed to be partitioed ito m classes. If s i iput cases are selected from class C i ad f i failures are observed, the ca be calculated by ( ) i= ˆR = ˆF m = ( f i s i ) P(C i )

5 A Iput Domai-Based Reliability Growth Model ad Its Applicatios i Comparig Testig Strategies 3 where P(C i ) is a probability fuctio reflectig the iput profile i terms of classes. Further extesios are studied i [Nelso78, Tsoukalas&93, Weiss&Weyuker88], where the iput profile is take ito accout by addig differet weights to differet iput cases. However, o iput domai based models so far take the fault correctios ito cosideratio. Thus they are maily used i the validatio phase of software life-cycle, where fault correctios are ot ecessary. I fact, if faults are foud i this phase, the program uder test may be refused by the users. If they are used i the testig ad debuggig phase, a program after ay fault correctio has to be cosidered as a ew program. Fault correctio history is simply igored. I this paper, a iput domai-based growth model, with fault correctio history beig take ito accout, is proposed to evaluate the R. It is assumed that the applicatio iput profile of the programs follows a uiform distributio. Partitio ad radom testig are used to geerate iput cases from ICD. They are geerally assumed to be imperfect, i.e., they caot geerate iput cases uiformly from the etire ICD, ad therefore their fault coverage is reduced. Fault detectio ad correctio are also assumed to be imperfect, that is, the probability to detect ad fix a fault decreases with icreasig umbers of test rus. This copes with the fact that the remaiig faults after a period of testig are more difficult to detect ad to fix tha the earlier faults. Efficiecy of partitio ad radom testig has bee studied ad compared by a umber of researchers [e.g., Dura&Ntafos84, Hamlet89, Hamlet94, Hamlet&Taylor90, TChe&Yu94, Tsoukalas&93, Théveod-Fosse&9, Weyuker&Jeg9]. Partitio testig previously was believed to be better tha radom testig. However, experimetal observatios repeatedly show that radom testig is as good as or better tha partitio testig. A similar state-of-affairs cocers radom ad partitio testig of fault-tolerat systems by meas of fault ijectio [Avresky&92, Arlat&90, Che93, Echtle&Che9, Powell&93]. Sice extremely high is required by fault-tolerat systems, the efficiecy of testig strategies is eve more cocered i testig of fault-tolerat systems. Recetly, it is show aalytically that partitio testig ca be better or worse tha radom testig: partitio testig ca be a excellet testig strategy or a poor oe, depedig o how the failurecausig iput cases are distributed i the classes of the partitio [e.g., TChe&Yu94, Weyuker&Jeg9]. These results help to explai the cotroversial experimetal results. As a applicatio of the iput domai-based growth model proposed i this paper, the efficiecy of radom ad partitio testig strategies are studied ad compared aalytically. I previous aalytic approaches, the cotrol-flow coverage ad fault detectio efficiecy of partitio testig ad radom testig are maily compared [TChe&Yu94, Dura&Ntafos84, Hamlet89, Hamlet94, Hamlet&Taylor90, Weyuker&Jeg9]. Recetly, [Hamlet94] idicated that software depedability should be a more direct criterio to judge the test efficiecy of testig strategies. He defied three depedability measures: program for uiform iput distributio, program i the worst case, ad the probability that a program has zero faults. I this paper we use for uiform iput distributio as the criterio to compare imperfect partitio testig ad imperfect radom testig. To our kowledge, this is the first approach which falls i the frame suggested by Hamlet. Usig this ew evaluatio criterio, multiple faults, imperfectio i testig, fault detectio ad correctio are all take ito cosideratio. Through sophisticated aalysis we obtai results which cofirm the results from [TChe&Yu94, Dura&Ntafos84, Weyuker&Jeg9] ad gai ew kowledge why ad uder which

6 4 A Iput Domai-Based Reliability Growth Model ad Its Applicatios i Comparig Testig Strategies coditios radom testig has the same efficiecy as, a higher or lower efficiecy tha partitio testig. As a secod applicatio of our iput domai-based growth model, differet variats of partitio testig are evaluated ad compared. I our previous work, we used growth as a criterio to compare the efficiecy of testig strategies for fault-tolerat protocols, a special kid of software i highly reliable distributed systems [Che&9, Che93, Che&Görke94, Echtle&Che9]. This paper exteds this primary idea ito testig strategies for covetioal programs. Nevertheless, fudametal ehacemets have bee made i this work to cope the more geeral requiremets of testig strategies for covetioal programs. The remaiig part of this paper is orgaised as follows. Next sectio defies the models for testig, fault, fault detectio ad fault correctio. How to collect failure data ad obtai the parameter values of all these models will be discussed i Sectio 3. The iput domai-based growth model, the mai work of this paper is preseted i Sectio 4. Applicatios of the model i comparig the efficiecy of testig strategies are discussed i Sectio 5. Fially, a summary of mai cotributios ad results of this paper is give i Sectio 6. 2 Testig Strategies ad Fault Model This sectio gives basic cocepts ad defies the compoet models eeded for the proposed iput domai-based growth model. 2. Partitio ad Radom Testig Strategies Defiitio Partitio A partitio of the iput case domai ICD is defied by a set {C, C 2,..., C m }, where C i ICD for i m; m 2 U C i = ICD ; i= 3 C i C j = φ (empty set) if i, j =, 2,..., m ad i j ; 4 C i = C j for i, j =, 2,..., m, where S expresses the umber of elemets i set S. This defiitio assumes that the classes of a partitio are disjoit ad have equal size. These assumptios are based o the cosideratio that we will ot actually partitio the ICD, but defie classes accordig to the test criterio applied, for istace, the iput cases which will exercise the same program path belog to a class. As log as all classes cosist of a ifiite umber of iput cases (this is true i may cases), the assumptios are proper. The pathologic partitios i which some classes cosist of oly very few iput cases caot be icluded i this defiitio. A extesio of this defiitio is beyod the scope of this paper. Defiitio 2 Partitio testig Partitio testig cosists of (test) rouds of test rus. A test ru is a executio of the program uder test by applyig a iput case. If the ICD of the program is partitioed ito m classes, a test roud cosists of exactly m test rus, aimed at coverig (geeratig iput cases from) all the m classes of the partitio. If partitio testig covers some classes more tha oce i a test roud,

7 A Iput Domai-Based Reliability Growth Model ad Its Applicatios i Comparig Testig Strategies 5 some other classes will be ucovered. Let u be the expected umber of ucovered classes i a test roud, the portio of covered classes, (m u) m, is called partitio testig coverage. If u = 0, (m u) m =, the coverage is perfect, otherwise, it is imperfect. Partitio testig with u ucovered classes per roud ca be viewed as cosistig of two parts of test rus. I the first part, m u test rus will select iput cases from m u differet classes (we say these rus are determiistic rus), ad i the secod part, u test rus will radomly select iput cases from these m u classes which have bee covered by the first part of test rus. This defiitio gives a primary form of partitio testig scheme. Some variats of partitio testig will be discussed i Subsectio 5.2. Differet from partitio testig which selects iput cases followig a give partitio, radom testig selects iput cases followig a certai probability distributio. Defiitio 3 Radom testig Radom testig cosists of (test) rouds of test rus. A test ru is a executio of the program by applyig a iput case. A (radom) test roud cosists of exactly m test rus, aimed at followig a give probability distributio. If radom testig caot exactly follow the give distributio, ICD is imperfectly covered. Let υ be the probability fuctio which reflects the imperfectio of radom testig, 0 < υ. This probability fuctio υ is called the radom testig coverage. If υ =, the coverage is perfect, otherwise, it is imperfect. Radom testig coverage ad partitio testig coverage are differet, but they both affect test efficiecy. Whe we compare the efficiecy of the two testig strategies, we will assume they take the same value, i.e., υ = (m u)/m. I the followig discussio, we will assume that the give probability distributio is a uiform distributio, because we have assumed that the applicatio iput profile of the program uder test follows a uiform distributio. 2.2 Fault Model I this sectio we tur to discuss the faults i the program uder test. Defiitio 4 Failure, fault, failure-causig iput case, error ad detectio set A wrog output of a program is a failure. A program cotais faults, if it will give a failure whe certai iput cases are applied. A iput case is a failure-causig iput case related to a fault if its applicatio ca detect the fault by causig a failure. The set of failure-causig iput cases related to a fault is called a error related to the fault. The set of all failure-causig iput cases related to all faults is the detectio set (DS) of the program. I other words, a error is the complete maifestatio of a fault i the iput domai, while a failure is a maifestatio of a fault i the output domai. Defiitio 5 Error size ad error class For a give subset S ICD, the ratio S DS is a error class, if its error size is o-zero. ICD is called the error size of subset S. A class

8 6 A Iput Domai-Based Reliability Growth Model ad Its Applicatios i Comparig Testig Strategies Evidetly, if all iput cases are equally likely, the error size of a class is the probability that a failurecausig iput case is geerated from this class per test ru ad the error size of ICD, DS ICD, is the probability that a failure-causig iput case is geerated from ICD per test ru. Thus, DS ICD is also called failure probability. Accordig to the defiitio of software for iput domai-based model, the of a program is the R = DS ICD Defiitio 6 Error group ad error distributio Assumig that there exist faults g, g 2,..., g, i a program ad C, C 2,..., C m are classes of a ICD partitio of the program. If the error correspodig to fault g k is distributed i d k classes, d k m, the the uio of these d k classes is called a error group, deoted by G k ad the error size of G k is deoted by Θ k = G k DS ICD. The parameter set (m,, d k, Θ k ) for k =, 2,...,, forms a error distributio. Remark: Error, error group ad error size are related but differet. Differece: a error E k is the set failure-causig iput cases related to a fault g k, a error group G k is the uio of the error classes related to g k, ad the error size Θ k of G k is a probability, istead of a set. Relatios: E k = G k DS, the umber of error groups is equal to the umber of errors i a program, Θ k = G k DS ICD = E k ICD. Note, accordig to Def. 5, Θ k G k DS G k. As a example Fig.2 shows the structure tree of a program with 0 paths. If the structure tree is used as the criterio to partitio the ICD, we ca obtai a partitio with 0 classes. If there are three fault g, g 2 ad g 3 i the program, the correspodig error groups are: G = C C 2 C 3 C 4, G 2 = C 7 ad G 3 = C 8, as show i the lower part of Fig.2. 0 g g g C C 2 C 3 C 4 C 5 C 6 C 7 C 8 C 9 C 0 Fig.2 A partitio with a error distributio A fault correctio is a behaviour aimed at localisig ad removig the faults i the program which are detected. The effect of a fault correctio ca be so large that the program after the correctio has o relatio at all with the program before correctio. I this case, either the failure history or the fault correctio history of the old program is useful for ay growth model. Therefore, i our growth model we oly cosidered fault correctios which esure that the partitio after the correctios still satisfies the give partitioig criterio, so that we ca cotiue to test the program without havig to make a ew partitio.

9 A Iput Domai-Based Reliability Growth Model ad Its Applicatios i Comparig Testig Strategies 7 Defiitio 7 Fault correctio A fault correctio is a chage (decreasig, icreasig, or oe) of the error sizes of some classes of a give partitio. Accordig to the umber of correctios eeded to remove a fault (chage its error size to zero) we ca iformally distiguish two kids of faults: easy faults, the error sizes of the faults are chaged to zero after a limited umber of correctios; ad difficult faults, the error sizes of the faults are ot chaged to zero after a large umber of correctios, because they are either difficult to be detected or difficult to be corrected. The easy faults are usually removed after a period of testig. The remaiig faults are all the difficult faults, which are the mai problem to be studied i testig ad evaluatio of software. With fault correctio i cosideratio, the error sizes ad the error distributios will be chagig with fault correctios. Defiitio 8 Fault correctio rate Let (m, j-, d k(j-), Θ k(j-) ) be the error distributio before the j th fault correctio, ad it is expected to be chaged ito (m, j, d kj, Θ kj ) after the j th fault correctio, where j Θ k = kj = ρ j Θ k = k( j ) Parameter ρ is called the error size chage rate ad ρ is called the correctio rate. 3 Parameter Estimatio So far we have characterised testig strategies, error distributio, ad fault correctio by a set of parameters u, j, d kj, Θ kj, ρ. Now we discuss how to orgaise the testig process ad how to use the failure data collected durig testig to estimate the values of these parameters. For this purpose, we divide partitio testig ito two stages: a phase-correctio stage ad a roud-correctio stage. The phase-correctio stage cosists of q test phases, ad each test phase cosists of p test rouds, as show i Fig.3. If faults are detected durig testig, testig will ot be iterrupted for fault correctio. After the p rouds of testig, all the faults detected i the phase are corrected together. Fault correctio is viewed as a part of a test phase. Roud-correctio stage cosists of t test rouds. If ay failure is detected, fault correctio will be performed after a roud. Fault correctio is viewed as a part of a test roud. A failure table, show i Tab., is maitaied durig the phase-correctio stage, which records how may failure-causig iput cases have bee geerated (how may failures have bee observed) from each class i each of the q test phases. Of course, p ad q must be umbers large eough to obtai eough statistic data for parameter estimatio. Havig completed the q test phases i the phase-correctio stage, testig will be cotiued with the roud-correctio stage, i which fault correctio will be performed after each roud (if ay fault is detected). The fial parameter values estimated i the first stage will be used as the iitial parameter Partitio testig will be maily studied, ad radom testig will be hadled as a special case of partitio testig.

10 8 A Iput Domai-Based Reliability Growth Model ad Its Applicatios i Comparig Testig Strategies values of the secod stage. Chages of parameter values caused i the secod stage will be predicted accordig to certai probability distributios. () phase-correctio stage (parameter estimatig) a test roud = m rus class (2) roud-correctio stage (parameter predicatig) a test roud = m rus + error correctio the test stage = q test phases Error Correctio Error Correctio a test phase = p rouds + error correctio u q d kq δ kq ρ EC EC EC EC EC EC EC EC EC the test stage = t test rouds Class o. of failures / o. of test rus i test phase Fig.3 Illustratio of the two testig stages o. of failures / o. of failures / o. of test rus o. of test rus... i test phase 2 i test phase 3 o. of failures / o. of test rus i test phase q C f s f 2 s 2 f 3 s 3... f q s q C 2 f 2 s 2 f 22 s 22 f 23 s f 2q s 2q C i f i s i f i2 s i2 f i3 s i3... f iq s iq C m f m s m f m2 s m2 f m3 s m3... f mq s mq Tab. The failure frequecy table I this sectio, we will briefly study the phase-correctio stage ad the parameter estimatio. The roud-correctio stage will be studied i full details i the ext sectio. Let s ij be the total umber of test rus which select iput cases from C i i the j th test phase, i which f ij failures are observed. For i =, 2,..., m ad j =, 2,..., q, f ij ad s ij are recorded i Tab.. Based o these data ad the specificatio ad/or implemetatio of the program uder test, the values of the parameters u, j, d kj, Θ kj, ρ ca be estimated as follows. Sice p test rouds are performed i each test phase, each classes should be tested exactly p times, i.e., s ij = p, if the testig coverage is perfect. Otherwise, s ij p. If s ij p, class C i ca be cosidered to be tested at least oce i average i each test roud. If s ij < p, class C i is ot tested i at least p s ij rouds, which reflects the imperfect coverage of this test phase. The the parameter u ca be estimated by the average umber of classes which are tested less tha p times i the test phase: u j = m m i= s ij < p ( p s ij )

11 A Iput Domai-Based Reliability Growth Model ad Its Applicatios i Comparig Testig Strategies 9 The above estimatio is oly based o the statistic data i the j th test phase. Sice the umber of ucovered classes is a global parameter idepedet of the test phases, we ca further build the average amog all the value u, u 2,..., u q to get the fial estimate of u: q q m u j ( p s ij )) = q m ( p s ij ) u = q j = = q j = ( m i= s ij < p q m j = i= s ij < p Now let's briefly discuss how to group error classes, so that the classes which are affected by a sigle fault belog to a group. For a give partitio, there are usually some relatios amog the classes. The relatioship is determied by the specificatio or the implemetatio of the program. As a example, the structure tree i Fig.2 ca be used to explai the relatioship amog error classes. If the classes correspodig to paths 0, 0 2, 0 3, ad 0 4 have o-zero error sizes, it is more likely that a commo poit of these paths cotais a sigle fault tha that the private parts of these paths cotai four idepedet faults. Thus, classes C, C 2, C 3 ad C 4 should be viewed as a group. However, if the classes correspodig to paths 0 7 ad 0 8 have o-zero error sizes, they must be cosidered as two error groups, because the structure tree does't have a poit which affect these ad oly these two paths. How to determie the error groups will ot be further discussed i this paper. It will be assumed that after the j th test phase, we ca obtai j groups, G j, G 2j,..., G j j, ad the umber d kj of error classes i each group accordig to Tab. ad the specificatio ad/or implemetatio of the program. Based o the priciple of iput domai-based models, the error size Θ kj of group G kj after the j th test phase ca be estimated by the average ratio of the umber of failures ad the umber of test rus related to the classes i group G kj, where k =, 2,..., j, j =, 2,..., q, f Θ kj = ij p m = p m f ij C i G kj C i G kj Accordig to Def. 8 ad the estimate of Θ kj, the imperfect correctio rate ρ j of the j th correctio i the phase-correctio stage ca be estimated: j ρ j = Θ kj Θ k( j ) = f ij f i( j ) k = j k = j k = C i G kj j k = C i G k( j ) Further build the average value amog all ρ, ρ 2,..., ρ q, we obtai the fial estimatio of the fault correctio rate: ρ = q q ρ j j = = q q j = j j f ij f i( j ) k = C i G kj k = C i G k( j ) The fial parameter values, u, q, d kq, Θ kq, ρ, estimated i this stage will be used as iitial values i the ext stage. 4 The Iput Domai-based Reliability Growth Model I the previous sectio, the values of the set of ecessary parameters are estimated. As the result we obtai a set of iitial values of parameters: m, u, q, d kq, Θ kq, ρ, k =, 2,...,.

12 0 A Iput Domai-Based Reliability Growth Model ad Its Applicatios i Comparig Testig Strategies Sice the roud-correctio stage will use the same partitio ad the same testig algorithms, m ad u will remai uchaged i this stage. Moreover, sice test phases have bee repeated may times i the phase-correctio stage, most easy faults have bee removed. I this testig stage we maily cosider difficult faults which caot be removed eve after a large umber of correctios. Thus, we assume that the umber of error groups q ad the umber of classes d kq i group G k will remai uchaged, oly the Θ kq ad the ρ will chage with icreasig umber of test rouds ad fault correctios. As costats of this testig stage we will reame q ad d kq as ad d k, ad as iitial values, we will reame Θ kq ad ρ as Θ k0 ad ρ 0. The remaiig error size of ICD from the last stage (or iitial error size for this stage) is the Θ k = k 0. The values of Θ k0 ad ρ 0 after r th test roud i this stage will be deoted as Θ kr ad ρ r. Beside these parameters, we eed some more parameters to characterise the icreasig difficulty of fault detectio ad correctio i the ew testig stage, which will be discussed whe they are itroduced. I Subsectios 4. ad 4.2, the growth uder partitio ad radom testig with perfect testig coverage (u = 0) will be ivestigated, respectively. I Subsectio 4.3, a itegrated growth model with imperfect testig coverage for both radom ad partitio testig will be established. 4. Reliability Growth uder Partitio Testig Let G k be a error group with d k classes ad its error size is Θ k(r-) after the (r ) th test roud. Durig the r th test roud, oe iput case will be geerated from each class of G k. The probability that a failure-causig iput case is geerated from ayoe of the d k classes is m Θ k(r-) /d k. This is because Θ k(r ) is the probability that a failure-causig iput case is geerated from G k whe a iput case is equally likely selected from the etire ICD. If we do't select a iput case from the etire ICD, but oly from oe class of G k, the probability that a failure-causig iput case is geerated is the (m/d k )Θ k(r-) = m Θ k(r-) /d k. Sice there are d k classes i group G k, d k iput cases will be selected from G k. Thus, the probability ( d k ) d k that the fault correspodig to G k is detected is m Θ k(r ). I this equatio it is assumed that fault detectio probability is idepedet of the umber of test rouds performed. Geeral, we use a fuctio e λ p (r ) to reflect the fact that the detectio probability per ru may decrease with icreasig umber of test rouds, because easier faults are more likely to be detected ad removed i the earlier rouds. Decreasig of detectio probability is cotrolled by parameter λ p. If λ p = 0, e λ p (r ) =, the detectio probability will ot suffer from decreasig with test rouds' icreasig. This case refers to perfect fault detectio. Takig this factor ito accout, the detectio probability is geeralised as follows: ( ) d k (m Θ k(r ) d k ) e λ p (r ) First let's assume that the fault correctio is perfect (the etire error size related to a fault will be removed if the fault is detected), the error size Θ k(r-) of G k will be completely removed if the fault is detected. Therefore we have the error size removed from group G k by the r th test roud: (r ) ( ) d k (m Θ k(r ) d k ) e λ p Θ k(r ) ()

13 A Iput Domai-Based Reliability Growth Model ad Its Applicatios i Comparig Testig Strategies If fault correctio is imperfect, oly a portio of Θ k(r-) ca be removed. Accordig to the defiitio of fault correctio rate, the removed portio is Θ k(r ) ( ρ r ), where ρ r = ( ρ 0 ) e µ (r ), which reflects the fact that fault correctio rate will decrease with icreasig umber of test rouds, because easier faults are more likely to be removed i the earlier rouds. The decreasig stregth is cotrolled by parameter µ. As show i Fig.4, the fault correctio rate ρ r ca decrease very fast or very slow, depedig o the selectio of µ values. ρ 0 = µ = 0. ρ r = ( ρ 0 ) e - µr µ = 0.02 µ = µ = µ = r, the umber of test rouds Fig.4 The decreasig stregth of fault correctio rate ρ r is determied by parameter µ Sice detectio ad correctio probabilities decrease expoetially with icreasig of test rouds, the growth will actually stop after a log time of testig. This is true i practice. However, if the program is tested by aother test tool or aother testig team (the ed users ca also be viewed as aother testig team), testig ca be viewed as a ew roud-correctio stage ad thus the umber of test rouds performed ca reset. to zero, ad thus the expoetial decreasig detectio ad correctio probabilities ca beefit from a low umber of test rouds. This is because a fault which is difficult to detect or correct for oe test tool or testig team may ot be difficult for aother. All programs delivered to the ed users are usually tested for a log time without discoverig ay fault. The users however discover faults usually i the earlier applicatio stage of the programs. Therefore we suggest to test a program by combiatio of differet kids of testig strategies, differet implemetatios of the same kid of testig strategy, ad differet testig teams. Of course, such chages will also alter the parameter values related to testig coverage, detectio probability ad correctio rate. The, we have a more geeral form of the error size removed from group G k by the r th test roud: (r ) ( ) d k (m Θ k(r ) d k ) e λ p ( ) Θ ρ k(r ) r Sice there are error groups, ad if we have totally carried out t test rouds, the the error size removed after t test rouds, ESR(t), is t (r ) ( ) d k ESR(t) = (m Θ k(r ) d k ) e λ p r = k = Θ ρ k(r ) ( r ) After the r th correctio, the error size, Θ k(r-), of group G k will be chaged. Cosiderig all imperfect factors, the ew error size ca be calculated as follows: ( d k ) d k ( ) Θ ρ k(r ) r Θ kr = Θ k(r ) m Θ k(r ) (2) ( ) (3) Accordig to the defiitio of ad the ESR(t) i Equ. (2) we have the growth model for partitio testig with perfect testig coverage:

14 2 A Iput Domai-Based Reliability Growth Model ad Its Applicatios i Comparig Testig Strategies (r ) ( ) d k t R par (t) = Θ k 0 (m Θ k(r ) d k ) e λ p k = r = k = Θ ρ k(r ) ( r ) (4) where, Θ k = k 0 is the iitial error size of the program before the roud-correctio stage ad ESR(t) is the remaiig error size. Thus Θ k 0 ESR(t) k = Θ k 0 the program after the t th test rouds. 4.2 Reliability Growth Model uder Radom Testig ( k = ) is the of Firstly, we assume that the radom iput case geeratio will select iput cases from the etire ICD uiformly. Withi the r th radom test roud (m test rus), the probability that the fault correspodig to error group G k is detected is Θ k(r ) ( ) m. This expressio assumes that the detectio probability is idepedet of the umber of test rouds performed. As discussed i the last sectio, if we should more geerally assume that the detectio probability will decrease with icreasig umber of test rouds. Similar to partitio testig, we use a expoetial fuctio e λ q (r ) to model the decreasig detectio probability. Thus we obtai a more geeral expressio of the detectio probability to error group G k per radom test roud: ( ) m Θ k(r ) e λ q (r ) Accordig to Def. 3, if radom testig caot exactly follow the give probability distributio, the radom testig coverage will be: 0 <υ. I order to compare with partitio testig, we assume υ = (m u)/m. The the detectio probability to error group G k by the r th test roud is: Θ k(r ) m u m e λ q (r ) m Similar to partitio testig, we assume a fault correctio will be carried out after each test roud. The the error size removed from the error group G k the error correctio after the r th roud is Θ k(r ) m u m e λ q (r ) m Θ k(r ) ( ρ r ) Summig amog all error groups ad test rouds, we have the total error sizes removed from all groups after t radom test rouds: ESR ra (t) = t r = k = Θ k(r ) m u m e λ q (r ) m Θ k(r ) ( ρ r ) Similar to Equ. (3), the error size of group G k i the ext test roud will be chaged ito: Θ kr = Θ k(r ) Θ k(r ) m u m e λ q (r ) m Θ k(r ) ( ρ r ) The the geeral growth model for radom testig uder our fault, fault detectio ad fault correctio models is (5)

15 A Iput Domai-Based Reliability Growth Model ad Its Applicatios i Comparig Testig Strategies 3 R ra (t) = Θ k 0 k = t r = k = Θ k(r ) m u m e λ q (r ) m Θ k(r ) ( ρ r ) (6) 4.3 The Complete Model I this subsectios, we derive the iput domai-based growth model for both radom ad partitio testig. Accordig to Def. 2, if testig coverage is imperfect, a partitio testig roud ca be viewed as cosistig of two parts of test rus. Part : m u determiistic test rus will select iput cases from m u differet classes, as if the partitio testig coverage is perfect; Part 2: u test rus will radomly select iput cases from these m u classes which have bee covered by the first part of test rus. Now we discuss this two parts respectively. As discussed i Subsectio 4., if the partitio testig coverage is perfect, the detectio probability ca be calculated accordig Equ. (). If oly m u test rus are performed, the detectio probability i ( ) a k Equ. () will be chaged ito (m Θ k(r ) d k ) e λ p (r ), where a k = d k (m u) m is the actual umber of iput cases which is geerated from the error group G k, if oly m u, istead of m, test rus are performed. We deote is this detectio probability by ( ) a k P par (r, G k ) = (m Θ k(r ) d k ) e λ p (r ) O the other had, if h radom test rus are performed, the detectio probability i ay h 0 radom test rus ca be expressed, accordig to Equ. (5), by P ra (r, G k ) = Θ k(r ) m u m e λ q (r ) If h = u, the detectio probability i part 2 ca be calculated. There are two reasos we itroduce a ew parameter h i this equatio, istead of directly usig parameter u: I some implemetatios, more tha m test rus may be carried out i a test roud, i order to improve the imperfect testig coverage. Such implemetatios of partitio testig ca be modelled by settig h > u. Otherwise, h = u, see Subsectio 5.2. With this extra parameter h, the radom testig model i Equ. (6) ca be itegrated ito the partitio testig model, see special case i Subsectio 4.4. Evidetly, a fault ca be detected o the test rus i both part ad i part 2. I this case, the commo part must be removed. Sice P par (r, G k ) is the probability that the fault is NOT detected o the m u determiistic test rus, the o-commo part of detectio probability from the determiistic ad radom rus i the r th test roud ca be expressed by P par (r, G k ) + ( P par (r, G k )) P ra (r, G k ) h

16 4 A Iput Domai-Based Reliability Growth Model ad Its Applicatios i Comparig Testig Strategies where ( P par ((r, G k )) P ra (r, G k ) is the probability that the error group G k is NOT detected o the m u determiistic test rus, but o the u radom test rus. The the total error size removed by the m u determiistic test rus ad the u radom test rus i all the t test rouds ca be expressed by t =( ( ( ) P ra (r,g k )) Θ k(r ) ( ρ r )) r = k ESR(t) = P par (r,g k ) + P par (r,g k ) The fial after t rouds of imperfect partitio testig is the t R(t) = Θ k 0 P par (r,g k ) + P par (r,g k ) k = r = =( ( ( ) P ra (r,g k )) Θ k(r ) ( ρ r )) k (7) Equ. (7) is the geeral iput domai-based growth model which itegrates radom ad partitio testig strategies together. It ca be easily show that the space complexity of Equ. (7) is O(m) ad time complexity is O(t m), which are liearly complex regardig the size of partitio. The geeral model i Equ. (7) cosiders all the mai factors which cotribute to the imperfectio of the implemetatios of testig strategies. It will be show i the ext subsectio that the growth models i Equ. (4) ad (6), as well as other models for partitio ad radom testig with differet imperfect factors are all uified i this model. 4.4 Projectios of the Model This subsectio shows special cases of the model i Equ. (7), which ca be used to cope cocrete implemetatios, i which some mechaisms ca be viewed as perfect. Special case : Geeral radom testig ( ) m If the parameters h = m, ad λ p, the P ra (r, G k ) = Θ k(r ) ((m u) u) e λ q (r ) ad P par (r, G k ) = 0. Equ. (7) is degraded to the geeral growth model for radom testig i Equ. (6), i other words, Equ. (6) is a special case of Equ. (7). Special case 2: Perfect radom testig If testig coverage, fault detectio ad correctio of radom testig are all perfect, that is, u = 0, λ q = 0, ad ρ r- =, we obtai the growth model uder perfect radom testig: R(t) = Θ k 0 + Θ k(r ) (8) k = t r = k = ( ( ) ) m Θ k(r ) Moreover, if there is oly a sigle fault ( = ) ad oly oe test roud is carried out, the we have R() = Θ 0 + Θ 0 ( ( ) m ) Θ 0 = ( Θ 0 ) m Θ 0 (9) Special case 3: Partitio testig with perfect testig coverage If h = u = 0 i Equ. (7), partitio testig coverage is perfect, o radom test rus will be executed ad thus P ra (r, G k ) = 0. The Equ. (7) is degraded to the growth model for partitio testig with perfect testig coverage i Equ. (4), that is, Equ. (4) is a special case of Equ. (7).

17 A Iput Domai-Based Reliability Growth Model ad Its Applicatios i Comparig Testig Strategies 5 Special case 4: Perfect partitio testig If testig coverage, fault detectio ad correctio of partitio testig are all perfect, that is, u = 0, λ p = 0, ad ρ r- =, Equ. (7) is degraded to R(t) = Θ k 0 + m Θ k(r ) d k k = t r = k = ( ) d k Θ k(r ) Furthermore, if there is oly a sigle fault ad oly oe test roud is carried out, the we have R() = Θ 0 + ( m Θ 0 ) d ( ) Θ 0 = m Θ 0 ( ) d (0) Θ 0 () Comparig the Equ. (8) with (0) ad Equ. (9) with (), we ca see the elemetary differece betwee the growth models for partitio ad radom testig. 5 Applicatio of the Model This sectio applies the proposed iput domai-based growth model to compare the efficiecy of partitio ad radom testig strategies, as well as variats of partitio testig strategies i terms of growth. 5. Comparig Partitio ad Radom Testig Strategies Assume that ICD is partitioed ito m = 00 classes. After the phase-correctio stage the remaiig error size i ICD is DS ICD = 0.0. Now let's apply the growth model i Equ. (7) to study the effects of imperfect testig coverage, detectio probability, ad correctio rate, as well as the effects of error distributios i the partitio. Tab.2 summarises all cases we are goig to study, i which differet parameter values are selected to show the effects of parameters o the growth i Equ. (7). Observatio The effect of the umber of faults ad error distributios For these parameter values give i the first case i Tab. 2, we cosider three error distributios, respectively: (a) (b) (c) The iitial error size evely distributes i all the 00 classes, ad each error class forms a error group, i.e., (m,, d k, Θ k ) = (00, 00,, 0.0); The iitial error size evely distributes i all the 00 classes ad all the error classes form a sigle error group, i.e., (m,, d k, Θ k ) = (00,, 00, 0.0); The iitial error size cocetrates i oe class. Of course, there is oly oe error group which cosists of the uique error class, i.e., (m,, d k, Θ k ) = (00,,, ).

18 6 A Iput Domai-Based Reliability Growth Model ad Its Applicatios i Comparig Testig Strategies observ- rouds error distributios testig detectio correctio atios t m d k Θ k u h λ p λ q µ ρ r (Fig.5) 2 (Fig.6) 3 (Fig.7) 4 (Fig.8) 5 (Fig.9) 6 (Fig.0) u e µr 0-99 u 0.00 λ p m e µr u 0. λ p /m e µr rus rus u + u (u/m) e µr u + u (u/m) + u (u/m) e µr Tab.2 Selectio of parameters' values for observatios For each of these three error distributios ad for partitio ad radom testig, Fig.5 (a-c) plots respectively the curves for u = 0, u = 25, u = 50, u = 75, ad u = m = 99, calculated accordig to Equ. (7). The curve with u = 0 (the highest oe) correspods to the case with perfect testig coverage ad the curve with u = 99 (the lowest oe) correspods to the case with the worst testig coverage. It ca be see that: For the same testig coverage, if u = 0, the growth by partitio ad radom testig is the same for all three error distributios. If u > 0, curves from partitio testig are slightly higher tha radom testig. If partitio ad radom testig have differet testig coverages (this is more probable i practice), partitio testig ca be worse tha radom testig. For example, a very poor implemetatio of partitio testig with u = 99 is defiitely worse tha a implemetatio of radom testig with u = 50, as ca be see from Fig.5. Comparig Fig.5(b) ad (c) with (a): The umber of faults plays a sigificat role i growth. The larger the umber, the lower are the curves. Comparig Fig.5(a) ad (b) with (c): The distributios of error size affect the growth. The more cocetrate the error size, the higher are the curves. But the effect of error distributios is less sigificat tha the umber of faults.

19 A Iput Domai-Based Reliability Growth Model ad Its Applicatios i Comparig Testig Strategies error distributio: m errors distributes i m class (a) m errors distributes i m classes (left: partitio testig, right: radom testig) error distributio: error distributes i m class (b) Oe error distributes i m classes (left: partitio testig, right: radom testig) error distributio: error cocetrates i class (c) Oe error cocetrates i oe class (left: partitio testig, right: radom testig) Fig.5 Compariso betwee partitio ad radom testig (λ q = λ p ) Observatio 2 The effect of the imperfect fault detectio I Observatio we have assumed that the error distributio, the testig coverage, the detectio ad correctio parameters have the same values for partitio ad radom testig. I practical implemetatios, these parameters may have differet values, which will thus chage the compariso results. Sice partitio testig strategy uses more iformatio of the program uder test, it ca potetially gai a higher growth tha radom testig by more properly implemetig these mechaisms. I this observatio we use the same parameter values except settig λ p = 0.00 ad λ q = λ p m (λ p is m times lower tha λ q because the iput domai is partitioed ito m classes, which potetially improve the fault detectio probability) ad calculate the accordig to Equ. (7)

20 8 A Iput Domai-Based Reliability Growth Model ad Its Applicatios i Comparig Testig Strategies agai. The results are plotted i Fig.6 (a-c). It ca be see that there are quite big differeces betwee the curves achieved by partitio testig ad radom testig error distributio: m errors distributes i m class (a) m errors distributes i m classes (left: partitio testig, right: radom testig) error distributio: error distributes i m class (b) Oe error distributes i m classes (left: partitio testig, right: radom testig) error distributio: error cocetrates i class (c) Oe error cocetrates i oe class (left: partitio testig, right: radom testig) Fig.6 Compariso betwee partitio ad radom testig (λ q = λ p m ) Observatio 3 Radom testig ca be much better tha determiistic testig O the other had, a poor implemeted partitio testig ca be much worse tha radom testig. For example, for the same parameter values except assumig that λ p = 0. ad λ q = λ p /m, the radom testig will be much better tha partitio testig, eve if the implemetatio of radom testig has a lower testig coverage (a larger u value), as show i Fig.7. I this example, oly oe of the three error distributios is used for short.

21 A Iput Domai-Based Reliability Growth Model ad Its Applicatios i Comparig Testig Strategies error distributio: 0 errors, each cotais 5 classes Fig.7 A bad implemetatio of determiistic testig ca be worse tha radom testig Observatio 4 Compariso betwee perfect partitio ad radom testig I the previous comparisos we cosidered always some imperfect factors. Which strategy is better if all factors are perfect? I this case, u = λ q = λ p = µ = 0, ad ρ r =, ad Equ. (7) is degraded to Equ. (8) ad (0), for partitio ad radom testig, respectively. For the three error distributios used i observatios ad 2, Fig.8 shows the compariso. Sice u = 0, there is oly oe curve for each error distributio. It ca be see, that there is little differece betwee perfect partitio ad radom testig. The oly differece occurs whe there is oly oe fault ad all failure causig cases cocetrate i oe class. I this extreme error distributio, partitio testig ca detect ad correct the fault i the first roud ad thus the will achieve oe after the first roud. Radom testig however ca theoretically ever achieve oe. Such extreme curve will ot occur, if ay part of the implemetatio is imperfect..00 =, d k = =, d k = 00 = 00, d k = =, d k = =, d k = 00 = 00, d k = Fig.8 Compariso betwee perfect partitio ad radom testig uder three error distributios 5.2 Comparig Modified Partitio Testig Strategies Partitio testig specified i Def. 2 assumes that oly oe attempt shall be made to geerate a iput case from oe class i each test roud, o matter whether this attempt is successful or ot. Some implemetatios of partitio testig however allow further attempts if the iput case geeratio fails to select a iput case from a give class. Obviously, such variats will reduce the umber u of ucovered classes, but icrease the umber of test rus i a test roud. The questios are thus: Ca such a kid of modificatios improve the? If it ca improve the, how may attempts should be performed at best?

22 20 A Iput Domai-Based Reliability Growth Model ad Its Applicatios i Comparig Testig Strategies This subsectio will use the model i Equ. (7) to achieve these questios. Observatio 5 Modified partitio testig with up to two attempts Assume that the partitio testig coverage is (m u)/m ad oe more attempt (totally w = 2 attempts) will be performed if the first attempt fails to select a iput case from a give class. The, the parameter values i the model i Equ. (7) ca be assiged as follows to model this variat of partitio testig: istead of u, oly u ( u m) classes will ot be tested i a test roud, thus, m u ( u / m) a k = d k = d k u m m ( u m ) ; istead of u, h = u + u 2 / m radom test rus will be carried out i a test roud; istead of m, m + 2 u 2 / m test rus will be executed i a test roud. For u = 25, 50, 75, respectively (a complete parameter value assigmet is give i Tab.2), Fig.9 compares the growth uder three testig strategies: modified partitio testig with up to w = 2 attempts, primary partitio testig (w = ), ad radom testig. Sice a test roud of modified partitio testig cosists of m + 2 u 2 / m test rus, it is't meaigful to compare the i terms of the umber of test rouds performed. Istead, the umber of test rus is used i Fig.9. It ca be see that the modified partitio testig improves the i all three cases for the same umber of test rus. The improvemet is more sigificat for a lower testig coverage.. modified partitio testig with w = 2 modified partitio testig with w = 2 modified partitio testig with w = 2 partitio testig radom testig u = umber of test RUNs performed u = 55 partitio testig radom testig umber of test RUNs performed u = 75 partitio testig radom testig umber of test RUNs performed Observatio 6 Fig.9 Modified partitio testig with up to two attempts Modified partitio testig with more tha two attempts To aswer the secod questio, we geerally cosider that up to w attempts, w, will be performed i order to successfully select a iput case from a give class. The improved umber of ucovered classes i a test roud the ca be expressed by u = u ( u m) w. We ca further derive the ecessary parameter values as follows: a k = d k m u m = d u k m ( u m )w, the actual umber of iput cases which is geerated from the error group G k if oly m u', istead of m, determiistic test rus are performed;

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

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

ADVANCED SOFTWARE ENGINEERING

ADVANCED SOFTWARE ENGINEERING ADVANCED SOFTWARE ENGINEERING COMP 3705 Exercise Usage-based Testig ad Reliability Versio 1.0-040406 Departmet of Computer Ssciece Sada Narayaappa, Aeliese Adrews Versio 1.1-050405 Departmet of Commuicatio

More information

Advanced Stochastic Processes.

Advanced Stochastic Processes. Advaced Stochastic Processes. David Gamarik LECTURE 2 Radom variables ad measurable fuctios. Strog Law of Large Numbers (SLLN). Scary stuff cotiued... Outlie of Lecture Radom variables ad measurable fuctios.

More information

CS284A: Representations and Algorithms in Molecular Biology

CS284A: Representations and Algorithms in Molecular Biology CS284A: Represetatios ad Algorithms i Molecular Biology Scribe Notes o Lectures 3 & 4: Motif Discovery via Eumeratio & Motif Represetatio Usig Positio Weight Matrix Joshua Gervi Based o presetatios by

More information

Axioms of Measure Theory

Axioms of Measure Theory MATH 532 Axioms of Measure Theory Dr. Neal, WKU I. The Space Throughout the course, we shall let X deote a geeric o-empty set. I geeral, we shall ot assume that ay algebraic structure exists o X so that

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

Random Variables, Sampling and Estimation

Random Variables, Sampling and Estimation Chapter 1 Radom Variables, Samplig ad Estimatio 1.1 Itroductio This chapter will cover the most importat basic statistical theory you eed i order to uderstad the ecoometric material that will be comig

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

1 Review of Probability & Statistics

1 Review of Probability & Statistics 1 Review of Probability & Statistics a. I a group of 000 people, it has bee reported that there are: 61 smokers 670 over 5 960 people who imbibe (drik alcohol) 86 smokers who imbibe 90 imbibers over 5

More information

62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 +

62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + 62. Power series Defiitio 16. (Power series) Give a sequece {c }, the series c x = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + is called a power series i the variable x. The umbers c are called the coefficiets of

More information

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

It is always the case that unions, intersections, complements, and set differences are preserved by the inverse image of a function.

It is always the case that unions, intersections, complements, and set differences are preserved by the inverse image of a function. MATH 532 Measurable Fuctios Dr. Neal, WKU Throughout, let ( X, F, µ) be a measure space ad let (!, F, P ) deote the special case of a probability space. We shall ow begi to study real-valued fuctios defied

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

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

Provläsningsexemplar / Preview TECHNICAL REPORT INTERNATIONAL SPECIAL COMMITTEE ON RADIO INTERFERENCE

Provläsningsexemplar / Preview TECHNICAL REPORT INTERNATIONAL SPECIAL COMMITTEE ON RADIO INTERFERENCE TECHNICAL REPORT CISPR 16-4-3 2004 AMENDMENT 1 2006-10 INTERNATIONAL SPECIAL COMMITTEE ON RADIO INTERFERENCE Amedmet 1 Specificatio for radio disturbace ad immuity measurig apparatus ad methods Part 4-3:

More information

There is no straightforward approach for choosing the warmup period l.

There is no straightforward approach for choosing the warmup period l. B. Maddah INDE 504 Discrete-Evet Simulatio Output Aalysis () Statistical Aalysis for Steady-State Parameters I a otermiatig simulatio, the iterest is i estimatig the log ru steady state measures of performace.

More information

DS 100: Principles and Techniques of Data Science Date: April 13, Discussion #10

DS 100: Principles and Techniques of Data Science Date: April 13, Discussion #10 DS 00: Priciples ad Techiques of Data Sciece Date: April 3, 208 Name: Hypothesis Testig Discussio #0. Defie these terms below as they relate to hypothesis testig. a) Data Geeratio Model: Solutio: A set

More information

MAT1026 Calculus II Basic Convergence Tests for Series

MAT1026 Calculus II Basic Convergence Tests for Series MAT026 Calculus II Basic Covergece Tests for Series Egi MERMUT 202.03.08 Dokuz Eylül Uiversity Faculty of Sciece Departmet of Mathematics İzmir/TURKEY Cotets Mootoe Covergece Theorem 2 2 Series of Real

More information

The Boolean Ring of Intervals

The Boolean Ring of Intervals MATH 532 Lebesgue Measure Dr. Neal, WKU We ow shall apply the results obtaied about outer measure to the legth measure o the real lie. Throughout, our space X will be the set of real umbers R. Whe ecessary,

More information

EE / EEE SAMPLE STUDY MATERIAL. GATE, IES & PSUs Signal System. Electrical Engineering. Postal Correspondence Course

EE / EEE SAMPLE STUDY MATERIAL. GATE, IES & PSUs Signal System. Electrical Engineering. Postal Correspondence Course Sigal-EE Postal Correspodece Course 1 SAMPLE STUDY MATERIAL Electrical Egieerig EE / EEE Postal Correspodece Course GATE, IES & PSUs Sigal System Sigal-EE Postal Correspodece Course CONTENTS 1. SIGNAL

More information

CS322: Network Analysis. Problem Set 2 - Fall 2009

CS322: Network Analysis. Problem Set 2 - Fall 2009 Due October 9 009 i class CS3: Network Aalysis Problem Set - Fall 009 If you have ay questios regardig the problems set, sed a email to the course assistats: simlac@staford.edu ad peleato@staford.edu.

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

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

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

Vector Quantization: a Limiting Case of EM

Vector Quantization: a Limiting Case of EM . Itroductio & defiitios Assume that you are give a data set X = { x j }, j { 2,,, }, of d -dimesioal vectors. The vector quatizatio (VQ) problem requires that we fid a set of prototype vectors Z = { z

More information

Lecture 2: Monte Carlo Simulation

Lecture 2: Monte Carlo Simulation STAT/Q SCI 43: Itroductio to Resamplig ethods Sprig 27 Istructor: Ye-Chi Che Lecture 2: ote Carlo Simulatio 2 ote Carlo Itegratio Assume we wat to evaluate the followig itegratio: e x3 dx What ca we do?

More information

w (1) ˆx w (1) x (1) /ρ and w (2) ˆx w (2) x (2) /ρ.

w (1) ˆx w (1) x (1) /ρ and w (2) ˆx w (2) x (2) /ρ. 2 5. Weighted umber of late jobs 5.1. Release dates ad due dates: maximimizig the weight of o-time jobs Oce we add release dates, miimizig the umber of late jobs becomes a sigificatly harder problem. For

More information

Proof of Goldbach s Conjecture. Reza Javaherdashti

Proof of Goldbach s Conjecture. Reza Javaherdashti Proof of Goldbach s Cojecture Reza Javaherdashti farzijavaherdashti@gmail.com Abstract After certai subsets of Natural umbers called Rage ad Row are defied, we assume (1) there is a fuctio that ca produce

More information

ANALYSIS OF EXPERIMENTAL ERRORS

ANALYSIS OF EXPERIMENTAL ERRORS ANALYSIS OF EXPERIMENTAL ERRORS All physical measuremets ecoutered i the verificatio of physics theories ad cocepts are subject to ucertaities that deped o the measurig istrumets used ad the coditios uder

More information

Random Walks on Discrete and Continuous Circles. by Jeffrey S. Rosenthal School of Mathematics, University of Minnesota, Minneapolis, MN, U.S.A.

Random Walks on Discrete and Continuous Circles. by Jeffrey S. Rosenthal School of Mathematics, University of Minnesota, Minneapolis, MN, U.S.A. Radom Walks o Discrete ad Cotiuous Circles by Jeffrey S. Rosethal School of Mathematics, Uiversity of Miesota, Mieapolis, MN, U.S.A. 55455 (Appeared i Joural of Applied Probability 30 (1993), 780 789.)

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

Probability, Expectation Value and Uncertainty

Probability, Expectation Value and Uncertainty Chapter 1 Probability, Expectatio Value ad Ucertaity We have see that the physically observable properties of a quatum system are represeted by Hermitea operators (also referred to as observables ) such

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

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

c. Explain the basic Newsvendor model. Why is it useful for SC models? e. What additional research do you believe will be helpful in this area?

c. Explain the basic Newsvendor model. Why is it useful for SC models? e. What additional research do you believe will be helpful in this area? 1. Research Methodology a. What is meat by the supply chai (SC) coordiatio problem ad does it apply to all types of SC s? Does the Bullwhip effect relate to all types of SC s? Also does it relate to SC

More information

6 Integers Modulo n. integer k can be written as k = qn + r, with q,r, 0 r b. So any integer.

6 Integers Modulo n. integer k can be written as k = qn + r, with q,r, 0 r b. So any integer. 6 Itegers Modulo I Example 2.3(e), we have defied the cogruece of two itegers a,b with respect to a modulus. Let us recall that a b (mod ) meas a b. We have proved that cogruece is a equivalece relatio

More information

Sequences A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence

Sequences A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece 1, 1, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet

More information

MATH301 Real Analysis (2008 Fall) Tutorial Note #7. k=1 f k (x) converges pointwise to S(x) on E if and

MATH301 Real Analysis (2008 Fall) Tutorial Note #7. k=1 f k (x) converges pointwise to S(x) on E if and MATH01 Real Aalysis (2008 Fall) Tutorial Note #7 Sequece ad Series of fuctio 1: Poitwise Covergece ad Uiform Covergece Part I: Poitwise Covergece Defiitio of poitwise covergece: A sequece of fuctios f

More information

Disjoint set (Union-Find)

Disjoint set (Union-Find) CS124 Lecture 7 Fall 2018 Disjoit set (Uio-Fid) For Kruskal s algorithm for the miimum spaig tree problem, we foud that we eeded a data structure for maitaiig a collectio of disjoit sets. That is, we eed

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

1 Hash tables. 1.1 Implementation

1 Hash tables. 1.1 Implementation Lecture 8 Hash Tables, Uiversal Hash Fuctios, Balls ad Bis Scribes: Luke Johsto, Moses Charikar, G. Valiat Date: Oct 18, 2017 Adapted From Virgiia Williams lecture otes 1 Hash tables A hash table is a

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

FACULTY OF MATHEMATICAL STUDIES MATHEMATICS FOR PART I ENGINEERING. Lectures

FACULTY OF MATHEMATICAL STUDIES MATHEMATICS FOR PART I ENGINEERING. Lectures FACULTY OF MATHEMATICAL STUDIES MATHEMATICS FOR PART I ENGINEERING Lectures MODULE 5 STATISTICS II. Mea ad stadard error of sample data. Biomial distributio. Normal distributio 4. Samplig 5. Cofidece itervals

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

Basics of Probability Theory (for Theory of Computation courses)

Basics of Probability Theory (for Theory of Computation courses) Basics of Probability Theory (for Theory of Computatio courses) Oded Goldreich Departmet of Computer Sciece Weizma Istitute of Sciece Rehovot, Israel. oded.goldreich@weizma.ac.il November 24, 2008 Preface.

More information

Correlation Regression

Correlation Regression Correlatio Regressio While correlatio methods measure the stregth of a liear relatioship betwee two variables, we might wish to go a little further: How much does oe variable chage for a give chage i aother

More information

Module 5 EMBEDDED WAVELET CODING. Version 2 ECE IIT, Kharagpur

Module 5 EMBEDDED WAVELET CODING. Version 2 ECE IIT, Kharagpur Module 5 EMBEDDED WAVELET CODING Versio ECE IIT, Kharagpur Lesso 4 SPIHT algorithm Versio ECE IIT, Kharagpur Istructioal Objectives At the ed of this lesso, the studets should be able to:. State the limitatios

More information

Statistics 511 Additional Materials

Statistics 511 Additional Materials Cofidece Itervals o mu Statistics 511 Additioal Materials This topic officially moves us from probability to statistics. We begi to discuss makig ifereces about the populatio. Oe way to differetiate probability

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

Machine Learning Brett Bernstein

Machine Learning Brett Bernstein Machie Learig Brett Berstei Week 2 Lecture: Cocept Check Exercises Starred problems are optioal. Excess Risk Decompositio 1. Let X = Y = {1, 2,..., 10}, A = {1,..., 10, 11} ad suppose the data distributio

More information

Chapter 2 The Monte Carlo Method

Chapter 2 The Monte Carlo Method Chapter 2 The Mote Carlo Method The Mote Carlo Method stads for a broad class of computatioal algorithms that rely o radom sampligs. It is ofte used i physical ad mathematical problems ad is most useful

More information

Rank Modulation with Multiplicity

Rank Modulation with Multiplicity Rak Modulatio with Multiplicity Axiao (Adrew) Jiag Computer Sciece ad Eg. Dept. Texas A&M Uiversity College Statio, TX 778 ajiag@cse.tamu.edu Abstract Rak modulatio is a scheme that uses the relative order

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

As stated by Laplace, Probability is common sense reduced to calculation.

As stated by Laplace, Probability is common sense reduced to calculation. Note: Hadouts DO NOT replace the book. I most cases, they oly provide a guidelie o topics ad a ituitive feel. The math details will be covered i class, so it is importat to atted class ad also you MUST

More information

Sequences and Series of Functions

Sequences and Series of Functions Chapter 6 Sequeces ad Series of Fuctios 6.1. Covergece of a Sequece of Fuctios Poitwise Covergece. Defiitio 6.1. Let, for each N, fuctio f : A R be defied. If, for each x A, the sequece (f (x)) coverges

More information

Test One (Answer Key)

Test One (Answer Key) CS395/Ma395 (Sprig 2005) Test Oe Name: Page 1 Test Oe (Aswer Key) CS395/Ma395: Aalysis of Algorithms This is a closed book, closed otes, 70 miute examiatio. It is worth 100 poits. There are twelve (12)

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

The target reliability and design working life

The target reliability and design working life Safety ad Security Egieerig IV 161 The target reliability ad desig workig life M. Holický Kloker Istitute, CTU i Prague, Czech Republic Abstract Desig workig life ad target reliability levels recommeded

More information

1 Review and Overview

1 Review and Overview DRAFT a fial versio will be posted shortly CS229T/STATS231: Statistical Learig Theory Lecturer: Tegyu Ma Lecture #3 Scribe: Migda Qiao October 1, 2013 1 Review ad Overview I the first half of this course,

More information

Lecture 2: April 3, 2013

Lecture 2: April 3, 2013 TTIC/CMSC 350 Mathematical Toolkit Sprig 203 Madhur Tulsiai Lecture 2: April 3, 203 Scribe: Shubhedu Trivedi Coi tosses cotiued We retur to the coi tossig example from the last lecture agai: Example. Give,

More information

L = n i, i=1. dp p n 1

L = n i, i=1. dp p n 1 Exchageable sequeces ad probabilities for probabilities 1996; modified 98 5 21 to add material o mutual iformatio; modified 98 7 21 to add Heath-Sudderth proof of de Fietti represetatio; modified 99 11

More information

Journal of Multivariate Analysis. Superefficient estimation of the marginals by exploiting knowledge on the copula

Journal of Multivariate Analysis. Superefficient estimation of the marginals by exploiting knowledge on the copula Joural of Multivariate Aalysis 102 (2011) 1315 1319 Cotets lists available at ScieceDirect Joural of Multivariate Aalysis joural homepage: www.elsevier.com/locate/jmva Superefficiet estimatio of the margials

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 324 Summer 2006 Elementary Number Theory Solutions to Assignment 2 Due: Thursday July 27, 2006

MATH 324 Summer 2006 Elementary Number Theory Solutions to Assignment 2 Due: Thursday July 27, 2006 MATH 34 Summer 006 Elemetary Number Theory Solutios to Assigmet Due: Thursday July 7, 006 Departmet of Mathematical ad Statistical Scieces Uiversity of Alberta Questio [p 74 #6] Show that o iteger of the

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

Resampling Methods. X (1/2), i.e., Pr (X i m) = 1/2. We order the data: X (1) X (2) X (n). Define the sample median: ( n.

Resampling Methods. X (1/2), i.e., Pr (X i m) = 1/2. We order the data: X (1) X (2) X (n). Define the sample median: ( n. Jauary 1, 2019 Resamplig Methods Motivatio We have so may estimators with the property θ θ d N 0, σ 2 We ca also write θ a N θ, σ 2 /, where a meas approximately distributed as Oce we have a cosistet estimator

More information

subcaptionfont+=small,labelformat=parens,labelsep=space,skip=6pt,list=0,hypcap=0 subcaption ALGEBRAIC COMBINATORICS LECTURE 8 TUESDAY, 2/16/2016

subcaptionfont+=small,labelformat=parens,labelsep=space,skip=6pt,list=0,hypcap=0 subcaption ALGEBRAIC COMBINATORICS LECTURE 8 TUESDAY, 2/16/2016 subcaptiofot+=small,labelformat=pares,labelsep=space,skip=6pt,list=0,hypcap=0 subcaptio ALGEBRAIC COMBINATORICS LECTURE 8 TUESDAY, /6/06. Self-cojugate Partitios Recall that, give a partitio λ, we may

More information

1 6 = 1 6 = + Factorials and Euler s Gamma function

1 6 = 1 6 = + Factorials and Euler s Gamma function Royal Holloway Uiversity of Lodo Departmet of Physics Factorials ad Euler s Gamma fuctio Itroductio The is a self-cotaied part of the course dealig, essetially, with the factorial fuctio ad its geeralizatio

More information

Discrete Mathematics for CS Spring 2007 Luca Trevisan Lecture 22

Discrete Mathematics for CS Spring 2007 Luca Trevisan Lecture 22 CS 70 Discrete Mathematics for CS Sprig 2007 Luca Trevisa Lecture 22 Aother Importat Distributio The Geometric Distributio Questio: A biased coi with Heads probability p is tossed repeatedly util the first

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

GUIDELINES ON REPRESENTATIVE SAMPLING

GUIDELINES ON REPRESENTATIVE SAMPLING DRUGS WORKING GROUP VALIDATION OF THE GUIDELINES ON REPRESENTATIVE SAMPLING DOCUMENT TYPE : REF. CODE: ISSUE NO: ISSUE DATE: VALIDATION REPORT DWG-SGL-001 002 08 DECEMBER 2012 Ref code: DWG-SGL-001 Issue

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

Lecture 11: Pseudorandom functions

Lecture 11: Pseudorandom functions COM S 6830 Cryptography Oct 1, 2009 Istructor: Rafael Pass 1 Recap Lecture 11: Pseudoradom fuctios Scribe: Stefao Ermo Defiitio 1 (Ge, Ec, Dec) is a sigle message secure ecryptio scheme if for all uppt

More information

Discrete Mathematics for CS Spring 2008 David Wagner Note 22

Discrete Mathematics for CS Spring 2008 David Wagner Note 22 CS 70 Discrete Mathematics for CS Sprig 2008 David Wager Note 22 I.I.D. Radom Variables Estimatig the bias of a coi Questio: We wat to estimate the proportio p of Democrats i the US populatio, by takig

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

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

Chapter 6 Overview: Sequences and Numerical Series. For the purposes of AP, this topic is broken into four basic subtopics:

Chapter 6 Overview: Sequences and Numerical Series. For the purposes of AP, this topic is broken into four basic subtopics: Chapter 6 Overview: Sequeces ad Numerical Series I most texts, the topic of sequeces ad series appears, at first, to be a side topic. There are almost o derivatives or itegrals (which is what most studets

More information

On Random Line Segments in the Unit Square

On Random Line Segments in the Unit Square O Radom Lie Segmets i the Uit Square Thomas A. Courtade Departmet of Electrical Egieerig Uiversity of Califoria Los Ageles, Califoria 90095 Email: tacourta@ee.ucla.edu I. INTRODUCTION Let Q = [0, 1] [0,

More information

Lecture 10 October Minimaxity and least favorable prior sequences

Lecture 10 October Minimaxity and least favorable prior sequences STATS 300A: Theory of Statistics Fall 205 Lecture 0 October 22 Lecturer: Lester Mackey Scribe: Brya He, Rahul Makhijai Warig: These otes may cotai factual ad/or typographic errors. 0. Miimaxity ad least

More information

EXAMINATIONS OF THE ROYAL STATISTICAL SOCIETY

EXAMINATIONS OF THE ROYAL STATISTICAL SOCIETY EXAMINATIONS OF THE ROYAL STATISTICAL SOCIETY GRADUATE DIPLOMA, 016 MODULE : Statistical Iferece Time allowed: Three hours Cadidates should aswer FIVE questios. All questios carry equal marks. The umber

More information

Lecture 7: Density Estimation: k-nearest Neighbor and Basis Approach

Lecture 7: Density Estimation: k-nearest Neighbor and Basis Approach STAT 425: Itroductio to Noparametric Statistics Witer 28 Lecture 7: Desity Estimatio: k-nearest Neighbor ad Basis Approach Istructor: Ye-Chi Che Referece: Sectio 8.4 of All of Noparametric Statistics.

More information

Big Picture. 5. Data, Estimates, and Models: quantifying the accuracy of estimates.

Big Picture. 5. Data, Estimates, and Models: quantifying the accuracy of estimates. 5. Data, Estimates, ad Models: quatifyig the accuracy of estimates. 5. Estimatig a Normal Mea 5.2 The Distributio of the Normal Sample Mea 5.3 Normal data, cofidece iterval for, kow 5.4 Normal data, cofidece

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

Chapter 7: Numerical Series

Chapter 7: Numerical Series Chapter 7: Numerical Series Chapter 7 Overview: Sequeces ad Numerical Series I most texts, the topic of sequeces ad series appears, at first, to be a side topic. There are almost o derivatives or itegrals

More information

A Block Cipher Using Linear Congruences

A Block Cipher Using Linear Congruences Joural of Computer Sciece 3 (7): 556-560, 2007 ISSN 1549-3636 2007 Sciece Publicatios A Block Cipher Usig Liear Cogrueces 1 V.U.K. Sastry ad 2 V. Jaaki 1 Academic Affairs, Sreeidhi Istitute of Sciece &

More information

The Random Walk For Dummies

The Random Walk For Dummies The Radom Walk For Dummies Richard A Mote Abstract We look at the priciples goverig the oe-dimesioal discrete radom walk First we review five basic cocepts of probability theory The we cosider the Beroulli

More information

This is an introductory course in Analysis of Variance and Design of Experiments.

This is an introductory course in Analysis of Variance and Design of Experiments. 1 Notes for M 384E, Wedesday, Jauary 21, 2009 (Please ote: I will ot pass out hard-copy class otes i future classes. If there are writte class otes, they will be posted o the web by the ight before class

More information

Output Analysis (2, Chapters 10 &11 Law)

Output Analysis (2, Chapters 10 &11 Law) B. Maddah ENMG 6 Simulatio Output Aalysis (, Chapters 10 &11 Law) Comparig alterative system cofiguratio Sice the output of a simulatio is radom, the comparig differet systems via simulatio should be doe

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

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

Some examples of vector spaces

Some examples of vector spaces Roberto s Notes o Liear Algebra Chapter 11: Vector spaces Sectio 2 Some examples of vector spaces What you eed to kow already: The te axioms eeded to idetify a vector space. What you ca lear here: Some

More information

Application to Random Graphs

Application to Random Graphs A Applicatio to Radom Graphs Brachig processes have a umber of iterestig ad importat applicatios. We shall cosider oe of the most famous of them, the Erdős-Réyi radom graph theory. 1 Defiitio A.1. Let

More information

Measurement uncertainty of the sound absorption

Measurement uncertainty of the sound absorption Measuremet ucertaity of the soud absorptio coefficiet Aa Izewska Buildig Research Istitute, Filtrowa Str., 00-6 Warsaw, Polad a.izewska@itb.pl 6887 The stadard ISO/IEC 705:005 o the competece of testig

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

IP Reference guide for integer programming formulations.

IP Reference guide for integer programming formulations. IP Referece guide for iteger programmig formulatios. by James B. Orli for 15.053 ad 15.058 This documet is iteded as a compact (or relatively compact) guide to the formulatio of iteger programs. For more

More information

Beurling Integers: Part 2

Beurling Integers: Part 2 Beurlig Itegers: Part 2 Isomorphisms Devi Platt July 11, 2015 1 Prime Factorizatio Sequeces I the last article we itroduced the Beurlig geeralized itegers, which ca be represeted as a sequece of real umbers

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

Lecture 14: Graph Entropy

Lecture 14: Graph Entropy 15-859: Iformatio Theory ad Applicatios i TCS Sprig 2013 Lecture 14: Graph Etropy March 19, 2013 Lecturer: Mahdi Cheraghchi Scribe: Euiwoog Lee 1 Recap Bergma s boud o the permaet Shearer s Lemma Number

More information

Massachusetts Institute of Technology

Massachusetts Institute of Technology Solutios to Quiz : Sprig 006 Problem : Each of the followig statemets is either True or False. There will be o partial credit give for the True False questios, thus ay explaatios will ot be graded. Please

More information