Concrete Edge Failure of Anchor Groups Placed Parallel to an Edge

2021 ◽  
Vol 118 (2) ◽  
Keyword(s):  
Edge Failure

scholarly journals Improvement on Load-Induced Cascading Failure in Asymmetrical Interdependent Networks: Modeling and Analysis

2015 ◽  
Vol 2015 ◽  
pp. 1-10 ◽  
Author(s):  
Haiyan Han ◽  
Rennong Yang
Keyword(s):  
Load Capacity ◽  
Small World ◽  
Cascading Failure ◽  
Modeling And Analysis ◽  
Interdependent Networks ◽  
Interdependent Network ◽  
Capacity Model ◽  
Weight Structure ◽  
Edge Failure ◽  
Asymmetrical Model

Many real-world systems can be depicted as interdependent networks and they usually show an obvious property of asymmetry. Furthermore, node or edge failure can trigger load redistribution which leads to a cascade of failure in the whole network. In order to deeply investigate the load-induced cascading failure, firstly, an asymmetrical model of interdependent network consisting of a hierarchical weighted network and a WS small-world network is constructed. Secondly, an improved “load-capacity” model is applied for node failure and edge failure, respectively, followed by a series of simulations of cascading failure over networks in both interdependent and isolated statuses. The simulation results prove that the robustness in isolated network changes more promptly than that in the interdependent one. Network robustness is positively related to “capacity,” but negatively related to “load.” The hierarchical weight structure in the subnetwork leads to a “plateau” phenomenon in the progress of cascading failure.

Post-Fire Concrete Edge Failure in Single and Multiple Anchors Pre-loaded in Shear

2021 ◽  
pp. 103334
Author(s):  
Joško Ožbolt ◽  
Luka Lacković ◽  
Kaipei Tian
Keyword(s):  
Edge Failure

A Short Note of Strong Matching Preclusion for a Class of Arrangement Graphs

2020 ◽  
Vol 30 (01) ◽  
pp. 2050001
Author(s):  
Shuangshuang Zhang ◽  
Yuzhi Xiao ◽  
Xia Liu ◽  
Jun Yin
Keyword(s):  
Short Note ◽  
Perfect Matchings ◽  
Minimum Number ◽  
Edge Failure

The strong matching preclusion number of a graph is the minimum number of vertices and edges whose deletion results in a graph that has neither perfect matchings nor almost perfect matchings. The strong matching preclusion is a well-studied measure for the network invulnerability in the event of edge failure. In this paper, we obtain the strong matching preclusion number for a class of arrangement graphs and categorize their the strong matching preclusion set, which are a supplement of known results.

scholarly journals Remedies for Cutting Edge Failure of Hob Due to Chip Crush

2003 ◽  
Vol 69 (681) ◽  
pp. 1396-1403
Author(s):  
Masaoki SUMI ◽  
Aizoh KUBO ◽  
Masaharu KOMORI
Keyword(s):  
Cutting Edge ◽  
Edge Failure
Sign in / Sign up

Export Citation Format

Share Document