Iterative method for frequency domain identification of continuous processes with delay time
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 Delay time that affects the performances of many control synthesis techniques in controlled systems is common in most chemical industries. Estimating the delay time is also a difficult problem in identification fields. In this paper, aiming at continuous processes with delay time, an iterative least square identification method is proposed in the frequency domain. By introducing a truncated first‐order Taylor expansion, the delay time term is linearized. Linear regression equation for least squares (LS) is directly derived from the transfer function whose nonlinear term is replaced by a linear one. For reducing the linear approximation error and getting more accurate estimations of the model parameters, an iterative algorithm is developed based on the LS. Moreover, the proposed method can be easily extended to a closed‐loop system without increasing the order of the identified model. Simulations verify the effectiveness, fast convergence rates, and robustness of the proposed identification algorithm.
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