Foundations of Constraint Processing, CSCE 421/821 Course Administration1 Welcome Course –Foundations of Constraint Processing, CSCE 421/821 Instructor.

Slides:



Advertisements
Similar presentations
CMPT 275 Software Engineering
Advertisements

1 Course Information Parallel Computing Fall 2008.
Foundations of Constraint Processing, Fall 2005 Aug 22, 2005Course Administration1 Welcome Course –Foundations of Constraint Processing, CSCE 421/821 Instructor.
1 Course Information Parallel Computing Spring 2010.
General information CSE 230 : Introduction to Software Engineering
CS 331 / CMPE 334 – Intro to AI CS 531 / CMPE AI Course Outline.
1 CS 425 / CS 625 Software Engineering Fall 2007 Course Syllabus August 27, 2007.
CS101- Lecture 11 CS101 Fall 2004 Course Introduction Professor Douglas Moody –Monday – 12:00-1:40 – – –Web Site: websupport1.citytech.cuny.edu.
CS 232 Geometric Algorithms: Lecture 1 Shang-Hua Teng Department of Computer Science, Boston University.
Need your MyMathLab card with your access code Need a Valid Address Need to know Purdue’s zip code is and your course ID for your Class You.
COMP 110 Introduction to Programming Mr. Joshua Stough August 22, 2007 Monday/Wednesday/Friday 3:00-4:15 Gardner Hall 307.
A Brief Calculus Course
Summer 2009 Math 1431 and Math 1432 begin. What to do… Watch the orientation video from the spring online classes. Please note that the spring classes.
Regina Howard, MBA IT133 - Software Applications.
Introduction to MA Day 1. Name: Charlotte Bailey Office: MATH 802 Office Phone: (765)
Introduction to MA Introduction to Calculus
Course Introduction CS 2302 SPRING Course Introduction In this part we'll discuss course mechanics. Most of this will apply to all sections of the.
Welcome to CS 3260 Dennis A. Fairclough. Overview Course Canvas Web Site Course Materials Lab Assignments Homework Grading Exams Withdrawing from Class.
MGS 351 Introduction to Management Information Systems
Foundations of Constraint Processing, CSCE 421/821 Course Administration1 Welcome Course –Foundations of Constraint Processing, CSCE 421/821 Instructor.
CSE 436 Software Engineering Workshop Course Overview Christopher Gill CSE 436 January 2007 Department of Computer Science and Engineering.
CST 229 Introduction to Grammars Dr. Sherry Yang Room 213 (503)
Introduction to Computer Applications MIS105 Introductory Session Instructor: Irfan Ilyas.
ECEN 301Discussion #1 – Syllabus1 All Sections MWF 1:00 – 1:50 PM 256 CB Lecture: MW Recitation: F Labs: M or Th Instructor: Prof. David Long Office: CB.
Problem Solving with Constraints, CSCE 496/896 Course Administration1 Welcome Course –Problem Solving with Constraints, CSCE 496/896 Instructor –Berthe.
1 Software Systems Development CEN Spring 2011 TR 12:30 PM – 1:45 PM ENB 116 Instructor:Dr. Rollins Turner Dept. of Computer Science and Engineering.
Introduction to Databases Computer Science 557 September 2007 Instructor: Joe Bockhorst University of Wisconsin - Milwaukee.
ICS 6B Boolean Logic and Algebra Fall 2015
Welcome to CS 115! Introduction to Programming. Class URL Write this down!
ICS 6B Boolean Algebra and Logic Winter 2015
CSE 1340 Introduction to Computing Concepts Class 1 ~ Intro.
Foundations of Constraint Processing, CSCE 421/821 Course Administration1 Welcome Course –Foundations of Constraint Processing, CSCE 421/821 Instructor.
Principles of Computer Science I Honors Section Note Set 1 CSE 1341 – H 1.
CS511: Artificial Intelligence II
IST 210: Organization of Data
Basic Concepts & Algorithms in CP, Fall 2009 Aug 31, 2009 Course Administration1 Welcome Course –Independent study on Constraint Processing, CSCE
Welcome to Mrs. Lynch’s Journalism Class! Please sign the attendance sheet on the clipboard next to the door. Feel free to pick up a copy of our paper.
1 Data Structures COP 4530 Spring 2010 MW 4:35 PM – 5:50 PM CHE 101 Instructor:Dr. Rollins Turner Dept. of Computer Science and Engineering ENB
1 CS 4396 Computer Networks Lab General Info. 2 Goal: This course aims at helping students get more insight into how the Internet works and gain hands.
CSE 1340 Introduction to Computing Concepts Class 1 ~ Intro.
Computer Networks CNT5106C
08/29/2006 Introduction INTRODUCTION Instructor: Petru S. Fodor Class webpage: PHYSICS 243H.
IST 210: ORGANIZATION OF DATA Introduction IST210 1.
Foundations of Constraint Processing, Spring 2009 Jan 12, 2009 Course Administration1 Welcome Course –Foundations of Constraint Processing, CSCE 421/821.
Administrative Preliminaries Computer Architecture.
PROBLEM SOLVING AND PROGRAMMING ISMAIL ABUMUHFOUZ | CS 170.
RAIK 283 Data Structures and Algorithms
Computer Network Fundamentals CNT4007C
ICS 6D Discrete Mathematics for Computer Science Fall 2014
Andy Wang Object Oriented Programming in C++ COP 3330
Computer Networks CNT5106C
Theory and Practice of Web Technology
It’s called “wifi”! Source: Somewhere on the Internet!
CS5040: Data Structures and Algorithms
September 27 – Course introductions; Adts; Stacks and Queues
Welcome to CS 1010! Algorithmic Problem Solving.
Course Administration
Computer Networks CNT5106C
Lecture 0 Course Information
Andy Wang Object Oriented Programming in C++ COP 3330
Welcome to CS 1010! Algorithmic Problem Solving.
Welcome by Praveen Guddeti
Course Administration
Lecture 1a- Introduction
Computer Networks CNT5106C
Administrative Issues
Lecture 1a- Introduction
Foundations of Constraint Processing CSCE421/821, Fall 2003
Foundations of Constraint Processing CSCE421/821, Fall 2003
CS 474/674 – Image Processing Fall Prof. Bebis.
Presentation transcript:

Foundations of Constraint Processing, CSCE 421/821 Course Administration1 Welcome Course –Foundations of Constraint Processing, CSCE 421/821 Instructor –Berthe Y. Choueiry (Shu-we-ri), –Class: Mon/Wed/Fri AvH 118 –Recitation: Mon: AvH 118 Volunteer GTA –TBA Attendance sheet –Please check your name

Foundations of Constraint Processing, CSCE 421/821 Course Administration2 Pre-requisites –Contact instructor Track –Undergrads CS: Foundations, AI CE: Applications –Grad CS students: Theory track 3 credit-hours –Research intensive –Students: Committed, motivated, collegial, independent

Foundations of Constraint Processing, CSCE 421/821 Course Administration3 Meetings Regular class –AvH 118, Monday, Wednesday, Friday 3:30—4:20 pm Recitation –Avh 118, Monday, 5:00—5:50 pm, scheduled as necessary –Discuss homework, take quizzes, discuss projects Lectures will be given –By instructor –By visitors TBA –Occasionally, presentations by students

Foundations of Constraint Processing, CSCE 421/821 Course Administration4 Help Office hours –Instructor: Monday, Wednesday: TBA Preferred communication: Piazza Q&A: Send your questions – to –Ask your questions during class, by Share: your ideas and good pointers with class –Send to –Message will be broadcast to the entire class (use sparingly!) –Good pointers will be listed on the web under “Your catch”

Foundations of Constraint Processing, CSCE 421/821 Course Administration5 Expectations I Mastery of pre-requisite's material Effort outside classroom –9 hours of work outside classroom, if you have pre- requisites –If you spend more time, let me know Attendance –Sign-up sheet circulated for attendance –Attendance of lectures (& recitation) is mandatory –Absence: maximum 6 sessions (including recitation) –Prior notification ( ) for absence is mandatory

Foundations of Constraint Processing, CSCE 421/821 Course Administration6 Expectations 2 Collaboration policy –Do discuss everything with others –But do it on your own –Always acknowledge sources & help received –Wiki page is set up for exchanging information Prompt response to notifications –Sent to your address at CSE (you must have one) –Posted on web: cse.unl.edu/~cse421 cse.unl.edu/~choueiry/F / If you drop the class, let me know ASAP

Foundations of Constraint Processing, CSCE 421/821 Course Administration7 Grading Pretest: 2% Quizzes: 28%, cannot not be made up Assignments: 40% –Programming and pen+paper –Turned-in on due date, before lecture –Delay penality: 20% per day, starting first minute after deadline –You may use any programming language acceptable to GTA’s Project: 30% –Individual (preferred) or in small teams (if really necessary) (  mid-term)  (  final) Feedback: –Glossaries and HWK will be graded –Grades will be posted on Blackboard –Need more feedback? Please, let us know how

Foundations of Constraint Processing, CSCE 421/821 Course Administration8 Projects A list of possible projects is forthcoming, will include –Implement the game of Clue –Implement and evaluate an algorithm –Model and solve a (simple) practical problem –Investigate an advanced theoretical concept –Conduct a critical literature survey (at least 3 papers), etc. Alternatives –Propose your own project and discuss it with instructor At the end of project, you must submit with handin: –Project report: -report.ext –Slides: -defense.ext –Code: -code.tar

Foundations of Constraint Processing, CSCE 421/821 Course Administration9 Improving your grades * Do the glossaries: weekly & final (8% total) –Must be typewritten, alphabetically sorted –Goal: entice you to do required reading Collect bonus points –100% attendance –Find bugs in slides, in lectures –Fill the course end of course –Be vocal in class, solve “riddles”, etc. Do extra work –Present a research paper (10% per presentation) –Write a critical summary of a research paper (5% per summary) –Write a chapter of a “textbook” (20% total) * Restrictions apply (deadlines, max number per student)

Foundations of Constraint Processing, CSCE 421/821 Course Administration10 Important dates Regularly check schedule on the web (3 times/week) Fri, Aug 24 –Pretest over 235 material Mon/Wed/Fri Oct 8—12: Instructor out of town Fri, Oct 19 –Project must be chosen, use handin Fri, Nov 9 –Progress report on projects due, use handin Fri, Nov 16 –First deadline for extra-credit work: 1 presentation, 2 summaries, 1 chapter write-up must be done by this date Fri, Nov 30 –Final glossary due –Project reports due in print and using handin –Second deadline for extra-credit work: All paper presentations (Max 2), summaries (Max 4), chapter write-up (Max 2) must be done by this date

Foundations of Constraint Processing, CSCE 421/821 Important Dates (cont.) Regularly check schedule on the web (2, 3 times/week) Mon/Wed/Fri, Nov 26/28/30 – Quizzes may be given during class or recitation Fri, Nov 30 –Deadline for final glossary, in print and using handin –Project reports are due, in print and using handin Mon/Wed/Fri, Dec 3/5/7 (dead week) & Wed Dec 12 (7:30—9:30) –Project presentations –Some presentations could be scheduled in evenings if necessary Fri, Dec 7 (midnight) –Projects code & defense slides (when applicable) due, use handin Course Administration11

Foundations of Constraint Processing, CSCE 421/821 Course Administration12 Course material Content of the course –Introduction: definition and practical examples –Foundations and basic mechanisms –Advanced solving techniques –Extensions to the problem definition –Alternative approaches to solving the problem Course support –New textbook by Dechter (available at bookstore). Will not be followed linearly, but should be used for reference. –Book by Tsang (on reserve at LL, available on-line, out of print) –Constraint Networks, ebook by –Papers from: WWW, course web-page, library, electronic reserves, instructor, etc.

Foundations of Constraint Processing, CSCE 421/821 Course Administration13 More resources Web –Check links: –Benchmark problems –Association for Constraint Programming Conferences –CP, AIOR, IJCAI, ECAI, NCAI (AAAI), FLAIRS... –Workshops in parallel to conferences Journals: –Constraints, AIJ, JACM, Annals of AI+Math, etc.

Foundations of Constraint Processing, CSCE 421/821 Course Administration14 Your future: Jobs!! Commercial companies: Ilog, i2 Technologies, Trilogy, PeopleSoft/Red Pepper, Carmen Systems (Sweden), etc. Prestigious research centers: NASA Ames, Microsoft Research (Cambridget), PARC, JPL, SRI International, BT Labs (UK), Ilog (IBM?), etc. Start your own: Selectica, Seibel, Parc Technologies Ltd, In Time Systems Inc, Blue Pumpkin, etc. Academic: –Constraint languages –Modeling, constraint representation, reasoning & propagation mechanisms –Dedicated reasoning: diagnosis, planning & scheduling, design, configuration, Case-Based Reasoning, etc.