Stochastic robust finite‐time boundedness for semi‐Markov jump uncertain neutral‐type neural networks with mixed time‐varying delays via a generalized reciprocally convex combination inequality
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
Summary This article investigates the stochastic robust finite‐time boundedness problem for semi‐Markov jump uncertain (SMJU) neutral‐type neural networks with distributed and additive time‐varying delays (TDs). To derive less conservative stability criteria, a generalized reciprocally convex combination inequality (RCCI) is first proposed, which includes the existing RCCIs as its special cases. By taking full advantage of the characteristics of various TDs and SMJU parameters, a novel suitable Lyapunov‐Krasovskii functional is provided. Then, with the virtue of the new RCCI and other analysis approaches, some new criteria guaranteeing the underlying systems are stochastically robustly finite‐time bounded or stable and are derived in the form of linear matrix inequalities. Finally, three numerical examples are given to show the validity of the approaches presented in this article.
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.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 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