MétaCan
Menu
Back to cohort
Record W2775693976 · doi:10.1109/icpesys.2017.8215911

Contingency analysis via SDP relaxations of the OPF problem

2017· article· en· W2775693976 on OpenAlexaff
Mutlu YILMAZ, M.E. El-Hawary

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicOptimal Power Flow Distribution
Canadian institutionsDalhousie University
Fundersnot available
KeywordsContingencyComputer scienceGridTransmission lineTransmission (telecommunications)Mathematical optimizationElectric power transmissionReliability engineeringEngineeringMathematicsTelecommunications

Abstract

fetched live from OpenAlex

We aim to solve the OPF problem by defining contingency scenarios involved in the optimization problem by means of a SDP relaxation. Contingency scenarios are performed for the IEEE 39-bus system. Contingency analyses are performed by generation and line losses. Contingency scenarios are considered to be possible events. These events may be single contingencies, such as a generation unit failures or transmission line failures, or they may be double contingencies. Transmission line contingencies occur with the loss of critical lines of the transmission grid on the system. After single or multiple contingencies occur, it is required to shed some load, drop or trip the generation, or trip transmission lines for maintaining secure grid operations. In our contingency scenarios, we basically determine the appropriate amount of load to be shed. The SDP based OPF problem is tested for feasible transactions and generation dispatches in the system. if such action is feasible, the global optimal solution of the SDP-based OPF problem is guaranteed. In addition, the impact of worst-case contingency is examined for our test system. The amount of load shedding required is thus obtained.

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 imitation

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

metaresearch head score (Codex)0.002
metaresearch head score (Gemma)0.006
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.005
Threshold uncertainty score0.016

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.006
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0000.001
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0050.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.006
GPT teacher head0.212
Teacher spread0.206 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreMethods

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

Quick stats

Citations0
Published2017
Admission routes1
Has abstractyes

Explore more

Same topicOptimal Power Flow DistributionFrench-language works237,207