Cs488-2009

Research Topics

• Aaron -
• Brad - Game Theory as demonstrated via competing clusters
• Dylan -
• Nate -
• Sam L-M -
• Sam W - The use of Monte Carlo methods in simulations

Topic Allocation

1. SIMULATION The Monte Carlo Method - Samuel
2. GAME TRESS The Minimax Method - Brad
3. MATHEMATICAL RESEARCH The Mandelbrot Set - Nate
4. GENETIC ALGORITHMS Solutions That Evolve - Brad
5. COMPUTER VISION Polyhedral Scenes - Brad
6. PERCEPTIONS A Lack of Vision - Nate
7. ANALOG COMPUTATION Spaghetti Computers - Sam Leeman-Munk
8. NEURAL NETWORKS THAT LEARN Converting Coordinates - Samuel
9. PUBLIC KEY CRYPTOGRAPHY Intractable Secrets - Samuel
10. NUMBER SYSTEMS FOR COMPUTING Chinese Arithmetic - Aaron
11. CELLULAR AUTOMATA The Game of Life - Sam Leeman-Munk
12. COOK'S THEOREM Nuts and Bolts - Aaron
13. SELF-REPLICATING COMPUTERS Codd's Machine - Sam Leeman-Munk
14. STORING IMAGES A Cat in a Quad Tree - Nate
15. THE SCRAM A Simplified Computer - Dylan
16. SHANNON'S THEORY The Elusive Codes - Aaron
17. NP-COMPLETE PROBLEMS The Tree of Intractability - Aaron
18. ITERATION AND RECURSION The Towers of Hanoi - Dylan
19. VLSI COMPUTERS Circuits in Silicon - Dylan
20. THE HALTING PROBLEM The Uncomputable - Sam Leeman-Munk
21. COMPUTER VIRUSES A Software Invasion - Brad
22. LOGIC PROGRAMMING Prologue to Expertise - Nate
23. RELATIONAL DATABASES Do-It-Yourself Queries - Samuel

Class Presentation Schedule

September 9

• Brad - Ch. 60: Computer Viruses
• Aaron - Ch. 42: Number Systems for Computing

September 16

• Sam L-M - Ch. 33 - Analog Computation
• Dylan - Ch. 56: VLSI

September 23

• Sara Penhale - Where to find academically sound research materials (meet in Science Library)

September 30

• Sam W -
• Nate -

October 7

• Brad -
• Aaron -

October 14

• Sam L-M -
• Dylan -

October 21

• Sam W -
• Nate -

October 28

• Brad -
• Aaron -

November 4

• Sam L-M -
• Dylan -

November 11

• Sam W -
• Nate -