ÐPoint availability and expected interval availability are dependability measures respectively defined by the probability that a system is in operation at a given instant and by the mean percentage of time during which a system is in operation over a finite observation period. We consider a repairable computer system and we assume, as usual, that the system is modeled by a finite Markov process...

Redundancy allocation problem is one of the most important problem in Reliability area. In this problem the reliability and availability of the systems maximized via allocating redundant components to sub-systems. a systems operates normally in its operational mode but fails in either opened or shorted modes. this paper presents a repairable k_out_of_n systems network model with common cause fa...

Three traditional ASR parameterizations matched with Hidden Markov Models (HMMs) are compared to humans for speaker-dependent consonant recognition using nonsense syllables degraded by highpass filtering, lowpass filtering, or additive noise. Confusion matrices were determined by recognizing the syllables using different ASR front ends, including Mel-Filter Bank (MFB) energies, Mel-Filtered Cep...

Most of the existing reliability analysis is based on exponential distribution which is convenient to calculation, whereas most intelligent electronic devices exhibit Weibull distribution. What kind of influence will life distribution have on the reliability and availability of a smart substation? This paper compares the reliability and availability of systems with different life distributions ...

Performance evaluation of complex systems is a critical issue and bounds computation provides confidence about service quality, reliability, etc. of such systems. The stochastic ordering theory has generated a lot of works on bounds computation. Maximal lower and minimal upper bounds of a Markov chain by a st-monotone one exist and can be efficiently computed. In the present work, we extend sim...

this paper presents a discrete-time single-server finite buffer n threshold policy queue with renewal input and discretemarkovian service process. the server terminates service whenever the system becomes empty, and recommencesservice as soon as the number of waiting customers in the queue is n. we obtain the system-length distributionsat pre-arrival and arbitrary epochs using the supplementary...