MétaCan
Menu
Back to cohort
Record W2502641588 · doi:10.1109/tdc.2016.7520089

A novel Newton-Raphson algorithm for power flow analysis in the presence of constant current sources

2016· article· en· W2502641588 on OpenAlexaff
Nazila Rajaei, Mohamed Hassan Ahmed, M.M.A. Salama

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicOptimal Power Flow Distribution
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsJacobian matrix and determinantCurrent (fluid)AlgorithmConstant currentComputer scienceNewton's methodPower (physics)Electric power systemPower flowPower-flow studyFlow (mathematics)Constant (computer programming)Current loopControl theory (sociology)MathematicsEngineeringElectrical engineeringApplied mathematicsNonlinear systemPhysics

Abstract

fetched live from OpenAlex

This paper presents a version of the Newton-Raphson (NR) algorithm that has been modified to provide a means of facilitating the power flow analysis of loop systems in the presence of current sources that rely on current controlled inverters, such as distributed generators (DGs). The modifications entail the inclusion of the current elements of current sources in the Jacobian matrix of the NR algorithm. The effect is to enable current controlled sources to be modeled directly in the power flow algorithms without the need for converting their currents to the corresponding power components, which is the traditional practice in power flow algorithms. The proposed algorithm has been tested on an IEEE 14-bus system. For loop systems with current controlled sources, the test results show that using this algorithm for power flow analysis offers enhanced accuracy.

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.002
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: Methods · Consensus signal: Methods
Teacher disagreement score0.004
Threshold uncertainty score0.011

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.002
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0000.000
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0030.001

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.012
GPT teacher head0.243
Teacher spread0.231 · 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
GenreMethods

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

Citations6
Published2016
Admission routes1
Has abstractyes

Explore more

Same topicOptimal Power Flow DistributionFrench-language works237,207