A Novel Chattering-Free Discrete Sliding Mode Controller With Disturbance Compensation for Zinc Roasting Temperature Distribution Control
Bibliographic record
Abstract
Precise control of roasting temperature is paramount for optimizing production efficiency in the zinc smelting process. However, existing research mainly focuses on average temperature control, and there is little research on temperature distribution control. To achieve this, a roasting temperature distribution model is first established based on the principles of heat transfer. Second, accounting for modeling errors and environmental disturbances, a discrete sliding mode control with disturbance compensation is proposed. Besides, continuous reaching law is implemented to address issues related to chattering, so as to ensure stable roasting temperature. Finally, the quasi-sliding-mode domain of the proposed method is obtained by boundary analysis. The simulation results of roasting temperature distribution control substantiate the efficacy of the proposed approach.Note to Practitioners—Roasting temperature is the most critical temperature that directly determines product quality and stable production during the roasting process. Currently popular schemes all use average temperature as the control target. However, the average temperature does not represent the actual temperature inside the roaster. This paper aims to achieve the temperature distribution of the roaster, thereby ultimately improving product quality and ensuring safe production. This paper proposes a roasting temperature control scheme based on discrete sliding mode control. During the implementation of this method, the current temperature error distribution is used as input to adjust the zinc concentrate feeding rate in real time. Experimental simulations verified the feasibility of this method, but it has not yet been applied in actual production.
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.000 | 0.001 |
| 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.001 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".