| Date: 11/14 | Title: Term project presentation schedule |
Project presentation schedule
- 11/20: Mustafa, Arjun
- 11/25: Vivek/Raghavender, Jiaqi/Iliyana, Ang/Liangliang
- 12/2: Marcus, Brad, Moonjeong
|
| Date: 10/28 | Title: Term project information |
Code-base
- Backpropagation: backprop-1.6.tar.gz (C++ code -- unix)
- Neuroevolution: ga.m (Octave code)
- SIDA: sida-nat.tar.gz (Octave code)
- FOL resolution theorem prover skeleton code:
dupeclause.l, fol-dupe-check.lsp, gen-next.lsp, sunify.lsp, theorems.lsp (Lisp)
Final miniproject details
1. Pick a code-base
- YC's backpropagation code (in c++)
- YC's neuroevolution code (in octave)
- YC's SIDA code for sensorimotor semantics (in octave)
- YC's FOL resolution theorem prover skeleton code (in lisp)
- Your own code
- A third-party open source
2. Formulate your research problem
- Pick a task
- Locate data set (if needed)
- Design extensions and experiments
3. Proposal
- Team members: max 2 per team.
- What is the research problem?
- Why is it important/interesting?
- What are other people's approaches?
- What are the limitations of those approaches?
- What is your approach?
- What experiments will you do?
- What are the expected results?
- Who will work on which portion of the project?
- Submit by 11/4, in class.
4. Presentation
- 20-25 minutes.
- Present final or interim results
5. Final report
- 4-5 pages, single space report.
- Due by 12/4, 3pm, HRBB 322B.
|
| Date: 9/16 | Title: Program 2: compiling and turning off tail recursion |
Here's how you compile:
; compile
(compile-file "dfs.lsp")
; load the compiled binary
(load "dfs.sparcf")
; run the function
(dfs '((2 9) (4 (1 30) 2) 5))
Here's how you compile, with tail-recursion turned off:
; compile with tail-recursion off
(compile-file "dfs.lsp" :block-compile nil)
; load the compiled binary
(load "dfs.sparcf")
; turn trace on on the recusrive function
(trace dfs-core)
; run the function
(dfs '((2 9) (4 (1 30) 2) 5))
Here's an example run. Bold is what you enter in the Lisp interpreter.
* (compile-file "dfs.lsp" :block-compile nil)
; Python version 1.1, VM version UltraSparc/Solaris 7 on 16 SEP 08 09:51:43 pm.
; Compiling: /home/faculty/choe/web_project/625/src/dfs.lsp 25 AUG 08 08:57:56 pm
; Converted DFS.
; Compiling DEFUN DFS:
; Converted DFS-CORE.
; Compiling DEFUN DFS-CORE:
; Converted GOALP.
; Compiling DEFUN GOALP:
; Converted MAKE-NODE-LIST.
; Compiling DEFUN MAKE-NODE-LIST:
; Converted EXPAND.
; Compiling DEFUN EXPAND:
; Byte Compiling Top-Level Form:
; dfs.sparcf written.
; Compilation finished in 0:00:00.
#P"/home/faculty/choe/web_project/625/src/dfs.sparcf"
NIL
NIL
* (load "dfs.sparcf")
; Loading #P"/home/faculty/choe/web_project/625/src/dfs.sparcf".
T
* (dfs '((2 9) (4 (1 30) 2) 5))
0: (DFS-CORE ((# # 5)))
0: DFS-CORE returned 30
30
* (trace dfs-core)
Warning: Function DFS-CORE already TRACE'd, retracing it.
(DFS-CORE)
* (dfs '((2 9) (4 (1 30) 2) 5))
0: (DFS-CORE ((# # 5)))
1: (DFS-CORE ((2 9) (4 # 2) 5))
2: (DFS-CORE (2 9 (4 # 2) 5))
3: (DFS-CORE (9 (4 # 2) 5))
4: (DFS-CORE ((4 # 2) 5))
5: (DFS-CORE (4 (1 30) 2 5))
6: (DFS-CORE ((1 30) 2 5))
7: (DFS-CORE (1 30 2 5))
8: (DFS-CORE (30 2 5))
8: DFS-CORE returned 30
7: DFS-CORE returned 30
6: DFS-CORE returned 30
5: DFS-CORE returned 30
4: DFS-CORE returned 30
3: DFS-CORE returned 30
2: DFS-CORE returned 30
1: DFS-CORE returned 30
0: DFS-CORE returned 30
30
*
|