Optimisation du taux de compensation série d'une longue ligne de distribution : cas de l'Hydro-Québec : Abitibi-Témiscamingue
Bibliographic record
Abstract
Ce mémoire de maîtrise traite de l'application de la technique de compensation série. La recherche vise le développement d'une méthode d'optimisation pour calculer le \ntaux optimal de compensation série afin d'améliorer la performance du réseau de distribution radial. La méthode défini comme fonction objective la variation de tension \nsur la ligne de distribution qui devra être minimisée ainsi que des contraintes de stabilité à respecter. Ces contraintes sont basées sur le concept de stabilité en régime transitoire et permanent, elles sont : le transfert maximal de la puissance, les pertes de puissance réactive, l'oscillation de la vitesse des moteurs, le phénomène de papillotement ou clignotement, l'inversion du courant de court circuit et la résonance sous-synchrone (SSR). Toutes ces contraintes sont formulées sous forme d'équations et inéquations algébriques. La mise en ouvre numérique et les simulations sont obtenues à l'aide du logiciel Matlab/Symspowersym. Les performances de la topologie du réseau de distribution à étudier sont évaluées par de nombreuses simulations. \n \nThis research work concerns an application of series compensation technique for long distance distribution network. This research aims at the development of an optimization method to compute the suitable degree of series compensation in order to improve performances of the radial distribution network. This method defines as the objective function, the voltage variation on the distribution line which will be minimized and subject to \nstability constraints to respect. The constraints are based on the concept of transient and steady state stabilities; those constraints are: maximum power transfer, tosses of reactive power, oscillations of the motor speed, the phenomenon of flicker, the short circuit current inversion and sub-synchronous resonance SSR Ail components of the \noptimization method are formulated as algebraic equations and inequations. \nThe numerical implementation of the work is carried out using the Matlab/Sys powersystems software. Performances of the distribution network topology are studied by several simulation scenarios.
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.000 |
| Insufficient payload (model declined to judge) | 0.007 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".