MétaCan
Menu
Back to cohort

Implementation of Fast Bus Tripping Scheme using Microprocessor-based Relays

2019· article· en· W3093838601 on OpenAlexaff
Kris Qin, Lin Ding, Lana Zhu

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicSmart Grid Security and Resilience
Canadian institutionsManitoba Hydro
Fundersnot available
KeywordsTrippingMicroprocessorRelayOvercurrentScheme (mathematics)Computer scienceFault (geology)HazardProtective relayEmbedded systemEngineeringCircuit breakerElectrical engineeringPower (physics)Current (fluid)

Abstract

fetched live from OpenAlex

With the introduction of microprocessor-based relays, a low-cost Fast Bus Tripping Scheme can be implemented to provide a fast and selective solution for faults on distribution buses. The scheme consists of microprocessor-based overcurrent relays installed for each feeder and for each main supply. Fast Bus Tripping Scheme is designed to speed up clearing time for a distribution bus fault with a resultant decrease in the arc flash hazard. This paper elaborates a Fast Bus Tripping Scheme design example for three sections of the distribution buses under all operating scenarios, presents key considerations identified during design practice from different perspectives, such as CT connection arrangement, applied protection functionalities, relay time coordination and relay communication methods. Recommendations have been provided accordingly.

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 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: Bench or experimental · Consensus signal: Bench or experimental
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.289
Threshold uncertainty score0.316

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.008
GPT teacher head0.240
Teacher spread0.232 · 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 teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designBench or experimental
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

Citations1
Published2019
Admission routes1
Has abstractyes

Explore more

Same topicSmart Grid Security and ResilienceFrench-language works237,207