Support vector machine-based algorithm for post-fault transient stability status prediction using synchronized measurements
Bibliographic record
Abstract
Summary form only given. The paper first shows that the transient stability status of a power system following a large disturbance such as a fault can be early predicted based on the measured post-fault values of the generator voltages, speeds, or rotor angles. Synchronously sampled values provided by phasor measurement units(PMUs) of the generator voltages, frequencies, or rotor angles collected immediately after clearing a fault are used as inputs to a support vector machines (SVM) classifier which predicts the transient stability status. Studies with the New England 39-bus test system and the Venezuelan power network indicated that faster and more accurate predictions can be made by using the post-fault recovery voltage magnitude measurements as inputs. The accuracy and robustness of the transient stability prediction algorithm with the voltage magnitude measurements was extensively tested under both balanced and unbalanced fault conditions, as well as under different operating conditions, presence of measurement errors, voltage sensitive loads, and changes in the network topology. During the various tests carried out using the New England 39-bus test system, the proposed algorithm could always predict when the power system is approaching a transient instability with over 95% success rate.
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.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 0.001 |
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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".