SlideShare a Scribd company logo
1 of 25
Bayesian Reliability Analysis of Certain
               Types

              of Systems

      W Discrete Failure Time
       ith

                  By

      Ketan A Gajjar, M.N .Patel
1.IntroductIon
The main concern of a maintenance
engineer has been the estimation of
reliability using operational data on a
system .

Estimates based on operational data
can be updated by incorporating past
environmental experiences on random
variations in the life-time parameters of
the system.
A component in a system which is
 capable of just two modes of
 performance, represented by a Bernoulli
 random variable“X”
 “X” assumes values 1 and 0 for the two
 modes - functioning and nonfunctioning
 respectively, having a probability
 distribution ,
P ( X = 1) = 1 − P ( X = 0) = θ ,   0 <θ <1
To investigate the ability of electronic
tubes to withstand successive voltage
overloads and the performance of
electric switches which are repeatedly
turned on and off, the geometric
distribution can be used as a discrete
failure model.
In each of these cases failure can
occur at the xth trial ( x=1,2,3,………)
with the probability of failure at any trial
as 1 - θ.
The probability mass function
of the failure at the xth trial is


f (x, θ ) = (1 − θ )θ x − 1,   x = 1,2,3,.....; 0 < θ < 1
                                             (1.1)
In the present study we have
considered Bayesian reliability analysis
of series, parallel, k out of n and
standby systems when lifetime of a
component is a geometric random
variable with p.m.f given in (1.1).
2. AssumptIons
i) Let x be the number of completed cycles /

  trials of an item denoting discrete failure
  time,following geometric distribution with
  Mean Time Between Failures (MTBF)
  as 1
       1−θ

ii) The prior distribution of parameter θ in
     (1.1) is
                 l −1          m−1
                    (1−θ )
    π (θ ) = θ                       ,0 < θ < 1 ; l , m > 0
                   β (l , m)
iii)If u represents the number of
failures during total testing time of T-1
trials ( i.e. the number of failures up to
T-1) and follows the Binomial
Distribution having p.m.f.(See: Patel and
Patel (2006))

                   T − 1                 u
      P (u |θ ) =        φ T −1−u
                   u              (1−φ )   ,
                        
                                                  n
      ( u = 0,1,2,...T − 1, T ∈ N ; 0 < θ <1;φ = θ )

                                                       (2.2)
iv) The posterior distribution of θ given that
n failures have been observed up to trial
T-1 can be obtained as

                       P(u | θ )π (θ )
      g1(θ | u ) = 1
                    ∫ P(u | θ )π (θ ) dθ
                  0

                         n(T −1−u )+l −1       m−1    nu
                       θ                (1−θ )    (1−θ )
                 =                                               ;
                      u  u    j                                    (2.3)
                      ∑   (−1) β ( n(T − 1 − u + j ) + l, m)
                     j =0  j 
                           
                        (0 < θ <1 ; n(T − 1 − u + j ), m > 0 )
3. BAyesIAn relIABIlIty
AnAlysIs of A k out of n
system

 In view of (1.1), reliability of an item for a mission
time, t is given by



            R(t ) = θ t ; t =1,2,3,.......; 0 <θ <1
(3.1)
Hence, reliability of a k out of n
system (kns) becomes
                     n     n          i           n−i
                           
            R (t ) = ∑     i  ( R(t )) (1− R(t ))
             kns    i=k    


Cases k=1 and k=n correspond
respectively, to a parallel and a series
system.
Upon using the posterior distribution of θ
given in (2.3) and assuming the squared
error loss function, the Bayes estimator of
the reliability of a k- out-of- n system, can be
obtained as,
  * (t )                    (t )
 R kns            R
           =E (       kns      |u)
                 1 n      n  it
                                      t n−i n(T −1−u )+l −1        m−1     n u dθ
                ∫ ∑           (θ ) (1−θ ) θ                  (1−θ )     (1−θ )
               0 i=k      i
           =                    u      u
                                             j
                                ∑      j (−1) β ( n(T − 1 − u + j ) + l , m)
                               j =0    
After some algebraic manipulations, we get
 *
R kns (t ) as

 *
               n
               ∑
              i=k
                    
                    
                    
                    
                          [
                           ∑ 
                        i  j =0  j 
                                
                                       {
                        n  n−i  n − i 
                                        
                                        
                                              u  u
                                             ∑   (−1)
                                                    r
                                            r =0  
                                                          r+ j
                                                                                                      }]
                                                               β ((i + j )t + n(T − 1 − u + r ) + l, m)
R kns (t )=                            u       u      r
                                      ∑         (−1) β ( n(T − 1 − u + j ) + l, m)
                                               r
                                     j =0      

                                                                                                   (3.2)
 Estimates for series and parallel systems
 follow as particular cases.
                                          *
 Bayes risk of                 estimator R kns (t ) is               defined as

                        r(R *, R ) = E [ E ( * (t ) − R ( t ) )2 ]                                 (3.3)
                                      θ u R kns
A few algebraic manipulations, give
      as
r ( R*, R )


 r(R *, R ) = ∑  [
              T −1
              u =0
                      *         2 2 *
                                  t
                                              n
                    (R kns (t )) − Rkns (t ) ∑  n  β ( (i + 1) , n − i + 1) +
                                                  
                                                  
                                            i =k  i         t
                            2
              1 n  n              1
                  ∑ ( ) β ( (2i + ) ,2 n − 2 i + 1) +
              t i =k  i           t

              1 n n  n  n           1
                 ∑ ∑    β ( (i + j + ) ,2 n − i − j + 1)
              t i≠ j j =k  i  j 
                                    t
                                                                 ]
 (3.4)
4. BAyesIAn relIABIlIty
AnAlysIs of A cold stAndBy
system (css)
  We, now consider an n- component
system in which only one component is
operating and the remaining (n-1)
components are kept standby to take over
the operation in succession when the
component in operation fails, assuming that
components cannot fail in the standby state
and that the switching and sensing device is
100 % reliable.
If R(t) denotes the reliability of each
component as given in (3.1), then the
reliability of a css is given by (See Govil
1983, page 68)
                                            r
                        n−1 (− log R(t ))
      R css(t ) = R(t ) ∑         r!
                        r =0                    (4.1)


 Finally, upon using the posterior distribution
of θ in (2.3) and assuming the squared error
loss function, the Bayes estimator of R css(t )
can be derived as
1 t n−1 (− log R(t )) r n(T −1−u )+l −1        m−1     nu
                    ∫ θ ∑         r!       θ                (1−θ )     (1−θ ) dθ
                    0   r =0
R css(t )                     u  u
            =                                j
                              ∑   (−1) β ( n(T − 1 − u + j ) + l, m)
                             j =0  j 
                                    




  After some algebraic manipulations, we get
                                                                    u       j +i
                                                                    
                                                                    j  (−1)
        *
       Rc ss (t )
                          n−1 r
                            ∑ t
                          r =0
                                {  m−1
                                     ∑
                                   i =0
                                          m − 1
                                         
                                          i 
                                         
                                                
                                                
                                                  [  ∑
                                                      u             
                                                    j =0 ( t + n(T −1− u + j ) + l + i) r
                                                                                            ]}
                    =                 u  u      j
                                      ∑   (−1) β ( n(T − 1 − u + j ) + l, m)
                                     j =0  j 
                                            
                                                                                            (4.2)
                                                      *
  Bayes risk of estimator of                         Rc ss (t )   can be defined
  as stated in (3.3).
5. sImulAtIon study And
dIscussIon

5.1 sImulAtIon studIes
    In this section, we have studied
reliability of different systems discussed
in sections 3 and 4 at mission time t for
different values of number of trials
performed (T), number of failures (u)
during trial and hyper parameters l and
m.
5.2   conclusIons

(i)For fixed l, m, k, t and T Bayes risk increases
with n for all the system.

(ii)For k out of n system (k≠1, n): For l = m
Bayes risk is smaller than that of under l > m for
fixed t, T and n.

(iii)For series system : When l = m , Bayes
risk is smaller then that of under l < m for fixed
t, T and n.
conclusIons contd…

(iv)For parallel system : For fixed l, as m
increases, Bayes risk decreases fixed t,T
and n.

(v)For standby system : For        l<m,
Bayes risk is smaller than that of under l = m
for fixed t, T and n.
Some recent studies by
*Sharma and Bhutani (1992, 1993),
*Sharma and Krishna (1994)
*Martz   and   Waller    (1982)
deal with these aspects in detail.
references

1. Govil, A.K. (1983): Reliability Engineering,
                    Tata        McGraw          Hill.
2. Kalbfeisch, J.D. and Prentice R.L. (1980):
   The Statistical Analysis of Failure Time Data,
            John       Wiley,       New        York.
3. Martz, H.F. and Waller, R.A. (1982): Bayesian
Reliability Analysis, John Wiley, New York.
4. Nelson, W.B. (1970): Hazard Plotting Methods for
Analysis of Life Data with Different Failure Models,
Journal of Quality Technology.Vol.2, pp. 126-149.
5. Patel, M.N. and Gajjar, A.V. (1990): Progressively
Censored Samples from Geometric Distribution, The
Aligarh Journal of Statistics, Vol.10, pp 1-8.
6. Patel, N.W. and Patel, M.N. (2003):
Estimation of Parameters of Mixed Geometric
Failure Models From Type –I Progressively
Group       Censored       Sample,       IAPQR
Transactions,       Vol.28,      pp.      33-41
7.Patel, N.W. and Patel, M.N. (2006): Some
Probabilistic Properties of Geometric Lifetime
Model,     IJOMAS,       Vol.22,     pp.    1-3.
8. Sharma, K.K. and Bhutani, R.K. (1992):
Bayesian Reliability Analysis of a Parallel
System, Reliability Engineering System
Safety. Vol. 37, pp. 227-230.
9. Sharma, K.K. and Bhutani, R.K. (1993):
Bayesian Analysis of System Availability,
Microelectronics and Reliability, Vol. 33, pp.
809-811.
10. Sharma, K.K. and Krishna, Hare (1994):
Bayesian Reliability Analysis of A k - out of n
- System and the Estimation of a Sample
Size and Censoring Time, Reliability
Engineering System Safety. Vol. 44, pp.
11-15.
11. Yaqub, M and Khan, A.H (1981):
Geometric Failure Law in Life Testing, Pure
and Applied Mathematika Sciences, Vol.
XLV, No.1-2, pp. 69-76.
Bayesian Reliability Analysis of Discrete Failure Time Systems

More Related Content

What's hot

Levitan Centenary Conference Talk, June 27 2014
Levitan Centenary Conference Talk, June 27 2014Levitan Centenary Conference Talk, June 27 2014
Levitan Centenary Conference Talk, June 27 2014Nikita V. Artamonov
 
2003 Ames.Models
2003 Ames.Models2003 Ames.Models
2003 Ames.Modelspinchung
 
On problem-of-parameters-identification-of-dynamic-object
On problem-of-parameters-identification-of-dynamic-objectOn problem-of-parameters-identification-of-dynamic-object
On problem-of-parameters-identification-of-dynamic-objectCemal Ardil
 
Random Matrix Theory and Machine Learning - Part 2
Random Matrix Theory and Machine Learning - Part 2Random Matrix Theory and Machine Learning - Part 2
Random Matrix Theory and Machine Learning - Part 2Fabian Pedregosa
 
Fixed point theorem of discontinuity and weak compatibility in non complete n...
Fixed point theorem of discontinuity and weak compatibility in non complete n...Fixed point theorem of discontinuity and weak compatibility in non complete n...
Fixed point theorem of discontinuity and weak compatibility in non complete n...Alexander Decker
 
11.fixed point theorem of discontinuity and weak compatibility in non complet...
11.fixed point theorem of discontinuity and weak compatibility in non complet...11.fixed point theorem of discontinuity and weak compatibility in non complet...
11.fixed point theorem of discontinuity and weak compatibility in non complet...Alexander Decker
 
Random Matrix Theory and Machine Learning - Part 3
Random Matrix Theory and Machine Learning - Part 3Random Matrix Theory and Machine Learning - Part 3
Random Matrix Theory and Machine Learning - Part 3Fabian Pedregosa
 
Introduction to modern time series analysis
Introduction to modern time series analysisIntroduction to modern time series analysis
Introduction to modern time series analysisSpringer
 
kinks and cusps in the transition dynamics of a bloch state
kinks and cusps in the transition dynamics of a bloch statekinks and cusps in the transition dynamics of a bloch state
kinks and cusps in the transition dynamics of a bloch statejiang-min zhang
 
11.[104 111]analytical solution for telegraph equation by modified of sumudu ...
11.[104 111]analytical solution for telegraph equation by modified of sumudu ...11.[104 111]analytical solution for telegraph equation by modified of sumudu ...
11.[104 111]analytical solution for telegraph equation by modified of sumudu ...Alexander Decker
 
Random Matrix Theory and Machine Learning - Part 4
Random Matrix Theory and Machine Learning - Part 4Random Matrix Theory and Machine Learning - Part 4
Random Matrix Theory and Machine Learning - Part 4Fabian Pedregosa
 
On the solvability of a system of forward-backward linear equations with unbo...
On the solvability of a system of forward-backward linear equations with unbo...On the solvability of a system of forward-backward linear equations with unbo...
On the solvability of a system of forward-backward linear equations with unbo...Nikita V. Artamonov
 
Talk in BayesComp 2018
Talk in BayesComp 2018Talk in BayesComp 2018
Talk in BayesComp 2018JeremyHeng10
 
Eece 301 note set 14 fourier transform
Eece 301 note set 14 fourier transformEece 301 note set 14 fourier transform
Eece 301 note set 14 fourier transformSandilya Sridhara
 
Numerical solution of spatiotemporal models from ecology
Numerical solution of spatiotemporal models from ecologyNumerical solution of spatiotemporal models from ecology
Numerical solution of spatiotemporal models from ecologyKyrre Wahl Kongsgård
 
PaperNo13-Habibi-IMF
PaperNo13-Habibi-IMFPaperNo13-Habibi-IMF
PaperNo13-Habibi-IMFMezban Habibi
 
Lecture8 Signal and Systems
Lecture8 Signal and SystemsLecture8 Signal and Systems
Lecture8 Signal and Systemsbabak danyal
 
Random Matrix Theory and Machine Learning - Part 1
Random Matrix Theory and Machine Learning - Part 1Random Matrix Theory and Machine Learning - Part 1
Random Matrix Theory and Machine Learning - Part 1Fabian Pedregosa
 

What's hot (20)

2018 MUMS Fall Course - Statistical Representation of Model Input (EDITED) - ...
2018 MUMS Fall Course - Statistical Representation of Model Input (EDITED) - ...2018 MUMS Fall Course - Statistical Representation of Model Input (EDITED) - ...
2018 MUMS Fall Course - Statistical Representation of Model Input (EDITED) - ...
 
Levitan Centenary Conference Talk, June 27 2014
Levitan Centenary Conference Talk, June 27 2014Levitan Centenary Conference Talk, June 27 2014
Levitan Centenary Conference Talk, June 27 2014
 
2003 Ames.Models
2003 Ames.Models2003 Ames.Models
2003 Ames.Models
 
On problem-of-parameters-identification-of-dynamic-object
On problem-of-parameters-identification-of-dynamic-objectOn problem-of-parameters-identification-of-dynamic-object
On problem-of-parameters-identification-of-dynamic-object
 
Random Matrix Theory and Machine Learning - Part 2
Random Matrix Theory and Machine Learning - Part 2Random Matrix Theory and Machine Learning - Part 2
Random Matrix Theory and Machine Learning - Part 2
 
2018 MUMS Fall Course - Bayesian inference for model calibration in UQ - Ralp...
2018 MUMS Fall Course - Bayesian inference for model calibration in UQ - Ralp...2018 MUMS Fall Course - Bayesian inference for model calibration in UQ - Ralp...
2018 MUMS Fall Course - Bayesian inference for model calibration in UQ - Ralp...
 
Fixed point theorem of discontinuity and weak compatibility in non complete n...
Fixed point theorem of discontinuity and weak compatibility in non complete n...Fixed point theorem of discontinuity and weak compatibility in non complete n...
Fixed point theorem of discontinuity and weak compatibility in non complete n...
 
11.fixed point theorem of discontinuity and weak compatibility in non complet...
11.fixed point theorem of discontinuity and weak compatibility in non complet...11.fixed point theorem of discontinuity and weak compatibility in non complet...
11.fixed point theorem of discontinuity and weak compatibility in non complet...
 
Random Matrix Theory and Machine Learning - Part 3
Random Matrix Theory and Machine Learning - Part 3Random Matrix Theory and Machine Learning - Part 3
Random Matrix Theory and Machine Learning - Part 3
 
Introduction to modern time series analysis
Introduction to modern time series analysisIntroduction to modern time series analysis
Introduction to modern time series analysis
 
kinks and cusps in the transition dynamics of a bloch state
kinks and cusps in the transition dynamics of a bloch statekinks and cusps in the transition dynamics of a bloch state
kinks and cusps in the transition dynamics of a bloch state
 
11.[104 111]analytical solution for telegraph equation by modified of sumudu ...
11.[104 111]analytical solution for telegraph equation by modified of sumudu ...11.[104 111]analytical solution for telegraph equation by modified of sumudu ...
11.[104 111]analytical solution for telegraph equation by modified of sumudu ...
 
Random Matrix Theory and Machine Learning - Part 4
Random Matrix Theory and Machine Learning - Part 4Random Matrix Theory and Machine Learning - Part 4
Random Matrix Theory and Machine Learning - Part 4
 
On the solvability of a system of forward-backward linear equations with unbo...
On the solvability of a system of forward-backward linear equations with unbo...On the solvability of a system of forward-backward linear equations with unbo...
On the solvability of a system of forward-backward linear equations with unbo...
 
Talk in BayesComp 2018
Talk in BayesComp 2018Talk in BayesComp 2018
Talk in BayesComp 2018
 
Eece 301 note set 14 fourier transform
Eece 301 note set 14 fourier transformEece 301 note set 14 fourier transform
Eece 301 note set 14 fourier transform
 
Numerical solution of spatiotemporal models from ecology
Numerical solution of spatiotemporal models from ecologyNumerical solution of spatiotemporal models from ecology
Numerical solution of spatiotemporal models from ecology
 
PaperNo13-Habibi-IMF
PaperNo13-Habibi-IMFPaperNo13-Habibi-IMF
PaperNo13-Habibi-IMF
 
Lecture8 Signal and Systems
Lecture8 Signal and SystemsLecture8 Signal and Systems
Lecture8 Signal and Systems
 
Random Matrix Theory and Machine Learning - Part 1
Random Matrix Theory and Machine Learning - Part 1Random Matrix Theory and Machine Learning - Part 1
Random Matrix Theory and Machine Learning - Part 1
 

Similar to Bayesian Reliability Analysis of Discrete Failure Time Systems

Lesson 7: Vector-valued functions
Lesson 7: Vector-valued functionsLesson 7: Vector-valued functions
Lesson 7: Vector-valued functionsMatthew Leingang
 
Comparison Theorems for SDEs
Comparison Theorems for SDEs Comparison Theorems for SDEs
Comparison Theorems for SDEs Ilya Gikhman
 
A family of implicit higher order methods for the numerical integration of se...
A family of implicit higher order methods for the numerical integration of se...A family of implicit higher order methods for the numerical integration of se...
A family of implicit higher order methods for the numerical integration of se...Alexander Decker
 
Métodos computacionales para el estudio de modelos epidemiológicos con incer...
Métodos computacionales para el estudio de modelos  epidemiológicos con incer...Métodos computacionales para el estudio de modelos  epidemiológicos con incer...
Métodos computacionales para el estudio de modelos epidemiológicos con incer...Facultad de Informática UCM
 
Signal and Systems part i
Signal and Systems part iSignal and Systems part i
Signal and Systems part iPatrickMumba7
 
8fbf4451c622e6efbcf7452222d21ea5_MITRES_6_007S11_hw02.pdf
8fbf4451c622e6efbcf7452222d21ea5_MITRES_6_007S11_hw02.pdf8fbf4451c622e6efbcf7452222d21ea5_MITRES_6_007S11_hw02.pdf
8fbf4451c622e6efbcf7452222d21ea5_MITRES_6_007S11_hw02.pdfTsegaTeklewold1
 
The feedback-control-for-distributed-systems
The feedback-control-for-distributed-systemsThe feedback-control-for-distributed-systems
The feedback-control-for-distributed-systemsCemal Ardil
 
Research Inventy : International Journal of Engineering and Science
Research Inventy : International Journal of Engineering and ScienceResearch Inventy : International Journal of Engineering and Science
Research Inventy : International Journal of Engineering and Scienceresearchinventy
 
Tele3113 wk1tue
Tele3113 wk1tueTele3113 wk1tue
Tele3113 wk1tueVin Voro
 
7076 chapter5 slides
7076 chapter5 slides7076 chapter5 slides
7076 chapter5 slidesNguyen Mina
 
Adaptive dynamic programming for control
Adaptive dynamic programming for controlAdaptive dynamic programming for control
Adaptive dynamic programming for controlSpringer
 
Convolution problems
Convolution problemsConvolution problems
Convolution problemsPatrickMumba7
 

Similar to Bayesian Reliability Analysis of Discrete Failure Time Systems (20)

Lesson 7: Vector-valued functions
Lesson 7: Vector-valued functionsLesson 7: Vector-valued functions
Lesson 7: Vector-valued functions
 
Comparison Theorems for SDEs
Comparison Theorems for SDEs Comparison Theorems for SDEs
Comparison Theorems for SDEs
 
Chapter3 laplace
Chapter3 laplaceChapter3 laplace
Chapter3 laplace
 
A family of implicit higher order methods for the numerical integration of se...
A family of implicit higher order methods for the numerical integration of se...A family of implicit higher order methods for the numerical integration of se...
A family of implicit higher order methods for the numerical integration of se...
 
Cash Settled Interest Rate Swap Futures
Cash Settled Interest Rate Swap FuturesCash Settled Interest Rate Swap Futures
Cash Settled Interest Rate Swap Futures
 
Métodos computacionales para el estudio de modelos epidemiológicos con incer...
Métodos computacionales para el estudio de modelos  epidemiológicos con incer...Métodos computacionales para el estudio de modelos  epidemiológicos con incer...
Métodos computacionales para el estudio de modelos epidemiológicos con incer...
 
Ss 2013 midterm
Ss 2013 midtermSs 2013 midterm
Ss 2013 midterm
 
Ss 2013 midterm
Ss 2013 midtermSs 2013 midterm
Ss 2013 midterm
 
Signal and Systems part i
Signal and Systems part iSignal and Systems part i
Signal and Systems part i
 
8fbf4451c622e6efbcf7452222d21ea5_MITRES_6_007S11_hw02.pdf
8fbf4451c622e6efbcf7452222d21ea5_MITRES_6_007S11_hw02.pdf8fbf4451c622e6efbcf7452222d21ea5_MITRES_6_007S11_hw02.pdf
8fbf4451c622e6efbcf7452222d21ea5_MITRES_6_007S11_hw02.pdf
 
CME Deliverable Interest Rate Swap Future
CME Deliverable Interest Rate Swap FutureCME Deliverable Interest Rate Swap Future
CME Deliverable Interest Rate Swap Future
 
NODDEA2012_VANKOVA
NODDEA2012_VANKOVANODDEA2012_VANKOVA
NODDEA2012_VANKOVA
 
The feedback-control-for-distributed-systems
The feedback-control-for-distributed-systemsThe feedback-control-for-distributed-systems
The feedback-control-for-distributed-systems
 
Kt2418201822
Kt2418201822Kt2418201822
Kt2418201822
 
Research Inventy : International Journal of Engineering and Science
Research Inventy : International Journal of Engineering and ScienceResearch Inventy : International Journal of Engineering and Science
Research Inventy : International Journal of Engineering and Science
 
Tele3113 wk1tue
Tele3113 wk1tueTele3113 wk1tue
Tele3113 wk1tue
 
7076 chapter5 slides
7076 chapter5 slides7076 chapter5 slides
7076 chapter5 slides
 
Adaptive dynamic programming for control
Adaptive dynamic programming for controlAdaptive dynamic programming for control
Adaptive dynamic programming for control
 
Mcqmc talk
Mcqmc talkMcqmc talk
Mcqmc talk
 
Convolution problems
Convolution problemsConvolution problems
Convolution problems
 

Recently uploaded

Enzyme, Pharmaceutical Aids, Miscellaneous Last Part of Chapter no 5th.pdf
Enzyme, Pharmaceutical Aids, Miscellaneous Last Part of Chapter no 5th.pdfEnzyme, Pharmaceutical Aids, Miscellaneous Last Part of Chapter no 5th.pdf
Enzyme, Pharmaceutical Aids, Miscellaneous Last Part of Chapter no 5th.pdfSumit Tiwari
 
MARGINALIZATION (Different learners in Marginalized Group
MARGINALIZATION (Different learners in Marginalized GroupMARGINALIZATION (Different learners in Marginalized Group
MARGINALIZATION (Different learners in Marginalized GroupJonathanParaisoCruz
 
Introduction to AI in Higher Education_draft.pptx
Introduction to AI in Higher Education_draft.pptxIntroduction to AI in Higher Education_draft.pptx
Introduction to AI in Higher Education_draft.pptxpboyjonauth
 
Types of Journalistic Writing Grade 8.pptx
Types of Journalistic Writing Grade 8.pptxTypes of Journalistic Writing Grade 8.pptx
Types of Journalistic Writing Grade 8.pptxEyham Joco
 
internship ppt on smartinternz platform as salesforce developer
internship ppt on smartinternz platform as salesforce developerinternship ppt on smartinternz platform as salesforce developer
internship ppt on smartinternz platform as salesforce developerunnathinaik
 
Biting mechanism of poisonous snakes.pdf
Biting mechanism of poisonous snakes.pdfBiting mechanism of poisonous snakes.pdf
Biting mechanism of poisonous snakes.pdfadityarao40181
 
Solving Puzzles Benefits Everyone (English).pptx
Solving Puzzles Benefits Everyone (English).pptxSolving Puzzles Benefits Everyone (English).pptx
Solving Puzzles Benefits Everyone (English).pptxOH TEIK BIN
 
Employee wellbeing at the workplace.pptx
Employee wellbeing at the workplace.pptxEmployee wellbeing at the workplace.pptx
Employee wellbeing at the workplace.pptxNirmalaLoungPoorunde1
 
Software Engineering Methodologies (overview)
Software Engineering Methodologies (overview)Software Engineering Methodologies (overview)
Software Engineering Methodologies (overview)eniolaolutunde
 
Incoming and Outgoing Shipments in 1 STEP Using Odoo 17
Incoming and Outgoing Shipments in 1 STEP Using Odoo 17Incoming and Outgoing Shipments in 1 STEP Using Odoo 17
Incoming and Outgoing Shipments in 1 STEP Using Odoo 17Celine George
 
How to Configure Email Server in Odoo 17
How to Configure Email Server in Odoo 17How to Configure Email Server in Odoo 17
How to Configure Email Server in Odoo 17Celine George
 
Organic Name Reactions for the students and aspirants of Chemistry12th.pptx
Organic Name Reactions  for the students and aspirants of Chemistry12th.pptxOrganic Name Reactions  for the students and aspirants of Chemistry12th.pptx
Organic Name Reactions for the students and aspirants of Chemistry12th.pptxVS Mahajan Coaching Centre
 
Full Stack Web Development Course for Beginners
Full Stack Web Development Course  for BeginnersFull Stack Web Development Course  for Beginners
Full Stack Web Development Course for BeginnersSabitha Banu
 
“Oh GOSH! Reflecting on Hackteria's Collaborative Practices in a Global Do-It...
“Oh GOSH! Reflecting on Hackteria's Collaborative Practices in a Global Do-It...“Oh GOSH! Reflecting on Hackteria's Collaborative Practices in a Global Do-It...
“Oh GOSH! Reflecting on Hackteria's Collaborative Practices in a Global Do-It...Marc Dusseiller Dusjagr
 
Interactive Powerpoint_How to Master effective communication
Interactive Powerpoint_How to Master effective communicationInteractive Powerpoint_How to Master effective communication
Interactive Powerpoint_How to Master effective communicationnomboosow
 
Final demo Grade 9 for demo Plan dessert.pptx
Final demo Grade 9 for demo Plan dessert.pptxFinal demo Grade 9 for demo Plan dessert.pptx
Final demo Grade 9 for demo Plan dessert.pptxAvyJaneVismanos
 

Recently uploaded (20)

Enzyme, Pharmaceutical Aids, Miscellaneous Last Part of Chapter no 5th.pdf
Enzyme, Pharmaceutical Aids, Miscellaneous Last Part of Chapter no 5th.pdfEnzyme, Pharmaceutical Aids, Miscellaneous Last Part of Chapter no 5th.pdf
Enzyme, Pharmaceutical Aids, Miscellaneous Last Part of Chapter no 5th.pdf
 
MARGINALIZATION (Different learners in Marginalized Group
MARGINALIZATION (Different learners in Marginalized GroupMARGINALIZATION (Different learners in Marginalized Group
MARGINALIZATION (Different learners in Marginalized Group
 
ESSENTIAL of (CS/IT/IS) class 06 (database)
ESSENTIAL of (CS/IT/IS) class 06 (database)ESSENTIAL of (CS/IT/IS) class 06 (database)
ESSENTIAL of (CS/IT/IS) class 06 (database)
 
Introduction to AI in Higher Education_draft.pptx
Introduction to AI in Higher Education_draft.pptxIntroduction to AI in Higher Education_draft.pptx
Introduction to AI in Higher Education_draft.pptx
 
Types of Journalistic Writing Grade 8.pptx
Types of Journalistic Writing Grade 8.pptxTypes of Journalistic Writing Grade 8.pptx
Types of Journalistic Writing Grade 8.pptx
 
internship ppt on smartinternz platform as salesforce developer
internship ppt on smartinternz platform as salesforce developerinternship ppt on smartinternz platform as salesforce developer
internship ppt on smartinternz platform as salesforce developer
 
Biting mechanism of poisonous snakes.pdf
Biting mechanism of poisonous snakes.pdfBiting mechanism of poisonous snakes.pdf
Biting mechanism of poisonous snakes.pdf
 
Solving Puzzles Benefits Everyone (English).pptx
Solving Puzzles Benefits Everyone (English).pptxSolving Puzzles Benefits Everyone (English).pptx
Solving Puzzles Benefits Everyone (English).pptx
 
Employee wellbeing at the workplace.pptx
Employee wellbeing at the workplace.pptxEmployee wellbeing at the workplace.pptx
Employee wellbeing at the workplace.pptx
 
Software Engineering Methodologies (overview)
Software Engineering Methodologies (overview)Software Engineering Methodologies (overview)
Software Engineering Methodologies (overview)
 
Incoming and Outgoing Shipments in 1 STEP Using Odoo 17
Incoming and Outgoing Shipments in 1 STEP Using Odoo 17Incoming and Outgoing Shipments in 1 STEP Using Odoo 17
Incoming and Outgoing Shipments in 1 STEP Using Odoo 17
 
How to Configure Email Server in Odoo 17
How to Configure Email Server in Odoo 17How to Configure Email Server in Odoo 17
How to Configure Email Server in Odoo 17
 
9953330565 Low Rate Call Girls In Rohini Delhi NCR
9953330565 Low Rate Call Girls In Rohini  Delhi NCR9953330565 Low Rate Call Girls In Rohini  Delhi NCR
9953330565 Low Rate Call Girls In Rohini Delhi NCR
 
Organic Name Reactions for the students and aspirants of Chemistry12th.pptx
Organic Name Reactions  for the students and aspirants of Chemistry12th.pptxOrganic Name Reactions  for the students and aspirants of Chemistry12th.pptx
Organic Name Reactions for the students and aspirants of Chemistry12th.pptx
 
Full Stack Web Development Course for Beginners
Full Stack Web Development Course  for BeginnersFull Stack Web Development Course  for Beginners
Full Stack Web Development Course for Beginners
 
“Oh GOSH! Reflecting on Hackteria's Collaborative Practices in a Global Do-It...
“Oh GOSH! Reflecting on Hackteria's Collaborative Practices in a Global Do-It...“Oh GOSH! Reflecting on Hackteria's Collaborative Practices in a Global Do-It...
“Oh GOSH! Reflecting on Hackteria's Collaborative Practices in a Global Do-It...
 
Interactive Powerpoint_How to Master effective communication
Interactive Powerpoint_How to Master effective communicationInteractive Powerpoint_How to Master effective communication
Interactive Powerpoint_How to Master effective communication
 
Model Call Girl in Bikash Puri Delhi reach out to us at 🔝9953056974🔝
Model Call Girl in Bikash Puri  Delhi reach out to us at 🔝9953056974🔝Model Call Girl in Bikash Puri  Delhi reach out to us at 🔝9953056974🔝
Model Call Girl in Bikash Puri Delhi reach out to us at 🔝9953056974🔝
 
Model Call Girl in Tilak Nagar Delhi reach out to us at 🔝9953056974🔝
Model Call Girl in Tilak Nagar Delhi reach out to us at 🔝9953056974🔝Model Call Girl in Tilak Nagar Delhi reach out to us at 🔝9953056974🔝
Model Call Girl in Tilak Nagar Delhi reach out to us at 🔝9953056974🔝
 
Final demo Grade 9 for demo Plan dessert.pptx
Final demo Grade 9 for demo Plan dessert.pptxFinal demo Grade 9 for demo Plan dessert.pptx
Final demo Grade 9 for demo Plan dessert.pptx
 

Bayesian Reliability Analysis of Discrete Failure Time Systems

  • 1. Bayesian Reliability Analysis of Certain Types of Systems W Discrete Failure Time ith By Ketan A Gajjar, M.N .Patel
  • 2. 1.IntroductIon The main concern of a maintenance engineer has been the estimation of reliability using operational data on a system . Estimates based on operational data can be updated by incorporating past environmental experiences on random variations in the life-time parameters of the system.
  • 3. A component in a system which is capable of just two modes of performance, represented by a Bernoulli random variable“X” “X” assumes values 1 and 0 for the two modes - functioning and nonfunctioning respectively, having a probability distribution , P ( X = 1) = 1 − P ( X = 0) = θ , 0 <θ <1
  • 4. To investigate the ability of electronic tubes to withstand successive voltage overloads and the performance of electric switches which are repeatedly turned on and off, the geometric distribution can be used as a discrete failure model. In each of these cases failure can occur at the xth trial ( x=1,2,3,………) with the probability of failure at any trial as 1 - θ.
  • 5. The probability mass function of the failure at the xth trial is f (x, θ ) = (1 − θ )θ x − 1, x = 1,2,3,.....; 0 < θ < 1 (1.1)
  • 6. In the present study we have considered Bayesian reliability analysis of series, parallel, k out of n and standby systems when lifetime of a component is a geometric random variable with p.m.f given in (1.1).
  • 7. 2. AssumptIons i) Let x be the number of completed cycles / trials of an item denoting discrete failure time,following geometric distribution with Mean Time Between Failures (MTBF) as 1 1−θ ii) The prior distribution of parameter θ in (1.1) is l −1 m−1 (1−θ ) π (θ ) = θ ,0 < θ < 1 ; l , m > 0 β (l , m)
  • 8. iii)If u represents the number of failures during total testing time of T-1 trials ( i.e. the number of failures up to T-1) and follows the Binomial Distribution having p.m.f.(See: Patel and Patel (2006))  T − 1 u P (u |θ ) =   φ T −1−u  u  (1−φ ) ,   n ( u = 0,1,2,...T − 1, T ∈ N ; 0 < θ <1;φ = θ ) (2.2)
  • 9. iv) The posterior distribution of θ given that n failures have been observed up to trial T-1 can be obtained as P(u | θ )π (θ ) g1(θ | u ) = 1 ∫ P(u | θ )π (θ ) dθ 0 n(T −1−u )+l −1 m−1 nu θ (1−θ ) (1−θ ) = ; u  u j (2.3) ∑   (−1) β ( n(T − 1 − u + j ) + l, m) j =0  j    (0 < θ <1 ; n(T − 1 − u + j ), m > 0 )
  • 10. 3. BAyesIAn relIABIlIty AnAlysIs of A k out of n system In view of (1.1), reliability of an item for a mission time, t is given by R(t ) = θ t ; t =1,2,3,.......; 0 <θ <1 (3.1)
  • 11. Hence, reliability of a k out of n system (kns) becomes n  n i n−i   R (t ) = ∑  i  ( R(t )) (1− R(t )) kns i=k   Cases k=1 and k=n correspond respectively, to a parallel and a series system.
  • 12. Upon using the posterior distribution of θ given in (2.3) and assuming the squared error loss function, the Bayes estimator of the reliability of a k- out-of- n system, can be obtained as, * (t ) (t ) R kns R =E ( kns |u) 1 n  n  it   t n−i n(T −1−u )+l −1 m−1 n u dθ ∫ ∑  (θ ) (1−θ ) θ (1−θ ) (1−θ ) 0 i=k  i = u  u   j ∑  j (−1) β ( n(T − 1 − u + j ) + l , m) j =0  
  • 13. After some algebraic manipulations, we get * R kns (t ) as * n ∑ i=k     [  ∑  i  j =0  j    { n  n−i  n − i    u  u ∑   (−1)  r r =0   r+ j }] β ((i + j )t + n(T − 1 − u + r ) + l, m) R kns (t )= u  u r ∑   (−1) β ( n(T − 1 − u + j ) + l, m)  r j =0   (3.2) Estimates for series and parallel systems follow as particular cases. * Bayes risk of estimator R kns (t ) is defined as r(R *, R ) = E [ E ( * (t ) − R ( t ) )2 ] (3.3) θ u R kns
  • 14. A few algebraic manipulations, give as r ( R*, R ) r(R *, R ) = ∑ [ T −1 u =0 * 2 2 * t n (R kns (t )) − Rkns (t ) ∑  n  β ( (i + 1) , n − i + 1) +     i =k  i  t 2 1 n  n 1 ∑ ( ) β ( (2i + ) ,2 n − 2 i + 1) + t i =k  i  t 1 n n  n  n  1 ∑ ∑    β ( (i + j + ) ,2 n − i − j + 1) t i≠ j j =k  i  j     t ] (3.4)
  • 15. 4. BAyesIAn relIABIlIty AnAlysIs of A cold stAndBy system (css) We, now consider an n- component system in which only one component is operating and the remaining (n-1) components are kept standby to take over the operation in succession when the component in operation fails, assuming that components cannot fail in the standby state and that the switching and sensing device is 100 % reliable.
  • 16. If R(t) denotes the reliability of each component as given in (3.1), then the reliability of a css is given by (See Govil 1983, page 68) r n−1 (− log R(t )) R css(t ) = R(t ) ∑ r! r =0 (4.1) Finally, upon using the posterior distribution of θ in (2.3) and assuming the squared error loss function, the Bayes estimator of R css(t ) can be derived as
  • 17. 1 t n−1 (− log R(t )) r n(T −1−u )+l −1 m−1 nu ∫ θ ∑ r! θ (1−θ ) (1−θ ) dθ 0 r =0 R css(t ) u  u = j ∑   (−1) β ( n(T − 1 − u + j ) + l, m) j =0  j    After some algebraic manipulations, we get  u j +i    j  (−1) * Rc ss (t ) n−1 r ∑ t r =0 { m−1 ∑ i =0  m − 1   i     [ ∑ u   j =0 ( t + n(T −1− u + j ) + l + i) r ]} = u  u j ∑   (−1) β ( n(T − 1 − u + j ) + l, m) j =0  j    (4.2) * Bayes risk of estimator of Rc ss (t ) can be defined as stated in (3.3).
  • 18. 5. sImulAtIon study And dIscussIon 5.1 sImulAtIon studIes In this section, we have studied reliability of different systems discussed in sections 3 and 4 at mission time t for different values of number of trials performed (T), number of failures (u) during trial and hyper parameters l and m.
  • 19. 5.2 conclusIons (i)For fixed l, m, k, t and T Bayes risk increases with n for all the system. (ii)For k out of n system (k≠1, n): For l = m Bayes risk is smaller than that of under l > m for fixed t, T and n. (iii)For series system : When l = m , Bayes risk is smaller then that of under l < m for fixed t, T and n.
  • 20. conclusIons contd… (iv)For parallel system : For fixed l, as m increases, Bayes risk decreases fixed t,T and n. (v)For standby system : For l<m, Bayes risk is smaller than that of under l = m for fixed t, T and n.
  • 21. Some recent studies by *Sharma and Bhutani (1992, 1993), *Sharma and Krishna (1994) *Martz and Waller (1982) deal with these aspects in detail.
  • 22. references 1. Govil, A.K. (1983): Reliability Engineering, Tata McGraw Hill. 2. Kalbfeisch, J.D. and Prentice R.L. (1980): The Statistical Analysis of Failure Time Data, John Wiley, New York. 3. Martz, H.F. and Waller, R.A. (1982): Bayesian Reliability Analysis, John Wiley, New York. 4. Nelson, W.B. (1970): Hazard Plotting Methods for Analysis of Life Data with Different Failure Models, Journal of Quality Technology.Vol.2, pp. 126-149. 5. Patel, M.N. and Gajjar, A.V. (1990): Progressively Censored Samples from Geometric Distribution, The Aligarh Journal of Statistics, Vol.10, pp 1-8.
  • 23. 6. Patel, N.W. and Patel, M.N. (2003): Estimation of Parameters of Mixed Geometric Failure Models From Type –I Progressively Group Censored Sample, IAPQR Transactions, Vol.28, pp. 33-41 7.Patel, N.W. and Patel, M.N. (2006): Some Probabilistic Properties of Geometric Lifetime Model, IJOMAS, Vol.22, pp. 1-3. 8. Sharma, K.K. and Bhutani, R.K. (1992): Bayesian Reliability Analysis of a Parallel System, Reliability Engineering System Safety. Vol. 37, pp. 227-230.
  • 24. 9. Sharma, K.K. and Bhutani, R.K. (1993): Bayesian Analysis of System Availability, Microelectronics and Reliability, Vol. 33, pp. 809-811. 10. Sharma, K.K. and Krishna, Hare (1994): Bayesian Reliability Analysis of A k - out of n - System and the Estimation of a Sample Size and Censoring Time, Reliability Engineering System Safety. Vol. 44, pp. 11-15. 11. Yaqub, M and Khan, A.H (1981): Geometric Failure Law in Life Testing, Pure and Applied Mathematika Sciences, Vol. XLV, No.1-2, pp. 69-76.