Spaces:
Sleeping
Sleeping
File size: 13,616 Bytes
48e7c56 |
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 |
BSc: Introduction To Artificial Intelligence.s22
================================================
Contents
--------
* [1 Introduction to Artificial Intelligence](#Introduction_to_Artificial_Intelligence)
+ [1.1 Course Characteristics](#Course_Characteristics)
- [1.1.1 Key concepts of the class](#Key_concepts_of_the_class)
- [1.1.2 What is the purpose of this course?](#What_is_the_purpose_of_this_course.3F)
+ [1.2 Course Objectives Based on Bloom’s Taxonomy](#Course_Objectives_Based_on_Bloom.E2.80.99s_Taxonomy)
- [1.2.1 What should a student remember at the end of the course?](#What_should_a_student_remember_at_the_end_of_the_course.3F)
- [1.2.2 What should a student be able to understand at the end of the course?](#What_should_a_student_be_able_to_understand_at_the_end_of_the_course.3F)
- [1.2.3 What should a student be able to apply at the end of the course?](#What_should_a_student_be_able_to_apply_at_the_end_of_the_course.3F)
- [1.2.4 Course evaluation](#Course_evaluation)
- [1.2.5 Grades range](#Grades_range)
- [1.2.6 Resources and reference material](#Resources_and_reference_material)
+ [1.3 Course Sections](#Course_Sections)
- [1.3.1 Section 1](#Section_1)
* [1.3.1.1 Section title:](#Section_title:)
- [1.3.2 Topics covered in this section:](#Topics_covered_in_this_section:)
- [1.3.3 What forms of evaluation were used to test students’ performance in this section?](#What_forms_of_evaluation_were_used_to_test_students.E2.80.99_performance_in_this_section.3F)
- [1.3.4 Typical questions for ongoing performance evaluation within this section](#Typical_questions_for_ongoing_performance_evaluation_within_this_section)
- [1.3.5 Typical questions for seminar classes (labs) within this section](#Typical_questions_for_seminar_classes_.28labs.29_within_this_section)
- [1.3.6 Test questions for final assessment in this section](#Test_questions_for_final_assessment_in_this_section)
- [1.3.7 Section 2](#Section_2)
* [1.3.7.1 Section title:](#Section_title:_2)
- [1.3.8 Topics covered in this section:](#Topics_covered_in_this_section:_2)
- [1.3.9 What forms of evaluation were used to test students’ performance in this section?](#What_forms_of_evaluation_were_used_to_test_students.E2.80.99_performance_in_this_section.3F_2)
- [1.3.10 Typical questions for ongoing performance evaluation within this section](#Typical_questions_for_ongoing_performance_evaluation_within_this_section_2)
- [1.3.11 Typical questions for seminar classes (labs) within this section](#Typical_questions_for_seminar_classes_.28labs.29_within_this_section_2)
- [1.3.12 Test questions for final assessment in this section](#Test_questions_for_final_assessment_in_this_section_2)
- [1.3.13 Section 3](#Section_3)
* [1.3.13.1 Section title:](#Section_title:_3)
* [1.3.13.2 Topics covered in this section:](#Topics_covered_in_this_section:_3)
- [1.3.14 What forms of evaluation were used to test students’ performance in this section?](#What_forms_of_evaluation_were_used_to_test_students.E2.80.99_performance_in_this_section.3F_3)
- [1.3.15 Typical questions for ongoing performance evaluation within this section](#Typical_questions_for_ongoing_performance_evaluation_within_this_section_3)
* [1.3.15.1 Typical questions for seminar classes (labs) within this section](#Typical_questions_for_seminar_classes_.28labs.29_within_this_section_3)
* [1.3.15.2 Test questions for final assessment in this section](#Test_questions_for_final_assessment_in_this_section_3)
Introduction to Artificial Intelligence
=======================================
* **Course name:** Introduction to Artificial Intelligence
* **Course number:** ?????
Course Characteristics
----------------------
### Key concepts of the class
* Artificial Intelligence: Introduction to the ethical use of AI and the framework of development of AI systems
* Artificial Intelligence: Evolutionary Algorithms
### What is the purpose of this course?
Have you ever wondered about how computers decide on what your credit worthiness is, or how they can play chess as good as a world master, or how world class circuits can be built with a minimal number of crossed wires? Perhaps you have wanted to build a human like robot, or have wanted to explore the stars with automated probes. Artificial Intelligence is the field which examines such problems. The goal is to provide a diverse theoretical overview of historical and current thought in the realm of Artificial Intelligence, Computational Intelligence, Robotics and Machine Learning Techniques.
Course Objectives Based on Bloom’s Taxonomy
-------------------------------------------
#### What should a student remember at the end of the course?
By the end of the course, the students should be able to
* Gather an appreciation of the history of AI founders
* Solve simple problems using random, guided, and directed, search methods and be able to compare their abilities to solve the problem using a statistical argument
#### What should a student be able to understand at the end of the course?
* Understand the PEAS model of problem definition
* Understand the Environment Model
* Understand the role of AI within computer science in a variety of fields and applications
#### What should a student be able to apply at the end of the course?
* Apply Evolutionary Algorithms to a number of problems
* Apply the PEAS model of problem definition
* Apply the apply the Environment Model
### Course evaluation
Course grade breakdown
| Type | Points
|
| --- | --- |
| Assignment 1 | 20
|
| Assignment 2 | 20
|
| Lab Participation | 10
|
| Midterm | 25
|
| Final | 25
|
This course has a required class element of practical work on course elements, the retake is not a substitute for practical knowledge, and it is inherently unfair that students who have not submitted these practical elements are graded the same as those who have accomplished course materials. In order to be eligible for the retake, a student is required to have submitted all course assignments, and have a passing grade on those elements. The lacking/failing elements, can be presented for this purpose up to 3 business days before the retake for evaluation. In the case of the resubmission of a failing element, a document should be attached noting which changes have been made to the assignment in order to lead to a passing mark. Lack of these elements in a passing state presented to the committee will be considered a failing grade for the retake.
The retake grade will count as the final course grade, with the first retake giving no more than a B as final grade, and the second retake giving no more than a C. The first retake will be a written exam submitted to the professor, and the second retake as an oral commission.
### Grades range
Course grading range
| | | **Proposed range** |
| --- | --- | --- |
| A. Excellent
| 90-100
| |
| B. Good
| 75-89
| |
| C. Satisfactory
| 60-74
| |
| D. Poor
| 0-59
| |
If necessary, please indicate freely your course’s grading features.
### Resources and reference material
* Russell & Norvig - Artificial Intelligence: A Modern Approach, 3rd Edition
* Ashlock - Evolutionary Computation for Modeling and Optimization
Course Sections
---------------
The main sections of the course and approximate hour distribution between them is as follows:
Course Sections
| **Section** | **Section Title** | **Teaching Hours** |
| --- | --- | --- |
| 1
| History and Philosophy of AI
| 16
|
| 2
| Searching as Optimization
| 16
|
| 3
| Topics in Evolutionary Algorithms
| 16
|
### Section 1
#### Section title:
History and Philosophy of AI
### Topics covered in this section:
* Introduction to the practical applications of AI
* History of Epistemology, particularly on the issue of knowledge creation and intelligence.
* Understanding of the Chinese room and Turing test
* Appreciation for the role of AI in Industries and the the application
* Application of the PEAS model
* Application of the Thinking/Acting Humanly/Rationally
* Appreciation of the Ethical Issues in AI
### What forms of evaluation were used to test students’ performance in this section?
|a|c| & **Yes/No**
Development of individual parts of software product code & 0
Homework and group projects & 1
Midterm evaluation & 1
Testing (written or computer based) & 0
Reports & 0
Essays & 1
Oral polls & 0
Discussions & 1
### Typical questions for ongoing performance evaluation within this section
1. State and apply the PEAS model to a set of problems.
2. State the difference between Plato and Aristotle’s conceptions of knowledge - refer to Socrates definition?
3. Are you intelligent? What marks you as such? What is the definition?
4. Are you creative? What marks you as such? What is the definition?
### Typical questions for seminar classes (labs) within this section
1. Apply the PEAS model as a group to a real world instance.
2. Discuss - Humans in many low skilled tasks are being replaced by automation, what role do practitioners have in protecting its abuse
3. Discuss - Asimov’s laws of robotics are used as a science fiction application of ethics in AI, do you think they have a role in the real world.
4. Discuss - how can we prevent bias from entering into systems.
5. Discuss - What does it mean for a Computer to be Creative?
### Test questions for final assessment in this section
1. Apply the PEAS model to a real world instance.
2. You have a classification problem involving images, from the perspective of Plato and Aristotle on knowledge, which algorithm would they implement, justify your decision.
3. Write a short essay based upon either the prosecution or defense of a trial of an Android who has passed the Turing test who is petitioning the court for human rights. What would be your case for or against using concepts in class such as Turing test, Chinese room, etc.?
### Section 2
#### Section title:
Title 2
### Topics covered in this section:
* Searching Algorithms
* Tree Searches and logic, including basics of PROLOG as a lanuage for answering such problems
* First and Second order logic
### What forms of evaluation were used to test students’ performance in this section?
|a|c| & **Yes/No**
Development of individual parts of software product code & 1
Homework and group projects & 1
Midterm evaluation & 1
Testing (written or computer based) & 1
Reports & 0
Essays & 0
Oral polls & 0
Discussions & 1
### Typical questions for ongoing performance evaluation within this section
1. Apply Prolog to an example of a family tree
2. Apply Prolog to an example of a logic problem
3. Compare and Contrast between two different search algorithms shown in class and implement.
4. Given an example data set which search would you use and why?
### Typical questions for seminar classes (labs) within this section
1. How does Prolog implement a tree?
2. Does this program work - mark out any errors.
3. What is the difference between a red and green cut?
4. What is the result of this Query?
5. What is the time complexity of this algorithm?
### Test questions for final assessment in this section
1. Here is an example family tree. Given a simple Prolog Query - what would be the result?
2. Here is an example logic problem. Given a Prolog Query - what would be the result.
3. Compare and Contrast two different search algorithms in terms of time and space complexity
4. Given data of type X, what search algorithm should you use and why?
### Section 3
#### Section title:
Topics in Evolutionary Algorithms
#### Topics covered in this section:
* Understanding of the four base Evolutionary Algorithms: GA, GP, ES, EP
* Application of one of these four.
* Analysis of the application of these four types to a number of problem instances.
* Application of the appropriate statistical models and scientific method (i.e. Hypothesis testing) to evaluate the EA.
### What forms of evaluation were used to test students’ performance in this section?
|a|c| & **Yes/No**
Development of individual parts of software product code & 1
Homework and group projects & 1
Midterm evaluation & 0
Testing (written or computer based) & 1
Reports & 0
Essays & 0
Oral polls & 0
Discussions & 1
### Typical questions for ongoing performance evaluation within this section
1. Define a particular EA by its data structure
2. Implement an EA, write a Report about the implementation with sufficient search of the parameter space justified by statistical evaluations
3. Analysis of two EA types base upon their representation and variation operators and suitability to a problem space.
4. Produce a new type of EA based upon the concepts seen in class and speculate as to its effectivenesss on a problem via hypothesis testing.
#### Typical questions for seminar classes (labs) within this section
1. Labs within this section are primarily for supporting assistance with the above objectives, e.g. work periods with TA assistance.
#### Test questions for final assessment in this section
1. Show an analysis on a problem instance as to which EA method you would use, justify your answer based on the representation of the problem data.
2. Implement an EA for a problem, show statistical justification of your result.
3. Produce a report about a new creation of an EA system with sufficient justification with hypothesis tests.
|