- I’ve posted the miniconference schedule and the abstracts for the projects.
- Everyone in CS181 is expected to attend at least one hour of the miniconference, but you should feel free to attend other sessions if the topics interest you. Ordinarily, that hour will be the one at which you’re presenting; those of you who have conflicts with your own group time should find some other hour to attend.
- Bill noted that Wednesday’s XKCD was particularly relevant to that day’s class.
- I have posted the schedule of presentations as Handout #17. That handout shows when and where you’re giving your presentation and lists the TA assigned to your project.
- The archive of projects from past years is available here.
-
The due dates for this week’s have been changed to give you more
time:
- The rewrite of paper #1 is now due at 5:00pm on Friday, May 6.
- The first version of paper #2 is due at 11:59pm on Sunday, May 8.
- The first paper will be returned to you on Wednesday. Those of you in Eric’s or Michael’s section will receive electronic comments on the PDF versions of your submissions. Everyone else should pick up your papers before Wednesday's class in the upstairs area of the Hewlett building, where they will be arranged alphabetically by last name.
-
The Online Forum is open for business on the CourseWork site. Several
of you rose to the challenge of finding materials for the topics, which
I have collected in the following pages:
-
As I announced in lecture on Wednesday, the extra-credit opportunity for
this week is to implement a strategy for the Iterated Prisoner’s
Dilemma game, which maximizes the total payoff for your algorithm.
The payoff matrix is the one used in the class example:
- If both players cooperate, the score is
-1 for each player - If both players defect, the score is
-5 for each player - If one player cooperates and the other defects, the defector
scores 0 and the unfortunate cooperator scores
-10.
Your job is to implement a class named PDStrategy that uses the historical actions of your opponent to decide whether to cooperate or defect. You can implement this class in either C++ or Java. Click on the language you prefer to download the starter files.
Entries are due by 11:59pm on Sunday and should be mailed to eroberts@cs.stanford.edu. After receiving the entries, we will run every entry against every other entry and record the total score. (Note that the payoff matrix used in class means that all players will end up with a negative score; you want your algorithm to run up the least negative total.)
Every entry that compiles and runs correctly (and that does something more intelligent than simply returning "COOPERATE" or "DEFECT" every time) will get one extra-credit point. The winner of the round-robin tournament will get a total of three points; the runner-up will receive a total of two.
- If both players cooperate, the score is
-
By popular demand, the deadline for the first paper has been extended
by one day to 11:59pm, Thursday, April 14.
I also presented answers to the most frequently asked questions about
the paper:
- There are no late days on the major papers.
- All extension requests must be directed to Shrey Gupta, the TA who has been designated as the extensions czar.
- Those of you whose papers are being reviewed by TWP must sign up for a tutorial as described on the web site.
- All papers should be sent by e-mail to your TA. PDF format is best.
- The camera-ready version is optional. In past years, many students have wanted to submit one.
- Students in 181W must submit rewrites. Students in 181 may submit rewrites on the same schedule. The original counts for 25% of the grade and the rewrite for 75%.
- Related talk: Richard Stallman, founder of the Free Software Foundation, and author of the GNU Manifesto in the reader, is speaking at Stanford tomorrow, April 12, from 6:00-8:30 in the NVIDIA Auditorium in the Huang Engineering Building. His topic is Copyright and Community, which is closely related to the concerns of the second paper.
- You have until midnight tonight to submit suggestions of ethical dilemmas from literature. See Handout #6 for details.
- Eric will be out of town on Tuesday, April 12, and will therefore be unable to make his regularly scheduled office hours this week.
-
If you find that the Bookstore doesn’t have the readers on the shelf,
go to the Custom Publishing desk where they will order you one. The
essential readings for Monday and Wednesday are available on line as
follows:
Ursula Le Guin’s short story “The Ones Who Walk Away from Omelas” is widely available on the web, but I was unable to find a source that did not violate Le Guin’s copyright.
-
Sections begin today at the following times:
Thu 3:15 Gates 159 Michael Thu 3:15 Gates 359 Bill Thu 4:15 Gates 159 Michael Thu 4:15 Gates 359 Clare Thu 7:00 Gates 260 Thaisan Thu 7:00 Gates 159 Shrey Thu 8:00 Gates 159 Shrey Fri 1:15 Gates 100 Thaisan Fri 1:15 90-92Q Priya Fri 2:15 160-314 Priya Fri 3:15 160-319 Bill
- Readers are available in the Bookstore.
- Film showing: The Day After Trinity, 7:30pm in Hewlett 201.
- Because the reader is not yet in the Bookstore, I've put up the public-domain material from Parts 1 and 2 here. The Parnas article entitled “Software aspects of strategic defense systems” from Communications of the ACM is available from the ACM Digital Library at portal.acm.org/citation.cfm?doid=214956.214961.
- Class starts today and meets from 4:15 to 5:30pm each Monday and Wednesday in Hewlett 201.
- 01. Course Information
- 02. Section Questionnaire
- 03. Calendar (Week of March 28)
- 04. Calendar (Week of April 4)
- 05. Paper #1 - Software Risks
- 06. Calendar (Week of April 11)
- 07. Calendar (Week of April 18)
- 08. Calendar (Week of April 25)
- 09. Online Forum assignment
- 10. Calendar (Week of May 2)
- 11. Final Project
- 12. Schedule Changes
- 13. Calendar (Week of May 9)
- 14. The Nuremberg Files Case
- 15. Calendar (Week of May 16)
- 16. Calendar (Week of May 23)
- 17. Miniconference Schedule
- 01. Introduction [ppt]
- 02. Computers and the Military [ppt]
- 03. Reliability and Risk [ppt]
- 04. Philosophical Ethics [ppt]
- 05. Ethics in Literature [ppt]
- 06. Computing and Economics [ppt]
- 07. Intellectual Property [ppt]
- 08. Markoff: Hackers [no slides]
- 09. Online Forum Plenary [no slides]
- Professor: Eric Roberts
- Email: eroberts@cs.stanford.edu
- Office: Gates 202
- Phone: 650-723-3642
- Drop-in Hours: Tue 9:30-11:30am
- TAs
- Michael Abercrombie <mabercr@gmail.com>
- Clare Bennett <clarecb@stanford.edu>
- Priya Chawla <priyac@stanford.edu>
- Shrey Gupta <shreyg@stanford.edu>
- William Rowan <wmrowan@stanford.edu>
- Thaisan Tonthat <tonthat@stanford.edu>