MétaCan
Menu
Back to cohort
Record W2116198287 · doi:10.1109/wescan.1993.270588

Neural networks in control systems

2002· article· en· W2116198287 on OpenAlexaff
D.H. Rao, Μ.Μ. Gupta, H.C. Wood

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicNeural Networks and Applications
Canadian institutionsUniversity of Saskatchewan
Fundersnot available
KeywordsComputer scienceArtificial neural networkControl (management)Control systemArtificial intelligenceEngineering

Abstract

fetched live from OpenAlex

Neural network structures used for system identification and control are reviewed. Due to the complexity and diversity of the properties of biological neurons, the task of compressing their complicated characteristics into a model is extremely difficult. Toward this goal, an artificial neuron, also called a unit, that receives its inputs from a number of other neurons or from the external world was developed. A weighted sum of these inputs constitutes the argument of an activation function. This is a simple, but useful first approximation of a biological neuron. Using this model, many neural structures, usually referred to as feedforward neural networks, have been reported in the literature. Many of these networks use only present values of inputs, and are therefore called instantaneous or static systems. A natural extension of static networks is the dynamic or recurrent neural network which incorporates feedback in its structure. No general theory for dynamic neural networks has yet developed similar to that for static networks. With the parallel growth in the field of fuzzy logic, many neural models encompassing the principles of neural networks and fuzzy set theory are being developed. An attempt is made to provide the basic concepts of static, dynamic, and fuzzy neural structures.>

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: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.007
Threshold uncertainty score0.023

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.002
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.002
Science and technology studies0.0000.002
Scholarly communication0.0020.002
Open science0.0010.001
Research integrity0.0030.002
Insufficient payload (model declined to judge)0.0070.002

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.016
GPT teacher head0.210
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

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
GenreEmpirical

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

Citations18
Published2002
Admission routes1
Has abstractyes

Explore more

Same topicNeural Networks and ApplicationsFrench-language works237,207