MétaCan
Menu
Back to cohort
Record W2502878530 · doi:10.1109/ccece.1998.682712

A real-time implementation of optimal reactive power flow

2002· article· en· W2502878530 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

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicOptimal Power Flow Distribution
Canadian institutionsUniversity of New Brunswick
Fundersnot available
KeywordsAC powerVoltageVoltage optimisationPower (physics)Computer sciencePower flowPower lossVoltage regulationElectric power systemPower-flow studyControl theory (sociology)Reliability engineeringElectrical engineeringEngineeringControl (management)

Abstract

fetched live from OpenAlex

The application of optimal reactive power flow (ORPF) problem to the NB (New Brunswick) Power company are presented. The potential benefits and the real-time implementation problems of ORPF are discussed. The execution of ORPF program for NE Power network has shown two major benefits: (1) the improvement in the voltage profile and voltage stability, and (2) the savings in active power loss. The improvement in voltage profile can cause less violations and a more stable system from the voltage point of view. A reduction in active power loss gained from ORPF can save a significant amount of money. The total saving for year 1995 predicted in study was in excess of $1100000, and this was supported by the real-time test. These savings can be gained simultaneously with the improvement of the voltage profiles.

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 categoriesInsufficient payload (model declined to judge)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Bench or experimental · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.602
Threshold uncertainty score0.995

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.000
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.0060.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.007
GPT teacher head0.229
Teacher spread0.222 · 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

Quick stats

Citations1
Published2002
Admission routes1
Has abstractyes

Explore more

Same topicOptimal Power Flow DistributionFrench-language works237,207