MétaCan
Menu
Back to cohort
Record W1697645444 · doi:10.1109/iscas.2004.1329967

Automated state-variable formulation for power electronic circuits and systems

2004· article· en· W1697645444 on OpenAlex
Juri Jatskevich, T. Aboul-Seoud

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
TopicReal-time simulation and control systems
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsVariable (mathematics)State variableElectronic circuitComputer scienceRepresentation (politics)Electric power systemState spaceState (computer science)Tree (set theory)Topology (electrical circuits)Network topologyElectrical networkPower (physics)AlgorithmMathematicsEngineering

Abstract

fetched live from OpenAlex

State variable approach is often used for modelling power-electronic circuits at the system level with controls. In the approach considered herein, the minimal state-space representation of the overall system is generated from the circuit branch data and updated for each new topology of the system. The network partitioning into optimal sets of tree and link branches is achieved using the spanning tree algorithms. For system with variable parameters recomputing the entire state equation to reflect the parameter changes may be prohibitively expensive. In this paper, a computationally effective algorithm for updating the required terms based on topological information is presented.

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 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.745
Threshold uncertainty score0.395

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.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.006
GPT teacher head0.211
Teacher spread0.205 · 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

Citations7
Published2004
Admission routes1
Has abstractyes

Explore more

Same topicReal-time simulation and control systemsFrench-language works237,207