MétaCan
Menu
Back to cohort

Mathematical Schemes to Linearize Operating Times of Overcurrent Relays by Sequentially Fixing Plug Settings and Time Multiplier Settings

2020· article· en· W3109205750 on OpenAlexaff
Ali R. Al-Roomi, M.E. El-Hawary

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicPower Systems Fault Detection
Canadian institutionsDalhousie University
Fundersnot available
KeywordsOvercurrentRelayMultiplier (economics)SimplexNonlinear systemComputer scienceLinear programmingMathematical optimizationNonlinear programmingPlug and playOptimization problemEngineeringAlgorithmMathematicsElectrical engineering

Abstract

fetched live from OpenAlex

Nowadays, many studies have been presented in the literature to solve various optimal relay coordination (ORC) problems. These highly constrained nonlinear nonconvex optimization problems are commonly solved using evolutionary algorithms (EAs). For online applications, where the processing speed is very crucial, some studies suggest using different types of linear programming (LP), including simplex and interior-point methods, while others suggest hybridizing both EAs and LPs. For these approaches, the ANSI/IEEE and IEC/BS standard models used to calculate the operating times of overcurrent relays (OCRs) are linearized by just fixing their plug settings (PS) and varying time multiplier settings (TMS). This study presents another way to linearize these models by doing the opposite where TMS are fixed and PS are varied for both standard models. These linearized models can be used to effectively tune the objective functions of ORC problems to achieve both performance criteria; the solution quality and the processing speed.

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: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.641
Threshold uncertainty score0.873

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.213
Teacher spread0.206 · 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
Published2020
Admission routes1
Has abstractyes

Explore more

Same topicPower Systems Fault DetectionFrench-language works237,207