一種使用多變數互補方式的網路可靠度演算法則

CCUR > College of Natural Science and Engineering > College of Engineering > College of Engineering > Chinese Culture University Hwa Kang Journal of Engineering > Item 987654321/22060

Please use this identifier to cite or link to this item: https://irlib.pccu.edu.tw/handle/987654321/22060

Title:	一種使用多變數互補方式的網路可靠度演算法則
Authors:	劉熙海;邱顯嘉
Contributors:	工學院
Date:	2004-06-01
Issue Date:	2012-04-25 13:28:28 (UTC+8)
Abstract:	本文提出一種適用於二進位同調系統與非同調系統的網路可靠度演算法則－HHL91演算法則。HHL91演算法是由著名的Heidtmann演算法藉由項數的排列改良而成，先將網路輸入路徑以布林函數表示，利用特殊的排列方式，再經由布林代數的運算法則，即可得到SDP項數最少的布林函數。本文所提出的演算法則不只適用於同調系統，同時也適用於非同調系統，且經過改良之後，可得到比ALR與ALW演算法則更少的SDP型式，並且已經規劃設計出一套程式可以用來計算網路可靠度的大小。最後舉出十個例子，前五個為二進位同調系統，後五個為二進位非同調系統，求其最少項數的SDP型式與可靠度。 This paper presents a new algorithm for calculating the reliability of the binary coherent and non-coherent network by the subproduct inversion. The virtue of the HHL91 algorithm lies in it ability to express the Boolean function by subproduct inversion, reducing the number of SDP terms to the nearly smallest by choosing the most appropriate ordering. While the Abraham algorithm and its successors obtain relatively short SDP forms of the Boolean functions, this new algorithm generates shorter disjoint product terms than any other known SDP method. This algorithm applies not only coherent system but also noncoherent system. Ten examples illustrate how the HHL91 algorithm fares better than other methods in terms of the number of SDP terms and the computation process.
Relation:	華岡工程學報 18期 p.77 -82
Appears in Collections:	[College of Engineering] Chinese Culture University Hwa Kang Journal of Engineering

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	254	View/Open

Loading...