Cleveland State UniversityEngagedScholarship@CSUElectrical Engineering & Computer Science FacultyPublications

Electrical Engineering & Computer ScienceDepartment

11-1-2001

Distributed Fault Tolerance in OptimalInterpolative NetsDaniel J. SimonCleveland State University, d.j.simon@csuohio.edu

Follow this and additional works at: http://engagedscholarship.csuohio.edu/enece_facpub

Part of the Electrical and Computer Engineering Commons, and the Systems Engineering andMultidisciplinary Design Optimization CommonsPublisher's Statement© 2001 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained forall other users, including reprinting/ republishing this material for advertising or promotionalpurposes, creating new collective works for resale or redistribution to servers or lists, or reuse of anycopyrighted components of this work in other works.

Repository CitationSimon, Daniel J., "Distributed Fault Tolerance in Optimal Interpolative Nets" (2001). Electrical Engineering & Computer Science Faculty Publications.Paper 20.http://engagedscholarship.csuohio.edu/enece_facpub/20

This Article is brought to you for free and open access by the Electrical Engineering & Computer Science Department at EngagedScholarship@CSU. Ithas been accepted for inclusion in Electrical Engineering & Computer Science Faculty Publications by an authorized administrator ofEngagedScholarship@CSU. For more information, please contact library.es@csuohio.edu.

Original CitationSimon, D.; , "Distributed fault tolerance in optimal interpolative nets," Neural Networks, IEEE Transactions on , vol.12, no.6,pp.1348-1357, Nov 2001 doi: 10.1109/72.963771

[10] D. Simon and H. El-Sherief, “Fault-tolerant training for optimal inter-polative nets,” IEEE Trans. Neural Networks, vol. 6, pp. 1531–1535,1995.

[11] P. Edwards and A. Murray, “Can deterministic penalty terms model theeffects of synaptic weight noise on network fault tolerance?,” Int. J.Neural Syst., vol. 6, pp. 401–416, 1995.

[12] , “Penalty terms for fault tolerance,” in Int. Conf. Neural Networks,Houston, TX, 1997, pp. 943–947.

[13] G. Golub and C. Van Loan, Matrix Computations. Baltimore, MD:Johns Hopkins Univ. Press, 1990.

[14] P. Ienne and M. Viredaz, “GENES IV: A bit-serial processing element fora multi-model neural-network accelerator,” in Neural Networks Theory,Technology and Applications, P. Simpson, Ed. New York: IEEE Press,1996, pp. 797–808.

[15] R. Sridhar and Y. Shin, “VLSI neural network architectures,” in NeuralNetworks Theory, Technology and Applications, P. Simpson, Ed. NewYork: IEEE Press, 1996, pp. 864–873.

[16] R. Reed, R. Marks, and S. Oh, “Similarities of error regularization,sigmoid gain scaling, target smoothing and training with jitter,” IEEETrans. Neural Networks, vol. 6, pp. 529–538, May 1995.

[17] T. Chia, P. Chow, and H. Chizek, “Recursive parameter identification ofconstrained systems: An application to electrically stimulated muscle,”IEEE Trans. Biomed. Eng., vol. 38, pp. 429–442, May 1991.

[18] J. Burl, Linear Optimal Control. Menlo Park, California: Addison-Wesley, 1999.

[19] L. Ljung and T. Soderstrom, Theory and Practice of Recursive Identifi-cation. Cambridge, MA: MIT Press, 1985.

[20] J. Bezdek, J. Keller, R. Krishnapuram, L. Kuncheva, and H. Pal, “Willthe real Iris data please stand up?,” IEEE Trans. Fuzzy Syst., vol. 7, pp.368–369, 1999.

[21] K. Matsuoka, “Noise injection into inputs in backpropagation learning,”IEEE Trans. Syst., Man, Cybern., vol. 22, pp. 436–440, 1992.

[22] R. Horn and C. Johnson,Matrix Analysis. New York: Cambridge Univ.Press, 1990.