A New Link Isolation Algorithm based on Complex Network Theory for Preventing Cascading Failures in Power Grid
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Weak links is one of the main causes of large-scale blackouts in power systems. How to accurately identify the weakest links so as to disconnect the links that could cause cascading failures when an accident happens to a power system, is a vital research topic for keeping power system safety by preventing large-scale blackouts caused by cascading failures. In this paper, based on complex network theory we first propose a method to identify the weakest links according to vertices second order centrality and links joint vulnerability metric by combining link betweenness and link load level, which is called joint vulnerability method (JVM). Based on JVM, we design a links isolation algorithm when a weakest link failure happens to a power system, which is called joint isolation algorithm (JIA). The simulation results show that JVM could identify the weakest links accurately, and the JIA could avoid large-scale blackouts effectively which plays a guiding role in the optimization of power system safety.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it