Parameter optimization of the simulated moving bed system based on the <scp>IMOSCSO</scp> 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
Abstract The optimization of operating parameters for the simulated moving bed (SMB) is complex. A parameter optimization method for the SMB system was proposed based on the improved multi‐objective sand cat swarm optimization (IMOSCSO) algorithm. The multi‐objective sand cat swarm optimization (MOSCSO) algorithm integrated the update and selection mechanism of the repository in the multi‐objective algorithm. Three strategies were proposed to improve the traditional MOSCSO algorithm for increased population diversity, global search capability, and convergence speed. First, the cubic chaotic map was used to initialize the population, which improved the uniformity of the population distribution. Second, including a variable spiral search strategy in the prey search phase enabled the sand cat swarm to explore more search paths to adjust its position. Third, the convergence speed was enhanced by incorporating the alert mechanism of the sparrow search algorithm. The improved algorithm was tested with standard test functions. The IMOSCSO algorithm outperformed other algorithms in terms of convergence and accuracy. Finally, the IMOSCSO algorithm optimized the system parameters of the SMB, demonstrating its practical applications.
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