• 한국통계학회:학술대회논문집
• /
• 한국통계학회 2002년도 추계 학술발표회 논문집
• /
• pp.115-117
• /
• 2002

In this paper, we obtain an explicit formula of the Laplace transform of the forward recurrence time at finite time t > 0 in an alternating renewal process, by adopting a Markovian approach. As a consequence, we obtain the first two moments of the forward recurrence time.

• International Journal of Reliability and Applications
• /
• 제3권4호
• /
• pp.199-202
• /
• 2002

In this paper, we obtain an explicit formula of the Laplace transform of the forward recurrence time at finite time t > 0 in an alternating renewal process, by adopting a Markovian approach. As a consequence, we obtain the first two moments of the forward recurrence time.

• Journal of the Korean Data and Information Science Society
• /
• 제15권1호
• /
• pp.21-29
• /
• 2004

In this paper, we define an availability of repairable network system, when the states of links are modeled by alternating renewal processes. The actual availabilities of some well-known network systems are obtained. The expected numbers of failures and repairs of the network systems are also calculated.

• Journal of applied mathematics & informatics
• /
• 제32권1_2호
• /
• pp.129-136
• /
• 2014

One of the fundamental issues in the design of dynamic spectrum access policy is the modeling of the dynamic behavior of channel occupancy by primary users. Under a Markovian modeling of channel occupancy, a periodic sensing and greedy access policy is known as one of the simple and practical dynamic spectrum access policies in cognitive radio networks. In this paper, the primary occupancy of each channel is modeled as a discrete-time alternating renewal process with generally distributed on- and off-periods. A periodic sensing and greedy access policy is constructed based on the general channel occupancy model. Simulation results show that the proposed policy has better throughput than the policies using channel models with exponentially distributed on- or off-periods.

• 대한안전경영과학회지
• /
• 제14권1호
• /
• pp.225-233
• /
• 2012

The research discusses interrelationship of structural and reliability importance measures which used in the probabilistic safety assessment. The most frequently used component importance measures, such as Birnbaum's Importance (BI), Risk Reduction (RR), Risk Reduction Worth (RRW), RA (Risk Achievement), Risk Achievement Worth (RAW), Fussel Vesely (FV) and Critically Importance (CI) can be derived from two structure importance measures that are developed based on the size and the number of Minimal Path Set (MPS) and Minimal Cut Set (MCS). In order to show an effectiveness of importance measures which is developed in this paper, the three representative functional structures, such as series-parallel, k out of n and bridge are used to compare with Birnbaum's Importance measure. In addition, the study presents the implementation examples of Total Productive Maintenance (TPM) metrics and alternating renewal process models with exponential distribution to calculate the availability and unavailability of component facility for improving system performances. System state structure functions in terms of component states can be converted into the system availability (unavailability) functions by substituting the component reliabilities (unavailabilities) for the component states. The applicable examples are presented in order to help the understanding of practitioners.