Each
presentation is worth 20 points, graded based on the following points
breakdown: contents (8), style/time management (6); 3 contributed Q/As (3);
and summary of Q/As at presentation (3) (updated
12/01/2002). |
|
Session # |
Last Name |
First/Middle
Initials |
Presentation
Date |
Topic |
Work
(complete or missing) |
Question
Credits in Sessions |
|
29 |
Llama |
A |
Oct. 10 |
Nanotechnology |
rescheduled
for Nov. 7 |
|
30 |
Dahl |
TC |
Oct. 10 |
DNA computing |
rescheduled for Nov. 7 |
|
31 |
Segall |
BA |
Oct. 10 |
Social
and ethical issues of AI |
rescheduled for Oct. 29 |
|
32 |
Doherty |
FM |
Oct. 15 |
Relational
databases (Chapter 65) |
rescheduled for Oct. 22 |
|
33 |
Tanner |
J |
Oct. 15 |
Logic programming |
rescheduled
for Nov. 19 |
|
34 |
Ostrowski |
GK |
Oct. 15 |
Generative
grammars, string rewriting |
rescheduled for Nov. 14 |
|
35 |
Khoo |
HK |
Oct. 17 |
Cryptography
and security |
complete |
48 |
|
36 |
Koshak |
M |
Oct. 17 |
Computer
forensics, crimes, and investigation |
rescheduled for Nov. 5 |
|
37 |
Rooks |
JD |
Oct. 17 |
Web
privacy issues, cookies, spams |
complete |
46,
49, 50, 53 |
|
38 |
Robinson |
JJ |
Oct. 22 |
Voice
recognition, sound waves, algorithms |
complete |
34,
39, 51, 54, 55 |
|
39 |
DeBoer |
SM |
Oct. 22 |
Studio
computing, software, hardware |
complete |
30,
43, 48 |
|
32 |
Doherty |
FM |
Oct. 22 |
Relational
databases (Chapter 65) |
complete |
30, 39 |
|
40 |
Reigada |
D |
Oct. 22 |
Audio compression (Chapter 60) |
rescheduled
for Nov. 19 |
|
41 |
Harris |
K |
Oct. 24 |
Text
compression, information theory, entropy |
complete |
30,
36, 42, 49, 53, 54 |
|
42 |
Coffman |
MJ |
Oct. 24 |
Data
mining, data warehousing, retrieval |
complete |
49,
53 |
|
43 |
Lewandowski |
S |
Oct. 24 |
Web/Internet
tools |
complete |
29,
30, 55, 56 |
|
44 |
Pham |
NH |
Oct. 29 |
NP
completeness (Chapter 54) |
complete |
49,
51, 52 |
|
45 |
Tran |
D |
Oct. 29 |
Simulation
(Chapter 4) |
complete |
32,
34, 35, 49, 50, 55 |
|
31 |
Segall |
BA |
Oct. 29 |
Social
and ethical issues of AI |
complete |
34,
35, 37, 37, 38, 38, 46, 49, 50, 55 |
|
46 |
Jacob |
RE |
Oct. 31 |
Edge
detection |
complete |
32,
32, 35, 37, 38, 55 |
|
47 |
Beroual |
N |
Oct. 31 |
Perceptrons |
complete |
29,
50 |
|
48 |
Levy |
A |
Oct. 31 |
Tracking,
detection, behavior recognition |
complete |
30,
30, 34, 35, 39, 40, 53 |
|
49 |
Wilson |
J |
Nov. 5 |
Peer
to peer computing |
complete |
33,
51, 55 |
|
50 |
Marshall |
N |
Nov. 5 |
Internet
core protocols |
complete |
29,
42, 49, 51 |
|
36 |
Koshak |
M |
Nov. 5 |
Computer
forensics, crimes, and investigation |
complete |
23, 23, 35, 48 |
|
29 |
Llama |
A |
Nov. 7 |
Nanotechnology |
complete |
30,
36, 41, 42, 46, 48, 52 |
|
30 |
Dahl |
TC |
Nov. 7 |
DNA
computing |
complete |
32, 55 |
|
51 |
Drahl |
JM |
Nov. 7 |
Computer
gaming, openGL, directX |
rescheduled for Nov. 19 |
|
52 |
Higgins |
W |
Nov. 12 |
Iteration
and recursion (Chapter 55) |
rescheduled for Nov. 21 |
|
53 |
Enright |
B |
Nov. 12 |
TCP/IP
Routing, Class Of Service, NAT, Port Fordwarding |
complete |
30,
38, 51, 54 |
|
54 |
Lother |
D |
Nov. 12 |
The
Mandelbrot set (Chapter 9) |
complete |
55 |
|
34 |
Ostrowski |
GK |
Nov. 14 |
Generative
grammars, string rewriting |
complete |
55, 56 |
|
55 |
Landsberger |
D |
Nov. 14 |
Wireless
devices |
complete |
30,
32, 35, 37, 38, 50, 53 |
|
56 |
Lovegren |
MN |
Nov. 14 |
Coorperative
computing |
complete |
35,
53 |
|
33 |
Tanner |
J |
Nov. 19 |
Logic
programming |
complete |
23,
29, 30, 35, 38, 42, 44, 54 |
|
40 |
Reigada |
D |
Nov. 19 |
Audio
compression (Chapter 60) |
complete |
29,
33, 35, 39, 50, 53, 56 |
|
51 |
Drahl |
JM |
Nov. 19 |
Computer
gaming, openGL, directX |
complete |
|
|
52 |
Higgins |
W |
Nov. 21 |
Iteration
and recursion (Chapter 55) |
complete |
55,
55 |
|
|
|
|
|
|
|
|
|