{"title":"一种确定已知最小路径下网络可靠性的分离积和新方法","authors":"W. Yeh","doi":"10.1109/ICITA.2005.35","DOIUrl":null,"url":null,"abstract":"In this study, a new algorithm based on some intuitive properties that characterize the structure of minimal paths (MPs), and the relationships between MPs and subpaths are developed to improved sum-of-disjoint products technique (SDP). The proposed algorithm is not only easier to understand and implement, but is also better than the existing best-known SDP based algorithm. The correctness of the proposed algorithm is analyzed and proven. One bench example is illustrated to show how to determine the network reliability with known minimal paths using the proposed SDP.","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"A new sum-of-disjoint-products technique to determine network reliabilities with known minimal paths\",\"authors\":\"W. Yeh\",\"doi\":\"10.1109/ICITA.2005.35\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this study, a new algorithm based on some intuitive properties that characterize the structure of minimal paths (MPs), and the relationships between MPs and subpaths are developed to improved sum-of-disjoint products technique (SDP). The proposed algorithm is not only easier to understand and implement, but is also better than the existing best-known SDP based algorithm. The correctness of the proposed algorithm is analyzed and proven. One bench example is illustrated to show how to determine the network reliability with known minimal paths using the proposed SDP.\",\"PeriodicalId\":371528,\"journal\":{\"name\":\"Third International Conference on Information Technology and Applications (ICITA'05)\",\"volume\":\"37 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-07-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Third International Conference on Information Technology and Applications (ICITA'05)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICITA.2005.35\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Third International Conference on Information Technology and Applications (ICITA'05)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICITA.2005.35","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A new sum-of-disjoint-products technique to determine network reliabilities with known minimal paths
In this study, a new algorithm based on some intuitive properties that characterize the structure of minimal paths (MPs), and the relationships between MPs and subpaths are developed to improved sum-of-disjoint products technique (SDP). The proposed algorithm is not only easier to understand and implement, but is also better than the existing best-known SDP based algorithm. The correctness of the proposed algorithm is analyzed and proven. One bench example is illustrated to show how to determine the network reliability with known minimal paths using the proposed SDP.