English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Open

Current network applications, such as utility networks (gas, water,electricity, and 4G/5G), the Internet of Things (IoT), social networks, andsupply chains, are all based on binary state networks. Reliability is one ofthe most commonly used tools for evaluating network performance, and theminimal path (MP) is a basic algorithm for calculating reliability. However,almost all existing algorithms assume that all undirected arcs are homogeneous;that is, the probability of an arc from nodes a to b is equal to that fromnodes b to a. Therefore, based on MPs, the binary-addition-tree algorithm(BAT), and the inclusion-exclusion technique (IET), a novel recursiveinclusion-exclusion technology algorithm known as recursive BAT-based IET (RIE)is proposed to solve the heterogeneous-arc binary-state network reliabilityproblem to overcome the above obstacles in applications. The computationalcomplexity of the proposed RIE is analyzed using an illustrative example.Finally, 11 benchmark problems are used to verify the performance of RIE.

Novel Recursive Inclusion-Exclusion Technology Based on BAT and MPs for Heterogeneous-Arc Binary-State Network Reliability Problems