A Study on Weibull Distribution for Estimating the Reliability Dr. P. K. Suri 1, Parul Raheja 2

Size: px
Start display at page:

Download "A Study on Weibull Distribution for Estimating the Reliability Dr. P. K. Suri 1, Parul Raheja 2"

Transcription

1 Iteratioal Joural Of Egieerig Ad Computer Sciece ISSN: Volume 4 Issue 7 July 205, Page No A Study o Weibull Distributio for Estimatig the Reliability Dr. P. K. Suri, Parul Raheja 2 Dea, Research ad Developmet, Chairma, MCSE/IT/MCA, HCTM Kaithal, Haryaa, Idia pksurikuk@gmail.com 2 Studet, HCTM Kaithal, Haryaa, Idia parulraheja296@gmail.com Correspodig Author Abstract: I this paper we estimate reliability of a system usig Weibull distributio. Reliability is defied as whe a product does ot fail i a expected lifetime i specified coditios. I reliability applicatios Weibull Distributio is commoly used distributio. The Weibull distributio is a geeralizatio of the expoetial distributio. The two-parameter Weibull distributio ca accommodate icreasig, decreasig, or costat failure rates because of the great flexibility expressed through the model's parameter. This distributio is recogized today as idustrial stadard. This paper presets the maximum likelihood method for estimatig the Weibull distributio parameters. Weibull distributio is widely used i egieerig applicatios. Weibull distributio is aalysis with the Weibull Data Plot depict failure aalysis with extremely small samples. The Data plot is very helpful for egieers ad maagers. Keywords: Reliability, Weibull distributio, Parameter estimatio, Maximum likelihood method, Weibull probability plot... Itroductio With the developmet of ew techologies ad techiques the demad of bug free software icreasig,the software udergo extesive testig ad debuggig which is very costly ad time cosumig, ad compaies demad accurate iformatio how software reliability grows. Thus Weibull distributio is widely used i theory of reliability. This distributio was amed by Swedish scietist Waloddi Weibull ( ), who developed it i 937 ad published it i 95. Much type of failure rate behaviors ca be represeted by Weibull distributio. It is very flexible ad reliable i may practical applicatios. Reliability ca be estimated usig two or three parameter (shape, scale ad locatio) Weibull distributios. I this we estimate the reliability usig two parameter Weibull distributios. Dolas et.al []describes Graphical methods ad aalytical methods for estimatig the values of these parameters. Parameters estimatig usig Graphical methods like Weibull probability plottig ad hazard plot are ot very accurate but they are fast. But aalytical methods like maximum likelihood method, least square method etc are cosidered more accurate. This distributio is popular amog egieers because it has the ability to assume the characteristics of may distributios. Ivaa et.al [2]itroduced the four methods for estimatig the Weibull distributio parameters: the least square method (LSM), the weighted least square method (WLSM), the maximum likelihood method (MLM) ad the method of momets (MOM) ad compare their performace usig the Mote Carlo simulatio. The maximum likelihood method is most commoly used method for estimatig the parameters of a distributio ad commoly used by researchers. Li et.al [7] used mea square error to compare the least square method, the weighted least square method, the maximum likelihood method ad the method of momets. Estimatio method used Mote Carlo simulatio to obtai their statistical properties. A Advaced algorithm for maximum likelihood estimatio is give by A Yag et.al. [3].Wid Eergy has bee expressed by Weibull distributio fuctio ad two aalytical methods for calculatio of parameters are give by Paritosh [4]. Distributio of wid speeds of wid power statios is most commoly applicatio of the Weibull distributio. I[8], three differet models are used for calculatig the shape ad scale parameters of the Weibull distributio. To determie which model is best suited to desig wid coversio machies, i the Nigeria locatios. The method of momets is a appropriate method for estimatig. The failure probability of certai compoets ca be derived from the Weibull plot [5]. There are may egieerig problems that ca be solved with Weibull aalysis. Examples of problem solved are: [6]to order spare parts ad schedule maiteace labor, how may uits will be retured to depot for overhaul for each failure mode moth-by-moth ext year? The program maager wats to be 95% cofidet that he will have eough spare parts ad labor available to support the overall program. Or a project egieer reports three failures of a compoet i service operatios durig a three-moth period. The Program Maager asks, "How may failures will we have i the ext quarter, six moths, ad year?" What will it cost? What is the best corrective actio to reduce the risk ad losses? Thus Weibull aalysis proactively maage spare parts ivetories, compare reliability or predictio about product life. Kuag Chu et.al [0] calculate sample meas ad the sample root mea square errors for simulate three types of Weibull distributio costat failure rate, icreasig failure rate ad decreasig failure rate. The performace of the maximum likelihood method ad least squares method is uderstad by compariso betwee these two computatio approaches. Dr. P. K. Suri, IJECS Volume 4 Issue 7 July, 205 Page No Page 3447

2 Muhammad et. al [] proves how Weibull distributio is flexible to differet distributio. They also study the life time of the electrical ad mechaical compoets with the help of Weibull Quatile modelig. Reliability ad Quatile aalysis of the Weibull distributio is itroduced. Quatile models are also preseted graphically ad mathematically. Existig i literature there are may computatio approaches to estimate the values of the parameters. Also compariso betwee differet approaches has bee itroduced. The mai purpose of Weibull distributio is used to defie reliability ad ureliability. Weibull Plot is very useful i determiig the life of the compoets or their failure rates. Weibull Plot allow the user to determie that the proposed distributio fits the data it do ot give cofidece limits 2. Weibull Distributio i Weibull Failure Class Models Model A large umber of models have bee derived from the twoparameter Weibull distributio ad Referred as Weibull Models. Weibull ad gamma are two types of failure time classes models. I this we take the per-fault failure distributio to be the traditioal Weibull ad gamma distributios, respectively rather tha the expoetial distributio. I short Weibull model is statistical rather tha expoetial. Weibull distributio has great flexibility give for failure modelig because of the shape ad scale parameters that defie them. Hardware failure used this distributio. Weibull model is oe of the most widely used models for hardware reliability modelig i the Weibull distributio. It ca accommodate icreasig, decreasig, or costat failure rates because of the great flexibility expressed through the model's parameter. Weibull model is based o the followig assumptios: the umber of faults detected i each iterval is idepedet for ay fiite collectio of times. There is fixed umber of faults(n) i the software at the begiig of the time i which the software is observed. The time to fault of failure is distributed as a Weibull distributio with parameters α ad β. A fault is corrected istataeously without itroducig ew faults i the software. The Data requiremets to implemet this fault cout model are: (a) The umber of fault o each testig iterval i.e., f, f 2,.., f. (b)the Completio time of each period that the software is uder observatio: i.e., X,,X 2,...,X. The Weibull distributio ca be used i Weibull Model. The probability desity fuctio f(x) of the Weibull distributio W (β, α) with parameters β > 0ad α > 0 is give as: f(x) = β α (x α )β e (x α )β () probability desity fuctio Figure : The Weibull probability desity fuctio Where x > 0,β is the shape parameter, ad α is the scale parameter or the characteristic life at which 63.2% of the populatio ca be expected to have failed. Probability desity Fuctio f(x) determies how may parts have failed or will fail up to a defied ruig time. Figure shows the shape of Weibull probability desity fuctio with value of α=0 ad β=(, 2, 2.5,3.4) The cumulative distributio fuctio F(x) of the Weibull distributio is give as: F(x) = e (x α )β (2) cumulative distributio Figure 2: The Weibull cumulative distributio fuctio Where x >0, the costat α is called the scale parameter [9], because it scales the x variable ad β is called the shape parameter, because it decides the shape of the rate fuctio. The costat x is called lifetime variable. Figure 2 shows the Weibull cumulative distributio fuctio with value of α=0 ad β=(, 2, 2.5,3.4). All curves itersect at oe poit called the characteristic poit. Reliability R(x)determies how may parts are still i use after a certai ruig time. The reliability fuctio is probability i which system performs its iteded fuctio over a specific period of time. The two-parameter Weibull distributio reliability is give as: R(x) = e (x α )β (3) Dr. P. K. Suri, IJECS Volume 4 Issue 7 July, 205 Page No Page 3448

3 Reliability Fuctio l P(β,α) β = l α x i β l x i l α x β i= i= i + l x β α β i= i = 0 (9) O simplifyig the above equatios (8) ad (9) we obtai the equatios: α = ( l x i= i) β (0) Figure 3: The Weibull Reliability Fuctio Figure 3 shows the Weibull Reliability fuctio with value of α=0 ad β=(, 2, 2.5,3.4). The Weibull failure rate fuctio λ(x) is defied as the umber of failures per uit time that ca be expected to occur for the product. It is give as: x β i= i l x i β x β i= i + l x i= i = 0 () The estimate of the parameter α is obtaied i equatio (0). The estimate of the parameter β ca be obtaied by solvig the equatio () with respect to β. The equatio () must be solved umerically ot aalytical. This parameter is estimated usig Newto method. λ(x) = β α (x α )β (4) The mea life is the average time of failure-free operatio up to a failure evet. The MTTF of the Weibull Probability desity Fuctio is give as: MTTF = ( + ) (5) β 3. Estimatio of Parameter The most commoly method used method to estimate the parameters are the least square method (LSM), the weighted least square method (WLSM), the maximum likelihood method (MLM) ad the method of momets (MOM).All these methods are the aalytical methods. I this paper we used the maximum likelihood method which is used by researchers to estimate parameters of Weibull distributio. The estimatio of parameters ca be obtaied oly umerically[2]. Cosider Weibull radom variables X,,X 2,...,X are idepedet ad idetically distributed. Probability desity fuctio is give i equatio ().The likelihood fuctio of X,,X 2,...,X. ca be costructed from equatio () as: P(β, α) = f(x i, β, α) = β α β i= i= x i β e (x i α )β Now take atural logarithmic o both the sides, we l P (β, α) = l β β l α (6) x α β i= i β + (β ) i= l x i (7) Now differetiatig equatio (7) with respect to β ad α Equatig to zero we obtai followig equatios (8) ad (9): l P(β,α) α = β α + β x α β+ i= i β = 0 (8) 4.Weibull Aalysis ad Results Weibull aalysis helps to determie life of software by fittig a statistical distributio. Weibull aalysis is useful i graphical plot of the failure data. The data plot is extremely importat to the egieer ad to the maager. The Weibull data plot is particularly iformative as Weibull poited out i his 95 paper [6]. Figure 6 is a typical Weibull plot. Weibull probability plot is geerated to see how well radom Weibull data poits are actually fit by a Weibull distributio. The Weibull Plot is a plot of F(x) (cumulative distributio fuctio) vs. time. Note log scale used is base 0. Reliability fuctio R(x) is also kow as survivor fuctio []. Weibull parameter β is the slope of the Weibull plot determies which member of the family of Weibull failure distributios best fits or describes the data. [6] The slope, β, also idicates which class of failures is preset. Shape parameter α which is othig else tha the slope of the lie o the liearized Weibull graph 4. Effects of the Shape Parameter β 4.. Weibull Distributio with β Less Tha I early stage of software failures occur frequetly called ifat mortality (premature failures).the data that fit this distributio have iitial high umber of failures, which decrease over time as the defective items are elimiated from the sample. The probability decreases expoetially from ifiity Weibull Distributio with β Equal to Failure rate over the time remai cosistet called radom failures. This shape model the useful life of products. Figure shows the distributio decreases expoetially from / scale parameter Weibull Distributio with β betwee ad 2 Failure Rate shows whe β=icrease quickly, ad the decrease with time. This shape idicates early wear-out failures Weibull Distributio with β Equal to 2 Dr. P. K. Suri, IJECS Volume 4 Issue 7 July, 205 Page No Page 3449

4 Whe Risk of wear-out failure icreases steadily over the product lifetime this form of distributio is also called Rayleigh distributio. Figure shows β = Weibull Distributio with β betwee 3 ad 4 Whe software is i fial period of product life most failure happe. The bell-shaped is formed like ormal curve. 4.2 Case Study We calculate ow probability desity fuctio f(x),cumulative distributio fuctio F(x) ad reliability R(x)of the compoet for a operatig time of 000 hours. The failure time of certai Compoet has a Weibull distributio with Weibull parameters are: x = 000 β =.5 α = 5000 Reliability = R(x) = e (x α )β = e ( ).5 = or, I( I( Q(x)) = β I( β α ) I (I ( Q(x) y = I (I ( )) = β I(x) βi(α) )) Q(x) y = βt βi (α) The X-axis simply shows I(x).The Y-axis is βt βi (α) which is complicated. Now X-axis ad Y-axis of the Weibull Probability Plot show i Figure.4 is costructed. Weibull probability is oe of the method to calculatig the parameters of the Weibull distributio. Probability plot shows how well data fit by a Weibull distributio. Figure 4 show probability plot time to failure data. Today there are may software programs that are available i the market to aalyze reliability data. If poits makes a straight lie the data follows Weibull distributio. Otherwise, we cosider data is followig aother lifetime distributio. Cumulative desity fuctio = F(x)= e (x α )β = e ( ).5 = Failure rate = λ(x) = β α (x α )β = = Probability desity fuctio = R(x) λ(x) ( ).5 = = Coclusio This work has proposed a method of estimatig the reliability usig Weibull distributio. We have also study differet distributios fit ito Weibull distributio whe shape parameter chages. The reliability of the compoet is Estimatio of parameter is doe by the maximum likelihood method which is mostly used by researchers. The approximatio of fuctios was take with Weibull parameter are β =.5 ad α = 5000.Weibull aalysis tells which specific failure distributio is followig by the failure data. As the software compoet icreases day by day complexity of the system also icreases which leads a icrease i failure mechaism. This aalysis also help us to determie how items are failig. I (/ (-F(x)) I(x) Figure 4:Weibull probability plot[0] The cumulative distributio fuctio or reliability fuctio of the two parameter Weibull distributio is : F(x) = Q(x) = e (x α )β liearize this fuctio ito y = mt + c Q(x) = e (x α )β I( Q(x)) = I( e (x α )β ) I( Q(x)) = ( x α ) β Refereces [] D.R.Dolas, M.D. Jaybhaye, S.D. Deshmukh, Estimatio the System Reliability usig Weibull Distributio, IPEDR V [2] Ivaa Pobočíková ad Zuzaa Sedliačková, Compariso of Four Methods for Estimatig the Weibull Distributio Parameters, Applied Mathematical Scieces, Vol. 8, 204, o. 83, HIKARI Ltd, [3] J. Dai, A. Yag, ad Z. Yag., A Advaced Algorithm for Equatios of Maximum Likelihood Estimatio, Applied Mathematics A Joural of Chiese Uiversities (Ser. A),03, 2009 [4] Paritosh Bhattacharya., A Study o Weibull Distributio for Estimatig the Parameters, Joural applied quatitative methods,200, Vol.5 No.2, pp [5] K. Weibull Curt Roiger 202, "Reliability aalysis with Weibull" [6] Dr. Robert B. Aberethy., The New Weibull Hadbook, Chapter A Overview Of Weibull Aalysis, 536 Oyster Road, North Palm Beach, FL Dr. P. K. Suri, IJECS Volume 4 Issue 7 July, 205 Page No Page 3450

5 [7] D. Wu, J. Zhou, Y. Li., Methods for estimatig Weibull parameters for brittle materials, Joural of Material Sciece, 4(2006), [8] F.C.Odo ad G.U.Akubue, "Comparative Assessmet of Three Models for Estimatig Weibull Parameters for Wid Eergy Applicatios i a Nigeria Locatio," Iteratioal Joural of Eergy Sciece202 Vol.2 No.,PP [9] Yu-Kuag Chu ad Jau-Chua Ke., Computatio Approaches For Parameter Estimatio Of Weibull Distributio,,Mathematical ad Computatioal Applicatios, Vol. 7, No., pp , 202 [0] [Olie].Available: ok/apr/sectio/apr62.htm [] Muhammad Sahib Kha, Ghulam Rasul Pasha ad Ahmed Hesham Pasha., Reliability ad Quatile Aalysis of the Weibull distributio ISSN Joural of Statistics Volume 4, 2007, pp Dr. P. K. Suri, IJECS Volume 4 Issue 7 July, 205 Page No Page 345

The Extended Weibull Geometric Family

The 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 information

CS 683: Advanced Design and Analysis of Algorithms

CS 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 information

Ones Assignment Method for Solving Traveling Salesman Problem

Ones 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 information

THIN 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. 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 information

Bayesian approach to reliability modelling for a probability of failure on demand parameter

Bayesian 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 information

Redundancy Allocation for Series Parallel Systems with Multiple Constraints and Sensitivity Analysis

Redundancy 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 information

ANALYSIS OF DELAYED S SHAPED SOFTWARE RELIABILITY GROWTH MODEL WITH TIME DEPENDENT FAULT CONTENT RATE FUNCTION

ANALYSIS 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 information

Chapter 1. Introduction to Computers and C++ Programming. Copyright 2015 Pearson Education, Ltd.. All rights reserved.

Chapter 1. Introduction to Computers and C++ Programming. Copyright 2015 Pearson Education, Ltd.. All rights reserved. Chapter 1 Itroductio to Computers ad C++ Programmig Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 1.1 Computer Systems 1.2 Programmig ad Problem Solvig 1.3 Itroductio to C++ 1.4 Testig

More information

SD vs. SD + One of the most important uses of sample statistics is to estimate the corresponding population parameters.

SD 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 information

Pseudocode ( 1.1) Analysis of Algorithms. Primitive Operations. Pseudocode Details. Running Time ( 1.1) Estimating performance

Pseudocode ( 1.1) Analysis of Algorithms. Primitive Operations. Pseudocode Details. Running Time ( 1.1) Estimating performance Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Pseudocode ( 1.1) High-level descriptio of a algorithm More structured

More information

Cubic Polynomial Curves with a Shape Parameter

Cubic 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 information

EM375 STATISTICS AND MEASUREMENT UNCERTAINTY LEAST SQUARES LINEAR REGRESSION ANALYSIS

EM375 STATISTICS AND MEASUREMENT UNCERTAINTY LEAST SQUARES LINEAR REGRESSION ANALYSIS EM375 STATISTICS AND MEASUREMENT UNCERTAINTY LEAST SQUARES LINEAR REGRESSION ANALYSIS I this uit of the course we ivestigate fittig a straight lie to measured (x, y) data pairs. The equatio we wat to fit

More information

Mobile terminal 3D image reconstruction program development based on Android Lin Qinhua

Mobile 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 information

Chapter 3 Classification of FFT Processor Algorithms

Chapter 3 Classification of FFT Processor Algorithms Chapter Classificatio of FFT Processor Algorithms The computatioal complexity of the Discrete Fourier trasform (DFT) is very high. It requires () 2 complex multiplicatios ad () complex additios [5]. As

More information

Chapter 5. Functions for All Subtasks. Copyright 2015 Pearson Education, Ltd.. All rights reserved.

Chapter 5. Functions for All Subtasks. Copyright 2015 Pearson Education, Ltd.. All rights reserved. Chapter 5 Fuctios for All Subtasks Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 5.1 void Fuctios 5.2 Call-By-Referece Parameters 5.3 Usig Procedural Abstractio 5.4 Testig ad Debuggig

More information

Revisiting the performance of mixtures of software reliability growth models

Revisiting the performance of mixtures of software reliability growth models 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

More information

Python Programming: An Introduction to Computer Science

Python Programming: An Introduction to Computer Science Pytho Programmig: A Itroductio to Computer Sciece Chapter 1 Computers ad Programs 1 Objectives To uderstad the respective roles of hardware ad software i a computig system. To lear what computer scietists

More information

Performance Plus Software Parameter Definitions

Performance 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 information

BAYESIAN WITH FULL CONDITIONAL POSTERIOR DISTRIBUTION APPROACH FOR SOLUTION OF COMPLEX MODELS. Pudji Ismartini

BAYESIAN 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 information

An Improved Shuffled Frog-Leaping Algorithm for Knapsack Problem

An 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 information

Pattern Recognition Systems Lab 1 Least Mean Squares

Pattern 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 information

A MODIFIED APPROACH FOR ESTIMATING PROCESS CAPABILITY INDICES USING IMPROVED ESTIMATORS

A 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 information

A New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method

A 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 information

( n+1 2 ) , position=(7+1)/2 =4,(median is observation #4) Median=10lb

( 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 information

A Note on Least-norm Solution of Global WireWarping

A 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 information

3D Model Retrieval Method Based on Sample Prediction

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 information

Analysis of Server Resource Consumption of Meteorological Satellite Application System Based on Contour Curve

Analysis 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 information

BASED ON ITERATIVE ERROR-CORRECTION

BASED 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 information

ENGI 4421 Probability and Statistics Faculty of Engineering and Applied Science Problem Set 1 Descriptive Statistics

ENGI 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 information

Recursive Estimation

Recursive Estimation Recursive Estimatio Raffaello D Adrea Sprig 2 Problem Set: Probability Review Last updated: February 28, 2 Notes: Notatio: Uless otherwise oted, x, y, ad z deote radom variables, f x (x) (or the short

More information

A SOFTWARE RELIABILITY GROWTH MODEL FOR THREE-TIER CLIENT SERVER SYSTEM

A 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 information

Project 2.5 Improved Euler Implementation

Project 2.5 Improved Euler Implementation Project 2.5 Improved Euler Implemetatio Figure 2.5.10 i the text lists TI-85 ad BASIC programs implemetig the improved Euler method to approximate the solutio of the iitial value problem dy dx = x+ y,

More information

IMP: Superposer Integrated Morphometrics Package Superposition Tool

IMP: 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 information

Task scenarios Outline. Scenarios in Knowledge Extraction. Proposed Framework for Scenario to Design Diagram Transformation

Task 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 information

A General Framework for Accurate Statistical Timing Analysis Considering Correlations

A General Framework for Accurate Statistical Timing Analysis Considering Correlations A Geeral Framework for Accurate Statistical Timig Aalysis Cosiderig Correlatios 7.4 Vishal Khadelwal Departmet of ECE Uiversity of Marylad-College Park vishalk@glue.umd.edu Akur Srivastava Departmet of

More information

. Written in factored form it is easy to see that the roots are 2, 2, i,

. Written in factored form it is easy to see that the roots are 2, 2, i, CMPS A Itroductio to Programmig Programmig Assigmet 4 I this assigmet you will write a java program that determies the real roots of a polyomial that lie withi a specified rage. Recall that the roots (or

More information

BOOLEAN MATHEMATICS: GENERAL THEORY

BOOLEAN MATHEMATICS: GENERAL THEORY CHAPTER 3 BOOLEAN MATHEMATICS: GENERAL THEORY 3.1 ISOMORPHIC PROPERTIES The ame Boolea Arithmetic was chose because it was discovered that literal Boolea Algebra could have a isomorphic umerical aspect.

More information

Data Structures and Algorithms. Analysis of Algorithms

Data 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 information

Optimization for framework design of new product introduction management system Ma Ying, Wu Hongcui

Optimization for framework design of new product introduction management system Ma Ying, Wu Hongcui 2d Iteratioal Coferece o Electrical, Computer Egieerig ad Electroics (ICECEE 2015) Optimizatio for framework desig of ew product itroductio maagemet system Ma Yig, Wu Hogcui Tiaji Electroic Iformatio Vocatioal

More information

Harris Corner Detection Algorithm at Sub-pixel Level and Its Application Yuanfeng Han a, Peijiang Chen b * and Tian Meng c

Harris 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

Higher-order iterative methods free from second derivative for solving nonlinear equations

Higher-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 information

CMSC Computer Architecture Lecture 12: Virtual Memory. Prof. Yanjing Li University of Chicago

CMSC Computer Architecture Lecture 12: Virtual Memory. Prof. Yanjing Li University of Chicago CMSC 22200 Computer Architecture Lecture 12: Virtual Memory Prof. Yajig Li Uiversity of Chicago A System with Physical Memory Oly Examples: most Cray machies early PCs Memory early all embedded systems

More information

Normal Distributions

Normal Distributions Normal Distributios Stacey Hacock Look at these three differet data sets Each histogram is overlaid with a curve : A B C A) Weights (g) of ewly bor lab rat pups B) Mea aual temperatures ( F ) i A Arbor,

More information

Optimal Mapped Mesh on the Circle

Optimal 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 information

Euclidean Distance Based Feature Selection for Fault Detection Prediction Model in Semiconductor Manufacturing Process

Euclidean 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 information

Markov Chain Model of HomePlug CSMA MAC for Determining Optimal Fixed Contention Window Size

Markov Chain Model of HomePlug CSMA MAC for Determining Optimal Fixed Contention Window Size Markov Chai Model of HomePlug CSMA MAC for Determiig Optimal Fixed Cotetio Widow Size Eva Krimiger * ad Haiph Latchma Dept. of Electrical ad Computer Egieerig, Uiversity of Florida, Gaiesville, FL, USA

More information

9.1. Sequences and Series. Sequences. What you should learn. Why you should learn it. Definition of Sequence

9.1. Sequences and Series. Sequences. What you should learn. Why you should learn it. Definition of Sequence _9.qxd // : AM Page Chapter 9 Sequeces, Series, ad Probability 9. Sequeces ad Series What you should lear Use sequece otatio to write the terms of sequeces. Use factorial otatio. Use summatio otatio to

More information

Numerical Methods Lecture 6 - Curve Fitting Techniques

Numerical Methods Lecture 6 - Curve Fitting Techniques Numerical Methods Lecture 6 - Curve Fittig Techiques Topics motivatio iterpolatio liear regressio higher order polyomial form expoetial form Curve fittig - motivatio For root fidig, we used a give fuctio

More information

Lecture 13: Validation

Lecture 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 information

A Comparative Study on Modeling Methods for Switched Reluctance Machines

A Comparative Study on Modeling Methods for Switched Reluctance Machines Computer ad Iformatio Sciece Vol. 3, No. 2; May 21 A Comparative Study o Modelig Methods for Switched Reluctace Machies Shouju Sog & Weiguo iu School of Automatio, Northwester Polytechical Uiversity PO

More information

Running Time. Analysis of Algorithms. Experimental Studies. Limitations of Experiments

Running Time. Analysis of Algorithms. Experimental Studies. Limitations of Experiments Ruig Time Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Most algorithms trasform iput objects ito output objects. The

More information

Force Network Analysis using Complementary Energy

Force 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 information

The golden search method: Question 1

The golden search method: Question 1 1. Golde Sectio Search for the Mode of a Fuctio The golde search method: Questio 1 Suppose the last pair of poits at which we have a fuctio evaluatio is x(), y(). The accordig to the method, If f(x())

More information

Random Graphs and Complex Networks T

Random Graphs and Complex Networks T Radom Graphs ad Complex Networks T-79.7003 Charalampos E. Tsourakakis Aalto Uiversity Lecture 3 7 September 013 Aoucemet Homework 1 is out, due i two weeks from ow. Exercises: Probabilistic iequalities

More information

An Estimation of Distribution Algorithm for solving the Knapsack problem

An Estimation of Distribution Algorithm for solving the Knapsack problem Vol.4,No.5, 214 Published olie: May 25, 214 DOI: 1.7321/jscse.v4.5.1 A Estimatio of Distributio Algorithm for solvig the Kapsack problem 1 Ricardo Pérez, 2 S. Jös, 3 Arturo Herádez, 4 Carlos A. Ochoa *1,

More information

Octahedral Graph Scaling

Octahedral 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 information

Running Time ( 3.1) Analysis of Algorithms. Experimental Studies. Limitations of Experiments

Running Time ( 3.1) Analysis of Algorithms. Experimental Studies. Limitations of Experiments Ruig Time ( 3.1) Aalysis of Algorithms Iput Algorithm Output A algorithm is a step- by- step procedure for solvig a problem i a fiite amout of time. Most algorithms trasform iput objects ito output objects.

More information

Analysis of Algorithms

Analysis of Algorithms Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Ruig Time Most algorithms trasform iput objects ito output objects. The

More information

SOFTWARE usually does not work alone. It must have

SOFTWARE usually does not work alone. It must have Proceedigs of the 203 Federated Coferece o Computer Sciece ad Iformatio Systems pp. 343 348 A method for selectig eviromets for software compatibility testig Łukasz Pobereżik AGH Uiversity of Sciece ad

More information

Administrative UNSUPERVISED LEARNING. Unsupervised learning. Supervised learning 11/25/13. Final project. No office hours today

Administrative UNSUPERVISED LEARNING. Unsupervised learning. Supervised learning 11/25/13. Final project. No office hours today Admiistrative Fial project No office hours today UNSUPERVISED LEARNING David Kauchak CS 451 Fall 2013 Supervised learig Usupervised learig label label 1 label 3 model/ predictor label 4 label 5 Supervised

More information

A Study on the Performance of Cholesky-Factorization using MPI

A Study on the Performance of Cholesky-Factorization using MPI A Study o the Performace of Cholesky-Factorizatio usig MPI Ha S. Kim Scott B. Bade Departmet of Computer Sciece ad Egieerig Uiversity of Califoria Sa Diego {hskim, bade}@cs.ucsd.edu Abstract Cholesky-factorizatio

More information

Improving Template Based Spike Detection

Improving Template Based Spike Detection Improvig Template Based Spike Detectio Kirk Smith, Member - IEEE Portlad State Uiversity petra@ee.pdx.edu Abstract Template matchig algorithms like SSE, Covolutio ad Maximum Likelihood are well kow for

More information

CS2410 Computer Architecture. Flynn s Taxonomy

CS2410 Computer Architecture. Flynn s Taxonomy CS2410 Computer Architecture Dept. of Computer Sciece Uiversity of Pittsburgh http://www.cs.pitt.edu/~melhem/courses/2410p/idex.html 1 Fly s Taxoomy SISD Sigle istructio stream Sigle data stream (SIMD)

More information

CSC 220: Computer Organization Unit 11 Basic Computer Organization and Design

CSC 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 information

Lecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming

Lecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming Lecture Notes 6 Itroductio to algorithm aalysis CSS 501 Data Structures ad Object-Orieted Programmig Readig for this lecture: Carrao, Chapter 10 To be covered i this lecture: Itroductio to algorithm aalysis

More information

How do we evaluate algorithms?

How do we evaluate algorithms? F2 Readig referece: chapter 2 + slides Algorithm complexity Big O ad big Ω To calculate ruig time Aalysis of recursive Algorithms Next time: Litterature: slides mostly The first Algorithm desig methods:

More information

Algorithms for Disk Covering Problems with the Most Points

Algorithms for Disk Covering Problems with the Most Points Algorithms for Disk Coverig Problems with the Most Poits Bi Xiao Departmet of Computig Hog Kog Polytechic Uiversity Hug Hom, Kowloo, Hog Kog csbxiao@comp.polyu.edu.hk Qigfeg Zhuge, Yi He, Zili Shao, Edwi

More information

Designing a learning system

Designing 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 information

New Results on Energy of Graphs of Small Order

New Results on Energy of Graphs of Small Order Global Joural of Pure ad Applied Mathematics. ISSN 0973-1768 Volume 13, Number 7 (2017), pp. 2837-2848 Research Idia Publicatios http://www.ripublicatio.com New Results o Eergy of Graphs of Small Order

More information

Polynomial Functions and Models. Learning Objectives. Polynomials. P (x) = a n x n + a n 1 x n a 1 x + a 0, a n 0

Polynomial Functions and Models. Learning Objectives. Polynomials. P (x) = a n x n + a n 1 x n a 1 x + a 0, a n 0 Polyomial Fuctios ad Models 1 Learig Objectives 1. Idetify polyomial fuctios ad their degree 2. Graph polyomial fuctios usig trasformatios 3. Idetify the real zeros of a polyomial fuctio ad their multiplicity

More information

Morgan Kaufmann Publishers 26 February, COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 5

Morgan Kaufmann Publishers 26 February, COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 5 Morga Kaufma Publishers 26 February, 28 COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Chapter 5 Set-Associative Cache Architecture Performace Summary Whe CPU performace icreases:

More information

A Novel Hybrid Algorithm for Software Cost Estimation Based on Cuckoo Optimization and K-Nearest Neighbors Algorithms

A Novel Hybrid Algorithm for Software Cost Estimation Based on Cuckoo Optimization and K-Nearest Neighbors Algorithms Egieerig, Techology & Applied Sciece Research Vol. 6, No. 3, 26, 8-22 8 A Novel Hybrid Algorithm for Software Cost Estimatio Based o Optimizatio ad K-Nearest Neighbors Algorithms Elaz Eskadaria Miadoab

More information

The Closest Line to a Data Set in the Plane. David Gurney Southeastern Louisiana University Hammond, Louisiana

The 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 information

Designing a learning system

Designing 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 information

APPLICATION NOTE PACE1750AE BUILT-IN FUNCTIONS

APPLICATION 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 information

Empirical Validate C&K Suite for Predict Fault-Proneness of Object-Oriented Classes Developed Using Fuzzy Logic.

Empirical 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 information

Bezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only

Bezier 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 information

Civil Engineering Computation

Civil Engineering Computation Civil Egieerig Computatio Fidig Roots of No-Liear Equatios March 14, 1945 World War II The R.A.F. first operatioal use of the Grad Slam bomb, Bielefeld, Germay. Cotets 2 Root basics Excel solver Newto-Raphso

More information

Algorithm. Counting Sort Analysis of Algorithms

Algorithm. Counting Sort Analysis of Algorithms Algorithm Coutig Sort Aalysis of Algorithms Assumptios: records Coutig sort Each record cotais keys ad data All keys are i the rage of 1 to k Space The usorted list is stored i A, the sorted list will

More information

Sectio 4, a prototype project of settig field weight with AHP method is developed ad the experimetal results are aalyzed. Fially, we coclude our work

Sectio 4, a prototype project of settig field weight with AHP method is developed ad the experimetal results are aalyzed. Fially, we coclude our work 200 2d Iteratioal Coferece o Iformatio ad Multimedia Techology (ICIMT 200) IPCSIT vol. 42 (202) (202) IACSIT Press, Sigapore DOI: 0.7763/IPCSIT.202.V42.0 Idex Weight Decisio Based o AHP for Iformatio Retrieval

More information

Assignment Problems with fuzzy costs using Ones Assignment Method

Assignment 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 information

Pruning and Summarizing the Discovered Time Series Association Rules from Mechanical Sensor Data Qing YANG1,a,*, Shao-Yu WANG1,b, Ting-Ting ZHANG2,c

Pruning 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 information

Second-Order Domain Decomposition Method for Three-Dimensional Hyperbolic Problems

Second-Order Domain Decomposition Method for Three-Dimensional Hyperbolic Problems Iteratioal Mathematical Forum, Vol. 8, 013, o. 7, 311-317 Secod-Order Domai Decompositio Method for Three-Dimesioal Hyperbolic Problems Youbae Ju Departmet of Applied Mathematics Kumoh Natioal Istitute

More information

Protected points in ordered trees

Protected points in ordered trees Applied Mathematics Letters 008 56 50 www.elsevier.com/locate/aml Protected poits i ordered trees Gi-Sag Cheo a, Louis W. Shapiro b, a Departmet of Mathematics, Sugkyukwa Uiversity, Suwo 440-746, Republic

More information

Lecture 1: Introduction and Strassen s Algorithm

Lecture 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 information

Copyright 2016 Ramez Elmasri and Shamkant B. Navathe

Copyright 2016 Ramez Elmasri and Shamkant B. Navathe Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe CHAPTER 22 Database Recovery Techiques Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Itroductio Recovery algorithms Recovery cocepts Write-ahead

More information

FREQUENCY 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 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 information

MATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fitting)

MATHEMATICAL 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 information

Improvement of the Orthogonal Code Convolution Capabilities Using FPGA Implementation

Improvement 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 information

Structuring Redundancy for Fault Tolerance. CSE 598D: Fault Tolerant Software

Structuring Redundancy for Fault Tolerance. CSE 598D: Fault Tolerant Software Structurig Redudacy for Fault Tolerace CSE 598D: Fault Tolerat Software What do we wat to achieve? Versios Damage Assessmet Versio 1 Error Detectio Iputs Versio 2 Voter Outputs State Restoratio Cotiued

More information

The Penta-S: A Scalable Crossbar Network for Distributed Shared Memory Multiprocessor Systems

The Penta-S: A Scalable Crossbar Network for Distributed Shared Memory Multiprocessor Systems The Peta-S: A Scalable Crossbar Network for Distributed Shared Memory Multiprocessor Systems Abdulkarim Ayyad Departmet of Computer Egieerig, Al-Quds Uiversity, Jerusalem, P.O. Box 20002 Tel: 02-2797024,

More information

DATA MINING II - 1DL460

DATA 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 information

The number n of subintervals times the length h of subintervals gives length of interval (b-a).

The number n of subintervals times the length h of subintervals gives length of interval (b-a). Simulator with MadMath Kit: Riema Sums (Teacher s pages) I your kit: 1. GeoGebra file: Ready-to-use projector sized simulator: RiemaSumMM.ggb 2. RiemaSumMM.pdf (this file) ad RiemaSumMMEd.pdf (educator's

More information

Section 7.2: Direction Fields and Euler s Methods

Section 7.2: Direction Fields and Euler s Methods Sectio 7.: Directio ields ad Euler s Methods Practice HW from Stewart Tetbook ot to had i p. 5 # -3 9-3 odd or a give differetial equatio we wat to look at was to fid its solutio. I this chapter we will

More information

Creating Exact Bezier Representations of CST Shapes. David D. Marshall. California Polytechnic State University, San Luis Obispo, CA , USA

Creating Exact Bezier Representations of CST Shapes. David D. Marshall. California Polytechnic State University, San Luis Obispo, CA , USA Creatig Exact Bezier Represetatios of CST Shapes David D. Marshall Califoria Polytechic State Uiversity, Sa Luis Obispo, CA 93407-035, USA The paper presets a method of expressig CST shapes pioeered by

More information

Sorting in Linear Time. Data Structures and Algorithms Andrei Bulatov

Sorting in Linear Time. Data Structures and Algorithms Andrei Bulatov Sortig i Liear Time Data Structures ad Algorithms Adrei Bulatov Algorithms Sortig i Liear Time 7-2 Compariso Sorts The oly test that all the algorithms we have cosidered so far is compariso The oly iformatio

More information

Probabilistic Fuzzy Time Series Method Based on Artificial Neural Network

Probabilistic Fuzzy Time Series Method Based on Artificial Neural Network America Joural of Itelliget Systems 206, 6(2): 42-47 DOI: 0.5923/j.ajis.2060602.02 Probabilistic Fuzzy Time Series Method Based o Artificial Neural Network Erol Egrioglu,*, Ere Bas, Cagdas Haka Aladag

More information

Algorithms Chapter 3 Growth of Functions

Algorithms 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 information

AN OPTIMIZATION NETWORK FOR MATRIX INVERSION

AN OPTIMIZATION NETWORK FOR MATRIX INVERSION 397 AN OPTIMIZATION NETWORK FOR MATRIX INVERSION Ju-Seog Jag, S~ Youg Lee, ad Sag-Yug Shi Korea Advaced Istitute of Sciece ad Techology, P.O. Box 150, Cheogryag, Seoul, Korea ABSTRACT Iverse matrix calculatio

More information

On Computing the Fuzzy Weighted Average Using the KM Algorithms

On Computing the Fuzzy Weighted Average Using the KM Algorithms O Computig the Fuzzy Weighted Average Usig the KM Algorithms Feilog iu ad Jerry M Medel Sigal ad Image Processig Istitute, Departmet of Electrical Egieerig Uiversity of Souther Califoria, 3740 McClitock

More information