MétaCan
Menu
Back to cohort
Record W2343011127 · doi:10.1109/tnnls.2016.2518479

Pinning Impulsive Synchronization of Reaction–Diffusion Neural Networks With Time-Varying Delays

2016· article· en· W2343011127 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

VenueIEEE Transactions on Neural Networks and Learning Systems · 2016
Typearticle
Languageen
FieldComputer Science
TopicNeural Networks Stability and Synchronization
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsReaction–diffusion systemSynchronization (alternating current)Artificial neural networkControl theory (sociology)DiffusionCellular neural networkComputer scienceBoundary (topology)Topology (electrical circuits)MathematicsControl (management)Mathematical analysisPhysicsArtificial intelligence

Abstract

fetched live from OpenAlex

This paper investigates the exponential synchronization of reaction-diffusion neural networks with time-varying delays subject to Dirichlet boundary conditions. A novel type of pinning impulsive controllers is proposed to synchronize the reaction-diffusion neural networks with time-varying delays. By applying the Lyapunov functional method, sufficient verifiable conditions are constructed for the exponential synchronization of delayed reaction-diffusion neural networks with large and small delay sizes. It is shown that synchronization can be realized by pinning impulsive control of a small portion of neurons of the network; the technique used in this paper is also applicable to reaction-diffusion networks with Neumann boundary conditions. Numerical examples are presented to demonstrate 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.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow)
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.908
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0010.000
Scholarly communication0.0000.001
Open science0.0000.000
Research integrity0.0000.001
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.007
GPT teacher head0.202
Teacher spread0.194 · 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