MétaCan
Menu
Back to cohort
Record W2566468845 · doi:10.1186/s13662-016-1021-1

Robust stability of uncertain Markovian jump neural networks with mode-dependent time-varying delays and nonlinear perturbations

2016· article· en· W2566468845 on OpenAlexaff
Jiaojiao Ren, Hong Zhu, Shouming Zhong, Xia Zhou

Bibliographic record

VenueAdvances in Difference Equations · 2016
Typearticle
Languageen
FieldComputer Science
TopicNeural Networks Stability and Synchronization
Canadian institutionsUniversity of Waterloo
FundersChina Scholarship CouncilNational Natural Science Foundation of China
KeywordsMathematicsControl theory (sociology)Nonlinear systemUpper and lower boundsStability (learning theory)Convex combinationJumpingMarkov processArtificial neural networkJumpRegular polygonComputer scienceConvex optimizationMathematical analysis

Abstract

fetched live from OpenAlex

In this paper, the problem of delay-dependent stability is investigated for uncertain Markovian jump neural networks with leakage delay, two additive time-varying delay components, and nonlinear perturbations. The Markovian jumping parameters in the connection weight matrices and two additive time-varying delay components are assumed to be different in the system model, and the Markovian jumping parameters in each of the two additive time-varying delay components are also different. The relationship between the time-varying delays and their upper delay bounds is efficiently utilized to study the suggested system in two cases: with known or unknown parameters, which leads to more information of the lower and upper bounds of the time-varying delays that can be used. By constructing a newly augmented Lyapunov-Krasovskii functional and using the extended Wirtinger inequality and a reciprocally convex method, several sufficient criteria are derived to guarantee the stability of the proposed model. Numerical examples and their simulations are given to show the effectiveness and advantage 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.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.002
Version: metacan-v3-hybrid-931329e0061cValidation 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: Methods · Consensus signal: Methods
Teacher disagreement score0.006
Threshold uncertainty score0.013

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.002
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0000.000
Science and technology studies0.0000.001
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0010.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.023
GPT teacher head0.246
Teacher spread0.223 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreMethods

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations10
Published2016
Admission routes1
Has abstractyes

Explore more

Same venueAdvances in Difference EquationsSame topicNeural Networks Stability and SynchronizationFrench-language works237,207