MétaCan
Menu
Back to cohort
Record W2105003732 · doi:10.1109/wescan.1995.494068

An algebraic construction method for cellular neural networks

2002· article· en· W2105003732 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

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicNeural Networks Stability and Synchronization
Canadian institutionsUniversity of WinnipegUniversity of Manitoba
Fundersnot available
KeywordsCellular neural networkVery-large-scale integrationComputer scienceAsynchronous communicationArtificial neural networkInterconnectionFeature (linguistics)Algebraic numberProcess (computing)Component (thermodynamics)Image processingSignal processingArtificial intelligenceImage (mathematics)Theoretical computer scienceEmbedded systemMathematicsComputer hardwareComputer networkDigital signal processing

Abstract

fetched live from OpenAlex

An algebraic method for construction of a cellular neural network (CNN) is derived. Using this method, CNNs for connected component detection and the maze problem are given in detail. Because the transition of states is included in the algebraic equations during the construction of the network, the network arrives at a unique solution in either a synchronous or an asynchronous operation process, and the solution is stable. The cellular neural network has important potential applications in such areas as image processing and pattern recognition. Its continuous time feature allows real-time signal processing and its local interconnection feature makes it easy for VLSI implementation.

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 categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.872
Threshold uncertainty score0.394

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.000
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0000.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.019
GPT teacher head0.249
Teacher spread0.230 · 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