Please use this identifier to cite or link to this item: http://hdl.handle.net/10553/52414
Title: Systems methodology for classical neural nets at various levels
Authors: Moreno-Díaz, Roberto 
De Blasio, Gabriel 
UNESCO Clasification: 1203 Ciencia de los ordenadores
Issue Date: 2001
Journal: Lecture Notes in Computer Science 
Conference: 8th International Workshop on Computer Aided Systems Theory 
8th International Workshop on Computer Aided Systems Theory, EUROCAST 2001 
Abstract: The different aspects of classical neural nets are treated here at the light of Systems Theory. First, we consider McCulloch-Pitts-Blum formalisms, which are regarded as biological counterparts of logical machines (automata). Systems Theory inspired the introduction of state transition and functional matrices, to treat problems of analysis, synthesis, stability and oscillations. The so called McCulloch Program I is completed by the development of systems technics to allow the neural synthesis of arbitrary probabilistic automata. Next, nets to integrate sensorial functions, as well as intermodal integration and effector action are considered, which corresponds to a level higher than the “molecular” neuron-like computing element. Finally, at the highest level, modules for the so called generalized robotic-like behavioral systems are presented, in line with the known McCulloch-Problem II. This includes a diagram for a behavioral system under a command and control subsystem of the type of the reticular formation of vertebrates.
URI: http://hdl.handle.net/10553/52414
ISBN: 978-3-540-42959-3
354042959X
ISSN: 0302-9743
DOI: 10.1007/3-540-45654-6_24
Source: Moreno-Díaz R., Buchberger B., Luis Freire J. (eds) Computer Aided Systems Theory — EUROCAST 2001. EUROCAST 2001. Lecture Notes in Computer Science, vol 2178. Springer, Berlin, Heidelberg
Appears in Collections:Actas de congresos
Show full item record

Page view(s)

59
checked on Sep 18, 2021

Google ScholarTM

Check

Altmetric


Share



Export metadata



Items in accedaCRIS are protected by copyright, with all rights reserved, unless otherwise indicated.