A supervised machine-learning method for optimizing the automatic transmission system of wind turbines
Bibliographic record
Abstract
Large-scale wind turbines mostly use Continuously Variable Transmission (CVT) as the transmission system, which is highly efficient. However, it comes with high complexity and cost too. In contrast, the small-scale wind turbines that are available in the market offer a one-speed gearing system only where no gear ratios are varied, resulting in low efficiency of harvesting energy and leading to gears failure. In this research, an unsupervised machine-learning algorithm is proposed to address the energy efficiency of the automatic transmission system in vertical axis wind turbines (VAWT), to increase its efficiency in harvesting energy. The aim is to find the best adjustment for VAWT while the automatic transmission system is taken into account. For this purpose, the system is simulated and tested under various gear ratios conditions while a centrifugal clutch is applied to automatic gear shifting. The outcomes indicated that the automatic transmission system could successfully adjust the spinning in line with the wind speed. As a result, the obtained level of harvested voltage and power by VAWT with the automatic transmission system are improved significantly. Consequently, it is concluded that automatic VAWTs, equipped with the machine-learning capability can readjust themselves with the wind speed more efficiently.
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.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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".