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/

Global: Zendy Plus annual

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

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Network structures and models have been widely adopted, e.g., for Internet ofThings, wireless sensor networks, smart grids, transportation networks,communication networks, social networks, and computer grid systems. Networkreliability is an effective and popular technique to estimate the probabilitythat the network is still functioning. Networks composed of binary-state (e.g.,working or failed) components (arcs and/or nodes) are called binary-statenetworks. The binary-state network is the fundamental type of network; thus,there is always a need for a more efficient algorithm to calculate the networkreliability. Thus, a novel binary-addition tree (BAT) algorithm that employsbinary addition for finding all the possible state vectors and the path-basedlayered-search algorithm for filtering out all the connected vectors isproposed for calculating the binary-state network reliability. According to thetime complexity and numerical examples, the efficiency of the proposed BAT ishigher than those of traditional algorithms for solving the binary-statenetwork reliability problem.

Novel Binary-Addition Tree Algorithm (BAT) for Binary-State Network Reliability Problem