MétaCan
Menu
Back to cohort
Record W2570248682 · doi:10.1109/cdc.2016.7798912

An outer approximation of the Minkowski sum of convex conic sets with application to demand response

2016· article· en· W2570248682 on OpenAlexaff
Suhail Barot, Josh A. Taylor

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicSmart Grid Energy Management
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsMathematical optimizationOperator (biology)Scheduling (production processes)Conic sectionRegular polygonComputationConic optimizationQuadratic equationMinkowski additionComputer scienceMinkowski spaceMathematicsConvex optimizationConvex combinationAlgorithm

Abstract

fetched live from OpenAlex

Flexible loads can provide services such as load-shifting and regulation to power system operators through demand response. A system operator must know the aggregate capabilities of a load population to use it in scheduling and dispatch routines such as optimal power flow and unit commitment. It is not practical for a system operator to model every single load because it would compromise tractability and require potentially unavailable information. A key challenge for load aggregators is to develop low-order models of load aggregations that system operators can use in their operating routines. In this paper, we develop a simple approximation for loads modeled by linear, second-order cone, and semidefinite constraints. It is an outer approximation of the Minkowski sum, the exact computation of which is intractable. We apply the outer approximation to loads with convex quadratic apparent power constraints and uncertainty modeled with second-order cone constraints.

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.310
Threshold uncertainty score0.140

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.005
GPT teacher head0.199
Teacher spread0.194 · 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

Citations15
Published2016
Admission routes1
Has abstractyes

Explore more

Same topicSmart Grid Energy ManagementFrench-language works237,207