v
The Final Exam answer
key has been posted below and is also available here.
v
The Quiz #4 answer key
has been posted below and is also available here.
v
The tournament staff
will run several different independent final tournaments, each one with
different board sizes and win lengths.
One will be with gravity 'off' and the rest with gravity 'on.' As well, one will be a 3x3 board with
gravity 'off' and win length 3; i.e., classic Tic-Tac-Toe (this does not count
as the condition that will have gravity 'off'). Your final AI tournament score
(for Bonus Points) will be your aggregate AI score, as summed across all the
different tournament conditions they choose.
v
The Project Report
Template has been moved out of “CS171ConnectKStudentResources” and
is now available in the Project section as both Word and PDF formats.
v
Please fill out your
student course evaluations for CS-171. Student course evaluations are very
important to me for monitoring and improving the course content, and very
important to UCI for evaluating our success at our educational mission.
**** Every student
who fills out a course evaluation for CS-171 will receive a bonus of 1% added
to their final grade, free and clear, off the curve, simply a bonus. ****
v
On Tue., 11 Mar.,
following Quiz #4, we will have student talks by the top-scoring teams of Week
8. The six best teams will reveal what they did to succeed.
v PLEASE NOTE: Normally, I tolerate students who leave
class immediately after a Quiz.
v However,
in this special case that day, I will insist that you show courtesy and respect
to your fellow students.
v Anyone
who leaves class that day before *ALL* student talks are finished will receive
an “F” (zero) on Quiz #4.
v You
are *OBLIGED* to remain in class that day, courteous and respectful, while
*ALL* student talks are given.
v Please
bring your UCI ID to class that day, in case I need to census IDs at the end to
enforce this mandate.
v
The Quiz #3 answer key
has been posted below and is also available here.
v
The Mid-term Exam key
has been posted below, and is also available here.
Your Mid-term Exams will be returned at the end of class Thursday, 20 Feb.
v
Please make sure that
your AI has no memory leaks and does not consume excessive memory. We will test
for this condition prior to running your AI in the tournament.
v
As announced in
lecture, the Reader will pass out Quiz #2 (and #1 if you did not pick it up
yet) at the end of class on Tue., 11 Feb., so that you can use them to study
for the Mid-term.
v
As announced in
lecture, another extra-credit opportunity has been provided: At the end of Week 8 we will run a
second “draft” tournament with your revised shells, and the top
~5-6 teams will be invited to give a 5-minute talk on Tue., 11 Mar., to discuss
their winning secrets. To qualify for extra credit, your team must give the
talk.
v
A student has
recommended ‘quizlet.com’ as a good online study resource. While I
cannot vouch for it, apparently it contains several good study aids for your
textbook.
v
The Quiz #2 answer key
has been posted below and is available here.
v
The Project Section
below now has new coding shells and three example AIs that you or your AI can
play against: a good AI, an average AI, and a poor AI. The three example AIs
below will only work with the new shells.
v
The Reader,
Mohsen Hejrati, has updated his office hours to be
Monday 8-10am. This change is now reflected below.
v
Quiz #1 will be distributed at the end of class
Thursday, 30 Jan.
v
Revised project shells will appear shortly,
along with other material in support of your project.
v
A slightly revised
version of the Project Specification has been issued. It now states that entry
into the tournament is automatic, not optional; and that gravity will be on in
the tournament, not off.
v
**** CS-171: Form Project Teams now! ****
(1) By the end of week 4 (i.e., by Fri 31 Jan) you are
obliged to notify the Reader (shejrati@uci.edu)
about your team status:
(1.1)
What is your team name --- creativity is encouraged!
(1.2)
Who is your partner? or
are you a solo team?
There
is an EEE CS-171 Message Board "Seeking project programming team
partner" intended for use by students seeking a project partner.
(2) By the end of week 7 (i.e., by Fri 21 Feb) you are obliged to deposit a
"draft" version of your AI in the EEE DropBox.
We will run a "draft" tournament and report the results. Your EEE DropBox submission must be a single “zipped”
file named “yourID_yourTeamName.”
(3) By the end of week 10 (i.e., by midnight Fri 14 March) you are obliged to
deposit a "final" version of your AI in the EEE DropBox.
We will run a "final" tournament and report the results. You
will receive Bonus Points depending on how well your AI did in the tournament,
as discussed in lecture.
(4) PLEASE NOTE: All teams will participate in the tournament.
Although the Specification says that tournament participation is optional, that
statement is in error and will be corrected shortly. All teams will
participate in the tournament.
v
Public service announcement:
o Women in Information and Computer
Sciences (WICS) is excited to present:
Week 4 Event: First Android App Development Meeting
Interested in learning how to make an Android App? WICS is holding a
5-week Android App tutorial session starting Week 4 of Winter Quarter.
WICS Project Meetings will begin on Thursday, January 30th at 7:00 pm
(this is also the last opportunity to join). Location will be at DBH 5011.
Stay updated with our website
(http://wics.ics.uci.edu/project-development/)
and join our Facebook group
(https://www.facebook.com/groups/672842286101018/)
to get more
information!
Also, don't forget to bring your laptops!
Snacks will be provided during every meeting, we hope to see you there!
v Optional Entrepreneurial Interest:
v The answer key for Quiz #1 has been posted below and is available here.
v There are now two CS-171 MessageBoard forums at EEE:
Class Discussion; and
Seeking project programming team partner. (Please use this forum if you are seeking a programming team partner for the class project.)
v Current announcements will appear here, at top-level, for quick and easy inspection.
The
course is based on, and the UCI bookstore has, the 3rd edition. The
assigned textbook reading is required, and is fair game for quizzes and
exams. You
place yourself at a distinct disadvantage if you do not have the textbook. I expect that you have a personal copy
of the textbook, and quizzes and exams are written accordingly.
Please
purchase or rent your own personal textbook for the quarter (and then resell it
back to the UCI Bookstore at the end if you don't want it for reference).
Please do not
jeopardize your precious educational experience with the false economy of
trying to save a few dollars by not having a personal copy of the textbook.
Also,
for your convenience, I have requested that a copy of the textbook be placed on
reserve in the UCI Science Library. There is a two-hour check-out limit. However,
please understand that with high student enrollments, it is unrealistic to
expect that these thin reserves will always be available when you need
them. Please
purchase or rent your own personal textbook.
I do deplore the high cost of textbooks. You are likely to find the book cheaper
if you search online at EBay.com, Amazon.com, and related sites.
A
student kindly contributed link(s) to a PDF of the course textbook, for which I
cannot vouch:
http://en.tjcities.com/wp-content/uploads/Books/Artificial_Intelligence_3rd.pdf (possibly stale?)
http://crazy-readers.blogspot.com/2013/08/artificial-intelligence-modern-approach.html
You can
also try to search the Internet for “artificial intelligence a modern
approach pdf 3rd edition”. Several more hits turned up the last time I
did so.
A
student kindly contributed the following suggestion, for which I cannot vouch:
Hello,
I just wanted to point out that there does exist an
international edition of the book which can be bought for around $40-50. I
cannot comment on what specific differences there are for this particular book,
though they are usually very small (exercises moved around, etc).
Obviously, it is in paperback.
http://www.valorebooks.com/affiliate/buy/siteID=e79mzf/ISBN=0136042597
http://www.abebooks.com/servlet/BookDetailsPL?bi=4161131466&cm_ven=sws&cm_cat=sws&cm_pla=sws&cm_ite=4161131466&afn_sr=para¶_l=1
http://www.biblio.com/books/360025589.html
Personally I plan on using this book for a while so I bought the hardcover
version, but I just wanted to point out that this is an option for those
looking for a more 'economical' route.
~ XXXXXX [name anonymized to protect student privacy]
The following represents a preliminary syllabus. Some changes in the
lecture sequence may occur due to earthquakes, fires, floods, wars, natural
disasters, unnatural disasters, or the discretion of the instructor based on
class progress.
Background Reading and Lecture Slides will be changed or revised as the
class progresses at the discretion of the instructor. Please note: I may tweak or revise the lecture slides
prior to the lecture; please ensure that you have the current version.
Please read the assigned textbook reading in
advance of each lecture, then again after each
lecture.
Tue., 7 Jan., Introduction, Agents.
Read
in Advance: Textbook Chapters 1-2.
Lecture
slides: Introduction, Agents [PDF; PPT].
Optional Cultural Interest:
IBM Watson: Final Jeopardy! and the Future of Watson
AI vs. AI.
Two chatbots talking to each other.
Optional
Reading:
John
McCarthy, “What
Is Artificial Intelligence?”
AAAI,
AI Overview.
Thu., 9 Jan., Uninformed Search.
Read
in Advance: Textbook Chapter 3.1-3.4.
Lecture
slides (three parts):
(1)
Introduction to Search [PDF; PPT]; and
(2)
Uninformed Search [PDF; PPT].
Optional Cultural Interest:
Boston Dynamics Big Dog (new video
March 2008)
Optional Reading:
Newell & Simon’s “Symbols and Search” Turing
Award Lecture (1976).
Herbert
Simon was awarded a Nobel Prize (in economics, 1978).
Tue., 14 Jan., Heuristic Search.
(Ken
Nagata lecture)
Read
in advance: Textbook Chapter
3.5-3.7.
Lecture
slides: Heuristic Search [PDF; PPT].
Optional
Cultural Interest:
Infinite Mario AI - Long
Level
An attempt at a Mario AI using the A* path-finding algorithm.
It
claims the bot won both Mario AI competitions in 2009.
“You
can see the path it plans to go as a red line, which updates when it detects
new obstacles at the right screen border. It uses only information visible on
screen.”
See
also http://www.marioai.org/.
Optional Cultural Interest:
A* Search in Interplanetary Trajectory Design, courtesy of Eric Trumbauer, former
CS-271 student.
Eric
comments, “One thing to possibly discuss with the last slide is that the
itinerary it settles on does stay at a higher energy for a little bit until it
passes closest to Europa, maximizing the velocity before the insertion sequence
to the lower energy. This is indeed
optimal behavior, as opposed to immediately reducing its energy as a Greedy
Best First algorithm using this heuristic would want to do.”
A* Search in
Protein Structure Prediction, Lathrop and Smith, J. Mol. Biol.
255(1996)641-665
Optional Reading:
Alan Turing’s classic paper on AI (1950).
Alan Turing is the most famous computer scientist of all time.
The Turing Award is the highest honor in computer science.
The Turing Machine is still our fundamental theoretical model of computation.
Turing’s work on the Enigma code in WWII led to programmable computers.
AAAI/AI Topics: The Turing Test: “Can Machines Think?”
Wikipedia “Computing Machinery and Intelligence”
Thu., 16 Jan., Local Search.
(Ken
Nagata lecture)
Read in advance: Textbook Chapter 4.1-4.2.
Lecture
slides (two parts):
(1)
Local Search [PDF; PPT]; and
(2)
Representation [PDF; PPT].
Optional URL:
The
program learns to build a car using a genetic algorithm
Optional
Reading:
Minton,
et. al., 1990, AAAI "Classic
Paper" Award recipient in 2008.
How to solve the 1 Million Queens problem and schedule space
telescopes.
Optional
Lecture Slides:
Optional Ungraded Homework:
Tue., 21 Jan., Quiz
#1 (answer key here);
start Games/Adversarial Search.
Read in advance: Textbook
Chapter 5.1-5.5.
Lecture
slides: Games/Adversarial Search [PDF; PPT].
Optional Cultural Interest:
Optional
Reading:
Campbell, et al., 2002, Artificial
Intelligence, “Deep Blue.” [PDF]
(URL
http://www.sciencedirect.com/science/article/pii/S0004370201001291)
Details about the AI system that beat the human chess champion.
Thu., 23 Jan., finish Games/Adversarial Search.
Read in advance: Textbook
Chapter 5.1-5.5.
Lecture
slides: Games/Adversarial Search (above).
Optional Entrepreneurial Interest:
Optional Cultural Interest:
Arthur
C. Clarke “Quarantine.”
A science fiction short story written by a classic master, in 188
words.
He
was challenged to write a science fiction short story that would fit on a
postcard.
Optional Reading: Chaslot, et al.,
“Monte-Carlo
Tree Search: A New Framework for Game AI,”
in Proceedings
of the Fourth Artificial Intelligence and Interactive Digital Entertainment
Conference,
AAAI Press, Menlo Park, pp. 216-217, 2008.
An interesting combination of Local Search (Chapter 4) and Game
Search (Chapter 5).
Optional URL: “Everything
Monte Carlo Tree Search” website.
Optional Ungraded Homework:
Tue., 28 Jan., start Constraint Satisfaction.
Read in advance: Textbook
Chapter 6.1-6.4, except 6.3.3.
Lecture
slides: Constraint Satisfaction Problems [PDF;
PPT].
Optional
Cultural Interest:
RoboCup 2012 Standard Platform: USA / Germany (Final).
Thu., 30 Jan., finish
Constraint Satisfaction.
Read
in advance: Textbook Chapter 6.1-6.4, except 6.3.3.
Lecture
slides: Constraint Satisfaction Problems (above).
Optional Cultural Interest:
Google Car: It Drives Itself
- ABC News
[Part 1/3] The Evolution of
Self-Driving Vehicles
[Part 2/3] How Google's
Self-Driving Car Works
[Part 3/3] Google's
Self-Driving Golf Carts
DARPA Urban Challenge
Highlights
DARPA Urban Challenge: Ga
Tech hits curb
DARPA Urban Challenge - Sting
Racing crash
[DARPA] Team Oshkosh attempts
forced Entry to Main Exchange
[DARPA] Alice's Crash
(spectator view)
[DARPA] Alice's Crash
(road-finding camera) [different view of above; long]
DARPA Urban Challenge Crash
Cornell MIT
DARPA Urban Challenge - robot
car wreck [different view of above]
Optional
Reading:
Autonomous car - Wikipedia,
the free encyclopedia
“Autonomous
Driving in Traffic: Boss and the Urban Challenge” (2009).
Fri.,
31 Jan., deadline to
notify the Reader (shejrati@uci.edu) about your team status:
(1.1)
What is your team name --- creativity is encouraged!
(1.2)
Who is your partner? or are you a
solo team?
There
is an EEE CS-171 Message Board "Seeking project programming team
partner" intended for use by students seeking a project partner.
Tue.,
4 Feb., Quiz #2 (answer key here);
start Propositional Logic.
Read
in advance: Textbook Chapter 7.1-7.4.
Lecture slides: Propositional Logic A [PDF; PPT].
Optional
Cultural Interest:
“Quadrocopter Pole Acrobatic” (URL: https://www.youtube.com/watch?v=pp89tTDxXuI
)
“Nano Quadcopter Robots swarm
video” (URL: https://www.youtube.com/watch?v=AiCFtmdrvHM)
The
Stanford Autonomous Helicopter performing an aerobatic airshow under computer
control:
“Stanford Autonomous
Helicopter - Airshow #1”
“Stanford Autonomous Helicopter
- Airshow #2 Redux”
Optional
Ungraded Homework:
Thu.,
6 Feb., finish Propositional Logic.
Read
in advance: Textbook Chapter 7.5 (optional: 7.6-7.8).
Lecture slides: Propositional Logic B [PDF; PPT].
Additional
Discussion lecture slides [PDF].
Optional
Cultural Interest:
“Janken
(rock-paper-scissors) Robot with 100% winning rate”
Tue.,
11 Feb., Catch-up,
Review for Mid-term Exam.
Read in advance: Textbook Chapters 1-7 (only sections assigned above).
Lecture
slides: Catch-up, Review, Question&Answer [PDF; PPT].
Optional
Cultural Interest (snakes, spiders, and a talking head!):
“Asterisk - Omni-directional Insect Robot Picks Up Prey #DigInfo”
“Freaky AI robot, taken from Nova science now”
No
homework --- study for the Mid-term Exam.
Thu., 13 Feb., Mid-term Exam (answer key here).
Read in advance: Textbook Chapters 1-7 (only sections assigned above).
Lecture
slides: Catch-up, Review, Question&Answer
(above).
Optional Cultural Interest:
“Singularity
Institute for Artificial Intelligence- P1/2 - Video Dailymotion”
“Singularity
Institute for Artificial Intelligence”
(Note:
In January, 2013, the Singularity Institute changed its name to the Machine
Intelligence Research Institute in order to avoid confusion with Singularity
University, which also took on the Singularity Summit.)
“Machine
Intelligence Research Institute - Wikipedia, the free encyclopedia”
Machine Intelligence Research Institute home
page
Tue.,
18 Feb., Review Mid-term Exam; start First Order Logic
Read in advance: Textbook Chapter 8.1-8.2.
Lecture
slides: First Order Logic Syntax [PDF; PPT].
Optional Reading:
Cyc is a large-scale knowledge-engineering project:
“CYC: A Large-Scale Investment in Knowledge Infrastructure,” Lenat, 1995
“Searching for Commonsense: Populating Cyc from the Web,” Matuszek et al, AAAI 2005
Cyc - Wikipedia, the free encyclopedia.
Optional
Ungraded Homework:
Thu., 20 Feb., finish First Order Logic; Knowledge Representation.
Read in advance: Textbook Chapter 8.3-8.5.
Lecture slides (two parts):
(1) First Order Logic Semantics [PDF; PPT]; and
(2) First Order Logic
Knowledge Representation [PDF;
PPT].
Optional
Lecture slides: First Order Logic Inference [PDF; PPT].
Read in advance: Textbook
Chapter 9.1-9.2, 9.5.1-9.5.5.
Tue., 25 Feb., Quiz #3 (answer key here); Probability, Uncertainty, Bayesian Networks.
Read in advance: Textbook Chapters 13, 14.1-14.2.
Lecture
slides: Reasoning Under Uncertainty [PDF;
PPT].
Optional
Cultural Interest:
Video of Judea Pearl’s 2011 Turing Award lecture.
The Mechanization of Causal
Inference: A “mini” Turing Test and Beyond.
Optional URL: “Peter Norvig 12. Tools of AI: from logic to probability.”
Optional
Cultural Interest:
“Flexible Muscle Based
Locomotion for Bipedal Creatures” --- video
“Flexible Muscle-Based Locomotion for Bipedal Creatures” --- paper.
Thu., 27 Feb., start Learning from Examples.
Read in advance: Textbook Chapter 18.1-18.4.
Lecture
slides: Intro to Machine Learning [PDF; PPT].
Optional
Reading:
Ferrucci, et al., 2010, “Building
Watson: An Overview of the DeepQA Project”
“Machine learning”
- Wikipedia, the free encyclopedia
“Data mining” - Wikipedia, the free encyclopedia
Optional Ungraded Homework:
Tue.,
4 Mar., finish Learning from Examples.
Read in advance: Textbook Chapter 18.5-18.12, 20.1-20.3.2.
Lecture slides:
Learning Classifiers [PDF; PPT].
Optional
Lecture slides: Viola & Jones, Learning, Boosting, Vision [PDF;
PPT]
(read the two papers immediately below)
Optional Reading: Viola & Jones, 2004, “Robust Real-Time Face Detection”
Optional Reading: Freund & Schapire, 1999, “A Short Introduction to Boosting”
Optional Reading: Danziger, et al., 2009, “Predicting Positive p53 Cancer Rescue Regions Using Most Informative Positive (MIP) Active Learning”
Optional Ungraded Homework:
Thu., 6 Mar., Clustering
(unsupervised learning) and Regression (statistical numeric learning).
Read in advance: Textbook Chapter 18.6.1-2, 20.3.1.
Lecture slides:
Clustering (Unsupervised Learning) [PDF; PPT].
Optional
Cultural Interest:
“IBM simulates 530 billon neurons, 100 trillion synapses on supercomputer”
“Speech Recognition Breakthrough for the Spoken, Translated Word”
Tue., 11 Mar., Quiz
#4 (answer key here);
Talks by the top-scoring teams of Week 8.
The
six best teams will reveal what they did to succeed.
PLEASE NOTE: Normally, I tolerate students who leave
class immediately after a Quiz.
However,
in this special case today, I will insist that you show courtesy and respect to
your fellow students.
Anyone
who leaves class today before *ALL* student talks are finished will receive an
“F” (zero) on Quiz #4.
You
are *OBLIGED* to remain in class today, courteous and respectful, while *ALL*
student talks are given.
Please
bring your UCI ID to class this day, in case I need to census IDs at the end to
enforce this mandate.
Student
top-scoring team talks:
*
Trevor Miller and Phat Huynh
'Team
ADC' placed sixth out of 46 teams. [PPT]
*
Jacobus Harding
Team
'Jacobus' placed fifth out of 46 teams. [PPT]
*
Richard Fang
Team
'rfangAI' placed fourth out of 46 teams. [PPT, PDF]
*
Derek Omuro
Team
'No Artificial Flavors' placed third out of 46 teams. [PPT]
*
Orson Teodoro
Team
'Luckasaurus Rex' placed second out of 46 teams. [PDF]
*
Nicolas Ajalat
Team
'NameNotFoundException' placed first out of 46 teams.
[PPT]
Thu., 13 Mar., Catch-up, Review for Final Exam.
Read in advance: Textbook, review all assigned reading.
Lecture
slides: Review, Catch-up, Question&Answer [PDF; PPT].
Fri., 14 Mar., Project due (Friday midnight).
Your
EEE DropBox submission must be a single
“zipped” file named “yourUCINetID_yourTeamName.”
Please
see Fri., 21 Feb., above, for details of what to submit (plus, ‘doc’ must
contain your Project Report).
Please
deposit only one submission per team.
Fri.,
21 Mar., 10:30am-12:30pm. (answer key here)
Connect-K Game.
This project corresponds to Game Search (Chapter 5 in your book). Your
job is to write an AI agent that can beat you at Connect-K, i.e., to write the
adversarial search (game search) controller for a video game world. Shells will
be available in C++ and Java. I
expect to be able to run a tournament within which your AI controllers will
compete against each other for Bonus Points. Everyone’s AI will be
entered in the tournament automatically; the bonus points are simply free,
based on how many games your AI wins against other AIs.
We are still sorting
out the shells, and may change them periodically as the quarter
progresses. If so, we will try to
keep the interface the same, so that all you need do is change the surrounding
shell.
The most recent change to the text or material below was
at 12:12pm 20 Feb 2014. That change was to provide a new ConnectK.cpp file, so
that the C++ AI knew whether it was to make the first or the second move.
Please update yourself accordingly. Please check often to
ensure that you *always* have all current class material. It will be updated
here as needed.
The Project Report
template is available here [Word; PDF].
An example
dumb game is available; an example
smart game is available; a Project
Specification is available; a Report Template is available [Word; PDF]; a
collection of student coding
resources is available.
The coding resources
include:
(1) A Java shell.
(2) A C++ shell.
(3) A tournament shell,
which will let you play different versions of your AI against themselves to
refine your evaluation function.
(4) Three example AIs,
which you or your AI can play against: a good AI, an average AI, and a poor AI.
(5) The “DummyAI” source code, which your cleverness and
ingenuity will make smart.
(6) Several readme*.txt
files: readme.txt, readme-cPlusPlus.txt, readme-tournament.txt.
(7) ConnectK
hints, caveats, and heuristics.
(8) A changelog.txt.
Note: We'll run the
tournament on SGE or a lab machine. The C++ target platform should be x86. You
should write your code to run on any x86 machine. The
OS is CentOS 6. We most likely will need to compile
your code with CentOS 6 (RHEL 6) x86_64. Machines in
the openlab.ics.uci.edu (family-guy.ics.uci.edu) are CentOS
6.
The shells have been updated. Please use the new shells.
The three example AIs will only work with the new shells.
Several of my various
CS-171 projects were written by former CS-171 students who became interested in
AI and signed up for CS-199 in order to pursue their interest and write
interesting AI project shells.
Please let me know if this is of interest to you (CS-171 grade of A- or
better required).
Previous
CS-171 Quizzes, Mid-term exams, and Final exams are available here as study
guides.
As an
incentive to study this material, at least one question from a previous Quiz or
Exam will appear on every new Quiz or Exam. In particular, questions that many
students missed are likely to appear again. If you missed a question, please
study it carefully and learn from your mistake --- so that if it appears again,
you will understand it perfectly.
Also, a
student has recommended ‘quizlet.com’ as a good online study
resource. While I cannot vouch for it, apparently it contains several good
study aids for your textbook.
Winter Quarter 2014:
Mid-term
Exam and key
Final
Exam and key
Fall Quarter 2013:
Mid-term
Exam and key
Final Exam and key
Fall Quarter 2012:
Mid-term Exam and key
Final
Exam and key
Winter Quarter 2012:
Mid-term Exam and key
Final Exam and key
Spring Quarter 2011:
Mid-term Exam and key
Final
Exam and key
Spring Quarter 2004:
Spring Quarter 2000:
Additional Online Resources may be posted as the class progresses.
Textbook website for Artificial Intelligence: A Modern Approach (AIMA).
AAAI
Digital Library of more
than 10,000 AI technical papers.
AAAI AI Magazine.
AAAI Author Kit.
Academic dishonesty is unacceptable and will not be tolerated at the University of California, Irvine. It is the responsibility of each student to be familiar with UCI's current academic honesty policies. Please take the time to read the current UCI Senate Academic Honesty Policies and the ICS School Policy on Academic Honesty.
The policies in these documents will be adhered to scrupulously. Any student who engages in cheating, forgery, dishonest conduct, plagiarism, or collusion in dishonest activities, will receive an academic evaluation of ``F'' for the entire course, with a letter of explanation to the student's permanent file. The ICS Student Affairs Office will be involved at every step of the process. Dr. Lathrop seeks to create a level playing field for all students.