MétaCan
Menu
Back to cohort
Record W2794352985 · doi:10.1109/tpwrs.2018.2811707

A Cumulant-Tensor-Based Probabilistic Load Flow Method

2018· article· en· W2794352985 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 · 2018
Typearticle
Languageen
FieldEngineering
TopicPower System Reliability and Maintenance
Canadian institutionsUniversity of Victoria
Fundersnot available
KeywordsProbabilistic logicReliability (semiconductor)Monte Carlo methodElectric power systemMathematical optimizationComputer scienceWind powerGridRandom variableReliability engineeringTensor (intrinsic definition)Power (physics)EngineeringMathematicsElectrical engineeringStatistics

Abstract

fetched live from OpenAlex

Probabilistic load flow analysis is an important part of grid design, optimization, and operation due to the uncertainties in the power network for both generation and demand, increasingly so for newly integrated technologies including wind power and plug-in vehicles. A reliable, fast, and robust mathematical method for such analyses is a key requirement to help support widespread integration of these new generation and load sources. Conventional deterministic Monte Carlo analyses, though simple in implementation, becomes too slow as networks become more complex. In this paper, a new cumulant-tensor based method is used to assess power flows. Probability distribution functions and reliability indices are generated as final outputs. Furthermore, general correlation between input random variables is included in the analysis. An illustrative 2-bus network is presented along 24-bus IEEE system as case studies, showing the capabilities and increased reliability of the method.

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.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow), Insufficient payload (model declined to judge)
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.993
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.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.0000.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.

Opus teacher head0.014
GPT teacher head0.241
Teacher spread0.227 · 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