Soft sensor modelling of simulated moving bed separation process using <scp>STADTL</scp> ‐net
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 Simulated moving bed (SMB) chromatography exhibits broad applications in chemical production and biopharmaceutical industries owing to its high nonlinearity and process coupling complexity. This study introduces a novel soft sensor framework, designated as the spatial–temporal attention domain transfer learning network (STADTL‐Net), integrating spatial–temporal attention‐enhanced long short‐term memory (STA‐LSTM) architectures with domain‐adversarial neural networks (DANN). Conventional soft sensing methodologies frequently exhibit limited performance when confronted with significant data distribution discrepancies across distinct SMB separation configurations. The proposed model utilizes historical datasets from a four‐zone eight‐column SMB separation system (source domain) for training, subsequently adapting to a four‐zone four‐column SMB process (target domain) through adversarial domain adaptation. The STA‐LSTM module dynamically extracts multivariate spatial–temporal dependencies, while the domain‐adversarial component systematically minimizes inter‐domain distribution mismatches through gradient reversal layers. Experimental validation through fructose‐glucose separation case studies demonstrates superior prediction accuracy and enhanced generalizability under novel operating regimes. This framework provides a principled approach for soft sensor development in complex dynamic systems characteristic of chemical engineering 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