MétaCan
Menu
Back to cohort
Record W2118448684 · doi:10.1109/tpwrs.2007.901281

A Multistage Algorithm for Identification of Nonlinear Aggregate Power System Loads

2007· article· en· W2118448684 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 · 2007
Typearticle
Languageen
FieldEngineering
TopicControl Systems and Identification
Canadian institutionsUniversity of Calgary
Fundersnot available
KeywordsNonlinear systemPolynomialDiscretizationElectric power systemAlgorithmSystem identificationMathematical optimizationControl theory (sociology)Identification (biology)MathematicsEstimation theoryPower (physics)Computer scienceData modeling

Abstract

fetched live from OpenAlex

A multistage identification algorithm for dynamic power system load models is proposed in this paper. The multistage approach is used to address the nonconvexity of the identification problem. Initial stages are used to find good preliminary estimates for the parameters of the model. Specifically, the initial stages are as follows: Equations for dynamic power system loads are discretized using the zero-order hold method and then approximated with a 2nd-order polynomial NARMAX model. Finally, an extended least squares approach is used to estimate the parameters of the NARMAX model, from which initial estimates for the parameters of the original model are obtained. In the final stage, the values found in the initial stages are used as the starting point for a Levenberg-Marquardt optimization routine that computes the optimal parameters. Numerical experiments using data from both simulated and real systems illustrate the computational complexity and accuracy of the proposed algorithm. Curve-fitting experiments are used to justify the polynomial NARMAX approximation.

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)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.985
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.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.223
Teacher spread0.216 · 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