Monthly Archives: January 2017

CSC 290 : Introduction to Artificial Intelligence, Smith College, Department of Computer Science, Spring 2017

CSC290: Introduction to Artificial Intelligence

Classes: Monday – Wednesday 2.40 – 4.00 pm

Location: Ford Hall 342

Instructor: Dr. Şadi Evren ŞEKER (Office: Ford Hall 252)

Office Hours

  • Tuesday, 13.00 – 15.00
  • Other times by appointment/as available
  • Lunch meetings available by request for small groups

E-Mail: ai@sadievrenseker.com

Web Site: http://sadievrenseker.com/wp/?p=1172

Course Content:

  • History and Philosophy of the Artificial Intelligence (AI)
  • Classical AI approaches like search problems, machine learning, constraint satisfaction, graphical models, logic etc.
  • Learning how to model a complex real-world problem by the classical AI approach

Objectives:

  • Introduction to Artificial Intelligence Problems
  • Programming with a mathematical notation language (like a lisp variant, scheme)
  • Writing a real world application with an AI module (like a game)
  • Introducing sub-AI topics like neural computing, uncertainity and bayesian networks, concept of learning (supervised / unsupervised) etc.

Texts:

  • S. Russell and P. Norvig Artificial Intelligence: A Modern Approach Prentice Hall
  • —A must check : http://aima.cs.berkeley.edu
  • Some parts of the course is related to Machine Learning, Data Science, Data Mining, Pattern Recognition, Natural Language Processing, Statistics, Logic, Artificial Neural Networks and Fuzzy Logic, so you can read any [text] books about the topics.

—Grading: Programming assignment / Homeworks (30%), —Midterm Exam (20%), Final Exam (50%)

—Midterm and Final Exams (take home for 24 hours)

Course Outline:

  • —Introduction and Agents (chapters 1,2)
  • —Search (chapters 3,4,5,6)
  • —Logic (chapters 7,8,9)
  • —Planning (chapters 11,12)
  • —Uncertainty (chapters 13,14)
  • —Learning (chapters 18,20)
  • —Natural Language Processing (chapter 22,23)

Schedule and Contents (Very Very Very Tentative):

  • Class 1, Jan 30 : Introduction : Course Demonstration Slides, Introduction Slides
  • Class 2, Feb 1: Agents
  • Class 3, Feb 6:  Search
  • Class 4, Feb 8: Introduction to Scheme 1, Search Homework 1 (Due Date: TBA)
  • Class 5, Feb 13: Heuristic Search
  • Class 6, Feb 15:  Scheme Practice 2, Heuristic Homework 2  (Due Date: TBA)
  • Class 7, Feb 20: Constraint Satisfaction Problems
  • Class 8, Feb 22: Scheme Practice 3, CSP Homework 3  (Due Date: TBA)
  • Class 9, Feb 27: Game Playing
  • Class 10, Mar 1: Scheme Practice 4, Game Homework 4  (Due Date: TBA)
  • Class 11, Mar 6: Midterm
  • Class 12, Mar 8: Midterm Solutions
  • Mar 13, 15: No Classes , Spring Recess
  • Class 10, Mar 20:  Logic
  • Class 11, Mar 22: First Order Logic
  • Class 12, Mar 27: Inference in First Order Logic
  • Class 13, Mar 29: Scheme Practice 5, Logic Homework 5  (Due Date: TBA)
  • Class 14, Apr 3: Uncertainity and Fuzzy Logic
  • Class 15, Apr 5: Machine Learning and Problems
  • Class 16, Apr 10: Supervised / Unsupervised Learning and Classification / Clustering Problems, k-nn and k-means
  • Class 17, Apr 12: Naive Bayes, Decision Trees, Rule Based Learning, Error Calculation
  • Class 18, Apr 17: Scheme Practice 6, ML Homework 6  (Due Date: TBA)
  • Class 19, Apr 19: Prediction, Regression and Association Rule Mining
  • Class 20, Apr 24: Artificial Neural Networks
  • Class 21, Apr 26: Natural Language Processing
  • Class 22, May 1: Final Exam
  • Class 23, May 3: Final Exam Solutions

Collaboration Policy: You may freely use internet resources and your course notes in completing assignments and quizzes for this course. You may not consult any person other than the professor when completing quizzes or exams. (Clarifying questions should be directed to the professor.) On assignments you may collaborate with others in the course, so long as you personally prepare the materials submitted under your name, and they accurately reflect your understanding of the topic. Any collaborations should be indicated by a note submitted with the assignment.

Announcements

Please fill the knowledge card attached here, and send it back via email.

CSC102- 01: HOW THE INTERNET WORKS, Smith College, Department of Computer Science, Spring 2017

CSC102- 01: HOW THE INTERNET WORKS 

Classes: Tuesday- Thursday 10.30 – 11.50

Location: Ford Hall 342

Instructor: Dr. Şadi Evren ŞEKER (Office: Ford Hall 252)

Office Hours

  • Tuesday, 13.00 – 15.00
  • Other times by appointment/as available
  • Lunch meetings available by request for small groups

E-Mail: htiw@sadievrenseker.com

Web Site: http://sadievrenseker.com/wp/?page_id=631

Introduction: The Internet has transformed society, opening up communication channels never dreamed of by previous generations. This course introduces students to the structure, design, and operation of the Internet, beginning with the electronic and physical construction of networks and basic network protocols. It addresses personal safety online, how email and Web browsers work, and the design of simple Web pages. Along the way it explores the historical and societal implications of this new medium.

Texts:

Optional / also recommended (on reserve in Young library):

  • How The Internet Works, by Preston Gralla: Contains detailed labeled diagrams of many internet-related topics.
  • Basics of Web Design by Terry Felke-Morris: Contains detailed information on web page design and specific aspects of HTML, aimed at beginners. The more advanced portions of this book will also be useful if you take CSC 105.
  • Web 101, by Wendy Lehnert and Richard Kopec, which was used for this course in previous semesters.

In addition to the texts above, Wikipedia usually contains accurate information focused on specific topics relating to the Internet.

Tentative Course Outline

Class Topic Readings
I2N LWD P&IS HtIW BoWD W101
[PPT] Jan 26: Physics of Networks: SignalsFiber optics Ch. 1-3 ~ ~ Ch.1-2 ~ 1.1-1.4
2

[PPT1]

[PPT2]

Jan 31: History of InternetLANIP Ch. 4-5 ~ ~ Ch 3-4 ~ 1.5-1.6
3

[PPT]

Feb 2: Communications Protocols:  TCPDNS Ch. 6 ~ ~ Ch. 5-6 ~ ~
4

[PPT]

Feb 7: WWW Intro; HTTPURL Ch. 7 Ch. 1-2 ~ Ch. 17-18 Ch. 1 & 4 1.7-1.8
5

[PPT]

Feb 9: HTMLintroduction ~ 4-6 ~ Ch. 19-20 Ch. 2-3 9.1-9.3
[PPT] Feb 14: HTML: tablesrelative URL, etc. ~ 7-8 ~ Ch. 21 Ch. 9 10.1-10.2
[PPT] Feb 16: Color & ImagesForms ~ Ch. 9, 21 ~ Ch. 22 Ch. 6 & 10 9.6, 10.5
[PPT] Feb 21: Style rules; Multimedia ~ 10-13 ~ ~ Ch. 5 & 7 & 11 10.3-10.4
[PPT] Feb 23: EmailSMTPspam ~ ~ Ch. 13 Ch. 11-12 ~ 3.1-3.6
10 [PPT] Feb 28: Personal Safety: cookiesphishing, etc. ~ ~ Ch. 4 & 6 Ch. 44-49 ~ 2.1-2.16
11

[PPT]

Mar 2: Web searchingPage rank ~ ~ Ch. 5 & 8 Ch. 27-28 ~ 5.3-5.4
12

[PPT]

Mar 7: Cryptography;  Security; ~ ~ ~
13

 

Mar 9: Review or Final presentations Final projects/exams due

I2N = Introduction to Networking: How the Internet Works
LWD = Learning Web Design: A Beginner’s Guide to HTML, CSS, JavaScript, and Web Graphics
P&IS = How Personal & Internet Security Work
WtIW = How the Internet Works
BoWD = Basics of Web Design
W101 = Web 101

Grading

Assignment Weight
Homework sets 50%
Project 50%

Collaboration Policy: You may freely use internet resources and your course notes in completing assignments and quizzes for this course. You may not consult any person other than the professor when completing quizzes or exams. (Clarifying questions should be directed to the professor.) On assignments you may collaborate with others in the course, so long as you personally prepare the materials submitted under your name, and they accurately reflect your understanding of the topic. Any collaborations should be indicated by a note submitted with the assignment.

Announcements

Please fill the knowledge card attached here, and send it back via email.