MétaCan
Menu
Back to cohort
Record W2134994421 · doi:10.1109/mper.2001.4311177

Analysis of a Static Transfer Switch with Respect to Transfer Time

2001· article· en· W2134994421 on OpenAlexaff
Hossein Mokhtari, S.B. Dewan, Mohammad Reza Iravani

Bibliographic record

VenueIEEE Power Engineering Review · 2001
Typearticle
Languageen
FieldEngineering
TopicPower System Optimization and Stability
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsThyristorMaximum power transfer theoremCommutationTransfer (computing)Computer sciencePower (physics)Uninterruptible power supplySet (abstract data type)Time domainPoint (geometry)VoltageElectronic engineeringControl theory (sociology)Topology (electrical circuits)EngineeringElectrical engineeringMathematicsPhysics

Abstract

fetched live from OpenAlex

Thyristor-based static transfer switches (STSs) are used in uninterruptible power supply systems and in distribution networks to provide connection to alternate sources of ac power for critical loads when the main sources fail. Performance of STSs from a transfer time point of view has not been reported in the technical literature, however. This performance evaluation is a complex issue due to the dependence of the transfer time on gating scheme and commutation between thyristors. This article provides a thorough analysis of a fast gating strategy for STS systems. It derives analytical expressions to estimate the transfer time for different operating conditions and identifies the worst-case scenario(s) in which maximum transfer time occurs. The analytical results are validated based on time-domain simulation studies using the PSCAD/EMTDC package for a medium-voltage system. The simulation results are verified based on comparison with those obtained from an experimental set-up.

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.001
metaresearch head score (Gemma)0.003
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.012

Distilled classifier scores by category (both heads)

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

Citations35
Published2001
Admission routes1
Has abstractyes

Explore more

Same venueIEEE Power Engineering ReviewSame topicPower System Optimization and StabilityFrench-language works237,207