Foundations of Constraint Processing, Spring 2009 Jan 12, 2009 Course Administration1 Welcome Course –Foundations of Constraint Processing, CSCE 421/821.

Slides:



Advertisements
Similar presentations
Bienvenidos Sandtown Middle School.
Advertisements

CS 46101–600/CS Design and Analysis of Algorithms Dr. Angela Guercio Spring 2010.
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.
Welcome to MAT 170 MWF 9:40 SLN Basic Course Information Instructor Office Office Hours Beth Jones PSA 725 9:15 am – 10: 15 am Tuesday and Thursday.
CS 331 / CMPE 334 – Intro to AI CS 531 / CMPE AI Course Outline.
1 CS 426 / CPE 426 Senior Projects Spring 2009 Course Syllabus January 20, 2009.
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.
Course Syllabus January 24, 2012 CS 426/CPE 426 Senior Projects in Computer Science/Computer Engineering University of Nevada, Reno Department of Computer.
1 CS 426 Senior Projects Spring 2006 Course Syllabus January 24, 2006.
Dr. Tatiana Erukhimova [year] Overview of Today’s Class Folders Syllabus and Course requirements Tricks to survive Mechanics Review and Coulomb’s Law.
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.
COP4020/CGS5426 Programming languages Syllabus. Instructor Xin Yuan Office: 168 LOV Office hours: T, H 10:00am – 11:30am Class website:
CHEMISTRY 10123/10125 Spring 2007 Instructor: Professor Tracy Hanna Phone: Office: SWR 418
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)
MIS 300: Introduction to Management Information Systems Yong Choi School of Business Administration CSU, Bakersfield.
Problem Solving with Constraints, CSCE 496/896 Course Administration1 Welcome Course –Problem Solving with Constraints, CSCE 496/896 Instructor –Berthe.
Syllabus Dr. Karin Dyke January 11, Welcome Back! Welcome to Learning Disabilities! This is an important class for educators. Here are some facts;
Welcome to CS 115! Introduction to Programming. Class URL Write this down!
Principles of Financial Accounting I Fall Semester 2007 Orientation Welcome – We are glad you are here! Let’s look at the syllabus for this course.
Introduction to Data Structures
1 WELCOME TO COMPUTER SCIENCE 1027b COMPUTER SCIENCE FUNDAMENTALS II Lecturers: Eric Schost (001) John Barron (002)
PHY 1405 Conceptual Physics (CP 1) Spring 2010 Cypress Campus.
ICS 6B Boolean Algebra and Logic Winter 2015
CSE 1340 Introduction to Computing Concepts Class 1 ~ Intro.
1 CS 426 / CPE 426 Senior Projects Spring 2011 Course Syllabus January 19, 2011.
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.
CSCE 496/896 Self-Managing Computer Systems Ying Lu 106 Schorr Center
CS511: Artificial Intelligence II
Foundations of Constraint Processing, CSCE 421/821 Course Administration1 Welcome Course –Foundations of Constraint Processing, CSCE 421/821 Instructor.
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 CS 101 Today’s class will begin about 5 minutes late We will discuss the lab scheduling problems once class starts.
CS Introduction to Computer Science Spring 2011 Dr. Angela Guercio (
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 426 / CPE 426 Senior Projects Spring 2007 Course Syllabus January 23, 2007.
CS112: Course Overview George Mason University. Today’s topics Go over the syllabus Go over resources – Marmoset – Blackboard – Piazza – Textbook Highlight.
CSE 1340 Introduction to Computing Concepts Class 1 ~ Intro.
08/29/2006 Introduction INTRODUCTION Instructor: Petru S. Fodor Class webpage: PHYSICS 243H.
CSCE 990 Advanced Distributed Systems Seminar Ying Lu 104 Schorr Center
IST 210: ORGANIZATION OF DATA Introduction IST210 1.
Administrative Preliminaries Computer Architecture.
PROBLEM SOLVING AND PROGRAMMING ISMAIL ABUMUHFOUZ | CS 170.
Computer Science I ISMAIL ABUMUHFOUZ | CS 180. CS 180 Description BRIEF SUMMARY: This course covers a study of the algorithmic approach and the object.
Welcome to MT140 Introduction to Management Unit 1 Seminar – Introduction to Management.
Andy Wang Object Oriented Programming in C++ COP 3330
CS5040: Data Structures and Algorithms
September 27 – Course introductions; Adts; Stacks and Queues
Welcome to CS 1010! Algorithmic Problem Solving.
Course Administration
Andy Wang Object Oriented Programming in C++ COP 3330
Welcome to CS 1010! Algorithmic Problem Solving.
Welcome by Praveen Guddeti
Course Administration
Computer Networks CNT5106C
Lecture 1a- Introduction
Foundations of Constraint Processing CSCE421/821, Fall 2003
Foundations of Constraint Processing CSCE421/821, Fall 2003
Presentation transcript:

Foundations of Constraint Processing, Spring 2009 Jan 12, 2009 Course Administration1 Welcome Course –Foundations of Constraint Processing, CSCE 421/821 Instructor –Berthe Y. Choueiry (Shu-we-ri), –Office: AVH 360 –Tel: +1(402) GTA –Shant Karakashian. Office 123D –Office hours: TBA List of names –Please check your name, address, and program of study

Foundations of Constraint Processing, Spring 2009 Jan 12, 2009 Course Administration2 Pre-requisites –CSCE 235 (CSCE 310, 476/876 relaxed) –If you have any concerns, contact instructor Track –uGrad CS: Foundations, AI –Grad CS students: theory track 3 credit-hours

Foundations of Constraint Processing, Spring 2009 Jan 12, 2009 Course Administration3 Meetings Regular class –Monday, Wednesday, Friday: 12:30—1:30 –Friday, March 13, instructor not available Recitation –Wednesday 5:00—5:50 p.m. –Discuss homework, take quizzes, discuss projects Lectures will be given –By instructor –By visitors Professor Rina Dechter, on April 2 nd (1 st or 3 rd ?) Dr. Ben Thengval from Optec Systems Omaha, TBD –Occasionally, presentations by students

Foundations of Constraint Processing, Spring 2009 Jan 12, 2009 Course Administration4 Help Office hours –Instructor: Monday, Wednesday 1:30 p.m.—2:30 p.m. Q&A: Send your questions – to (will be set up –Ask your questions during Wednesday’s make-up class Share: your ideas and good pointers with class –Send to –Message will be broadcast to the entire class (use sparinglyl!) –Good pointers will be listed on the web under “Your catch”

Foundations of Constraint Processing, Spring 2009 Jan 12, 2009 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 and recitation is mandatory –Absence: maximum 6 sessions (including recitation) –Prior notification ( ) for absence is mandatory

Foundations of Constraint Processing, Spring 2009 Jan 12, 2009 Course Administration6 Expectations 2 Collaboration policy –Feel free to discuss it 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/~choueiry/S / If you drop the class, let me know ASAP

Foundations of Constraint Processing, Spring 2009 Jan 12, 2009 Course Administration7 Grading Pretest: 3% Quizzes: 37%, cannot not be made up Assignments: 25% –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 Project: 35% –Individual (preferred) or in small teams (if really necessary) (  mid-term)  (  final) Feedback: –Glossaries and HWK will be rotated for grading, supervised by instructor –Grades will be posted on Blackboard –Need more feedback? Please, let us know how

Foundations of Constraint Processing, Spring 2009 Jan 12, 2009 Course Administration8 Projects A list of possible projects is forthcoming, will include –Search competition for solving the GTA assignment problem –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, Spring 2009 Jan 12, 2009 Course Administration9 Improving your grades * Do the glossaries: weekly & final (8% total) –Must be typewritten, and alphabetically sorted –Goal: entice you to do required reading Collect bonus points –100% attendance, –Find bugs in slides, in lectures, –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, Spring 2009 Jan 12, 2009 Course Administration10 Important dates Regularly check schedule on the web (3 times/week) Friday, Feb 27 –Project must be chosen, use handin Friday, Mar 27 –Progress report on projects due, use handin Friday, Apr 10 –First deadline for extra-credit work: 1 presentation, 2 summaries, 1 chapter write-up must be done by this date Friday, Apr 24 –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, Spring 2009 Jan 12, 2009 Important Dates (cont.) Regularly check schedule on the web (3 times/week) Mon/Wed/Fri, Apr 20/22/24 – Quizzes may be given during class or recitation Fri, April 25 –Deadline for final glossary, in print and using handin –Project reports are due, in print and using handin Mon/Wed/Fri, Apr 27/29/ May 1 (dead week) –Project presentations –Some presentations could be scheduled in evenings if necessary Fri, May 1 (midnight) –Projects code & defense slides (when applicable) due, use handin Course Administration11

Foundations of Constraint Processing, Spring 2009 Jan 12, 2009 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) –Papers from: WWW, course web-page, library, electronic reserves, instructor, etc.

Foundations of Constraint Processing, Spring 2009 Jan 12, 2009 Course Administration13 More resources Web –Check links: –Benchmark problems: –eLists: comp.constraints –CP Online: 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, Spring 2009 Jan 12, 2009 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.