MétaCan
Menu
Back to cohort
Record W2033548020 · doi:10.1109/pes.2010.5589534

Smart reconfiguration using fuzzy graphs

2010· article· en· W2033548020 on OpenAlexaff
Andu Dukpa, Bala Venkatesh

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicOptimal Power Flow Distribution
Canadian institutionsToronto Metropolitan University
Fundersnot available
KeywordsControl reconfigurationSmart gridFuzzy logicComputer scienceFuzzy control systemGraphLine (geometry)Control theory (sociology)MathematicsEngineeringTheoretical computer scienceArtificial intelligenceEmbedded systemElectrical engineering

Abstract

fetched live from OpenAlex

Distribution Systems traditionally have a tree-like structure with several branches. They supply loads that vary through the day and as a result, some branches are loaded more than others are. By reconfiguring the system, loads from the overloaded branches may be moved to under-loaded branches. Consequently, loads in the branches can be balanced so that the real power losses are reduced and the voltage profile is improved. While Smart grid technologies in the future will facilitate real-time reconfiguration of distribution systems, it requires the use of efficient and fast methods. In that direction, this paper proposes a smart reconfiguration method without using load flow. It models the distribution system as a fuzzy graph using a data structure. It quantifies membership functions of edges of fuzzy graph using line impedance values and uses approximate MVA flow in the lines to characterize the fuzzy graph. Using the membership functions and line flow values, the method computes a fuzzy system participation function. The proposed method minimizes this function to balance the loads in the branches and consequently minimizes real power losses. The paper reports results from a sample system study to demonstrate the proposed method.

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.000
metaresearch head score (Gemma)0.001
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.006
Threshold uncertainty score0.011

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.001
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.001
Bibliometrics0.0010.001
Science and technology studies0.0000.001
Scholarly communication0.0010.001
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0020.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.010
GPT teacher head0.218
Teacher spread0.208 · 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

Citations2
Published2010
Admission routes1
Has abstractyes

Explore more

Same topicOptimal Power Flow DistributionFrench-language works237,207