MétaCan
Menu
Back to cohort
Record W2105193302 · doi:10.1109/tpwrs.2009.2034526

Approximate Voltage-Behind-Reactance Induction Machine Model for Efficient Interface With EMTP Network Solution

2009· article· en· W2105193302 on OpenAlexaff
Liwei Wang, Juri Jatskevich

Bibliographic record

VenueIEEE Transactions on Power Systems · 2009
Typearticle
Languageen
FieldEngineering
TopicReal-time simulation and control systems
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsReactanceEmtpDiscretizationInterface (matter)Computer scienceControl theory (sociology)VoltageNetwork modelTransient (computer programming)EngineeringAlgorithmMathematicsElectrical engineeringElectric power systemMathematical analysisPhysicsArtificial intelligenceParallel computingPower (physics)

Abstract

fetched live from OpenAlex

A so-called voltage-behind-reactance (VBR) induction machine model has recently been proposed for the Electro-Magnetic Transient Program (EMTP) solution as an advantageous alternative to the traditionalqdand phase-domain (PD) models. This paper focuses on achieving an efficient interface of the machine models with the EMTP network. It is shown first that a discretized PD model can be formulated to have a constant machine conductance submatrix, which is a very desirable numerical property that allows avoiding the re-factorization of the network conductance matrix at every time step. Furthermore, an approximate voltage-behind-reactance (AVBR) model is proposed where the rotor-speed-dependent coefficients are neglected, thus leading to a similar constant machine conductance submatrix and efficient interface. Case studies demonstrate that the new AVBR model represents a significant improvement in terms of numerical accuracy and efficiency over other established models used in EMTP.

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.000
metaresearch head score (Gemma)0.001
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: Empirical · Consensus signal: none
Teacher disagreement score0.003
Threshold uncertainty score0.010

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.001
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0010.001
Open science0.0010.000
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0030.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.011
GPT teacher head0.220
Teacher spread0.209 · 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
GenreEmpirical

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

Citations11
Published2009
Admission routes1
Has abstractyes

Explore more

Same venueIEEE Transactions on Power SystemsSame topicReal-time simulation and control systemsFrench-language works237,207