MétaCan
Menu
Back to cohort
Record W2038525809 · doi:10.1017/s0960129512000448

Delay-dependent robust stability criteria for stochastic neural networks of neutral-type with interval time-varying delay and linear fractional uncertainties

2014· article· en· W2038525809 on OpenAlex

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueMathematical Structures in Computer Science · 2014
Typearticle
Languageen
FieldComputer Science
TopicNeural Networks Stability and Synchronization
Canadian institutionsUniversity of Guelph
Fundersnot available
KeywordsDifferentiable functionInterval (graph theory)Monotonic functionMathematicsLinear matrix inequalityStability (learning theory)Artificial neural networkControl theory (sociology)Type (biology)Applied mathematicsUpper and lower boundsComputer scienceMathematical optimizationMathematical analysisControl (management)

Abstract

fetched live from OpenAlex

In this paper, we investigate the problem of robust stability for a class of delayed neural networks of neutral-type with linear fractional uncertainties. The activation functions are assumed to be unbounded, non-monotonic and non-differentiable, and the delay is assumed to be time-varying and belonging to a given interval, which means that the lower and upper bounds of the interval time-varying delay are available. By constructing a general form of the Lyapunov–Krasovskii functional, and using the linear matrix inequality (LMI) approach, we derive several delay-dependent stability criteria in terms of LMI. Finally, we give a number of examples to illustrate the effectiveness of the proposed method.

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 imitation

Not 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.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.514
Threshold uncertainty score0.645

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.001
Scholarly communication0.0000.001
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.025
GPT teacher head0.268
Teacher spread0.243 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it