Optimal placement and sizing of STATCOMs in power systems using GHS Algorithm
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Heuristic optimization techniques are easily applicable to a wide variety of cases which makes them a popular choice for complex problems that can be difficult to solve by traditional methods. This paper presents the application of the Global Harmony Search Algorithm (GHS) to the optimal placement and sizing of STATCOMs in power systems. In the first part, the benefits of STATCOMs installation are explained and assumptions are described. Then, a literature survey on the GHS is conducted, including a detailed description of the algorithm implementation. The Newton-Raphson method is used to calculate the power flow and to select the most vulnerable nodes, whereas the GHS is employed to find the buses most suitable for STATCOM installation and its nominal power. Finally, the results obtained with the GHS are critically discussed and conclusions are drawn.
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.
Full frame distilled prediction
Teacher imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 it