MétaCan
Menu
Back to cohort
Record W2125428223 · doi:10.1109/59.852154

Contingency screening for steady-state security analysis by using FFT and artificial neural networks

2000· article· en· W2125428223 on OpenAlex

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueIEEE Transactions on Power Systems · 2000
Typearticle
Languageen
FieldEngineering
TopicPower System Optimization and Stability
Canadian institutionsUniversity of Saskatchewan
Fundersnot available
KeywordsFast Fourier transformArtificial neural networkComputer scienceContingency tablePreprocessorArtificial intelligenceMachine learningData miningReliability engineeringAlgorithmEngineering

Abstract

fetched live from OpenAlex

A new approach based on artificial neural networks (ANNs) combined with fast Fourier transform (FFT) is developed for single line contingency screening in steady-state security analysis. The offline fast decoupled load flow calculations are adopted to construct two kinds of performance indices, PI/sub p/ (active power performance index) and PI/sub v/ (reactive power performance index) which reflect the severity degree of contingencies. The results from offline calculations of the load flow are used to train a multilayered artificial neural network for estimating the performance indices. FFT is used for preprocessing the inputs to improve and speed up the ANN training. The effectiveness of the proposed method is demonstrated by contingency ranking on two IEEE test systems and comparisons are made with the traditional method. Good calculation accuracy, high contingency capturing rate and faster analysis times for contingency screening are obtained by using the ANNs.

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 imitation

Not 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.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.909
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.015
GPT teacher head0.234
Teacher spread0.218 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it