Scanning the issue

NEUROCOMPUTINC Neurocomputing

15 (1997) 89

Scanning the issue J.F. Feng and B. Tirozzi propose in .4 discrete version ofthe dynumic link network a novel approach for the analysis of the dynamic link network (DLN) and a Hopfield-net-like discrete version of the DLN. An algorithm is given to select the DLN parameters for convergence of the network to any chosen attractor. In A mathematical solution to a Network Designing Problem, Y. Takahashi proposes a solution to the Network Designing Problem (NDP) and the subproblem, the Network Training Problem (NTP), applying rate distortion theory. A mathematical procedure is described for the construction of a minimal network structure from the sample set and a polynomial-time shortcut with measurable error is given. Two simple examples illustrate the proposed procedure. I appreciate the cooperation of all those who submitted their work for inclusion in this issue. V. David Sbchez Editor in Chief

0925-2312/97/$17.00 Copyright J> 1997 Elsevier Science B.V. All rights reserved PI1 SO925-2312(96)00017-9