For Undergraduate Credit

• Do the simulations described in Section 2.2.6 (pages 312-14) to explore the stability of imprints as a function of the number of imprints.  Your program should be able to generate graphs comparable to Figs. 2.2.5 and 2.2.6.
• You should hand in (1) your program, (2) your graphs or other output, and (3) a discussion of your results and their implications.
• Implementing this basic functionality should be sufficient to earn a B (assuming your program is not really bad!).
• To get a B+ or A, you should do additional experiments or implement additional features, of your own choice, possibly including those described next (For Graduate Credit).

For Graduate Credit

• You should do everything expected For Undergraduate Credit (above).
• In addition, you should investigate the size of the basins of attraction as a function of the number of imprinted patterns (Section 2.2.6, pp. 314-16).  In other words, you should generate graphs similar to Fig. 2.2.7.

For all Students

• You will be graded on the quality of your experiments and conclusions.
• I expect your programs to be well-designed and well-documented.  Efficiency is not an issue, but your programs should not be grossly inefficient.
• You can use any programming language you like (including systems like MatLab).  You can use language features such as matrix multiplication, but you should implement your own Hopfield simulator (i.e., not use an off-the-shelf simulator from a neural net package).
• You may use any graphical or statistical packages that you like.  Feel free to share this information with other students.  On the other hand, I expect you to design and implement your simulators independently.

If you have any other questions, please email me <maclennan@cs.utk.edu>.

This page is www.cs.utk.edu/~mclennan/Classes/420-594-F02/Project1.html
 

Last updated: Wed Sep 11 17:34:59 EDT 2002