The algorithm is based on constructing a disjoin kg t set of the minimal paths in a network system.In this paper, cubic notation was used to describe the logic function of a network in a well-balanced state,and then t...The algorithm is based on constructing a disjoin kg t set of the minimal paths in a network system.In this paper, cubic notation was used to describe the logic function of a network in a well-balanced state,and then the sharp-product operation was used to construct the disjoint minimal path set of the network.A computer program has been developed,and when combined with decomposition technology,the reliability of a general lifeline network can be effectively and automatically calculated.展开更多
A consecutive k out of n: F System, with n linearly arranged i. i. d. components, is examined. This paper gives an exact formula for computing the system's reliability directly. Complexity of this algorithm is...A consecutive k out of n: F System, with n linearly arranged i. i. d. components, is examined. This paper gives an exact formula for computing the system's reliability directly. Complexity of this algorithm is an O(n k). Further more, the system's reliability can be computed more quickly and more effectively from this formula than those previously given.展开更多
This paper describes a method for finding the terminal pair reliability expression of communication networks.This method incorporates bit manipulation and Boolean operations for generating the sum of disjointed produ...This paper describes a method for finding the terminal pair reliability expression of communication networks.This method incorporates bit manipulation and Boolean operations for generating the sum of disjointed products(SDP) expression in which each term has 1 to 1 correspondence with respective minimal path(or cut).This method is convenient and efficient. An example illustrates the method.展开更多
基金Key Project of Science and Technology from the State Plan Committee.No.101-9914003
文摘The algorithm is based on constructing a disjoin kg t set of the minimal paths in a network system.In this paper, cubic notation was used to describe the logic function of a network in a well-balanced state,and then the sharp-product operation was used to construct the disjoint minimal path set of the network.A computer program has been developed,and when combined with decomposition technology,the reliability of a general lifeline network can be effectively and automatically calculated.
文摘A consecutive k out of n: F System, with n linearly arranged i. i. d. components, is examined. This paper gives an exact formula for computing the system's reliability directly. Complexity of this algorithm is an O(n k). Further more, the system's reliability can be computed more quickly and more effectively from this formula than those previously given.
文摘This paper describes a method for finding the terminal pair reliability expression of communication networks.This method incorporates bit manipulation and Boolean operations for generating the sum of disjointed products(SDP) expression in which each term has 1 to 1 correspondence with respective minimal path(or cut).This method is convenient and efficient. An example illustrates the method.