A Computationally Efficient Algorithm for Rotor Design Optimization of Synchronous Reluctance Machines
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
A generalizable algorithm is proposed for the design optimization of synchronous reluctance machine rotors. Single-barrier models are considered to reduce the algorithm's computational complexity and provide a relative comparison for rotors with different slots-per-pole combinations. Two objective values per sampled design (average and ripple torques) are computed using 2-D finite-element analysis simulations. Non-linear regression or surrogate models are trained for the two objectives through a Bayesian regularization backpropagation neural network. A multi-objective genetic algorithm is used to find the validated Pareto front solutions. An analytical ellipse constraint is then suggested to encapsulate optimal solutions. Compared with a direct sampling approach, this restriction captures an optimal region within the double-barrier space for further torque ripple reduction.
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