Homeworks and Projects
Please Note: Updated requirement and term report due date (December 10, 2004) in the
"Term Report" section of this page.
Please Note: For every homework, send also a softcopy to the grader
Rahul Gera gera@ccs.neu.edu
Due: October 1, 2004 (Friday), in class,
Please Note: Extended to October 5 (Tuesday)
HW1: Cha2 Exer 2.5-a,b,c,d (16%) ; 2.6-a,b,c,d (12%);
2.10-a,b,c (12%);
and
Cha3 Exer 3.8-a,b,c,d,e (30%); 3.18 (30%)
( Hint: use the states as defined in Figure 3.20 of p84 in the textbook)
HW-PROJ2: Part1(50%) and Part2(50%)
(Submit your softcopies results to TA gera@ccs.neu.edu nd hardcopies to Prof. Wang
by due date and time.
Due: October 15, 2004, before 9pm
HW3: Due: October 29 [Extended to November 2, Tuesday],
2004, in class
Cha4 Exer 4.17 a,b,c,d,e (10%);
Cha6 Exer 6.1 b,c,d,e (16%)
; Exer 6.3 a,b,c,d[5% extra credit] (20%)
;
Cha7 Exer 7.7 Hint: Use truth table or check their validity
(12%) ;
Exer 7.10 (10%) Hint: Each possible world can
be written as conjunction of symbols, e.g. A^B^C .... Assertion a possible world is not
the case, can be written as NOT (A^B^C^ ...) = (-A V -B V -C V - ...), which is the
form of a clause; and a conjunction of these clauses is a _ _ _ ;
Exer 7.12 ; (10%)
Cha8 Exer 8.6 (10%) ;
Cha9 Exer 9.18 (12%)
Hint of Exer 8.6: Let the basic vocabulary be as follow:
Takes(x,c,s): student x takes course c in semester s;
Passes(x,c,s): student x passes course c in semester s;
Scores(x,c,s): the score obtained by student x in course c in semester s;
s > y: x is greater than y;
F and G: French and Greek course, and Subject(c,f): Suject of course c is field f;
Buys(x,y,z): x buys y from z;
Sells(x,y,z): x sells y to z;
Shaves(x,y): person x shaves person y;
Born(x,c): person x is born in country c;
Parent(x,y): x is a parent of y;
Citizen(x,c,r): x is a citizen of country c for reason r;
Resident(x,c): x is a resident of country c;
Fools(x,y,t): person fools person y at time t;
Student(x), Person(x), Man(x), Barber(x), Expensive(x), Agent(x), Insured(x), Smart(x),
Politician(x): predicates satisfied by members of the corresponding categories
Term Project (choose required "Learning" [for example the Wumpus problem in the following
or its related problems in "learning"] and/or one among others for extra credit):
Note: Please sumbit your team names/topic titles by October 19, 2004,
in class
3D Hill Climbing: Gradient Descent Learning (I):
3D Hill Climbing: Gradient Descent Learning (II) -- Shaded Lines:
XNew: Minimum Standard Deviation of Line Segment Magnitude (MSDSM):
3D Articulated Object Analysis & Recognition with Learning in Interactive Virtual Environment:
Re-Inforcement Learning: Wumpus Example (I) - Active :
Source code here
Re-Inforcement Learning: Wumpus Example (II) - Passive (with graph only):
Source code here
Re-Inforcement Learning: Wumpus Example (III) - Passive (with board and graph):
Source code here
Traffic Control Simulation : (including source codes)
Class Presentation Schedule
The final report will basically follow the format as follows:
[Title of topics]
[Abstract]
[Main Body of the Content] (Including theretical principles, Brief historical
background, and Applications)
[Experimental Results]
[Analysis, Discussions and Conclusions] (Including comparions with other
similar methods in the literature)
[Bibilography]
[Appendix] (Including any software program being used in the course)
The total length of the term report will be no longer than 15 pages, double
space, including all context, figures, tables, and references, except Appendix, which
can be as long as it can be (but should be relevant to the report)
Term report due: noon December 10, 2004 to Prof Wang's office, 260 WVH with a
softcopy to the email addresses of Prof. Wang pwang @ccs.neu.edu and TA gera@ccs.neu.edu
As an example, please refer to here