網路系統可靠的SDP最少項數演算法

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

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

Title:	網路系統可靠的SDP最少項數演算法 A New Algorithm of Minimal SDP Terms for Calculating the Network System Reliability
Authors:	劉熙海孫家鴻李藍基王有慶蔡雅雅
Contributors:	華岡工程學報
Date:	1998-05
Issue Date:	2014-11-04 13:42:01 (UTC+8)
Abstract:	本文所提SLR演算法則是利用向農展開式定理，將輸入路徑以布林函數方式，表示成不相交的SDP型式，再經過適當的選取X(下標 i)，可使得布林函數在SDP項數方面，得到比目前文獻所發表的還少項數。本文中，我們設計兩種程式，第一種程式是依照布林函數輸入X(下標 i)的順序，依序選取X(下標 i)；第二種程式則是SLR演算法則，視X(下標 i)出現次數多寡，適當的選取X(下標 i)，經比較其結果發現，使用SLR演算法則，確實可得到項數較少的SDP型式。最後，例舉十個二位元同調網路，比較SLR演算法則在SDP項數上確實減少許多，且網路愈複雜時，SDP項數減少的愈多，同時比較CPU的時間，證實SLR演算法則並未增加太多的計算時間。 This paper presents a new method, the SLR algorithm, for calculating the network system reliability by sum of disjoint products. The main feature of the SLR algorithm is its ability to properly choose the variable Xi of minimal paths, so it may generates shorter disjoint products than any other known SDP method. In this paper, we design two programs: SLR algorithm and Schneeweiss algorithm Compare the results of the two different algorithms, the SLR algorithm may generate the fewest number of SDP terms.
Relation:	華岡工程學報； 12 期 (1998 / 05 / 01) ， P181 - 194
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	151	View/Open

View Licence

Loading...