Title	Code Recognition and Set Selection with Neural Networks [electronic resource] / edited by Clark Jeffries
Imprint	Boston, MA : Birkhรคuser Boston, 1991
Connect to	http://dx.doi.org/10.1007/978-1-4612-3216-2
Descript	online resource

In mathematics there are limits, speed limits of a sort, on how many computational steps are required to solve certain problems. The theory of computational complexity deals with such limits, in particular whether solving an n-dimensional version of a particular problem can be accomplished with, say, 2 n n steps or will inevitably require 2 steps. Such a bound, together with a physical limit on computational speed in a machine, could be used to establish a speed limit for a particular problem. But there is nothing in the theory of computational complexity which precludes the possibility of constructing analog devices that solve such problems faster. It is a general goal of neural network researchers to circumvent the inherent limits of serial computation. As an example of an n-dimensional problem, one might wish to order n distinct numbers between 0 and 1. One could simply write all n! ways to list the numbers and test each list for the increasing property. There are much more efficient ways to solve this problem; in fact, the number of steps required by the best sorting algorithm applied to this problem is proportional to n In n

0โ{128}{148}The Neural Network Approach to Problem Solving -- 0.1 Defining a Neural Network -- 0.2 Neural Networks as Dynamical Systems -- 0.3 Additive and High Order Models -- 0.4 Examples -- 0.5 The Link with Neuroscience -- 1โ{128}{148}Neural Networks as Dynamical Systems -- 1.1 General Neural Network Models -- 1.2 General Features of Neural Network Dynamics -- 1.3 Set Selection Problems -- 1.4 Infeasible Constant Trajectories -- 1.5 Another Set Selection Problem -- 1.6 Set Selection Neural Networks with Perturbations -- 1.7 Learning -- Problems and Answers -- 2โ{128}{148}Hypergraphs and Neural Networks -- 2.1 Multiproducts in Neural Network Models -- 2.2 Paths, Cycles, and Volterra Multipliers -- 2.3 The Cohen-Grossberg Function -- 2.4 The Foundation Function ? -- 2.5 The Image Product Formulation of High Order Neural Networks -- Problems and Answers -- 3โ{128}{148}The Memory Model -- 3.1 Dense Memory with High Order Neural Networks -- 3.2 High Order Neural Network Models -- 3.3 The Memory Model -- 3.4 Dynamics of the Memory Model -- 3.5 Modified Memory Models Using the Foundation Function -- 3.6 Comparison of the Memory Model and the Hopfield Model -- Problems and Answers -- 4โ{128}{148}Code Recognition, Digital Communications, and General Recognition -- 4.1 Error Correction for Binary Codes -- 4.2 Additional Tests of the Memory Model as a Decoder -- 4.3 General Recognition -- 4.4 Scanning in Image Recognition -- 4.5 Commercial Neural Network Decoding -- Problems and Answers -- 5โ{128}{148}Neural Networks as Dynamical Systems -- 5.1 A Two-Dimensional Limit Cycle -- 5.2 Wiring -- 5.3 Neural Networks with a Mixture of Limit Cycles and Constant Trajectories -- Problems and Answers -- 6โ{128}{148}Solving Operations Research Problems with Neural Networks -- 6.1 Selecting Permutation Matrices with Neural Networks -- 6.2 Optimization in a Modified Permutation Matrix Selection Model -- 6.3 The Quadratic Assignment Problem -- Appendix Aโ{128}{148}An Introduction to Dynamical Systems -- A.1 Elements of Two-Dimensional Dynamical Systems -- A.2 Elements of n-Dimensional Dynamical Systems -- A.3 The Relation Between Difference and Differential Equations -- A.4 The Concept of Stability -- A.5 Limit Cycles -- A.6 Lyapunov Theory -- A.7 The Linearization Theorem -- A.8 The Stability of Linear Systems -- Appendix Bโ{128}{148}Simulation of Dynamical Systems with Spreadsheets -- References -- Index of Key Words -- Epilog