MétaCan
Menu
Back to cohort
Record W2963080021 · doi:10.1109/tpwrs.2018.2825657

Applying Polynomial Chaos Expansion to Assess Probabilistic Available Delivery Capability for Distribution Networks With Renewables

2018· article· en· W2963080021 on OpenAlexaff
Hao Sheng, Xiaozhe Wang

Bibliographic record

VenueIEEE Transactions on Power Systems · 2018
Typearticle
Languageen
FieldDecision Sciences
TopicProbabilistic and Robust Engineering Design
Canadian institutionsMcGill University
Fundersnot available
KeywordsPolynomial chaosProbabilistic logicRandomnessMathematical optimizationMonte Carlo methodRenewable energyComputer scienceProbability distributionCHAOS (operating system)Random variableReliability engineeringEngineeringMathematicsElectrical engineering

Abstract

fetched live from OpenAlex

Considering the increasing penetration of renewable energy sources and electrical vehicles in utility distribution feeders, it is imperative to study the impacts of the resulting increasing uncertainty on the delivery capability of a distribution network. In this paper, probabilistic available delivery capability (ADC) is formulated for a general distribution network integrating various renewable energy sources (RES) and load variations. To reduce the computational efforts by using conventional Monte Carlo simulations, we develop and employ a computationally efficient method to assess the probabilistic ADC, which combines the up-to-date sparse polynomial chaos expansion (PCE) and the continuation method. Particularly, the proposed method is able to handle a large number of correlated random inputs with different marginal distributions. Numerical examples in the IEEE 13 and IEEE 123 node test feeders are presented, showing that the proposed method can achieve accuracy and efficiency simultaneously. Numerical results also demonstrate that the randomness brought about by the RES and loads indeed leads to a reduction in the delivery capability of a distribution network.

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.006
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.006

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.006
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.001
Science and technology studies0.0000.001
Scholarly communication0.0000.001
Open science0.0000.001
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0010.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.083
GPT teacher head0.298
Teacher spread0.215 · 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

Citations52
Published2018
Admission routes1
Has abstractyes

Explore more

Same venueIEEE Transactions on Power SystemsSame topicProbabilistic and Robust Engineering DesignFrench-language works237,207