MétaCan
Menu
Back to cohort
Record W1958333637 · doi:10.1142/s1793524516500169

Exponential stability of memristor-based synchronous switching neural networks with time delays

2015· article· en· W1958333637 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.

fundA Canadian funder is recorded on the work.
no affNo Canadian affiliation: this work is invisible to an affiliation-only frame.
No Canadian affiliation. An affiliation-only frame, the usual design, would never have seen this work. It is one of the works that make the case for inverting the frame.

Bibliographic record

VenueInternational Journal of Biomathematics · 2015
Typearticle
Languageen
FieldComputer Science
TopicNeural Networks Stability and Synchronization
Canadian institutionsnot available
FundersMcMaster University
KeywordsMemristorControl theory (sociology)Artificial neural networkUniquenessStability (learning theory)Exponential stabilityComputer scienceSeries (stratigraphy)Lyapunov functionMathematicsControl (management)Artificial intelligenceNonlinear systemEngineeringElectronic engineeringPhysics

Abstract

fetched live from OpenAlex

In this paper, we study the existence, uniqueness and stability of memristor-based synchronous switching neural networks with time delays. Several criteria of exponential stability are given by introducing multiple Lyapunov functions. In comparison with the existing publications on simplice memristive neural networks or switching neural networks, we consider a system with a series of switchings, these switchings are assumed to be synchronous with memristive switching mechanism. Moreover, the proposed stability conditions are straightforward and convenient and can reflect the impact of time delay on the stability. Two examples are also presented to illustrate the effectiveness of the theoretical results.

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.604
Threshold uncertainty score0.453

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.000
Science and technology studies0.0000.000
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.022
GPT teacher head0.244
Teacher spread0.222 · 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