Non‐fragile sliding mode control of discrete switched singular systems with time‐varying delays
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
This study tends to solve the finite‐time boundedness (FTB) problems for discrete switched singular systems with time‐varying delays via a non‐fragile sliding mode approach. The remarkable feature of the provided method is that a new sliding surface function is constructed such that a full‐order dynamic system is acquired. Thus, a non‐fragile sliding mode controller can be proposed to guarantee the FTB of the dynamic system. Therein, by employing the multiple Lyapunov‐like functions and dwell time (DT) method, sufficient conditions and the DT of switching signal are given to ensure the FTB of the sliding mode dynamics. These results are then applied to the FTB issue, being expressed as a solvable optimisation problem. Furthermore, by employing a discrete reaching condition, the proposed sliding mode controller can guarantee the reachability of the quasi‐sliding mode. The validity of the proposed theorems is verified through a numerical example.
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.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 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