MétaCan
Menu
Back to cohort
Record W2034496484 · doi:10.1109/tcpmt.2012.2209118

Delay-Extraction-Based Waveform Relaxation Algorithm for Fast Transient Analysis of Power Distribution Networks

2012· article· en· W2034496484 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 Components Packaging and Manufacturing Technology · 2012
Typearticle
Languageen
FieldPhysics and Astronomy
TopicLightning and Electromagnetic Phenomena
Canadian institutionsWestern University
Fundersnot available
KeywordsWaveformAlgorithmParallelizable manifoldComputer scienceRelaxation (psychology)Transient (computer programming)ScalabilityConvergence (economics)Time domainIterative methodElectric power transmissionTransmission lineEngineeringTelecommunications

Abstract

fetched live from OpenAlex

In this paper, a waveform relaxation algorithm is presented for the efficient transient analysis of large power distribution networks. The network is modeled as an orthogonal grid of transmission lines where a delay-extraction-based macromodel is used to represent each line segment in the time domain. Novel partitioning and iterative techniques are proposed for fast convergence and improved scalability of the proposed relaxation algorithm. The overall algorithm is highly parallelizable and exhibits good scaling with both the size of the circuit matrices involved and the number of CPUs available. Numerical examples are presented to illustrate the validity and efficiency of the proposed algorithm.

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: Other design · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.886
Threshold uncertainty score0.759

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.007
GPT teacher head0.227
Teacher spread0.220 · 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