Revisiting the performance of mixtures of software reliability growth models
|
|
- Charlotte Wilson
- 5 years ago
- Views:
Transcription
1 Revisitig the performace of mixtures of software reliability growth models Peter A. Keiller 1, Charles J. Kim 1, Joh Trimble 1, ad Marlo Mejias 2 1 Departmet of Systems ad Computer Sciece 2 Departmet of Egieerig Maagemet ad Systems Egieerig Howard Uiversity George Washigto Uiversity Washigto D.C Washigto D.C Abstract I this paper, we evaluate the performace of a mixture of software reliability growth models (Super models) agaist the origial base models. The base models chose are four well kow ohomogeeous Poisso process (NHPP) growth models proposed i literature. We use the method of maximum likelihood for fittig these models to data. The Super models are based o the above base models plus a selectio criterio based o past predictio measures. Four Poisso type reliability models ad four Super models are evaluated based o their performace o three data sets. The performace is judged by the relative error of the predicted umber of failures over future time itervals relative to the umber of failures evetually observed durig the iterval. Coclusios are draw based o the aalysis of the results ad the use of the selectio of models. Key Words: Software reliability, Maximum Likelihood Method, Nohomogeeous Poisso process 1. Itroductio Software has ow become a itegral part i idustrial, fiacial, commercial, health, defese ad real time safety critical systems. I a 2002 press release the Natioal Istitute of Sciece ad Techology (NIST) estimated that 80% of developmet costs ivolve idetifyig ad correctig bugs. It is estimated that costs related to software failure amouted to over 70 millio US dollars. With the the icrease of complexity of software systems. maagig the quality of software i projects has ever bee more apparet The use of Software Relaibility Growth Models (SRGMs) ca address this maagemet problem by allowig the user to as accurately as possible predict the curret ad future reliability of the software o test. Research usig NHPP based software models have show that these models do perform creditably whe compared to expert opiio [1]. The problem that arise is that the estimates of these models however ted to either cosistetly overestimate or uderestimate the quality of the software [2]. I this research we propose the use of four commoly refereced NHPP models ad four mixture of models or Super models. This paper is a cotiuatio of the work doe by Keiller ad Miller [3]. Our reliability growth models o test iclude several of the well kow models i literature together with additioal models that we call 'Super models'. These Super models are based o a set of the usual reliability growth models plus a selectio criterio, which idetifies oe of the set to use for predictios at each poit of time; the selectio criterio is based o the 'quality-of-past predictio' measures. The object is to idetify the best models or approaches to be use durig the test phase. 2. Nohomogeeous Poisso Process A Poisso process is a coutig process characterized by its mea value fuctio; ad the cumulative umber of software failures up to time t, N(t), ca be described by the ohomogeeous Poisso process (NHPP). We also kow that the 'reliability growth process' ca be represeted as a coutig process {N(t),0 t} where {N(t) = max{i: T i t},0 t}, ad T i s are radom variables ad t i s are real scalars. The process is observed for t: 0 t t c where t c is the curret time ad (x 1,x 2,x 3, x c ) is a sequece of iterfailure times- x i = t i+1 t i. If we let N(t) be the umber of failures occurrig i a arbitrary iterval of time t, the for this coutig process {N(t),0 t} modeled by the NHPP, N(t) follows a Poisso distributio with parameter M(t). M(t) is called the mea value fuctio ad describes the expected cumulative umber of failures i (0,t). [3] Xie [4] ad Lyu[5] outlie the followig iformatio about the NHPP. The probability that N(t) is a give iteger is expressed by (M (t)) P(N(t) = ) = e -M (t), = 0,1,2,3,... (1)! The fuctio λ (t) which is called the istataeous
2 failure itesity is defied as P(N(t +Δt)- N(t) > 0) λ (t)= lim (2) Δ t-> 0+ Δ t If you are give λ (t), the mea fuctio M(t) = E{N(t)} satisfies t M (t)= λ(s)ds. 0 Reversig the process, if we kow M(t), the failure itesity at time t ca be obtaied as dm (t) λ (t)= (4) dt Also, the ohomogeeous Poisso processes have a idepedet Poisso umber of failures i disjoit itervals give by: P((N(t + s)- N(t)) = ) = e -(M(t+s)-M(t))! (3) (M (t+ s)- M (t)) 0 t, 0 s; =0,1,2,3, (5) By usig differet odecreasig fuctios M(t), we get differet NHPP models. The reliability fuctio at time t 0 is : -(M(t+t ) - M( t0)) 0 R(t t0) = e (6) = P(N(t 0 + t) N(t 0 )=0) The estimatio of the ukow parameters i M(t) is obtaied by usig either the method of maximum likelihood or the method of least squares. The likelihood fuctio for the NHPP model with mea value fuctio M(t) is the followig L( 1, 2,...,k) = k M(si)) i (M( si-1) - exp(m( si-1) - M(si)) = (7) i 1 i! where i deotes the umber of faults detected i time iterval ( si-1, si), ad 0<s 0 < s 1 < s 2 <.< s i, i 0, are the total moitored test times of the software. The parameters i M(t) are estimated by maximizig the likelihood fuctio. Takig the atural log of the likelihood fuctio, we use umerical algorithms to solve for the parameters [6]. 3. Software Reliability Models o Test 3.1 Base Models I this study the followig four parametric families of NHPPs, characterized by their mea fuctios: M1 Logarithmic M 1 (t) = log t 0< M2 Pareto M 2 (t) = t 0<,0< M3 Expoetial M 3 (t) = e - t 0 M4 Geeral Power M 4 (t) = ( t -1< are selected to represet oe group of models o test (the simple models). Model M1 represets the Musa-Okumoto model [7]; model M2 represets the Littlewood NHPP model [8]; ad model M3 represets the Goel-Okumoto model [9]. M4, the 'Geeral Power' curve arises aturally whe cosiderig order statistics of idepedet but oidetically expoetially distributed failure times. Musa ad Okumoto [7] have promoted the use of the NHPP models i software reliability growth modelig. Miller [10] also gives strog theoretical justificatio for usig the NHPP. 3.2 Super Models We cosider four Super models. Keiller ad Miller [3] defies a Super model as a set of parametric reliability growth models ad a selectio criterio; for a give software failure data set ad for a give time, the selectio criterio chooses the parametric model i the set that is to be used for makig predictios of future failure behavior. As time passes for a give data set, a give super model may chage its choice of parametric family to use for predictios. Our procedure for a Super model is as follows: usig maximum likelihood estimatio, we fit all four of the parametric models (M1-M4). Next, the selectio criterio picks oe parametric class based o the fitted models. The curret fitted model of the chose class is used for makig predictios at the curret time. We cosider four pure quality-of-predictio measures ( 8): the u-plot, the y-plot, the prequetial likelihood, ad the maximum likelihood values. Usig these criteria requires fittig each of the four NHPP models (M1-M4) after each failure ad calculatig the predictive distributio ad desity of the time util ext failure. To summarize, our four super models are all based o four NHPP models (M1-M4). The selectio criteria for the four super models are: M5 U-plot M6 Y-plot M7 Prequetial likelihood M8 Maximum likelihood The four additioal mixture of models were developed usig dyamic selectio amog models based o goodess-of-fit ad quality-of-predictio criteria such as
3 the u-plot, y-plot, prequetial likelihood ad the maximum likelihood values. Figure 3.1c (Data set TV2005) 3. Failure Data Collectio The failure data used i this research is take from the research by Almerig et. al [11]. The data is take from three software developmet projects for high-ed TV sets cotaiig several millio lies of code. The data sets related to the projects are referred to as TV2003, TV2004, ad TV2005. To give the reader a rough idea of the data, it is preseted i a aggregate form i Table 1. The total cumulative time for each data set is split ito 10 equal itervals ad the cumulative umber of failures occurrig up to each of the 10 elapsed poits is show. From this table, it is possible to costruct very rough plots of the reliability growth. Figures 3.1a -3.1c show the relatioship betwee the cumulative iterfailure times agaist the % test times (100% of the total test time of the software) of the tested data sets. Figure 3.1a (Data set TV2003) Table 1 Summary of Failure Data SYSTEM (# DEFECTS) 100 TV TV TV Performace Measures The performace measures are recapped from previous work [3 ]. 4.1 Quality of Predictio Figure 3.1b (Data set TV2004) Let x i+1 be give as the iterfailure time at time s i+1 (i.e. x i+1 = s i+1 - s i ). The first quality-of-predictio measure is the u- plot : it is well kow that U=F x (X) has a uiform distributio o the iterval [0,1]. Usig this fact, if i+1 ( ) is the true distributio of X i+1 the u i+ 1 = i+1 (x i+1 ) will be a observatio from U[0,1] distributio. Thus the empirical distributio formed from the u s should be closed to U[0,1]. If we observe o + failures, startig to make predictios after the o th failure, the plot of {(u o+i, i/(+1)), i = 1,2,3,.,} is the u-plot. The maximum deviatio of the u-plot from the idetity fuctio is a measure of quality-of- predictio. The secod measure of quality-of predictio is the yplot : if the predictive distributios are good the u s should look like a radom sequece of idepedet U[0,1] variables, ad log (1-u) s like expoetial radom variates. I this case, let y i = i j 1 log(1-u o+j ) j 1 log(1-u o+j i=1,2,3,., ad plot the pairs {y i,, i/(+1)), i= 1,2,3,..,}. If the predictive distributios are good, this plot should be close to the idetity fuctio. A quatitative measure
4 of the quality-of-predictio is the maximum deviatio betwee the y-plot ad the idetity fuctio. The third measures of quality-of-predictio is the prequetial likelihood: based o Dawid s geeralizatio of likelihood to a sequetial situatio, we have PL = i 1 o+i; where i+1 (s) = d i+1 (s) i 0 ds sum of the relative errors (RE), ad the sum of the relative errors squared (RESQ) are ormalized by averagig over the umber of predictios for the model. 5. Fidigs Table 2 shows the compariso rakig of the Base models (M1-M4) for each of the datasets o test usig the u-plot, y-plot, PL, ad ML performace measures. Tables 3a-3c show the Base models chose by Super Models 5-8 for each of the datasets o test. Table 2 Rakig of Base Models For compariso purposes, the best predictive system should have the largest prequetial likelihood. For a detailed discussio of these measures of quality-ofpredictio, see Brocklehurst [12]. These three measures give a dyamic real-time evaluatio of how well a give parametric model has doe predictig iterfailure times up to the preset. Brocklehurst [12] argues that it would seem logical to calculate the ext predictio usig the model which has performed best up to the preset o the particular software failure data set uder cosideratio. These three measures give a basis for makig this choice. 4.2 Goodess-of-Fit Measures The performace of the model is ivestigated for each data set to see how well it ca predict the umber of ew failures maifestig durig fiite future time itervals. The experimet is desiged as a four step process. For each data set D k, where k =1,..., 3: (1) The MLE's of the model parameters are determied based o the first d data poits of data set D k. (2) The fitted model is the used to predict the umber of failures i [s d, k,s,k ] where l sl,k xm,k ad x m,k is the mth data poit of m 1 data set D k. (3) The model is evaluated usig (i) predicted errors e = ˆ (ii) relative errors re ˆ (iii) absolute relative errors re (iv) relative error squared (re ) 2 where ˆ ( ) is the predicted (actual) umber of failures i [s 10,k,s,k ]. (4) For each data set, the aalysis (1)-(3) is performed for d = 10,..., k-1. The value te was selected arbitrarily but is large eough to eable meaigful estimatio ad small eough to allow for meaigful evaluatio of the procedure. The sum of the absolute relative errors (ARE), the DATASETS AND BASE MODELS ON TEST TV2003 TV2004 TV2005 M1 M2 M3 M4 M1 M2 M3 M4 M1 M2 M3 M4 U-PLOT Y-PLOT PL ML Table 3a Base Models Chose by Super-Models M5-M8 (SYSTEM ID: TV2003) SYSTEM ID: TV2003 U-PLOT:M5 M2 M2 M2 M2 M2 M2 M2 M2 M2 Y-PLOT:M6 M1 M1 M2 M2 M2 M1 M3 M3 M3 PL:M7 M4 M3 M1 M4 M4 M1 M3 M3 M3 ML:M8 M2 M4 M4 M3 M1 M3 M4 M4 M4 Table 3b Base Models Chose by Super-Models M5-M8 (SYSTEM ID: TV2004) SYSTEM ID: TV2004 U-PLOT M3 M3 M3 M4 M3 M3 M3 M3 M3 Y-PLOT M4 M3 M3 M4 M4 M3 M3 M3 M3 PL M4 M4 M4 M4 M4 M4 M3 M3 M3 ML M3 M3 M3 M3 M3 M3 M3 M3 M3 Table 3c Base Models Chose by Super-Model M5-M8 (SYSTEM ID: TV2005) SYSTEM ID: TV2005 U-PLOT M2 M3 M3 M1 M1 M1 M1 M1 M1 Y-PLOT M4 M4 M4 M4 M4 M4 M4 M2 M2 PL M4 M4 M4 M4 M4 M4 M4 M4 M4 ML M3 M3 M3 M2 M3 M3 M3 M3 M3
5 Tables 4a-4c show the rakig of models (RE, ARE, ad RESQ performace measures) for the datsets o test Table 4a Rakig of models M1-M8 (SYSTEM ID: TV2003) SYSTEM ID: TV2003 MODELS ON TEST RE ARE RESQ Table 4b Rakig of models M1-M8 (SYSTEM ID: TV2004) SYSTEM ID: TV2004 MODELS ON TEST RE ARE RESQ Table 4c Rakig of models M1-M8 (SYSTEM ID: TV2005) SYSTEM ID: TV2005 MODELS ON TEST RE ARE RESQ Coclusio I this experimet four NHPP models (M1-M4) ad four Super models (M5-M8) are ivestigated. The experimet uses 3 data sets. We oticed that there were o sigificat performace improvemets whe usig the Super models (M5-M8) compared to the Base models. We had expected oe of the simple models (M1-M4) to be truly a superior fittig model ad expected the model to be cosistetly chose by the Super models (M5-M8). This did ot happe. We expect to cotiue this study i a more cotrolled experimet based o Mote Carlo data ad usig model recalibratio methods[12].. 7. Ackowledgemet The research was supported by Grat # NRC REFERENCES [1] Keiller, P.A., ad Miller, D.R., O the use ad performace of software reliability growth models, i Reliability Egieerig ad System Safety, Special Issue o Software, Vol 32 Nos 1&2, 1991, [2] Keiller, P.A. ad Mazzuchi, T. A., Ivestigatig a Specific Class of Software Reliability Growth Models. Proceedigs of the Aual Reliability ad Maitaiability Symposium, 2002, [3] Keiller, P.A. ad Mazzuchi, T. A., Improvig the Predictability of the Musa-Okumoto Software Reliability Growth Model. The First Iteratioal Software Assurace Certificatio Coferece (ISACC 99),1999; B1-3. [4] Xie, M., Software Reliability modellig, World Scietific, Sigapore,1991. [5] Lyu, M., Software Reliability Egieerig Hadbook, IEEE Computer Press, [6] Nelder, J. A. & Mead, R., A simplex method for fuctio miimizatio., Computer Joural, 7 (1965) [7] Musa, J. D. ad Okumoto, K., A Logarithmic Poisso executio time model for software reliability measuremet, IEEE Proceedigs of the 7th Iteratioal Coferece o Software Egieerig, 1984, [8] Abdala-Ghaly, A.A., Cha, P.Y. ad Littlewood, B., Evaluatio of competig reliability predictios, IEEE Trasactios o Software Egieerig, SE-12, 1986, [9] Goel, A. L. ad Okumoto, K., Time-depedet errordetectio rate model for software reliability ad other performace measures,ieee Trasactios o Reliability, R-28, 1979, [10] Miller, D. R., Expoetial order statistic models of software reliability growth, CR-3909, Natioal Aeroautics ad Space Admiistratio, July 1985, (Abridged versio: IEEE Trasactio o Software Egieerig, SE-12, 1986, 12-24). [11] Vicet Almerig et al., Usig Software Reliability Growth Models i Practice, IEEE Software November/December 2007 (vol. 24 o.6) pp [12] Brocklehurst, S., Cha, P.Y., Littlewood, B., ad Shell, J., Recalibratig Software Reliability Models, IEEE Trasactio of Software Egieerig, Vol. 16, No. 4, 1990
3D Model Retrieval Method Based on Sample Prediction
20 Iteratioal Coferece o Computer Commuicatio ad Maagemet Proc.of CSIT vol.5 (20) (20) IACSIT Press, Sigapore 3D Model Retrieval Method Based o Sample Predictio Qigche Zhag, Ya Tag* School of Computer
More informationEmpirical Validate C&K Suite for Predict Fault-Proneness of Object-Oriented Classes Developed Using Fuzzy Logic.
Empirical Validate C&K Suite for Predict Fault-Proeess of Object-Orieted Classes Developed Usig Fuzzy Logic. Mohammad Amro 1, Moataz Ahmed 1, Kaaa Faisal 2 1 Iformatio ad Computer Sciece Departmet, Kig
More informationOur second algorithm. Comp 135 Machine Learning Computer Science Tufts University. Decision Trees. Decision Trees. Decision Trees.
Comp 135 Machie Learig Computer Sciece Tufts Uiversity Fall 2017 Roi Khardo Some of these slides were adapted from previous slides by Carla Brodley Our secod algorithm Let s look at a simple dataset for
More informationOnes Assignment Method for Solving Traveling Salesman Problem
Joural of mathematics ad computer sciece 0 (0), 58-65 Oes Assigmet Method for Solvig Travelig Salesma Problem Hadi Basirzadeh Departmet of Mathematics, Shahid Chamra Uiversity, Ahvaz, Ira Article history:
More informationAnalysis of Server Resource Consumption of Meteorological Satellite Application System Based on Contour Curve
Advaces i Computer, Sigals ad Systems (2018) 2: 19-25 Clausius Scietific Press, Caada Aalysis of Server Resource Cosumptio of Meteorological Satellite Applicatio System Based o Cotour Curve Xiagag Zhao
More informationThe Extended Weibull Geometric Family
The Exteded Weibull Geometric Family Giovaa Oliveira Silva 1 Gauss M. Cordeiro 2 Edwi M. M. Ortega 3 1 Itroductio The literature o Weibull models is vast, disjoited, ad scattered across may differet jourals.
More informationANALYSIS OF DELAYED S SHAPED SOFTWARE RELIABILITY GROWTH MODEL WITH TIME DEPENDENT FAULT CONTENT RATE FUNCTION
Joural of Data Sciece 857-878, DOI: 10.6339/JDS.201810_16(4).00010 ANALYSIS OF DELAYED S SHAPED SOFTWARE RELIABILITY GROWTH MODEL WITH TIME DEPENDENT FAULT CONTENT RATE FUNCTION David D. Haagal *, Nileema
More informationBayesian approach to reliability modelling for a probability of failure on demand parameter
Bayesia approach to reliability modellig for a probability of failure o demad parameter BÖRCSÖK J., SCHAEFER S. Departmet of Computer Architecture ad System Programmig Uiversity Kassel, Wilhelmshöher Allee
More informationA Study on Weibull Distribution for Estimating the Reliability Dr. P. K. Suri 1, Parul Raheja 2
www.ijecs.i Iteratioal Joural Of Egieerig Ad Computer Sciece ISSN:239-7242 Volume 4 Issue 7 July 205, Page No. 3447-345 A Study o Weibull Distributio for Estimatig the Reliability Dr. P. K. Suri, Parul
More informationRedundancy Allocation for Series Parallel Systems with Multiple Constraints and Sensitivity Analysis
IOSR Joural of Egieerig Redudacy Allocatio for Series Parallel Systems with Multiple Costraits ad Sesitivity Aalysis S. V. Suresh Babu, D.Maheswar 2, G. Ragaath 3 Y.Viaya Kumar d G.Sakaraiah e (Mechaical
More informationBezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only
Edited: Yeh-Liag Hsu (998--; recommeded: Yeh-Liag Hsu (--9; last updated: Yeh-Liag Hsu (9--7. Note: This is the course material for ME55 Geometric modelig ad computer graphics, Yua Ze Uiversity. art of
More informationFuzzy Linear Regression Analysis
12th IFAC Coferece o Programmable Devices ad Embedded Systems The Iteratioal Federatio of Automatic Cotrol September 25-27, 2013. Fuzzy Liear Regressio Aalysis Jaa Nowaková Miroslav Pokorý VŠB-Techical
More informationCS 683: Advanced Design and Analysis of Algorithms
CS 683: Advaced Desig ad Aalysis of Algorithms Lecture 6, February 1, 2008 Lecturer: Joh Hopcroft Scribes: Shaomei Wu, Etha Feldma February 7, 2008 1 Threshold for k CNF Satisfiability I the previous lecture,
More informationOctahedral Graph Scaling
Octahedral Graph Scalig Peter Russell Jauary 1, 2015 Abstract There is presetly o strog iterpretatio for the otio of -vertex graph scalig. This paper presets a ew defiitio for the term i the cotext of
More informationSoftware Fault Prediction of Unlabeled Program Modules
Software Fault Predictio of Ulabeled Program Modules C. Catal, U. Sevim, ad B. Diri, Member, IAENG Abstract Software metrics ad fault data belogig to a previous software versio are used to build the software
More informationImprovement of the Orthogonal Code Convolution Capabilities Using FPGA Implementation
Improvemet of the Orthogoal Code Covolutio Capabilities Usig FPGA Implemetatio Naima Kaabouch, Member, IEEE, Apara Dhirde, Member, IEEE, Saleh Faruque, Member, IEEE Departmet of Electrical Egieerig, Uiversity
More informationFREQUENCY ESTIMATION OF INTERNET PACKET STREAMS WITH LIMITED SPACE: UPPER AND LOWER BOUNDS
FREQUENCY ESTIMATION OF INTERNET PACKET STREAMS WITH LIMITED SPACE: UPPER AND LOWER BOUNDS Prosejit Bose Evagelos Kraakis Pat Mori Yihui Tag School of Computer Sciece, Carleto Uiversity {jit,kraakis,mori,y
More informationEvaluation scheme for Tracking in AMI
A M I C o m m u i c a t i o A U G M E N T E D M U L T I - P A R T Y I N T E R A C T I O N http://www.amiproject.org/ Evaluatio scheme for Trackig i AMI S. Schreiber a D. Gatica-Perez b AMI WP4 Trackig:
More informationA SOFTWARE RELIABILITY GROWTH MODEL FOR THREE-TIER CLIENT SERVER SYSTEM
2 Iteratioal Joural of Computer Applicatios (975 8887) Volume No. A SOFTWARE RELIABILITY GROWTH MODEL FOR THREE-TIER CLIENT SERVER SYSTEM Pradeep Kumar Iformatio Techology Departmet ABES Egieerig College,
More informationANN WHICH COVERS MLP AND RBF
ANN WHICH COVERS MLP AND RBF Josef Boští, Jaromír Kual Faculty of Nuclear Scieces ad Physical Egieerig, CTU i Prague Departmet of Software Egieerig Abstract Two basic types of artificial eural etwors Multi
More informationDynamic Programming and Curve Fitting Based Road Boundary Detection
Dyamic Programmig ad Curve Fittig Based Road Boudary Detectio SHYAM PRASAD ADHIKARI, HYONGSUK KIM, Divisio of Electroics ad Iformatio Egieerig Chobuk Natioal Uiversity 664-4 Ga Deokji-Dog Jeoju-City Jeobuk
More informationTHIN LAYER ORIENTED MAGNETOSTATIC CALCULATION MODULE FOR ELMER FEM, BASED ON THE METHOD OF THE MOMENTS. Roman Szewczyk
THIN LAYER ORIENTED MAGNETOSTATIC CALCULATION MODULE FOR ELMER FEM, BASED ON THE METHOD OF THE MOMENTS Roma Szewczyk Istitute of Metrology ad Biomedical Egieerig, Warsaw Uiversity of Techology E-mail:
More informationBASED ON ITERATIVE ERROR-CORRECTION
A COHPARISO OF CRYPTAALYTIC PRICIPLES BASED O ITERATIVE ERROR-CORRECTIO Miodrag J. MihaljeviC ad Jova Dj. GoliC Istitute of Applied Mathematics ad Electroics. Belgrade School of Electrical Egieerig. Uiversity
More informationPerformance Plus Software Parameter Definitions
Performace Plus+ Software Parameter Defiitios/ Performace Plus Software Parameter Defiitios Chapma Techical Note-TG-5 paramete.doc ev-0-03 Performace Plus+ Software Parameter Defiitios/2 Backgroud ad Defiitios
More informationImproving Information Retrieval System Security via an Optimal Maximal Coding Scheme
Improvig Iformatio Retrieval System Security via a Optimal Maximal Codig Scheme Dogyag Log Departmet of Computer Sciece, City Uiversity of Hog Kog, 8 Tat Chee Aveue Kowloo, Hog Kog SAR, PRC dylog@cs.cityu.edu.hk
More informationMobile terminal 3D image reconstruction program development based on Android Lin Qinhua
Iteratioal Coferece o Automatio, Mechaical Cotrol ad Computatioal Egieerig (AMCCE 05) Mobile termial 3D image recostructio program developmet based o Adroid Li Qihua Sichua Iformatio Techology College
More informationA Comparative Study of Positive and Negative Factorials
A Comparative Study of Positive ad Negative Factorials A. M. Ibrahim, A. E. Ezugwu, M. Isa Departmet of Mathematics, Ahmadu Bello Uiversity, Zaria Abstract. This paper preset a comparative study of the
More informationAssignment Problems with fuzzy costs using Ones Assignment Method
IOSR Joural of Mathematics (IOSR-JM) e-issn: 8-8, p-issn: 9-6. Volume, Issue Ver. V (Sep. - Oct.06), PP 8-89 www.iosrjourals.org Assigmet Problems with fuzzy costs usig Oes Assigmet Method S.Vimala, S.Krisha
More information4.3 Modeling with Arithmetic Sequences
Name Class Date 4.3 Modelig with Arithmetic Sequeces Essetial Questio: How ca you solve real-world problems usig arithmetic sequeces? Resource Locker Explore Iterpretig Models of Arithmetic Sequeces You
More informationBAYESIAN WITH FULL CONDITIONAL POSTERIOR DISTRIBUTION APPROACH FOR SOLUTION OF COMPLEX MODELS. Pudji Ismartini
Proceedig of Iteratioal Coferece O Research, Implemetatio Ad Educatio Of Mathematics Ad Scieces 014, Yogyakarta State Uiversity, 18-0 May 014 BAYESIAN WIH FULL CONDIIONAL POSERIOR DISRIBUION APPROACH FOR
More informationCounting the Number of Minimum Roman Dominating Functions of a Graph
Coutig the Number of Miimum Roma Domiatig Fuctios of a Graph SHI ZHENG ad KOH KHEE MENG, Natioal Uiversity of Sigapore We provide two algorithms coutig the umber of miimum Roma domiatig fuctios of a graph
More informationDesigning a learning system
CS 75 Itro to Machie Learig Lecture Desigig a learig system Milos Hauskrecht milos@pitt.edu 539 Seott Square, -5 people.cs.pitt.edu/~milos/courses/cs75/ Admiistrivia No homework assigmet this week Please
More informationANALYSIS OF RATIONAL FUNCTION DEPENDENCY TO THE HEIGHT DISTRIBUTION OF GROUND CONTROL POINTS IN GEOMETRIC CORRECTION OF AERIAL AND SATELLITE IMAGES
ANALSIS OF RATIONAL FUNCTION DEPENDENC TO THE HEIGHT DISTRIBUTION OF GROUND CONTROL POINTS IN GEOMETRIC CORRECTION OF AERIAL AND SATELLITE IMAGES M. Hosseii, Departmet of Geomatics Egieerig, Faculty of
More informationDATA MINING II - 1DL460
DATA MINING II - 1DL460 Sprig 2017 A secod course i data miig http://www.it.uu.se/edu/course/homepage/ifoutv2/vt17/ Kjell Orsbor Uppsala Database Laboratory Departmet of Iformatio Techology, Uppsala Uiversity,
More informationThe Magma Database file formats
The Magma Database file formats Adrew Gaylard, Bret Pikey, ad Mart-Mari Breedt Johaesburg, South Africa 15th May 2006 1 Summary Magma is a ope-source object database created by Chris Muller, of Kasas City,
More informationEffect of control points distribution on the orthorectification accuracy of an Ikonos II image through rational polynomial functions
Effect of cotrol poits distributio o the orthorectificatio accuracy of a Ikoos II image through ratioal polyomial fuctios Marcela do Valle Machado 1, Mauro Homem Atues 1 ad Paula Debiasi 1 1 Federal Rural
More informationarxiv: v2 [cs.ds] 24 Mar 2018
Similar Elemets ad Metric Labelig o Complete Graphs arxiv:1803.08037v [cs.ds] 4 Mar 018 Pedro F. Felzeszwalb Brow Uiversity Providece, RI, USA pff@brow.edu March 8, 018 We cosider a problem that ivolves
More informationNew HSL Distance Based Colour Clustering Algorithm
The 4th Midwest Artificial Itelligece ad Cogitive Scieces Coferece (MAICS 03 pp 85-9 New Albay Idiaa USA April 3-4 03 New HSL Distace Based Colour Clusterig Algorithm Vasile Patrascu Departemet of Iformatics
More informationMATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fitting)
MATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fittig) I this chapter, we will eamie some methods of aalysis ad data processig; data obtaied as a result of a give
More informationCSC 220: Computer Organization Unit 11 Basic Computer Organization and Design
College of Computer ad Iformatio Scieces Departmet of Computer Sciece CSC 220: Computer Orgaizatio Uit 11 Basic Computer Orgaizatio ad Desig 1 For the rest of the semester, we ll focus o computer architecture:
More informationFast Fourier Transform (FFT) Algorithms
Fast Fourier Trasform FFT Algorithms Relatio to the z-trasform elsewhere, ozero, z x z X x [ ] 2 ~ elsewhere,, ~ e j x X x x π j e z z X X π 2 ~ The DFS X represets evely spaced samples of the z- trasform
More informationStudy on effective detection method for specific data of large database LI Jin-feng
Iteratioal Coferece o Automatio, Mechaical Cotrol ad Computatioal Egieerig (AMCCE 205) Study o effective detectio method for specific data of large database LI Ji-feg (Vocatioal College of DogYig, Shadog
More informationSolving Fuzzy Assignment Problem Using Fourier Elimination Method
Global Joural of Pure ad Applied Mathematics. ISSN 0973-768 Volume 3, Number 2 (207), pp. 453-462 Research Idia Publicatios http://www.ripublicatio.com Solvig Fuzzy Assigmet Problem Usig Fourier Elimiatio
More informationA MODIFIED APPROACH FOR ESTIMATING PROCESS CAPABILITY INDICES USING IMPROVED ESTIMATORS
Pak. J. Statist. 017 Vol. 33(), 411-418 A MODIFIED APPROACH FOR ESTIMATING PROCESS CAPABILITY INDICES USING IMPROVED ESTIMATORS Seem Şaha Vahaplar 1 ad Özlem Ege Oruç Departmet of Statistics, Dokuz Eylül
More informationIdentification of the Swiss Z24 Highway Bridge by Frequency Domain Decomposition Brincker, Rune; Andersen, P.
Aalborg Uiversitet Idetificatio of the Swiss Z24 Highway Bridge by Frequecy Domai Decompositio Bricker, Rue; Aderse, P. Published i: Proceedigs of IMAC 2 Publicatio date: 22 Documet Versio Publisher's
More informationAn Improved Shuffled Frog-Leaping Algorithm for Knapsack Problem
A Improved Shuffled Frog-Leapig Algorithm for Kapsack Problem Zhoufag Li, Ya Zhou, ad Peg Cheg School of Iformatio Sciece ad Egieerig Hea Uiversity of Techology ZhegZhou, Chia lzhf1978@126.com Abstract.
More informationHarris Corner Detection Algorithm at Sub-pixel Level and Its Application Yuanfeng Han a, Peijiang Chen b * and Tian Meng c
Iteratioal Coferece o Computatioal Sciece ad Egieerig (ICCSE 015) Harris Corer Detectio Algorithm at Sub-pixel Level ad Its Applicatio Yuafeg Ha a, Peijiag Che b * ad Tia Meg c School of Automobile, Liyi
More information( n+1 2 ) , position=(7+1)/2 =4,(median is observation #4) Median=10lb
Chapter 3 Descriptive Measures Measures of Ceter (Cetral Tedecy) These measures will tell us where is the ceter of our data or where most typical value of a data set lies Mode the value that occurs most
More informationIMP: Superposer Integrated Morphometrics Package Superposition Tool
IMP: Superposer Itegrated Morphometrics Package Superpositio Tool Programmig by: David Lieber ( 03) Caisius College 200 Mai St. Buffalo, NY 4208 Cocept by: H. David Sheets, Dept. of Physics, Caisius College
More informationPython Programming: An Introduction to Computer Science
Pytho Programmig: A Itroductio to Computer Sciece Chapter 6 Defiig Fuctios Pytho Programmig, 2/e 1 Objectives To uderstad why programmers divide programs up ito sets of cooperatig fuctios. To be able to
More information1 Enterprise Modeler
1 Eterprise Modeler Itroductio I BaaERP, a Busiess Cotrol Model ad a Eterprise Structure Model for multi-site cofiguratios are itroduced. Eterprise Structure Model Busiess Cotrol Models Busiess Fuctio
More informationService Oriented Enterprise Architecture and Service Oriented Enterprise
Approved for Public Release Distributio Ulimited Case Number: 09-2786 The 23 rd Ope Group Eterprise Practitioers Coferece Service Orieted Eterprise ad Service Orieted Eterprise Ya Zhao, PhD Pricipal, MITRE
More informationAlgorithms Chapter 3 Growth of Functions
Algorithms Chapter 3 Growth of Fuctios Istructor: Chig Chi Li 林清池助理教授 chigchi.li@gmail.com Departmet of Computer Sciece ad Egieerig Natioal Taiwa Ocea Uiversity Outlie Asymptotic otatio Stadard otatios
More informationEvaluation of the Software Industry Competitiveness in Jilin Province Based on Factor Analysis
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 14, No 4 Sofia 2014 Prit ISSN: 1311-9702; Olie ISSN: 1314-4081 DOI: 10.1515/cait-2014-0008 Evaluatio of the Software Idustry
More informationPattern Recognition Systems Lab 1 Least Mean Squares
Patter Recogitio Systems Lab 1 Least Mea Squares 1. Objectives This laboratory work itroduces the OpeCV-based framework used throughout the course. I this assigmet a lie is fitted to a set of poits usig
More informationLecture 1: Introduction and Strassen s Algorithm
5-750: Graduate Algorithms Jauary 7, 08 Lecture : Itroductio ad Strasse s Algorithm Lecturer: Gary Miller Scribe: Robert Parker Itroductio Machie models I this class, we will primarily use the Radom Access
More informationA New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method
A ew Morphological 3D Shape Decompositio: Grayscale Iterframe Iterpolatio Method D.. Vizireau Politehica Uiversity Bucharest, Romaia ae@comm.pub.ro R. M. Udrea Politehica Uiversity Bucharest, Romaia mihea@comm.pub.ro
More informationOur Learning Problem, Again
Noparametric Desity Estimatio Matthew Stoe CS 520, Sprig 2000 Lecture 6 Our Learig Problem, Agai Use traiig data to estimate ukow probabilities ad probability desity fuctios So far, we have depeded o describig
More informationFuzzy Membership Function Optimization for System Identification Using an Extended Kalman Filter
Fuzzy Membership Fuctio Optimizatio for System Idetificatio Usig a Eteded Kalma Filter Srikira Kosaam ad Da Simo Clevelad State Uiversity NAFIPS Coferece Jue 4, 2006 Embedded Cotrol Systems Research Lab
More informationName Date Hr. ALGEBRA 1-2 SPRING FINAL MULTIPLE CHOICE REVIEW #1
Name Date Hr. ALGEBRA - SPRING FINAL MULTIPLE CHOICE REVIEW #. The high temperatures for Phoeix i October of 009 are listed below. Which measure of ceter will provide the most accurate estimatio of the
More informationCubic Polynomial Curves with a Shape Parameter
roceedigs of the th WSEAS Iteratioal Coferece o Robotics Cotrol ad Maufacturig Techology Hagzhou Chia April -8 00 (pp5-70) Cubic olyomial Curves with a Shape arameter MO GUOLIANG ZHAO YANAN Iformatio ad
More informationRapid Frequent Pattern Growth and Possibilistic Fuzzy C-means Algorithms for Improving the User Profiling Personalized Web Page Recommendation System
Received: November 21, 2017 237 Rapid Frequet Patter Growth ad Possibilistic Fuzzy C-meas Algorithms for Improvig the User Profilig Persoalized Web Page Recommedatio System Sipra Sahoo 1 * Bikram Kesari
More informationEuclidean Distance Based Feature Selection for Fault Detection Prediction Model in Semiconductor Manufacturing Process
Vol.133 (Iformatio Techology ad Computer Sciece 016), pp.85-89 http://dx.doi.org/10.1457/astl.016. Euclidea Distace Based Feature Selectio for Fault Detectio Predictio Model i Semicoductor Maufacturig
More informationLecture 13: Validation
Lecture 3: Validatio Resampli methods Holdout Cross Validatio Radom Subsampli -Fold Cross-Validatio Leave-oe-out The Bootstrap Bias ad variace estimatio Three-way data partitioi Itroductio to Patter Recoitio
More informationOptimal Mapped Mesh on the Circle
Koferece ANSYS 009 Optimal Mapped Mesh o the Circle doc. Ig. Jaroslav Štigler, Ph.D. Bro Uiversity of Techology, aculty of Mechaical gieerig, ergy Istitut, Abstract: This paper brigs out some ideas ad
More informationDesigning a learning system
CS 75 Machie Learig Lecture Desigig a learig system Milos Hauskrecht milos@cs.pitt.edu 539 Seott Square, x-5 people.cs.pitt.edu/~milos/courses/cs75/ Admiistrivia No homework assigmet this week Please try
More informationLecture 5. Counting Sort / Radix Sort
Lecture 5. Coutig Sort / Radix Sort T. H. Corme, C. E. Leiserso ad R. L. Rivest Itroductio to Algorithms, 3rd Editio, MIT Press, 2009 Sugkyukwa Uiversity Hyuseug Choo choo@skku.edu Copyright 2000-2018
More informationThe Closest Line to a Data Set in the Plane. David Gurney Southeastern Louisiana University Hammond, Louisiana
The Closest Lie to a Data Set i the Plae David Gurey Southeaster Louisiaa Uiversity Hammod, Louisiaa ABSTRACT This paper looks at three differet measures of distace betwee a lie ad a data set i the plae:
More informationStatistical Analysis of a Nonstationary Fatigue Data Using the ARIMA Approach
Statistical Aalysis of a Nostatioary Fatigue Data Usig the ARIMA Approach S. ABDULLAH, M. D. IBRAHIM, A. ZAHARIM AND Z. MOHD NOPIAH Egieerig Faculty, Uiversiti Kebagsaa Malaysia 43600 UKM Bagi, Selagor,
More informationSD vs. SD + One of the most important uses of sample statistics is to estimate the corresponding population parameters.
SD vs. SD + Oe of the most importat uses of sample statistics is to estimate the correspodig populatio parameters. The mea of a represetative sample is a good estimate of the mea of the populatio that
More informationStone Images Retrieval Based on Color Histogram
Stoe Images Retrieval Based o Color Histogram Qiag Zhao, Jie Yag, Jigyi Yag, Hogxig Liu School of Iformatio Egieerig, Wuha Uiversity of Techology Wuha, Chia Abstract Stoe images color features are chose
More informationNew Fuzzy Color Clustering Algorithm Based on hsl Similarity
IFSA-EUSFLAT 009 New Fuzzy Color Clusterig Algorithm Based o hsl Similarity Vasile Ptracu Departmet of Iformatics Techology Tarom Compay Bucharest Romaia Email: patrascu.v@gmail.com Abstract I this paper
More informationLow Complexity H.265/HEVC Coding Unit Size Decision for a Videoconferencing System
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 15, No 6 Special Issue o Logistics, Iformatics ad Service Sciece Sofia 2015 Prit ISSN: 1311-9702; Olie ISSN: 1314-4081 DOI:
More informationData Structures and Algorithms. Analysis of Algorithms
Data Structures ad Algorithms Aalysis of Algorithms Outlie Ruig time Pseudo-code Big-oh otatio Big-theta otatio Big-omega otatio Asymptotic algorithm aalysis Aalysis of Algorithms Iput Algorithm Output
More informationA Parallel DFA Minimization Algorithm
A Parallel DFA Miimizatio Algorithm Ambuj Tewari, Utkarsh Srivastava, ad P. Gupta Departmet of Computer Sciece & Egieerig Idia Istitute of Techology Kapur Kapur 208 016,INDIA pg@iitk.ac.i Abstract. I this
More informationAPPLICATION NOTE PACE1750AE BUILT-IN FUNCTIONS
APPLICATION NOTE PACE175AE BUILT-IN UNCTIONS About This Note This applicatio brief is iteded to explai ad demostrate the use of the special fuctios that are built ito the PACE175AE processor. These powerful
More informationDescriptive Statistics Summary Lists
Chapter 209 Descriptive Statistics Summary Lists Itroductio This procedure is used to summarize cotiuous data. Large volumes of such data may be easily summarized i statistical lists of meas, couts, stadard
More informationPruning and Summarizing the Discovered Time Series Association Rules from Mechanical Sensor Data Qing YANG1,a,*, Shao-Yu WANG1,b, Ting-Ting ZHANG2,c
Advaces i Egieerig Research (AER), volume 131 3rd Aual Iteratioal Coferece o Electroics, Electrical Egieerig ad Iformatio Sciece (EEEIS 2017) Pruig ad Summarizig the Discovered Time Series Associatio Rules
More informationENGI 4421 Probability and Statistics Faculty of Engineering and Applied Science Problem Set 1 Descriptive Statistics
ENGI 44 Probability ad Statistics Faculty of Egieerig ad Applied Sciece Problem Set Descriptive Statistics. If, i the set of values {,, 3, 4, 5, 6, 7 } a error causes the value 5 to be replaced by 50,
More informationRelationship between augmented eccentric connectivity index and some other graph invariants
Iteratioal Joural of Advaced Mathematical Scieces, () (03) 6-3 Sciece Publishig Corporatio wwwsciecepubcocom/idexphp/ijams Relatioship betwee augmeted eccetric coectivity idex ad some other graph ivariats
More informationEFFECT OF QUERY FORMATION ON WEB SEARCH ENGINE RESULTS
Iteratioal Joural o Natural Laguage Computig (IJNLC) Vol. 2, No., February 203 EFFECT OF QUERY FORMATION ON WEB SEARCH ENGINE RESULTS Raj Kishor Bisht ad Ila Pat Bisht 2 Departmet of Computer Sciece &
More informationHigher-order iterative methods free from second derivative for solving nonlinear equations
Iteratioal Joural of the Phsical Scieces Vol 6(8, pp 887-89, 8 April, Available olie at http://wwwacademicjouralsorg/ijps DOI: 5897/IJPS45 ISSN 99-95 Academic Jourals Full Legth Research Paper Higher-order
More informationOCR Statistics 1. Working with data. Section 3: Measures of spread
Notes ad Eamples OCR Statistics 1 Workig with data Sectio 3: Measures of spread Just as there are several differet measures of cetral tedec (averages), there are a variet of statistical measures of spread.
More informationCIS 121 Data Structures and Algorithms with Java Fall Big-Oh Notation Tuesday, September 5 (Make-up Friday, September 8)
CIS 11 Data Structures ad Algorithms with Java Fall 017 Big-Oh Notatio Tuesday, September 5 (Make-up Friday, September 8) Learig Goals Review Big-Oh ad lear big/small omega/theta otatios Practice solvig
More informationSoftware development of components for complex signal analysis on the example of adaptive recursive estimation methods.
Software developmet of compoets for complex sigal aalysis o the example of adaptive recursive estimatio methods. SIMON BOYMANN, RALPH MASCHOTTA, SILKE LEHMANN, DUNJA STEUER Istitute of Biomedical Egieerig
More informationAnalysis Metrics. Intro to Algorithm Analysis. Slides. 12. Alg Analysis. 12. Alg Analysis
Itro to Algorithm Aalysis Aalysis Metrics Slides. Table of Cotets. Aalysis Metrics 3. Exact Aalysis Rules 4. Simple Summatio 5. Summatio Formulas 6. Order of Magitude 7. Big-O otatio 8. Big-O Theorems
More informationTask scenarios Outline. Scenarios in Knowledge Extraction. Proposed Framework for Scenario to Design Diagram Transformation
6-0-0 Kowledge Trasformatio from Task Scearios to View-based Desig Diagrams Nima Dezhkam Kamra Sartipi {dezhka, sartipi}@mcmaster.ca Departmet of Computig ad Software McMaster Uiversity CANADA SEKE 08
More informationAn Efficient Algorithm for Graph Bisection of Triangularizations
A Efficiet Algorithm for Graph Bisectio of Triagularizatios Gerold Jäger Departmet of Computer Sciece Washigto Uiversity Campus Box 1045 Oe Brookigs Drive St. Louis, Missouri 63130-4899, USA jaegerg@cse.wustl.edu
More informationA Note on Least-norm Solution of Global WireWarping
A Note o Least-orm Solutio of Global WireWarpig Charlie C. L. Wag Departmet of Mechaical ad Automatio Egieerig The Chiese Uiversity of Hog Kog Shati, N.T., Hog Kog E-mail: cwag@mae.cuhk.edu.hk Abstract
More informationMathematical Stat I: solutions of homework 1
Mathematical Stat I: solutios of homework Name: Studet Id N:. Suppose we tur over cards simultaeously from two well shuffled decks of ordiary playig cards. We say we obtai a exact match o a particular
More informationAn Efficient Algorithm for Graph Bisection of Triangularizations
Applied Mathematical Scieces, Vol. 1, 2007, o. 25, 1203-1215 A Efficiet Algorithm for Graph Bisectio of Triagularizatios Gerold Jäger Departmet of Computer Sciece Washigto Uiversity Campus Box 1045, Oe
More informationSum-connectivity indices of trees and unicyclic graphs of fixed maximum degree
1 Sum-coectivity idices of trees ad uicyclic graphs of fixed maximum degree Zhibi Du a, Bo Zhou a *, Nead Triajstić b a Departmet of Mathematics, South Chia Normal Uiversity, uagzhou 510631, Chia email:
More informationLower Bounds for Sorting
Liear Sortig Topics Covered: Lower Bouds for Sortig Coutig Sort Radix Sort Bucket Sort Lower Bouds for Sortig Compariso vs. o-compariso sortig Decisio tree model Worst case lower boud Compariso Sortig
More informationEvaluation of Distributed and Replicated HLR for Location Management in PCS Network
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 9, 85-0 (2003) Evaluatio of Distributed ad Replicated HLR for Locatio Maagemet i PCS Network Departmet of Computer Sciece ad Iformatio Egieerig Natioal Chiao
More informationComputational Analysis of a Nonstationary Fatigue Data Using the ARIMA Approaches
Proceedigs of the th WSEAS Iteratioal Coferece o COMPUTERS, Agios Nikolaos, Crete Islad, Greece, July 26-28, 2007 508 Computatioal Aalysis of a Nostatioary Fatigue Data Usig the ARIMA Approaches S. ABDULLAH,
More informationOn the Accuracy of Vector Metrics for Quality Assessment in Image Filtering
0th IMEKO TC4 Iteratioal Symposium ad 8th Iteratioal Workshop o ADC Modellig ad Testig Research o Electric ad Electroic Measuremet for the Ecoomic Uptur Beeveto, Italy, September 5-7, 04 O the Accuracy
More informationOn Infinite Groups that are Isomorphic to its Proper Infinite Subgroup. Jaymar Talledo Balihon. Abstract
O Ifiite Groups that are Isomorphic to its Proper Ifiite Subgroup Jaymar Talledo Baliho Abstract Two groups are isomorphic if there exists a isomorphism betwee them Lagrage Theorem states that the order
More informationA Polynomial Interval Shortest-Route Algorithm for Acyclic Network
A Polyomial Iterval Shortest-Route Algorithm for Acyclic Network Hossai M Akter Key words: Iterval; iterval shortest-route problem; iterval algorithm; ucertaity Abstract A method ad algorithm is preseted
More informationForce Network Analysis using Complementary Energy
orce Network Aalysis usig Complemetary Eergy Adrew BORGART Assistat Professor Delft Uiversity of Techology Delft, The Netherlads A.Borgart@tudelft.l Yaick LIEM Studet Delft Uiversity of Techology Delft,
More informationUNIT 4 Section 8 Estimating Population Parameters using Confidence Intervals
UNIT 4 Sectio 8 Estimatig Populatio Parameters usig Cofidece Itervals To make ifereces about a populatio that caot be surveyed etirely, sample statistics ca be take from a SRS of the populatio ad used
More information