Post-Processing of non gradient-based Topology Optimization with Simulated Annealing
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
Topology optimization (TO) is a mathematical method of determining distribution of material in a design domain to achieve maximum performance for the desired application. Non-gradient-based topology optimization methods are beneficial for the problems in which the derivative of the objective function is not easy or even possible to calculate. The results coming from such methods include gray area and discontinuity based on the optimization algorithm. In this paper, a post-processing algorithm is presented to improve the results from a non-gradient topology optimization simulated annealing based process. It has been shown that the results using this post-processing method have less gray areas by fixing the densities of the elements. Therefore, better compliance values obtained for the cantilever and MBB beams problems regarding the results in the literature. The main advantage of post-processing is that the number of iterations can be reduced without sacrificing the quality of the results. This leads to improving the results as well as reducing the calculation costs by the faster convergence.
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.001 |
| 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