Adaptive Time-Stepping Universal Line and Machine Models for Real Time and Faster-Than-Real-Time Hardware Emulation
Bibliographic record
Abstract
Transmission lines and rotating machines that widely exist in power systems should be accurately modeled in real-time electromagnetic transient (EMT) simulation for obtaining precise results for hardware-in-the-loop applications. In the conventional EMT simulator, the time-step is fixed, which may lead to inefficiencies when the time constants of the system change. The adaptive time-stepping (ATS) method can efficaciously solve this problem; however, the ATS schemes for the universal transmission line model (ULM) and universal machine (UM) model remain to be investigated. This article derives the ATS models for ULM and UM, and the proposed ULM model is more stable than the traditional model. Both ATS models are emulated on the parallel and pipelined architecture of the field-programmable gate array (FPGA). The proposed subsystem-based ATS scheme and the local truncation error (LTE) based time-step control enable the large-scale systems to be simulated in real time and “faster-than-real-time” modes. The IEEE 39-bus system with ATS models is emulated on two interconnected FPGA boards, and the emulation results compared with PSCAD/EMTDC and fixed time-stepping (FTS) hardware emulator verify the effectiveness of the proposed models and show that the LTE of ULM and UM can be reduced by 76.5% and 62.0%, respectively, compared with the FTS simulation.
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".