The adaptive servomechanism problem for MIMO systems
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
In this paper, new theoretical and simulated results for the robust adaptive servomechanism problem considered in Miller and Davison (1987, 1992) for unknown MIMO systems are given. As in Miller and Davison (1989) and Chang and Davison (1995) the proposed controller is nonlinear and of the switching type, and has the properly that after a finite time, switching ceases, thereby resulting in the system being controlled by a LTI controller. The switching mechanism which the authors present is robust to all bounded piecewise continuous references y/sub ref/(t) and disturbances w(t), attempts to provide a "reasonable" transient response by "monitoring" plant output y(t) and/or error signal e(t), and, while limited to strictly proper finite dimensional MIMO systems, is computationally simpler than for the case of continuous reference and disturbance signals.
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