• Proceedings of the Korea Multimedia Society Conference
• /
• 1998.10a
• /
• pp.202-207
• /
• 1998

The network reliability is to be computed in terms of the terminal reliability. The computation of a terminal reliability is started with a Boolean sum of products expression corresponding to simple paths of the pair of nodes. This expression is then transformed into another equivalent expression to be a Disjoint Sum of Products form. But this computation of the terminal reliability obviously does not consider the communication between any other nodes but for the source and the sink. In this paper, we derive the overall network reliability which all other remaining nodes. For this, we propose a method to make the SOP disjoint for deriving the network reliability expression from the system success expression using the modified Sheinman's method. Our method includes the concept of spanning trees to find the system success function by the Cartesian products of vertex cutsets.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2000.04a
• /
• pp.473-476
• /
• 2000

The network reliability is to be computed in terms of the terminal reliability. The computation of a termini reliability is started with a Boolean sum of products expression corresponding to simple paths of the pair of nodes. This expression is then transformed into another equivalent expression to be a Disjoint Sum of Products form. But this computaion of the terminal reliability obviously does not consider the communication between any other nodes but for the source and the sink. In this paper, we derive the overall network reliability which is the probability of communication that each node in the network communicates with all other remaining nodes. For this, we propose a method to make the SOP disjoint for deriving the network reliability expression from the system success expression using the modified Sheinman's method and modified BDD method.

• Communications for Statistical Applications and Methods
• /
• v.3 no.3
• /
• pp.125-133
• /
• 1996

In this paper, we present a algebraic technique for computing system reliability for complex system. The method was originally developed as an aid to fault tree analysis but it applies to general problems of reliability assessment. A success expression which directly gives the reliability expression is formed and simplified by the procedure. Several algorithms and examples are illustrated.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2000.04a
• /
• pp.385-388
• /
• 2000

The computation of a terminal-pair reliability is started with a Boolean sum of products expression corresponding to simple paths of the pair of nodes. This expression is then transformed into another equivalent expression to be a Sum of Disjoint Products form. The terminal reliability can then be obtained in a straightforward manner from the Sum of Disjoint Products form. In this paper, we proposed an efficient method to obtain reliability expressions for calculating multiple K terminal-pairs reliability between terminal-pairs of nodes of computers of complex networks. Actual programming results show that the new method is superior with regard to computational efficiency, especially for computing the reliability of multiple terminals.

• Proceedings of the Korean Society for Bioinformatics Conference
• /
• 2005.09a
• /
• pp.313-318
• /
• 2005

Estimating the reliability of protein-protein interaction data sets obtained by high-throughput technologies such as yeast two-hybrid assays and mass spectrometry is of great importance. We develop a maximum likelihood estimation method that uses both protein localization and gene expression data to estimate the reliability of protein interaction data sets. By integrating protein localization data and gene expression data, we can obtain more accurate estimates of the reliability of various interaction data sets. We apply the method to protein physical interaction data sets and protein complex data sets. The reliability of the yeast two-hybrid interactions by Ito et al. (2001) is 27%, and that by Uetz et at.(2000) is 68%. The reliability of the protein complex data sets using tandem affinity purification-mass spec-trometry (TAP) by Gavin et at. (2002) is 45%, and that using high-throughput mass spectrometric protein complex identification (HMS-PCI) by Ho et al. (2002) is 20%. The method is general and can be applied to analyze any protein interaction data sets.

• International Journal of Reliability and Applications
• /
• v.17 no.1
• /
• pp.51-63
• /
• 2016

Stress function of ball bearing is function of multiple stochastic factors and this system is so complex that analytical expression for reliability is difficult to obtain. To address this pressing problem, in this article, we have made an attempt to approximate system reliability of this important item based on reliability bounds under the stress strength setup. This article also provides level of error of this item. Numerical analysis has been adopted to show the closeness between the upper and lower bounds of this item.

• Proceedings of the Korean Society for Emotion and Sensibility Conference
• /
• 2012.05a
• /
• pp.32-33
• /
• 2012

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.28B no.12
• /
• pp.1-8
• /
• 1991

Given the set of minimal paths between two vertices in a network, this paper shows that the system reliability can be obtained by using a Binary Decision Digram. It can be done by transforming a Boolean sum of products into a Binary Decision Diagram and the reliability can be directly derived from it. The resulting reliability expression is compact and requires relatively fewer arithmetic opersations in its evaluation. Several examples are given to show that the method using Binary Decision Diagram is conceptually casy, simple and efficient.

• Geomechanics and Engineering
• /
• v.12 no.2
• /
• pp.313-326
• /
• 2017

Based on the reliability theory and limit analysis method, the roof stability of a shallow tunnel is investigated under the condition of surface settlement. Nonlinear Hoek-Brown failure criterion is adopted in the present analysis. With the consideration of surface settlement, the internal energy and external work are calculated. Equating the rate of energy dissipation to the external rate of work, the expression of support pressure is derived. With the help of variational approach, a performance function is proposed to reliability analysis. Improved response surface method is used to calculate the Hasofer-Lind reliability index and the failure probability. In order to assess the validity of the present results, Monte-Carlo simulation is performed to examine the correctness. Sensitivity analysis is used to estimate the influence of different variables on reliability index. Among random variables, the unit weight significantly affects the reliability index. It is found that the greater coefficient of variation of variables lead to the higher failure probability. On the basis of the discussions, the reliability-based design is achieved to calculate the required tunnel support pressure under different situations when the target reliability index is obtained.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.5
• /
• pp.2338-2356
• /
• 2019

Vehicular ad-hoc network (VANET) is the name of technology, which uses 'mobile internet' to facilitate communication between vehicles. The aim is to ensure road safety and achieve secure communication. Therefore, the reliability of this type of networks is a serious concern. The reliability of VANET is dependent upon proper communication between vehicles within a given amount of time. Therefore a new formula is introduced, the terms of the new formula correspond 1 by 1 to a class special ST route (SRORT). The new formula terms are much lesser than the Inclusion-Exclusion principle. An algorithm for the Source-to-Terminal reliability was presented, the algorithm produced Source-to-Terminal reliability or computed a Source-to-Terminal reliability expression by calculating a class of special networks of the given network. Since the architecture of this class of networks which need to be computed was comparatively trivial, the performance of the new algorithm was superior to the Inclusion-Exclusion principle. Also, we introduce a mobility metric called universal speed factor (USF) which is the extension of the existing speed factor, that suppose same speed of all vehicles at every time. The USF describes an exact relation between the relative speed of consecutive vehicles and the headway distance. The connectivity of vehicles in different mobile situations is analyzed using USF i.e., slow mobility connectivity, static connectivity, and high mobility connectivity. It is observed that $p_c$ probability of connectivity is directly proportional to the mean speed ${\mu}_{\nu}$ till specified threshold ${\mu}_{\tau}$, and decreases after ${\mu}_{\tau}$. Finally, the congested network is connected strongly as compared to the sparse network as shown in the simulation results.